X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/4b3d3a8e4629cc3b0a6d011d80e1997f8306c304..d2ffe11637313569116e8a9f891785b842ddb1e9:/src/derives.c diff --git a/src/derives.c b/src/derives.c index f88b7002..7e20fe5a 100644 --- a/src/derives.c +++ b/src/derives.c @@ -1,5 +1,7 @@ /* Match rules with nonterminals for bison, - Copyright 1984, 1989, 2000, 2001, 2002 Free Software Foundation, Inc. + + Copyright (C) 1984, 1989, 2000, 2001, 2002, 2003 Free Software + Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -20,20 +22,22 @@ #include "system.h" + #include "getargs.h" -#include "symtab.h" -#include "reader.h" -#include "gram.h" + #include "derives.h" +#include "gram.h" +#include "reader.h" +#include "symtab.h" /* Linked list of rule numbers. */ -typedef struct rule_list_s +typedef struct rule_list { - struct rule_list_s *next; - rule_number_t value; -} rule_list_t; + struct rule_list *next; + rule *value; +} rule_list; -rule_number_t **derives = NULL; +rule ***derives = NULL; static void print_derives (void) @@ -44,12 +48,12 @@ print_derives (void) for (i = ntokens; i < nsyms; i++) { - rule_number_t *rp; + rule **rp; fprintf (stderr, "\t%s derives\n", symbols[i]->tag); - for (rp = derives[i]; *rp >= 0; rp++) + for (rp = derives[i - ntokens]; *rp; ++rp) { - fprintf (stderr, "\t\t%3d ", *rp); - rule_rhs_print (&rules[*rp], stderr); + fprintf (stderr, "\t\t%3d ", (*rp)->user_number); + rule_rhs_print (*rp, stderr); } } @@ -58,60 +62,60 @@ print_derives (void) void -set_derives (void) +derives_compute (void) { - symbol_number_t i; - int r; - rule_number_t *q; + symbol_number i; + rule_number r; + rule **q; - /* DSET[NTERM] -- A linked list of the numbers of the rules whose - LHS is NTERM. */ - rule_list_t **dset = XCALLOC (rule_list_t *, nvars) - ntokens; + /* DSET[NTERM - NTOKENS] -- A linked list of the numbers of the rules + whose LHS is NTERM. */ + rule_list **dset = CALLOC (dset, nvars); /* DELTS[RULE] -- There are NRULES rule number to attach to nterms. Instead of performing NRULES allocations for each, have an array indexed by rule numbers. */ - rule_list_t *delts = XCALLOC (rule_list_t, nrules); + rule_list *delts = CALLOC (delts, nrules); for (r = nrules - 1; r >= 0; --r) { - symbol_number_t lhs = rules[r].lhs->number; - rule_list_t *p = &delts[r]; + symbol_number lhs = rules[r].lhs->number; + rule_list *p = &delts[r]; /* A new LHS is found. */ - p->next = dset[lhs]; - p->value = r; - dset[lhs] = p; + p->next = dset[lhs - ntokens]; + p->value = &rules[r]; + dset[lhs - ntokens] = p; } /* DSET contains what we need under the form of a linked list. Make it a single array. */ - derives = XCALLOC (rule_number_t *, nvars) - ntokens; - q = XCALLOC (rule_number_t, nvars + int_of_rule_number (nrules)); + CALLOC (derives, nvars); + CALLOC (q, nvars + nrules); for (i = ntokens; i < nsyms; i++) { - rule_list_t *p = dset[i]; - derives[i] = q; + rule_list *p = dset[i - ntokens]; + derives[i - ntokens] = q; while (p) { *q++ = p->value; p = p->next; } - *q++ = -1; + *q++ = NULL; } - if (trace_flag) + if (trace_flag & trace_sets) print_derives (); - free (dset + ntokens); + free (dset); free (delts); } void -free_derives (void) +derives_free (void) { - XFREE (derives[ntokens]); - XFREE (derives + ntokens); + XFREE (derives[0]); + XFREE (derives); }