77     for (sp = first_state; sp; sp = sp->next)  in set_state_table()
78 	state_table[sp->number] = sp;  in set_state_table()
87     for (sp = first_state; sp; sp = sp->next)  in set_accessing_symbol()
88 	accessing_symbol[sp->number] = sp->accessing_symbol;  in set_accessing_symbol()
97     for (sp = first_shift; sp; sp = sp->next)  in set_shift_table()
98 	shift_table[sp->number] = sp;  in set_shift_table()
107     for (rp = first_reduction; rp; rp = rp->next)  in set_reduction_table()
108 	reduction_table[rp->number] = rp;  in set_reduction_table()
153 	    k += rp->nreds;  in initialize_LA()
167 	    for (j = 0; j < rp->nreds; j++)  in initialize_LA()
169 		LAruleno[k] = rp->rules[j];  in initialize_LA()
190     goto_map = goto_base - ntokens;  in set_goto_map()
191     temp_map = temp_base - ntokens;  in set_goto_map()
194     for (sp = first_shift; sp; sp = sp->next)  in set_goto_map()
196 	for (i = sp->nshifts - 1; i >= 0; i--)  in set_goto_map()
198 	    symbol = accessing_symbol[sp->shift[i]];  in set_goto_map()
227     for (sp = first_shift; sp; sp = sp->next)  in set_goto_map()
229 	Value_t state1 = sp->number;  in set_goto_map()
231 	for (i = sp->nshifts - 1; i >= 0; i--)  in set_goto_map()
233 	    state2 = sp->shift[i];  in set_goto_map()
253     int low = goto_map[symbol];  in map_goto()  local
261 	assert(low <= high);  in map_goto()
262 	middle = (low + high) >> 1;  in map_goto()
267 	    low = middle + 1;  in map_goto()
269 	    high = middle - 1;  in map_goto()
280     Value_t *edge;  in initialize_F()  local
292     edge = NEW2(ngotos + 1, Value_t);  in initialize_F()
304 	    k = sp->nshifts;  in initialize_F()
308 		symbol = accessing_symbol[sp->shift[j]];  in initialize_F()
316 		symbol = accessing_symbol[sp->shift[j]];  in initialize_F()
318 		    edge[nedges++] = map_goto(stateno, symbol);  in initialize_F()
326 		    rp[j] = edge[j];  in initialize_F()
328 		rp[nedges] = -1;  in initialize_F()
346     FREE(edge);  in initialize_F()
363     Value_t *edge;  in build_relations()  local
368     edge = NEW2(ngotos + 1, Value_t);  in build_relations()
387 		k = sp->nshifts;  in build_relations()
391 		    stateno = sp->shift[j];  in build_relations()
401 	    length--;  in build_relations()
406 		rp--;  in build_relations()
409 		    stateno = states[--length];  in build_relations()
410 		    edge[nedges++] = map_goto(stateno, *rp);  in build_relations()
421 		shortp[j] = edge[j];  in build_relations()
422 	    shortp[nedges] = -1;  in build_relations()
436     FREE(edge);  in build_relations()
460     sp->next = lookback[i];  in add_lookback_edge()
461     sp->value = (Value_t)gotono;  in add_lookback_edge()
498 	    sp[k] = -1;  in transpose()
538 	for (sp = lookback[i]; sp; sp = sp->next)  in compute_lookaheads()
541 	    fp2 = F + tokensetsize * sp->value;  in compute_lookaheads()
551 	    next = sp->next;  in compute_lookaheads()
625 	    j = VERTICES[top--];  in traverse()