Home
last modified time | relevance | path

Searched refs:reds (Results 1 – 10 of 10) sorted by relevance

/external/bison/src/
Dconflicts.c186 reductions *reds = s->reductions; in resolve_sr_conflict() local
188 rule *redrule = reds->rules[ruleno]; in resolve_sr_conflict()
190 bitset look_ahead_tokens = reds->look_ahead_tokens[ruleno]; in resolve_sr_conflict()
269 reductions *reds = s->reductions; in set_conflicts() local
282 for (i = 0; i < reds->num; ++i) in set_conflicts()
283 if (reds->rules[i]->prec && reds->rules[i]->prec->prec in set_conflicts()
284 && !bitset_disjoint_p (reds->look_ahead_tokens[i], look_ahead_set)) in set_conflicts()
289 for (i = 0; i < reds->num; ++i) in set_conflicts()
291 if (!bitset_disjoint_p (reds->look_ahead_tokens[i], look_ahead_set)) in set_conflicts()
294 bitset_or (look_ahead_set, look_ahead_set, reds->look_ahead_tokens[i]); in set_conflicts()
[all …]
Dstate.c103 reductions_new (int num, rule **reds) in reductions_new() argument
105 size_t rules_size = num * sizeof *reds; in reductions_new()
109 memcpy (res->rules, reds, rules_size); in reductions_new()
189 state_reductions_set (state *s, int num, rule **reds) in state_reductions_set() argument
192 s->reductions = reductions_new (num, reds); in state_reductions_set()
200 reductions *reds = s->reductions; in state_reduction_find() local
201 for (i = 0; i < reds->num; ++i) in state_reduction_find()
202 if (reds->rules[i] == r) in state_reduction_find()
230 reductions *reds = s->reductions; in state_rule_look_ahead_tokens_print() local
234 if (reds->look_ahead_tokens && red != -1) in state_rule_look_ahead_tokens_print()
[all …]
Dprint.c216 reductions *reds = s->reductions; in state_default_rule() local
223 return reds->rules[0]; in state_default_rule()
249 for (i = 0; i < reds->num; ++i) in state_default_rule()
255 bitset_andn (look_ahead_set, reds->look_ahead_tokens[i], shift_set); in state_default_rule()
261 default_rule = reds->rules[i]; in state_default_rule()
267 bitset_or (shift_set, shift_set, reds->look_ahead_tokens[i]); in state_default_rule()
309 reductions *reds = s->reductions; in print_reductions() local
314 if (reds->num == 0) in print_reductions()
327 if (reds->look_ahead_tokens) in print_reductions()
332 for (j = 0; j < reds->num; ++j) in print_reductions()
[all …]
Dtables.c188 reductions *reds = s->reductions; in conflict_row() local
200 for (i = 0; i < reds->num; i += 1) in conflict_row()
201 if (bitset_test (reds->look_ahead_tokens[i], j) in conflict_row()
203 != rule_number_as_item_number (reds->rules[i]->number))) in conflict_row()
206 conflict_list[conflict_list_cnt] = reds->rules[i]->number + 1; in conflict_row()
245 reductions *reds = s->reductions; in action_row() local
255 if (reds->look_ahead_tokens) in action_row()
262 for (i = reds->num - 1; i >= 0; --i) in action_row()
265 BITSET_FOR_EACH (biter, reds->look_ahead_tokens[i], j, 0) in action_row()
274 actrow[j] = rule_number_as_item_number (reds->rules[i]->number); in action_row()
[all …]
Dprint_graph.c95 reductions *reds = s->reductions; in print_core() local
99 if (reds->look_ahead_tokens && redno != -1) in print_core()
105 BITSET_FOR_EACH (biter, reds->look_ahead_tokens[redno], k, 0) in print_core()
128 reductions *reds = s->reductions; in print_actions() local
133 if (!trans->num && !reds) in print_actions()
Dlalr.c417 reductions *reds = states[i]->reductions; in look_ahead_tokens_print() local
421 if (reds->look_ahead_tokens) in look_ahead_tokens_print()
422 for (k = 0; k < reds->num; ++k) in look_ahead_tokens_print()
423 if (reds->look_ahead_tokens[k]) in look_ahead_tokens_print()
429 if (reds->look_ahead_tokens) in look_ahead_tokens_print()
430 for (j = 0; j < reds->num; ++j) in look_ahead_tokens_print()
431 BITSET_FOR_EACH (iter, reds->look_ahead_tokens[j], k, 0) in look_ahead_tokens_print()
435 reds->rules[j]->number); in look_ahead_tokens_print()
Dstate.h230 void state_reductions_set (state *s, int num, rule **reds);
/external/qemu/distrib/sdl-1.2.12/src/hermes/
Dx86p_16.asm438 mov eax,ebx ; setup eax for reds
441 and eax,11100000111000001110000011100000b ; reds
/external/blktrace/btt/doc/
Dbtt.tex589 out. And then one can make the broad generalization of higher reds,
/external/webkit/PerformanceTests/Parser/resources/
Dfinal-url-en14749 http://reds.enquirer.com/2001/01/21/red_reds_have_to_draw.html
32338 http://www.cincinnati.com/reds/peterose.html