1 /* Subroutines shared by all languages that are variants of C.
2 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
37 cpp_reader *parse_in; /* Declared in c-lex.h. */
39 #undef WCHAR_TYPE_SIZE
40 #define WCHAR_TYPE_SIZE TYPE_PRECISION (wchar_type_node)
42 /* We let tm.h override the types used here, to handle trivial differences
43 such as the choice of unsigned int or long unsigned int for size_t.
44 When machines start needing nontrivial differences in the size type,
45 it would be best to do something here to figure out automatically
46 from other information what type to use. */
49 #define SIZE_TYPE "long unsigned int"
53 #define WCHAR_TYPE "int"
57 #define PTRDIFF_TYPE "long int"
61 #define WINT_TYPE "unsigned int"
65 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
67 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
73 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
75 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
76 ? "long unsigned int" \
77 : "long long unsigned int"))
80 /* The following symbols are subsumed in the c_global_trees array, and
81 listed here individually for documentation purposes.
83 INTEGER_TYPE and REAL_TYPE nodes for the standard data types.
85 tree short_integer_type_node;
86 tree long_integer_type_node;
87 tree long_long_integer_type_node;
89 tree short_unsigned_type_node;
90 tree long_unsigned_type_node;
91 tree long_long_unsigned_type_node;
93 tree boolean_type_node;
94 tree boolean_false_node;
95 tree boolean_true_node;
97 tree ptrdiff_type_node;
99 tree unsigned_char_type_node;
100 tree signed_char_type_node;
101 tree wchar_type_node;
102 tree signed_wchar_type_node;
103 tree unsigned_wchar_type_node;
105 tree float_type_node;
106 tree double_type_node;
107 tree long_double_type_node;
109 tree complex_integer_type_node;
110 tree complex_float_type_node;
111 tree complex_double_type_node;
112 tree complex_long_double_type_node;
114 tree intQI_type_node;
115 tree intHI_type_node;
116 tree intSI_type_node;
117 tree intDI_type_node;
118 tree intTI_type_node;
120 tree unsigned_intQI_type_node;
121 tree unsigned_intHI_type_node;
122 tree unsigned_intSI_type_node;
123 tree unsigned_intDI_type_node;
124 tree unsigned_intTI_type_node;
126 tree widest_integer_literal_type_node;
127 tree widest_unsigned_literal_type_node;
129 Nodes for types `void *' and `const void *'.
131 tree ptr_type_node, const_ptr_type_node;
133 Nodes for types `char *' and `const char *'.
135 tree string_type_node, const_string_type_node;
137 Type `char[SOMENUMBER]'.
138 Used when an array of char is needed and the size is irrelevant.
140 tree char_array_type_node;
142 Type `int[SOMENUMBER]' or something like it.
143 Used when an array of int needed and the size is irrelevant.
145 tree int_array_type_node;
147 Type `wchar_t[SOMENUMBER]' or something like it.
148 Used when a wide string literal is created.
150 tree wchar_array_type_node;
152 Type `int ()' -- used for implicit declaration of functions.
154 tree default_function_type;
156 A VOID_TYPE node, packaged in a TREE_LIST.
160 The lazily created VAR_DECLS for __FUNCTION__, __PRETTY_FUNCTION__,
161 and __func__. (C doesn't generate __FUNCTION__ and__PRETTY_FUNCTION__
162 VAR_DECLS, but C++ does.)
164 tree function_name_decl_node;
165 tree pretty_function_name_declnode;
166 tree c99_function_name_decl_node;
168 Stack of nested function name VAR_DECLs.
170 tree saved_function_name_decls;
174 tree c_global_trees[CTI_MAX];
176 /* Nonzero means don't recognize the non-ANSI builtin functions. */
180 /* Nonzero means don't recognize the non-ANSI builtin functions.
183 int flag_no_nonansi_builtin;
185 /* Nonzero means give `double' the same size as `float'. */
187 int flag_short_double;
189 /* Nonzero means give `wchar_t' the same size as `short'. */
191 int flag_short_wchar;
193 /* Nonzero means warn about possible violations of sequence point rules. */
195 int warn_sequence_point;
197 /* The elements of `ridpointers' are identifier nodes for the reserved
198 type names and storage classes. It is indexed by a RID_... value. */
201 tree (*make_fname_decl) PARAMS ((tree, int));
203 /* If non-NULL, the address of a language-specific function that
204 returns 1 for language-specific statement codes. */
205 int (*lang_statement_code_p) PARAMS ((enum tree_code));
207 /* If non-NULL, the address of a language-specific function that takes
208 any action required right before expand_function_end is called. */
209 void (*lang_expand_function_end) PARAMS ((void));
211 /* If this variable is defined to a non-NULL value, it will be called
212 after the file has been completely parsed. */
213 void (*back_end_hook) PARAMS ((tree));
215 /* Nonzero means the expression being parsed will never be evaluated.
216 This is a count, since unevaluated expressions can nest. */
219 enum attrs {A_PACKED, A_NOCOMMON, A_COMMON, A_NORETURN, A_CONST, A_T_UNION,
220 A_NO_CHECK_MEMORY_USAGE, A_NO_INSTRUMENT_FUNCTION,
221 A_CONSTRUCTOR, A_DESTRUCTOR, A_MODE, A_SECTION, A_ALIGNED,
222 A_UNUSED, A_FORMAT, A_FORMAT_ARG, A_WEAK, A_ALIAS, A_MALLOC,
223 A_NO_LIMIT_STACK, A_PURE};
225 /* Information about how a function name is generated. */
228 tree *decl; /* pointer to the VAR_DECL. */
229 unsigned rid; /* RID number for the identifier. */
230 int pretty; /* How pretty is it? */
233 /* The three ways of getting then name of the current function. */
235 const struct fname_var_t fname_vars[] =
237 /* C99 compliant __func__, must be first. */
238 {&c99_function_name_decl_node, RID_C99_FUNCTION_NAME, 0},
239 /* GCC __FUNCTION__ compliant. */
240 {&function_name_decl_node, RID_FUNCTION_NAME, 0},
241 /* GCC __PRETTY_FUNCTION__ compliant. */
242 {&pretty_function_name_decl_node, RID_PRETTY_FUNCTION_NAME, 1},
246 static void add_attribute PARAMS ((enum attrs, const char *,
248 static void init_attributes PARAMS ((void));
249 static int default_valid_lang_attribute PARAMS ((tree, tree, tree, tree));
250 static int constant_fits_type_p PARAMS ((tree, tree));
252 /* Keep a stack of if statements. We record the number of compound
253 statements seen up to the if keyword, as well as the line number
254 and file of the if. If a potentially ambiguous else is seen, that
255 fact is recorded; the warning is issued when we can be sure that
256 the enclosing if statement does not have an else branch. */
266 static if_elt *if_stack;
268 /* Amount of space in the if statement stack. */
269 static int if_stack_space = 0;
272 static int if_stack_pointer = 0;
274 /* Record the start of an if-then, and record the start of it
275 for ambiguous else detection. */
278 c_expand_start_cond (cond, compstmt_count)
284 /* Make sure there is enough space on the stack. */
285 if (if_stack_space == 0)
288 if_stack = (if_elt *)xmalloc (10 * sizeof (if_elt));
290 else if (if_stack_space == if_stack_pointer)
292 if_stack_space += 10;
293 if_stack = (if_elt *)xrealloc (if_stack, if_stack_space * sizeof (if_elt));
296 if_stmt = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
297 IF_COND (if_stmt) = cond;
300 /* Record this if statement. */
301 if_stack[if_stack_pointer].compstmt_count = compstmt_count;
302 if_stack[if_stack_pointer].file = input_filename;
303 if_stack[if_stack_pointer].line = lineno;
304 if_stack[if_stack_pointer].needs_warning = 0;
305 if_stack[if_stack_pointer].if_stmt = if_stmt;
309 /* Called after the then-clause for an if-statement is processed. */
314 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
315 RECHAIN_STMTS (if_stmt, THEN_CLAUSE (if_stmt));
318 /* Record the end of an if-then. Optionally warn if a nested
319 if statement had an ambiguous else clause. */
325 if (if_stack[if_stack_pointer].needs_warning)
326 warning_with_file_and_line (if_stack[if_stack_pointer].file,
327 if_stack[if_stack_pointer].line,
328 "suggest explicit braces to avoid ambiguous `else'");
329 last_expr_type = NULL_TREE;
332 /* Called between the then-clause and the else-clause
333 of an if-then-else. */
336 c_expand_start_else ()
338 /* An ambiguous else warning must be generated for the enclosing if
339 statement, unless we see an else branch for that one, too. */
341 && if_stack_pointer > 1
342 && (if_stack[if_stack_pointer - 1].compstmt_count
343 == if_stack[if_stack_pointer - 2].compstmt_count))
344 if_stack[if_stack_pointer - 2].needs_warning = 1;
346 /* Even if a nested if statement had an else branch, it can't be
347 ambiguous if this one also has an else. So don't warn in that
348 case. Also don't warn for any if statements nested in this else. */
349 if_stack[if_stack_pointer - 1].needs_warning = 0;
350 if_stack[if_stack_pointer - 1].compstmt_count--;
353 /* Called after the else-clause for an if-statement is processed. */
358 tree if_stmt = if_stack[if_stack_pointer - 1].if_stmt;
359 RECHAIN_STMTS (if_stmt, ELSE_CLAUSE (if_stmt));
362 /* Push current bindings for the function name VAR_DECLS. */
368 tree saved = NULL_TREE;
370 for (ix = 0; fname_vars[ix].decl; ix++)
372 tree decl = *fname_vars[ix].decl;
376 saved = tree_cons (decl, build_int_2 (ix, 0), saved);
377 *fname_vars[ix].decl = NULL_TREE;
380 if (saved || saved_function_name_decls)
381 /* Normally they'll have been NULL, so only push if we've got a
382 stack, or they are non-NULL. */
383 saved_function_name_decls = tree_cons (saved, NULL_TREE,
384 saved_function_name_decls);
387 /* Finish up the current bindings, adding them into the
388 current function's statement tree. This is done by wrapping the
389 function's body in a COMPOUND_STMT containing these decls too. This
390 must be done _before_ finish_stmt_tree is called. If there is no
391 current function, we must be at file scope and no statements are
392 involved. Pop the previous bindings. */
395 finish_fname_decls ()
398 tree body = NULL_TREE;
399 tree stack = saved_function_name_decls;
401 for (; stack && TREE_VALUE (stack); stack = TREE_CHAIN (stack))
402 body = chainon (TREE_VALUE (stack), body);
406 /* They were called into existance, so add to statement tree. */
407 body = chainon (body,
408 TREE_CHAIN (DECL_SAVED_TREE (current_function_decl)));
409 body = build_stmt (COMPOUND_STMT, body);
411 COMPOUND_STMT_NO_SCOPE (body) = 1;
412 TREE_CHAIN (DECL_SAVED_TREE (current_function_decl)) = body;
415 for (ix = 0; fname_vars[ix].decl; ix++)
416 *fname_vars[ix].decl = NULL_TREE;
420 /* We had saved values, restore them. */
423 for (saved = TREE_PURPOSE (stack); saved; saved = TREE_CHAIN (saved))
425 tree decl = TREE_PURPOSE (saved);
426 unsigned ix = TREE_INT_CST_LOW (TREE_VALUE (saved));
428 *fname_vars[ix].decl = decl;
430 stack = TREE_CHAIN (stack);
432 saved_function_name_decls = stack;
435 /* Return the text name of the current function, suitable prettified
439 fname_as_string (pretty_p)
442 const char *name = NULL;
445 name = (current_function_decl
446 ? (*decl_printable_name) (current_function_decl, 2)
448 else if (current_function_decl && DECL_NAME (current_function_decl))
449 name = IDENTIFIER_POINTER (DECL_NAME (current_function_decl));
455 /* Return the text name of the current function, formatted as
456 required by the supplied RID value. */
464 for (ix = 0; fname_vars[ix].decl; ix++)
465 if (fname_vars[ix].rid == rid)
467 return fname_as_string (fname_vars[ix].pretty);
470 /* Return the VAR_DECL for a const char array naming the current
471 function. If the VAR_DECL has not yet been created, create it
472 now. RID indicates how it should be formatted and IDENTIFIER_NODE
473 ID is its name (unfortunately C and C++ hold the RID values of
474 keywords in different places, so we can't derive RID from ID in
475 this language independant code. */
483 tree decl = NULL_TREE;
485 for (ix = 0; fname_vars[ix].decl; ix++)
486 if (fname_vars[ix].rid == rid)
489 decl = *fname_vars[ix].decl;
492 tree saved_last_tree = last_tree;
494 decl = (*make_fname_decl) (id, fname_vars[ix].pretty);
495 if (last_tree != saved_last_tree)
497 /* We created some statement tree for the decl. This belongs
498 at the start of the function, so remove it now and reinsert
499 it after the function is complete. */
500 tree stmts = TREE_CHAIN (saved_last_tree);
502 TREE_CHAIN (saved_last_tree) = NULL_TREE;
503 last_tree = saved_last_tree;
504 saved_function_name_decls = tree_cons (decl, stmts,
505 saved_function_name_decls);
507 *fname_vars[ix].decl = decl;
509 if (!ix && !current_function_decl)
510 pedwarn_with_decl (decl, "`%s' is not defined outside of function scope");
515 /* Given a chain of STRING_CST nodes,
516 concatenate them into one STRING_CST
517 and give it a suitable array-of-chars data type. */
520 combine_strings (strings)
523 register tree value, t;
524 register int length = 1;
527 int wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
529 const int nchars_max = flag_isoc99 ? 4095 : 509;
531 if (TREE_CHAIN (strings))
533 /* More than one in the chain, so concatenate. */
534 register char *p, *q;
536 /* Don't include the \0 at the end of each substring,
537 except for the last one.
538 Count wide strings and ordinary strings separately. */
539 for (t = strings; t; t = TREE_CHAIN (t))
541 if (TREE_TYPE (t) == wchar_array_type_node)
543 wide_length += (TREE_STRING_LENGTH (t) - wchar_bytes);
547 length += (TREE_STRING_LENGTH (t) - 1);
550 /* If anything is wide, the non-wides will be converted,
551 which makes them take more space. */
553 length = length * wchar_bytes + wide_length;
557 /* Copy the individual strings into the new combined string.
558 If the combined string is wide, convert the chars to ints
559 for any individual strings that are not wide. */
562 for (t = strings; t; t = TREE_CHAIN (t))
564 int len = (TREE_STRING_LENGTH (t)
565 - ((TREE_TYPE (t) == wchar_array_type_node)
567 if ((TREE_TYPE (t) == wchar_array_type_node) == wide_flag)
569 memcpy (q, TREE_STRING_POINTER (t), len);
575 for (i = 0; i < len; i++)
577 if (BYTES_BIG_ENDIAN)
579 for (j=0; j<(WCHAR_TYPE_SIZE / BITS_PER_UNIT)-1; j++)
581 *q++ = TREE_STRING_POINTER (t)[i];
585 *q++ = TREE_STRING_POINTER (t)[i];
586 for (j=0; j<(WCHAR_TYPE_SIZE / BITS_PER_UNIT)-1; j++)
595 for (i = 0; i < wchar_bytes; i++)
601 value = build_string (length, p);
606 length = TREE_STRING_LENGTH (value);
607 if (TREE_TYPE (value) == wchar_array_type_node)
611 /* Compute the number of elements, for the array type. */
612 nchars = wide_flag ? length / wchar_bytes : length;
614 if (pedantic && nchars - 1 > nchars_max && c_language == clk_c)
615 pedwarn ("string length `%d' is greater than the length `%d' ISO C%d compilers are required to support",
616 nchars - 1, nchars_max, flag_isoc99 ? 99 : 89);
618 /* Create the array type for the string constant.
619 -Wwrite-strings says make the string constant an array of const char
620 so that copying it to a non-const pointer will get a warning.
621 For C++, this is the standard behavior. */
622 if (flag_const_strings
623 && (! flag_traditional && ! flag_writable_strings))
626 = build_type_variant (wide_flag ? wchar_type_node : char_type_node,
629 = build_array_type (elements,
630 build_index_type (build_int_2 (nchars - 1, 0)));
634 = build_array_type (wide_flag ? wchar_type_node : char_type_node,
635 build_index_type (build_int_2 (nchars - 1, 0)));
637 TREE_CONSTANT (value) = 1;
638 TREE_READONLY (value) = ! flag_writable_strings;
639 TREE_STATIC (value) = 1;
643 /* To speed up processing of attributes, we maintain an array of
644 IDENTIFIER_NODES and the corresponding attribute types. */
646 /* Array to hold attribute information. */
648 static struct {enum attrs id; tree name; int min, max, decl_req;} attrtab[50];
650 static int attrtab_idx = 0;
652 /* Add an entry to the attribute table above. */
655 add_attribute (id, string, min_len, max_len, decl_req)
658 int min_len, max_len;
663 attrtab[attrtab_idx].id = id;
664 attrtab[attrtab_idx].name = get_identifier (string);
665 attrtab[attrtab_idx].min = min_len;
666 attrtab[attrtab_idx].max = max_len;
667 attrtab[attrtab_idx++].decl_req = decl_req;
669 sprintf (buf, "__%s__", string);
671 attrtab[attrtab_idx].id = id;
672 attrtab[attrtab_idx].name = get_identifier (buf);
673 attrtab[attrtab_idx].min = min_len;
674 attrtab[attrtab_idx].max = max_len;
675 attrtab[attrtab_idx++].decl_req = decl_req;
678 /* Initialize attribute table. */
683 add_attribute (A_PACKED, "packed", 0, 0, 0);
684 add_attribute (A_NOCOMMON, "nocommon", 0, 0, 1);
685 add_attribute (A_COMMON, "common", 0, 0, 1);
686 add_attribute (A_NORETURN, "noreturn", 0, 0, 1);
687 add_attribute (A_NORETURN, "volatile", 0, 0, 1);
688 add_attribute (A_UNUSED, "unused", 0, 0, 0);
689 add_attribute (A_CONST, "const", 0, 0, 1);
690 add_attribute (A_T_UNION, "transparent_union", 0, 0, 0);
691 add_attribute (A_CONSTRUCTOR, "constructor", 0, 0, 1);
692 add_attribute (A_DESTRUCTOR, "destructor", 0, 0, 1);
693 add_attribute (A_MODE, "mode", 1, 1, 1);
694 add_attribute (A_SECTION, "section", 1, 1, 1);
695 add_attribute (A_ALIGNED, "aligned", 0, 1, 0);
696 add_attribute (A_FORMAT, "format", 3, 3, 1);
697 add_attribute (A_FORMAT_ARG, "format_arg", 1, 1, 1);
698 add_attribute (A_WEAK, "weak", 0, 0, 1);
699 add_attribute (A_ALIAS, "alias", 1, 1, 1);
700 add_attribute (A_NO_INSTRUMENT_FUNCTION, "no_instrument_function", 0, 0, 1);
701 add_attribute (A_NO_CHECK_MEMORY_USAGE, "no_check_memory_usage", 0, 0, 1);
702 add_attribute (A_MALLOC, "malloc", 0, 0, 1);
703 add_attribute (A_NO_LIMIT_STACK, "no_stack_limit", 0, 0, 1);
704 add_attribute (A_PURE, "pure", 0, 0, 1);
707 /* Default implementation of valid_lang_attribute, below. By default, there
708 are no language-specific attributes. */
711 default_valid_lang_attribute (attr_name, attr_args, decl, type)
712 tree attr_name ATTRIBUTE_UNUSED;
713 tree attr_args ATTRIBUTE_UNUSED;
714 tree decl ATTRIBUTE_UNUSED;
715 tree type ATTRIBUTE_UNUSED;
720 /* Return a 1 if ATTR_NAME and ATTR_ARGS denote a valid language-specific
721 attribute for either declaration DECL or type TYPE and 0 otherwise. */
723 int (*valid_lang_attribute) PARAMS ((tree, tree, tree, tree))
724 = default_valid_lang_attribute;
726 /* Process the attributes listed in ATTRIBUTES and install them in *NODE,
727 which is either a DECL (including a TYPE_DECL) or a TYPE. If a DECL,
728 it should be modified in place; if a TYPE, a copy should be created.
729 FLAGS gives further information, in the form of a bitwise OR of flags
730 in enum attribute_flags from c-common.h. Depending on these flags,
731 some attributes may be returned to be applied at a later stage (for
732 example, to apply a decl attribute to the declaration rather than to
736 decl_attributes (node, attributes, flags)
737 tree *node, attributes;
738 int flags ATTRIBUTE_UNUSED;
740 tree decl = 0, type = 0;
744 if (attrtab_idx == 0)
750 type = TREE_TYPE (decl);
751 is_type = TREE_CODE (*node) == TYPE_DECL;
753 else if (TYPE_P (*node))
754 type = *node, is_type = 1;
756 (*targetm.insert_attributes) (*node, &attributes);
758 for (a = attributes; a; a = TREE_CHAIN (a))
760 tree name = TREE_PURPOSE (a);
761 tree args = TREE_VALUE (a);
765 for (i = 0; i < attrtab_idx; i++)
766 if (attrtab[i].name == name)
769 if (i == attrtab_idx)
771 if (! valid_machine_attribute (name, args, decl, type)
772 && ! (* valid_lang_attribute) (name, args, decl, type))
773 warning ("`%s' attribute directive ignored",
774 IDENTIFIER_POINTER (name));
776 type = TREE_TYPE (decl);
779 else if (attrtab[i].decl_req && decl == 0)
781 warning ("`%s' attribute does not apply to types",
782 IDENTIFIER_POINTER (name));
785 else if (list_length (args) < attrtab[i].min
786 || list_length (args) > attrtab[i].max)
788 error ("wrong number of arguments specified for `%s' attribute",
789 IDENTIFIER_POINTER (name));
798 TYPE_PACKED (type) = 1;
799 else if (TREE_CODE (decl) == FIELD_DECL)
800 DECL_PACKED (decl) = 1;
801 /* We can't set DECL_PACKED for a VAR_DECL, because the bit is
802 used for DECL_REGISTER. It wouldn't mean anything anyway. */
804 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
808 if (TREE_CODE (decl) == VAR_DECL)
809 DECL_COMMON (decl) = 0;
811 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
815 if (TREE_CODE (decl) == VAR_DECL)
816 DECL_COMMON (decl) = 1;
818 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
822 if (TREE_CODE (decl) == FUNCTION_DECL)
823 TREE_THIS_VOLATILE (decl) = 1;
824 else if (TREE_CODE (type) == POINTER_TYPE
825 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
826 TREE_TYPE (decl) = type
828 (build_type_variant (TREE_TYPE (type),
829 TREE_READONLY (TREE_TYPE (type)), 1));
831 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
835 if (TREE_CODE (decl) == FUNCTION_DECL)
836 DECL_IS_MALLOC (decl) = 1;
837 /* ??? TODO: Support types. */
839 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
845 TREE_USED (decl) = 1;
847 TREE_USED (type) = 1;
848 else if (TREE_CODE (decl) == PARM_DECL
849 || TREE_CODE (decl) == VAR_DECL
850 || TREE_CODE (decl) == FUNCTION_DECL
851 || TREE_CODE (decl) == LABEL_DECL)
852 TREE_USED (decl) = 1;
854 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
858 if (TREE_CODE (decl) == FUNCTION_DECL)
859 TREE_READONLY (decl) = 1;
860 else if (TREE_CODE (type) == POINTER_TYPE
861 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
862 TREE_TYPE (decl) = type
864 (build_type_variant (TREE_TYPE (type), 1,
865 TREE_THIS_VOLATILE (TREE_TYPE (type))));
867 warning ( "`%s' attribute ignored", IDENTIFIER_POINTER (name));
871 if (TREE_CODE (decl) == FUNCTION_DECL)
872 DECL_IS_PURE (decl) = 1;
873 /* ??? TODO: Support types. */
875 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
881 && TREE_CODE (type) == UNION_TYPE
883 || (TYPE_FIELDS (type) != 0
884 && TYPE_MODE (type) == DECL_MODE (TYPE_FIELDS (type)))))
885 TYPE_TRANSPARENT_UNION (type) = 1;
886 else if (decl != 0 && TREE_CODE (decl) == PARM_DECL
887 && TREE_CODE (type) == UNION_TYPE
888 && TYPE_MODE (type) == DECL_MODE (TYPE_FIELDS (type)))
889 DECL_TRANSPARENT_UNION (decl) = 1;
891 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
895 if (TREE_CODE (decl) == FUNCTION_DECL
896 && TREE_CODE (type) == FUNCTION_TYPE
897 && decl_function_context (decl) == 0)
899 DECL_STATIC_CONSTRUCTOR (decl) = 1;
900 TREE_USED (decl) = 1;
903 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
907 if (TREE_CODE (decl) == FUNCTION_DECL
908 && TREE_CODE (type) == FUNCTION_TYPE
909 && decl_function_context (decl) == 0)
911 DECL_STATIC_DESTRUCTOR (decl) = 1;
912 TREE_USED (decl) = 1;
915 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
919 if (TREE_CODE (TREE_VALUE (args)) != IDENTIFIER_NODE)
920 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
924 const char *p = IDENTIFIER_POINTER (TREE_VALUE (args));
925 int len = strlen (p);
926 enum machine_mode mode = VOIDmode;
929 if (len > 4 && p[0] == '_' && p[1] == '_'
930 && p[len - 1] == '_' && p[len - 2] == '_')
932 char *newp = (char *) alloca (len - 1);
934 strcpy (newp, &p[2]);
935 newp[len - 4] = '\0';
939 /* Give this decl a type with the specified mode.
940 First check for the special modes. */
941 if (! strcmp (p, "byte"))
943 else if (!strcmp (p, "word"))
945 else if (! strcmp (p, "pointer"))
948 for (j = 0; j < NUM_MACHINE_MODES; j++)
949 if (!strcmp (p, GET_MODE_NAME (j)))
950 mode = (enum machine_mode) j;
952 if (mode == VOIDmode)
953 error ("unknown machine mode `%s'", p);
954 else if (0 == (typefm = type_for_mode (mode,
955 TREE_UNSIGNED (type))))
956 error ("no data type for mode `%s'", p);
959 if (TYPE_PRECISION (typefm) > (TREE_UNSIGNED (type)
960 ? TYPE_PRECISION(uintmax_type_node)
961 : TYPE_PRECISION(intmax_type_node))
963 pedwarn ("type with more precision than %s",
964 TREE_UNSIGNED (type) ? "uintmax_t" : "intmax_t");
965 TREE_TYPE (decl) = type = typefm;
966 DECL_SIZE (decl) = DECL_SIZE_UNIT (decl) = 0;
967 if (TREE_CODE (decl) != FIELD_DECL)
968 layout_decl (decl, 0);
974 if (targetm.have_named_sections)
976 if ((TREE_CODE (decl) == FUNCTION_DECL
977 || TREE_CODE (decl) == VAR_DECL)
978 && TREE_CODE (TREE_VALUE (args)) == STRING_CST)
980 if (TREE_CODE (decl) == VAR_DECL
981 && current_function_decl != NULL_TREE
982 && ! TREE_STATIC (decl))
983 error_with_decl (decl,
984 "section attribute cannot be specified for local variables");
985 /* The decl may have already been given a section attribute
986 from a previous declaration. Ensure they match. */
987 else if (DECL_SECTION_NAME (decl) != NULL_TREE
988 && strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
989 TREE_STRING_POINTER (TREE_VALUE (args))) != 0)
990 error_with_decl (*node,
991 "section of `%s' conflicts with previous declaration");
993 DECL_SECTION_NAME (decl) = TREE_VALUE (args);
996 error_with_decl (*node,
997 "section attribute not allowed for `%s'");
1000 error_with_decl (*node,
1001 "section attributes are not supported for this target");
1007 = (args ? TREE_VALUE (args)
1008 : size_int (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1011 /* Strip any NOPs of any kind. */
1012 while (TREE_CODE (align_expr) == NOP_EXPR
1013 || TREE_CODE (align_expr) == CONVERT_EXPR
1014 || TREE_CODE (align_expr) == NON_LVALUE_EXPR)
1015 align_expr = TREE_OPERAND (align_expr, 0);
1017 if (TREE_CODE (align_expr) != INTEGER_CST)
1019 error ("requested alignment is not a constant");
1023 if ((i = tree_log2 (align_expr)) == -1)
1024 error ("requested alignment is not a power of 2");
1025 else if (i > HOST_BITS_PER_INT - 2)
1026 error ("requested alignment is too large");
1029 /* If we have a TYPE_DECL, then copy the type, so that we
1030 don't accidentally modify a builtin type. See pushdecl. */
1031 if (decl && TREE_TYPE (decl) != error_mark_node
1032 && DECL_ORIGINAL_TYPE (decl) == NULL_TREE)
1034 tree tt = TREE_TYPE (decl);
1035 DECL_ORIGINAL_TYPE (decl) = tt;
1036 tt = build_type_copy (tt);
1037 TYPE_NAME (tt) = decl;
1038 TREE_USED (tt) = TREE_USED (decl);
1039 TREE_TYPE (decl) = tt;
1043 TYPE_ALIGN (type) = (1 << i) * BITS_PER_UNIT;
1044 TYPE_USER_ALIGN (type) = 1;
1046 else if (TREE_CODE (decl) != VAR_DECL
1047 && TREE_CODE (decl) != FIELD_DECL)
1048 error_with_decl (decl,
1049 "alignment may not be specified for `%s'");
1052 DECL_ALIGN (decl) = (1 << i) * BITS_PER_UNIT;
1053 DECL_USER_ALIGN (decl) = 1;
1059 decl_handle_format_attribute (decl, args);
1063 decl_handle_format_arg_attribute (decl, args);
1067 declare_weak (decl);
1071 if ((TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
1072 || (TREE_CODE (decl) != FUNCTION_DECL && ! DECL_EXTERNAL (decl)))
1073 error_with_decl (decl,
1074 "`%s' defined both normally and as an alias");
1075 else if (decl_function_context (decl) == 0)
1079 id = TREE_VALUE (args);
1080 if (TREE_CODE (id) != STRING_CST)
1082 error ("alias arg not a string");
1085 id = get_identifier (TREE_STRING_POINTER (id));
1086 /* This counts as a use of the object pointed to. */
1089 if (TREE_CODE (decl) == FUNCTION_DECL)
1090 DECL_INITIAL (decl) = error_mark_node;
1092 DECL_EXTERNAL (decl) = 0;
1093 assemble_alias (decl, id);
1096 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
1099 case A_NO_CHECK_MEMORY_USAGE:
1100 if (TREE_CODE (decl) != FUNCTION_DECL)
1102 error_with_decl (decl,
1103 "`%s' attribute applies only to functions",
1104 IDENTIFIER_POINTER (name));
1106 else if (DECL_INITIAL (decl))
1108 error_with_decl (decl,
1109 "can't set `%s' attribute after definition",
1110 IDENTIFIER_POINTER (name));
1113 DECL_NO_CHECK_MEMORY_USAGE (decl) = 1;
1116 case A_NO_INSTRUMENT_FUNCTION:
1117 if (TREE_CODE (decl) != FUNCTION_DECL)
1119 error_with_decl (decl,
1120 "`%s' attribute applies only to functions",
1121 IDENTIFIER_POINTER (name));
1123 else if (DECL_INITIAL (decl))
1125 error_with_decl (decl,
1126 "can't set `%s' attribute after definition",
1127 IDENTIFIER_POINTER (name));
1130 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (decl) = 1;
1133 case A_NO_LIMIT_STACK:
1134 if (TREE_CODE (decl) != FUNCTION_DECL)
1136 error_with_decl (decl,
1137 "`%s' attribute applies only to functions",
1138 IDENTIFIER_POINTER (name));
1140 else if (DECL_INITIAL (decl))
1142 error_with_decl (decl,
1143 "can't set `%s' attribute after definition",
1144 IDENTIFIER_POINTER (name));
1147 DECL_NO_LIMIT_STACK (decl) = 1;
1154 /* Split SPECS_ATTRS, a list of declspecs and prefix attributes, into two
1155 lists. SPECS_ATTRS may also be just a typespec (eg: RECORD_TYPE).
1157 The head of the declspec list is stored in DECLSPECS.
1158 The head of the attribute list is stored in PREFIX_ATTRIBUTES.
1160 Note that attributes in SPECS_ATTRS are stored in the TREE_PURPOSE of
1161 the list elements. We drop the containing TREE_LIST nodes and link the
1162 resulting attributes together the way decl_attributes expects them. */
1165 split_specs_attrs (specs_attrs, declspecs, prefix_attributes)
1167 tree *declspecs, *prefix_attributes;
1169 tree t, s, a, next, specs, attrs;
1171 /* This can happen after an __extension__ in pedantic mode. */
1172 if (specs_attrs != NULL_TREE
1173 && TREE_CODE (specs_attrs) == INTEGER_CST)
1175 *declspecs = NULL_TREE;
1176 *prefix_attributes = NULL_TREE;
1180 /* This can happen in c++ (eg: decl: typespec initdecls ';'). */
1181 if (specs_attrs != NULL_TREE
1182 && TREE_CODE (specs_attrs) != TREE_LIST)
1184 *declspecs = specs_attrs;
1185 *prefix_attributes = NULL_TREE;
1189 /* Remember to keep the lists in the same order, element-wise. */
1191 specs = s = NULL_TREE;
1192 attrs = a = NULL_TREE;
1193 for (t = specs_attrs; t; t = next)
1195 next = TREE_CHAIN (t);
1196 /* Declspecs have a non-NULL TREE_VALUE. */
1197 if (TREE_VALUE (t) != NULL_TREE)
1199 if (specs == NULL_TREE)
1207 /* The TREE_PURPOSE may also be empty in the case of
1208 __attribute__(()). */
1209 else if (TREE_PURPOSE (t) != NULL_TREE)
1211 if (attrs == NULL_TREE)
1212 attrs = a = TREE_PURPOSE (t);
1215 TREE_CHAIN (a) = TREE_PURPOSE (t);
1216 a = TREE_PURPOSE (t);
1218 /* More attrs can be linked here, move A to the end. */
1219 while (TREE_CHAIN (a) != NULL_TREE)
1224 /* Terminate the lists. */
1226 TREE_CHAIN (s) = NULL_TREE;
1228 TREE_CHAIN (a) = NULL_TREE;
1232 *prefix_attributes = attrs;
1235 /* Strip attributes from SPECS_ATTRS, a list of declspecs and attributes.
1236 This function is used by the parser when a rule will accept attributes
1237 in a particular position, but we don't want to support that just yet.
1239 A warning is issued for every ignored attribute. */
1242 strip_attrs (specs_attrs)
1247 split_specs_attrs (specs_attrs, &specs, &attrs);
1251 warning ("`%s' attribute ignored",
1252 IDENTIFIER_POINTER (TREE_PURPOSE (attrs)));
1253 attrs = TREE_CHAIN (attrs);
1259 static int is_valid_printf_arglist PARAMS ((tree));
1260 static rtx c_expand_builtin PARAMS ((tree, rtx, enum machine_mode, enum expand_modifier));
1261 static rtx c_expand_builtin_printf PARAMS ((tree, rtx, enum machine_mode,
1262 enum expand_modifier, int));
1263 static rtx c_expand_builtin_fprintf PARAMS ((tree, rtx, enum machine_mode,
1264 enum expand_modifier, int));
1266 /* Print a warning if a constant expression had overflow in folding.
1267 Invoke this function on every expression that the language
1268 requires to be a constant expression.
1269 Note the ANSI C standard says it is erroneous for a
1270 constant expression to overflow. */
1273 constant_expression_warning (value)
1276 if ((TREE_CODE (value) == INTEGER_CST || TREE_CODE (value) == REAL_CST
1277 || TREE_CODE (value) == COMPLEX_CST)
1278 && TREE_CONSTANT_OVERFLOW (value) && pedantic)
1279 pedwarn ("overflow in constant expression");
1282 /* Print a warning if an expression had overflow in folding.
1283 Invoke this function on every expression that
1284 (1) appears in the source code, and
1285 (2) might be a constant expression that overflowed, and
1286 (3) is not already checked by convert_and_check;
1287 however, do not invoke this function on operands of explicit casts. */
1290 overflow_warning (value)
1293 if ((TREE_CODE (value) == INTEGER_CST
1294 || (TREE_CODE (value) == COMPLEX_CST
1295 && TREE_CODE (TREE_REALPART (value)) == INTEGER_CST))
1296 && TREE_OVERFLOW (value))
1298 TREE_OVERFLOW (value) = 0;
1299 if (skip_evaluation == 0)
1300 warning ("integer overflow in expression");
1302 else if ((TREE_CODE (value) == REAL_CST
1303 || (TREE_CODE (value) == COMPLEX_CST
1304 && TREE_CODE (TREE_REALPART (value)) == REAL_CST))
1305 && TREE_OVERFLOW (value))
1307 TREE_OVERFLOW (value) = 0;
1308 if (skip_evaluation == 0)
1309 warning ("floating point overflow in expression");
1313 /* Print a warning if a large constant is truncated to unsigned,
1314 or if -Wconversion is used and a constant < 0 is converted to unsigned.
1315 Invoke this function on every expression that might be implicitly
1316 converted to an unsigned type. */
1319 unsigned_conversion_warning (result, operand)
1320 tree result, operand;
1322 if (TREE_CODE (operand) == INTEGER_CST
1323 && TREE_CODE (TREE_TYPE (result)) == INTEGER_TYPE
1324 && TREE_UNSIGNED (TREE_TYPE (result))
1325 && skip_evaluation == 0
1326 && !int_fits_type_p (operand, TREE_TYPE (result)))
1328 if (!int_fits_type_p (operand, signed_type (TREE_TYPE (result))))
1329 /* This detects cases like converting -129 or 256 to unsigned char. */
1330 warning ("large integer implicitly truncated to unsigned type");
1331 else if (warn_conversion)
1332 warning ("negative integer implicitly converted to unsigned type");
1336 /* Nonzero if constant C has a value that is permissible
1337 for type TYPE (an INTEGER_TYPE). */
1340 constant_fits_type_p (c, type)
1343 if (TREE_CODE (c) == INTEGER_CST)
1344 return int_fits_type_p (c, type);
1346 c = convert (type, c);
1347 return !TREE_OVERFLOW (c);
1350 /* Convert EXPR to TYPE, warning about conversion problems with constants.
1351 Invoke this function on every expression that is converted implicitly,
1352 i.e. because of language rules and not because of an explicit cast. */
1355 convert_and_check (type, expr)
1358 tree t = convert (type, expr);
1359 if (TREE_CODE (t) == INTEGER_CST)
1361 if (TREE_OVERFLOW (t))
1363 TREE_OVERFLOW (t) = 0;
1365 /* Do not diagnose overflow in a constant expression merely
1366 because a conversion overflowed. */
1367 TREE_CONSTANT_OVERFLOW (t) = TREE_CONSTANT_OVERFLOW (expr);
1369 /* No warning for converting 0x80000000 to int. */
1370 if (!(TREE_UNSIGNED (type) < TREE_UNSIGNED (TREE_TYPE (expr))
1371 && TREE_CODE (TREE_TYPE (expr)) == INTEGER_TYPE
1372 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (expr))))
1373 /* If EXPR fits in the unsigned version of TYPE,
1374 don't warn unless pedantic. */
1376 || TREE_UNSIGNED (type)
1377 || ! constant_fits_type_p (expr, unsigned_type (type)))
1378 && skip_evaluation == 0)
1379 warning ("overflow in implicit constant conversion");
1382 unsigned_conversion_warning (t, expr);
1387 /* A node in a list that describes references to variables (EXPR), which are
1388 either read accesses if WRITER is zero, or write accesses, in which case
1389 WRITER is the parent of EXPR. */
1396 /* Used to implement a cache the results of a call to verify_tree. We only
1397 use this for SAVE_EXPRs. */
1400 struct tlist_cache *next;
1401 struct tlist *cache_before_sp;
1402 struct tlist *cache_after_sp;
1406 /* Obstack to use when allocating tlist structures, and corresponding
1408 static struct obstack tlist_obstack;
1409 static char *tlist_firstobj = 0;
1411 /* Keep track of the identifiers we've warned about, so we can avoid duplicate
1413 static struct tlist *warned_ids;
1414 /* SAVE_EXPRs need special treatment. We process them only once and then
1415 cache the results. */
1416 static struct tlist_cache *save_expr_cache;
1418 static void add_tlist PARAMS ((struct tlist **, struct tlist *, tree, int));
1419 static void merge_tlist PARAMS ((struct tlist **, struct tlist *, int));
1420 static void verify_tree PARAMS ((tree, struct tlist **, struct tlist **, tree));
1421 static int warning_candidate_p PARAMS ((tree));
1422 static void warn_for_collisions PARAMS ((struct tlist *));
1423 static void warn_for_collisions_1 PARAMS ((tree, tree, struct tlist *, int));
1424 static struct tlist *new_tlist PARAMS ((struct tlist *, tree, tree));
1425 static void verify_sequence_points PARAMS ((tree));
1427 /* Create a new struct tlist and fill in its fields. */
1428 static struct tlist *
1429 new_tlist (next, t, writer)
1435 l = (struct tlist *) obstack_alloc (&tlist_obstack, sizeof *l);
1442 /* Add duplicates of the nodes found in ADD to the list *TO. If EXCLUDE_WRITER
1443 is nonnull, we ignore any node we find which has a writer equal to it. */
1446 add_tlist (to, add, exclude_writer, copy)
1449 tree exclude_writer;
1454 struct tlist *next = add->next;
1457 if (! exclude_writer || add->writer != exclude_writer)
1458 *to = copy ? new_tlist (*to, add->expr, add->writer) : add;
1463 /* Merge the nodes of ADD into TO. This merging process is done so that for
1464 each variable that already exists in TO, no new node is added; however if
1465 there is a write access recorded in ADD, and an occurrence on TO is only
1466 a read access, then the occurrence in TO will be modified to record the
1470 merge_tlist (to, add, copy)
1475 struct tlist **end = to;
1478 end = &(*end)->next;
1484 struct tlist *next = add->next;
1486 for (tmp2 = *to; tmp2; tmp2 = tmp2->next)
1487 if (tmp2->expr == add->expr)
1491 tmp2->writer = add->writer;
1495 *end = copy ? add : new_tlist (NULL, add->expr, add->writer);
1496 end = &(*end)->next;
1503 /* WRITTEN is a variable, WRITER is its parent. Warn if any of the variable
1504 references in list LIST conflict with it, excluding reads if ONLY writers
1508 warn_for_collisions_1 (written, writer, list, only_writes)
1509 tree written, writer;
1515 /* Avoid duplicate warnings. */
1516 for (tmp = warned_ids; tmp; tmp = tmp->next)
1517 if (tmp->expr == written)
1522 if (list->expr == written
1523 && list->writer != writer
1524 && (! only_writes || list->writer))
1526 warned_ids = new_tlist (warned_ids, written, NULL_TREE);
1527 warning ("operation on `%s' may be undefined",
1528 IDENTIFIER_POINTER (DECL_NAME (list->expr)));
1534 /* Given a list LIST of references to variables, find whether any of these
1535 can cause conflicts due to missing sequence points. */
1538 warn_for_collisions (list)
1543 for (tmp = list; tmp; tmp = tmp->next)
1546 warn_for_collisions_1 (tmp->expr, tmp->writer, list, 0);
1550 /* Return nonzero if X is a tree that can be verified by the sequence poitn
1553 warning_candidate_p (x)
1556 return TREE_CODE (x) == VAR_DECL || TREE_CODE (x) == PARM_DECL;
1559 /* Walk the tree X, and record accesses to variables. If X is written by the
1560 parent tree, WRITER is the parent.
1561 We store accesses in one of the two lists: PBEFORE_SP, and PNO_SP. If this
1562 expression or its only operand forces a sequence point, then everything up
1563 to the sequence point is stored in PBEFORE_SP. Everything else gets stored
1565 Once we return, we will have emitted warnings if any subexpression before
1566 such a sequence point could be undefined. On a higher level, however, the
1567 sequence point may not be relevant, and we'll merge the two lists.
1569 Example: (b++, a) + b;
1570 The call that processes the COMPOUND_EXPR will store the increment of B
1571 in PBEFORE_SP, and the use of A in PNO_SP. The higher-level call that
1572 processes the PLUS_EXPR will need to merge the two lists so that
1573 eventually, all accesses end up on the same list (and we'll warn about the
1574 unordered subexpressions b++ and b.
1576 A note on merging. If we modify the former example so that our expression
1579 care must be taken not simply to add all three expressions into the final
1580 PNO_SP list. The function merge_tlist takes care of that by merging the
1581 before-SP list of the COMPOUND_EXPR into its after-SP list in a special
1582 way, so that no more than one access to B is recorded. */
1585 verify_tree (x, pbefore_sp, pno_sp, writer)
1587 struct tlist **pbefore_sp, **pno_sp;
1590 struct tlist *tmp_before, *tmp_nosp, *tmp_list2, *tmp_list3;
1591 enum tree_code code;
1594 /* X may be NULL if it is the operand of an empty statement expression
1600 code = TREE_CODE (x);
1601 class = TREE_CODE_CLASS (code);
1603 if (warning_candidate_p (x))
1605 *pno_sp = new_tlist (*pno_sp, x, writer);
1615 case TRUTH_ANDIF_EXPR:
1616 case TRUTH_ORIF_EXPR:
1617 tmp_before = tmp_nosp = tmp_list3 = 0;
1618 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1619 warn_for_collisions (tmp_nosp);
1620 merge_tlist (pbefore_sp, tmp_before, 0);
1621 merge_tlist (pbefore_sp, tmp_nosp, 0);
1622 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, pno_sp, NULL_TREE);
1623 merge_tlist (pbefore_sp, tmp_list3, 0);
1627 tmp_before = tmp_list2 = 0;
1628 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_list2, NULL_TREE);
1629 warn_for_collisions (tmp_list2);
1630 merge_tlist (pbefore_sp, tmp_before, 0);
1631 merge_tlist (pbefore_sp, tmp_list2, 1);
1633 tmp_list3 = tmp_nosp = 0;
1634 verify_tree (TREE_OPERAND (x, 1), &tmp_list3, &tmp_nosp, NULL_TREE);
1635 warn_for_collisions (tmp_nosp);
1636 merge_tlist (pbefore_sp, tmp_list3, 0);
1638 tmp_list3 = tmp_list2 = 0;
1639 verify_tree (TREE_OPERAND (x, 2), &tmp_list3, &tmp_list2, NULL_TREE);
1640 warn_for_collisions (tmp_list2);
1641 merge_tlist (pbefore_sp, tmp_list3, 0);
1642 /* Rather than add both tmp_nosp and tmp_list2, we have to merge the
1643 two first, to avoid warning for (a ? b++ : b++). */
1644 merge_tlist (&tmp_nosp, tmp_list2, 0);
1645 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1648 case PREDECREMENT_EXPR:
1649 case PREINCREMENT_EXPR:
1650 case POSTDECREMENT_EXPR:
1651 case POSTINCREMENT_EXPR:
1652 verify_tree (TREE_OPERAND (x, 0), pno_sp, pno_sp, x);
1656 tmp_before = tmp_nosp = tmp_list3 = 0;
1657 verify_tree (TREE_OPERAND (x, 1), &tmp_before, &tmp_nosp, NULL_TREE);
1658 verify_tree (TREE_OPERAND (x, 0), &tmp_list3, &tmp_list3, x);
1659 /* Expressions inside the LHS are not ordered wrt. the sequence points
1660 in the RHS. Example:
1662 Despite the fact that the modification of "a" is in the before_sp
1663 list (tmp_before), it conflicts with the use of "a" in the LHS.
1664 We can handle this by adding the contents of tmp_list3
1665 to those of tmp_before, and redoing the collision warnings for that
1667 add_tlist (&tmp_before, tmp_list3, x, 1);
1668 warn_for_collisions (tmp_before);
1669 /* Exclude the LHS itself here; we first have to merge it into the
1670 tmp_nosp list. This is done to avoid warning for "a = a"; if we
1671 didn't exclude the LHS, we'd get it twice, once as a read and once
1673 add_tlist (pno_sp, tmp_list3, x, 0);
1674 warn_for_collisions_1 (TREE_OPERAND (x, 0), x, tmp_nosp, 1);
1676 merge_tlist (pbefore_sp, tmp_before, 0);
1677 if (warning_candidate_p (TREE_OPERAND (x, 0)))
1678 merge_tlist (&tmp_nosp, new_tlist (NULL, TREE_OPERAND (x, 0), x), 0);
1679 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 1);
1683 /* We need to warn about conflicts among arguments and conflicts between
1684 args and the function address. Side effects of the function address,
1685 however, are not ordered by the sequence point of the call. */
1686 tmp_before = tmp_nosp = tmp_list2 = tmp_list3 = 0;
1687 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1688 if (TREE_OPERAND (x, 1))
1689 verify_tree (TREE_OPERAND (x, 1), &tmp_list2, &tmp_list3, NULL_TREE);
1690 merge_tlist (&tmp_list3, tmp_list2, 0);
1691 add_tlist (&tmp_before, tmp_list3, NULL_TREE, 0);
1692 add_tlist (&tmp_before, tmp_nosp, NULL_TREE, 0);
1693 warn_for_collisions (tmp_before);
1694 add_tlist (pbefore_sp, tmp_before, NULL_TREE, 0);
1698 /* Scan all the list, e.g. indices of multi dimensional array. */
1701 tmp_before = tmp_nosp = 0;
1702 verify_tree (TREE_VALUE (x), &tmp_before, &tmp_nosp, NULL_TREE);
1703 merge_tlist (&tmp_nosp, tmp_before, 0);
1704 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1711 struct tlist_cache *t;
1712 for (t = save_expr_cache; t; t = t->next)
1718 t = (struct tlist_cache *) obstack_alloc (&tlist_obstack,
1720 t->next = save_expr_cache;
1722 save_expr_cache = t;
1724 tmp_before = tmp_nosp = 0;
1725 verify_tree (TREE_OPERAND (x, 0), &tmp_before, &tmp_nosp, NULL_TREE);
1726 warn_for_collisions (tmp_nosp);
1731 struct tlist *t = tmp_nosp;
1733 merge_tlist (&tmp_list3, t, 0);
1735 t->cache_before_sp = tmp_before;
1736 t->cache_after_sp = tmp_list3;
1738 merge_tlist (pbefore_sp, t->cache_before_sp, 1);
1739 add_tlist (pno_sp, t->cache_after_sp, NULL_TREE, 1);
1748 if (first_rtl_op (code) == 0)
1750 x = TREE_OPERAND (x, 0);
1766 int max = first_rtl_op (TREE_CODE (x));
1767 for (lp = 0; lp < max; lp++)
1769 tmp_before = tmp_nosp = 0;
1770 verify_tree (TREE_OPERAND (x, lp), &tmp_before, &tmp_nosp, NULL_TREE);
1771 merge_tlist (&tmp_nosp, tmp_before, 0);
1772 add_tlist (pno_sp, tmp_nosp, NULL_TREE, 0);
1779 /* Try to warn for undefined behaviour in EXPR due to missing sequence
1783 verify_sequence_points (expr)
1786 struct tlist *before_sp = 0, *after_sp = 0;
1789 save_expr_cache = 0;
1790 if (tlist_firstobj == 0)
1792 gcc_obstack_init (&tlist_obstack);
1793 tlist_firstobj = obstack_alloc (&tlist_obstack, 0);
1796 verify_tree (expr, &before_sp, &after_sp, 0);
1797 warn_for_collisions (after_sp);
1798 obstack_free (&tlist_obstack, tlist_firstobj);
1802 c_expand_expr_stmt (expr)
1805 /* Do default conversion if safe and possibly important,
1806 in case within ({...}). */
1807 if ((TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE && lvalue_p (expr))
1808 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE)
1809 expr = default_conversion (expr);
1811 if (warn_sequence_point)
1812 verify_sequence_points (expr);
1814 if (TREE_TYPE (expr) != error_mark_node
1815 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
1816 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
1817 error ("expression statement has incomplete type");
1819 last_expr_type = TREE_TYPE (expr);
1820 return add_stmt (build_stmt (EXPR_STMT, expr));
1823 /* Validate the expression after `case' and apply default promotions. */
1826 check_case_value (value)
1829 if (value == NULL_TREE)
1832 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1833 STRIP_TYPE_NOPS (value);
1834 /* In C++, the following is allowed:
1837 switch (...) { case i: ... }
1839 So, we try to reduce the VALUE to a constant that way. */
1840 if (c_language == clk_cplusplus)
1842 value = decl_constant_value (value);
1843 STRIP_TYPE_NOPS (value);
1844 value = fold (value);
1847 if (TREE_CODE (value) != INTEGER_CST
1848 && value != error_mark_node)
1850 error ("case label does not reduce to an integer constant");
1851 value = error_mark_node;
1854 /* Promote char or short to int. */
1855 value = default_conversion (value);
1857 constant_expression_warning (value);
1862 /* Return an integer type with BITS bits of precision,
1863 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
1866 type_for_size (bits, unsignedp)
1870 if (bits == TYPE_PRECISION (integer_type_node))
1871 return unsignedp ? unsigned_type_node : integer_type_node;
1873 if (bits == TYPE_PRECISION (signed_char_type_node))
1874 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1876 if (bits == TYPE_PRECISION (short_integer_type_node))
1877 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1879 if (bits == TYPE_PRECISION (long_integer_type_node))
1880 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1882 if (bits == TYPE_PRECISION (long_long_integer_type_node))
1883 return (unsignedp ? long_long_unsigned_type_node
1884 : long_long_integer_type_node);
1886 if (bits == TYPE_PRECISION (widest_integer_literal_type_node))
1887 return (unsignedp ? widest_unsigned_literal_type_node
1888 : widest_integer_literal_type_node);
1890 if (bits <= TYPE_PRECISION (intQI_type_node))
1891 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1893 if (bits <= TYPE_PRECISION (intHI_type_node))
1894 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1896 if (bits <= TYPE_PRECISION (intSI_type_node))
1897 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1899 if (bits <= TYPE_PRECISION (intDI_type_node))
1900 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1905 /* Return a data type that has machine mode MODE.
1906 If the mode is an integer,
1907 then UNSIGNEDP selects between signed and unsigned types. */
1910 type_for_mode (mode, unsignedp)
1911 enum machine_mode mode;
1914 if (mode == TYPE_MODE (integer_type_node))
1915 return unsignedp ? unsigned_type_node : integer_type_node;
1917 if (mode == TYPE_MODE (signed_char_type_node))
1918 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
1920 if (mode == TYPE_MODE (short_integer_type_node))
1921 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
1923 if (mode == TYPE_MODE (long_integer_type_node))
1924 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
1926 if (mode == TYPE_MODE (long_long_integer_type_node))
1927 return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
1929 if (mode == TYPE_MODE (widest_integer_literal_type_node))
1930 return unsignedp ? widest_unsigned_literal_type_node
1931 : widest_integer_literal_type_node;
1933 if (mode == TYPE_MODE (intQI_type_node))
1934 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
1936 if (mode == TYPE_MODE (intHI_type_node))
1937 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
1939 if (mode == TYPE_MODE (intSI_type_node))
1940 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
1942 if (mode == TYPE_MODE (intDI_type_node))
1943 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
1945 #if HOST_BITS_PER_WIDE_INT >= 64
1946 if (mode == TYPE_MODE (intTI_type_node))
1947 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
1950 if (mode == TYPE_MODE (float_type_node))
1951 return float_type_node;
1953 if (mode == TYPE_MODE (double_type_node))
1954 return double_type_node;
1956 if (mode == TYPE_MODE (long_double_type_node))
1957 return long_double_type_node;
1959 if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
1960 return build_pointer_type (char_type_node);
1962 if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
1963 return build_pointer_type (integer_type_node);
1965 #ifdef VECTOR_MODE_SUPPORTED_P
1966 if (mode == TYPE_MODE (V4SF_type_node) && VECTOR_MODE_SUPPORTED_P (mode))
1967 return V4SF_type_node;
1968 if (mode == TYPE_MODE (V4SI_type_node) && VECTOR_MODE_SUPPORTED_P (mode))
1969 return V4SI_type_node;
1970 if (mode == TYPE_MODE (V2SI_type_node) && VECTOR_MODE_SUPPORTED_P (mode))
1971 return V2SI_type_node;
1972 if (mode == TYPE_MODE (V4HI_type_node) && VECTOR_MODE_SUPPORTED_P (mode))
1973 return V4HI_type_node;
1974 if (mode == TYPE_MODE (V8QI_type_node) && VECTOR_MODE_SUPPORTED_P (mode))
1975 return V8QI_type_node;
1981 /* Return an unsigned type the same as TYPE in other respects. */
1983 unsigned_type (type)
1986 tree type1 = TYPE_MAIN_VARIANT (type);
1987 if (type1 == signed_char_type_node || type1 == char_type_node)
1988 return unsigned_char_type_node;
1989 if (type1 == integer_type_node)
1990 return unsigned_type_node;
1991 if (type1 == short_integer_type_node)
1992 return short_unsigned_type_node;
1993 if (type1 == long_integer_type_node)
1994 return long_unsigned_type_node;
1995 if (type1 == long_long_integer_type_node)
1996 return long_long_unsigned_type_node;
1997 if (type1 == widest_integer_literal_type_node)
1998 return widest_unsigned_literal_type_node;
1999 #if HOST_BITS_PER_WIDE_INT >= 64
2000 if (type1 == intTI_type_node)
2001 return unsigned_intTI_type_node;
2003 if (type1 == intDI_type_node)
2004 return unsigned_intDI_type_node;
2005 if (type1 == intSI_type_node)
2006 return unsigned_intSI_type_node;
2007 if (type1 == intHI_type_node)
2008 return unsigned_intHI_type_node;
2009 if (type1 == intQI_type_node)
2010 return unsigned_intQI_type_node;
2012 return signed_or_unsigned_type (1, type);
2015 /* Return a signed type the same as TYPE in other respects. */
2021 tree type1 = TYPE_MAIN_VARIANT (type);
2022 if (type1 == unsigned_char_type_node || type1 == char_type_node)
2023 return signed_char_type_node;
2024 if (type1 == unsigned_type_node)
2025 return integer_type_node;
2026 if (type1 == short_unsigned_type_node)
2027 return short_integer_type_node;
2028 if (type1 == long_unsigned_type_node)
2029 return long_integer_type_node;
2030 if (type1 == long_long_unsigned_type_node)
2031 return long_long_integer_type_node;
2032 if (type1 == widest_unsigned_literal_type_node)
2033 return widest_integer_literal_type_node;
2034 #if HOST_BITS_PER_WIDE_INT >= 64
2035 if (type1 == unsigned_intTI_type_node)
2036 return intTI_type_node;
2038 if (type1 == unsigned_intDI_type_node)
2039 return intDI_type_node;
2040 if (type1 == unsigned_intSI_type_node)
2041 return intSI_type_node;
2042 if (type1 == unsigned_intHI_type_node)
2043 return intHI_type_node;
2044 if (type1 == unsigned_intQI_type_node)
2045 return intQI_type_node;
2047 return signed_or_unsigned_type (0, type);
2050 /* Return a type the same as TYPE except unsigned or
2051 signed according to UNSIGNEDP. */
2054 signed_or_unsigned_type (unsignedp, type)
2058 if (! INTEGRAL_TYPE_P (type)
2059 || TREE_UNSIGNED (type) == unsignedp)
2062 if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
2063 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
2064 if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
2065 return unsignedp ? unsigned_type_node : integer_type_node;
2066 if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
2067 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
2068 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
2069 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
2070 if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
2071 return (unsignedp ? long_long_unsigned_type_node
2072 : long_long_integer_type_node);
2073 if (TYPE_PRECISION (type) == TYPE_PRECISION (widest_integer_literal_type_node))
2074 return (unsignedp ? widest_unsigned_literal_type_node
2075 : widest_integer_literal_type_node);
2077 #if HOST_BITS_PER_WIDE_INT >= 64
2078 if (TYPE_PRECISION (type) == TYPE_PRECISION (intTI_type_node))
2079 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
2081 if (TYPE_PRECISION (type) == TYPE_PRECISION (intDI_type_node))
2082 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
2083 if (TYPE_PRECISION (type) == TYPE_PRECISION (intSI_type_node))
2084 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
2085 if (TYPE_PRECISION (type) == TYPE_PRECISION (intHI_type_node))
2086 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
2087 if (TYPE_PRECISION (type) == TYPE_PRECISION (intQI_type_node))
2088 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
2093 /* Return the minimum number of bits needed to represent VALUE in a
2094 signed or unsigned type, UNSIGNEDP says which. */
2097 min_precision (value, unsignedp)
2103 /* If the value is negative, compute its negative minus 1. The latter
2104 adjustment is because the absolute value of the largest negative value
2105 is one larger than the largest positive value. This is equivalent to
2106 a bit-wise negation, so use that operation instead. */
2108 if (tree_int_cst_sgn (value) < 0)
2109 value = fold (build1 (BIT_NOT_EXPR, TREE_TYPE (value), value));
2111 /* Return the number of bits needed, taking into account the fact
2112 that we need one more bit for a signed than unsigned type. */
2114 if (integer_zerop (value))
2117 log = tree_floor_log2 (value);
2119 return log + 1 + ! unsignedp;
2122 /* Print an error message for invalid operands to arith operation CODE.
2123 NOP_EXPR is used as a special case (see truthvalue_conversion). */
2126 binary_op_error (code)
2127 enum tree_code code;
2129 register const char *opname;
2134 error ("invalid truth-value expression");
2138 opname = "+"; break;
2140 opname = "-"; break;
2142 opname = "*"; break;
2144 opname = "max"; break;
2146 opname = "min"; break;
2148 opname = "=="; break;
2150 opname = "!="; break;
2152 opname = "<="; break;
2154 opname = ">="; break;
2156 opname = "<"; break;
2158 opname = ">"; break;
2160 opname = "<<"; break;
2162 opname = ">>"; break;
2163 case TRUNC_MOD_EXPR:
2164 case FLOOR_MOD_EXPR:
2165 opname = "%"; break;
2166 case TRUNC_DIV_EXPR:
2167 case FLOOR_DIV_EXPR:
2168 opname = "/"; break;
2170 opname = "&"; break;
2172 opname = "|"; break;
2173 case TRUTH_ANDIF_EXPR:
2174 opname = "&&"; break;
2175 case TRUTH_ORIF_EXPR:
2176 opname = "||"; break;
2178 opname = "^"; break;
2181 opname = "rotate"; break;
2183 opname = "unknown"; break;
2185 error ("invalid operands to binary %s", opname);
2188 /* Subroutine of build_binary_op, used for comparison operations.
2189 See if the operands have both been converted from subword integer types
2190 and, if so, perhaps change them both back to their original type.
2191 This function is also responsible for converting the two operands
2192 to the proper common type for comparison.
2194 The arguments of this function are all pointers to local variables
2195 of build_binary_op: OP0_PTR is &OP0, OP1_PTR is &OP1,
2196 RESTYPE_PTR is &RESULT_TYPE and RESCODE_PTR is &RESULTCODE.
2198 If this function returns nonzero, it means that the comparison has
2199 a constant value. What this function returns is an expression for
2203 shorten_compare (op0_ptr, op1_ptr, restype_ptr, rescode_ptr)
2204 tree *op0_ptr, *op1_ptr;
2206 enum tree_code *rescode_ptr;
2209 tree op0 = *op0_ptr;
2210 tree op1 = *op1_ptr;
2211 int unsignedp0, unsignedp1;
2213 tree primop0, primop1;
2214 enum tree_code code = *rescode_ptr;
2216 /* Throw away any conversions to wider types
2217 already present in the operands. */
2219 primop0 = get_narrower (op0, &unsignedp0);
2220 primop1 = get_narrower (op1, &unsignedp1);
2222 /* Handle the case that OP0 does not *contain* a conversion
2223 but it *requires* conversion to FINAL_TYPE. */
2225 if (op0 == primop0 && TREE_TYPE (op0) != *restype_ptr)
2226 unsignedp0 = TREE_UNSIGNED (TREE_TYPE (op0));
2227 if (op1 == primop1 && TREE_TYPE (op1) != *restype_ptr)
2228 unsignedp1 = TREE_UNSIGNED (TREE_TYPE (op1));
2230 /* If one of the operands must be floated, we cannot optimize. */
2231 real1 = TREE_CODE (TREE_TYPE (primop0)) == REAL_TYPE;
2232 real2 = TREE_CODE (TREE_TYPE (primop1)) == REAL_TYPE;
2234 /* If first arg is constant, swap the args (changing operation
2235 so value is preserved), for canonicalization. Don't do this if
2236 the second arg is 0. */
2238 if (TREE_CONSTANT (primop0)
2239 && ! integer_zerop (primop1) && ! real_zerop (primop1))
2241 register tree tem = primop0;
2242 register int temi = unsignedp0;
2250 unsignedp0 = unsignedp1;
2273 *rescode_ptr = code;
2276 /* If comparing an integer against a constant more bits wide,
2277 maybe we can deduce a value of 1 or 0 independent of the data.
2278 Or else truncate the constant now
2279 rather than extend the variable at run time.
2281 This is only interesting if the constant is the wider arg.
2282 Also, it is not safe if the constant is unsigned and the
2283 variable arg is signed, since in this case the variable
2284 would be sign-extended and then regarded as unsigned.
2285 Our technique fails in this case because the lowest/highest
2286 possible unsigned results don't follow naturally from the
2287 lowest/highest possible values of the variable operand.
2288 For just EQ_EXPR and NE_EXPR there is another technique that
2289 could be used: see if the constant can be faithfully represented
2290 in the other operand's type, by truncating it and reextending it
2291 and see if that preserves the constant's value. */
2293 if (!real1 && !real2
2294 && TREE_CODE (primop1) == INTEGER_CST
2295 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr))
2297 int min_gt, max_gt, min_lt, max_lt;
2298 tree maxval, minval;
2299 /* 1 if comparison is nominally unsigned. */
2300 int unsignedp = TREE_UNSIGNED (*restype_ptr);
2303 type = signed_or_unsigned_type (unsignedp0, TREE_TYPE (primop0));
2305 /* If TYPE is an enumeration, then we need to get its min/max
2306 values from it's underlying integral type, not the enumerated
2308 if (TREE_CODE (type) == ENUMERAL_TYPE)
2309 type = type_for_size (TYPE_PRECISION (type), unsignedp0);
2311 maxval = TYPE_MAX_VALUE (type);
2312 minval = TYPE_MIN_VALUE (type);
2314 if (unsignedp && !unsignedp0)
2315 *restype_ptr = signed_type (*restype_ptr);
2317 if (TREE_TYPE (primop1) != *restype_ptr)
2318 primop1 = convert (*restype_ptr, primop1);
2319 if (type != *restype_ptr)
2321 minval = convert (*restype_ptr, minval);
2322 maxval = convert (*restype_ptr, maxval);
2325 if (unsignedp && unsignedp0)
2327 min_gt = INT_CST_LT_UNSIGNED (primop1, minval);
2328 max_gt = INT_CST_LT_UNSIGNED (primop1, maxval);
2329 min_lt = INT_CST_LT_UNSIGNED (minval, primop1);
2330 max_lt = INT_CST_LT_UNSIGNED (maxval, primop1);
2334 min_gt = INT_CST_LT (primop1, minval);
2335 max_gt = INT_CST_LT (primop1, maxval);
2336 min_lt = INT_CST_LT (minval, primop1);
2337 max_lt = INT_CST_LT (maxval, primop1);
2341 /* This used to be a switch, but Genix compiler can't handle that. */
2342 if (code == NE_EXPR)
2344 if (max_lt || min_gt)
2345 val = boolean_true_node;
2347 else if (code == EQ_EXPR)
2349 if (max_lt || min_gt)
2350 val = boolean_false_node;
2352 else if (code == LT_EXPR)
2355 val = boolean_true_node;
2357 val = boolean_false_node;
2359 else if (code == GT_EXPR)
2362 val = boolean_true_node;
2364 val = boolean_false_node;
2366 else if (code == LE_EXPR)
2369 val = boolean_true_node;
2371 val = boolean_false_node;
2373 else if (code == GE_EXPR)
2376 val = boolean_true_node;
2378 val = boolean_false_node;
2381 /* If primop0 was sign-extended and unsigned comparison specd,
2382 we did a signed comparison above using the signed type bounds.
2383 But the comparison we output must be unsigned.
2385 Also, for inequalities, VAL is no good; but if the signed
2386 comparison had *any* fixed result, it follows that the
2387 unsigned comparison just tests the sign in reverse
2388 (positive values are LE, negative ones GE).
2389 So we can generate an unsigned comparison
2390 against an extreme value of the signed type. */
2392 if (unsignedp && !unsignedp0)
2399 primop1 = TYPE_MIN_VALUE (type);
2405 primop1 = TYPE_MAX_VALUE (type);
2412 type = unsigned_type (type);
2415 if (!max_gt && !unsignedp0 && TREE_CODE (primop0) != INTEGER_CST)
2417 /* This is the case of (char)x >?< 0x80, which people used to use
2418 expecting old C compilers to change the 0x80 into -0x80. */
2419 if (val == boolean_false_node)
2420 warning ("comparison is always false due to limited range of data type");
2421 if (val == boolean_true_node)
2422 warning ("comparison is always true due to limited range of data type");
2425 if (!min_lt && unsignedp0 && TREE_CODE (primop0) != INTEGER_CST)
2427 /* This is the case of (unsigned char)x >?< -1 or < 0. */
2428 if (val == boolean_false_node)
2429 warning ("comparison is always false due to limited range of data type");
2430 if (val == boolean_true_node)
2431 warning ("comparison is always true due to limited range of data type");
2436 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2437 if (TREE_SIDE_EFFECTS (primop0))
2438 return build (COMPOUND_EXPR, TREE_TYPE (val), primop0, val);
2442 /* Value is not predetermined, but do the comparison
2443 in the type of the operand that is not constant.
2444 TYPE is already properly set. */
2446 else if (real1 && real2
2447 && (TYPE_PRECISION (TREE_TYPE (primop0))
2448 == TYPE_PRECISION (TREE_TYPE (primop1))))
2449 type = TREE_TYPE (primop0);
2451 /* If args' natural types are both narrower than nominal type
2452 and both extend in the same manner, compare them
2453 in the type of the wider arg.
2454 Otherwise must actually extend both to the nominal
2455 common type lest different ways of extending
2457 (eg, (short)-1 == (unsigned short)-1 should be 0.) */
2459 else if (unsignedp0 == unsignedp1 && real1 == real2
2460 && TYPE_PRECISION (TREE_TYPE (primop0)) < TYPE_PRECISION (*restype_ptr)
2461 && TYPE_PRECISION (TREE_TYPE (primop1)) < TYPE_PRECISION (*restype_ptr))
2463 type = common_type (TREE_TYPE (primop0), TREE_TYPE (primop1));
2464 type = signed_or_unsigned_type (unsignedp0
2465 || TREE_UNSIGNED (*restype_ptr),
2467 /* Make sure shorter operand is extended the right way
2468 to match the longer operand. */
2469 primop0 = convert (signed_or_unsigned_type (unsignedp0, TREE_TYPE (primop0)),
2471 primop1 = convert (signed_or_unsigned_type (unsignedp1, TREE_TYPE (primop1)),
2476 /* Here we must do the comparison on the nominal type
2477 using the args exactly as we received them. */
2478 type = *restype_ptr;
2482 if (!real1 && !real2 && integer_zerop (primop1)
2483 && TREE_UNSIGNED (*restype_ptr))
2489 /* All unsigned values are >= 0, so we warn if extra warnings
2490 are requested. However, if OP0 is a constant that is
2491 >= 0, the signedness of the comparison isn't an issue,
2492 so suppress the warning. */
2493 if (extra_warnings && !in_system_header
2494 && ! (TREE_CODE (primop0) == INTEGER_CST
2495 && ! TREE_OVERFLOW (convert (signed_type (type),
2497 warning ("comparison of unsigned expression >= 0 is always true");
2498 value = boolean_true_node;
2502 if (extra_warnings && !in_system_header
2503 && ! (TREE_CODE (primop0) == INTEGER_CST
2504 && ! TREE_OVERFLOW (convert (signed_type (type),
2506 warning ("comparison of unsigned expression < 0 is always false");
2507 value = boolean_false_node;
2516 /* Don't forget to evaluate PRIMOP0 if it has side effects. */
2517 if (TREE_SIDE_EFFECTS (primop0))
2518 return build (COMPOUND_EXPR, TREE_TYPE (value),
2525 *op0_ptr = convert (type, primop0);
2526 *op1_ptr = convert (type, primop1);
2528 *restype_ptr = boolean_type_node;
2533 /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
2534 or validate its data type for an `if' or `while' statement or ?..: exp.
2536 This preparation consists of taking the ordinary
2537 representation of an expression expr and producing a valid tree
2538 boolean expression describing whether expr is nonzero. We could
2539 simply always do build_binary_op (NE_EXPR, expr, boolean_false_node, 1),
2540 but we optimize comparisons, &&, ||, and !.
2542 The resulting type should always be `boolean_type_node'. */
2545 truthvalue_conversion (expr)
2548 if (TREE_CODE (expr) == ERROR_MARK)
2551 #if 0 /* This appears to be wrong for C++. */
2552 /* These really should return error_mark_node after 2.4 is stable.
2553 But not all callers handle ERROR_MARK properly. */
2554 switch (TREE_CODE (TREE_TYPE (expr)))
2557 error ("struct type value used where scalar is required");
2558 return boolean_false_node;
2561 error ("union type value used where scalar is required");
2562 return boolean_false_node;
2565 error ("array type value used where scalar is required");
2566 return boolean_false_node;
2573 switch (TREE_CODE (expr))
2576 case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
2577 case TRUTH_ANDIF_EXPR:
2578 case TRUTH_ORIF_EXPR:
2579 case TRUTH_AND_EXPR:
2581 case TRUTH_XOR_EXPR:
2582 case TRUTH_NOT_EXPR:
2583 TREE_TYPE (expr) = boolean_type_node;
2590 return integer_zerop (expr) ? boolean_false_node : boolean_true_node;
2593 return real_zerop (expr) ? boolean_false_node : boolean_true_node;
2596 /* If we are taking the address of a external decl, it might be zero
2597 if it is weak, so we cannot optimize. */
2598 if (DECL_P (TREE_OPERAND (expr, 0))
2599 && DECL_EXTERNAL (TREE_OPERAND (expr, 0)))
2602 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
2603 return build (COMPOUND_EXPR, boolean_type_node,
2604 TREE_OPERAND (expr, 0), boolean_true_node);
2606 return boolean_true_node;
2609 return build_binary_op ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
2610 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2611 truthvalue_conversion (TREE_OPERAND (expr, 0)),
2612 truthvalue_conversion (TREE_OPERAND (expr, 1)),
2619 /* These don't change whether an object is non-zero or zero. */
2620 return truthvalue_conversion (TREE_OPERAND (expr, 0));
2624 /* These don't change whether an object is zero or non-zero, but
2625 we can't ignore them if their second arg has side-effects. */
2626 if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
2627 return build (COMPOUND_EXPR, boolean_type_node, TREE_OPERAND (expr, 1),
2628 truthvalue_conversion (TREE_OPERAND (expr, 0)));
2630 return truthvalue_conversion (TREE_OPERAND (expr, 0));
2633 /* Distribute the conversion into the arms of a COND_EXPR. */
2634 return fold (build (COND_EXPR, boolean_type_node, TREE_OPERAND (expr, 0),
2635 truthvalue_conversion (TREE_OPERAND (expr, 1)),
2636 truthvalue_conversion (TREE_OPERAND (expr, 2))));
2639 /* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
2640 since that affects how `default_conversion' will behave. */
2641 if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
2642 || TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
2644 /* fall through... */
2646 /* If this is widening the argument, we can ignore it. */
2647 if (TYPE_PRECISION (TREE_TYPE (expr))
2648 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
2649 return truthvalue_conversion (TREE_OPERAND (expr, 0));
2653 /* With IEEE arithmetic, x - x may not equal 0, so we can't optimize
2655 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT
2656 && TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE)
2658 /* fall through... */
2660 /* This and MINUS_EXPR can be changed into a comparison of the
2662 if (TREE_TYPE (TREE_OPERAND (expr, 0))
2663 == TREE_TYPE (TREE_OPERAND (expr, 1)))
2664 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2665 TREE_OPERAND (expr, 1), 1);
2666 return build_binary_op (NE_EXPR, TREE_OPERAND (expr, 0),
2667 fold (build1 (NOP_EXPR,
2668 TREE_TYPE (TREE_OPERAND (expr, 0)),
2669 TREE_OPERAND (expr, 1))), 1);
2672 if (integer_onep (TREE_OPERAND (expr, 1))
2673 && TREE_TYPE (expr) != boolean_type_node)
2674 /* Using convert here would cause infinite recursion. */
2675 return build1 (NOP_EXPR, boolean_type_node, expr);
2679 if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
2680 warning ("suggest parentheses around assignment used as truth value");
2687 if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
2689 tree tem = save_expr (expr);
2690 return (build_binary_op
2691 ((TREE_SIDE_EFFECTS (expr)
2692 ? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
2693 truthvalue_conversion (build_unary_op (REALPART_EXPR, tem, 0)),
2694 truthvalue_conversion (build_unary_op (IMAGPART_EXPR, tem, 0)),
2698 return build_binary_op (NE_EXPR, expr, integer_zero_node, 1);
2701 static tree builtin_function_2 PARAMS ((const char *, const char *, tree, tree,
2702 int, enum built_in_class, int, int,
2705 /* Make a variant type in the proper way for C/C++, propagating qualifiers
2706 down to the element type of an array. */
2709 c_build_qualified_type (type, type_quals)
2713 /* A restrict-qualified pointer type must be a pointer to object or
2714 incomplete type. Note that the use of POINTER_TYPE_P also allows
2715 REFERENCE_TYPEs, which is appropriate for C++. Unfortunately,
2716 the C++ front-end also use POINTER_TYPE for pointer-to-member
2717 values, so even though it should be illegal to use `restrict'
2718 with such an entity we don't flag that here. Thus, special case
2719 code for that case is required in the C++ front-end. */
2720 if ((type_quals & TYPE_QUAL_RESTRICT)
2721 && (!POINTER_TYPE_P (type)
2722 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
2724 error ("invalid use of `restrict'");
2725 type_quals &= ~TYPE_QUAL_RESTRICT;
2728 if (TREE_CODE (type) == ARRAY_TYPE)
2729 return build_array_type (c_build_qualified_type (TREE_TYPE (type),
2731 TYPE_DOMAIN (type));
2732 return build_qualified_type (type, type_quals);
2735 /* Apply the TYPE_QUALS to the new DECL. */
2738 c_apply_type_quals_to_decl (type_quals, decl)
2742 if ((type_quals & TYPE_QUAL_CONST)
2743 || (TREE_TYPE (decl)
2744 && TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE))
2745 TREE_READONLY (decl) = 1;
2746 if (type_quals & TYPE_QUAL_VOLATILE)
2748 TREE_SIDE_EFFECTS (decl) = 1;
2749 TREE_THIS_VOLATILE (decl) = 1;
2751 if (type_quals & TYPE_QUAL_RESTRICT)
2753 if (!TREE_TYPE (decl)
2754 || !POINTER_TYPE_P (TREE_TYPE (decl))
2755 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (TREE_TYPE (decl))))
2756 error ("invalid use of `restrict'");
2757 else if (flag_strict_aliasing)
2759 /* No two restricted pointers can point at the same thing.
2760 However, a restricted pointer can point at the same thing
2761 as an unrestricted pointer, if that unrestricted pointer
2762 is based on the restricted pointer. So, we make the
2763 alias set for the restricted pointer a subset of the
2764 alias set for the type pointed to by the type of the
2767 HOST_WIDE_INT pointed_to_alias_set
2768 = get_alias_set (TREE_TYPE (TREE_TYPE (decl)));
2770 if (pointed_to_alias_set == 0)
2771 /* It's not legal to make a subset of alias set zero. */
2775 DECL_POINTER_ALIAS_SET (decl) = new_alias_set ();
2776 record_alias_subset (pointed_to_alias_set,
2777 DECL_POINTER_ALIAS_SET (decl));
2784 /* Return the typed-based alias set for T, which may be an expression
2785 or a type. Return -1 if we don't do anything special. */
2788 lang_get_alias_set (t)
2793 /* We know nothing about vector types */
2794 if (TREE_CODE (t) == VECTOR_TYPE)
2797 /* Permit type-punning when accessing a union, provided the access
2798 is directly through the union. For example, this code does not
2799 permit taking the address of a union member and then storing
2800 through it. Even the type-punning allowed here is a GCC
2801 extension, albeit a common and useful one; the C standard says
2802 that such accesses have implementation-defined behavior. */
2804 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
2805 u = TREE_OPERAND (u, 0))
2806 if (TREE_CODE (u) == COMPONENT_REF
2807 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
2810 /* If this is a char *, the ANSI C standard says it can alias
2811 anything. Note that all references need do this. */
2812 if (TREE_CODE_CLASS (TREE_CODE (t)) == 'r'
2813 && TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
2814 && TYPE_PRECISION (TREE_TYPE (t)) == TYPE_PRECISION (char_type_node))
2817 /* That's all the expressions we handle specially. */
2821 /* The C standard specifically allows aliasing between signed and
2822 unsigned variants of the same type. We treat the signed
2823 variant as canonical. */
2824 if (TREE_CODE (t) == INTEGER_TYPE && TREE_UNSIGNED (t))
2826 tree t1 = signed_type (t);
2828 /* t1 == t can happen for boolean nodes which are always unsigned. */
2830 return get_alias_set (t1);
2832 else if (POINTER_TYPE_P (t))
2836 /* Unfortunately, there is no canonical form of a pointer type.
2837 In particular, if we have `typedef int I', then `int *', and
2838 `I *' are different types. So, we have to pick a canonical
2839 representative. We do this below.
2841 Technically, this approach is actually more conservative that
2842 it needs to be. In particular, `const int *' and `int *'
2843 chould be in different alias sets, according to the C and C++
2844 standard, since their types are not the same, and so,
2845 technically, an `int **' and `const int **' cannot point at
2848 But, the standard is wrong. In particular, this code is
2853 const int* const* cipp = &ipp;
2855 And, it doesn't make sense for that to be legal unless you
2856 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
2857 the pointed-to types. This issue has been reported to the
2859 t1 = build_type_no_quals (t);
2861 return get_alias_set (t1);
2863 /* It's not yet safe to use alias sets for classes in C++ because
2864 the TYPE_FIELDs list for a class doesn't mention base classes. */
2865 else if (c_language == clk_cplusplus && AGGREGATE_TYPE_P (t))
2871 /* Implement the __alignof keyword: Return the minimum required
2872 alignment of TYPE, measured in bytes. */
2878 enum tree_code code = TREE_CODE (type);
2881 /* In C++, sizeof applies to the referent. Handle alignof the same way. */
2882 if (code == REFERENCE_TYPE)
2884 type = TREE_TYPE (type);
2885 code = TREE_CODE (type);
2888 if (code == FUNCTION_TYPE)
2889 t = size_int (FUNCTION_BOUNDARY / BITS_PER_UNIT);
2890 else if (code == VOID_TYPE || code == ERROR_MARK)
2892 else if (!COMPLETE_TYPE_P (type))
2894 error ("__alignof__ applied to an incomplete type");
2898 t = size_int (TYPE_ALIGN (type) / BITS_PER_UNIT);
2900 return fold (build1 (NOP_EXPR, c_size_type_node, t));
2903 /* Implement the __alignof keyword: Return the minimum required
2904 alignment of EXPR, measured in bytes. For VAR_DECL's and
2905 FIELD_DECL's return DECL_ALIGN (which can be set from an
2906 "aligned" __attribute__ specification). */
2909 c_alignof_expr (expr)
2914 if (TREE_CODE (expr) == VAR_DECL)
2915 t = size_int (DECL_ALIGN (expr) / BITS_PER_UNIT);
2917 else if (TREE_CODE (expr) == COMPONENT_REF
2918 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
2920 error ("`__alignof' applied to a bit-field");
2923 else if (TREE_CODE (expr) == COMPONENT_REF
2924 && TREE_CODE (TREE_OPERAND (expr, 1)) == FIELD_DECL)
2925 t = size_int (DECL_ALIGN (TREE_OPERAND (expr, 1)) / BITS_PER_UNIT);
2927 else if (TREE_CODE (expr) == INDIRECT_REF)
2929 tree t = TREE_OPERAND (expr, 0);
2931 int bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2933 while (TREE_CODE (t) == NOP_EXPR
2934 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
2938 t = TREE_OPERAND (t, 0);
2939 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
2940 if (thisalign > bestalign)
2941 best = t, bestalign = thisalign;
2943 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
2946 return c_alignof (TREE_TYPE (expr));
2948 return fold (build1 (NOP_EXPR, c_size_type_node, t));
2951 /* Build tree nodes and builtin functions common to both C and C++ language
2955 c_common_nodes_and_builtins ()
2959 #define DEF_PRIMITIVE_TYPE(NAME, VALUE) NAME,
2960 #define DEF_FUNCTION_TYPE_0(NAME, RETURN) NAME,
2961 #define DEF_FUNCTION_TYPE_1(NAME, RETURN, ARG1) NAME,
2962 #define DEF_FUNCTION_TYPE_2(NAME, RETURN, ARG1, ARG2) NAME,
2963 #define DEF_FUNCTION_TYPE_3(NAME, RETURN, ARG1, ARG2, ARG3) NAME,
2964 #define DEF_FUNCTION_TYPE_4(NAME, RETURN, ARG1, ARG2, ARG3, ARG4) NAME,
2965 #define DEF_FUNCTION_TYPE_VAR_0(NAME, RETURN) NAME,
2966 #define DEF_FUNCTION_TYPE_VAR_1(NAME, RETURN, ARG1) NAME,
2967 #define DEF_FUNCTION_TYPE_VAR_2(NAME, RETURN, ARG1, ARG2) NAME,
2968 #define DEF_POINTER_TYPE(NAME, TYPE) NAME,
2969 #include "builtin-types.def"
2970 #undef DEF_PRIMITIVE_TYPE
2971 #undef DEF_FUNCTION_TYPE_0
2972 #undef DEF_FUNCTION_TYPE_1
2973 #undef DEF_FUNCTION_TYPE_2
2974 #undef DEF_FUNCTION_TYPE_3
2975 #undef DEF_FUNCTION_TYPE_4
2976 #undef DEF_FUNCTION_TYPE_VAR_0
2977 #undef DEF_FUNCTION_TYPE_VAR_1
2978 #undef DEF_FUNCTION_TYPE_VAR_2
2979 #undef DEF_POINTER_TYPE
2983 typedef enum builtin_type builtin_type;
2985 tree builtin_types[(int)BT_LAST];
2986 int wchar_type_size;
2987 tree array_domain_type;
2988 /* Either char* or void*. */
2989 tree traditional_ptr_type_node;
2990 /* Either const char* or const void*. */
2991 tree traditional_cptr_type_node;
2992 tree traditional_len_type_node;
2993 tree va_list_ref_type_node;
2994 tree va_list_arg_type_node;
2996 /* Define `int' and `char' first so that dbx will output them first. */
2997 record_builtin_type (RID_INT, NULL, integer_type_node);
2998 record_builtin_type (RID_CHAR, "char", char_type_node);
3000 /* `signed' is the same as `int'. FIXME: the declarations of "signed",
3001 "unsigned long", "long long unsigned" and "unsigned short" were in C++
3002 but not C. Are the conditionals here needed? */
3003 if (c_language == clk_cplusplus)
3004 record_builtin_type (RID_SIGNED, NULL, integer_type_node);
3005 record_builtin_type (RID_LONG, "long int", long_integer_type_node);
3006 record_builtin_type (RID_UNSIGNED, "unsigned int", unsigned_type_node);
3007 record_builtin_type (RID_MAX, "long unsigned int",
3008 long_unsigned_type_node);
3009 if (c_language == clk_cplusplus)
3010 record_builtin_type (RID_MAX, "unsigned long", long_unsigned_type_node);
3011 record_builtin_type (RID_MAX, "long long int",
3012 long_long_integer_type_node);
3013 record_builtin_type (RID_MAX, "long long unsigned int",
3014 long_long_unsigned_type_node);
3015 if (c_language == clk_cplusplus)
3016 record_builtin_type (RID_MAX, "long long unsigned",
3017 long_long_unsigned_type_node);
3018 record_builtin_type (RID_SHORT, "short int", short_integer_type_node);
3019 record_builtin_type (RID_MAX, "short unsigned int",
3020 short_unsigned_type_node);
3021 if (c_language == clk_cplusplus)
3022 record_builtin_type (RID_MAX, "unsigned short",
3023 short_unsigned_type_node);
3025 /* Define both `signed char' and `unsigned char'. */
3026 record_builtin_type (RID_MAX, "signed char", signed_char_type_node);
3027 record_builtin_type (RID_MAX, "unsigned char", unsigned_char_type_node);
3029 /* These are types that type_for_size and type_for_mode use. */
3030 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intQI_type_node));
3031 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intHI_type_node));
3032 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intSI_type_node));
3033 pushdecl (build_decl (TYPE_DECL, NULL_TREE, intDI_type_node));
3034 #if HOST_BITS_PER_WIDE_INT >= 64
3035 pushdecl (build_decl (TYPE_DECL, get_identifier ("__int128_t"), intTI_type_node));
3037 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intQI_type_node));
3038 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intHI_type_node));
3039 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intSI_type_node));
3040 pushdecl (build_decl (TYPE_DECL, NULL_TREE, unsigned_intDI_type_node));
3041 #if HOST_BITS_PER_WIDE_INT >= 64
3042 pushdecl (build_decl (TYPE_DECL, get_identifier ("__uint128_t"), unsigned_intTI_type_node));
3045 /* Create the widest literal types. */
3046 widest_integer_literal_type_node
3047 = make_signed_type (HOST_BITS_PER_WIDE_INT * 2);
3048 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3049 widest_integer_literal_type_node));
3051 widest_unsigned_literal_type_node
3052 = make_unsigned_type (HOST_BITS_PER_WIDE_INT * 2);
3053 pushdecl (build_decl (TYPE_DECL, NULL_TREE,
3054 widest_unsigned_literal_type_node));
3056 /* `unsigned long' is the standard type for sizeof.
3057 Note that stddef.h uses `unsigned long',
3058 and this must agree, even if long and int are the same size. */
3060 TREE_TYPE (identifier_global_value (get_identifier (SIZE_TYPE)));
3061 signed_size_type_node = signed_type (c_size_type_node);
3062 if (flag_traditional)
3063 c_size_type_node = signed_size_type_node;
3064 set_sizetype (c_size_type_node);
3066 build_common_tree_nodes_2 (flag_short_double);
3068 record_builtin_type (RID_FLOAT, NULL, float_type_node);
3069 record_builtin_type (RID_DOUBLE, NULL, double_type_node);
3070 record_builtin_type (RID_MAX, "long double", long_double_type_node);
3072 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
3073 complex_integer_type_node));
3074 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
3075 complex_float_type_node));
3076 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
3077 complex_double_type_node));
3078 pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
3079 complex_long_double_type_node));
3081 record_builtin_type (RID_VOID, NULL, void_type_node);
3083 void_zero_node = build_int_2 (0, 0);
3084 TREE_TYPE (void_zero_node) = void_type_node;
3086 void_list_node = build_void_list_node ();
3088 /* Make a type to be the domain of a few array types
3089 whose domains don't really matter.
3090 200 is small enough that it always fits in size_t
3091 and large enough that it can hold most function names for the
3092 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
3093 array_domain_type = build_index_type (size_int (200));
3095 /* Make a type for arrays of characters.
3096 With luck nothing will ever really depend on the length of this
3098 char_array_type_node
3099 = build_array_type (char_type_node, array_domain_type);
3101 /* Likewise for arrays of ints. */
3103 = build_array_type (integer_type_node, array_domain_type);
3105 string_type_node = build_pointer_type (char_type_node);
3106 const_string_type_node
3107 = build_pointer_type (build_qualified_type
3108 (char_type_node, TYPE_QUAL_CONST));
3110 traditional_ptr_type_node = ((flag_traditional &&
3111 c_language != clk_cplusplus)
3112 ? string_type_node : ptr_type_node);
3113 traditional_cptr_type_node = ((flag_traditional &&
3114 c_language != clk_cplusplus)
3115 ? const_string_type_node : const_ptr_type_node);
3117 (*targetm.init_builtins) ();
3119 /* This is special for C++ so functions can be overloaded. */
3120 wchar_type_node = get_identifier (flag_short_wchar
3121 ? "short unsigned int"
3123 wchar_type_node = TREE_TYPE (identifier_global_value (wchar_type_node));
3124 wchar_type_size = TYPE_PRECISION (wchar_type_node);
3125 if (c_language == clk_cplusplus)
3127 if (TREE_UNSIGNED (wchar_type_node))
3128 wchar_type_node = make_unsigned_type (wchar_type_size);
3130 wchar_type_node = make_signed_type (wchar_type_size);
3131 record_builtin_type (RID_WCHAR, "wchar_t", wchar_type_node);
3135 signed_wchar_type_node = signed_type (wchar_type_node);
3136 unsigned_wchar_type_node = unsigned_type (wchar_type_node);
3139 /* This is for wide string constants. */
3140 wchar_array_type_node
3141 = build_array_type (wchar_type_node, array_domain_type);
3144 TREE_TYPE (identifier_global_value (get_identifier (WINT_TYPE)));
3147 TREE_TYPE (identifier_global_value (get_identifier (INTMAX_TYPE)));
3149 TREE_TYPE (identifier_global_value (get_identifier (UINTMAX_TYPE)));
3151 default_function_type = build_function_type (integer_type_node, NULL_TREE);
3153 = TREE_TYPE (identifier_global_value (get_identifier (PTRDIFF_TYPE)));
3154 unsigned_ptrdiff_type_node = unsigned_type (ptrdiff_type_node);
3156 pushdecl (build_decl (TYPE_DECL, get_identifier ("__builtin_va_list"),
3157 va_list_type_node));
3159 pushdecl (build_decl (TYPE_DECL, get_identifier ("__builtin_ptrdiff_t"),
3160 ptrdiff_type_node));
3162 pushdecl (build_decl (TYPE_DECL, get_identifier ("__builtin_size_t"),
3165 if (TREE_CODE (va_list_type_node) == ARRAY_TYPE)
3167 va_list_arg_type_node = va_list_ref_type_node =
3168 build_pointer_type (TREE_TYPE (va_list_type_node));
3172 va_list_arg_type_node = va_list_type_node;
3173 va_list_ref_type_node = build_reference_type (va_list_type_node);
3176 traditional_len_type_node = ((flag_traditional &&
3177 c_language != clk_cplusplus)
3178 ? integer_type_node : sizetype);
3180 #define DEF_PRIMITIVE_TYPE(ENUM, VALUE) \
3181 builtin_types[(int) ENUM] = VALUE;
3182 #define DEF_FUNCTION_TYPE_0(ENUM, RETURN) \
3183 builtin_types[(int) ENUM] \
3184 = build_function_type (builtin_types[(int) RETURN], \
3186 #define DEF_FUNCTION_TYPE_1(ENUM, RETURN, ARG1) \
3187 builtin_types[(int) ENUM] \
3188 = build_function_type (builtin_types[(int) RETURN], \
3189 tree_cons (NULL_TREE, \
3190 builtin_types[(int) ARG1], \
3192 #define DEF_FUNCTION_TYPE_2(ENUM, RETURN, ARG1, ARG2) \
3193 builtin_types[(int) ENUM] \
3194 = build_function_type \
3195 (builtin_types[(int) RETURN], \
3196 tree_cons (NULL_TREE, \
3197 builtin_types[(int) ARG1], \
3198 tree_cons (NULL_TREE, \
3199 builtin_types[(int) ARG2], \
3201 #define DEF_FUNCTION_TYPE_3(ENUM, RETURN, ARG1, ARG2, ARG3) \
3202 builtin_types[(int) ENUM] \
3203 = build_function_type \
3204 (builtin_types[(int) RETURN], \
3205 tree_cons (NULL_TREE, \
3206 builtin_types[(int) ARG1], \
3207 tree_cons (NULL_TREE, \
3208 builtin_types[(int) ARG2], \
3209 tree_cons (NULL_TREE, \
3210 builtin_types[(int) ARG3], \
3212 #define DEF_FUNCTION_TYPE_4(ENUM, RETURN, ARG1, ARG2, ARG3, ARG4) \
3213 builtin_types[(int) ENUM] \
3214 = build_function_type \
3215 (builtin_types[(int) RETURN], \
3216 tree_cons (NULL_TREE, \
3217 builtin_types[(int) ARG1], \
3218 tree_cons (NULL_TREE, \
3219 builtin_types[(int) ARG2], \
3222 builtin_types[(int) ARG3], \
3223 tree_cons (NULL_TREE, \
3224 builtin_types[(int) ARG4], \
3225 void_list_node)))));
3226 #define DEF_FUNCTION_TYPE_VAR_0(ENUM, RETURN) \
3227 builtin_types[(int) ENUM] \
3228 = build_function_type (builtin_types[(int) RETURN], NULL_TREE);
3229 #define DEF_FUNCTION_TYPE_VAR_1(ENUM, RETURN, ARG1) \
3230 builtin_types[(int) ENUM] \
3231 = build_function_type (builtin_types[(int) RETURN], \
3232 tree_cons (NULL_TREE, \
3233 builtin_types[(int) ARG1], \
3236 #define DEF_FUNCTION_TYPE_VAR_2(ENUM, RETURN, ARG1, ARG2) \
3237 builtin_types[(int) ENUM] \
3238 = build_function_type \
3239 (builtin_types[(int) RETURN], \
3240 tree_cons (NULL_TREE, \
3241 builtin_types[(int) ARG1], \
3242 tree_cons (NULL_TREE, \
3243 builtin_types[(int) ARG2], \
3245 #define DEF_POINTER_TYPE(ENUM, TYPE) \
3246 builtin_types[(int) ENUM] \
3247 = build_pointer_type (builtin_types[(int) TYPE]);
3248 #include "builtin-types.def"
3249 #undef DEF_PRIMITIVE_TYPE
3250 #undef DEF_FUNCTION_TYPE_1
3251 #undef DEF_FUNCTION_TYPE_2
3252 #undef DEF_FUNCTION_TYPE_3
3253 #undef DEF_FUNCTION_TYPE_4
3254 #undef DEF_FUNCTION_TYPE_VAR_0
3255 #undef DEF_FUNCTION_TYPE_VAR_1
3256 #undef DEF_POINTER_TYPE
3258 #define DEF_BUILTIN(ENUM, NAME, CLASS, \
3259 TYPE, LIBTYPE, BOTH_P, FALLBACK_P, NONANSI_P) \
3264 if (strncmp (NAME, "__builtin_", strlen ("__builtin_")) != 0) \
3268 decl = builtin_function (NAME, builtin_types[TYPE], ENUM, \
3271 ? (NAME + strlen ("__builtin_")) \
3274 decl = builtin_function_2 (NAME, \
3275 NAME + strlen ("__builtin_"), \
3276 builtin_types[TYPE], \
3277 builtin_types[LIBTYPE], \
3282 /*noreturn_p=*/0); \
3284 built_in_decls[(int) ENUM] = decl; \
3286 #include "builtins.def"
3289 /* Declare _exit and _Exit just to mark them as non-returning. */
3290 builtin_function_2 (NULL, "_exit", NULL_TREE,
3291 builtin_types[BT_FN_VOID_INT],
3292 0, NOT_BUILT_IN, 0, 1, 1);
3293 builtin_function_2 (NULL, "_Exit", NULL_TREE,
3294 builtin_types[BT_FN_VOID_INT],
3295 0, NOT_BUILT_IN, 0, !flag_isoc99, 1);
3297 /* Declare these functions non-returning
3298 to avoid spurious "control drops through" warnings. */
3299 builtin_function_2 (NULL, "abort",
3300 NULL_TREE, ((c_language == clk_cplusplus)
3301 ? builtin_types[BT_FN_VOID]
3302 : builtin_types[BT_FN_VOID_VAR]),
3303 0, NOT_BUILT_IN, 0, 0, 1);
3305 builtin_function_2 (NULL, "exit",
3306 NULL_TREE, ((c_language == clk_cplusplus)
3307 ? builtin_types[BT_FN_VOID_INT]
3308 : builtin_types[BT_FN_VOID_VAR]),
3309 0, NOT_BUILT_IN, 0, 0, 1);
3311 main_identifier_node = get_identifier ("main");
3313 /* ??? Perhaps there's a better place to do this. But it is related
3314 to __builtin_va_arg, so it isn't that off-the-wall. */
3315 lang_type_promotes_to = simple_type_promotes_to;
3319 build_va_arg (expr, type)
3322 return build1 (VA_ARG_EXPR, type, expr);
3326 /* Possibly define a builtin function with one or two names. BUILTIN_NAME
3327 is an __builtin_-prefixed name; NAME is the ordinary name; one or both
3328 of these may be NULL (though both being NULL is useless).
3329 BUILTIN_TYPE is the type of the __builtin_-prefixed function;
3330 TYPE is the type of the function with the ordinary name. These
3331 may differ if the ordinary name is declared with a looser type to avoid
3332 conflicts with headers. FUNCTION_CODE and CLASS are as for
3333 builtin_function. If LIBRARY_NAME_P is nonzero, NAME is passed as
3334 the LIBRARY_NAME parameter to builtin_function when declaring BUILTIN_NAME.
3335 If NONANSI_P is nonzero, the name NAME is treated as a non-ANSI name; if
3336 NORETURN_P is nonzero, the function is marked as non-returning.
3337 Returns the declaration of BUILTIN_NAME, if any, otherwise
3338 the declaration of NAME. Does not declare NAME if flag_no_builtin,
3339 or if NONANSI_P and flag_no_nonansi_builtin. */
3342 builtin_function_2 (builtin_name, name, builtin_type, type, function_code,
3343 class, library_name_p, nonansi_p, noreturn_p)
3344 const char *builtin_name;
3349 enum built_in_class class;
3354 tree bdecl = NULL_TREE;
3355 tree decl = NULL_TREE;
3356 if (builtin_name != 0)
3358 bdecl = builtin_function (builtin_name, builtin_type, function_code,
3359 class, library_name_p ? name : NULL);
3362 TREE_THIS_VOLATILE (bdecl) = 1;
3363 TREE_SIDE_EFFECTS (bdecl) = 1;
3366 if (name != 0 && !flag_no_builtin && !(nonansi_p && flag_no_nonansi_builtin))
3368 decl = builtin_function (name, type, function_code, class, NULL);
3370 DECL_BUILT_IN_NONANSI (decl) = 1;
3373 TREE_THIS_VOLATILE (decl) = 1;
3374 TREE_SIDE_EFFECTS (decl) = 1;
3377 return (bdecl != 0 ? bdecl : decl);
3380 /* Nonzero if the type T promotes to int. This is (nearly) the
3381 integral promotions defined in ISO C99 6.3.1.1/2. */
3384 c_promoting_integer_type_p (t)
3387 switch (TREE_CODE (t))
3390 return (TYPE_MAIN_VARIANT (t) == char_type_node
3391 || TYPE_MAIN_VARIANT (t) == signed_char_type_node
3392 || TYPE_MAIN_VARIANT (t) == unsigned_char_type_node
3393 || TYPE_MAIN_VARIANT (t) == short_integer_type_node
3394 || TYPE_MAIN_VARIANT (t) == short_unsigned_type_node);
3397 /* ??? Technically all enumerations not larger than an int
3398 promote to an int. But this is used along code paths
3399 that only want to notice a size change. */
3400 return TYPE_PRECISION (t) < TYPE_PRECISION (integer_type_node);
3410 /* Given a type, apply default promotions wrt unnamed function arguments
3411 and return the new type. Return NULL_TREE if no change. */
3412 /* ??? There is a function of the same name in the C++ front end that
3413 does something similar, but is more thorough and does not return NULL
3414 if no change. We could perhaps share code, but it would make the
3415 self_promoting_type property harder to identify. */
3418 simple_type_promotes_to (type)
3421 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3422 return double_type_node;
3424 if (c_promoting_integer_type_p (type))
3426 /* Traditionally, unsignedness is preserved in default promotions.
3427 Also preserve unsignedness if not really getting any wider. */
3428 if (TREE_UNSIGNED (type)
3429 && (flag_traditional
3430 || TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
3431 return unsigned_type_node;
3432 return integer_type_node;
3438 /* Return 1 if PARMS specifies a fixed number of parameters
3439 and none of their types is affected by default promotions. */
3442 self_promoting_args_p (parms)
3446 for (t = parms; t; t = TREE_CHAIN (t))
3448 register tree type = TREE_VALUE (t);
3450 if (TREE_CHAIN (t) == 0 && type != void_type_node)
3456 if (TYPE_MAIN_VARIANT (type) == float_type_node)
3459 if (c_promoting_integer_type_p (type))
3465 /* Recursively examines the array elements of TYPE, until a non-array
3466 element type is found. */
3469 strip_array_types (type)
3472 while (TREE_CODE (type) == ARRAY_TYPE)
3473 type = TREE_TYPE (type);
3478 /* Recognize certain built-in functions so we can make tree-codes
3479 other than CALL_EXPR. We do this when it enables fold-const.c
3480 to do something useful. */
3481 /* ??? By rights this should go in builtins.c, but only C and C++
3482 implement build_{binary,unary}_op. Not exactly sure what bits
3483 of functionality are actually needed from those functions, or
3484 where the similar functionality exists in the other front ends. */
3487 expand_tree_builtin (function, params, coerced_params)
3488 tree function, params, coerced_params;
3490 enum tree_code code;
3492 if (DECL_BUILT_IN_CLASS (function) != BUILT_IN_NORMAL)
3495 switch (DECL_FUNCTION_CODE (function))
3499 case BUILT_IN_LLABS:
3500 case BUILT_IN_IMAXABS:
3502 case BUILT_IN_FABSL:
3503 case BUILT_IN_FABSF:
3504 if (coerced_params == 0)
3505 return integer_zero_node;
3506 return build_unary_op (ABS_EXPR, TREE_VALUE (coerced_params), 0);
3509 case BUILT_IN_CONJF:
3510 case BUILT_IN_CONJL:
3511 if (coerced_params == 0)
3512 return integer_zero_node;
3513 return build_unary_op (CONJ_EXPR, TREE_VALUE (coerced_params), 0);
3515 case BUILT_IN_CREAL:
3516 case BUILT_IN_CREALF:
3517 case BUILT_IN_CREALL:
3518 if (coerced_params == 0)
3519 return integer_zero_node;
3520 return build_unary_op (REALPART_EXPR, TREE_VALUE (coerced_params), 0);
3522 case BUILT_IN_CIMAG:
3523 case BUILT_IN_CIMAGF:
3524 case BUILT_IN_CIMAGL:
3525 if (coerced_params == 0)
3526 return integer_zero_node;
3527 return build_unary_op (IMAGPART_EXPR, TREE_VALUE (coerced_params), 0);
3529 case BUILT_IN_ISGREATER:
3530 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT)
3536 case BUILT_IN_ISGREATEREQUAL:
3537 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT)
3543 case BUILT_IN_ISLESS:
3544 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT)
3550 case BUILT_IN_ISLESSEQUAL:
3551 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT)
3557 case BUILT_IN_ISLESSGREATER:
3558 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT)
3564 case BUILT_IN_ISUNORDERED:
3565 if (TARGET_FLOAT_FORMAT != IEEE_FLOAT_FORMAT)
3566 return integer_zero_node;
3567 code = UNORDERED_EXPR;
3575 || TREE_CHAIN (params) == 0)
3577 error ("too few arguments to function `%s'",
3578 IDENTIFIER_POINTER (DECL_NAME (function)));
3579 return error_mark_node;
3581 else if (TREE_CHAIN (TREE_CHAIN (params)) != 0)
3583 error ("too many arguments to function `%s'",
3584 IDENTIFIER_POINTER (DECL_NAME (function)));
3585 return error_mark_node;
3588 arg0 = TREE_VALUE (params);
3589 arg1 = TREE_VALUE (TREE_CHAIN (params));
3590 arg0 = build_binary_op (code, arg0, arg1, 0);
3591 if (code != UNORDERED_EXPR)
3592 arg0 = build_unary_op (TRUTH_NOT_EXPR, arg0, 0);
3604 /* Returns non-zero if CODE is the code for a statement. */
3607 statement_code_p (code)
3608 enum tree_code code;
3631 if (lang_statement_code_p)
3632 return (*lang_statement_code_p) (code);
3637 /* Walk the statement tree, rooted at *tp. Apply FUNC to all the
3638 sub-trees of *TP in a pre-order traversal. FUNC is called with the
3639 DATA and the address of each sub-tree. If FUNC returns a non-NULL
3640 value, the traversal is aborted, and the value returned by FUNC is
3641 returned. If FUNC sets WALK_SUBTREES to zero, then the subtrees of
3642 the node being visited are not walked.
3644 We don't need a without_duplicates variant of this one because the
3645 statement tree is a tree, not a graph. */
3648 walk_stmt_tree (tp, func, data)
3653 enum tree_code code;
3658 #define WALK_SUBTREE(NODE) \
3661 result = walk_stmt_tree (&(NODE), func, data); \
3667 /* Skip empty subtrees. */
3671 /* Skip subtrees below non-statement nodes. */
3672 if (!statement_code_p (TREE_CODE (*tp)))
3675 /* Call the function. */
3677 result = (*func) (tp, &walk_subtrees, data);
3679 /* If we found something, return it. */
3683 /* FUNC may have modified the tree, recheck that we're looking at a
3685 code = TREE_CODE (*tp);
3686 if (!statement_code_p (code))
3689 /* Visit the subtrees unless FUNC decided that there was nothing
3690 interesting below this point in the tree. */
3693 /* Walk over all the sub-trees of this operand. Statement nodes
3694 never contain RTL, and we needn't worry about TARGET_EXPRs. */
3695 len = TREE_CODE_LENGTH (code);
3697 /* Go through the subtrees. We need to do this in forward order so
3698 that the scope of a FOR_EXPR is handled properly. */
3699 for (i = 0; i < len; ++i)
3700 WALK_SUBTREE (TREE_OPERAND (*tp, i));
3703 /* Finally visit the chain. This can be tail-recursion optimized if
3704 we write it this way. */
3705 return walk_stmt_tree (&TREE_CHAIN (*tp), func, data);
3710 /* Used to compare case labels. K1 and K2 are actually tree nodes
3711 representing case labels, or NULL_TREE for a `default' label.
3712 Returns -1 if K1 is ordered before K2, -1 if K1 is ordered after
3713 K2, and 0 if K1 and K2 are equal. */
3716 case_compare (k1, k2)
3720 /* Consider a NULL key (such as arises with a `default' label) to be
3721 smaller than anything else. */
3727 return tree_int_cst_compare ((tree) k1, (tree) k2);
3730 /* Process a case label for the range LOW_VALUE ... HIGH_VALUE. If
3731 LOW_VALUE and HIGH_VALUE are both NULL_TREE then this case label is
3732 actually a `default' label. If only HIGH_VALUE is NULL_TREE, then
3733 case label was declared using the usual C/C++ syntax, rather than
3734 the GNU case range extension. CASES is a tree containing all the
3735 case ranges processed so far; COND is the condition for the
3736 switch-statement itself. Returns the CASE_LABEL created, or
3737 ERROR_MARK_NODE if no CASE_LABEL is created. */
3740 c_add_case_label (cases, cond, low_value, high_value)
3749 splay_tree_node node;
3751 /* Create the LABEL_DECL itself. */
3752 label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE);
3753 DECL_CONTEXT (label) = current_function_decl;
3755 /* If there was an error processing the switch condition, bail now
3756 before we get more confused. */
3757 if (!cond || cond == error_mark_node)
3759 /* Add a label anyhow so that the back-end doesn't think that
3760 the beginning of the switch is unreachable. */
3762 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3763 return error_mark_node;
3766 if ((low_value && TREE_TYPE (low_value)
3767 && POINTER_TYPE_P (TREE_TYPE (low_value)))
3768 || (high_value && TREE_TYPE (high_value)
3769 && POINTER_TYPE_P (TREE_TYPE (high_value))))
3770 error ("pointers are not permitted as case values");
3772 /* Case ranges are a GNU extension. */
3773 if (high_value && pedantic)
3775 if (c_language == clk_cplusplus)
3776 pedwarn ("ISO C++ forbids range expressions in switch statements");
3778 pedwarn ("ISO C forbids range expressions in switch statements");
3781 type = TREE_TYPE (cond);
3784 low_value = check_case_value (low_value);
3785 low_value = convert_and_check (type, low_value);
3789 high_value = check_case_value (high_value);
3790 high_value = convert_and_check (type, high_value);
3793 /* If an error has occurred, bail out now. */
3794 if (low_value == error_mark_node || high_value == error_mark_node)
3797 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3798 return error_mark_node;
3801 /* If the LOW_VALUE and HIGH_VALUE are the same, then this isn't
3802 really a case range, even though it was written that way. Remove
3803 the HIGH_VALUE to simplify later processing. */
3804 if (tree_int_cst_equal (low_value, high_value))
3805 high_value = NULL_TREE;
3806 if (low_value && high_value
3807 && !tree_int_cst_lt (low_value, high_value))
3808 warning ("empty range specified");
3810 /* Look up the LOW_VALUE in the table of case labels we already
3812 node = splay_tree_lookup (cases, (splay_tree_key) low_value);
3813 /* If there was not an exact match, check for overlapping ranges.
3814 There's no need to do this if there's no LOW_VALUE or HIGH_VALUE;
3815 that's a `default' label and the only overlap is an exact match. */
3816 if (!node && (low_value || high_value))
3818 splay_tree_node low_bound;
3819 splay_tree_node high_bound;
3821 /* Even though there wasn't an exact match, there might be an
3822 overlap between this case range and another case range.
3823 Since we've (inductively) not allowed any overlapping case
3824 ranges, we simply need to find the greatest low case label
3825 that is smaller that LOW_VALUE, and the smallest low case
3826 label that is greater than LOW_VALUE. If there is an overlap
3827 it will occur in one of these two ranges. */
3828 low_bound = splay_tree_predecessor (cases,
3829 (splay_tree_key) low_value);
3830 high_bound = splay_tree_successor (cases,
3831 (splay_tree_key) low_value);
3833 /* Check to see if the LOW_BOUND overlaps. It is smaller than
3834 the LOW_VALUE, so there is no need to check unless the
3835 LOW_BOUND is in fact itself a case range. */
3837 && CASE_HIGH ((tree) low_bound->value)
3838 && tree_int_cst_compare (CASE_HIGH ((tree) low_bound->value),
3841 /* Check to see if the HIGH_BOUND overlaps. The low end of that
3842 range is bigger than the low end of the current range, so we
3843 are only interested if the current range is a real range, and
3844 not an ordinary case label. */
3847 && (tree_int_cst_compare ((tree) high_bound->key,
3852 /* If there was an overlap, issue an error. */
3855 tree duplicate = CASE_LABEL_DECL ((tree) node->value);
3859 error ("duplicate (or overlapping) case value");
3860 error_with_decl (duplicate,
3861 "this is the first entry overlapping that value");
3865 error ("duplicate case value") ;
3866 error_with_decl (duplicate, "previously used here");
3870 error ("multiple default labels in one switch");
3871 error_with_decl (duplicate, "this is the first default label");
3874 add_stmt (build_case_label (NULL_TREE, NULL_TREE, label));
3877 /* Add a CASE_LABEL to the statement-tree. */
3878 case_label = add_stmt (build_case_label (low_value, high_value, label));
3879 /* Register this case label in the splay tree. */
3880 splay_tree_insert (cases,
3881 (splay_tree_key) low_value,
3882 (splay_tree_value) case_label);
3887 /* Finish an expression taking the address of LABEL. Returns an
3888 expression for the address. */
3891 finish_label_address_expr (label)
3898 if (c_language == clk_cplusplus)
3899 pedwarn ("ISO C++ forbids taking the address of a label");
3901 pedwarn ("ISO C forbids taking the address of a label");
3904 label = lookup_label (label);
3905 if (label == NULL_TREE)
3906 result = null_pointer_node;
3909 TREE_USED (label) = 1;
3910 result = build1 (ADDR_EXPR, ptr_type_node, label);
3911 TREE_CONSTANT (result) = 1;
3912 /* The current function in not necessarily uninlinable.
3913 Computed gotos are incompatible with inlining, but the value
3914 here could be used only in a diagnostic, for example. */
3920 /* Mark P (a stmt_tree) for GC. The use of a `void *' for the
3921 parameter allows this function to be used as a GC-marking
3928 stmt_tree st = (stmt_tree) p;
3930 ggc_mark_tree (st->x_last_stmt);
3931 ggc_mark_tree (st->x_last_expr_type);
3934 /* Mark LD for GC. */
3937 c_mark_lang_decl (c)
3938 struct c_lang_decl *c;
3940 ggc_mark_tree (c->saved_tree);
3943 /* Mark F for GC. */
3946 mark_c_language_function (f)
3947 struct language_function *f;
3952 mark_stmt_tree (&f->x_stmt_tree);
3953 ggc_mark_tree (f->x_scope_stmt_stack);
3956 /* Hook used by expand_expr to expand language-specific tree codes. */
3959 c_expand_expr (exp, target, tmode, modifier)
3962 enum machine_mode tmode;
3963 enum expand_modifier modifier;
3965 switch (TREE_CODE (exp))
3972 /* Since expand_expr_stmt calls free_temp_slots after every
3973 expression statement, we must call push_temp_slots here.
3974 Otherwise, any temporaries in use now would be considered
3975 out-of-scope after the first EXPR_STMT from within the
3978 rtl_expr = expand_start_stmt_expr ();
3979 expand_stmt (STMT_EXPR_STMT (exp));
3980 expand_end_stmt_expr (rtl_expr);
3981 result = expand_expr (rtl_expr, target, tmode, modifier);
3989 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
3990 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
3992 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
3993 && (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
3994 == BUILT_IN_FRONTEND))
3995 return c_expand_builtin (exp, target, tmode, modifier);
4009 /* Hook used by safe_from_p to handle language-specific tree codes. */
4012 c_safe_from_p (target, exp)
4016 /* We can see statements here when processing the body of a
4017 statement-expression. For a declaration statement declaring a
4018 variable, look at the variable's initializer. */
4019 if (TREE_CODE (exp) == DECL_STMT)
4021 tree decl = DECL_STMT_DECL (exp);
4023 if (TREE_CODE (decl) == VAR_DECL
4024 && DECL_INITIAL (decl)
4025 && !safe_from_p (target, DECL_INITIAL (decl), /*top_p=*/0))
4029 /* For any statement, we must follow the statement-chain. */
4030 if (statement_code_p (TREE_CODE (exp)) && TREE_CHAIN (exp))
4031 return safe_from_p (target, TREE_CHAIN (exp), /*top_p=*/0);
4033 /* Assume everything else is safe. */
4037 /* Hook used by unsafe_for_reeval to handle language-specific tree codes. */
4040 c_unsafe_for_reeval (exp)
4043 /* Statement expressions may not be reevaluated. */
4044 if (TREE_CODE (exp) == STMT_EXPR)
4047 /* Walk all other expressions. */
4051 /* Tree code classes. */
4053 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
4055 static char c_tree_code_type[] = {
4057 #include "c-common.def"
4061 /* Table indexed by tree code giving number of expression
4062 operands beyond the fixed part of the node structure.
4063 Not used for types or decls. */
4065 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
4067 static int c_tree_code_length[] = {
4069 #include "c-common.def"
4073 /* Names of tree components.
4074 Used for printing out the tree and error messages. */
4075 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
4077 static const char *const c_tree_code_name[] = {
4079 #include "c-common.def"
4083 /* Adds the tree codes specific to the C front end to the list of all
4089 memcpy (tree_code_type + (int) LAST_AND_UNUSED_TREE_CODE,
4091 (int)LAST_C_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE);
4092 memcpy (tree_code_length + (int) LAST_AND_UNUSED_TREE_CODE,
4094 (LAST_C_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (int));
4095 memcpy (tree_code_name + (int) LAST_AND_UNUSED_TREE_CODE,
4097 (LAST_C_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (char *));
4098 lang_unsafe_for_reeval = c_unsafe_for_reeval;
4101 #define CALLED_AS_BUILT_IN(NODE) \
4102 (!strncmp (IDENTIFIER_POINTER (DECL_NAME (NODE)), "__builtin_", 10))
4105 c_expand_builtin (exp, target, tmode, modifier)
4108 enum machine_mode tmode;
4109 enum expand_modifier modifier;
4111 tree type = TREE_TYPE (exp);
4112 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4113 tree arglist = TREE_OPERAND (exp, 1);
4114 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
4115 enum tree_code code = TREE_CODE (exp);
4116 const int ignore = (target == const0_rtx
4117 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
4118 || code == CONVERT_EXPR || code == REFERENCE_EXPR
4119 || code == COND_EXPR)
4120 && TREE_CODE (type) == VOID_TYPE));
4122 if (! optimize && ! CALLED_AS_BUILT_IN (fndecl))
4123 return expand_call (exp, target, ignore);
4127 case BUILT_IN_PRINTF:
4128 target = c_expand_builtin_printf (arglist, target, tmode,
4134 case BUILT_IN_FPRINTF:
4135 target = c_expand_builtin_fprintf (arglist, target, tmode,
4141 default: /* just do library call, if unknown builtin */
4142 error ("built-in function `%s' not currently supported",
4143 IDENTIFIER_POINTER (DECL_NAME (fndecl)));
4146 /* The switch statement above can drop through to cause the function
4147 to be called normally. */
4148 return expand_call (exp, target, ignore);
4151 /* Check an arglist to *printf for problems. The arglist should start
4152 at the format specifier, with the remaining arguments immediately
4155 is_valid_printf_arglist (arglist)
4158 /* Save this value so we can restore it later. */
4159 const int SAVE_pedantic = pedantic;
4160 int diagnostic_occurred = 0;
4162 /* Set this to a known value so the user setting won't affect code
4165 /* Check to make sure there are no format specifier errors. */
4166 check_function_format (&diagnostic_occurred,
4167 maybe_get_identifier("printf"),
4168 NULL_TREE, arglist);
4170 /* Restore the value of `pedantic'. */
4171 pedantic = SAVE_pedantic;
4173 /* If calling `check_function_format_ptr' produces a warning, we
4174 return false, otherwise we return true. */
4175 return ! diagnostic_occurred;
4178 /* If the arguments passed to printf are suitable for optimizations,
4179 we attempt to transform the call. */
4181 c_expand_builtin_printf (arglist, target, tmode, modifier, ignore)
4184 enum machine_mode tmode;
4185 enum expand_modifier modifier;
4188 tree fn_putchar = built_in_decls[BUILT_IN_PUTCHAR],
4189 fn_puts = built_in_decls[BUILT_IN_PUTS];
4190 tree fn, format_arg, stripped_string;
4192 /* If the return value is used, or the replacement _DECL isn't
4193 initialized, don't do the transformation. */
4194 if (!ignore || !fn_putchar || !fn_puts)
4197 /* Verify the required arguments in the original call. */
4199 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE))
4202 /* Check the specifier vs. the parameters. */
4203 if (!is_valid_printf_arglist (arglist))
4206 format_arg = TREE_VALUE (arglist);
4207 stripped_string = format_arg;
4208 STRIP_NOPS (stripped_string);
4209 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4210 stripped_string = TREE_OPERAND (stripped_string, 0);
4212 /* If the format specifier isn't a STRING_CST, punt. */
4213 if (TREE_CODE (stripped_string) != STRING_CST)
4216 /* OK! We can attempt optimization. */
4218 /* If the format specifier was "%s\n", call __builtin_puts(arg2). */
4219 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s\n") == 0)
4221 arglist = TREE_CHAIN (arglist);
4224 /* If the format specifier was "%c", call __builtin_putchar (arg2). */
4225 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4227 arglist = TREE_CHAIN (arglist);
4232 /* We can't handle anything else with % args or %% ... yet. */
4233 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4236 /* If the resulting constant string has a length of 1, call
4237 putchar. Note, TREE_STRING_LENGTH includes the terminating
4238 NULL in its count. */
4239 if (TREE_STRING_LENGTH (stripped_string) == 2)
4241 /* Given printf("c"), (where c is any one character,)
4242 convert "c"[0] to an int and pass that to the replacement
4244 arglist = build_int_2 (TREE_STRING_POINTER (stripped_string)[0], 0);
4245 arglist = build_tree_list (NULL_TREE, arglist);
4249 /* If the resulting constant was "string\n", call
4250 __builtin_puts("string"). Ensure "string" has at least one
4251 character besides the trailing \n. Note, TREE_STRING_LENGTH
4252 includes the terminating NULL in its count. */
4253 else if (TREE_STRING_LENGTH (stripped_string) > 2
4254 && TREE_STRING_POINTER (stripped_string)
4255 [TREE_STRING_LENGTH (stripped_string) - 2] == '\n')
4257 /* Create a NULL-terminated string that's one char shorter
4258 than the original, stripping off the trailing '\n'. */
4259 const int newlen = TREE_STRING_LENGTH (stripped_string) - 1;
4260 char *newstr = (char *) alloca (newlen);
4261 memcpy (newstr, TREE_STRING_POINTER (stripped_string), newlen - 1);
4262 newstr[newlen - 1] = 0;
4264 arglist = combine_strings (build_string (newlen, newstr));
4265 arglist = build_tree_list (NULL_TREE, arglist);
4269 /* We'd like to arrange to call fputs(string) here, but we
4270 need stdout and don't have a way to get it ... yet. */
4274 return expand_expr (build_function_call (fn, arglist),
4275 (ignore ? const0_rtx : target),
4279 /* If the arguments passed to fprintf are suitable for optimizations,
4280 we attempt to transform the call. */
4282 c_expand_builtin_fprintf (arglist, target, tmode, modifier, ignore)
4285 enum machine_mode tmode;
4286 enum expand_modifier modifier;
4289 tree fn_fputc = built_in_decls[BUILT_IN_FPUTC],
4290 fn_fputs = built_in_decls[BUILT_IN_FPUTS];
4291 tree fn, format_arg, stripped_string;
4293 /* If the return value is used, or the replacement _DECL isn't
4294 initialized, don't do the transformation. */
4295 if (!ignore || !fn_fputc || !fn_fputs)
4298 /* Verify the required arguments in the original call. */
4300 || (TREE_CODE (TREE_TYPE (TREE_VALUE (arglist))) != POINTER_TYPE)
4301 || (TREE_CHAIN (arglist) == 0)
4302 || (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (arglist)))) !=
4306 /* Check the specifier vs. the parameters. */
4307 if (!is_valid_printf_arglist (TREE_CHAIN (arglist)))
4310 format_arg = TREE_VALUE (TREE_CHAIN (arglist));
4311 stripped_string = format_arg;
4312 STRIP_NOPS (stripped_string);
4313 if (stripped_string && TREE_CODE (stripped_string) == ADDR_EXPR)
4314 stripped_string = TREE_OPERAND (stripped_string, 0);
4316 /* If the format specifier isn't a STRING_CST, punt. */
4317 if (TREE_CODE (stripped_string) != STRING_CST)
4320 /* OK! We can attempt optimization. */
4322 /* If the format specifier was "%s", call __builtin_fputs(arg3, arg1). */
4323 if (strcmp (TREE_STRING_POINTER (stripped_string), "%s") == 0)
4325 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4326 arglist = tree_cons (NULL_TREE,
4327 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4331 /* If the format specifier was "%c", call __builtin_fputc (arg3, arg1). */
4332 else if (strcmp (TREE_STRING_POINTER (stripped_string), "%c") == 0)
4334 tree newarglist = build_tree_list (NULL_TREE, TREE_VALUE (arglist));
4335 arglist = tree_cons (NULL_TREE,
4336 TREE_VALUE (TREE_CHAIN (TREE_CHAIN (arglist))),
4342 /* We can't handle anything else with % args or %% ... yet. */
4343 if (strchr (TREE_STRING_POINTER (stripped_string), '%'))
4346 /* When "string" doesn't contain %, replace all cases of
4347 fprintf(stream,string) with fputs(string,stream). The fputs
4348 builtin will take take of special cases like length==1. */
4349 arglist = tree_cons (NULL_TREE, TREE_VALUE (TREE_CHAIN (arglist)),
4350 build_tree_list (NULL_TREE, TREE_VALUE (arglist)));
4354 return expand_expr (build_function_call (fn, arglist),
4355 (ignore ? const0_rtx : target),
4360 /* Given a boolean expression ARG, return a tree representing an increment
4361 or decrement (as indicated by CODE) of ARG. The front end must check for
4362 invalid cases (e.g., decrement in C++). */
4364 boolean_increment (code, arg)
4365 enum tree_code code;
4369 tree true_res = (c_language == clk_cplusplus
4371 : c_bool_true_node);
4372 arg = stabilize_reference (arg);
4375 case PREINCREMENT_EXPR:
4376 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4378 case POSTINCREMENT_EXPR:
4379 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, true_res);
4380 arg = save_expr (arg);
4381 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4382 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4384 case PREDECREMENT_EXPR:
4385 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4387 case POSTDECREMENT_EXPR:
4388 val = build (MODIFY_EXPR, TREE_TYPE (arg), arg, invert_truthvalue (arg));
4389 arg = save_expr (arg);
4390 val = build (COMPOUND_EXPR, TREE_TYPE (arg), val, arg);
4391 val = build (COMPOUND_EXPR, TREE_TYPE (arg), arg, val);
4396 TREE_SIDE_EFFECTS (val) = 1;
4401 /* Do the parts of lang_init common to C and C++. */
4403 c_common_lang_init ()
4405 /* If still "unspecified", make it match -fbounded-pointers. */
4406 if (flag_bounds_check < 0)
4407 flag_bounds_check = flag_bounded_pointers;
4409 /* Special format checking options don't work without -Wformat; warn if
4411 if (warn_format_y2k && !warn_format)
4412 warning ("-Wformat-y2k ignored without -Wformat");
4413 if (warn_format_extra_args && !warn_format)
4414 warning ("-Wformat-extra-args ignored without -Wformat");
4415 if (warn_format_nonliteral && !warn_format)
4416 warning ("-Wformat-nonliteral ignored without -Wformat");
4417 if (warn_format_security && !warn_format)
4418 warning ("-Wformat-security ignored without -Wformat");
4419 if (warn_missing_format_attribute && !warn_format)
4420 warning ("-Wmissing-format-attribute ignored without -Wformat");