]> git.saurik.com Git - bison.git/blame_incremental - src/symlist.c
Regenerate.
[bison.git] / src / symlist.c
... / ...
CommitLineData
1/* Lists of symbols for Bison
2
3 Copyright (C) 2002, 2005 Free Software Foundation, Inc.
4
5 This file is part of Bison, the GNU Compiler Compiler.
6
7 Bison is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
11
12 Bison is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with Bison; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
21
22#include <config.h>
23#include "system.h"
24
25#include "complain.h"
26#include "symlist.h"
27
28
29/*--------------------------------------.
30| Create a list containing SYM at LOC. |
31`--------------------------------------*/
32
33symbol_list *
34symbol_list_new (symbol *sym, location loc)
35{
36 symbol_list *res = xmalloc (sizeof *res);
37
38 res->sym = sym;
39 res->location = loc;
40
41 res->action = NULL;
42 res->used = false;
43
44 res->ruleprec = NULL;
45 res->dprec = 0;
46 res->merger = 0;
47
48 res->next = NULL;
49
50 return res;
51}
52
53
54/*------------------.
55| Print this list. |
56`------------------*/
57
58void
59symbol_list_print (symbol_list *l, FILE *f)
60{
61 for (/* Nothing. */; l && l->sym; l = l->next)
62 {
63 symbol_print (l->sym, f);
64 if (l && l->sym)
65 fprintf (f, ", ");
66 }
67}
68
69
70/*---------------------------------.
71| Prepend SYM at LOC to the LIST. |
72`---------------------------------*/
73
74symbol_list *
75symbol_list_prepend (symbol_list *list, symbol *sym, location loc)
76{
77 symbol_list *res = symbol_list_new (sym, loc);
78 res->next = list;
79 return res;
80}
81
82
83/*-------------------------------------------------.
84| Free the LIST, but not the symbols it contains. |
85`-------------------------------------------------*/
86
87void
88symbol_list_free (symbol_list *list)
89{
90 LIST_FREE (symbol_list, list);
91}
92
93
94/*--------------------.
95| Return its length. |
96`--------------------*/
97
98unsigned int
99symbol_list_length (symbol_list *l)
100{
101 int res = 0;
102 for (/* Nothing. */; l; l = l->next)
103 ++res;
104 return res;
105}
106
107
108/*--------------------------------.
109| Get symbol N in symbol list L. |
110`--------------------------------*/
111
112symbol_list *
113symbol_list_n_get (symbol_list *l, int n)
114{
115 int i;
116
117 if (n < 0)
118 return NULL;
119
120 for (i = 0; i < n; ++i)
121 {
122 l = l->next;
123 if (l == NULL || l->sym == NULL)
124 return NULL;
125 }
126
127 return l;
128}
129
130
131/*--------------------------------------------------------------.
132| Get the data type (alternative in the union) of the value for |
133| symbol N in symbol list L. |
134`--------------------------------------------------------------*/
135
136uniqstr
137symbol_list_n_type_name_get (symbol_list *l, location loc, int n)
138{
139 l = symbol_list_n_get (l, n);
140 if (!l)
141 {
142 complain_at (loc, _("invalid $ value: $%d"), n);
143 return NULL;
144 }
145 return l->sym->type_name;
146}
147
148
149/*----------------------------------------.
150| The symbol N in symbol list L is USED. |
151`----------------------------------------*/
152
153void
154symbol_list_n_used_set (symbol_list *l, int n, bool used)
155{
156 l = symbol_list_n_get (l, n);
157 if (l)
158 l->used = used;
159}