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"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.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 zero extended. */
1047 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1049 return build_int_cst_wide (type, low, 0);
1052 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1053 if it is negative. This function is similar to build_int_cst, but
1054 the extra bits outside of the type precision are cleared. Constants
1055 with these extra bits may confuse the fold so that it detects overflows
1056 even in cases when they do not occur, and in general should be avoided.
1057 We cannot however make this a default behavior of build_int_cst without
1058 more intrusive changes, since there are parts of gcc that rely on the extra
1059 precision of the integer constants. */
1062 build_int_cst_type (tree type, HOST_WIDE_INT low)
1064 unsigned HOST_WIDE_INT low1;
1069 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1071 return build_int_cst_wide (type, low1, hi);
1074 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1075 and sign extended according to the value range of TYPE. */
1078 build_int_cst_wide_type (tree type,
1079 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1081 fit_double_type (low, high, &low, &high, type);
1082 return build_int_cst_wide (type, low, high);
1085 /* Constructs tree in type TYPE from with value given by CST. Signedness
1086 of CST is assumed to be the same as the signedness of TYPE. */
1089 double_int_to_tree (tree type, double_int cst)
1091 cst = double_int_ext (cst, TYPE_PRECISION (type), TYPE_UNSIGNED (type));
1093 return build_int_cst_wide (type, cst.low, cst.high);
1096 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1097 to be the same as the signedness of TYPE. */
1100 double_int_fits_to_tree_p (const_tree type, double_int cst)
1102 double_int ext = double_int_ext (cst,
1103 TYPE_PRECISION (type),
1104 TYPE_UNSIGNED (type));
1106 return double_int_equal_p (cst, ext);
1109 /* These are the hash table functions for the hash table of INTEGER_CST
1110 nodes of a sizetype. */
1112 /* Return the hash code code X, an INTEGER_CST. */
1115 int_cst_hash_hash (const void *x)
1117 const_tree const t = (const_tree) x;
1119 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1120 ^ htab_hash_pointer (TREE_TYPE (t)));
1123 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1124 is the same as that given by *Y, which is the same. */
1127 int_cst_hash_eq (const void *x, const void *y)
1129 const_tree const xt = (const_tree) x;
1130 const_tree const yt = (const_tree) y;
1132 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1133 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1134 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1137 /* Create an INT_CST node of TYPE and value HI:LOW.
1138 The returned node is always shared. For small integers we use a
1139 per-type vector cache, for larger ones we use a single hash table. */
1142 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1150 switch (TREE_CODE (type))
1153 case REFERENCE_TYPE:
1154 /* Cache NULL pointer. */
1163 /* Cache false or true. */
1171 if (TYPE_UNSIGNED (type))
1174 limit = INTEGER_SHARE_LIMIT;
1175 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1181 limit = INTEGER_SHARE_LIMIT + 1;
1182 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1184 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1198 /* Look for it in the type's vector of small shared ints. */
1199 if (!TYPE_CACHED_VALUES_P (type))
1201 TYPE_CACHED_VALUES_P (type) = 1;
1202 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1205 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1208 /* Make sure no one is clobbering the shared constant. */
1209 gcc_assert (TREE_TYPE (t) == type);
1210 gcc_assert (TREE_INT_CST_LOW (t) == low);
1211 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1215 /* Create a new shared int. */
1216 t = make_node (INTEGER_CST);
1218 TREE_INT_CST_LOW (t) = low;
1219 TREE_INT_CST_HIGH (t) = hi;
1220 TREE_TYPE (t) = type;
1222 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1227 /* Use the cache of larger shared ints. */
1230 TREE_INT_CST_LOW (int_cst_node) = low;
1231 TREE_INT_CST_HIGH (int_cst_node) = hi;
1232 TREE_TYPE (int_cst_node) = type;
1234 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1238 /* Insert this one into the hash table. */
1241 /* Make a new node for next time round. */
1242 int_cst_node = make_node (INTEGER_CST);
1249 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1250 and the rest are zeros. */
1253 build_low_bits_mask (tree type, unsigned bits)
1257 gcc_assert (bits <= TYPE_PRECISION (type));
1259 if (bits == TYPE_PRECISION (type)
1260 && !TYPE_UNSIGNED (type))
1261 /* Sign extended all-ones mask. */
1262 mask = double_int_minus_one;
1264 mask = double_int_mask (bits);
1266 return build_int_cst_wide (type, mask.low, mask.high);
1269 /* Checks that X is integer constant that can be expressed in (unsigned)
1270 HOST_WIDE_INT without loss of precision. */
1273 cst_and_fits_in_hwi (const_tree x)
1275 if (TREE_CODE (x) != INTEGER_CST)
1278 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1281 return (TREE_INT_CST_HIGH (x) == 0
1282 || TREE_INT_CST_HIGH (x) == -1);
1285 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1286 are in a list pointed to by VALS. */
1289 build_vector (tree type, tree vals)
1291 tree v = make_node (VECTOR_CST);
1295 TREE_VECTOR_CST_ELTS (v) = vals;
1296 TREE_TYPE (v) = type;
1298 /* Iterate through elements and check for overflow. */
1299 for (link = vals; link; link = TREE_CHAIN (link))
1301 tree value = TREE_VALUE (link);
1303 /* Don't crash if we get an address constant. */
1304 if (!CONSTANT_CLASS_P (value))
1307 over |= TREE_OVERFLOW (value);
1310 TREE_OVERFLOW (v) = over;
1314 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1315 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1318 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1320 tree list = NULL_TREE;
1321 unsigned HOST_WIDE_INT idx;
1324 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1325 list = tree_cons (NULL_TREE, value, list);
1326 return build_vector (type, nreverse (list));
1329 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1330 are in the VEC pointed to by VALS. */
1332 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1334 tree c = make_node (CONSTRUCTOR);
1336 constructor_elt *elt;
1337 bool constant_p = true;
1339 TREE_TYPE (c) = type;
1340 CONSTRUCTOR_ELTS (c) = vals;
1342 for (i = 0; VEC_iterate (constructor_elt, vals, i, elt); i++)
1343 if (!TREE_CONSTANT (elt->value))
1349 TREE_CONSTANT (c) = constant_p;
1354 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1357 build_constructor_single (tree type, tree index, tree value)
1359 VEC(constructor_elt,gc) *v;
1360 constructor_elt *elt;
1362 v = VEC_alloc (constructor_elt, gc, 1);
1363 elt = VEC_quick_push (constructor_elt, v, NULL);
1367 return build_constructor (type, v);
1371 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1372 are in a list pointed to by VALS. */
1374 build_constructor_from_list (tree type, tree vals)
1377 VEC(constructor_elt,gc) *v = NULL;
1381 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1382 for (t = vals; t; t = TREE_CHAIN (t))
1383 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1386 return build_constructor (type, v);
1389 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1392 build_fixed (tree type, FIXED_VALUE_TYPE f)
1395 FIXED_VALUE_TYPE *fp;
1397 v = make_node (FIXED_CST);
1398 fp = GGC_NEW (FIXED_VALUE_TYPE);
1399 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1401 TREE_TYPE (v) = type;
1402 TREE_FIXED_CST_PTR (v) = fp;
1406 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1409 build_real (tree type, REAL_VALUE_TYPE d)
1412 REAL_VALUE_TYPE *dp;
1415 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1416 Consider doing it via real_convert now. */
1418 v = make_node (REAL_CST);
1419 dp = GGC_NEW (REAL_VALUE_TYPE);
1420 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1422 TREE_TYPE (v) = type;
1423 TREE_REAL_CST_PTR (v) = dp;
1424 TREE_OVERFLOW (v) = overflow;
1428 /* Return a new REAL_CST node whose type is TYPE
1429 and whose value is the integer value of the INTEGER_CST node I. */
1432 real_value_from_int_cst (const_tree type, const_tree i)
1436 /* Clear all bits of the real value type so that we can later do
1437 bitwise comparisons to see if two values are the same. */
1438 memset (&d, 0, sizeof d);
1440 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1441 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1442 TYPE_UNSIGNED (TREE_TYPE (i)));
1446 /* Given a tree representing an integer constant I, return a tree
1447 representing the same value as a floating-point constant of type TYPE. */
1450 build_real_from_int_cst (tree type, const_tree i)
1453 int overflow = TREE_OVERFLOW (i);
1455 v = build_real (type, real_value_from_int_cst (type, i));
1457 TREE_OVERFLOW (v) |= overflow;
1461 /* Return a newly constructed STRING_CST node whose value is
1462 the LEN characters at STR.
1463 The TREE_TYPE is not initialized. */
1466 build_string (int len, const char *str)
1471 /* Do not waste bytes provided by padding of struct tree_string. */
1472 length = len + offsetof (struct tree_string, str) + 1;
1474 #ifdef GATHER_STATISTICS
1475 tree_node_counts[(int) c_kind]++;
1476 tree_node_sizes[(int) c_kind] += length;
1479 s = ggc_alloc_tree (length);
1481 memset (s, 0, sizeof (struct tree_common));
1482 TREE_SET_CODE (s, STRING_CST);
1483 TREE_CONSTANT (s) = 1;
1484 TREE_STRING_LENGTH (s) = len;
1485 memcpy (s->string.str, str, len);
1486 s->string.str[len] = '\0';
1491 /* Return a newly constructed COMPLEX_CST node whose value is
1492 specified by the real and imaginary parts REAL and IMAG.
1493 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1494 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1497 build_complex (tree type, tree real, tree imag)
1499 tree t = make_node (COMPLEX_CST);
1501 TREE_REALPART (t) = real;
1502 TREE_IMAGPART (t) = imag;
1503 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1504 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1508 /* Return a constant of arithmetic type TYPE which is the
1509 multiplicative identity of the set TYPE. */
1512 build_one_cst (tree type)
1514 switch (TREE_CODE (type))
1516 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1517 case POINTER_TYPE: case REFERENCE_TYPE:
1519 return build_int_cst (type, 1);
1522 return build_real (type, dconst1);
1524 case FIXED_POINT_TYPE:
1525 /* We can only generate 1 for accum types. */
1526 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1527 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1534 scalar = build_one_cst (TREE_TYPE (type));
1536 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1538 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1539 cst = tree_cons (NULL_TREE, scalar, cst);
1541 return build_vector (type, cst);
1545 return build_complex (type,
1546 build_one_cst (TREE_TYPE (type)),
1547 fold_convert (TREE_TYPE (type), integer_zero_node));
1554 /* Build a BINFO with LEN language slots. */
1557 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1560 size_t length = (offsetof (struct tree_binfo, base_binfos)
1561 + VEC_embedded_size (tree, base_binfos));
1563 #ifdef GATHER_STATISTICS
1564 tree_node_counts[(int) binfo_kind]++;
1565 tree_node_sizes[(int) binfo_kind] += length;
1568 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1570 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1572 TREE_SET_CODE (t, TREE_BINFO);
1574 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1580 /* Build a newly constructed TREE_VEC node of length LEN. */
1583 make_tree_vec_stat (int len MEM_STAT_DECL)
1586 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1588 #ifdef GATHER_STATISTICS
1589 tree_node_counts[(int) vec_kind]++;
1590 tree_node_sizes[(int) vec_kind] += length;
1593 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1595 memset (t, 0, length);
1597 TREE_SET_CODE (t, TREE_VEC);
1598 TREE_VEC_LENGTH (t) = len;
1603 /* Return 1 if EXPR is the integer constant zero or a complex constant
1607 integer_zerop (const_tree expr)
1611 return ((TREE_CODE (expr) == INTEGER_CST
1612 && TREE_INT_CST_LOW (expr) == 0
1613 && TREE_INT_CST_HIGH (expr) == 0)
1614 || (TREE_CODE (expr) == COMPLEX_CST
1615 && integer_zerop (TREE_REALPART (expr))
1616 && integer_zerop (TREE_IMAGPART (expr))));
1619 /* Return 1 if EXPR is the integer constant one or the corresponding
1620 complex constant. */
1623 integer_onep (const_tree expr)
1627 return ((TREE_CODE (expr) == INTEGER_CST
1628 && TREE_INT_CST_LOW (expr) == 1
1629 && TREE_INT_CST_HIGH (expr) == 0)
1630 || (TREE_CODE (expr) == COMPLEX_CST
1631 && integer_onep (TREE_REALPART (expr))
1632 && integer_zerop (TREE_IMAGPART (expr))));
1635 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1636 it contains. Likewise for the corresponding complex constant. */
1639 integer_all_onesp (const_tree expr)
1646 if (TREE_CODE (expr) == COMPLEX_CST
1647 && integer_all_onesp (TREE_REALPART (expr))
1648 && integer_zerop (TREE_IMAGPART (expr)))
1651 else if (TREE_CODE (expr) != INTEGER_CST)
1654 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1655 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1656 && TREE_INT_CST_HIGH (expr) == -1)
1661 /* Note that using TYPE_PRECISION here is wrong. We care about the
1662 actual bits, not the (arbitrary) range of the type. */
1663 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1664 if (prec >= HOST_BITS_PER_WIDE_INT)
1666 HOST_WIDE_INT high_value;
1669 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1671 /* Can not handle precisions greater than twice the host int size. */
1672 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1673 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1674 /* Shifting by the host word size is undefined according to the ANSI
1675 standard, so we must handle this as a special case. */
1678 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1680 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1681 && TREE_INT_CST_HIGH (expr) == high_value);
1684 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1687 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1691 integer_pow2p (const_tree expr)
1694 HOST_WIDE_INT high, low;
1698 if (TREE_CODE (expr) == COMPLEX_CST
1699 && integer_pow2p (TREE_REALPART (expr))
1700 && integer_zerop (TREE_IMAGPART (expr)))
1703 if (TREE_CODE (expr) != INTEGER_CST)
1706 prec = TYPE_PRECISION (TREE_TYPE (expr));
1707 high = TREE_INT_CST_HIGH (expr);
1708 low = TREE_INT_CST_LOW (expr);
1710 /* First clear all bits that are beyond the type's precision in case
1711 we've been sign extended. */
1713 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1715 else if (prec > HOST_BITS_PER_WIDE_INT)
1716 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1720 if (prec < HOST_BITS_PER_WIDE_INT)
1721 low &= ~((HOST_WIDE_INT) (-1) << prec);
1724 if (high == 0 && low == 0)
1727 return ((high == 0 && (low & (low - 1)) == 0)
1728 || (low == 0 && (high & (high - 1)) == 0));
1731 /* Return 1 if EXPR is an integer constant other than zero or a
1732 complex constant other than zero. */
1735 integer_nonzerop (const_tree expr)
1739 return ((TREE_CODE (expr) == INTEGER_CST
1740 && (TREE_INT_CST_LOW (expr) != 0
1741 || TREE_INT_CST_HIGH (expr) != 0))
1742 || (TREE_CODE (expr) == COMPLEX_CST
1743 && (integer_nonzerop (TREE_REALPART (expr))
1744 || integer_nonzerop (TREE_IMAGPART (expr)))));
1747 /* Return 1 if EXPR is the fixed-point constant zero. */
1750 fixed_zerop (const_tree expr)
1752 return (TREE_CODE (expr) == FIXED_CST
1753 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1756 /* Return the power of two represented by a tree node known to be a
1760 tree_log2 (const_tree expr)
1763 HOST_WIDE_INT high, low;
1767 if (TREE_CODE (expr) == COMPLEX_CST)
1768 return tree_log2 (TREE_REALPART (expr));
1770 prec = TYPE_PRECISION (TREE_TYPE (expr));
1771 high = TREE_INT_CST_HIGH (expr);
1772 low = TREE_INT_CST_LOW (expr);
1774 /* First clear all bits that are beyond the type's precision in case
1775 we've been sign extended. */
1777 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1779 else if (prec > HOST_BITS_PER_WIDE_INT)
1780 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1784 if (prec < HOST_BITS_PER_WIDE_INT)
1785 low &= ~((HOST_WIDE_INT) (-1) << prec);
1788 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1789 : exact_log2 (low));
1792 /* Similar, but return the largest integer Y such that 2 ** Y is less
1793 than or equal to EXPR. */
1796 tree_floor_log2 (const_tree expr)
1799 HOST_WIDE_INT high, low;
1803 if (TREE_CODE (expr) == COMPLEX_CST)
1804 return tree_log2 (TREE_REALPART (expr));
1806 prec = TYPE_PRECISION (TREE_TYPE (expr));
1807 high = TREE_INT_CST_HIGH (expr);
1808 low = TREE_INT_CST_LOW (expr);
1810 /* First clear all bits that are beyond the type's precision in case
1811 we've been sign extended. Ignore if type's precision hasn't been set
1812 since what we are doing is setting it. */
1814 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1816 else if (prec > HOST_BITS_PER_WIDE_INT)
1817 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1821 if (prec < HOST_BITS_PER_WIDE_INT)
1822 low &= ~((HOST_WIDE_INT) (-1) << prec);
1825 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1826 : floor_log2 (low));
1829 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1830 decimal float constants, so don't return 1 for them. */
1833 real_zerop (const_tree expr)
1837 return ((TREE_CODE (expr) == REAL_CST
1838 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1839 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1840 || (TREE_CODE (expr) == COMPLEX_CST
1841 && real_zerop (TREE_REALPART (expr))
1842 && real_zerop (TREE_IMAGPART (expr))));
1845 /* Return 1 if EXPR is the real constant one in real or complex form.
1846 Trailing zeroes matter for decimal float constants, so don't return
1850 real_onep (const_tree expr)
1854 return ((TREE_CODE (expr) == REAL_CST
1855 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1856 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1857 || (TREE_CODE (expr) == COMPLEX_CST
1858 && real_onep (TREE_REALPART (expr))
1859 && real_zerop (TREE_IMAGPART (expr))));
1862 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1863 for decimal float constants, so don't return 1 for them. */
1866 real_twop (const_tree expr)
1870 return ((TREE_CODE (expr) == REAL_CST
1871 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1872 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1873 || (TREE_CODE (expr) == COMPLEX_CST
1874 && real_twop (TREE_REALPART (expr))
1875 && real_zerop (TREE_IMAGPART (expr))));
1878 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1879 matter for decimal float constants, so don't return 1 for them. */
1882 real_minus_onep (const_tree expr)
1886 return ((TREE_CODE (expr) == REAL_CST
1887 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1888 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1889 || (TREE_CODE (expr) == COMPLEX_CST
1890 && real_minus_onep (TREE_REALPART (expr))
1891 && real_zerop (TREE_IMAGPART (expr))));
1894 /* Nonzero if EXP is a constant or a cast of a constant. */
1897 really_constant_p (const_tree exp)
1899 /* This is not quite the same as STRIP_NOPS. It does more. */
1900 while (CONVERT_EXPR_P (exp)
1901 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1902 exp = TREE_OPERAND (exp, 0);
1903 return TREE_CONSTANT (exp);
1906 /* Return first list element whose TREE_VALUE is ELEM.
1907 Return 0 if ELEM is not in LIST. */
1910 value_member (tree elem, tree list)
1914 if (elem == TREE_VALUE (list))
1916 list = TREE_CHAIN (list);
1921 /* Return first list element whose TREE_PURPOSE is ELEM.
1922 Return 0 if ELEM is not in LIST. */
1925 purpose_member (const_tree elem, tree list)
1929 if (elem == TREE_PURPOSE (list))
1931 list = TREE_CHAIN (list);
1936 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1940 chain_index (int idx, tree chain)
1942 for (; chain && idx > 0; --idx)
1943 chain = TREE_CHAIN (chain);
1947 /* Return nonzero if ELEM is part of the chain CHAIN. */
1950 chain_member (const_tree elem, const_tree chain)
1956 chain = TREE_CHAIN (chain);
1962 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1963 We expect a null pointer to mark the end of the chain.
1964 This is the Lisp primitive `length'. */
1967 list_length (const_tree t)
1970 #ifdef ENABLE_TREE_CHECKING
1978 #ifdef ENABLE_TREE_CHECKING
1981 gcc_assert (p != q);
1989 /* Returns the number of FIELD_DECLs in TYPE. */
1992 fields_length (const_tree type)
1994 tree t = TYPE_FIELDS (type);
1997 for (; t; t = TREE_CHAIN (t))
1998 if (TREE_CODE (t) == FIELD_DECL)
2004 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2005 UNION_TYPE TYPE, or NULL_TREE if none. */
2008 first_field (const_tree type)
2010 tree t = TYPE_FIELDS (type);
2011 while (t && TREE_CODE (t) != FIELD_DECL)
2016 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2017 by modifying the last node in chain 1 to point to chain 2.
2018 This is the Lisp primitive `nconc'. */
2021 chainon (tree op1, tree op2)
2030 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2032 TREE_CHAIN (t1) = op2;
2034 #ifdef ENABLE_TREE_CHECKING
2037 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2038 gcc_assert (t2 != t1);
2045 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2048 tree_last (tree chain)
2052 while ((next = TREE_CHAIN (chain)))
2057 /* Reverse the order of elements in the chain T,
2058 and return the new head of the chain (old last element). */
2063 tree prev = 0, decl, next;
2064 for (decl = t; decl; decl = next)
2066 next = TREE_CHAIN (decl);
2067 TREE_CHAIN (decl) = prev;
2073 /* Return a newly created TREE_LIST node whose
2074 purpose and value fields are PARM and VALUE. */
2077 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2079 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2080 TREE_PURPOSE (t) = parm;
2081 TREE_VALUE (t) = value;
2085 /* Build a chain of TREE_LIST nodes from a vector. */
2088 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2090 tree ret = NULL_TREE;
2094 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2096 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2097 pp = &TREE_CHAIN (*pp);
2102 /* Return a newly created TREE_LIST node whose
2103 purpose and value fields are PURPOSE and VALUE
2104 and whose TREE_CHAIN is CHAIN. */
2107 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2111 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2113 memset (node, 0, sizeof (struct tree_common));
2115 #ifdef GATHER_STATISTICS
2116 tree_node_counts[(int) x_kind]++;
2117 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2120 TREE_SET_CODE (node, TREE_LIST);
2121 TREE_CHAIN (node) = chain;
2122 TREE_PURPOSE (node) = purpose;
2123 TREE_VALUE (node) = value;
2127 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2131 ctor_to_vec (tree ctor)
2133 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2137 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2138 VEC_quick_push (tree, vec, val);
2143 /* Return the size nominally occupied by an object of type TYPE
2144 when it resides in memory. The value is measured in units of bytes,
2145 and its data type is that normally used for type sizes
2146 (which is the first type created by make_signed_type or
2147 make_unsigned_type). */
2150 size_in_bytes (const_tree type)
2154 if (type == error_mark_node)
2155 return integer_zero_node;
2157 type = TYPE_MAIN_VARIANT (type);
2158 t = TYPE_SIZE_UNIT (type);
2162 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2163 return size_zero_node;
2169 /* Return the size of TYPE (in bytes) as a wide integer
2170 or return -1 if the size can vary or is larger than an integer. */
2173 int_size_in_bytes (const_tree type)
2177 if (type == error_mark_node)
2180 type = TYPE_MAIN_VARIANT (type);
2181 t = TYPE_SIZE_UNIT (type);
2183 || TREE_CODE (t) != INTEGER_CST
2184 || TREE_INT_CST_HIGH (t) != 0
2185 /* If the result would appear negative, it's too big to represent. */
2186 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2189 return TREE_INT_CST_LOW (t);
2192 /* Return the maximum size of TYPE (in bytes) as a wide integer
2193 or return -1 if the size can vary or is larger than an integer. */
2196 max_int_size_in_bytes (const_tree type)
2198 HOST_WIDE_INT size = -1;
2201 /* If this is an array type, check for a possible MAX_SIZE attached. */
2203 if (TREE_CODE (type) == ARRAY_TYPE)
2205 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2207 if (size_tree && host_integerp (size_tree, 1))
2208 size = tree_low_cst (size_tree, 1);
2211 /* If we still haven't been able to get a size, see if the language
2212 can compute a maximum size. */
2216 size_tree = lang_hooks.types.max_size (type);
2218 if (size_tree && host_integerp (size_tree, 1))
2219 size = tree_low_cst (size_tree, 1);
2225 /* Returns a tree for the size of EXP in bytes. */
2228 tree_expr_size (const_tree exp)
2231 && DECL_SIZE_UNIT (exp) != 0)
2232 return DECL_SIZE_UNIT (exp);
2234 return size_in_bytes (TREE_TYPE (exp));
2237 /* Return the bit position of FIELD, in bits from the start of the record.
2238 This is a tree of type bitsizetype. */
2241 bit_position (const_tree field)
2243 return bit_from_pos (DECL_FIELD_OFFSET (field),
2244 DECL_FIELD_BIT_OFFSET (field));
2247 /* Likewise, but return as an integer. It must be representable in
2248 that way (since it could be a signed value, we don't have the
2249 option of returning -1 like int_size_in_byte can. */
2252 int_bit_position (const_tree field)
2254 return tree_low_cst (bit_position (field), 0);
2257 /* Return the byte position of FIELD, in bytes from the start of the record.
2258 This is a tree of type sizetype. */
2261 byte_position (const_tree field)
2263 return byte_from_pos (DECL_FIELD_OFFSET (field),
2264 DECL_FIELD_BIT_OFFSET (field));
2267 /* Likewise, but return as an integer. It must be representable in
2268 that way (since it could be a signed value, we don't have the
2269 option of returning -1 like int_size_in_byte can. */
2272 int_byte_position (const_tree field)
2274 return tree_low_cst (byte_position (field), 0);
2277 /* Return the strictest alignment, in bits, that T is known to have. */
2280 expr_align (const_tree t)
2282 unsigned int align0, align1;
2284 switch (TREE_CODE (t))
2286 CASE_CONVERT: case NON_LVALUE_EXPR:
2287 /* If we have conversions, we know that the alignment of the
2288 object must meet each of the alignments of the types. */
2289 align0 = expr_align (TREE_OPERAND (t, 0));
2290 align1 = TYPE_ALIGN (TREE_TYPE (t));
2291 return MAX (align0, align1);
2293 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2294 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2295 case CLEANUP_POINT_EXPR:
2296 /* These don't change the alignment of an object. */
2297 return expr_align (TREE_OPERAND (t, 0));
2300 /* The best we can do is say that the alignment is the least aligned
2302 align0 = expr_align (TREE_OPERAND (t, 1));
2303 align1 = expr_align (TREE_OPERAND (t, 2));
2304 return MIN (align0, align1);
2306 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2307 meaningfully, it's always 1. */
2308 case LABEL_DECL: case CONST_DECL:
2309 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2311 gcc_assert (DECL_ALIGN (t) != 0);
2312 return DECL_ALIGN (t);
2318 /* Otherwise take the alignment from that of the type. */
2319 return TYPE_ALIGN (TREE_TYPE (t));
2322 /* Return, as a tree node, the number of elements for TYPE (which is an
2323 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2326 array_type_nelts (const_tree type)
2328 tree index_type, min, max;
2330 /* If they did it with unspecified bounds, then we should have already
2331 given an error about it before we got here. */
2332 if (! TYPE_DOMAIN (type))
2333 return error_mark_node;
2335 index_type = TYPE_DOMAIN (type);
2336 min = TYPE_MIN_VALUE (index_type);
2337 max = TYPE_MAX_VALUE (index_type);
2339 return (integer_zerop (min)
2341 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2344 /* If arg is static -- a reference to an object in static storage -- then
2345 return the object. This is not the same as the C meaning of `static'.
2346 If arg isn't static, return NULL. */
2351 switch (TREE_CODE (arg))
2354 /* Nested functions are static, even though taking their address will
2355 involve a trampoline as we unnest the nested function and create
2356 the trampoline on the tree level. */
2360 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2361 && ! DECL_THREAD_LOCAL_P (arg)
2362 && ! DECL_DLLIMPORT_P (arg)
2366 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2370 return TREE_STATIC (arg) ? arg : NULL;
2377 /* If the thing being referenced is not a field, then it is
2378 something language specific. */
2379 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2381 /* If we are referencing a bitfield, we can't evaluate an
2382 ADDR_EXPR at compile time and so it isn't a constant. */
2383 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2386 return staticp (TREE_OPERAND (arg, 0));
2391 case MISALIGNED_INDIRECT_REF:
2392 case ALIGN_INDIRECT_REF:
2394 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2397 case ARRAY_RANGE_REF:
2398 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2399 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2400 return staticp (TREE_OPERAND (arg, 0));
2404 case COMPOUND_LITERAL_EXPR:
2405 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2415 /* Return whether OP is a DECL whose address is function-invariant. */
2418 decl_address_invariant_p (const_tree op)
2420 /* The conditions below are slightly less strict than the one in
2423 switch (TREE_CODE (op))
2432 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2433 && !DECL_DLLIMPORT_P (op))
2434 || DECL_THREAD_LOCAL_P (op)
2435 || DECL_CONTEXT (op) == current_function_decl
2436 || decl_function_context (op) == current_function_decl)
2441 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2442 || decl_function_context (op) == current_function_decl)
2453 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2456 decl_address_ip_invariant_p (const_tree op)
2458 /* The conditions below are slightly less strict than the one in
2461 switch (TREE_CODE (op))
2469 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2470 && !DECL_DLLIMPORT_P (op))
2471 || DECL_THREAD_LOCAL_P (op))
2476 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2488 /* Return true if T is function-invariant (internal function, does
2489 not handle arithmetic; that's handled in skip_simple_arithmetic and
2490 tree_invariant_p). */
2492 static bool tree_invariant_p (tree t);
2495 tree_invariant_p_1 (tree t)
2499 if (TREE_CONSTANT (t)
2500 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2503 switch (TREE_CODE (t))
2509 op = TREE_OPERAND (t, 0);
2510 while (handled_component_p (op))
2512 switch (TREE_CODE (op))
2515 case ARRAY_RANGE_REF:
2516 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2517 || TREE_OPERAND (op, 2) != NULL_TREE
2518 || TREE_OPERAND (op, 3) != NULL_TREE)
2523 if (TREE_OPERAND (op, 2) != NULL_TREE)
2529 op = TREE_OPERAND (op, 0);
2532 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2541 /* Return true if T is function-invariant. */
2544 tree_invariant_p (tree t)
2546 tree inner = skip_simple_arithmetic (t);
2547 return tree_invariant_p_1 (inner);
2550 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2551 Do this to any expression which may be used in more than one place,
2552 but must be evaluated only once.
2554 Normally, expand_expr would reevaluate the expression each time.
2555 Calling save_expr produces something that is evaluated and recorded
2556 the first time expand_expr is called on it. Subsequent calls to
2557 expand_expr just reuse the recorded value.
2559 The call to expand_expr that generates code that actually computes
2560 the value is the first call *at compile time*. Subsequent calls
2561 *at compile time* generate code to use the saved value.
2562 This produces correct result provided that *at run time* control
2563 always flows through the insns made by the first expand_expr
2564 before reaching the other places where the save_expr was evaluated.
2565 You, the caller of save_expr, must make sure this is so.
2567 Constants, and certain read-only nodes, are returned with no
2568 SAVE_EXPR because that is safe. Expressions containing placeholders
2569 are not touched; see tree.def for an explanation of what these
2573 save_expr (tree expr)
2575 tree t = fold (expr);
2578 /* If the tree evaluates to a constant, then we don't want to hide that
2579 fact (i.e. this allows further folding, and direct checks for constants).
2580 However, a read-only object that has side effects cannot be bypassed.
2581 Since it is no problem to reevaluate literals, we just return the
2583 inner = skip_simple_arithmetic (t);
2584 if (TREE_CODE (inner) == ERROR_MARK)
2587 if (tree_invariant_p_1 (inner))
2590 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2591 it means that the size or offset of some field of an object depends on
2592 the value within another field.
2594 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2595 and some variable since it would then need to be both evaluated once and
2596 evaluated more than once. Front-ends must assure this case cannot
2597 happen by surrounding any such subexpressions in their own SAVE_EXPR
2598 and forcing evaluation at the proper time. */
2599 if (contains_placeholder_p (inner))
2602 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2603 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2605 /* This expression might be placed ahead of a jump to ensure that the
2606 value was computed on both sides of the jump. So make sure it isn't
2607 eliminated as dead. */
2608 TREE_SIDE_EFFECTS (t) = 1;
2612 /* Look inside EXPR and into any simple arithmetic operations. Return
2613 the innermost non-arithmetic node. */
2616 skip_simple_arithmetic (tree expr)
2620 /* We don't care about whether this can be used as an lvalue in this
2622 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2623 expr = TREE_OPERAND (expr, 0);
2625 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2626 a constant, it will be more efficient to not make another SAVE_EXPR since
2627 it will allow better simplification and GCSE will be able to merge the
2628 computations if they actually occur. */
2632 if (UNARY_CLASS_P (inner))
2633 inner = TREE_OPERAND (inner, 0);
2634 else if (BINARY_CLASS_P (inner))
2636 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2637 inner = TREE_OPERAND (inner, 0);
2638 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2639 inner = TREE_OPERAND (inner, 1);
2651 /* Return which tree structure is used by T. */
2653 enum tree_node_structure_enum
2654 tree_node_structure (const_tree t)
2656 const enum tree_code code = TREE_CODE (t);
2657 return tree_node_structure_for_code (code);
2660 /* Set various status flags when building a CALL_EXPR object T. */
2663 process_call_operands (tree t)
2665 bool side_effects = TREE_SIDE_EFFECTS (t);
2666 bool read_only = false;
2667 int i = call_expr_flags (t);
2669 /* Calls have side-effects, except those to const or pure functions. */
2670 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2671 side_effects = true;
2672 /* Propagate TREE_READONLY of arguments for const functions. */
2676 if (!side_effects || read_only)
2677 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2679 tree op = TREE_OPERAND (t, i);
2680 if (op && TREE_SIDE_EFFECTS (op))
2681 side_effects = true;
2682 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2686 TREE_SIDE_EFFECTS (t) = side_effects;
2687 TREE_READONLY (t) = read_only;
2690 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2691 or offset that depends on a field within a record. */
2694 contains_placeholder_p (const_tree exp)
2696 enum tree_code code;
2701 code = TREE_CODE (exp);
2702 if (code == PLACEHOLDER_EXPR)
2705 switch (TREE_CODE_CLASS (code))
2708 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2709 position computations since they will be converted into a
2710 WITH_RECORD_EXPR involving the reference, which will assume
2711 here will be valid. */
2712 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2714 case tcc_exceptional:
2715 if (code == TREE_LIST)
2716 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2717 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2722 case tcc_comparison:
2723 case tcc_expression:
2727 /* Ignoring the first operand isn't quite right, but works best. */
2728 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2731 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2732 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2733 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2736 /* The save_expr function never wraps anything containing
2737 a PLACEHOLDER_EXPR. */
2744 switch (TREE_CODE_LENGTH (code))
2747 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2749 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2750 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2761 const_call_expr_arg_iterator iter;
2762 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2763 if (CONTAINS_PLACEHOLDER_P (arg))
2777 /* Return true if any part of the computation of TYPE involves a
2778 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2779 (for QUAL_UNION_TYPE) and field positions. */
2782 type_contains_placeholder_1 (const_tree type)
2784 /* If the size contains a placeholder or the parent type (component type in
2785 the case of arrays) type involves a placeholder, this type does. */
2786 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2787 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2788 || (TREE_TYPE (type) != 0
2789 && type_contains_placeholder_p (TREE_TYPE (type))))
2792 /* Now do type-specific checks. Note that the last part of the check above
2793 greatly limits what we have to do below. */
2794 switch (TREE_CODE (type))
2802 case REFERENCE_TYPE:
2810 case FIXED_POINT_TYPE:
2811 /* Here we just check the bounds. */
2812 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2813 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2816 /* We're already checked the component type (TREE_TYPE), so just check
2818 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2822 case QUAL_UNION_TYPE:
2826 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2827 if (TREE_CODE (field) == FIELD_DECL
2828 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2829 || (TREE_CODE (type) == QUAL_UNION_TYPE
2830 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2831 || type_contains_placeholder_p (TREE_TYPE (field))))
2843 type_contains_placeholder_p (tree type)
2847 /* If the contains_placeholder_bits field has been initialized,
2848 then we know the answer. */
2849 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2850 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2852 /* Indicate that we've seen this type node, and the answer is false.
2853 This is what we want to return if we run into recursion via fields. */
2854 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2856 /* Compute the real value. */
2857 result = type_contains_placeholder_1 (type);
2859 /* Store the real value. */
2860 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2865 /* Push tree EXP onto vector QUEUE if it is not already present. */
2868 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2873 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2874 if (simple_cst_equal (iter, exp) == 1)
2878 VEC_safe_push (tree, heap, *queue, exp);
2881 /* Given a tree EXP, find all occurences of references to fields
2882 in a PLACEHOLDER_EXPR and place them in vector REFS without
2883 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2884 we assume here that EXP contains only arithmetic expressions
2885 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2889 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2891 enum tree_code code = TREE_CODE (exp);
2895 /* We handle TREE_LIST and COMPONENT_REF separately. */
2896 if (code == TREE_LIST)
2898 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2899 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2901 else if (code == COMPONENT_REF)
2903 for (inner = TREE_OPERAND (exp, 0);
2904 REFERENCE_CLASS_P (inner);
2905 inner = TREE_OPERAND (inner, 0))
2908 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2909 push_without_duplicates (exp, refs);
2911 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2914 switch (TREE_CODE_CLASS (code))
2919 case tcc_declaration:
2920 /* Variables allocated to static storage can stay. */
2921 if (!TREE_STATIC (exp))
2922 push_without_duplicates (exp, refs);
2925 case tcc_expression:
2926 /* This is the pattern built in ada/make_aligning_type. */
2927 if (code == ADDR_EXPR
2928 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2930 push_without_duplicates (exp, refs);
2934 /* Fall through... */
2936 case tcc_exceptional:
2939 case tcc_comparison:
2941 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2942 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2946 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2947 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2955 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2956 return a tree with all occurrences of references to F in a
2957 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2958 CONST_DECLs. Note that we assume here that EXP contains only
2959 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2960 occurring only in their argument list. */
2963 substitute_in_expr (tree exp, tree f, tree r)
2965 enum tree_code code = TREE_CODE (exp);
2966 tree op0, op1, op2, op3;
2969 /* We handle TREE_LIST and COMPONENT_REF separately. */
2970 if (code == TREE_LIST)
2972 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2973 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2974 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2977 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2979 else if (code == COMPONENT_REF)
2983 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2984 and it is the right field, replace it with R. */
2985 for (inner = TREE_OPERAND (exp, 0);
2986 REFERENCE_CLASS_P (inner);
2987 inner = TREE_OPERAND (inner, 0))
2991 op1 = TREE_OPERAND (exp, 1);
2993 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2996 /* If this expression hasn't been completed let, leave it alone. */
2997 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3000 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3001 if (op0 == TREE_OPERAND (exp, 0))
3005 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3008 switch (TREE_CODE_CLASS (code))
3013 case tcc_declaration:
3019 case tcc_expression:
3023 /* Fall through... */
3025 case tcc_exceptional:
3028 case tcc_comparison:
3030 switch (TREE_CODE_LENGTH (code))
3036 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3037 if (op0 == TREE_OPERAND (exp, 0))
3040 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3044 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3045 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3047 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3050 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3054 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3055 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3056 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3058 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3059 && op2 == TREE_OPERAND (exp, 2))
3062 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3066 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3067 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3068 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3069 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3071 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3072 && op2 == TREE_OPERAND (exp, 2)
3073 && op3 == TREE_OPERAND (exp, 3))
3077 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3089 new_tree = NULL_TREE;
3091 /* If we are trying to replace F with a constant, inline back
3092 functions which do nothing else than computing a value from
3093 the arguments they are passed. This makes it possible to
3094 fold partially or entirely the replacement expression. */
3095 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3097 tree t = maybe_inline_call_in_expr (exp);
3099 return SUBSTITUTE_IN_EXPR (t, f, r);
3102 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3104 tree op = TREE_OPERAND (exp, i);
3105 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3109 new_tree = copy_node (exp);
3110 TREE_OPERAND (new_tree, i) = new_op;
3116 new_tree = fold (new_tree);
3117 if (TREE_CODE (new_tree) == CALL_EXPR)
3118 process_call_operands (new_tree);
3129 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3133 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3134 for it within OBJ, a tree that is an object or a chain of references. */
3137 substitute_placeholder_in_expr (tree exp, tree obj)
3139 enum tree_code code = TREE_CODE (exp);
3140 tree op0, op1, op2, op3;
3143 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3144 in the chain of OBJ. */
3145 if (code == PLACEHOLDER_EXPR)
3147 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3150 for (elt = obj; elt != 0;
3151 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3152 || TREE_CODE (elt) == COND_EXPR)
3153 ? TREE_OPERAND (elt, 1)
3154 : (REFERENCE_CLASS_P (elt)
3155 || UNARY_CLASS_P (elt)
3156 || BINARY_CLASS_P (elt)
3157 || VL_EXP_CLASS_P (elt)
3158 || EXPRESSION_CLASS_P (elt))
3159 ? TREE_OPERAND (elt, 0) : 0))
3160 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3163 for (elt = obj; elt != 0;
3164 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3165 || TREE_CODE (elt) == COND_EXPR)
3166 ? TREE_OPERAND (elt, 1)
3167 : (REFERENCE_CLASS_P (elt)
3168 || UNARY_CLASS_P (elt)
3169 || BINARY_CLASS_P (elt)
3170 || VL_EXP_CLASS_P (elt)
3171 || EXPRESSION_CLASS_P (elt))
3172 ? TREE_OPERAND (elt, 0) : 0))
3173 if (POINTER_TYPE_P (TREE_TYPE (elt))
3174 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3176 return fold_build1 (INDIRECT_REF, need_type, elt);
3178 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3179 survives until RTL generation, there will be an error. */
3183 /* TREE_LIST is special because we need to look at TREE_VALUE
3184 and TREE_CHAIN, not TREE_OPERANDS. */
3185 else if (code == TREE_LIST)
3187 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3188 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3189 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3192 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3195 switch (TREE_CODE_CLASS (code))
3198 case tcc_declaration:
3201 case tcc_exceptional:
3204 case tcc_comparison:
3205 case tcc_expression:
3208 switch (TREE_CODE_LENGTH (code))
3214 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3215 if (op0 == TREE_OPERAND (exp, 0))
3218 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3222 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3223 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3225 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3228 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3232 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3233 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3234 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3236 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3237 && op2 == TREE_OPERAND (exp, 2))
3240 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3244 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3245 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3246 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3247 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3249 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3250 && op2 == TREE_OPERAND (exp, 2)
3251 && op3 == TREE_OPERAND (exp, 3))
3255 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3267 new_tree = NULL_TREE;
3269 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3271 tree op = TREE_OPERAND (exp, i);
3272 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3276 new_tree = copy_node (exp);
3277 TREE_OPERAND (new_tree, i) = new_op;
3283 new_tree = fold (new_tree);
3284 if (TREE_CODE (new_tree) == CALL_EXPR)
3285 process_call_operands (new_tree);
3296 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3300 /* Stabilize a reference so that we can use it any number of times
3301 without causing its operands to be evaluated more than once.
3302 Returns the stabilized reference. This works by means of save_expr,
3303 so see the caveats in the comments about save_expr.
3305 Also allows conversion expressions whose operands are references.
3306 Any other kind of expression is returned unchanged. */
3309 stabilize_reference (tree ref)
3312 enum tree_code code = TREE_CODE (ref);
3319 /* No action is needed in this case. */
3324 case FIX_TRUNC_EXPR:
3325 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3329 result = build_nt (INDIRECT_REF,
3330 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3334 result = build_nt (COMPONENT_REF,
3335 stabilize_reference (TREE_OPERAND (ref, 0)),
3336 TREE_OPERAND (ref, 1), NULL_TREE);
3340 result = build_nt (BIT_FIELD_REF,
3341 stabilize_reference (TREE_OPERAND (ref, 0)),
3342 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3343 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3347 result = build_nt (ARRAY_REF,
3348 stabilize_reference (TREE_OPERAND (ref, 0)),
3349 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3350 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3353 case ARRAY_RANGE_REF:
3354 result = build_nt (ARRAY_RANGE_REF,
3355 stabilize_reference (TREE_OPERAND (ref, 0)),
3356 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3357 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3361 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3362 it wouldn't be ignored. This matters when dealing with
3364 return stabilize_reference_1 (ref);
3366 /* If arg isn't a kind of lvalue we recognize, make no change.
3367 Caller should recognize the error for an invalid lvalue. */
3372 return error_mark_node;
3375 TREE_TYPE (result) = TREE_TYPE (ref);
3376 TREE_READONLY (result) = TREE_READONLY (ref);
3377 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3378 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3383 /* Subroutine of stabilize_reference; this is called for subtrees of
3384 references. Any expression with side-effects must be put in a SAVE_EXPR
3385 to ensure that it is only evaluated once.
3387 We don't put SAVE_EXPR nodes around everything, because assigning very
3388 simple expressions to temporaries causes us to miss good opportunities
3389 for optimizations. Among other things, the opportunity to fold in the
3390 addition of a constant into an addressing mode often gets lost, e.g.
3391 "y[i+1] += x;". In general, we take the approach that we should not make
3392 an assignment unless we are forced into it - i.e., that any non-side effect
3393 operator should be allowed, and that cse should take care of coalescing
3394 multiple utterances of the same expression should that prove fruitful. */
3397 stabilize_reference_1 (tree e)
3400 enum tree_code code = TREE_CODE (e);
3402 /* We cannot ignore const expressions because it might be a reference
3403 to a const array but whose index contains side-effects. But we can
3404 ignore things that are actual constant or that already have been
3405 handled by this function. */
3407 if (tree_invariant_p (e))
3410 switch (TREE_CODE_CLASS (code))
3412 case tcc_exceptional:
3414 case tcc_declaration:
3415 case tcc_comparison:
3417 case tcc_expression:
3420 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3421 so that it will only be evaluated once. */
3422 /* The reference (r) and comparison (<) classes could be handled as
3423 below, but it is generally faster to only evaluate them once. */
3424 if (TREE_SIDE_EFFECTS (e))
3425 return save_expr (e);
3429 /* Constants need no processing. In fact, we should never reach
3434 /* Division is slow and tends to be compiled with jumps,
3435 especially the division by powers of 2 that is often
3436 found inside of an array reference. So do it just once. */
3437 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3438 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3439 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3440 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3441 return save_expr (e);
3442 /* Recursively stabilize each operand. */
3443 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3444 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3448 /* Recursively stabilize each operand. */
3449 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3456 TREE_TYPE (result) = TREE_TYPE (e);
3457 TREE_READONLY (result) = TREE_READONLY (e);
3458 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3459 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3464 /* Low-level constructors for expressions. */
3466 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3467 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3470 recompute_tree_invariant_for_addr_expr (tree t)
3473 bool tc = true, se = false;
3475 /* We started out assuming this address is both invariant and constant, but
3476 does not have side effects. Now go down any handled components and see if
3477 any of them involve offsets that are either non-constant or non-invariant.
3478 Also check for side-effects.
3480 ??? Note that this code makes no attempt to deal with the case where
3481 taking the address of something causes a copy due to misalignment. */
3483 #define UPDATE_FLAGS(NODE) \
3484 do { tree _node = (NODE); \
3485 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3486 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3488 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3489 node = TREE_OPERAND (node, 0))
3491 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3492 array reference (probably made temporarily by the G++ front end),
3493 so ignore all the operands. */
3494 if ((TREE_CODE (node) == ARRAY_REF
3495 || TREE_CODE (node) == ARRAY_RANGE_REF)
3496 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3498 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3499 if (TREE_OPERAND (node, 2))
3500 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3501 if (TREE_OPERAND (node, 3))
3502 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3504 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3505 FIELD_DECL, apparently. The G++ front end can put something else
3506 there, at least temporarily. */
3507 else if (TREE_CODE (node) == COMPONENT_REF
3508 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3510 if (TREE_OPERAND (node, 2))
3511 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3513 else if (TREE_CODE (node) == BIT_FIELD_REF)
3514 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3517 node = lang_hooks.expr_to_decl (node, &tc, &se);
3519 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3520 the address, since &(*a)->b is a form of addition. If it's a constant, the
3521 address is constant too. If it's a decl, its address is constant if the
3522 decl is static. Everything else is not constant and, furthermore,
3523 taking the address of a volatile variable is not volatile. */
3524 if (TREE_CODE (node) == INDIRECT_REF)
3525 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3526 else if (CONSTANT_CLASS_P (node))
3528 else if (DECL_P (node))
3529 tc &= (staticp (node) != NULL_TREE);
3533 se |= TREE_SIDE_EFFECTS (node);
3537 TREE_CONSTANT (t) = tc;
3538 TREE_SIDE_EFFECTS (t) = se;
3542 /* Build an expression of code CODE, data type TYPE, and operands as
3543 specified. Expressions and reference nodes can be created this way.
3544 Constants, decls, types and misc nodes cannot be.
3546 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3547 enough for all extant tree codes. */
3550 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3554 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3556 t = make_node_stat (code PASS_MEM_STAT);
3563 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3565 int length = sizeof (struct tree_exp);
3566 #ifdef GATHER_STATISTICS
3567 tree_node_kind kind;
3571 #ifdef GATHER_STATISTICS
3572 switch (TREE_CODE_CLASS (code))
3574 case tcc_statement: /* an expression with side effects */
3577 case tcc_reference: /* a reference */
3585 tree_node_counts[(int) kind]++;
3586 tree_node_sizes[(int) kind] += length;
3589 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3591 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3593 memset (t, 0, sizeof (struct tree_common));
3595 TREE_SET_CODE (t, code);
3597 TREE_TYPE (t) = type;
3598 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3599 TREE_OPERAND (t, 0) = node;
3600 TREE_BLOCK (t) = NULL_TREE;
3601 if (node && !TYPE_P (node))
3603 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3604 TREE_READONLY (t) = TREE_READONLY (node);
3607 if (TREE_CODE_CLASS (code) == tcc_statement)
3608 TREE_SIDE_EFFECTS (t) = 1;
3612 /* All of these have side-effects, no matter what their
3614 TREE_SIDE_EFFECTS (t) = 1;
3615 TREE_READONLY (t) = 0;
3618 case MISALIGNED_INDIRECT_REF:
3619 case ALIGN_INDIRECT_REF:
3621 /* Whether a dereference is readonly has nothing to do with whether
3622 its operand is readonly. */
3623 TREE_READONLY (t) = 0;
3628 recompute_tree_invariant_for_addr_expr (t);
3632 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3633 && node && !TYPE_P (node)
3634 && TREE_CONSTANT (node))
3635 TREE_CONSTANT (t) = 1;
3636 if (TREE_CODE_CLASS (code) == tcc_reference
3637 && node && TREE_THIS_VOLATILE (node))
3638 TREE_THIS_VOLATILE (t) = 1;
3645 #define PROCESS_ARG(N) \
3647 TREE_OPERAND (t, N) = arg##N; \
3648 if (arg##N &&!TYPE_P (arg##N)) \
3650 if (TREE_SIDE_EFFECTS (arg##N)) \
3652 if (!TREE_READONLY (arg##N) \
3653 && !CONSTANT_CLASS_P (arg##N)) \
3654 (void) (read_only = 0); \
3655 if (!TREE_CONSTANT (arg##N)) \
3656 (void) (constant = 0); \
3661 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3663 bool constant, read_only, side_effects;
3666 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3668 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3669 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3670 /* When sizetype precision doesn't match that of pointers
3671 we need to be able to build explicit extensions or truncations
3672 of the offset argument. */
3673 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3674 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3675 && TREE_CODE (arg1) == INTEGER_CST);
3677 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3678 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3679 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3680 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3682 t = make_node_stat (code PASS_MEM_STAT);
3685 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3686 result based on those same flags for the arguments. But if the
3687 arguments aren't really even `tree' expressions, we shouldn't be trying
3690 /* Expressions without side effects may be constant if their
3691 arguments are as well. */
3692 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3693 || TREE_CODE_CLASS (code) == tcc_binary);
3695 side_effects = TREE_SIDE_EFFECTS (t);
3700 TREE_READONLY (t) = read_only;
3701 TREE_CONSTANT (t) = constant;
3702 TREE_SIDE_EFFECTS (t) = side_effects;
3703 TREE_THIS_VOLATILE (t)
3704 = (TREE_CODE_CLASS (code) == tcc_reference
3705 && arg0 && TREE_THIS_VOLATILE (arg0));
3712 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3713 tree arg2 MEM_STAT_DECL)
3715 bool constant, read_only, side_effects;
3718 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3719 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3721 t = make_node_stat (code PASS_MEM_STAT);
3726 /* As a special exception, if COND_EXPR has NULL branches, we
3727 assume that it is a gimple statement and always consider
3728 it to have side effects. */
3729 if (code == COND_EXPR
3730 && tt == void_type_node
3731 && arg1 == NULL_TREE
3732 && arg2 == NULL_TREE)
3733 side_effects = true;
3735 side_effects = TREE_SIDE_EFFECTS (t);
3741 if (code == COND_EXPR)
3742 TREE_READONLY (t) = read_only;
3744 TREE_SIDE_EFFECTS (t) = side_effects;
3745 TREE_THIS_VOLATILE (t)
3746 = (TREE_CODE_CLASS (code) == tcc_reference
3747 && arg0 && TREE_THIS_VOLATILE (arg0));
3753 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3754 tree arg2, tree arg3 MEM_STAT_DECL)
3756 bool constant, read_only, side_effects;
3759 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3761 t = make_node_stat (code PASS_MEM_STAT);
3764 side_effects = TREE_SIDE_EFFECTS (t);
3771 TREE_SIDE_EFFECTS (t) = side_effects;
3772 TREE_THIS_VOLATILE (t)
3773 = (TREE_CODE_CLASS (code) == tcc_reference
3774 && arg0 && TREE_THIS_VOLATILE (arg0));
3780 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3781 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3783 bool constant, read_only, side_effects;
3786 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3788 t = make_node_stat (code PASS_MEM_STAT);
3791 side_effects = TREE_SIDE_EFFECTS (t);
3799 TREE_SIDE_EFFECTS (t) = side_effects;
3800 TREE_THIS_VOLATILE (t)
3801 = (TREE_CODE_CLASS (code) == tcc_reference
3802 && arg0 && TREE_THIS_VOLATILE (arg0));
3808 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3809 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3811 bool constant, read_only, side_effects;
3814 gcc_assert (code == TARGET_MEM_REF);
3816 t = make_node_stat (code PASS_MEM_STAT);
3819 side_effects = TREE_SIDE_EFFECTS (t);
3826 if (code == TARGET_MEM_REF)
3830 TREE_SIDE_EFFECTS (t) = side_effects;
3831 TREE_THIS_VOLATILE (t)
3832 = (code == TARGET_MEM_REF
3833 && arg5 && TREE_THIS_VOLATILE (arg5));
3838 /* Similar except don't specify the TREE_TYPE
3839 and leave the TREE_SIDE_EFFECTS as 0.
3840 It is permissible for arguments to be null,
3841 or even garbage if their values do not matter. */
3844 build_nt (enum tree_code code, ...)
3851 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3855 t = make_node (code);
3856 length = TREE_CODE_LENGTH (code);
3858 for (i = 0; i < length; i++)
3859 TREE_OPERAND (t, i) = va_arg (p, tree);
3865 /* Similar to build_nt, but for creating a CALL_EXPR object with
3866 ARGLIST passed as a list. */
3869 build_nt_call_list (tree fn, tree arglist)
3874 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3875 CALL_EXPR_FN (t) = fn;
3876 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3877 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3878 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3882 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3886 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3891 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3892 CALL_EXPR_FN (ret) = fn;
3893 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3894 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3895 CALL_EXPR_ARG (ret, ix) = t;
3899 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3900 We do NOT enter this node in any sort of symbol table.
3902 LOC is the location of the decl.
3904 layout_decl is used to set up the decl's storage layout.
3905 Other slots are initialized to 0 or null pointers. */
3908 build_decl_stat (location_t loc, enum tree_code code, tree name,
3909 tree type MEM_STAT_DECL)
3913 t = make_node_stat (code PASS_MEM_STAT);
3914 DECL_SOURCE_LOCATION (t) = loc;
3916 /* if (type == error_mark_node)
3917 type = integer_type_node; */
3918 /* That is not done, deliberately, so that having error_mark_node
3919 as the type can suppress useless errors in the use of this variable. */
3921 DECL_NAME (t) = name;
3922 TREE_TYPE (t) = type;
3924 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3930 /* Builds and returns function declaration with NAME and TYPE. */
3933 build_fn_decl (const char *name, tree type)
3935 tree id = get_identifier (name);
3936 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3938 DECL_EXTERNAL (decl) = 1;
3939 TREE_PUBLIC (decl) = 1;
3940 DECL_ARTIFICIAL (decl) = 1;
3941 TREE_NOTHROW (decl) = 1;
3947 /* BLOCK nodes are used to represent the structure of binding contours
3948 and declarations, once those contours have been exited and their contents
3949 compiled. This information is used for outputting debugging info. */
3952 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3954 tree block = make_node (BLOCK);
3956 BLOCK_VARS (block) = vars;
3957 BLOCK_SUBBLOCKS (block) = subblocks;
3958 BLOCK_SUPERCONTEXT (block) = supercontext;
3959 BLOCK_CHAIN (block) = chain;
3964 expand_location (source_location loc)
3966 expanded_location xloc;
3967 if (loc <= BUILTINS_LOCATION)
3969 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3976 const struct line_map *map = linemap_lookup (line_table, loc);
3977 xloc.file = map->to_file;
3978 xloc.line = SOURCE_LINE (map, loc);
3979 xloc.column = SOURCE_COLUMN (map, loc);
3980 xloc.sysp = map->sysp != 0;
3986 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3988 LOC is the location to use in tree T. */
3991 protected_set_expr_location (tree t, location_t loc)
3993 if (t && CAN_HAVE_LOCATION_P (t))
3994 SET_EXPR_LOCATION (t, loc);
3997 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4001 build_decl_attribute_variant (tree ddecl, tree attribute)
4003 DECL_ATTRIBUTES (ddecl) = attribute;
4007 /* Borrowed from hashtab.c iterative_hash implementation. */
4008 #define mix(a,b,c) \
4010 a -= b; a -= c; a ^= (c>>13); \
4011 b -= c; b -= a; b ^= (a<< 8); \
4012 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4013 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4014 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4015 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4016 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4017 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4018 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4022 /* Produce good hash value combining VAL and VAL2. */
4024 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4026 /* the golden ratio; an arbitrary value. */
4027 hashval_t a = 0x9e3779b9;
4033 /* Produce good hash value combining VAL and VAL2. */
4035 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4037 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4038 return iterative_hash_hashval_t (val, val2);
4041 hashval_t a = (hashval_t) val;
4042 /* Avoid warnings about shifting of more than the width of the type on
4043 hosts that won't execute this path. */
4045 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4047 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4049 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4050 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4057 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4058 is ATTRIBUTE and its qualifiers are QUALS.
4060 Record such modified types already made so we don't make duplicates. */
4063 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4065 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4067 hashval_t hashcode = 0;
4069 enum tree_code code = TREE_CODE (ttype);
4071 /* Building a distinct copy of a tagged type is inappropriate; it
4072 causes breakage in code that expects there to be a one-to-one
4073 relationship between a struct and its fields.
4074 build_duplicate_type is another solution (as used in
4075 handle_transparent_union_attribute), but that doesn't play well
4076 with the stronger C++ type identity model. */
4077 if (TREE_CODE (ttype) == RECORD_TYPE
4078 || TREE_CODE (ttype) == UNION_TYPE
4079 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4080 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4082 warning (OPT_Wattributes,
4083 "ignoring attributes applied to %qT after definition",
4084 TYPE_MAIN_VARIANT (ttype));
4085 return build_qualified_type (ttype, quals);
4088 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4089 ntype = build_distinct_type_copy (ttype);
4091 TYPE_ATTRIBUTES (ntype) = attribute;
4093 hashcode = iterative_hash_object (code, hashcode);
4094 if (TREE_TYPE (ntype))
4095 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4097 hashcode = attribute_hash_list (attribute, hashcode);
4099 switch (TREE_CODE (ntype))
4102 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4105 if (TYPE_DOMAIN (ntype))
4106 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4110 hashcode = iterative_hash_object
4111 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4112 hashcode = iterative_hash_object
4113 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4116 case FIXED_POINT_TYPE:
4118 unsigned int precision = TYPE_PRECISION (ntype);
4119 hashcode = iterative_hash_object (precision, hashcode);
4126 ntype = type_hash_canon (hashcode, ntype);
4128 /* If the target-dependent attributes make NTYPE different from
4129 its canonical type, we will need to use structural equality
4130 checks for this type. */
4131 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4132 || !targetm.comp_type_attributes (ntype, ttype))
4133 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4134 else if (TYPE_CANONICAL (ntype) == ntype)
4135 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4137 ttype = build_qualified_type (ntype, quals);
4139 else if (TYPE_QUALS (ttype) != quals)
4140 ttype = build_qualified_type (ttype, quals);
4146 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4149 Record such modified types already made so we don't make duplicates. */
4152 build_type_attribute_variant (tree ttype, tree attribute)
4154 return build_type_attribute_qual_variant (ttype, attribute,
4155 TYPE_QUALS (ttype));
4159 /* Reset the expression *EXPR_P, a size or position.
4161 ??? We could reset all non-constant sizes or positions. But it's cheap
4162 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4164 We need to reset self-referential sizes or positions because they cannot
4165 be gimplified and thus can contain a CALL_EXPR after the gimplification
4166 is finished, which will run afoul of LTO streaming. And they need to be
4167 reset to something essentially dummy but not constant, so as to preserve
4168 the properties of the object they are attached to. */
4171 free_lang_data_in_one_sizepos (tree *expr_p)
4173 tree expr = *expr_p;
4174 if (CONTAINS_PLACEHOLDER_P (expr))
4175 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4179 /* Reset all the fields in a binfo node BINFO. We only keep
4180 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4183 free_lang_data_in_binfo (tree binfo)
4188 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4190 BINFO_VTABLE (binfo) = NULL_TREE;
4191 BINFO_BASE_ACCESSES (binfo) = NULL;
4192 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4193 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4195 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4196 free_lang_data_in_binfo (t);
4200 /* Reset all language specific information still present in TYPE. */
4203 free_lang_data_in_type (tree type)
4205 gcc_assert (TYPE_P (type));
4207 /* Give the FE a chance to remove its own data first. */
4208 lang_hooks.free_lang_data (type);
4210 TREE_LANG_FLAG_0 (type) = 0;
4211 TREE_LANG_FLAG_1 (type) = 0;
4212 TREE_LANG_FLAG_2 (type) = 0;
4213 TREE_LANG_FLAG_3 (type) = 0;
4214 TREE_LANG_FLAG_4 (type) = 0;
4215 TREE_LANG_FLAG_5 (type) = 0;
4216 TREE_LANG_FLAG_6 (type) = 0;
4218 if (TREE_CODE (type) == FUNCTION_TYPE)
4220 /* Remove the const and volatile qualifiers from arguments. The
4221 C++ front end removes them, but the C front end does not,
4222 leading to false ODR violation errors when merging two
4223 instances of the same function signature compiled by
4224 different front ends. */
4227 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4229 tree arg_type = TREE_VALUE (p);
4231 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4233 int quals = TYPE_QUALS (arg_type)
4235 & ~TYPE_QUAL_VOLATILE;
4236 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4237 free_lang_data_in_type (TREE_VALUE (p));
4242 /* Remove members that are not actually FIELD_DECLs from the field
4243 list of an aggregate. These occur in C++. */
4244 if (RECORD_OR_UNION_TYPE_P (type))
4248 /* Note that TYPE_FIELDS can be shared across distinct
4249 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4250 to be removed, we cannot set its TREE_CHAIN to NULL.
4251 Otherwise, we would not be able to find all the other fields
4252 in the other instances of this TREE_TYPE.
4254 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4256 member = TYPE_FIELDS (type);
4259 if (TREE_CODE (member) == FIELD_DECL)
4262 TREE_CHAIN (prev) = member;
4264 TYPE_FIELDS (type) = member;
4268 member = TREE_CHAIN (member);
4272 TREE_CHAIN (prev) = NULL_TREE;
4274 TYPE_FIELDS (type) = NULL_TREE;
4276 TYPE_METHODS (type) = NULL_TREE;
4277 if (TYPE_BINFO (type))
4278 free_lang_data_in_binfo (TYPE_BINFO (type));
4282 /* For non-aggregate types, clear out the language slot (which
4283 overloads TYPE_BINFO). */
4284 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4286 if (INTEGRAL_TYPE_P (type)
4287 || SCALAR_FLOAT_TYPE_P (type)
4288 || FIXED_POINT_TYPE_P (type))
4290 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4291 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4295 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4296 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4298 if (debug_info_level < DINFO_LEVEL_TERSE
4299 || (TYPE_CONTEXT (type)
4300 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4301 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4302 TYPE_CONTEXT (type) = NULL_TREE;
4304 if (debug_info_level < DINFO_LEVEL_TERSE)
4305 TYPE_STUB_DECL (type) = NULL_TREE;
4309 /* Return true if DECL may need an assembler name to be set. */
4312 need_assembler_name_p (tree decl)
4314 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4315 if (TREE_CODE (decl) != FUNCTION_DECL
4316 && TREE_CODE (decl) != VAR_DECL)
4319 /* If DECL already has its assembler name set, it does not need a
4321 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4322 || DECL_ASSEMBLER_NAME_SET_P (decl))
4325 /* Abstract decls do not need an assembler name. */
4326 if (DECL_ABSTRACT (decl))
4329 /* For VAR_DECLs, only static, public and external symbols need an
4331 if (TREE_CODE (decl) == VAR_DECL
4332 && !TREE_STATIC (decl)
4333 && !TREE_PUBLIC (decl)
4334 && !DECL_EXTERNAL (decl))
4337 if (TREE_CODE (decl) == FUNCTION_DECL)
4339 /* Do not set assembler name on builtins. Allow RTL expansion to
4340 decide whether to expand inline or via a regular call. */
4341 if (DECL_BUILT_IN (decl)
4342 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4345 /* Functions represented in the callgraph need an assembler name. */
4346 if (cgraph_get_node (decl) != NULL)
4349 /* Unused and not public functions don't need an assembler name. */
4350 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4358 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4359 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4360 in BLOCK that is not in LOCALS is removed. */
4363 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4367 tp = &BLOCK_VARS (block);
4370 if (!pointer_set_contains (locals, *tp))
4371 *tp = TREE_CHAIN (*tp);
4373 tp = &TREE_CHAIN (*tp);
4376 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4377 free_lang_data_in_block (fn, t, locals);
4381 /* Reset all language specific information still present in symbol
4385 free_lang_data_in_decl (tree decl)
4387 gcc_assert (DECL_P (decl));
4389 /* Give the FE a chance to remove its own data first. */
4390 lang_hooks.free_lang_data (decl);
4392 TREE_LANG_FLAG_0 (decl) = 0;
4393 TREE_LANG_FLAG_1 (decl) = 0;
4394 TREE_LANG_FLAG_2 (decl) = 0;
4395 TREE_LANG_FLAG_3 (decl) = 0;
4396 TREE_LANG_FLAG_4 (decl) = 0;
4397 TREE_LANG_FLAG_5 (decl) = 0;
4398 TREE_LANG_FLAG_6 (decl) = 0;
4400 /* Identifiers need not have a type. */
4401 if (DECL_NAME (decl))
4402 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4404 /* Ignore any intervening types, because we are going to clear their
4405 TYPE_CONTEXT fields. */
4406 if (TREE_CODE (decl) != FIELD_DECL
4407 && TREE_CODE (decl) != FUNCTION_DECL)
4408 DECL_CONTEXT (decl) = decl_function_context (decl);
4410 if (DECL_CONTEXT (decl)
4411 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4412 DECL_CONTEXT (decl) = NULL_TREE;
4414 if (TREE_CODE (decl) == VAR_DECL)
4416 tree context = DECL_CONTEXT (decl);
4420 enum tree_code code = TREE_CODE (context);
4421 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4423 /* Do not clear the decl context here, that will promote
4424 all vars to global ones. */
4425 DECL_INITIAL (decl) = NULL_TREE;
4428 if (TREE_STATIC (decl))
4429 DECL_CONTEXT (decl) = NULL_TREE;
4433 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4434 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4435 if (TREE_CODE (decl) == FIELD_DECL)
4436 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4438 /* DECL_FCONTEXT is only used for debug info generation. */
4439 if (TREE_CODE (decl) == FIELD_DECL
4440 && debug_info_level < DINFO_LEVEL_TERSE)
4441 DECL_FCONTEXT (decl) = NULL_TREE;
4443 if (TREE_CODE (decl) == FUNCTION_DECL)
4445 if (gimple_has_body_p (decl))
4448 struct pointer_set_t *locals;
4450 /* If DECL has a gimple body, then the context for its
4451 arguments must be DECL. Otherwise, it doesn't really
4452 matter, as we will not be emitting any code for DECL. In
4453 general, there may be other instances of DECL created by
4454 the front end and since PARM_DECLs are generally shared,
4455 their DECL_CONTEXT changes as the replicas of DECL are
4456 created. The only time where DECL_CONTEXT is important
4457 is for the FUNCTION_DECLs that have a gimple body (since
4458 the PARM_DECL will be used in the function's body). */
4459 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4460 DECL_CONTEXT (t) = decl;
4462 /* Collect all the symbols declared in DECL. */
4463 locals = pointer_set_create ();
4464 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4465 for (; t; t = TREE_CHAIN (t))
4467 pointer_set_insert (locals, TREE_VALUE (t));
4469 /* All the local symbols should have DECL as their
4471 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4474 /* Get rid of any decl not in local_decls. */
4475 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4477 pointer_set_destroy (locals);
4480 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4481 At this point, it is not needed anymore. */
4482 DECL_SAVED_TREE (decl) = NULL_TREE;
4484 else if (TREE_CODE (decl) == VAR_DECL)
4486 tree expr = DECL_DEBUG_EXPR (decl);
4488 && TREE_CODE (expr) == VAR_DECL
4489 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4490 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4492 if (DECL_EXTERNAL (decl)
4493 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4494 DECL_INITIAL (decl) = NULL_TREE;
4496 else if (TREE_CODE (decl) == TYPE_DECL)
4498 DECL_INITIAL (decl) = NULL_TREE;
4500 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4501 FIELD_DECLs, which should be preserved. Otherwise,
4502 we shouldn't be concerned with source-level lexical
4503 nesting beyond this point. */
4504 DECL_CONTEXT (decl) = NULL_TREE;
4509 /* Data used when collecting DECLs and TYPEs for language data removal. */
4511 struct free_lang_data_d
4513 /* Worklist to avoid excessive recursion. */
4514 VEC(tree,heap) *worklist;
4516 /* Set of traversed objects. Used to avoid duplicate visits. */
4517 struct pointer_set_t *pset;
4519 /* Array of symbols to process with free_lang_data_in_decl. */
4520 VEC(tree,heap) *decls;
4522 /* Array of types to process with free_lang_data_in_type. */
4523 VEC(tree,heap) *types;
4527 /* Save all language fields needed to generate proper debug information
4528 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4531 save_debug_info_for_decl (tree t)
4533 /*struct saved_debug_info_d *sdi;*/
4535 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4537 /* FIXME. Partial implementation for saving debug info removed. */
4541 /* Save all language fields needed to generate proper debug information
4542 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4545 save_debug_info_for_type (tree t)
4547 /*struct saved_debug_info_d *sdi;*/
4549 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4551 /* FIXME. Partial implementation for saving debug info removed. */
4555 /* Add type or decl T to one of the list of tree nodes that need their
4556 language data removed. The lists are held inside FLD. */
4559 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4563 VEC_safe_push (tree, heap, fld->decls, t);
4564 if (debug_info_level > DINFO_LEVEL_TERSE)
4565 save_debug_info_for_decl (t);
4567 else if (TYPE_P (t))
4569 VEC_safe_push (tree, heap, fld->types, t);
4570 if (debug_info_level > DINFO_LEVEL_TERSE)
4571 save_debug_info_for_type (t);
4577 /* Push tree node T into FLD->WORKLIST. */
4580 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4582 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4583 VEC_safe_push (tree, heap, fld->worklist, (t));
4587 /* Operand callback helper for free_lang_data_in_node. *TP is the
4588 subtree operand being considered. */
4591 find_decls_types_r (tree *tp, int *ws, void *data)
4594 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4596 if (TREE_CODE (t) == TREE_LIST)
4599 /* Language specific nodes will be removed, so there is no need
4600 to gather anything under them. */
4601 if (is_lang_specific (t))
4609 /* Note that walk_tree does not traverse every possible field in
4610 decls, so we have to do our own traversals here. */
4611 add_tree_to_fld_list (t, fld);
4613 fld_worklist_push (DECL_NAME (t), fld);
4614 fld_worklist_push (DECL_CONTEXT (t), fld);
4615 fld_worklist_push (DECL_SIZE (t), fld);
4616 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4618 /* We are going to remove everything under DECL_INITIAL for
4619 TYPE_DECLs. No point walking them. */
4620 if (TREE_CODE (t) != TYPE_DECL)
4621 fld_worklist_push (DECL_INITIAL (t), fld);
4623 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4624 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4626 if (TREE_CODE (t) == FUNCTION_DECL)
4628 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4629 fld_worklist_push (DECL_RESULT (t), fld);
4631 else if (TREE_CODE (t) == TYPE_DECL)
4633 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4634 fld_worklist_push (DECL_VINDEX (t), fld);
4636 else if (TREE_CODE (t) == FIELD_DECL)
4638 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4639 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4640 fld_worklist_push (DECL_QUALIFIER (t), fld);
4641 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4642 fld_worklist_push (DECL_FCONTEXT (t), fld);
4644 else if (TREE_CODE (t) == VAR_DECL)
4646 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4647 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4650 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4651 && DECL_HAS_VALUE_EXPR_P (t))
4652 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4654 if (TREE_CODE (t) != FIELD_DECL)
4655 fld_worklist_push (TREE_CHAIN (t), fld);
4658 else if (TYPE_P (t))
4660 /* Note that walk_tree does not traverse every possible field in
4661 types, so we have to do our own traversals here. */
4662 add_tree_to_fld_list (t, fld);
4664 if (!RECORD_OR_UNION_TYPE_P (t))
4665 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4666 fld_worklist_push (TYPE_SIZE (t), fld);
4667 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4668 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4669 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4670 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4671 fld_worklist_push (TYPE_NAME (t), fld);
4672 fld_worklist_push (TYPE_MINVAL (t), fld);
4673 if (!RECORD_OR_UNION_TYPE_P (t))
4674 fld_worklist_push (TYPE_MAXVAL (t), fld);
4675 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4676 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4677 fld_worklist_push (TYPE_CONTEXT (t), fld);
4678 fld_worklist_push (TYPE_CANONICAL (t), fld);
4680 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4684 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4686 fld_worklist_push (TREE_TYPE (tem), fld);
4687 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4689 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4690 && TREE_CODE (tem) == TREE_LIST)
4693 fld_worklist_push (TREE_VALUE (tem), fld);
4694 tem = TREE_CHAIN (tem);
4698 if (RECORD_OR_UNION_TYPE_P (t))
4701 /* Push all TYPE_FIELDS - there can be interleaving interesting
4702 and non-interesting things. */
4703 tem = TYPE_FIELDS (t);
4706 if (TREE_CODE (tem) == FIELD_DECL)
4707 fld_worklist_push (tem, fld);
4708 tem = TREE_CHAIN (tem);
4712 fld_worklist_push (TREE_CHAIN (t), fld);
4716 fld_worklist_push (TREE_TYPE (t), fld);
4722 /* Find decls and types in T. */
4725 find_decls_types (tree t, struct free_lang_data_d *fld)
4729 if (!pointer_set_contains (fld->pset, t))
4730 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4731 if (VEC_empty (tree, fld->worklist))
4733 t = VEC_pop (tree, fld->worklist);
4737 /* Translate all the types in LIST with the corresponding runtime
4741 get_eh_types_for_runtime (tree list)
4745 if (list == NULL_TREE)
4748 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4750 list = TREE_CHAIN (list);
4753 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4754 TREE_CHAIN (prev) = n;
4755 prev = TREE_CHAIN (prev);
4756 list = TREE_CHAIN (list);
4763 /* Find decls and types referenced in EH region R and store them in
4764 FLD->DECLS and FLD->TYPES. */
4767 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4778 /* The types referenced in each catch must first be changed to the
4779 EH types used at runtime. This removes references to FE types
4781 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4783 c->type_list = get_eh_types_for_runtime (c->type_list);
4784 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4789 case ERT_ALLOWED_EXCEPTIONS:
4790 r->u.allowed.type_list
4791 = get_eh_types_for_runtime (r->u.allowed.type_list);
4792 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4795 case ERT_MUST_NOT_THROW:
4796 walk_tree (&r->u.must_not_throw.failure_decl,
4797 find_decls_types_r, fld, fld->pset);
4803 /* Find decls and types referenced in cgraph node N and store them in
4804 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4805 look for *every* kind of DECL and TYPE node reachable from N,
4806 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4807 NAMESPACE_DECLs, etc). */
4810 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4813 struct function *fn;
4816 find_decls_types (n->decl, fld);
4818 if (!gimple_has_body_p (n->decl))
4821 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4823 fn = DECL_STRUCT_FUNCTION (n->decl);
4825 /* Traverse locals. */
4826 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4827 find_decls_types (TREE_VALUE (t), fld);
4829 /* Traverse EH regions in FN. */
4832 FOR_ALL_EH_REGION_FN (r, fn)
4833 find_decls_types_in_eh_region (r, fld);
4836 /* Traverse every statement in FN. */
4837 FOR_EACH_BB_FN (bb, fn)
4839 gimple_stmt_iterator si;
4842 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4844 gimple phi = gsi_stmt (si);
4846 for (i = 0; i < gimple_phi_num_args (phi); i++)
4848 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4849 find_decls_types (*arg_p, fld);
4853 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4855 gimple stmt = gsi_stmt (si);
4857 for (i = 0; i < gimple_num_ops (stmt); i++)
4859 tree arg = gimple_op (stmt, i);
4860 find_decls_types (arg, fld);
4867 /* Find decls and types referenced in varpool node N and store them in
4868 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4869 look for *every* kind of DECL and TYPE node reachable from N,
4870 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4871 NAMESPACE_DECLs, etc). */
4874 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4876 find_decls_types (v->decl, fld);
4879 /* If T needs an assembler name, have one created for it. */
4882 assign_assembler_name_if_neeeded (tree t)
4884 if (need_assembler_name_p (t))
4886 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4887 diagnostics that use input_location to show locus
4888 information. The problem here is that, at this point,
4889 input_location is generally anchored to the end of the file
4890 (since the parser is long gone), so we don't have a good
4891 position to pin it to.
4893 To alleviate this problem, this uses the location of T's
4894 declaration. Examples of this are
4895 testsuite/g++.dg/template/cond2.C and
4896 testsuite/g++.dg/template/pr35240.C. */
4897 location_t saved_location = input_location;
4898 input_location = DECL_SOURCE_LOCATION (t);
4900 decl_assembler_name (t);
4902 input_location = saved_location;
4907 /* Free language specific information for every operand and expression
4908 in every node of the call graph. This process operates in three stages:
4910 1- Every callgraph node and varpool node is traversed looking for
4911 decls and types embedded in them. This is a more exhaustive
4912 search than that done by find_referenced_vars, because it will
4913 also collect individual fields, decls embedded in types, etc.
4915 2- All the decls found are sent to free_lang_data_in_decl.
4917 3- All the types found are sent to free_lang_data_in_type.
4919 The ordering between decls and types is important because
4920 free_lang_data_in_decl sets assembler names, which includes
4921 mangling. So types cannot be freed up until assembler names have
4925 free_lang_data_in_cgraph (void)
4927 struct cgraph_node *n;
4928 struct varpool_node *v;
4929 struct free_lang_data_d fld;
4934 /* Initialize sets and arrays to store referenced decls and types. */
4935 fld.pset = pointer_set_create ();
4936 fld.worklist = NULL;
4937 fld.decls = VEC_alloc (tree, heap, 100);
4938 fld.types = VEC_alloc (tree, heap, 100);
4940 /* Find decls and types in the body of every function in the callgraph. */
4941 for (n = cgraph_nodes; n; n = n->next)
4942 find_decls_types_in_node (n, &fld);
4944 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4945 find_decls_types (p->decl, &fld);
4947 /* Find decls and types in every varpool symbol. */
4948 for (v = varpool_nodes_queue; v; v = v->next_needed)
4949 find_decls_types_in_var (v, &fld);
4951 /* Set the assembler name on every decl found. We need to do this
4952 now because free_lang_data_in_decl will invalidate data needed
4953 for mangling. This breaks mangling on interdependent decls. */
4954 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4955 assign_assembler_name_if_neeeded (t);
4957 /* Traverse every decl found freeing its language data. */
4958 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4959 free_lang_data_in_decl (t);
4961 /* Traverse every type found freeing its language data. */
4962 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4963 free_lang_data_in_type (t);
4965 pointer_set_destroy (fld.pset);
4966 VEC_free (tree, heap, fld.worklist);
4967 VEC_free (tree, heap, fld.decls);
4968 VEC_free (tree, heap, fld.types);
4972 /* Free resources that are used by FE but are not needed once they are done. */
4975 free_lang_data (void)
4979 /* If we are the LTO frontend we have freed lang-specific data already. */
4981 || !flag_generate_lto)
4984 /* Allocate and assign alias sets to the standard integer types
4985 while the slots are still in the way the frontends generated them. */
4986 for (i = 0; i < itk_none; ++i)
4987 if (integer_types[i])
4988 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
4990 /* Traverse the IL resetting language specific information for
4991 operands, expressions, etc. */
4992 free_lang_data_in_cgraph ();
4994 /* Create gimple variants for common types. */
4995 ptrdiff_type_node = integer_type_node;
4996 fileptr_type_node = ptr_type_node;
4997 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4998 || (TYPE_MODE (boolean_type_node)
4999 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
5000 || TYPE_PRECISION (boolean_type_node) != 1
5001 || !TYPE_UNSIGNED (boolean_type_node))
5003 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5004 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5005 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5006 TYPE_PRECISION (boolean_type_node) = 1;
5007 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5008 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5011 /* Unify char_type_node with its properly signed variant. */
5012 if (TYPE_UNSIGNED (char_type_node))
5013 unsigned_char_type_node = char_type_node;
5015 signed_char_type_node = char_type_node;
5017 /* Reset some langhooks. Do not reset types_compatible_p, it may
5018 still be used indirectly via the get_alias_set langhook. */
5019 lang_hooks.callgraph.analyze_expr = NULL;
5020 lang_hooks.dwarf_name = lhd_dwarf_name;
5021 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5022 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
5024 /* Reset diagnostic machinery. */
5025 diagnostic_starter (global_dc) = default_diagnostic_starter;
5026 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5027 diagnostic_format_decoder (global_dc) = default_tree_printer;
5033 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5037 "*free_lang_data", /* name */
5039 free_lang_data, /* execute */
5042 0, /* static_pass_number */
5043 TV_IPA_FREE_LANG_DATA, /* tv_id */
5044 0, /* properties_required */
5045 0, /* properties_provided */
5046 0, /* properties_destroyed */
5047 0, /* todo_flags_start */
5048 TODO_ggc_collect /* todo_flags_finish */
5052 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5055 We try both `text' and `__text__', ATTR may be either one. */
5056 /* ??? It might be a reasonable simplification to require ATTR to be only
5057 `text'. One might then also require attribute lists to be stored in
5058 their canonicalized form. */
5061 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5066 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5069 p = IDENTIFIER_POINTER (ident);
5070 ident_len = IDENTIFIER_LENGTH (ident);
5072 if (ident_len == attr_len
5073 && strcmp (attr, p) == 0)
5076 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5079 gcc_assert (attr[1] == '_');
5080 gcc_assert (attr[attr_len - 2] == '_');
5081 gcc_assert (attr[attr_len - 1] == '_');
5082 if (ident_len == attr_len - 4
5083 && strncmp (attr + 2, p, attr_len - 4) == 0)
5088 if (ident_len == attr_len + 4
5089 && p[0] == '_' && p[1] == '_'
5090 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5091 && strncmp (attr, p + 2, attr_len) == 0)
5098 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5101 We try both `text' and `__text__', ATTR may be either one. */
5104 is_attribute_p (const char *attr, const_tree ident)
5106 return is_attribute_with_length_p (attr, strlen (attr), ident);
5109 /* Given an attribute name and a list of attributes, return a pointer to the
5110 attribute's list element if the attribute is part of the list, or NULL_TREE
5111 if not found. If the attribute appears more than once, this only
5112 returns the first occurrence; the TREE_CHAIN of the return value should
5113 be passed back in if further occurrences are wanted. */
5116 lookup_attribute (const char *attr_name, tree list)
5119 size_t attr_len = strlen (attr_name);
5121 for (l = list; l; l = TREE_CHAIN (l))
5123 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5124 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5130 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5134 remove_attribute (const char *attr_name, tree list)
5137 size_t attr_len = strlen (attr_name);
5139 for (p = &list; *p; )
5142 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5143 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5144 *p = TREE_CHAIN (l);
5146 p = &TREE_CHAIN (l);
5152 /* Return an attribute list that is the union of a1 and a2. */
5155 merge_attributes (tree a1, tree a2)
5159 /* Either one unset? Take the set one. */
5161 if ((attributes = a1) == 0)
5164 /* One that completely contains the other? Take it. */
5166 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5168 if (attribute_list_contained (a2, a1))
5172 /* Pick the longest list, and hang on the other list. */
5174 if (list_length (a1) < list_length (a2))
5175 attributes = a2, a2 = a1;
5177 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5180 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5183 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5186 if (TREE_VALUE (a) != NULL
5187 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5188 && TREE_VALUE (a2) != NULL
5189 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5191 if (simple_cst_list_equal (TREE_VALUE (a),
5192 TREE_VALUE (a2)) == 1)
5195 else if (simple_cst_equal (TREE_VALUE (a),
5196 TREE_VALUE (a2)) == 1)
5201 a1 = copy_node (a2);
5202 TREE_CHAIN (a1) = attributes;
5211 /* Given types T1 and T2, merge their attributes and return
5215 merge_type_attributes (tree t1, tree t2)
5217 return merge_attributes (TYPE_ATTRIBUTES (t1),
5218 TYPE_ATTRIBUTES (t2));
5221 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5225 merge_decl_attributes (tree olddecl, tree newdecl)
5227 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5228 DECL_ATTRIBUTES (newdecl));
5231 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5233 /* Specialization of merge_decl_attributes for various Windows targets.
5235 This handles the following situation:
5237 __declspec (dllimport) int foo;
5240 The second instance of `foo' nullifies the dllimport. */
5243 merge_dllimport_decl_attributes (tree old, tree new_tree)
5246 int delete_dllimport_p = 1;
5248 /* What we need to do here is remove from `old' dllimport if it doesn't
5249 appear in `new'. dllimport behaves like extern: if a declaration is
5250 marked dllimport and a definition appears later, then the object
5251 is not dllimport'd. We also remove a `new' dllimport if the old list
5252 contains dllexport: dllexport always overrides dllimport, regardless
5253 of the order of declaration. */
5254 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5255 delete_dllimport_p = 0;
5256 else if (DECL_DLLIMPORT_P (new_tree)
5257 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5259 DECL_DLLIMPORT_P (new_tree) = 0;
5260 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5261 "dllimport ignored", new_tree);
5263 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5265 /* Warn about overriding a symbol that has already been used, e.g.:
5266 extern int __attribute__ ((dllimport)) foo;
5267 int* bar () {return &foo;}
5270 if (TREE_USED (old))
5272 warning (0, "%q+D redeclared without dllimport attribute "
5273 "after being referenced with dll linkage", new_tree);
5274 /* If we have used a variable's address with dllimport linkage,
5275 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5276 decl may already have had TREE_CONSTANT computed.
5277 We still remove the attribute so that assembler code refers
5278 to '&foo rather than '_imp__foo'. */
5279 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5280 DECL_DLLIMPORT_P (new_tree) = 1;
5283 /* Let an inline definition silently override the external reference,
5284 but otherwise warn about attribute inconsistency. */
5285 else if (TREE_CODE (new_tree) == VAR_DECL
5286 || !DECL_DECLARED_INLINE_P (new_tree))
5287 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5288 "previous dllimport ignored", new_tree);
5291 delete_dllimport_p = 0;
5293 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5295 if (delete_dllimport_p)
5298 const size_t attr_len = strlen ("dllimport");
5300 /* Scan the list for dllimport and delete it. */
5301 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5303 if (is_attribute_with_length_p ("dllimport", attr_len,
5306 if (prev == NULL_TREE)
5309 TREE_CHAIN (prev) = TREE_CHAIN (t);
5318 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5319 struct attribute_spec.handler. */
5322 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5328 /* These attributes may apply to structure and union types being created,
5329 but otherwise should pass to the declaration involved. */
5332 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5333 | (int) ATTR_FLAG_ARRAY_NEXT))
5335 *no_add_attrs = true;
5336 return tree_cons (name, args, NULL_TREE);
5338 if (TREE_CODE (node) == RECORD_TYPE
5339 || TREE_CODE (node) == UNION_TYPE)
5341 node = TYPE_NAME (node);
5347 warning (OPT_Wattributes, "%qE attribute ignored",
5349 *no_add_attrs = true;
5354 if (TREE_CODE (node) != FUNCTION_DECL
5355 && TREE_CODE (node) != VAR_DECL
5356 && TREE_CODE (node) != TYPE_DECL)
5358 *no_add_attrs = true;
5359 warning (OPT_Wattributes, "%qE attribute ignored",
5364 if (TREE_CODE (node) == TYPE_DECL
5365 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5366 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5368 *no_add_attrs = true;
5369 warning (OPT_Wattributes, "%qE attribute ignored",
5374 is_dllimport = is_attribute_p ("dllimport", name);
5376 /* Report error on dllimport ambiguities seen now before they cause
5380 /* Honor any target-specific overrides. */
5381 if (!targetm.valid_dllimport_attribute_p (node))
5382 *no_add_attrs = true;
5384 else if (TREE_CODE (node) == FUNCTION_DECL
5385 && DECL_DECLARED_INLINE_P (node))
5387 warning (OPT_Wattributes, "inline function %q+D declared as "
5388 " dllimport: attribute ignored", node);
5389 *no_add_attrs = true;
5391 /* Like MS, treat definition of dllimported variables and
5392 non-inlined functions on declaration as syntax errors. */
5393 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5395 error ("function %q+D definition is marked dllimport", node);
5396 *no_add_attrs = true;
5399 else if (TREE_CODE (node) == VAR_DECL)
5401 if (DECL_INITIAL (node))
5403 error ("variable %q+D definition is marked dllimport",
5405 *no_add_attrs = true;
5408 /* `extern' needn't be specified with dllimport.
5409 Specify `extern' now and hope for the best. Sigh. */
5410 DECL_EXTERNAL (node) = 1;
5411 /* Also, implicitly give dllimport'd variables declared within
5412 a function global scope, unless declared static. */
5413 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5414 TREE_PUBLIC (node) = 1;
5417 if (*no_add_attrs == false)
5418 DECL_DLLIMPORT_P (node) = 1;
5420 else if (TREE_CODE (node) == FUNCTION_DECL
5421 && DECL_DECLARED_INLINE_P (node))
5422 /* An exported function, even if inline, must be emitted. */
5423 DECL_EXTERNAL (node) = 0;
5425 /* Report error if symbol is not accessible at global scope. */
5426 if (!TREE_PUBLIC (node)
5427 && (TREE_CODE (node) == VAR_DECL
5428 || TREE_CODE (node) == FUNCTION_DECL))
5430 error ("external linkage required for symbol %q+D because of "
5431 "%qE attribute", node, name);
5432 *no_add_attrs = true;
5435 /* A dllexport'd entity must have default visibility so that other
5436 program units (shared libraries or the main executable) can see
5437 it. A dllimport'd entity must have default visibility so that
5438 the linker knows that undefined references within this program
5439 unit can be resolved by the dynamic linker. */
5442 if (DECL_VISIBILITY_SPECIFIED (node)
5443 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5444 error ("%qE implies default visibility, but %qD has already "
5445 "been declared with a different visibility",
5447 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5448 DECL_VISIBILITY_SPECIFIED (node) = 1;
5454 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5456 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5457 of the various TYPE_QUAL values. */
5460 set_type_quals (tree type, int type_quals)
5462 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5463 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5464 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5465 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5468 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5471 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5473 return (TYPE_QUALS (cand) == type_quals
5474 && TYPE_NAME (cand) == TYPE_NAME (base)
5475 /* Apparently this is needed for Objective-C. */
5476 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5477 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5478 TYPE_ATTRIBUTES (base)));
5481 /* Return a version of the TYPE, qualified as indicated by the
5482 TYPE_QUALS, if one exists. If no qualified version exists yet,
5483 return NULL_TREE. */
5486 get_qualified_type (tree type, int type_quals)
5490 if (TYPE_QUALS (type) == type_quals)
5493 /* Search the chain of variants to see if there is already one there just
5494 like the one we need to have. If so, use that existing one. We must
5495 preserve the TYPE_NAME, since there is code that depends on this. */
5496 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5497 if (check_qualified_type (t, type, type_quals))
5503 /* Like get_qualified_type, but creates the type if it does not
5504 exist. This function never returns NULL_TREE. */
5507 build_qualified_type (tree type, int type_quals)
5511 /* See if we already have the appropriate qualified variant. */
5512 t = get_qualified_type (type, type_quals);
5514 /* If not, build it. */
5517 t = build_variant_type_copy (type);
5518 set_type_quals (t, type_quals);
5520 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5521 /* Propagate structural equality. */
5522 SET_TYPE_STRUCTURAL_EQUALITY (t);
5523 else if (TYPE_CANONICAL (type) != type)
5524 /* Build the underlying canonical type, since it is different
5526 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5529 /* T is its own canonical type. */
5530 TYPE_CANONICAL (t) = t;
5537 /* Create a new distinct copy of TYPE. The new type is made its own
5538 MAIN_VARIANT. If TYPE requires structural equality checks, the
5539 resulting type requires structural equality checks; otherwise, its
5540 TYPE_CANONICAL points to itself. */
5543 build_distinct_type_copy (tree type)
5545 tree t = copy_node (type);
5547 TYPE_POINTER_TO (t) = 0;
5548 TYPE_REFERENCE_TO (t) = 0;
5550 /* Set the canonical type either to a new equivalence class, or
5551 propagate the need for structural equality checks. */
5552 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5553 SET_TYPE_STRUCTURAL_EQUALITY (t);
5555 TYPE_CANONICAL (t) = t;
5557 /* Make it its own variant. */
5558 TYPE_MAIN_VARIANT (t) = t;
5559 TYPE_NEXT_VARIANT (t) = 0;
5561 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5562 whose TREE_TYPE is not t. This can also happen in the Ada
5563 frontend when using subtypes. */
5568 /* Create a new variant of TYPE, equivalent but distinct. This is so
5569 the caller can modify it. TYPE_CANONICAL for the return type will
5570 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5571 are considered equal by the language itself (or that both types
5572 require structural equality checks). */
5575 build_variant_type_copy (tree type)
5577 tree t, m = TYPE_MAIN_VARIANT (type);
5579 t = build_distinct_type_copy (type);
5581 /* Since we're building a variant, assume that it is a non-semantic
5582 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5583 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5585 /* Add the new type to the chain of variants of TYPE. */
5586 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5587 TYPE_NEXT_VARIANT (m) = t;
5588 TYPE_MAIN_VARIANT (t) = m;
5593 /* Return true if the from tree in both tree maps are equal. */
5596 tree_map_base_eq (const void *va, const void *vb)
5598 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5599 *const b = (const struct tree_map_base *) vb;
5600 return (a->from == b->from);
5603 /* Hash a from tree in a tree_map. */
5606 tree_map_base_hash (const void *item)
5608 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5611 /* Return true if this tree map structure is marked for garbage collection
5612 purposes. We simply return true if the from tree is marked, so that this
5613 structure goes away when the from tree goes away. */
5616 tree_map_base_marked_p (const void *p)
5618 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5622 tree_map_hash (const void *item)
5624 return (((const struct tree_map *) item)->hash);
5627 /* Return the initialization priority for DECL. */
5630 decl_init_priority_lookup (tree decl)
5632 struct tree_priority_map *h;
5633 struct tree_map_base in;
5635 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5637 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5638 return h ? h->init : DEFAULT_INIT_PRIORITY;
5641 /* Return the finalization priority for DECL. */
5644 decl_fini_priority_lookup (tree decl)
5646 struct tree_priority_map *h;
5647 struct tree_map_base in;
5649 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5651 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5652 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5655 /* Return the initialization and finalization priority information for
5656 DECL. If there is no previous priority information, a freshly
5657 allocated structure is returned. */
5659 static struct tree_priority_map *
5660 decl_priority_info (tree decl)
5662 struct tree_priority_map in;
5663 struct tree_priority_map *h;
5666 in.base.from = decl;
5667 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5668 h = (struct tree_priority_map *) *loc;
5671 h = GGC_CNEW (struct tree_priority_map);
5673 h->base.from = decl;
5674 h->init = DEFAULT_INIT_PRIORITY;
5675 h->fini = DEFAULT_INIT_PRIORITY;
5681 /* Set the initialization priority for DECL to PRIORITY. */
5684 decl_init_priority_insert (tree decl, priority_type priority)
5686 struct tree_priority_map *h;
5688 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5689 h = decl_priority_info (decl);
5693 /* Set the finalization priority for DECL to PRIORITY. */
5696 decl_fini_priority_insert (tree decl, priority_type priority)
5698 struct tree_priority_map *h;
5700 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5701 h = decl_priority_info (decl);
5705 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5708 print_debug_expr_statistics (void)
5710 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5711 (long) htab_size (debug_expr_for_decl),
5712 (long) htab_elements (debug_expr_for_decl),
5713 htab_collisions (debug_expr_for_decl));
5716 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5719 print_value_expr_statistics (void)
5721 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5722 (long) htab_size (value_expr_for_decl),
5723 (long) htab_elements (value_expr_for_decl),
5724 htab_collisions (value_expr_for_decl));
5727 /* Lookup a debug expression for FROM, and return it if we find one. */
5730 decl_debug_expr_lookup (tree from)
5732 struct tree_map *h, in;
5733 in.base.from = from;
5735 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5736 htab_hash_pointer (from));
5742 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5745 decl_debug_expr_insert (tree from, tree to)
5750 h = GGC_NEW (struct tree_map);
5751 h->hash = htab_hash_pointer (from);
5752 h->base.from = from;
5754 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5755 *(struct tree_map **) loc = h;
5758 /* Lookup a value expression for FROM, and return it if we find one. */
5761 decl_value_expr_lookup (tree from)
5763 struct tree_map *h, in;
5764 in.base.from = from;
5766 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5767 htab_hash_pointer (from));
5773 /* Insert a mapping FROM->TO in the value expression hashtable. */
5776 decl_value_expr_insert (tree from, tree to)
5781 h = GGC_NEW (struct tree_map);
5782 h->hash = htab_hash_pointer (from);
5783 h->base.from = from;
5785 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5786 *(struct tree_map **) loc = h;
5789 /* Hashing of types so that we don't make duplicates.
5790 The entry point is `type_hash_canon'. */
5792 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5793 with types in the TREE_VALUE slots), by adding the hash codes
5794 of the individual types. */
5797 type_hash_list (const_tree list, hashval_t hashcode)
5801 for (tail = list; tail; tail = TREE_CHAIN (tail))
5802 if (TREE_VALUE (tail) != error_mark_node)
5803 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5809 /* These are the Hashtable callback functions. */
5811 /* Returns true iff the types are equivalent. */
5814 type_hash_eq (const void *va, const void *vb)
5816 const struct type_hash *const a = (const struct type_hash *) va,
5817 *const b = (const struct type_hash *) vb;
5819 /* First test the things that are the same for all types. */
5820 if (a->hash != b->hash
5821 || TREE_CODE (a->type) != TREE_CODE (b->type)
5822 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5823 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5824 TYPE_ATTRIBUTES (b->type))
5825 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5826 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5827 || (TREE_CODE (a->type) != COMPLEX_TYPE
5828 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5831 switch (TREE_CODE (a->type))
5836 case REFERENCE_TYPE:
5840 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5843 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5844 && !(TYPE_VALUES (a->type)
5845 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5846 && TYPE_VALUES (b->type)
5847 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5848 && type_list_equal (TYPE_VALUES (a->type),
5849 TYPE_VALUES (b->type))))
5852 /* ... fall through ... */
5857 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5858 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5859 TYPE_MAX_VALUE (b->type)))
5860 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5861 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5862 TYPE_MIN_VALUE (b->type))));
5864 case FIXED_POINT_TYPE:
5865 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5868 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5871 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5872 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5873 || (TYPE_ARG_TYPES (a->type)
5874 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5875 && TYPE_ARG_TYPES (b->type)
5876 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5877 && type_list_equal (TYPE_ARG_TYPES (a->type),
5878 TYPE_ARG_TYPES (b->type)))));
5881 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5885 case QUAL_UNION_TYPE:
5886 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5887 || (TYPE_FIELDS (a->type)
5888 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5889 && TYPE_FIELDS (b->type)
5890 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5891 && type_list_equal (TYPE_FIELDS (a->type),
5892 TYPE_FIELDS (b->type))));
5895 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5896 || (TYPE_ARG_TYPES (a->type)
5897 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5898 && TYPE_ARG_TYPES (b->type)
5899 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5900 && type_list_equal (TYPE_ARG_TYPES (a->type),
5901 TYPE_ARG_TYPES (b->type))))
5909 if (lang_hooks.types.type_hash_eq != NULL)
5910 return lang_hooks.types.type_hash_eq (a->type, b->type);
5915 /* Return the cached hash value. */
5918 type_hash_hash (const void *item)
5920 return ((const struct type_hash *) item)->hash;
5923 /* Look in the type hash table for a type isomorphic to TYPE.
5924 If one is found, return it. Otherwise return 0. */
5927 type_hash_lookup (hashval_t hashcode, tree type)
5929 struct type_hash *h, in;
5931 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5932 must call that routine before comparing TYPE_ALIGNs. */
5938 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5945 /* Add an entry to the type-hash-table
5946 for a type TYPE whose hash code is HASHCODE. */
5949 type_hash_add (hashval_t hashcode, tree type)
5951 struct type_hash *h;
5954 h = GGC_NEW (struct type_hash);
5957 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5961 /* Given TYPE, and HASHCODE its hash code, return the canonical
5962 object for an identical type if one already exists.
5963 Otherwise, return TYPE, and record it as the canonical object.
5965 To use this function, first create a type of the sort you want.
5966 Then compute its hash code from the fields of the type that
5967 make it different from other similar types.
5968 Then call this function and use the value. */
5971 type_hash_canon (unsigned int hashcode, tree type)
5975 /* The hash table only contains main variants, so ensure that's what we're
5977 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5979 if (!lang_hooks.types.hash_types)
5982 /* See if the type is in the hash table already. If so, return it.
5983 Otherwise, add the type. */
5984 t1 = type_hash_lookup (hashcode, type);
5987 #ifdef GATHER_STATISTICS
5988 tree_node_counts[(int) t_kind]--;
5989 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5995 type_hash_add (hashcode, type);
6000 /* See if the data pointed to by the type hash table is marked. We consider
6001 it marked if the type is marked or if a debug type number or symbol
6002 table entry has been made for the type. This reduces the amount of
6003 debugging output and eliminates that dependency of the debug output on
6004 the number of garbage collections. */
6007 type_hash_marked_p (const void *p)
6009 const_tree const type = ((const struct type_hash *) p)->type;
6011 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
6015 print_type_hash_statistics (void)
6017 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6018 (long) htab_size (type_hash_table),
6019 (long) htab_elements (type_hash_table),
6020 htab_collisions (type_hash_table));
6023 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6024 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6025 by adding the hash codes of the individual attributes. */
6028 attribute_hash_list (const_tree list, hashval_t hashcode)
6032 for (tail = list; tail; tail = TREE_CHAIN (tail))
6033 /* ??? Do we want to add in TREE_VALUE too? */
6034 hashcode = iterative_hash_object
6035 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6039 /* Given two lists of attributes, return true if list l2 is
6040 equivalent to l1. */
6043 attribute_list_equal (const_tree l1, const_tree l2)
6045 return attribute_list_contained (l1, l2)
6046 && attribute_list_contained (l2, l1);
6049 /* Given two lists of attributes, return true if list L2 is
6050 completely contained within L1. */
6051 /* ??? This would be faster if attribute names were stored in a canonicalized
6052 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6053 must be used to show these elements are equivalent (which they are). */
6054 /* ??? It's not clear that attributes with arguments will always be handled
6058 attribute_list_contained (const_tree l1, const_tree l2)
6062 /* First check the obvious, maybe the lists are identical. */
6066 /* Maybe the lists are similar. */
6067 for (t1 = l1, t2 = l2;
6069 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6070 && TREE_VALUE (t1) == TREE_VALUE (t2);
6071 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6073 /* Maybe the lists are equal. */
6074 if (t1 == 0 && t2 == 0)
6077 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6080 /* This CONST_CAST is okay because lookup_attribute does not
6081 modify its argument and the return value is assigned to a
6083 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6084 CONST_CAST_TREE(l1));
6086 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6089 if (TREE_VALUE (t2) != NULL
6090 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6091 && TREE_VALUE (attr) != NULL
6092 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6094 if (simple_cst_list_equal (TREE_VALUE (t2),
6095 TREE_VALUE (attr)) == 1)
6098 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6109 /* Given two lists of types
6110 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6111 return 1 if the lists contain the same types in the same order.
6112 Also, the TREE_PURPOSEs must match. */
6115 type_list_equal (const_tree l1, const_tree l2)
6119 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6120 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6121 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6122 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6123 && (TREE_TYPE (TREE_PURPOSE (t1))
6124 == TREE_TYPE (TREE_PURPOSE (t2))))))
6130 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6131 given by TYPE. If the argument list accepts variable arguments,
6132 then this function counts only the ordinary arguments. */
6135 type_num_arguments (const_tree type)
6140 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6141 /* If the function does not take a variable number of arguments,
6142 the last element in the list will have type `void'. */
6143 if (VOID_TYPE_P (TREE_VALUE (t)))
6151 /* Nonzero if integer constants T1 and T2
6152 represent the same constant value. */
6155 tree_int_cst_equal (const_tree t1, const_tree t2)
6160 if (t1 == 0 || t2 == 0)
6163 if (TREE_CODE (t1) == INTEGER_CST
6164 && TREE_CODE (t2) == INTEGER_CST
6165 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6166 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6172 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6173 The precise way of comparison depends on their data type. */
6176 tree_int_cst_lt (const_tree t1, const_tree t2)
6181 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6183 int t1_sgn = tree_int_cst_sgn (t1);
6184 int t2_sgn = tree_int_cst_sgn (t2);
6186 if (t1_sgn < t2_sgn)
6188 else if (t1_sgn > t2_sgn)
6190 /* Otherwise, both are non-negative, so we compare them as
6191 unsigned just in case one of them would overflow a signed
6194 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6195 return INT_CST_LT (t1, t2);
6197 return INT_CST_LT_UNSIGNED (t1, t2);
6200 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6203 tree_int_cst_compare (const_tree t1, const_tree t2)
6205 if (tree_int_cst_lt (t1, t2))
6207 else if (tree_int_cst_lt (t2, t1))
6213 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6214 the host. If POS is zero, the value can be represented in a single
6215 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6216 be represented in a single unsigned HOST_WIDE_INT. */
6219 host_integerp (const_tree t, int pos)
6224 return (TREE_CODE (t) == INTEGER_CST
6225 && ((TREE_INT_CST_HIGH (t) == 0
6226 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6227 || (! pos && TREE_INT_CST_HIGH (t) == -1
6228 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6229 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6230 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6231 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6232 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6235 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6236 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6237 be non-negative. We must be able to satisfy the above conditions. */
6240 tree_low_cst (const_tree t, int pos)
6242 gcc_assert (host_integerp (t, pos));
6243 return TREE_INT_CST_LOW (t);
6246 /* Return the most significant bit of the integer constant T. */
6249 tree_int_cst_msb (const_tree t)
6253 unsigned HOST_WIDE_INT l;
6255 /* Note that using TYPE_PRECISION here is wrong. We care about the
6256 actual bits, not the (arbitrary) range of the type. */
6257 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6258 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6259 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6260 return (l & 1) == 1;
6263 /* Return an indication of the sign of the integer constant T.
6264 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6265 Note that -1 will never be returned if T's type is unsigned. */
6268 tree_int_cst_sgn (const_tree t)
6270 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6272 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6274 else if (TREE_INT_CST_HIGH (t) < 0)
6280 /* Return the minimum number of bits needed to represent VALUE in a
6281 signed or unsigned type, UNSIGNEDP says which. */
6284 tree_int_cst_min_precision (tree value, bool unsignedp)
6288 /* If the value is negative, compute its negative minus 1. The latter
6289 adjustment is because the absolute value of the largest negative value
6290 is one larger than the largest positive value. This is equivalent to
6291 a bit-wise negation, so use that operation instead. */
6293 if (tree_int_cst_sgn (value) < 0)
6294 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6296 /* Return the number of bits needed, taking into account the fact
6297 that we need one more bit for a signed than unsigned type. */
6299 if (integer_zerop (value))
6302 log = tree_floor_log2 (value);
6304 return log + 1 + !unsignedp;
6307 /* Compare two constructor-element-type constants. Return 1 if the lists
6308 are known to be equal; otherwise return 0. */
6311 simple_cst_list_equal (const_tree l1, const_tree l2)
6313 while (l1 != NULL_TREE && l2 != NULL_TREE)
6315 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6318 l1 = TREE_CHAIN (l1);
6319 l2 = TREE_CHAIN (l2);
6325 /* Return truthvalue of whether T1 is the same tree structure as T2.
6326 Return 1 if they are the same.
6327 Return 0 if they are understandably different.
6328 Return -1 if either contains tree structure not understood by
6332 simple_cst_equal (const_tree t1, const_tree t2)
6334 enum tree_code code1, code2;
6340 if (t1 == 0 || t2 == 0)
6343 code1 = TREE_CODE (t1);
6344 code2 = TREE_CODE (t2);
6346 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6348 if (CONVERT_EXPR_CODE_P (code2)
6349 || code2 == NON_LVALUE_EXPR)
6350 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6352 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6355 else if (CONVERT_EXPR_CODE_P (code2)
6356 || code2 == NON_LVALUE_EXPR)
6357 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6365 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6366 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6369 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6372 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6375 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6376 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6377 TREE_STRING_LENGTH (t1)));
6381 unsigned HOST_WIDE_INT idx;
6382 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6383 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6385 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6388 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6389 /* ??? Should we handle also fields here? */
6390 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6391 VEC_index (constructor_elt, v2, idx)->value))
6397 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6400 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6403 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6406 const_tree arg1, arg2;
6407 const_call_expr_arg_iterator iter1, iter2;
6408 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6409 arg2 = first_const_call_expr_arg (t2, &iter2);
6411 arg1 = next_const_call_expr_arg (&iter1),
6412 arg2 = next_const_call_expr_arg (&iter2))
6414 cmp = simple_cst_equal (arg1, arg2);
6418 return arg1 == arg2;
6422 /* Special case: if either target is an unallocated VAR_DECL,
6423 it means that it's going to be unified with whatever the
6424 TARGET_EXPR is really supposed to initialize, so treat it
6425 as being equivalent to anything. */
6426 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6427 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6428 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6429 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6430 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6431 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6434 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6439 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6441 case WITH_CLEANUP_EXPR:
6442 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6446 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6449 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6450 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6464 /* This general rule works for most tree codes. All exceptions should be
6465 handled above. If this is a language-specific tree code, we can't
6466 trust what might be in the operand, so say we don't know
6468 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6471 switch (TREE_CODE_CLASS (code1))
6475 case tcc_comparison:
6476 case tcc_expression:
6480 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6482 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6494 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6495 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6496 than U, respectively. */
6499 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6501 if (tree_int_cst_sgn (t) < 0)
6503 else if (TREE_INT_CST_HIGH (t) != 0)
6505 else if (TREE_INT_CST_LOW (t) == u)
6507 else if (TREE_INT_CST_LOW (t) < u)
6513 /* Return true if CODE represents an associative tree code. Otherwise
6516 associative_tree_code (enum tree_code code)
6535 /* Return true if CODE represents a commutative tree code. Otherwise
6538 commutative_tree_code (enum tree_code code)
6551 case UNORDERED_EXPR:
6555 case TRUTH_AND_EXPR:
6556 case TRUTH_XOR_EXPR:
6566 /* Generate a hash value for an expression. This can be used iteratively
6567 by passing a previous result as the VAL argument.
6569 This function is intended to produce the same hash for expressions which
6570 would compare equal using operand_equal_p. */
6573 iterative_hash_expr (const_tree t, hashval_t val)
6576 enum tree_code code;
6580 return iterative_hash_hashval_t (0, val);
6582 code = TREE_CODE (t);
6586 /* Alas, constants aren't shared, so we can't rely on pointer
6589 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6590 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6593 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6595 return iterative_hash_hashval_t (val2, val);
6599 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6601 return iterative_hash_hashval_t (val2, val);
6604 return iterative_hash (TREE_STRING_POINTER (t),
6605 TREE_STRING_LENGTH (t), val);
6607 val = iterative_hash_expr (TREE_REALPART (t), val);
6608 return iterative_hash_expr (TREE_IMAGPART (t), val);
6610 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6612 /* We can just compare by pointer. */
6613 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6614 case PLACEHOLDER_EXPR:
6615 /* The node itself doesn't matter. */
6618 /* A list of expressions, for a CALL_EXPR or as the elements of a
6620 for (; t; t = TREE_CHAIN (t))
6621 val = iterative_hash_expr (TREE_VALUE (t), val);
6625 unsigned HOST_WIDE_INT idx;
6627 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6629 val = iterative_hash_expr (field, val);
6630 val = iterative_hash_expr (value, val);
6635 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6636 Otherwise nodes that compare equal according to operand_equal_p might
6637 get different hash codes. However, don't do this for machine specific
6638 or front end builtins, since the function code is overloaded in those
6640 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6641 && built_in_decls[DECL_FUNCTION_CODE (t)])
6643 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6644 code = TREE_CODE (t);
6648 tclass = TREE_CODE_CLASS (code);
6650 if (tclass == tcc_declaration)
6652 /* DECL's have a unique ID */
6653 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6657 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6659 val = iterative_hash_object (code, val);
6661 /* Don't hash the type, that can lead to having nodes which
6662 compare equal according to operand_equal_p, but which
6663 have different hash codes. */
6664 if (CONVERT_EXPR_CODE_P (code)
6665 || code == NON_LVALUE_EXPR)
6667 /* Make sure to include signness in the hash computation. */
6668 val += TYPE_UNSIGNED (TREE_TYPE (t));
6669 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6672 else if (commutative_tree_code (code))
6674 /* It's a commutative expression. We want to hash it the same
6675 however it appears. We do this by first hashing both operands
6676 and then rehashing based on the order of their independent
6678 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6679 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6683 t = one, one = two, two = t;
6685 val = iterative_hash_hashval_t (one, val);
6686 val = iterative_hash_hashval_t (two, val);
6689 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6690 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6697 /* Generate a hash value for a pair of expressions. This can be used
6698 iteratively by passing a previous result as the VAL argument.
6700 The same hash value is always returned for a given pair of expressions,
6701 regardless of the order in which they are presented. This is useful in
6702 hashing the operands of commutative functions. */
6705 iterative_hash_exprs_commutative (const_tree t1,
6706 const_tree t2, hashval_t val)
6708 hashval_t one = iterative_hash_expr (t1, 0);
6709 hashval_t two = iterative_hash_expr (t2, 0);
6713 t = one, one = two, two = t;
6714 val = iterative_hash_hashval_t (one, val);
6715 val = iterative_hash_hashval_t (two, val);
6720 /* Constructors for pointer, array and function types.
6721 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6722 constructed by language-dependent code, not here.) */
6724 /* Construct, lay out and return the type of pointers to TO_TYPE with
6725 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6726 reference all of memory. If such a type has already been
6727 constructed, reuse it. */
6730 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6735 if (to_type == error_mark_node)
6736 return error_mark_node;
6738 /* If the pointed-to type has the may_alias attribute set, force
6739 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6740 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6741 can_alias_all = true;
6743 /* In some cases, languages will have things that aren't a POINTER_TYPE
6744 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6745 In that case, return that type without regard to the rest of our
6748 ??? This is a kludge, but consistent with the way this function has
6749 always operated and there doesn't seem to be a good way to avoid this
6751 if (TYPE_POINTER_TO (to_type) != 0
6752 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6753 return TYPE_POINTER_TO (to_type);
6755 /* First, if we already have a type for pointers to TO_TYPE and it's
6756 the proper mode, use it. */
6757 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6758 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6761 t = make_node (POINTER_TYPE);
6763 TREE_TYPE (t) = to_type;
6764 SET_TYPE_MODE (t, mode);
6765 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6766 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6767 TYPE_POINTER_TO (to_type) = t;
6769 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6770 SET_TYPE_STRUCTURAL_EQUALITY (t);
6771 else if (TYPE_CANONICAL (to_type) != to_type)
6773 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6774 mode, can_alias_all);
6776 /* Lay out the type. This function has many callers that are concerned
6777 with expression-construction, and this simplifies them all. */
6783 /* By default build pointers in ptr_mode. */
6786 build_pointer_type (tree to_type)
6788 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6789 : TYPE_ADDR_SPACE (to_type);
6790 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6791 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6794 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6797 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6802 if (to_type == error_mark_node)
6803 return error_mark_node;
6805 /* If the pointed-to type has the may_alias attribute set, force
6806 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6807 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6808 can_alias_all = true;
6810 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6811 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6812 In that case, return that type without regard to the rest of our
6815 ??? This is a kludge, but consistent with the way this function has
6816 always operated and there doesn't seem to be a good way to avoid this
6818 if (TYPE_REFERENCE_TO (to_type) != 0
6819 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6820 return TYPE_REFERENCE_TO (to_type);
6822 /* First, if we already have a type for pointers to TO_TYPE and it's
6823 the proper mode, use it. */
6824 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6825 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6828 t = make_node (REFERENCE_TYPE);
6830 TREE_TYPE (t) = to_type;
6831 SET_TYPE_MODE (t, mode);
6832 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6833 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6834 TYPE_REFERENCE_TO (to_type) = t;
6836 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6837 SET_TYPE_STRUCTURAL_EQUALITY (t);
6838 else if (TYPE_CANONICAL (to_type) != to_type)
6840 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6841 mode, can_alias_all);
6849 /* Build the node for the type of references-to-TO_TYPE by default
6853 build_reference_type (tree to_type)
6855 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6856 : TYPE_ADDR_SPACE (to_type);
6857 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6858 return build_reference_type_for_mode (to_type, pointer_mode, false);
6861 /* Build a type that is compatible with t but has no cv quals anywhere
6864 const char *const *const * -> char ***. */
6867 build_type_no_quals (tree t)
6869 switch (TREE_CODE (t))
6872 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6874 TYPE_REF_CAN_ALIAS_ALL (t));
6875 case REFERENCE_TYPE:
6877 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6879 TYPE_REF_CAN_ALIAS_ALL (t));
6881 return TYPE_MAIN_VARIANT (t);
6885 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6886 MAXVAL should be the maximum value in the domain
6887 (one less than the length of the array).
6889 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6890 We don't enforce this limit, that is up to caller (e.g. language front end).
6891 The limit exists because the result is a signed type and we don't handle
6892 sizes that use more than one HOST_WIDE_INT. */
6895 build_index_type (tree maxval)
6897 tree itype = make_node (INTEGER_TYPE);
6899 TREE_TYPE (itype) = sizetype;
6900 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6901 TYPE_MIN_VALUE (itype) = size_zero_node;
6902 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6903 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6904 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6905 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6906 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6907 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6909 if (host_integerp (maxval, 1))
6910 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6913 /* Since we cannot hash this type, we need to compare it using
6914 structural equality checks. */
6915 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6920 #define MAX_INT_CACHED_PREC \
6921 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6922 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
6924 /* Builds a signed or unsigned integer type of precision PRECISION.
6925 Used for C bitfields whose precision does not match that of
6926 built-in target types. */
6928 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6934 unsignedp = MAX_INT_CACHED_PREC + 1;
6936 if (precision <= MAX_INT_CACHED_PREC)
6938 itype = nonstandard_integer_type_cache[precision + unsignedp];
6943 itype = make_node (INTEGER_TYPE);
6944 TYPE_PRECISION (itype) = precision;
6947 fixup_unsigned_type (itype);
6949 fixup_signed_type (itype);
6952 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6953 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6954 if (precision <= MAX_INT_CACHED_PREC && lang_hooks.types.hash_types)
6955 nonstandard_integer_type_cache[precision + unsignedp] = ret;
6960 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6961 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6962 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6965 build_range_type (tree type, tree lowval, tree highval)
6967 tree itype = make_node (INTEGER_TYPE);
6969 TREE_TYPE (itype) = type;
6970 if (type == NULL_TREE)
6973 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6974 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6976 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6977 SET_TYPE_MODE (itype, TYPE_MODE (type));
6978 TYPE_SIZE (itype) = TYPE_SIZE (type);
6979 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6980 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6981 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6983 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6984 return type_hash_canon (tree_low_cst (highval, 0)
6985 - tree_low_cst (lowval, 0),
6991 /* Return true if the debug information for TYPE, a subtype, should be emitted
6992 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6993 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6994 debug info and doesn't reflect the source code. */
6997 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6999 tree base_type = TREE_TYPE (type), low, high;
7001 /* Subrange types have a base type which is an integral type. */
7002 if (!INTEGRAL_TYPE_P (base_type))
7005 /* Get the real bounds of the subtype. */
7006 if (lang_hooks.types.get_subrange_bounds)
7007 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7010 low = TYPE_MIN_VALUE (type);
7011 high = TYPE_MAX_VALUE (type);
7014 /* If the type and its base type have the same representation and the same
7015 name, then the type is not a subrange but a copy of the base type. */
7016 if ((TREE_CODE (base_type) == INTEGER_TYPE
7017 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7018 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7019 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7020 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7022 tree type_name = TYPE_NAME (type);
7023 tree base_type_name = TYPE_NAME (base_type);
7025 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7026 type_name = DECL_NAME (type_name);
7028 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7029 base_type_name = DECL_NAME (base_type_name);
7031 if (type_name == base_type_name)
7042 /* Just like build_index_type, but takes lowval and highval instead
7043 of just highval (maxval). */
7046 build_index_2_type (tree lowval, tree highval)
7048 return build_range_type (sizetype, lowval, highval);
7051 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7052 and number of elements specified by the range of values of INDEX_TYPE.
7053 If such a type has already been constructed, reuse it. */
7056 build_array_type (tree elt_type, tree index_type)
7059 hashval_t hashcode = 0;
7061 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7063 error ("arrays of functions are not meaningful");
7064 elt_type = integer_type_node;
7067 t = make_node (ARRAY_TYPE);
7068 TREE_TYPE (t) = elt_type;
7069 TYPE_DOMAIN (t) = index_type;
7070 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7073 /* If the element type is incomplete at this point we get marked for
7074 structural equality. Do not record these types in the canonical
7076 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7079 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7081 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7082 t = type_hash_canon (hashcode, t);
7084 if (TYPE_CANONICAL (t) == t)
7086 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7087 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7088 SET_TYPE_STRUCTURAL_EQUALITY (t);
7089 else if (TYPE_CANONICAL (elt_type) != elt_type
7090 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7092 = build_array_type (TYPE_CANONICAL (elt_type),
7093 index_type ? TYPE_CANONICAL (index_type) : NULL);
7099 /* Recursively examines the array elements of TYPE, until a non-array
7100 element type is found. */
7103 strip_array_types (tree type)
7105 while (TREE_CODE (type) == ARRAY_TYPE)
7106 type = TREE_TYPE (type);
7111 /* Computes the canonical argument types from the argument type list
7114 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7115 on entry to this function, or if any of the ARGTYPES are
7118 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7119 true on entry to this function, or if any of the ARGTYPES are
7122 Returns a canonical argument list, which may be ARGTYPES when the
7123 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7124 true) or would not differ from ARGTYPES. */
7127 maybe_canonicalize_argtypes(tree argtypes,
7128 bool *any_structural_p,
7129 bool *any_noncanonical_p)
7132 bool any_noncanonical_argtypes_p = false;
7134 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7136 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7137 /* Fail gracefully by stating that the type is structural. */
7138 *any_structural_p = true;
7139 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7140 *any_structural_p = true;
7141 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7142 || TREE_PURPOSE (arg))
7143 /* If the argument has a default argument, we consider it
7144 non-canonical even though the type itself is canonical.
7145 That way, different variants of function and method types
7146 with default arguments will all point to the variant with
7147 no defaults as their canonical type. */
7148 any_noncanonical_argtypes_p = true;
7151 if (*any_structural_p)
7154 if (any_noncanonical_argtypes_p)
7156 /* Build the canonical list of argument types. */
7157 tree canon_argtypes = NULL_TREE;
7158 bool is_void = false;
7160 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7162 if (arg == void_list_node)
7165 canon_argtypes = tree_cons (NULL_TREE,
7166 TYPE_CANONICAL (TREE_VALUE (arg)),
7170 canon_argtypes = nreverse (canon_argtypes);
7172 canon_argtypes = chainon (canon_argtypes, void_list_node);
7174 /* There is a non-canonical type. */
7175 *any_noncanonical_p = true;
7176 return canon_argtypes;
7179 /* The canonical argument types are the same as ARGTYPES. */
7183 /* Construct, lay out and return
7184 the type of functions returning type VALUE_TYPE
7185 given arguments of types ARG_TYPES.
7186 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7187 are data type nodes for the arguments of the function.
7188 If such a type has already been constructed, reuse it. */
7191 build_function_type (tree value_type, tree arg_types)
7194 hashval_t hashcode = 0;
7195 bool any_structural_p, any_noncanonical_p;
7196 tree canon_argtypes;
7198 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7200 error ("function return type cannot be function");
7201 value_type = integer_type_node;
7204 /* Make a node of the sort we want. */
7205 t = make_node (FUNCTION_TYPE);
7206 TREE_TYPE (t) = value_type;
7207 TYPE_ARG_TYPES (t) = arg_types;
7209 /* If we already have such a type, use the old one. */
7210 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7211 hashcode = type_hash_list (arg_types, hashcode);
7212 t = type_hash_canon (hashcode, t);
7214 /* Set up the canonical type. */
7215 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7216 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7217 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7219 &any_noncanonical_p);
7220 if (any_structural_p)
7221 SET_TYPE_STRUCTURAL_EQUALITY (t);
7222 else if (any_noncanonical_p)
7223 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7226 if (!COMPLETE_TYPE_P (t))
7231 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7234 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7236 tree new_type = NULL;
7237 tree args, new_args = NULL, t;
7241 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7242 args = TREE_CHAIN (args), i++)
7243 if (!bitmap_bit_p (args_to_skip, i))
7244 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7246 new_reversed = nreverse (new_args);
7250 TREE_CHAIN (new_args) = void_list_node;
7252 new_reversed = void_list_node;
7255 /* Use copy_node to preserve as much as possible from original type
7256 (debug info, attribute lists etc.)
7257 Exception is METHOD_TYPEs must have THIS argument.
7258 When we are asked to remove it, we need to build new FUNCTION_TYPE
7260 if (TREE_CODE (orig_type) != METHOD_TYPE
7261 || !bitmap_bit_p (args_to_skip, 0))
7263 new_type = copy_node (orig_type);
7264 TYPE_ARG_TYPES (new_type) = new_reversed;
7269 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7271 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7274 /* This is a new type, not a copy of an old type. Need to reassociate
7275 variants. We can handle everything except the main variant lazily. */
7276 t = TYPE_MAIN_VARIANT (orig_type);
7279 TYPE_MAIN_VARIANT (new_type) = t;
7280 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7281 TYPE_NEXT_VARIANT (t) = new_type;
7285 TYPE_MAIN_VARIANT (new_type) = new_type;
7286 TYPE_NEXT_VARIANT (new_type) = NULL;
7291 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7293 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7294 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7295 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7298 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7300 tree new_decl = copy_node (orig_decl);
7303 new_type = TREE_TYPE (orig_decl);
7304 if (prototype_p (new_type))
7305 new_type = build_function_type_skip_args (new_type, args_to_skip);
7306 TREE_TYPE (new_decl) = new_type;
7308 /* For declarations setting DECL_VINDEX (i.e. methods)
7309 we expect first argument to be THIS pointer. */
7310 if (bitmap_bit_p (args_to_skip, 0))
7311 DECL_VINDEX (new_decl) = NULL_TREE;
7315 /* Build a function type. The RETURN_TYPE is the type returned by the
7316 function. If VAARGS is set, no void_type_node is appended to the
7317 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7320 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7324 t = va_arg (argp, tree);
7325 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7326 args = tree_cons (NULL_TREE, t, args);
7331 if (args != NULL_TREE)
7332 args = nreverse (args);
7333 gcc_assert (last != void_list_node);
7335 else if (args == NULL_TREE)
7336 args = void_list_node;
7340 args = nreverse (args);
7341 TREE_CHAIN (last) = void_list_node;
7343 args = build_function_type (return_type, args);
7348 /* Build a function type. The RETURN_TYPE is the type returned by the
7349 function. If additional arguments are provided, they are
7350 additional argument types. The list of argument types must always
7351 be terminated by NULL_TREE. */
7354 build_function_type_list (tree return_type, ...)
7359 va_start (p, return_type);
7360 args = build_function_type_list_1 (false, return_type, p);
7365 /* Build a variable argument function type. The RETURN_TYPE is the
7366 type returned by the function. If additional arguments are provided,
7367 they are additional argument types. The list of argument types must
7368 always be terminated by NULL_TREE. */
7371 build_varargs_function_type_list (tree return_type, ...)
7376 va_start (p, return_type);
7377 args = build_function_type_list_1 (true, return_type, p);
7383 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7384 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7385 for the method. An implicit additional parameter (of type
7386 pointer-to-BASETYPE) is added to the ARGTYPES. */
7389 build_method_type_directly (tree basetype,
7396 bool any_structural_p, any_noncanonical_p;
7397 tree canon_argtypes;
7399 /* Make a node of the sort we want. */
7400 t = make_node (METHOD_TYPE);
7402 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7403 TREE_TYPE (t) = rettype;
7404 ptype = build_pointer_type (basetype);
7406 /* The actual arglist for this function includes a "hidden" argument
7407 which is "this". Put it into the list of argument types. */
7408 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7409 TYPE_ARG_TYPES (t) = argtypes;
7411 /* If we already have such a type, use the old one. */
7412 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7413 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7414 hashcode = type_hash_list (argtypes, hashcode);
7415 t = type_hash_canon (hashcode, t);
7417 /* Set up the canonical type. */
7419 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7420 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7422 = (TYPE_CANONICAL (basetype) != basetype
7423 || TYPE_CANONICAL (rettype) != rettype);
7424 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7426 &any_noncanonical_p);
7427 if (any_structural_p)
7428 SET_TYPE_STRUCTURAL_EQUALITY (t);
7429 else if (any_noncanonical_p)
7431 = build_method_type_directly (TYPE_CANONICAL (basetype),
7432 TYPE_CANONICAL (rettype),
7434 if (!COMPLETE_TYPE_P (t))
7440 /* Construct, lay out and return the type of methods belonging to class
7441 BASETYPE and whose arguments and values are described by TYPE.
7442 If that type exists already, reuse it.
7443 TYPE must be a FUNCTION_TYPE node. */
7446 build_method_type (tree basetype, tree type)
7448 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7450 return build_method_type_directly (basetype,
7452 TYPE_ARG_TYPES (type));
7455 /* Construct, lay out and return the type of offsets to a value
7456 of type TYPE, within an object of type BASETYPE.
7457 If a suitable offset type exists already, reuse it. */
7460 build_offset_type (tree basetype, tree type)
7463 hashval_t hashcode = 0;
7465 /* Make a node of the sort we want. */
7466 t = make_node (OFFSET_TYPE);
7468 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7469 TREE_TYPE (t) = type;
7471 /* If we already have such a type, use the old one. */
7472 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7473 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7474 t = type_hash_canon (hashcode, t);
7476 if (!COMPLETE_TYPE_P (t))
7479 if (TYPE_CANONICAL (t) == t)
7481 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7482 || TYPE_STRUCTURAL_EQUALITY_P (type))
7483 SET_TYPE_STRUCTURAL_EQUALITY (t);
7484 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7485 || TYPE_CANONICAL (type) != type)
7487 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7488 TYPE_CANONICAL (type));
7494 /* Create a complex type whose components are COMPONENT_TYPE. */
7497 build_complex_type (tree component_type)
7502 gcc_assert (INTEGRAL_TYPE_P (component_type)
7503 || SCALAR_FLOAT_TYPE_P (component_type)
7504 || FIXED_POINT_TYPE_P (component_type));
7506 /* Make a node of the sort we want. */
7507 t = make_node (COMPLEX_TYPE);
7509 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7511 /* If we already have such a type, use the old one. */
7512 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7513 t = type_hash_canon (hashcode, t);
7515 if (!COMPLETE_TYPE_P (t))
7518 if (TYPE_CANONICAL (t) == t)
7520 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7521 SET_TYPE_STRUCTURAL_EQUALITY (t);
7522 else if (TYPE_CANONICAL (component_type) != component_type)
7524 = build_complex_type (TYPE_CANONICAL (component_type));
7527 /* We need to create a name, since complex is a fundamental type. */
7528 if (! TYPE_NAME (t))
7531 if (component_type == char_type_node)
7532 name = "complex char";
7533 else if (component_type == signed_char_type_node)
7534 name = "complex signed char";
7535 else if (component_type == unsigned_char_type_node)
7536 name = "complex unsigned char";
7537 else if (component_type == short_integer_type_node)
7538 name = "complex short int";
7539 else if (component_type == short_unsigned_type_node)
7540 name = "complex short unsigned int";
7541 else if (component_type == integer_type_node)
7542 name = "complex int";
7543 else if (component_type == unsigned_type_node)
7544 name = "complex unsigned int";
7545 else if (component_type == long_integer_type_node)
7546 name = "complex long int";
7547 else if (component_type == long_unsigned_type_node)
7548 name = "complex long unsigned int";
7549 else if (component_type == long_long_integer_type_node)
7550 name = "complex long long int";
7551 else if (component_type == long_long_unsigned_type_node)
7552 name = "complex long long unsigned int";
7557 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7558 get_identifier (name), t);
7561 return build_qualified_type (t, TYPE_QUALS (component_type));
7564 /* If TYPE is a real or complex floating-point type and the target
7565 does not directly support arithmetic on TYPE then return the wider
7566 type to be used for arithmetic on TYPE. Otherwise, return
7570 excess_precision_type (tree type)
7572 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7574 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7575 switch (TREE_CODE (type))
7578 switch (flt_eval_method)
7581 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7582 return double_type_node;
7585 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7586 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7587 return long_double_type_node;
7594 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7596 switch (flt_eval_method)
7599 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7600 return complex_double_type_node;
7603 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7604 || (TYPE_MODE (TREE_TYPE (type))
7605 == TYPE_MODE (double_type_node)))
7606 return complex_long_double_type_node;
7619 /* Return OP, stripped of any conversions to wider types as much as is safe.
7620 Converting the value back to OP's type makes a value equivalent to OP.
7622 If FOR_TYPE is nonzero, we return a value which, if converted to
7623 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7625 OP must have integer, real or enumeral type. Pointers are not allowed!
7627 There are some cases where the obvious value we could return
7628 would regenerate to OP if converted to OP's type,
7629 but would not extend like OP to wider types.
7630 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7631 For example, if OP is (unsigned short)(signed char)-1,
7632 we avoid returning (signed char)-1 if FOR_TYPE is int,
7633 even though extending that to an unsigned short would regenerate OP,
7634 since the result of extending (signed char)-1 to (int)
7635 is different from (int) OP. */
7638 get_unwidened (tree op, tree for_type)
7640 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7641 tree type = TREE_TYPE (op);
7643 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7645 = (for_type != 0 && for_type != type
7646 && final_prec > TYPE_PRECISION (type)
7647 && TYPE_UNSIGNED (type));
7650 while (CONVERT_EXPR_P (op))
7654 /* TYPE_PRECISION on vector types has different meaning
7655 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7656 so avoid them here. */
7657 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7660 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7661 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7663 /* Truncations are many-one so cannot be removed.
7664 Unless we are later going to truncate down even farther. */
7666 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7669 /* See what's inside this conversion. If we decide to strip it,
7671 op = TREE_OPERAND (op, 0);
7673 /* If we have not stripped any zero-extensions (uns is 0),
7674 we can strip any kind of extension.
7675 If we have previously stripped a zero-extension,
7676 only zero-extensions can safely be stripped.
7677 Any extension can be stripped if the bits it would produce
7678 are all going to be discarded later by truncating to FOR_TYPE. */
7682 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7684 /* TYPE_UNSIGNED says whether this is a zero-extension.
7685 Let's avoid computing it if it does not affect WIN
7686 and if UNS will not be needed again. */
7688 || CONVERT_EXPR_P (op))
7689 && TYPE_UNSIGNED (TREE_TYPE (op)))
7697 /* If we finally reach a constant see if it fits in for_type and
7698 in that case convert it. */
7700 && TREE_CODE (win) == INTEGER_CST
7701 && TREE_TYPE (win) != for_type
7702 && int_fits_type_p (win, for_type))
7703 win = fold_convert (for_type, win);
7708 /* Return OP or a simpler expression for a narrower value
7709 which can be sign-extended or zero-extended to give back OP.
7710 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7711 or 0 if the value should be sign-extended. */
7714 get_narrower (tree op, int *unsignedp_ptr)
7719 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7721 while (TREE_CODE (op) == NOP_EXPR)
7724 = (TYPE_PRECISION (TREE_TYPE (op))
7725 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7727 /* Truncations are many-one so cannot be removed. */
7731 /* See what's inside this conversion. If we decide to strip it,
7736 op = TREE_OPERAND (op, 0);
7737 /* An extension: the outermost one can be stripped,
7738 but remember whether it is zero or sign extension. */
7740 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7741 /* Otherwise, if a sign extension has been stripped,
7742 only sign extensions can now be stripped;
7743 if a zero extension has been stripped, only zero-extensions. */
7744 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7748 else /* bitschange == 0 */
7750 /* A change in nominal type can always be stripped, but we must
7751 preserve the unsignedness. */
7753 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7755 op = TREE_OPERAND (op, 0);
7756 /* Keep trying to narrow, but don't assign op to win if it
7757 would turn an integral type into something else. */
7758 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7765 if (TREE_CODE (op) == COMPONENT_REF
7766 /* Since type_for_size always gives an integer type. */
7767 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7768 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7769 /* Ensure field is laid out already. */
7770 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7771 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7773 unsigned HOST_WIDE_INT innerprec
7774 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7775 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7776 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7777 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7779 /* We can get this structure field in a narrower type that fits it,
7780 but the resulting extension to its nominal type (a fullword type)
7781 must satisfy the same conditions as for other extensions.
7783 Do this only for fields that are aligned (not bit-fields),
7784 because when bit-field insns will be used there is no
7785 advantage in doing this. */
7787 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7788 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7789 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7793 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7794 win = fold_convert (type, op);
7798 *unsignedp_ptr = uns;
7802 /* Nonzero if integer constant C has a value that is permissible
7803 for type TYPE (an INTEGER_TYPE). */
7806 int_fits_type_p (const_tree c, const_tree type)
7808 tree type_low_bound, type_high_bound;
7809 bool ok_for_low_bound, ok_for_high_bound, unsc;
7812 dc = tree_to_double_int (c);
7813 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7815 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7816 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7818 /* So c is an unsigned integer whose type is sizetype and type is not.
7819 sizetype'd integers are sign extended even though they are
7820 unsigned. If the integer value fits in the lower end word of c,
7821 and if the higher end word has all its bits set to 1, that
7822 means the higher end bits are set to 1 only for sign extension.
7823 So let's convert c into an equivalent zero extended unsigned
7825 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7828 type_low_bound = TYPE_MIN_VALUE (type);
7829 type_high_bound = TYPE_MAX_VALUE (type);
7831 /* If at least one bound of the type is a constant integer, we can check
7832 ourselves and maybe make a decision. If no such decision is possible, but
7833 this type is a subtype, try checking against that. Otherwise, use
7834 fit_double_type, which checks against the precision.
7836 Compute the status for each possibly constant bound, and return if we see
7837 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7838 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7839 for "constant known to fit". */
7841 /* Check if c >= type_low_bound. */
7842 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7844 dd = tree_to_double_int (type_low_bound);
7845 if (TREE_CODE (type) == INTEGER_TYPE
7846 && TYPE_IS_SIZETYPE (type)
7847 && TYPE_UNSIGNED (type))
7848 dd = double_int_zext (dd, TYPE_PRECISION (type));
7849 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7851 int c_neg = (!unsc && double_int_negative_p (dc));
7852 int t_neg = (unsc && double_int_negative_p (dd));
7854 if (c_neg && !t_neg)
7856 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7859 else if (double_int_cmp (dc, dd, unsc) < 0)
7861 ok_for_low_bound = true;
7864 ok_for_low_bound = false;
7866 /* Check if c <= type_high_bound. */
7867 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7869 dd = tree_to_double_int (type_high_bound);
7870 if (TREE_CODE (type) == INTEGER_TYPE
7871 && TYPE_IS_SIZETYPE (type)
7872 && TYPE_UNSIGNED (type))
7873 dd = double_int_zext (dd, TYPE_PRECISION (type));
7874 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7876 int c_neg = (!unsc && double_int_negative_p (dc));
7877 int t_neg = (unsc && double_int_negative_p (dd));
7879 if (t_neg && !c_neg)
7881 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7884 else if (double_int_cmp (dc, dd, unsc) > 0)
7886 ok_for_high_bound = true;
7889 ok_for_high_bound = false;
7891 /* If the constant fits both bounds, the result is known. */
7892 if (ok_for_low_bound && ok_for_high_bound)
7895 /* Perform some generic filtering which may allow making a decision
7896 even if the bounds are not constant. First, negative integers
7897 never fit in unsigned types, */
7898 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7901 /* Second, narrower types always fit in wider ones. */
7902 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7905 /* Third, unsigned integers with top bit set never fit signed types. */
7906 if (! TYPE_UNSIGNED (type) && unsc)
7908 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7909 if (prec < HOST_BITS_PER_WIDE_INT)
7911 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7914 else if (((((unsigned HOST_WIDE_INT) 1)
7915 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7919 /* If we haven't been able to decide at this point, there nothing more we
7920 can check ourselves here. Look at the base type if we have one and it
7921 has the same precision. */
7922 if (TREE_CODE (type) == INTEGER_TYPE
7923 && TREE_TYPE (type) != 0
7924 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7926 type = TREE_TYPE (type);
7930 /* Or to fit_double_type, if nothing else. */
7931 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7934 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7935 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7936 represented (assuming two's-complement arithmetic) within the bit
7937 precision of the type are returned instead. */
7940 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7942 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7943 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7944 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7945 TYPE_UNSIGNED (type));
7948 if (TYPE_UNSIGNED (type))
7949 mpz_set_ui (min, 0);
7953 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7954 mn = double_int_sext (double_int_add (mn, double_int_one),
7955 TYPE_PRECISION (type));
7956 mpz_set_double_int (min, mn, false);
7960 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7961 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7962 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7963 TYPE_UNSIGNED (type));
7966 if (TYPE_UNSIGNED (type))
7967 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7970 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7975 /* Return true if VAR is an automatic variable defined in function FN. */
7978 auto_var_in_fn_p (const_tree var, const_tree fn)
7980 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7981 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
7982 || TREE_CODE (var) == PARM_DECL)
7983 && ! TREE_STATIC (var))
7984 || TREE_CODE (var) == LABEL_DECL
7985 || TREE_CODE (var) == RESULT_DECL));
7988 /* Subprogram of following function. Called by walk_tree.
7990 Return *TP if it is an automatic variable or parameter of the
7991 function passed in as DATA. */
7994 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7996 tree fn = (tree) data;
8001 else if (DECL_P (*tp)
8002 && auto_var_in_fn_p (*tp, fn))
8008 /* Returns true if T is, contains, or refers to a type with variable
8009 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8010 arguments, but not the return type. If FN is nonzero, only return
8011 true if a modifier of the type or position of FN is a variable or
8012 parameter inside FN.
8014 This concept is more general than that of C99 'variably modified types':
8015 in C99, a struct type is never variably modified because a VLA may not
8016 appear as a structure member. However, in GNU C code like:
8018 struct S { int i[f()]; };
8020 is valid, and other languages may define similar constructs. */
8023 variably_modified_type_p (tree type, tree fn)
8027 /* Test if T is either variable (if FN is zero) or an expression containing
8028 a variable in FN. */
8029 #define RETURN_TRUE_IF_VAR(T) \
8030 do { tree _t = (T); \
8031 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8032 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8033 return true; } while (0)
8035 if (type == error_mark_node)
8038 /* If TYPE itself has variable size, it is variably modified. */
8039 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8040 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8042 switch (TREE_CODE (type))
8045 case REFERENCE_TYPE:
8047 if (variably_modified_type_p (TREE_TYPE (type), fn))
8053 /* If TYPE is a function type, it is variably modified if the
8054 return type is variably modified. */
8055 if (variably_modified_type_p (TREE_TYPE (type), fn))
8061 case FIXED_POINT_TYPE:
8064 /* Scalar types are variably modified if their end points
8066 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8067 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8072 case QUAL_UNION_TYPE:
8073 /* We can't see if any of the fields are variably-modified by the
8074 definition we normally use, since that would produce infinite
8075 recursion via pointers. */
8076 /* This is variably modified if some field's type is. */
8077 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8078 if (TREE_CODE (t) == FIELD_DECL)
8080 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8081 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8082 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8084 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8085 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8090 /* Do not call ourselves to avoid infinite recursion. This is
8091 variably modified if the element type is. */
8092 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8093 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8100 /* The current language may have other cases to check, but in general,
8101 all other types are not variably modified. */
8102 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8104 #undef RETURN_TRUE_IF_VAR
8107 /* Given a DECL or TYPE, return the scope in which it was declared, or
8108 NULL_TREE if there is no containing scope. */
8111 get_containing_scope (const_tree t)
8113 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8116 /* Return the innermost context enclosing DECL that is
8117 a FUNCTION_DECL, or zero if none. */
8120 decl_function_context (const_tree decl)
8124 if (TREE_CODE (decl) == ERROR_MARK)
8127 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8128 where we look up the function at runtime. Such functions always take
8129 a first argument of type 'pointer to real context'.
8131 C++ should really be fixed to use DECL_CONTEXT for the real context,
8132 and use something else for the "virtual context". */
8133 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8136 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8138 context = DECL_CONTEXT (decl);
8140 while (context && TREE_CODE (context) != FUNCTION_DECL)
8142 if (TREE_CODE (context) == BLOCK)
8143 context = BLOCK_SUPERCONTEXT (context);
8145 context = get_containing_scope (context);
8151 /* Return the innermost context enclosing DECL that is
8152 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8153 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8156 decl_type_context (const_tree decl)
8158 tree context = DECL_CONTEXT (decl);
8161 switch (TREE_CODE (context))
8163 case NAMESPACE_DECL:
8164 case TRANSLATION_UNIT_DECL:
8169 case QUAL_UNION_TYPE:
8174 context = DECL_CONTEXT (context);
8178 context = BLOCK_SUPERCONTEXT (context);
8188 /* CALL is a CALL_EXPR. Return the declaration for the function
8189 called, or NULL_TREE if the called function cannot be
8193 get_callee_fndecl (const_tree call)
8197 if (call == error_mark_node)
8198 return error_mark_node;
8200 /* It's invalid to call this function with anything but a
8202 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8204 /* The first operand to the CALL is the address of the function
8206 addr = CALL_EXPR_FN (call);
8210 /* If this is a readonly function pointer, extract its initial value. */
8211 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8212 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8213 && DECL_INITIAL (addr))
8214 addr = DECL_INITIAL (addr);
8216 /* If the address is just `&f' for some function `f', then we know
8217 that `f' is being called. */
8218 if (TREE_CODE (addr) == ADDR_EXPR
8219 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8220 return TREE_OPERAND (addr, 0);
8222 /* We couldn't figure out what was being called. */
8226 /* Print debugging information about tree nodes generated during the compile,
8227 and any language-specific information. */
8230 dump_tree_statistics (void)
8232 #ifdef GATHER_STATISTICS
8234 int total_nodes, total_bytes;
8237 fprintf (stderr, "\n??? tree nodes created\n\n");
8238 #ifdef GATHER_STATISTICS
8239 fprintf (stderr, "Kind Nodes Bytes\n");
8240 fprintf (stderr, "---------------------------------------\n");
8241 total_nodes = total_bytes = 0;
8242 for (i = 0; i < (int) all_kinds; i++)
8244 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8245 tree_node_counts[i], tree_node_sizes[i]);
8246 total_nodes += tree_node_counts[i];
8247 total_bytes += tree_node_sizes[i];
8249 fprintf (stderr, "---------------------------------------\n");
8250 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8251 fprintf (stderr, "---------------------------------------\n");
8252 ssanames_print_statistics ();
8253 phinodes_print_statistics ();
8255 fprintf (stderr, "(No per-node statistics)\n");
8257 print_type_hash_statistics ();
8258 print_debug_expr_statistics ();
8259 print_value_expr_statistics ();
8260 lang_hooks.print_statistics ();
8263 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8265 /* Generate a crc32 of a string. */
8268 crc32_string (unsigned chksum, const char *string)
8272 unsigned value = *string << 24;
8275 for (ix = 8; ix--; value <<= 1)
8279 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8288 /* P is a string that will be used in a symbol. Mask out any characters
8289 that are not valid in that context. */
8292 clean_symbol_name (char *p)
8296 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8299 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8306 /* Generate a name for a special-purpose function function.
8307 The generated name may need to be unique across the whole link.
8308 TYPE is some string to identify the purpose of this function to the
8309 linker or collect2; it must start with an uppercase letter,
8311 I - for constructors
8313 N - for C++ anonymous namespaces
8314 F - for DWARF unwind frame information. */
8317 get_file_function_name (const char *type)
8323 /* If we already have a name we know to be unique, just use that. */
8324 if (first_global_object_name)
8325 p = q = ASTRDUP (first_global_object_name);
8326 /* If the target is handling the constructors/destructors, they
8327 will be local to this file and the name is only necessary for
8328 debugging purposes. */
8329 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8331 const char *file = main_input_filename;
8333 file = input_filename;
8334 /* Just use the file's basename, because the full pathname
8335 might be quite long. */
8336 p = strrchr (file, '/');
8341 p = q = ASTRDUP (p);
8345 /* Otherwise, the name must be unique across the entire link.
8346 We don't have anything that we know to be unique to this translation
8347 unit, so use what we do have and throw in some randomness. */
8349 const char *name = weak_global_object_name;
8350 const char *file = main_input_filename;
8355 file = input_filename;
8357 len = strlen (file);
8358 q = (char *) alloca (9 * 2 + len + 1);
8359 memcpy (q, file, len + 1);
8361 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8362 crc32_string (0, get_random_seed (false)));
8367 clean_symbol_name (q);
8368 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8371 /* Set up the name of the file-level functions we may need.
8372 Use a global object (which is already required to be unique over
8373 the program) rather than the file name (which imposes extra
8375 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8377 return get_identifier (buf);
8380 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8382 /* Complain that the tree code of NODE does not match the expected 0
8383 terminated list of trailing codes. The trailing code list can be
8384 empty, for a more vague error message. FILE, LINE, and FUNCTION
8385 are of the caller. */
8388 tree_check_failed (const_tree node, const char *file,
8389 int line, const char *function, ...)
8393 unsigned length = 0;
8396 va_start (args, function);
8397 while ((code = va_arg (args, int)))
8398 length += 4 + strlen (tree_code_name[code]);
8403 va_start (args, function);
8404 length += strlen ("expected ");
8405 buffer = tmp = (char *) alloca (length);
8407 while ((code = va_arg (args, int)))
8409 const char *prefix = length ? " or " : "expected ";
8411 strcpy (tmp + length, prefix);
8412 length += strlen (prefix);
8413 strcpy (tmp + length, tree_code_name[code]);
8414 length += strlen (tree_code_name[code]);
8419 buffer = "unexpected node";
8421 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8422 buffer, tree_code_name[TREE_CODE (node)],
8423 function, trim_filename (file), line);
8426 /* Complain that the tree code of NODE does match the expected 0
8427 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8431 tree_not_check_failed (const_tree node, const char *file,
8432 int line, const char *function, ...)
8436 unsigned length = 0;
8439 va_start (args, function);
8440 while ((code = va_arg (args, int)))
8441 length += 4 + strlen (tree_code_name[code]);
8443 va_start (args, function);
8444 buffer = (char *) alloca (length);
8446 while ((code = va_arg (args, int)))
8450 strcpy (buffer + length, " or ");
8453 strcpy (buffer + length, tree_code_name[code]);
8454 length += strlen (tree_code_name[code]);
8458 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8459 buffer, tree_code_name[TREE_CODE (node)],
8460 function, trim_filename (file), line);
8463 /* Similar to tree_check_failed, except that we check for a class of tree
8464 code, given in CL. */
8467 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8468 const char *file, int line, const char *function)
8471 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8472 TREE_CODE_CLASS_STRING (cl),
8473 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8474 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8477 /* Similar to tree_check_failed, except that instead of specifying a
8478 dozen codes, use the knowledge that they're all sequential. */
8481 tree_range_check_failed (const_tree node, const char *file, int line,
8482 const char *function, enum tree_code c1,
8486 unsigned length = 0;
8489 for (c = c1; c <= c2; ++c)
8490 length += 4 + strlen (tree_code_name[c]);
8492 length += strlen ("expected ");
8493 buffer = (char *) alloca (length);
8496 for (c = c1; c <= c2; ++c)
8498 const char *prefix = length ? " or " : "expected ";
8500 strcpy (buffer + length, prefix);
8501 length += strlen (prefix);
8502 strcpy (buffer + length, tree_code_name[c]);
8503 length += strlen (tree_code_name[c]);
8506 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8507 buffer, tree_code_name[TREE_CODE (node)],
8508 function, trim_filename (file), line);
8512 /* Similar to tree_check_failed, except that we check that a tree does
8513 not have the specified code, given in CL. */
8516 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8517 const char *file, int line, const char *function)
8520 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8521 TREE_CODE_CLASS_STRING (cl),
8522 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8523 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8527 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8530 omp_clause_check_failed (const_tree node, const char *file, int line,
8531 const char *function, enum omp_clause_code code)
8533 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8534 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8535 function, trim_filename (file), line);
8539 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8542 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8543 const char *function, enum omp_clause_code c1,
8544 enum omp_clause_code c2)
8547 unsigned length = 0;
8550 for (c = c1; c <= c2; ++c)
8551 length += 4 + strlen (omp_clause_code_name[c]);
8553 length += strlen ("expected ");
8554 buffer = (char *) alloca (length);
8557 for (c = c1; c <= c2; ++c)
8559 const char *prefix = length ? " or " : "expected ";
8561 strcpy (buffer + length, prefix);
8562 length += strlen (prefix);
8563 strcpy (buffer + length, omp_clause_code_name[c]);
8564 length += strlen (omp_clause_code_name[c]);
8567 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8568 buffer, omp_clause_code_name[TREE_CODE (node)],
8569 function, trim_filename (file), line);
8573 #undef DEFTREESTRUCT
8574 #define DEFTREESTRUCT(VAL, NAME) NAME,
8576 static const char *ts_enum_names[] = {
8577 #include "treestruct.def"
8579 #undef DEFTREESTRUCT
8581 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8583 /* Similar to tree_class_check_failed, except that we check for
8584 whether CODE contains the tree structure identified by EN. */
8587 tree_contains_struct_check_failed (const_tree node,
8588 const enum tree_node_structure_enum en,
8589 const char *file, int line,
8590 const char *function)
8593 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8595 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8599 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8600 (dynamically sized) vector. */
8603 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8604 const char *function)
8607 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8608 idx + 1, len, function, trim_filename (file), line);
8611 /* Similar to above, except that the check is for the bounds of the operand
8612 vector of an expression node EXP. */
8615 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8616 int line, const char *function)
8618 int code = TREE_CODE (exp);
8620 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8621 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8622 function, trim_filename (file), line);
8625 /* Similar to above, except that the check is for the number of
8626 operands of an OMP_CLAUSE node. */
8629 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8630 int line, const char *function)
8633 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8634 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8635 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8636 trim_filename (file), line);
8638 #endif /* ENABLE_TREE_CHECKING */
8640 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8641 and mapped to the machine mode MODE. Initialize its fields and build
8642 the information necessary for debugging output. */
8645 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8648 hashval_t hashcode = 0;
8650 t = make_node (VECTOR_TYPE);
8651 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8652 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8653 SET_TYPE_MODE (t, mode);
8655 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8656 SET_TYPE_STRUCTURAL_EQUALITY (t);
8657 else if (TYPE_CANONICAL (innertype) != innertype
8658 || mode != VOIDmode)
8660 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8665 tree index = build_int_cst (NULL_TREE, nunits - 1);
8666 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8667 build_index_type (index));
8668 tree rt = make_node (RECORD_TYPE);
8670 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8671 get_identifier ("f"), array);
8672 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8674 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8675 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8676 the representation type, and we want to find that die when looking up
8677 the vector type. This is most easily achieved by making the TYPE_UID
8679 TYPE_UID (rt) = TYPE_UID (t);
8682 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8683 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8684 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8685 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8686 t = type_hash_canon (hashcode, t);
8688 /* We have built a main variant, based on the main variant of the
8689 inner type. Use it to build the variant we return. */
8690 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8691 && TREE_TYPE (t) != innertype)
8692 return build_type_attribute_qual_variant (t,
8693 TYPE_ATTRIBUTES (innertype),
8694 TYPE_QUALS (innertype));
8700 make_or_reuse_type (unsigned size, int unsignedp)
8702 if (size == INT_TYPE_SIZE)
8703 return unsignedp ? unsigned_type_node : integer_type_node;
8704 if (size == CHAR_TYPE_SIZE)
8705 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8706 if (size == SHORT_TYPE_SIZE)
8707 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8708 if (size == LONG_TYPE_SIZE)
8709 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8710 if (size == LONG_LONG_TYPE_SIZE)
8711 return (unsignedp ? long_long_unsigned_type_node
8712 : long_long_integer_type_node);
8715 return make_unsigned_type (size);
8717 return make_signed_type (size);
8720 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8723 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8727 if (size == SHORT_FRACT_TYPE_SIZE)
8728 return unsignedp ? sat_unsigned_short_fract_type_node
8729 : sat_short_fract_type_node;
8730 if (size == FRACT_TYPE_SIZE)
8731 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8732 if (size == LONG_FRACT_TYPE_SIZE)
8733 return unsignedp ? sat_unsigned_long_fract_type_node
8734 : sat_long_fract_type_node;
8735 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8736 return unsignedp ? sat_unsigned_long_long_fract_type_node
8737 : sat_long_long_fract_type_node;
8741 if (size == SHORT_FRACT_TYPE_SIZE)
8742 return unsignedp ? unsigned_short_fract_type_node
8743 : short_fract_type_node;
8744 if (size == FRACT_TYPE_SIZE)
8745 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8746 if (size == LONG_FRACT_TYPE_SIZE)
8747 return unsignedp ? unsigned_long_fract_type_node
8748 : long_fract_type_node;
8749 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8750 return unsignedp ? unsigned_long_long_fract_type_node
8751 : long_long_fract_type_node;
8754 return make_fract_type (size, unsignedp, satp);
8757 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8760 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8764 if (size == SHORT_ACCUM_TYPE_SIZE)
8765 return unsignedp ? sat_unsigned_short_accum_type_node
8766 : sat_short_accum_type_node;
8767 if (size == ACCUM_TYPE_SIZE)
8768 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8769 if (size == LONG_ACCUM_TYPE_SIZE)
8770 return unsignedp ? sat_unsigned_long_accum_type_node
8771 : sat_long_accum_type_node;
8772 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8773 return unsignedp ? sat_unsigned_long_long_accum_type_node
8774 : sat_long_long_accum_type_node;
8778 if (size == SHORT_ACCUM_TYPE_SIZE)
8779 return unsignedp ? unsigned_short_accum_type_node
8780 : short_accum_type_node;
8781 if (size == ACCUM_TYPE_SIZE)
8782 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8783 if (size == LONG_ACCUM_TYPE_SIZE)
8784 return unsignedp ? unsigned_long_accum_type_node
8785 : long_accum_type_node;
8786 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8787 return unsignedp ? unsigned_long_long_accum_type_node
8788 : long_long_accum_type_node;
8791 return make_accum_type (size, unsignedp, satp);
8794 /* Create nodes for all integer types (and error_mark_node) using the sizes
8795 of C datatypes. The caller should call set_sizetype soon after calling
8796 this function to select one of the types as sizetype. */
8799 build_common_tree_nodes (bool signed_char)
8801 error_mark_node = make_node (ERROR_MARK);
8802 TREE_TYPE (error_mark_node) = error_mark_node;
8804 initialize_sizetypes ();
8806 /* Define both `signed char' and `unsigned char'. */
8807 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8808 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8809 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8810 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8812 /* Define `char', which is like either `signed char' or `unsigned char'
8813 but not the same as either. */
8816 ? make_signed_type (CHAR_TYPE_SIZE)
8817 : make_unsigned_type (CHAR_TYPE_SIZE));
8818 TYPE_STRING_FLAG (char_type_node) = 1;
8820 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8821 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8822 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8823 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8824 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8825 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8826 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8827 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8829 /* Define a boolean type. This type only represents boolean values but
8830 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8831 Front ends which want to override this size (i.e. Java) can redefine
8832 boolean_type_node before calling build_common_tree_nodes_2. */
8833 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8834 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8835 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8836 TYPE_PRECISION (boolean_type_node) = 1;
8838 /* Fill in the rest of the sized types. Reuse existing type nodes
8840 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8841 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8842 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8843 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8844 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8846 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8847 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8848 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8849 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8850 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8852 access_public_node = get_identifier ("public");
8853 access_protected_node = get_identifier ("protected");
8854 access_private_node = get_identifier ("private");
8857 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8858 It will create several other common tree nodes. */
8861 build_common_tree_nodes_2 (int short_double)
8863 /* Define these next since types below may used them. */
8864 integer_zero_node = build_int_cst (NULL_TREE, 0);
8865 integer_one_node = build_int_cst (NULL_TREE, 1);
8866 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8868 size_zero_node = size_int (0);
8869 size_one_node = size_int (1);
8870 bitsize_zero_node = bitsize_int (0);
8871 bitsize_one_node = bitsize_int (1);
8872 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8874 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8875 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8877 void_type_node = make_node (VOID_TYPE);
8878 layout_type (void_type_node);
8880 /* We are not going to have real types in C with less than byte alignment,
8881 so we might as well not have any types that claim to have it. */
8882 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8883 TYPE_USER_ALIGN (void_type_node) = 0;
8885 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8886 layout_type (TREE_TYPE (null_pointer_node));
8888 ptr_type_node = build_pointer_type (void_type_node);
8890 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8891 fileptr_type_node = ptr_type_node;
8893 float_type_node = make_node (REAL_TYPE);
8894 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8895 layout_type (float_type_node);
8897 double_type_node = make_node (REAL_TYPE);
8899 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8901 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8902 layout_type (double_type_node);
8904 long_double_type_node = make_node (REAL_TYPE);
8905 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8906 layout_type (long_double_type_node);
8908 float_ptr_type_node = build_pointer_type (float_type_node);
8909 double_ptr_type_node = build_pointer_type (double_type_node);
8910 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8911 integer_ptr_type_node = build_pointer_type (integer_type_node);
8913 /* Fixed size integer types. */
8914 uint32_type_node = build_nonstandard_integer_type (32, true);
8915 uint64_type_node = build_nonstandard_integer_type (64, true);
8917 /* Decimal float types. */
8918 dfloat32_type_node = make_node (REAL_TYPE);
8919 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8920 layout_type (dfloat32_type_node);
8921 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8922 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8924 dfloat64_type_node = make_node (REAL_TYPE);
8925 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8926 layout_type (dfloat64_type_node);
8927 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8928 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8930 dfloat128_type_node = make_node (REAL_TYPE);
8931 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8932 layout_type (dfloat128_type_node);
8933 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8934 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8936 complex_integer_type_node = build_complex_type (integer_type_node);
8937 complex_float_type_node = build_complex_type (float_type_node);
8938 complex_double_type_node = build_complex_type (double_type_node);
8939 complex_long_double_type_node = build_complex_type (long_double_type_node);
8941 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8942 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8943 sat_ ## KIND ## _type_node = \
8944 make_sat_signed_ ## KIND ## _type (SIZE); \
8945 sat_unsigned_ ## KIND ## _type_node = \
8946 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8947 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8948 unsigned_ ## KIND ## _type_node = \
8949 make_unsigned_ ## KIND ## _type (SIZE);
8951 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8952 sat_ ## WIDTH ## KIND ## _type_node = \
8953 make_sat_signed_ ## KIND ## _type (SIZE); \
8954 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8955 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8956 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8957 unsigned_ ## WIDTH ## KIND ## _type_node = \
8958 make_unsigned_ ## KIND ## _type (SIZE);
8960 /* Make fixed-point type nodes based on four different widths. */
8961 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8962 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8963 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8964 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8965 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8967 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8968 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8969 NAME ## _type_node = \
8970 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8971 u ## NAME ## _type_node = \
8972 make_or_reuse_unsigned_ ## KIND ## _type \
8973 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8974 sat_ ## NAME ## _type_node = \
8975 make_or_reuse_sat_signed_ ## KIND ## _type \
8976 (GET_MODE_BITSIZE (MODE ## mode)); \
8977 sat_u ## NAME ## _type_node = \
8978 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8979 (GET_MODE_BITSIZE (U ## MODE ## mode));
8981 /* Fixed-point type and mode nodes. */
8982 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8983 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8984 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8985 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8986 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8987 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8988 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8989 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8990 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8991 MAKE_FIXED_MODE_NODE (accum, da, DA)
8992 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8995 tree t = targetm.build_builtin_va_list ();
8997 /* Many back-ends define record types without setting TYPE_NAME.
8998 If we copied the record type here, we'd keep the original
8999 record type without a name. This breaks name mangling. So,
9000 don't copy record types and let c_common_nodes_and_builtins()
9001 declare the type to be __builtin_va_list. */
9002 if (TREE_CODE (t) != RECORD_TYPE)
9003 t = build_variant_type_copy (t);
9005 va_list_type_node = t;
9009 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9012 local_define_builtin (const char *name, tree type, enum built_in_function code,
9013 const char *library_name, int ecf_flags)
9017 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9018 library_name, NULL_TREE);
9019 if (ecf_flags & ECF_CONST)
9020 TREE_READONLY (decl) = 1;
9021 if (ecf_flags & ECF_PURE)
9022 DECL_PURE_P (decl) = 1;
9023 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9024 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9025 if (ecf_flags & ECF_NORETURN)
9026 TREE_THIS_VOLATILE (decl) = 1;
9027 if (ecf_flags & ECF_NOTHROW)
9028 TREE_NOTHROW (decl) = 1;
9029 if (ecf_flags & ECF_MALLOC)
9030 DECL_IS_MALLOC (decl) = 1;
9032 built_in_decls[code] = decl;
9033 implicit_built_in_decls[code] = decl;
9036 /* Call this function after instantiating all builtins that the language
9037 front end cares about. This will build the rest of the builtins that
9038 are relied upon by the tree optimizers and the middle-end. */
9041 build_common_builtin_nodes (void)
9043 tree tmp, tmp2, ftype;
9045 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9046 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9048 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9049 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9050 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9051 ftype = build_function_type (ptr_type_node, tmp);
9053 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9054 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9055 "memcpy", ECF_NOTHROW);
9056 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9057 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9058 "memmove", ECF_NOTHROW);
9061 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9063 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9064 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9065 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9066 ftype = build_function_type (integer_type_node, tmp);
9067 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9068 "memcmp", ECF_PURE | ECF_NOTHROW);
9071 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9073 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9074 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9075 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9076 ftype = build_function_type (ptr_type_node, tmp);
9077 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9078 "memset", ECF_NOTHROW);
9081 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9083 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9084 ftype = build_function_type (ptr_type_node, tmp);
9085 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9086 "alloca", ECF_MALLOC | ECF_NOTHROW);
9089 /* If we're checking the stack, `alloca' can throw. */
9090 if (flag_stack_check)
9091 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9093 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9094 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9095 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9096 ftype = build_function_type (void_type_node, tmp);
9097 local_define_builtin ("__builtin_init_trampoline", ftype,
9098 BUILT_IN_INIT_TRAMPOLINE,
9099 "__builtin_init_trampoline", ECF_NOTHROW);
9101 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9102 ftype = build_function_type (ptr_type_node, tmp);
9103 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9104 BUILT_IN_ADJUST_TRAMPOLINE,
9105 "__builtin_adjust_trampoline",
9106 ECF_CONST | ECF_NOTHROW);
9108 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9109 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9110 ftype = build_function_type (void_type_node, tmp);
9111 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9112 BUILT_IN_NONLOCAL_GOTO,
9113 "__builtin_nonlocal_goto",
9114 ECF_NORETURN | ECF_NOTHROW);
9116 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9117 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9118 ftype = build_function_type (void_type_node, tmp);
9119 local_define_builtin ("__builtin_setjmp_setup", ftype,
9120 BUILT_IN_SETJMP_SETUP,
9121 "__builtin_setjmp_setup", ECF_NOTHROW);
9123 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9124 ftype = build_function_type (ptr_type_node, tmp);
9125 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9126 BUILT_IN_SETJMP_DISPATCHER,
9127 "__builtin_setjmp_dispatcher",
9128 ECF_PURE | ECF_NOTHROW);
9130 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9131 ftype = build_function_type (void_type_node, tmp);
9132 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9133 BUILT_IN_SETJMP_RECEIVER,
9134 "__builtin_setjmp_receiver", ECF_NOTHROW);
9136 ftype = build_function_type (ptr_type_node, void_list_node);
9137 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9138 "__builtin_stack_save", ECF_NOTHROW);
9140 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9141 ftype = build_function_type (void_type_node, tmp);
9142 local_define_builtin ("__builtin_stack_restore", ftype,
9143 BUILT_IN_STACK_RESTORE,
9144 "__builtin_stack_restore", ECF_NOTHROW);
9146 ftype = build_function_type (void_type_node, void_list_node);
9147 local_define_builtin ("__builtin_profile_func_enter", ftype,
9148 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9149 local_define_builtin ("__builtin_profile_func_exit", ftype,
9150 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9152 /* If there's a possibility that we might use the ARM EABI, build the
9153 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9154 if (targetm.arm_eabi_unwinder)
9156 ftype = build_function_type (void_type_node, void_list_node);
9157 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9158 BUILT_IN_CXA_END_CLEANUP,
9159 "__cxa_end_cleanup", ECF_NORETURN);
9162 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9163 ftype = build_function_type (void_type_node, tmp);
9164 local_define_builtin ("__builtin_unwind_resume", ftype,
9165 BUILT_IN_UNWIND_RESUME,
9166 (USING_SJLJ_EXCEPTIONS
9167 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9170 /* The exception object and filter values from the runtime. The argument
9171 must be zero before exception lowering, i.e. from the front end. After
9172 exception lowering, it will be the region number for the exception
9173 landing pad. These functions are PURE instead of CONST to prevent
9174 them from being hoisted past the exception edge that will initialize
9175 its value in the landing pad. */
9176 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9177 ftype = build_function_type (ptr_type_node, tmp);
9178 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9179 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9181 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9182 ftype = build_function_type (tmp2, tmp);
9183 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9184 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9186 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9187 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9188 ftype = build_function_type (void_type_node, tmp);
9189 local_define_builtin ("__builtin_eh_copy_values", ftype,
9190 BUILT_IN_EH_COPY_VALUES,
9191 "__builtin_eh_copy_values", ECF_NOTHROW);
9193 /* Complex multiplication and division. These are handled as builtins
9194 rather than optabs because emit_library_call_value doesn't support
9195 complex. Further, we can do slightly better with folding these
9196 beasties if the real and complex parts of the arguments are separate. */
9200 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9202 char mode_name_buf[4], *q;
9204 enum built_in_function mcode, dcode;
9205 tree type, inner_type;
9207 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9210 inner_type = TREE_TYPE (type);
9212 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9213 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9214 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9215 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9216 ftype = build_function_type (type, tmp);
9218 mcode = ((enum built_in_function)
9219 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9220 dcode = ((enum built_in_function)
9221 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9223 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9227 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9228 local_define_builtin (built_in_names[mcode], ftype, mcode,
9229 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9231 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9232 local_define_builtin (built_in_names[dcode], ftype, dcode,
9233 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9238 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9241 If we requested a pointer to a vector, build up the pointers that
9242 we stripped off while looking for the inner type. Similarly for
9243 return values from functions.
9245 The argument TYPE is the top of the chain, and BOTTOM is the
9246 new type which we will point to. */
9249 reconstruct_complex_type (tree type, tree bottom)
9253 if (TREE_CODE (type) == POINTER_TYPE)
9255 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9256 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9257 TYPE_REF_CAN_ALIAS_ALL (type));
9259 else if (TREE_CODE (type) == REFERENCE_TYPE)
9261 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9262 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9263 TYPE_REF_CAN_ALIAS_ALL (type));
9265 else if (TREE_CODE (type) == ARRAY_TYPE)
9267 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9268 outer = build_array_type (inner, TYPE_DOMAIN (type));
9270 else if (TREE_CODE (type) == FUNCTION_TYPE)
9272 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9273 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9275 else if (TREE_CODE (type) == METHOD_TYPE)
9277 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9278 /* The build_method_type_directly() routine prepends 'this' to argument list,
9279 so we must compensate by getting rid of it. */
9281 = build_method_type_directly
9282 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9284 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9286 else if (TREE_CODE (type) == OFFSET_TYPE)
9288 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9289 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9294 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9298 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9301 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9305 switch (GET_MODE_CLASS (mode))
9307 case MODE_VECTOR_INT:
9308 case MODE_VECTOR_FLOAT:
9309 case MODE_VECTOR_FRACT:
9310 case MODE_VECTOR_UFRACT:
9311 case MODE_VECTOR_ACCUM:
9312 case MODE_VECTOR_UACCUM:
9313 nunits = GET_MODE_NUNITS (mode);
9317 /* Check that there are no leftover bits. */
9318 gcc_assert (GET_MODE_BITSIZE (mode)
9319 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9321 nunits = GET_MODE_BITSIZE (mode)
9322 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9329 return make_vector_type (innertype, nunits, mode);
9332 /* Similarly, but takes the inner type and number of units, which must be
9336 build_vector_type (tree innertype, int nunits)
9338 return make_vector_type (innertype, nunits, VOIDmode);
9341 /* Similarly, but takes the inner type and number of units, which must be
9345 build_opaque_vector_type (tree innertype, int nunits)
9348 innertype = build_distinct_type_copy (innertype);
9349 t = make_vector_type (innertype, nunits, VOIDmode);
9350 TYPE_VECTOR_OPAQUE (t) = true;
9355 /* Given an initializer INIT, return TRUE if INIT is zero or some
9356 aggregate of zeros. Otherwise return FALSE. */
9358 initializer_zerop (const_tree init)
9364 switch (TREE_CODE (init))
9367 return integer_zerop (init);
9370 /* ??? Note that this is not correct for C4X float formats. There,
9371 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9372 negative exponent. */
9373 return real_zerop (init)
9374 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9377 return fixed_zerop (init);
9380 return integer_zerop (init)
9381 || (real_zerop (init)
9382 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9383 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9386 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9387 if (!initializer_zerop (TREE_VALUE (elt)))
9393 unsigned HOST_WIDE_INT idx;
9395 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9396 if (!initializer_zerop (elt))
9405 /* We need to loop through all elements to handle cases like
9406 "\0" and "\0foobar". */
9407 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9408 if (TREE_STRING_POINTER (init)[i] != '\0')
9419 /* Build an empty statement at location LOC. */
9422 build_empty_stmt (location_t loc)
9424 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9425 SET_EXPR_LOCATION (t, loc);
9430 /* Build an OpenMP clause with code CODE. LOC is the location of the
9434 build_omp_clause (location_t loc, enum omp_clause_code code)
9439 length = omp_clause_num_ops[code];
9440 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9442 t = GGC_NEWVAR (union tree_node, size);
9443 memset (t, 0, size);
9444 TREE_SET_CODE (t, OMP_CLAUSE);
9445 OMP_CLAUSE_SET_CODE (t, code);
9446 OMP_CLAUSE_LOCATION (t) = loc;
9448 #ifdef GATHER_STATISTICS
9449 tree_node_counts[(int) omp_clause_kind]++;
9450 tree_node_sizes[(int) omp_clause_kind] += size;
9456 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9457 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9458 Except for the CODE and operand count field, other storage for the
9459 object is initialized to zeros. */
9462 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9465 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9467 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9468 gcc_assert (len >= 1);
9470 #ifdef GATHER_STATISTICS
9471 tree_node_counts[(int) e_kind]++;
9472 tree_node_sizes[(int) e_kind] += length;
9475 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9477 memset (t, 0, length);
9479 TREE_SET_CODE (t, code);
9481 /* Can't use TREE_OPERAND to store the length because if checking is
9482 enabled, it will try to check the length before we store it. :-P */
9483 t->exp.operands[0] = build_int_cst (sizetype, len);
9489 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9490 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9494 build_call_list (tree return_type, tree fn, tree arglist)
9499 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9500 TREE_TYPE (t) = return_type;
9501 CALL_EXPR_FN (t) = fn;
9502 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9503 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9504 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9505 process_call_operands (t);
9509 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9510 FN and a null static chain slot. NARGS is the number of call arguments
9511 which are specified as "..." arguments. */
9514 build_call_nary (tree return_type, tree fn, int nargs, ...)
9518 va_start (args, nargs);
9519 ret = build_call_valist (return_type, fn, nargs, args);
9524 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9525 FN and a null static chain slot. NARGS is the number of call arguments
9526 which are specified as a va_list ARGS. */
9529 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9534 t = build_vl_exp (CALL_EXPR, nargs + 3);
9535 TREE_TYPE (t) = return_type;
9536 CALL_EXPR_FN (t) = fn;
9537 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9538 for (i = 0; i < nargs; i++)
9539 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9540 process_call_operands (t);
9544 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9545 FN and a null static chain slot. NARGS is the number of call arguments
9546 which are specified as a tree array ARGS. */
9549 build_call_array_loc (location_t loc, tree return_type, tree fn,
9550 int nargs, const tree *args)
9555 t = build_vl_exp (CALL_EXPR, nargs + 3);
9556 TREE_TYPE (t) = return_type;
9557 CALL_EXPR_FN (t) = fn;
9558 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9559 for (i = 0; i < nargs; i++)
9560 CALL_EXPR_ARG (t, i) = args[i];
9561 process_call_operands (t);
9562 SET_EXPR_LOCATION (t, loc);
9566 /* Like build_call_array, but takes a VEC. */
9569 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9574 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9575 TREE_TYPE (ret) = return_type;
9576 CALL_EXPR_FN (ret) = fn;
9577 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9578 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9579 CALL_EXPR_ARG (ret, ix) = t;
9580 process_call_operands (ret);
9585 /* Returns true if it is possible to prove that the index of
9586 an array access REF (an ARRAY_REF expression) falls into the
9590 in_array_bounds_p (tree ref)
9592 tree idx = TREE_OPERAND (ref, 1);
9595 if (TREE_CODE (idx) != INTEGER_CST)
9598 min = array_ref_low_bound (ref);
9599 max = array_ref_up_bound (ref);
9602 || TREE_CODE (min) != INTEGER_CST
9603 || TREE_CODE (max) != INTEGER_CST)
9606 if (tree_int_cst_lt (idx, min)
9607 || tree_int_cst_lt (max, idx))
9613 /* Returns true if it is possible to prove that the range of
9614 an array access REF (an ARRAY_RANGE_REF expression) falls
9615 into the array bounds. */
9618 range_in_array_bounds_p (tree ref)
9620 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9621 tree range_min, range_max, min, max;
9623 range_min = TYPE_MIN_VALUE (domain_type);
9624 range_max = TYPE_MAX_VALUE (domain_type);
9627 || TREE_CODE (range_min) != INTEGER_CST
9628 || TREE_CODE (range_max) != INTEGER_CST)
9631 min = array_ref_low_bound (ref);
9632 max = array_ref_up_bound (ref);
9635 || TREE_CODE (min) != INTEGER_CST
9636 || TREE_CODE (max) != INTEGER_CST)
9639 if (tree_int_cst_lt (range_min, min)
9640 || tree_int_cst_lt (max, range_max))
9646 /* Return true if T (assumed to be a DECL) must be assigned a memory
9650 needs_to_live_in_memory (const_tree t)
9652 if (TREE_CODE (t) == SSA_NAME)
9653 t = SSA_NAME_VAR (t);
9655 return (TREE_ADDRESSABLE (t)
9656 || is_global_var (t)
9657 || (TREE_CODE (t) == RESULT_DECL
9658 && aggregate_value_p (t, current_function_decl)));
9661 /* There are situations in which a language considers record types
9662 compatible which have different field lists. Decide if two fields
9663 are compatible. It is assumed that the parent records are compatible. */
9666 fields_compatible_p (const_tree f1, const_tree f2)
9668 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9669 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9672 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9673 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9676 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9682 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9685 find_compatible_field (tree record, tree orig_field)
9689 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9690 if (TREE_CODE (f) == FIELD_DECL
9691 && fields_compatible_p (f, orig_field))
9694 /* ??? Why isn't this on the main fields list? */
9695 f = TYPE_VFIELD (record);
9696 if (f && TREE_CODE (f) == FIELD_DECL
9697 && fields_compatible_p (f, orig_field))
9700 /* ??? We should abort here, but Java appears to do Bad Things
9701 with inherited fields. */
9705 /* Return value of a constant X and sign-extend it. */
9708 int_cst_value (const_tree x)
9710 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9711 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9713 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9714 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9715 || TREE_INT_CST_HIGH (x) == -1);
9717 if (bits < HOST_BITS_PER_WIDE_INT)
9719 bool negative = ((val >> (bits - 1)) & 1) != 0;
9721 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9723 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9729 /* Return value of a constant X and sign-extend it. */
9732 widest_int_cst_value (const_tree x)
9734 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9735 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9737 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9738 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9739 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9740 << HOST_BITS_PER_WIDE_INT);
9742 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9743 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9744 || TREE_INT_CST_HIGH (x) == -1);
9747 if (bits < HOST_BITS_PER_WIDEST_INT)
9749 bool negative = ((val >> (bits - 1)) & 1) != 0;
9751 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9753 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9759 /* If TYPE is an integral type, return an equivalent type which is
9760 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9761 return TYPE itself. */
9764 signed_or_unsigned_type_for (int unsignedp, tree type)
9767 if (POINTER_TYPE_P (type))
9769 /* If the pointer points to the normal address space, use the
9770 size_type_node. Otherwise use an appropriate size for the pointer
9771 based on the named address space it points to. */
9772 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9775 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9778 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9781 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9784 /* Returns unsigned variant of TYPE. */
9787 unsigned_type_for (tree type)
9789 return signed_or_unsigned_type_for (1, type);
9792 /* Returns signed variant of TYPE. */
9795 signed_type_for (tree type)
9797 return signed_or_unsigned_type_for (0, type);
9800 /* Returns the largest value obtainable by casting something in INNER type to
9804 upper_bound_in_type (tree outer, tree inner)
9806 unsigned HOST_WIDE_INT lo, hi;
9807 unsigned int det = 0;
9808 unsigned oprec = TYPE_PRECISION (outer);
9809 unsigned iprec = TYPE_PRECISION (inner);
9812 /* Compute a unique number for every combination. */
9813 det |= (oprec > iprec) ? 4 : 0;
9814 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9815 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9817 /* Determine the exponent to use. */
9822 /* oprec <= iprec, outer: signed, inner: don't care. */
9827 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9831 /* oprec > iprec, outer: signed, inner: signed. */
9835 /* oprec > iprec, outer: signed, inner: unsigned. */
9839 /* oprec > iprec, outer: unsigned, inner: signed. */
9843 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9850 /* Compute 2^^prec - 1. */
9851 if (prec <= HOST_BITS_PER_WIDE_INT)
9854 lo = ((~(unsigned HOST_WIDE_INT) 0)
9855 >> (HOST_BITS_PER_WIDE_INT - prec));
9859 hi = ((~(unsigned HOST_WIDE_INT) 0)
9860 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9861 lo = ~(unsigned HOST_WIDE_INT) 0;
9864 return build_int_cst_wide (outer, lo, hi);
9867 /* Returns the smallest value obtainable by casting something in INNER type to
9871 lower_bound_in_type (tree outer, tree inner)
9873 unsigned HOST_WIDE_INT lo, hi;
9874 unsigned oprec = TYPE_PRECISION (outer);
9875 unsigned iprec = TYPE_PRECISION (inner);
9877 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9879 if (TYPE_UNSIGNED (outer)
9880 /* If we are widening something of an unsigned type, OUTER type
9881 contains all values of INNER type. In particular, both INNER
9882 and OUTER types have zero in common. */
9883 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9887 /* If we are widening a signed type to another signed type, we
9888 want to obtain -2^^(iprec-1). If we are keeping the
9889 precision or narrowing to a signed type, we want to obtain
9891 unsigned prec = oprec > iprec ? iprec : oprec;
9893 if (prec <= HOST_BITS_PER_WIDE_INT)
9895 hi = ~(unsigned HOST_WIDE_INT) 0;
9896 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9900 hi = ((~(unsigned HOST_WIDE_INT) 0)
9901 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9906 return build_int_cst_wide (outer, lo, hi);
9909 /* Return nonzero if two operands that are suitable for PHI nodes are
9910 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9911 SSA_NAME or invariant. Note that this is strictly an optimization.
9912 That is, callers of this function can directly call operand_equal_p
9913 and get the same result, only slower. */
9916 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9920 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9922 return operand_equal_p (arg0, arg1, 0);
9925 /* Returns number of zeros at the end of binary representation of X.
9927 ??? Use ffs if available? */
9930 num_ending_zeros (const_tree x)
9932 unsigned HOST_WIDE_INT fr, nfr;
9933 unsigned num, abits;
9934 tree type = TREE_TYPE (x);
9936 if (TREE_INT_CST_LOW (x) == 0)
9938 num = HOST_BITS_PER_WIDE_INT;
9939 fr = TREE_INT_CST_HIGH (x);
9944 fr = TREE_INT_CST_LOW (x);
9947 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9950 if (nfr << abits == fr)
9957 if (num > TYPE_PRECISION (type))
9958 num = TYPE_PRECISION (type);
9960 return build_int_cst_type (type, num);
9964 #define WALK_SUBTREE(NODE) \
9967 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9973 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9974 be walked whenever a type is seen in the tree. Rest of operands and return
9975 value are as for walk_tree. */
9978 walk_type_fields (tree type, walk_tree_fn func, void *data,
9979 struct pointer_set_t *pset, walk_tree_lh lh)
9981 tree result = NULL_TREE;
9983 switch (TREE_CODE (type))
9986 case REFERENCE_TYPE:
9987 /* We have to worry about mutually recursive pointers. These can't
9988 be written in C. They can in Ada. It's pathological, but
9989 there's an ACATS test (c38102a) that checks it. Deal with this
9990 by checking if we're pointing to another pointer, that one
9991 points to another pointer, that one does too, and we have no htab.
9992 If so, get a hash table. We check three levels deep to avoid
9993 the cost of the hash table if we don't need one. */
9994 if (POINTER_TYPE_P (TREE_TYPE (type))
9995 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9996 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9999 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10007 /* ... fall through ... */
10010 WALK_SUBTREE (TREE_TYPE (type));
10014 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10016 /* Fall through. */
10018 case FUNCTION_TYPE:
10019 WALK_SUBTREE (TREE_TYPE (type));
10023 /* We never want to walk into default arguments. */
10024 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10025 WALK_SUBTREE (TREE_VALUE (arg));
10030 /* Don't follow this nodes's type if a pointer for fear that
10031 we'll have infinite recursion. If we have a PSET, then we
10034 || (!POINTER_TYPE_P (TREE_TYPE (type))
10035 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10036 WALK_SUBTREE (TREE_TYPE (type));
10037 WALK_SUBTREE (TYPE_DOMAIN (type));
10041 WALK_SUBTREE (TREE_TYPE (type));
10042 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10052 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10053 called with the DATA and the address of each sub-tree. If FUNC returns a
10054 non-NULL value, the traversal is stopped, and the value returned by FUNC
10055 is returned. If PSET is non-NULL it is used to record the nodes visited,
10056 and to avoid visiting a node more than once. */
10059 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10060 struct pointer_set_t *pset, walk_tree_lh lh)
10062 enum tree_code code;
10066 #define WALK_SUBTREE_TAIL(NODE) \
10070 goto tail_recurse; \
10075 /* Skip empty subtrees. */
10079 /* Don't walk the same tree twice, if the user has requested
10080 that we avoid doing so. */
10081 if (pset && pointer_set_insert (pset, *tp))
10084 /* Call the function. */
10086 result = (*func) (tp, &walk_subtrees, data);
10088 /* If we found something, return it. */
10092 code = TREE_CODE (*tp);
10094 /* Even if we didn't, FUNC may have decided that there was nothing
10095 interesting below this point in the tree. */
10096 if (!walk_subtrees)
10098 /* But we still need to check our siblings. */
10099 if (code == TREE_LIST)
10100 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10101 else if (code == OMP_CLAUSE)
10102 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10109 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10110 if (result || !walk_subtrees)
10117 case IDENTIFIER_NODE:
10124 case PLACEHOLDER_EXPR:
10128 /* None of these have subtrees other than those already walked
10133 WALK_SUBTREE (TREE_VALUE (*tp));
10134 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10139 int len = TREE_VEC_LENGTH (*tp);
10144 /* Walk all elements but the first. */
10146 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10148 /* Now walk the first one as a tail call. */
10149 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10153 WALK_SUBTREE (TREE_REALPART (*tp));
10154 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10158 unsigned HOST_WIDE_INT idx;
10159 constructor_elt *ce;
10162 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10164 WALK_SUBTREE (ce->value);
10169 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10174 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10176 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10177 into declarations that are just mentioned, rather than
10178 declared; they don't really belong to this part of the tree.
10179 And, we can see cycles: the initializer for a declaration
10180 can refer to the declaration itself. */
10181 WALK_SUBTREE (DECL_INITIAL (decl));
10182 WALK_SUBTREE (DECL_SIZE (decl));
10183 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10185 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10188 case STATEMENT_LIST:
10190 tree_stmt_iterator i;
10191 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10192 WALK_SUBTREE (*tsi_stmt_ptr (i));
10197 switch (OMP_CLAUSE_CODE (*tp))
10199 case OMP_CLAUSE_PRIVATE:
10200 case OMP_CLAUSE_SHARED:
10201 case OMP_CLAUSE_FIRSTPRIVATE:
10202 case OMP_CLAUSE_COPYIN:
10203 case OMP_CLAUSE_COPYPRIVATE:
10204 case OMP_CLAUSE_IF:
10205 case OMP_CLAUSE_NUM_THREADS:
10206 case OMP_CLAUSE_SCHEDULE:
10207 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10210 case OMP_CLAUSE_NOWAIT:
10211 case OMP_CLAUSE_ORDERED:
10212 case OMP_CLAUSE_DEFAULT:
10213 case OMP_CLAUSE_UNTIED:
10214 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10216 case OMP_CLAUSE_LASTPRIVATE:
10217 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10218 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10219 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10221 case OMP_CLAUSE_COLLAPSE:
10224 for (i = 0; i < 3; i++)
10225 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10226 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10229 case OMP_CLAUSE_REDUCTION:
10232 for (i = 0; i < 4; i++)
10233 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10234 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10238 gcc_unreachable ();
10246 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10247 But, we only want to walk once. */
10248 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10249 for (i = 0; i < len; ++i)
10250 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10251 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10255 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10256 defining. We only want to walk into these fields of a type in this
10257 case and not in the general case of a mere reference to the type.
10259 The criterion is as follows: if the field can be an expression, it
10260 must be walked only here. This should be in keeping with the fields
10261 that are directly gimplified in gimplify_type_sizes in order for the
10262 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10263 variable-sized types.
10265 Note that DECLs get walked as part of processing the BIND_EXPR. */
10266 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10268 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10269 if (TREE_CODE (*type_p) == ERROR_MARK)
10272 /* Call the function for the type. See if it returns anything or
10273 doesn't want us to continue. If we are to continue, walk both
10274 the normal fields and those for the declaration case. */
10275 result = (*func) (type_p, &walk_subtrees, data);
10276 if (result || !walk_subtrees)
10279 result = walk_type_fields (*type_p, func, data, pset, lh);
10283 /* If this is a record type, also walk the fields. */
10284 if (RECORD_OR_UNION_TYPE_P (*type_p))
10288 for (field = TYPE_FIELDS (*type_p); field;
10289 field = TREE_CHAIN (field))
10291 /* We'd like to look at the type of the field, but we can
10292 easily get infinite recursion. So assume it's pointed
10293 to elsewhere in the tree. Also, ignore things that
10295 if (TREE_CODE (field) != FIELD_DECL)
10298 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10299 WALK_SUBTREE (DECL_SIZE (field));
10300 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10301 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10302 WALK_SUBTREE (DECL_QUALIFIER (field));
10306 /* Same for scalar types. */
10307 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10308 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10309 || TREE_CODE (*type_p) == INTEGER_TYPE
10310 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10311 || TREE_CODE (*type_p) == REAL_TYPE)
10313 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10314 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10317 WALK_SUBTREE (TYPE_SIZE (*type_p));
10318 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10323 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10327 /* Walk over all the sub-trees of this operand. */
10328 len = TREE_OPERAND_LENGTH (*tp);
10330 /* Go through the subtrees. We need to do this in forward order so
10331 that the scope of a FOR_EXPR is handled properly. */
10334 for (i = 0; i < len - 1; ++i)
10335 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10336 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10339 /* If this is a type, walk the needed fields in the type. */
10340 else if (TYPE_P (*tp))
10341 return walk_type_fields (*tp, func, data, pset, lh);
10345 /* We didn't find what we were looking for. */
10348 #undef WALK_SUBTREE_TAIL
10350 #undef WALK_SUBTREE
10352 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10355 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10359 struct pointer_set_t *pset;
10361 pset = pointer_set_create ();
10362 result = walk_tree_1 (tp, func, data, pset, lh);
10363 pointer_set_destroy (pset);
10369 tree_block (tree t)
10371 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10373 if (IS_EXPR_CODE_CLASS (c))
10374 return &t->exp.block;
10375 gcc_unreachable ();
10379 /* Create a nameless artificial label and put it in the current
10380 function context. The label has a location of LOC. Returns the
10381 newly created label. */
10384 create_artificial_label (location_t loc)
10386 tree lab = build_decl (loc,
10387 LABEL_DECL, NULL_TREE, void_type_node);
10389 DECL_ARTIFICIAL (lab) = 1;
10390 DECL_IGNORED_P (lab) = 1;
10391 DECL_CONTEXT (lab) = current_function_decl;
10395 /* Given a tree, try to return a useful variable name that we can use
10396 to prefix a temporary that is being assigned the value of the tree.
10397 I.E. given <temp> = &A, return A. */
10402 tree stripped_decl;
10405 STRIP_NOPS (stripped_decl);
10406 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10407 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10410 switch (TREE_CODE (stripped_decl))
10413 return get_name (TREE_OPERAND (stripped_decl, 0));
10420 /* Return true if TYPE has a variable argument list. */
10423 stdarg_p (tree fntype)
10425 function_args_iterator args_iter;
10426 tree n = NULL_TREE, t;
10431 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10436 return n != NULL_TREE && n != void_type_node;
10439 /* Return true if TYPE has a prototype. */
10442 prototype_p (tree fntype)
10446 gcc_assert (fntype != NULL_TREE);
10448 t = TYPE_ARG_TYPES (fntype);
10449 return (t != NULL_TREE);
10452 /* If BLOCK is inlined from an __attribute__((__artificial__))
10453 routine, return pointer to location from where it has been
10456 block_nonartificial_location (tree block)
10458 location_t *ret = NULL;
10460 while (block && TREE_CODE (block) == BLOCK
10461 && BLOCK_ABSTRACT_ORIGIN (block))
10463 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10465 while (TREE_CODE (ao) == BLOCK
10466 && BLOCK_ABSTRACT_ORIGIN (ao)
10467 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10468 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10470 if (TREE_CODE (ao) == FUNCTION_DECL)
10472 /* If AO is an artificial inline, point RET to the
10473 call site locus at which it has been inlined and continue
10474 the loop, in case AO's caller is also an artificial
10476 if (DECL_DECLARED_INLINE_P (ao)
10477 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10478 ret = &BLOCK_SOURCE_LOCATION (block);
10482 else if (TREE_CODE (ao) != BLOCK)
10485 block = BLOCK_SUPERCONTEXT (block);
10491 /* If EXP is inlined from an __attribute__((__artificial__))
10492 function, return the location of the original call expression. */
10495 tree_nonartificial_location (tree exp)
10497 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10502 return EXPR_LOCATION (exp);
10506 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10509 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10512 cl_option_hash_hash (const void *x)
10514 const_tree const t = (const_tree) x;
10518 hashval_t hash = 0;
10520 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10522 p = (const char *)TREE_OPTIMIZATION (t);
10523 len = sizeof (struct cl_optimization);
10526 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10528 p = (const char *)TREE_TARGET_OPTION (t);
10529 len = sizeof (struct cl_target_option);
10533 gcc_unreachable ();
10535 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10537 for (i = 0; i < len; i++)
10539 hash = (hash << 4) ^ ((i << 2) | p[i]);
10544 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10545 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10549 cl_option_hash_eq (const void *x, const void *y)
10551 const_tree const xt = (const_tree) x;
10552 const_tree const yt = (const_tree) y;
10557 if (TREE_CODE (xt) != TREE_CODE (yt))
10560 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10562 xp = (const char *)TREE_OPTIMIZATION (xt);
10563 yp = (const char *)TREE_OPTIMIZATION (yt);
10564 len = sizeof (struct cl_optimization);
10567 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10569 xp = (const char *)TREE_TARGET_OPTION (xt);
10570 yp = (const char *)TREE_TARGET_OPTION (yt);
10571 len = sizeof (struct cl_target_option);
10575 gcc_unreachable ();
10577 return (memcmp (xp, yp, len) == 0);
10580 /* Build an OPTIMIZATION_NODE based on the current options. */
10583 build_optimization_node (void)
10588 /* Use the cache of optimization nodes. */
10590 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10592 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10596 /* Insert this one into the hash table. */
10597 t = cl_optimization_node;
10600 /* Make a new node for next time round. */
10601 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10607 /* Build a TARGET_OPTION_NODE based on the current options. */
10610 build_target_option_node (void)
10615 /* Use the cache of optimization nodes. */
10617 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10619 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10623 /* Insert this one into the hash table. */
10624 t = cl_target_option_node;
10627 /* Make a new node for next time round. */
10628 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10634 /* Determine the "ultimate origin" of a block. The block may be an inlined
10635 instance of an inlined instance of a block which is local to an inline
10636 function, so we have to trace all of the way back through the origin chain
10637 to find out what sort of node actually served as the original seed for the
10641 block_ultimate_origin (const_tree block)
10643 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10645 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10646 nodes in the function to point to themselves; ignore that if
10647 we're trying to output the abstract instance of this function. */
10648 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10651 if (immediate_origin == NULL_TREE)
10656 tree lookahead = immediate_origin;
10660 ret_val = lookahead;
10661 lookahead = (TREE_CODE (ret_val) == BLOCK
10662 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10664 while (lookahead != NULL && lookahead != ret_val);
10666 /* The block's abstract origin chain may not be the *ultimate* origin of
10667 the block. It could lead to a DECL that has an abstract origin set.
10668 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10669 will give us if it has one). Note that DECL's abstract origins are
10670 supposed to be the most distant ancestor (or so decl_ultimate_origin
10671 claims), so we don't need to loop following the DECL origins. */
10672 if (DECL_P (ret_val))
10673 return DECL_ORIGIN (ret_val);
10679 /* Return true if T1 and T2 are equivalent lists. */
10682 list_equal_p (const_tree t1, const_tree t2)
10684 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10685 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10690 /* Return true iff conversion in EXP generates no instruction. Mark
10691 it inline so that we fully inline into the stripping functions even
10692 though we have two uses of this function. */
10695 tree_nop_conversion (const_tree exp)
10697 tree outer_type, inner_type;
10699 if (!CONVERT_EXPR_P (exp)
10700 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10702 if (TREE_OPERAND (exp, 0) == error_mark_node)
10705 outer_type = TREE_TYPE (exp);
10706 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10711 /* Use precision rather then machine mode when we can, which gives
10712 the correct answer even for submode (bit-field) types. */
10713 if ((INTEGRAL_TYPE_P (outer_type)
10714 || POINTER_TYPE_P (outer_type)
10715 || TREE_CODE (outer_type) == OFFSET_TYPE)
10716 && (INTEGRAL_TYPE_P (inner_type)
10717 || POINTER_TYPE_P (inner_type)
10718 || TREE_CODE (inner_type) == OFFSET_TYPE))
10719 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10721 /* Otherwise fall back on comparing machine modes (e.g. for
10722 aggregate types, floats). */
10723 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10726 /* Return true iff conversion in EXP generates no instruction. Don't
10727 consider conversions changing the signedness. */
10730 tree_sign_nop_conversion (const_tree exp)
10732 tree outer_type, inner_type;
10734 if (!tree_nop_conversion (exp))
10737 outer_type = TREE_TYPE (exp);
10738 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10740 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10741 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10744 /* Strip conversions from EXP according to tree_nop_conversion and
10745 return the resulting expression. */
10748 tree_strip_nop_conversions (tree exp)
10750 while (tree_nop_conversion (exp))
10751 exp = TREE_OPERAND (exp, 0);
10755 /* Strip conversions from EXP according to tree_sign_nop_conversion
10756 and return the resulting expression. */
10759 tree_strip_sign_nop_conversions (tree exp)
10761 while (tree_sign_nop_conversion (exp))
10762 exp = TREE_OPERAND (exp, 0);
10766 static GTY(()) tree gcc_eh_personality_decl;
10768 /* Return the GCC personality function decl. */
10771 lhd_gcc_personality (void)
10773 if (!gcc_eh_personality_decl)
10774 gcc_eh_personality_decl
10775 = build_personality_function (USING_SJLJ_EXCEPTIONS
10776 ? "__gcc_personality_sj0"
10777 : "__gcc_personality_v0");
10779 return gcc_eh_personality_decl;
10782 #include "gt-tree.h"