/external/bison/src/ |
D | tables.c | 401 froms[s] = sp = sp1 = xnmalloc (count, sizeof *sp1); in save_row() 402 tos[s] = sp2 = xnmalloc (count, sizeof *sp2); in save_row() 404 nondeterministic_parser ? xnmalloc (count, sizeof *sp3) : NULL; in save_row() 438 yydefact = xnmalloc (nstates, sizeof *yydefact); in token_actions() 440 actrow = xnmalloc (ntokens, sizeof *actrow); in token_actions() 441 conflrow = xnmalloc (ntokens, sizeof *conflrow); in token_actions() 443 conflict_list = xnmalloc (1 + 2 * nconflict, sizeof *conflict_list); in token_actions() 508 froms[symno] = sp = sp1 = xnmalloc (count, sizeof *sp1); in save_column() 509 tos[symno] = sp2 = xnmalloc (count, sizeof *sp2); in save_column() 571 size_t *state_count = xnmalloc (nstates, sizeof *state_count); in goto_actions() [all …]
|
D | LR0.c | 118 kernel_base = xnmalloc (nsyms, sizeof *kernel_base); in allocate_itemsets() 119 kernel_items = xnmalloc (count, sizeof *kernel_items); in allocate_itemsets() 129 kernel_size = xnmalloc (nsyms, sizeof *kernel_size); in allocate_itemsets() 138 shiftset = xnmalloc (nsyms, sizeof *shiftset); in allocate_storage() 139 redset = xnmalloc (nrules, sizeof *redset); in allocate_storage() 141 shift_symbol = xnmalloc (nsyms, sizeof *shift_symbol); in allocate_storage()
|
D | lalr.c | 79 temp_map = xnmalloc (nvars + 1, sizeof *temp_map); in set_goto_map() 161 goto_number **reads = xnmalloc (ngotos, sizeof *reads); in initialize_F() 162 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); in initialize_F() 189 reads[i] = xnmalloc (nedges + 1, sizeof reads[i][0]); in initialize_F() 221 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); in build_relations() 222 state_number *states1 = xnmalloc (ritem_longest_rhs () + 1, sizeof *states1); in build_relations() 225 includes = xnmalloc (ngotos, sizeof *includes); in build_relations() 276 includes[i] = xnmalloc (nedges + 1, sizeof includes[i][0]); in build_relations()
|
D | ielr.c | 100 *edgesp = xnmalloc (ngotos, sizeof **edgesp); in ielr_compute_internal_follow_edges() 101 *edge_countsp = xnmalloc (ngotos, sizeof **edge_countsp); in ielr_compute_internal_follow_edges() 154 (*edgesp)[i] = xnmalloc (nsources + 1, sizeof *(*edgesp)[i]); in ielr_compute_internal_follow_edges() 254 goto_number *edge_array = xnmalloc (ngotos, sizeof *edge_array); in ielr_compute_always_follows() 304 int *predecessor_counts = xnmalloc (nstates, sizeof *predecessor_counts); in ielr_compute_predecessors() 305 state ***result = xnmalloc (nstates, sizeof *result); in ielr_compute_predecessors() 316 result[i] = xnmalloc (predecessor_counts[i]+1, sizeof *result[i]); in ielr_compute_predecessors() 386 xnmalloc (s->nitems, sizeof item_lookahead_sets[s->number][0]); in ielr_item_has_lookahead() 491 xnmalloc (nstates, sizeof *item_lookahead_sets); in ielr_compute_annotation_lists() 493 xnmalloc (nstates, sizeof *annotation_counts); in ielr_compute_annotation_lists() [all …]
|
D | output.c | 202 int *values = xnmalloc (ntokens, sizeof *values); in prepare_symbols() 222 item_number *rhs = xnmalloc (nritems, sizeof *rhs); in prepare_rules() 223 unsigned int *prhs = xnmalloc (nrules, sizeof *prhs); in prepare_rules() 224 unsigned int *rline = xnmalloc (nrules, sizeof *rline); in prepare_rules() 225 symbol_number *r1 = xnmalloc (nrules, sizeof *r1); in prepare_rules() 226 unsigned int *r2 = xnmalloc (nrules, sizeof *r2); in prepare_rules() 227 int *dprec = xnmalloc (nrules, sizeof *dprec); in prepare_rules() 228 int *merger = xnmalloc (nrules, sizeof *merger); in prepare_rules() 281 symbol_number *values = xnmalloc (nstates, sizeof *values); in prepare_states()
|
D | derives.c | 76 rule_list *delts = xnmalloc (nrules, sizeof *delts); in derives_compute() 91 derives = xnmalloc (nvars, sizeof *derives); in derives_compute() 92 q = xnmalloc (nvars + nrules, sizeof *q); in derives_compute()
|
D | relation.c | 103 VERTICES = xnmalloc (size + 1, sizeof *VERTICES); in relation_digraph() 129 relation new_R = xnmalloc (n, sizeof *new_R); in relation_transpose() 131 relation end_R = xnmalloc (n, sizeof *end_R); in relation_transpose() 155 sp = xnmalloc (nedges[i] + 1, sizeof *sp); in relation_transpose()
|
D | nullable.c | 63 symbol_number *squeue = xnmalloc (nvars, sizeof *squeue); in nullable_compute() 70 rule_list *relts = xnmalloc (nritems + nvars + 1, sizeof *relts); in nullable_compute()
|
D | reduce.c | 249 rule *rules_sorted = xnmalloc (nrules, sizeof *rules_sorted); in reduce_grammar_tables() 293 symbol_number *nontermmap = xnmalloc (nvars, sizeof *nontermmap); in nonterminals_reduce() 309 symbol **symbols_sorted = xnmalloc (nvars, sizeof *symbols_sorted); in nonterminals_reduce()
|
D | main.c | 130 state_number *old_to_new = xnmalloc (nstates, sizeof *old_to_new); in main()
|
D | closure.c | 184 itemset = xnmalloc (n, sizeof *itemset); in new_closure()
|
D | reader.c | 505 ritem = xnmalloc (nritems + 1, sizeof *ritem); in packgram() 510 rules = xnmalloc (nrules, sizeof *rules); in packgram()
|
D | symtab.c | 795 symbols_sorted = xnmalloc (count, sizeof *symbols_sorted); in symbols_do() 862 token_translations = xnmalloc (max_user_token_number + 1, in symbols_token_translations_init()
|
D | conflicts.c | 389 symbol **errors = xnmalloc (ntokens + 1, sizeof *errors); in conflicts_solve()
|
D | AnnotationList.c | 338 lookaheads = xnmalloc ((*predecessor)->nitems, in AnnotationList__computePredecessorAnnotations()
|
/external/bison/lib/ |
D | xalloc.h | 80 ((t *) (sizeof (t) == 1 ? xmalloc (n) : xnmalloc (n, sizeof (t)))) 97 XALLOC_INLINE void *xnmalloc (size_t n, size_t s) 100 xnmalloc (size_t n, size_t s) in xnmalloc() function
|
/external/bison/ |
D | ChangeLog-2012 | 11543 changed to use xcalloc, xnmalloc, xnrealloc, respectively, 11546 * src/LR0.c (allocate_itemsets): Use xnmalloc, not xcalloc, 12268 * src/system.h (MALLOC): Use xnmalloc, for better overflow checking.
|