1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid = 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash {
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
179 htab_t type_hash_table;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
184 htab_t int_cst_hash_table;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node;
192 static GTY (()) tree cl_target_option_node;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
194 htab_t cl_option_hash_table;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
200 htab_t debug_expr_for_decl;
202 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
203 htab_t value_expr_for_decl;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map)))
207 htab_t init_priority_for_decl;
209 static void set_type_quals (tree, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t type_hash_hash (const void *);
212 static hashval_t int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree, hashval_t);
221 static unsigned int attribute_hash_list (const_tree, hashval_t);
223 tree global_trees[TI_MAX];
224 tree integer_types[itk_none];
226 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0 /* OMP_CLAUSE_UNTIED */
249 const char * const omp_clause_code_name[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code)
275 switch (TREE_CODE_CLASS (code))
277 case tcc_declaration:
282 return TS_FIELD_DECL;
288 return TS_LABEL_DECL;
290 return TS_RESULT_DECL;
291 case DEBUG_EXPR_DECL:
294 return TS_CONST_DECL;
298 return TS_FUNCTION_DECL;
300 return TS_DECL_NON_COMMON;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST: return TS_INT_CST;
320 case REAL_CST: return TS_REAL_CST;
321 case FIXED_CST: return TS_FIXED_CST;
322 case COMPLEX_CST: return TS_COMPLEX;
323 case VECTOR_CST: return TS_VECTOR;
324 case STRING_CST: return TS_STRING;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK: return TS_COMMON;
327 case IDENTIFIER_NODE: return TS_IDENTIFIER;
328 case TREE_LIST: return TS_LIST;
329 case TREE_VEC: return TS_VEC;
330 case SSA_NAME: return TS_SSA_NAME;
331 case PLACEHOLDER_EXPR: return TS_COMMON;
332 case STATEMENT_LIST: return TS_STATEMENT_LIST;
333 case BLOCK: return TS_BLOCK;
334 case CONSTRUCTOR: return TS_CONSTRUCTOR;
335 case TREE_BINFO: return TS_BINFO;
336 case OMP_CLAUSE: return TS_OMP_CLAUSE;
337 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
338 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
398 enum tree_node_structure_enum ts_code;
400 code = (enum tree_code) i;
401 ts_code = tree_node_structure_for_code (code);
403 /* Mark the TS structure itself. */
404 tree_contains_struct[code][ts_code] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL:
428 case TS_STATEMENT_LIST:
431 case TS_OPTIMIZATION:
432 case TS_TARGET_OPTION:
433 MARK_TS_COMMON (code);
437 MARK_TS_DECL_MINIMAL (code);
441 MARK_TS_DECL_COMMON (code);
444 case TS_DECL_NON_COMMON:
445 MARK_TS_DECL_WITH_VIS (code);
448 case TS_DECL_WITH_VIS:
453 MARK_TS_DECL_WRTL (code);
457 MARK_TS_DECL_COMMON (code);
461 MARK_TS_DECL_WITH_VIS (code);
465 case TS_FUNCTION_DECL:
466 MARK_TS_DECL_NON_COMMON (code);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
476 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
478 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
503 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
504 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
505 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
507 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
508 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
509 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
510 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
511 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
512 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
513 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
514 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
515 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
536 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
539 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
541 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
542 tree_priority_map_eq, 0);
544 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
545 int_cst_hash_eq, NULL);
547 int_cst_node = make_node (INTEGER_CST);
549 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
550 cl_option_hash_eq, NULL);
552 cl_optimization_node = make_node (OPTIMIZATION_NODE);
553 cl_target_option_node = make_node (TARGET_OPTION_NODE);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
568 lang_hooks.set_decl_assembler_name (decl);
569 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl, const_tree asmname)
577 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
578 const char *decl_str;
579 const char *asmname_str;
582 if (decl_asmname == asmname)
585 decl_str = IDENTIFIER_POINTER (decl_asmname);
586 asmname_str = IDENTIFIER_POINTER (asmname);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str[0] == '*')
597 size_t ulp_len = strlen (user_label_prefix);
603 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
604 decl_str += ulp_len, test=true;
608 if (asmname_str[0] == '*')
610 size_t ulp_len = strlen (user_label_prefix);
616 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
617 asmname_str += ulp_len, test=true;
624 return strcmp (decl_str, asmname_str) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname)
632 if (IDENTIFIER_POINTER (asmname)[0] == '*')
634 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
635 size_t ulp_len = strlen (user_label_prefix);
639 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
642 return htab_hash_string (decl_str);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code)
654 switch (TREE_CODE_CLASS (code))
656 case tcc_declaration: /* A decl node */
661 return sizeof (struct tree_field_decl);
663 return sizeof (struct tree_parm_decl);
665 return sizeof (struct tree_var_decl);
667 return sizeof (struct tree_label_decl);
669 return sizeof (struct tree_result_decl);
671 return sizeof (struct tree_const_decl);
673 return sizeof (struct tree_type_decl);
675 return sizeof (struct tree_function_decl);
676 case DEBUG_EXPR_DECL:
677 return sizeof (struct tree_decl_with_rtl);
679 return sizeof (struct tree_decl_non_common);
683 case tcc_type: /* a type node */
684 return sizeof (struct tree_type);
686 case tcc_reference: /* a reference */
687 case tcc_expression: /* an expression */
688 case tcc_statement: /* an expression with side effects */
689 case tcc_comparison: /* a comparison expression */
690 case tcc_unary: /* a unary arithmetic expression */
691 case tcc_binary: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp)
693 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
695 case tcc_constant: /* a constant */
698 case INTEGER_CST: return sizeof (struct tree_int_cst);
699 case REAL_CST: return sizeof (struct tree_real_cst);
700 case FIXED_CST: return sizeof (struct tree_fixed_cst);
701 case COMPLEX_CST: return sizeof (struct tree_complex);
702 case VECTOR_CST: return sizeof (struct tree_vector);
703 case STRING_CST: gcc_unreachable ();
705 return lang_hooks.tree_size (code);
708 case tcc_exceptional: /* something random, like an identifier. */
711 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
712 case TREE_LIST: return sizeof (struct tree_list);
715 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
718 case OMP_CLAUSE: gcc_unreachable ();
720 case SSA_NAME: return sizeof (struct tree_ssa_name);
722 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
723 case BLOCK: return sizeof (struct tree_block);
724 case CONSTRUCTOR: return sizeof (struct tree_constructor);
725 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
726 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
729 return lang_hooks.tree_size (code);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node)
742 const enum tree_code code = TREE_CODE (node);
746 return (offsetof (struct tree_binfo, base_binfos)
747 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
750 return (sizeof (struct tree_vec)
751 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
754 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
757 return (sizeof (struct tree_omp_clause)
758 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
762 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
763 return (sizeof (struct tree_exp)
764 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
766 return tree_code_size (code);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL)
781 enum tree_code_class type = TREE_CODE_CLASS (code);
782 size_t length = tree_code_size (code);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration: /* A decl node */
792 case tcc_type: /* a type node */
796 case tcc_statement: /* an expression with side effects */
800 case tcc_reference: /* a reference */
804 case tcc_expression: /* an expression */
805 case tcc_comparison: /* a comparison expression */
806 case tcc_unary: /* a unary arithmetic expression */
807 case tcc_binary: /* a binary arithmetic expression */
811 case tcc_constant: /* a constant */
815 case tcc_exceptional: /* something random, like an identifier. */
818 case IDENTIFIER_NODE:
831 kind = ssa_name_kind;
852 tree_node_counts[(int) kind]++;
853 tree_node_sizes[(int) kind] += length;
856 if (code == IDENTIFIER_NODE)
857 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
859 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
861 memset (t, 0, length);
863 TREE_SET_CODE (t, code);
868 TREE_SIDE_EFFECTS (t) = 1;
871 case tcc_declaration:
872 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
874 if (code == FUNCTION_DECL)
876 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
877 DECL_MODE (t) = FUNCTION_MODE;
882 DECL_SOURCE_LOCATION (t) = input_location;
883 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
884 DECL_UID (t) = --next_debug_decl_uid;
887 DECL_UID (t) = next_decl_uid++;
888 SET_DECL_PT_UID (t, -1);
890 if (TREE_CODE (t) == LABEL_DECL)
891 LABEL_DECL_UID (t) = -1;
896 TYPE_UID (t) = next_type_uid++;
897 TYPE_ALIGN (t) = BITS_PER_UNIT;
898 TYPE_USER_ALIGN (t) = 0;
899 TYPE_MAIN_VARIANT (t) = t;
900 TYPE_CANONICAL (t) = t;
902 /* Default to no attributes for type, but let target change that. */
903 TYPE_ATTRIBUTES (t) = NULL_TREE;
904 targetm.set_default_type_attributes (t);
906 /* We have not yet computed the alias set for this type. */
907 TYPE_ALIAS_SET (t) = -1;
911 TREE_CONSTANT (t) = 1;
920 case PREDECREMENT_EXPR:
921 case PREINCREMENT_EXPR:
922 case POSTDECREMENT_EXPR:
923 case POSTINCREMENT_EXPR:
924 /* All of these have side-effects, no matter what their
926 TREE_SIDE_EFFECTS (t) = 1;
935 /* Other classes need no special treatment. */
942 /* Return a new node with the same contents as NODE except that its
943 TREE_CHAIN is zero and it has a fresh uid. */
946 copy_node_stat (tree node MEM_STAT_DECL)
949 enum tree_code code = TREE_CODE (node);
952 gcc_assert (code != STATEMENT_LIST);
954 length = tree_size (node);
955 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
956 memcpy (t, node, length);
959 TREE_ASM_WRITTEN (t) = 0;
960 TREE_VISITED (t) = 0;
961 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
962 *DECL_VAR_ANN_PTR (t) = 0;
964 if (TREE_CODE_CLASS (code) == tcc_declaration)
966 if (code == DEBUG_EXPR_DECL)
967 DECL_UID (t) = --next_debug_decl_uid;
970 DECL_UID (t) = next_decl_uid++;
971 if (DECL_PT_UID_SET_P (node))
972 SET_DECL_PT_UID (t, DECL_PT_UID (node));
974 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
975 && DECL_HAS_VALUE_EXPR_P (node))
977 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
978 DECL_HAS_VALUE_EXPR_P (t) = 1;
980 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
982 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
983 DECL_HAS_INIT_PRIORITY_P (t) = 1;
986 else if (TREE_CODE_CLASS (code) == tcc_type)
988 TYPE_UID (t) = next_type_uid++;
989 /* The following is so that the debug code for
990 the copy is different from the original type.
991 The two statements usually duplicate each other
992 (because they clear fields of the same union),
993 but the optimizer should catch that. */
994 TYPE_SYMTAB_POINTER (t) = 0;
995 TYPE_SYMTAB_ADDRESS (t) = 0;
997 /* Do not copy the values cache. */
998 if (TYPE_CACHED_VALUES_P(t))
1000 TYPE_CACHED_VALUES_P (t) = 0;
1001 TYPE_CACHED_VALUES (t) = NULL_TREE;
1008 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1009 For example, this can copy a list made of TREE_LIST nodes. */
1012 copy_list (tree list)
1020 head = prev = copy_node (list);
1021 next = TREE_CHAIN (list);
1024 TREE_CHAIN (prev) = copy_node (next);
1025 prev = TREE_CHAIN (prev);
1026 next = TREE_CHAIN (next);
1032 /* Create an INT_CST node with a LOW value sign extended. */
1035 build_int_cst (tree type, HOST_WIDE_INT low)
1037 /* Support legacy code. */
1039 type = integer_type_node;
1041 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1044 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1045 if it is negative. This function is similar to build_int_cst, but
1046 the extra bits outside of the type precision are cleared. Constants
1047 with these extra bits may confuse the fold so that it detects overflows
1048 even in cases when they do not occur, and in general should be avoided.
1049 We cannot however make this a default behavior of build_int_cst without
1050 more intrusive changes, since there are parts of gcc that rely on the extra
1051 precision of the integer constants. */
1054 build_int_cst_type (tree type, HOST_WIDE_INT low)
1056 unsigned HOST_WIDE_INT low1;
1061 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1063 return build_int_cst_wide (type, low1, hi);
1066 /* Constructs tree in type TYPE from with value given by CST. Signedness
1067 of CST is assumed to be the same as the signedness of TYPE. */
1070 double_int_to_tree (tree type, double_int cst)
1072 /* Size types *are* sign extended. */
1073 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1074 || (TREE_CODE (type) == INTEGER_TYPE
1075 && TYPE_IS_SIZETYPE (type)));
1077 cst = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1079 return build_int_cst_wide (type, cst.low, cst.high);
1082 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1083 to be the same as the signedness of TYPE. */
1086 double_int_fits_to_tree_p (const_tree type, double_int cst)
1088 /* Size types *are* sign extended. */
1089 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1090 || (TREE_CODE (type) == INTEGER_TYPE
1091 && TYPE_IS_SIZETYPE (type)));
1094 = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1096 return double_int_equal_p (cst, ext);
1099 /* These are the hash table functions for the hash table of INTEGER_CST
1100 nodes of a sizetype. */
1102 /* Return the hash code code X, an INTEGER_CST. */
1105 int_cst_hash_hash (const void *x)
1107 const_tree const t = (const_tree) x;
1109 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1110 ^ htab_hash_pointer (TREE_TYPE (t)));
1113 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1114 is the same as that given by *Y, which is the same. */
1117 int_cst_hash_eq (const void *x, const void *y)
1119 const_tree const xt = (const_tree) x;
1120 const_tree const yt = (const_tree) y;
1122 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1123 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1124 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1127 /* Create an INT_CST node of TYPE and value HI:LOW.
1128 The returned node is always shared. For small integers we use a
1129 per-type vector cache, for larger ones we use a single hash table. */
1132 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1140 switch (TREE_CODE (type))
1143 case REFERENCE_TYPE:
1144 /* Cache NULL pointer. */
1153 /* Cache false or true. */
1161 if (TYPE_UNSIGNED (type))
1164 limit = INTEGER_SHARE_LIMIT;
1165 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1171 limit = INTEGER_SHARE_LIMIT + 1;
1172 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1174 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1188 /* Look for it in the type's vector of small shared ints. */
1189 if (!TYPE_CACHED_VALUES_P (type))
1191 TYPE_CACHED_VALUES_P (type) = 1;
1192 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1195 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1198 /* Make sure no one is clobbering the shared constant. */
1199 gcc_assert (TREE_TYPE (t) == type);
1200 gcc_assert (TREE_INT_CST_LOW (t) == low);
1201 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1205 /* Create a new shared int. */
1206 t = make_node (INTEGER_CST);
1208 TREE_INT_CST_LOW (t) = low;
1209 TREE_INT_CST_HIGH (t) = hi;
1210 TREE_TYPE (t) = type;
1212 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1217 /* Use the cache of larger shared ints. */
1220 TREE_INT_CST_LOW (int_cst_node) = low;
1221 TREE_INT_CST_HIGH (int_cst_node) = hi;
1222 TREE_TYPE (int_cst_node) = type;
1224 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1228 /* Insert this one into the hash table. */
1231 /* Make a new node for next time round. */
1232 int_cst_node = make_node (INTEGER_CST);
1239 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1240 and the rest are zeros. */
1243 build_low_bits_mask (tree type, unsigned bits)
1247 gcc_assert (bits <= TYPE_PRECISION (type));
1249 if (bits == TYPE_PRECISION (type)
1250 && !TYPE_UNSIGNED (type))
1251 /* Sign extended all-ones mask. */
1252 mask = double_int_minus_one;
1254 mask = double_int_mask (bits);
1256 return build_int_cst_wide (type, mask.low, mask.high);
1259 /* Checks that X is integer constant that can be expressed in (unsigned)
1260 HOST_WIDE_INT without loss of precision. */
1263 cst_and_fits_in_hwi (const_tree x)
1265 if (TREE_CODE (x) != INTEGER_CST)
1268 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1271 return (TREE_INT_CST_HIGH (x) == 0
1272 || TREE_INT_CST_HIGH (x) == -1);
1275 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1276 are in a list pointed to by VALS. */
1279 build_vector (tree type, tree vals)
1281 tree v = make_node (VECTOR_CST);
1285 TREE_VECTOR_CST_ELTS (v) = vals;
1286 TREE_TYPE (v) = type;
1288 /* Iterate through elements and check for overflow. */
1289 for (link = vals; link; link = TREE_CHAIN (link))
1291 tree value = TREE_VALUE (link);
1293 /* Don't crash if we get an address constant. */
1294 if (!CONSTANT_CLASS_P (value))
1297 over |= TREE_OVERFLOW (value);
1300 TREE_OVERFLOW (v) = over;
1304 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1305 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1308 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1310 tree list = NULL_TREE;
1311 unsigned HOST_WIDE_INT idx;
1314 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1315 list = tree_cons (NULL_TREE, value, list);
1316 return build_vector (type, nreverse (list));
1319 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1320 are in the VEC pointed to by VALS. */
1322 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1324 tree c = make_node (CONSTRUCTOR);
1326 constructor_elt *elt;
1327 bool constant_p = true;
1329 TREE_TYPE (c) = type;
1330 CONSTRUCTOR_ELTS (c) = vals;
1332 for (i = 0; VEC_iterate (constructor_elt, vals, i, elt); i++)
1333 if (!TREE_CONSTANT (elt->value))
1339 TREE_CONSTANT (c) = constant_p;
1344 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1347 build_constructor_single (tree type, tree index, tree value)
1349 VEC(constructor_elt,gc) *v;
1350 constructor_elt *elt;
1352 v = VEC_alloc (constructor_elt, gc, 1);
1353 elt = VEC_quick_push (constructor_elt, v, NULL);
1357 return build_constructor (type, v);
1361 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1362 are in a list pointed to by VALS. */
1364 build_constructor_from_list (tree type, tree vals)
1367 VEC(constructor_elt,gc) *v = NULL;
1371 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1372 for (t = vals; t; t = TREE_CHAIN (t))
1373 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1376 return build_constructor (type, v);
1379 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1382 build_fixed (tree type, FIXED_VALUE_TYPE f)
1385 FIXED_VALUE_TYPE *fp;
1387 v = make_node (FIXED_CST);
1388 fp = GGC_NEW (FIXED_VALUE_TYPE);
1389 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1391 TREE_TYPE (v) = type;
1392 TREE_FIXED_CST_PTR (v) = fp;
1396 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1399 build_real (tree type, REAL_VALUE_TYPE d)
1402 REAL_VALUE_TYPE *dp;
1405 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1406 Consider doing it via real_convert now. */
1408 v = make_node (REAL_CST);
1409 dp = GGC_NEW (REAL_VALUE_TYPE);
1410 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1412 TREE_TYPE (v) = type;
1413 TREE_REAL_CST_PTR (v) = dp;
1414 TREE_OVERFLOW (v) = overflow;
1418 /* Return a new REAL_CST node whose type is TYPE
1419 and whose value is the integer value of the INTEGER_CST node I. */
1422 real_value_from_int_cst (const_tree type, const_tree i)
1426 /* Clear all bits of the real value type so that we can later do
1427 bitwise comparisons to see if two values are the same. */
1428 memset (&d, 0, sizeof d);
1430 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1431 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1432 TYPE_UNSIGNED (TREE_TYPE (i)));
1436 /* Given a tree representing an integer constant I, return a tree
1437 representing the same value as a floating-point constant of type TYPE. */
1440 build_real_from_int_cst (tree type, const_tree i)
1443 int overflow = TREE_OVERFLOW (i);
1445 v = build_real (type, real_value_from_int_cst (type, i));
1447 TREE_OVERFLOW (v) |= overflow;
1451 /* Return a newly constructed STRING_CST node whose value is
1452 the LEN characters at STR.
1453 The TREE_TYPE is not initialized. */
1456 build_string (int len, const char *str)
1461 /* Do not waste bytes provided by padding of struct tree_string. */
1462 length = len + offsetof (struct tree_string, str) + 1;
1464 #ifdef GATHER_STATISTICS
1465 tree_node_counts[(int) c_kind]++;
1466 tree_node_sizes[(int) c_kind] += length;
1469 s = ggc_alloc_tree (length);
1471 memset (s, 0, sizeof (struct tree_common));
1472 TREE_SET_CODE (s, STRING_CST);
1473 TREE_CONSTANT (s) = 1;
1474 TREE_STRING_LENGTH (s) = len;
1475 memcpy (s->string.str, str, len);
1476 s->string.str[len] = '\0';
1481 /* Return a newly constructed COMPLEX_CST node whose value is
1482 specified by the real and imaginary parts REAL and IMAG.
1483 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1484 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1487 build_complex (tree type, tree real, tree imag)
1489 tree t = make_node (COMPLEX_CST);
1491 TREE_REALPART (t) = real;
1492 TREE_IMAGPART (t) = imag;
1493 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1494 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1498 /* Return a constant of arithmetic type TYPE which is the
1499 multiplicative identity of the set TYPE. */
1502 build_one_cst (tree type)
1504 switch (TREE_CODE (type))
1506 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1507 case POINTER_TYPE: case REFERENCE_TYPE:
1509 return build_int_cst (type, 1);
1512 return build_real (type, dconst1);
1514 case FIXED_POINT_TYPE:
1515 /* We can only generate 1 for accum types. */
1516 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1517 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1524 scalar = build_one_cst (TREE_TYPE (type));
1526 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1528 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1529 cst = tree_cons (NULL_TREE, scalar, cst);
1531 return build_vector (type, cst);
1535 return build_complex (type,
1536 build_one_cst (TREE_TYPE (type)),
1537 fold_convert (TREE_TYPE (type), integer_zero_node));
1544 /* Build a BINFO with LEN language slots. */
1547 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1550 size_t length = (offsetof (struct tree_binfo, base_binfos)
1551 + VEC_embedded_size (tree, base_binfos));
1553 #ifdef GATHER_STATISTICS
1554 tree_node_counts[(int) binfo_kind]++;
1555 tree_node_sizes[(int) binfo_kind] += length;
1558 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1560 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1562 TREE_SET_CODE (t, TREE_BINFO);
1564 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1570 /* Build a newly constructed TREE_VEC node of length LEN. */
1573 make_tree_vec_stat (int len MEM_STAT_DECL)
1576 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1578 #ifdef GATHER_STATISTICS
1579 tree_node_counts[(int) vec_kind]++;
1580 tree_node_sizes[(int) vec_kind] += length;
1583 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1585 memset (t, 0, length);
1587 TREE_SET_CODE (t, TREE_VEC);
1588 TREE_VEC_LENGTH (t) = len;
1593 /* Return 1 if EXPR is the integer constant zero or a complex constant
1597 integer_zerop (const_tree expr)
1601 return ((TREE_CODE (expr) == INTEGER_CST
1602 && TREE_INT_CST_LOW (expr) == 0
1603 && TREE_INT_CST_HIGH (expr) == 0)
1604 || (TREE_CODE (expr) == COMPLEX_CST
1605 && integer_zerop (TREE_REALPART (expr))
1606 && integer_zerop (TREE_IMAGPART (expr))));
1609 /* Return 1 if EXPR is the integer constant one or the corresponding
1610 complex constant. */
1613 integer_onep (const_tree expr)
1617 return ((TREE_CODE (expr) == INTEGER_CST
1618 && TREE_INT_CST_LOW (expr) == 1
1619 && TREE_INT_CST_HIGH (expr) == 0)
1620 || (TREE_CODE (expr) == COMPLEX_CST
1621 && integer_onep (TREE_REALPART (expr))
1622 && integer_zerop (TREE_IMAGPART (expr))));
1625 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1626 it contains. Likewise for the corresponding complex constant. */
1629 integer_all_onesp (const_tree expr)
1636 if (TREE_CODE (expr) == COMPLEX_CST
1637 && integer_all_onesp (TREE_REALPART (expr))
1638 && integer_zerop (TREE_IMAGPART (expr)))
1641 else if (TREE_CODE (expr) != INTEGER_CST)
1644 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1645 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1646 && TREE_INT_CST_HIGH (expr) == -1)
1651 /* Note that using TYPE_PRECISION here is wrong. We care about the
1652 actual bits, not the (arbitrary) range of the type. */
1653 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1654 if (prec >= HOST_BITS_PER_WIDE_INT)
1656 HOST_WIDE_INT high_value;
1659 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1661 /* Can not handle precisions greater than twice the host int size. */
1662 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1663 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1664 /* Shifting by the host word size is undefined according to the ANSI
1665 standard, so we must handle this as a special case. */
1668 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1670 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1671 && TREE_INT_CST_HIGH (expr) == high_value);
1674 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1677 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1681 integer_pow2p (const_tree expr)
1684 HOST_WIDE_INT high, low;
1688 if (TREE_CODE (expr) == COMPLEX_CST
1689 && integer_pow2p (TREE_REALPART (expr))
1690 && integer_zerop (TREE_IMAGPART (expr)))
1693 if (TREE_CODE (expr) != INTEGER_CST)
1696 prec = TYPE_PRECISION (TREE_TYPE (expr));
1697 high = TREE_INT_CST_HIGH (expr);
1698 low = TREE_INT_CST_LOW (expr);
1700 /* First clear all bits that are beyond the type's precision in case
1701 we've been sign extended. */
1703 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1705 else if (prec > HOST_BITS_PER_WIDE_INT)
1706 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1710 if (prec < HOST_BITS_PER_WIDE_INT)
1711 low &= ~((HOST_WIDE_INT) (-1) << prec);
1714 if (high == 0 && low == 0)
1717 return ((high == 0 && (low & (low - 1)) == 0)
1718 || (low == 0 && (high & (high - 1)) == 0));
1721 /* Return 1 if EXPR is an integer constant other than zero or a
1722 complex constant other than zero. */
1725 integer_nonzerop (const_tree expr)
1729 return ((TREE_CODE (expr) == INTEGER_CST
1730 && (TREE_INT_CST_LOW (expr) != 0
1731 || TREE_INT_CST_HIGH (expr) != 0))
1732 || (TREE_CODE (expr) == COMPLEX_CST
1733 && (integer_nonzerop (TREE_REALPART (expr))
1734 || integer_nonzerop (TREE_IMAGPART (expr)))));
1737 /* Return 1 if EXPR is the fixed-point constant zero. */
1740 fixed_zerop (const_tree expr)
1742 return (TREE_CODE (expr) == FIXED_CST
1743 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1746 /* Return the power of two represented by a tree node known to be a
1750 tree_log2 (const_tree expr)
1753 HOST_WIDE_INT high, low;
1757 if (TREE_CODE (expr) == COMPLEX_CST)
1758 return tree_log2 (TREE_REALPART (expr));
1760 prec = TYPE_PRECISION (TREE_TYPE (expr));
1761 high = TREE_INT_CST_HIGH (expr);
1762 low = TREE_INT_CST_LOW (expr);
1764 /* First clear all bits that are beyond the type's precision in case
1765 we've been sign extended. */
1767 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1769 else if (prec > HOST_BITS_PER_WIDE_INT)
1770 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1774 if (prec < HOST_BITS_PER_WIDE_INT)
1775 low &= ~((HOST_WIDE_INT) (-1) << prec);
1778 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1779 : exact_log2 (low));
1782 /* Similar, but return the largest integer Y such that 2 ** Y is less
1783 than or equal to EXPR. */
1786 tree_floor_log2 (const_tree expr)
1789 HOST_WIDE_INT high, low;
1793 if (TREE_CODE (expr) == COMPLEX_CST)
1794 return tree_log2 (TREE_REALPART (expr));
1796 prec = TYPE_PRECISION (TREE_TYPE (expr));
1797 high = TREE_INT_CST_HIGH (expr);
1798 low = TREE_INT_CST_LOW (expr);
1800 /* First clear all bits that are beyond the type's precision in case
1801 we've been sign extended. Ignore if type's precision hasn't been set
1802 since what we are doing is setting it. */
1804 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1806 else if (prec > HOST_BITS_PER_WIDE_INT)
1807 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1811 if (prec < HOST_BITS_PER_WIDE_INT)
1812 low &= ~((HOST_WIDE_INT) (-1) << prec);
1815 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1816 : floor_log2 (low));
1819 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1820 decimal float constants, so don't return 1 for them. */
1823 real_zerop (const_tree expr)
1827 return ((TREE_CODE (expr) == REAL_CST
1828 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1829 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1830 || (TREE_CODE (expr) == COMPLEX_CST
1831 && real_zerop (TREE_REALPART (expr))
1832 && real_zerop (TREE_IMAGPART (expr))));
1835 /* Return 1 if EXPR is the real constant one in real or complex form.
1836 Trailing zeroes matter for decimal float constants, so don't return
1840 real_onep (const_tree expr)
1844 return ((TREE_CODE (expr) == REAL_CST
1845 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1846 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1847 || (TREE_CODE (expr) == COMPLEX_CST
1848 && real_onep (TREE_REALPART (expr))
1849 && real_zerop (TREE_IMAGPART (expr))));
1852 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1853 for decimal float constants, so don't return 1 for them. */
1856 real_twop (const_tree expr)
1860 return ((TREE_CODE (expr) == REAL_CST
1861 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1862 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1863 || (TREE_CODE (expr) == COMPLEX_CST
1864 && real_twop (TREE_REALPART (expr))
1865 && real_zerop (TREE_IMAGPART (expr))));
1868 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1869 matter for decimal float constants, so don't return 1 for them. */
1872 real_minus_onep (const_tree expr)
1876 return ((TREE_CODE (expr) == REAL_CST
1877 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1878 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1879 || (TREE_CODE (expr) == COMPLEX_CST
1880 && real_minus_onep (TREE_REALPART (expr))
1881 && real_zerop (TREE_IMAGPART (expr))));
1884 /* Nonzero if EXP is a constant or a cast of a constant. */
1887 really_constant_p (const_tree exp)
1889 /* This is not quite the same as STRIP_NOPS. It does more. */
1890 while (CONVERT_EXPR_P (exp)
1891 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1892 exp = TREE_OPERAND (exp, 0);
1893 return TREE_CONSTANT (exp);
1896 /* Return first list element whose TREE_VALUE is ELEM.
1897 Return 0 if ELEM is not in LIST. */
1900 value_member (tree elem, tree list)
1904 if (elem == TREE_VALUE (list))
1906 list = TREE_CHAIN (list);
1911 /* Return first list element whose TREE_PURPOSE is ELEM.
1912 Return 0 if ELEM is not in LIST. */
1915 purpose_member (const_tree elem, tree list)
1919 if (elem == TREE_PURPOSE (list))
1921 list = TREE_CHAIN (list);
1926 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1930 chain_index (int idx, tree chain)
1932 for (; chain && idx > 0; --idx)
1933 chain = TREE_CHAIN (chain);
1937 /* Return nonzero if ELEM is part of the chain CHAIN. */
1940 chain_member (const_tree elem, const_tree chain)
1946 chain = TREE_CHAIN (chain);
1952 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1953 We expect a null pointer to mark the end of the chain.
1954 This is the Lisp primitive `length'. */
1957 list_length (const_tree t)
1960 #ifdef ENABLE_TREE_CHECKING
1968 #ifdef ENABLE_TREE_CHECKING
1971 gcc_assert (p != q);
1979 /* Returns the number of FIELD_DECLs in TYPE. */
1982 fields_length (const_tree type)
1984 tree t = TYPE_FIELDS (type);
1987 for (; t; t = TREE_CHAIN (t))
1988 if (TREE_CODE (t) == FIELD_DECL)
1994 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
1995 UNION_TYPE TYPE, or NULL_TREE if none. */
1998 first_field (const_tree type)
2000 tree t = TYPE_FIELDS (type);
2001 while (t && TREE_CODE (t) != FIELD_DECL)
2006 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2007 by modifying the last node in chain 1 to point to chain 2.
2008 This is the Lisp primitive `nconc'. */
2011 chainon (tree op1, tree op2)
2020 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2022 TREE_CHAIN (t1) = op2;
2024 #ifdef ENABLE_TREE_CHECKING
2027 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2028 gcc_assert (t2 != t1);
2035 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2038 tree_last (tree chain)
2042 while ((next = TREE_CHAIN (chain)))
2047 /* Reverse the order of elements in the chain T,
2048 and return the new head of the chain (old last element). */
2053 tree prev = 0, decl, next;
2054 for (decl = t; decl; decl = next)
2056 next = TREE_CHAIN (decl);
2057 TREE_CHAIN (decl) = prev;
2063 /* Return a newly created TREE_LIST node whose
2064 purpose and value fields are PARM and VALUE. */
2067 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2069 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2070 TREE_PURPOSE (t) = parm;
2071 TREE_VALUE (t) = value;
2075 /* Build a chain of TREE_LIST nodes from a vector. */
2078 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2080 tree ret = NULL_TREE;
2084 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2086 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2087 pp = &TREE_CHAIN (*pp);
2092 /* Return a newly created TREE_LIST node whose
2093 purpose and value fields are PURPOSE and VALUE
2094 and whose TREE_CHAIN is CHAIN. */
2097 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2101 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2103 memset (node, 0, sizeof (struct tree_common));
2105 #ifdef GATHER_STATISTICS
2106 tree_node_counts[(int) x_kind]++;
2107 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2110 TREE_SET_CODE (node, TREE_LIST);
2111 TREE_CHAIN (node) = chain;
2112 TREE_PURPOSE (node) = purpose;
2113 TREE_VALUE (node) = value;
2117 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2121 ctor_to_vec (tree ctor)
2123 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2127 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2128 VEC_quick_push (tree, vec, val);
2133 /* Return the size nominally occupied by an object of type TYPE
2134 when it resides in memory. The value is measured in units of bytes,
2135 and its data type is that normally used for type sizes
2136 (which is the first type created by make_signed_type or
2137 make_unsigned_type). */
2140 size_in_bytes (const_tree type)
2144 if (type == error_mark_node)
2145 return integer_zero_node;
2147 type = TYPE_MAIN_VARIANT (type);
2148 t = TYPE_SIZE_UNIT (type);
2152 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2153 return size_zero_node;
2159 /* Return the size of TYPE (in bytes) as a wide integer
2160 or return -1 if the size can vary or is larger than an integer. */
2163 int_size_in_bytes (const_tree type)
2167 if (type == error_mark_node)
2170 type = TYPE_MAIN_VARIANT (type);
2171 t = TYPE_SIZE_UNIT (type);
2173 || TREE_CODE (t) != INTEGER_CST
2174 || TREE_INT_CST_HIGH (t) != 0
2175 /* If the result would appear negative, it's too big to represent. */
2176 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2179 return TREE_INT_CST_LOW (t);
2182 /* Return the maximum size of TYPE (in bytes) as a wide integer
2183 or return -1 if the size can vary or is larger than an integer. */
2186 max_int_size_in_bytes (const_tree type)
2188 HOST_WIDE_INT size = -1;
2191 /* If this is an array type, check for a possible MAX_SIZE attached. */
2193 if (TREE_CODE (type) == ARRAY_TYPE)
2195 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2197 if (size_tree && host_integerp (size_tree, 1))
2198 size = tree_low_cst (size_tree, 1);
2201 /* If we still haven't been able to get a size, see if the language
2202 can compute a maximum size. */
2206 size_tree = lang_hooks.types.max_size (type);
2208 if (size_tree && host_integerp (size_tree, 1))
2209 size = tree_low_cst (size_tree, 1);
2215 /* Returns a tree for the size of EXP in bytes. */
2218 tree_expr_size (const_tree exp)
2221 && DECL_SIZE_UNIT (exp) != 0)
2222 return DECL_SIZE_UNIT (exp);
2224 return size_in_bytes (TREE_TYPE (exp));
2227 /* Return the bit position of FIELD, in bits from the start of the record.
2228 This is a tree of type bitsizetype. */
2231 bit_position (const_tree field)
2233 return bit_from_pos (DECL_FIELD_OFFSET (field),
2234 DECL_FIELD_BIT_OFFSET (field));
2237 /* Likewise, but return as an integer. It must be representable in
2238 that way (since it could be a signed value, we don't have the
2239 option of returning -1 like int_size_in_byte can. */
2242 int_bit_position (const_tree field)
2244 return tree_low_cst (bit_position (field), 0);
2247 /* Return the byte position of FIELD, in bytes from the start of the record.
2248 This is a tree of type sizetype. */
2251 byte_position (const_tree field)
2253 return byte_from_pos (DECL_FIELD_OFFSET (field),
2254 DECL_FIELD_BIT_OFFSET (field));
2257 /* Likewise, but return as an integer. It must be representable in
2258 that way (since it could be a signed value, we don't have the
2259 option of returning -1 like int_size_in_byte can. */
2262 int_byte_position (const_tree field)
2264 return tree_low_cst (byte_position (field), 0);
2267 /* Return the strictest alignment, in bits, that T is known to have. */
2270 expr_align (const_tree t)
2272 unsigned int align0, align1;
2274 switch (TREE_CODE (t))
2276 CASE_CONVERT: case NON_LVALUE_EXPR:
2277 /* If we have conversions, we know that the alignment of the
2278 object must meet each of the alignments of the types. */
2279 align0 = expr_align (TREE_OPERAND (t, 0));
2280 align1 = TYPE_ALIGN (TREE_TYPE (t));
2281 return MAX (align0, align1);
2283 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2284 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2285 case CLEANUP_POINT_EXPR:
2286 /* These don't change the alignment of an object. */
2287 return expr_align (TREE_OPERAND (t, 0));
2290 /* The best we can do is say that the alignment is the least aligned
2292 align0 = expr_align (TREE_OPERAND (t, 1));
2293 align1 = expr_align (TREE_OPERAND (t, 2));
2294 return MIN (align0, align1);
2296 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2297 meaningfully, it's always 1. */
2298 case LABEL_DECL: case CONST_DECL:
2299 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2301 gcc_assert (DECL_ALIGN (t) != 0);
2302 return DECL_ALIGN (t);
2308 /* Otherwise take the alignment from that of the type. */
2309 return TYPE_ALIGN (TREE_TYPE (t));
2312 /* Return, as a tree node, the number of elements for TYPE (which is an
2313 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2316 array_type_nelts (const_tree type)
2318 tree index_type, min, max;
2320 /* If they did it with unspecified bounds, then we should have already
2321 given an error about it before we got here. */
2322 if (! TYPE_DOMAIN (type))
2323 return error_mark_node;
2325 index_type = TYPE_DOMAIN (type);
2326 min = TYPE_MIN_VALUE (index_type);
2327 max = TYPE_MAX_VALUE (index_type);
2329 return (integer_zerop (min)
2331 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2334 /* If arg is static -- a reference to an object in static storage -- then
2335 return the object. This is not the same as the C meaning of `static'.
2336 If arg isn't static, return NULL. */
2341 switch (TREE_CODE (arg))
2344 /* Nested functions are static, even though taking their address will
2345 involve a trampoline as we unnest the nested function and create
2346 the trampoline on the tree level. */
2350 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2351 && ! DECL_THREAD_LOCAL_P (arg)
2352 && ! DECL_DLLIMPORT_P (arg)
2356 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2360 return TREE_STATIC (arg) ? arg : NULL;
2367 /* If the thing being referenced is not a field, then it is
2368 something language specific. */
2369 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2371 /* If we are referencing a bitfield, we can't evaluate an
2372 ADDR_EXPR at compile time and so it isn't a constant. */
2373 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2376 return staticp (TREE_OPERAND (arg, 0));
2381 case MISALIGNED_INDIRECT_REF:
2382 case ALIGN_INDIRECT_REF:
2384 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2387 case ARRAY_RANGE_REF:
2388 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2389 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2390 return staticp (TREE_OPERAND (arg, 0));
2394 case COMPOUND_LITERAL_EXPR:
2395 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2405 /* Return whether OP is a DECL whose address is function-invariant. */
2408 decl_address_invariant_p (const_tree op)
2410 /* The conditions below are slightly less strict than the one in
2413 switch (TREE_CODE (op))
2422 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2423 && !DECL_DLLIMPORT_P (op))
2424 || DECL_THREAD_LOCAL_P (op)
2425 || DECL_CONTEXT (op) == current_function_decl
2426 || decl_function_context (op) == current_function_decl)
2431 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2432 || decl_function_context (op) == current_function_decl)
2443 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2446 decl_address_ip_invariant_p (const_tree op)
2448 /* The conditions below are slightly less strict than the one in
2451 switch (TREE_CODE (op))
2459 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2460 && !DECL_DLLIMPORT_P (op))
2461 || DECL_THREAD_LOCAL_P (op))
2466 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2478 /* Return true if T is function-invariant (internal function, does
2479 not handle arithmetic; that's handled in skip_simple_arithmetic and
2480 tree_invariant_p). */
2482 static bool tree_invariant_p (tree t);
2485 tree_invariant_p_1 (tree t)
2489 if (TREE_CONSTANT (t)
2490 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2493 switch (TREE_CODE (t))
2499 op = TREE_OPERAND (t, 0);
2500 while (handled_component_p (op))
2502 switch (TREE_CODE (op))
2505 case ARRAY_RANGE_REF:
2506 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2507 || TREE_OPERAND (op, 2) != NULL_TREE
2508 || TREE_OPERAND (op, 3) != NULL_TREE)
2513 if (TREE_OPERAND (op, 2) != NULL_TREE)
2519 op = TREE_OPERAND (op, 0);
2522 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2531 /* Return true if T is function-invariant. */
2534 tree_invariant_p (tree t)
2536 tree inner = skip_simple_arithmetic (t);
2537 return tree_invariant_p_1 (inner);
2540 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2541 Do this to any expression which may be used in more than one place,
2542 but must be evaluated only once.
2544 Normally, expand_expr would reevaluate the expression each time.
2545 Calling save_expr produces something that is evaluated and recorded
2546 the first time expand_expr is called on it. Subsequent calls to
2547 expand_expr just reuse the recorded value.
2549 The call to expand_expr that generates code that actually computes
2550 the value is the first call *at compile time*. Subsequent calls
2551 *at compile time* generate code to use the saved value.
2552 This produces correct result provided that *at run time* control
2553 always flows through the insns made by the first expand_expr
2554 before reaching the other places where the save_expr was evaluated.
2555 You, the caller of save_expr, must make sure this is so.
2557 Constants, and certain read-only nodes, are returned with no
2558 SAVE_EXPR because that is safe. Expressions containing placeholders
2559 are not touched; see tree.def for an explanation of what these
2563 save_expr (tree expr)
2565 tree t = fold (expr);
2568 /* If the tree evaluates to a constant, then we don't want to hide that
2569 fact (i.e. this allows further folding, and direct checks for constants).
2570 However, a read-only object that has side effects cannot be bypassed.
2571 Since it is no problem to reevaluate literals, we just return the
2573 inner = skip_simple_arithmetic (t);
2574 if (TREE_CODE (inner) == ERROR_MARK)
2577 if (tree_invariant_p_1 (inner))
2580 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2581 it means that the size or offset of some field of an object depends on
2582 the value within another field.
2584 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2585 and some variable since it would then need to be both evaluated once and
2586 evaluated more than once. Front-ends must assure this case cannot
2587 happen by surrounding any such subexpressions in their own SAVE_EXPR
2588 and forcing evaluation at the proper time. */
2589 if (contains_placeholder_p (inner))
2592 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2593 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2595 /* This expression might be placed ahead of a jump to ensure that the
2596 value was computed on both sides of the jump. So make sure it isn't
2597 eliminated as dead. */
2598 TREE_SIDE_EFFECTS (t) = 1;
2602 /* Look inside EXPR and into any simple arithmetic operations. Return
2603 the innermost non-arithmetic node. */
2606 skip_simple_arithmetic (tree expr)
2610 /* We don't care about whether this can be used as an lvalue in this
2612 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2613 expr = TREE_OPERAND (expr, 0);
2615 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2616 a constant, it will be more efficient to not make another SAVE_EXPR since
2617 it will allow better simplification and GCSE will be able to merge the
2618 computations if they actually occur. */
2622 if (UNARY_CLASS_P (inner))
2623 inner = TREE_OPERAND (inner, 0);
2624 else if (BINARY_CLASS_P (inner))
2626 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2627 inner = TREE_OPERAND (inner, 0);
2628 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2629 inner = TREE_OPERAND (inner, 1);
2641 /* Return which tree structure is used by T. */
2643 enum tree_node_structure_enum
2644 tree_node_structure (const_tree t)
2646 const enum tree_code code = TREE_CODE (t);
2647 return tree_node_structure_for_code (code);
2650 /* Set various status flags when building a CALL_EXPR object T. */
2653 process_call_operands (tree t)
2655 bool side_effects = TREE_SIDE_EFFECTS (t);
2656 bool read_only = false;
2657 int i = call_expr_flags (t);
2659 /* Calls have side-effects, except those to const or pure functions. */
2660 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2661 side_effects = true;
2662 /* Propagate TREE_READONLY of arguments for const functions. */
2666 if (!side_effects || read_only)
2667 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2669 tree op = TREE_OPERAND (t, i);
2670 if (op && TREE_SIDE_EFFECTS (op))
2671 side_effects = true;
2672 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2676 TREE_SIDE_EFFECTS (t) = side_effects;
2677 TREE_READONLY (t) = read_only;
2680 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2681 or offset that depends on a field within a record. */
2684 contains_placeholder_p (const_tree exp)
2686 enum tree_code code;
2691 code = TREE_CODE (exp);
2692 if (code == PLACEHOLDER_EXPR)
2695 switch (TREE_CODE_CLASS (code))
2698 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2699 position computations since they will be converted into a
2700 WITH_RECORD_EXPR involving the reference, which will assume
2701 here will be valid. */
2702 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2704 case tcc_exceptional:
2705 if (code == TREE_LIST)
2706 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2707 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2712 case tcc_comparison:
2713 case tcc_expression:
2717 /* Ignoring the first operand isn't quite right, but works best. */
2718 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2721 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2722 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2723 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2726 /* The save_expr function never wraps anything containing
2727 a PLACEHOLDER_EXPR. */
2734 switch (TREE_CODE_LENGTH (code))
2737 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2739 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2740 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2751 const_call_expr_arg_iterator iter;
2752 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2753 if (CONTAINS_PLACEHOLDER_P (arg))
2767 /* Return true if any part of the computation of TYPE involves a
2768 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2769 (for QUAL_UNION_TYPE) and field positions. */
2772 type_contains_placeholder_1 (const_tree type)
2774 /* If the size contains a placeholder or the parent type (component type in
2775 the case of arrays) type involves a placeholder, this type does. */
2776 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2777 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2778 || (TREE_TYPE (type) != 0
2779 && type_contains_placeholder_p (TREE_TYPE (type))))
2782 /* Now do type-specific checks. Note that the last part of the check above
2783 greatly limits what we have to do below. */
2784 switch (TREE_CODE (type))
2792 case REFERENCE_TYPE:
2800 case FIXED_POINT_TYPE:
2801 /* Here we just check the bounds. */
2802 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2803 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2806 /* We're already checked the component type (TREE_TYPE), so just check
2808 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2812 case QUAL_UNION_TYPE:
2816 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2817 if (TREE_CODE (field) == FIELD_DECL
2818 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2819 || (TREE_CODE (type) == QUAL_UNION_TYPE
2820 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2821 || type_contains_placeholder_p (TREE_TYPE (field))))
2833 type_contains_placeholder_p (tree type)
2837 /* If the contains_placeholder_bits field has been initialized,
2838 then we know the answer. */
2839 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2840 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2842 /* Indicate that we've seen this type node, and the answer is false.
2843 This is what we want to return if we run into recursion via fields. */
2844 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2846 /* Compute the real value. */
2847 result = type_contains_placeholder_1 (type);
2849 /* Store the real value. */
2850 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2855 /* Push tree EXP onto vector QUEUE if it is not already present. */
2858 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2863 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2864 if (simple_cst_equal (iter, exp) == 1)
2868 VEC_safe_push (tree, heap, *queue, exp);
2871 /* Given a tree EXP, find all occurences of references to fields
2872 in a PLACEHOLDER_EXPR and place them in vector REFS without
2873 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2874 we assume here that EXP contains only arithmetic expressions
2875 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2879 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2881 enum tree_code code = TREE_CODE (exp);
2885 /* We handle TREE_LIST and COMPONENT_REF separately. */
2886 if (code == TREE_LIST)
2888 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2889 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2891 else if (code == COMPONENT_REF)
2893 for (inner = TREE_OPERAND (exp, 0);
2894 REFERENCE_CLASS_P (inner);
2895 inner = TREE_OPERAND (inner, 0))
2898 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2899 push_without_duplicates (exp, refs);
2901 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2904 switch (TREE_CODE_CLASS (code))
2909 case tcc_declaration:
2910 /* Variables allocated to static storage can stay. */
2911 if (!TREE_STATIC (exp))
2912 push_without_duplicates (exp, refs);
2915 case tcc_expression:
2916 /* This is the pattern built in ada/make_aligning_type. */
2917 if (code == ADDR_EXPR
2918 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2920 push_without_duplicates (exp, refs);
2924 /* Fall through... */
2926 case tcc_exceptional:
2929 case tcc_comparison:
2931 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2932 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2936 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2937 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2945 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2946 return a tree with all occurrences of references to F in a
2947 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2948 CONST_DECLs. Note that we assume here that EXP contains only
2949 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2950 occurring only in their argument list. */
2953 substitute_in_expr (tree exp, tree f, tree r)
2955 enum tree_code code = TREE_CODE (exp);
2956 tree op0, op1, op2, op3;
2959 /* We handle TREE_LIST and COMPONENT_REF separately. */
2960 if (code == TREE_LIST)
2962 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2963 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2964 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2967 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2969 else if (code == COMPONENT_REF)
2973 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2974 and it is the right field, replace it with R. */
2975 for (inner = TREE_OPERAND (exp, 0);
2976 REFERENCE_CLASS_P (inner);
2977 inner = TREE_OPERAND (inner, 0))
2981 op1 = TREE_OPERAND (exp, 1);
2983 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2986 /* If this expression hasn't been completed let, leave it alone. */
2987 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2990 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2991 if (op0 == TREE_OPERAND (exp, 0))
2995 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
2998 switch (TREE_CODE_CLASS (code))
3003 case tcc_declaration:
3009 case tcc_expression:
3013 /* Fall through... */
3015 case tcc_exceptional:
3018 case tcc_comparison:
3020 switch (TREE_CODE_LENGTH (code))
3026 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3027 if (op0 == TREE_OPERAND (exp, 0))
3030 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3034 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3035 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3037 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3040 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3044 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3045 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3046 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3048 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3049 && op2 == TREE_OPERAND (exp, 2))
3052 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3056 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3057 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3058 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3059 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3061 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3062 && op2 == TREE_OPERAND (exp, 2)
3063 && op3 == TREE_OPERAND (exp, 3))
3067 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3079 new_tree = NULL_TREE;
3081 /* If we are trying to replace F with a constant, inline back
3082 functions which do nothing else than computing a value from
3083 the arguments they are passed. This makes it possible to
3084 fold partially or entirely the replacement expression. */
3085 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3087 tree t = maybe_inline_call_in_expr (exp);
3089 return SUBSTITUTE_IN_EXPR (t, f, r);
3092 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3094 tree op = TREE_OPERAND (exp, i);
3095 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3099 new_tree = copy_node (exp);
3100 TREE_OPERAND (new_tree, i) = new_op;
3106 new_tree = fold (new_tree);
3107 if (TREE_CODE (new_tree) == CALL_EXPR)
3108 process_call_operands (new_tree);
3119 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3123 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3124 for it within OBJ, a tree that is an object or a chain of references. */
3127 substitute_placeholder_in_expr (tree exp, tree obj)
3129 enum tree_code code = TREE_CODE (exp);
3130 tree op0, op1, op2, op3;
3133 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3134 in the chain of OBJ. */
3135 if (code == PLACEHOLDER_EXPR)
3137 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3140 for (elt = obj; elt != 0;
3141 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3142 || TREE_CODE (elt) == COND_EXPR)
3143 ? TREE_OPERAND (elt, 1)
3144 : (REFERENCE_CLASS_P (elt)
3145 || UNARY_CLASS_P (elt)
3146 || BINARY_CLASS_P (elt)
3147 || VL_EXP_CLASS_P (elt)
3148 || EXPRESSION_CLASS_P (elt))
3149 ? TREE_OPERAND (elt, 0) : 0))
3150 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3153 for (elt = obj; elt != 0;
3154 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3155 || TREE_CODE (elt) == COND_EXPR)
3156 ? TREE_OPERAND (elt, 1)
3157 : (REFERENCE_CLASS_P (elt)
3158 || UNARY_CLASS_P (elt)
3159 || BINARY_CLASS_P (elt)
3160 || VL_EXP_CLASS_P (elt)
3161 || EXPRESSION_CLASS_P (elt))
3162 ? TREE_OPERAND (elt, 0) : 0))
3163 if (POINTER_TYPE_P (TREE_TYPE (elt))
3164 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3166 return fold_build1 (INDIRECT_REF, need_type, elt);
3168 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3169 survives until RTL generation, there will be an error. */
3173 /* TREE_LIST is special because we need to look at TREE_VALUE
3174 and TREE_CHAIN, not TREE_OPERANDS. */
3175 else if (code == TREE_LIST)
3177 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3178 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3179 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3182 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3185 switch (TREE_CODE_CLASS (code))
3188 case tcc_declaration:
3191 case tcc_exceptional:
3194 case tcc_comparison:
3195 case tcc_expression:
3198 switch (TREE_CODE_LENGTH (code))
3204 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3205 if (op0 == TREE_OPERAND (exp, 0))
3208 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3212 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3213 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3215 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3218 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3222 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3223 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3224 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3226 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3227 && op2 == TREE_OPERAND (exp, 2))
3230 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3234 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3235 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3236 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3237 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3239 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3240 && op2 == TREE_OPERAND (exp, 2)
3241 && op3 == TREE_OPERAND (exp, 3))
3245 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3257 new_tree = NULL_TREE;
3259 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3261 tree op = TREE_OPERAND (exp, i);
3262 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3266 new_tree = copy_node (exp);
3267 TREE_OPERAND (new_tree, i) = new_op;
3273 new_tree = fold (new_tree);
3274 if (TREE_CODE (new_tree) == CALL_EXPR)
3275 process_call_operands (new_tree);
3286 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3290 /* Stabilize a reference so that we can use it any number of times
3291 without causing its operands to be evaluated more than once.
3292 Returns the stabilized reference. This works by means of save_expr,
3293 so see the caveats in the comments about save_expr.
3295 Also allows conversion expressions whose operands are references.
3296 Any other kind of expression is returned unchanged. */
3299 stabilize_reference (tree ref)
3302 enum tree_code code = TREE_CODE (ref);
3309 /* No action is needed in this case. */
3314 case FIX_TRUNC_EXPR:
3315 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3319 result = build_nt (INDIRECT_REF,
3320 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3324 result = build_nt (COMPONENT_REF,
3325 stabilize_reference (TREE_OPERAND (ref, 0)),
3326 TREE_OPERAND (ref, 1), NULL_TREE);
3330 result = build_nt (BIT_FIELD_REF,
3331 stabilize_reference (TREE_OPERAND (ref, 0)),
3332 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3333 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3337 result = build_nt (ARRAY_REF,
3338 stabilize_reference (TREE_OPERAND (ref, 0)),
3339 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3340 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3343 case ARRAY_RANGE_REF:
3344 result = build_nt (ARRAY_RANGE_REF,
3345 stabilize_reference (TREE_OPERAND (ref, 0)),
3346 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3347 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3351 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3352 it wouldn't be ignored. This matters when dealing with
3354 return stabilize_reference_1 (ref);
3356 /* If arg isn't a kind of lvalue we recognize, make no change.
3357 Caller should recognize the error for an invalid lvalue. */
3362 return error_mark_node;
3365 TREE_TYPE (result) = TREE_TYPE (ref);
3366 TREE_READONLY (result) = TREE_READONLY (ref);
3367 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3368 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3373 /* Subroutine of stabilize_reference; this is called for subtrees of
3374 references. Any expression with side-effects must be put in a SAVE_EXPR
3375 to ensure that it is only evaluated once.
3377 We don't put SAVE_EXPR nodes around everything, because assigning very
3378 simple expressions to temporaries causes us to miss good opportunities
3379 for optimizations. Among other things, the opportunity to fold in the
3380 addition of a constant into an addressing mode often gets lost, e.g.
3381 "y[i+1] += x;". In general, we take the approach that we should not make
3382 an assignment unless we are forced into it - i.e., that any non-side effect
3383 operator should be allowed, and that cse should take care of coalescing
3384 multiple utterances of the same expression should that prove fruitful. */
3387 stabilize_reference_1 (tree e)
3390 enum tree_code code = TREE_CODE (e);
3392 /* We cannot ignore const expressions because it might be a reference
3393 to a const array but whose index contains side-effects. But we can
3394 ignore things that are actual constant or that already have been
3395 handled by this function. */
3397 if (tree_invariant_p (e))
3400 switch (TREE_CODE_CLASS (code))
3402 case tcc_exceptional:
3404 case tcc_declaration:
3405 case tcc_comparison:
3407 case tcc_expression:
3410 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3411 so that it will only be evaluated once. */
3412 /* The reference (r) and comparison (<) classes could be handled as
3413 below, but it is generally faster to only evaluate them once. */
3414 if (TREE_SIDE_EFFECTS (e))
3415 return save_expr (e);
3419 /* Constants need no processing. In fact, we should never reach
3424 /* Division is slow and tends to be compiled with jumps,
3425 especially the division by powers of 2 that is often
3426 found inside of an array reference. So do it just once. */
3427 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3428 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3429 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3430 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3431 return save_expr (e);
3432 /* Recursively stabilize each operand. */
3433 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3434 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3438 /* Recursively stabilize each operand. */
3439 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3446 TREE_TYPE (result) = TREE_TYPE (e);
3447 TREE_READONLY (result) = TREE_READONLY (e);
3448 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3449 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3454 /* Low-level constructors for expressions. */
3456 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3457 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3460 recompute_tree_invariant_for_addr_expr (tree t)
3463 bool tc = true, se = false;
3465 /* We started out assuming this address is both invariant and constant, but
3466 does not have side effects. Now go down any handled components and see if
3467 any of them involve offsets that are either non-constant or non-invariant.
3468 Also check for side-effects.
3470 ??? Note that this code makes no attempt to deal with the case where
3471 taking the address of something causes a copy due to misalignment. */
3473 #define UPDATE_FLAGS(NODE) \
3474 do { tree _node = (NODE); \
3475 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3476 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3478 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3479 node = TREE_OPERAND (node, 0))
3481 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3482 array reference (probably made temporarily by the G++ front end),
3483 so ignore all the operands. */
3484 if ((TREE_CODE (node) == ARRAY_REF
3485 || TREE_CODE (node) == ARRAY_RANGE_REF)
3486 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3488 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3489 if (TREE_OPERAND (node, 2))
3490 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3491 if (TREE_OPERAND (node, 3))
3492 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3494 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3495 FIELD_DECL, apparently. The G++ front end can put something else
3496 there, at least temporarily. */
3497 else if (TREE_CODE (node) == COMPONENT_REF
3498 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3500 if (TREE_OPERAND (node, 2))
3501 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3503 else if (TREE_CODE (node) == BIT_FIELD_REF)
3504 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3507 node = lang_hooks.expr_to_decl (node, &tc, &se);
3509 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3510 the address, since &(*a)->b is a form of addition. If it's a constant, the
3511 address is constant too. If it's a decl, its address is constant if the
3512 decl is static. Everything else is not constant and, furthermore,
3513 taking the address of a volatile variable is not volatile. */
3514 if (TREE_CODE (node) == INDIRECT_REF)
3515 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3516 else if (CONSTANT_CLASS_P (node))
3518 else if (DECL_P (node))
3519 tc &= (staticp (node) != NULL_TREE);
3523 se |= TREE_SIDE_EFFECTS (node);
3527 TREE_CONSTANT (t) = tc;
3528 TREE_SIDE_EFFECTS (t) = se;
3532 /* Build an expression of code CODE, data type TYPE, and operands as
3533 specified. Expressions and reference nodes can be created this way.
3534 Constants, decls, types and misc nodes cannot be.
3536 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3537 enough for all extant tree codes. */
3540 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3544 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3546 t = make_node_stat (code PASS_MEM_STAT);
3553 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3555 int length = sizeof (struct tree_exp);
3556 #ifdef GATHER_STATISTICS
3557 tree_node_kind kind;
3561 #ifdef GATHER_STATISTICS
3562 switch (TREE_CODE_CLASS (code))
3564 case tcc_statement: /* an expression with side effects */
3567 case tcc_reference: /* a reference */
3575 tree_node_counts[(int) kind]++;
3576 tree_node_sizes[(int) kind] += length;
3579 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3581 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3583 memset (t, 0, sizeof (struct tree_common));
3585 TREE_SET_CODE (t, code);
3587 TREE_TYPE (t) = type;
3588 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3589 TREE_OPERAND (t, 0) = node;
3590 TREE_BLOCK (t) = NULL_TREE;
3591 if (node && !TYPE_P (node))
3593 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3594 TREE_READONLY (t) = TREE_READONLY (node);
3597 if (TREE_CODE_CLASS (code) == tcc_statement)
3598 TREE_SIDE_EFFECTS (t) = 1;
3602 /* All of these have side-effects, no matter what their
3604 TREE_SIDE_EFFECTS (t) = 1;
3605 TREE_READONLY (t) = 0;
3608 case MISALIGNED_INDIRECT_REF:
3609 case ALIGN_INDIRECT_REF:
3611 /* Whether a dereference is readonly has nothing to do with whether
3612 its operand is readonly. */
3613 TREE_READONLY (t) = 0;
3618 recompute_tree_invariant_for_addr_expr (t);
3622 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3623 && node && !TYPE_P (node)
3624 && TREE_CONSTANT (node))
3625 TREE_CONSTANT (t) = 1;
3626 if (TREE_CODE_CLASS (code) == tcc_reference
3627 && node && TREE_THIS_VOLATILE (node))
3628 TREE_THIS_VOLATILE (t) = 1;
3635 #define PROCESS_ARG(N) \
3637 TREE_OPERAND (t, N) = arg##N; \
3638 if (arg##N &&!TYPE_P (arg##N)) \
3640 if (TREE_SIDE_EFFECTS (arg##N)) \
3642 if (!TREE_READONLY (arg##N) \
3643 && !CONSTANT_CLASS_P (arg##N)) \
3644 (void) (read_only = 0); \
3645 if (!TREE_CONSTANT (arg##N)) \
3646 (void) (constant = 0); \
3651 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3653 bool constant, read_only, side_effects;
3656 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3658 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3659 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3660 /* When sizetype precision doesn't match that of pointers
3661 we need to be able to build explicit extensions or truncations
3662 of the offset argument. */
3663 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3664 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3665 && TREE_CODE (arg1) == INTEGER_CST);
3667 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3668 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3669 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3670 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3672 t = make_node_stat (code PASS_MEM_STAT);
3675 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3676 result based on those same flags for the arguments. But if the
3677 arguments aren't really even `tree' expressions, we shouldn't be trying
3680 /* Expressions without side effects may be constant if their
3681 arguments are as well. */
3682 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3683 || TREE_CODE_CLASS (code) == tcc_binary);
3685 side_effects = TREE_SIDE_EFFECTS (t);
3690 TREE_READONLY (t) = read_only;
3691 TREE_CONSTANT (t) = constant;
3692 TREE_SIDE_EFFECTS (t) = side_effects;
3693 TREE_THIS_VOLATILE (t)
3694 = (TREE_CODE_CLASS (code) == tcc_reference
3695 && arg0 && TREE_THIS_VOLATILE (arg0));
3702 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3703 tree arg2 MEM_STAT_DECL)
3705 bool constant, read_only, side_effects;
3708 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3709 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3711 t = make_node_stat (code PASS_MEM_STAT);
3716 /* As a special exception, if COND_EXPR has NULL branches, we
3717 assume that it is a gimple statement and always consider
3718 it to have side effects. */
3719 if (code == COND_EXPR
3720 && tt == void_type_node
3721 && arg1 == NULL_TREE
3722 && arg2 == NULL_TREE)
3723 side_effects = true;
3725 side_effects = TREE_SIDE_EFFECTS (t);
3731 if (code == COND_EXPR)
3732 TREE_READONLY (t) = read_only;
3734 TREE_SIDE_EFFECTS (t) = side_effects;
3735 TREE_THIS_VOLATILE (t)
3736 = (TREE_CODE_CLASS (code) == tcc_reference
3737 && arg0 && TREE_THIS_VOLATILE (arg0));
3743 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3744 tree arg2, tree arg3 MEM_STAT_DECL)
3746 bool constant, read_only, side_effects;
3749 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3751 t = make_node_stat (code PASS_MEM_STAT);
3754 side_effects = TREE_SIDE_EFFECTS (t);
3761 TREE_SIDE_EFFECTS (t) = side_effects;
3762 TREE_THIS_VOLATILE (t)
3763 = (TREE_CODE_CLASS (code) == tcc_reference
3764 && arg0 && TREE_THIS_VOLATILE (arg0));
3770 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3771 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3773 bool constant, read_only, side_effects;
3776 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3778 t = make_node_stat (code PASS_MEM_STAT);
3781 side_effects = TREE_SIDE_EFFECTS (t);
3789 TREE_SIDE_EFFECTS (t) = side_effects;
3790 TREE_THIS_VOLATILE (t)
3791 = (TREE_CODE_CLASS (code) == tcc_reference
3792 && arg0 && TREE_THIS_VOLATILE (arg0));
3798 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3799 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3801 bool constant, read_only, side_effects;
3804 gcc_assert (code == TARGET_MEM_REF);
3806 t = make_node_stat (code PASS_MEM_STAT);
3809 side_effects = TREE_SIDE_EFFECTS (t);
3816 if (code == TARGET_MEM_REF)
3820 TREE_SIDE_EFFECTS (t) = side_effects;
3821 TREE_THIS_VOLATILE (t)
3822 = (code == TARGET_MEM_REF
3823 && arg5 && TREE_THIS_VOLATILE (arg5));
3828 /* Similar except don't specify the TREE_TYPE
3829 and leave the TREE_SIDE_EFFECTS as 0.
3830 It is permissible for arguments to be null,
3831 or even garbage if their values do not matter. */
3834 build_nt (enum tree_code code, ...)
3841 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3845 t = make_node (code);
3846 length = TREE_CODE_LENGTH (code);
3848 for (i = 0; i < length; i++)
3849 TREE_OPERAND (t, i) = va_arg (p, tree);
3855 /* Similar to build_nt, but for creating a CALL_EXPR object with
3856 ARGLIST passed as a list. */
3859 build_nt_call_list (tree fn, tree arglist)
3864 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3865 CALL_EXPR_FN (t) = fn;
3866 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3867 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3868 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3872 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3876 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3881 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3882 CALL_EXPR_FN (ret) = fn;
3883 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3884 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3885 CALL_EXPR_ARG (ret, ix) = t;
3889 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3890 We do NOT enter this node in any sort of symbol table.
3892 LOC is the location of the decl.
3894 layout_decl is used to set up the decl's storage layout.
3895 Other slots are initialized to 0 or null pointers. */
3898 build_decl_stat (location_t loc, enum tree_code code, tree name,
3899 tree type MEM_STAT_DECL)
3903 t = make_node_stat (code PASS_MEM_STAT);
3904 DECL_SOURCE_LOCATION (t) = loc;
3906 /* if (type == error_mark_node)
3907 type = integer_type_node; */
3908 /* That is not done, deliberately, so that having error_mark_node
3909 as the type can suppress useless errors in the use of this variable. */
3911 DECL_NAME (t) = name;
3912 TREE_TYPE (t) = type;
3914 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3920 /* Builds and returns function declaration with NAME and TYPE. */
3923 build_fn_decl (const char *name, tree type)
3925 tree id = get_identifier (name);
3926 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3928 DECL_EXTERNAL (decl) = 1;
3929 TREE_PUBLIC (decl) = 1;
3930 DECL_ARTIFICIAL (decl) = 1;
3931 TREE_NOTHROW (decl) = 1;
3937 /* BLOCK nodes are used to represent the structure of binding contours
3938 and declarations, once those contours have been exited and their contents
3939 compiled. This information is used for outputting debugging info. */
3942 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3944 tree block = make_node (BLOCK);
3946 BLOCK_VARS (block) = vars;
3947 BLOCK_SUBBLOCKS (block) = subblocks;
3948 BLOCK_SUPERCONTEXT (block) = supercontext;
3949 BLOCK_CHAIN (block) = chain;
3954 expand_location (source_location loc)
3956 expanded_location xloc;
3957 if (loc <= BUILTINS_LOCATION)
3959 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3966 const struct line_map *map = linemap_lookup (line_table, loc);
3967 xloc.file = map->to_file;
3968 xloc.line = SOURCE_LINE (map, loc);
3969 xloc.column = SOURCE_COLUMN (map, loc);
3970 xloc.sysp = map->sysp != 0;
3976 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3978 LOC is the location to use in tree T. */
3981 protected_set_expr_location (tree t, location_t loc)
3983 if (t && CAN_HAVE_LOCATION_P (t))
3984 SET_EXPR_LOCATION (t, loc);
3987 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3991 build_decl_attribute_variant (tree ddecl, tree attribute)
3993 DECL_ATTRIBUTES (ddecl) = attribute;
3997 /* Borrowed from hashtab.c iterative_hash implementation. */
3998 #define mix(a,b,c) \
4000 a -= b; a -= c; a ^= (c>>13); \
4001 b -= c; b -= a; b ^= (a<< 8); \
4002 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4003 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4004 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4005 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4006 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4007 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4008 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4012 /* Produce good hash value combining VAL and VAL2. */
4014 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4016 /* the golden ratio; an arbitrary value. */
4017 hashval_t a = 0x9e3779b9;
4023 /* Produce good hash value combining VAL and VAL2. */
4025 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4027 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4028 return iterative_hash_hashval_t (val, val2);
4031 hashval_t a = (hashval_t) val;
4032 /* Avoid warnings about shifting of more than the width of the type on
4033 hosts that won't execute this path. */
4035 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4037 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4039 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4040 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4047 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4048 is ATTRIBUTE and its qualifiers are QUALS.
4050 Record such modified types already made so we don't make duplicates. */
4053 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4055 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4057 hashval_t hashcode = 0;
4059 enum tree_code code = TREE_CODE (ttype);
4061 /* Building a distinct copy of a tagged type is inappropriate; it
4062 causes breakage in code that expects there to be a one-to-one
4063 relationship between a struct and its fields.
4064 build_duplicate_type is another solution (as used in
4065 handle_transparent_union_attribute), but that doesn't play well
4066 with the stronger C++ type identity model. */
4067 if (TREE_CODE (ttype) == RECORD_TYPE
4068 || TREE_CODE (ttype) == UNION_TYPE
4069 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4070 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4072 warning (OPT_Wattributes,
4073 "ignoring attributes applied to %qT after definition",
4074 TYPE_MAIN_VARIANT (ttype));
4075 return build_qualified_type (ttype, quals);
4078 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4079 ntype = build_distinct_type_copy (ttype);
4081 TYPE_ATTRIBUTES (ntype) = attribute;
4083 hashcode = iterative_hash_object (code, hashcode);
4084 if (TREE_TYPE (ntype))
4085 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4087 hashcode = attribute_hash_list (attribute, hashcode);
4089 switch (TREE_CODE (ntype))
4092 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4095 if (TYPE_DOMAIN (ntype))
4096 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4100 hashcode = iterative_hash_object
4101 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4102 hashcode = iterative_hash_object
4103 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4106 case FIXED_POINT_TYPE:
4108 unsigned int precision = TYPE_PRECISION (ntype);
4109 hashcode = iterative_hash_object (precision, hashcode);
4116 ntype = type_hash_canon (hashcode, ntype);
4118 /* If the target-dependent attributes make NTYPE different from
4119 its canonical type, we will need to use structural equality
4120 checks for this type. */
4121 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4122 || !targetm.comp_type_attributes (ntype, ttype))
4123 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4124 else if (TYPE_CANONICAL (ntype) == ntype)
4125 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4127 ttype = build_qualified_type (ntype, quals);
4129 else if (TYPE_QUALS (ttype) != quals)
4130 ttype = build_qualified_type (ttype, quals);
4136 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4139 Record such modified types already made so we don't make duplicates. */
4142 build_type_attribute_variant (tree ttype, tree attribute)
4144 return build_type_attribute_qual_variant (ttype, attribute,
4145 TYPE_QUALS (ttype));
4149 /* Reset the expression *EXPR_P, a size or position.
4151 ??? We could reset all non-constant sizes or positions. But it's cheap
4152 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4154 We need to reset self-referential sizes or positions because they cannot
4155 be gimplified and thus can contain a CALL_EXPR after the gimplification
4156 is finished, which will run afoul of LTO streaming. And they need to be
4157 reset to something essentially dummy but not constant, so as to preserve
4158 the properties of the object they are attached to. */
4161 free_lang_data_in_one_sizepos (tree *expr_p)
4163 tree expr = *expr_p;
4164 if (CONTAINS_PLACEHOLDER_P (expr))
4165 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4169 /* Reset all the fields in a binfo node BINFO. We only keep
4170 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4173 free_lang_data_in_binfo (tree binfo)
4178 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4180 BINFO_VTABLE (binfo) = NULL_TREE;
4181 BINFO_BASE_ACCESSES (binfo) = NULL;
4182 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4183 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4185 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4186 free_lang_data_in_binfo (t);
4190 /* Reset all language specific information still present in TYPE. */
4193 free_lang_data_in_type (tree type)
4195 gcc_assert (TYPE_P (type));
4197 /* Give the FE a chance to remove its own data first. */
4198 lang_hooks.free_lang_data (type);
4200 TREE_LANG_FLAG_0 (type) = 0;
4201 TREE_LANG_FLAG_1 (type) = 0;
4202 TREE_LANG_FLAG_2 (type) = 0;
4203 TREE_LANG_FLAG_3 (type) = 0;
4204 TREE_LANG_FLAG_4 (type) = 0;
4205 TREE_LANG_FLAG_5 (type) = 0;
4206 TREE_LANG_FLAG_6 (type) = 0;
4208 if (TREE_CODE (type) == FUNCTION_TYPE)
4210 /* Remove the const and volatile qualifiers from arguments. The
4211 C++ front end removes them, but the C front end does not,
4212 leading to false ODR violation errors when merging two
4213 instances of the same function signature compiled by
4214 different front ends. */
4217 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4219 tree arg_type = TREE_VALUE (p);
4221 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4223 int quals = TYPE_QUALS (arg_type)
4225 & ~TYPE_QUAL_VOLATILE;
4226 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4227 free_lang_data_in_type (TREE_VALUE (p));
4232 /* Remove members that are not actually FIELD_DECLs from the field
4233 list of an aggregate. These occur in C++. */
4234 if (RECORD_OR_UNION_TYPE_P (type))
4238 /* Note that TYPE_FIELDS can be shared across distinct
4239 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4240 to be removed, we cannot set its TREE_CHAIN to NULL.
4241 Otherwise, we would not be able to find all the other fields
4242 in the other instances of this TREE_TYPE.
4244 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4246 member = TYPE_FIELDS (type);
4249 if (TREE_CODE (member) == FIELD_DECL)
4252 TREE_CHAIN (prev) = member;
4254 TYPE_FIELDS (type) = member;
4258 member = TREE_CHAIN (member);
4262 TREE_CHAIN (prev) = NULL_TREE;
4264 TYPE_FIELDS (type) = NULL_TREE;
4266 TYPE_METHODS (type) = NULL_TREE;
4267 if (TYPE_BINFO (type))
4268 free_lang_data_in_binfo (TYPE_BINFO (type));
4272 /* For non-aggregate types, clear out the language slot (which
4273 overloads TYPE_BINFO). */
4274 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4276 if (INTEGRAL_TYPE_P (type)
4277 || SCALAR_FLOAT_TYPE_P (type)
4278 || FIXED_POINT_TYPE_P (type))
4280 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4281 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4285 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4286 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4288 if (debug_info_level < DINFO_LEVEL_TERSE
4289 || (TYPE_CONTEXT (type)
4290 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4291 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4292 TYPE_CONTEXT (type) = NULL_TREE;
4294 if (debug_info_level < DINFO_LEVEL_TERSE)
4295 TYPE_STUB_DECL (type) = NULL_TREE;
4299 /* Return true if DECL may need an assembler name to be set. */
4302 need_assembler_name_p (tree decl)
4304 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4305 if (TREE_CODE (decl) != FUNCTION_DECL
4306 && TREE_CODE (decl) != VAR_DECL)
4309 /* If DECL already has its assembler name set, it does not need a
4311 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4312 || DECL_ASSEMBLER_NAME_SET_P (decl))
4315 /* Abstract decls do not need an assembler name. */
4316 if (DECL_ABSTRACT (decl))
4319 /* For VAR_DECLs, only static, public and external symbols need an
4321 if (TREE_CODE (decl) == VAR_DECL
4322 && !TREE_STATIC (decl)
4323 && !TREE_PUBLIC (decl)
4324 && !DECL_EXTERNAL (decl))
4327 if (TREE_CODE (decl) == FUNCTION_DECL)
4329 /* Do not set assembler name on builtins. Allow RTL expansion to
4330 decide whether to expand inline or via a regular call. */
4331 if (DECL_BUILT_IN (decl)
4332 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4335 /* Functions represented in the callgraph need an assembler name. */
4336 if (cgraph_get_node (decl) != NULL)
4339 /* Unused and not public functions don't need an assembler name. */
4340 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4348 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4349 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4350 in BLOCK that is not in LOCALS is removed. */
4353 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4357 tp = &BLOCK_VARS (block);
4360 if (!pointer_set_contains (locals, *tp))
4361 *tp = TREE_CHAIN (*tp);
4363 tp = &TREE_CHAIN (*tp);
4366 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4367 free_lang_data_in_block (fn, t, locals);
4371 /* Reset all language specific information still present in symbol
4375 free_lang_data_in_decl (tree decl)
4377 gcc_assert (DECL_P (decl));
4379 /* Give the FE a chance to remove its own data first. */
4380 lang_hooks.free_lang_data (decl);
4382 TREE_LANG_FLAG_0 (decl) = 0;
4383 TREE_LANG_FLAG_1 (decl) = 0;
4384 TREE_LANG_FLAG_2 (decl) = 0;
4385 TREE_LANG_FLAG_3 (decl) = 0;
4386 TREE_LANG_FLAG_4 (decl) = 0;
4387 TREE_LANG_FLAG_5 (decl) = 0;
4388 TREE_LANG_FLAG_6 (decl) = 0;
4390 /* Identifiers need not have a type. */
4391 if (DECL_NAME (decl))
4392 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4394 /* Ignore any intervening types, because we are going to clear their
4395 TYPE_CONTEXT fields. */
4396 if (TREE_CODE (decl) != FIELD_DECL
4397 && TREE_CODE (decl) != FUNCTION_DECL)
4398 DECL_CONTEXT (decl) = decl_function_context (decl);
4400 if (DECL_CONTEXT (decl)
4401 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4402 DECL_CONTEXT (decl) = NULL_TREE;
4404 if (TREE_CODE (decl) == VAR_DECL)
4406 tree context = DECL_CONTEXT (decl);
4410 enum tree_code code = TREE_CODE (context);
4411 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4413 /* Do not clear the decl context here, that will promote
4414 all vars to global ones. */
4415 DECL_INITIAL (decl) = NULL_TREE;
4418 if (TREE_STATIC (decl))
4419 DECL_CONTEXT (decl) = NULL_TREE;
4423 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4424 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4425 if (TREE_CODE (decl) == FIELD_DECL)
4426 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4428 /* DECL_FCONTEXT is only used for debug info generation. */
4429 if (TREE_CODE (decl) == FIELD_DECL
4430 && debug_info_level < DINFO_LEVEL_TERSE)
4431 DECL_FCONTEXT (decl) = NULL_TREE;
4433 if (TREE_CODE (decl) == FUNCTION_DECL)
4435 if (gimple_has_body_p (decl))
4438 struct pointer_set_t *locals;
4440 /* If DECL has a gimple body, then the context for its
4441 arguments must be DECL. Otherwise, it doesn't really
4442 matter, as we will not be emitting any code for DECL. In
4443 general, there may be other instances of DECL created by
4444 the front end and since PARM_DECLs are generally shared,
4445 their DECL_CONTEXT changes as the replicas of DECL are
4446 created. The only time where DECL_CONTEXT is important
4447 is for the FUNCTION_DECLs that have a gimple body (since
4448 the PARM_DECL will be used in the function's body). */
4449 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4450 DECL_CONTEXT (t) = decl;
4452 /* Collect all the symbols declared in DECL. */
4453 locals = pointer_set_create ();
4454 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4455 for (; t; t = TREE_CHAIN (t))
4457 pointer_set_insert (locals, TREE_VALUE (t));
4459 /* All the local symbols should have DECL as their
4461 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4464 /* Get rid of any decl not in local_decls. */
4465 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4467 pointer_set_destroy (locals);
4470 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4471 At this point, it is not needed anymore. */
4472 DECL_SAVED_TREE (decl) = NULL_TREE;
4474 else if (TREE_CODE (decl) == VAR_DECL)
4476 tree expr = DECL_DEBUG_EXPR (decl);
4478 && TREE_CODE (expr) == VAR_DECL
4479 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4480 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4482 if (DECL_EXTERNAL (decl)
4483 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4484 DECL_INITIAL (decl) = NULL_TREE;
4486 else if (TREE_CODE (decl) == TYPE_DECL)
4488 DECL_INITIAL (decl) = NULL_TREE;
4490 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4491 FIELD_DECLs, which should be preserved. Otherwise,
4492 we shouldn't be concerned with source-level lexical
4493 nesting beyond this point. */
4494 DECL_CONTEXT (decl) = NULL_TREE;
4499 /* Data used when collecting DECLs and TYPEs for language data removal. */
4501 struct free_lang_data_d
4503 /* Worklist to avoid excessive recursion. */
4504 VEC(tree,heap) *worklist;
4506 /* Set of traversed objects. Used to avoid duplicate visits. */
4507 struct pointer_set_t *pset;
4509 /* Array of symbols to process with free_lang_data_in_decl. */
4510 VEC(tree,heap) *decls;
4512 /* Array of types to process with free_lang_data_in_type. */
4513 VEC(tree,heap) *types;
4517 /* Save all language fields needed to generate proper debug information
4518 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4521 save_debug_info_for_decl (tree t)
4523 /*struct saved_debug_info_d *sdi;*/
4525 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4527 /* FIXME. Partial implementation for saving debug info removed. */
4531 /* Save all language fields needed to generate proper debug information
4532 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4535 save_debug_info_for_type (tree t)
4537 /*struct saved_debug_info_d *sdi;*/
4539 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4541 /* FIXME. Partial implementation for saving debug info removed. */
4545 /* Add type or decl T to one of the list of tree nodes that need their
4546 language data removed. The lists are held inside FLD. */
4549 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4553 VEC_safe_push (tree, heap, fld->decls, t);
4554 if (debug_info_level > DINFO_LEVEL_TERSE)
4555 save_debug_info_for_decl (t);
4557 else if (TYPE_P (t))
4559 VEC_safe_push (tree, heap, fld->types, t);
4560 if (debug_info_level > DINFO_LEVEL_TERSE)
4561 save_debug_info_for_type (t);
4567 /* Push tree node T into FLD->WORKLIST. */
4570 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4572 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4573 VEC_safe_push (tree, heap, fld->worklist, (t));
4577 /* Operand callback helper for free_lang_data_in_node. *TP is the
4578 subtree operand being considered. */
4581 find_decls_types_r (tree *tp, int *ws, void *data)
4584 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4586 if (TREE_CODE (t) == TREE_LIST)
4589 /* Language specific nodes will be removed, so there is no need
4590 to gather anything under them. */
4591 if (is_lang_specific (t))
4599 /* Note that walk_tree does not traverse every possible field in
4600 decls, so we have to do our own traversals here. */
4601 add_tree_to_fld_list (t, fld);
4603 fld_worklist_push (DECL_NAME (t), fld);
4604 fld_worklist_push (DECL_CONTEXT (t), fld);
4605 fld_worklist_push (DECL_SIZE (t), fld);
4606 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4608 /* We are going to remove everything under DECL_INITIAL for
4609 TYPE_DECLs. No point walking them. */
4610 if (TREE_CODE (t) != TYPE_DECL)
4611 fld_worklist_push (DECL_INITIAL (t), fld);
4613 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4614 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4616 if (TREE_CODE (t) == FUNCTION_DECL)
4618 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4619 fld_worklist_push (DECL_RESULT (t), fld);
4621 else if (TREE_CODE (t) == TYPE_DECL)
4623 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4624 fld_worklist_push (DECL_VINDEX (t), fld);
4626 else if (TREE_CODE (t) == FIELD_DECL)
4628 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4629 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4630 fld_worklist_push (DECL_QUALIFIER (t), fld);
4631 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4632 fld_worklist_push (DECL_FCONTEXT (t), fld);
4634 else if (TREE_CODE (t) == VAR_DECL)
4636 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4637 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4640 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4641 && DECL_HAS_VALUE_EXPR_P (t))
4642 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4644 if (TREE_CODE (t) != FIELD_DECL)
4645 fld_worklist_push (TREE_CHAIN (t), fld);
4648 else if (TYPE_P (t))
4650 /* Note that walk_tree does not traverse every possible field in
4651 types, so we have to do our own traversals here. */
4652 add_tree_to_fld_list (t, fld);
4654 if (!RECORD_OR_UNION_TYPE_P (t))
4655 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4656 fld_worklist_push (TYPE_SIZE (t), fld);
4657 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4658 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4659 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4660 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4661 fld_worklist_push (TYPE_NAME (t), fld);
4662 fld_worklist_push (TYPE_MINVAL (t), fld);
4663 if (!RECORD_OR_UNION_TYPE_P (t))
4664 fld_worklist_push (TYPE_MAXVAL (t), fld);
4665 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4666 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4667 fld_worklist_push (TYPE_CONTEXT (t), fld);
4668 fld_worklist_push (TYPE_CANONICAL (t), fld);
4670 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4674 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4676 fld_worklist_push (TREE_TYPE (tem), fld);
4677 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4679 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4680 && TREE_CODE (tem) == TREE_LIST)
4683 fld_worklist_push (TREE_VALUE (tem), fld);
4684 tem = TREE_CHAIN (tem);
4688 if (RECORD_OR_UNION_TYPE_P (t))
4691 /* Push all TYPE_FIELDS - there can be interleaving interesting
4692 and non-interesting things. */
4693 tem = TYPE_FIELDS (t);
4696 if (TREE_CODE (tem) == FIELD_DECL)
4697 fld_worklist_push (tem, fld);
4698 tem = TREE_CHAIN (tem);
4702 fld_worklist_push (TREE_CHAIN (t), fld);
4705 else if (TREE_CODE (t) == BLOCK)
4708 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4709 fld_worklist_push (tem, fld);
4710 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4711 fld_worklist_push (tem, fld);
4712 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4715 fld_worklist_push (TREE_TYPE (t), fld);
4721 /* Find decls and types in T. */
4724 find_decls_types (tree t, struct free_lang_data_d *fld)
4728 if (!pointer_set_contains (fld->pset, t))
4729 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4730 if (VEC_empty (tree, fld->worklist))
4732 t = VEC_pop (tree, fld->worklist);
4736 /* Translate all the types in LIST with the corresponding runtime
4740 get_eh_types_for_runtime (tree list)
4744 if (list == NULL_TREE)
4747 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4749 list = TREE_CHAIN (list);
4752 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4753 TREE_CHAIN (prev) = n;
4754 prev = TREE_CHAIN (prev);
4755 list = TREE_CHAIN (list);
4762 /* Find decls and types referenced in EH region R and store them in
4763 FLD->DECLS and FLD->TYPES. */
4766 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4777 /* The types referenced in each catch must first be changed to the
4778 EH types used at runtime. This removes references to FE types
4780 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4782 c->type_list = get_eh_types_for_runtime (c->type_list);
4783 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4788 case ERT_ALLOWED_EXCEPTIONS:
4789 r->u.allowed.type_list
4790 = get_eh_types_for_runtime (r->u.allowed.type_list);
4791 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4794 case ERT_MUST_NOT_THROW:
4795 walk_tree (&r->u.must_not_throw.failure_decl,
4796 find_decls_types_r, fld, fld->pset);
4802 /* Find decls and types referenced in cgraph node N and store them in
4803 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4804 look for *every* kind of DECL and TYPE node reachable from N,
4805 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4806 NAMESPACE_DECLs, etc). */
4809 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4812 struct function *fn;
4815 find_decls_types (n->decl, fld);
4817 if (!gimple_has_body_p (n->decl))
4820 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4822 fn = DECL_STRUCT_FUNCTION (n->decl);
4824 /* Traverse locals. */
4825 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4826 find_decls_types (TREE_VALUE (t), fld);
4828 /* Traverse EH regions in FN. */
4831 FOR_ALL_EH_REGION_FN (r, fn)
4832 find_decls_types_in_eh_region (r, fld);
4835 /* Traverse every statement in FN. */
4836 FOR_EACH_BB_FN (bb, fn)
4838 gimple_stmt_iterator si;
4841 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4843 gimple phi = gsi_stmt (si);
4845 for (i = 0; i < gimple_phi_num_args (phi); i++)
4847 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4848 find_decls_types (*arg_p, fld);
4852 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4854 gimple stmt = gsi_stmt (si);
4856 for (i = 0; i < gimple_num_ops (stmt); i++)
4858 tree arg = gimple_op (stmt, i);
4859 find_decls_types (arg, fld);
4866 /* Find decls and types referenced in varpool node N and store them in
4867 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4868 look for *every* kind of DECL and TYPE node reachable from N,
4869 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4870 NAMESPACE_DECLs, etc). */
4873 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4875 find_decls_types (v->decl, fld);
4878 /* If T needs an assembler name, have one created for it. */
4881 assign_assembler_name_if_neeeded (tree t)
4883 if (need_assembler_name_p (t))
4885 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4886 diagnostics that use input_location to show locus
4887 information. The problem here is that, at this point,
4888 input_location is generally anchored to the end of the file
4889 (since the parser is long gone), so we don't have a good
4890 position to pin it to.
4892 To alleviate this problem, this uses the location of T's
4893 declaration. Examples of this are
4894 testsuite/g++.dg/template/cond2.C and
4895 testsuite/g++.dg/template/pr35240.C. */
4896 location_t saved_location = input_location;
4897 input_location = DECL_SOURCE_LOCATION (t);
4899 decl_assembler_name (t);
4901 input_location = saved_location;
4906 /* Free language specific information for every operand and expression
4907 in every node of the call graph. This process operates in three stages:
4909 1- Every callgraph node and varpool node is traversed looking for
4910 decls and types embedded in them. This is a more exhaustive
4911 search than that done by find_referenced_vars, because it will
4912 also collect individual fields, decls embedded in types, etc.
4914 2- All the decls found are sent to free_lang_data_in_decl.
4916 3- All the types found are sent to free_lang_data_in_type.
4918 The ordering between decls and types is important because
4919 free_lang_data_in_decl sets assembler names, which includes
4920 mangling. So types cannot be freed up until assembler names have
4924 free_lang_data_in_cgraph (void)
4926 struct cgraph_node *n;
4927 struct varpool_node *v;
4928 struct free_lang_data_d fld;
4933 /* Initialize sets and arrays to store referenced decls and types. */
4934 fld.pset = pointer_set_create ();
4935 fld.worklist = NULL;
4936 fld.decls = VEC_alloc (tree, heap, 100);
4937 fld.types = VEC_alloc (tree, heap, 100);
4939 /* Find decls and types in the body of every function in the callgraph. */
4940 for (n = cgraph_nodes; n; n = n->next)
4941 find_decls_types_in_node (n, &fld);
4943 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4944 find_decls_types (p->decl, &fld);
4946 /* Find decls and types in every varpool symbol. */
4947 for (v = varpool_nodes_queue; v; v = v->next_needed)
4948 find_decls_types_in_var (v, &fld);
4950 /* Set the assembler name on every decl found. We need to do this
4951 now because free_lang_data_in_decl will invalidate data needed
4952 for mangling. This breaks mangling on interdependent decls. */
4953 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4954 assign_assembler_name_if_neeeded (t);
4956 /* Traverse every decl found freeing its language data. */
4957 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4958 free_lang_data_in_decl (t);
4960 /* Traverse every type found freeing its language data. */
4961 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4962 free_lang_data_in_type (t);
4964 pointer_set_destroy (fld.pset);
4965 VEC_free (tree, heap, fld.worklist);
4966 VEC_free (tree, heap, fld.decls);
4967 VEC_free (tree, heap, fld.types);
4971 /* Free resources that are used by FE but are not needed once they are done. */
4974 free_lang_data (void)
4978 /* If we are the LTO frontend we have freed lang-specific data already. */
4980 || !flag_generate_lto)
4983 /* Allocate and assign alias sets to the standard integer types
4984 while the slots are still in the way the frontends generated them. */
4985 for (i = 0; i < itk_none; ++i)
4986 if (integer_types[i])
4987 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
4989 /* Traverse the IL resetting language specific information for
4990 operands, expressions, etc. */
4991 free_lang_data_in_cgraph ();
4993 /* Create gimple variants for common types. */
4994 ptrdiff_type_node = integer_type_node;
4995 fileptr_type_node = ptr_type_node;
4996 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4997 || (TYPE_MODE (boolean_type_node)
4998 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4999 || TYPE_PRECISION (boolean_type_node) != 1
5000 || !TYPE_UNSIGNED (boolean_type_node))
5002 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5003 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5004 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5005 TYPE_PRECISION (boolean_type_node) = 1;
5006 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5007 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5010 /* Unify char_type_node with its properly signed variant. */
5011 if (TYPE_UNSIGNED (char_type_node))
5012 unsigned_char_type_node = char_type_node;
5014 signed_char_type_node = char_type_node;
5016 /* Reset some langhooks. Do not reset types_compatible_p, it may
5017 still be used indirectly via the get_alias_set langhook. */
5018 lang_hooks.callgraph.analyze_expr = NULL;
5019 lang_hooks.dwarf_name = lhd_dwarf_name;
5020 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5021 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
5023 /* Reset diagnostic machinery. */
5024 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5025 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5026 diagnostic_format_decoder (global_dc) = default_tree_printer;
5032 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5036 "*free_lang_data", /* name */
5038 free_lang_data, /* execute */
5041 0, /* static_pass_number */
5042 TV_IPA_FREE_LANG_DATA, /* tv_id */
5043 0, /* properties_required */
5044 0, /* properties_provided */
5045 0, /* properties_destroyed */
5046 0, /* todo_flags_start */
5047 TODO_ggc_collect /* todo_flags_finish */
5051 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5054 We try both `text' and `__text__', ATTR may be either one. */
5055 /* ??? It might be a reasonable simplification to require ATTR to be only
5056 `text'. One might then also require attribute lists to be stored in
5057 their canonicalized form. */
5060 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5065 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5068 p = IDENTIFIER_POINTER (ident);
5069 ident_len = IDENTIFIER_LENGTH (ident);
5071 if (ident_len == attr_len
5072 && strcmp (attr, p) == 0)
5075 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5078 gcc_assert (attr[1] == '_');
5079 gcc_assert (attr[attr_len - 2] == '_');
5080 gcc_assert (attr[attr_len - 1] == '_');
5081 if (ident_len == attr_len - 4
5082 && strncmp (attr + 2, p, attr_len - 4) == 0)
5087 if (ident_len == attr_len + 4
5088 && p[0] == '_' && p[1] == '_'
5089 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5090 && strncmp (attr, p + 2, attr_len) == 0)
5097 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5100 We try both `text' and `__text__', ATTR may be either one. */
5103 is_attribute_p (const char *attr, const_tree ident)
5105 return is_attribute_with_length_p (attr, strlen (attr), ident);
5108 /* Given an attribute name and a list of attributes, return a pointer to the
5109 attribute's list element if the attribute is part of the list, or NULL_TREE
5110 if not found. If the attribute appears more than once, this only
5111 returns the first occurrence; the TREE_CHAIN of the return value should
5112 be passed back in if further occurrences are wanted. */
5115 lookup_attribute (const char *attr_name, tree list)
5118 size_t attr_len = strlen (attr_name);
5120 for (l = list; l; l = TREE_CHAIN (l))
5122 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5123 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5129 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5133 remove_attribute (const char *attr_name, tree list)
5136 size_t attr_len = strlen (attr_name);
5138 for (p = &list; *p; )
5141 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5142 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5143 *p = TREE_CHAIN (l);
5145 p = &TREE_CHAIN (l);
5151 /* Return an attribute list that is the union of a1 and a2. */
5154 merge_attributes (tree a1, tree a2)
5158 /* Either one unset? Take the set one. */
5160 if ((attributes = a1) == 0)
5163 /* One that completely contains the other? Take it. */
5165 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5167 if (attribute_list_contained (a2, a1))
5171 /* Pick the longest list, and hang on the other list. */
5173 if (list_length (a1) < list_length (a2))
5174 attributes = a2, a2 = a1;
5176 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5179 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5182 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5185 if (TREE_VALUE (a) != NULL
5186 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5187 && TREE_VALUE (a2) != NULL
5188 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5190 if (simple_cst_list_equal (TREE_VALUE (a),
5191 TREE_VALUE (a2)) == 1)
5194 else if (simple_cst_equal (TREE_VALUE (a),
5195 TREE_VALUE (a2)) == 1)
5200 a1 = copy_node (a2);
5201 TREE_CHAIN (a1) = attributes;
5210 /* Given types T1 and T2, merge their attributes and return
5214 merge_type_attributes (tree t1, tree t2)
5216 return merge_attributes (TYPE_ATTRIBUTES (t1),
5217 TYPE_ATTRIBUTES (t2));
5220 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5224 merge_decl_attributes (tree olddecl, tree newdecl)
5226 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5227 DECL_ATTRIBUTES (newdecl));
5230 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5232 /* Specialization of merge_decl_attributes for various Windows targets.
5234 This handles the following situation:
5236 __declspec (dllimport) int foo;
5239 The second instance of `foo' nullifies the dllimport. */
5242 merge_dllimport_decl_attributes (tree old, tree new_tree)
5245 int delete_dllimport_p = 1;
5247 /* What we need to do here is remove from `old' dllimport if it doesn't
5248 appear in `new'. dllimport behaves like extern: if a declaration is
5249 marked dllimport and a definition appears later, then the object
5250 is not dllimport'd. We also remove a `new' dllimport if the old list
5251 contains dllexport: dllexport always overrides dllimport, regardless
5252 of the order of declaration. */
5253 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5254 delete_dllimport_p = 0;
5255 else if (DECL_DLLIMPORT_P (new_tree)
5256 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5258 DECL_DLLIMPORT_P (new_tree) = 0;
5259 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5260 "dllimport ignored", new_tree);
5262 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5264 /* Warn about overriding a symbol that has already been used, e.g.:
5265 extern int __attribute__ ((dllimport)) foo;
5266 int* bar () {return &foo;}
5269 if (TREE_USED (old))
5271 warning (0, "%q+D redeclared without dllimport attribute "
5272 "after being referenced with dll linkage", new_tree);
5273 /* If we have used a variable's address with dllimport linkage,
5274 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5275 decl may already have had TREE_CONSTANT computed.
5276 We still remove the attribute so that assembler code refers
5277 to '&foo rather than '_imp__foo'. */
5278 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5279 DECL_DLLIMPORT_P (new_tree) = 1;
5282 /* Let an inline definition silently override the external reference,
5283 but otherwise warn about attribute inconsistency. */
5284 else if (TREE_CODE (new_tree) == VAR_DECL
5285 || !DECL_DECLARED_INLINE_P (new_tree))
5286 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5287 "previous dllimport ignored", new_tree);
5290 delete_dllimport_p = 0;
5292 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5294 if (delete_dllimport_p)
5297 const size_t attr_len = strlen ("dllimport");
5299 /* Scan the list for dllimport and delete it. */
5300 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5302 if (is_attribute_with_length_p ("dllimport", attr_len,
5305 if (prev == NULL_TREE)
5308 TREE_CHAIN (prev) = TREE_CHAIN (t);
5317 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5318 struct attribute_spec.handler. */
5321 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5327 /* These attributes may apply to structure and union types being created,
5328 but otherwise should pass to the declaration involved. */
5331 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5332 | (int) ATTR_FLAG_ARRAY_NEXT))
5334 *no_add_attrs = true;
5335 return tree_cons (name, args, NULL_TREE);
5337 if (TREE_CODE (node) == RECORD_TYPE
5338 || TREE_CODE (node) == UNION_TYPE)
5340 node = TYPE_NAME (node);
5346 warning (OPT_Wattributes, "%qE attribute ignored",
5348 *no_add_attrs = true;
5353 if (TREE_CODE (node) != FUNCTION_DECL
5354 && TREE_CODE (node) != VAR_DECL
5355 && TREE_CODE (node) != TYPE_DECL)
5357 *no_add_attrs = true;
5358 warning (OPT_Wattributes, "%qE attribute ignored",
5363 if (TREE_CODE (node) == TYPE_DECL
5364 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5365 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5367 *no_add_attrs = true;
5368 warning (OPT_Wattributes, "%qE attribute ignored",
5373 is_dllimport = is_attribute_p ("dllimport", name);
5375 /* Report error on dllimport ambiguities seen now before they cause
5379 /* Honor any target-specific overrides. */
5380 if (!targetm.valid_dllimport_attribute_p (node))
5381 *no_add_attrs = true;
5383 else if (TREE_CODE (node) == FUNCTION_DECL
5384 && DECL_DECLARED_INLINE_P (node))
5386 warning (OPT_Wattributes, "inline function %q+D declared as "
5387 " dllimport: attribute ignored", node);
5388 *no_add_attrs = true;
5390 /* Like MS, treat definition of dllimported variables and
5391 non-inlined functions on declaration as syntax errors. */
5392 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5394 error ("function %q+D definition is marked dllimport", node);
5395 *no_add_attrs = true;
5398 else if (TREE_CODE (node) == VAR_DECL)
5400 if (DECL_INITIAL (node))
5402 error ("variable %q+D definition is marked dllimport",
5404 *no_add_attrs = true;
5407 /* `extern' needn't be specified with dllimport.
5408 Specify `extern' now and hope for the best. Sigh. */
5409 DECL_EXTERNAL (node) = 1;
5410 /* Also, implicitly give dllimport'd variables declared within
5411 a function global scope, unless declared static. */
5412 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5413 TREE_PUBLIC (node) = 1;
5416 if (*no_add_attrs == false)
5417 DECL_DLLIMPORT_P (node) = 1;
5419 else if (TREE_CODE (node) == FUNCTION_DECL
5420 && DECL_DECLARED_INLINE_P (node))
5421 /* An exported function, even if inline, must be emitted. */
5422 DECL_EXTERNAL (node) = 0;
5424 /* Report error if symbol is not accessible at global scope. */
5425 if (!TREE_PUBLIC (node)
5426 && (TREE_CODE (node) == VAR_DECL
5427 || TREE_CODE (node) == FUNCTION_DECL))
5429 error ("external linkage required for symbol %q+D because of "
5430 "%qE attribute", node, name);
5431 *no_add_attrs = true;
5434 /* A dllexport'd entity must have default visibility so that other
5435 program units (shared libraries or the main executable) can see
5436 it. A dllimport'd entity must have default visibility so that
5437 the linker knows that undefined references within this program
5438 unit can be resolved by the dynamic linker. */
5441 if (DECL_VISIBILITY_SPECIFIED (node)
5442 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5443 error ("%qE implies default visibility, but %qD has already "
5444 "been declared with a different visibility",
5446 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5447 DECL_VISIBILITY_SPECIFIED (node) = 1;
5453 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5455 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5456 of the various TYPE_QUAL values. */
5459 set_type_quals (tree type, int type_quals)
5461 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5462 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5463 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5464 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5467 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5470 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5472 return (TYPE_QUALS (cand) == type_quals
5473 && TYPE_NAME (cand) == TYPE_NAME (base)
5474 /* Apparently this is needed for Objective-C. */
5475 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5476 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5477 TYPE_ATTRIBUTES (base)));
5480 /* Return a version of the TYPE, qualified as indicated by the
5481 TYPE_QUALS, if one exists. If no qualified version exists yet,
5482 return NULL_TREE. */
5485 get_qualified_type (tree type, int type_quals)
5489 if (TYPE_QUALS (type) == type_quals)
5492 /* Search the chain of variants to see if there is already one there just
5493 like the one we need to have. If so, use that existing one. We must
5494 preserve the TYPE_NAME, since there is code that depends on this. */
5495 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5496 if (check_qualified_type (t, type, type_quals))
5502 /* Like get_qualified_type, but creates the type if it does not
5503 exist. This function never returns NULL_TREE. */
5506 build_qualified_type (tree type, int type_quals)
5510 /* See if we already have the appropriate qualified variant. */
5511 t = get_qualified_type (type, type_quals);
5513 /* If not, build it. */
5516 t = build_variant_type_copy (type);
5517 set_type_quals (t, type_quals);
5519 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5520 /* Propagate structural equality. */
5521 SET_TYPE_STRUCTURAL_EQUALITY (t);
5522 else if (TYPE_CANONICAL (type) != type)
5523 /* Build the underlying canonical type, since it is different
5525 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5528 /* T is its own canonical type. */
5529 TYPE_CANONICAL (t) = t;
5536 /* Create a new distinct copy of TYPE. The new type is made its own
5537 MAIN_VARIANT. If TYPE requires structural equality checks, the
5538 resulting type requires structural equality checks; otherwise, its
5539 TYPE_CANONICAL points to itself. */
5542 build_distinct_type_copy (tree type)
5544 tree t = copy_node (type);
5546 TYPE_POINTER_TO (t) = 0;
5547 TYPE_REFERENCE_TO (t) = 0;
5549 /* Set the canonical type either to a new equivalence class, or
5550 propagate the need for structural equality checks. */
5551 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5552 SET_TYPE_STRUCTURAL_EQUALITY (t);
5554 TYPE_CANONICAL (t) = t;
5556 /* Make it its own variant. */
5557 TYPE_MAIN_VARIANT (t) = t;
5558 TYPE_NEXT_VARIANT (t) = 0;
5560 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5561 whose TREE_TYPE is not t. This can also happen in the Ada
5562 frontend when using subtypes. */
5567 /* Create a new variant of TYPE, equivalent but distinct. This is so
5568 the caller can modify it. TYPE_CANONICAL for the return type will
5569 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5570 are considered equal by the language itself (or that both types
5571 require structural equality checks). */
5574 build_variant_type_copy (tree type)
5576 tree t, m = TYPE_MAIN_VARIANT (type);
5578 t = build_distinct_type_copy (type);
5580 /* Since we're building a variant, assume that it is a non-semantic
5581 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5582 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5584 /* Add the new type to the chain of variants of TYPE. */
5585 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5586 TYPE_NEXT_VARIANT (m) = t;
5587 TYPE_MAIN_VARIANT (t) = m;
5592 /* Return true if the from tree in both tree maps are equal. */
5595 tree_map_base_eq (const void *va, const void *vb)
5597 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5598 *const b = (const struct tree_map_base *) vb;
5599 return (a->from == b->from);
5602 /* Hash a from tree in a tree_map. */
5605 tree_map_base_hash (const void *item)
5607 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5610 /* Return true if this tree map structure is marked for garbage collection
5611 purposes. We simply return true if the from tree is marked, so that this
5612 structure goes away when the from tree goes away. */
5615 tree_map_base_marked_p (const void *p)
5617 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5621 tree_map_hash (const void *item)
5623 return (((const struct tree_map *) item)->hash);
5626 /* Return the initialization priority for DECL. */
5629 decl_init_priority_lookup (tree decl)
5631 struct tree_priority_map *h;
5632 struct tree_map_base in;
5634 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5636 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5637 return h ? h->init : DEFAULT_INIT_PRIORITY;
5640 /* Return the finalization priority for DECL. */
5643 decl_fini_priority_lookup (tree decl)
5645 struct tree_priority_map *h;
5646 struct tree_map_base in;
5648 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5650 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5651 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5654 /* Return the initialization and finalization priority information for
5655 DECL. If there is no previous priority information, a freshly
5656 allocated structure is returned. */
5658 static struct tree_priority_map *
5659 decl_priority_info (tree decl)
5661 struct tree_priority_map in;
5662 struct tree_priority_map *h;
5665 in.base.from = decl;
5666 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5667 h = (struct tree_priority_map *) *loc;
5670 h = GGC_CNEW (struct tree_priority_map);
5672 h->base.from = decl;
5673 h->init = DEFAULT_INIT_PRIORITY;
5674 h->fini = DEFAULT_INIT_PRIORITY;
5680 /* Set the initialization priority for DECL to PRIORITY. */
5683 decl_init_priority_insert (tree decl, priority_type priority)
5685 struct tree_priority_map *h;
5687 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5688 h = decl_priority_info (decl);
5692 /* Set the finalization priority for DECL to PRIORITY. */
5695 decl_fini_priority_insert (tree decl, priority_type priority)
5697 struct tree_priority_map *h;
5699 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5700 h = decl_priority_info (decl);
5704 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5707 print_debug_expr_statistics (void)
5709 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5710 (long) htab_size (debug_expr_for_decl),
5711 (long) htab_elements (debug_expr_for_decl),
5712 htab_collisions (debug_expr_for_decl));
5715 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5718 print_value_expr_statistics (void)
5720 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5721 (long) htab_size (value_expr_for_decl),
5722 (long) htab_elements (value_expr_for_decl),
5723 htab_collisions (value_expr_for_decl));
5726 /* Lookup a debug expression for FROM, and return it if we find one. */
5729 decl_debug_expr_lookup (tree from)
5731 struct tree_map *h, in;
5732 in.base.from = from;
5734 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5735 htab_hash_pointer (from));
5741 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5744 decl_debug_expr_insert (tree from, tree to)
5749 h = GGC_NEW (struct tree_map);
5750 h->hash = htab_hash_pointer (from);
5751 h->base.from = from;
5753 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5754 *(struct tree_map **) loc = h;
5757 /* Lookup a value expression for FROM, and return it if we find one. */
5760 decl_value_expr_lookup (tree from)
5762 struct tree_map *h, in;
5763 in.base.from = from;
5765 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5766 htab_hash_pointer (from));
5772 /* Insert a mapping FROM->TO in the value expression hashtable. */
5775 decl_value_expr_insert (tree from, tree to)
5780 h = GGC_NEW (struct tree_map);
5781 h->hash = htab_hash_pointer (from);
5782 h->base.from = from;
5784 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5785 *(struct tree_map **) loc = h;
5788 /* Hashing of types so that we don't make duplicates.
5789 The entry point is `type_hash_canon'. */
5791 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5792 with types in the TREE_VALUE slots), by adding the hash codes
5793 of the individual types. */
5796 type_hash_list (const_tree list, hashval_t hashcode)
5800 for (tail = list; tail; tail = TREE_CHAIN (tail))
5801 if (TREE_VALUE (tail) != error_mark_node)
5802 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5808 /* These are the Hashtable callback functions. */
5810 /* Returns true iff the types are equivalent. */
5813 type_hash_eq (const void *va, const void *vb)
5815 const struct type_hash *const a = (const struct type_hash *) va,
5816 *const b = (const struct type_hash *) vb;
5818 /* First test the things that are the same for all types. */
5819 if (a->hash != b->hash
5820 || TREE_CODE (a->type) != TREE_CODE (b->type)
5821 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5822 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5823 TYPE_ATTRIBUTES (b->type))
5824 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5825 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5826 || (TREE_CODE (a->type) != COMPLEX_TYPE
5827 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5830 switch (TREE_CODE (a->type))
5835 case REFERENCE_TYPE:
5839 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5842 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5843 && !(TYPE_VALUES (a->type)
5844 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5845 && TYPE_VALUES (b->type)
5846 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5847 && type_list_equal (TYPE_VALUES (a->type),
5848 TYPE_VALUES (b->type))))
5851 /* ... fall through ... */
5856 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5857 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5858 TYPE_MAX_VALUE (b->type)))
5859 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5860 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5861 TYPE_MIN_VALUE (b->type))));
5863 case FIXED_POINT_TYPE:
5864 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5867 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5870 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5871 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5872 || (TYPE_ARG_TYPES (a->type)
5873 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5874 && TYPE_ARG_TYPES (b->type)
5875 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5876 && type_list_equal (TYPE_ARG_TYPES (a->type),
5877 TYPE_ARG_TYPES (b->type)))));
5880 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5884 case QUAL_UNION_TYPE:
5885 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5886 || (TYPE_FIELDS (a->type)
5887 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5888 && TYPE_FIELDS (b->type)
5889 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5890 && type_list_equal (TYPE_FIELDS (a->type),
5891 TYPE_FIELDS (b->type))));
5894 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5895 || (TYPE_ARG_TYPES (a->type)
5896 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5897 && TYPE_ARG_TYPES (b->type)
5898 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5899 && type_list_equal (TYPE_ARG_TYPES (a->type),
5900 TYPE_ARG_TYPES (b->type))))
5908 if (lang_hooks.types.type_hash_eq != NULL)
5909 return lang_hooks.types.type_hash_eq (a->type, b->type);
5914 /* Return the cached hash value. */
5917 type_hash_hash (const void *item)
5919 return ((const struct type_hash *) item)->hash;
5922 /* Look in the type hash table for a type isomorphic to TYPE.
5923 If one is found, return it. Otherwise return 0. */
5926 type_hash_lookup (hashval_t hashcode, tree type)
5928 struct type_hash *h, in;
5930 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5931 must call that routine before comparing TYPE_ALIGNs. */
5937 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5944 /* Add an entry to the type-hash-table
5945 for a type TYPE whose hash code is HASHCODE. */
5948 type_hash_add (hashval_t hashcode, tree type)
5950 struct type_hash *h;
5953 h = GGC_NEW (struct type_hash);
5956 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5960 /* Given TYPE, and HASHCODE its hash code, return the canonical
5961 object for an identical type if one already exists.
5962 Otherwise, return TYPE, and record it as the canonical object.
5964 To use this function, first create a type of the sort you want.
5965 Then compute its hash code from the fields of the type that
5966 make it different from other similar types.
5967 Then call this function and use the value. */
5970 type_hash_canon (unsigned int hashcode, tree type)
5974 /* The hash table only contains main variants, so ensure that's what we're
5976 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5978 if (!lang_hooks.types.hash_types)
5981 /* See if the type is in the hash table already. If so, return it.
5982 Otherwise, add the type. */
5983 t1 = type_hash_lookup (hashcode, type);
5986 #ifdef GATHER_STATISTICS
5987 tree_node_counts[(int) t_kind]--;
5988 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5994 type_hash_add (hashcode, type);
5999 /* See if the data pointed to by the type hash table is marked. We consider
6000 it marked if the type is marked or if a debug type number or symbol
6001 table entry has been made for the type. This reduces the amount of
6002 debugging output and eliminates that dependency of the debug output on
6003 the number of garbage collections. */
6006 type_hash_marked_p (const void *p)
6008 const_tree const type = ((const struct type_hash *) p)->type;
6010 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
6014 print_type_hash_statistics (void)
6016 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6017 (long) htab_size (type_hash_table),
6018 (long) htab_elements (type_hash_table),
6019 htab_collisions (type_hash_table));
6022 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6023 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6024 by adding the hash codes of the individual attributes. */
6027 attribute_hash_list (const_tree list, hashval_t hashcode)
6031 for (tail = list; tail; tail = TREE_CHAIN (tail))
6032 /* ??? Do we want to add in TREE_VALUE too? */
6033 hashcode = iterative_hash_object
6034 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6038 /* Given two lists of attributes, return true if list l2 is
6039 equivalent to l1. */
6042 attribute_list_equal (const_tree l1, const_tree l2)
6044 return attribute_list_contained (l1, l2)
6045 && attribute_list_contained (l2, l1);
6048 /* Given two lists of attributes, return true if list L2 is
6049 completely contained within L1. */
6050 /* ??? This would be faster if attribute names were stored in a canonicalized
6051 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6052 must be used to show these elements are equivalent (which they are). */
6053 /* ??? It's not clear that attributes with arguments will always be handled
6057 attribute_list_contained (const_tree l1, const_tree l2)
6061 /* First check the obvious, maybe the lists are identical. */
6065 /* Maybe the lists are similar. */
6066 for (t1 = l1, t2 = l2;
6068 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6069 && TREE_VALUE (t1) == TREE_VALUE (t2);
6070 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6072 /* Maybe the lists are equal. */
6073 if (t1 == 0 && t2 == 0)
6076 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6079 /* This CONST_CAST is okay because lookup_attribute does not
6080 modify its argument and the return value is assigned to a
6082 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6083 CONST_CAST_TREE(l1));
6085 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6088 if (TREE_VALUE (t2) != NULL
6089 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6090 && TREE_VALUE (attr) != NULL
6091 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6093 if (simple_cst_list_equal (TREE_VALUE (t2),
6094 TREE_VALUE (attr)) == 1)
6097 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6108 /* Given two lists of types
6109 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6110 return 1 if the lists contain the same types in the same order.
6111 Also, the TREE_PURPOSEs must match. */
6114 type_list_equal (const_tree l1, const_tree l2)
6118 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6119 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6120 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6121 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6122 && (TREE_TYPE (TREE_PURPOSE (t1))
6123 == TREE_TYPE (TREE_PURPOSE (t2))))))
6129 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6130 given by TYPE. If the argument list accepts variable arguments,
6131 then this function counts only the ordinary arguments. */
6134 type_num_arguments (const_tree type)
6139 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6140 /* If the function does not take a variable number of arguments,
6141 the last element in the list will have type `void'. */
6142 if (VOID_TYPE_P (TREE_VALUE (t)))
6150 /* Nonzero if integer constants T1 and T2
6151 represent the same constant value. */
6154 tree_int_cst_equal (const_tree t1, const_tree t2)
6159 if (t1 == 0 || t2 == 0)
6162 if (TREE_CODE (t1) == INTEGER_CST
6163 && TREE_CODE (t2) == INTEGER_CST
6164 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6165 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6171 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6172 The precise way of comparison depends on their data type. */
6175 tree_int_cst_lt (const_tree t1, const_tree t2)
6180 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6182 int t1_sgn = tree_int_cst_sgn (t1);
6183 int t2_sgn = tree_int_cst_sgn (t2);
6185 if (t1_sgn < t2_sgn)
6187 else if (t1_sgn > t2_sgn)
6189 /* Otherwise, both are non-negative, so we compare them as
6190 unsigned just in case one of them would overflow a signed
6193 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6194 return INT_CST_LT (t1, t2);
6196 return INT_CST_LT_UNSIGNED (t1, t2);
6199 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6202 tree_int_cst_compare (const_tree t1, const_tree t2)
6204 if (tree_int_cst_lt (t1, t2))
6206 else if (tree_int_cst_lt (t2, t1))
6212 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6213 the host. If POS is zero, the value can be represented in a single
6214 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6215 be represented in a single unsigned HOST_WIDE_INT. */
6218 host_integerp (const_tree t, int pos)
6223 return (TREE_CODE (t) == INTEGER_CST
6224 && ((TREE_INT_CST_HIGH (t) == 0
6225 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6226 || (! pos && TREE_INT_CST_HIGH (t) == -1
6227 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6228 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6229 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6230 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6231 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6234 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6235 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6236 be non-negative. We must be able to satisfy the above conditions. */
6239 tree_low_cst (const_tree t, int pos)
6241 gcc_assert (host_integerp (t, pos));
6242 return TREE_INT_CST_LOW (t);
6245 /* Return the most significant bit of the integer constant T. */
6248 tree_int_cst_msb (const_tree t)
6252 unsigned HOST_WIDE_INT l;
6254 /* Note that using TYPE_PRECISION here is wrong. We care about the
6255 actual bits, not the (arbitrary) range of the type. */
6256 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6257 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6258 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6259 return (l & 1) == 1;
6262 /* Return an indication of the sign of the integer constant T.
6263 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6264 Note that -1 will never be returned if T's type is unsigned. */
6267 tree_int_cst_sgn (const_tree t)
6269 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6271 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6273 else if (TREE_INT_CST_HIGH (t) < 0)
6279 /* Return the minimum number of bits needed to represent VALUE in a
6280 signed or unsigned type, UNSIGNEDP says which. */
6283 tree_int_cst_min_precision (tree value, bool unsignedp)
6287 /* If the value is negative, compute its negative minus 1. The latter
6288 adjustment is because the absolute value of the largest negative value
6289 is one larger than the largest positive value. This is equivalent to
6290 a bit-wise negation, so use that operation instead. */
6292 if (tree_int_cst_sgn (value) < 0)
6293 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6295 /* Return the number of bits needed, taking into account the fact
6296 that we need one more bit for a signed than unsigned type. */
6298 if (integer_zerop (value))
6301 log = tree_floor_log2 (value);
6303 return log + 1 + !unsignedp;
6306 /* Compare two constructor-element-type constants. Return 1 if the lists
6307 are known to be equal; otherwise return 0. */
6310 simple_cst_list_equal (const_tree l1, const_tree l2)
6312 while (l1 != NULL_TREE && l2 != NULL_TREE)
6314 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6317 l1 = TREE_CHAIN (l1);
6318 l2 = TREE_CHAIN (l2);
6324 /* Return truthvalue of whether T1 is the same tree structure as T2.
6325 Return 1 if they are the same.
6326 Return 0 if they are understandably different.
6327 Return -1 if either contains tree structure not understood by
6331 simple_cst_equal (const_tree t1, const_tree t2)
6333 enum tree_code code1, code2;
6339 if (t1 == 0 || t2 == 0)
6342 code1 = TREE_CODE (t1);
6343 code2 = TREE_CODE (t2);
6345 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6347 if (CONVERT_EXPR_CODE_P (code2)
6348 || code2 == NON_LVALUE_EXPR)
6349 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6351 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6354 else if (CONVERT_EXPR_CODE_P (code2)
6355 || code2 == NON_LVALUE_EXPR)
6356 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6364 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6365 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6368 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6371 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6374 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6375 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6376 TREE_STRING_LENGTH (t1)));
6380 unsigned HOST_WIDE_INT idx;
6381 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6382 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6384 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6387 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6388 /* ??? Should we handle also fields here? */
6389 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6390 VEC_index (constructor_elt, v2, idx)->value))
6396 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6399 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6402 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6405 const_tree arg1, arg2;
6406 const_call_expr_arg_iterator iter1, iter2;
6407 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6408 arg2 = first_const_call_expr_arg (t2, &iter2);
6410 arg1 = next_const_call_expr_arg (&iter1),
6411 arg2 = next_const_call_expr_arg (&iter2))
6413 cmp = simple_cst_equal (arg1, arg2);
6417 return arg1 == arg2;
6421 /* Special case: if either target is an unallocated VAR_DECL,
6422 it means that it's going to be unified with whatever the
6423 TARGET_EXPR is really supposed to initialize, so treat it
6424 as being equivalent to anything. */
6425 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6426 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6427 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6428 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6429 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6430 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6433 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6438 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6440 case WITH_CLEANUP_EXPR:
6441 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6445 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6448 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6449 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6463 /* This general rule works for most tree codes. All exceptions should be
6464 handled above. If this is a language-specific tree code, we can't
6465 trust what might be in the operand, so say we don't know
6467 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6470 switch (TREE_CODE_CLASS (code1))
6474 case tcc_comparison:
6475 case tcc_expression:
6479 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6481 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6493 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6494 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6495 than U, respectively. */
6498 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6500 if (tree_int_cst_sgn (t) < 0)
6502 else if (TREE_INT_CST_HIGH (t) != 0)
6504 else if (TREE_INT_CST_LOW (t) == u)
6506 else if (TREE_INT_CST_LOW (t) < u)
6512 /* Return true if CODE represents an associative tree code. Otherwise
6515 associative_tree_code (enum tree_code code)
6534 /* Return true if CODE represents a commutative tree code. Otherwise
6537 commutative_tree_code (enum tree_code code)
6550 case UNORDERED_EXPR:
6554 case TRUTH_AND_EXPR:
6555 case TRUTH_XOR_EXPR:
6565 /* Generate a hash value for an expression. This can be used iteratively
6566 by passing a previous result as the VAL argument.
6568 This function is intended to produce the same hash for expressions which
6569 would compare equal using operand_equal_p. */
6572 iterative_hash_expr (const_tree t, hashval_t val)
6575 enum tree_code code;
6579 return iterative_hash_hashval_t (0, val);
6581 code = TREE_CODE (t);
6585 /* Alas, constants aren't shared, so we can't rely on pointer
6588 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6589 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6592 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6594 return iterative_hash_hashval_t (val2, val);
6598 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6600 return iterative_hash_hashval_t (val2, val);
6603 return iterative_hash (TREE_STRING_POINTER (t),
6604 TREE_STRING_LENGTH (t), val);
6606 val = iterative_hash_expr (TREE_REALPART (t), val);
6607 return iterative_hash_expr (TREE_IMAGPART (t), val);
6609 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6611 /* We can just compare by pointer. */
6612 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6613 case PLACEHOLDER_EXPR:
6614 /* The node itself doesn't matter. */
6617 /* A list of expressions, for a CALL_EXPR or as the elements of a
6619 for (; t; t = TREE_CHAIN (t))
6620 val = iterative_hash_expr (TREE_VALUE (t), val);
6624 unsigned HOST_WIDE_INT idx;
6626 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6628 val = iterative_hash_expr (field, val);
6629 val = iterative_hash_expr (value, val);
6634 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6635 Otherwise nodes that compare equal according to operand_equal_p might
6636 get different hash codes. However, don't do this for machine specific
6637 or front end builtins, since the function code is overloaded in those
6639 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6640 && built_in_decls[DECL_FUNCTION_CODE (t)])
6642 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6643 code = TREE_CODE (t);
6647 tclass = TREE_CODE_CLASS (code);
6649 if (tclass == tcc_declaration)
6651 /* DECL's have a unique ID */
6652 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6656 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6658 val = iterative_hash_object (code, val);
6660 /* Don't hash the type, that can lead to having nodes which
6661 compare equal according to operand_equal_p, but which
6662 have different hash codes. */
6663 if (CONVERT_EXPR_CODE_P (code)
6664 || code == NON_LVALUE_EXPR)
6666 /* Make sure to include signness in the hash computation. */
6667 val += TYPE_UNSIGNED (TREE_TYPE (t));
6668 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6671 else if (commutative_tree_code (code))
6673 /* It's a commutative expression. We want to hash it the same
6674 however it appears. We do this by first hashing both operands
6675 and then rehashing based on the order of their independent
6677 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6678 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6682 t = one, one = two, two = t;
6684 val = iterative_hash_hashval_t (one, val);
6685 val = iterative_hash_hashval_t (two, val);
6688 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6689 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6696 /* Generate a hash value for a pair of expressions. This can be used
6697 iteratively by passing a previous result as the VAL argument.
6699 The same hash value is always returned for a given pair of expressions,
6700 regardless of the order in which they are presented. This is useful in
6701 hashing the operands of commutative functions. */
6704 iterative_hash_exprs_commutative (const_tree t1,
6705 const_tree t2, hashval_t val)
6707 hashval_t one = iterative_hash_expr (t1, 0);
6708 hashval_t two = iterative_hash_expr (t2, 0);
6712 t = one, one = two, two = t;
6713 val = iterative_hash_hashval_t (one, val);
6714 val = iterative_hash_hashval_t (two, val);
6719 /* Constructors for pointer, array and function types.
6720 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6721 constructed by language-dependent code, not here.) */
6723 /* Construct, lay out and return the type of pointers to TO_TYPE with
6724 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6725 reference all of memory. If such a type has already been
6726 constructed, reuse it. */
6729 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6734 if (to_type == error_mark_node)
6735 return error_mark_node;
6737 /* If the pointed-to type has the may_alias attribute set, force
6738 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6739 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6740 can_alias_all = true;
6742 /* In some cases, languages will have things that aren't a POINTER_TYPE
6743 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6744 In that case, return that type without regard to the rest of our
6747 ??? This is a kludge, but consistent with the way this function has
6748 always operated and there doesn't seem to be a good way to avoid this
6750 if (TYPE_POINTER_TO (to_type) != 0
6751 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6752 return TYPE_POINTER_TO (to_type);
6754 /* First, if we already have a type for pointers to TO_TYPE and it's
6755 the proper mode, use it. */
6756 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6757 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6760 t = make_node (POINTER_TYPE);
6762 TREE_TYPE (t) = to_type;
6763 SET_TYPE_MODE (t, mode);
6764 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6765 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6766 TYPE_POINTER_TO (to_type) = t;
6768 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6769 SET_TYPE_STRUCTURAL_EQUALITY (t);
6770 else if (TYPE_CANONICAL (to_type) != to_type)
6772 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6773 mode, can_alias_all);
6775 /* Lay out the type. This function has many callers that are concerned
6776 with expression-construction, and this simplifies them all. */
6782 /* By default build pointers in ptr_mode. */
6785 build_pointer_type (tree to_type)
6787 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6788 : TYPE_ADDR_SPACE (to_type);
6789 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6790 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6793 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6796 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6801 if (to_type == error_mark_node)
6802 return error_mark_node;
6804 /* If the pointed-to type has the may_alias attribute set, force
6805 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6806 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6807 can_alias_all = true;
6809 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6810 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6811 In that case, return that type without regard to the rest of our
6814 ??? This is a kludge, but consistent with the way this function has
6815 always operated and there doesn't seem to be a good way to avoid this
6817 if (TYPE_REFERENCE_TO (to_type) != 0
6818 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6819 return TYPE_REFERENCE_TO (to_type);
6821 /* First, if we already have a type for pointers to TO_TYPE and it's
6822 the proper mode, use it. */
6823 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6824 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6827 t = make_node (REFERENCE_TYPE);
6829 TREE_TYPE (t) = to_type;
6830 SET_TYPE_MODE (t, mode);
6831 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6832 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6833 TYPE_REFERENCE_TO (to_type) = t;
6835 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6836 SET_TYPE_STRUCTURAL_EQUALITY (t);
6837 else if (TYPE_CANONICAL (to_type) != to_type)
6839 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6840 mode, can_alias_all);
6848 /* Build the node for the type of references-to-TO_TYPE by default
6852 build_reference_type (tree to_type)
6854 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6855 : TYPE_ADDR_SPACE (to_type);
6856 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6857 return build_reference_type_for_mode (to_type, pointer_mode, false);
6860 /* Build a type that is compatible with t but has no cv quals anywhere
6863 const char *const *const * -> char ***. */
6866 build_type_no_quals (tree t)
6868 switch (TREE_CODE (t))
6871 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6873 TYPE_REF_CAN_ALIAS_ALL (t));
6874 case REFERENCE_TYPE:
6876 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6878 TYPE_REF_CAN_ALIAS_ALL (t));
6880 return TYPE_MAIN_VARIANT (t);
6884 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6885 MAXVAL should be the maximum value in the domain
6886 (one less than the length of the array).
6888 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6889 We don't enforce this limit, that is up to caller (e.g. language front end).
6890 The limit exists because the result is a signed type and we don't handle
6891 sizes that use more than one HOST_WIDE_INT. */
6894 build_index_type (tree maxval)
6896 tree itype = make_node (INTEGER_TYPE);
6898 TREE_TYPE (itype) = sizetype;
6899 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6900 TYPE_MIN_VALUE (itype) = size_zero_node;
6901 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6902 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6903 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6904 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6905 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6906 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6908 if (host_integerp (maxval, 1))
6909 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6912 /* Since we cannot hash this type, we need to compare it using
6913 structural equality checks. */
6914 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6919 #define MAX_INT_CACHED_PREC \
6920 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6921 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
6923 /* Builds a signed or unsigned integer type of precision PRECISION.
6924 Used for C bitfields whose precision does not match that of
6925 built-in target types. */
6927 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6933 unsignedp = MAX_INT_CACHED_PREC + 1;
6935 if (precision <= MAX_INT_CACHED_PREC)
6937 itype = nonstandard_integer_type_cache[precision + unsignedp];
6942 itype = make_node (INTEGER_TYPE);
6943 TYPE_PRECISION (itype) = precision;
6946 fixup_unsigned_type (itype);
6948 fixup_signed_type (itype);
6951 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6952 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6953 if (precision <= MAX_INT_CACHED_PREC && lang_hooks.types.hash_types)
6954 nonstandard_integer_type_cache[precision + unsignedp] = ret;
6959 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6960 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6961 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6964 build_range_type (tree type, tree lowval, tree highval)
6966 tree itype = make_node (INTEGER_TYPE);
6968 TREE_TYPE (itype) = type;
6969 if (type == NULL_TREE)
6972 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6973 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6975 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6976 SET_TYPE_MODE (itype, TYPE_MODE (type));
6977 TYPE_SIZE (itype) = TYPE_SIZE (type);
6978 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6979 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6980 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6982 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6983 return type_hash_canon (tree_low_cst (highval, 0)
6984 - tree_low_cst (lowval, 0),
6990 /* Return true if the debug information for TYPE, a subtype, should be emitted
6991 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6992 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6993 debug info and doesn't reflect the source code. */
6996 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6998 tree base_type = TREE_TYPE (type), low, high;
7000 /* Subrange types have a base type which is an integral type. */
7001 if (!INTEGRAL_TYPE_P (base_type))
7004 /* Get the real bounds of the subtype. */
7005 if (lang_hooks.types.get_subrange_bounds)
7006 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7009 low = TYPE_MIN_VALUE (type);
7010 high = TYPE_MAX_VALUE (type);
7013 /* If the type and its base type have the same representation and the same
7014 name, then the type is not a subrange but a copy of the base type. */
7015 if ((TREE_CODE (base_type) == INTEGER_TYPE
7016 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7017 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7018 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7019 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7021 tree type_name = TYPE_NAME (type);
7022 tree base_type_name = TYPE_NAME (base_type);
7024 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7025 type_name = DECL_NAME (type_name);
7027 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7028 base_type_name = DECL_NAME (base_type_name);
7030 if (type_name == base_type_name)
7041 /* Just like build_index_type, but takes lowval and highval instead
7042 of just highval (maxval). */
7045 build_index_2_type (tree lowval, tree highval)
7047 return build_range_type (sizetype, lowval, highval);
7050 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7051 and number of elements specified by the range of values of INDEX_TYPE.
7052 If such a type has already been constructed, reuse it. */
7055 build_array_type (tree elt_type, tree index_type)
7058 hashval_t hashcode = 0;
7060 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7062 error ("arrays of functions are not meaningful");
7063 elt_type = integer_type_node;
7066 t = make_node (ARRAY_TYPE);
7067 TREE_TYPE (t) = elt_type;
7068 TYPE_DOMAIN (t) = index_type;
7069 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7072 /* If the element type is incomplete at this point we get marked for
7073 structural equality. Do not record these types in the canonical
7075 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7078 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7080 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7081 t = type_hash_canon (hashcode, t);
7083 if (TYPE_CANONICAL (t) == t)
7085 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7086 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7087 SET_TYPE_STRUCTURAL_EQUALITY (t);
7088 else if (TYPE_CANONICAL (elt_type) != elt_type
7089 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7091 = build_array_type (TYPE_CANONICAL (elt_type),
7092 index_type ? TYPE_CANONICAL (index_type) : NULL);
7098 /* Recursively examines the array elements of TYPE, until a non-array
7099 element type is found. */
7102 strip_array_types (tree type)
7104 while (TREE_CODE (type) == ARRAY_TYPE)
7105 type = TREE_TYPE (type);
7110 /* Computes the canonical argument types from the argument type list
7113 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7114 on entry to this function, or if any of the ARGTYPES are
7117 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7118 true on entry to this function, or if any of the ARGTYPES are
7121 Returns a canonical argument list, which may be ARGTYPES when the
7122 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7123 true) or would not differ from ARGTYPES. */
7126 maybe_canonicalize_argtypes(tree argtypes,
7127 bool *any_structural_p,
7128 bool *any_noncanonical_p)
7131 bool any_noncanonical_argtypes_p = false;
7133 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7135 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7136 /* Fail gracefully by stating that the type is structural. */
7137 *any_structural_p = true;
7138 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7139 *any_structural_p = true;
7140 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7141 || TREE_PURPOSE (arg))
7142 /* If the argument has a default argument, we consider it
7143 non-canonical even though the type itself is canonical.
7144 That way, different variants of function and method types
7145 with default arguments will all point to the variant with
7146 no defaults as their canonical type. */
7147 any_noncanonical_argtypes_p = true;
7150 if (*any_structural_p)
7153 if (any_noncanonical_argtypes_p)
7155 /* Build the canonical list of argument types. */
7156 tree canon_argtypes = NULL_TREE;
7157 bool is_void = false;
7159 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7161 if (arg == void_list_node)
7164 canon_argtypes = tree_cons (NULL_TREE,
7165 TYPE_CANONICAL (TREE_VALUE (arg)),
7169 canon_argtypes = nreverse (canon_argtypes);
7171 canon_argtypes = chainon (canon_argtypes, void_list_node);
7173 /* There is a non-canonical type. */
7174 *any_noncanonical_p = true;
7175 return canon_argtypes;
7178 /* The canonical argument types are the same as ARGTYPES. */
7182 /* Construct, lay out and return
7183 the type of functions returning type VALUE_TYPE
7184 given arguments of types ARG_TYPES.
7185 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7186 are data type nodes for the arguments of the function.
7187 If such a type has already been constructed, reuse it. */
7190 build_function_type (tree value_type, tree arg_types)
7193 hashval_t hashcode = 0;
7194 bool any_structural_p, any_noncanonical_p;
7195 tree canon_argtypes;
7197 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7199 error ("function return type cannot be function");
7200 value_type = integer_type_node;
7203 /* Make a node of the sort we want. */
7204 t = make_node (FUNCTION_TYPE);
7205 TREE_TYPE (t) = value_type;
7206 TYPE_ARG_TYPES (t) = arg_types;
7208 /* If we already have such a type, use the old one. */
7209 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7210 hashcode = type_hash_list (arg_types, hashcode);
7211 t = type_hash_canon (hashcode, t);
7213 /* Set up the canonical type. */
7214 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7215 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7216 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7218 &any_noncanonical_p);
7219 if (any_structural_p)
7220 SET_TYPE_STRUCTURAL_EQUALITY (t);
7221 else if (any_noncanonical_p)
7222 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7225 if (!COMPLETE_TYPE_P (t))
7230 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7233 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7235 tree new_type = NULL;
7236 tree args, new_args = NULL, t;
7240 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7241 args = TREE_CHAIN (args), i++)
7242 if (!bitmap_bit_p (args_to_skip, i))
7243 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7245 new_reversed = nreverse (new_args);
7249 TREE_CHAIN (new_args) = void_list_node;
7251 new_reversed = void_list_node;
7254 /* Use copy_node to preserve as much as possible from original type
7255 (debug info, attribute lists etc.)
7256 Exception is METHOD_TYPEs must have THIS argument.
7257 When we are asked to remove it, we need to build new FUNCTION_TYPE
7259 if (TREE_CODE (orig_type) != METHOD_TYPE
7260 || !bitmap_bit_p (args_to_skip, 0))
7262 new_type = copy_node (orig_type);
7263 TYPE_ARG_TYPES (new_type) = new_reversed;
7268 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7270 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7273 /* This is a new type, not a copy of an old type. Need to reassociate
7274 variants. We can handle everything except the main variant lazily. */
7275 t = TYPE_MAIN_VARIANT (orig_type);
7278 TYPE_MAIN_VARIANT (new_type) = t;
7279 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7280 TYPE_NEXT_VARIANT (t) = new_type;
7284 TYPE_MAIN_VARIANT (new_type) = new_type;
7285 TYPE_NEXT_VARIANT (new_type) = NULL;
7290 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7292 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7293 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7294 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7297 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7299 tree new_decl = copy_node (orig_decl);
7302 new_type = TREE_TYPE (orig_decl);
7303 if (prototype_p (new_type))
7304 new_type = build_function_type_skip_args (new_type, args_to_skip);
7305 TREE_TYPE (new_decl) = new_type;
7307 /* For declarations setting DECL_VINDEX (i.e. methods)
7308 we expect first argument to be THIS pointer. */
7309 if (bitmap_bit_p (args_to_skip, 0))
7310 DECL_VINDEX (new_decl) = NULL_TREE;
7314 /* Build a function type. The RETURN_TYPE is the type returned by the
7315 function. If VAARGS is set, no void_type_node is appended to the
7316 the list. ARGP must be always be terminated be a NULL_TREE. */
7319 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7323 t = va_arg (argp, tree);
7324 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7325 args = tree_cons (NULL_TREE, t, args);
7330 if (args != NULL_TREE)
7331 args = nreverse (args);
7332 gcc_assert (last != void_list_node);
7334 else if (args == NULL_TREE)
7335 args = void_list_node;
7339 args = nreverse (args);
7340 TREE_CHAIN (last) = void_list_node;
7342 args = build_function_type (return_type, args);
7347 /* Build a function type. The RETURN_TYPE is the type returned by the
7348 function. If additional arguments are provided, they are
7349 additional argument types. The list of argument types must always
7350 be terminated by NULL_TREE. */
7353 build_function_type_list (tree return_type, ...)
7358 va_start (p, return_type);
7359 args = build_function_type_list_1 (false, return_type, p);
7364 /* Build a variable argument function type. The RETURN_TYPE is the
7365 type returned by the function. If additional arguments are provided,
7366 they are additional argument types. The list of argument types must
7367 always be terminated by NULL_TREE. */
7370 build_varargs_function_type_list (tree return_type, ...)
7375 va_start (p, return_type);
7376 args = build_function_type_list_1 (true, return_type, p);
7382 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7383 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7384 for the method. An implicit additional parameter (of type
7385 pointer-to-BASETYPE) is added to the ARGTYPES. */
7388 build_method_type_directly (tree basetype,
7395 bool any_structural_p, any_noncanonical_p;
7396 tree canon_argtypes;
7398 /* Make a node of the sort we want. */
7399 t = make_node (METHOD_TYPE);
7401 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7402 TREE_TYPE (t) = rettype;
7403 ptype = build_pointer_type (basetype);
7405 /* The actual arglist for this function includes a "hidden" argument
7406 which is "this". Put it into the list of argument types. */
7407 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7408 TYPE_ARG_TYPES (t) = argtypes;
7410 /* If we already have such a type, use the old one. */
7411 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7412 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7413 hashcode = type_hash_list (argtypes, hashcode);
7414 t = type_hash_canon (hashcode, t);
7416 /* Set up the canonical type. */
7418 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7419 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7421 = (TYPE_CANONICAL (basetype) != basetype
7422 || TYPE_CANONICAL (rettype) != rettype);
7423 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7425 &any_noncanonical_p);
7426 if (any_structural_p)
7427 SET_TYPE_STRUCTURAL_EQUALITY (t);
7428 else if (any_noncanonical_p)
7430 = build_method_type_directly (TYPE_CANONICAL (basetype),
7431 TYPE_CANONICAL (rettype),
7433 if (!COMPLETE_TYPE_P (t))
7439 /* Construct, lay out and return the type of methods belonging to class
7440 BASETYPE and whose arguments and values are described by TYPE.
7441 If that type exists already, reuse it.
7442 TYPE must be a FUNCTION_TYPE node. */
7445 build_method_type (tree basetype, tree type)
7447 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7449 return build_method_type_directly (basetype,
7451 TYPE_ARG_TYPES (type));
7454 /* Construct, lay out and return the type of offsets to a value
7455 of type TYPE, within an object of type BASETYPE.
7456 If a suitable offset type exists already, reuse it. */
7459 build_offset_type (tree basetype, tree type)
7462 hashval_t hashcode = 0;
7464 /* Make a node of the sort we want. */
7465 t = make_node (OFFSET_TYPE);
7467 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7468 TREE_TYPE (t) = type;
7470 /* If we already have such a type, use the old one. */
7471 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7472 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7473 t = type_hash_canon (hashcode, t);
7475 if (!COMPLETE_TYPE_P (t))
7478 if (TYPE_CANONICAL (t) == t)
7480 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7481 || TYPE_STRUCTURAL_EQUALITY_P (type))
7482 SET_TYPE_STRUCTURAL_EQUALITY (t);
7483 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7484 || TYPE_CANONICAL (type) != type)
7486 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7487 TYPE_CANONICAL (type));
7493 /* Create a complex type whose components are COMPONENT_TYPE. */
7496 build_complex_type (tree component_type)
7501 gcc_assert (INTEGRAL_TYPE_P (component_type)
7502 || SCALAR_FLOAT_TYPE_P (component_type)
7503 || FIXED_POINT_TYPE_P (component_type));
7505 /* Make a node of the sort we want. */
7506 t = make_node (COMPLEX_TYPE);
7508 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7510 /* If we already have such a type, use the old one. */
7511 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7512 t = type_hash_canon (hashcode, t);
7514 if (!COMPLETE_TYPE_P (t))
7517 if (TYPE_CANONICAL (t) == t)
7519 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7520 SET_TYPE_STRUCTURAL_EQUALITY (t);
7521 else if (TYPE_CANONICAL (component_type) != component_type)
7523 = build_complex_type (TYPE_CANONICAL (component_type));
7526 /* We need to create a name, since complex is a fundamental type. */
7527 if (! TYPE_NAME (t))
7530 if (component_type == char_type_node)
7531 name = "complex char";
7532 else if (component_type == signed_char_type_node)
7533 name = "complex signed char";
7534 else if (component_type == unsigned_char_type_node)
7535 name = "complex unsigned char";
7536 else if (component_type == short_integer_type_node)
7537 name = "complex short int";
7538 else if (component_type == short_unsigned_type_node)
7539 name = "complex short unsigned int";
7540 else if (component_type == integer_type_node)
7541 name = "complex int";
7542 else if (component_type == unsigned_type_node)
7543 name = "complex unsigned int";
7544 else if (component_type == long_integer_type_node)
7545 name = "complex long int";
7546 else if (component_type == long_unsigned_type_node)
7547 name = "complex long unsigned int";
7548 else if (component_type == long_long_integer_type_node)
7549 name = "complex long long int";
7550 else if (component_type == long_long_unsigned_type_node)
7551 name = "complex long long unsigned int";
7556 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7557 get_identifier (name), t);
7560 return build_qualified_type (t, TYPE_QUALS (component_type));
7563 /* If TYPE is a real or complex floating-point type and the target
7564 does not directly support arithmetic on TYPE then return the wider
7565 type to be used for arithmetic on TYPE. Otherwise, return
7569 excess_precision_type (tree type)
7571 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7573 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7574 switch (TREE_CODE (type))
7577 switch (flt_eval_method)
7580 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7581 return double_type_node;
7584 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7585 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7586 return long_double_type_node;
7593 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7595 switch (flt_eval_method)
7598 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7599 return complex_double_type_node;
7602 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7603 || (TYPE_MODE (TREE_TYPE (type))
7604 == TYPE_MODE (double_type_node)))
7605 return complex_long_double_type_node;
7618 /* Return OP, stripped of any conversions to wider types as much as is safe.
7619 Converting the value back to OP's type makes a value equivalent to OP.
7621 If FOR_TYPE is nonzero, we return a value which, if converted to
7622 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7624 OP must have integer, real or enumeral type. Pointers are not allowed!
7626 There are some cases where the obvious value we could return
7627 would regenerate to OP if converted to OP's type,
7628 but would not extend like OP to wider types.
7629 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7630 For example, if OP is (unsigned short)(signed char)-1,
7631 we avoid returning (signed char)-1 if FOR_TYPE is int,
7632 even though extending that to an unsigned short would regenerate OP,
7633 since the result of extending (signed char)-1 to (int)
7634 is different from (int) OP. */
7637 get_unwidened (tree op, tree for_type)
7639 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7640 tree type = TREE_TYPE (op);
7642 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7644 = (for_type != 0 && for_type != type
7645 && final_prec > TYPE_PRECISION (type)
7646 && TYPE_UNSIGNED (type));
7649 while (CONVERT_EXPR_P (op))
7653 /* TYPE_PRECISION on vector types has different meaning
7654 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7655 so avoid them here. */
7656 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7659 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7660 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7662 /* Truncations are many-one so cannot be removed.
7663 Unless we are later going to truncate down even farther. */
7665 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7668 /* See what's inside this conversion. If we decide to strip it,
7670 op = TREE_OPERAND (op, 0);
7672 /* If we have not stripped any zero-extensions (uns is 0),
7673 we can strip any kind of extension.
7674 If we have previously stripped a zero-extension,
7675 only zero-extensions can safely be stripped.
7676 Any extension can be stripped if the bits it would produce
7677 are all going to be discarded later by truncating to FOR_TYPE. */
7681 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7683 /* TYPE_UNSIGNED says whether this is a zero-extension.
7684 Let's avoid computing it if it does not affect WIN
7685 and if UNS will not be needed again. */
7687 || CONVERT_EXPR_P (op))
7688 && TYPE_UNSIGNED (TREE_TYPE (op)))
7696 /* If we finally reach a constant see if it fits in for_type and
7697 in that case convert it. */
7699 && TREE_CODE (win) == INTEGER_CST
7700 && TREE_TYPE (win) != for_type
7701 && int_fits_type_p (win, for_type))
7702 win = fold_convert (for_type, win);
7707 /* Return OP or a simpler expression for a narrower value
7708 which can be sign-extended or zero-extended to give back OP.
7709 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7710 or 0 if the value should be sign-extended. */
7713 get_narrower (tree op, int *unsignedp_ptr)
7718 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7720 while (TREE_CODE (op) == NOP_EXPR)
7723 = (TYPE_PRECISION (TREE_TYPE (op))
7724 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7726 /* Truncations are many-one so cannot be removed. */
7730 /* See what's inside this conversion. If we decide to strip it,
7735 op = TREE_OPERAND (op, 0);
7736 /* An extension: the outermost one can be stripped,
7737 but remember whether it is zero or sign extension. */
7739 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7740 /* Otherwise, if a sign extension has been stripped,
7741 only sign extensions can now be stripped;
7742 if a zero extension has been stripped, only zero-extensions. */
7743 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7747 else /* bitschange == 0 */
7749 /* A change in nominal type can always be stripped, but we must
7750 preserve the unsignedness. */
7752 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7754 op = TREE_OPERAND (op, 0);
7755 /* Keep trying to narrow, but don't assign op to win if it
7756 would turn an integral type into something else. */
7757 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7764 if (TREE_CODE (op) == COMPONENT_REF
7765 /* Since type_for_size always gives an integer type. */
7766 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7767 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7768 /* Ensure field is laid out already. */
7769 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7770 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7772 unsigned HOST_WIDE_INT innerprec
7773 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7774 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7775 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7776 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7778 /* We can get this structure field in a narrower type that fits it,
7779 but the resulting extension to its nominal type (a fullword type)
7780 must satisfy the same conditions as for other extensions.
7782 Do this only for fields that are aligned (not bit-fields),
7783 because when bit-field insns will be used there is no
7784 advantage in doing this. */
7786 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7787 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7788 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7792 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7793 win = fold_convert (type, op);
7797 *unsignedp_ptr = uns;
7801 /* Nonzero if integer constant C has a value that is permissible
7802 for type TYPE (an INTEGER_TYPE). */
7805 int_fits_type_p (const_tree c, const_tree type)
7807 tree type_low_bound, type_high_bound;
7808 bool ok_for_low_bound, ok_for_high_bound, unsc;
7811 dc = tree_to_double_int (c);
7812 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7814 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7815 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7817 /* So c is an unsigned integer whose type is sizetype and type is not.
7818 sizetype'd integers are sign extended even though they are
7819 unsigned. If the integer value fits in the lower end word of c,
7820 and if the higher end word has all its bits set to 1, that
7821 means the higher end bits are set to 1 only for sign extension.
7822 So let's convert c into an equivalent zero extended unsigned
7824 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7827 type_low_bound = TYPE_MIN_VALUE (type);
7828 type_high_bound = TYPE_MAX_VALUE (type);
7830 /* If at least one bound of the type is a constant integer, we can check
7831 ourselves and maybe make a decision. If no such decision is possible, but
7832 this type is a subtype, try checking against that. Otherwise, use
7833 fit_double_type, which checks against the precision.
7835 Compute the status for each possibly constant bound, and return if we see
7836 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7837 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7838 for "constant known to fit". */
7840 /* Check if c >= type_low_bound. */
7841 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7843 dd = tree_to_double_int (type_low_bound);
7844 if (TREE_CODE (type) == INTEGER_TYPE
7845 && TYPE_IS_SIZETYPE (type)
7846 && TYPE_UNSIGNED (type))
7847 dd = double_int_zext (dd, TYPE_PRECISION (type));
7848 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7850 int c_neg = (!unsc && double_int_negative_p (dc));
7851 int t_neg = (unsc && double_int_negative_p (dd));
7853 if (c_neg && !t_neg)
7855 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7858 else if (double_int_cmp (dc, dd, unsc) < 0)
7860 ok_for_low_bound = true;
7863 ok_for_low_bound = false;
7865 /* Check if c <= type_high_bound. */
7866 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7868 dd = tree_to_double_int (type_high_bound);
7869 if (TREE_CODE (type) == INTEGER_TYPE
7870 && TYPE_IS_SIZETYPE (type)
7871 && TYPE_UNSIGNED (type))
7872 dd = double_int_zext (dd, TYPE_PRECISION (type));
7873 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7875 int c_neg = (!unsc && double_int_negative_p (dc));
7876 int t_neg = (unsc && double_int_negative_p (dd));
7878 if (t_neg && !c_neg)
7880 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7883 else if (double_int_cmp (dc, dd, unsc) > 0)
7885 ok_for_high_bound = true;
7888 ok_for_high_bound = false;
7890 /* If the constant fits both bounds, the result is known. */
7891 if (ok_for_low_bound && ok_for_high_bound)
7894 /* Perform some generic filtering which may allow making a decision
7895 even if the bounds are not constant. First, negative integers
7896 never fit in unsigned types, */
7897 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7900 /* Second, narrower types always fit in wider ones. */
7901 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7904 /* Third, unsigned integers with top bit set never fit signed types. */
7905 if (! TYPE_UNSIGNED (type) && unsc)
7907 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7908 if (prec < HOST_BITS_PER_WIDE_INT)
7910 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7913 else if (((((unsigned HOST_WIDE_INT) 1)
7914 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7918 /* If we haven't been able to decide at this point, there nothing more we
7919 can check ourselves here. Look at the base type if we have one and it
7920 has the same precision. */
7921 if (TREE_CODE (type) == INTEGER_TYPE
7922 && TREE_TYPE (type) != 0
7923 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7925 type = TREE_TYPE (type);
7929 /* Or to fit_double_type, if nothing else. */
7930 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7933 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7934 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7935 represented (assuming two's-complement arithmetic) within the bit
7936 precision of the type are returned instead. */
7939 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7941 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7942 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7943 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7944 TYPE_UNSIGNED (type));
7947 if (TYPE_UNSIGNED (type))
7948 mpz_set_ui (min, 0);
7952 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7953 mn = double_int_sext (double_int_add (mn, double_int_one),
7954 TYPE_PRECISION (type));
7955 mpz_set_double_int (min, mn, false);
7959 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7960 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7961 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7962 TYPE_UNSIGNED (type));
7965 if (TYPE_UNSIGNED (type))
7966 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7969 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7974 /* Return true if VAR is an automatic variable defined in function FN. */
7977 auto_var_in_fn_p (const_tree var, const_tree fn)
7979 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7980 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
7981 || TREE_CODE (var) == PARM_DECL)
7982 && ! TREE_STATIC (var))
7983 || TREE_CODE (var) == LABEL_DECL
7984 || TREE_CODE (var) == RESULT_DECL));
7987 /* Subprogram of following function. Called by walk_tree.
7989 Return *TP if it is an automatic variable or parameter of the
7990 function passed in as DATA. */
7993 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7995 tree fn = (tree) data;
8000 else if (DECL_P (*tp)
8001 && auto_var_in_fn_p (*tp, fn))
8007 /* Returns true if T is, contains, or refers to a type with variable
8008 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8009 arguments, but not the return type. If FN is nonzero, only return
8010 true if a modifier of the type or position of FN is a variable or
8011 parameter inside FN.
8013 This concept is more general than that of C99 'variably modified types':
8014 in C99, a struct type is never variably modified because a VLA may not
8015 appear as a structure member. However, in GNU C code like:
8017 struct S { int i[f()]; };
8019 is valid, and other languages may define similar constructs. */
8022 variably_modified_type_p (tree type, tree fn)
8026 /* Test if T is either variable (if FN is zero) or an expression containing
8027 a variable in FN. */
8028 #define RETURN_TRUE_IF_VAR(T) \
8029 do { tree _t = (T); \
8030 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8031 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8032 return true; } while (0)
8034 if (type == error_mark_node)
8037 /* If TYPE itself has variable size, it is variably modified. */
8038 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8039 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8041 switch (TREE_CODE (type))
8044 case REFERENCE_TYPE:
8046 if (variably_modified_type_p (TREE_TYPE (type), fn))
8052 /* If TYPE is a function type, it is variably modified if the
8053 return type is variably modified. */
8054 if (variably_modified_type_p (TREE_TYPE (type), fn))
8060 case FIXED_POINT_TYPE:
8063 /* Scalar types are variably modified if their end points
8065 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8066 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8071 case QUAL_UNION_TYPE:
8072 /* We can't see if any of the fields are variably-modified by the
8073 definition we normally use, since that would produce infinite
8074 recursion via pointers. */
8075 /* This is variably modified if some field's type is. */
8076 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8077 if (TREE_CODE (t) == FIELD_DECL)
8079 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8080 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8081 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8083 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8084 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8089 /* Do not call ourselves to avoid infinite recursion. This is
8090 variably modified if the element type is. */
8091 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8092 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8099 /* The current language may have other cases to check, but in general,
8100 all other types are not variably modified. */
8101 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8103 #undef RETURN_TRUE_IF_VAR
8106 /* Given a DECL or TYPE, return the scope in which it was declared, or
8107 NULL_TREE if there is no containing scope. */
8110 get_containing_scope (const_tree t)
8112 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8115 /* Return the innermost context enclosing DECL that is
8116 a FUNCTION_DECL, or zero if none. */
8119 decl_function_context (const_tree decl)
8123 if (TREE_CODE (decl) == ERROR_MARK)
8126 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8127 where we look up the function at runtime. Such functions always take
8128 a first argument of type 'pointer to real context'.
8130 C++ should really be fixed to use DECL_CONTEXT for the real context,
8131 and use something else for the "virtual context". */
8132 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8135 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8137 context = DECL_CONTEXT (decl);
8139 while (context && TREE_CODE (context) != FUNCTION_DECL)
8141 if (TREE_CODE (context) == BLOCK)
8142 context = BLOCK_SUPERCONTEXT (context);
8144 context = get_containing_scope (context);
8150 /* Return the innermost context enclosing DECL that is
8151 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8152 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8155 decl_type_context (const_tree decl)
8157 tree context = DECL_CONTEXT (decl);
8160 switch (TREE_CODE (context))
8162 case NAMESPACE_DECL:
8163 case TRANSLATION_UNIT_DECL:
8168 case QUAL_UNION_TYPE:
8173 context = DECL_CONTEXT (context);
8177 context = BLOCK_SUPERCONTEXT (context);
8187 /* CALL is a CALL_EXPR. Return the declaration for the function
8188 called, or NULL_TREE if the called function cannot be
8192 get_callee_fndecl (const_tree call)
8196 if (call == error_mark_node)
8197 return error_mark_node;
8199 /* It's invalid to call this function with anything but a
8201 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8203 /* The first operand to the CALL is the address of the function
8205 addr = CALL_EXPR_FN (call);
8209 /* If this is a readonly function pointer, extract its initial value. */
8210 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8211 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8212 && DECL_INITIAL (addr))
8213 addr = DECL_INITIAL (addr);
8215 /* If the address is just `&f' for some function `f', then we know
8216 that `f' is being called. */
8217 if (TREE_CODE (addr) == ADDR_EXPR
8218 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8219 return TREE_OPERAND (addr, 0);
8221 /* We couldn't figure out what was being called. */
8225 /* Print debugging information about tree nodes generated during the compile,
8226 and any language-specific information. */
8229 dump_tree_statistics (void)
8231 #ifdef GATHER_STATISTICS
8233 int total_nodes, total_bytes;
8236 fprintf (stderr, "\n??? tree nodes created\n\n");
8237 #ifdef GATHER_STATISTICS
8238 fprintf (stderr, "Kind Nodes Bytes\n");
8239 fprintf (stderr, "---------------------------------------\n");
8240 total_nodes = total_bytes = 0;
8241 for (i = 0; i < (int) all_kinds; i++)
8243 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8244 tree_node_counts[i], tree_node_sizes[i]);
8245 total_nodes += tree_node_counts[i];
8246 total_bytes += tree_node_sizes[i];
8248 fprintf (stderr, "---------------------------------------\n");
8249 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8250 fprintf (stderr, "---------------------------------------\n");
8251 ssanames_print_statistics ();
8252 phinodes_print_statistics ();
8254 fprintf (stderr, "(No per-node statistics)\n");
8256 print_type_hash_statistics ();
8257 print_debug_expr_statistics ();
8258 print_value_expr_statistics ();
8259 lang_hooks.print_statistics ();
8262 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8264 /* Generate a crc32 of a string. */
8267 crc32_string (unsigned chksum, const char *string)
8271 unsigned value = *string << 24;
8274 for (ix = 8; ix--; value <<= 1)
8278 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8287 /* P is a string that will be used in a symbol. Mask out any characters
8288 that are not valid in that context. */
8291 clean_symbol_name (char *p)
8295 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8298 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8305 /* Generate a name for a special-purpose function function.
8306 The generated name may need to be unique across the whole link.
8307 TYPE is some string to identify the purpose of this function to the
8308 linker or collect2; it must start with an uppercase letter,
8310 I - for constructors
8312 N - for C++ anonymous namespaces
8313 F - for DWARF unwind frame information. */
8316 get_file_function_name (const char *type)
8322 /* If we already have a name we know to be unique, just use that. */
8323 if (first_global_object_name)
8324 p = q = ASTRDUP (first_global_object_name);
8325 /* If the target is handling the constructors/destructors, they
8326 will be local to this file and the name is only necessary for
8327 debugging purposes. */
8328 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8330 const char *file = main_input_filename;
8332 file = input_filename;
8333 /* Just use the file's basename, because the full pathname
8334 might be quite long. */
8335 p = strrchr (file, '/');
8340 p = q = ASTRDUP (p);
8344 /* Otherwise, the name must be unique across the entire link.
8345 We don't have anything that we know to be unique to this translation
8346 unit, so use what we do have and throw in some randomness. */
8348 const char *name = weak_global_object_name;
8349 const char *file = main_input_filename;
8354 file = input_filename;
8356 len = strlen (file);
8357 q = (char *) alloca (9 * 2 + len + 1);
8358 memcpy (q, file, len + 1);
8360 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8361 crc32_string (0, get_random_seed (false)));
8366 clean_symbol_name (q);
8367 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8370 /* Set up the name of the file-level functions we may need.
8371 Use a global object (which is already required to be unique over
8372 the program) rather than the file name (which imposes extra
8374 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8376 return get_identifier (buf);
8379 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8381 /* Complain that the tree code of NODE does not match the expected 0
8382 terminated list of trailing codes. The trailing code list can be
8383 empty, for a more vague error message. FILE, LINE, and FUNCTION
8384 are of the caller. */
8387 tree_check_failed (const_tree node, const char *file,
8388 int line, const char *function, ...)
8392 unsigned length = 0;
8395 va_start (args, function);
8396 while ((code = va_arg (args, int)))
8397 length += 4 + strlen (tree_code_name[code]);
8402 va_start (args, function);
8403 length += strlen ("expected ");
8404 buffer = tmp = (char *) alloca (length);
8406 while ((code = va_arg (args, int)))
8408 const char *prefix = length ? " or " : "expected ";
8410 strcpy (tmp + length, prefix);
8411 length += strlen (prefix);
8412 strcpy (tmp + length, tree_code_name[code]);
8413 length += strlen (tree_code_name[code]);
8418 buffer = "unexpected node";
8420 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8421 buffer, tree_code_name[TREE_CODE (node)],
8422 function, trim_filename (file), line);
8425 /* Complain that the tree code of NODE does match the expected 0
8426 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8430 tree_not_check_failed (const_tree node, const char *file,
8431 int line, const char *function, ...)
8435 unsigned length = 0;
8438 va_start (args, function);
8439 while ((code = va_arg (args, int)))
8440 length += 4 + strlen (tree_code_name[code]);
8442 va_start (args, function);
8443 buffer = (char *) alloca (length);
8445 while ((code = va_arg (args, int)))
8449 strcpy (buffer + length, " or ");
8452 strcpy (buffer + length, tree_code_name[code]);
8453 length += strlen (tree_code_name[code]);
8457 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8458 buffer, tree_code_name[TREE_CODE (node)],
8459 function, trim_filename (file), line);
8462 /* Similar to tree_check_failed, except that we check for a class of tree
8463 code, given in CL. */
8466 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8467 const char *file, int line, const char *function)
8470 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8471 TREE_CODE_CLASS_STRING (cl),
8472 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8473 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8476 /* Similar to tree_check_failed, except that instead of specifying a
8477 dozen codes, use the knowledge that they're all sequential. */
8480 tree_range_check_failed (const_tree node, const char *file, int line,
8481 const char *function, enum tree_code c1,
8485 unsigned length = 0;
8488 for (c = c1; c <= c2; ++c)
8489 length += 4 + strlen (tree_code_name[c]);
8491 length += strlen ("expected ");
8492 buffer = (char *) alloca (length);
8495 for (c = c1; c <= c2; ++c)
8497 const char *prefix = length ? " or " : "expected ";
8499 strcpy (buffer + length, prefix);
8500 length += strlen (prefix);
8501 strcpy (buffer + length, tree_code_name[c]);
8502 length += strlen (tree_code_name[c]);
8505 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8506 buffer, tree_code_name[TREE_CODE (node)],
8507 function, trim_filename (file), line);
8511 /* Similar to tree_check_failed, except that we check that a tree does
8512 not have the specified code, given in CL. */
8515 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8516 const char *file, int line, const char *function)
8519 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8520 TREE_CODE_CLASS_STRING (cl),
8521 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8522 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8526 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8529 omp_clause_check_failed (const_tree node, const char *file, int line,
8530 const char *function, enum omp_clause_code code)
8532 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8533 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8534 function, trim_filename (file), line);
8538 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8541 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8542 const char *function, enum omp_clause_code c1,
8543 enum omp_clause_code c2)
8546 unsigned length = 0;
8549 for (c = c1; c <= c2; ++c)
8550 length += 4 + strlen (omp_clause_code_name[c]);
8552 length += strlen ("expected ");
8553 buffer = (char *) alloca (length);
8556 for (c = c1; c <= c2; ++c)
8558 const char *prefix = length ? " or " : "expected ";
8560 strcpy (buffer + length, prefix);
8561 length += strlen (prefix);
8562 strcpy (buffer + length, omp_clause_code_name[c]);
8563 length += strlen (omp_clause_code_name[c]);
8566 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8567 buffer, omp_clause_code_name[TREE_CODE (node)],
8568 function, trim_filename (file), line);
8572 #undef DEFTREESTRUCT
8573 #define DEFTREESTRUCT(VAL, NAME) NAME,
8575 static const char *ts_enum_names[] = {
8576 #include "treestruct.def"
8578 #undef DEFTREESTRUCT
8580 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8582 /* Similar to tree_class_check_failed, except that we check for
8583 whether CODE contains the tree structure identified by EN. */
8586 tree_contains_struct_check_failed (const_tree node,
8587 const enum tree_node_structure_enum en,
8588 const char *file, int line,
8589 const char *function)
8592 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8594 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8598 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8599 (dynamically sized) vector. */
8602 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8603 const char *function)
8606 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8607 idx + 1, len, function, trim_filename (file), line);
8610 /* Similar to above, except that the check is for the bounds of the operand
8611 vector of an expression node EXP. */
8614 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8615 int line, const char *function)
8617 int code = TREE_CODE (exp);
8619 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8620 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8621 function, trim_filename (file), line);
8624 /* Similar to above, except that the check is for the number of
8625 operands of an OMP_CLAUSE node. */
8628 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8629 int line, const char *function)
8632 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8633 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8634 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8635 trim_filename (file), line);
8637 #endif /* ENABLE_TREE_CHECKING */
8639 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8640 and mapped to the machine mode MODE. Initialize its fields and build
8641 the information necessary for debugging output. */
8644 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8647 hashval_t hashcode = 0;
8649 t = make_node (VECTOR_TYPE);
8650 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8651 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8652 SET_TYPE_MODE (t, mode);
8654 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8655 SET_TYPE_STRUCTURAL_EQUALITY (t);
8656 else if (TYPE_CANONICAL (innertype) != innertype
8657 || mode != VOIDmode)
8659 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8664 tree index = build_int_cst (NULL_TREE, nunits - 1);
8665 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8666 build_index_type (index));
8667 tree rt = make_node (RECORD_TYPE);
8669 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8670 get_identifier ("f"), array);
8671 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8673 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8674 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8675 the representation type, and we want to find that die when looking up
8676 the vector type. This is most easily achieved by making the TYPE_UID
8678 TYPE_UID (rt) = TYPE_UID (t);
8681 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8682 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8683 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8684 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8685 t = type_hash_canon (hashcode, t);
8687 /* We have built a main variant, based on the main variant of the
8688 inner type. Use it to build the variant we return. */
8689 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8690 && TREE_TYPE (t) != innertype)
8691 return build_type_attribute_qual_variant (t,
8692 TYPE_ATTRIBUTES (innertype),
8693 TYPE_QUALS (innertype));
8699 make_or_reuse_type (unsigned size, int unsignedp)
8701 if (size == INT_TYPE_SIZE)
8702 return unsignedp ? unsigned_type_node : integer_type_node;
8703 if (size == CHAR_TYPE_SIZE)
8704 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8705 if (size == SHORT_TYPE_SIZE)
8706 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8707 if (size == LONG_TYPE_SIZE)
8708 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8709 if (size == LONG_LONG_TYPE_SIZE)
8710 return (unsignedp ? long_long_unsigned_type_node
8711 : long_long_integer_type_node);
8714 return make_unsigned_type (size);
8716 return make_signed_type (size);
8719 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8722 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8726 if (size == SHORT_FRACT_TYPE_SIZE)
8727 return unsignedp ? sat_unsigned_short_fract_type_node
8728 : sat_short_fract_type_node;
8729 if (size == FRACT_TYPE_SIZE)
8730 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8731 if (size == LONG_FRACT_TYPE_SIZE)
8732 return unsignedp ? sat_unsigned_long_fract_type_node
8733 : sat_long_fract_type_node;
8734 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8735 return unsignedp ? sat_unsigned_long_long_fract_type_node
8736 : sat_long_long_fract_type_node;
8740 if (size == SHORT_FRACT_TYPE_SIZE)
8741 return unsignedp ? unsigned_short_fract_type_node
8742 : short_fract_type_node;
8743 if (size == FRACT_TYPE_SIZE)
8744 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8745 if (size == LONG_FRACT_TYPE_SIZE)
8746 return unsignedp ? unsigned_long_fract_type_node
8747 : long_fract_type_node;
8748 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8749 return unsignedp ? unsigned_long_long_fract_type_node
8750 : long_long_fract_type_node;
8753 return make_fract_type (size, unsignedp, satp);
8756 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8759 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8763 if (size == SHORT_ACCUM_TYPE_SIZE)
8764 return unsignedp ? sat_unsigned_short_accum_type_node
8765 : sat_short_accum_type_node;
8766 if (size == ACCUM_TYPE_SIZE)
8767 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8768 if (size == LONG_ACCUM_TYPE_SIZE)
8769 return unsignedp ? sat_unsigned_long_accum_type_node
8770 : sat_long_accum_type_node;
8771 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8772 return unsignedp ? sat_unsigned_long_long_accum_type_node
8773 : sat_long_long_accum_type_node;
8777 if (size == SHORT_ACCUM_TYPE_SIZE)
8778 return unsignedp ? unsigned_short_accum_type_node
8779 : short_accum_type_node;
8780 if (size == ACCUM_TYPE_SIZE)
8781 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8782 if (size == LONG_ACCUM_TYPE_SIZE)
8783 return unsignedp ? unsigned_long_accum_type_node
8784 : long_accum_type_node;
8785 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8786 return unsignedp ? unsigned_long_long_accum_type_node
8787 : long_long_accum_type_node;
8790 return make_accum_type (size, unsignedp, satp);
8793 /* Create nodes for all integer types (and error_mark_node) using the sizes
8794 of C datatypes. The caller should call set_sizetype soon after calling
8795 this function to select one of the types as sizetype. */
8798 build_common_tree_nodes (bool signed_char)
8800 error_mark_node = make_node (ERROR_MARK);
8801 TREE_TYPE (error_mark_node) = error_mark_node;
8803 initialize_sizetypes ();
8805 /* Define both `signed char' and `unsigned char'. */
8806 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8807 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8808 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8809 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8811 /* Define `char', which is like either `signed char' or `unsigned char'
8812 but not the same as either. */
8815 ? make_signed_type (CHAR_TYPE_SIZE)
8816 : make_unsigned_type (CHAR_TYPE_SIZE));
8817 TYPE_STRING_FLAG (char_type_node) = 1;
8819 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8820 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8821 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8822 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8823 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8824 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8825 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8826 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8828 /* Define a boolean type. This type only represents boolean values but
8829 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8830 Front ends which want to override this size (i.e. Java) can redefine
8831 boolean_type_node before calling build_common_tree_nodes_2. */
8832 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8833 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8834 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8835 TYPE_PRECISION (boolean_type_node) = 1;
8837 /* Fill in the rest of the sized types. Reuse existing type nodes
8839 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8840 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8841 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8842 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8843 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8845 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8846 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8847 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8848 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8849 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8851 access_public_node = get_identifier ("public");
8852 access_protected_node = get_identifier ("protected");
8853 access_private_node = get_identifier ("private");
8856 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8857 It will create several other common tree nodes. */
8860 build_common_tree_nodes_2 (int short_double)
8862 /* Define these next since types below may used them. */
8863 integer_zero_node = build_int_cst (NULL_TREE, 0);
8864 integer_one_node = build_int_cst (NULL_TREE, 1);
8865 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8867 size_zero_node = size_int (0);
8868 size_one_node = size_int (1);
8869 bitsize_zero_node = bitsize_int (0);
8870 bitsize_one_node = bitsize_int (1);
8871 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8873 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8874 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8876 void_type_node = make_node (VOID_TYPE);
8877 layout_type (void_type_node);
8879 /* We are not going to have real types in C with less than byte alignment,
8880 so we might as well not have any types that claim to have it. */
8881 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8882 TYPE_USER_ALIGN (void_type_node) = 0;
8884 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8885 layout_type (TREE_TYPE (null_pointer_node));
8887 ptr_type_node = build_pointer_type (void_type_node);
8889 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8890 fileptr_type_node = ptr_type_node;
8892 float_type_node = make_node (REAL_TYPE);
8893 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8894 layout_type (float_type_node);
8896 double_type_node = make_node (REAL_TYPE);
8898 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8900 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8901 layout_type (double_type_node);
8903 long_double_type_node = make_node (REAL_TYPE);
8904 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8905 layout_type (long_double_type_node);
8907 float_ptr_type_node = build_pointer_type (float_type_node);
8908 double_ptr_type_node = build_pointer_type (double_type_node);
8909 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8910 integer_ptr_type_node = build_pointer_type (integer_type_node);
8912 /* Fixed size integer types. */
8913 uint32_type_node = build_nonstandard_integer_type (32, true);
8914 uint64_type_node = build_nonstandard_integer_type (64, true);
8916 /* Decimal float types. */
8917 dfloat32_type_node = make_node (REAL_TYPE);
8918 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8919 layout_type (dfloat32_type_node);
8920 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8921 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8923 dfloat64_type_node = make_node (REAL_TYPE);
8924 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8925 layout_type (dfloat64_type_node);
8926 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8927 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8929 dfloat128_type_node = make_node (REAL_TYPE);
8930 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8931 layout_type (dfloat128_type_node);
8932 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8933 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8935 complex_integer_type_node = build_complex_type (integer_type_node);
8936 complex_float_type_node = build_complex_type (float_type_node);
8937 complex_double_type_node = build_complex_type (double_type_node);
8938 complex_long_double_type_node = build_complex_type (long_double_type_node);
8940 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8941 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8942 sat_ ## KIND ## _type_node = \
8943 make_sat_signed_ ## KIND ## _type (SIZE); \
8944 sat_unsigned_ ## KIND ## _type_node = \
8945 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8946 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8947 unsigned_ ## KIND ## _type_node = \
8948 make_unsigned_ ## KIND ## _type (SIZE);
8950 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8951 sat_ ## WIDTH ## KIND ## _type_node = \
8952 make_sat_signed_ ## KIND ## _type (SIZE); \
8953 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8954 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8955 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8956 unsigned_ ## WIDTH ## KIND ## _type_node = \
8957 make_unsigned_ ## KIND ## _type (SIZE);
8959 /* Make fixed-point type nodes based on four different widths. */
8960 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8961 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8962 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8963 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8964 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8966 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8967 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8968 NAME ## _type_node = \
8969 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8970 u ## NAME ## _type_node = \
8971 make_or_reuse_unsigned_ ## KIND ## _type \
8972 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8973 sat_ ## NAME ## _type_node = \
8974 make_or_reuse_sat_signed_ ## KIND ## _type \
8975 (GET_MODE_BITSIZE (MODE ## mode)); \
8976 sat_u ## NAME ## _type_node = \
8977 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8978 (GET_MODE_BITSIZE (U ## MODE ## mode));
8980 /* Fixed-point type and mode nodes. */
8981 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8982 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8983 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8984 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8985 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8986 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8987 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8988 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8989 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8990 MAKE_FIXED_MODE_NODE (accum, da, DA)
8991 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8994 tree t = targetm.build_builtin_va_list ();
8996 /* Many back-ends define record types without setting TYPE_NAME.
8997 If we copied the record type here, we'd keep the original
8998 record type without a name. This breaks name mangling. So,
8999 don't copy record types and let c_common_nodes_and_builtins()
9000 declare the type to be __builtin_va_list. */
9001 if (TREE_CODE (t) != RECORD_TYPE)
9002 t = build_variant_type_copy (t);
9004 va_list_type_node = t;
9008 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9011 local_define_builtin (const char *name, tree type, enum built_in_function code,
9012 const char *library_name, int ecf_flags)
9016 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9017 library_name, NULL_TREE);
9018 if (ecf_flags & ECF_CONST)
9019 TREE_READONLY (decl) = 1;
9020 if (ecf_flags & ECF_PURE)
9021 DECL_PURE_P (decl) = 1;
9022 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9023 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9024 if (ecf_flags & ECF_NORETURN)
9025 TREE_THIS_VOLATILE (decl) = 1;
9026 if (ecf_flags & ECF_NOTHROW)
9027 TREE_NOTHROW (decl) = 1;
9028 if (ecf_flags & ECF_MALLOC)
9029 DECL_IS_MALLOC (decl) = 1;
9031 built_in_decls[code] = decl;
9032 implicit_built_in_decls[code] = decl;
9035 /* Call this function after instantiating all builtins that the language
9036 front end cares about. This will build the rest of the builtins that
9037 are relied upon by the tree optimizers and the middle-end. */
9040 build_common_builtin_nodes (void)
9042 tree tmp, tmp2, ftype;
9044 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9045 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9047 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9048 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9049 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9050 ftype = build_function_type (ptr_type_node, tmp);
9052 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9053 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9054 "memcpy", ECF_NOTHROW);
9055 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9056 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9057 "memmove", ECF_NOTHROW);
9060 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9062 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9063 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9064 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9065 ftype = build_function_type (integer_type_node, tmp);
9066 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9067 "memcmp", ECF_PURE | ECF_NOTHROW);
9070 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9072 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9073 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9074 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9075 ftype = build_function_type (ptr_type_node, tmp);
9076 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9077 "memset", ECF_NOTHROW);
9080 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9082 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9083 ftype = build_function_type (ptr_type_node, tmp);
9084 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9085 "alloca", ECF_MALLOC | ECF_NOTHROW);
9088 /* If we're checking the stack, `alloca' can throw. */
9089 if (flag_stack_check)
9090 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9092 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9093 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9094 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9095 ftype = build_function_type (void_type_node, tmp);
9096 local_define_builtin ("__builtin_init_trampoline", ftype,
9097 BUILT_IN_INIT_TRAMPOLINE,
9098 "__builtin_init_trampoline", ECF_NOTHROW);
9100 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9101 ftype = build_function_type (ptr_type_node, tmp);
9102 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9103 BUILT_IN_ADJUST_TRAMPOLINE,
9104 "__builtin_adjust_trampoline",
9105 ECF_CONST | ECF_NOTHROW);
9107 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9108 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9109 ftype = build_function_type (void_type_node, tmp);
9110 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9111 BUILT_IN_NONLOCAL_GOTO,
9112 "__builtin_nonlocal_goto",
9113 ECF_NORETURN | ECF_NOTHROW);
9115 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9116 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9117 ftype = build_function_type (void_type_node, tmp);
9118 local_define_builtin ("__builtin_setjmp_setup", ftype,
9119 BUILT_IN_SETJMP_SETUP,
9120 "__builtin_setjmp_setup", ECF_NOTHROW);
9122 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9123 ftype = build_function_type (ptr_type_node, tmp);
9124 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9125 BUILT_IN_SETJMP_DISPATCHER,
9126 "__builtin_setjmp_dispatcher",
9127 ECF_PURE | ECF_NOTHROW);
9129 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9130 ftype = build_function_type (void_type_node, tmp);
9131 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9132 BUILT_IN_SETJMP_RECEIVER,
9133 "__builtin_setjmp_receiver", ECF_NOTHROW);
9135 ftype = build_function_type (ptr_type_node, void_list_node);
9136 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9137 "__builtin_stack_save", ECF_NOTHROW);
9139 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9140 ftype = build_function_type (void_type_node, tmp);
9141 local_define_builtin ("__builtin_stack_restore", ftype,
9142 BUILT_IN_STACK_RESTORE,
9143 "__builtin_stack_restore", ECF_NOTHROW);
9145 ftype = build_function_type (void_type_node, void_list_node);
9146 local_define_builtin ("__builtin_profile_func_enter", ftype,
9147 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9148 local_define_builtin ("__builtin_profile_func_exit", ftype,
9149 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9151 /* If there's a possibility that we might use the ARM EABI, build the
9152 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9153 if (targetm.arm_eabi_unwinder)
9155 ftype = build_function_type (void_type_node, void_list_node);
9156 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9157 BUILT_IN_CXA_END_CLEANUP,
9158 "__cxa_end_cleanup", ECF_NORETURN);
9161 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9162 ftype = build_function_type (void_type_node, tmp);
9163 local_define_builtin ("__builtin_unwind_resume", ftype,
9164 BUILT_IN_UNWIND_RESUME,
9165 (USING_SJLJ_EXCEPTIONS
9166 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9169 /* The exception object and filter values from the runtime. The argument
9170 must be zero before exception lowering, i.e. from the front end. After
9171 exception lowering, it will be the region number for the exception
9172 landing pad. These functions are PURE instead of CONST to prevent
9173 them from being hoisted past the exception edge that will initialize
9174 its value in the landing pad. */
9175 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9176 ftype = build_function_type (ptr_type_node, tmp);
9177 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9178 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9180 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9181 ftype = build_function_type (tmp2, tmp);
9182 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9183 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9185 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9186 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9187 ftype = build_function_type (void_type_node, tmp);
9188 local_define_builtin ("__builtin_eh_copy_values", ftype,
9189 BUILT_IN_EH_COPY_VALUES,
9190 "__builtin_eh_copy_values", ECF_NOTHROW);
9192 /* Complex multiplication and division. These are handled as builtins
9193 rather than optabs because emit_library_call_value doesn't support
9194 complex. Further, we can do slightly better with folding these
9195 beasties if the real and complex parts of the arguments are separate. */
9199 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9201 char mode_name_buf[4], *q;
9203 enum built_in_function mcode, dcode;
9204 tree type, inner_type;
9206 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9209 inner_type = TREE_TYPE (type);
9211 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9212 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9213 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9214 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9215 ftype = build_function_type (type, tmp);
9217 mcode = ((enum built_in_function)
9218 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9219 dcode = ((enum built_in_function)
9220 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9222 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9226 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9227 local_define_builtin (built_in_names[mcode], ftype, mcode,
9228 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9230 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9231 local_define_builtin (built_in_names[dcode], ftype, dcode,
9232 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9237 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9240 If we requested a pointer to a vector, build up the pointers that
9241 we stripped off while looking for the inner type. Similarly for
9242 return values from functions.
9244 The argument TYPE is the top of the chain, and BOTTOM is the
9245 new type which we will point to. */
9248 reconstruct_complex_type (tree type, tree bottom)
9252 if (TREE_CODE (type) == POINTER_TYPE)
9254 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9255 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9256 TYPE_REF_CAN_ALIAS_ALL (type));
9258 else if (TREE_CODE (type) == REFERENCE_TYPE)
9260 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9261 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9262 TYPE_REF_CAN_ALIAS_ALL (type));
9264 else if (TREE_CODE (type) == ARRAY_TYPE)
9266 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9267 outer = build_array_type (inner, TYPE_DOMAIN (type));
9269 else if (TREE_CODE (type) == FUNCTION_TYPE)
9271 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9272 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9274 else if (TREE_CODE (type) == METHOD_TYPE)
9276 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9277 /* The build_method_type_directly() routine prepends 'this' to argument list,
9278 so we must compensate by getting rid of it. */
9280 = build_method_type_directly
9281 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9283 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9285 else if (TREE_CODE (type) == OFFSET_TYPE)
9287 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9288 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9293 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9297 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9300 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9304 switch (GET_MODE_CLASS (mode))
9306 case MODE_VECTOR_INT:
9307 case MODE_VECTOR_FLOAT:
9308 case MODE_VECTOR_FRACT:
9309 case MODE_VECTOR_UFRACT:
9310 case MODE_VECTOR_ACCUM:
9311 case MODE_VECTOR_UACCUM:
9312 nunits = GET_MODE_NUNITS (mode);
9316 /* Check that there are no leftover bits. */
9317 gcc_assert (GET_MODE_BITSIZE (mode)
9318 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9320 nunits = GET_MODE_BITSIZE (mode)
9321 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9328 return make_vector_type (innertype, nunits, mode);
9331 /* Similarly, but takes the inner type and number of units, which must be
9335 build_vector_type (tree innertype, int nunits)
9337 return make_vector_type (innertype, nunits, VOIDmode);
9340 /* Similarly, but takes the inner type and number of units, which must be
9344 build_opaque_vector_type (tree innertype, int nunits)
9347 innertype = build_distinct_type_copy (innertype);
9348 t = make_vector_type (innertype, nunits, VOIDmode);
9349 TYPE_VECTOR_OPAQUE (t) = true;
9354 /* Given an initializer INIT, return TRUE if INIT is zero or some
9355 aggregate of zeros. Otherwise return FALSE. */
9357 initializer_zerop (const_tree init)
9363 switch (TREE_CODE (init))
9366 return integer_zerop (init);
9369 /* ??? Note that this is not correct for C4X float formats. There,
9370 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9371 negative exponent. */
9372 return real_zerop (init)
9373 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9376 return fixed_zerop (init);
9379 return integer_zerop (init)
9380 || (real_zerop (init)
9381 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9382 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9385 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9386 if (!initializer_zerop (TREE_VALUE (elt)))
9392 unsigned HOST_WIDE_INT idx;
9394 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9395 if (!initializer_zerop (elt))
9404 /* We need to loop through all elements to handle cases like
9405 "\0" and "\0foobar". */
9406 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9407 if (TREE_STRING_POINTER (init)[i] != '\0')
9418 /* Build an empty statement at location LOC. */
9421 build_empty_stmt (location_t loc)
9423 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9424 SET_EXPR_LOCATION (t, loc);
9429 /* Build an OpenMP clause with code CODE. LOC is the location of the
9433 build_omp_clause (location_t loc, enum omp_clause_code code)
9438 length = omp_clause_num_ops[code];
9439 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9441 t = GGC_NEWVAR (union tree_node, size);
9442 memset (t, 0, size);
9443 TREE_SET_CODE (t, OMP_CLAUSE);
9444 OMP_CLAUSE_SET_CODE (t, code);
9445 OMP_CLAUSE_LOCATION (t) = loc;
9447 #ifdef GATHER_STATISTICS
9448 tree_node_counts[(int) omp_clause_kind]++;
9449 tree_node_sizes[(int) omp_clause_kind] += size;
9455 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9456 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9457 Except for the CODE and operand count field, other storage for the
9458 object is initialized to zeros. */
9461 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9464 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9466 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9467 gcc_assert (len >= 1);
9469 #ifdef GATHER_STATISTICS
9470 tree_node_counts[(int) e_kind]++;
9471 tree_node_sizes[(int) e_kind] += length;
9474 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9476 memset (t, 0, length);
9478 TREE_SET_CODE (t, code);
9480 /* Can't use TREE_OPERAND to store the length because if checking is
9481 enabled, it will try to check the length before we store it. :-P */
9482 t->exp.operands[0] = build_int_cst (sizetype, len);
9488 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9489 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9493 build_call_list (tree return_type, tree fn, tree arglist)
9498 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9499 TREE_TYPE (t) = return_type;
9500 CALL_EXPR_FN (t) = fn;
9501 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9502 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9503 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9504 process_call_operands (t);
9508 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9509 FN and a null static chain slot. NARGS is the number of call arguments
9510 which are specified as "..." arguments. */
9513 build_call_nary (tree return_type, tree fn, int nargs, ...)
9517 va_start (args, nargs);
9518 ret = build_call_valist (return_type, fn, nargs, args);
9523 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9524 FN and a null static chain slot. NARGS is the number of call arguments
9525 which are specified as a va_list ARGS. */
9528 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9533 t = build_vl_exp (CALL_EXPR, nargs + 3);
9534 TREE_TYPE (t) = return_type;
9535 CALL_EXPR_FN (t) = fn;
9536 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9537 for (i = 0; i < nargs; i++)
9538 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9539 process_call_operands (t);
9543 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9544 FN and a null static chain slot. NARGS is the number of call arguments
9545 which are specified as a tree array ARGS. */
9548 build_call_array_loc (location_t loc, tree return_type, tree fn,
9549 int nargs, const tree *args)
9554 t = build_vl_exp (CALL_EXPR, nargs + 3);
9555 TREE_TYPE (t) = return_type;
9556 CALL_EXPR_FN (t) = fn;
9557 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9558 for (i = 0; i < nargs; i++)
9559 CALL_EXPR_ARG (t, i) = args[i];
9560 process_call_operands (t);
9561 SET_EXPR_LOCATION (t, loc);
9565 /* Like build_call_array, but takes a VEC. */
9568 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9573 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9574 TREE_TYPE (ret) = return_type;
9575 CALL_EXPR_FN (ret) = fn;
9576 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9577 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9578 CALL_EXPR_ARG (ret, ix) = t;
9579 process_call_operands (ret);
9584 /* Returns true if it is possible to prove that the index of
9585 an array access REF (an ARRAY_REF expression) falls into the
9589 in_array_bounds_p (tree ref)
9591 tree idx = TREE_OPERAND (ref, 1);
9594 if (TREE_CODE (idx) != INTEGER_CST)
9597 min = array_ref_low_bound (ref);
9598 max = array_ref_up_bound (ref);
9601 || TREE_CODE (min) != INTEGER_CST
9602 || TREE_CODE (max) != INTEGER_CST)
9605 if (tree_int_cst_lt (idx, min)
9606 || tree_int_cst_lt (max, idx))
9612 /* Returns true if it is possible to prove that the range of
9613 an array access REF (an ARRAY_RANGE_REF expression) falls
9614 into the array bounds. */
9617 range_in_array_bounds_p (tree ref)
9619 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9620 tree range_min, range_max, min, max;
9622 range_min = TYPE_MIN_VALUE (domain_type);
9623 range_max = TYPE_MAX_VALUE (domain_type);
9626 || TREE_CODE (range_min) != INTEGER_CST
9627 || TREE_CODE (range_max) != INTEGER_CST)
9630 min = array_ref_low_bound (ref);
9631 max = array_ref_up_bound (ref);
9634 || TREE_CODE (min) != INTEGER_CST
9635 || TREE_CODE (max) != INTEGER_CST)
9638 if (tree_int_cst_lt (range_min, min)
9639 || tree_int_cst_lt (max, range_max))
9645 /* Return true if T (assumed to be a DECL) must be assigned a memory
9649 needs_to_live_in_memory (const_tree t)
9651 if (TREE_CODE (t) == SSA_NAME)
9652 t = SSA_NAME_VAR (t);
9654 return (TREE_ADDRESSABLE (t)
9655 || is_global_var (t)
9656 || (TREE_CODE (t) == RESULT_DECL
9657 && aggregate_value_p (t, current_function_decl)));
9660 /* There are situations in which a language considers record types
9661 compatible which have different field lists. Decide if two fields
9662 are compatible. It is assumed that the parent records are compatible. */
9665 fields_compatible_p (const_tree f1, const_tree f2)
9667 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9668 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9671 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9672 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9675 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9681 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9684 find_compatible_field (tree record, tree orig_field)
9688 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9689 if (TREE_CODE (f) == FIELD_DECL
9690 && fields_compatible_p (f, orig_field))
9693 /* ??? Why isn't this on the main fields list? */
9694 f = TYPE_VFIELD (record);
9695 if (f && TREE_CODE (f) == FIELD_DECL
9696 && fields_compatible_p (f, orig_field))
9699 /* ??? We should abort here, but Java appears to do Bad Things
9700 with inherited fields. */
9704 /* Return value of a constant X and sign-extend it. */
9707 int_cst_value (const_tree x)
9709 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9710 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9712 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9713 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9714 || TREE_INT_CST_HIGH (x) == -1);
9716 if (bits < HOST_BITS_PER_WIDE_INT)
9718 bool negative = ((val >> (bits - 1)) & 1) != 0;
9720 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9722 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9728 /* Return value of a constant X and sign-extend it. */
9731 widest_int_cst_value (const_tree x)
9733 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9734 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9736 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9737 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9738 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9739 << HOST_BITS_PER_WIDE_INT);
9741 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9742 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9743 || TREE_INT_CST_HIGH (x) == -1);
9746 if (bits < HOST_BITS_PER_WIDEST_INT)
9748 bool negative = ((val >> (bits - 1)) & 1) != 0;
9750 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9752 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9758 /* If TYPE is an integral type, return an equivalent type which is
9759 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9760 return TYPE itself. */
9763 signed_or_unsigned_type_for (int unsignedp, tree type)
9766 if (POINTER_TYPE_P (type))
9768 /* If the pointer points to the normal address space, use the
9769 size_type_node. Otherwise use an appropriate size for the pointer
9770 based on the named address space it points to. */
9771 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9774 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9777 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9780 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9783 /* Returns unsigned variant of TYPE. */
9786 unsigned_type_for (tree type)
9788 return signed_or_unsigned_type_for (1, type);
9791 /* Returns signed variant of TYPE. */
9794 signed_type_for (tree type)
9796 return signed_or_unsigned_type_for (0, type);
9799 /* Returns the largest value obtainable by casting something in INNER type to
9803 upper_bound_in_type (tree outer, tree inner)
9805 unsigned HOST_WIDE_INT lo, hi;
9806 unsigned int det = 0;
9807 unsigned oprec = TYPE_PRECISION (outer);
9808 unsigned iprec = TYPE_PRECISION (inner);
9811 /* Compute a unique number for every combination. */
9812 det |= (oprec > iprec) ? 4 : 0;
9813 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9814 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9816 /* Determine the exponent to use. */
9821 /* oprec <= iprec, outer: signed, inner: don't care. */
9826 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9830 /* oprec > iprec, outer: signed, inner: signed. */
9834 /* oprec > iprec, outer: signed, inner: unsigned. */
9838 /* oprec > iprec, outer: unsigned, inner: signed. */
9842 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9849 /* Compute 2^^prec - 1. */
9850 if (prec <= HOST_BITS_PER_WIDE_INT)
9853 lo = ((~(unsigned HOST_WIDE_INT) 0)
9854 >> (HOST_BITS_PER_WIDE_INT - prec));
9858 hi = ((~(unsigned HOST_WIDE_INT) 0)
9859 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9860 lo = ~(unsigned HOST_WIDE_INT) 0;
9863 return build_int_cst_wide (outer, lo, hi);
9866 /* Returns the smallest value obtainable by casting something in INNER type to
9870 lower_bound_in_type (tree outer, tree inner)
9872 unsigned HOST_WIDE_INT lo, hi;
9873 unsigned oprec = TYPE_PRECISION (outer);
9874 unsigned iprec = TYPE_PRECISION (inner);
9876 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9878 if (TYPE_UNSIGNED (outer)
9879 /* If we are widening something of an unsigned type, OUTER type
9880 contains all values of INNER type. In particular, both INNER
9881 and OUTER types have zero in common. */
9882 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9886 /* If we are widening a signed type to another signed type, we
9887 want to obtain -2^^(iprec-1). If we are keeping the
9888 precision or narrowing to a signed type, we want to obtain
9890 unsigned prec = oprec > iprec ? iprec : oprec;
9892 if (prec <= HOST_BITS_PER_WIDE_INT)
9894 hi = ~(unsigned HOST_WIDE_INT) 0;
9895 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9899 hi = ((~(unsigned HOST_WIDE_INT) 0)
9900 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9905 return build_int_cst_wide (outer, lo, hi);
9908 /* Return nonzero if two operands that are suitable for PHI nodes are
9909 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9910 SSA_NAME or invariant. Note that this is strictly an optimization.
9911 That is, callers of this function can directly call operand_equal_p
9912 and get the same result, only slower. */
9915 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9919 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9921 return operand_equal_p (arg0, arg1, 0);
9924 /* Returns number of zeros at the end of binary representation of X.
9926 ??? Use ffs if available? */
9929 num_ending_zeros (const_tree x)
9931 unsigned HOST_WIDE_INT fr, nfr;
9932 unsigned num, abits;
9933 tree type = TREE_TYPE (x);
9935 if (TREE_INT_CST_LOW (x) == 0)
9937 num = HOST_BITS_PER_WIDE_INT;
9938 fr = TREE_INT_CST_HIGH (x);
9943 fr = TREE_INT_CST_LOW (x);
9946 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9949 if (nfr << abits == fr)
9956 if (num > TYPE_PRECISION (type))
9957 num = TYPE_PRECISION (type);
9959 return build_int_cst_type (type, num);
9963 #define WALK_SUBTREE(NODE) \
9966 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9972 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9973 be walked whenever a type is seen in the tree. Rest of operands and return
9974 value are as for walk_tree. */
9977 walk_type_fields (tree type, walk_tree_fn func, void *data,
9978 struct pointer_set_t *pset, walk_tree_lh lh)
9980 tree result = NULL_TREE;
9982 switch (TREE_CODE (type))
9985 case REFERENCE_TYPE:
9986 /* We have to worry about mutually recursive pointers. These can't
9987 be written in C. They can in Ada. It's pathological, but
9988 there's an ACATS test (c38102a) that checks it. Deal with this
9989 by checking if we're pointing to another pointer, that one
9990 points to another pointer, that one does too, and we have no htab.
9991 If so, get a hash table. We check three levels deep to avoid
9992 the cost of the hash table if we don't need one. */
9993 if (POINTER_TYPE_P (TREE_TYPE (type))
9994 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9995 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9998 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10006 /* ... fall through ... */
10009 WALK_SUBTREE (TREE_TYPE (type));
10013 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10015 /* Fall through. */
10017 case FUNCTION_TYPE:
10018 WALK_SUBTREE (TREE_TYPE (type));
10022 /* We never want to walk into default arguments. */
10023 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10024 WALK_SUBTREE (TREE_VALUE (arg));
10029 /* Don't follow this nodes's type if a pointer for fear that
10030 we'll have infinite recursion. If we have a PSET, then we
10033 || (!POINTER_TYPE_P (TREE_TYPE (type))
10034 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10035 WALK_SUBTREE (TREE_TYPE (type));
10036 WALK_SUBTREE (TYPE_DOMAIN (type));
10040 WALK_SUBTREE (TREE_TYPE (type));
10041 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10051 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10052 called with the DATA and the address of each sub-tree. If FUNC returns a
10053 non-NULL value, the traversal is stopped, and the value returned by FUNC
10054 is returned. If PSET is non-NULL it is used to record the nodes visited,
10055 and to avoid visiting a node more than once. */
10058 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10059 struct pointer_set_t *pset, walk_tree_lh lh)
10061 enum tree_code code;
10065 #define WALK_SUBTREE_TAIL(NODE) \
10069 goto tail_recurse; \
10074 /* Skip empty subtrees. */
10078 /* Don't walk the same tree twice, if the user has requested
10079 that we avoid doing so. */
10080 if (pset && pointer_set_insert (pset, *tp))
10083 /* Call the function. */
10085 result = (*func) (tp, &walk_subtrees, data);
10087 /* If we found something, return it. */
10091 code = TREE_CODE (*tp);
10093 /* Even if we didn't, FUNC may have decided that there was nothing
10094 interesting below this point in the tree. */
10095 if (!walk_subtrees)
10097 /* But we still need to check our siblings. */
10098 if (code == TREE_LIST)
10099 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10100 else if (code == OMP_CLAUSE)
10101 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10108 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10109 if (result || !walk_subtrees)
10116 case IDENTIFIER_NODE:
10123 case PLACEHOLDER_EXPR:
10127 /* None of these have subtrees other than those already walked
10132 WALK_SUBTREE (TREE_VALUE (*tp));
10133 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10138 int len = TREE_VEC_LENGTH (*tp);
10143 /* Walk all elements but the first. */
10145 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10147 /* Now walk the first one as a tail call. */
10148 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10152 WALK_SUBTREE (TREE_REALPART (*tp));
10153 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10157 unsigned HOST_WIDE_INT idx;
10158 constructor_elt *ce;
10161 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10163 WALK_SUBTREE (ce->value);
10168 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10173 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10175 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10176 into declarations that are just mentioned, rather than
10177 declared; they don't really belong to this part of the tree.
10178 And, we can see cycles: the initializer for a declaration
10179 can refer to the declaration itself. */
10180 WALK_SUBTREE (DECL_INITIAL (decl));
10181 WALK_SUBTREE (DECL_SIZE (decl));
10182 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10184 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10187 case STATEMENT_LIST:
10189 tree_stmt_iterator i;
10190 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10191 WALK_SUBTREE (*tsi_stmt_ptr (i));
10196 switch (OMP_CLAUSE_CODE (*tp))
10198 case OMP_CLAUSE_PRIVATE:
10199 case OMP_CLAUSE_SHARED:
10200 case OMP_CLAUSE_FIRSTPRIVATE:
10201 case OMP_CLAUSE_COPYIN:
10202 case OMP_CLAUSE_COPYPRIVATE:
10203 case OMP_CLAUSE_IF:
10204 case OMP_CLAUSE_NUM_THREADS:
10205 case OMP_CLAUSE_SCHEDULE:
10206 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10209 case OMP_CLAUSE_NOWAIT:
10210 case OMP_CLAUSE_ORDERED:
10211 case OMP_CLAUSE_DEFAULT:
10212 case OMP_CLAUSE_UNTIED:
10213 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10215 case OMP_CLAUSE_LASTPRIVATE:
10216 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10217 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10218 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10220 case OMP_CLAUSE_COLLAPSE:
10223 for (i = 0; i < 3; i++)
10224 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10225 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10228 case OMP_CLAUSE_REDUCTION:
10231 for (i = 0; i < 4; i++)
10232 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10233 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10237 gcc_unreachable ();
10245 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10246 But, we only want to walk once. */
10247 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10248 for (i = 0; i < len; ++i)
10249 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10250 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10254 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10255 defining. We only want to walk into these fields of a type in this
10256 case and not in the general case of a mere reference to the type.
10258 The criterion is as follows: if the field can be an expression, it
10259 must be walked only here. This should be in keeping with the fields
10260 that are directly gimplified in gimplify_type_sizes in order for the
10261 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10262 variable-sized types.
10264 Note that DECLs get walked as part of processing the BIND_EXPR. */
10265 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10267 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10268 if (TREE_CODE (*type_p) == ERROR_MARK)
10271 /* Call the function for the type. See if it returns anything or
10272 doesn't want us to continue. If we are to continue, walk both
10273 the normal fields and those for the declaration case. */
10274 result = (*func) (type_p, &walk_subtrees, data);
10275 if (result || !walk_subtrees)
10278 result = walk_type_fields (*type_p, func, data, pset, lh);
10282 /* If this is a record type, also walk the fields. */
10283 if (RECORD_OR_UNION_TYPE_P (*type_p))
10287 for (field = TYPE_FIELDS (*type_p); field;
10288 field = TREE_CHAIN (field))
10290 /* We'd like to look at the type of the field, but we can
10291 easily get infinite recursion. So assume it's pointed
10292 to elsewhere in the tree. Also, ignore things that
10294 if (TREE_CODE (field) != FIELD_DECL)
10297 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10298 WALK_SUBTREE (DECL_SIZE (field));
10299 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10300 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10301 WALK_SUBTREE (DECL_QUALIFIER (field));
10305 /* Same for scalar types. */
10306 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10307 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10308 || TREE_CODE (*type_p) == INTEGER_TYPE
10309 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10310 || TREE_CODE (*type_p) == REAL_TYPE)
10312 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10313 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10316 WALK_SUBTREE (TYPE_SIZE (*type_p));
10317 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10322 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10326 /* Walk over all the sub-trees of this operand. */
10327 len = TREE_OPERAND_LENGTH (*tp);
10329 /* Go through the subtrees. We need to do this in forward order so
10330 that the scope of a FOR_EXPR is handled properly. */
10333 for (i = 0; i < len - 1; ++i)
10334 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10335 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10338 /* If this is a type, walk the needed fields in the type. */
10339 else if (TYPE_P (*tp))
10340 return walk_type_fields (*tp, func, data, pset, lh);
10344 /* We didn't find what we were looking for. */
10347 #undef WALK_SUBTREE_TAIL
10349 #undef WALK_SUBTREE
10351 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10354 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10358 struct pointer_set_t *pset;
10360 pset = pointer_set_create ();
10361 result = walk_tree_1 (tp, func, data, pset, lh);
10362 pointer_set_destroy (pset);
10368 tree_block (tree t)
10370 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10372 if (IS_EXPR_CODE_CLASS (c))
10373 return &t->exp.block;
10374 gcc_unreachable ();
10378 /* Create a nameless artificial label and put it in the current
10379 function context. The label has a location of LOC. Returns the
10380 newly created label. */
10383 create_artificial_label (location_t loc)
10385 tree lab = build_decl (loc,
10386 LABEL_DECL, NULL_TREE, void_type_node);
10388 DECL_ARTIFICIAL (lab) = 1;
10389 DECL_IGNORED_P (lab) = 1;
10390 DECL_CONTEXT (lab) = current_function_decl;
10394 /* Given a tree, try to return a useful variable name that we can use
10395 to prefix a temporary that is being assigned the value of the tree.
10396 I.E. given <temp> = &A, return A. */
10401 tree stripped_decl;
10404 STRIP_NOPS (stripped_decl);
10405 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10406 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10409 switch (TREE_CODE (stripped_decl))
10412 return get_name (TREE_OPERAND (stripped_decl, 0));
10419 /* Return true if TYPE has a variable argument list. */
10422 stdarg_p (tree fntype)
10424 function_args_iterator args_iter;
10425 tree n = NULL_TREE, t;
10430 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10435 return n != NULL_TREE && n != void_type_node;
10438 /* Return true if TYPE has a prototype. */
10441 prototype_p (tree fntype)
10445 gcc_assert (fntype != NULL_TREE);
10447 t = TYPE_ARG_TYPES (fntype);
10448 return (t != NULL_TREE);
10451 /* If BLOCK is inlined from an __attribute__((__artificial__))
10452 routine, return pointer to location from where it has been
10455 block_nonartificial_location (tree block)
10457 location_t *ret = NULL;
10459 while (block && TREE_CODE (block) == BLOCK
10460 && BLOCK_ABSTRACT_ORIGIN (block))
10462 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10464 while (TREE_CODE (ao) == BLOCK
10465 && BLOCK_ABSTRACT_ORIGIN (ao)
10466 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10467 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10469 if (TREE_CODE (ao) == FUNCTION_DECL)
10471 /* If AO is an artificial inline, point RET to the
10472 call site locus at which it has been inlined and continue
10473 the loop, in case AO's caller is also an artificial
10475 if (DECL_DECLARED_INLINE_P (ao)
10476 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10477 ret = &BLOCK_SOURCE_LOCATION (block);
10481 else if (TREE_CODE (ao) != BLOCK)
10484 block = BLOCK_SUPERCONTEXT (block);
10490 /* If EXP is inlined from an __attribute__((__artificial__))
10491 function, return the location of the original call expression. */
10494 tree_nonartificial_location (tree exp)
10496 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10501 return EXPR_LOCATION (exp);
10505 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10508 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10511 cl_option_hash_hash (const void *x)
10513 const_tree const t = (const_tree) x;
10517 hashval_t hash = 0;
10519 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10521 p = (const char *)TREE_OPTIMIZATION (t);
10522 len = sizeof (struct cl_optimization);
10525 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10527 p = (const char *)TREE_TARGET_OPTION (t);
10528 len = sizeof (struct cl_target_option);
10532 gcc_unreachable ();
10534 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10536 for (i = 0; i < len; i++)
10538 hash = (hash << 4) ^ ((i << 2) | p[i]);
10543 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10544 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10548 cl_option_hash_eq (const void *x, const void *y)
10550 const_tree const xt = (const_tree) x;
10551 const_tree const yt = (const_tree) y;
10556 if (TREE_CODE (xt) != TREE_CODE (yt))
10559 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10561 xp = (const char *)TREE_OPTIMIZATION (xt);
10562 yp = (const char *)TREE_OPTIMIZATION (yt);
10563 len = sizeof (struct cl_optimization);
10566 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10568 xp = (const char *)TREE_TARGET_OPTION (xt);
10569 yp = (const char *)TREE_TARGET_OPTION (yt);
10570 len = sizeof (struct cl_target_option);
10574 gcc_unreachable ();
10576 return (memcmp (xp, yp, len) == 0);
10579 /* Build an OPTIMIZATION_NODE based on the current options. */
10582 build_optimization_node (void)
10587 /* Use the cache of optimization nodes. */
10589 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10591 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10595 /* Insert this one into the hash table. */
10596 t = cl_optimization_node;
10599 /* Make a new node for next time round. */
10600 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10606 /* Build a TARGET_OPTION_NODE based on the current options. */
10609 build_target_option_node (void)
10614 /* Use the cache of optimization nodes. */
10616 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10618 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10622 /* Insert this one into the hash table. */
10623 t = cl_target_option_node;
10626 /* Make a new node for next time round. */
10627 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10633 /* Determine the "ultimate origin" of a block. The block may be an inlined
10634 instance of an inlined instance of a block which is local to an inline
10635 function, so we have to trace all of the way back through the origin chain
10636 to find out what sort of node actually served as the original seed for the
10640 block_ultimate_origin (const_tree block)
10642 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10644 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10645 nodes in the function to point to themselves; ignore that if
10646 we're trying to output the abstract instance of this function. */
10647 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10650 if (immediate_origin == NULL_TREE)
10655 tree lookahead = immediate_origin;
10659 ret_val = lookahead;
10660 lookahead = (TREE_CODE (ret_val) == BLOCK
10661 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10663 while (lookahead != NULL && lookahead != ret_val);
10665 /* The block's abstract origin chain may not be the *ultimate* origin of
10666 the block. It could lead to a DECL that has an abstract origin set.
10667 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10668 will give us if it has one). Note that DECL's abstract origins are
10669 supposed to be the most distant ancestor (or so decl_ultimate_origin
10670 claims), so we don't need to loop following the DECL origins. */
10671 if (DECL_P (ret_val))
10672 return DECL_ORIGIN (ret_val);
10678 /* Return true if T1 and T2 are equivalent lists. */
10681 list_equal_p (const_tree t1, const_tree t2)
10683 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10684 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10689 /* Return true iff conversion in EXP generates no instruction. Mark
10690 it inline so that we fully inline into the stripping functions even
10691 though we have two uses of this function. */
10694 tree_nop_conversion (const_tree exp)
10696 tree outer_type, inner_type;
10698 if (!CONVERT_EXPR_P (exp)
10699 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10701 if (TREE_OPERAND (exp, 0) == error_mark_node)
10704 outer_type = TREE_TYPE (exp);
10705 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10710 /* Use precision rather then machine mode when we can, which gives
10711 the correct answer even for submode (bit-field) types. */
10712 if ((INTEGRAL_TYPE_P (outer_type)
10713 || POINTER_TYPE_P (outer_type)
10714 || TREE_CODE (outer_type) == OFFSET_TYPE)
10715 && (INTEGRAL_TYPE_P (inner_type)
10716 || POINTER_TYPE_P (inner_type)
10717 || TREE_CODE (inner_type) == OFFSET_TYPE))
10718 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10720 /* Otherwise fall back on comparing machine modes (e.g. for
10721 aggregate types, floats). */
10722 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10725 /* Return true iff conversion in EXP generates no instruction. Don't
10726 consider conversions changing the signedness. */
10729 tree_sign_nop_conversion (const_tree exp)
10731 tree outer_type, inner_type;
10733 if (!tree_nop_conversion (exp))
10736 outer_type = TREE_TYPE (exp);
10737 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10739 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10740 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10743 /* Strip conversions from EXP according to tree_nop_conversion and
10744 return the resulting expression. */
10747 tree_strip_nop_conversions (tree exp)
10749 while (tree_nop_conversion (exp))
10750 exp = TREE_OPERAND (exp, 0);
10754 /* Strip conversions from EXP according to tree_sign_nop_conversion
10755 and return the resulting expression. */
10758 tree_strip_sign_nop_conversions (tree exp)
10760 while (tree_sign_nop_conversion (exp))
10761 exp = TREE_OPERAND (exp, 0);
10765 static GTY(()) tree gcc_eh_personality_decl;
10767 /* Return the GCC personality function decl. */
10770 lhd_gcc_personality (void)
10772 if (!gcc_eh_personality_decl)
10773 gcc_eh_personality_decl
10774 = build_personality_function (USING_SJLJ_EXCEPTIONS
10775 ? "__gcc_personality_sj0"
10776 : "__gcc_personality_v0");
10778 return gcc_eh_personality_decl;
10781 /* Try to find a base info of BINFO that would have its field decl at offset
10782 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10783 found, return, otherwise return NULL_TREE. */
10786 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
10793 type = TREE_TYPE (binfo);
10796 tree base_binfo, found_binfo;
10797 HOST_WIDE_INT pos, size;
10801 if (TREE_CODE (type) != RECORD_TYPE)
10804 for (fld = TYPE_FIELDS (type); fld; fld = TREE_CHAIN (fld))
10806 if (TREE_CODE (fld) != FIELD_DECL)
10809 pos = int_bit_position (fld);
10810 size = tree_low_cst (DECL_SIZE (fld), 1);
10811 if (pos <= offset && (pos + size) > offset)
10817 found_binfo = NULL_TREE;
10818 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
10819 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
10821 found_binfo = base_binfo;
10828 type = TREE_TYPE (fld);
10829 binfo = found_binfo;
10832 if (type != expected_type)
10837 #include "gt-tree.h"