(all insn and peephole patterns): Rewrite without using arm_output_asm_insn.
[official-gcc.git] / gcc / cp / lex.h
bloba9ea60efa0a5f8360b34d733fca5f5f69d80ef2f
1 /* Define constants and variables for communication with parse.y.
2 Copyright (C) 1987, 1992, 1993 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
4 and by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GNU CC.
8 GNU CC is distributed in the hope that it will be useful,
9 but WITHOUT ANY WARRANTY. No author or distributor
10 accepts responsibility to anyone for the consequences of using it
11 or for whether it serves any particular purpose or works at all,
12 unless he says so in writing. Refer to the GNU CC General Public
13 License for full details.
15 Everyone is granted permission to copy, modify and redistribute
16 GNU CC, but only under the conditions described in the
17 GNU CC General Public License. A copy of this license is
18 supposed to have been given to you along with GNU CC so you
19 can know your rights and responsibilities. It should be in a
20 file named COPYING. Among other things, the copyright notice
21 and this notice must be preserved on all copies. */
25 enum rid
27 RID_UNUSED,
28 RID_INT,
29 RID_BOOL,
30 RID_CHAR,
31 RID_WCHAR,
32 RID_FLOAT,
33 RID_DOUBLE,
34 RID_VOID,
36 /* C++ extension */
37 RID_CLASS,
38 RID_RECORD,
39 RID_UNION,
40 RID_ENUM,
41 RID_LONGLONG,
43 /* This is where grokdeclarator starts its search when setting the specbits.
44 The first seven are in the order of most frequently used, as found
45 building libg++. */
47 RID_EXTERN,
48 RID_CONST,
49 RID_LONG,
50 RID_TYPEDEF,
51 RID_UNSIGNED,
52 RID_SHORT,
53 RID_INLINE,
55 RID_STATIC,
57 RID_REGISTER,
58 RID_VOLATILE,
59 RID_FRIEND,
60 RID_VIRTUAL,
61 RID_PUBLIC,
62 RID_PRIVATE,
63 RID_PROTECTED,
64 RID_SIGNED,
65 RID_EXCEPTION,
66 RID_RAISES,
67 RID_AUTO,
68 RID_MUTABLE,
69 RID_TEMPLATE,
70 RID_SIGNATURE,
71 /* Before adding enough to get up to 64, the RIDBIT_* macros
72 will have to be changed a little. */
73 RID_MAX
76 #define NORID RID_UNUSED
78 #define RID_FIRST_MODIFIER RID_EXTERN
80 /* The type that can represent all values of RIDBIT. */
81 /* We assume that we can stick in at least 32 bits into this. */
82 typedef struct { unsigned long idata[2]; }
83 RID_BIT_TYPE;
85 /* Be careful, all these modify N twice. */
86 #define RIDBIT_SETP(N, V) (((unsigned long)1 << (int) ((N)%32)) \
87 & (V).idata[(N)/32])
88 #define RIDBIT_NOTSETP(NN, VV) (! RIDBIT_SETP (NN, VV))
89 #define RIDBIT_SET(N, V) do { \
90 (V).idata[(N)/32] \
91 |= ((unsigned long)1 << (int) ((N)%32)); \
92 } while (0)
93 #define RIDBIT_RESET(N, V) do { \
94 (V).idata[(N)/32] \
95 &= ~((unsigned long)1 << (int) ((N)%32)); \
96 } while (0)
97 #define RIDBIT_RESET_ALL(V) do { \
98 (V).idata[0] = 0; \
99 (V).idata[1] = 0; \
100 } while (0)
101 #define RIDBIT_ANY_SET(V) ((V).idata[0] || (V).idata[1])
103 /* The elements of `ridpointers' are identifier nodes
104 for the reserved type names and storage classes.
105 It is indexed by a RID_... value. */
106 extern tree ridpointers[(int) RID_MAX];
108 /* the declaration found for the last IDENTIFIER token read in.
109 yylex must look this up to detect typedefs, which get token type TYPENAME,
110 so it is left around in case the identifier is not a typedef but is
111 used in a context which makes it a reference to a variable. */
112 extern tree lastiddecl;
114 extern char *token_buffer; /* Pointer to token buffer. */
116 /* Back-door communication channel to the lexer. */
117 extern int looking_for_typename;
119 /* Tell the lexer where to look for names. */
120 extern tree got_scope;
122 /* Pending language change.
123 Positive is push count, negative is pop count. */
124 extern int pending_lang_change;
126 extern tree make_pointer_declarator (), make_reference_declarator ();
127 extern void reinit_parse_for_function ();
128 extern void reinit_parse_for_method ();
129 extern int yylex ();