Home
last modified time | relevance | path

Searched refs:bitset_test (Results 1 – 17 of 17) sorted by relevance

/external/bison/src/
Dreduce.c75 if (ISVAR (*rhsp) && !bitset_test (N0, *rhsp - ntokens)) in useful_production()
117 if (!bitset_test (P, r) in useless_nonterminals()
166 if (bitset_test (N, accept->number - ntokens)) in inaccessable_symbols()
176 if (!bitset_test (Pp, r) in inaccessable_symbols()
177 && bitset_test (P, r) in inaccessable_symbols()
178 && bitset_test (V, rules[r].lhs->number)) in inaccessable_symbols()
182 if (ISTOKEN (*rhsp) || bitset_test (N, *rhsp - ntokens)) in inaccessable_symbols()
213 if (bitset_test (V, i)) in inaccessable_symbols()
240 rules[r].useful = bitset_test (P, r); in reduce_grammar_tables()
296 if (bitset_test (V, i)) in nonterminals_reduce()
[all …]
DAnnotationList.c203 if (bitset_test (always_follows[lhs_goto], conflicted_token)) in AnnotationList__compute_lhs_contributions()
449 if (bitset_test (s->reductions->lookahead_tokens[rule_i], in AnnotationList__compute_from_inadequacies()
452 if (bitset_test (shift_tokens, conflicted_token)) in AnnotationList__compute_from_inadequacies()
468 if (bitset_test (s->reductions->lookahead_tokens[rule_i], in AnnotationList__compute_from_inadequacies()
521 if (bitset_test (shift_tokens, conflicted_token)) in AnnotationList__compute_from_inadequacies()
551 aver (!bitset_test (shift_tokens, conflicted_token) in AnnotationList__compute_from_inadequacies()
686 if (lookaheads[item] && bitset_test (lookaheads[item], token)) in AnnotationList__stateMakesContribution()
Dprint-xml.c270 bool count = bitset_test (no_reduce_set, i); in print_reductions()
273 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
301 bool count = bitset_test (no_reduce_set, i); in print_reductions()
304 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
Dprint.c269 bool count = bitset_test (no_reduce_set, i); in print_reductions()
272 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
299 bool count = bitset_test (no_reduce_set, i); in print_reductions()
304 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
Dgraphviz.c192 if (bitset_test (reds->lookahead_tokens[j], i)) in output_red()
194 if (bitset_test (no_reduce_set, i)) in output_red()
Dconflicts.c270 if (bitset_test (lookahead_tokens, i) in resolve_sr_conflict()
271 && bitset_test (lookahead_set, i) in resolve_sr_conflict()
473 if (bitset_test (reds->lookahead_tokens[j], i)) in count_rr_conflicts()
DInadequacyList.c59 if (!bitset_test (self->inadequacy.conflict.actions, in InadequacyList__getShiftContributionIndex()
Dstate.c413 if (bitset_test (reachable, s->number)) in state_record_reachable_states()
434 if (bitset_test (reachable, states[i]->number)) in state_remove_unreachable_states()
Dielr.c135 if (bitset_test (ritem_sees_lookahead_set, in ielr_compute_internal_follow_edges()
141 if (i != source && !bitset_test (sources, source)) in ielr_compute_internal_follow_edges()
221 && bitset_test (ritem_sees_lookahead_set, items[j])) in ielr_compute_follow_kernel_items()
464 return bitset_test (item_lookahead_sets[s->number][item], lookahead); in ielr_item_has_lookahead()
Dclosure.c169 if (bitset_test (FIRSTS (i), j - ntokens)) in set_fderives()
Dtables.c199 if (bitset_test (reds->lookahead_tokens[i], j) in conflict_row()
/external/bison/lib/
Dbitsetv-print.c59 fputs (bitset_test (bset[i], j) ? "1" : " ", out); in bitsetv_matrix_dump()
Dbitsetv.c118 if (bitset_test (bsetv[j], i)) in bitsetv_transitive_closure()
Dbitset.c342 if (bitset_test (bset, bitno)) in bitset_toggle_()
Dbitset.h164 bitset_test (bitset bset, bitset_bindex bitno) in bitset_test() function
/external/bison/po/
Dit.po944 msgstr "%u bitset_test, %u in cache (%.2f%%)\n"
/external/bison/
DChangeLog-201212969 * lib/bitset.h (bitset_test, bitset_only_set_p): Likewise.
14638 (bitset_set, bitset_reset, bitset_test): Rename local vars
15496 * lib/bitset.h (bitset_set, bitset_reset, bitset_test): Likewise.
16135 (bitset_test): Now returns int, not unsigned long.