X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/95612cfa608188fc323ed3f8560cc6aea953ff32..c1d19e10c32844d17122b473840752003521d21b:/src/symlist.c diff --git a/src/symlist.c b/src/symlist.c index 92d8513d..299bfcbe 100644 --- a/src/symlist.c +++ b/src/symlist.c @@ -1,5 +1,6 @@ /* Lists of symbols for Bison - Copyright (C) 2002 Free Software Foundation, Inc. + + Copyright (C) 2002, 2005, 2006, 2007 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -15,55 +16,134 @@ You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ + the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ +#include #include "system.h" + #include "complain.h" #include "symlist.h" -/*----------------------------------------------. -| Create a list containing SYMBOL at LOCATION. | -`----------------------------------------------*/ +/*--------------------------------------. +| Create a list containing SYM at LOC. | +`--------------------------------------*/ -symbol_list_t * -symbol_list_new (symbol_t *sym, location_t location) +symbol_list * +symbol_list_sym_new (symbol *sym, location loc) { - symbol_list_t *res = XMALLOC (symbol_list_t, 1); - res->next = NULL; - res->sym = sym; - res->location = location; - res->action = NULL; + symbol_list *res = xmalloc (sizeof *res); + + res->content_type = SYMLIST_SYMBOL; + res->content.sym = sym; + res->location = loc; + + res->midrule = NULL; + res->midrule_parent_rule = NULL; + res->midrule_parent_rhs_index = 0; + + code_props_none_init (&res->action_props); + res->ruleprec = NULL; res->dprec = 0; res->merger = 0; + + res->next = NULL; + + return res; +} + + +/*--------------------------------------------. +| Create a list containing TYPE_NAME at LOC. | +`--------------------------------------------*/ + +symbol_list * +symbol_list_type_new (uniqstr type_name, location loc) +{ + symbol_list *res = xmalloc (sizeof *res); + + res->content_type = SYMLIST_TYPE; + res->content.type_name = type_name; + res->location = loc; + res->next = NULL; + return res; } -/*-----------------------------------------. -| Prepend SYMBOL at LOCATION to the LIST. | -`-----------------------------------------*/ +/*----------------------------------------. +| Create a list containing a <*> at LOC. | +`----------------------------------------*/ -symbol_list_t * -symbol_list_prepend (symbol_list_t *list, - symbol_t *symbol, location_t location) +symbol_list * +symbol_list_default_tagged_new (location loc) { - symbol_list_t *res = symbol_list_new (symbol, location); - res->next = list; + symbol_list *res = xmalloc (sizeof *res); + + res->content_type = SYMLIST_DEFAULT_TAGGED; + res->location = loc; + res->next = NULL; + return res; } -/*-------------------------------------------------. -| Free the LIST, but not the symbols it contains. | -`-------------------------------------------------*/ +/*---------------------------------------. +| Create a list containing a <> at LOC. | +`---------------------------------------*/ + +symbol_list * +symbol_list_default_tagless_new (location loc) +{ + symbol_list *res = xmalloc (sizeof *res); + + res->content_type = SYMLIST_DEFAULT_TAGLESS; + res->location = loc; + res->next = NULL; + + return res; +} + + +/*-----------------------------------------------------------------------. +| Print this list, for which every content_type must be SYMLIST_SYMBOL. | +`-----------------------------------------------------------------------*/ void -symbol_list_free (symbol_list_t *list) +symbol_list_syms_print (const symbol_list *l, FILE *f) { - LIST_FREE (symbol_list_t, list); + for (/* Nothing. */; l && l->content.sym; l = l->next) + { + symbol_print (l->content.sym, f); + fprintf (stderr, l->action_props.is_value_used ? " used" : " unused"); + if (l && l->content.sym) + fprintf (f, ", "); + } +} + + +/*---------------------------. +| Prepend NODE to the LIST. | +`---------------------------*/ + +symbol_list * +symbol_list_prepend (symbol_list *list, symbol_list *node) +{ + node->next = list; + return node; +} + + +/*-----------------------------------------------. +| Free the LIST, but not the items it contains. | +`-----------------------------------------------*/ + +void +symbol_list_free (symbol_list *list) +{ + LIST_FREE (symbol_list, list); } @@ -71,46 +151,105 @@ symbol_list_free (symbol_list_t *list) | Return its length. | `--------------------*/ -unsigned int -symbol_list_length (symbol_list_t *list) +int +symbol_list_length (symbol_list const *l) { int res = 0; - for (/* Nothing. */; list; list = list->next) + for (/* Nothing. */; + l && !(l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL); + l = l->next) ++res; return res; } -/*--------------------------------------------------------------. -| Get the data type (alternative in the union) of the value for | -| symbol N in rule RULE. | -`--------------------------------------------------------------*/ +/*------------------------------. +| Get item N in symbol list L. | +`------------------------------*/ -struniq_t -symbol_list_n_type_name_get (symbol_list_t *rule, location_t location, int n) +symbol_list * +symbol_list_n_get (symbol_list *l, int n) { int i; - symbol_list_t *rp; if (n < 0) + return NULL; + + for (i = 0; i < n; ++i) { - complain_at (location, _("invalid $ value")); + l = l->next; + if (l == NULL + || (l->content_type == SYMLIST_SYMBOL && l->content.sym == NULL)) + return NULL; + } + + return l; +} + + +/*--------------------------------------------------------------. +| Get the data type (alternative in the union) of the value for | +| symbol N in symbol list L. | +`--------------------------------------------------------------*/ + +uniqstr +symbol_list_n_type_name_get (symbol_list *l, location loc, int n) +{ + l = symbol_list_n_get (l, n); + if (!l) + { + complain_at (loc, _("invalid $ value: $%d"), n); return NULL; } + aver (l->content_type == SYMLIST_SYMBOL); + return l->content.sym->type_name; +} - rp = rule; - i = 0; - while (i < n) +void +symbol_list_destructor_set (symbol_list *node, char const *code, location loc) +{ + code_props destructor; + code_props_symbol_action_init (&destructor, code, loc); + code_props_translate_code (&destructor); + switch (node->content_type) { - rp = rp->next; - if (rp == NULL || rp->sym == NULL) - { - complain_at (location, _("invalid $ value")); - return NULL; - } - ++i; + case SYMLIST_SYMBOL: + symbol_destructor_set (node->content.sym, &destructor); + break; + case SYMLIST_TYPE: + semantic_type_destructor_set ( + semantic_type_get (node->content.type_name), &destructor); + break; + case SYMLIST_DEFAULT_TAGGED: + default_tagged_destructor_set (&destructor); + break; + case SYMLIST_DEFAULT_TAGLESS: + default_tagless_destructor_set (&destructor); + break; } +} - return rp->sym->type_name; +void +symbol_list_printer_set (symbol_list *node, char const *code, location loc) +{ + code_props printer; + code_props_symbol_action_init (&printer, code, loc); + code_props_translate_code (&printer); + switch (node->content_type) + { + case SYMLIST_SYMBOL: + symbol_printer_set (node->content.sym, &printer); + break; + case SYMLIST_TYPE: + semantic_type_printer_set ( + semantic_type_get (node->content.type_name), &printer); + break; + case SYMLIST_DEFAULT_TAGGED: + default_tagged_printer_set (&printer); + break; + case SYMLIST_DEFAULT_TAGLESS: + default_tagless_printer_set (&printer); + break; + } }