Lines Matching refs:top
2085 struct choice_entry *top;
2090 top = choice_stack;
2091 top->rest = cached_first_cycle_multipass_dfa_lookahead;
2092 top->n = 0;
2101 if (top->rest == 0 || i >= n_ready)
2103 if (top == choice_stack)
2105 if (best < top - choice_stack && ready_try [0])
2107 best = top - choice_stack;
2109 points = top->n;
2110 if (top->n == max_points || best == all)
2113 i = top->index;
2115 top--;
2116 memcpy (curr_state, top->state, dfa_state_size);
2128 top->rest = 0;
2130 top->rest--;
2131 n = top->n;
2132 if (memcmp (top->state, curr_state, dfa_state_size) != 0)
2134 top++;
2135 top->rest = cached_first_cycle_multipass_dfa_lookahead;
2136 top->index = i;
2137 top->n = n;
2138 memcpy (top->state, curr_state, dfa_state_size);
2145 while (top != choice_stack)
2147 ready_try [top->index] = 0;
2148 top--;