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
|
/* Generate check macros for tree codes.
Copyright (C) 1998-2013 Free Software Foundation, Inc.
This file is part of GCC.
GCC 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 3, or (at your option) any later
version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "bconfig.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#define DEFTREECODE(SYM, NAME, TYPE, LEN) #SYM,
#define END_OF_BASE_TREE_CODES
static const char *const tree_codes[] = {
#include "all-tree.def"
(char*) 0
};
#undef DEFTREECODE
#undef END_OF_BASE_TREE_CODES
static void usage (void);
static void
usage (void)
{
fputs ("Usage: gencheck\n", stderr);
}
int
main (int argc, char ** ARG_UNUSED (argv))
{
int i, j;
switch (argc)
{
case 1:
break;
default:
usage ();
return (1);
}
puts ("/* This file is generated using gencheck. Do not edit. */\n");
puts ("#ifndef GCC_TREE_CHECK_H");
puts ("#define GCC_TREE_CHECK_H\n");
/* Print macros for checks based on each of the tree code names. However,
since we include the tree nodes from all languages, we must check
for duplicate names to avoid defining the same macro twice. */
for (i = 0; tree_codes[i]; i++)
{
for (j = 0; j < i; j++)
if (strcmp (tree_codes[i], tree_codes[j]) == 0)
break;
if (i == j)
printf ("#define %s_CHECK(t)\tTREE_CHECK (t, %s)\n",
tree_codes[i], tree_codes[i]);
}
puts ("\n#endif /* GCC_TREE_CHECK_H */");
return 0;
}
|
