2 * Parse and validate C declarations.
3 * Copyright © 2011-2012, 2020-2021 Nick Bowler
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <https://www.gnu.org/licenses/>.
25 #include "cdecl-internal.h"
30 * Verify the declaration specifiers of a declaration. If top is true, treat
31 * this as a top-level declaration. Otherwise, treat this as a function
32 * parameter (which carries additional constraints).
34 static bool valid_declspecs(struct cdecl *decl, bool top)
36 struct cdecl_declspec *specs = decl->specifiers;
37 struct cdecl_declarator *d = decl->declarators;
38 bool abstract = cdecl_is_abstract(d);
39 unsigned num_storage = 0;
40 unsigned long typemap;
42 typemap = cdecl__build_typemap(specs);
46 for (struct cdecl_declspec *c = specs; c; c = c->next) {
47 switch (cdecl_spec_kind(c)) {
49 if (c->type == CDECL_TYPE_VOID &&
50 (d->type == CDECL_DECL_IDENT
51 || d->type == CDECL_DECL_ARRAY)) {
52 fprintf(stderr, "invalid declaration of type void\n");
57 if (top && abstract) {
58 fprintf(stderr, "type names cannot have storage-class specifiers\n");
62 if (!top && c->type != CDECL_STOR_REGISTER) {
63 fprintf(stderr, "function parameters may only have register storage\n");
67 if (++num_storage > 1) {
68 fprintf(stderr, "too many storage-class specifiers\n");
74 * Restrict qualifiers are only valid in the
75 * pointer qualifier list, which isn't checked here.
77 if (c->type == CDECL_QUAL_RESTRICT) {
78 fprintf(stderr, "only pointer types can be restrict-qualified.\n");
84 fprintf(stderr, "type names cannot have function specifiers\n");
88 if (!top || d->type != CDECL_DECL_FUNCTION) {
89 fprintf(stderr, "only function declarations may have function specifiers.\n");
102 * The C grammar leaves ambiguous some cases where parentheses represent a
103 * function declarator or just parentheses. The language uses additional
104 * context (whether or not a typedef is in scope, etc.) to resolve these
105 * ambiguities, but we don't have access to that kind of information.
107 * The cdecl99 parser uses an unambiguous grammar which treats almost
108 * everything as a function, and thus considers things like 'int (x)' to
109 * be a function type with a single parameter of type 'x' (a typedef name),
110 * returning int. This can result in very complicated types for simple
111 * declarations. Ideally, cdecl99 should try and find the "simplest"
112 * explanation for a given declaration.
114 * Whether or not it achieves the simplest explanation, we apply a simple rule:
115 * if a declarator could be interpreted as something other than a function,
118 * Since cdecl99 supports things like [*] in any context (in C, such constructs
119 * are only valid in function parameter lists), we don't treat them specially
123 static struct cdecl_declarator *reduce_function(struct cdecl *param)
125 struct cdecl_declspec *spec = param->specifiers;
126 struct cdecl_declarator *decl = param->declarators;
127 struct cdecl_declarator *last;
129 for (last = decl; last && last->type != CDECL_DECL_NULL;)
135 last->type = CDECL_DECL_IDENT;
136 last->u.ident = spec->ident;
143 static bool function_is_reducible(struct cdecl_declarator *d)
145 if (d->type != CDECL_DECL_FUNCTION)
147 if (d->child->type != CDECL_DECL_NULL)
148 return false; /* e.g., int (*)(x) */
150 if (!d->u.function.parameters)
151 return false; /* e.g., int f() */
152 if (d->u.function.parameters->next)
153 return false; /* e.g., int (x, y) */
154 if (d->u.function.variadic)
155 return false; /* e.g., int (x, ...) */
157 if (d->u.function.parameters->specifiers->type != CDECL_TYPE_IDENT)
158 return false; /* e.g. int (int) */
159 if (d->u.function.parameters->specifiers->next)
160 return false; /* e.g. int (size_t const) */
161 if (d->u.function.parameters->declarators->type == CDECL_DECL_POINTER)
162 return false; /* e.g. int (x *) */
168 simplify_functions(struct cdecl_declarator **p, struct cdecl_declarator *d)
170 struct cdecl_declarator *new;
172 if (!function_is_reducible(d))
175 new = reduce_function(d->u.function.parameters);
177 return 0; /* e.g. int (foo bar) */
186 * The parser's bias towards considering things as functions whenever possible
187 * makes nested parentheses tricky. (x) is considered to be part of a function
188 * declarator until simplify_functions converts it. The problem is that
189 * (((x))) is not valid as part of a function declarator, but it *is* valid
190 * as an identifier enclosed 3 times in parentheses. This is complicated by
191 * the fact that things like (((int))) are not valid anywhere.
193 * To avoid ambiguities, the parser actually emits a "function" declarator for
194 * every pair of parentheses. The ones that can't reasonably be functions
195 * consist of a single "parameter" with no declaration specifiers (note that
196 * every valid function parameter will have at least one type specifier).
198 * This pass is to remove these fake functions from the parse tree. We take
199 * care to avoid turning invalid things like ((int)) into valid things like
200 * (int) by observing that the only valid function declarators that appear
201 * in these "fake" parentheses are those that have a non-null child declarator
202 * (for instance, int ((*)(int)) *or* those that will be eliminated by the
203 * simplify_functions pass.
207 reduce_parentheses(struct cdecl_declarator **p, struct cdecl_declarator *d)
211 if (d->type != CDECL_DECL_FUNCTION)
214 param = d->u.function.parameters;
215 if (param && param->specifiers == NULL) {
216 struct cdecl_declarator *decl;
218 assert(!param->next);
220 decl = param->declarators;
221 if (decl->type == CDECL_DECL_NULL) {
224 d->u.function.parameters = NULL;
228 if (d->child->type != CDECL_DECL_NULL) {
229 fprintf(stderr, "invalid function parameter\n");
239 * We may have replaced d with another fake function which
240 * also needs to be eliminated.
242 if (reduce_parentheses(p, decl) < 0)
246 * If the remaining declarator is a function, make sure it's
247 * valid by checking its reducibility.
250 if (decl->type == CDECL_DECL_FUNCTION
251 && decl->child->type == CDECL_DECL_NULL
252 && !function_is_reducible(decl)) {
253 fprintf(stderr, "too many parentheses in function\n");
264 * Function parameters and return types have a few restrictions that are
265 * really easy to check in comparison to the above absurdity.
268 check_parameters(struct cdecl_declarator **p, struct cdecl_declarator *d)
270 struct cdecl_declspec *spec;
273 if (d->type != CDECL_DECL_FUNCTION)
276 for (param = d->u.function.parameters; param; param = param->next) {
277 if (!valid_declspecs(param, false))
280 /* Check for "void" function parameters as a special case. */
281 for (spec = param->specifiers; spec; spec = spec->next) {
282 if (param->declarators->type != CDECL_DECL_NULL)
284 if (spec->type != CDECL_TYPE_VOID)
287 if (spec != param->specifiers || spec->next != NULL) {
288 fprintf(stderr, "void parameter must not have extra specifiers\n");
290 } else if (d->u.function.parameters->next) {
291 fprintf(stderr, "a void parameter must stand alone\n");
293 } else if (d->u.function.variadic) {
294 fprintf(stderr, "variadic functions cannot have a void parameter\n");
304 * Functions cannot return arrays or functions. Since the parse tree is
305 * "inside-out", we need to look for functions as the child declarator.
308 check_rettypes(struct cdecl_declarator **p, struct cdecl_declarator *d)
310 if (!d->child || d->child->type != CDECL_DECL_FUNCTION)
314 case CDECL_DECL_FUNCTION:
315 fprintf(stderr, "functions cannot return functions\n");
317 case CDECL_DECL_ARRAY:
318 fprintf(stderr, "functions cannot return arrays\n");
326 check_arrays(struct cdecl_declarator **p, struct cdecl_declarator *d)
328 if (!d->child || d->child->type != CDECL_DECL_ARRAY)
332 case CDECL_DECL_FUNCTION:
333 fprintf(stderr, "array members cannot be functions\n");
341 normalize_specs(struct cdecl_declarator **p, struct cdecl_declarator *d)
343 struct cdecl_function *func;
344 struct cdecl_pointer *ptr;
347 case CDECL_DECL_POINTER:
349 ptr->qualifiers = cdecl__normalize_specs(ptr->qualifiers);
351 case CDECL_DECL_FUNCTION:
352 func = &d->u.function;
353 for (struct cdecl *i = func->parameters; i; i = i->next)
354 i->specifiers = cdecl__normalize_specs(i->specifiers);
362 check_qualifiers(struct cdecl_declarator **p, struct cdecl_declarator *d)
364 struct cdecl_declspec *spec;
365 struct cdecl_pointer *ptr;
367 if (!d->child || d->child->type != CDECL_DECL_POINTER)
370 ptr = &d->child->u.pointer;
371 for (spec = ptr->qualifiers; spec; spec = spec->next) {
372 if (spec->type == CDECL_QUAL_RESTRICT
373 && d->type == CDECL_DECL_FUNCTION) {
374 fprintf(stderr, "function pointers cannot be restrict-qualified\n");
383 * Traverse the parse tree, calling a function on every declarator in a
384 * depth-first preorder traversal. The function is given a pointer to the
385 * declarator as well as to the pointer which was used to reach that
386 * declarator: this can be used to rewrite entire subtrees.
388 static bool forall_declarators(struct cdecl *decl,
389 int f(struct cdecl_declarator **, struct cdecl_declarator *))
391 struct cdecl_declarator *d, **p;
393 for (p = &decl->declarators, d = *p; d; p = &d->child, d = *p) {
406 if (d->type == CDECL_DECL_FUNCTION) {
409 for (i = d->u.function.parameters; i; i = i->next) {
410 if (!forall_declarators(i, f))
419 struct cdecl *cdecl_parse_decl(const char *declstr)
421 struct cdecl_declspec *norm_specs;
422 YY_BUFFER_STATE state;
429 rc = cdecl__yylex_init(&scanner);
433 state = cdecl__yy_scan_string(declstr, scanner);
434 rc = cdecl__yyparse(scanner, &decl);
435 cdecl__yy_delete_buffer(state, scanner);
436 cdecl__yylex_destroy(scanner);
442 * Since the top-level specifiers are shared between each top-level
443 * declarator, we need to normalize them once and then propagate the
444 * new specifier list.
446 norm_specs = cdecl__normalize_specs(decl->specifiers);
447 for (struct cdecl *i = decl; i; i = i->next) {
448 i->specifiers = norm_specs;
451 /* Now perform checks and simplifications on each declarator. */
452 for (struct cdecl *i = decl; i; i = i->next) {
453 if (!forall_declarators(i, reduce_parentheses))
455 if (!forall_declarators(i, simplify_functions))
457 if (!forall_declarators(i, check_parameters))
459 if (!forall_declarators(i, check_rettypes))
461 if (!forall_declarators(i, check_arrays))
463 if (!forall_declarators(i, normalize_specs))
465 if (!forall_declarators(i, check_qualifiers))
468 if (!valid_declspecs(i, true))
471 if (cdecl_is_abstract(i->declarators)
472 && (i != decl || i->next)) {
473 fprintf(stderr, "mixing type names and declarations is not allowed\n");
484 struct cdecl *cdecl_parse_english(const char *english)
486 YY_BUFFER_STATE state;
493 rc = cdecl__yylex_init_extra(true, &scanner);
497 state = cdecl__yy_scan_string(english, scanner);
498 rc = cdecl__yyparse(scanner, &decl);
499 cdecl__yy_delete_buffer(state, scanner);
500 cdecl__yylex_destroy(scanner);
505 for (struct cdecl *i = decl; i; i = i->next) {
506 i->specifiers = cdecl__normalize_specs(i->specifiers);
508 if (!forall_declarators(i, check_parameters))
510 if (!forall_declarators(i, check_rettypes))
512 if (!forall_declarators(i, check_arrays))
514 if (!forall_declarators(i, normalize_specs))
516 if (!forall_declarators(i, check_qualifiers))
519 if (!valid_declspecs(i, true))
529 void cdecl_free(struct cdecl *decl)