1 /* Definitions for c-common.c.
2 Copyright (C) 1987, 1993, 1994, 1995, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 #ifndef GCC_C_COMMON_H
23 #define GCC_C_COMMON_H
25 #include "splay-tree.h"
27 /* Usage of TREE_LANG_FLAG_?:
28 0: COMPOUND_STMT_NO_SCOPE (in COMPOUND_STMT).
29 TREE_NEGATED_INT (in INTEGER_CST).
30 IDENTIFIER_MARKED (used by search routines).
31 SCOPE_BEGIN_P (in SCOPE_STMT)
32 DECL_PRETTY_FUNCTION_P (in VAR_DECL)
33 NEW_FOR_SCOPE_P (in FOR_STMT)
34 1: C_DECLARED_LABEL_FLAG (in LABEL_DECL)
35 STMT_IS_FULL_EXPR_P (in _STMT)
36 2: STMT_LINENO_FOR_FN_P (in _STMT)
37 3: SCOPE_NO_CLEANUPS_P (in SCOPE_STMT)
38 4: SCOPE_PARTIAL_P (in SCOPE_STMT)
41 /* Reserved identifiers. This is the union of all the keywords for C,
42 C++, and Objective C. All the type modifiers have to be in one
43 block at the beginning, because they are used as mask bits. There
44 are 27 type modifiers; if we add many more we will have to redesign
45 the mask mechanism. */
50 /* C, in empirical order of frequency. */
52 RID_UNSIGNED, RID_LONG, RID_CONST, RID_EXTERN,
53 RID_REGISTER, RID_TYPEDEF, RID_SHORT, RID_INLINE,
54 RID_VOLATILE, RID_SIGNED, RID_AUTO, RID_RESTRICT,
57 RID_BOUNDED, RID_UNBOUNDED, RID_COMPLEX,
60 RID_FRIEND, RID_VIRTUAL, RID_EXPLICIT, RID_EXPORT, RID_MUTABLE,
63 RID_IN, RID_OUT, RID_INOUT, RID_BYCOPY, RID_BYREF, RID_ONEWAY,
66 RID_INT, RID_CHAR, RID_FLOAT, RID_DOUBLE, RID_VOID,
67 RID_ENUM, RID_STRUCT, RID_UNION, RID_IF, RID_ELSE,
68 RID_WHILE, RID_DO, RID_FOR, RID_SWITCH, RID_CASE,
69 RID_DEFAULT, RID_BREAK, RID_CONTINUE, RID_RETURN, RID_GOTO,
73 RID_ASM, RID_TYPEOF, RID_ALIGNOF, RID_ATTRIBUTE, RID_VA_ARG,
74 RID_EXTENSION, RID_IMAGPART, RID_REALPART, RID_LABEL, RID_PTRBASE,
75 RID_PTREXTENT, RID_PTRVALUE,
78 RID_BOOL, RID_WCHAR, RID_CLASS,
79 RID_PUBLIC, RID_PRIVATE, RID_PROTECTED,
80 RID_TEMPLATE, RID_NULL, RID_CATCH,
81 RID_DELETE, RID_FALSE, RID_NAMESPACE,
82 RID_NEW, RID_OPERATOR, RID_THIS,
83 RID_THROW, RID_TRUE, RID_TRY,
84 RID_TYPENAME, RID_TYPEID, RID_USING,
87 RID_CONSTCAST, RID_DYNCAST, RID_REINTCAST, RID_STATCAST,
89 /* alternate spellings */
90 RID_AND, RID_AND_EQ, RID_NOT, RID_NOT_EQ,
91 RID_OR, RID_OR_EQ, RID_XOR, RID_XOR_EQ,
92 RID_BITAND, RID_BITOR, RID_COMPL,
95 RID_ID, RID_AT_ENCODE, RID_AT_END,
96 RID_AT_CLASS, RID_AT_ALIAS, RID_AT_DEFS,
97 RID_AT_PRIVATE, RID_AT_PROTECTED, RID_AT_PUBLIC,
98 RID_AT_PROTOCOL, RID_AT_SELECTOR, RID_AT_INTERFACE,
99 RID_AT_IMPLEMENTATION,
103 RID_FIRST_MODIFIER = RID_STATIC,
104 RID_LAST_MODIFIER = RID_ONEWAY
107 /* The elements of `ridpointers' are identifier nodes for the reserved
108 type names and storage classes. It is indexed by a RID_... value. */
109 extern tree *ridpointers;
111 /* Standard named or nameless data types of the C compiler. */
116 CTI_SIGNED_WCHAR_TYPE,
117 CTI_UNSIGNED_WCHAR_TYPE,
119 CTI_C_SIZE_TYPE, /* The type used for the size_t typedef and the
120 result type of sizeof (an ordinary type without
121 TYPE_IS_SIZETYPE set, unlike the internal
123 CTI_SIGNED_SIZE_TYPE, /* For format checking only. */
124 CTI_UNSIGNED_PTRDIFF_TYPE, /* For format checking only. */
127 CTI_WIDEST_INT_LIT_TYPE,
128 CTI_WIDEST_UINT_LIT_TYPE,
131 CTI_WCHAR_ARRAY_TYPE,
134 CTI_CONST_STRING_TYPE,
136 /* Type for boolean expressions (bool in C++, int in C). */
140 /* C99's _Bool type. */
144 CTI_DEFAULT_FUNCTION_TYPE,
150 CTI_PTR_FTYPE_SIZETYPE,
152 CTI_G77_INTEGER_TYPE,
153 CTI_G77_UINTEGER_TYPE,
154 CTI_G77_LONGINT_TYPE,
155 CTI_G77_ULONGINT_TYPE,
157 /* These are not types, but we have to look them up all the time. */
159 CTI_PRETTY_FUNCTION_ID,
167 #define wchar_type_node c_global_trees[CTI_WCHAR_TYPE]
168 #define signed_wchar_type_node c_global_trees[CTI_SIGNED_WCHAR_TYPE]
169 #define unsigned_wchar_type_node c_global_trees[CTI_UNSIGNED_WCHAR_TYPE]
170 #define wint_type_node c_global_trees[CTI_WINT_TYPE]
171 #define c_size_type_node c_global_trees[CTI_C_SIZE_TYPE]
172 #define signed_size_type_node c_global_trees[CTI_SIGNED_SIZE_TYPE]
173 #define unsigned_ptrdiff_type_node c_global_trees[CTI_UNSIGNED_PTRDIFF_TYPE]
174 #define intmax_type_node c_global_trees[CTI_INTMAX_TYPE]
175 #define uintmax_type_node c_global_trees[CTI_UINTMAX_TYPE]
176 #define widest_integer_literal_type_node c_global_trees[CTI_WIDEST_INT_LIT_TYPE]
177 #define widest_unsigned_literal_type_node c_global_trees[CTI_WIDEST_UINT_LIT_TYPE]
179 #define boolean_type_node c_global_trees[CTI_BOOLEAN_TYPE]
180 #define boolean_true_node c_global_trees[CTI_BOOLEAN_TRUE]
181 #define boolean_false_node c_global_trees[CTI_BOOLEAN_FALSE]
183 #define c_bool_type_node c_global_trees[CTI_C_BOOL_TYPE]
184 #define c_bool_true_node c_global_trees[CTI_C_BOOL_TRUE]
185 #define c_bool_false_node c_global_trees[CTI_C_BOOL_FALSE]
187 #define char_array_type_node c_global_trees[CTI_CHAR_ARRAY_TYPE]
188 #define wchar_array_type_node c_global_trees[CTI_WCHAR_ARRAY_TYPE]
189 #define int_array_type_node c_global_trees[CTI_INT_ARRAY_TYPE]
190 #define string_type_node c_global_trees[CTI_STRING_TYPE]
191 #define const_string_type_node c_global_trees[CTI_CONST_STRING_TYPE]
193 #define default_function_type c_global_trees[CTI_DEFAULT_FUNCTION_TYPE]
194 #define void_list_node c_global_trees[CTI_VOID_LIST]
195 #define void_ftype c_global_trees[CTI_VOID_FTYPE]
196 #define void_ftype_ptr c_global_trees[CTI_VOID_FTYPE_PTR]
197 #define int_ftype_int c_global_trees[CTI_INT_FTYPE_INT]
198 #define ptr_ftype_sizetype c_global_trees[CTI_PTR_FTYPE_SIZETYPE]
200 /* g77 integer types, which which must be kept in sync with f/com.h */
201 #define g77_integer_type_node c_global_trees[CTI_G77_INTEGER_TYPE]
202 #define g77_uinteger_type_node c_global_trees[CTI_G77_UINTEGER_TYPE]
203 #define g77_longint_type_node c_global_trees[CTI_G77_LONGINT_TYPE]
204 #define g77_ulongint_type_node c_global_trees[CTI_G77_ULONGINT_TYPE]
206 #define function_id_node c_global_trees[CTI_FUNCTION_ID]
207 #define pretty_function_id_node c_global_trees[CTI_PRETTY_FUNCTION_ID]
208 #define func_id_node c_global_trees[CTI_FUNC_ID]
210 /* A node for `((void) 0)'. */
211 #define void_zero_node c_global_trees[CTI_VOID_ZERO]
213 extern tree c_global_trees[CTI_MAX];
215 /* Mark which labels are explicitly declared.
216 These may be shadowed, and may be referenced from nested functions. */
217 #define C_DECLARED_LABEL_FLAG(label) TREE_LANG_FLAG_1 (label)
219 typedef enum c_language_kind
221 clk_c, /* A dialect of C: K&R C, ANSI/ISO C89, C2000,
223 clk_cplusplus, /* ANSI/ISO C++ */
224 clk_objective_c /* Objective C */
228 /* Information about a statement tree. */
231 /* The last statement added to the tree. */
233 /* The type of the last expression statement. (This information is
234 needed to implement the statement-expression extension.) */
235 tree x_last_expr_type;
236 /* In C++, Non-zero if we should treat statements as full
237 expressions. In particular, this variable is no-zero if at the
238 end of a statement we should destroy any temporaries created
239 during that statement. Similarly, if, at the end of a block, we
240 should destroy any local variables in this block. Normally, this
241 variable is non-zero, since those are the normal semantics of
244 However, in order to represent aggregate initialization code as
245 tree structure, we use statement-expressions. The statements
246 within the statement expression should not result in cleanups
247 being run until the entire enclosing statement is complete.
249 This flag has no effect in C. */
250 int stmts_are_full_exprs_p;
253 typedef struct stmt_tree_s *stmt_tree;
255 /* Global state pertinent to the current function. Some C dialects
256 extend this structure with additional fields. */
258 struct language_function {
259 /* While we are parsing the function, this contains information
260 about the statement-tree that we are building. */
261 struct stmt_tree_s x_stmt_tree;
262 /* The stack of SCOPE_STMTs for the current function. */
263 tree x_scope_stmt_stack;
264 /* Nonzero if __FUNCTION__ and its ilk have been declared in this
266 int x_function_name_declared_p;
269 /* When building a statement-tree, this is the last statement added to
272 #define last_tree (current_stmt_tree ()->x_last_stmt)
274 /* The type of the last expression-statement we have seen. */
276 #define last_expr_type (current_stmt_tree ()->x_last_expr_type)
278 /* LAST_TREE contains the last statement parsed. These are chained
279 together through the TREE_CHAIN field, but often need to be
280 re-organized since the parse is performed bottom-up. This macro
281 makes LAST_TREE the indicated SUBSTMT of STMT. */
283 #define RECHAIN_STMTS(stmt, substmt) \
285 substmt = TREE_CHAIN (stmt); \
286 TREE_CHAIN (stmt) = NULL_TREE; \
290 /* Language-specific hooks. */
292 extern int (*lang_statement_code_p) PARAMS ((enum tree_code));
293 extern void (*lang_expand_stmt) PARAMS ((tree));
294 extern void (*lang_expand_decl_stmt) PARAMS ((tree));
295 extern void (*lang_expand_function_end) PARAMS ((void));
297 /* The type of a function that walks over tree structure. */
299 typedef tree (*walk_tree_fn) PARAMS ((tree *,
303 extern stmt_tree current_stmt_tree PARAMS ((void));
304 extern tree *current_scope_stmt_stack PARAMS ((void));
305 extern void begin_stmt_tree PARAMS ((tree *));
306 extern tree add_stmt PARAMS ((tree));
307 extern void add_decl_stmt PARAMS ((tree));
308 extern tree add_scope_stmt PARAMS ((int, int));
309 extern void finish_stmt_tree PARAMS ((tree *));
311 extern int statement_code_p PARAMS ((enum tree_code));
312 extern tree walk_stmt_tree PARAMS ((tree *,
315 extern void prep_stmt PARAMS ((tree));
316 extern void expand_stmt PARAMS ((tree));
317 extern void mark_stmt_tree PARAMS ((void *));
319 /* Extra information associated with a DECL. Other C dialects extend
320 this structure in various ways. The C front-end only uses this
321 structure for FUNCTION_DECLs; all other DECLs have a NULL
322 DECL_LANG_SPECIFIC field. */
325 /* In a FUNCTION_DECL, this is DECL_SAVED_TREE. */
329 /* In a FUNCTION_DECL, the saved representation of the body of the
330 entire function. Usually a COMPOUND_STMT, but in C++ this may also
331 be a RETURN_INIT, CTOR_INITIALIZER, or TRY_BLOCK. */
332 #define DECL_SAVED_TREE(NODE) \
333 (((struct c_lang_decl *) DECL_LANG_SPECIFIC (FUNCTION_DECL_CHECK (NODE))) \
336 extern void c_mark_lang_decl PARAMS ((struct c_lang_decl *));
338 /* The variant of the C language being processed. Each C language
339 front-end defines this variable. */
341 extern c_language_kind c_language;
343 /* Nonzero means give string constants the type `const char *', rather
346 extern int flag_const_strings;
348 /* Warn about *printf or *scanf format/argument anomalies. */
350 extern int warn_format;
352 /* Warn about possible violations of sequence point rules. */
354 extern int warn_sequence_point;
356 /* Warn about functions which might be candidates for format attributes. */
358 extern int warn_missing_format_attribute;
360 /* Nonzero means do some things the same way PCC does. */
362 extern int flag_traditional;
364 /* Nonzero means enable C89 Amendment 1 features, other than digraphs. */
366 extern int flag_isoc94;
368 /* Nonzero means use the ISO C99 dialect of C. */
370 extern int flag_isoc99;
372 /* Nonzero means accept digraphs. */
374 extern int flag_digraphs;
376 /* Nonzero means environment is hosted (i.e., not freestanding) */
378 extern int flag_hosted;
380 /* Nonzero means add default format_arg attributes for functions not
383 extern int flag_noniso_default_format_attributes;
385 /* Nonzero means don't recognize any builtin functions. */
387 extern int flag_no_builtin;
389 /* Nonzero means don't recognize the non-ANSI builtin functions.
392 extern int flag_no_nonansi_builtin;
394 /* If non-NULL, dump the tree structure for the entire translation
395 unit to this file. */
397 extern const char *flag_dump_translation_unit;
399 /* Nonzero means warn about suggesting putting in ()'s. */
401 extern int warn_parentheses;
403 /* Warn if a type conversion is done that might have confusing results. */
405 extern int warn_conversion;
407 /* C types are partitioned into three subsets: object, function, and
409 #define C_TYPE_OBJECT_P(type) \
410 (TREE_CODE (type) != FUNCTION_TYPE && TYPE_SIZE (type))
412 #define C_TYPE_INCOMPLETE_P(type) \
413 (TREE_CODE (type) != FUNCTION_TYPE && TYPE_SIZE (type) == 0)
415 #define C_TYPE_FUNCTION_P(type) \
416 (TREE_CODE (type) == FUNCTION_TYPE)
418 /* Return the qualifiers that apply to this type. In C++, that means
419 descending through array types. Note that this macro evaluates its
420 arguments mor than once. */
421 #define C_TYPE_QUALS(TYPE) \
422 (TYPE_QUALS ((TREE_CODE (TYPE) == ARRAY_TYPE \
423 && c_language == clk_cplusplus) \
424 ? strip_array_types (TYPE) : TYPE))
426 /* For convenience we define a single macro to identify the class of
427 object or incomplete types. */
428 #define C_TYPE_OBJECT_OR_INCOMPLETE_P(type) \
429 (!C_TYPE_FUNCTION_P (type))
431 /* Record in each node resulting from a binary operator
432 what operator was specified for it. */
433 #define C_EXP_ORIGINAL_CODE(exp) ((enum tree_code) TREE_COMPLEXITY (exp))
435 /* Pointer to function to generate the VAR_DECL for __FUNCTION__ etc.
436 ID is the identifier to use, NAME is the string.
437 TYPE_DEP indicates whether it depends on type of the function or not
438 (i.e. __PRETTY_FUNCTION__). */
440 extern tree (*make_fname_decl) PARAMS ((tree, const char *, int));
442 extern void declare_function_name PARAMS ((void));
443 extern void decl_attributes PARAMS ((tree, tree, tree));
444 extern void init_function_format_info PARAMS ((void));
445 extern void check_function_format PARAMS ((int *, tree, tree, tree));
446 extern void c_apply_type_quals_to_decl PARAMS ((int, tree));
447 /* Print an error message for invalid operands to arith operation CODE.
448 NOP_EXPR is used as a special case (see truthvalue_conversion). */
449 extern void binary_op_error PARAMS ((enum tree_code));
450 extern void c_expand_expr_stmt PARAMS ((tree));
451 extern void c_expand_start_cond PARAMS ((tree, int));
452 extern void c_finish_then PARAMS ((void));
453 extern void c_expand_start_else PARAMS ((void));
454 extern void c_finish_else PARAMS ((void));
455 extern void c_expand_end_cond PARAMS ((void));
456 /* Validate the expression after `case' and apply default promotions. */
457 extern tree check_case_value PARAMS ((tree));
458 /* Concatenate a list of STRING_CST nodes into one STRING_CST. */
459 extern tree combine_strings PARAMS ((tree));
460 extern void constant_expression_warning PARAMS ((tree));
461 extern tree convert_and_check PARAMS ((tree, tree));
462 extern void overflow_warning PARAMS ((tree));
463 extern void unsigned_conversion_warning PARAMS ((tree, tree));
465 /* Read the rest of the current #-directive line. */
466 extern char *get_directive_line PARAMS ((void));
467 #define GET_DIRECTIVE_LINE() get_directive_line ()
469 /* Subroutine of build_binary_op, used for comparison operations.
470 See if the operands have both been converted from subword integer types
471 and, if so, perhaps change them both back to their original type. */
472 extern tree shorten_compare PARAMS ((tree *, tree *, tree *, enum tree_code *));
473 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
474 or validate its data type for an `if' or `while' statement or ?..: exp. */
475 extern tree truthvalue_conversion PARAMS ((tree));
476 extern tree type_for_mode PARAMS ((enum machine_mode, int));
477 extern tree type_for_size PARAMS ((unsigned, int));
479 extern unsigned int min_precision PARAMS ((tree, int));
481 /* Add qualifiers to a type, in the fashion for C. */
482 extern tree c_build_qualified_type PARAMS ((tree, int));
484 /* Build tree nodes and builtin functions common to both C and C++ language
486 extern void c_common_nodes_and_builtins PARAMS ((void));
488 extern tree build_va_arg PARAMS ((tree, tree));
490 /* Nonzero if the type T promotes to itself.
491 ANSI C states explicitly the list of types that promote;
492 in particular, short promotes to int even if they have the same width. */
493 #define C_PROMOTING_INTEGER_TYPE_P(t) \
494 (TREE_CODE ((t)) == INTEGER_TYPE \
495 && (TYPE_MAIN_VARIANT (t) == char_type_node \
496 || TYPE_MAIN_VARIANT (t) == signed_char_type_node \
497 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node \
498 || TYPE_MAIN_VARIANT (t) == short_integer_type_node \
499 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node))
501 extern int self_promoting_args_p PARAMS ((tree));
502 extern tree simple_type_promotes_to PARAMS ((tree));
503 extern tree strip_array_types PARAMS ((tree));
505 /* These macros provide convenient access to the various _STMT nodes. */
507 /* Nonzero if this statement should be considered a full-expression,
508 i.e., if temporaries created during this statement should have
509 their destructors run at the end of this statement. (In C, this
510 will always be false, since there are no destructors.) */
511 #define STMT_IS_FULL_EXPR_P(NODE) TREE_LANG_FLAG_1 ((NODE))
513 /* IF_STMT accessors. These give access to the condtion of the if
514 statement, the then block of the if statement, and the else block
515 of the if stsatement if it exists. */
516 #define IF_COND(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 0)
517 #define THEN_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 1)
518 #define ELSE_CLAUSE(NODE) TREE_OPERAND (IF_STMT_CHECK (NODE), 2)
520 /* WHILE_STMT accessors. These give access to the condtion of the
521 while statement and the body of the while statement, respectively. */
522 #define WHILE_COND(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 0)
523 #define WHILE_BODY(NODE) TREE_OPERAND (WHILE_STMT_CHECK (NODE), 1)
525 /* DO_STMT accessors. These give access to the condition of the do
526 statement and the body of the do statement, respectively. */
527 #define DO_COND(NODE) TREE_OPERAND (DO_STMT_CHECK (NODE), 0)
528 #define DO_BODY(NODE) TREE_OPERAND (DO_STMT_CHECK (NODE), 1)
530 /* RETURN_STMT accessor. This gives the expression associated with a
532 #define RETURN_EXPR(NODE) TREE_OPERAND (RETURN_STMT_CHECK (NODE), 0)
534 /* EXPR_STMT accessor. This gives the expression associated with an
535 expression statement. */
536 #define EXPR_STMT_EXPR(NODE) TREE_OPERAND (EXPR_STMT_CHECK (NODE), 0)
538 /* FOR_STMT accessors. These give access to the init statement,
539 condition, update expression, and body of the for statement,
541 #define FOR_INIT_STMT(NODE) TREE_OPERAND (FOR_STMT_CHECK (NODE), 0)
542 #define FOR_COND(NODE) TREE_OPERAND (FOR_STMT_CHECK (NODE), 1)
543 #define FOR_EXPR(NODE) TREE_OPERAND (FOR_STMT_CHECK (NODE), 2)
544 #define FOR_BODY(NODE) TREE_OPERAND (FOR_STMT_CHECK (NODE), 3)
546 /* SWITCH_STMT accessors. These give access to the condition and body
547 of the switch statement, respectively. */
548 #define SWITCH_COND(NODE) TREE_OPERAND (SWITCH_STMT_CHECK (NODE), 0)
549 #define SWITCH_BODY(NODE) TREE_OPERAND (SWITCH_STMT_CHECK (NODE), 1)
551 /* CASE_LABEL accessors. These give access to the high and low values
552 of a case label, respectively. */
553 #define CASE_LOW(NODE) TREE_OPERAND (CASE_LABEL_CHECK (NODE), 0)
554 #define CASE_HIGH(NODE) TREE_OPERAND (CASE_LABEL_CHECK (NODE), 1)
555 #define CASE_LABEL_DECL(NODE) TREE_OPERAND (CASE_LABEL_CHECK (NODE), 2)
557 /* GOTO_STMT accessor. This gives access to the label associated with
559 #define GOTO_DESTINATION(NODE) TREE_OPERAND (GOTO_STMT_CHECK (NODE), 0)
561 /* COMPOUND_STMT accessor. This gives access to the TREE_LIST of
562 statements assocated with a compound statement. The result is the
563 first statement in the list. Succeeding nodes can be acccessed by
564 calling TREE_CHAIN on a node in the list. */
565 #define COMPOUND_BODY(NODE) TREE_OPERAND (COMPOUND_STMT_CHECK (NODE), 0)
567 /* ASM_STMT accessors. ASM_STRING returns a STRING_CST for the
568 instruction (e.g., "mov x, y"). ASM_OUTPUTS, ASM_INPUTS, and
569 ASM_CLOBBERS represent the outputs, inputs, and clobbers for the
571 #define ASM_CV_QUAL(NODE) TREE_OPERAND (ASM_STMT_CHECK (NODE), 0)
572 #define ASM_STRING(NODE) TREE_OPERAND (ASM_STMT_CHECK (NODE), 1)
573 #define ASM_OUTPUTS(NODE) TREE_OPERAND (ASM_STMT_CHECK (NODE), 2)
574 #define ASM_INPUTS(NODE) TREE_OPERAND (ASM_STMT_CHECK (NODE), 3)
575 #define ASM_CLOBBERS(NODE) TREE_OPERAND (ASM_STMT_CHECK (NODE), 4)
577 /* DECL_STMT accessor. This gives access to the DECL associated with
578 the given declaration statement. */
579 #define DECL_STMT_DECL(NODE) TREE_OPERAND (DECL_STMT_CHECK (NODE), 0)
581 /* STMT_EXPR accessor. */
582 #define STMT_EXPR_STMT(NODE) TREE_OPERAND (STMT_EXPR_CHECK (NODE), 0)
584 /* LABEL_STMT accessor. This gives access to the label associated with
585 the given label statement. */
586 #define LABEL_STMT_LABEL(NODE) TREE_OPERAND (LABEL_STMT_CHECK (NODE), 0)
588 /* Nonzero if this SCOPE_STMT is for the beginning of a scope. */
589 #define SCOPE_BEGIN_P(NODE) \
590 (TREE_LANG_FLAG_0 (SCOPE_STMT_CHECK (NODE)))
592 /* Nonzero if this SCOPE_STMT is for the end of a scope. */
593 #define SCOPE_END_P(NODE) \
594 (!SCOPE_BEGIN_P (SCOPE_STMT_CHECK (NODE)))
596 /* The BLOCK containing the declarations contained in this scope. */
597 #define SCOPE_STMT_BLOCK(NODE) \
598 (TREE_OPERAND (SCOPE_STMT_CHECK (NODE), 0))
600 /* Nonzero for a SCOPE_STMT if there were no variables in this scope. */
601 #define SCOPE_NULLIFIED_P(NODE) \
602 (SCOPE_STMT_BLOCK ((NODE)) == NULL_TREE)
604 /* Nonzero for a SCOPE_STMT which represents a lexical scope, but
605 which should be treated as non-existant from the point of view of
606 running cleanup actions. */
607 #define SCOPE_NO_CLEANUPS_P(NODE) \
608 (TREE_LANG_FLAG_3 (SCOPE_STMT_CHECK (NODE)))
610 /* Nonzero for a SCOPE_STMT if this statement is for a partial scope.
618 there is (implicitly) a new scope after `l', even though there are
619 no curly braces. In particular, when we hit the goto, we must
620 destroy s2 and then re-construct it. For the implicit scope,
621 SCOPE_PARTIAL_P will be set. */
622 #define SCOPE_PARTIAL_P(NODE) \
623 (TREE_LANG_FLAG_4 (SCOPE_STMT_CHECK (NODE)))
625 /* Nonzero for an ASM_STMT if the assembly statement is volatile. */
626 #define ASM_VOLATILE_P(NODE) \
627 (ASM_CV_QUAL (ASM_STMT_CHECK (NODE)) != NULL_TREE)
629 /* The line-number at which a statement began. But if
630 STMT_LINENO_FOR_FN_P does holds, then this macro gives the
631 line number for the end of the current function instead. */
632 #define STMT_LINENO(NODE) \
633 (TREE_COMPLEXITY ((NODE)))
635 /* If non-zero, the STMT_LINENO for NODE is the line at which the
637 #define STMT_LINENO_FOR_FN_P(NODE) \
638 (TREE_LANG_FLAG_2 ((NODE)))
640 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
641 initialization variables. */
642 #define NEW_FOR_SCOPE_P(NODE) (TREE_LANG_FLAG_0 (NODE))
644 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) SYM,
647 C_DUMMY_TREE_CODE = LAST_AND_UNUSED_TREE_CODE,
648 #include "c-common.def"
654 extern void add_c_tree_codes PARAMS ((void));
655 extern void genrtl_do_pushlevel PARAMS ((void));
656 extern void genrtl_goto_stmt PARAMS ((tree));
657 extern void genrtl_expr_stmt PARAMS ((tree));
658 extern void genrtl_decl_stmt PARAMS ((tree));
659 extern void genrtl_if_stmt PARAMS ((tree));
660 extern void genrtl_while_stmt PARAMS ((tree));
661 extern void genrtl_do_stmt PARAMS ((tree));
662 extern void genrtl_return_stmt PARAMS ((tree));
663 extern void genrtl_for_stmt PARAMS ((tree));
664 extern void genrtl_break_stmt PARAMS ((void));
665 extern void genrtl_continue_stmt PARAMS ((void));
666 extern void genrtl_scope_stmt PARAMS ((tree));
667 extern void genrtl_switch_stmt PARAMS ((tree));
668 extern void genrtl_case_label PARAMS ((tree));
669 extern void genrtl_compound_stmt PARAMS ((tree));
670 extern void genrtl_asm_stmt PARAMS ((tree, tree,
673 extern void genrtl_decl_cleanup PARAMS ((tree, tree));
674 extern int stmts_are_full_exprs_p PARAMS ((void));
675 extern int anon_aggr_type_p PARAMS ((tree));
677 /* For a VAR_DECL that is an anonymous union, these are the various
678 sub-variables that make up the anonymous union. */
679 #define DECL_ANON_UNION_ELEMS(NODE) DECL_ARGUMENTS ((NODE))
681 /* In a FIELD_DECL, nonzero if the decl was originally a bitfield. */
682 #define DECL_C_BIT_FIELD(NODE) \
683 (DECL_LANG_FLAG_4 (FIELD_DECL_CHECK (NODE)) == 1)
684 #define SET_DECL_C_BIT_FIELD(NODE) \
685 (DECL_LANG_FLAG_4 (FIELD_DECL_CHECK (NODE)) = 1)
686 #define CLEAR_DECL_C_BIT_FIELD(NODE) \
687 (DECL_LANG_FLAG_4 (FIELD_DECL_CHECK (NODE)) = 0)
689 /* In a VAR_DECL, nonzero if the decl is a register variable with
690 an explicit asm specification. */
691 #define DECL_C_HARD_REGISTER(DECL) DECL_LANG_FLAG_4 (VAR_DECL_CHECK (DECL))
693 extern void emit_local_var PARAMS ((tree));
694 extern void make_rtl_for_local_static PARAMS ((tree));
695 extern tree expand_cond PARAMS ((tree));
696 extern void c_expand_return PARAMS ((tree));
697 extern void do_case PARAMS ((tree, tree));
698 extern tree build_stmt PARAMS ((enum tree_code, ...));
699 extern tree build_case_label PARAMS ((tree, tree, tree));
700 extern tree build_continue_stmt PARAMS ((void));
701 extern tree build_break_stmt PARAMS ((void));
702 extern tree build_return_stmt PARAMS ((tree));
704 #define COMPOUND_STMT_NO_SCOPE(NODE) TREE_LANG_FLAG_0 (NODE)
706 extern void c_expand_asm_operands PARAMS ((tree, tree, tree, tree, int, const char *, int));
708 /* These functions must be defined by each front-end which implements
709 a variant of the C language. They are used in c-common.c. */
711 extern tree build_unary_op PARAMS ((enum tree_code,
713 extern tree build_binary_op PARAMS ((enum tree_code,
715 extern int lvalue_p PARAMS ((tree));
716 extern tree default_conversion PARAMS ((tree));
718 /* Given two integer or real types, return the type for their sum.
719 Given two compatible ANSI C types, returns the merged type. */
721 extern tree common_type PARAMS ((tree, tree));
723 extern tree expand_tree_builtin PARAMS ((tree, tree, tree));
725 extern tree decl_constant_value PARAMS ((tree));
727 /* Handle increment and decrement of boolean types. */
728 extern tree boolean_increment PARAMS ((enum tree_code,
731 /* Hook currently used only by the C++ front end to reset internal state
732 after entering or leaving a header file. */
733 extern void extract_interface_info PARAMS ((void));
735 extern void mark_c_language_function PARAMS ((struct language_function *));
737 extern int case_compare PARAMS ((splay_tree_key,
740 extern tree c_add_case_label PARAMS ((splay_tree,
744 extern tree build_function_call PARAMS ((tree, tree));
746 /* If this variable is defined to a non-NULL value, it will be called
747 after the file has been completely parsed. The argument will be
748 the GLOBAL_NAMESPACE in C++, or the list of top-level declarations
750 extern void (*back_end_hook) PARAMS ((tree));
754 extern struct rtx_def *c_expand_expr PARAMS ((tree, rtx,
756 enum expand_modifier));
758 extern int c_safe_from_p PARAMS ((rtx, tree));
761 extern int c_unsafe_for_reeval PARAMS ((tree));
765 typedef struct dump_info *dump_info_p;
767 /* A callback function used dump language-specific parts of tree
768 nodes. Returns non-zero if it does not want the usual dumping of
769 the second argument. */
771 typedef int (*dump_tree_fn) PARAMS ((dump_info_p, tree));
773 extern dump_tree_fn lang_dump_tree;
775 extern void dump_node_to_file PARAMS ((tree, const char *));
777 /* Information recorded about each file examined during compilation. */
781 int time; /* Time spent in the file. */
782 short interface_only; /* Flags - used only by C++ */
783 short interface_unknown;
786 struct c_fileinfo *get_fileinfo PARAMS ((const char *));
787 extern void dump_time_statistics PARAMS ((void));