1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/* util.c -- functions for initializing new tree elements, and other things.
Copyright (C) 1990, 91, 92, 93, 94, 2000, 2003, 2004 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
USA.
*/
#include "defs.h"
#include "xalloc.h"
#if ENABLE_NLS
# include <libintl.h>
# define _(Text) gettext (Text)
#else
# define _(Text) Text
#endif
#ifdef gettext_noop
# define N_(String) gettext_noop (String)
#else
/* See locate.c for explanation as to why not use (String) */
# define N_(String) String
#endif
#include <assert.h>
/* Return a pointer to a new predicate structure, which has been
linked in as the last one in the predicates list.
Set `predicates' to point to the start of the predicates list.
Set `last_pred' to point to the new last predicate in the list.
Set all cells in the new structure to the default values. */
struct predicate *
get_new_pred (const struct parser_table *entry)
{
register struct predicate *new_pred;
(void) entry;
/* Options should not be turned into predicates. */
assert(entry->type != ARG_OPTION);
assert(entry->type != ARG_POSITIONAL_OPTION);
if (predicates == NULL)
{
predicates = (struct predicate *)
xmalloc (sizeof (struct predicate));
last_pred = predicates;
}
else
{
new_pred = (struct predicate *) xmalloc (sizeof (struct predicate));
last_pred->pred_next = new_pred;
last_pred = new_pred;
}
last_pred->parser_entry = entry;
last_pred->pred_func = NULL;
#ifdef DEBUG
last_pred->p_name = NULL;
#endif /* DEBUG */
last_pred->p_type = NO_TYPE;
last_pred->p_prec = NO_PREC;
last_pred->side_effects = false;
last_pred->no_default_print = false;
last_pred->need_stat = true;
last_pred->need_type = true;
last_pred->args.str = NULL;
last_pred->pred_next = NULL;
last_pred->pred_left = NULL;
last_pred->pred_right = NULL;
return (last_pred);
}
/* Return a pointer to a new predicate, with operator check.
Like get_new_pred, but it checks to make sure that the previous
predicate is an operator. If it isn't, the AND operator is inserted. */
struct predicate *
get_new_pred_chk_op (const struct parser_table *entry)
{
struct predicate *new_pred;
static const struct parser_table *entry_and = NULL;
/* Locate the entry in the parser table for the "and" operator */
if (NULL == entry_and)
entry_and = find_parser("and");
/* Check that it's actually there. If not, that is a bug.*/
assert(entry_and != NULL);
if (last_pred)
switch (last_pred->p_type)
{
case NO_TYPE:
error (1, 0, _("oops -- invalid default insertion of and!"));
break;
case PRIMARY_TYPE:
case CLOSE_PAREN:
/* We need to interpose the and operator. */
new_pred = get_new_pred (entry_and);
new_pred->pred_func = pred_and;
#ifdef DEBUG
new_pred->p_name = find_pred_name (pred_and);
#endif /* DEBUG */
new_pred->p_type = BI_OP;
new_pred->p_prec = AND_PREC;
new_pred->need_stat = false;
new_pred->need_type = false;
new_pred->args.str = NULL;
new_pred->side_effects = false;
new_pred->no_default_print = false;
break;
default:
break;
}
new_pred = get_new_pred (entry);
new_pred->parser_entry = entry;
return new_pred;
}
/* Add a primary of predicate type PRED_FUNC (described by ENTRY) to the predicate input list.
Return a pointer to the predicate node just inserted.
Fills in the following cells of the new predicate node:
pred_func PRED_FUNC
args(.str) NULL
p_type PRIMARY_TYPE
p_prec NO_PREC
Other cells that need to be filled in are defaulted by
get_new_pred_chk_op, which is used to insure that the prior node is
either not there at all (we are the very first node) or is an
operator. */
struct predicate *
insert_primary_withpred (const struct parser_table *entry, PRED_FUNC pred_func)
{
struct predicate *new_pred;
new_pred = get_new_pred_chk_op (entry);
new_pred->pred_func = pred_func;
#ifdef DEBUG
new_pred->p_name = entry->parser_name;
#endif /* DEBUG */
new_pred->args.str = NULL;
new_pred->p_type = PRIMARY_TYPE;
new_pred->p_prec = NO_PREC;
return new_pred;
}
/* Add a primary described by ENTRY to the predicate input list.
Return a pointer to the predicate node just inserted.
Fills in the following cells of the new predicate node:
pred_func PRED_FUNC
args(.str) NULL
p_type PRIMARY_TYPE
p_prec NO_PREC
Other cells that need to be filled in are defaulted by
get_new_pred_chk_op, which is used to insure that the prior node is
either not there at all (we are the very first node) or is an
operator. */
struct predicate *
insert_primary (const struct parser_table *entry)
{
assert(entry->pred_func != NULL);
return insert_primary_withpred(entry, entry->pred_func);
}
void
usage (char *msg)
{
if (msg)
fprintf (stderr, "%s: %s\n", program_name, msg);
fprintf (stderr, _("\
Usage: %s [-H] [-L] [-P] [path...] [expression]\n"), program_name);
exit (1);
}
|
