| /external/bison/src/ |
| H A D | graphviz.h | 54 * \param reds the set of reductions
57 void output_red (state const *s, reductions const *reds, FILE *fout);
|
| H A D | state.c | 101 reductions_new (int num, rule **reds) argument
103 size_t rules_size = num * sizeof *reds;
107 memcpy (res->rules, reds, rules_size);
215 state_reductions_set (state *s, int num, rule **reds) argument
218 s->reductions = reductions_new (num, reds);
226 reductions *reds = s->reductions; local
227 for (i = 0; i < reds->num; ++i)
228 if (reds->rules[i] == r)
256 reductions *reds = s->reductions; local
260 if (reds
280 reductions *reds = s->reductions; local
[all...] |
| H A D | conflicts.c | 264 reductions *reds = s->reductions;
266 rule *redrule = reds->rules[ruleno];
268 bitset lookahead_tokens = reds->lookahead_tokens[ruleno];
333 reductions *reds = s->reductions;
347 for (i = 0; i < reds->num; ++i)
348 if (reds->rules[i]->prec && reds->rules[i]->prec->prec
349 && !bitset_disjoint_p (reds->lookahead_tokens[i], lookahead_set))
371 for (i = 0; i < reds->num; ++i)
373 if (!bitset_disjoint_p (reds
263 reductions *reds = s->reductions; local
332 reductions *reds = s->reductions; local
432 reductions *reds = s->reductions; local
465 reductions *reds = s->reductions; local
[all...] |
| H A D | graphviz.c | 156 output_red (state const *s, reductions const *reds, FILE *fout) argument
173 for (j = 0; j < reds->num; ++j)
178 rule_number ruleno = reds->rules[j]->number;
186 if (default_reduction && default_reduction == reds->rules[j])
188 if (reds->lookahead_tokens)
192 if (bitset_test (reds->lookahead_tokens[j], i))
|
| H A D | print-xml.c | 92 reductions *reds = s->reductions; local
95 if (reds->lookahead_tokens && red != -1)
243 reductions *reds = s->reductions; local
248 if (reds->num == 0)
267 if (reds->lookahead_tokens)
272 for (j = 0; j < reds->num; ++j)
273 if (bitset_test (reds->lookahead_tokens[j], i))
277 if (reds->rules[j] != default_reduction)
297 if (reds->lookahead_tokens)
303 for (j = 0; j < reds
[all...] |
| H A D | print.c | 244 reductions *reds = s->reductions;
250 if (reds->num == 0)
267 if (reds->lookahead_tokens)
272 for (j = 0; j < reds->num; ++j)
273 if (bitset_test (reds->lookahead_tokens[j], i))
277 if (reds->rules[j] != default_reduction)
296 if (reds->lookahead_tokens)
304 for (j = 0; j < reds->num; ++j)
305 if (bitset_test (reds->lookahead_tokens[j], i))
309 if (reds
243 reductions *reds = s->reductions; local
[all...] |
| H A D | tables.c | 186 reductions *reds = s->reductions; local
198 for (i = 0; i < reds->num; i += 1)
199 if (bitset_test (reds->lookahead_tokens[i], j)
201 != rule_number_as_item_number (reds->rules[i]->number)))
204 conflict_list[conflict_list_cnt] = reds->rules[i]->number + 1;
243 reductions *reds = s->reductions; local
253 if (reds->lookahead_tokens)
260 for (i = reds->num - 1; i >= 0; --i)
263 BITSET_FOR_EACH (biter, reds->lookahead_tokens[i], j, 0)
272 actrow[j] = rule_number_as_item_number (reds
[all...] |
| H A D | print_graph.c | 110 reductions *reds = s->reductions; local
114 if (reds->lookahead_tokens && redno != -1)
120 BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0)
|
| H A D | lalr.c | 420 reductions *reds = states[i]->reductions; local
424 if (reds->lookahead_tokens)
425 for (k = 0; k < reds->num; ++k)
426 if (reds->lookahead_tokens[k])
432 if (reds->lookahead_tokens)
433 for (j = 0; j < reds->num; ++j)
434 BITSET_FOR_EACH (iter, reds->lookahead_tokens[j], k, 0)
438 reds->rules[j]->number);
|
| H A D | AnnotationList.c | 166 reductions *reds)
174 for (i = 0; i < reds->num; ++i)
176 bitset_and (conflicted_tokens_rule, tokens, reds->lookahead_tokens[i]);
179 bitset_or (tokens, tokens, reds->lookahead_tokens[i]);
182 aver (i == 0 || reds->rules[i-1] < reds->rules[i]);
165 AnnotationList__compute_conflicted_tokens(bitset shift_tokens, reductions *reds) argument
|
| H A D | state.h | 238 void state_reductions_set (state *s, int num, rule **reds);
|
| /external/pdfium/core/src/reflow/ |
| H A D | layoutprocessor_reflow.cpp | 1348 int reds = m_pReflowedPage->m_pReflowed->GetSize(); local
|
| /external/blktrace/btt/doc/ |
| H A D | btt.tex | 589 out. And then one can make the broad generalization of higher reds,
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.eclipse.equinox.p2.publisher_1.1.2.v20100824-2220.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.pde.build_3.6.1.R36x_v20100823/ |
| H A D | pdebuild.jar | META-INF/ META-INF/MANIFEST.MF org/ org/eclipse/ org/eclipse/pde/ org/eclipse/pde/build/ ... |