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);
1335 TREE_TYPE (c) = type;
1336 CONSTRUCTOR_ELTS (c) = vals;
1340 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1343 build_constructor_single (tree type, tree index, tree value)
1345 VEC(constructor_elt,gc) *v;
1346 constructor_elt *elt;
1349 v = VEC_alloc (constructor_elt, gc, 1);
1350 elt = VEC_quick_push (constructor_elt, v, NULL);
1354 t = build_constructor (type, v);
1355 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1360 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1361 are in a list pointed to by VALS. */
1363 build_constructor_from_list (tree type, tree vals)
1366 VEC(constructor_elt,gc) *v = NULL;
1367 bool constant_p = true;
1371 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1372 for (t = vals; t; t = TREE_CHAIN (t))
1374 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1375 val = TREE_VALUE (t);
1376 elt->index = TREE_PURPOSE (t);
1378 if (!TREE_CONSTANT (val))
1383 t = build_constructor (type, v);
1384 TREE_CONSTANT (t) = constant_p;
1388 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1391 build_fixed (tree type, FIXED_VALUE_TYPE f)
1394 FIXED_VALUE_TYPE *fp;
1396 v = make_node (FIXED_CST);
1397 fp = GGC_NEW (FIXED_VALUE_TYPE);
1398 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1400 TREE_TYPE (v) = type;
1401 TREE_FIXED_CST_PTR (v) = fp;
1405 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1408 build_real (tree type, REAL_VALUE_TYPE d)
1411 REAL_VALUE_TYPE *dp;
1414 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1415 Consider doing it via real_convert now. */
1417 v = make_node (REAL_CST);
1418 dp = GGC_NEW (REAL_VALUE_TYPE);
1419 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1421 TREE_TYPE (v) = type;
1422 TREE_REAL_CST_PTR (v) = dp;
1423 TREE_OVERFLOW (v) = overflow;
1427 /* Return a new REAL_CST node whose type is TYPE
1428 and whose value is the integer value of the INTEGER_CST node I. */
1431 real_value_from_int_cst (const_tree type, const_tree i)
1435 /* Clear all bits of the real value type so that we can later do
1436 bitwise comparisons to see if two values are the same. */
1437 memset (&d, 0, sizeof d);
1439 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1440 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1441 TYPE_UNSIGNED (TREE_TYPE (i)));
1445 /* Given a tree representing an integer constant I, return a tree
1446 representing the same value as a floating-point constant of type TYPE. */
1449 build_real_from_int_cst (tree type, const_tree i)
1452 int overflow = TREE_OVERFLOW (i);
1454 v = build_real (type, real_value_from_int_cst (type, i));
1456 TREE_OVERFLOW (v) |= overflow;
1460 /* Return a newly constructed STRING_CST node whose value is
1461 the LEN characters at STR.
1462 The TREE_TYPE is not initialized. */
1465 build_string (int len, const char *str)
1470 /* Do not waste bytes provided by padding of struct tree_string. */
1471 length = len + offsetof (struct tree_string, str) + 1;
1473 #ifdef GATHER_STATISTICS
1474 tree_node_counts[(int) c_kind]++;
1475 tree_node_sizes[(int) c_kind] += length;
1478 s = ggc_alloc_tree (length);
1480 memset (s, 0, sizeof (struct tree_common));
1481 TREE_SET_CODE (s, STRING_CST);
1482 TREE_CONSTANT (s) = 1;
1483 TREE_STRING_LENGTH (s) = len;
1484 memcpy (s->string.str, str, len);
1485 s->string.str[len] = '\0';
1490 /* Return a newly constructed COMPLEX_CST node whose value is
1491 specified by the real and imaginary parts REAL and IMAG.
1492 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1493 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1496 build_complex (tree type, tree real, tree imag)
1498 tree t = make_node (COMPLEX_CST);
1500 TREE_REALPART (t) = real;
1501 TREE_IMAGPART (t) = imag;
1502 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1503 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1507 /* Return a constant of arithmetic type TYPE which is the
1508 multiplicative identity of the set TYPE. */
1511 build_one_cst (tree type)
1513 switch (TREE_CODE (type))
1515 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1516 case POINTER_TYPE: case REFERENCE_TYPE:
1518 return build_int_cst (type, 1);
1521 return build_real (type, dconst1);
1523 case FIXED_POINT_TYPE:
1524 /* We can only generate 1 for accum types. */
1525 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1526 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1533 scalar = build_one_cst (TREE_TYPE (type));
1535 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1537 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1538 cst = tree_cons (NULL_TREE, scalar, cst);
1540 return build_vector (type, cst);
1544 return build_complex (type,
1545 build_one_cst (TREE_TYPE (type)),
1546 fold_convert (TREE_TYPE (type), integer_zero_node));
1553 /* Build a BINFO with LEN language slots. */
1556 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1559 size_t length = (offsetof (struct tree_binfo, base_binfos)
1560 + VEC_embedded_size (tree, base_binfos));
1562 #ifdef GATHER_STATISTICS
1563 tree_node_counts[(int) binfo_kind]++;
1564 tree_node_sizes[(int) binfo_kind] += length;
1567 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1569 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1571 TREE_SET_CODE (t, TREE_BINFO);
1573 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1579 /* Build a newly constructed TREE_VEC node of length LEN. */
1582 make_tree_vec_stat (int len MEM_STAT_DECL)
1585 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1587 #ifdef GATHER_STATISTICS
1588 tree_node_counts[(int) vec_kind]++;
1589 tree_node_sizes[(int) vec_kind] += length;
1592 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1594 memset (t, 0, length);
1596 TREE_SET_CODE (t, TREE_VEC);
1597 TREE_VEC_LENGTH (t) = len;
1602 /* Return 1 if EXPR is the integer constant zero or a complex constant
1606 integer_zerop (const_tree expr)
1610 return ((TREE_CODE (expr) == INTEGER_CST
1611 && TREE_INT_CST_LOW (expr) == 0
1612 && TREE_INT_CST_HIGH (expr) == 0)
1613 || (TREE_CODE (expr) == COMPLEX_CST
1614 && integer_zerop (TREE_REALPART (expr))
1615 && integer_zerop (TREE_IMAGPART (expr))));
1618 /* Return 1 if EXPR is the integer constant one or the corresponding
1619 complex constant. */
1622 integer_onep (const_tree expr)
1626 return ((TREE_CODE (expr) == INTEGER_CST
1627 && TREE_INT_CST_LOW (expr) == 1
1628 && TREE_INT_CST_HIGH (expr) == 0)
1629 || (TREE_CODE (expr) == COMPLEX_CST
1630 && integer_onep (TREE_REALPART (expr))
1631 && integer_zerop (TREE_IMAGPART (expr))));
1634 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1635 it contains. Likewise for the corresponding complex constant. */
1638 integer_all_onesp (const_tree expr)
1645 if (TREE_CODE (expr) == COMPLEX_CST
1646 && integer_all_onesp (TREE_REALPART (expr))
1647 && integer_zerop (TREE_IMAGPART (expr)))
1650 else if (TREE_CODE (expr) != INTEGER_CST)
1653 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1654 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1655 && TREE_INT_CST_HIGH (expr) == -1)
1660 /* Note that using TYPE_PRECISION here is wrong. We care about the
1661 actual bits, not the (arbitrary) range of the type. */
1662 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1663 if (prec >= HOST_BITS_PER_WIDE_INT)
1665 HOST_WIDE_INT high_value;
1668 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1670 /* Can not handle precisions greater than twice the host int size. */
1671 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1672 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1673 /* Shifting by the host word size is undefined according to the ANSI
1674 standard, so we must handle this as a special case. */
1677 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1679 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1680 && TREE_INT_CST_HIGH (expr) == high_value);
1683 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1686 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1690 integer_pow2p (const_tree expr)
1693 HOST_WIDE_INT high, low;
1697 if (TREE_CODE (expr) == COMPLEX_CST
1698 && integer_pow2p (TREE_REALPART (expr))
1699 && integer_zerop (TREE_IMAGPART (expr)))
1702 if (TREE_CODE (expr) != INTEGER_CST)
1705 prec = TYPE_PRECISION (TREE_TYPE (expr));
1706 high = TREE_INT_CST_HIGH (expr);
1707 low = TREE_INT_CST_LOW (expr);
1709 /* First clear all bits that are beyond the type's precision in case
1710 we've been sign extended. */
1712 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1714 else if (prec > HOST_BITS_PER_WIDE_INT)
1715 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1719 if (prec < HOST_BITS_PER_WIDE_INT)
1720 low &= ~((HOST_WIDE_INT) (-1) << prec);
1723 if (high == 0 && low == 0)
1726 return ((high == 0 && (low & (low - 1)) == 0)
1727 || (low == 0 && (high & (high - 1)) == 0));
1730 /* Return 1 if EXPR is an integer constant other than zero or a
1731 complex constant other than zero. */
1734 integer_nonzerop (const_tree expr)
1738 return ((TREE_CODE (expr) == INTEGER_CST
1739 && (TREE_INT_CST_LOW (expr) != 0
1740 || TREE_INT_CST_HIGH (expr) != 0))
1741 || (TREE_CODE (expr) == COMPLEX_CST
1742 && (integer_nonzerop (TREE_REALPART (expr))
1743 || integer_nonzerop (TREE_IMAGPART (expr)))));
1746 /* Return 1 if EXPR is the fixed-point constant zero. */
1749 fixed_zerop (const_tree expr)
1751 return (TREE_CODE (expr) == FIXED_CST
1752 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1755 /* Return the power of two represented by a tree node known to be a
1759 tree_log2 (const_tree expr)
1762 HOST_WIDE_INT high, low;
1766 if (TREE_CODE (expr) == COMPLEX_CST)
1767 return tree_log2 (TREE_REALPART (expr));
1769 prec = TYPE_PRECISION (TREE_TYPE (expr));
1770 high = TREE_INT_CST_HIGH (expr);
1771 low = TREE_INT_CST_LOW (expr);
1773 /* First clear all bits that are beyond the type's precision in case
1774 we've been sign extended. */
1776 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1778 else if (prec > HOST_BITS_PER_WIDE_INT)
1779 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1783 if (prec < HOST_BITS_PER_WIDE_INT)
1784 low &= ~((HOST_WIDE_INT) (-1) << prec);
1787 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1788 : exact_log2 (low));
1791 /* Similar, but return the largest integer Y such that 2 ** Y is less
1792 than or equal to EXPR. */
1795 tree_floor_log2 (const_tree expr)
1798 HOST_WIDE_INT high, low;
1802 if (TREE_CODE (expr) == COMPLEX_CST)
1803 return tree_log2 (TREE_REALPART (expr));
1805 prec = TYPE_PRECISION (TREE_TYPE (expr));
1806 high = TREE_INT_CST_HIGH (expr);
1807 low = TREE_INT_CST_LOW (expr);
1809 /* First clear all bits that are beyond the type's precision in case
1810 we've been sign extended. Ignore if type's precision hasn't been set
1811 since what we are doing is setting it. */
1813 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1815 else if (prec > HOST_BITS_PER_WIDE_INT)
1816 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1820 if (prec < HOST_BITS_PER_WIDE_INT)
1821 low &= ~((HOST_WIDE_INT) (-1) << prec);
1824 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1825 : floor_log2 (low));
1828 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1829 decimal float constants, so don't return 1 for them. */
1832 real_zerop (const_tree expr)
1836 return ((TREE_CODE (expr) == REAL_CST
1837 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1838 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1839 || (TREE_CODE (expr) == COMPLEX_CST
1840 && real_zerop (TREE_REALPART (expr))
1841 && real_zerop (TREE_IMAGPART (expr))));
1844 /* Return 1 if EXPR is the real constant one in real or complex form.
1845 Trailing zeroes matter for decimal float constants, so don't return
1849 real_onep (const_tree expr)
1853 return ((TREE_CODE (expr) == REAL_CST
1854 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1855 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1856 || (TREE_CODE (expr) == COMPLEX_CST
1857 && real_onep (TREE_REALPART (expr))
1858 && real_zerop (TREE_IMAGPART (expr))));
1861 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1862 for decimal float constants, so don't return 1 for them. */
1865 real_twop (const_tree expr)
1869 return ((TREE_CODE (expr) == REAL_CST
1870 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1871 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1872 || (TREE_CODE (expr) == COMPLEX_CST
1873 && real_twop (TREE_REALPART (expr))
1874 && real_zerop (TREE_IMAGPART (expr))));
1877 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1878 matter for decimal float constants, so don't return 1 for them. */
1881 real_minus_onep (const_tree expr)
1885 return ((TREE_CODE (expr) == REAL_CST
1886 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1887 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1888 || (TREE_CODE (expr) == COMPLEX_CST
1889 && real_minus_onep (TREE_REALPART (expr))
1890 && real_zerop (TREE_IMAGPART (expr))));
1893 /* Nonzero if EXP is a constant or a cast of a constant. */
1896 really_constant_p (const_tree exp)
1898 /* This is not quite the same as STRIP_NOPS. It does more. */
1899 while (CONVERT_EXPR_P (exp)
1900 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1901 exp = TREE_OPERAND (exp, 0);
1902 return TREE_CONSTANT (exp);
1905 /* Return first list element whose TREE_VALUE is ELEM.
1906 Return 0 if ELEM is not in LIST. */
1909 value_member (tree elem, tree list)
1913 if (elem == TREE_VALUE (list))
1915 list = TREE_CHAIN (list);
1920 /* Return first list element whose TREE_PURPOSE is ELEM.
1921 Return 0 if ELEM is not in LIST. */
1924 purpose_member (const_tree elem, tree list)
1928 if (elem == TREE_PURPOSE (list))
1930 list = TREE_CHAIN (list);
1935 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1939 chain_index (int idx, tree chain)
1941 for (; chain && idx > 0; --idx)
1942 chain = TREE_CHAIN (chain);
1946 /* Return nonzero if ELEM is part of the chain CHAIN. */
1949 chain_member (const_tree elem, const_tree chain)
1955 chain = TREE_CHAIN (chain);
1961 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1962 We expect a null pointer to mark the end of the chain.
1963 This is the Lisp primitive `length'. */
1966 list_length (const_tree t)
1969 #ifdef ENABLE_TREE_CHECKING
1977 #ifdef ENABLE_TREE_CHECKING
1980 gcc_assert (p != q);
1988 /* Returns the number of FIELD_DECLs in TYPE. */
1991 fields_length (const_tree type)
1993 tree t = TYPE_FIELDS (type);
1996 for (; t; t = TREE_CHAIN (t))
1997 if (TREE_CODE (t) == FIELD_DECL)
2003 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2004 UNION_TYPE TYPE, or NULL_TREE if none. */
2007 first_field (const_tree type)
2009 tree t = TYPE_FIELDS (type);
2010 while (t && TREE_CODE (t) != FIELD_DECL)
2015 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2016 by modifying the last node in chain 1 to point to chain 2.
2017 This is the Lisp primitive `nconc'. */
2020 chainon (tree op1, tree op2)
2029 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2031 TREE_CHAIN (t1) = op2;
2033 #ifdef ENABLE_TREE_CHECKING
2036 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2037 gcc_assert (t2 != t1);
2044 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2047 tree_last (tree chain)
2051 while ((next = TREE_CHAIN (chain)))
2056 /* Reverse the order of elements in the chain T,
2057 and return the new head of the chain (old last element). */
2062 tree prev = 0, decl, next;
2063 for (decl = t; decl; decl = next)
2065 next = TREE_CHAIN (decl);
2066 TREE_CHAIN (decl) = prev;
2072 /* Return a newly created TREE_LIST node whose
2073 purpose and value fields are PARM and VALUE. */
2076 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2078 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2079 TREE_PURPOSE (t) = parm;
2080 TREE_VALUE (t) = value;
2084 /* Build a chain of TREE_LIST nodes from a vector. */
2087 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2089 tree ret = NULL_TREE;
2093 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2095 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2096 pp = &TREE_CHAIN (*pp);
2101 /* Return a newly created TREE_LIST node whose
2102 purpose and value fields are PURPOSE and VALUE
2103 and whose TREE_CHAIN is CHAIN. */
2106 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2110 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2112 memset (node, 0, sizeof (struct tree_common));
2114 #ifdef GATHER_STATISTICS
2115 tree_node_counts[(int) x_kind]++;
2116 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2119 TREE_SET_CODE (node, TREE_LIST);
2120 TREE_CHAIN (node) = chain;
2121 TREE_PURPOSE (node) = purpose;
2122 TREE_VALUE (node) = value;
2126 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2129 ctor_to_list (tree ctor)
2131 tree list = NULL_TREE;
2136 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2138 *p = build_tree_list (purpose, val);
2139 p = &TREE_CHAIN (*p);
2145 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2149 ctor_to_vec (tree ctor)
2151 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2155 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2156 VEC_quick_push (tree, vec, val);
2161 /* Return the size nominally occupied by an object of type TYPE
2162 when it resides in memory. The value is measured in units of bytes,
2163 and its data type is that normally used for type sizes
2164 (which is the first type created by make_signed_type or
2165 make_unsigned_type). */
2168 size_in_bytes (const_tree type)
2172 if (type == error_mark_node)
2173 return integer_zero_node;
2175 type = TYPE_MAIN_VARIANT (type);
2176 t = TYPE_SIZE_UNIT (type);
2180 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2181 return size_zero_node;
2187 /* Return the size of TYPE (in bytes) as a wide integer
2188 or return -1 if the size can vary or is larger than an integer. */
2191 int_size_in_bytes (const_tree type)
2195 if (type == error_mark_node)
2198 type = TYPE_MAIN_VARIANT (type);
2199 t = TYPE_SIZE_UNIT (type);
2201 || TREE_CODE (t) != INTEGER_CST
2202 || TREE_INT_CST_HIGH (t) != 0
2203 /* If the result would appear negative, it's too big to represent. */
2204 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2207 return TREE_INT_CST_LOW (t);
2210 /* Return the maximum size of TYPE (in bytes) as a wide integer
2211 or return -1 if the size can vary or is larger than an integer. */
2214 max_int_size_in_bytes (const_tree type)
2216 HOST_WIDE_INT size = -1;
2219 /* If this is an array type, check for a possible MAX_SIZE attached. */
2221 if (TREE_CODE (type) == ARRAY_TYPE)
2223 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2225 if (size_tree && host_integerp (size_tree, 1))
2226 size = tree_low_cst (size_tree, 1);
2229 /* If we still haven't been able to get a size, see if the language
2230 can compute a maximum size. */
2234 size_tree = lang_hooks.types.max_size (type);
2236 if (size_tree && host_integerp (size_tree, 1))
2237 size = tree_low_cst (size_tree, 1);
2243 /* Returns a tree for the size of EXP in bytes. */
2246 tree_expr_size (const_tree exp)
2249 && DECL_SIZE_UNIT (exp) != 0)
2250 return DECL_SIZE_UNIT (exp);
2252 return size_in_bytes (TREE_TYPE (exp));
2255 /* Return the bit position of FIELD, in bits from the start of the record.
2256 This is a tree of type bitsizetype. */
2259 bit_position (const_tree field)
2261 return bit_from_pos (DECL_FIELD_OFFSET (field),
2262 DECL_FIELD_BIT_OFFSET (field));
2265 /* Likewise, but return as an integer. It must be representable in
2266 that way (since it could be a signed value, we don't have the
2267 option of returning -1 like int_size_in_byte can. */
2270 int_bit_position (const_tree field)
2272 return tree_low_cst (bit_position (field), 0);
2275 /* Return the byte position of FIELD, in bytes from the start of the record.
2276 This is a tree of type sizetype. */
2279 byte_position (const_tree field)
2281 return byte_from_pos (DECL_FIELD_OFFSET (field),
2282 DECL_FIELD_BIT_OFFSET (field));
2285 /* Likewise, but return as an integer. It must be representable in
2286 that way (since it could be a signed value, we don't have the
2287 option of returning -1 like int_size_in_byte can. */
2290 int_byte_position (const_tree field)
2292 return tree_low_cst (byte_position (field), 0);
2295 /* Return the strictest alignment, in bits, that T is known to have. */
2298 expr_align (const_tree t)
2300 unsigned int align0, align1;
2302 switch (TREE_CODE (t))
2304 CASE_CONVERT: case NON_LVALUE_EXPR:
2305 /* If we have conversions, we know that the alignment of the
2306 object must meet each of the alignments of the types. */
2307 align0 = expr_align (TREE_OPERAND (t, 0));
2308 align1 = TYPE_ALIGN (TREE_TYPE (t));
2309 return MAX (align0, align1);
2311 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2312 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2313 case CLEANUP_POINT_EXPR:
2314 /* These don't change the alignment of an object. */
2315 return expr_align (TREE_OPERAND (t, 0));
2318 /* The best we can do is say that the alignment is the least aligned
2320 align0 = expr_align (TREE_OPERAND (t, 1));
2321 align1 = expr_align (TREE_OPERAND (t, 2));
2322 return MIN (align0, align1);
2324 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2325 meaningfully, it's always 1. */
2326 case LABEL_DECL: case CONST_DECL:
2327 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2329 gcc_assert (DECL_ALIGN (t) != 0);
2330 return DECL_ALIGN (t);
2336 /* Otherwise take the alignment from that of the type. */
2337 return TYPE_ALIGN (TREE_TYPE (t));
2340 /* Return, as a tree node, the number of elements for TYPE (which is an
2341 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2344 array_type_nelts (const_tree type)
2346 tree index_type, min, max;
2348 /* If they did it with unspecified bounds, then we should have already
2349 given an error about it before we got here. */
2350 if (! TYPE_DOMAIN (type))
2351 return error_mark_node;
2353 index_type = TYPE_DOMAIN (type);
2354 min = TYPE_MIN_VALUE (index_type);
2355 max = TYPE_MAX_VALUE (index_type);
2357 return (integer_zerop (min)
2359 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2362 /* If arg is static -- a reference to an object in static storage -- then
2363 return the object. This is not the same as the C meaning of `static'.
2364 If arg isn't static, return NULL. */
2369 switch (TREE_CODE (arg))
2372 /* Nested functions are static, even though taking their address will
2373 involve a trampoline as we unnest the nested function and create
2374 the trampoline on the tree level. */
2378 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2379 && ! DECL_THREAD_LOCAL_P (arg)
2380 && ! DECL_DLLIMPORT_P (arg)
2384 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2388 return TREE_STATIC (arg) ? arg : NULL;
2395 /* If the thing being referenced is not a field, then it is
2396 something language specific. */
2397 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2399 /* If we are referencing a bitfield, we can't evaluate an
2400 ADDR_EXPR at compile time and so it isn't a constant. */
2401 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2404 return staticp (TREE_OPERAND (arg, 0));
2409 case MISALIGNED_INDIRECT_REF:
2410 case ALIGN_INDIRECT_REF:
2412 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2415 case ARRAY_RANGE_REF:
2416 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2417 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2418 return staticp (TREE_OPERAND (arg, 0));
2422 case COMPOUND_LITERAL_EXPR:
2423 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2433 /* Return whether OP is a DECL whose address is function-invariant. */
2436 decl_address_invariant_p (const_tree op)
2438 /* The conditions below are slightly less strict than the one in
2441 switch (TREE_CODE (op))
2450 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2451 && !DECL_DLLIMPORT_P (op))
2452 || DECL_THREAD_LOCAL_P (op)
2453 || DECL_CONTEXT (op) == current_function_decl
2454 || decl_function_context (op) == current_function_decl)
2459 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2460 || decl_function_context (op) == current_function_decl)
2471 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2474 decl_address_ip_invariant_p (const_tree op)
2476 /* The conditions below are slightly less strict than the one in
2479 switch (TREE_CODE (op))
2487 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2488 && !DECL_DLLIMPORT_P (op))
2489 || DECL_THREAD_LOCAL_P (op))
2494 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2506 /* Return true if T is function-invariant (internal function, does
2507 not handle arithmetic; that's handled in skip_simple_arithmetic and
2508 tree_invariant_p). */
2510 static bool tree_invariant_p (tree t);
2513 tree_invariant_p_1 (tree t)
2517 if (TREE_CONSTANT (t)
2518 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2521 switch (TREE_CODE (t))
2527 op = TREE_OPERAND (t, 0);
2528 while (handled_component_p (op))
2530 switch (TREE_CODE (op))
2533 case ARRAY_RANGE_REF:
2534 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2535 || TREE_OPERAND (op, 2) != NULL_TREE
2536 || TREE_OPERAND (op, 3) != NULL_TREE)
2541 if (TREE_OPERAND (op, 2) != NULL_TREE)
2547 op = TREE_OPERAND (op, 0);
2550 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2559 /* Return true if T is function-invariant. */
2562 tree_invariant_p (tree t)
2564 tree inner = skip_simple_arithmetic (t);
2565 return tree_invariant_p_1 (inner);
2568 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2569 Do this to any expression which may be used in more than one place,
2570 but must be evaluated only once.
2572 Normally, expand_expr would reevaluate the expression each time.
2573 Calling save_expr produces something that is evaluated and recorded
2574 the first time expand_expr is called on it. Subsequent calls to
2575 expand_expr just reuse the recorded value.
2577 The call to expand_expr that generates code that actually computes
2578 the value is the first call *at compile time*. Subsequent calls
2579 *at compile time* generate code to use the saved value.
2580 This produces correct result provided that *at run time* control
2581 always flows through the insns made by the first expand_expr
2582 before reaching the other places where the save_expr was evaluated.
2583 You, the caller of save_expr, must make sure this is so.
2585 Constants, and certain read-only nodes, are returned with no
2586 SAVE_EXPR because that is safe. Expressions containing placeholders
2587 are not touched; see tree.def for an explanation of what these
2591 save_expr (tree expr)
2593 tree t = fold (expr);
2596 /* If the tree evaluates to a constant, then we don't want to hide that
2597 fact (i.e. this allows further folding, and direct checks for constants).
2598 However, a read-only object that has side effects cannot be bypassed.
2599 Since it is no problem to reevaluate literals, we just return the
2601 inner = skip_simple_arithmetic (t);
2602 if (TREE_CODE (inner) == ERROR_MARK)
2605 if (tree_invariant_p_1 (inner))
2608 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2609 it means that the size or offset of some field of an object depends on
2610 the value within another field.
2612 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2613 and some variable since it would then need to be both evaluated once and
2614 evaluated more than once. Front-ends must assure this case cannot
2615 happen by surrounding any such subexpressions in their own SAVE_EXPR
2616 and forcing evaluation at the proper time. */
2617 if (contains_placeholder_p (inner))
2620 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2621 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2623 /* This expression might be placed ahead of a jump to ensure that the
2624 value was computed on both sides of the jump. So make sure it isn't
2625 eliminated as dead. */
2626 TREE_SIDE_EFFECTS (t) = 1;
2630 /* Look inside EXPR and into any simple arithmetic operations. Return
2631 the innermost non-arithmetic node. */
2634 skip_simple_arithmetic (tree expr)
2638 /* We don't care about whether this can be used as an lvalue in this
2640 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2641 expr = TREE_OPERAND (expr, 0);
2643 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2644 a constant, it will be more efficient to not make another SAVE_EXPR since
2645 it will allow better simplification and GCSE will be able to merge the
2646 computations if they actually occur. */
2650 if (UNARY_CLASS_P (inner))
2651 inner = TREE_OPERAND (inner, 0);
2652 else if (BINARY_CLASS_P (inner))
2654 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2655 inner = TREE_OPERAND (inner, 0);
2656 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2657 inner = TREE_OPERAND (inner, 1);
2669 /* Return which tree structure is used by T. */
2671 enum tree_node_structure_enum
2672 tree_node_structure (const_tree t)
2674 const enum tree_code code = TREE_CODE (t);
2675 return tree_node_structure_for_code (code);
2678 /* Set various status flags when building a CALL_EXPR object T. */
2681 process_call_operands (tree t)
2683 bool side_effects = TREE_SIDE_EFFECTS (t);
2684 bool read_only = false;
2685 int i = call_expr_flags (t);
2687 /* Calls have side-effects, except those to const or pure functions. */
2688 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2689 side_effects = true;
2690 /* Propagate TREE_READONLY of arguments for const functions. */
2694 if (!side_effects || read_only)
2695 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2697 tree op = TREE_OPERAND (t, i);
2698 if (op && TREE_SIDE_EFFECTS (op))
2699 side_effects = true;
2700 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2704 TREE_SIDE_EFFECTS (t) = side_effects;
2705 TREE_READONLY (t) = read_only;
2708 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2709 or offset that depends on a field within a record. */
2712 contains_placeholder_p (const_tree exp)
2714 enum tree_code code;
2719 code = TREE_CODE (exp);
2720 if (code == PLACEHOLDER_EXPR)
2723 switch (TREE_CODE_CLASS (code))
2726 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2727 position computations since they will be converted into a
2728 WITH_RECORD_EXPR involving the reference, which will assume
2729 here will be valid. */
2730 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2732 case tcc_exceptional:
2733 if (code == TREE_LIST)
2734 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2735 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2740 case tcc_comparison:
2741 case tcc_expression:
2745 /* Ignoring the first operand isn't quite right, but works best. */
2746 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2749 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2750 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2751 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2754 /* The save_expr function never wraps anything containing
2755 a PLACEHOLDER_EXPR. */
2762 switch (TREE_CODE_LENGTH (code))
2765 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2767 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2768 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2779 const_call_expr_arg_iterator iter;
2780 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2781 if (CONTAINS_PLACEHOLDER_P (arg))
2795 /* Return true if any part of the computation of TYPE involves a
2796 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2797 (for QUAL_UNION_TYPE) and field positions. */
2800 type_contains_placeholder_1 (const_tree type)
2802 /* If the size contains a placeholder or the parent type (component type in
2803 the case of arrays) type involves a placeholder, this type does. */
2804 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2805 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2806 || (TREE_TYPE (type) != 0
2807 && type_contains_placeholder_p (TREE_TYPE (type))))
2810 /* Now do type-specific checks. Note that the last part of the check above
2811 greatly limits what we have to do below. */
2812 switch (TREE_CODE (type))
2820 case REFERENCE_TYPE:
2828 case FIXED_POINT_TYPE:
2829 /* Here we just check the bounds. */
2830 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2831 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2834 /* We're already checked the component type (TREE_TYPE), so just check
2836 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2840 case QUAL_UNION_TYPE:
2844 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2845 if (TREE_CODE (field) == FIELD_DECL
2846 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2847 || (TREE_CODE (type) == QUAL_UNION_TYPE
2848 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2849 || type_contains_placeholder_p (TREE_TYPE (field))))
2861 type_contains_placeholder_p (tree type)
2865 /* If the contains_placeholder_bits field has been initialized,
2866 then we know the answer. */
2867 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2868 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2870 /* Indicate that we've seen this type node, and the answer is false.
2871 This is what we want to return if we run into recursion via fields. */
2872 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2874 /* Compute the real value. */
2875 result = type_contains_placeholder_1 (type);
2877 /* Store the real value. */
2878 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2883 /* Push tree EXP onto vector QUEUE if it is not already present. */
2886 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2891 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2892 if (simple_cst_equal (iter, exp) == 1)
2896 VEC_safe_push (tree, heap, *queue, exp);
2899 /* Given a tree EXP, find all occurences of references to fields
2900 in a PLACEHOLDER_EXPR and place them in vector REFS without
2901 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2902 we assume here that EXP contains only arithmetic expressions
2903 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2907 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2909 enum tree_code code = TREE_CODE (exp);
2913 /* We handle TREE_LIST and COMPONENT_REF separately. */
2914 if (code == TREE_LIST)
2916 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2917 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2919 else if (code == COMPONENT_REF)
2921 for (inner = TREE_OPERAND (exp, 0);
2922 REFERENCE_CLASS_P (inner);
2923 inner = TREE_OPERAND (inner, 0))
2926 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2927 push_without_duplicates (exp, refs);
2929 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2932 switch (TREE_CODE_CLASS (code))
2937 case tcc_declaration:
2938 /* Variables allocated to static storage can stay. */
2939 if (!TREE_STATIC (exp))
2940 push_without_duplicates (exp, refs);
2943 case tcc_expression:
2944 /* This is the pattern built in ada/make_aligning_type. */
2945 if (code == ADDR_EXPR
2946 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2948 push_without_duplicates (exp, refs);
2952 /* Fall through... */
2954 case tcc_exceptional:
2957 case tcc_comparison:
2959 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2960 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2964 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2965 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2973 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2974 return a tree with all occurrences of references to F in a
2975 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2976 CONST_DECLs. Note that we assume here that EXP contains only
2977 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2978 occurring only in their argument list. */
2981 substitute_in_expr (tree exp, tree f, tree r)
2983 enum tree_code code = TREE_CODE (exp);
2984 tree op0, op1, op2, op3;
2987 /* We handle TREE_LIST and COMPONENT_REF separately. */
2988 if (code == TREE_LIST)
2990 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2991 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2992 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2995 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2997 else if (code == COMPONENT_REF)
3001 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3002 and it is the right field, replace it with R. */
3003 for (inner = TREE_OPERAND (exp, 0);
3004 REFERENCE_CLASS_P (inner);
3005 inner = TREE_OPERAND (inner, 0))
3009 op1 = TREE_OPERAND (exp, 1);
3011 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3014 /* If this expression hasn't been completed let, leave it alone. */
3015 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3018 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3019 if (op0 == TREE_OPERAND (exp, 0))
3023 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3026 switch (TREE_CODE_CLASS (code))
3031 case tcc_declaration:
3037 case tcc_expression:
3041 /* Fall through... */
3043 case tcc_exceptional:
3046 case tcc_comparison:
3048 switch (TREE_CODE_LENGTH (code))
3054 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3055 if (op0 == TREE_OPERAND (exp, 0))
3058 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3062 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3063 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3065 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3068 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3072 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3073 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3074 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3076 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3077 && op2 == TREE_OPERAND (exp, 2))
3080 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3084 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3085 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3086 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3087 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3089 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3090 && op2 == TREE_OPERAND (exp, 2)
3091 && op3 == TREE_OPERAND (exp, 3))
3095 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3107 new_tree = NULL_TREE;
3109 /* If we are trying to replace F with a constant, inline back
3110 functions which do nothing else than computing a value from
3111 the arguments they are passed. This makes it possible to
3112 fold partially or entirely the replacement expression. */
3113 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3115 tree t = maybe_inline_call_in_expr (exp);
3117 return SUBSTITUTE_IN_EXPR (t, f, r);
3120 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3122 tree op = TREE_OPERAND (exp, i);
3123 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3127 new_tree = copy_node (exp);
3128 TREE_OPERAND (new_tree, i) = new_op;
3134 new_tree = fold (new_tree);
3135 if (TREE_CODE (new_tree) == CALL_EXPR)
3136 process_call_operands (new_tree);
3147 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3151 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3152 for it within OBJ, a tree that is an object or a chain of references. */
3155 substitute_placeholder_in_expr (tree exp, tree obj)
3157 enum tree_code code = TREE_CODE (exp);
3158 tree op0, op1, op2, op3;
3161 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3162 in the chain of OBJ. */
3163 if (code == PLACEHOLDER_EXPR)
3165 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3168 for (elt = obj; elt != 0;
3169 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3170 || TREE_CODE (elt) == COND_EXPR)
3171 ? TREE_OPERAND (elt, 1)
3172 : (REFERENCE_CLASS_P (elt)
3173 || UNARY_CLASS_P (elt)
3174 || BINARY_CLASS_P (elt)
3175 || VL_EXP_CLASS_P (elt)
3176 || EXPRESSION_CLASS_P (elt))
3177 ? TREE_OPERAND (elt, 0) : 0))
3178 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3181 for (elt = obj; elt != 0;
3182 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3183 || TREE_CODE (elt) == COND_EXPR)
3184 ? TREE_OPERAND (elt, 1)
3185 : (REFERENCE_CLASS_P (elt)
3186 || UNARY_CLASS_P (elt)
3187 || BINARY_CLASS_P (elt)
3188 || VL_EXP_CLASS_P (elt)
3189 || EXPRESSION_CLASS_P (elt))
3190 ? TREE_OPERAND (elt, 0) : 0))
3191 if (POINTER_TYPE_P (TREE_TYPE (elt))
3192 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3194 return fold_build1 (INDIRECT_REF, need_type, elt);
3196 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3197 survives until RTL generation, there will be an error. */
3201 /* TREE_LIST is special because we need to look at TREE_VALUE
3202 and TREE_CHAIN, not TREE_OPERANDS. */
3203 else if (code == TREE_LIST)
3205 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3206 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3207 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3210 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3213 switch (TREE_CODE_CLASS (code))
3216 case tcc_declaration:
3219 case tcc_exceptional:
3222 case tcc_comparison:
3223 case tcc_expression:
3226 switch (TREE_CODE_LENGTH (code))
3232 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3233 if (op0 == TREE_OPERAND (exp, 0))
3236 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3240 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3241 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3243 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3246 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3250 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3251 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3252 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3254 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3255 && op2 == TREE_OPERAND (exp, 2))
3258 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3262 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3263 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3264 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3265 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3267 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3268 && op2 == TREE_OPERAND (exp, 2)
3269 && op3 == TREE_OPERAND (exp, 3))
3273 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3285 new_tree = NULL_TREE;
3287 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3289 tree op = TREE_OPERAND (exp, i);
3290 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3294 new_tree = copy_node (exp);
3295 TREE_OPERAND (new_tree, i) = new_op;
3301 new_tree = fold (new_tree);
3302 if (TREE_CODE (new_tree) == CALL_EXPR)
3303 process_call_operands (new_tree);
3314 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3318 /* Stabilize a reference so that we can use it any number of times
3319 without causing its operands to be evaluated more than once.
3320 Returns the stabilized reference. This works by means of save_expr,
3321 so see the caveats in the comments about save_expr.
3323 Also allows conversion expressions whose operands are references.
3324 Any other kind of expression is returned unchanged. */
3327 stabilize_reference (tree ref)
3330 enum tree_code code = TREE_CODE (ref);
3337 /* No action is needed in this case. */
3342 case FIX_TRUNC_EXPR:
3343 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3347 result = build_nt (INDIRECT_REF,
3348 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3352 result = build_nt (COMPONENT_REF,
3353 stabilize_reference (TREE_OPERAND (ref, 0)),
3354 TREE_OPERAND (ref, 1), NULL_TREE);
3358 result = build_nt (BIT_FIELD_REF,
3359 stabilize_reference (TREE_OPERAND (ref, 0)),
3360 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3361 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3365 result = build_nt (ARRAY_REF,
3366 stabilize_reference (TREE_OPERAND (ref, 0)),
3367 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3368 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3371 case ARRAY_RANGE_REF:
3372 result = build_nt (ARRAY_RANGE_REF,
3373 stabilize_reference (TREE_OPERAND (ref, 0)),
3374 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3375 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3379 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3380 it wouldn't be ignored. This matters when dealing with
3382 return stabilize_reference_1 (ref);
3384 /* If arg isn't a kind of lvalue we recognize, make no change.
3385 Caller should recognize the error for an invalid lvalue. */
3390 return error_mark_node;
3393 TREE_TYPE (result) = TREE_TYPE (ref);
3394 TREE_READONLY (result) = TREE_READONLY (ref);
3395 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3396 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3401 /* Subroutine of stabilize_reference; this is called for subtrees of
3402 references. Any expression with side-effects must be put in a SAVE_EXPR
3403 to ensure that it is only evaluated once.
3405 We don't put SAVE_EXPR nodes around everything, because assigning very
3406 simple expressions to temporaries causes us to miss good opportunities
3407 for optimizations. Among other things, the opportunity to fold in the
3408 addition of a constant into an addressing mode often gets lost, e.g.
3409 "y[i+1] += x;". In general, we take the approach that we should not make
3410 an assignment unless we are forced into it - i.e., that any non-side effect
3411 operator should be allowed, and that cse should take care of coalescing
3412 multiple utterances of the same expression should that prove fruitful. */
3415 stabilize_reference_1 (tree e)
3418 enum tree_code code = TREE_CODE (e);
3420 /* We cannot ignore const expressions because it might be a reference
3421 to a const array but whose index contains side-effects. But we can
3422 ignore things that are actual constant or that already have been
3423 handled by this function. */
3425 if (tree_invariant_p (e))
3428 switch (TREE_CODE_CLASS (code))
3430 case tcc_exceptional:
3432 case tcc_declaration:
3433 case tcc_comparison:
3435 case tcc_expression:
3438 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3439 so that it will only be evaluated once. */
3440 /* The reference (r) and comparison (<) classes could be handled as
3441 below, but it is generally faster to only evaluate them once. */
3442 if (TREE_SIDE_EFFECTS (e))
3443 return save_expr (e);
3447 /* Constants need no processing. In fact, we should never reach
3452 /* Division is slow and tends to be compiled with jumps,
3453 especially the division by powers of 2 that is often
3454 found inside of an array reference. So do it just once. */
3455 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3456 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3457 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3458 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3459 return save_expr (e);
3460 /* Recursively stabilize each operand. */
3461 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3462 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3466 /* Recursively stabilize each operand. */
3467 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3474 TREE_TYPE (result) = TREE_TYPE (e);
3475 TREE_READONLY (result) = TREE_READONLY (e);
3476 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3477 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3482 /* Low-level constructors for expressions. */
3484 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3485 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3488 recompute_tree_invariant_for_addr_expr (tree t)
3491 bool tc = true, se = false;
3493 /* We started out assuming this address is both invariant and constant, but
3494 does not have side effects. Now go down any handled components and see if
3495 any of them involve offsets that are either non-constant or non-invariant.
3496 Also check for side-effects.
3498 ??? Note that this code makes no attempt to deal with the case where
3499 taking the address of something causes a copy due to misalignment. */
3501 #define UPDATE_FLAGS(NODE) \
3502 do { tree _node = (NODE); \
3503 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3504 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3506 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3507 node = TREE_OPERAND (node, 0))
3509 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3510 array reference (probably made temporarily by the G++ front end),
3511 so ignore all the operands. */
3512 if ((TREE_CODE (node) == ARRAY_REF
3513 || TREE_CODE (node) == ARRAY_RANGE_REF)
3514 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3516 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3517 if (TREE_OPERAND (node, 2))
3518 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3519 if (TREE_OPERAND (node, 3))
3520 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3522 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3523 FIELD_DECL, apparently. The G++ front end can put something else
3524 there, at least temporarily. */
3525 else if (TREE_CODE (node) == COMPONENT_REF
3526 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3528 if (TREE_OPERAND (node, 2))
3529 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3531 else if (TREE_CODE (node) == BIT_FIELD_REF)
3532 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3535 node = lang_hooks.expr_to_decl (node, &tc, &se);
3537 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3538 the address, since &(*a)->b is a form of addition. If it's a constant, the
3539 address is constant too. If it's a decl, its address is constant if the
3540 decl is static. Everything else is not constant and, furthermore,
3541 taking the address of a volatile variable is not volatile. */
3542 if (TREE_CODE (node) == INDIRECT_REF)
3543 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3544 else if (CONSTANT_CLASS_P (node))
3546 else if (DECL_P (node))
3547 tc &= (staticp (node) != NULL_TREE);
3551 se |= TREE_SIDE_EFFECTS (node);
3555 TREE_CONSTANT (t) = tc;
3556 TREE_SIDE_EFFECTS (t) = se;
3560 /* Build an expression of code CODE, data type TYPE, and operands as
3561 specified. Expressions and reference nodes can be created this way.
3562 Constants, decls, types and misc nodes cannot be.
3564 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3565 enough for all extant tree codes. */
3568 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3572 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3574 t = make_node_stat (code PASS_MEM_STAT);
3581 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3583 int length = sizeof (struct tree_exp);
3584 #ifdef GATHER_STATISTICS
3585 tree_node_kind kind;
3589 #ifdef GATHER_STATISTICS
3590 switch (TREE_CODE_CLASS (code))
3592 case tcc_statement: /* an expression with side effects */
3595 case tcc_reference: /* a reference */
3603 tree_node_counts[(int) kind]++;
3604 tree_node_sizes[(int) kind] += length;
3607 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3609 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3611 memset (t, 0, sizeof (struct tree_common));
3613 TREE_SET_CODE (t, code);
3615 TREE_TYPE (t) = type;
3616 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3617 TREE_OPERAND (t, 0) = node;
3618 TREE_BLOCK (t) = NULL_TREE;
3619 if (node && !TYPE_P (node))
3621 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3622 TREE_READONLY (t) = TREE_READONLY (node);
3625 if (TREE_CODE_CLASS (code) == tcc_statement)
3626 TREE_SIDE_EFFECTS (t) = 1;
3630 /* All of these have side-effects, no matter what their
3632 TREE_SIDE_EFFECTS (t) = 1;
3633 TREE_READONLY (t) = 0;
3636 case MISALIGNED_INDIRECT_REF:
3637 case ALIGN_INDIRECT_REF:
3639 /* Whether a dereference is readonly has nothing to do with whether
3640 its operand is readonly. */
3641 TREE_READONLY (t) = 0;
3646 recompute_tree_invariant_for_addr_expr (t);
3650 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3651 && node && !TYPE_P (node)
3652 && TREE_CONSTANT (node))
3653 TREE_CONSTANT (t) = 1;
3654 if (TREE_CODE_CLASS (code) == tcc_reference
3655 && node && TREE_THIS_VOLATILE (node))
3656 TREE_THIS_VOLATILE (t) = 1;
3663 #define PROCESS_ARG(N) \
3665 TREE_OPERAND (t, N) = arg##N; \
3666 if (arg##N &&!TYPE_P (arg##N)) \
3668 if (TREE_SIDE_EFFECTS (arg##N)) \
3670 if (!TREE_READONLY (arg##N) \
3671 && !CONSTANT_CLASS_P (arg##N)) \
3672 (void) (read_only = 0); \
3673 if (!TREE_CONSTANT (arg##N)) \
3674 (void) (constant = 0); \
3679 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3681 bool constant, read_only, side_effects;
3684 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3686 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3687 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3688 /* When sizetype precision doesn't match that of pointers
3689 we need to be able to build explicit extensions or truncations
3690 of the offset argument. */
3691 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3692 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3693 && TREE_CODE (arg1) == INTEGER_CST);
3695 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3696 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3697 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3698 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3700 t = make_node_stat (code PASS_MEM_STAT);
3703 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3704 result based on those same flags for the arguments. But if the
3705 arguments aren't really even `tree' expressions, we shouldn't be trying
3708 /* Expressions without side effects may be constant if their
3709 arguments are as well. */
3710 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3711 || TREE_CODE_CLASS (code) == tcc_binary);
3713 side_effects = TREE_SIDE_EFFECTS (t);
3718 TREE_READONLY (t) = read_only;
3719 TREE_CONSTANT (t) = constant;
3720 TREE_SIDE_EFFECTS (t) = side_effects;
3721 TREE_THIS_VOLATILE (t)
3722 = (TREE_CODE_CLASS (code) == tcc_reference
3723 && arg0 && TREE_THIS_VOLATILE (arg0));
3730 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3731 tree arg2 MEM_STAT_DECL)
3733 bool constant, read_only, side_effects;
3736 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3737 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3739 t = make_node_stat (code PASS_MEM_STAT);
3744 /* As a special exception, if COND_EXPR has NULL branches, we
3745 assume that it is a gimple statement and always consider
3746 it to have side effects. */
3747 if (code == COND_EXPR
3748 && tt == void_type_node
3749 && arg1 == NULL_TREE
3750 && arg2 == NULL_TREE)
3751 side_effects = true;
3753 side_effects = TREE_SIDE_EFFECTS (t);
3759 if (code == COND_EXPR)
3760 TREE_READONLY (t) = read_only;
3762 TREE_SIDE_EFFECTS (t) = side_effects;
3763 TREE_THIS_VOLATILE (t)
3764 = (TREE_CODE_CLASS (code) == tcc_reference
3765 && arg0 && TREE_THIS_VOLATILE (arg0));
3771 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3772 tree arg2, tree arg3 MEM_STAT_DECL)
3774 bool constant, read_only, side_effects;
3777 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3779 t = make_node_stat (code PASS_MEM_STAT);
3782 side_effects = TREE_SIDE_EFFECTS (t);
3789 TREE_SIDE_EFFECTS (t) = side_effects;
3790 TREE_THIS_VOLATILE (t)
3791 = (TREE_CODE_CLASS (code) == tcc_reference
3792 && arg0 && TREE_THIS_VOLATILE (arg0));
3798 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3799 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3801 bool constant, read_only, side_effects;
3804 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3806 t = make_node_stat (code PASS_MEM_STAT);
3809 side_effects = TREE_SIDE_EFFECTS (t);
3817 TREE_SIDE_EFFECTS (t) = side_effects;
3818 TREE_THIS_VOLATILE (t)
3819 = (TREE_CODE_CLASS (code) == tcc_reference
3820 && arg0 && TREE_THIS_VOLATILE (arg0));
3826 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3827 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3829 bool constant, read_only, side_effects;
3832 gcc_assert (code == TARGET_MEM_REF);
3834 t = make_node_stat (code PASS_MEM_STAT);
3837 side_effects = TREE_SIDE_EFFECTS (t);
3844 if (code == TARGET_MEM_REF)
3848 TREE_SIDE_EFFECTS (t) = side_effects;
3849 TREE_THIS_VOLATILE (t)
3850 = (code == TARGET_MEM_REF
3851 && arg5 && TREE_THIS_VOLATILE (arg5));
3856 /* Similar except don't specify the TREE_TYPE
3857 and leave the TREE_SIDE_EFFECTS as 0.
3858 It is permissible for arguments to be null,
3859 or even garbage if their values do not matter. */
3862 build_nt (enum tree_code code, ...)
3869 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3873 t = make_node (code);
3874 length = TREE_CODE_LENGTH (code);
3876 for (i = 0; i < length; i++)
3877 TREE_OPERAND (t, i) = va_arg (p, tree);
3883 /* Similar to build_nt, but for creating a CALL_EXPR object with
3884 ARGLIST passed as a list. */
3887 build_nt_call_list (tree fn, tree arglist)
3892 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3893 CALL_EXPR_FN (t) = fn;
3894 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3895 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3896 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3900 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3904 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3909 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3910 CALL_EXPR_FN (ret) = fn;
3911 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3912 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3913 CALL_EXPR_ARG (ret, ix) = t;
3917 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3918 We do NOT enter this node in any sort of symbol table.
3920 LOC is the location of the decl.
3922 layout_decl is used to set up the decl's storage layout.
3923 Other slots are initialized to 0 or null pointers. */
3926 build_decl_stat (location_t loc, enum tree_code code, tree name,
3927 tree type MEM_STAT_DECL)
3931 t = make_node_stat (code PASS_MEM_STAT);
3932 DECL_SOURCE_LOCATION (t) = loc;
3934 /* if (type == error_mark_node)
3935 type = integer_type_node; */
3936 /* That is not done, deliberately, so that having error_mark_node
3937 as the type can suppress useless errors in the use of this variable. */
3939 DECL_NAME (t) = name;
3940 TREE_TYPE (t) = type;
3942 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3948 /* Builds and returns function declaration with NAME and TYPE. */
3951 build_fn_decl (const char *name, tree type)
3953 tree id = get_identifier (name);
3954 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3956 DECL_EXTERNAL (decl) = 1;
3957 TREE_PUBLIC (decl) = 1;
3958 DECL_ARTIFICIAL (decl) = 1;
3959 TREE_NOTHROW (decl) = 1;
3965 /* BLOCK nodes are used to represent the structure of binding contours
3966 and declarations, once those contours have been exited and their contents
3967 compiled. This information is used for outputting debugging info. */
3970 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3972 tree block = make_node (BLOCK);
3974 BLOCK_VARS (block) = vars;
3975 BLOCK_SUBBLOCKS (block) = subblocks;
3976 BLOCK_SUPERCONTEXT (block) = supercontext;
3977 BLOCK_CHAIN (block) = chain;
3982 expand_location (source_location loc)
3984 expanded_location xloc;
3985 if (loc <= BUILTINS_LOCATION)
3987 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3994 const struct line_map *map = linemap_lookup (line_table, loc);
3995 xloc.file = map->to_file;
3996 xloc.line = SOURCE_LINE (map, loc);
3997 xloc.column = SOURCE_COLUMN (map, loc);
3998 xloc.sysp = map->sysp != 0;
4004 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4006 LOC is the location to use in tree T. */
4009 protected_set_expr_location (tree t, location_t loc)
4011 if (t && CAN_HAVE_LOCATION_P (t))
4012 SET_EXPR_LOCATION (t, loc);
4015 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4019 build_decl_attribute_variant (tree ddecl, tree attribute)
4021 DECL_ATTRIBUTES (ddecl) = attribute;
4025 /* Borrowed from hashtab.c iterative_hash implementation. */
4026 #define mix(a,b,c) \
4028 a -= b; a -= c; a ^= (c>>13); \
4029 b -= c; b -= a; b ^= (a<< 8); \
4030 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4031 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4032 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4033 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4034 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4035 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4036 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4040 /* Produce good hash value combining VAL and VAL2. */
4042 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4044 /* the golden ratio; an arbitrary value. */
4045 hashval_t a = 0x9e3779b9;
4051 /* Produce good hash value combining VAL and VAL2. */
4053 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4055 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4056 return iterative_hash_hashval_t (val, val2);
4059 hashval_t a = (hashval_t) val;
4060 /* Avoid warnings about shifting of more than the width of the type on
4061 hosts that won't execute this path. */
4063 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4065 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4067 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4068 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4075 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4076 is ATTRIBUTE and its qualifiers are QUALS.
4078 Record such modified types already made so we don't make duplicates. */
4081 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4083 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4085 hashval_t hashcode = 0;
4087 enum tree_code code = TREE_CODE (ttype);
4089 /* Building a distinct copy of a tagged type is inappropriate; it
4090 causes breakage in code that expects there to be a one-to-one
4091 relationship between a struct and its fields.
4092 build_duplicate_type is another solution (as used in
4093 handle_transparent_union_attribute), but that doesn't play well
4094 with the stronger C++ type identity model. */
4095 if (TREE_CODE (ttype) == RECORD_TYPE
4096 || TREE_CODE (ttype) == UNION_TYPE
4097 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4098 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4100 warning (OPT_Wattributes,
4101 "ignoring attributes applied to %qT after definition",
4102 TYPE_MAIN_VARIANT (ttype));
4103 return build_qualified_type (ttype, quals);
4106 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4107 ntype = build_distinct_type_copy (ttype);
4109 TYPE_ATTRIBUTES (ntype) = attribute;
4111 hashcode = iterative_hash_object (code, hashcode);
4112 if (TREE_TYPE (ntype))
4113 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4115 hashcode = attribute_hash_list (attribute, hashcode);
4117 switch (TREE_CODE (ntype))
4120 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4123 if (TYPE_DOMAIN (ntype))
4124 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4128 hashcode = iterative_hash_object
4129 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4130 hashcode = iterative_hash_object
4131 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4134 case FIXED_POINT_TYPE:
4136 unsigned int precision = TYPE_PRECISION (ntype);
4137 hashcode = iterative_hash_object (precision, hashcode);
4144 ntype = type_hash_canon (hashcode, ntype);
4146 /* If the target-dependent attributes make NTYPE different from
4147 its canonical type, we will need to use structural equality
4148 checks for this type. */
4149 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4150 || !targetm.comp_type_attributes (ntype, ttype))
4151 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4152 else if (TYPE_CANONICAL (ntype) == ntype)
4153 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4155 ttype = build_qualified_type (ntype, quals);
4157 else if (TYPE_QUALS (ttype) != quals)
4158 ttype = build_qualified_type (ttype, quals);
4164 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4167 Record such modified types already made so we don't make duplicates. */
4170 build_type_attribute_variant (tree ttype, tree attribute)
4172 return build_type_attribute_qual_variant (ttype, attribute,
4173 TYPE_QUALS (ttype));
4177 /* Reset the expression *EXPR_P, a size or position.
4179 ??? We could reset all non-constant sizes or positions. But it's cheap
4180 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4182 We need to reset self-referential sizes or positions because they cannot
4183 be gimplified and thus can contain a CALL_EXPR after the gimplification
4184 is finished, which will run afoul of LTO streaming. And they need to be
4185 reset to something essentially dummy but not constant, so as to preserve
4186 the properties of the object they are attached to. */
4189 free_lang_data_in_one_sizepos (tree *expr_p)
4191 tree expr = *expr_p;
4192 if (CONTAINS_PLACEHOLDER_P (expr))
4193 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4197 /* Reset all the fields in a binfo node BINFO. We only keep
4198 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4201 free_lang_data_in_binfo (tree binfo)
4206 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4208 BINFO_VTABLE (binfo) = NULL_TREE;
4209 BINFO_BASE_ACCESSES (binfo) = NULL;
4210 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4211 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4213 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4214 free_lang_data_in_binfo (t);
4218 /* Reset all language specific information still present in TYPE. */
4221 free_lang_data_in_type (tree type)
4223 gcc_assert (TYPE_P (type));
4225 /* Give the FE a chance to remove its own data first. */
4226 lang_hooks.free_lang_data (type);
4228 TREE_LANG_FLAG_0 (type) = 0;
4229 TREE_LANG_FLAG_1 (type) = 0;
4230 TREE_LANG_FLAG_2 (type) = 0;
4231 TREE_LANG_FLAG_3 (type) = 0;
4232 TREE_LANG_FLAG_4 (type) = 0;
4233 TREE_LANG_FLAG_5 (type) = 0;
4234 TREE_LANG_FLAG_6 (type) = 0;
4236 if (TREE_CODE (type) == FUNCTION_TYPE)
4238 /* Remove the const and volatile qualifiers from arguments. The
4239 C++ front end removes them, but the C front end does not,
4240 leading to false ODR violation errors when merging two
4241 instances of the same function signature compiled by
4242 different front ends. */
4245 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4247 tree arg_type = TREE_VALUE (p);
4249 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4251 int quals = TYPE_QUALS (arg_type)
4253 & ~TYPE_QUAL_VOLATILE;
4254 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4255 free_lang_data_in_type (TREE_VALUE (p));
4260 /* Remove members that are not actually FIELD_DECLs from the field
4261 list of an aggregate. These occur in C++. */
4262 if (RECORD_OR_UNION_TYPE_P (type))
4266 /* Note that TYPE_FIELDS can be shared across distinct
4267 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4268 to be removed, we cannot set its TREE_CHAIN to NULL.
4269 Otherwise, we would not be able to find all the other fields
4270 in the other instances of this TREE_TYPE.
4272 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4274 member = TYPE_FIELDS (type);
4277 if (TREE_CODE (member) == FIELD_DECL)
4280 TREE_CHAIN (prev) = member;
4282 TYPE_FIELDS (type) = member;
4286 member = TREE_CHAIN (member);
4290 TREE_CHAIN (prev) = NULL_TREE;
4292 TYPE_FIELDS (type) = NULL_TREE;
4294 TYPE_METHODS (type) = NULL_TREE;
4295 if (TYPE_BINFO (type))
4296 free_lang_data_in_binfo (TYPE_BINFO (type));
4300 /* For non-aggregate types, clear out the language slot (which
4301 overloads TYPE_BINFO). */
4302 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4304 if (INTEGRAL_TYPE_P (type)
4305 || SCALAR_FLOAT_TYPE_P (type)
4306 || FIXED_POINT_TYPE_P (type))
4308 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4309 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4313 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4314 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4316 if (debug_info_level < DINFO_LEVEL_TERSE
4317 || (TYPE_CONTEXT (type)
4318 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4319 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4320 TYPE_CONTEXT (type) = NULL_TREE;
4322 if (debug_info_level < DINFO_LEVEL_TERSE)
4323 TYPE_STUB_DECL (type) = NULL_TREE;
4327 /* Return true if DECL may need an assembler name to be set. */
4330 need_assembler_name_p (tree decl)
4332 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4333 if (TREE_CODE (decl) != FUNCTION_DECL
4334 && TREE_CODE (decl) != VAR_DECL)
4337 /* If DECL already has its assembler name set, it does not need a
4339 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4340 || DECL_ASSEMBLER_NAME_SET_P (decl))
4343 /* Abstract decls do not need an assembler name. */
4344 if (DECL_ABSTRACT (decl))
4347 /* For VAR_DECLs, only static, public and external symbols need an
4349 if (TREE_CODE (decl) == VAR_DECL
4350 && !TREE_STATIC (decl)
4351 && !TREE_PUBLIC (decl)
4352 && !DECL_EXTERNAL (decl))
4355 if (TREE_CODE (decl) == FUNCTION_DECL)
4357 /* Do not set assembler name on builtins. Allow RTL expansion to
4358 decide whether to expand inline or via a regular call. */
4359 if (DECL_BUILT_IN (decl)
4360 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4363 /* Functions represented in the callgraph need an assembler name. */
4364 if (cgraph_get_node (decl) != NULL)
4367 /* Unused and not public functions don't need an assembler name. */
4368 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4376 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4377 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4378 in BLOCK that is not in LOCALS is removed. */
4381 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4385 tp = &BLOCK_VARS (block);
4388 if (!pointer_set_contains (locals, *tp))
4389 *tp = TREE_CHAIN (*tp);
4391 tp = &TREE_CHAIN (*tp);
4394 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4395 free_lang_data_in_block (fn, t, locals);
4399 /* Reset all language specific information still present in symbol
4403 free_lang_data_in_decl (tree decl)
4405 gcc_assert (DECL_P (decl));
4407 /* Give the FE a chance to remove its own data first. */
4408 lang_hooks.free_lang_data (decl);
4410 TREE_LANG_FLAG_0 (decl) = 0;
4411 TREE_LANG_FLAG_1 (decl) = 0;
4412 TREE_LANG_FLAG_2 (decl) = 0;
4413 TREE_LANG_FLAG_3 (decl) = 0;
4414 TREE_LANG_FLAG_4 (decl) = 0;
4415 TREE_LANG_FLAG_5 (decl) = 0;
4416 TREE_LANG_FLAG_6 (decl) = 0;
4418 /* Identifiers need not have a type. */
4419 if (DECL_NAME (decl))
4420 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4422 /* Ignore any intervening types, because we are going to clear their
4423 TYPE_CONTEXT fields. */
4424 if (TREE_CODE (decl) != FIELD_DECL
4425 && TREE_CODE (decl) != FUNCTION_DECL)
4426 DECL_CONTEXT (decl) = decl_function_context (decl);
4428 if (DECL_CONTEXT (decl)
4429 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4430 DECL_CONTEXT (decl) = NULL_TREE;
4432 if (TREE_CODE (decl) == VAR_DECL)
4434 tree context = DECL_CONTEXT (decl);
4438 enum tree_code code = TREE_CODE (context);
4439 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4441 /* Do not clear the decl context here, that will promote
4442 all vars to global ones. */
4443 DECL_INITIAL (decl) = NULL_TREE;
4446 if (TREE_STATIC (decl))
4447 DECL_CONTEXT (decl) = NULL_TREE;
4451 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4452 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4453 if (TREE_CODE (decl) == FIELD_DECL)
4454 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4456 /* DECL_FCONTEXT is only used for debug info generation. */
4457 if (TREE_CODE (decl) == FIELD_DECL
4458 && debug_info_level < DINFO_LEVEL_TERSE)
4459 DECL_FCONTEXT (decl) = NULL_TREE;
4461 if (TREE_CODE (decl) == FUNCTION_DECL)
4463 if (gimple_has_body_p (decl))
4466 struct pointer_set_t *locals;
4468 /* If DECL has a gimple body, then the context for its
4469 arguments must be DECL. Otherwise, it doesn't really
4470 matter, as we will not be emitting any code for DECL. In
4471 general, there may be other instances of DECL created by
4472 the front end and since PARM_DECLs are generally shared,
4473 their DECL_CONTEXT changes as the replicas of DECL are
4474 created. The only time where DECL_CONTEXT is important
4475 is for the FUNCTION_DECLs that have a gimple body (since
4476 the PARM_DECL will be used in the function's body). */
4477 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4478 DECL_CONTEXT (t) = decl;
4480 /* Collect all the symbols declared in DECL. */
4481 locals = pointer_set_create ();
4482 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4483 for (; t; t = TREE_CHAIN (t))
4485 pointer_set_insert (locals, TREE_VALUE (t));
4487 /* All the local symbols should have DECL as their
4489 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4492 /* Get rid of any decl not in local_decls. */
4493 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4495 pointer_set_destroy (locals);
4498 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4499 At this point, it is not needed anymore. */
4500 DECL_SAVED_TREE (decl) = NULL_TREE;
4502 else if (TREE_CODE (decl) == VAR_DECL)
4504 tree expr = DECL_DEBUG_EXPR (decl);
4506 && TREE_CODE (expr) == VAR_DECL
4507 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4508 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4510 if (DECL_EXTERNAL (decl)
4511 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4512 DECL_INITIAL (decl) = NULL_TREE;
4514 else if (TREE_CODE (decl) == TYPE_DECL)
4516 DECL_INITIAL (decl) = NULL_TREE;
4518 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4519 FIELD_DECLs, which should be preserved. Otherwise,
4520 we shouldn't be concerned with source-level lexical
4521 nesting beyond this point. */
4522 DECL_CONTEXT (decl) = NULL_TREE;
4527 /* Data used when collecting DECLs and TYPEs for language data removal. */
4529 struct free_lang_data_d
4531 /* Worklist to avoid excessive recursion. */
4532 VEC(tree,heap) *worklist;
4534 /* Set of traversed objects. Used to avoid duplicate visits. */
4535 struct pointer_set_t *pset;
4537 /* Array of symbols to process with free_lang_data_in_decl. */
4538 VEC(tree,heap) *decls;
4540 /* Array of types to process with free_lang_data_in_type. */
4541 VEC(tree,heap) *types;
4545 /* Save all language fields needed to generate proper debug information
4546 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4549 save_debug_info_for_decl (tree t)
4551 /*struct saved_debug_info_d *sdi;*/
4553 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4555 /* FIXME. Partial implementation for saving debug info removed. */
4559 /* Save all language fields needed to generate proper debug information
4560 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4563 save_debug_info_for_type (tree t)
4565 /*struct saved_debug_info_d *sdi;*/
4567 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4569 /* FIXME. Partial implementation for saving debug info removed. */
4573 /* Add type or decl T to one of the list of tree nodes that need their
4574 language data removed. The lists are held inside FLD. */
4577 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4581 VEC_safe_push (tree, heap, fld->decls, t);
4582 if (debug_info_level > DINFO_LEVEL_TERSE)
4583 save_debug_info_for_decl (t);
4585 else if (TYPE_P (t))
4587 VEC_safe_push (tree, heap, fld->types, t);
4588 if (debug_info_level > DINFO_LEVEL_TERSE)
4589 save_debug_info_for_type (t);
4595 /* Push tree node T into FLD->WORKLIST. */
4598 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4600 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4601 VEC_safe_push (tree, heap, fld->worklist, (t));
4605 /* Operand callback helper for free_lang_data_in_node. *TP is the
4606 subtree operand being considered. */
4609 find_decls_types_r (tree *tp, int *ws, void *data)
4612 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4614 if (TREE_CODE (t) == TREE_LIST)
4617 /* Language specific nodes will be removed, so there is no need
4618 to gather anything under them. */
4619 if (is_lang_specific (t))
4627 /* Note that walk_tree does not traverse every possible field in
4628 decls, so we have to do our own traversals here. */
4629 add_tree_to_fld_list (t, fld);
4631 fld_worklist_push (DECL_NAME (t), fld);
4632 fld_worklist_push (DECL_CONTEXT (t), fld);
4633 fld_worklist_push (DECL_SIZE (t), fld);
4634 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4636 /* We are going to remove everything under DECL_INITIAL for
4637 TYPE_DECLs. No point walking them. */
4638 if (TREE_CODE (t) != TYPE_DECL)
4639 fld_worklist_push (DECL_INITIAL (t), fld);
4641 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4642 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4644 if (TREE_CODE (t) == FUNCTION_DECL)
4646 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4647 fld_worklist_push (DECL_RESULT (t), fld);
4649 else if (TREE_CODE (t) == TYPE_DECL)
4651 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4652 fld_worklist_push (DECL_VINDEX (t), fld);
4654 else if (TREE_CODE (t) == FIELD_DECL)
4656 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4657 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4658 fld_worklist_push (DECL_QUALIFIER (t), fld);
4659 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4660 fld_worklist_push (DECL_FCONTEXT (t), fld);
4662 else if (TREE_CODE (t) == VAR_DECL)
4664 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4665 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4668 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4669 && DECL_HAS_VALUE_EXPR_P (t))
4670 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4672 if (TREE_CODE (t) != FIELD_DECL)
4673 fld_worklist_push (TREE_CHAIN (t), fld);
4676 else if (TYPE_P (t))
4678 /* Note that walk_tree does not traverse every possible field in
4679 types, so we have to do our own traversals here. */
4680 add_tree_to_fld_list (t, fld);
4682 if (!RECORD_OR_UNION_TYPE_P (t))
4683 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4684 fld_worklist_push (TYPE_SIZE (t), fld);
4685 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4686 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4687 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4688 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4689 fld_worklist_push (TYPE_NAME (t), fld);
4690 fld_worklist_push (TYPE_MINVAL (t), fld);
4691 if (!RECORD_OR_UNION_TYPE_P (t))
4692 fld_worklist_push (TYPE_MAXVAL (t), fld);
4693 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4694 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4695 fld_worklist_push (TYPE_CONTEXT (t), fld);
4696 fld_worklist_push (TYPE_CANONICAL (t), fld);
4698 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4702 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4704 fld_worklist_push (TREE_TYPE (tem), fld);
4705 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4707 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4708 && TREE_CODE (tem) == TREE_LIST)
4711 fld_worklist_push (TREE_VALUE (tem), fld);
4712 tem = TREE_CHAIN (tem);
4716 if (RECORD_OR_UNION_TYPE_P (t))
4719 /* Push all TYPE_FIELDS - there can be interleaving interesting
4720 and non-interesting things. */
4721 tem = TYPE_FIELDS (t);
4724 if (TREE_CODE (tem) == FIELD_DECL)
4725 fld_worklist_push (tem, fld);
4726 tem = TREE_CHAIN (tem);
4730 fld_worklist_push (TREE_CHAIN (t), fld);
4734 fld_worklist_push (TREE_TYPE (t), fld);
4740 /* Find decls and types in T. */
4743 find_decls_types (tree t, struct free_lang_data_d *fld)
4747 if (!pointer_set_contains (fld->pset, t))
4748 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4749 if (VEC_empty (tree, fld->worklist))
4751 t = VEC_pop (tree, fld->worklist);
4755 /* Translate all the types in LIST with the corresponding runtime
4759 get_eh_types_for_runtime (tree list)
4763 if (list == NULL_TREE)
4766 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4768 list = TREE_CHAIN (list);
4771 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4772 TREE_CHAIN (prev) = n;
4773 prev = TREE_CHAIN (prev);
4774 list = TREE_CHAIN (list);
4781 /* Find decls and types referenced in EH region R and store them in
4782 FLD->DECLS and FLD->TYPES. */
4785 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4796 /* The types referenced in each catch must first be changed to the
4797 EH types used at runtime. This removes references to FE types
4799 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4801 c->type_list = get_eh_types_for_runtime (c->type_list);
4802 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4807 case ERT_ALLOWED_EXCEPTIONS:
4808 r->u.allowed.type_list
4809 = get_eh_types_for_runtime (r->u.allowed.type_list);
4810 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4813 case ERT_MUST_NOT_THROW:
4814 walk_tree (&r->u.must_not_throw.failure_decl,
4815 find_decls_types_r, fld, fld->pset);
4821 /* Find decls and types referenced in cgraph node N and store them in
4822 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4823 look for *every* kind of DECL and TYPE node reachable from N,
4824 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4825 NAMESPACE_DECLs, etc). */
4828 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4831 struct function *fn;
4834 find_decls_types (n->decl, fld);
4836 if (!gimple_has_body_p (n->decl))
4839 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4841 fn = DECL_STRUCT_FUNCTION (n->decl);
4843 /* Traverse locals. */
4844 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4845 find_decls_types (TREE_VALUE (t), fld);
4847 /* Traverse EH regions in FN. */
4850 FOR_ALL_EH_REGION_FN (r, fn)
4851 find_decls_types_in_eh_region (r, fld);
4854 /* Traverse every statement in FN. */
4855 FOR_EACH_BB_FN (bb, fn)
4857 gimple_stmt_iterator si;
4860 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4862 gimple phi = gsi_stmt (si);
4864 for (i = 0; i < gimple_phi_num_args (phi); i++)
4866 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4867 find_decls_types (*arg_p, fld);
4871 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4873 gimple stmt = gsi_stmt (si);
4875 for (i = 0; i < gimple_num_ops (stmt); i++)
4877 tree arg = gimple_op (stmt, i);
4878 find_decls_types (arg, fld);
4885 /* Find decls and types referenced in varpool node N and store them in
4886 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4887 look for *every* kind of DECL and TYPE node reachable from N,
4888 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4889 NAMESPACE_DECLs, etc). */
4892 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4894 find_decls_types (v->decl, fld);
4897 /* If T needs an assembler name, have one created for it. */
4900 assign_assembler_name_if_neeeded (tree t)
4902 if (need_assembler_name_p (t))
4904 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4905 diagnostics that use input_location to show locus
4906 information. The problem here is that, at this point,
4907 input_location is generally anchored to the end of the file
4908 (since the parser is long gone), so we don't have a good
4909 position to pin it to.
4911 To alleviate this problem, this uses the location of T's
4912 declaration. Examples of this are
4913 testsuite/g++.dg/template/cond2.C and
4914 testsuite/g++.dg/template/pr35240.C. */
4915 location_t saved_location = input_location;
4916 input_location = DECL_SOURCE_LOCATION (t);
4918 decl_assembler_name (t);
4920 input_location = saved_location;
4925 /* Free language specific information for every operand and expression
4926 in every node of the call graph. This process operates in three stages:
4928 1- Every callgraph node and varpool node is traversed looking for
4929 decls and types embedded in them. This is a more exhaustive
4930 search than that done by find_referenced_vars, because it will
4931 also collect individual fields, decls embedded in types, etc.
4933 2- All the decls found are sent to free_lang_data_in_decl.
4935 3- All the types found are sent to free_lang_data_in_type.
4937 The ordering between decls and types is important because
4938 free_lang_data_in_decl sets assembler names, which includes
4939 mangling. So types cannot be freed up until assembler names have
4943 free_lang_data_in_cgraph (void)
4945 struct cgraph_node *n;
4946 struct varpool_node *v;
4947 struct free_lang_data_d fld;
4952 /* Initialize sets and arrays to store referenced decls and types. */
4953 fld.pset = pointer_set_create ();
4954 fld.worklist = NULL;
4955 fld.decls = VEC_alloc (tree, heap, 100);
4956 fld.types = VEC_alloc (tree, heap, 100);
4958 /* Find decls and types in the body of every function in the callgraph. */
4959 for (n = cgraph_nodes; n; n = n->next)
4960 find_decls_types_in_node (n, &fld);
4962 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4963 find_decls_types (p->decl, &fld);
4965 /* Find decls and types in every varpool symbol. */
4966 for (v = varpool_nodes_queue; v; v = v->next_needed)
4967 find_decls_types_in_var (v, &fld);
4969 /* Set the assembler name on every decl found. We need to do this
4970 now because free_lang_data_in_decl will invalidate data needed
4971 for mangling. This breaks mangling on interdependent decls. */
4972 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4973 assign_assembler_name_if_neeeded (t);
4975 /* Traverse every decl found freeing its language data. */
4976 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4977 free_lang_data_in_decl (t);
4979 /* Traverse every type found freeing its language data. */
4980 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4981 free_lang_data_in_type (t);
4983 pointer_set_destroy (fld.pset);
4984 VEC_free (tree, heap, fld.worklist);
4985 VEC_free (tree, heap, fld.decls);
4986 VEC_free (tree, heap, fld.types);
4990 /* Free resources that are used by FE but are not needed once they are done. */
4993 free_lang_data (void)
4997 /* If we are the LTO frontend we have freed lang-specific data already. */
4999 || !flag_generate_lto)
5002 /* Allocate and assign alias sets to the standard integer types
5003 while the slots are still in the way the frontends generated them. */
5004 for (i = 0; i < itk_none; ++i)
5005 if (integer_types[i])
5006 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5008 /* Traverse the IL resetting language specific information for
5009 operands, expressions, etc. */
5010 free_lang_data_in_cgraph ();
5012 /* Create gimple variants for common types. */
5013 ptrdiff_type_node = integer_type_node;
5014 fileptr_type_node = ptr_type_node;
5015 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
5016 || (TYPE_MODE (boolean_type_node)
5017 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
5018 || TYPE_PRECISION (boolean_type_node) != 1
5019 || !TYPE_UNSIGNED (boolean_type_node))
5021 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5022 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5023 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5024 TYPE_PRECISION (boolean_type_node) = 1;
5025 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5026 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5029 /* Unify char_type_node with its properly signed variant. */
5030 if (TYPE_UNSIGNED (char_type_node))
5031 unsigned_char_type_node = char_type_node;
5033 signed_char_type_node = char_type_node;
5035 /* Reset some langhooks. Do not reset types_compatible_p, it may
5036 still be used indirectly via the get_alias_set langhook. */
5037 lang_hooks.callgraph.analyze_expr = NULL;
5038 lang_hooks.dwarf_name = lhd_dwarf_name;
5039 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5040 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
5041 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
5043 /* Reset diagnostic machinery. */
5044 diagnostic_starter (global_dc) = default_diagnostic_starter;
5045 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5046 diagnostic_format_decoder (global_dc) = default_tree_printer;
5052 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5056 "*free_lang_data", /* name */
5058 free_lang_data, /* execute */
5061 0, /* static_pass_number */
5062 TV_IPA_FREE_LANG_DATA, /* tv_id */
5063 0, /* properties_required */
5064 0, /* properties_provided */
5065 0, /* properties_destroyed */
5066 0, /* todo_flags_start */
5067 TODO_ggc_collect /* todo_flags_finish */
5071 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5074 We try both `text' and `__text__', ATTR may be either one. */
5075 /* ??? It might be a reasonable simplification to require ATTR to be only
5076 `text'. One might then also require attribute lists to be stored in
5077 their canonicalized form. */
5080 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5085 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5088 p = IDENTIFIER_POINTER (ident);
5089 ident_len = IDENTIFIER_LENGTH (ident);
5091 if (ident_len == attr_len
5092 && strcmp (attr, p) == 0)
5095 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5098 gcc_assert (attr[1] == '_');
5099 gcc_assert (attr[attr_len - 2] == '_');
5100 gcc_assert (attr[attr_len - 1] == '_');
5101 if (ident_len == attr_len - 4
5102 && strncmp (attr + 2, p, attr_len - 4) == 0)
5107 if (ident_len == attr_len + 4
5108 && p[0] == '_' && p[1] == '_'
5109 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5110 && strncmp (attr, p + 2, attr_len) == 0)
5117 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5120 We try both `text' and `__text__', ATTR may be either one. */
5123 is_attribute_p (const char *attr, const_tree ident)
5125 return is_attribute_with_length_p (attr, strlen (attr), ident);
5128 /* Given an attribute name and a list of attributes, return a pointer to the
5129 attribute's list element if the attribute is part of the list, or NULL_TREE
5130 if not found. If the attribute appears more than once, this only
5131 returns the first occurrence; the TREE_CHAIN of the return value should
5132 be passed back in if further occurrences are wanted. */
5135 lookup_attribute (const char *attr_name, tree list)
5138 size_t attr_len = strlen (attr_name);
5140 for (l = list; l; l = TREE_CHAIN (l))
5142 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5143 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5149 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5153 remove_attribute (const char *attr_name, tree list)
5156 size_t attr_len = strlen (attr_name);
5158 for (p = &list; *p; )
5161 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5162 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5163 *p = TREE_CHAIN (l);
5165 p = &TREE_CHAIN (l);
5171 /* Return an attribute list that is the union of a1 and a2. */
5174 merge_attributes (tree a1, tree a2)
5178 /* Either one unset? Take the set one. */
5180 if ((attributes = a1) == 0)
5183 /* One that completely contains the other? Take it. */
5185 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5187 if (attribute_list_contained (a2, a1))
5191 /* Pick the longest list, and hang on the other list. */
5193 if (list_length (a1) < list_length (a2))
5194 attributes = a2, a2 = a1;
5196 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5199 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5202 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5205 if (TREE_VALUE (a) != NULL
5206 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5207 && TREE_VALUE (a2) != NULL
5208 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5210 if (simple_cst_list_equal (TREE_VALUE (a),
5211 TREE_VALUE (a2)) == 1)
5214 else if (simple_cst_equal (TREE_VALUE (a),
5215 TREE_VALUE (a2)) == 1)
5220 a1 = copy_node (a2);
5221 TREE_CHAIN (a1) = attributes;
5230 /* Given types T1 and T2, merge their attributes and return
5234 merge_type_attributes (tree t1, tree t2)
5236 return merge_attributes (TYPE_ATTRIBUTES (t1),
5237 TYPE_ATTRIBUTES (t2));
5240 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5244 merge_decl_attributes (tree olddecl, tree newdecl)
5246 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5247 DECL_ATTRIBUTES (newdecl));
5250 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5252 /* Specialization of merge_decl_attributes for various Windows targets.
5254 This handles the following situation:
5256 __declspec (dllimport) int foo;
5259 The second instance of `foo' nullifies the dllimport. */
5262 merge_dllimport_decl_attributes (tree old, tree new_tree)
5265 int delete_dllimport_p = 1;
5267 /* What we need to do here is remove from `old' dllimport if it doesn't
5268 appear in `new'. dllimport behaves like extern: if a declaration is
5269 marked dllimport and a definition appears later, then the object
5270 is not dllimport'd. We also remove a `new' dllimport if the old list
5271 contains dllexport: dllexport always overrides dllimport, regardless
5272 of the order of declaration. */
5273 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5274 delete_dllimport_p = 0;
5275 else if (DECL_DLLIMPORT_P (new_tree)
5276 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5278 DECL_DLLIMPORT_P (new_tree) = 0;
5279 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5280 "dllimport ignored", new_tree);
5282 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5284 /* Warn about overriding a symbol that has already been used, e.g.:
5285 extern int __attribute__ ((dllimport)) foo;
5286 int* bar () {return &foo;}
5289 if (TREE_USED (old))
5291 warning (0, "%q+D redeclared without dllimport attribute "
5292 "after being referenced with dll linkage", new_tree);
5293 /* If we have used a variable's address with dllimport linkage,
5294 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5295 decl may already have had TREE_CONSTANT computed.
5296 We still remove the attribute so that assembler code refers
5297 to '&foo rather than '_imp__foo'. */
5298 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5299 DECL_DLLIMPORT_P (new_tree) = 1;
5302 /* Let an inline definition silently override the external reference,
5303 but otherwise warn about attribute inconsistency. */
5304 else if (TREE_CODE (new_tree) == VAR_DECL
5305 || !DECL_DECLARED_INLINE_P (new_tree))
5306 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5307 "previous dllimport ignored", new_tree);
5310 delete_dllimport_p = 0;
5312 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5314 if (delete_dllimport_p)
5317 const size_t attr_len = strlen ("dllimport");
5319 /* Scan the list for dllimport and delete it. */
5320 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5322 if (is_attribute_with_length_p ("dllimport", attr_len,
5325 if (prev == NULL_TREE)
5328 TREE_CHAIN (prev) = TREE_CHAIN (t);
5337 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5338 struct attribute_spec.handler. */
5341 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5347 /* These attributes may apply to structure and union types being created,
5348 but otherwise should pass to the declaration involved. */
5351 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5352 | (int) ATTR_FLAG_ARRAY_NEXT))
5354 *no_add_attrs = true;
5355 return tree_cons (name, args, NULL_TREE);
5357 if (TREE_CODE (node) == RECORD_TYPE
5358 || TREE_CODE (node) == UNION_TYPE)
5360 node = TYPE_NAME (node);
5366 warning (OPT_Wattributes, "%qE attribute ignored",
5368 *no_add_attrs = true;
5373 if (TREE_CODE (node) != FUNCTION_DECL
5374 && TREE_CODE (node) != VAR_DECL
5375 && TREE_CODE (node) != TYPE_DECL)
5377 *no_add_attrs = true;
5378 warning (OPT_Wattributes, "%qE attribute ignored",
5383 if (TREE_CODE (node) == TYPE_DECL
5384 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5385 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5387 *no_add_attrs = true;
5388 warning (OPT_Wattributes, "%qE attribute ignored",
5393 is_dllimport = is_attribute_p ("dllimport", name);
5395 /* Report error on dllimport ambiguities seen now before they cause
5399 /* Honor any target-specific overrides. */
5400 if (!targetm.valid_dllimport_attribute_p (node))
5401 *no_add_attrs = true;
5403 else if (TREE_CODE (node) == FUNCTION_DECL
5404 && DECL_DECLARED_INLINE_P (node))
5406 warning (OPT_Wattributes, "inline function %q+D declared as "
5407 " dllimport: attribute ignored", node);
5408 *no_add_attrs = true;
5410 /* Like MS, treat definition of dllimported variables and
5411 non-inlined functions on declaration as syntax errors. */
5412 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5414 error ("function %q+D definition is marked dllimport", node);
5415 *no_add_attrs = true;
5418 else if (TREE_CODE (node) == VAR_DECL)
5420 if (DECL_INITIAL (node))
5422 error ("variable %q+D definition is marked dllimport",
5424 *no_add_attrs = true;
5427 /* `extern' needn't be specified with dllimport.
5428 Specify `extern' now and hope for the best. Sigh. */
5429 DECL_EXTERNAL (node) = 1;
5430 /* Also, implicitly give dllimport'd variables declared within
5431 a function global scope, unless declared static. */
5432 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5433 TREE_PUBLIC (node) = 1;
5436 if (*no_add_attrs == false)
5437 DECL_DLLIMPORT_P (node) = 1;
5439 else if (TREE_CODE (node) == FUNCTION_DECL
5440 && DECL_DECLARED_INLINE_P (node))
5441 /* An exported function, even if inline, must be emitted. */
5442 DECL_EXTERNAL (node) = 0;
5444 /* Report error if symbol is not accessible at global scope. */
5445 if (!TREE_PUBLIC (node)
5446 && (TREE_CODE (node) == VAR_DECL
5447 || TREE_CODE (node) == FUNCTION_DECL))
5449 error ("external linkage required for symbol %q+D because of "
5450 "%qE attribute", node, name);
5451 *no_add_attrs = true;
5454 /* A dllexport'd entity must have default visibility so that other
5455 program units (shared libraries or the main executable) can see
5456 it. A dllimport'd entity must have default visibility so that
5457 the linker knows that undefined references within this program
5458 unit can be resolved by the dynamic linker. */
5461 if (DECL_VISIBILITY_SPECIFIED (node)
5462 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5463 error ("%qE implies default visibility, but %qD has already "
5464 "been declared with a different visibility",
5466 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5467 DECL_VISIBILITY_SPECIFIED (node) = 1;
5473 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5475 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5476 of the various TYPE_QUAL values. */
5479 set_type_quals (tree type, int type_quals)
5481 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5482 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5483 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5484 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5487 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5490 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5492 return (TYPE_QUALS (cand) == type_quals
5493 && TYPE_NAME (cand) == TYPE_NAME (base)
5494 /* Apparently this is needed for Objective-C. */
5495 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5496 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5497 TYPE_ATTRIBUTES (base)));
5500 /* Return a version of the TYPE, qualified as indicated by the
5501 TYPE_QUALS, if one exists. If no qualified version exists yet,
5502 return NULL_TREE. */
5505 get_qualified_type (tree type, int type_quals)
5509 if (TYPE_QUALS (type) == type_quals)
5512 /* Search the chain of variants to see if there is already one there just
5513 like the one we need to have. If so, use that existing one. We must
5514 preserve the TYPE_NAME, since there is code that depends on this. */
5515 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5516 if (check_qualified_type (t, type, type_quals))
5522 /* Like get_qualified_type, but creates the type if it does not
5523 exist. This function never returns NULL_TREE. */
5526 build_qualified_type (tree type, int type_quals)
5530 /* See if we already have the appropriate qualified variant. */
5531 t = get_qualified_type (type, type_quals);
5533 /* If not, build it. */
5536 t = build_variant_type_copy (type);
5537 set_type_quals (t, type_quals);
5539 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5540 /* Propagate structural equality. */
5541 SET_TYPE_STRUCTURAL_EQUALITY (t);
5542 else if (TYPE_CANONICAL (type) != type)
5543 /* Build the underlying canonical type, since it is different
5545 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5548 /* T is its own canonical type. */
5549 TYPE_CANONICAL (t) = t;
5556 /* Create a new distinct copy of TYPE. The new type is made its own
5557 MAIN_VARIANT. If TYPE requires structural equality checks, the
5558 resulting type requires structural equality checks; otherwise, its
5559 TYPE_CANONICAL points to itself. */
5562 build_distinct_type_copy (tree type)
5564 tree t = copy_node (type);
5566 TYPE_POINTER_TO (t) = 0;
5567 TYPE_REFERENCE_TO (t) = 0;
5569 /* Set the canonical type either to a new equivalence class, or
5570 propagate the need for structural equality checks. */
5571 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5572 SET_TYPE_STRUCTURAL_EQUALITY (t);
5574 TYPE_CANONICAL (t) = t;
5576 /* Make it its own variant. */
5577 TYPE_MAIN_VARIANT (t) = t;
5578 TYPE_NEXT_VARIANT (t) = 0;
5580 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5581 whose TREE_TYPE is not t. This can also happen in the Ada
5582 frontend when using subtypes. */
5587 /* Create a new variant of TYPE, equivalent but distinct. This is so
5588 the caller can modify it. TYPE_CANONICAL for the return type will
5589 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5590 are considered equal by the language itself (or that both types
5591 require structural equality checks). */
5594 build_variant_type_copy (tree type)
5596 tree t, m = TYPE_MAIN_VARIANT (type);
5598 t = build_distinct_type_copy (type);
5600 /* Since we're building a variant, assume that it is a non-semantic
5601 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5602 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5604 /* Add the new type to the chain of variants of TYPE. */
5605 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5606 TYPE_NEXT_VARIANT (m) = t;
5607 TYPE_MAIN_VARIANT (t) = m;
5612 /* Return true if the from tree in both tree maps are equal. */
5615 tree_map_base_eq (const void *va, const void *vb)
5617 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5618 *const b = (const struct tree_map_base *) vb;
5619 return (a->from == b->from);
5622 /* Hash a from tree in a tree_map. */
5625 tree_map_base_hash (const void *item)
5627 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5630 /* Return true if this tree map structure is marked for garbage collection
5631 purposes. We simply return true if the from tree is marked, so that this
5632 structure goes away when the from tree goes away. */
5635 tree_map_base_marked_p (const void *p)
5637 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5641 tree_map_hash (const void *item)
5643 return (((const struct tree_map *) item)->hash);
5646 /* Return the initialization priority for DECL. */
5649 decl_init_priority_lookup (tree decl)
5651 struct tree_priority_map *h;
5652 struct tree_map_base in;
5654 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5656 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5657 return h ? h->init : DEFAULT_INIT_PRIORITY;
5660 /* Return the finalization priority for DECL. */
5663 decl_fini_priority_lookup (tree decl)
5665 struct tree_priority_map *h;
5666 struct tree_map_base in;
5668 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5670 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5671 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5674 /* Return the initialization and finalization priority information for
5675 DECL. If there is no previous priority information, a freshly
5676 allocated structure is returned. */
5678 static struct tree_priority_map *
5679 decl_priority_info (tree decl)
5681 struct tree_priority_map in;
5682 struct tree_priority_map *h;
5685 in.base.from = decl;
5686 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5687 h = (struct tree_priority_map *) *loc;
5690 h = GGC_CNEW (struct tree_priority_map);
5692 h->base.from = decl;
5693 h->init = DEFAULT_INIT_PRIORITY;
5694 h->fini = DEFAULT_INIT_PRIORITY;
5700 /* Set the initialization priority for DECL to PRIORITY. */
5703 decl_init_priority_insert (tree decl, priority_type priority)
5705 struct tree_priority_map *h;
5707 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5708 h = decl_priority_info (decl);
5712 /* Set the finalization priority for DECL to PRIORITY. */
5715 decl_fini_priority_insert (tree decl, priority_type priority)
5717 struct tree_priority_map *h;
5719 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5720 h = decl_priority_info (decl);
5724 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5727 print_debug_expr_statistics (void)
5729 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5730 (long) htab_size (debug_expr_for_decl),
5731 (long) htab_elements (debug_expr_for_decl),
5732 htab_collisions (debug_expr_for_decl));
5735 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5738 print_value_expr_statistics (void)
5740 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5741 (long) htab_size (value_expr_for_decl),
5742 (long) htab_elements (value_expr_for_decl),
5743 htab_collisions (value_expr_for_decl));
5746 /* Lookup a debug expression for FROM, and return it if we find one. */
5749 decl_debug_expr_lookup (tree from)
5751 struct tree_map *h, in;
5752 in.base.from = from;
5754 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5755 htab_hash_pointer (from));
5761 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5764 decl_debug_expr_insert (tree from, tree to)
5769 h = GGC_NEW (struct tree_map);
5770 h->hash = htab_hash_pointer (from);
5771 h->base.from = from;
5773 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5774 *(struct tree_map **) loc = h;
5777 /* Lookup a value expression for FROM, and return it if we find one. */
5780 decl_value_expr_lookup (tree from)
5782 struct tree_map *h, in;
5783 in.base.from = from;
5785 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5786 htab_hash_pointer (from));
5792 /* Insert a mapping FROM->TO in the value expression hashtable. */
5795 decl_value_expr_insert (tree from, tree to)
5800 h = GGC_NEW (struct tree_map);
5801 h->hash = htab_hash_pointer (from);
5802 h->base.from = from;
5804 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5805 *(struct tree_map **) loc = h;
5808 /* Hashing of types so that we don't make duplicates.
5809 The entry point is `type_hash_canon'. */
5811 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5812 with types in the TREE_VALUE slots), by adding the hash codes
5813 of the individual types. */
5816 type_hash_list (const_tree list, hashval_t hashcode)
5820 for (tail = list; tail; tail = TREE_CHAIN (tail))
5821 if (TREE_VALUE (tail) != error_mark_node)
5822 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5828 /* These are the Hashtable callback functions. */
5830 /* Returns true iff the types are equivalent. */
5833 type_hash_eq (const void *va, const void *vb)
5835 const struct type_hash *const a = (const struct type_hash *) va,
5836 *const b = (const struct type_hash *) vb;
5838 /* First test the things that are the same for all types. */
5839 if (a->hash != b->hash
5840 || TREE_CODE (a->type) != TREE_CODE (b->type)
5841 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5842 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5843 TYPE_ATTRIBUTES (b->type))
5844 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5845 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5846 || (TREE_CODE (a->type) != COMPLEX_TYPE
5847 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5850 switch (TREE_CODE (a->type))
5855 case REFERENCE_TYPE:
5859 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5862 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5863 && !(TYPE_VALUES (a->type)
5864 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5865 && TYPE_VALUES (b->type)
5866 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5867 && type_list_equal (TYPE_VALUES (a->type),
5868 TYPE_VALUES (b->type))))
5871 /* ... fall through ... */
5876 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5877 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5878 TYPE_MAX_VALUE (b->type)))
5879 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5880 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5881 TYPE_MIN_VALUE (b->type))));
5883 case FIXED_POINT_TYPE:
5884 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5887 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5890 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5891 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5892 || (TYPE_ARG_TYPES (a->type)
5893 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5894 && TYPE_ARG_TYPES (b->type)
5895 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5896 && type_list_equal (TYPE_ARG_TYPES (a->type),
5897 TYPE_ARG_TYPES (b->type)))));
5900 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5904 case QUAL_UNION_TYPE:
5905 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5906 || (TYPE_FIELDS (a->type)
5907 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5908 && TYPE_FIELDS (b->type)
5909 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5910 && type_list_equal (TYPE_FIELDS (a->type),
5911 TYPE_FIELDS (b->type))));
5914 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5915 || (TYPE_ARG_TYPES (a->type)
5916 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5917 && TYPE_ARG_TYPES (b->type)
5918 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5919 && type_list_equal (TYPE_ARG_TYPES (a->type),
5920 TYPE_ARG_TYPES (b->type))))
5928 if (lang_hooks.types.type_hash_eq != NULL)
5929 return lang_hooks.types.type_hash_eq (a->type, b->type);
5934 /* Return the cached hash value. */
5937 type_hash_hash (const void *item)
5939 return ((const struct type_hash *) item)->hash;
5942 /* Look in the type hash table for a type isomorphic to TYPE.
5943 If one is found, return it. Otherwise return 0. */
5946 type_hash_lookup (hashval_t hashcode, tree type)
5948 struct type_hash *h, in;
5950 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5951 must call that routine before comparing TYPE_ALIGNs. */
5957 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5964 /* Add an entry to the type-hash-table
5965 for a type TYPE whose hash code is HASHCODE. */
5968 type_hash_add (hashval_t hashcode, tree type)
5970 struct type_hash *h;
5973 h = GGC_NEW (struct type_hash);
5976 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5980 /* Given TYPE, and HASHCODE its hash code, return the canonical
5981 object for an identical type if one already exists.
5982 Otherwise, return TYPE, and record it as the canonical object.
5984 To use this function, first create a type of the sort you want.
5985 Then compute its hash code from the fields of the type that
5986 make it different from other similar types.
5987 Then call this function and use the value. */
5990 type_hash_canon (unsigned int hashcode, tree type)
5994 /* The hash table only contains main variants, so ensure that's what we're
5996 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5998 if (!lang_hooks.types.hash_types)
6001 /* See if the type is in the hash table already. If so, return it.
6002 Otherwise, add the type. */
6003 t1 = type_hash_lookup (hashcode, type);
6006 #ifdef GATHER_STATISTICS
6007 tree_node_counts[(int) t_kind]--;
6008 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
6014 type_hash_add (hashcode, type);
6019 /* See if the data pointed to by the type hash table is marked. We consider
6020 it marked if the type is marked or if a debug type number or symbol
6021 table entry has been made for the type. This reduces the amount of
6022 debugging output and eliminates that dependency of the debug output on
6023 the number of garbage collections. */
6026 type_hash_marked_p (const void *p)
6028 const_tree const type = ((const struct type_hash *) p)->type;
6030 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
6034 print_type_hash_statistics (void)
6036 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6037 (long) htab_size (type_hash_table),
6038 (long) htab_elements (type_hash_table),
6039 htab_collisions (type_hash_table));
6042 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6043 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6044 by adding the hash codes of the individual attributes. */
6047 attribute_hash_list (const_tree list, hashval_t hashcode)
6051 for (tail = list; tail; tail = TREE_CHAIN (tail))
6052 /* ??? Do we want to add in TREE_VALUE too? */
6053 hashcode = iterative_hash_object
6054 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6058 /* Given two lists of attributes, return true if list l2 is
6059 equivalent to l1. */
6062 attribute_list_equal (const_tree l1, const_tree l2)
6064 return attribute_list_contained (l1, l2)
6065 && attribute_list_contained (l2, l1);
6068 /* Given two lists of attributes, return true if list L2 is
6069 completely contained within L1. */
6070 /* ??? This would be faster if attribute names were stored in a canonicalized
6071 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6072 must be used to show these elements are equivalent (which they are). */
6073 /* ??? It's not clear that attributes with arguments will always be handled
6077 attribute_list_contained (const_tree l1, const_tree l2)
6081 /* First check the obvious, maybe the lists are identical. */
6085 /* Maybe the lists are similar. */
6086 for (t1 = l1, t2 = l2;
6088 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6089 && TREE_VALUE (t1) == TREE_VALUE (t2);
6090 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6092 /* Maybe the lists are equal. */
6093 if (t1 == 0 && t2 == 0)
6096 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6099 /* This CONST_CAST is okay because lookup_attribute does not
6100 modify its argument and the return value is assigned to a
6102 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6103 CONST_CAST_TREE(l1));
6105 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6108 if (TREE_VALUE (t2) != NULL
6109 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6110 && TREE_VALUE (attr) != NULL
6111 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6113 if (simple_cst_list_equal (TREE_VALUE (t2),
6114 TREE_VALUE (attr)) == 1)
6117 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6128 /* Given two lists of types
6129 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6130 return 1 if the lists contain the same types in the same order.
6131 Also, the TREE_PURPOSEs must match. */
6134 type_list_equal (const_tree l1, const_tree l2)
6138 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6139 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6140 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6141 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6142 && (TREE_TYPE (TREE_PURPOSE (t1))
6143 == TREE_TYPE (TREE_PURPOSE (t2))))))
6149 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6150 given by TYPE. If the argument list accepts variable arguments,
6151 then this function counts only the ordinary arguments. */
6154 type_num_arguments (const_tree type)
6159 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6160 /* If the function does not take a variable number of arguments,
6161 the last element in the list will have type `void'. */
6162 if (VOID_TYPE_P (TREE_VALUE (t)))
6170 /* Nonzero if integer constants T1 and T2
6171 represent the same constant value. */
6174 tree_int_cst_equal (const_tree t1, const_tree t2)
6179 if (t1 == 0 || t2 == 0)
6182 if (TREE_CODE (t1) == INTEGER_CST
6183 && TREE_CODE (t2) == INTEGER_CST
6184 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6185 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6191 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6192 The precise way of comparison depends on their data type. */
6195 tree_int_cst_lt (const_tree t1, const_tree t2)
6200 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6202 int t1_sgn = tree_int_cst_sgn (t1);
6203 int t2_sgn = tree_int_cst_sgn (t2);
6205 if (t1_sgn < t2_sgn)
6207 else if (t1_sgn > t2_sgn)
6209 /* Otherwise, both are non-negative, so we compare them as
6210 unsigned just in case one of them would overflow a signed
6213 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6214 return INT_CST_LT (t1, t2);
6216 return INT_CST_LT_UNSIGNED (t1, t2);
6219 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6222 tree_int_cst_compare (const_tree t1, const_tree t2)
6224 if (tree_int_cst_lt (t1, t2))
6226 else if (tree_int_cst_lt (t2, t1))
6232 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6233 the host. If POS is zero, the value can be represented in a single
6234 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6235 be represented in a single unsigned HOST_WIDE_INT. */
6238 host_integerp (const_tree t, int pos)
6243 return (TREE_CODE (t) == INTEGER_CST
6244 && ((TREE_INT_CST_HIGH (t) == 0
6245 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6246 || (! pos && TREE_INT_CST_HIGH (t) == -1
6247 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6248 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6249 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6250 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6251 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6254 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6255 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6256 be non-negative. We must be able to satisfy the above conditions. */
6259 tree_low_cst (const_tree t, int pos)
6261 gcc_assert (host_integerp (t, pos));
6262 return TREE_INT_CST_LOW (t);
6265 /* Return the most significant bit of the integer constant T. */
6268 tree_int_cst_msb (const_tree t)
6272 unsigned HOST_WIDE_INT l;
6274 /* Note that using TYPE_PRECISION here is wrong. We care about the
6275 actual bits, not the (arbitrary) range of the type. */
6276 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6277 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6278 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6279 return (l & 1) == 1;
6282 /* Return an indication of the sign of the integer constant T.
6283 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6284 Note that -1 will never be returned if T's type is unsigned. */
6287 tree_int_cst_sgn (const_tree t)
6289 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6291 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6293 else if (TREE_INT_CST_HIGH (t) < 0)
6299 /* Return the minimum number of bits needed to represent VALUE in a
6300 signed or unsigned type, UNSIGNEDP says which. */
6303 tree_int_cst_min_precision (tree value, bool unsignedp)
6307 /* If the value is negative, compute its negative minus 1. The latter
6308 adjustment is because the absolute value of the largest negative value
6309 is one larger than the largest positive value. This is equivalent to
6310 a bit-wise negation, so use that operation instead. */
6312 if (tree_int_cst_sgn (value) < 0)
6313 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6315 /* Return the number of bits needed, taking into account the fact
6316 that we need one more bit for a signed than unsigned type. */
6318 if (integer_zerop (value))
6321 log = tree_floor_log2 (value);
6323 return log + 1 + !unsignedp;
6326 /* Compare two constructor-element-type constants. Return 1 if the lists
6327 are known to be equal; otherwise return 0. */
6330 simple_cst_list_equal (const_tree l1, const_tree l2)
6332 while (l1 != NULL_TREE && l2 != NULL_TREE)
6334 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6337 l1 = TREE_CHAIN (l1);
6338 l2 = TREE_CHAIN (l2);
6344 /* Return truthvalue of whether T1 is the same tree structure as T2.
6345 Return 1 if they are the same.
6346 Return 0 if they are understandably different.
6347 Return -1 if either contains tree structure not understood by
6351 simple_cst_equal (const_tree t1, const_tree t2)
6353 enum tree_code code1, code2;
6359 if (t1 == 0 || t2 == 0)
6362 code1 = TREE_CODE (t1);
6363 code2 = TREE_CODE (t2);
6365 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6367 if (CONVERT_EXPR_CODE_P (code2)
6368 || code2 == NON_LVALUE_EXPR)
6369 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6371 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6374 else if (CONVERT_EXPR_CODE_P (code2)
6375 || code2 == NON_LVALUE_EXPR)
6376 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6384 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6385 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6388 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6391 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6394 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6395 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6396 TREE_STRING_LENGTH (t1)));
6400 unsigned HOST_WIDE_INT idx;
6401 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6402 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6404 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6407 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6408 /* ??? Should we handle also fields here? */
6409 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6410 VEC_index (constructor_elt, v2, idx)->value))
6416 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6419 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6422 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6425 const_tree arg1, arg2;
6426 const_call_expr_arg_iterator iter1, iter2;
6427 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6428 arg2 = first_const_call_expr_arg (t2, &iter2);
6430 arg1 = next_const_call_expr_arg (&iter1),
6431 arg2 = next_const_call_expr_arg (&iter2))
6433 cmp = simple_cst_equal (arg1, arg2);
6437 return arg1 == arg2;
6441 /* Special case: if either target is an unallocated VAR_DECL,
6442 it means that it's going to be unified with whatever the
6443 TARGET_EXPR is really supposed to initialize, so treat it
6444 as being equivalent to anything. */
6445 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6446 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6447 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6448 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6449 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6450 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6453 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6458 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6460 case WITH_CLEANUP_EXPR:
6461 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6465 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6468 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6469 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6483 /* This general rule works for most tree codes. All exceptions should be
6484 handled above. If this is a language-specific tree code, we can't
6485 trust what might be in the operand, so say we don't know
6487 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6490 switch (TREE_CODE_CLASS (code1))
6494 case tcc_comparison:
6495 case tcc_expression:
6499 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6501 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6513 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6514 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6515 than U, respectively. */
6518 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6520 if (tree_int_cst_sgn (t) < 0)
6522 else if (TREE_INT_CST_HIGH (t) != 0)
6524 else if (TREE_INT_CST_LOW (t) == u)
6526 else if (TREE_INT_CST_LOW (t) < u)
6532 /* Return true if CODE represents an associative tree code. Otherwise
6535 associative_tree_code (enum tree_code code)
6554 /* Return true if CODE represents a commutative tree code. Otherwise
6557 commutative_tree_code (enum tree_code code)
6570 case UNORDERED_EXPR:
6574 case TRUTH_AND_EXPR:
6575 case TRUTH_XOR_EXPR:
6585 /* Generate a hash value for an expression. This can be used iteratively
6586 by passing a previous result as the VAL argument.
6588 This function is intended to produce the same hash for expressions which
6589 would compare equal using operand_equal_p. */
6592 iterative_hash_expr (const_tree t, hashval_t val)
6595 enum tree_code code;
6599 return iterative_hash_hashval_t (0, val);
6601 code = TREE_CODE (t);
6605 /* Alas, constants aren't shared, so we can't rely on pointer
6608 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6609 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6612 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6614 return iterative_hash_hashval_t (val2, val);
6618 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6620 return iterative_hash_hashval_t (val2, val);
6623 return iterative_hash (TREE_STRING_POINTER (t),
6624 TREE_STRING_LENGTH (t), val);
6626 val = iterative_hash_expr (TREE_REALPART (t), val);
6627 return iterative_hash_expr (TREE_IMAGPART (t), val);
6629 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6631 /* We can just compare by pointer. */
6632 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6633 case PLACEHOLDER_EXPR:
6634 /* The node itself doesn't matter. */
6637 /* A list of expressions, for a CALL_EXPR or as the elements of a
6639 for (; t; t = TREE_CHAIN (t))
6640 val = iterative_hash_expr (TREE_VALUE (t), val);
6644 unsigned HOST_WIDE_INT idx;
6646 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6648 val = iterative_hash_expr (field, val);
6649 val = iterative_hash_expr (value, val);
6654 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6655 Otherwise nodes that compare equal according to operand_equal_p might
6656 get different hash codes. However, don't do this for machine specific
6657 or front end builtins, since the function code is overloaded in those
6659 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6660 && built_in_decls[DECL_FUNCTION_CODE (t)])
6662 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6663 code = TREE_CODE (t);
6667 tclass = TREE_CODE_CLASS (code);
6669 if (tclass == tcc_declaration)
6671 /* DECL's have a unique ID */
6672 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6676 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6678 val = iterative_hash_object (code, val);
6680 /* Don't hash the type, that can lead to having nodes which
6681 compare equal according to operand_equal_p, but which
6682 have different hash codes. */
6683 if (CONVERT_EXPR_CODE_P (code)
6684 || code == NON_LVALUE_EXPR)
6686 /* Make sure to include signness in the hash computation. */
6687 val += TYPE_UNSIGNED (TREE_TYPE (t));
6688 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6691 else if (commutative_tree_code (code))
6693 /* It's a commutative expression. We want to hash it the same
6694 however it appears. We do this by first hashing both operands
6695 and then rehashing based on the order of their independent
6697 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6698 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6702 t = one, one = two, two = t;
6704 val = iterative_hash_hashval_t (one, val);
6705 val = iterative_hash_hashval_t (two, val);
6708 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6709 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6716 /* Generate a hash value for a pair of expressions. This can be used
6717 iteratively by passing a previous result as the VAL argument.
6719 The same hash value is always returned for a given pair of expressions,
6720 regardless of the order in which they are presented. This is useful in
6721 hashing the operands of commutative functions. */
6724 iterative_hash_exprs_commutative (const_tree t1,
6725 const_tree t2, hashval_t val)
6727 hashval_t one = iterative_hash_expr (t1, 0);
6728 hashval_t two = iterative_hash_expr (t2, 0);
6732 t = one, one = two, two = t;
6733 val = iterative_hash_hashval_t (one, val);
6734 val = iterative_hash_hashval_t (two, val);
6739 /* Constructors for pointer, array and function types.
6740 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6741 constructed by language-dependent code, not here.) */
6743 /* Construct, lay out and return the type of pointers to TO_TYPE with
6744 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6745 reference all of memory. If such a type has already been
6746 constructed, reuse it. */
6749 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6754 if (to_type == error_mark_node)
6755 return error_mark_node;
6757 /* If the pointed-to type has the may_alias attribute set, force
6758 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6759 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6760 can_alias_all = true;
6762 /* In some cases, languages will have things that aren't a POINTER_TYPE
6763 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6764 In that case, return that type without regard to the rest of our
6767 ??? This is a kludge, but consistent with the way this function has
6768 always operated and there doesn't seem to be a good way to avoid this
6770 if (TYPE_POINTER_TO (to_type) != 0
6771 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6772 return TYPE_POINTER_TO (to_type);
6774 /* First, if we already have a type for pointers to TO_TYPE and it's
6775 the proper mode, use it. */
6776 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6777 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6780 t = make_node (POINTER_TYPE);
6782 TREE_TYPE (t) = to_type;
6783 SET_TYPE_MODE (t, mode);
6784 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6785 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6786 TYPE_POINTER_TO (to_type) = t;
6788 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6789 SET_TYPE_STRUCTURAL_EQUALITY (t);
6790 else if (TYPE_CANONICAL (to_type) != to_type)
6792 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6793 mode, can_alias_all);
6795 /* Lay out the type. This function has many callers that are concerned
6796 with expression-construction, and this simplifies them all. */
6802 /* By default build pointers in ptr_mode. */
6805 build_pointer_type (tree to_type)
6807 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6808 : TYPE_ADDR_SPACE (to_type);
6809 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6810 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6813 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6816 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6821 if (to_type == error_mark_node)
6822 return error_mark_node;
6824 /* If the pointed-to type has the may_alias attribute set, force
6825 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6826 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6827 can_alias_all = true;
6829 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6830 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6831 In that case, return that type without regard to the rest of our
6834 ??? This is a kludge, but consistent with the way this function has
6835 always operated and there doesn't seem to be a good way to avoid this
6837 if (TYPE_REFERENCE_TO (to_type) != 0
6838 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6839 return TYPE_REFERENCE_TO (to_type);
6841 /* First, if we already have a type for pointers to TO_TYPE and it's
6842 the proper mode, use it. */
6843 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6844 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6847 t = make_node (REFERENCE_TYPE);
6849 TREE_TYPE (t) = to_type;
6850 SET_TYPE_MODE (t, mode);
6851 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6852 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6853 TYPE_REFERENCE_TO (to_type) = t;
6855 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6856 SET_TYPE_STRUCTURAL_EQUALITY (t);
6857 else if (TYPE_CANONICAL (to_type) != to_type)
6859 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6860 mode, can_alias_all);
6868 /* Build the node for the type of references-to-TO_TYPE by default
6872 build_reference_type (tree to_type)
6874 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6875 : TYPE_ADDR_SPACE (to_type);
6876 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6877 return build_reference_type_for_mode (to_type, pointer_mode, false);
6880 /* Build a type that is compatible with t but has no cv quals anywhere
6883 const char *const *const * -> char ***. */
6886 build_type_no_quals (tree t)
6888 switch (TREE_CODE (t))
6891 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6893 TYPE_REF_CAN_ALIAS_ALL (t));
6894 case REFERENCE_TYPE:
6896 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6898 TYPE_REF_CAN_ALIAS_ALL (t));
6900 return TYPE_MAIN_VARIANT (t);
6904 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6905 MAXVAL should be the maximum value in the domain
6906 (one less than the length of the array).
6908 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6909 We don't enforce this limit, that is up to caller (e.g. language front end).
6910 The limit exists because the result is a signed type and we don't handle
6911 sizes that use more than one HOST_WIDE_INT. */
6914 build_index_type (tree maxval)
6916 tree itype = make_node (INTEGER_TYPE);
6918 TREE_TYPE (itype) = sizetype;
6919 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6920 TYPE_MIN_VALUE (itype) = size_zero_node;
6921 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6922 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6923 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6924 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6925 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6926 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6928 if (host_integerp (maxval, 1))
6929 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6932 /* Since we cannot hash this type, we need to compare it using
6933 structural equality checks. */
6934 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6939 #define MAX_INT_CACHED_PREC \
6940 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6941 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
6943 /* Builds a signed or unsigned integer type of precision PRECISION.
6944 Used for C bitfields whose precision does not match that of
6945 built-in target types. */
6947 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6953 unsignedp = MAX_INT_CACHED_PREC + 1;
6955 if (precision <= MAX_INT_CACHED_PREC)
6957 itype = nonstandard_integer_type_cache[precision + unsignedp];
6962 itype = make_node (INTEGER_TYPE);
6963 TYPE_PRECISION (itype) = precision;
6966 fixup_unsigned_type (itype);
6968 fixup_signed_type (itype);
6971 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6972 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6973 if (precision <= MAX_INT_CACHED_PREC && lang_hooks.types.hash_types)
6974 nonstandard_integer_type_cache[precision + unsignedp] = ret;
6979 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6980 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6981 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6984 build_range_type (tree type, tree lowval, tree highval)
6986 tree itype = make_node (INTEGER_TYPE);
6988 TREE_TYPE (itype) = type;
6989 if (type == NULL_TREE)
6992 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6993 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6995 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6996 SET_TYPE_MODE (itype, TYPE_MODE (type));
6997 TYPE_SIZE (itype) = TYPE_SIZE (type);
6998 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6999 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7000 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7002 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
7003 return type_hash_canon (tree_low_cst (highval, 0)
7004 - tree_low_cst (lowval, 0),
7010 /* Return true if the debug information for TYPE, a subtype, should be emitted
7011 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7012 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7013 debug info and doesn't reflect the source code. */
7016 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7018 tree base_type = TREE_TYPE (type), low, high;
7020 /* Subrange types have a base type which is an integral type. */
7021 if (!INTEGRAL_TYPE_P (base_type))
7024 /* Get the real bounds of the subtype. */
7025 if (lang_hooks.types.get_subrange_bounds)
7026 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7029 low = TYPE_MIN_VALUE (type);
7030 high = TYPE_MAX_VALUE (type);
7033 /* If the type and its base type have the same representation and the same
7034 name, then the type is not a subrange but a copy of the base type. */
7035 if ((TREE_CODE (base_type) == INTEGER_TYPE
7036 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7037 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7038 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7039 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7041 tree type_name = TYPE_NAME (type);
7042 tree base_type_name = TYPE_NAME (base_type);
7044 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7045 type_name = DECL_NAME (type_name);
7047 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7048 base_type_name = DECL_NAME (base_type_name);
7050 if (type_name == base_type_name)
7061 /* Just like build_index_type, but takes lowval and highval instead
7062 of just highval (maxval). */
7065 build_index_2_type (tree lowval, tree highval)
7067 return build_range_type (sizetype, lowval, highval);
7070 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7071 and number of elements specified by the range of values of INDEX_TYPE.
7072 If such a type has already been constructed, reuse it. */
7075 build_array_type (tree elt_type, tree index_type)
7078 hashval_t hashcode = 0;
7080 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7082 error ("arrays of functions are not meaningful");
7083 elt_type = integer_type_node;
7086 t = make_node (ARRAY_TYPE);
7087 TREE_TYPE (t) = elt_type;
7088 TYPE_DOMAIN (t) = index_type;
7089 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7092 /* If the element type is incomplete at this point we get marked for
7093 structural equality. Do not record these types in the canonical
7095 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7098 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7100 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7101 t = type_hash_canon (hashcode, t);
7103 if (TYPE_CANONICAL (t) == t)
7105 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7106 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7107 SET_TYPE_STRUCTURAL_EQUALITY (t);
7108 else if (TYPE_CANONICAL (elt_type) != elt_type
7109 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7111 = build_array_type (TYPE_CANONICAL (elt_type),
7112 index_type ? TYPE_CANONICAL (index_type) : NULL);
7118 /* Recursively examines the array elements of TYPE, until a non-array
7119 element type is found. */
7122 strip_array_types (tree type)
7124 while (TREE_CODE (type) == ARRAY_TYPE)
7125 type = TREE_TYPE (type);
7130 /* Computes the canonical argument types from the argument type list
7133 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7134 on entry to this function, or if any of the ARGTYPES are
7137 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7138 true on entry to this function, or if any of the ARGTYPES are
7141 Returns a canonical argument list, which may be ARGTYPES when the
7142 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7143 true) or would not differ from ARGTYPES. */
7146 maybe_canonicalize_argtypes(tree argtypes,
7147 bool *any_structural_p,
7148 bool *any_noncanonical_p)
7151 bool any_noncanonical_argtypes_p = false;
7153 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7155 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7156 /* Fail gracefully by stating that the type is structural. */
7157 *any_structural_p = true;
7158 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7159 *any_structural_p = true;
7160 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7161 || TREE_PURPOSE (arg))
7162 /* If the argument has a default argument, we consider it
7163 non-canonical even though the type itself is canonical.
7164 That way, different variants of function and method types
7165 with default arguments will all point to the variant with
7166 no defaults as their canonical type. */
7167 any_noncanonical_argtypes_p = true;
7170 if (*any_structural_p)
7173 if (any_noncanonical_argtypes_p)
7175 /* Build the canonical list of argument types. */
7176 tree canon_argtypes = NULL_TREE;
7177 bool is_void = false;
7179 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7181 if (arg == void_list_node)
7184 canon_argtypes = tree_cons (NULL_TREE,
7185 TYPE_CANONICAL (TREE_VALUE (arg)),
7189 canon_argtypes = nreverse (canon_argtypes);
7191 canon_argtypes = chainon (canon_argtypes, void_list_node);
7193 /* There is a non-canonical type. */
7194 *any_noncanonical_p = true;
7195 return canon_argtypes;
7198 /* The canonical argument types are the same as ARGTYPES. */
7202 /* Construct, lay out and return
7203 the type of functions returning type VALUE_TYPE
7204 given arguments of types ARG_TYPES.
7205 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7206 are data type nodes for the arguments of the function.
7207 If such a type has already been constructed, reuse it. */
7210 build_function_type (tree value_type, tree arg_types)
7213 hashval_t hashcode = 0;
7214 bool any_structural_p, any_noncanonical_p;
7215 tree canon_argtypes;
7217 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7219 error ("function return type cannot be function");
7220 value_type = integer_type_node;
7223 /* Make a node of the sort we want. */
7224 t = make_node (FUNCTION_TYPE);
7225 TREE_TYPE (t) = value_type;
7226 TYPE_ARG_TYPES (t) = arg_types;
7228 /* If we already have such a type, use the old one. */
7229 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7230 hashcode = type_hash_list (arg_types, hashcode);
7231 t = type_hash_canon (hashcode, t);
7233 /* Set up the canonical type. */
7234 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7235 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7236 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7238 &any_noncanonical_p);
7239 if (any_structural_p)
7240 SET_TYPE_STRUCTURAL_EQUALITY (t);
7241 else if (any_noncanonical_p)
7242 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7245 if (!COMPLETE_TYPE_P (t))
7250 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7253 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7255 tree new_type = NULL;
7256 tree args, new_args = NULL, t;
7260 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7261 args = TREE_CHAIN (args), i++)
7262 if (!bitmap_bit_p (args_to_skip, i))
7263 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7265 new_reversed = nreverse (new_args);
7269 TREE_CHAIN (new_args) = void_list_node;
7271 new_reversed = void_list_node;
7274 /* Use copy_node to preserve as much as possible from original type
7275 (debug info, attribute lists etc.)
7276 Exception is METHOD_TYPEs must have THIS argument.
7277 When we are asked to remove it, we need to build new FUNCTION_TYPE
7279 if (TREE_CODE (orig_type) != METHOD_TYPE
7280 || !bitmap_bit_p (args_to_skip, 0))
7282 new_type = copy_node (orig_type);
7283 TYPE_ARG_TYPES (new_type) = new_reversed;
7288 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7290 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7293 /* This is a new type, not a copy of an old type. Need to reassociate
7294 variants. We can handle everything except the main variant lazily. */
7295 t = TYPE_MAIN_VARIANT (orig_type);
7298 TYPE_MAIN_VARIANT (new_type) = t;
7299 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7300 TYPE_NEXT_VARIANT (t) = new_type;
7304 TYPE_MAIN_VARIANT (new_type) = new_type;
7305 TYPE_NEXT_VARIANT (new_type) = NULL;
7310 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7312 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7313 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7314 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7317 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7319 tree new_decl = copy_node (orig_decl);
7322 new_type = TREE_TYPE (orig_decl);
7323 if (prototype_p (new_type))
7324 new_type = build_function_type_skip_args (new_type, args_to_skip);
7325 TREE_TYPE (new_decl) = new_type;
7327 /* For declarations setting DECL_VINDEX (i.e. methods)
7328 we expect first argument to be THIS pointer. */
7329 if (bitmap_bit_p (args_to_skip, 0))
7330 DECL_VINDEX (new_decl) = NULL_TREE;
7334 /* Build a function type. The RETURN_TYPE is the type returned by the
7335 function. If VAARGS is set, no void_type_node is appended to the
7336 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7339 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7343 t = va_arg (argp, tree);
7344 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7345 args = tree_cons (NULL_TREE, t, args);
7350 if (args != NULL_TREE)
7351 args = nreverse (args);
7352 gcc_assert (args != NULL_TREE && last != void_list_node);
7354 else if (args == NULL_TREE)
7355 args = void_list_node;
7359 args = nreverse (args);
7360 TREE_CHAIN (last) = void_list_node;
7362 args = build_function_type (return_type, args);
7367 /* Build a function type. The RETURN_TYPE is the type returned by the
7368 function. If additional arguments are provided, they are
7369 additional argument types. The list of argument types must always
7370 be terminated by NULL_TREE. */
7373 build_function_type_list (tree return_type, ...)
7378 va_start (p, return_type);
7379 args = build_function_type_list_1 (false, return_type, p);
7384 /* Build a variable argument function type. The RETURN_TYPE is the
7385 type returned by the function. If additional arguments are provided,
7386 they are additional argument types. The list of argument types must
7387 always be terminated by NULL_TREE. */
7390 build_varargs_function_type_list (tree return_type, ...)
7395 va_start (p, return_type);
7396 args = build_function_type_list_1 (true, return_type, p);
7402 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7403 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7404 for the method. An implicit additional parameter (of type
7405 pointer-to-BASETYPE) is added to the ARGTYPES. */
7408 build_method_type_directly (tree basetype,
7415 bool any_structural_p, any_noncanonical_p;
7416 tree canon_argtypes;
7418 /* Make a node of the sort we want. */
7419 t = make_node (METHOD_TYPE);
7421 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7422 TREE_TYPE (t) = rettype;
7423 ptype = build_pointer_type (basetype);
7425 /* The actual arglist for this function includes a "hidden" argument
7426 which is "this". Put it into the list of argument types. */
7427 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7428 TYPE_ARG_TYPES (t) = argtypes;
7430 /* If we already have such a type, use the old one. */
7431 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7432 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7433 hashcode = type_hash_list (argtypes, hashcode);
7434 t = type_hash_canon (hashcode, t);
7436 /* Set up the canonical type. */
7438 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7439 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7441 = (TYPE_CANONICAL (basetype) != basetype
7442 || TYPE_CANONICAL (rettype) != rettype);
7443 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7445 &any_noncanonical_p);
7446 if (any_structural_p)
7447 SET_TYPE_STRUCTURAL_EQUALITY (t);
7448 else if (any_noncanonical_p)
7450 = build_method_type_directly (TYPE_CANONICAL (basetype),
7451 TYPE_CANONICAL (rettype),
7453 if (!COMPLETE_TYPE_P (t))
7459 /* Construct, lay out and return the type of methods belonging to class
7460 BASETYPE and whose arguments and values are described by TYPE.
7461 If that type exists already, reuse it.
7462 TYPE must be a FUNCTION_TYPE node. */
7465 build_method_type (tree basetype, tree type)
7467 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7469 return build_method_type_directly (basetype,
7471 TYPE_ARG_TYPES (type));
7474 /* Construct, lay out and return the type of offsets to a value
7475 of type TYPE, within an object of type BASETYPE.
7476 If a suitable offset type exists already, reuse it. */
7479 build_offset_type (tree basetype, tree type)
7482 hashval_t hashcode = 0;
7484 /* Make a node of the sort we want. */
7485 t = make_node (OFFSET_TYPE);
7487 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7488 TREE_TYPE (t) = type;
7490 /* If we already have such a type, use the old one. */
7491 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7492 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7493 t = type_hash_canon (hashcode, t);
7495 if (!COMPLETE_TYPE_P (t))
7498 if (TYPE_CANONICAL (t) == t)
7500 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7501 || TYPE_STRUCTURAL_EQUALITY_P (type))
7502 SET_TYPE_STRUCTURAL_EQUALITY (t);
7503 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7504 || TYPE_CANONICAL (type) != type)
7506 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7507 TYPE_CANONICAL (type));
7513 /* Create a complex type whose components are COMPONENT_TYPE. */
7516 build_complex_type (tree component_type)
7521 gcc_assert (INTEGRAL_TYPE_P (component_type)
7522 || SCALAR_FLOAT_TYPE_P (component_type)
7523 || FIXED_POINT_TYPE_P (component_type));
7525 /* Make a node of the sort we want. */
7526 t = make_node (COMPLEX_TYPE);
7528 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7530 /* If we already have such a type, use the old one. */
7531 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7532 t = type_hash_canon (hashcode, t);
7534 if (!COMPLETE_TYPE_P (t))
7537 if (TYPE_CANONICAL (t) == t)
7539 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7540 SET_TYPE_STRUCTURAL_EQUALITY (t);
7541 else if (TYPE_CANONICAL (component_type) != component_type)
7543 = build_complex_type (TYPE_CANONICAL (component_type));
7546 /* We need to create a name, since complex is a fundamental type. */
7547 if (! TYPE_NAME (t))
7550 if (component_type == char_type_node)
7551 name = "complex char";
7552 else if (component_type == signed_char_type_node)
7553 name = "complex signed char";
7554 else if (component_type == unsigned_char_type_node)
7555 name = "complex unsigned char";
7556 else if (component_type == short_integer_type_node)
7557 name = "complex short int";
7558 else if (component_type == short_unsigned_type_node)
7559 name = "complex short unsigned int";
7560 else if (component_type == integer_type_node)
7561 name = "complex int";
7562 else if (component_type == unsigned_type_node)
7563 name = "complex unsigned int";
7564 else if (component_type == long_integer_type_node)
7565 name = "complex long int";
7566 else if (component_type == long_unsigned_type_node)
7567 name = "complex long unsigned int";
7568 else if (component_type == long_long_integer_type_node)
7569 name = "complex long long int";
7570 else if (component_type == long_long_unsigned_type_node)
7571 name = "complex long long unsigned int";
7576 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7577 get_identifier (name), t);
7580 return build_qualified_type (t, TYPE_QUALS (component_type));
7583 /* If TYPE is a real or complex floating-point type and the target
7584 does not directly support arithmetic on TYPE then return the wider
7585 type to be used for arithmetic on TYPE. Otherwise, return
7589 excess_precision_type (tree type)
7591 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7593 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7594 switch (TREE_CODE (type))
7597 switch (flt_eval_method)
7600 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7601 return double_type_node;
7604 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7605 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7606 return long_double_type_node;
7613 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7615 switch (flt_eval_method)
7618 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7619 return complex_double_type_node;
7622 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7623 || (TYPE_MODE (TREE_TYPE (type))
7624 == TYPE_MODE (double_type_node)))
7625 return complex_long_double_type_node;
7638 /* Return OP, stripped of any conversions to wider types as much as is safe.
7639 Converting the value back to OP's type makes a value equivalent to OP.
7641 If FOR_TYPE is nonzero, we return a value which, if converted to
7642 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7644 OP must have integer, real or enumeral type. Pointers are not allowed!
7646 There are some cases where the obvious value we could return
7647 would regenerate to OP if converted to OP's type,
7648 but would not extend like OP to wider types.
7649 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7650 For example, if OP is (unsigned short)(signed char)-1,
7651 we avoid returning (signed char)-1 if FOR_TYPE is int,
7652 even though extending that to an unsigned short would regenerate OP,
7653 since the result of extending (signed char)-1 to (int)
7654 is different from (int) OP. */
7657 get_unwidened (tree op, tree for_type)
7659 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7660 tree type = TREE_TYPE (op);
7662 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7664 = (for_type != 0 && for_type != type
7665 && final_prec > TYPE_PRECISION (type)
7666 && TYPE_UNSIGNED (type));
7669 while (CONVERT_EXPR_P (op))
7673 /* TYPE_PRECISION on vector types has different meaning
7674 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7675 so avoid them here. */
7676 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7679 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7680 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7682 /* Truncations are many-one so cannot be removed.
7683 Unless we are later going to truncate down even farther. */
7685 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7688 /* See what's inside this conversion. If we decide to strip it,
7690 op = TREE_OPERAND (op, 0);
7692 /* If we have not stripped any zero-extensions (uns is 0),
7693 we can strip any kind of extension.
7694 If we have previously stripped a zero-extension,
7695 only zero-extensions can safely be stripped.
7696 Any extension can be stripped if the bits it would produce
7697 are all going to be discarded later by truncating to FOR_TYPE. */
7701 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7703 /* TYPE_UNSIGNED says whether this is a zero-extension.
7704 Let's avoid computing it if it does not affect WIN
7705 and if UNS will not be needed again. */
7707 || CONVERT_EXPR_P (op))
7708 && TYPE_UNSIGNED (TREE_TYPE (op)))
7716 /* If we finally reach a constant see if it fits in for_type and
7717 in that case convert it. */
7719 && TREE_CODE (win) == INTEGER_CST
7720 && TREE_TYPE (win) != for_type
7721 && int_fits_type_p (win, for_type))
7722 win = fold_convert (for_type, win);
7727 /* Return OP or a simpler expression for a narrower value
7728 which can be sign-extended or zero-extended to give back OP.
7729 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7730 or 0 if the value should be sign-extended. */
7733 get_narrower (tree op, int *unsignedp_ptr)
7738 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7740 while (TREE_CODE (op) == NOP_EXPR)
7743 = (TYPE_PRECISION (TREE_TYPE (op))
7744 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7746 /* Truncations are many-one so cannot be removed. */
7750 /* See what's inside this conversion. If we decide to strip it,
7755 op = TREE_OPERAND (op, 0);
7756 /* An extension: the outermost one can be stripped,
7757 but remember whether it is zero or sign extension. */
7759 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7760 /* Otherwise, if a sign extension has been stripped,
7761 only sign extensions can now be stripped;
7762 if a zero extension has been stripped, only zero-extensions. */
7763 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7767 else /* bitschange == 0 */
7769 /* A change in nominal type can always be stripped, but we must
7770 preserve the unsignedness. */
7772 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7774 op = TREE_OPERAND (op, 0);
7775 /* Keep trying to narrow, but don't assign op to win if it
7776 would turn an integral type into something else. */
7777 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7784 if (TREE_CODE (op) == COMPONENT_REF
7785 /* Since type_for_size always gives an integer type. */
7786 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7787 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7788 /* Ensure field is laid out already. */
7789 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7790 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7792 unsigned HOST_WIDE_INT innerprec
7793 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7794 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7795 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7796 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7798 /* We can get this structure field in a narrower type that fits it,
7799 but the resulting extension to its nominal type (a fullword type)
7800 must satisfy the same conditions as for other extensions.
7802 Do this only for fields that are aligned (not bit-fields),
7803 because when bit-field insns will be used there is no
7804 advantage in doing this. */
7806 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7807 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7808 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7812 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7813 win = fold_convert (type, op);
7817 *unsignedp_ptr = uns;
7821 /* Nonzero if integer constant C has a value that is permissible
7822 for type TYPE (an INTEGER_TYPE). */
7825 int_fits_type_p (const_tree c, const_tree type)
7827 tree type_low_bound, type_high_bound;
7828 bool ok_for_low_bound, ok_for_high_bound, unsc;
7831 dc = tree_to_double_int (c);
7832 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7834 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7835 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7837 /* So c is an unsigned integer whose type is sizetype and type is not.
7838 sizetype'd integers are sign extended even though they are
7839 unsigned. If the integer value fits in the lower end word of c,
7840 and if the higher end word has all its bits set to 1, that
7841 means the higher end bits are set to 1 only for sign extension.
7842 So let's convert c into an equivalent zero extended unsigned
7844 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7847 type_low_bound = TYPE_MIN_VALUE (type);
7848 type_high_bound = TYPE_MAX_VALUE (type);
7850 /* If at least one bound of the type is a constant integer, we can check
7851 ourselves and maybe make a decision. If no such decision is possible, but
7852 this type is a subtype, try checking against that. Otherwise, use
7853 fit_double_type, which checks against the precision.
7855 Compute the status for each possibly constant bound, and return if we see
7856 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7857 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7858 for "constant known to fit". */
7860 /* Check if c >= type_low_bound. */
7861 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7863 dd = tree_to_double_int (type_low_bound);
7864 if (TREE_CODE (type) == INTEGER_TYPE
7865 && TYPE_IS_SIZETYPE (type)
7866 && TYPE_UNSIGNED (type))
7867 dd = double_int_zext (dd, TYPE_PRECISION (type));
7868 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7870 int c_neg = (!unsc && double_int_negative_p (dc));
7871 int t_neg = (unsc && double_int_negative_p (dd));
7873 if (c_neg && !t_neg)
7875 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7878 else if (double_int_cmp (dc, dd, unsc) < 0)
7880 ok_for_low_bound = true;
7883 ok_for_low_bound = false;
7885 /* Check if c <= type_high_bound. */
7886 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7888 dd = tree_to_double_int (type_high_bound);
7889 if (TREE_CODE (type) == INTEGER_TYPE
7890 && TYPE_IS_SIZETYPE (type)
7891 && TYPE_UNSIGNED (type))
7892 dd = double_int_zext (dd, TYPE_PRECISION (type));
7893 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7895 int c_neg = (!unsc && double_int_negative_p (dc));
7896 int t_neg = (unsc && double_int_negative_p (dd));
7898 if (t_neg && !c_neg)
7900 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7903 else if (double_int_cmp (dc, dd, unsc) > 0)
7905 ok_for_high_bound = true;
7908 ok_for_high_bound = false;
7910 /* If the constant fits both bounds, the result is known. */
7911 if (ok_for_low_bound && ok_for_high_bound)
7914 /* Perform some generic filtering which may allow making a decision
7915 even if the bounds are not constant. First, negative integers
7916 never fit in unsigned types, */
7917 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7920 /* Second, narrower types always fit in wider ones. */
7921 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7924 /* Third, unsigned integers with top bit set never fit signed types. */
7925 if (! TYPE_UNSIGNED (type) && unsc)
7927 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7928 if (prec < HOST_BITS_PER_WIDE_INT)
7930 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7933 else if (((((unsigned HOST_WIDE_INT) 1)
7934 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7938 /* If we haven't been able to decide at this point, there nothing more we
7939 can check ourselves here. Look at the base type if we have one and it
7940 has the same precision. */
7941 if (TREE_CODE (type) == INTEGER_TYPE
7942 && TREE_TYPE (type) != 0
7943 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7945 type = TREE_TYPE (type);
7949 /* Or to fit_double_type, if nothing else. */
7950 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7953 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7954 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7955 represented (assuming two's-complement arithmetic) within the bit
7956 precision of the type are returned instead. */
7959 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7961 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7962 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7963 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7964 TYPE_UNSIGNED (type));
7967 if (TYPE_UNSIGNED (type))
7968 mpz_set_ui (min, 0);
7972 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7973 mn = double_int_sext (double_int_add (mn, double_int_one),
7974 TYPE_PRECISION (type));
7975 mpz_set_double_int (min, mn, false);
7979 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7980 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7981 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7982 TYPE_UNSIGNED (type));
7985 if (TYPE_UNSIGNED (type))
7986 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7989 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7994 /* Return true if VAR is an automatic variable defined in function FN. */
7997 auto_var_in_fn_p (const_tree var, const_tree fn)
7999 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8000 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8001 || TREE_CODE (var) == PARM_DECL)
8002 && ! TREE_STATIC (var))
8003 || TREE_CODE (var) == LABEL_DECL
8004 || TREE_CODE (var) == RESULT_DECL));
8007 /* Subprogram of following function. Called by walk_tree.
8009 Return *TP if it is an automatic variable or parameter of the
8010 function passed in as DATA. */
8013 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8015 tree fn = (tree) data;
8020 else if (DECL_P (*tp)
8021 && auto_var_in_fn_p (*tp, fn))
8027 /* Returns true if T is, contains, or refers to a type with variable
8028 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8029 arguments, but not the return type. If FN is nonzero, only return
8030 true if a modifier of the type or position of FN is a variable or
8031 parameter inside FN.
8033 This concept is more general than that of C99 'variably modified types':
8034 in C99, a struct type is never variably modified because a VLA may not
8035 appear as a structure member. However, in GNU C code like:
8037 struct S { int i[f()]; };
8039 is valid, and other languages may define similar constructs. */
8042 variably_modified_type_p (tree type, tree fn)
8046 /* Test if T is either variable (if FN is zero) or an expression containing
8047 a variable in FN. */
8048 #define RETURN_TRUE_IF_VAR(T) \
8049 do { tree _t = (T); \
8050 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8051 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8052 return true; } while (0)
8054 if (type == error_mark_node)
8057 /* If TYPE itself has variable size, it is variably modified. */
8058 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8059 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8061 switch (TREE_CODE (type))
8064 case REFERENCE_TYPE:
8066 if (variably_modified_type_p (TREE_TYPE (type), fn))
8072 /* If TYPE is a function type, it is variably modified if the
8073 return type is variably modified. */
8074 if (variably_modified_type_p (TREE_TYPE (type), fn))
8080 case FIXED_POINT_TYPE:
8083 /* Scalar types are variably modified if their end points
8085 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8086 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8091 case QUAL_UNION_TYPE:
8092 /* We can't see if any of the fields are variably-modified by the
8093 definition we normally use, since that would produce infinite
8094 recursion via pointers. */
8095 /* This is variably modified if some field's type is. */
8096 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8097 if (TREE_CODE (t) == FIELD_DECL)
8099 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8100 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8101 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8103 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8104 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8109 /* Do not call ourselves to avoid infinite recursion. This is
8110 variably modified if the element type is. */
8111 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8112 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8119 /* The current language may have other cases to check, but in general,
8120 all other types are not variably modified. */
8121 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8123 #undef RETURN_TRUE_IF_VAR
8126 /* Given a DECL or TYPE, return the scope in which it was declared, or
8127 NULL_TREE if there is no containing scope. */
8130 get_containing_scope (const_tree t)
8132 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8135 /* Return the innermost context enclosing DECL that is
8136 a FUNCTION_DECL, or zero if none. */
8139 decl_function_context (const_tree decl)
8143 if (TREE_CODE (decl) == ERROR_MARK)
8146 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8147 where we look up the function at runtime. Such functions always take
8148 a first argument of type 'pointer to real context'.
8150 C++ should really be fixed to use DECL_CONTEXT for the real context,
8151 and use something else for the "virtual context". */
8152 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8155 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8157 context = DECL_CONTEXT (decl);
8159 while (context && TREE_CODE (context) != FUNCTION_DECL)
8161 if (TREE_CODE (context) == BLOCK)
8162 context = BLOCK_SUPERCONTEXT (context);
8164 context = get_containing_scope (context);
8170 /* Return the innermost context enclosing DECL that is
8171 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8172 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8175 decl_type_context (const_tree decl)
8177 tree context = DECL_CONTEXT (decl);
8180 switch (TREE_CODE (context))
8182 case NAMESPACE_DECL:
8183 case TRANSLATION_UNIT_DECL:
8188 case QUAL_UNION_TYPE:
8193 context = DECL_CONTEXT (context);
8197 context = BLOCK_SUPERCONTEXT (context);
8207 /* CALL is a CALL_EXPR. Return the declaration for the function
8208 called, or NULL_TREE if the called function cannot be
8212 get_callee_fndecl (const_tree call)
8216 if (call == error_mark_node)
8217 return error_mark_node;
8219 /* It's invalid to call this function with anything but a
8221 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8223 /* The first operand to the CALL is the address of the function
8225 addr = CALL_EXPR_FN (call);
8229 /* If this is a readonly function pointer, extract its initial value. */
8230 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8231 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8232 && DECL_INITIAL (addr))
8233 addr = DECL_INITIAL (addr);
8235 /* If the address is just `&f' for some function `f', then we know
8236 that `f' is being called. */
8237 if (TREE_CODE (addr) == ADDR_EXPR
8238 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8239 return TREE_OPERAND (addr, 0);
8241 /* We couldn't figure out what was being called. */
8245 /* Print debugging information about tree nodes generated during the compile,
8246 and any language-specific information. */
8249 dump_tree_statistics (void)
8251 #ifdef GATHER_STATISTICS
8253 int total_nodes, total_bytes;
8256 fprintf (stderr, "\n??? tree nodes created\n\n");
8257 #ifdef GATHER_STATISTICS
8258 fprintf (stderr, "Kind Nodes Bytes\n");
8259 fprintf (stderr, "---------------------------------------\n");
8260 total_nodes = total_bytes = 0;
8261 for (i = 0; i < (int) all_kinds; i++)
8263 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8264 tree_node_counts[i], tree_node_sizes[i]);
8265 total_nodes += tree_node_counts[i];
8266 total_bytes += tree_node_sizes[i];
8268 fprintf (stderr, "---------------------------------------\n");
8269 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8270 fprintf (stderr, "---------------------------------------\n");
8271 ssanames_print_statistics ();
8272 phinodes_print_statistics ();
8274 fprintf (stderr, "(No per-node statistics)\n");
8276 print_type_hash_statistics ();
8277 print_debug_expr_statistics ();
8278 print_value_expr_statistics ();
8279 lang_hooks.print_statistics ();
8282 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8284 /* Generate a crc32 of a string. */
8287 crc32_string (unsigned chksum, const char *string)
8291 unsigned value = *string << 24;
8294 for (ix = 8; ix--; value <<= 1)
8298 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8307 /* P is a string that will be used in a symbol. Mask out any characters
8308 that are not valid in that context. */
8311 clean_symbol_name (char *p)
8315 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8318 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8325 /* Generate a name for a special-purpose function function.
8326 The generated name may need to be unique across the whole link.
8327 TYPE is some string to identify the purpose of this function to the
8328 linker or collect2; it must start with an uppercase letter,
8330 I - for constructors
8332 N - for C++ anonymous namespaces
8333 F - for DWARF unwind frame information. */
8336 get_file_function_name (const char *type)
8342 /* If we already have a name we know to be unique, just use that. */
8343 if (first_global_object_name)
8344 p = q = ASTRDUP (first_global_object_name);
8345 /* If the target is handling the constructors/destructors, they
8346 will be local to this file and the name is only necessary for
8347 debugging purposes. */
8348 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8350 const char *file = main_input_filename;
8352 file = input_filename;
8353 /* Just use the file's basename, because the full pathname
8354 might be quite long. */
8355 p = strrchr (file, '/');
8360 p = q = ASTRDUP (p);
8364 /* Otherwise, the name must be unique across the entire link.
8365 We don't have anything that we know to be unique to this translation
8366 unit, so use what we do have and throw in some randomness. */
8368 const char *name = weak_global_object_name;
8369 const char *file = main_input_filename;
8374 file = input_filename;
8376 len = strlen (file);
8377 q = (char *) alloca (9 * 2 + len + 1);
8378 memcpy (q, file, len + 1);
8380 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8381 crc32_string (0, get_random_seed (false)));
8386 clean_symbol_name (q);
8387 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8390 /* Set up the name of the file-level functions we may need.
8391 Use a global object (which is already required to be unique over
8392 the program) rather than the file name (which imposes extra
8394 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8396 return get_identifier (buf);
8399 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8401 /* Complain that the tree code of NODE does not match the expected 0
8402 terminated list of trailing codes. The trailing code list can be
8403 empty, for a more vague error message. FILE, LINE, and FUNCTION
8404 are of the caller. */
8407 tree_check_failed (const_tree node, const char *file,
8408 int line, const char *function, ...)
8412 unsigned length = 0;
8415 va_start (args, function);
8416 while ((code = va_arg (args, int)))
8417 length += 4 + strlen (tree_code_name[code]);
8422 va_start (args, function);
8423 length += strlen ("expected ");
8424 buffer = tmp = (char *) alloca (length);
8426 while ((code = va_arg (args, int)))
8428 const char *prefix = length ? " or " : "expected ";
8430 strcpy (tmp + length, prefix);
8431 length += strlen (prefix);
8432 strcpy (tmp + length, tree_code_name[code]);
8433 length += strlen (tree_code_name[code]);
8438 buffer = "unexpected node";
8440 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8441 buffer, tree_code_name[TREE_CODE (node)],
8442 function, trim_filename (file), line);
8445 /* Complain that the tree code of NODE does match the expected 0
8446 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8450 tree_not_check_failed (const_tree node, const char *file,
8451 int line, const char *function, ...)
8455 unsigned length = 0;
8458 va_start (args, function);
8459 while ((code = va_arg (args, int)))
8460 length += 4 + strlen (tree_code_name[code]);
8462 va_start (args, function);
8463 buffer = (char *) alloca (length);
8465 while ((code = va_arg (args, int)))
8469 strcpy (buffer + length, " or ");
8472 strcpy (buffer + length, tree_code_name[code]);
8473 length += strlen (tree_code_name[code]);
8477 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8478 buffer, tree_code_name[TREE_CODE (node)],
8479 function, trim_filename (file), line);
8482 /* Similar to tree_check_failed, except that we check for a class of tree
8483 code, given in CL. */
8486 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8487 const char *file, int line, const char *function)
8490 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8491 TREE_CODE_CLASS_STRING (cl),
8492 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8493 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8496 /* Similar to tree_check_failed, except that instead of specifying a
8497 dozen codes, use the knowledge that they're all sequential. */
8500 tree_range_check_failed (const_tree node, const char *file, int line,
8501 const char *function, enum tree_code c1,
8505 unsigned length = 0;
8508 for (c = c1; c <= c2; ++c)
8509 length += 4 + strlen (tree_code_name[c]);
8511 length += strlen ("expected ");
8512 buffer = (char *) alloca (length);
8515 for (c = c1; c <= c2; ++c)
8517 const char *prefix = length ? " or " : "expected ";
8519 strcpy (buffer + length, prefix);
8520 length += strlen (prefix);
8521 strcpy (buffer + length, tree_code_name[c]);
8522 length += strlen (tree_code_name[c]);
8525 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8526 buffer, tree_code_name[TREE_CODE (node)],
8527 function, trim_filename (file), line);
8531 /* Similar to tree_check_failed, except that we check that a tree does
8532 not have the specified code, given in CL. */
8535 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8536 const char *file, int line, const char *function)
8539 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8540 TREE_CODE_CLASS_STRING (cl),
8541 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8542 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8546 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8549 omp_clause_check_failed (const_tree node, const char *file, int line,
8550 const char *function, enum omp_clause_code code)
8552 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8553 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8554 function, trim_filename (file), line);
8558 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8561 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8562 const char *function, enum omp_clause_code c1,
8563 enum omp_clause_code c2)
8566 unsigned length = 0;
8569 for (c = c1; c <= c2; ++c)
8570 length += 4 + strlen (omp_clause_code_name[c]);
8572 length += strlen ("expected ");
8573 buffer = (char *) alloca (length);
8576 for (c = c1; c <= c2; ++c)
8578 const char *prefix = length ? " or " : "expected ";
8580 strcpy (buffer + length, prefix);
8581 length += strlen (prefix);
8582 strcpy (buffer + length, omp_clause_code_name[c]);
8583 length += strlen (omp_clause_code_name[c]);
8586 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8587 buffer, omp_clause_code_name[TREE_CODE (node)],
8588 function, trim_filename (file), line);
8592 #undef DEFTREESTRUCT
8593 #define DEFTREESTRUCT(VAL, NAME) NAME,
8595 static const char *ts_enum_names[] = {
8596 #include "treestruct.def"
8598 #undef DEFTREESTRUCT
8600 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8602 /* Similar to tree_class_check_failed, except that we check for
8603 whether CODE contains the tree structure identified by EN. */
8606 tree_contains_struct_check_failed (const_tree node,
8607 const enum tree_node_structure_enum en,
8608 const char *file, int line,
8609 const char *function)
8612 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8614 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8618 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8619 (dynamically sized) vector. */
8622 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8623 const char *function)
8626 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8627 idx + 1, len, function, trim_filename (file), line);
8630 /* Similar to above, except that the check is for the bounds of the operand
8631 vector of an expression node EXP. */
8634 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8635 int line, const char *function)
8637 int code = TREE_CODE (exp);
8639 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8640 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8641 function, trim_filename (file), line);
8644 /* Similar to above, except that the check is for the number of
8645 operands of an OMP_CLAUSE node. */
8648 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8649 int line, const char *function)
8652 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8653 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8654 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8655 trim_filename (file), line);
8657 #endif /* ENABLE_TREE_CHECKING */
8659 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8660 and mapped to the machine mode MODE. Initialize its fields and build
8661 the information necessary for debugging output. */
8664 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8667 hashval_t hashcode = 0;
8669 t = make_node (VECTOR_TYPE);
8670 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8671 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8672 SET_TYPE_MODE (t, mode);
8674 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8675 SET_TYPE_STRUCTURAL_EQUALITY (t);
8676 else if (TYPE_CANONICAL (innertype) != innertype
8677 || mode != VOIDmode)
8679 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8684 tree index = build_int_cst (NULL_TREE, nunits - 1);
8685 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8686 build_index_type (index));
8687 tree rt = make_node (RECORD_TYPE);
8689 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8690 get_identifier ("f"), array);
8691 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8693 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8694 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8695 the representation type, and we want to find that die when looking up
8696 the vector type. This is most easily achieved by making the TYPE_UID
8698 TYPE_UID (rt) = TYPE_UID (t);
8701 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8702 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8703 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8704 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8705 t = type_hash_canon (hashcode, t);
8707 /* We have built a main variant, based on the main variant of the
8708 inner type. Use it to build the variant we return. */
8709 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8710 && TREE_TYPE (t) != innertype)
8711 return build_type_attribute_qual_variant (t,
8712 TYPE_ATTRIBUTES (innertype),
8713 TYPE_QUALS (innertype));
8719 make_or_reuse_type (unsigned size, int unsignedp)
8721 if (size == INT_TYPE_SIZE)
8722 return unsignedp ? unsigned_type_node : integer_type_node;
8723 if (size == CHAR_TYPE_SIZE)
8724 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8725 if (size == SHORT_TYPE_SIZE)
8726 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8727 if (size == LONG_TYPE_SIZE)
8728 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8729 if (size == LONG_LONG_TYPE_SIZE)
8730 return (unsignedp ? long_long_unsigned_type_node
8731 : long_long_integer_type_node);
8734 return make_unsigned_type (size);
8736 return make_signed_type (size);
8739 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8742 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8746 if (size == SHORT_FRACT_TYPE_SIZE)
8747 return unsignedp ? sat_unsigned_short_fract_type_node
8748 : sat_short_fract_type_node;
8749 if (size == FRACT_TYPE_SIZE)
8750 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8751 if (size == LONG_FRACT_TYPE_SIZE)
8752 return unsignedp ? sat_unsigned_long_fract_type_node
8753 : sat_long_fract_type_node;
8754 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8755 return unsignedp ? sat_unsigned_long_long_fract_type_node
8756 : sat_long_long_fract_type_node;
8760 if (size == SHORT_FRACT_TYPE_SIZE)
8761 return unsignedp ? unsigned_short_fract_type_node
8762 : short_fract_type_node;
8763 if (size == FRACT_TYPE_SIZE)
8764 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8765 if (size == LONG_FRACT_TYPE_SIZE)
8766 return unsignedp ? unsigned_long_fract_type_node
8767 : long_fract_type_node;
8768 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8769 return unsignedp ? unsigned_long_long_fract_type_node
8770 : long_long_fract_type_node;
8773 return make_fract_type (size, unsignedp, satp);
8776 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8779 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8783 if (size == SHORT_ACCUM_TYPE_SIZE)
8784 return unsignedp ? sat_unsigned_short_accum_type_node
8785 : sat_short_accum_type_node;
8786 if (size == ACCUM_TYPE_SIZE)
8787 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8788 if (size == LONG_ACCUM_TYPE_SIZE)
8789 return unsignedp ? sat_unsigned_long_accum_type_node
8790 : sat_long_accum_type_node;
8791 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8792 return unsignedp ? sat_unsigned_long_long_accum_type_node
8793 : sat_long_long_accum_type_node;
8797 if (size == SHORT_ACCUM_TYPE_SIZE)
8798 return unsignedp ? unsigned_short_accum_type_node
8799 : short_accum_type_node;
8800 if (size == ACCUM_TYPE_SIZE)
8801 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8802 if (size == LONG_ACCUM_TYPE_SIZE)
8803 return unsignedp ? unsigned_long_accum_type_node
8804 : long_accum_type_node;
8805 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8806 return unsignedp ? unsigned_long_long_accum_type_node
8807 : long_long_accum_type_node;
8810 return make_accum_type (size, unsignedp, satp);
8813 /* Create nodes for all integer types (and error_mark_node) using the sizes
8814 of C datatypes. The caller should call set_sizetype soon after calling
8815 this function to select one of the types as sizetype. */
8818 build_common_tree_nodes (bool signed_char)
8820 error_mark_node = make_node (ERROR_MARK);
8821 TREE_TYPE (error_mark_node) = error_mark_node;
8823 initialize_sizetypes ();
8825 /* Define both `signed char' and `unsigned char'. */
8826 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8827 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8828 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8829 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8831 /* Define `char', which is like either `signed char' or `unsigned char'
8832 but not the same as either. */
8835 ? make_signed_type (CHAR_TYPE_SIZE)
8836 : make_unsigned_type (CHAR_TYPE_SIZE));
8837 TYPE_STRING_FLAG (char_type_node) = 1;
8839 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8840 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8841 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8842 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8843 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8844 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8845 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8846 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8848 /* Define a boolean type. This type only represents boolean values but
8849 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8850 Front ends which want to override this size (i.e. Java) can redefine
8851 boolean_type_node before calling build_common_tree_nodes_2. */
8852 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8853 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8854 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8855 TYPE_PRECISION (boolean_type_node) = 1;
8857 /* Fill in the rest of the sized types. Reuse existing type nodes
8859 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8860 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8861 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8862 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8863 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8865 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8866 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8867 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8868 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8869 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8871 access_public_node = get_identifier ("public");
8872 access_protected_node = get_identifier ("protected");
8873 access_private_node = get_identifier ("private");
8876 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8877 It will create several other common tree nodes. */
8880 build_common_tree_nodes_2 (int short_double)
8882 /* Define these next since types below may used them. */
8883 integer_zero_node = build_int_cst (NULL_TREE, 0);
8884 integer_one_node = build_int_cst (NULL_TREE, 1);
8885 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8887 size_zero_node = size_int (0);
8888 size_one_node = size_int (1);
8889 bitsize_zero_node = bitsize_int (0);
8890 bitsize_one_node = bitsize_int (1);
8891 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8893 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8894 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8896 void_type_node = make_node (VOID_TYPE);
8897 layout_type (void_type_node);
8899 /* We are not going to have real types in C with less than byte alignment,
8900 so we might as well not have any types that claim to have it. */
8901 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8902 TYPE_USER_ALIGN (void_type_node) = 0;
8904 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8905 layout_type (TREE_TYPE (null_pointer_node));
8907 ptr_type_node = build_pointer_type (void_type_node);
8909 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8910 fileptr_type_node = ptr_type_node;
8912 float_type_node = make_node (REAL_TYPE);
8913 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8914 layout_type (float_type_node);
8916 double_type_node = make_node (REAL_TYPE);
8918 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8920 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8921 layout_type (double_type_node);
8923 long_double_type_node = make_node (REAL_TYPE);
8924 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8925 layout_type (long_double_type_node);
8927 float_ptr_type_node = build_pointer_type (float_type_node);
8928 double_ptr_type_node = build_pointer_type (double_type_node);
8929 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8930 integer_ptr_type_node = build_pointer_type (integer_type_node);
8932 /* Fixed size integer types. */
8933 uint32_type_node = build_nonstandard_integer_type (32, true);
8934 uint64_type_node = build_nonstandard_integer_type (64, true);
8936 /* Decimal float types. */
8937 dfloat32_type_node = make_node (REAL_TYPE);
8938 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8939 layout_type (dfloat32_type_node);
8940 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8941 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8943 dfloat64_type_node = make_node (REAL_TYPE);
8944 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8945 layout_type (dfloat64_type_node);
8946 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8947 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8949 dfloat128_type_node = make_node (REAL_TYPE);
8950 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8951 layout_type (dfloat128_type_node);
8952 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8953 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8955 complex_integer_type_node = build_complex_type (integer_type_node);
8956 complex_float_type_node = build_complex_type (float_type_node);
8957 complex_double_type_node = build_complex_type (double_type_node);
8958 complex_long_double_type_node = build_complex_type (long_double_type_node);
8960 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8961 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8962 sat_ ## KIND ## _type_node = \
8963 make_sat_signed_ ## KIND ## _type (SIZE); \
8964 sat_unsigned_ ## KIND ## _type_node = \
8965 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8966 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8967 unsigned_ ## KIND ## _type_node = \
8968 make_unsigned_ ## KIND ## _type (SIZE);
8970 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8971 sat_ ## WIDTH ## KIND ## _type_node = \
8972 make_sat_signed_ ## KIND ## _type (SIZE); \
8973 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8974 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8975 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8976 unsigned_ ## WIDTH ## KIND ## _type_node = \
8977 make_unsigned_ ## KIND ## _type (SIZE);
8979 /* Make fixed-point type nodes based on four different widths. */
8980 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8981 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8982 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8983 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8984 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8986 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8987 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8988 NAME ## _type_node = \
8989 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8990 u ## NAME ## _type_node = \
8991 make_or_reuse_unsigned_ ## KIND ## _type \
8992 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8993 sat_ ## NAME ## _type_node = \
8994 make_or_reuse_sat_signed_ ## KIND ## _type \
8995 (GET_MODE_BITSIZE (MODE ## mode)); \
8996 sat_u ## NAME ## _type_node = \
8997 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8998 (GET_MODE_BITSIZE (U ## MODE ## mode));
9000 /* Fixed-point type and mode nodes. */
9001 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9002 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9003 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9004 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9005 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9006 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9007 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9008 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9009 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9010 MAKE_FIXED_MODE_NODE (accum, da, DA)
9011 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9014 tree t = targetm.build_builtin_va_list ();
9016 /* Many back-ends define record types without setting TYPE_NAME.
9017 If we copied the record type here, we'd keep the original
9018 record type without a name. This breaks name mangling. So,
9019 don't copy record types and let c_common_nodes_and_builtins()
9020 declare the type to be __builtin_va_list. */
9021 if (TREE_CODE (t) != RECORD_TYPE)
9022 t = build_variant_type_copy (t);
9024 va_list_type_node = t;
9028 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9031 local_define_builtin (const char *name, tree type, enum built_in_function code,
9032 const char *library_name, int ecf_flags)
9036 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9037 library_name, NULL_TREE);
9038 if (ecf_flags & ECF_CONST)
9039 TREE_READONLY (decl) = 1;
9040 if (ecf_flags & ECF_PURE)
9041 DECL_PURE_P (decl) = 1;
9042 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9043 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9044 if (ecf_flags & ECF_NORETURN)
9045 TREE_THIS_VOLATILE (decl) = 1;
9046 if (ecf_flags & ECF_NOTHROW)
9047 TREE_NOTHROW (decl) = 1;
9048 if (ecf_flags & ECF_MALLOC)
9049 DECL_IS_MALLOC (decl) = 1;
9051 built_in_decls[code] = decl;
9052 implicit_built_in_decls[code] = decl;
9055 /* Call this function after instantiating all builtins that the language
9056 front end cares about. This will build the rest of the builtins that
9057 are relied upon by the tree optimizers and the middle-end. */
9060 build_common_builtin_nodes (void)
9062 tree tmp, tmp2, ftype;
9064 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9065 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9067 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9068 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9069 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9070 ftype = build_function_type (ptr_type_node, tmp);
9072 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9073 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9074 "memcpy", ECF_NOTHROW);
9075 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9076 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9077 "memmove", ECF_NOTHROW);
9080 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9082 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9083 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9084 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9085 ftype = build_function_type (integer_type_node, tmp);
9086 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9087 "memcmp", ECF_PURE | ECF_NOTHROW);
9090 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9092 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9093 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9094 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9095 ftype = build_function_type (ptr_type_node, tmp);
9096 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9097 "memset", ECF_NOTHROW);
9100 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9102 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9103 ftype = build_function_type (ptr_type_node, tmp);
9104 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9106 ECF_MALLOC | (flag_stack_check ? 0 : ECF_NOTHROW));
9109 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9110 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9111 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9112 ftype = build_function_type (void_type_node, tmp);
9113 local_define_builtin ("__builtin_init_trampoline", ftype,
9114 BUILT_IN_INIT_TRAMPOLINE,
9115 "__builtin_init_trampoline", ECF_NOTHROW);
9117 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9118 ftype = build_function_type (ptr_type_node, tmp);
9119 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9120 BUILT_IN_ADJUST_TRAMPOLINE,
9121 "__builtin_adjust_trampoline",
9122 ECF_CONST | ECF_NOTHROW);
9124 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9125 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9126 ftype = build_function_type (void_type_node, tmp);
9127 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9128 BUILT_IN_NONLOCAL_GOTO,
9129 "__builtin_nonlocal_goto",
9130 ECF_NORETURN | ECF_NOTHROW);
9132 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9133 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9134 ftype = build_function_type (void_type_node, tmp);
9135 local_define_builtin ("__builtin_setjmp_setup", ftype,
9136 BUILT_IN_SETJMP_SETUP,
9137 "__builtin_setjmp_setup", ECF_NOTHROW);
9139 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9140 ftype = build_function_type (ptr_type_node, tmp);
9141 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9142 BUILT_IN_SETJMP_DISPATCHER,
9143 "__builtin_setjmp_dispatcher",
9144 ECF_PURE | ECF_NOTHROW);
9146 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9147 ftype = build_function_type (void_type_node, tmp);
9148 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9149 BUILT_IN_SETJMP_RECEIVER,
9150 "__builtin_setjmp_receiver", ECF_NOTHROW);
9152 ftype = build_function_type (ptr_type_node, void_list_node);
9153 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9154 "__builtin_stack_save", ECF_NOTHROW);
9156 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9157 ftype = build_function_type (void_type_node, tmp);
9158 local_define_builtin ("__builtin_stack_restore", ftype,
9159 BUILT_IN_STACK_RESTORE,
9160 "__builtin_stack_restore", ECF_NOTHROW);
9162 ftype = build_function_type (void_type_node, void_list_node);
9163 local_define_builtin ("__builtin_profile_func_enter", ftype,
9164 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9165 local_define_builtin ("__builtin_profile_func_exit", ftype,
9166 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9168 /* If there's a possibility that we might use the ARM EABI, build the
9169 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9170 if (targetm.arm_eabi_unwinder)
9172 ftype = build_function_type (void_type_node, void_list_node);
9173 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9174 BUILT_IN_CXA_END_CLEANUP,
9175 "__cxa_end_cleanup", ECF_NORETURN);
9178 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9179 ftype = build_function_type (void_type_node, tmp);
9180 local_define_builtin ("__builtin_unwind_resume", ftype,
9181 BUILT_IN_UNWIND_RESUME,
9182 (USING_SJLJ_EXCEPTIONS
9183 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9186 /* The exception object and filter values from the runtime. The argument
9187 must be zero before exception lowering, i.e. from the front end. After
9188 exception lowering, it will be the region number for the exception
9189 landing pad. These functions are PURE instead of CONST to prevent
9190 them from being hoisted past the exception edge that will initialize
9191 its value in the landing pad. */
9192 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9193 ftype = build_function_type (ptr_type_node, tmp);
9194 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9195 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9197 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9198 ftype = build_function_type (tmp2, tmp);
9199 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9200 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9202 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9203 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9204 ftype = build_function_type (void_type_node, tmp);
9205 local_define_builtin ("__builtin_eh_copy_values", ftype,
9206 BUILT_IN_EH_COPY_VALUES,
9207 "__builtin_eh_copy_values", ECF_NOTHROW);
9209 /* Complex multiplication and division. These are handled as builtins
9210 rather than optabs because emit_library_call_value doesn't support
9211 complex. Further, we can do slightly better with folding these
9212 beasties if the real and complex parts of the arguments are separate. */
9216 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9218 char mode_name_buf[4], *q;
9220 enum built_in_function mcode, dcode;
9221 tree type, inner_type;
9223 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9226 inner_type = TREE_TYPE (type);
9228 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9229 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9230 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9231 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9232 ftype = build_function_type (type, tmp);
9234 mcode = ((enum built_in_function)
9235 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9236 dcode = ((enum built_in_function)
9237 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9239 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9243 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9244 local_define_builtin (built_in_names[mcode], ftype, mcode,
9245 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9247 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9248 local_define_builtin (built_in_names[dcode], ftype, dcode,
9249 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9254 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9257 If we requested a pointer to a vector, build up the pointers that
9258 we stripped off while looking for the inner type. Similarly for
9259 return values from functions.
9261 The argument TYPE is the top of the chain, and BOTTOM is the
9262 new type which we will point to. */
9265 reconstruct_complex_type (tree type, tree bottom)
9269 if (TREE_CODE (type) == POINTER_TYPE)
9271 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9272 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9273 TYPE_REF_CAN_ALIAS_ALL (type));
9275 else if (TREE_CODE (type) == REFERENCE_TYPE)
9277 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9278 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9279 TYPE_REF_CAN_ALIAS_ALL (type));
9281 else if (TREE_CODE (type) == ARRAY_TYPE)
9283 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9284 outer = build_array_type (inner, TYPE_DOMAIN (type));
9286 else if (TREE_CODE (type) == FUNCTION_TYPE)
9288 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9289 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9291 else if (TREE_CODE (type) == METHOD_TYPE)
9293 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9294 /* The build_method_type_directly() routine prepends 'this' to argument list,
9295 so we must compensate by getting rid of it. */
9297 = build_method_type_directly
9298 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9300 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9302 else if (TREE_CODE (type) == OFFSET_TYPE)
9304 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9305 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9310 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9314 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9317 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9321 switch (GET_MODE_CLASS (mode))
9323 case MODE_VECTOR_INT:
9324 case MODE_VECTOR_FLOAT:
9325 case MODE_VECTOR_FRACT:
9326 case MODE_VECTOR_UFRACT:
9327 case MODE_VECTOR_ACCUM:
9328 case MODE_VECTOR_UACCUM:
9329 nunits = GET_MODE_NUNITS (mode);
9333 /* Check that there are no leftover bits. */
9334 gcc_assert (GET_MODE_BITSIZE (mode)
9335 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9337 nunits = GET_MODE_BITSIZE (mode)
9338 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9345 return make_vector_type (innertype, nunits, mode);
9348 /* Similarly, but takes the inner type and number of units, which must be
9352 build_vector_type (tree innertype, int nunits)
9354 return make_vector_type (innertype, nunits, VOIDmode);
9357 /* Similarly, but takes the inner type and number of units, which must be
9361 build_opaque_vector_type (tree innertype, int nunits)
9364 innertype = build_distinct_type_copy (innertype);
9365 t = make_vector_type (innertype, nunits, VOIDmode);
9366 TYPE_VECTOR_OPAQUE (t) = true;
9371 /* Given an initializer INIT, return TRUE if INIT is zero or some
9372 aggregate of zeros. Otherwise return FALSE. */
9374 initializer_zerop (const_tree init)
9380 switch (TREE_CODE (init))
9383 return integer_zerop (init);
9386 /* ??? Note that this is not correct for C4X float formats. There,
9387 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9388 negative exponent. */
9389 return real_zerop (init)
9390 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9393 return fixed_zerop (init);
9396 return integer_zerop (init)
9397 || (real_zerop (init)
9398 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9399 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9402 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9403 if (!initializer_zerop (TREE_VALUE (elt)))
9409 unsigned HOST_WIDE_INT idx;
9411 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9412 if (!initializer_zerop (elt))
9421 /* We need to loop through all elements to handle cases like
9422 "\0" and "\0foobar". */
9423 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9424 if (TREE_STRING_POINTER (init)[i] != '\0')
9435 /* Build an empty statement at location LOC. */
9438 build_empty_stmt (location_t loc)
9440 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9441 SET_EXPR_LOCATION (t, loc);
9446 /* Build an OpenMP clause with code CODE. LOC is the location of the
9450 build_omp_clause (location_t loc, enum omp_clause_code code)
9455 length = omp_clause_num_ops[code];
9456 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9458 t = GGC_NEWVAR (union tree_node, size);
9459 memset (t, 0, size);
9460 TREE_SET_CODE (t, OMP_CLAUSE);
9461 OMP_CLAUSE_SET_CODE (t, code);
9462 OMP_CLAUSE_LOCATION (t) = loc;
9464 #ifdef GATHER_STATISTICS
9465 tree_node_counts[(int) omp_clause_kind]++;
9466 tree_node_sizes[(int) omp_clause_kind] += size;
9472 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9473 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9474 Except for the CODE and operand count field, other storage for the
9475 object is initialized to zeros. */
9478 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9481 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9483 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9484 gcc_assert (len >= 1);
9486 #ifdef GATHER_STATISTICS
9487 tree_node_counts[(int) e_kind]++;
9488 tree_node_sizes[(int) e_kind] += length;
9491 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9493 memset (t, 0, length);
9495 TREE_SET_CODE (t, code);
9497 /* Can't use TREE_OPERAND to store the length because if checking is
9498 enabled, it will try to check the length before we store it. :-P */
9499 t->exp.operands[0] = build_int_cst (sizetype, len);
9505 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9506 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9510 build_call_list (tree return_type, tree fn, tree arglist)
9515 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9516 TREE_TYPE (t) = return_type;
9517 CALL_EXPR_FN (t) = fn;
9518 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9519 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9520 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9521 process_call_operands (t);
9525 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9526 FN and a null static chain slot. NARGS is the number of call arguments
9527 which are specified as "..." arguments. */
9530 build_call_nary (tree return_type, tree fn, int nargs, ...)
9534 va_start (args, nargs);
9535 ret = build_call_valist (return_type, fn, nargs, args);
9540 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9541 FN and a null static chain slot. NARGS is the number of call arguments
9542 which are specified as a va_list ARGS. */
9545 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9550 t = build_vl_exp (CALL_EXPR, nargs + 3);
9551 TREE_TYPE (t) = return_type;
9552 CALL_EXPR_FN (t) = fn;
9553 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9554 for (i = 0; i < nargs; i++)
9555 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9556 process_call_operands (t);
9560 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9561 FN and a null static chain slot. NARGS is the number of call arguments
9562 which are specified as a tree array ARGS. */
9565 build_call_array_loc (location_t loc, tree return_type, tree fn,
9566 int nargs, const tree *args)
9571 t = build_vl_exp (CALL_EXPR, nargs + 3);
9572 TREE_TYPE (t) = return_type;
9573 CALL_EXPR_FN (t) = fn;
9574 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9575 for (i = 0; i < nargs; i++)
9576 CALL_EXPR_ARG (t, i) = args[i];
9577 process_call_operands (t);
9578 SET_EXPR_LOCATION (t, loc);
9582 /* Like build_call_array, but takes a VEC. */
9585 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9590 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9591 TREE_TYPE (ret) = return_type;
9592 CALL_EXPR_FN (ret) = fn;
9593 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9594 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9595 CALL_EXPR_ARG (ret, ix) = t;
9596 process_call_operands (ret);
9601 /* Returns true if it is possible to prove that the index of
9602 an array access REF (an ARRAY_REF expression) falls into the
9606 in_array_bounds_p (tree ref)
9608 tree idx = TREE_OPERAND (ref, 1);
9611 if (TREE_CODE (idx) != INTEGER_CST)
9614 min = array_ref_low_bound (ref);
9615 max = array_ref_up_bound (ref);
9618 || TREE_CODE (min) != INTEGER_CST
9619 || TREE_CODE (max) != INTEGER_CST)
9622 if (tree_int_cst_lt (idx, min)
9623 || tree_int_cst_lt (max, idx))
9629 /* Returns true if it is possible to prove that the range of
9630 an array access REF (an ARRAY_RANGE_REF expression) falls
9631 into the array bounds. */
9634 range_in_array_bounds_p (tree ref)
9636 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9637 tree range_min, range_max, min, max;
9639 range_min = TYPE_MIN_VALUE (domain_type);
9640 range_max = TYPE_MAX_VALUE (domain_type);
9643 || TREE_CODE (range_min) != INTEGER_CST
9644 || TREE_CODE (range_max) != INTEGER_CST)
9647 min = array_ref_low_bound (ref);
9648 max = array_ref_up_bound (ref);
9651 || TREE_CODE (min) != INTEGER_CST
9652 || TREE_CODE (max) != INTEGER_CST)
9655 if (tree_int_cst_lt (range_min, min)
9656 || tree_int_cst_lt (max, range_max))
9662 /* Return true if T (assumed to be a DECL) must be assigned a memory
9666 needs_to_live_in_memory (const_tree t)
9668 if (TREE_CODE (t) == SSA_NAME)
9669 t = SSA_NAME_VAR (t);
9671 return (TREE_ADDRESSABLE (t)
9672 || is_global_var (t)
9673 || (TREE_CODE (t) == RESULT_DECL
9674 && aggregate_value_p (t, current_function_decl)));
9677 /* There are situations in which a language considers record types
9678 compatible which have different field lists. Decide if two fields
9679 are compatible. It is assumed that the parent records are compatible. */
9682 fields_compatible_p (const_tree f1, const_tree f2)
9684 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9685 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9688 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9689 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9692 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9698 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9701 find_compatible_field (tree record, tree orig_field)
9705 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9706 if (TREE_CODE (f) == FIELD_DECL
9707 && fields_compatible_p (f, orig_field))
9710 /* ??? Why isn't this on the main fields list? */
9711 f = TYPE_VFIELD (record);
9712 if (f && TREE_CODE (f) == FIELD_DECL
9713 && fields_compatible_p (f, orig_field))
9716 /* ??? We should abort here, but Java appears to do Bad Things
9717 with inherited fields. */
9721 /* Return value of a constant X and sign-extend it. */
9724 int_cst_value (const_tree x)
9726 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9727 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9729 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9730 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9731 || TREE_INT_CST_HIGH (x) == -1);
9733 if (bits < HOST_BITS_PER_WIDE_INT)
9735 bool negative = ((val >> (bits - 1)) & 1) != 0;
9737 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9739 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9745 /* Return value of a constant X and sign-extend it. */
9748 widest_int_cst_value (const_tree x)
9750 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9751 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9753 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9754 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9755 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9756 << HOST_BITS_PER_WIDE_INT);
9758 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9759 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9760 || TREE_INT_CST_HIGH (x) == -1);
9763 if (bits < HOST_BITS_PER_WIDEST_INT)
9765 bool negative = ((val >> (bits - 1)) & 1) != 0;
9767 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9769 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9775 /* If TYPE is an integral type, return an equivalent type which is
9776 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9777 return TYPE itself. */
9780 signed_or_unsigned_type_for (int unsignedp, tree type)
9783 if (POINTER_TYPE_P (type))
9785 /* If the pointer points to the normal address space, use the
9786 size_type_node. Otherwise use an appropriate size for the pointer
9787 based on the named address space it points to. */
9788 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9791 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9794 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9797 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9800 /* Returns unsigned variant of TYPE. */
9803 unsigned_type_for (tree type)
9805 return signed_or_unsigned_type_for (1, type);
9808 /* Returns signed variant of TYPE. */
9811 signed_type_for (tree type)
9813 return signed_or_unsigned_type_for (0, type);
9816 /* Returns the largest value obtainable by casting something in INNER type to
9820 upper_bound_in_type (tree outer, tree inner)
9822 unsigned HOST_WIDE_INT lo, hi;
9823 unsigned int det = 0;
9824 unsigned oprec = TYPE_PRECISION (outer);
9825 unsigned iprec = TYPE_PRECISION (inner);
9828 /* Compute a unique number for every combination. */
9829 det |= (oprec > iprec) ? 4 : 0;
9830 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9831 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9833 /* Determine the exponent to use. */
9838 /* oprec <= iprec, outer: signed, inner: don't care. */
9843 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9847 /* oprec > iprec, outer: signed, inner: signed. */
9851 /* oprec > iprec, outer: signed, inner: unsigned. */
9855 /* oprec > iprec, outer: unsigned, inner: signed. */
9859 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9866 /* Compute 2^^prec - 1. */
9867 if (prec <= HOST_BITS_PER_WIDE_INT)
9870 lo = ((~(unsigned HOST_WIDE_INT) 0)
9871 >> (HOST_BITS_PER_WIDE_INT - prec));
9875 hi = ((~(unsigned HOST_WIDE_INT) 0)
9876 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9877 lo = ~(unsigned HOST_WIDE_INT) 0;
9880 return build_int_cst_wide (outer, lo, hi);
9883 /* Returns the smallest value obtainable by casting something in INNER type to
9887 lower_bound_in_type (tree outer, tree inner)
9889 unsigned HOST_WIDE_INT lo, hi;
9890 unsigned oprec = TYPE_PRECISION (outer);
9891 unsigned iprec = TYPE_PRECISION (inner);
9893 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9895 if (TYPE_UNSIGNED (outer)
9896 /* If we are widening something of an unsigned type, OUTER type
9897 contains all values of INNER type. In particular, both INNER
9898 and OUTER types have zero in common. */
9899 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9903 /* If we are widening a signed type to another signed type, we
9904 want to obtain -2^^(iprec-1). If we are keeping the
9905 precision or narrowing to a signed type, we want to obtain
9907 unsigned prec = oprec > iprec ? iprec : oprec;
9909 if (prec <= HOST_BITS_PER_WIDE_INT)
9911 hi = ~(unsigned HOST_WIDE_INT) 0;
9912 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9916 hi = ((~(unsigned HOST_WIDE_INT) 0)
9917 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9922 return build_int_cst_wide (outer, lo, hi);
9925 /* Return nonzero if two operands that are suitable for PHI nodes are
9926 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9927 SSA_NAME or invariant. Note that this is strictly an optimization.
9928 That is, callers of this function can directly call operand_equal_p
9929 and get the same result, only slower. */
9932 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9936 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9938 return operand_equal_p (arg0, arg1, 0);
9941 /* Returns number of zeros at the end of binary representation of X.
9943 ??? Use ffs if available? */
9946 num_ending_zeros (const_tree x)
9948 unsigned HOST_WIDE_INT fr, nfr;
9949 unsigned num, abits;
9950 tree type = TREE_TYPE (x);
9952 if (TREE_INT_CST_LOW (x) == 0)
9954 num = HOST_BITS_PER_WIDE_INT;
9955 fr = TREE_INT_CST_HIGH (x);
9960 fr = TREE_INT_CST_LOW (x);
9963 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9966 if (nfr << abits == fr)
9973 if (num > TYPE_PRECISION (type))
9974 num = TYPE_PRECISION (type);
9976 return build_int_cst_type (type, num);
9980 #define WALK_SUBTREE(NODE) \
9983 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9989 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9990 be walked whenever a type is seen in the tree. Rest of operands and return
9991 value are as for walk_tree. */
9994 walk_type_fields (tree type, walk_tree_fn func, void *data,
9995 struct pointer_set_t *pset, walk_tree_lh lh)
9997 tree result = NULL_TREE;
9999 switch (TREE_CODE (type))
10002 case REFERENCE_TYPE:
10003 /* We have to worry about mutually recursive pointers. These can't
10004 be written in C. They can in Ada. It's pathological, but
10005 there's an ACATS test (c38102a) that checks it. Deal with this
10006 by checking if we're pointing to another pointer, that one
10007 points to another pointer, that one does too, and we have no htab.
10008 If so, get a hash table. We check three levels deep to avoid
10009 the cost of the hash table if we don't need one. */
10010 if (POINTER_TYPE_P (TREE_TYPE (type))
10011 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10012 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10015 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10023 /* ... fall through ... */
10026 WALK_SUBTREE (TREE_TYPE (type));
10030 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10032 /* Fall through. */
10034 case FUNCTION_TYPE:
10035 WALK_SUBTREE (TREE_TYPE (type));
10039 /* We never want to walk into default arguments. */
10040 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10041 WALK_SUBTREE (TREE_VALUE (arg));
10046 /* Don't follow this nodes's type if a pointer for fear that
10047 we'll have infinite recursion. If we have a PSET, then we
10050 || (!POINTER_TYPE_P (TREE_TYPE (type))
10051 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10052 WALK_SUBTREE (TREE_TYPE (type));
10053 WALK_SUBTREE (TYPE_DOMAIN (type));
10057 WALK_SUBTREE (TREE_TYPE (type));
10058 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10068 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10069 called with the DATA and the address of each sub-tree. If FUNC returns a
10070 non-NULL value, the traversal is stopped, and the value returned by FUNC
10071 is returned. If PSET is non-NULL it is used to record the nodes visited,
10072 and to avoid visiting a node more than once. */
10075 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10076 struct pointer_set_t *pset, walk_tree_lh lh)
10078 enum tree_code code;
10082 #define WALK_SUBTREE_TAIL(NODE) \
10086 goto tail_recurse; \
10091 /* Skip empty subtrees. */
10095 /* Don't walk the same tree twice, if the user has requested
10096 that we avoid doing so. */
10097 if (pset && pointer_set_insert (pset, *tp))
10100 /* Call the function. */
10102 result = (*func) (tp, &walk_subtrees, data);
10104 /* If we found something, return it. */
10108 code = TREE_CODE (*tp);
10110 /* Even if we didn't, FUNC may have decided that there was nothing
10111 interesting below this point in the tree. */
10112 if (!walk_subtrees)
10114 /* But we still need to check our siblings. */
10115 if (code == TREE_LIST)
10116 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10117 else if (code == OMP_CLAUSE)
10118 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10125 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10126 if (result || !walk_subtrees)
10133 case IDENTIFIER_NODE:
10140 case PLACEHOLDER_EXPR:
10144 /* None of these have subtrees other than those already walked
10149 WALK_SUBTREE (TREE_VALUE (*tp));
10150 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10155 int len = TREE_VEC_LENGTH (*tp);
10160 /* Walk all elements but the first. */
10162 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10164 /* Now walk the first one as a tail call. */
10165 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10169 WALK_SUBTREE (TREE_REALPART (*tp));
10170 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10174 unsigned HOST_WIDE_INT idx;
10175 constructor_elt *ce;
10178 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10180 WALK_SUBTREE (ce->value);
10185 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10190 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10192 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10193 into declarations that are just mentioned, rather than
10194 declared; they don't really belong to this part of the tree.
10195 And, we can see cycles: the initializer for a declaration
10196 can refer to the declaration itself. */
10197 WALK_SUBTREE (DECL_INITIAL (decl));
10198 WALK_SUBTREE (DECL_SIZE (decl));
10199 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10201 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10204 case STATEMENT_LIST:
10206 tree_stmt_iterator i;
10207 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10208 WALK_SUBTREE (*tsi_stmt_ptr (i));
10213 switch (OMP_CLAUSE_CODE (*tp))
10215 case OMP_CLAUSE_PRIVATE:
10216 case OMP_CLAUSE_SHARED:
10217 case OMP_CLAUSE_FIRSTPRIVATE:
10218 case OMP_CLAUSE_COPYIN:
10219 case OMP_CLAUSE_COPYPRIVATE:
10220 case OMP_CLAUSE_IF:
10221 case OMP_CLAUSE_NUM_THREADS:
10222 case OMP_CLAUSE_SCHEDULE:
10223 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10226 case OMP_CLAUSE_NOWAIT:
10227 case OMP_CLAUSE_ORDERED:
10228 case OMP_CLAUSE_DEFAULT:
10229 case OMP_CLAUSE_UNTIED:
10230 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10232 case OMP_CLAUSE_LASTPRIVATE:
10233 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10234 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10235 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10237 case OMP_CLAUSE_COLLAPSE:
10240 for (i = 0; i < 3; i++)
10241 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10242 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10245 case OMP_CLAUSE_REDUCTION:
10248 for (i = 0; i < 4; i++)
10249 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10250 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10254 gcc_unreachable ();
10262 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10263 But, we only want to walk once. */
10264 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10265 for (i = 0; i < len; ++i)
10266 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10267 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10271 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10272 defining. We only want to walk into these fields of a type in this
10273 case and not in the general case of a mere reference to the type.
10275 The criterion is as follows: if the field can be an expression, it
10276 must be walked only here. This should be in keeping with the fields
10277 that are directly gimplified in gimplify_type_sizes in order for the
10278 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10279 variable-sized types.
10281 Note that DECLs get walked as part of processing the BIND_EXPR. */
10282 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10284 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10285 if (TREE_CODE (*type_p) == ERROR_MARK)
10288 /* Call the function for the type. See if it returns anything or
10289 doesn't want us to continue. If we are to continue, walk both
10290 the normal fields and those for the declaration case. */
10291 result = (*func) (type_p, &walk_subtrees, data);
10292 if (result || !walk_subtrees)
10295 result = walk_type_fields (*type_p, func, data, pset, lh);
10299 /* If this is a record type, also walk the fields. */
10300 if (RECORD_OR_UNION_TYPE_P (*type_p))
10304 for (field = TYPE_FIELDS (*type_p); field;
10305 field = TREE_CHAIN (field))
10307 /* We'd like to look at the type of the field, but we can
10308 easily get infinite recursion. So assume it's pointed
10309 to elsewhere in the tree. Also, ignore things that
10311 if (TREE_CODE (field) != FIELD_DECL)
10314 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10315 WALK_SUBTREE (DECL_SIZE (field));
10316 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10317 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10318 WALK_SUBTREE (DECL_QUALIFIER (field));
10322 /* Same for scalar types. */
10323 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10324 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10325 || TREE_CODE (*type_p) == INTEGER_TYPE
10326 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10327 || TREE_CODE (*type_p) == REAL_TYPE)
10329 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10330 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10333 WALK_SUBTREE (TYPE_SIZE (*type_p));
10334 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10339 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10343 /* Walk over all the sub-trees of this operand. */
10344 len = TREE_OPERAND_LENGTH (*tp);
10346 /* Go through the subtrees. We need to do this in forward order so
10347 that the scope of a FOR_EXPR is handled properly. */
10350 for (i = 0; i < len - 1; ++i)
10351 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10352 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10355 /* If this is a type, walk the needed fields in the type. */
10356 else if (TYPE_P (*tp))
10357 return walk_type_fields (*tp, func, data, pset, lh);
10361 /* We didn't find what we were looking for. */
10364 #undef WALK_SUBTREE_TAIL
10366 #undef WALK_SUBTREE
10368 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10371 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10375 struct pointer_set_t *pset;
10377 pset = pointer_set_create ();
10378 result = walk_tree_1 (tp, func, data, pset, lh);
10379 pointer_set_destroy (pset);
10385 tree_block (tree t)
10387 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10389 if (IS_EXPR_CODE_CLASS (c))
10390 return &t->exp.block;
10391 gcc_unreachable ();
10395 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10396 FIXME: don't use this function. It exists for compatibility with
10397 the old representation of CALL_EXPRs where a list was used to hold the
10398 arguments. Places that currently extract the arglist from a CALL_EXPR
10399 ought to be rewritten to use the CALL_EXPR itself. */
10401 call_expr_arglist (tree exp)
10403 tree arglist = NULL_TREE;
10405 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10406 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10411 /* Create a nameless artificial label and put it in the current
10412 function context. The label has a location of LOC. Returns the
10413 newly created label. */
10416 create_artificial_label (location_t loc)
10418 tree lab = build_decl (loc,
10419 LABEL_DECL, NULL_TREE, void_type_node);
10421 DECL_ARTIFICIAL (lab) = 1;
10422 DECL_IGNORED_P (lab) = 1;
10423 DECL_CONTEXT (lab) = current_function_decl;
10427 /* Given a tree, try to return a useful variable name that we can use
10428 to prefix a temporary that is being assigned the value of the tree.
10429 I.E. given <temp> = &A, return A. */
10434 tree stripped_decl;
10437 STRIP_NOPS (stripped_decl);
10438 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10439 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10442 switch (TREE_CODE (stripped_decl))
10445 return get_name (TREE_OPERAND (stripped_decl, 0));
10452 /* Return true if TYPE has a variable argument list. */
10455 stdarg_p (tree fntype)
10457 function_args_iterator args_iter;
10458 tree n = NULL_TREE, t;
10463 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10468 return n != NULL_TREE && n != void_type_node;
10471 /* Return true if TYPE has a prototype. */
10474 prototype_p (tree fntype)
10478 gcc_assert (fntype != NULL_TREE);
10480 t = TYPE_ARG_TYPES (fntype);
10481 return (t != NULL_TREE);
10484 /* If BLOCK is inlined from an __attribute__((__artificial__))
10485 routine, return pointer to location from where it has been
10488 block_nonartificial_location (tree block)
10490 location_t *ret = NULL;
10492 while (block && TREE_CODE (block) == BLOCK
10493 && BLOCK_ABSTRACT_ORIGIN (block))
10495 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10497 while (TREE_CODE (ao) == BLOCK
10498 && BLOCK_ABSTRACT_ORIGIN (ao)
10499 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10500 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10502 if (TREE_CODE (ao) == FUNCTION_DECL)
10504 /* If AO is an artificial inline, point RET to the
10505 call site locus at which it has been inlined and continue
10506 the loop, in case AO's caller is also an artificial
10508 if (DECL_DECLARED_INLINE_P (ao)
10509 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10510 ret = &BLOCK_SOURCE_LOCATION (block);
10514 else if (TREE_CODE (ao) != BLOCK)
10517 block = BLOCK_SUPERCONTEXT (block);
10523 /* If EXP is inlined from an __attribute__((__artificial__))
10524 function, return the location of the original call expression. */
10527 tree_nonartificial_location (tree exp)
10529 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10534 return EXPR_LOCATION (exp);
10538 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10541 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10544 cl_option_hash_hash (const void *x)
10546 const_tree const t = (const_tree) x;
10550 hashval_t hash = 0;
10552 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10554 p = (const char *)TREE_OPTIMIZATION (t);
10555 len = sizeof (struct cl_optimization);
10558 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10560 p = (const char *)TREE_TARGET_OPTION (t);
10561 len = sizeof (struct cl_target_option);
10565 gcc_unreachable ();
10567 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10569 for (i = 0; i < len; i++)
10571 hash = (hash << 4) ^ ((i << 2) | p[i]);
10576 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10577 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10581 cl_option_hash_eq (const void *x, const void *y)
10583 const_tree const xt = (const_tree) x;
10584 const_tree const yt = (const_tree) y;
10589 if (TREE_CODE (xt) != TREE_CODE (yt))
10592 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10594 xp = (const char *)TREE_OPTIMIZATION (xt);
10595 yp = (const char *)TREE_OPTIMIZATION (yt);
10596 len = sizeof (struct cl_optimization);
10599 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10601 xp = (const char *)TREE_TARGET_OPTION (xt);
10602 yp = (const char *)TREE_TARGET_OPTION (yt);
10603 len = sizeof (struct cl_target_option);
10607 gcc_unreachable ();
10609 return (memcmp (xp, yp, len) == 0);
10612 /* Build an OPTIMIZATION_NODE based on the current options. */
10615 build_optimization_node (void)
10620 /* Use the cache of optimization nodes. */
10622 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10624 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10628 /* Insert this one into the hash table. */
10629 t = cl_optimization_node;
10632 /* Make a new node for next time round. */
10633 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10639 /* Build a TARGET_OPTION_NODE based on the current options. */
10642 build_target_option_node (void)
10647 /* Use the cache of optimization nodes. */
10649 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10651 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10655 /* Insert this one into the hash table. */
10656 t = cl_target_option_node;
10659 /* Make a new node for next time round. */
10660 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10666 /* Determine the "ultimate origin" of a block. The block may be an inlined
10667 instance of an inlined instance of a block which is local to an inline
10668 function, so we have to trace all of the way back through the origin chain
10669 to find out what sort of node actually served as the original seed for the
10673 block_ultimate_origin (const_tree block)
10675 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10677 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10678 nodes in the function to point to themselves; ignore that if
10679 we're trying to output the abstract instance of this function. */
10680 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10683 if (immediate_origin == NULL_TREE)
10688 tree lookahead = immediate_origin;
10692 ret_val = lookahead;
10693 lookahead = (TREE_CODE (ret_val) == BLOCK
10694 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10696 while (lookahead != NULL && lookahead != ret_val);
10698 /* The block's abstract origin chain may not be the *ultimate* origin of
10699 the block. It could lead to a DECL that has an abstract origin set.
10700 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10701 will give us if it has one). Note that DECL's abstract origins are
10702 supposed to be the most distant ancestor (or so decl_ultimate_origin
10703 claims), so we don't need to loop following the DECL origins. */
10704 if (DECL_P (ret_val))
10705 return DECL_ORIGIN (ret_val);
10711 /* Return true if T1 and T2 are equivalent lists. */
10714 list_equal_p (const_tree t1, const_tree t2)
10716 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10717 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10722 /* Return true iff conversion in EXP generates no instruction. Mark
10723 it inline so that we fully inline into the stripping functions even
10724 though we have two uses of this function. */
10727 tree_nop_conversion (const_tree exp)
10729 tree outer_type, inner_type;
10731 if (!CONVERT_EXPR_P (exp)
10732 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10734 if (TREE_OPERAND (exp, 0) == error_mark_node)
10737 outer_type = TREE_TYPE (exp);
10738 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10743 /* Use precision rather then machine mode when we can, which gives
10744 the correct answer even for submode (bit-field) types. */
10745 if ((INTEGRAL_TYPE_P (outer_type)
10746 || POINTER_TYPE_P (outer_type)
10747 || TREE_CODE (outer_type) == OFFSET_TYPE)
10748 && (INTEGRAL_TYPE_P (inner_type)
10749 || POINTER_TYPE_P (inner_type)
10750 || TREE_CODE (inner_type) == OFFSET_TYPE))
10751 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10753 /* Otherwise fall back on comparing machine modes (e.g. for
10754 aggregate types, floats). */
10755 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10758 /* Return true iff conversion in EXP generates no instruction. Don't
10759 consider conversions changing the signedness. */
10762 tree_sign_nop_conversion (const_tree exp)
10764 tree outer_type, inner_type;
10766 if (!tree_nop_conversion (exp))
10769 outer_type = TREE_TYPE (exp);
10770 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10772 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10773 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10776 /* Strip conversions from EXP according to tree_nop_conversion and
10777 return the resulting expression. */
10780 tree_strip_nop_conversions (tree exp)
10782 while (tree_nop_conversion (exp))
10783 exp = TREE_OPERAND (exp, 0);
10787 /* Strip conversions from EXP according to tree_sign_nop_conversion
10788 and return the resulting expression. */
10791 tree_strip_sign_nop_conversions (tree exp)
10793 while (tree_sign_nop_conversion (exp))
10794 exp = TREE_OPERAND (exp, 0);
10798 static GTY(()) tree gcc_eh_personality_decl;
10800 /* Return the GCC personality function decl. */
10803 lhd_gcc_personality (void)
10805 if (!gcc_eh_personality_decl)
10806 gcc_eh_personality_decl
10807 = build_personality_function (USING_SJLJ_EXCEPTIONS
10808 ? "__gcc_personality_sj0"
10809 : "__gcc_personality_v0");
10811 return gcc_eh_personality_decl;
10814 #include "gt-tree.h"