263   reductions *reds = s->reductions;  in resolve_sr_conflict()  local
265   rule *redrule = reds->rules[ruleno];  in resolve_sr_conflict()
267   bitset lookahead_tokens = reds->lookahead_tokens[ruleno];  in resolve_sr_conflict()
332   reductions *reds = s->reductions;  in set_conflicts()  local
346   for (i = 0; i < reds->num; ++i)  in set_conflicts()
347     if (reds->rules[i]->prec && reds->rules[i]->prec->prec  in set_conflicts()
348 	&& !bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set))  in set_conflicts()
370   for (i = 0; i < reds->num; ++i)  in set_conflicts()
372       if (!bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set))  in set_conflicts()
374       bitset_or (lookahead_set, lookahead_set, reds->lookahead_tokens[i]);  in set_conflicts()
432   reductions *reds = s->reductions;  in count_sr_conflicts()  local
443   for (i = 0; i < reds->num; ++i)  in count_sr_conflicts()
444     bitset_or (lookahead_set, lookahead_set, reds->lookahead_tokens[i]);  in count_sr_conflicts()
465   reductions *reds = s->reductions;  in count_rr_conflicts()  local
472       for (j = 0; j < reds->num; ++j)  in count_rr_conflicts()
473 	if (bitset_test (reds->lookahead_tokens[j], i))  in count_rr_conflicts()