| /external/bison/src/ |
| D | conflicts.c | 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()
[all …]
|
| D | state.c | 101 reductions_new (int num, rule **reds) in reductions_new() argument
103 size_t rules_size = num * sizeof *reds; in reductions_new()
107 memcpy (res->rules, reds, rules_size); in reductions_new()
215 state_reductions_set (state *s, int num, rule **reds) in state_reductions_set() argument
218 s->reductions = reductions_new (num, reds); in state_reductions_set()
226 reductions *reds = s->reductions; in state_reduction_find() local
227 for (i = 0; i < reds->num; ++i) in state_reduction_find()
228 if (reds->rules[i] == r) in state_reduction_find()
256 reductions *reds = s->reductions; in state_rule_lookahead_tokens_print() local
260 if (reds->lookahead_tokens && red != -1) in state_rule_lookahead_tokens_print()
[all …]
|
| D | print.c | 243 reductions *reds = s->reductions; in print_reductions() local
249 if (reds->num == 0) in print_reductions()
266 if (reds->lookahead_tokens) in print_reductions()
271 for (j = 0; j < reds->num; ++j) in print_reductions()
272 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
276 if (reds->rules[j] != default_reduction) in print_reductions()
295 if (reds->lookahead_tokens) in print_reductions()
303 for (j = 0; j < reds->num; ++j) in print_reductions()
304 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
308 if (reds->rules[j] != default_reduction) in print_reductions()
[all …]
|
| D | print-xml.c | 92 reductions *reds = s->reductions; in print_core() local
95 if (reds->lookahead_tokens && red != -1) in print_core()
243 reductions *reds = s->reductions; in print_reductions() local
248 if (reds->num == 0) in print_reductions()
267 if (reds->lookahead_tokens) in print_reductions()
272 for (j = 0; j < reds->num; ++j) in print_reductions()
273 if (bitset_test (reds->lookahead_tokens[j], i)) in print_reductions()
277 if (reds->rules[j] != default_reduction) in print_reductions()
297 if (reds->lookahead_tokens) in print_reductions()
303 for (j = 0; j < reds->num; ++j) in print_reductions()
[all …]
|
| D | graphviz.c | 156 output_red (state const *s, reductions const *reds, FILE *fout) in output_red() argument
173 for (j = 0; j < reds->num; ++j) in output_red()
178 rule_number ruleno = reds->rules[j]->number; in output_red()
186 if (default_reduction && default_reduction == reds->rules[j]) in output_red()
188 if (reds->lookahead_tokens) in output_red()
192 if (bitset_test (reds->lookahead_tokens[j], i)) in output_red()
|
| D | tables.c | 186 reductions *reds = s->reductions; in conflict_row() local
198 for (i = 0; i < reds->num; i += 1) in conflict_row()
199 if (bitset_test (reds->lookahead_tokens[i], j) in conflict_row()
201 != rule_number_as_item_number (reds->rules[i]->number))) in conflict_row()
204 conflict_list[conflict_list_cnt] = reds->rules[i]->number + 1; in conflict_row()
243 reductions *reds = s->reductions; in action_row() local
253 if (reds->lookahead_tokens) in action_row()
260 for (i = reds->num - 1; i >= 0; --i) in action_row()
263 BITSET_FOR_EACH (biter, reds->lookahead_tokens[i], j, 0) in action_row()
272 actrow[j] = rule_number_as_item_number (reds->rules[i]->number); in action_row()
[all …]
|
| D | lalr.c | 420 reductions *reds = states[i]->reductions; in lookahead_tokens_print() local
424 if (reds->lookahead_tokens) in lookahead_tokens_print()
425 for (k = 0; k < reds->num; ++k) in lookahead_tokens_print()
426 if (reds->lookahead_tokens[k]) in lookahead_tokens_print()
432 if (reds->lookahead_tokens) in lookahead_tokens_print()
433 for (j = 0; j < reds->num; ++j) in lookahead_tokens_print()
434 BITSET_FOR_EACH (iter, reds->lookahead_tokens[j], k, 0) in lookahead_tokens_print()
438 reds->rules[j]->number); in lookahead_tokens_print()
|
| D | print_graph.c | 110 reductions *reds = s->reductions; in print_core() local
114 if (reds->lookahead_tokens && redno != -1) in print_core()
120 BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0) in print_core()
|
| D | AnnotationList.c | 166 reductions *reds) in AnnotationList__compute_conflicted_tokens() argument
174 for (i = 0; i < reds->num; ++i) in AnnotationList__compute_conflicted_tokens()
176 bitset_and (conflicted_tokens_rule, tokens, reds->lookahead_tokens[i]); in AnnotationList__compute_conflicted_tokens()
179 bitset_or (tokens, tokens, reds->lookahead_tokens[i]); in AnnotationList__compute_conflicted_tokens()
182 aver (i == 0 || reds->rules[i-1] < reds->rules[i]); in AnnotationList__compute_conflicted_tokens()
|
| D | graphviz.h | 57 void output_red (state const *s, reductions const *reds, FILE *fout);
|
| D | state.h | 238 void state_reductions_set (state *s, int num, rule **reds);
|
| /external/blktrace/btt/doc/ |
| D | btt.tex | 589 out. And then one can make the broad generalization of higher reds,
|