Daily bump.
[official-gcc.git] / gcc / gencheck.c
blobb6dab646054be2754558f55768da91d59a8d6a89
1 /* Generate check macros for tree codes.
2 Copyright (C) 1998-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 #include "bconfig.h"
21 #include "system.h"
22 #include "coretypes.h"
23 #include "tm.h"
25 #define DEFTREECODE(SYM, NAME, TYPE, LEN) #SYM,
26 #define END_OF_BASE_TREE_CODES
28 static const char *const tree_codes[] = {
29 #include "all-tree.def"
30 (char*) 0
33 #undef DEFTREECODE
34 #undef END_OF_BASE_TREE_CODES
36 static void usage (void);
38 static void
39 usage (void)
41 fputs ("Usage: gencheck\n", stderr);
44 int
45 main (int argc, char ** ARG_UNUSED (argv))
47 int i, j;
49 switch (argc)
51 case 1:
52 break;
54 default:
55 usage ();
56 return (1);
59 puts ("/* This file is generated using gencheck. Do not edit. */\n");
60 puts ("#ifndef GCC_TREE_CHECK_H");
61 puts ("#define GCC_TREE_CHECK_H\n");
63 /* Print macros for checks based on each of the tree code names. However,
64 since we include the tree nodes from all languages, we must check
65 for duplicate names to avoid defining the same macro twice. */
66 for (i = 0; tree_codes[i]; i++)
68 for (j = 0; j < i; j++)
69 if (strcmp (tree_codes[i], tree_codes[j]) == 0)
70 break;
72 if (i == j)
73 printf ("#define %s_CHECK(t)\tTREE_CHECK (t, %s)\n",
74 tree_codes[i], tree_codes[i]);
77 puts ("\n#endif /* GCC_TREE_CHECK_H */");
78 return 0;