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 /* These are the hash table functions for the hash table of INTEGER_CST
1086 nodes of a sizetype. */
1088 /* Return the hash code code X, an INTEGER_CST. */
1091 int_cst_hash_hash (const void *x)
1093 const_tree const t = (const_tree) x;
1095 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1096 ^ htab_hash_pointer (TREE_TYPE (t)));
1099 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1100 is the same as that given by *Y, which is the same. */
1103 int_cst_hash_eq (const void *x, const void *y)
1105 const_tree const xt = (const_tree) x;
1106 const_tree const yt = (const_tree) y;
1108 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1109 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1110 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1113 /* Create an INT_CST node of TYPE and value HI:LOW.
1114 The returned node is always shared. For small integers we use a
1115 per-type vector cache, for larger ones we use a single hash table. */
1118 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1126 switch (TREE_CODE (type))
1129 case REFERENCE_TYPE:
1130 /* Cache NULL pointer. */
1139 /* Cache false or true. */
1147 if (TYPE_UNSIGNED (type))
1150 limit = INTEGER_SHARE_LIMIT;
1151 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1157 limit = INTEGER_SHARE_LIMIT + 1;
1158 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1160 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1174 /* Look for it in the type's vector of small shared ints. */
1175 if (!TYPE_CACHED_VALUES_P (type))
1177 TYPE_CACHED_VALUES_P (type) = 1;
1178 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1181 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1184 /* Make sure no one is clobbering the shared constant. */
1185 gcc_assert (TREE_TYPE (t) == type);
1186 gcc_assert (TREE_INT_CST_LOW (t) == low);
1187 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1191 /* Create a new shared int. */
1192 t = make_node (INTEGER_CST);
1194 TREE_INT_CST_LOW (t) = low;
1195 TREE_INT_CST_HIGH (t) = hi;
1196 TREE_TYPE (t) = type;
1198 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1203 /* Use the cache of larger shared ints. */
1206 TREE_INT_CST_LOW (int_cst_node) = low;
1207 TREE_INT_CST_HIGH (int_cst_node) = hi;
1208 TREE_TYPE (int_cst_node) = type;
1210 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1214 /* Insert this one into the hash table. */
1217 /* Make a new node for next time round. */
1218 int_cst_node = make_node (INTEGER_CST);
1225 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1226 and the rest are zeros. */
1229 build_low_bits_mask (tree type, unsigned bits)
1233 gcc_assert (bits <= TYPE_PRECISION (type));
1235 if (bits == TYPE_PRECISION (type)
1236 && !TYPE_UNSIGNED (type))
1237 /* Sign extended all-ones mask. */
1238 mask = double_int_minus_one;
1240 mask = double_int_mask (bits);
1242 return build_int_cst_wide (type, mask.low, mask.high);
1245 /* Checks that X is integer constant that can be expressed in (unsigned)
1246 HOST_WIDE_INT without loss of precision. */
1249 cst_and_fits_in_hwi (const_tree x)
1251 if (TREE_CODE (x) != INTEGER_CST)
1254 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1257 return (TREE_INT_CST_HIGH (x) == 0
1258 || TREE_INT_CST_HIGH (x) == -1);
1261 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1262 are in a list pointed to by VALS. */
1265 build_vector (tree type, tree vals)
1267 tree v = make_node (VECTOR_CST);
1271 TREE_VECTOR_CST_ELTS (v) = vals;
1272 TREE_TYPE (v) = type;
1274 /* Iterate through elements and check for overflow. */
1275 for (link = vals; link; link = TREE_CHAIN (link))
1277 tree value = TREE_VALUE (link);
1279 /* Don't crash if we get an address constant. */
1280 if (!CONSTANT_CLASS_P (value))
1283 over |= TREE_OVERFLOW (value);
1286 TREE_OVERFLOW (v) = over;
1290 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1291 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1294 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1296 tree list = NULL_TREE;
1297 unsigned HOST_WIDE_INT idx;
1300 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1301 list = tree_cons (NULL_TREE, value, list);
1302 return build_vector (type, nreverse (list));
1305 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1306 are in the VEC pointed to by VALS. */
1308 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1310 tree c = make_node (CONSTRUCTOR);
1311 TREE_TYPE (c) = type;
1312 CONSTRUCTOR_ELTS (c) = vals;
1316 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1319 build_constructor_single (tree type, tree index, tree value)
1321 VEC(constructor_elt,gc) *v;
1322 constructor_elt *elt;
1325 v = VEC_alloc (constructor_elt, gc, 1);
1326 elt = VEC_quick_push (constructor_elt, v, NULL);
1330 t = build_constructor (type, v);
1331 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1336 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1337 are in a list pointed to by VALS. */
1339 build_constructor_from_list (tree type, tree vals)
1342 VEC(constructor_elt,gc) *v = NULL;
1343 bool constant_p = true;
1347 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1348 for (t = vals; t; t = TREE_CHAIN (t))
1350 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1351 val = TREE_VALUE (t);
1352 elt->index = TREE_PURPOSE (t);
1354 if (!TREE_CONSTANT (val))
1359 t = build_constructor (type, v);
1360 TREE_CONSTANT (t) = constant_p;
1364 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1367 build_fixed (tree type, FIXED_VALUE_TYPE f)
1370 FIXED_VALUE_TYPE *fp;
1372 v = make_node (FIXED_CST);
1373 fp = GGC_NEW (FIXED_VALUE_TYPE);
1374 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1376 TREE_TYPE (v) = type;
1377 TREE_FIXED_CST_PTR (v) = fp;
1381 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1384 build_real (tree type, REAL_VALUE_TYPE d)
1387 REAL_VALUE_TYPE *dp;
1390 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1391 Consider doing it via real_convert now. */
1393 v = make_node (REAL_CST);
1394 dp = GGC_NEW (REAL_VALUE_TYPE);
1395 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1397 TREE_TYPE (v) = type;
1398 TREE_REAL_CST_PTR (v) = dp;
1399 TREE_OVERFLOW (v) = overflow;
1403 /* Return a new REAL_CST node whose type is TYPE
1404 and whose value is the integer value of the INTEGER_CST node I. */
1407 real_value_from_int_cst (const_tree type, const_tree i)
1411 /* Clear all bits of the real value type so that we can later do
1412 bitwise comparisons to see if two values are the same. */
1413 memset (&d, 0, sizeof d);
1415 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1416 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1417 TYPE_UNSIGNED (TREE_TYPE (i)));
1421 /* Given a tree representing an integer constant I, return a tree
1422 representing the same value as a floating-point constant of type TYPE. */
1425 build_real_from_int_cst (tree type, const_tree i)
1428 int overflow = TREE_OVERFLOW (i);
1430 v = build_real (type, real_value_from_int_cst (type, i));
1432 TREE_OVERFLOW (v) |= overflow;
1436 /* Return a newly constructed STRING_CST node whose value is
1437 the LEN characters at STR.
1438 The TREE_TYPE is not initialized. */
1441 build_string (int len, const char *str)
1446 /* Do not waste bytes provided by padding of struct tree_string. */
1447 length = len + offsetof (struct tree_string, str) + 1;
1449 #ifdef GATHER_STATISTICS
1450 tree_node_counts[(int) c_kind]++;
1451 tree_node_sizes[(int) c_kind] += length;
1454 s = ggc_alloc_tree (length);
1456 memset (s, 0, sizeof (struct tree_common));
1457 TREE_SET_CODE (s, STRING_CST);
1458 TREE_CONSTANT (s) = 1;
1459 TREE_STRING_LENGTH (s) = len;
1460 memcpy (s->string.str, str, len);
1461 s->string.str[len] = '\0';
1466 /* Return a newly constructed COMPLEX_CST node whose value is
1467 specified by the real and imaginary parts REAL and IMAG.
1468 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1469 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1472 build_complex (tree type, tree real, tree imag)
1474 tree t = make_node (COMPLEX_CST);
1476 TREE_REALPART (t) = real;
1477 TREE_IMAGPART (t) = imag;
1478 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1479 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1483 /* Return a constant of arithmetic type TYPE which is the
1484 multiplicative identity of the set TYPE. */
1487 build_one_cst (tree type)
1489 switch (TREE_CODE (type))
1491 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1492 case POINTER_TYPE: case REFERENCE_TYPE:
1494 return build_int_cst (type, 1);
1497 return build_real (type, dconst1);
1499 case FIXED_POINT_TYPE:
1500 /* We can only generate 1 for accum types. */
1501 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1502 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1509 scalar = build_one_cst (TREE_TYPE (type));
1511 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1513 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1514 cst = tree_cons (NULL_TREE, scalar, cst);
1516 return build_vector (type, cst);
1520 return build_complex (type,
1521 build_one_cst (TREE_TYPE (type)),
1522 fold_convert (TREE_TYPE (type), integer_zero_node));
1529 /* Build a BINFO with LEN language slots. */
1532 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1535 size_t length = (offsetof (struct tree_binfo, base_binfos)
1536 + VEC_embedded_size (tree, base_binfos));
1538 #ifdef GATHER_STATISTICS
1539 tree_node_counts[(int) binfo_kind]++;
1540 tree_node_sizes[(int) binfo_kind] += length;
1543 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1545 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1547 TREE_SET_CODE (t, TREE_BINFO);
1549 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1555 /* Build a newly constructed TREE_VEC node of length LEN. */
1558 make_tree_vec_stat (int len MEM_STAT_DECL)
1561 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1563 #ifdef GATHER_STATISTICS
1564 tree_node_counts[(int) vec_kind]++;
1565 tree_node_sizes[(int) vec_kind] += length;
1568 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1570 memset (t, 0, length);
1572 TREE_SET_CODE (t, TREE_VEC);
1573 TREE_VEC_LENGTH (t) = len;
1578 /* Return 1 if EXPR is the integer constant zero or a complex constant
1582 integer_zerop (const_tree expr)
1586 return ((TREE_CODE (expr) == INTEGER_CST
1587 && TREE_INT_CST_LOW (expr) == 0
1588 && TREE_INT_CST_HIGH (expr) == 0)
1589 || (TREE_CODE (expr) == COMPLEX_CST
1590 && integer_zerop (TREE_REALPART (expr))
1591 && integer_zerop (TREE_IMAGPART (expr))));
1594 /* Return 1 if EXPR is the integer constant one or the corresponding
1595 complex constant. */
1598 integer_onep (const_tree expr)
1602 return ((TREE_CODE (expr) == INTEGER_CST
1603 && TREE_INT_CST_LOW (expr) == 1
1604 && TREE_INT_CST_HIGH (expr) == 0)
1605 || (TREE_CODE (expr) == COMPLEX_CST
1606 && integer_onep (TREE_REALPART (expr))
1607 && integer_zerop (TREE_IMAGPART (expr))));
1610 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1611 it contains. Likewise for the corresponding complex constant. */
1614 integer_all_onesp (const_tree expr)
1621 if (TREE_CODE (expr) == COMPLEX_CST
1622 && integer_all_onesp (TREE_REALPART (expr))
1623 && integer_zerop (TREE_IMAGPART (expr)))
1626 else if (TREE_CODE (expr) != INTEGER_CST)
1629 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1630 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1631 && TREE_INT_CST_HIGH (expr) == -1)
1636 /* Note that using TYPE_PRECISION here is wrong. We care about the
1637 actual bits, not the (arbitrary) range of the type. */
1638 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1639 if (prec >= HOST_BITS_PER_WIDE_INT)
1641 HOST_WIDE_INT high_value;
1644 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1646 /* Can not handle precisions greater than twice the host int size. */
1647 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1648 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1649 /* Shifting by the host word size is undefined according to the ANSI
1650 standard, so we must handle this as a special case. */
1653 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1655 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1656 && TREE_INT_CST_HIGH (expr) == high_value);
1659 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1662 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1666 integer_pow2p (const_tree expr)
1669 HOST_WIDE_INT high, low;
1673 if (TREE_CODE (expr) == COMPLEX_CST
1674 && integer_pow2p (TREE_REALPART (expr))
1675 && integer_zerop (TREE_IMAGPART (expr)))
1678 if (TREE_CODE (expr) != INTEGER_CST)
1681 prec = TYPE_PRECISION (TREE_TYPE (expr));
1682 high = TREE_INT_CST_HIGH (expr);
1683 low = TREE_INT_CST_LOW (expr);
1685 /* First clear all bits that are beyond the type's precision in case
1686 we've been sign extended. */
1688 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1690 else if (prec > HOST_BITS_PER_WIDE_INT)
1691 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1695 if (prec < HOST_BITS_PER_WIDE_INT)
1696 low &= ~((HOST_WIDE_INT) (-1) << prec);
1699 if (high == 0 && low == 0)
1702 return ((high == 0 && (low & (low - 1)) == 0)
1703 || (low == 0 && (high & (high - 1)) == 0));
1706 /* Return 1 if EXPR is an integer constant other than zero or a
1707 complex constant other than zero. */
1710 integer_nonzerop (const_tree expr)
1714 return ((TREE_CODE (expr) == INTEGER_CST
1715 && (TREE_INT_CST_LOW (expr) != 0
1716 || TREE_INT_CST_HIGH (expr) != 0))
1717 || (TREE_CODE (expr) == COMPLEX_CST
1718 && (integer_nonzerop (TREE_REALPART (expr))
1719 || integer_nonzerop (TREE_IMAGPART (expr)))));
1722 /* Return 1 if EXPR is the fixed-point constant zero. */
1725 fixed_zerop (const_tree expr)
1727 return (TREE_CODE (expr) == FIXED_CST
1728 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1731 /* Return the power of two represented by a tree node known to be a
1735 tree_log2 (const_tree expr)
1738 HOST_WIDE_INT high, low;
1742 if (TREE_CODE (expr) == COMPLEX_CST)
1743 return tree_log2 (TREE_REALPART (expr));
1745 prec = TYPE_PRECISION (TREE_TYPE (expr));
1746 high = TREE_INT_CST_HIGH (expr);
1747 low = TREE_INT_CST_LOW (expr);
1749 /* First clear all bits that are beyond the type's precision in case
1750 we've been sign extended. */
1752 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1754 else if (prec > HOST_BITS_PER_WIDE_INT)
1755 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1759 if (prec < HOST_BITS_PER_WIDE_INT)
1760 low &= ~((HOST_WIDE_INT) (-1) << prec);
1763 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1764 : exact_log2 (low));
1767 /* Similar, but return the largest integer Y such that 2 ** Y is less
1768 than or equal to EXPR. */
1771 tree_floor_log2 (const_tree expr)
1774 HOST_WIDE_INT high, low;
1778 if (TREE_CODE (expr) == COMPLEX_CST)
1779 return tree_log2 (TREE_REALPART (expr));
1781 prec = TYPE_PRECISION (TREE_TYPE (expr));
1782 high = TREE_INT_CST_HIGH (expr);
1783 low = TREE_INT_CST_LOW (expr);
1785 /* First clear all bits that are beyond the type's precision in case
1786 we've been sign extended. Ignore if type's precision hasn't been set
1787 since what we are doing is setting it. */
1789 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1791 else if (prec > HOST_BITS_PER_WIDE_INT)
1792 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1796 if (prec < HOST_BITS_PER_WIDE_INT)
1797 low &= ~((HOST_WIDE_INT) (-1) << prec);
1800 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1801 : floor_log2 (low));
1804 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1805 decimal float constants, so don't return 1 for them. */
1808 real_zerop (const_tree expr)
1812 return ((TREE_CODE (expr) == REAL_CST
1813 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1814 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1815 || (TREE_CODE (expr) == COMPLEX_CST
1816 && real_zerop (TREE_REALPART (expr))
1817 && real_zerop (TREE_IMAGPART (expr))));
1820 /* Return 1 if EXPR is the real constant one in real or complex form.
1821 Trailing zeroes matter for decimal float constants, so don't return
1825 real_onep (const_tree expr)
1829 return ((TREE_CODE (expr) == REAL_CST
1830 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1831 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1832 || (TREE_CODE (expr) == COMPLEX_CST
1833 && real_onep (TREE_REALPART (expr))
1834 && real_zerop (TREE_IMAGPART (expr))));
1837 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1838 for decimal float constants, so don't return 1 for them. */
1841 real_twop (const_tree expr)
1845 return ((TREE_CODE (expr) == REAL_CST
1846 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1847 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1848 || (TREE_CODE (expr) == COMPLEX_CST
1849 && real_twop (TREE_REALPART (expr))
1850 && real_zerop (TREE_IMAGPART (expr))));
1853 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1854 matter for decimal float constants, so don't return 1 for them. */
1857 real_minus_onep (const_tree expr)
1861 return ((TREE_CODE (expr) == REAL_CST
1862 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1863 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1864 || (TREE_CODE (expr) == COMPLEX_CST
1865 && real_minus_onep (TREE_REALPART (expr))
1866 && real_zerop (TREE_IMAGPART (expr))));
1869 /* Nonzero if EXP is a constant or a cast of a constant. */
1872 really_constant_p (const_tree exp)
1874 /* This is not quite the same as STRIP_NOPS. It does more. */
1875 while (CONVERT_EXPR_P (exp)
1876 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1877 exp = TREE_OPERAND (exp, 0);
1878 return TREE_CONSTANT (exp);
1881 /* Return first list element whose TREE_VALUE is ELEM.
1882 Return 0 if ELEM is not in LIST. */
1885 value_member (tree elem, tree list)
1889 if (elem == TREE_VALUE (list))
1891 list = TREE_CHAIN (list);
1896 /* Return first list element whose TREE_PURPOSE is ELEM.
1897 Return 0 if ELEM is not in LIST. */
1900 purpose_member (const_tree elem, tree list)
1904 if (elem == TREE_PURPOSE (list))
1906 list = TREE_CHAIN (list);
1911 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1915 chain_index (int idx, tree chain)
1917 for (; chain && idx > 0; --idx)
1918 chain = TREE_CHAIN (chain);
1922 /* Return nonzero if ELEM is part of the chain CHAIN. */
1925 chain_member (const_tree elem, const_tree chain)
1931 chain = TREE_CHAIN (chain);
1937 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1938 We expect a null pointer to mark the end of the chain.
1939 This is the Lisp primitive `length'. */
1942 list_length (const_tree t)
1945 #ifdef ENABLE_TREE_CHECKING
1953 #ifdef ENABLE_TREE_CHECKING
1956 gcc_assert (p != q);
1964 /* Returns the number of FIELD_DECLs in TYPE. */
1967 fields_length (const_tree type)
1969 tree t = TYPE_FIELDS (type);
1972 for (; t; t = TREE_CHAIN (t))
1973 if (TREE_CODE (t) == FIELD_DECL)
1979 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
1980 UNION_TYPE TYPE, or NULL_TREE if none. */
1983 first_field (const_tree type)
1985 tree t = TYPE_FIELDS (type);
1986 while (t && TREE_CODE (t) != FIELD_DECL)
1991 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1992 by modifying the last node in chain 1 to point to chain 2.
1993 This is the Lisp primitive `nconc'. */
1996 chainon (tree op1, tree op2)
2005 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2007 TREE_CHAIN (t1) = op2;
2009 #ifdef ENABLE_TREE_CHECKING
2012 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2013 gcc_assert (t2 != t1);
2020 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2023 tree_last (tree chain)
2027 while ((next = TREE_CHAIN (chain)))
2032 /* Reverse the order of elements in the chain T,
2033 and return the new head of the chain (old last element). */
2038 tree prev = 0, decl, next;
2039 for (decl = t; decl; decl = next)
2041 next = TREE_CHAIN (decl);
2042 TREE_CHAIN (decl) = prev;
2048 /* Return a newly created TREE_LIST node whose
2049 purpose and value fields are PARM and VALUE. */
2052 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2054 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2055 TREE_PURPOSE (t) = parm;
2056 TREE_VALUE (t) = value;
2060 /* Build a chain of TREE_LIST nodes from a vector. */
2063 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2065 tree ret = NULL_TREE;
2069 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2071 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2072 pp = &TREE_CHAIN (*pp);
2077 /* Return a newly created TREE_LIST node whose
2078 purpose and value fields are PURPOSE and VALUE
2079 and whose TREE_CHAIN is CHAIN. */
2082 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2086 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2088 memset (node, 0, sizeof (struct tree_common));
2090 #ifdef GATHER_STATISTICS
2091 tree_node_counts[(int) x_kind]++;
2092 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2095 TREE_SET_CODE (node, TREE_LIST);
2096 TREE_CHAIN (node) = chain;
2097 TREE_PURPOSE (node) = purpose;
2098 TREE_VALUE (node) = value;
2102 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2105 ctor_to_list (tree ctor)
2107 tree list = NULL_TREE;
2112 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2114 *p = build_tree_list (purpose, val);
2115 p = &TREE_CHAIN (*p);
2121 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2125 ctor_to_vec (tree ctor)
2127 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2131 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2132 VEC_quick_push (tree, vec, val);
2137 /* Return the size nominally occupied by an object of type TYPE
2138 when it resides in memory. The value is measured in units of bytes,
2139 and its data type is that normally used for type sizes
2140 (which is the first type created by make_signed_type or
2141 make_unsigned_type). */
2144 size_in_bytes (const_tree type)
2148 if (type == error_mark_node)
2149 return integer_zero_node;
2151 type = TYPE_MAIN_VARIANT (type);
2152 t = TYPE_SIZE_UNIT (type);
2156 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2157 return size_zero_node;
2163 /* Return the size of TYPE (in bytes) as a wide integer
2164 or return -1 if the size can vary or is larger than an integer. */
2167 int_size_in_bytes (const_tree type)
2171 if (type == error_mark_node)
2174 type = TYPE_MAIN_VARIANT (type);
2175 t = TYPE_SIZE_UNIT (type);
2177 || TREE_CODE (t) != INTEGER_CST
2178 || TREE_INT_CST_HIGH (t) != 0
2179 /* If the result would appear negative, it's too big to represent. */
2180 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2183 return TREE_INT_CST_LOW (t);
2186 /* Return the maximum size of TYPE (in bytes) as a wide integer
2187 or return -1 if the size can vary or is larger than an integer. */
2190 max_int_size_in_bytes (const_tree type)
2192 HOST_WIDE_INT size = -1;
2195 /* If this is an array type, check for a possible MAX_SIZE attached. */
2197 if (TREE_CODE (type) == ARRAY_TYPE)
2199 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2201 if (size_tree && host_integerp (size_tree, 1))
2202 size = tree_low_cst (size_tree, 1);
2205 /* If we still haven't been able to get a size, see if the language
2206 can compute a maximum size. */
2210 size_tree = lang_hooks.types.max_size (type);
2212 if (size_tree && host_integerp (size_tree, 1))
2213 size = tree_low_cst (size_tree, 1);
2219 /* Returns a tree for the size of EXP in bytes. */
2222 tree_expr_size (const_tree exp)
2225 && DECL_SIZE_UNIT (exp) != 0)
2226 return DECL_SIZE_UNIT (exp);
2228 return size_in_bytes (TREE_TYPE (exp));
2231 /* Return the bit position of FIELD, in bits from the start of the record.
2232 This is a tree of type bitsizetype. */
2235 bit_position (const_tree field)
2237 return bit_from_pos (DECL_FIELD_OFFSET (field),
2238 DECL_FIELD_BIT_OFFSET (field));
2241 /* Likewise, but return as an integer. It must be representable in
2242 that way (since it could be a signed value, we don't have the
2243 option of returning -1 like int_size_in_byte can. */
2246 int_bit_position (const_tree field)
2248 return tree_low_cst (bit_position (field), 0);
2251 /* Return the byte position of FIELD, in bytes from the start of the record.
2252 This is a tree of type sizetype. */
2255 byte_position (const_tree field)
2257 return byte_from_pos (DECL_FIELD_OFFSET (field),
2258 DECL_FIELD_BIT_OFFSET (field));
2261 /* Likewise, but return as an integer. It must be representable in
2262 that way (since it could be a signed value, we don't have the
2263 option of returning -1 like int_size_in_byte can. */
2266 int_byte_position (const_tree field)
2268 return tree_low_cst (byte_position (field), 0);
2271 /* Return the strictest alignment, in bits, that T is known to have. */
2274 expr_align (const_tree t)
2276 unsigned int align0, align1;
2278 switch (TREE_CODE (t))
2280 CASE_CONVERT: case NON_LVALUE_EXPR:
2281 /* If we have conversions, we know that the alignment of the
2282 object must meet each of the alignments of the types. */
2283 align0 = expr_align (TREE_OPERAND (t, 0));
2284 align1 = TYPE_ALIGN (TREE_TYPE (t));
2285 return MAX (align0, align1);
2287 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2288 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2289 case CLEANUP_POINT_EXPR:
2290 /* These don't change the alignment of an object. */
2291 return expr_align (TREE_OPERAND (t, 0));
2294 /* The best we can do is say that the alignment is the least aligned
2296 align0 = expr_align (TREE_OPERAND (t, 1));
2297 align1 = expr_align (TREE_OPERAND (t, 2));
2298 return MIN (align0, align1);
2300 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2301 meaningfully, it's always 1. */
2302 case LABEL_DECL: case CONST_DECL:
2303 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2305 gcc_assert (DECL_ALIGN (t) != 0);
2306 return DECL_ALIGN (t);
2312 /* Otherwise take the alignment from that of the type. */
2313 return TYPE_ALIGN (TREE_TYPE (t));
2316 /* Return, as a tree node, the number of elements for TYPE (which is an
2317 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2320 array_type_nelts (const_tree type)
2322 tree index_type, min, max;
2324 /* If they did it with unspecified bounds, then we should have already
2325 given an error about it before we got here. */
2326 if (! TYPE_DOMAIN (type))
2327 return error_mark_node;
2329 index_type = TYPE_DOMAIN (type);
2330 min = TYPE_MIN_VALUE (index_type);
2331 max = TYPE_MAX_VALUE (index_type);
2333 return (integer_zerop (min)
2335 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2338 /* If arg is static -- a reference to an object in static storage -- then
2339 return the object. This is not the same as the C meaning of `static'.
2340 If arg isn't static, return NULL. */
2345 switch (TREE_CODE (arg))
2348 /* Nested functions are static, even though taking their address will
2349 involve a trampoline as we unnest the nested function and create
2350 the trampoline on the tree level. */
2354 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2355 && ! DECL_THREAD_LOCAL_P (arg)
2356 && ! DECL_DLLIMPORT_P (arg)
2360 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2364 return TREE_STATIC (arg) ? arg : NULL;
2371 /* If the thing being referenced is not a field, then it is
2372 something language specific. */
2373 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2375 /* If we are referencing a bitfield, we can't evaluate an
2376 ADDR_EXPR at compile time and so it isn't a constant. */
2377 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2380 return staticp (TREE_OPERAND (arg, 0));
2385 case MISALIGNED_INDIRECT_REF:
2386 case ALIGN_INDIRECT_REF:
2388 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2391 case ARRAY_RANGE_REF:
2392 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2393 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2394 return staticp (TREE_OPERAND (arg, 0));
2398 case COMPOUND_LITERAL_EXPR:
2399 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2409 /* Return whether OP is a DECL whose address is function-invariant. */
2412 decl_address_invariant_p (const_tree op)
2414 /* The conditions below are slightly less strict than the one in
2417 switch (TREE_CODE (op))
2426 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2427 && !DECL_DLLIMPORT_P (op))
2428 || DECL_THREAD_LOCAL_P (op)
2429 || DECL_CONTEXT (op) == current_function_decl
2430 || decl_function_context (op) == current_function_decl)
2435 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2436 || decl_function_context (op) == current_function_decl)
2447 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2450 decl_address_ip_invariant_p (const_tree op)
2452 /* The conditions below are slightly less strict than the one in
2455 switch (TREE_CODE (op))
2463 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2464 && !DECL_DLLIMPORT_P (op))
2465 || DECL_THREAD_LOCAL_P (op))
2470 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2482 /* Return true if T is function-invariant (internal function, does
2483 not handle arithmetic; that's handled in skip_simple_arithmetic and
2484 tree_invariant_p). */
2486 static bool tree_invariant_p (tree t);
2489 tree_invariant_p_1 (tree t)
2493 if (TREE_CONSTANT (t)
2494 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2497 switch (TREE_CODE (t))
2503 op = TREE_OPERAND (t, 0);
2504 while (handled_component_p (op))
2506 switch (TREE_CODE (op))
2509 case ARRAY_RANGE_REF:
2510 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2511 || TREE_OPERAND (op, 2) != NULL_TREE
2512 || TREE_OPERAND (op, 3) != NULL_TREE)
2517 if (TREE_OPERAND (op, 2) != NULL_TREE)
2523 op = TREE_OPERAND (op, 0);
2526 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2535 /* Return true if T is function-invariant. */
2538 tree_invariant_p (tree t)
2540 tree inner = skip_simple_arithmetic (t);
2541 return tree_invariant_p_1 (inner);
2544 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2545 Do this to any expression which may be used in more than one place,
2546 but must be evaluated only once.
2548 Normally, expand_expr would reevaluate the expression each time.
2549 Calling save_expr produces something that is evaluated and recorded
2550 the first time expand_expr is called on it. Subsequent calls to
2551 expand_expr just reuse the recorded value.
2553 The call to expand_expr that generates code that actually computes
2554 the value is the first call *at compile time*. Subsequent calls
2555 *at compile time* generate code to use the saved value.
2556 This produces correct result provided that *at run time* control
2557 always flows through the insns made by the first expand_expr
2558 before reaching the other places where the save_expr was evaluated.
2559 You, the caller of save_expr, must make sure this is so.
2561 Constants, and certain read-only nodes, are returned with no
2562 SAVE_EXPR because that is safe. Expressions containing placeholders
2563 are not touched; see tree.def for an explanation of what these
2567 save_expr (tree expr)
2569 tree t = fold (expr);
2572 /* If the tree evaluates to a constant, then we don't want to hide that
2573 fact (i.e. this allows further folding, and direct checks for constants).
2574 However, a read-only object that has side effects cannot be bypassed.
2575 Since it is no problem to reevaluate literals, we just return the
2577 inner = skip_simple_arithmetic (t);
2578 if (TREE_CODE (inner) == ERROR_MARK)
2581 if (tree_invariant_p_1 (inner))
2584 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2585 it means that the size or offset of some field of an object depends on
2586 the value within another field.
2588 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2589 and some variable since it would then need to be both evaluated once and
2590 evaluated more than once. Front-ends must assure this case cannot
2591 happen by surrounding any such subexpressions in their own SAVE_EXPR
2592 and forcing evaluation at the proper time. */
2593 if (contains_placeholder_p (inner))
2596 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2597 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2599 /* This expression might be placed ahead of a jump to ensure that the
2600 value was computed on both sides of the jump. So make sure it isn't
2601 eliminated as dead. */
2602 TREE_SIDE_EFFECTS (t) = 1;
2606 /* Look inside EXPR and into any simple arithmetic operations. Return
2607 the innermost non-arithmetic node. */
2610 skip_simple_arithmetic (tree expr)
2614 /* We don't care about whether this can be used as an lvalue in this
2616 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2617 expr = TREE_OPERAND (expr, 0);
2619 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2620 a constant, it will be more efficient to not make another SAVE_EXPR since
2621 it will allow better simplification and GCSE will be able to merge the
2622 computations if they actually occur. */
2626 if (UNARY_CLASS_P (inner))
2627 inner = TREE_OPERAND (inner, 0);
2628 else if (BINARY_CLASS_P (inner))
2630 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2631 inner = TREE_OPERAND (inner, 0);
2632 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2633 inner = TREE_OPERAND (inner, 1);
2645 /* Return which tree structure is used by T. */
2647 enum tree_node_structure_enum
2648 tree_node_structure (const_tree t)
2650 const enum tree_code code = TREE_CODE (t);
2651 return tree_node_structure_for_code (code);
2654 /* Set various status flags when building a CALL_EXPR object T. */
2657 process_call_operands (tree t)
2659 bool side_effects = TREE_SIDE_EFFECTS (t);
2660 bool read_only = false;
2661 int i = call_expr_flags (t);
2663 /* Calls have side-effects, except those to const or pure functions. */
2664 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2665 side_effects = true;
2666 /* Propagate TREE_READONLY of arguments for const functions. */
2670 if (!side_effects || read_only)
2671 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2673 tree op = TREE_OPERAND (t, i);
2674 if (op && TREE_SIDE_EFFECTS (op))
2675 side_effects = true;
2676 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2680 TREE_SIDE_EFFECTS (t) = side_effects;
2681 TREE_READONLY (t) = read_only;
2684 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2685 or offset that depends on a field within a record. */
2688 contains_placeholder_p (const_tree exp)
2690 enum tree_code code;
2695 code = TREE_CODE (exp);
2696 if (code == PLACEHOLDER_EXPR)
2699 switch (TREE_CODE_CLASS (code))
2702 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2703 position computations since they will be converted into a
2704 WITH_RECORD_EXPR involving the reference, which will assume
2705 here will be valid. */
2706 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2708 case tcc_exceptional:
2709 if (code == TREE_LIST)
2710 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2711 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2716 case tcc_comparison:
2717 case tcc_expression:
2721 /* Ignoring the first operand isn't quite right, but works best. */
2722 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2725 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2726 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2727 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2730 /* The save_expr function never wraps anything containing
2731 a PLACEHOLDER_EXPR. */
2738 switch (TREE_CODE_LENGTH (code))
2741 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2743 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2744 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2755 const_call_expr_arg_iterator iter;
2756 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2757 if (CONTAINS_PLACEHOLDER_P (arg))
2771 /* Return true if any part of the computation of TYPE involves a
2772 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2773 (for QUAL_UNION_TYPE) and field positions. */
2776 type_contains_placeholder_1 (const_tree type)
2778 /* If the size contains a placeholder or the parent type (component type in
2779 the case of arrays) type involves a placeholder, this type does. */
2780 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2781 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2782 || (TREE_TYPE (type) != 0
2783 && type_contains_placeholder_p (TREE_TYPE (type))))
2786 /* Now do type-specific checks. Note that the last part of the check above
2787 greatly limits what we have to do below. */
2788 switch (TREE_CODE (type))
2796 case REFERENCE_TYPE:
2804 case FIXED_POINT_TYPE:
2805 /* Here we just check the bounds. */
2806 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2807 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2810 /* We're already checked the component type (TREE_TYPE), so just check
2812 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2816 case QUAL_UNION_TYPE:
2820 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2821 if (TREE_CODE (field) == FIELD_DECL
2822 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2823 || (TREE_CODE (type) == QUAL_UNION_TYPE
2824 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2825 || type_contains_placeholder_p (TREE_TYPE (field))))
2837 type_contains_placeholder_p (tree type)
2841 /* If the contains_placeholder_bits field has been initialized,
2842 then we know the answer. */
2843 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2844 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2846 /* Indicate that we've seen this type node, and the answer is false.
2847 This is what we want to return if we run into recursion via fields. */
2848 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2850 /* Compute the real value. */
2851 result = type_contains_placeholder_1 (type);
2853 /* Store the real value. */
2854 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2859 /* Push tree EXP onto vector QUEUE if it is not already present. */
2862 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2867 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2868 if (simple_cst_equal (iter, exp) == 1)
2872 VEC_safe_push (tree, heap, *queue, exp);
2875 /* Given a tree EXP, find all occurences of references to fields
2876 in a PLACEHOLDER_EXPR and place them in vector REFS without
2877 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2878 we assume here that EXP contains only arithmetic expressions
2879 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2883 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2885 enum tree_code code = TREE_CODE (exp);
2889 /* We handle TREE_LIST and COMPONENT_REF separately. */
2890 if (code == TREE_LIST)
2892 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2893 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2895 else if (code == COMPONENT_REF)
2897 for (inner = TREE_OPERAND (exp, 0);
2898 REFERENCE_CLASS_P (inner);
2899 inner = TREE_OPERAND (inner, 0))
2902 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2903 push_without_duplicates (exp, refs);
2905 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2908 switch (TREE_CODE_CLASS (code))
2913 case tcc_declaration:
2914 /* Variables allocated to static storage can stay. */
2915 if (!TREE_STATIC (exp))
2916 push_without_duplicates (exp, refs);
2919 case tcc_expression:
2920 /* This is the pattern built in ada/make_aligning_type. */
2921 if (code == ADDR_EXPR
2922 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2924 push_without_duplicates (exp, refs);
2928 /* Fall through... */
2930 case tcc_exceptional:
2933 case tcc_comparison:
2935 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2936 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2940 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2941 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2949 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2950 return a tree with all occurrences of references to F in a
2951 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2952 CONST_DECLs. Note that we assume here that EXP contains only
2953 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2954 occurring only in their argument list. */
2957 substitute_in_expr (tree exp, tree f, tree r)
2959 enum tree_code code = TREE_CODE (exp);
2960 tree op0, op1, op2, op3;
2963 /* We handle TREE_LIST and COMPONENT_REF separately. */
2964 if (code == TREE_LIST)
2966 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2967 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2968 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2971 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2973 else if (code == COMPONENT_REF)
2977 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2978 and it is the right field, replace it with R. */
2979 for (inner = TREE_OPERAND (exp, 0);
2980 REFERENCE_CLASS_P (inner);
2981 inner = TREE_OPERAND (inner, 0))
2985 op1 = TREE_OPERAND (exp, 1);
2987 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2990 /* If this expression hasn't been completed let, leave it alone. */
2991 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2994 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2995 if (op0 == TREE_OPERAND (exp, 0))
2999 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3002 switch (TREE_CODE_CLASS (code))
3007 case tcc_declaration:
3013 case tcc_expression:
3017 /* Fall through... */
3019 case tcc_exceptional:
3022 case tcc_comparison:
3024 switch (TREE_CODE_LENGTH (code))
3030 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3031 if (op0 == TREE_OPERAND (exp, 0))
3034 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3038 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3039 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3041 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3044 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3048 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3049 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3050 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3052 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3053 && op2 == TREE_OPERAND (exp, 2))
3056 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3060 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3061 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3062 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3063 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3065 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3066 && op2 == TREE_OPERAND (exp, 2)
3067 && op3 == TREE_OPERAND (exp, 3))
3071 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3083 new_tree = NULL_TREE;
3085 /* If we are trying to replace F with a constant, inline back
3086 functions which do nothing else than computing a value from
3087 the arguments they are passed. This makes it possible to
3088 fold partially or entirely the replacement expression. */
3089 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3091 tree t = maybe_inline_call_in_expr (exp);
3093 return SUBSTITUTE_IN_EXPR (t, f, r);
3096 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3098 tree op = TREE_OPERAND (exp, i);
3099 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3103 new_tree = copy_node (exp);
3104 TREE_OPERAND (new_tree, i) = new_op;
3110 new_tree = fold (new_tree);
3111 if (TREE_CODE (new_tree) == CALL_EXPR)
3112 process_call_operands (new_tree);
3123 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3127 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3128 for it within OBJ, a tree that is an object or a chain of references. */
3131 substitute_placeholder_in_expr (tree exp, tree obj)
3133 enum tree_code code = TREE_CODE (exp);
3134 tree op0, op1, op2, op3;
3137 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3138 in the chain of OBJ. */
3139 if (code == PLACEHOLDER_EXPR)
3141 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3144 for (elt = obj; elt != 0;
3145 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3146 || TREE_CODE (elt) == COND_EXPR)
3147 ? TREE_OPERAND (elt, 1)
3148 : (REFERENCE_CLASS_P (elt)
3149 || UNARY_CLASS_P (elt)
3150 || BINARY_CLASS_P (elt)
3151 || VL_EXP_CLASS_P (elt)
3152 || EXPRESSION_CLASS_P (elt))
3153 ? TREE_OPERAND (elt, 0) : 0))
3154 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3157 for (elt = obj; elt != 0;
3158 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3159 || TREE_CODE (elt) == COND_EXPR)
3160 ? TREE_OPERAND (elt, 1)
3161 : (REFERENCE_CLASS_P (elt)
3162 || UNARY_CLASS_P (elt)
3163 || BINARY_CLASS_P (elt)
3164 || VL_EXP_CLASS_P (elt)
3165 || EXPRESSION_CLASS_P (elt))
3166 ? TREE_OPERAND (elt, 0) : 0))
3167 if (POINTER_TYPE_P (TREE_TYPE (elt))
3168 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3170 return fold_build1 (INDIRECT_REF, need_type, elt);
3172 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3173 survives until RTL generation, there will be an error. */
3177 /* TREE_LIST is special because we need to look at TREE_VALUE
3178 and TREE_CHAIN, not TREE_OPERANDS. */
3179 else if (code == TREE_LIST)
3181 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3182 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3183 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3186 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3189 switch (TREE_CODE_CLASS (code))
3192 case tcc_declaration:
3195 case tcc_exceptional:
3198 case tcc_comparison:
3199 case tcc_expression:
3202 switch (TREE_CODE_LENGTH (code))
3208 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3209 if (op0 == TREE_OPERAND (exp, 0))
3212 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3216 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3217 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3219 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3222 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3226 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3227 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3228 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3230 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3231 && op2 == TREE_OPERAND (exp, 2))
3234 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3238 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3239 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3240 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3241 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3243 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3244 && op2 == TREE_OPERAND (exp, 2)
3245 && op3 == TREE_OPERAND (exp, 3))
3249 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3261 new_tree = NULL_TREE;
3263 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3265 tree op = TREE_OPERAND (exp, i);
3266 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3270 new_tree = copy_node (exp);
3271 TREE_OPERAND (new_tree, i) = new_op;
3277 new_tree = fold (new_tree);
3278 if (TREE_CODE (new_tree) == CALL_EXPR)
3279 process_call_operands (new_tree);
3290 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3294 /* Stabilize a reference so that we can use it any number of times
3295 without causing its operands to be evaluated more than once.
3296 Returns the stabilized reference. This works by means of save_expr,
3297 so see the caveats in the comments about save_expr.
3299 Also allows conversion expressions whose operands are references.
3300 Any other kind of expression is returned unchanged. */
3303 stabilize_reference (tree ref)
3306 enum tree_code code = TREE_CODE (ref);
3313 /* No action is needed in this case. */
3318 case FIX_TRUNC_EXPR:
3319 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3323 result = build_nt (INDIRECT_REF,
3324 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3328 result = build_nt (COMPONENT_REF,
3329 stabilize_reference (TREE_OPERAND (ref, 0)),
3330 TREE_OPERAND (ref, 1), NULL_TREE);
3334 result = build_nt (BIT_FIELD_REF,
3335 stabilize_reference (TREE_OPERAND (ref, 0)),
3336 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3337 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3341 result = build_nt (ARRAY_REF,
3342 stabilize_reference (TREE_OPERAND (ref, 0)),
3343 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3344 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3347 case ARRAY_RANGE_REF:
3348 result = build_nt (ARRAY_RANGE_REF,
3349 stabilize_reference (TREE_OPERAND (ref, 0)),
3350 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3351 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3355 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3356 it wouldn't be ignored. This matters when dealing with
3358 return stabilize_reference_1 (ref);
3360 /* If arg isn't a kind of lvalue we recognize, make no change.
3361 Caller should recognize the error for an invalid lvalue. */
3366 return error_mark_node;
3369 TREE_TYPE (result) = TREE_TYPE (ref);
3370 TREE_READONLY (result) = TREE_READONLY (ref);
3371 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3372 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3377 /* Subroutine of stabilize_reference; this is called for subtrees of
3378 references. Any expression with side-effects must be put in a SAVE_EXPR
3379 to ensure that it is only evaluated once.
3381 We don't put SAVE_EXPR nodes around everything, because assigning very
3382 simple expressions to temporaries causes us to miss good opportunities
3383 for optimizations. Among other things, the opportunity to fold in the
3384 addition of a constant into an addressing mode often gets lost, e.g.
3385 "y[i+1] += x;". In general, we take the approach that we should not make
3386 an assignment unless we are forced into it - i.e., that any non-side effect
3387 operator should be allowed, and that cse should take care of coalescing
3388 multiple utterances of the same expression should that prove fruitful. */
3391 stabilize_reference_1 (tree e)
3394 enum tree_code code = TREE_CODE (e);
3396 /* We cannot ignore const expressions because it might be a reference
3397 to a const array but whose index contains side-effects. But we can
3398 ignore things that are actual constant or that already have been
3399 handled by this function. */
3401 if (tree_invariant_p (e))
3404 switch (TREE_CODE_CLASS (code))
3406 case tcc_exceptional:
3408 case tcc_declaration:
3409 case tcc_comparison:
3411 case tcc_expression:
3414 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3415 so that it will only be evaluated once. */
3416 /* The reference (r) and comparison (<) classes could be handled as
3417 below, but it is generally faster to only evaluate them once. */
3418 if (TREE_SIDE_EFFECTS (e))
3419 return save_expr (e);
3423 /* Constants need no processing. In fact, we should never reach
3428 /* Division is slow and tends to be compiled with jumps,
3429 especially the division by powers of 2 that is often
3430 found inside of an array reference. So do it just once. */
3431 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3432 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3433 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3434 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3435 return save_expr (e);
3436 /* Recursively stabilize each operand. */
3437 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3438 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3442 /* Recursively stabilize each operand. */
3443 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3450 TREE_TYPE (result) = TREE_TYPE (e);
3451 TREE_READONLY (result) = TREE_READONLY (e);
3452 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3453 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3458 /* Low-level constructors for expressions. */
3460 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3461 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3464 recompute_tree_invariant_for_addr_expr (tree t)
3467 bool tc = true, se = false;
3469 /* We started out assuming this address is both invariant and constant, but
3470 does not have side effects. Now go down any handled components and see if
3471 any of them involve offsets that are either non-constant or non-invariant.
3472 Also check for side-effects.
3474 ??? Note that this code makes no attempt to deal with the case where
3475 taking the address of something causes a copy due to misalignment. */
3477 #define UPDATE_FLAGS(NODE) \
3478 do { tree _node = (NODE); \
3479 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3480 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3482 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3483 node = TREE_OPERAND (node, 0))
3485 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3486 array reference (probably made temporarily by the G++ front end),
3487 so ignore all the operands. */
3488 if ((TREE_CODE (node) == ARRAY_REF
3489 || TREE_CODE (node) == ARRAY_RANGE_REF)
3490 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3492 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3493 if (TREE_OPERAND (node, 2))
3494 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3495 if (TREE_OPERAND (node, 3))
3496 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3498 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3499 FIELD_DECL, apparently. The G++ front end can put something else
3500 there, at least temporarily. */
3501 else if (TREE_CODE (node) == COMPONENT_REF
3502 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3504 if (TREE_OPERAND (node, 2))
3505 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3507 else if (TREE_CODE (node) == BIT_FIELD_REF)
3508 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3511 node = lang_hooks.expr_to_decl (node, &tc, &se);
3513 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3514 the address, since &(*a)->b is a form of addition. If it's a constant, the
3515 address is constant too. If it's a decl, its address is constant if the
3516 decl is static. Everything else is not constant and, furthermore,
3517 taking the address of a volatile variable is not volatile. */
3518 if (TREE_CODE (node) == INDIRECT_REF)
3519 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3520 else if (CONSTANT_CLASS_P (node))
3522 else if (DECL_P (node))
3523 tc &= (staticp (node) != NULL_TREE);
3527 se |= TREE_SIDE_EFFECTS (node);
3531 TREE_CONSTANT (t) = tc;
3532 TREE_SIDE_EFFECTS (t) = se;
3536 /* Build an expression of code CODE, data type TYPE, and operands as
3537 specified. Expressions and reference nodes can be created this way.
3538 Constants, decls, types and misc nodes cannot be.
3540 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3541 enough for all extant tree codes. */
3544 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3548 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3550 t = make_node_stat (code PASS_MEM_STAT);
3557 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3559 int length = sizeof (struct tree_exp);
3560 #ifdef GATHER_STATISTICS
3561 tree_node_kind kind;
3565 #ifdef GATHER_STATISTICS
3566 switch (TREE_CODE_CLASS (code))
3568 case tcc_statement: /* an expression with side effects */
3571 case tcc_reference: /* a reference */
3579 tree_node_counts[(int) kind]++;
3580 tree_node_sizes[(int) kind] += length;
3583 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3585 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3587 memset (t, 0, sizeof (struct tree_common));
3589 TREE_SET_CODE (t, code);
3591 TREE_TYPE (t) = type;
3592 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3593 TREE_OPERAND (t, 0) = node;
3594 TREE_BLOCK (t) = NULL_TREE;
3595 if (node && !TYPE_P (node))
3597 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3598 TREE_READONLY (t) = TREE_READONLY (node);
3601 if (TREE_CODE_CLASS (code) == tcc_statement)
3602 TREE_SIDE_EFFECTS (t) = 1;
3606 /* All of these have side-effects, no matter what their
3608 TREE_SIDE_EFFECTS (t) = 1;
3609 TREE_READONLY (t) = 0;
3612 case MISALIGNED_INDIRECT_REF:
3613 case ALIGN_INDIRECT_REF:
3615 /* Whether a dereference is readonly has nothing to do with whether
3616 its operand is readonly. */
3617 TREE_READONLY (t) = 0;
3622 recompute_tree_invariant_for_addr_expr (t);
3626 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3627 && node && !TYPE_P (node)
3628 && TREE_CONSTANT (node))
3629 TREE_CONSTANT (t) = 1;
3630 if (TREE_CODE_CLASS (code) == tcc_reference
3631 && node && TREE_THIS_VOLATILE (node))
3632 TREE_THIS_VOLATILE (t) = 1;
3639 #define PROCESS_ARG(N) \
3641 TREE_OPERAND (t, N) = arg##N; \
3642 if (arg##N &&!TYPE_P (arg##N)) \
3644 if (TREE_SIDE_EFFECTS (arg##N)) \
3646 if (!TREE_READONLY (arg##N) \
3647 && !CONSTANT_CLASS_P (arg##N)) \
3648 (void) (read_only = 0); \
3649 if (!TREE_CONSTANT (arg##N)) \
3650 (void) (constant = 0); \
3655 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3657 bool constant, read_only, side_effects;
3660 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3662 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3663 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3664 /* When sizetype precision doesn't match that of pointers
3665 we need to be able to build explicit extensions or truncations
3666 of the offset argument. */
3667 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3668 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3669 && TREE_CODE (arg1) == INTEGER_CST);
3671 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3672 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3673 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3674 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3676 t = make_node_stat (code PASS_MEM_STAT);
3679 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3680 result based on those same flags for the arguments. But if the
3681 arguments aren't really even `tree' expressions, we shouldn't be trying
3684 /* Expressions without side effects may be constant if their
3685 arguments are as well. */
3686 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3687 || TREE_CODE_CLASS (code) == tcc_binary);
3689 side_effects = TREE_SIDE_EFFECTS (t);
3694 TREE_READONLY (t) = read_only;
3695 TREE_CONSTANT (t) = constant;
3696 TREE_SIDE_EFFECTS (t) = side_effects;
3697 TREE_THIS_VOLATILE (t)
3698 = (TREE_CODE_CLASS (code) == tcc_reference
3699 && arg0 && TREE_THIS_VOLATILE (arg0));
3706 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3707 tree arg2 MEM_STAT_DECL)
3709 bool constant, read_only, side_effects;
3712 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3713 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3715 t = make_node_stat (code PASS_MEM_STAT);
3720 /* As a special exception, if COND_EXPR has NULL branches, we
3721 assume that it is a gimple statement and always consider
3722 it to have side effects. */
3723 if (code == COND_EXPR
3724 && tt == void_type_node
3725 && arg1 == NULL_TREE
3726 && arg2 == NULL_TREE)
3727 side_effects = true;
3729 side_effects = TREE_SIDE_EFFECTS (t);
3735 if (code == COND_EXPR)
3736 TREE_READONLY (t) = read_only;
3738 TREE_SIDE_EFFECTS (t) = side_effects;
3739 TREE_THIS_VOLATILE (t)
3740 = (TREE_CODE_CLASS (code) == tcc_reference
3741 && arg0 && TREE_THIS_VOLATILE (arg0));
3747 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3748 tree arg2, tree arg3 MEM_STAT_DECL)
3750 bool constant, read_only, side_effects;
3753 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3755 t = make_node_stat (code PASS_MEM_STAT);
3758 side_effects = TREE_SIDE_EFFECTS (t);
3765 TREE_SIDE_EFFECTS (t) = side_effects;
3766 TREE_THIS_VOLATILE (t)
3767 = (TREE_CODE_CLASS (code) == tcc_reference
3768 && arg0 && TREE_THIS_VOLATILE (arg0));
3774 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3775 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3777 bool constant, read_only, side_effects;
3780 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3782 t = make_node_stat (code PASS_MEM_STAT);
3785 side_effects = TREE_SIDE_EFFECTS (t);
3793 TREE_SIDE_EFFECTS (t) = side_effects;
3794 TREE_THIS_VOLATILE (t)
3795 = (TREE_CODE_CLASS (code) == tcc_reference
3796 && arg0 && TREE_THIS_VOLATILE (arg0));
3802 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3803 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3805 bool constant, read_only, side_effects;
3808 gcc_assert (code == TARGET_MEM_REF);
3810 t = make_node_stat (code PASS_MEM_STAT);
3813 side_effects = TREE_SIDE_EFFECTS (t);
3820 if (code == TARGET_MEM_REF)
3824 TREE_SIDE_EFFECTS (t) = side_effects;
3825 TREE_THIS_VOLATILE (t)
3826 = (code == TARGET_MEM_REF
3827 && arg5 && TREE_THIS_VOLATILE (arg5));
3832 /* Similar except don't specify the TREE_TYPE
3833 and leave the TREE_SIDE_EFFECTS as 0.
3834 It is permissible for arguments to be null,
3835 or even garbage if their values do not matter. */
3838 build_nt (enum tree_code code, ...)
3845 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3849 t = make_node (code);
3850 length = TREE_CODE_LENGTH (code);
3852 for (i = 0; i < length; i++)
3853 TREE_OPERAND (t, i) = va_arg (p, tree);
3859 /* Similar to build_nt, but for creating a CALL_EXPR object with
3860 ARGLIST passed as a list. */
3863 build_nt_call_list (tree fn, tree arglist)
3868 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3869 CALL_EXPR_FN (t) = fn;
3870 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3871 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3872 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3876 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3880 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3885 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3886 CALL_EXPR_FN (ret) = fn;
3887 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3888 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3889 CALL_EXPR_ARG (ret, ix) = t;
3893 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3894 We do NOT enter this node in any sort of symbol table.
3896 LOC is the location of the decl.
3898 layout_decl is used to set up the decl's storage layout.
3899 Other slots are initialized to 0 or null pointers. */
3902 build_decl_stat (location_t loc, enum tree_code code, tree name,
3903 tree type MEM_STAT_DECL)
3907 t = make_node_stat (code PASS_MEM_STAT);
3908 DECL_SOURCE_LOCATION (t) = loc;
3910 /* if (type == error_mark_node)
3911 type = integer_type_node; */
3912 /* That is not done, deliberately, so that having error_mark_node
3913 as the type can suppress useless errors in the use of this variable. */
3915 DECL_NAME (t) = name;
3916 TREE_TYPE (t) = type;
3918 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3924 /* Builds and returns function declaration with NAME and TYPE. */
3927 build_fn_decl (const char *name, tree type)
3929 tree id = get_identifier (name);
3930 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3932 DECL_EXTERNAL (decl) = 1;
3933 TREE_PUBLIC (decl) = 1;
3934 DECL_ARTIFICIAL (decl) = 1;
3935 TREE_NOTHROW (decl) = 1;
3941 /* BLOCK nodes are used to represent the structure of binding contours
3942 and declarations, once those contours have been exited and their contents
3943 compiled. This information is used for outputting debugging info. */
3946 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3948 tree block = make_node (BLOCK);
3950 BLOCK_VARS (block) = vars;
3951 BLOCK_SUBBLOCKS (block) = subblocks;
3952 BLOCK_SUPERCONTEXT (block) = supercontext;
3953 BLOCK_CHAIN (block) = chain;
3958 expand_location (source_location loc)
3960 expanded_location xloc;
3961 if (loc <= BUILTINS_LOCATION)
3963 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3970 const struct line_map *map = linemap_lookup (line_table, loc);
3971 xloc.file = map->to_file;
3972 xloc.line = SOURCE_LINE (map, loc);
3973 xloc.column = SOURCE_COLUMN (map, loc);
3974 xloc.sysp = map->sysp != 0;
3980 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3982 LOC is the location to use in tree T. */
3985 protected_set_expr_location (tree t, location_t loc)
3987 if (t && CAN_HAVE_LOCATION_P (t))
3988 SET_EXPR_LOCATION (t, loc);
3991 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3995 build_decl_attribute_variant (tree ddecl, tree attribute)
3997 DECL_ATTRIBUTES (ddecl) = attribute;
4001 /* Borrowed from hashtab.c iterative_hash implementation. */
4002 #define mix(a,b,c) \
4004 a -= b; a -= c; a ^= (c>>13); \
4005 b -= c; b -= a; b ^= (a<< 8); \
4006 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4007 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4008 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4009 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4010 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4011 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4012 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4016 /* Produce good hash value combining VAL and VAL2. */
4018 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4020 /* the golden ratio; an arbitrary value. */
4021 hashval_t a = 0x9e3779b9;
4027 /* Produce good hash value combining VAL and VAL2. */
4029 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4031 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4032 return iterative_hash_hashval_t (val, val2);
4035 hashval_t a = (hashval_t) val;
4036 /* Avoid warnings about shifting of more than the width of the type on
4037 hosts that won't execute this path. */
4039 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4041 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4043 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4044 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4051 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4052 is ATTRIBUTE and its qualifiers are QUALS.
4054 Record such modified types already made so we don't make duplicates. */
4057 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4059 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4061 hashval_t hashcode = 0;
4063 enum tree_code code = TREE_CODE (ttype);
4065 /* Building a distinct copy of a tagged type is inappropriate; it
4066 causes breakage in code that expects there to be a one-to-one
4067 relationship between a struct and its fields.
4068 build_duplicate_type is another solution (as used in
4069 handle_transparent_union_attribute), but that doesn't play well
4070 with the stronger C++ type identity model. */
4071 if (TREE_CODE (ttype) == RECORD_TYPE
4072 || TREE_CODE (ttype) == UNION_TYPE
4073 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4074 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4076 warning (OPT_Wattributes,
4077 "ignoring attributes applied to %qT after definition",
4078 TYPE_MAIN_VARIANT (ttype));
4079 return build_qualified_type (ttype, quals);
4082 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4083 ntype = build_distinct_type_copy (ttype);
4085 TYPE_ATTRIBUTES (ntype) = attribute;
4087 hashcode = iterative_hash_object (code, hashcode);
4088 if (TREE_TYPE (ntype))
4089 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4091 hashcode = attribute_hash_list (attribute, hashcode);
4093 switch (TREE_CODE (ntype))
4096 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4099 if (TYPE_DOMAIN (ntype))
4100 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4104 hashcode = iterative_hash_object
4105 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4106 hashcode = iterative_hash_object
4107 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4110 case FIXED_POINT_TYPE:
4112 unsigned int precision = TYPE_PRECISION (ntype);
4113 hashcode = iterative_hash_object (precision, hashcode);
4120 ntype = type_hash_canon (hashcode, ntype);
4122 /* If the target-dependent attributes make NTYPE different from
4123 its canonical type, we will need to use structural equality
4124 checks for this type. */
4125 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4126 || !targetm.comp_type_attributes (ntype, ttype))
4127 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4128 else if (TYPE_CANONICAL (ntype) == ntype)
4129 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4131 ttype = build_qualified_type (ntype, quals);
4133 else if (TYPE_QUALS (ttype) != quals)
4134 ttype = build_qualified_type (ttype, quals);
4140 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4143 Record such modified types already made so we don't make duplicates. */
4146 build_type_attribute_variant (tree ttype, tree attribute)
4148 return build_type_attribute_qual_variant (ttype, attribute,
4149 TYPE_QUALS (ttype));
4153 /* Reset all the fields in a binfo node BINFO. We only keep
4154 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4157 free_lang_data_in_binfo (tree binfo)
4162 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4164 BINFO_VTABLE (binfo) = NULL_TREE;
4165 BINFO_BASE_ACCESSES (binfo) = NULL;
4166 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4167 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4169 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4170 free_lang_data_in_binfo (t);
4174 /* Reset all language specific information still present in TYPE. */
4177 free_lang_data_in_type (tree type)
4179 gcc_assert (TYPE_P (type));
4181 /* Give the FE a chance to remove its own data first. */
4182 lang_hooks.free_lang_data (type);
4184 TREE_LANG_FLAG_0 (type) = 0;
4185 TREE_LANG_FLAG_1 (type) = 0;
4186 TREE_LANG_FLAG_2 (type) = 0;
4187 TREE_LANG_FLAG_3 (type) = 0;
4188 TREE_LANG_FLAG_4 (type) = 0;
4189 TREE_LANG_FLAG_5 (type) = 0;
4190 TREE_LANG_FLAG_6 (type) = 0;
4192 if (TREE_CODE (type) == FUNCTION_TYPE)
4194 /* Remove the const and volatile qualifiers from arguments. The
4195 C++ front end removes them, but the C front end does not,
4196 leading to false ODR violation errors when merging two
4197 instances of the same function signature compiled by
4198 different front ends. */
4201 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4203 tree arg_type = TREE_VALUE (p);
4205 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4207 int quals = TYPE_QUALS (arg_type)
4209 & ~TYPE_QUAL_VOLATILE;
4210 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4211 free_lang_data_in_type (TREE_VALUE (p));
4216 /* Remove members that are not actually FIELD_DECLs from the field
4217 list of an aggregate. These occur in C++. */
4218 if (RECORD_OR_UNION_TYPE_P (type))
4222 /* Note that TYPE_FIELDS can be shared across distinct
4223 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4224 to be removed, we cannot set its TREE_CHAIN to NULL.
4225 Otherwise, we would not be able to find all the other fields
4226 in the other instances of this TREE_TYPE.
4228 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4230 member = TYPE_FIELDS (type);
4233 if (TREE_CODE (member) == FIELD_DECL)
4236 TREE_CHAIN (prev) = member;
4238 TYPE_FIELDS (type) = member;
4242 member = TREE_CHAIN (member);
4246 TREE_CHAIN (prev) = NULL_TREE;
4248 TYPE_FIELDS (type) = NULL_TREE;
4250 TYPE_METHODS (type) = NULL_TREE;
4251 if (TYPE_BINFO (type))
4252 free_lang_data_in_binfo (TYPE_BINFO (type));
4256 /* For non-aggregate types, clear out the language slot (which
4257 overloads TYPE_BINFO). */
4258 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4261 if (debug_info_level < DINFO_LEVEL_TERSE
4262 || (TYPE_CONTEXT (type)
4263 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4264 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4265 TYPE_CONTEXT (type) = NULL_TREE;
4267 if (debug_info_level < DINFO_LEVEL_TERSE)
4268 TYPE_STUB_DECL (type) = NULL_TREE;
4272 /* Return true if DECL may need an assembler name to be set. */
4275 need_assembler_name_p (tree decl)
4277 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4278 if (TREE_CODE (decl) != FUNCTION_DECL
4279 && TREE_CODE (decl) != VAR_DECL)
4282 /* If DECL already has its assembler name set, it does not need a
4284 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4285 || DECL_ASSEMBLER_NAME_SET_P (decl))
4288 /* Abstract decls do not need an assembler name. */
4289 if (DECL_ABSTRACT (decl))
4292 /* For VAR_DECLs, only static, public and external symbols need an
4294 if (TREE_CODE (decl) == VAR_DECL
4295 && !TREE_STATIC (decl)
4296 && !TREE_PUBLIC (decl)
4297 && !DECL_EXTERNAL (decl))
4300 if (TREE_CODE (decl) == FUNCTION_DECL)
4302 /* Do not set assembler name on builtins. Allow RTL expansion to
4303 decide whether to expand inline or via a regular call. */
4304 if (DECL_BUILT_IN (decl)
4305 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4308 /* Functions represented in the callgraph need an assembler name. */
4309 if (cgraph_get_node (decl) != NULL)
4312 /* Unused and not public functions don't need an assembler name. */
4313 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4321 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4322 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4323 in BLOCK that is not in LOCALS is removed. */
4326 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4330 tp = &BLOCK_VARS (block);
4333 if (!pointer_set_contains (locals, *tp))
4334 *tp = TREE_CHAIN (*tp);
4336 tp = &TREE_CHAIN (*tp);
4339 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4340 free_lang_data_in_block (fn, t, locals);
4344 /* Reset all language specific information still present in symbol
4348 free_lang_data_in_decl (tree decl)
4350 gcc_assert (DECL_P (decl));
4352 /* Give the FE a chance to remove its own data first. */
4353 lang_hooks.free_lang_data (decl);
4355 TREE_LANG_FLAG_0 (decl) = 0;
4356 TREE_LANG_FLAG_1 (decl) = 0;
4357 TREE_LANG_FLAG_2 (decl) = 0;
4358 TREE_LANG_FLAG_3 (decl) = 0;
4359 TREE_LANG_FLAG_4 (decl) = 0;
4360 TREE_LANG_FLAG_5 (decl) = 0;
4361 TREE_LANG_FLAG_6 (decl) = 0;
4363 /* Identifiers need not have a type. */
4364 if (DECL_NAME (decl))
4365 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4367 /* Ignore any intervening types, because we are going to clear their
4368 TYPE_CONTEXT fields. */
4369 if (TREE_CODE (decl) != FIELD_DECL
4370 && TREE_CODE (decl) != FUNCTION_DECL)
4371 DECL_CONTEXT (decl) = decl_function_context (decl);
4373 if (DECL_CONTEXT (decl)
4374 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4375 DECL_CONTEXT (decl) = NULL_TREE;
4377 if (TREE_CODE (decl) == VAR_DECL)
4379 tree context = DECL_CONTEXT (decl);
4383 enum tree_code code = TREE_CODE (context);
4384 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4386 /* Do not clear the decl context here, that will promote
4387 all vars to global ones. */
4388 DECL_INITIAL (decl) = NULL_TREE;
4391 if (TREE_STATIC (decl))
4392 DECL_CONTEXT (decl) = NULL_TREE;
4396 /* ??? We could free non-constant DECL_SIZE, DECL_SIZE_UNIT
4397 and DECL_FIELD_OFFSET. But it's cheap enough to not do
4398 that and refrain from adding workarounds to dwarf2out.c */
4400 /* DECL_FCONTEXT is only used for debug info generation. */
4401 if (TREE_CODE (decl) == FIELD_DECL
4402 && debug_info_level < DINFO_LEVEL_TERSE)
4403 DECL_FCONTEXT (decl) = NULL_TREE;
4405 if (TREE_CODE (decl) == FUNCTION_DECL)
4407 if (gimple_has_body_p (decl))
4410 struct pointer_set_t *locals;
4412 /* If DECL has a gimple body, then the context for its
4413 arguments must be DECL. Otherwise, it doesn't really
4414 matter, as we will not be emitting any code for DECL. In
4415 general, there may be other instances of DECL created by
4416 the front end and since PARM_DECLs are generally shared,
4417 their DECL_CONTEXT changes as the replicas of DECL are
4418 created. The only time where DECL_CONTEXT is important
4419 is for the FUNCTION_DECLs that have a gimple body (since
4420 the PARM_DECL will be used in the function's body). */
4421 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4422 DECL_CONTEXT (t) = decl;
4424 /* Collect all the symbols declared in DECL. */
4425 locals = pointer_set_create ();
4426 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4427 for (; t; t = TREE_CHAIN (t))
4429 pointer_set_insert (locals, TREE_VALUE (t));
4431 /* All the local symbols should have DECL as their
4433 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4436 /* Get rid of any decl not in local_decls. */
4437 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4439 pointer_set_destroy (locals);
4442 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4443 At this point, it is not needed anymore. */
4444 DECL_SAVED_TREE (decl) = NULL_TREE;
4446 else if (TREE_CODE (decl) == VAR_DECL)
4448 tree expr = DECL_DEBUG_EXPR (decl);
4450 && TREE_CODE (expr) == VAR_DECL
4451 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4452 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4454 if (DECL_EXTERNAL (decl)
4455 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4456 DECL_INITIAL (decl) = NULL_TREE;
4458 else if (TREE_CODE (decl) == TYPE_DECL)
4460 DECL_INITIAL (decl) = NULL_TREE;
4462 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4463 FIELD_DECLs, which should be preserved. Otherwise,
4464 we shouldn't be concerned with source-level lexical
4465 nesting beyond this point. */
4466 DECL_CONTEXT (decl) = NULL_TREE;
4471 /* Data used when collecting DECLs and TYPEs for language data removal. */
4473 struct free_lang_data_d
4475 /* Worklist to avoid excessive recursion. */
4476 VEC(tree,heap) *worklist;
4478 /* Set of traversed objects. Used to avoid duplicate visits. */
4479 struct pointer_set_t *pset;
4481 /* Array of symbols to process with free_lang_data_in_decl. */
4482 VEC(tree,heap) *decls;
4484 /* Array of types to process with free_lang_data_in_type. */
4485 VEC(tree,heap) *types;
4489 /* Save all language fields needed to generate proper debug information
4490 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4493 save_debug_info_for_decl (tree t)
4495 /*struct saved_debug_info_d *sdi;*/
4497 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4499 /* FIXME. Partial implementation for saving debug info removed. */
4503 /* Save all language fields needed to generate proper debug information
4504 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4507 save_debug_info_for_type (tree t)
4509 /*struct saved_debug_info_d *sdi;*/
4511 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4513 /* FIXME. Partial implementation for saving debug info removed. */
4517 /* Add type or decl T to one of the list of tree nodes that need their
4518 language data removed. The lists are held inside FLD. */
4521 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4525 VEC_safe_push (tree, heap, fld->decls, t);
4526 if (debug_info_level > DINFO_LEVEL_TERSE)
4527 save_debug_info_for_decl (t);
4529 else if (TYPE_P (t))
4531 VEC_safe_push (tree, heap, fld->types, t);
4532 if (debug_info_level > DINFO_LEVEL_TERSE)
4533 save_debug_info_for_type (t);
4539 /* Push tree node T into FLD->WORKLIST. */
4542 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4544 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4545 VEC_safe_push (tree, heap, fld->worklist, (t));
4549 /* Operand callback helper for free_lang_data_in_node. *TP is the
4550 subtree operand being considered. */
4553 find_decls_types_r (tree *tp, int *ws, void *data)
4556 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4558 if (TREE_CODE (t) == TREE_LIST)
4561 /* Language specific nodes will be removed, so there is no need
4562 to gather anything under them. */
4563 if (is_lang_specific (t))
4571 /* Note that walk_tree does not traverse every possible field in
4572 decls, so we have to do our own traversals here. */
4573 add_tree_to_fld_list (t, fld);
4575 fld_worklist_push (DECL_NAME (t), fld);
4576 fld_worklist_push (DECL_CONTEXT (t), fld);
4577 fld_worklist_push (DECL_SIZE (t), fld);
4578 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4580 /* We are going to remove everything under DECL_INITIAL for
4581 TYPE_DECLs. No point walking them. */
4582 if (TREE_CODE (t) != TYPE_DECL)
4583 fld_worklist_push (DECL_INITIAL (t), fld);
4585 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4586 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4588 if (TREE_CODE (t) == FUNCTION_DECL)
4590 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4591 fld_worklist_push (DECL_RESULT (t), fld);
4593 else if (TREE_CODE (t) == TYPE_DECL)
4595 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4596 fld_worklist_push (DECL_VINDEX (t), fld);
4598 else if (TREE_CODE (t) == FIELD_DECL)
4600 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4601 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4602 fld_worklist_push (DECL_QUALIFIER (t), fld);
4603 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4604 fld_worklist_push (DECL_FCONTEXT (t), fld);
4606 else if (TREE_CODE (t) == VAR_DECL)
4608 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4609 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4612 if (TREE_CODE (t) != FIELD_DECL)
4613 fld_worklist_push (TREE_CHAIN (t), fld);
4616 else if (TYPE_P (t))
4618 /* Note that walk_tree does not traverse every possible field in
4619 types, so we have to do our own traversals here. */
4620 add_tree_to_fld_list (t, fld);
4622 if (!RECORD_OR_UNION_TYPE_P (t))
4623 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4624 fld_worklist_push (TYPE_SIZE (t), fld);
4625 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4626 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4627 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4628 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4629 fld_worklist_push (TYPE_NAME (t), fld);
4630 fld_worklist_push (TYPE_MINVAL (t), fld);
4631 if (!RECORD_OR_UNION_TYPE_P (t))
4632 fld_worklist_push (TYPE_MAXVAL (t), fld);
4633 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4634 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4635 fld_worklist_push (TYPE_CONTEXT (t), fld);
4636 fld_worklist_push (TYPE_CANONICAL (t), fld);
4638 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4642 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4644 fld_worklist_push (TREE_TYPE (tem), fld);
4645 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4647 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4648 && TREE_CODE (tem) == TREE_LIST)
4651 fld_worklist_push (TREE_VALUE (tem), fld);
4652 tem = TREE_CHAIN (tem);
4656 if (RECORD_OR_UNION_TYPE_P (t))
4659 /* Push all TYPE_FIELDS - there can be interleaving interesting
4660 and non-interesting things. */
4661 tem = TYPE_FIELDS (t);
4664 if (TREE_CODE (tem) == FIELD_DECL)
4665 fld_worklist_push (tem, fld);
4666 tem = TREE_CHAIN (tem);
4670 fld_worklist_push (TREE_CHAIN (t), fld);
4674 fld_worklist_push (TREE_TYPE (t), fld);
4680 /* Find decls and types in T. */
4683 find_decls_types (tree t, struct free_lang_data_d *fld)
4687 if (!pointer_set_contains (fld->pset, t))
4688 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4689 if (VEC_empty (tree, fld->worklist))
4691 t = VEC_pop (tree, fld->worklist);
4695 /* Translate all the types in LIST with the corresponding runtime
4699 get_eh_types_for_runtime (tree list)
4703 if (list == NULL_TREE)
4706 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4708 list = TREE_CHAIN (list);
4711 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4712 TREE_CHAIN (prev) = n;
4713 prev = TREE_CHAIN (prev);
4714 list = TREE_CHAIN (list);
4721 /* Find decls and types referenced in EH region R and store them in
4722 FLD->DECLS and FLD->TYPES. */
4725 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4736 /* The types referenced in each catch must first be changed to the
4737 EH types used at runtime. This removes references to FE types
4739 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4741 c->type_list = get_eh_types_for_runtime (c->type_list);
4742 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4747 case ERT_ALLOWED_EXCEPTIONS:
4748 r->u.allowed.type_list
4749 = get_eh_types_for_runtime (r->u.allowed.type_list);
4750 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4753 case ERT_MUST_NOT_THROW:
4754 walk_tree (&r->u.must_not_throw.failure_decl,
4755 find_decls_types_r, fld, fld->pset);
4761 /* Find decls and types referenced in cgraph node N and store them in
4762 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4763 look for *every* kind of DECL and TYPE node reachable from N,
4764 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4765 NAMESPACE_DECLs, etc). */
4768 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4771 struct function *fn;
4774 find_decls_types (n->decl, fld);
4776 if (!gimple_has_body_p (n->decl))
4779 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4781 fn = DECL_STRUCT_FUNCTION (n->decl);
4783 /* Traverse locals. */
4784 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4785 find_decls_types (TREE_VALUE (t), fld);
4787 /* Traverse EH regions in FN. */
4790 FOR_ALL_EH_REGION_FN (r, fn)
4791 find_decls_types_in_eh_region (r, fld);
4794 /* Traverse every statement in FN. */
4795 FOR_EACH_BB_FN (bb, fn)
4797 gimple_stmt_iterator si;
4800 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4802 gimple phi = gsi_stmt (si);
4804 for (i = 0; i < gimple_phi_num_args (phi); i++)
4806 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4807 find_decls_types (*arg_p, fld);
4811 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4813 gimple stmt = gsi_stmt (si);
4815 for (i = 0; i < gimple_num_ops (stmt); i++)
4817 tree arg = gimple_op (stmt, i);
4818 find_decls_types (arg, fld);
4825 /* Find decls and types referenced in varpool node N and store them in
4826 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4827 look for *every* kind of DECL and TYPE node reachable from N,
4828 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4829 NAMESPACE_DECLs, etc). */
4832 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4834 find_decls_types (v->decl, fld);
4837 /* If T needs an assembler name, have one created for it. */
4840 assign_assembler_name_if_neeeded (tree t)
4842 if (need_assembler_name_p (t))
4844 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4845 diagnostics that use input_location to show locus
4846 information. The problem here is that, at this point,
4847 input_location is generally anchored to the end of the file
4848 (since the parser is long gone), so we don't have a good
4849 position to pin it to.
4851 To alleviate this problem, this uses the location of T's
4852 declaration. Examples of this are
4853 testsuite/g++.dg/template/cond2.C and
4854 testsuite/g++.dg/template/pr35240.C. */
4855 location_t saved_location = input_location;
4856 input_location = DECL_SOURCE_LOCATION (t);
4858 decl_assembler_name (t);
4860 input_location = saved_location;
4865 /* Free language specific information for every operand and expression
4866 in every node of the call graph. This process operates in three stages:
4868 1- Every callgraph node and varpool node is traversed looking for
4869 decls and types embedded in them. This is a more exhaustive
4870 search than that done by find_referenced_vars, because it will
4871 also collect individual fields, decls embedded in types, etc.
4873 2- All the decls found are sent to free_lang_data_in_decl.
4875 3- All the types found are sent to free_lang_data_in_type.
4877 The ordering between decls and types is important because
4878 free_lang_data_in_decl sets assembler names, which includes
4879 mangling. So types cannot be freed up until assembler names have
4883 free_lang_data_in_cgraph (void)
4885 struct cgraph_node *n;
4886 struct varpool_node *v;
4887 struct free_lang_data_d fld;
4892 /* Initialize sets and arrays to store referenced decls and types. */
4893 fld.pset = pointer_set_create ();
4894 fld.worklist = NULL;
4895 fld.decls = VEC_alloc (tree, heap, 100);
4896 fld.types = VEC_alloc (tree, heap, 100);
4898 /* Find decls and types in the body of every function in the callgraph. */
4899 for (n = cgraph_nodes; n; n = n->next)
4900 find_decls_types_in_node (n, &fld);
4902 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4903 find_decls_types (p->decl, &fld);
4905 /* Find decls and types in every varpool symbol. */
4906 for (v = varpool_nodes_queue; v; v = v->next_needed)
4907 find_decls_types_in_var (v, &fld);
4909 /* Set the assembler name on every decl found. We need to do this
4910 now because free_lang_data_in_decl will invalidate data needed
4911 for mangling. This breaks mangling on interdependent decls. */
4912 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4913 assign_assembler_name_if_neeeded (t);
4915 /* Traverse every decl found freeing its language data. */
4916 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4917 free_lang_data_in_decl (t);
4919 /* Traverse every type found freeing its language data. */
4920 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4921 free_lang_data_in_type (t);
4923 pointer_set_destroy (fld.pset);
4924 VEC_free (tree, heap, fld.worklist);
4925 VEC_free (tree, heap, fld.decls);
4926 VEC_free (tree, heap, fld.types);
4930 /* Free resources that are used by FE but are not needed once they are done. */
4933 free_lang_data (void)
4937 /* If we are the LTO frontend we have freed lang-specific data already. */
4939 || !flag_generate_lto)
4942 /* Allocate and assign alias sets to the standard integer types
4943 while the slots are still in the way the frontends generated them. */
4944 for (i = 0; i < itk_none; ++i)
4945 if (integer_types[i])
4946 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
4948 /* Traverse the IL resetting language specific information for
4949 operands, expressions, etc. */
4950 free_lang_data_in_cgraph ();
4952 /* Create gimple variants for common types. */
4953 ptrdiff_type_node = integer_type_node;
4954 fileptr_type_node = ptr_type_node;
4955 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4956 || (TYPE_MODE (boolean_type_node)
4957 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4958 || TYPE_PRECISION (boolean_type_node) != 1
4959 || !TYPE_UNSIGNED (boolean_type_node))
4961 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4962 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4963 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4964 TYPE_PRECISION (boolean_type_node) = 1;
4965 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4966 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4969 /* Unify char_type_node with its properly signed variant. */
4970 if (TYPE_UNSIGNED (char_type_node))
4971 unsigned_char_type_node = char_type_node;
4973 signed_char_type_node = char_type_node;
4975 /* Reset some langhooks. Do not reset types_compatible_p, it may
4976 still be used indirectly via the get_alias_set langhook. */
4977 lang_hooks.callgraph.analyze_expr = NULL;
4978 lang_hooks.dwarf_name = lhd_dwarf_name;
4979 lang_hooks.decl_printable_name = gimple_decl_printable_name;
4980 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
4981 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
4983 /* Reset diagnostic machinery. */
4984 diagnostic_starter (global_dc) = default_diagnostic_starter;
4985 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
4986 diagnostic_format_decoder (global_dc) = default_tree_printer;
4992 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
4996 "*free_lang_data", /* name */
4998 free_lang_data, /* execute */
5001 0, /* static_pass_number */
5002 TV_IPA_FREE_LANG_DATA, /* tv_id */
5003 0, /* properties_required */
5004 0, /* properties_provided */
5005 0, /* properties_destroyed */
5006 0, /* todo_flags_start */
5007 TODO_ggc_collect /* todo_flags_finish */
5011 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5014 We try both `text' and `__text__', ATTR may be either one. */
5015 /* ??? It might be a reasonable simplification to require ATTR to be only
5016 `text'. One might then also require attribute lists to be stored in
5017 their canonicalized form. */
5020 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5025 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5028 p = IDENTIFIER_POINTER (ident);
5029 ident_len = IDENTIFIER_LENGTH (ident);
5031 if (ident_len == attr_len
5032 && strcmp (attr, p) == 0)
5035 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5038 gcc_assert (attr[1] == '_');
5039 gcc_assert (attr[attr_len - 2] == '_');
5040 gcc_assert (attr[attr_len - 1] == '_');
5041 if (ident_len == attr_len - 4
5042 && strncmp (attr + 2, p, attr_len - 4) == 0)
5047 if (ident_len == attr_len + 4
5048 && p[0] == '_' && p[1] == '_'
5049 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5050 && strncmp (attr, p + 2, attr_len) == 0)
5057 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5060 We try both `text' and `__text__', ATTR may be either one. */
5063 is_attribute_p (const char *attr, const_tree ident)
5065 return is_attribute_with_length_p (attr, strlen (attr), ident);
5068 /* Given an attribute name and a list of attributes, return a pointer to the
5069 attribute's list element if the attribute is part of the list, or NULL_TREE
5070 if not found. If the attribute appears more than once, this only
5071 returns the first occurrence; the TREE_CHAIN of the return value should
5072 be passed back in if further occurrences are wanted. */
5075 lookup_attribute (const char *attr_name, tree list)
5078 size_t attr_len = strlen (attr_name);
5080 for (l = list; l; l = TREE_CHAIN (l))
5082 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5083 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5089 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5093 remove_attribute (const char *attr_name, tree list)
5096 size_t attr_len = strlen (attr_name);
5098 for (p = &list; *p; )
5101 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5102 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5103 *p = TREE_CHAIN (l);
5105 p = &TREE_CHAIN (l);
5111 /* Return an attribute list that is the union of a1 and a2. */
5114 merge_attributes (tree a1, tree a2)
5118 /* Either one unset? Take the set one. */
5120 if ((attributes = a1) == 0)
5123 /* One that completely contains the other? Take it. */
5125 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5127 if (attribute_list_contained (a2, a1))
5131 /* Pick the longest list, and hang on the other list. */
5133 if (list_length (a1) < list_length (a2))
5134 attributes = a2, a2 = a1;
5136 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5139 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5142 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5145 if (TREE_VALUE (a) != NULL
5146 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5147 && TREE_VALUE (a2) != NULL
5148 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5150 if (simple_cst_list_equal (TREE_VALUE (a),
5151 TREE_VALUE (a2)) == 1)
5154 else if (simple_cst_equal (TREE_VALUE (a),
5155 TREE_VALUE (a2)) == 1)
5160 a1 = copy_node (a2);
5161 TREE_CHAIN (a1) = attributes;
5170 /* Given types T1 and T2, merge their attributes and return
5174 merge_type_attributes (tree t1, tree t2)
5176 return merge_attributes (TYPE_ATTRIBUTES (t1),
5177 TYPE_ATTRIBUTES (t2));
5180 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5184 merge_decl_attributes (tree olddecl, tree newdecl)
5186 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5187 DECL_ATTRIBUTES (newdecl));
5190 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5192 /* Specialization of merge_decl_attributes for various Windows targets.
5194 This handles the following situation:
5196 __declspec (dllimport) int foo;
5199 The second instance of `foo' nullifies the dllimport. */
5202 merge_dllimport_decl_attributes (tree old, tree new_tree)
5205 int delete_dllimport_p = 1;
5207 /* What we need to do here is remove from `old' dllimport if it doesn't
5208 appear in `new'. dllimport behaves like extern: if a declaration is
5209 marked dllimport and a definition appears later, then the object
5210 is not dllimport'd. We also remove a `new' dllimport if the old list
5211 contains dllexport: dllexport always overrides dllimport, regardless
5212 of the order of declaration. */
5213 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5214 delete_dllimport_p = 0;
5215 else if (DECL_DLLIMPORT_P (new_tree)
5216 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5218 DECL_DLLIMPORT_P (new_tree) = 0;
5219 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5220 "dllimport ignored", new_tree);
5222 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5224 /* Warn about overriding a symbol that has already been used, e.g.:
5225 extern int __attribute__ ((dllimport)) foo;
5226 int* bar () {return &foo;}
5229 if (TREE_USED (old))
5231 warning (0, "%q+D redeclared without dllimport attribute "
5232 "after being referenced with dll linkage", new_tree);
5233 /* If we have used a variable's address with dllimport linkage,
5234 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5235 decl may already have had TREE_CONSTANT computed.
5236 We still remove the attribute so that assembler code refers
5237 to '&foo rather than '_imp__foo'. */
5238 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5239 DECL_DLLIMPORT_P (new_tree) = 1;
5242 /* Let an inline definition silently override the external reference,
5243 but otherwise warn about attribute inconsistency. */
5244 else if (TREE_CODE (new_tree) == VAR_DECL
5245 || !DECL_DECLARED_INLINE_P (new_tree))
5246 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5247 "previous dllimport ignored", new_tree);
5250 delete_dllimport_p = 0;
5252 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5254 if (delete_dllimport_p)
5257 const size_t attr_len = strlen ("dllimport");
5259 /* Scan the list for dllimport and delete it. */
5260 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5262 if (is_attribute_with_length_p ("dllimport", attr_len,
5265 if (prev == NULL_TREE)
5268 TREE_CHAIN (prev) = TREE_CHAIN (t);
5277 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5278 struct attribute_spec.handler. */
5281 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5287 /* These attributes may apply to structure and union types being created,
5288 but otherwise should pass to the declaration involved. */
5291 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5292 | (int) ATTR_FLAG_ARRAY_NEXT))
5294 *no_add_attrs = true;
5295 return tree_cons (name, args, NULL_TREE);
5297 if (TREE_CODE (node) == RECORD_TYPE
5298 || TREE_CODE (node) == UNION_TYPE)
5300 node = TYPE_NAME (node);
5306 warning (OPT_Wattributes, "%qE attribute ignored",
5308 *no_add_attrs = true;
5313 if (TREE_CODE (node) != FUNCTION_DECL
5314 && TREE_CODE (node) != VAR_DECL
5315 && TREE_CODE (node) != TYPE_DECL)
5317 *no_add_attrs = true;
5318 warning (OPT_Wattributes, "%qE attribute ignored",
5323 if (TREE_CODE (node) == TYPE_DECL
5324 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5325 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5327 *no_add_attrs = true;
5328 warning (OPT_Wattributes, "%qE attribute ignored",
5333 is_dllimport = is_attribute_p ("dllimport", name);
5335 /* Report error on dllimport ambiguities seen now before they cause
5339 /* Honor any target-specific overrides. */
5340 if (!targetm.valid_dllimport_attribute_p (node))
5341 *no_add_attrs = true;
5343 else if (TREE_CODE (node) == FUNCTION_DECL
5344 && DECL_DECLARED_INLINE_P (node))
5346 warning (OPT_Wattributes, "inline function %q+D declared as "
5347 " dllimport: attribute ignored", node);
5348 *no_add_attrs = true;
5350 /* Like MS, treat definition of dllimported variables and
5351 non-inlined functions on declaration as syntax errors. */
5352 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5354 error ("function %q+D definition is marked dllimport", node);
5355 *no_add_attrs = true;
5358 else if (TREE_CODE (node) == VAR_DECL)
5360 if (DECL_INITIAL (node))
5362 error ("variable %q+D definition is marked dllimport",
5364 *no_add_attrs = true;
5367 /* `extern' needn't be specified with dllimport.
5368 Specify `extern' now and hope for the best. Sigh. */
5369 DECL_EXTERNAL (node) = 1;
5370 /* Also, implicitly give dllimport'd variables declared within
5371 a function global scope, unless declared static. */
5372 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5373 TREE_PUBLIC (node) = 1;
5376 if (*no_add_attrs == false)
5377 DECL_DLLIMPORT_P (node) = 1;
5379 else if (TREE_CODE (node) == FUNCTION_DECL
5380 && DECL_DECLARED_INLINE_P (node))
5381 /* An exported function, even if inline, must be emitted. */
5382 DECL_EXTERNAL (node) = 0;
5384 /* Report error if symbol is not accessible at global scope. */
5385 if (!TREE_PUBLIC (node)
5386 && (TREE_CODE (node) == VAR_DECL
5387 || TREE_CODE (node) == FUNCTION_DECL))
5389 error ("external linkage required for symbol %q+D because of "
5390 "%qE attribute", node, name);
5391 *no_add_attrs = true;
5394 /* A dllexport'd entity must have default visibility so that other
5395 program units (shared libraries or the main executable) can see
5396 it. A dllimport'd entity must have default visibility so that
5397 the linker knows that undefined references within this program
5398 unit can be resolved by the dynamic linker. */
5401 if (DECL_VISIBILITY_SPECIFIED (node)
5402 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5403 error ("%qE implies default visibility, but %qD has already "
5404 "been declared with a different visibility",
5406 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5407 DECL_VISIBILITY_SPECIFIED (node) = 1;
5413 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5415 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5416 of the various TYPE_QUAL values. */
5419 set_type_quals (tree type, int type_quals)
5421 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5422 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5423 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5424 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5427 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5430 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5432 return (TYPE_QUALS (cand) == type_quals
5433 && TYPE_NAME (cand) == TYPE_NAME (base)
5434 /* Apparently this is needed for Objective-C. */
5435 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5436 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5437 TYPE_ATTRIBUTES (base)));
5440 /* Return a version of the TYPE, qualified as indicated by the
5441 TYPE_QUALS, if one exists. If no qualified version exists yet,
5442 return NULL_TREE. */
5445 get_qualified_type (tree type, int type_quals)
5449 if (TYPE_QUALS (type) == type_quals)
5452 /* Search the chain of variants to see if there is already one there just
5453 like the one we need to have. If so, use that existing one. We must
5454 preserve the TYPE_NAME, since there is code that depends on this. */
5455 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5456 if (check_qualified_type (t, type, type_quals))
5462 /* Like get_qualified_type, but creates the type if it does not
5463 exist. This function never returns NULL_TREE. */
5466 build_qualified_type (tree type, int type_quals)
5470 /* See if we already have the appropriate qualified variant. */
5471 t = get_qualified_type (type, type_quals);
5473 /* If not, build it. */
5476 t = build_variant_type_copy (type);
5477 set_type_quals (t, type_quals);
5479 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5480 /* Propagate structural equality. */
5481 SET_TYPE_STRUCTURAL_EQUALITY (t);
5482 else if (TYPE_CANONICAL (type) != type)
5483 /* Build the underlying canonical type, since it is different
5485 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5488 /* T is its own canonical type. */
5489 TYPE_CANONICAL (t) = t;
5496 /* Create a new distinct copy of TYPE. The new type is made its own
5497 MAIN_VARIANT. If TYPE requires structural equality checks, the
5498 resulting type requires structural equality checks; otherwise, its
5499 TYPE_CANONICAL points to itself. */
5502 build_distinct_type_copy (tree type)
5504 tree t = copy_node (type);
5506 TYPE_POINTER_TO (t) = 0;
5507 TYPE_REFERENCE_TO (t) = 0;
5509 /* Set the canonical type either to a new equivalence class, or
5510 propagate the need for structural equality checks. */
5511 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5512 SET_TYPE_STRUCTURAL_EQUALITY (t);
5514 TYPE_CANONICAL (t) = t;
5516 /* Make it its own variant. */
5517 TYPE_MAIN_VARIANT (t) = t;
5518 TYPE_NEXT_VARIANT (t) = 0;
5520 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5521 whose TREE_TYPE is not t. This can also happen in the Ada
5522 frontend when using subtypes. */
5527 /* Create a new variant of TYPE, equivalent but distinct. This is so
5528 the caller can modify it. TYPE_CANONICAL for the return type will
5529 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5530 are considered equal by the language itself (or that both types
5531 require structural equality checks). */
5534 build_variant_type_copy (tree type)
5536 tree t, m = TYPE_MAIN_VARIANT (type);
5538 t = build_distinct_type_copy (type);
5540 /* Since we're building a variant, assume that it is a non-semantic
5541 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5542 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5544 /* Add the new type to the chain of variants of TYPE. */
5545 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5546 TYPE_NEXT_VARIANT (m) = t;
5547 TYPE_MAIN_VARIANT (t) = m;
5552 /* Return true if the from tree in both tree maps are equal. */
5555 tree_map_base_eq (const void *va, const void *vb)
5557 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5558 *const b = (const struct tree_map_base *) vb;
5559 return (a->from == b->from);
5562 /* Hash a from tree in a tree_map. */
5565 tree_map_base_hash (const void *item)
5567 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5570 /* Return true if this tree map structure is marked for garbage collection
5571 purposes. We simply return true if the from tree is marked, so that this
5572 structure goes away when the from tree goes away. */
5575 tree_map_base_marked_p (const void *p)
5577 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5581 tree_map_hash (const void *item)
5583 return (((const struct tree_map *) item)->hash);
5586 /* Return the initialization priority for DECL. */
5589 decl_init_priority_lookup (tree decl)
5591 struct tree_priority_map *h;
5592 struct tree_map_base in;
5594 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5596 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5597 return h ? h->init : DEFAULT_INIT_PRIORITY;
5600 /* Return the finalization priority for DECL. */
5603 decl_fini_priority_lookup (tree decl)
5605 struct tree_priority_map *h;
5606 struct tree_map_base in;
5608 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5610 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5611 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5614 /* Return the initialization and finalization priority information for
5615 DECL. If there is no previous priority information, a freshly
5616 allocated structure is returned. */
5618 static struct tree_priority_map *
5619 decl_priority_info (tree decl)
5621 struct tree_priority_map in;
5622 struct tree_priority_map *h;
5625 in.base.from = decl;
5626 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5627 h = (struct tree_priority_map *) *loc;
5630 h = GGC_CNEW (struct tree_priority_map);
5632 h->base.from = decl;
5633 h->init = DEFAULT_INIT_PRIORITY;
5634 h->fini = DEFAULT_INIT_PRIORITY;
5640 /* Set the initialization priority for DECL to PRIORITY. */
5643 decl_init_priority_insert (tree decl, priority_type priority)
5645 struct tree_priority_map *h;
5647 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5648 h = decl_priority_info (decl);
5652 /* Set the finalization priority for DECL to PRIORITY. */
5655 decl_fini_priority_insert (tree decl, priority_type priority)
5657 struct tree_priority_map *h;
5659 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5660 h = decl_priority_info (decl);
5664 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5667 print_debug_expr_statistics (void)
5669 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5670 (long) htab_size (debug_expr_for_decl),
5671 (long) htab_elements (debug_expr_for_decl),
5672 htab_collisions (debug_expr_for_decl));
5675 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5678 print_value_expr_statistics (void)
5680 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5681 (long) htab_size (value_expr_for_decl),
5682 (long) htab_elements (value_expr_for_decl),
5683 htab_collisions (value_expr_for_decl));
5686 /* Lookup a debug expression for FROM, and return it if we find one. */
5689 decl_debug_expr_lookup (tree from)
5691 struct tree_map *h, in;
5692 in.base.from = from;
5694 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5695 htab_hash_pointer (from));
5701 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5704 decl_debug_expr_insert (tree from, tree to)
5709 h = GGC_NEW (struct tree_map);
5710 h->hash = htab_hash_pointer (from);
5711 h->base.from = from;
5713 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5714 *(struct tree_map **) loc = h;
5717 /* Lookup a value expression for FROM, and return it if we find one. */
5720 decl_value_expr_lookup (tree from)
5722 struct tree_map *h, in;
5723 in.base.from = from;
5725 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5726 htab_hash_pointer (from));
5732 /* Insert a mapping FROM->TO in the value expression hashtable. */
5735 decl_value_expr_insert (tree from, tree to)
5740 h = GGC_NEW (struct tree_map);
5741 h->hash = htab_hash_pointer (from);
5742 h->base.from = from;
5744 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5745 *(struct tree_map **) loc = h;
5748 /* Hashing of types so that we don't make duplicates.
5749 The entry point is `type_hash_canon'. */
5751 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5752 with types in the TREE_VALUE slots), by adding the hash codes
5753 of the individual types. */
5756 type_hash_list (const_tree list, hashval_t hashcode)
5760 for (tail = list; tail; tail = TREE_CHAIN (tail))
5761 if (TREE_VALUE (tail) != error_mark_node)
5762 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5768 /* These are the Hashtable callback functions. */
5770 /* Returns true iff the types are equivalent. */
5773 type_hash_eq (const void *va, const void *vb)
5775 const struct type_hash *const a = (const struct type_hash *) va,
5776 *const b = (const struct type_hash *) vb;
5778 /* First test the things that are the same for all types. */
5779 if (a->hash != b->hash
5780 || TREE_CODE (a->type) != TREE_CODE (b->type)
5781 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5782 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5783 TYPE_ATTRIBUTES (b->type))
5784 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5785 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5786 || (TREE_CODE (a->type) != COMPLEX_TYPE
5787 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5790 switch (TREE_CODE (a->type))
5795 case REFERENCE_TYPE:
5799 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5802 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5803 && !(TYPE_VALUES (a->type)
5804 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5805 && TYPE_VALUES (b->type)
5806 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5807 && type_list_equal (TYPE_VALUES (a->type),
5808 TYPE_VALUES (b->type))))
5811 /* ... fall through ... */
5816 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5817 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5818 TYPE_MAX_VALUE (b->type)))
5819 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5820 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5821 TYPE_MIN_VALUE (b->type))));
5823 case FIXED_POINT_TYPE:
5824 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5827 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5830 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5831 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5832 || (TYPE_ARG_TYPES (a->type)
5833 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5834 && TYPE_ARG_TYPES (b->type)
5835 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5836 && type_list_equal (TYPE_ARG_TYPES (a->type),
5837 TYPE_ARG_TYPES (b->type)))));
5840 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5844 case QUAL_UNION_TYPE:
5845 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5846 || (TYPE_FIELDS (a->type)
5847 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5848 && TYPE_FIELDS (b->type)
5849 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5850 && type_list_equal (TYPE_FIELDS (a->type),
5851 TYPE_FIELDS (b->type))));
5854 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5855 || (TYPE_ARG_TYPES (a->type)
5856 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5857 && TYPE_ARG_TYPES (b->type)
5858 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5859 && type_list_equal (TYPE_ARG_TYPES (a->type),
5860 TYPE_ARG_TYPES (b->type))))
5868 if (lang_hooks.types.type_hash_eq != NULL)
5869 return lang_hooks.types.type_hash_eq (a->type, b->type);
5874 /* Return the cached hash value. */
5877 type_hash_hash (const void *item)
5879 return ((const struct type_hash *) item)->hash;
5882 /* Look in the type hash table for a type isomorphic to TYPE.
5883 If one is found, return it. Otherwise return 0. */
5886 type_hash_lookup (hashval_t hashcode, tree type)
5888 struct type_hash *h, in;
5890 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5891 must call that routine before comparing TYPE_ALIGNs. */
5897 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5904 /* Add an entry to the type-hash-table
5905 for a type TYPE whose hash code is HASHCODE. */
5908 type_hash_add (hashval_t hashcode, tree type)
5910 struct type_hash *h;
5913 h = GGC_NEW (struct type_hash);
5916 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5920 /* Given TYPE, and HASHCODE its hash code, return the canonical
5921 object for an identical type if one already exists.
5922 Otherwise, return TYPE, and record it as the canonical object.
5924 To use this function, first create a type of the sort you want.
5925 Then compute its hash code from the fields of the type that
5926 make it different from other similar types.
5927 Then call this function and use the value. */
5930 type_hash_canon (unsigned int hashcode, tree type)
5934 /* The hash table only contains main variants, so ensure that's what we're
5936 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5938 if (!lang_hooks.types.hash_types)
5941 /* See if the type is in the hash table already. If so, return it.
5942 Otherwise, add the type. */
5943 t1 = type_hash_lookup (hashcode, type);
5946 #ifdef GATHER_STATISTICS
5947 tree_node_counts[(int) t_kind]--;
5948 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5954 type_hash_add (hashcode, type);
5959 /* See if the data pointed to by the type hash table is marked. We consider
5960 it marked if the type is marked or if a debug type number or symbol
5961 table entry has been made for the type. This reduces the amount of
5962 debugging output and eliminates that dependency of the debug output on
5963 the number of garbage collections. */
5966 type_hash_marked_p (const void *p)
5968 const_tree const type = ((const struct type_hash *) p)->type;
5970 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5974 print_type_hash_statistics (void)
5976 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5977 (long) htab_size (type_hash_table),
5978 (long) htab_elements (type_hash_table),
5979 htab_collisions (type_hash_table));
5982 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5983 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5984 by adding the hash codes of the individual attributes. */
5987 attribute_hash_list (const_tree list, hashval_t hashcode)
5991 for (tail = list; tail; tail = TREE_CHAIN (tail))
5992 /* ??? Do we want to add in TREE_VALUE too? */
5993 hashcode = iterative_hash_object
5994 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
5998 /* Given two lists of attributes, return true if list l2 is
5999 equivalent to l1. */
6002 attribute_list_equal (const_tree l1, const_tree l2)
6004 return attribute_list_contained (l1, l2)
6005 && attribute_list_contained (l2, l1);
6008 /* Given two lists of attributes, return true if list L2 is
6009 completely contained within L1. */
6010 /* ??? This would be faster if attribute names were stored in a canonicalized
6011 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6012 must be used to show these elements are equivalent (which they are). */
6013 /* ??? It's not clear that attributes with arguments will always be handled
6017 attribute_list_contained (const_tree l1, const_tree l2)
6021 /* First check the obvious, maybe the lists are identical. */
6025 /* Maybe the lists are similar. */
6026 for (t1 = l1, t2 = l2;
6028 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6029 && TREE_VALUE (t1) == TREE_VALUE (t2);
6030 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6032 /* Maybe the lists are equal. */
6033 if (t1 == 0 && t2 == 0)
6036 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6039 /* This CONST_CAST is okay because lookup_attribute does not
6040 modify its argument and the return value is assigned to a
6042 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6043 CONST_CAST_TREE(l1));
6045 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6048 if (TREE_VALUE (t2) != NULL
6049 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6050 && TREE_VALUE (attr) != NULL
6051 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6053 if (simple_cst_list_equal (TREE_VALUE (t2),
6054 TREE_VALUE (attr)) == 1)
6057 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6068 /* Given two lists of types
6069 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6070 return 1 if the lists contain the same types in the same order.
6071 Also, the TREE_PURPOSEs must match. */
6074 type_list_equal (const_tree l1, const_tree l2)
6078 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6079 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6080 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6081 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6082 && (TREE_TYPE (TREE_PURPOSE (t1))
6083 == TREE_TYPE (TREE_PURPOSE (t2))))))
6089 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6090 given by TYPE. If the argument list accepts variable arguments,
6091 then this function counts only the ordinary arguments. */
6094 type_num_arguments (const_tree type)
6099 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6100 /* If the function does not take a variable number of arguments,
6101 the last element in the list will have type `void'. */
6102 if (VOID_TYPE_P (TREE_VALUE (t)))
6110 /* Nonzero if integer constants T1 and T2
6111 represent the same constant value. */
6114 tree_int_cst_equal (const_tree t1, const_tree t2)
6119 if (t1 == 0 || t2 == 0)
6122 if (TREE_CODE (t1) == INTEGER_CST
6123 && TREE_CODE (t2) == INTEGER_CST
6124 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6125 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6131 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6132 The precise way of comparison depends on their data type. */
6135 tree_int_cst_lt (const_tree t1, const_tree t2)
6140 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6142 int t1_sgn = tree_int_cst_sgn (t1);
6143 int t2_sgn = tree_int_cst_sgn (t2);
6145 if (t1_sgn < t2_sgn)
6147 else if (t1_sgn > t2_sgn)
6149 /* Otherwise, both are non-negative, so we compare them as
6150 unsigned just in case one of them would overflow a signed
6153 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6154 return INT_CST_LT (t1, t2);
6156 return INT_CST_LT_UNSIGNED (t1, t2);
6159 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6162 tree_int_cst_compare (const_tree t1, const_tree t2)
6164 if (tree_int_cst_lt (t1, t2))
6166 else if (tree_int_cst_lt (t2, t1))
6172 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6173 the host. If POS is zero, the value can be represented in a single
6174 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6175 be represented in a single unsigned HOST_WIDE_INT. */
6178 host_integerp (const_tree t, int pos)
6183 return (TREE_CODE (t) == INTEGER_CST
6184 && ((TREE_INT_CST_HIGH (t) == 0
6185 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6186 || (! pos && TREE_INT_CST_HIGH (t) == -1
6187 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6188 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6189 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6190 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6191 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6194 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6195 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6196 be non-negative. We must be able to satisfy the above conditions. */
6199 tree_low_cst (const_tree t, int pos)
6201 gcc_assert (host_integerp (t, pos));
6202 return TREE_INT_CST_LOW (t);
6205 /* Return the most significant bit of the integer constant T. */
6208 tree_int_cst_msb (const_tree t)
6212 unsigned HOST_WIDE_INT l;
6214 /* Note that using TYPE_PRECISION here is wrong. We care about the
6215 actual bits, not the (arbitrary) range of the type. */
6216 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6217 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6218 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6219 return (l & 1) == 1;
6222 /* Return an indication of the sign of the integer constant T.
6223 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6224 Note that -1 will never be returned if T's type is unsigned. */
6227 tree_int_cst_sgn (const_tree t)
6229 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6231 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6233 else if (TREE_INT_CST_HIGH (t) < 0)
6239 /* Return the minimum number of bits needed to represent VALUE in a
6240 signed or unsigned type, UNSIGNEDP says which. */
6243 tree_int_cst_min_precision (tree value, bool unsignedp)
6247 /* If the value is negative, compute its negative minus 1. The latter
6248 adjustment is because the absolute value of the largest negative value
6249 is one larger than the largest positive value. This is equivalent to
6250 a bit-wise negation, so use that operation instead. */
6252 if (tree_int_cst_sgn (value) < 0)
6253 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6255 /* Return the number of bits needed, taking into account the fact
6256 that we need one more bit for a signed than unsigned type. */
6258 if (integer_zerop (value))
6261 log = tree_floor_log2 (value);
6263 return log + 1 + !unsignedp;
6266 /* Compare two constructor-element-type constants. Return 1 if the lists
6267 are known to be equal; otherwise return 0. */
6270 simple_cst_list_equal (const_tree l1, const_tree l2)
6272 while (l1 != NULL_TREE && l2 != NULL_TREE)
6274 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6277 l1 = TREE_CHAIN (l1);
6278 l2 = TREE_CHAIN (l2);
6284 /* Return truthvalue of whether T1 is the same tree structure as T2.
6285 Return 1 if they are the same.
6286 Return 0 if they are understandably different.
6287 Return -1 if either contains tree structure not understood by
6291 simple_cst_equal (const_tree t1, const_tree t2)
6293 enum tree_code code1, code2;
6299 if (t1 == 0 || t2 == 0)
6302 code1 = TREE_CODE (t1);
6303 code2 = TREE_CODE (t2);
6305 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6307 if (CONVERT_EXPR_CODE_P (code2)
6308 || code2 == NON_LVALUE_EXPR)
6309 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6311 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6314 else if (CONVERT_EXPR_CODE_P (code2)
6315 || code2 == NON_LVALUE_EXPR)
6316 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6324 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6325 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6328 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6331 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6334 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6335 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6336 TREE_STRING_LENGTH (t1)));
6340 unsigned HOST_WIDE_INT idx;
6341 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6342 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6344 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6347 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6348 /* ??? Should we handle also fields here? */
6349 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6350 VEC_index (constructor_elt, v2, idx)->value))
6356 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6359 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6362 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6365 const_tree arg1, arg2;
6366 const_call_expr_arg_iterator iter1, iter2;
6367 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6368 arg2 = first_const_call_expr_arg (t2, &iter2);
6370 arg1 = next_const_call_expr_arg (&iter1),
6371 arg2 = next_const_call_expr_arg (&iter2))
6373 cmp = simple_cst_equal (arg1, arg2);
6377 return arg1 == arg2;
6381 /* Special case: if either target is an unallocated VAR_DECL,
6382 it means that it's going to be unified with whatever the
6383 TARGET_EXPR is really supposed to initialize, so treat it
6384 as being equivalent to anything. */
6385 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6386 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6387 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6388 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6389 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6390 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6393 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6398 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6400 case WITH_CLEANUP_EXPR:
6401 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6405 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6408 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6409 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6423 /* This general rule works for most tree codes. All exceptions should be
6424 handled above. If this is a language-specific tree code, we can't
6425 trust what might be in the operand, so say we don't know
6427 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6430 switch (TREE_CODE_CLASS (code1))
6434 case tcc_comparison:
6435 case tcc_expression:
6439 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6441 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6453 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6454 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6455 than U, respectively. */
6458 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6460 if (tree_int_cst_sgn (t) < 0)
6462 else if (TREE_INT_CST_HIGH (t) != 0)
6464 else if (TREE_INT_CST_LOW (t) == u)
6466 else if (TREE_INT_CST_LOW (t) < u)
6472 /* Return true if CODE represents an associative tree code. Otherwise
6475 associative_tree_code (enum tree_code code)
6494 /* Return true if CODE represents a commutative tree code. Otherwise
6497 commutative_tree_code (enum tree_code code)
6510 case UNORDERED_EXPR:
6514 case TRUTH_AND_EXPR:
6515 case TRUTH_XOR_EXPR:
6525 /* Generate a hash value for an expression. This can be used iteratively
6526 by passing a previous result as the VAL argument.
6528 This function is intended to produce the same hash for expressions which
6529 would compare equal using operand_equal_p. */
6532 iterative_hash_expr (const_tree t, hashval_t val)
6535 enum tree_code code;
6539 return iterative_hash_hashval_t (0, val);
6541 code = TREE_CODE (t);
6545 /* Alas, constants aren't shared, so we can't rely on pointer
6548 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6549 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6552 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6554 return iterative_hash_hashval_t (val2, val);
6558 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6560 return iterative_hash_hashval_t (val2, val);
6563 return iterative_hash (TREE_STRING_POINTER (t),
6564 TREE_STRING_LENGTH (t), val);
6566 val = iterative_hash_expr (TREE_REALPART (t), val);
6567 return iterative_hash_expr (TREE_IMAGPART (t), val);
6569 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6572 /* we can just compare by pointer. */
6573 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6576 /* A list of expressions, for a CALL_EXPR or as the elements of a
6578 for (; t; t = TREE_CHAIN (t))
6579 val = iterative_hash_expr (TREE_VALUE (t), val);
6583 unsigned HOST_WIDE_INT idx;
6585 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6587 val = iterative_hash_expr (field, val);
6588 val = iterative_hash_expr (value, val);
6593 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6594 Otherwise nodes that compare equal according to operand_equal_p might
6595 get different hash codes. However, don't do this for machine specific
6596 or front end builtins, since the function code is overloaded in those
6598 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6599 && built_in_decls[DECL_FUNCTION_CODE (t)])
6601 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6602 code = TREE_CODE (t);
6606 tclass = TREE_CODE_CLASS (code);
6608 if (tclass == tcc_declaration)
6610 /* DECL's have a unique ID */
6611 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6615 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6617 val = iterative_hash_object (code, val);
6619 /* Don't hash the type, that can lead to having nodes which
6620 compare equal according to operand_equal_p, but which
6621 have different hash codes. */
6622 if (CONVERT_EXPR_CODE_P (code)
6623 || code == NON_LVALUE_EXPR)
6625 /* Make sure to include signness in the hash computation. */
6626 val += TYPE_UNSIGNED (TREE_TYPE (t));
6627 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6630 else if (commutative_tree_code (code))
6632 /* It's a commutative expression. We want to hash it the same
6633 however it appears. We do this by first hashing both operands
6634 and then rehashing based on the order of their independent
6636 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6637 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6641 t = one, one = two, two = t;
6643 val = iterative_hash_hashval_t (one, val);
6644 val = iterative_hash_hashval_t (two, val);
6647 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6648 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6655 /* Generate a hash value for a pair of expressions. This can be used
6656 iteratively by passing a previous result as the VAL argument.
6658 The same hash value is always returned for a given pair of expressions,
6659 regardless of the order in which they are presented. This is useful in
6660 hashing the operands of commutative functions. */
6663 iterative_hash_exprs_commutative (const_tree t1,
6664 const_tree t2, hashval_t val)
6666 hashval_t one = iterative_hash_expr (t1, 0);
6667 hashval_t two = iterative_hash_expr (t2, 0);
6671 t = one, one = two, two = t;
6672 val = iterative_hash_hashval_t (one, val);
6673 val = iterative_hash_hashval_t (two, val);
6678 /* Constructors for pointer, array and function types.
6679 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6680 constructed by language-dependent code, not here.) */
6682 /* Construct, lay out and return the type of pointers to TO_TYPE with
6683 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6684 reference all of memory. If such a type has already been
6685 constructed, reuse it. */
6688 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6693 if (to_type == error_mark_node)
6694 return error_mark_node;
6696 /* If the pointed-to type has the may_alias attribute set, force
6697 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6698 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6699 can_alias_all = true;
6701 /* In some cases, languages will have things that aren't a POINTER_TYPE
6702 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6703 In that case, return that type without regard to the rest of our
6706 ??? This is a kludge, but consistent with the way this function has
6707 always operated and there doesn't seem to be a good way to avoid this
6709 if (TYPE_POINTER_TO (to_type) != 0
6710 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6711 return TYPE_POINTER_TO (to_type);
6713 /* First, if we already have a type for pointers to TO_TYPE and it's
6714 the proper mode, use it. */
6715 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6716 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6719 t = make_node (POINTER_TYPE);
6721 TREE_TYPE (t) = to_type;
6722 SET_TYPE_MODE (t, mode);
6723 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6724 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6725 TYPE_POINTER_TO (to_type) = t;
6727 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6728 SET_TYPE_STRUCTURAL_EQUALITY (t);
6729 else if (TYPE_CANONICAL (to_type) != to_type)
6731 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6732 mode, can_alias_all);
6734 /* Lay out the type. This function has many callers that are concerned
6735 with expression-construction, and this simplifies them all. */
6741 /* By default build pointers in ptr_mode. */
6744 build_pointer_type (tree to_type)
6746 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6747 : TYPE_ADDR_SPACE (to_type);
6748 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6749 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6752 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6755 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6760 if (to_type == error_mark_node)
6761 return error_mark_node;
6763 /* If the pointed-to type has the may_alias attribute set, force
6764 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6765 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6766 can_alias_all = true;
6768 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6769 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6770 In that case, return that type without regard to the rest of our
6773 ??? This is a kludge, but consistent with the way this function has
6774 always operated and there doesn't seem to be a good way to avoid this
6776 if (TYPE_REFERENCE_TO (to_type) != 0
6777 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6778 return TYPE_REFERENCE_TO (to_type);
6780 /* First, if we already have a type for pointers to TO_TYPE and it's
6781 the proper mode, use it. */
6782 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6783 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6786 t = make_node (REFERENCE_TYPE);
6788 TREE_TYPE (t) = to_type;
6789 SET_TYPE_MODE (t, mode);
6790 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6791 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6792 TYPE_REFERENCE_TO (to_type) = t;
6794 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6795 SET_TYPE_STRUCTURAL_EQUALITY (t);
6796 else if (TYPE_CANONICAL (to_type) != to_type)
6798 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6799 mode, can_alias_all);
6807 /* Build the node for the type of references-to-TO_TYPE by default
6811 build_reference_type (tree to_type)
6813 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6814 : TYPE_ADDR_SPACE (to_type);
6815 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6816 return build_reference_type_for_mode (to_type, pointer_mode, false);
6819 /* Build a type that is compatible with t but has no cv quals anywhere
6822 const char *const *const * -> char ***. */
6825 build_type_no_quals (tree t)
6827 switch (TREE_CODE (t))
6830 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6832 TYPE_REF_CAN_ALIAS_ALL (t));
6833 case REFERENCE_TYPE:
6835 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6837 TYPE_REF_CAN_ALIAS_ALL (t));
6839 return TYPE_MAIN_VARIANT (t);
6843 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6844 MAXVAL should be the maximum value in the domain
6845 (one less than the length of the array).
6847 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6848 We don't enforce this limit, that is up to caller (e.g. language front end).
6849 The limit exists because the result is a signed type and we don't handle
6850 sizes that use more than one HOST_WIDE_INT. */
6853 build_index_type (tree maxval)
6855 tree itype = make_node (INTEGER_TYPE);
6857 TREE_TYPE (itype) = sizetype;
6858 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6859 TYPE_MIN_VALUE (itype) = size_zero_node;
6860 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6861 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6862 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6863 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6864 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6865 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6867 if (host_integerp (maxval, 1))
6868 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6871 /* Since we cannot hash this type, we need to compare it using
6872 structural equality checks. */
6873 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6878 #define MAX_INT_CACHED_PREC \
6879 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6880 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
6882 /* Builds a signed or unsigned integer type of precision PRECISION.
6883 Used for C bitfields whose precision does not match that of
6884 built-in target types. */
6886 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6892 unsignedp = MAX_INT_CACHED_PREC + 1;
6894 if (precision <= MAX_INT_CACHED_PREC)
6896 itype = nonstandard_integer_type_cache[precision + unsignedp];
6901 itype = make_node (INTEGER_TYPE);
6902 TYPE_PRECISION (itype) = precision;
6905 fixup_unsigned_type (itype);
6907 fixup_signed_type (itype);
6910 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6911 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6912 if (precision <= MAX_INT_CACHED_PREC && lang_hooks.types.hash_types)
6913 nonstandard_integer_type_cache[precision + unsignedp] = ret;
6918 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6919 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6920 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6923 build_range_type (tree type, tree lowval, tree highval)
6925 tree itype = make_node (INTEGER_TYPE);
6927 TREE_TYPE (itype) = type;
6928 if (type == NULL_TREE)
6931 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6932 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6934 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6935 SET_TYPE_MODE (itype, TYPE_MODE (type));
6936 TYPE_SIZE (itype) = TYPE_SIZE (type);
6937 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6938 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6939 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6941 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6942 return type_hash_canon (tree_low_cst (highval, 0)
6943 - tree_low_cst (lowval, 0),
6949 /* Return true if the debug information for TYPE, a subtype, should be emitted
6950 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6951 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6952 debug info and doesn't reflect the source code. */
6955 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6957 tree base_type = TREE_TYPE (type), low, high;
6959 /* Subrange types have a base type which is an integral type. */
6960 if (!INTEGRAL_TYPE_P (base_type))
6963 /* Get the real bounds of the subtype. */
6964 if (lang_hooks.types.get_subrange_bounds)
6965 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6968 low = TYPE_MIN_VALUE (type);
6969 high = TYPE_MAX_VALUE (type);
6972 /* If the type and its base type have the same representation and the same
6973 name, then the type is not a subrange but a copy of the base type. */
6974 if ((TREE_CODE (base_type) == INTEGER_TYPE
6975 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6976 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6977 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6978 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6980 tree type_name = TYPE_NAME (type);
6981 tree base_type_name = TYPE_NAME (base_type);
6983 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6984 type_name = DECL_NAME (type_name);
6986 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6987 base_type_name = DECL_NAME (base_type_name);
6989 if (type_name == base_type_name)
7000 /* Just like build_index_type, but takes lowval and highval instead
7001 of just highval (maxval). */
7004 build_index_2_type (tree lowval, tree highval)
7006 return build_range_type (sizetype, lowval, highval);
7009 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7010 and number of elements specified by the range of values of INDEX_TYPE.
7011 If such a type has already been constructed, reuse it. */
7014 build_array_type (tree elt_type, tree index_type)
7017 hashval_t hashcode = 0;
7019 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7021 error ("arrays of functions are not meaningful");
7022 elt_type = integer_type_node;
7025 t = make_node (ARRAY_TYPE);
7026 TREE_TYPE (t) = elt_type;
7027 TYPE_DOMAIN (t) = index_type;
7028 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7031 /* If the element type is incomplete at this point we get marked for
7032 structural equality. Do not record these types in the canonical
7034 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7037 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7039 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7040 t = type_hash_canon (hashcode, t);
7042 if (TYPE_CANONICAL (t) == t)
7044 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7045 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7046 SET_TYPE_STRUCTURAL_EQUALITY (t);
7047 else if (TYPE_CANONICAL (elt_type) != elt_type
7048 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7050 = build_array_type (TYPE_CANONICAL (elt_type),
7051 index_type ? TYPE_CANONICAL (index_type) : NULL);
7057 /* Recursively examines the array elements of TYPE, until a non-array
7058 element type is found. */
7061 strip_array_types (tree type)
7063 while (TREE_CODE (type) == ARRAY_TYPE)
7064 type = TREE_TYPE (type);
7069 /* Computes the canonical argument types from the argument type list
7072 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7073 on entry to this function, or if any of the ARGTYPES are
7076 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7077 true on entry to this function, or if any of the ARGTYPES are
7080 Returns a canonical argument list, which may be ARGTYPES when the
7081 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7082 true) or would not differ from ARGTYPES. */
7085 maybe_canonicalize_argtypes(tree argtypes,
7086 bool *any_structural_p,
7087 bool *any_noncanonical_p)
7090 bool any_noncanonical_argtypes_p = false;
7092 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7094 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7095 /* Fail gracefully by stating that the type is structural. */
7096 *any_structural_p = true;
7097 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7098 *any_structural_p = true;
7099 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7100 || TREE_PURPOSE (arg))
7101 /* If the argument has a default argument, we consider it
7102 non-canonical even though the type itself is canonical.
7103 That way, different variants of function and method types
7104 with default arguments will all point to the variant with
7105 no defaults as their canonical type. */
7106 any_noncanonical_argtypes_p = true;
7109 if (*any_structural_p)
7112 if (any_noncanonical_argtypes_p)
7114 /* Build the canonical list of argument types. */
7115 tree canon_argtypes = NULL_TREE;
7116 bool is_void = false;
7118 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7120 if (arg == void_list_node)
7123 canon_argtypes = tree_cons (NULL_TREE,
7124 TYPE_CANONICAL (TREE_VALUE (arg)),
7128 canon_argtypes = nreverse (canon_argtypes);
7130 canon_argtypes = chainon (canon_argtypes, void_list_node);
7132 /* There is a non-canonical type. */
7133 *any_noncanonical_p = true;
7134 return canon_argtypes;
7137 /* The canonical argument types are the same as ARGTYPES. */
7141 /* Construct, lay out and return
7142 the type of functions returning type VALUE_TYPE
7143 given arguments of types ARG_TYPES.
7144 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7145 are data type nodes for the arguments of the function.
7146 If such a type has already been constructed, reuse it. */
7149 build_function_type (tree value_type, tree arg_types)
7152 hashval_t hashcode = 0;
7153 bool any_structural_p, any_noncanonical_p;
7154 tree canon_argtypes;
7156 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7158 error ("function return type cannot be function");
7159 value_type = integer_type_node;
7162 /* Make a node of the sort we want. */
7163 t = make_node (FUNCTION_TYPE);
7164 TREE_TYPE (t) = value_type;
7165 TYPE_ARG_TYPES (t) = arg_types;
7167 /* If we already have such a type, use the old one. */
7168 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7169 hashcode = type_hash_list (arg_types, hashcode);
7170 t = type_hash_canon (hashcode, t);
7172 /* Set up the canonical type. */
7173 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7174 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7175 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7177 &any_noncanonical_p);
7178 if (any_structural_p)
7179 SET_TYPE_STRUCTURAL_EQUALITY (t);
7180 else if (any_noncanonical_p)
7181 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7184 if (!COMPLETE_TYPE_P (t))
7189 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7192 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7194 tree new_type = NULL;
7195 tree args, new_args = NULL, t;
7199 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7200 args = TREE_CHAIN (args), i++)
7201 if (!bitmap_bit_p (args_to_skip, i))
7202 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7204 new_reversed = nreverse (new_args);
7208 TREE_CHAIN (new_args) = void_list_node;
7210 new_reversed = void_list_node;
7213 /* Use copy_node to preserve as much as possible from original type
7214 (debug info, attribute lists etc.)
7215 Exception is METHOD_TYPEs must have THIS argument.
7216 When we are asked to remove it, we need to build new FUNCTION_TYPE
7218 if (TREE_CODE (orig_type) != METHOD_TYPE
7219 || !bitmap_bit_p (args_to_skip, 0))
7221 new_type = copy_node (orig_type);
7222 TYPE_ARG_TYPES (new_type) = new_reversed;
7227 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7229 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7232 /* This is a new type, not a copy of an old type. Need to reassociate
7233 variants. We can handle everything except the main variant lazily. */
7234 t = TYPE_MAIN_VARIANT (orig_type);
7237 TYPE_MAIN_VARIANT (new_type) = t;
7238 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7239 TYPE_NEXT_VARIANT (t) = new_type;
7243 TYPE_MAIN_VARIANT (new_type) = new_type;
7244 TYPE_NEXT_VARIANT (new_type) = NULL;
7249 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7251 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7252 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7253 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7256 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7258 tree new_decl = copy_node (orig_decl);
7261 new_type = TREE_TYPE (orig_decl);
7262 if (prototype_p (new_type))
7263 new_type = build_function_type_skip_args (new_type, args_to_skip);
7264 TREE_TYPE (new_decl) = new_type;
7266 /* For declarations setting DECL_VINDEX (i.e. methods)
7267 we expect first argument to be THIS pointer. */
7268 if (bitmap_bit_p (args_to_skip, 0))
7269 DECL_VINDEX (new_decl) = NULL_TREE;
7273 /* Build a function type. The RETURN_TYPE is the type returned by the
7274 function. If VAARGS is set, no void_type_node is appended to the
7275 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7278 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7282 t = va_arg (argp, tree);
7283 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7284 args = tree_cons (NULL_TREE, t, args);
7289 if (args != NULL_TREE)
7290 args = nreverse (args);
7291 gcc_assert (args != NULL_TREE && last != void_list_node);
7293 else if (args == NULL_TREE)
7294 args = void_list_node;
7298 args = nreverse (args);
7299 TREE_CHAIN (last) = void_list_node;
7301 args = build_function_type (return_type, args);
7306 /* Build a function type. The RETURN_TYPE is the type returned by the
7307 function. If additional arguments are provided, they are
7308 additional argument types. The list of argument types must always
7309 be terminated by NULL_TREE. */
7312 build_function_type_list (tree return_type, ...)
7317 va_start (p, return_type);
7318 args = build_function_type_list_1 (false, return_type, p);
7323 /* Build a variable argument function type. The RETURN_TYPE is the
7324 type returned by the function. If additional arguments are provided,
7325 they are additional argument types. The list of argument types must
7326 always be terminated by NULL_TREE. */
7329 build_varargs_function_type_list (tree return_type, ...)
7334 va_start (p, return_type);
7335 args = build_function_type_list_1 (true, return_type, p);
7341 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7342 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7343 for the method. An implicit additional parameter (of type
7344 pointer-to-BASETYPE) is added to the ARGTYPES. */
7347 build_method_type_directly (tree basetype,
7354 bool any_structural_p, any_noncanonical_p;
7355 tree canon_argtypes;
7357 /* Make a node of the sort we want. */
7358 t = make_node (METHOD_TYPE);
7360 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7361 TREE_TYPE (t) = rettype;
7362 ptype = build_pointer_type (basetype);
7364 /* The actual arglist for this function includes a "hidden" argument
7365 which is "this". Put it into the list of argument types. */
7366 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7367 TYPE_ARG_TYPES (t) = argtypes;
7369 /* If we already have such a type, use the old one. */
7370 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7371 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7372 hashcode = type_hash_list (argtypes, hashcode);
7373 t = type_hash_canon (hashcode, t);
7375 /* Set up the canonical type. */
7377 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7378 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7380 = (TYPE_CANONICAL (basetype) != basetype
7381 || TYPE_CANONICAL (rettype) != rettype);
7382 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7384 &any_noncanonical_p);
7385 if (any_structural_p)
7386 SET_TYPE_STRUCTURAL_EQUALITY (t);
7387 else if (any_noncanonical_p)
7389 = build_method_type_directly (TYPE_CANONICAL (basetype),
7390 TYPE_CANONICAL (rettype),
7392 if (!COMPLETE_TYPE_P (t))
7398 /* Construct, lay out and return the type of methods belonging to class
7399 BASETYPE and whose arguments and values are described by TYPE.
7400 If that type exists already, reuse it.
7401 TYPE must be a FUNCTION_TYPE node. */
7404 build_method_type (tree basetype, tree type)
7406 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7408 return build_method_type_directly (basetype,
7410 TYPE_ARG_TYPES (type));
7413 /* Construct, lay out and return the type of offsets to a value
7414 of type TYPE, within an object of type BASETYPE.
7415 If a suitable offset type exists already, reuse it. */
7418 build_offset_type (tree basetype, tree type)
7421 hashval_t hashcode = 0;
7423 /* Make a node of the sort we want. */
7424 t = make_node (OFFSET_TYPE);
7426 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7427 TREE_TYPE (t) = type;
7429 /* If we already have such a type, use the old one. */
7430 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7431 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7432 t = type_hash_canon (hashcode, t);
7434 if (!COMPLETE_TYPE_P (t))
7437 if (TYPE_CANONICAL (t) == t)
7439 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7440 || TYPE_STRUCTURAL_EQUALITY_P (type))
7441 SET_TYPE_STRUCTURAL_EQUALITY (t);
7442 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7443 || TYPE_CANONICAL (type) != type)
7445 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7446 TYPE_CANONICAL (type));
7452 /* Create a complex type whose components are COMPONENT_TYPE. */
7455 build_complex_type (tree component_type)
7460 gcc_assert (INTEGRAL_TYPE_P (component_type)
7461 || SCALAR_FLOAT_TYPE_P (component_type)
7462 || FIXED_POINT_TYPE_P (component_type));
7464 /* Make a node of the sort we want. */
7465 t = make_node (COMPLEX_TYPE);
7467 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7469 /* If we already have such a type, use the old one. */
7470 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7471 t = type_hash_canon (hashcode, t);
7473 if (!COMPLETE_TYPE_P (t))
7476 if (TYPE_CANONICAL (t) == t)
7478 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7479 SET_TYPE_STRUCTURAL_EQUALITY (t);
7480 else if (TYPE_CANONICAL (component_type) != component_type)
7482 = build_complex_type (TYPE_CANONICAL (component_type));
7485 /* We need to create a name, since complex is a fundamental type. */
7486 if (! TYPE_NAME (t))
7489 if (component_type == char_type_node)
7490 name = "complex char";
7491 else if (component_type == signed_char_type_node)
7492 name = "complex signed char";
7493 else if (component_type == unsigned_char_type_node)
7494 name = "complex unsigned char";
7495 else if (component_type == short_integer_type_node)
7496 name = "complex short int";
7497 else if (component_type == short_unsigned_type_node)
7498 name = "complex short unsigned int";
7499 else if (component_type == integer_type_node)
7500 name = "complex int";
7501 else if (component_type == unsigned_type_node)
7502 name = "complex unsigned int";
7503 else if (component_type == long_integer_type_node)
7504 name = "complex long int";
7505 else if (component_type == long_unsigned_type_node)
7506 name = "complex long unsigned int";
7507 else if (component_type == long_long_integer_type_node)
7508 name = "complex long long int";
7509 else if (component_type == long_long_unsigned_type_node)
7510 name = "complex long long unsigned int";
7515 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7516 get_identifier (name), t);
7519 return build_qualified_type (t, TYPE_QUALS (component_type));
7522 /* If TYPE is a real or complex floating-point type and the target
7523 does not directly support arithmetic on TYPE then return the wider
7524 type to be used for arithmetic on TYPE. Otherwise, return
7528 excess_precision_type (tree type)
7530 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7532 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7533 switch (TREE_CODE (type))
7536 switch (flt_eval_method)
7539 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7540 return double_type_node;
7543 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7544 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7545 return long_double_type_node;
7552 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7554 switch (flt_eval_method)
7557 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7558 return complex_double_type_node;
7561 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7562 || (TYPE_MODE (TREE_TYPE (type))
7563 == TYPE_MODE (double_type_node)))
7564 return complex_long_double_type_node;
7577 /* Return OP, stripped of any conversions to wider types as much as is safe.
7578 Converting the value back to OP's type makes a value equivalent to OP.
7580 If FOR_TYPE is nonzero, we return a value which, if converted to
7581 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7583 OP must have integer, real or enumeral type. Pointers are not allowed!
7585 There are some cases where the obvious value we could return
7586 would regenerate to OP if converted to OP's type,
7587 but would not extend like OP to wider types.
7588 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7589 For example, if OP is (unsigned short)(signed char)-1,
7590 we avoid returning (signed char)-1 if FOR_TYPE is int,
7591 even though extending that to an unsigned short would regenerate OP,
7592 since the result of extending (signed char)-1 to (int)
7593 is different from (int) OP. */
7596 get_unwidened (tree op, tree for_type)
7598 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7599 tree type = TREE_TYPE (op);
7601 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7603 = (for_type != 0 && for_type != type
7604 && final_prec > TYPE_PRECISION (type)
7605 && TYPE_UNSIGNED (type));
7608 while (CONVERT_EXPR_P (op))
7612 /* TYPE_PRECISION on vector types has different meaning
7613 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7614 so avoid them here. */
7615 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7618 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7619 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7621 /* Truncations are many-one so cannot be removed.
7622 Unless we are later going to truncate down even farther. */
7624 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7627 /* See what's inside this conversion. If we decide to strip it,
7629 op = TREE_OPERAND (op, 0);
7631 /* If we have not stripped any zero-extensions (uns is 0),
7632 we can strip any kind of extension.
7633 If we have previously stripped a zero-extension,
7634 only zero-extensions can safely be stripped.
7635 Any extension can be stripped if the bits it would produce
7636 are all going to be discarded later by truncating to FOR_TYPE. */
7640 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7642 /* TYPE_UNSIGNED says whether this is a zero-extension.
7643 Let's avoid computing it if it does not affect WIN
7644 and if UNS will not be needed again. */
7646 || CONVERT_EXPR_P (op))
7647 && TYPE_UNSIGNED (TREE_TYPE (op)))
7655 /* If we finally reach a constant see if it fits in for_type and
7656 in that case convert it. */
7658 && TREE_CODE (win) == INTEGER_CST
7659 && TREE_TYPE (win) != for_type
7660 && int_fits_type_p (win, for_type))
7661 win = fold_convert (for_type, win);
7666 /* Return OP or a simpler expression for a narrower value
7667 which can be sign-extended or zero-extended to give back OP.
7668 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7669 or 0 if the value should be sign-extended. */
7672 get_narrower (tree op, int *unsignedp_ptr)
7677 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7679 while (TREE_CODE (op) == NOP_EXPR)
7682 = (TYPE_PRECISION (TREE_TYPE (op))
7683 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7685 /* Truncations are many-one so cannot be removed. */
7689 /* See what's inside this conversion. If we decide to strip it,
7694 op = TREE_OPERAND (op, 0);
7695 /* An extension: the outermost one can be stripped,
7696 but remember whether it is zero or sign extension. */
7698 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7699 /* Otherwise, if a sign extension has been stripped,
7700 only sign extensions can now be stripped;
7701 if a zero extension has been stripped, only zero-extensions. */
7702 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7706 else /* bitschange == 0 */
7708 /* A change in nominal type can always be stripped, but we must
7709 preserve the unsignedness. */
7711 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7713 op = TREE_OPERAND (op, 0);
7714 /* Keep trying to narrow, but don't assign op to win if it
7715 would turn an integral type into something else. */
7716 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7723 if (TREE_CODE (op) == COMPONENT_REF
7724 /* Since type_for_size always gives an integer type. */
7725 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7726 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7727 /* Ensure field is laid out already. */
7728 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7729 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7731 unsigned HOST_WIDE_INT innerprec
7732 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7733 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7734 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7735 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7737 /* We can get this structure field in a narrower type that fits it,
7738 but the resulting extension to its nominal type (a fullword type)
7739 must satisfy the same conditions as for other extensions.
7741 Do this only for fields that are aligned (not bit-fields),
7742 because when bit-field insns will be used there is no
7743 advantage in doing this. */
7745 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7746 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7747 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7751 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7752 win = fold_convert (type, op);
7756 *unsignedp_ptr = uns;
7760 /* Nonzero if integer constant C has a value that is permissible
7761 for type TYPE (an INTEGER_TYPE). */
7764 int_fits_type_p (const_tree c, const_tree type)
7766 tree type_low_bound, type_high_bound;
7767 bool ok_for_low_bound, ok_for_high_bound, unsc;
7770 dc = tree_to_double_int (c);
7771 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7773 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7774 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7776 /* So c is an unsigned integer whose type is sizetype and type is not.
7777 sizetype'd integers are sign extended even though they are
7778 unsigned. If the integer value fits in the lower end word of c,
7779 and if the higher end word has all its bits set to 1, that
7780 means the higher end bits are set to 1 only for sign extension.
7781 So let's convert c into an equivalent zero extended unsigned
7783 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7786 type_low_bound = TYPE_MIN_VALUE (type);
7787 type_high_bound = TYPE_MAX_VALUE (type);
7789 /* If at least one bound of the type is a constant integer, we can check
7790 ourselves and maybe make a decision. If no such decision is possible, but
7791 this type is a subtype, try checking against that. Otherwise, use
7792 fit_double_type, which checks against the precision.
7794 Compute the status for each possibly constant bound, and return if we see
7795 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7796 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7797 for "constant known to fit". */
7799 /* Check if c >= type_low_bound. */
7800 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7802 dd = tree_to_double_int (type_low_bound);
7803 if (TREE_CODE (type) == INTEGER_TYPE
7804 && TYPE_IS_SIZETYPE (type)
7805 && TYPE_UNSIGNED (type))
7806 dd = double_int_zext (dd, TYPE_PRECISION (type));
7807 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7809 int c_neg = (!unsc && double_int_negative_p (dc));
7810 int t_neg = (unsc && double_int_negative_p (dd));
7812 if (c_neg && !t_neg)
7814 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7817 else if (double_int_cmp (dc, dd, unsc) < 0)
7819 ok_for_low_bound = true;
7822 ok_for_low_bound = false;
7824 /* Check if c <= type_high_bound. */
7825 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7827 dd = tree_to_double_int (type_high_bound);
7828 if (TREE_CODE (type) == INTEGER_TYPE
7829 && TYPE_IS_SIZETYPE (type)
7830 && TYPE_UNSIGNED (type))
7831 dd = double_int_zext (dd, TYPE_PRECISION (type));
7832 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7834 int c_neg = (!unsc && double_int_negative_p (dc));
7835 int t_neg = (unsc && double_int_negative_p (dd));
7837 if (t_neg && !c_neg)
7839 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7842 else if (double_int_cmp (dc, dd, unsc) > 0)
7844 ok_for_high_bound = true;
7847 ok_for_high_bound = false;
7849 /* If the constant fits both bounds, the result is known. */
7850 if (ok_for_low_bound && ok_for_high_bound)
7853 /* Perform some generic filtering which may allow making a decision
7854 even if the bounds are not constant. First, negative integers
7855 never fit in unsigned types, */
7856 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7859 /* Second, narrower types always fit in wider ones. */
7860 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7863 /* Third, unsigned integers with top bit set never fit signed types. */
7864 if (! TYPE_UNSIGNED (type) && unsc)
7866 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7867 if (prec < HOST_BITS_PER_WIDE_INT)
7869 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7872 else if (((((unsigned HOST_WIDE_INT) 1)
7873 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7877 /* If we haven't been able to decide at this point, there nothing more we
7878 can check ourselves here. Look at the base type if we have one and it
7879 has the same precision. */
7880 if (TREE_CODE (type) == INTEGER_TYPE
7881 && TREE_TYPE (type) != 0
7882 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7884 type = TREE_TYPE (type);
7888 /* Or to fit_double_type, if nothing else. */
7889 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7892 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7893 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7894 represented (assuming two's-complement arithmetic) within the bit
7895 precision of the type are returned instead. */
7898 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7900 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7901 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7902 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7903 TYPE_UNSIGNED (type));
7906 if (TYPE_UNSIGNED (type))
7907 mpz_set_ui (min, 0);
7911 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7912 mn = double_int_sext (double_int_add (mn, double_int_one),
7913 TYPE_PRECISION (type));
7914 mpz_set_double_int (min, mn, false);
7918 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7919 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7920 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7921 TYPE_UNSIGNED (type));
7924 if (TYPE_UNSIGNED (type))
7925 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7928 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7933 /* Return true if VAR is an automatic variable defined in function FN. */
7936 auto_var_in_fn_p (const_tree var, const_tree fn)
7938 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7939 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
7940 || TREE_CODE (var) == PARM_DECL)
7941 && ! TREE_STATIC (var))
7942 || TREE_CODE (var) == LABEL_DECL
7943 || TREE_CODE (var) == RESULT_DECL));
7946 /* Subprogram of following function. Called by walk_tree.
7948 Return *TP if it is an automatic variable or parameter of the
7949 function passed in as DATA. */
7952 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7954 tree fn = (tree) data;
7959 else if (DECL_P (*tp)
7960 && auto_var_in_fn_p (*tp, fn))
7966 /* Returns true if T is, contains, or refers to a type with variable
7967 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7968 arguments, but not the return type. If FN is nonzero, only return
7969 true if a modifier of the type or position of FN is a variable or
7970 parameter inside FN.
7972 This concept is more general than that of C99 'variably modified types':
7973 in C99, a struct type is never variably modified because a VLA may not
7974 appear as a structure member. However, in GNU C code like:
7976 struct S { int i[f()]; };
7978 is valid, and other languages may define similar constructs. */
7981 variably_modified_type_p (tree type, tree fn)
7985 /* Test if T is either variable (if FN is zero) or an expression containing
7986 a variable in FN. */
7987 #define RETURN_TRUE_IF_VAR(T) \
7988 do { tree _t = (T); \
7989 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7990 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7991 return true; } while (0)
7993 if (type == error_mark_node)
7996 /* If TYPE itself has variable size, it is variably modified. */
7997 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7998 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8000 switch (TREE_CODE (type))
8003 case REFERENCE_TYPE:
8005 if (variably_modified_type_p (TREE_TYPE (type), fn))
8011 /* If TYPE is a function type, it is variably modified if the
8012 return type is variably modified. */
8013 if (variably_modified_type_p (TREE_TYPE (type), fn))
8019 case FIXED_POINT_TYPE:
8022 /* Scalar types are variably modified if their end points
8024 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8025 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8030 case QUAL_UNION_TYPE:
8031 /* We can't see if any of the fields are variably-modified by the
8032 definition we normally use, since that would produce infinite
8033 recursion via pointers. */
8034 /* This is variably modified if some field's type is. */
8035 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8036 if (TREE_CODE (t) == FIELD_DECL)
8038 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8039 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8040 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8042 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8043 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8048 /* Do not call ourselves to avoid infinite recursion. This is
8049 variably modified if the element type is. */
8050 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8051 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8058 /* The current language may have other cases to check, but in general,
8059 all other types are not variably modified. */
8060 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8062 #undef RETURN_TRUE_IF_VAR
8065 /* Given a DECL or TYPE, return the scope in which it was declared, or
8066 NULL_TREE if there is no containing scope. */
8069 get_containing_scope (const_tree t)
8071 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8074 /* Return the innermost context enclosing DECL that is
8075 a FUNCTION_DECL, or zero if none. */
8078 decl_function_context (const_tree decl)
8082 if (TREE_CODE (decl) == ERROR_MARK)
8085 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8086 where we look up the function at runtime. Such functions always take
8087 a first argument of type 'pointer to real context'.
8089 C++ should really be fixed to use DECL_CONTEXT for the real context,
8090 and use something else for the "virtual context". */
8091 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8094 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8096 context = DECL_CONTEXT (decl);
8098 while (context && TREE_CODE (context) != FUNCTION_DECL)
8100 if (TREE_CODE (context) == BLOCK)
8101 context = BLOCK_SUPERCONTEXT (context);
8103 context = get_containing_scope (context);
8109 /* Return the innermost context enclosing DECL that is
8110 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8111 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8114 decl_type_context (const_tree decl)
8116 tree context = DECL_CONTEXT (decl);
8119 switch (TREE_CODE (context))
8121 case NAMESPACE_DECL:
8122 case TRANSLATION_UNIT_DECL:
8127 case QUAL_UNION_TYPE:
8132 context = DECL_CONTEXT (context);
8136 context = BLOCK_SUPERCONTEXT (context);
8146 /* CALL is a CALL_EXPR. Return the declaration for the function
8147 called, or NULL_TREE if the called function cannot be
8151 get_callee_fndecl (const_tree call)
8155 if (call == error_mark_node)
8156 return error_mark_node;
8158 /* It's invalid to call this function with anything but a
8160 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8162 /* The first operand to the CALL is the address of the function
8164 addr = CALL_EXPR_FN (call);
8168 /* If this is a readonly function pointer, extract its initial value. */
8169 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8170 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8171 && DECL_INITIAL (addr))
8172 addr = DECL_INITIAL (addr);
8174 /* If the address is just `&f' for some function `f', then we know
8175 that `f' is being called. */
8176 if (TREE_CODE (addr) == ADDR_EXPR
8177 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8178 return TREE_OPERAND (addr, 0);
8180 /* We couldn't figure out what was being called. */
8184 /* Print debugging information about tree nodes generated during the compile,
8185 and any language-specific information. */
8188 dump_tree_statistics (void)
8190 #ifdef GATHER_STATISTICS
8192 int total_nodes, total_bytes;
8195 fprintf (stderr, "\n??? tree nodes created\n\n");
8196 #ifdef GATHER_STATISTICS
8197 fprintf (stderr, "Kind Nodes Bytes\n");
8198 fprintf (stderr, "---------------------------------------\n");
8199 total_nodes = total_bytes = 0;
8200 for (i = 0; i < (int) all_kinds; i++)
8202 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8203 tree_node_counts[i], tree_node_sizes[i]);
8204 total_nodes += tree_node_counts[i];
8205 total_bytes += tree_node_sizes[i];
8207 fprintf (stderr, "---------------------------------------\n");
8208 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8209 fprintf (stderr, "---------------------------------------\n");
8210 ssanames_print_statistics ();
8211 phinodes_print_statistics ();
8213 fprintf (stderr, "(No per-node statistics)\n");
8215 print_type_hash_statistics ();
8216 print_debug_expr_statistics ();
8217 print_value_expr_statistics ();
8218 lang_hooks.print_statistics ();
8221 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8223 /* Generate a crc32 of a string. */
8226 crc32_string (unsigned chksum, const char *string)
8230 unsigned value = *string << 24;
8233 for (ix = 8; ix--; value <<= 1)
8237 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8246 /* P is a string that will be used in a symbol. Mask out any characters
8247 that are not valid in that context. */
8250 clean_symbol_name (char *p)
8254 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8257 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8264 /* Generate a name for a special-purpose function function.
8265 The generated name may need to be unique across the whole link.
8266 TYPE is some string to identify the purpose of this function to the
8267 linker or collect2; it must start with an uppercase letter,
8269 I - for constructors
8271 N - for C++ anonymous namespaces
8272 F - for DWARF unwind frame information. */
8275 get_file_function_name (const char *type)
8281 /* If we already have a name we know to be unique, just use that. */
8282 if (first_global_object_name)
8283 p = q = ASTRDUP (first_global_object_name);
8284 /* If the target is handling the constructors/destructors, they
8285 will be local to this file and the name is only necessary for
8286 debugging purposes. */
8287 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8289 const char *file = main_input_filename;
8291 file = input_filename;
8292 /* Just use the file's basename, because the full pathname
8293 might be quite long. */
8294 p = strrchr (file, '/');
8299 p = q = ASTRDUP (p);
8303 /* Otherwise, the name must be unique across the entire link.
8304 We don't have anything that we know to be unique to this translation
8305 unit, so use what we do have and throw in some randomness. */
8307 const char *name = weak_global_object_name;
8308 const char *file = main_input_filename;
8313 file = input_filename;
8315 len = strlen (file);
8316 q = (char *) alloca (9 * 2 + len + 1);
8317 memcpy (q, file, len + 1);
8319 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8320 crc32_string (0, get_random_seed (false)));
8325 clean_symbol_name (q);
8326 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8329 /* Set up the name of the file-level functions we may need.
8330 Use a global object (which is already required to be unique over
8331 the program) rather than the file name (which imposes extra
8333 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8335 return get_identifier (buf);
8338 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8340 /* Complain that the tree code of NODE does not match the expected 0
8341 terminated list of trailing codes. The trailing code list can be
8342 empty, for a more vague error message. FILE, LINE, and FUNCTION
8343 are of the caller. */
8346 tree_check_failed (const_tree node, const char *file,
8347 int line, const char *function, ...)
8351 unsigned length = 0;
8354 va_start (args, function);
8355 while ((code = va_arg (args, int)))
8356 length += 4 + strlen (tree_code_name[code]);
8361 va_start (args, function);
8362 length += strlen ("expected ");
8363 buffer = tmp = (char *) alloca (length);
8365 while ((code = va_arg (args, int)))
8367 const char *prefix = length ? " or " : "expected ";
8369 strcpy (tmp + length, prefix);
8370 length += strlen (prefix);
8371 strcpy (tmp + length, tree_code_name[code]);
8372 length += strlen (tree_code_name[code]);
8377 buffer = "unexpected node";
8379 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8380 buffer, tree_code_name[TREE_CODE (node)],
8381 function, trim_filename (file), line);
8384 /* Complain that the tree code of NODE does match the expected 0
8385 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8389 tree_not_check_failed (const_tree node, const char *file,
8390 int line, const char *function, ...)
8394 unsigned length = 0;
8397 va_start (args, function);
8398 while ((code = va_arg (args, int)))
8399 length += 4 + strlen (tree_code_name[code]);
8401 va_start (args, function);
8402 buffer = (char *) alloca (length);
8404 while ((code = va_arg (args, int)))
8408 strcpy (buffer + length, " or ");
8411 strcpy (buffer + length, tree_code_name[code]);
8412 length += strlen (tree_code_name[code]);
8416 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8417 buffer, tree_code_name[TREE_CODE (node)],
8418 function, trim_filename (file), line);
8421 /* Similar to tree_check_failed, except that we check for a class of tree
8422 code, given in CL. */
8425 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8426 const char *file, int line, const char *function)
8429 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8430 TREE_CODE_CLASS_STRING (cl),
8431 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8432 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8435 /* Similar to tree_check_failed, except that instead of specifying a
8436 dozen codes, use the knowledge that they're all sequential. */
8439 tree_range_check_failed (const_tree node, const char *file, int line,
8440 const char *function, enum tree_code c1,
8444 unsigned length = 0;
8447 for (c = c1; c <= c2; ++c)
8448 length += 4 + strlen (tree_code_name[c]);
8450 length += strlen ("expected ");
8451 buffer = (char *) alloca (length);
8454 for (c = c1; c <= c2; ++c)
8456 const char *prefix = length ? " or " : "expected ";
8458 strcpy (buffer + length, prefix);
8459 length += strlen (prefix);
8460 strcpy (buffer + length, tree_code_name[c]);
8461 length += strlen (tree_code_name[c]);
8464 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8465 buffer, tree_code_name[TREE_CODE (node)],
8466 function, trim_filename (file), line);
8470 /* Similar to tree_check_failed, except that we check that a tree does
8471 not have the specified code, given in CL. */
8474 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8475 const char *file, int line, const char *function)
8478 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8479 TREE_CODE_CLASS_STRING (cl),
8480 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8481 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8485 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8488 omp_clause_check_failed (const_tree node, const char *file, int line,
8489 const char *function, enum omp_clause_code code)
8491 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8492 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8493 function, trim_filename (file), line);
8497 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8500 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8501 const char *function, enum omp_clause_code c1,
8502 enum omp_clause_code c2)
8505 unsigned length = 0;
8508 for (c = c1; c <= c2; ++c)
8509 length += 4 + strlen (omp_clause_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, omp_clause_code_name[c]);
8522 length += strlen (omp_clause_code_name[c]);
8525 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8526 buffer, omp_clause_code_name[TREE_CODE (node)],
8527 function, trim_filename (file), line);
8531 #undef DEFTREESTRUCT
8532 #define DEFTREESTRUCT(VAL, NAME) NAME,
8534 static const char *ts_enum_names[] = {
8535 #include "treestruct.def"
8537 #undef DEFTREESTRUCT
8539 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8541 /* Similar to tree_class_check_failed, except that we check for
8542 whether CODE contains the tree structure identified by EN. */
8545 tree_contains_struct_check_failed (const_tree node,
8546 const enum tree_node_structure_enum en,
8547 const char *file, int line,
8548 const char *function)
8551 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8553 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8557 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8558 (dynamically sized) vector. */
8561 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8562 const char *function)
8565 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8566 idx + 1, len, function, trim_filename (file), line);
8569 /* Similar to above, except that the check is for the bounds of the operand
8570 vector of an expression node EXP. */
8573 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8574 int line, const char *function)
8576 int code = TREE_CODE (exp);
8578 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8579 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8580 function, trim_filename (file), line);
8583 /* Similar to above, except that the check is for the number of
8584 operands of an OMP_CLAUSE node. */
8587 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8588 int line, const char *function)
8591 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8592 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8593 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8594 trim_filename (file), line);
8596 #endif /* ENABLE_TREE_CHECKING */
8598 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8599 and mapped to the machine mode MODE. Initialize its fields and build
8600 the information necessary for debugging output. */
8603 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8606 hashval_t hashcode = 0;
8608 t = make_node (VECTOR_TYPE);
8609 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8610 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8611 SET_TYPE_MODE (t, mode);
8613 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8614 SET_TYPE_STRUCTURAL_EQUALITY (t);
8615 else if (TYPE_CANONICAL (innertype) != innertype
8616 || mode != VOIDmode)
8618 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8623 tree index = build_int_cst (NULL_TREE, nunits - 1);
8624 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8625 build_index_type (index));
8626 tree rt = make_node (RECORD_TYPE);
8628 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8629 get_identifier ("f"), array);
8630 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8632 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8633 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8634 the representation type, and we want to find that die when looking up
8635 the vector type. This is most easily achieved by making the TYPE_UID
8637 TYPE_UID (rt) = TYPE_UID (t);
8640 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8641 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8642 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8643 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8644 t = type_hash_canon (hashcode, t);
8646 /* We have built a main variant, based on the main variant of the
8647 inner type. Use it to build the variant we return. */
8648 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8649 && TREE_TYPE (t) != innertype)
8650 return build_type_attribute_qual_variant (t,
8651 TYPE_ATTRIBUTES (innertype),
8652 TYPE_QUALS (innertype));
8658 make_or_reuse_type (unsigned size, int unsignedp)
8660 if (size == INT_TYPE_SIZE)
8661 return unsignedp ? unsigned_type_node : integer_type_node;
8662 if (size == CHAR_TYPE_SIZE)
8663 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8664 if (size == SHORT_TYPE_SIZE)
8665 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8666 if (size == LONG_TYPE_SIZE)
8667 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8668 if (size == LONG_LONG_TYPE_SIZE)
8669 return (unsignedp ? long_long_unsigned_type_node
8670 : long_long_integer_type_node);
8673 return make_unsigned_type (size);
8675 return make_signed_type (size);
8678 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8681 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8685 if (size == SHORT_FRACT_TYPE_SIZE)
8686 return unsignedp ? sat_unsigned_short_fract_type_node
8687 : sat_short_fract_type_node;
8688 if (size == FRACT_TYPE_SIZE)
8689 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8690 if (size == LONG_FRACT_TYPE_SIZE)
8691 return unsignedp ? sat_unsigned_long_fract_type_node
8692 : sat_long_fract_type_node;
8693 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8694 return unsignedp ? sat_unsigned_long_long_fract_type_node
8695 : sat_long_long_fract_type_node;
8699 if (size == SHORT_FRACT_TYPE_SIZE)
8700 return unsignedp ? unsigned_short_fract_type_node
8701 : short_fract_type_node;
8702 if (size == FRACT_TYPE_SIZE)
8703 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8704 if (size == LONG_FRACT_TYPE_SIZE)
8705 return unsignedp ? unsigned_long_fract_type_node
8706 : long_fract_type_node;
8707 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8708 return unsignedp ? unsigned_long_long_fract_type_node
8709 : long_long_fract_type_node;
8712 return make_fract_type (size, unsignedp, satp);
8715 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8718 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8722 if (size == SHORT_ACCUM_TYPE_SIZE)
8723 return unsignedp ? sat_unsigned_short_accum_type_node
8724 : sat_short_accum_type_node;
8725 if (size == ACCUM_TYPE_SIZE)
8726 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8727 if (size == LONG_ACCUM_TYPE_SIZE)
8728 return unsignedp ? sat_unsigned_long_accum_type_node
8729 : sat_long_accum_type_node;
8730 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8731 return unsignedp ? sat_unsigned_long_long_accum_type_node
8732 : sat_long_long_accum_type_node;
8736 if (size == SHORT_ACCUM_TYPE_SIZE)
8737 return unsignedp ? unsigned_short_accum_type_node
8738 : short_accum_type_node;
8739 if (size == ACCUM_TYPE_SIZE)
8740 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8741 if (size == LONG_ACCUM_TYPE_SIZE)
8742 return unsignedp ? unsigned_long_accum_type_node
8743 : long_accum_type_node;
8744 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8745 return unsignedp ? unsigned_long_long_accum_type_node
8746 : long_long_accum_type_node;
8749 return make_accum_type (size, unsignedp, satp);
8752 /* Create nodes for all integer types (and error_mark_node) using the sizes
8753 of C datatypes. The caller should call set_sizetype soon after calling
8754 this function to select one of the types as sizetype. */
8757 build_common_tree_nodes (bool signed_char)
8759 error_mark_node = make_node (ERROR_MARK);
8760 TREE_TYPE (error_mark_node) = error_mark_node;
8762 initialize_sizetypes ();
8764 /* Define both `signed char' and `unsigned char'. */
8765 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8766 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8767 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8768 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8770 /* Define `char', which is like either `signed char' or `unsigned char'
8771 but not the same as either. */
8774 ? make_signed_type (CHAR_TYPE_SIZE)
8775 : make_unsigned_type (CHAR_TYPE_SIZE));
8776 TYPE_STRING_FLAG (char_type_node) = 1;
8778 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8779 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8780 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8781 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8782 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8783 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8784 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8785 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8787 /* Define a boolean type. This type only represents boolean values but
8788 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8789 Front ends which want to override this size (i.e. Java) can redefine
8790 boolean_type_node before calling build_common_tree_nodes_2. */
8791 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8792 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8793 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8794 TYPE_PRECISION (boolean_type_node) = 1;
8796 /* Fill in the rest of the sized types. Reuse existing type nodes
8798 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8799 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8800 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8801 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8802 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8804 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8805 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8806 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8807 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8808 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8810 access_public_node = get_identifier ("public");
8811 access_protected_node = get_identifier ("protected");
8812 access_private_node = get_identifier ("private");
8815 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8816 It will create several other common tree nodes. */
8819 build_common_tree_nodes_2 (int short_double)
8821 /* Define these next since types below may used them. */
8822 integer_zero_node = build_int_cst (NULL_TREE, 0);
8823 integer_one_node = build_int_cst (NULL_TREE, 1);
8824 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8826 size_zero_node = size_int (0);
8827 size_one_node = size_int (1);
8828 bitsize_zero_node = bitsize_int (0);
8829 bitsize_one_node = bitsize_int (1);
8830 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8832 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8833 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8835 void_type_node = make_node (VOID_TYPE);
8836 layout_type (void_type_node);
8838 /* We are not going to have real types in C with less than byte alignment,
8839 so we might as well not have any types that claim to have it. */
8840 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8841 TYPE_USER_ALIGN (void_type_node) = 0;
8843 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8844 layout_type (TREE_TYPE (null_pointer_node));
8846 ptr_type_node = build_pointer_type (void_type_node);
8848 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8849 fileptr_type_node = ptr_type_node;
8851 float_type_node = make_node (REAL_TYPE);
8852 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8853 layout_type (float_type_node);
8855 double_type_node = make_node (REAL_TYPE);
8857 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8859 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8860 layout_type (double_type_node);
8862 long_double_type_node = make_node (REAL_TYPE);
8863 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8864 layout_type (long_double_type_node);
8866 float_ptr_type_node = build_pointer_type (float_type_node);
8867 double_ptr_type_node = build_pointer_type (double_type_node);
8868 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8869 integer_ptr_type_node = build_pointer_type (integer_type_node);
8871 /* Fixed size integer types. */
8872 uint32_type_node = build_nonstandard_integer_type (32, true);
8873 uint64_type_node = build_nonstandard_integer_type (64, true);
8875 /* Decimal float types. */
8876 dfloat32_type_node = make_node (REAL_TYPE);
8877 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8878 layout_type (dfloat32_type_node);
8879 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8880 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8882 dfloat64_type_node = make_node (REAL_TYPE);
8883 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8884 layout_type (dfloat64_type_node);
8885 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8886 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8888 dfloat128_type_node = make_node (REAL_TYPE);
8889 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8890 layout_type (dfloat128_type_node);
8891 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8892 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8894 complex_integer_type_node = build_complex_type (integer_type_node);
8895 complex_float_type_node = build_complex_type (float_type_node);
8896 complex_double_type_node = build_complex_type (double_type_node);
8897 complex_long_double_type_node = build_complex_type (long_double_type_node);
8899 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8900 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8901 sat_ ## KIND ## _type_node = \
8902 make_sat_signed_ ## KIND ## _type (SIZE); \
8903 sat_unsigned_ ## KIND ## _type_node = \
8904 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8905 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8906 unsigned_ ## KIND ## _type_node = \
8907 make_unsigned_ ## KIND ## _type (SIZE);
8909 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8910 sat_ ## WIDTH ## KIND ## _type_node = \
8911 make_sat_signed_ ## KIND ## _type (SIZE); \
8912 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8913 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8914 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8915 unsigned_ ## WIDTH ## KIND ## _type_node = \
8916 make_unsigned_ ## KIND ## _type (SIZE);
8918 /* Make fixed-point type nodes based on four different widths. */
8919 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8920 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8921 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8922 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8923 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8925 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8926 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8927 NAME ## _type_node = \
8928 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8929 u ## NAME ## _type_node = \
8930 make_or_reuse_unsigned_ ## KIND ## _type \
8931 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8932 sat_ ## NAME ## _type_node = \
8933 make_or_reuse_sat_signed_ ## KIND ## _type \
8934 (GET_MODE_BITSIZE (MODE ## mode)); \
8935 sat_u ## NAME ## _type_node = \
8936 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8937 (GET_MODE_BITSIZE (U ## MODE ## mode));
8939 /* Fixed-point type and mode nodes. */
8940 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8941 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8942 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8943 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8944 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8945 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8946 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8947 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8948 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8949 MAKE_FIXED_MODE_NODE (accum, da, DA)
8950 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8953 tree t = targetm.build_builtin_va_list ();
8955 /* Many back-ends define record types without setting TYPE_NAME.
8956 If we copied the record type here, we'd keep the original
8957 record type without a name. This breaks name mangling. So,
8958 don't copy record types and let c_common_nodes_and_builtins()
8959 declare the type to be __builtin_va_list. */
8960 if (TREE_CODE (t) != RECORD_TYPE)
8961 t = build_variant_type_copy (t);
8963 va_list_type_node = t;
8967 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8970 local_define_builtin (const char *name, tree type, enum built_in_function code,
8971 const char *library_name, int ecf_flags)
8975 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8976 library_name, NULL_TREE);
8977 if (ecf_flags & ECF_CONST)
8978 TREE_READONLY (decl) = 1;
8979 if (ecf_flags & ECF_PURE)
8980 DECL_PURE_P (decl) = 1;
8981 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8982 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8983 if (ecf_flags & ECF_NORETURN)
8984 TREE_THIS_VOLATILE (decl) = 1;
8985 if (ecf_flags & ECF_NOTHROW)
8986 TREE_NOTHROW (decl) = 1;
8987 if (ecf_flags & ECF_MALLOC)
8988 DECL_IS_MALLOC (decl) = 1;
8990 built_in_decls[code] = decl;
8991 implicit_built_in_decls[code] = decl;
8994 /* Call this function after instantiating all builtins that the language
8995 front end cares about. This will build the rest of the builtins that
8996 are relied upon by the tree optimizers and the middle-end. */
8999 build_common_builtin_nodes (void)
9001 tree tmp, tmp2, ftype;
9003 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9004 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9006 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9007 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9008 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9009 ftype = build_function_type (ptr_type_node, tmp);
9011 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9012 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9013 "memcpy", ECF_NOTHROW);
9014 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9015 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9016 "memmove", ECF_NOTHROW);
9019 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9021 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9022 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9023 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9024 ftype = build_function_type (integer_type_node, tmp);
9025 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9026 "memcmp", ECF_PURE | ECF_NOTHROW);
9029 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9031 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9032 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9033 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9034 ftype = build_function_type (ptr_type_node, tmp);
9035 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9036 "memset", ECF_NOTHROW);
9039 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9041 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9042 ftype = build_function_type (ptr_type_node, tmp);
9043 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9045 ECF_MALLOC | (flag_stack_check ? 0 : ECF_NOTHROW));
9048 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9049 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9050 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9051 ftype = build_function_type (void_type_node, tmp);
9052 local_define_builtin ("__builtin_init_trampoline", ftype,
9053 BUILT_IN_INIT_TRAMPOLINE,
9054 "__builtin_init_trampoline", ECF_NOTHROW);
9056 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9057 ftype = build_function_type (ptr_type_node, tmp);
9058 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9059 BUILT_IN_ADJUST_TRAMPOLINE,
9060 "__builtin_adjust_trampoline",
9061 ECF_CONST | ECF_NOTHROW);
9063 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9064 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9065 ftype = build_function_type (void_type_node, tmp);
9066 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9067 BUILT_IN_NONLOCAL_GOTO,
9068 "__builtin_nonlocal_goto",
9069 ECF_NORETURN | ECF_NOTHROW);
9071 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9072 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9073 ftype = build_function_type (void_type_node, tmp);
9074 local_define_builtin ("__builtin_setjmp_setup", ftype,
9075 BUILT_IN_SETJMP_SETUP,
9076 "__builtin_setjmp_setup", ECF_NOTHROW);
9078 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9079 ftype = build_function_type (ptr_type_node, tmp);
9080 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9081 BUILT_IN_SETJMP_DISPATCHER,
9082 "__builtin_setjmp_dispatcher",
9083 ECF_PURE | ECF_NOTHROW);
9085 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9086 ftype = build_function_type (void_type_node, tmp);
9087 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9088 BUILT_IN_SETJMP_RECEIVER,
9089 "__builtin_setjmp_receiver", ECF_NOTHROW);
9091 ftype = build_function_type (ptr_type_node, void_list_node);
9092 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9093 "__builtin_stack_save", ECF_NOTHROW);
9095 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9096 ftype = build_function_type (void_type_node, tmp);
9097 local_define_builtin ("__builtin_stack_restore", ftype,
9098 BUILT_IN_STACK_RESTORE,
9099 "__builtin_stack_restore", ECF_NOTHROW);
9101 ftype = build_function_type (void_type_node, void_list_node);
9102 local_define_builtin ("__builtin_profile_func_enter", ftype,
9103 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9104 local_define_builtin ("__builtin_profile_func_exit", ftype,
9105 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9107 /* If there's a possibility that we might use the ARM EABI, build the
9108 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9109 if (targetm.arm_eabi_unwinder)
9111 ftype = build_function_type (void_type_node, void_list_node);
9112 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9113 BUILT_IN_CXA_END_CLEANUP,
9114 "__cxa_end_cleanup", ECF_NORETURN);
9117 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9118 ftype = build_function_type (void_type_node, tmp);
9119 local_define_builtin ("__builtin_unwind_resume", ftype,
9120 BUILT_IN_UNWIND_RESUME,
9121 (USING_SJLJ_EXCEPTIONS
9122 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9125 /* The exception object and filter values from the runtime. The argument
9126 must be zero before exception lowering, i.e. from the front end. After
9127 exception lowering, it will be the region number for the exception
9128 landing pad. These functions are PURE instead of CONST to prevent
9129 them from being hoisted past the exception edge that will initialize
9130 its value in the landing pad. */
9131 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9132 ftype = build_function_type (ptr_type_node, tmp);
9133 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9134 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9136 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9137 ftype = build_function_type (tmp2, tmp);
9138 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9139 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9141 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9142 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9143 ftype = build_function_type (void_type_node, tmp);
9144 local_define_builtin ("__builtin_eh_copy_values", ftype,
9145 BUILT_IN_EH_COPY_VALUES,
9146 "__builtin_eh_copy_values", ECF_NOTHROW);
9148 /* Complex multiplication and division. These are handled as builtins
9149 rather than optabs because emit_library_call_value doesn't support
9150 complex. Further, we can do slightly better with folding these
9151 beasties if the real and complex parts of the arguments are separate. */
9155 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9157 char mode_name_buf[4], *q;
9159 enum built_in_function mcode, dcode;
9160 tree type, inner_type;
9162 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9165 inner_type = TREE_TYPE (type);
9167 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9168 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9169 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9170 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9171 ftype = build_function_type (type, tmp);
9173 mcode = ((enum built_in_function)
9174 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9175 dcode = ((enum built_in_function)
9176 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9178 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9182 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9183 local_define_builtin (built_in_names[mcode], ftype, mcode,
9184 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9186 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9187 local_define_builtin (built_in_names[dcode], ftype, dcode,
9188 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9193 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9196 If we requested a pointer to a vector, build up the pointers that
9197 we stripped off while looking for the inner type. Similarly for
9198 return values from functions.
9200 The argument TYPE is the top of the chain, and BOTTOM is the
9201 new type which we will point to. */
9204 reconstruct_complex_type (tree type, tree bottom)
9208 if (TREE_CODE (type) == POINTER_TYPE)
9210 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9211 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9212 TYPE_REF_CAN_ALIAS_ALL (type));
9214 else if (TREE_CODE (type) == REFERENCE_TYPE)
9216 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9217 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9218 TYPE_REF_CAN_ALIAS_ALL (type));
9220 else if (TREE_CODE (type) == ARRAY_TYPE)
9222 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9223 outer = build_array_type (inner, TYPE_DOMAIN (type));
9225 else if (TREE_CODE (type) == FUNCTION_TYPE)
9227 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9228 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9230 else if (TREE_CODE (type) == METHOD_TYPE)
9232 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9233 /* The build_method_type_directly() routine prepends 'this' to argument list,
9234 so we must compensate by getting rid of it. */
9236 = build_method_type_directly
9237 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9239 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9241 else if (TREE_CODE (type) == OFFSET_TYPE)
9243 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9244 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9249 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9253 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9256 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9260 switch (GET_MODE_CLASS (mode))
9262 case MODE_VECTOR_INT:
9263 case MODE_VECTOR_FLOAT:
9264 case MODE_VECTOR_FRACT:
9265 case MODE_VECTOR_UFRACT:
9266 case MODE_VECTOR_ACCUM:
9267 case MODE_VECTOR_UACCUM:
9268 nunits = GET_MODE_NUNITS (mode);
9272 /* Check that there are no leftover bits. */
9273 gcc_assert (GET_MODE_BITSIZE (mode)
9274 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9276 nunits = GET_MODE_BITSIZE (mode)
9277 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9284 return make_vector_type (innertype, nunits, mode);
9287 /* Similarly, but takes the inner type and number of units, which must be
9291 build_vector_type (tree innertype, int nunits)
9293 return make_vector_type (innertype, nunits, VOIDmode);
9296 /* Similarly, but takes the inner type and number of units, which must be
9300 build_opaque_vector_type (tree innertype, int nunits)
9303 innertype = build_distinct_type_copy (innertype);
9304 t = make_vector_type (innertype, nunits, VOIDmode);
9305 TYPE_VECTOR_OPAQUE (t) = true;
9310 /* Given an initializer INIT, return TRUE if INIT is zero or some
9311 aggregate of zeros. Otherwise return FALSE. */
9313 initializer_zerop (const_tree init)
9319 switch (TREE_CODE (init))
9322 return integer_zerop (init);
9325 /* ??? Note that this is not correct for C4X float formats. There,
9326 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9327 negative exponent. */
9328 return real_zerop (init)
9329 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9332 return fixed_zerop (init);
9335 return integer_zerop (init)
9336 || (real_zerop (init)
9337 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9338 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9341 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9342 if (!initializer_zerop (TREE_VALUE (elt)))
9348 unsigned HOST_WIDE_INT idx;
9350 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9351 if (!initializer_zerop (elt))
9361 /* Build an empty statement at location LOC. */
9364 build_empty_stmt (location_t loc)
9366 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9367 SET_EXPR_LOCATION (t, loc);
9372 /* Build an OpenMP clause with code CODE. LOC is the location of the
9376 build_omp_clause (location_t loc, enum omp_clause_code code)
9381 length = omp_clause_num_ops[code];
9382 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9384 t = GGC_NEWVAR (union tree_node, size);
9385 memset (t, 0, size);
9386 TREE_SET_CODE (t, OMP_CLAUSE);
9387 OMP_CLAUSE_SET_CODE (t, code);
9388 OMP_CLAUSE_LOCATION (t) = loc;
9390 #ifdef GATHER_STATISTICS
9391 tree_node_counts[(int) omp_clause_kind]++;
9392 tree_node_sizes[(int) omp_clause_kind] += size;
9398 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9399 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9400 Except for the CODE and operand count field, other storage for the
9401 object is initialized to zeros. */
9404 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9407 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9409 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9410 gcc_assert (len >= 1);
9412 #ifdef GATHER_STATISTICS
9413 tree_node_counts[(int) e_kind]++;
9414 tree_node_sizes[(int) e_kind] += length;
9417 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9419 memset (t, 0, length);
9421 TREE_SET_CODE (t, code);
9423 /* Can't use TREE_OPERAND to store the length because if checking is
9424 enabled, it will try to check the length before we store it. :-P */
9425 t->exp.operands[0] = build_int_cst (sizetype, len);
9431 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9432 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9436 build_call_list (tree return_type, tree fn, tree arglist)
9441 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9442 TREE_TYPE (t) = return_type;
9443 CALL_EXPR_FN (t) = fn;
9444 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9445 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9446 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9447 process_call_operands (t);
9451 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9452 FN and a null static chain slot. NARGS is the number of call arguments
9453 which are specified as "..." arguments. */
9456 build_call_nary (tree return_type, tree fn, int nargs, ...)
9460 va_start (args, nargs);
9461 ret = build_call_valist (return_type, fn, nargs, args);
9466 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9467 FN and a null static chain slot. NARGS is the number of call arguments
9468 which are specified as a va_list ARGS. */
9471 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9476 t = build_vl_exp (CALL_EXPR, nargs + 3);
9477 TREE_TYPE (t) = return_type;
9478 CALL_EXPR_FN (t) = fn;
9479 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9480 for (i = 0; i < nargs; i++)
9481 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9482 process_call_operands (t);
9486 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9487 FN and a null static chain slot. NARGS is the number of call arguments
9488 which are specified as a tree array ARGS. */
9491 build_call_array_loc (location_t loc, tree return_type, tree fn,
9492 int nargs, const tree *args)
9497 t = build_vl_exp (CALL_EXPR, nargs + 3);
9498 TREE_TYPE (t) = return_type;
9499 CALL_EXPR_FN (t) = fn;
9500 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9501 for (i = 0; i < nargs; i++)
9502 CALL_EXPR_ARG (t, i) = args[i];
9503 process_call_operands (t);
9504 SET_EXPR_LOCATION (t, loc);
9508 /* Like build_call_array, but takes a VEC. */
9511 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9516 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9517 TREE_TYPE (ret) = return_type;
9518 CALL_EXPR_FN (ret) = fn;
9519 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9520 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9521 CALL_EXPR_ARG (ret, ix) = t;
9522 process_call_operands (ret);
9527 /* Returns true if it is possible to prove that the index of
9528 an array access REF (an ARRAY_REF expression) falls into the
9532 in_array_bounds_p (tree ref)
9534 tree idx = TREE_OPERAND (ref, 1);
9537 if (TREE_CODE (idx) != INTEGER_CST)
9540 min = array_ref_low_bound (ref);
9541 max = array_ref_up_bound (ref);
9544 || TREE_CODE (min) != INTEGER_CST
9545 || TREE_CODE (max) != INTEGER_CST)
9548 if (tree_int_cst_lt (idx, min)
9549 || tree_int_cst_lt (max, idx))
9555 /* Returns true if it is possible to prove that the range of
9556 an array access REF (an ARRAY_RANGE_REF expression) falls
9557 into the array bounds. */
9560 range_in_array_bounds_p (tree ref)
9562 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9563 tree range_min, range_max, min, max;
9565 range_min = TYPE_MIN_VALUE (domain_type);
9566 range_max = TYPE_MAX_VALUE (domain_type);
9569 || TREE_CODE (range_min) != INTEGER_CST
9570 || TREE_CODE (range_max) != INTEGER_CST)
9573 min = array_ref_low_bound (ref);
9574 max = array_ref_up_bound (ref);
9577 || TREE_CODE (min) != INTEGER_CST
9578 || TREE_CODE (max) != INTEGER_CST)
9581 if (tree_int_cst_lt (range_min, min)
9582 || tree_int_cst_lt (max, range_max))
9588 /* Return true if T (assumed to be a DECL) must be assigned a memory
9592 needs_to_live_in_memory (const_tree t)
9594 if (TREE_CODE (t) == SSA_NAME)
9595 t = SSA_NAME_VAR (t);
9597 return (TREE_ADDRESSABLE (t)
9598 || is_global_var (t)
9599 || (TREE_CODE (t) == RESULT_DECL
9600 && aggregate_value_p (t, current_function_decl)));
9603 /* There are situations in which a language considers record types
9604 compatible which have different field lists. Decide if two fields
9605 are compatible. It is assumed that the parent records are compatible. */
9608 fields_compatible_p (const_tree f1, const_tree f2)
9610 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9611 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9614 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9615 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9618 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9624 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9627 find_compatible_field (tree record, tree orig_field)
9631 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9632 if (TREE_CODE (f) == FIELD_DECL
9633 && fields_compatible_p (f, orig_field))
9636 /* ??? Why isn't this on the main fields list? */
9637 f = TYPE_VFIELD (record);
9638 if (f && TREE_CODE (f) == FIELD_DECL
9639 && fields_compatible_p (f, orig_field))
9642 /* ??? We should abort here, but Java appears to do Bad Things
9643 with inherited fields. */
9647 /* Return value of a constant X and sign-extend it. */
9650 int_cst_value (const_tree x)
9652 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9653 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9655 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9656 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9657 || TREE_INT_CST_HIGH (x) == -1);
9659 if (bits < HOST_BITS_PER_WIDE_INT)
9661 bool negative = ((val >> (bits - 1)) & 1) != 0;
9663 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9665 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9671 /* Return value of a constant X and sign-extend it. */
9674 widest_int_cst_value (const_tree x)
9676 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9677 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9679 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9680 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9681 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9682 << HOST_BITS_PER_WIDE_INT);
9684 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9685 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9686 || TREE_INT_CST_HIGH (x) == -1);
9689 if (bits < HOST_BITS_PER_WIDEST_INT)
9691 bool negative = ((val >> (bits - 1)) & 1) != 0;
9693 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9695 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9701 /* If TYPE is an integral type, return an equivalent type which is
9702 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9703 return TYPE itself. */
9706 signed_or_unsigned_type_for (int unsignedp, tree type)
9709 if (POINTER_TYPE_P (type))
9711 /* If the pointer points to the normal address space, use the
9712 size_type_node. Otherwise use an appropriate size for the pointer
9713 based on the named address space it points to. */
9714 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9717 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9720 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9723 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9726 /* Returns unsigned variant of TYPE. */
9729 unsigned_type_for (tree type)
9731 return signed_or_unsigned_type_for (1, type);
9734 /* Returns signed variant of TYPE. */
9737 signed_type_for (tree type)
9739 return signed_or_unsigned_type_for (0, type);
9742 /* Returns the largest value obtainable by casting something in INNER type to
9746 upper_bound_in_type (tree outer, tree inner)
9748 unsigned HOST_WIDE_INT lo, hi;
9749 unsigned int det = 0;
9750 unsigned oprec = TYPE_PRECISION (outer);
9751 unsigned iprec = TYPE_PRECISION (inner);
9754 /* Compute a unique number for every combination. */
9755 det |= (oprec > iprec) ? 4 : 0;
9756 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9757 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9759 /* Determine the exponent to use. */
9764 /* oprec <= iprec, outer: signed, inner: don't care. */
9769 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9773 /* oprec > iprec, outer: signed, inner: signed. */
9777 /* oprec > iprec, outer: signed, inner: unsigned. */
9781 /* oprec > iprec, outer: unsigned, inner: signed. */
9785 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9792 /* Compute 2^^prec - 1. */
9793 if (prec <= HOST_BITS_PER_WIDE_INT)
9796 lo = ((~(unsigned HOST_WIDE_INT) 0)
9797 >> (HOST_BITS_PER_WIDE_INT - prec));
9801 hi = ((~(unsigned HOST_WIDE_INT) 0)
9802 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9803 lo = ~(unsigned HOST_WIDE_INT) 0;
9806 return build_int_cst_wide (outer, lo, hi);
9809 /* Returns the smallest value obtainable by casting something in INNER type to
9813 lower_bound_in_type (tree outer, tree inner)
9815 unsigned HOST_WIDE_INT lo, hi;
9816 unsigned oprec = TYPE_PRECISION (outer);
9817 unsigned iprec = TYPE_PRECISION (inner);
9819 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9821 if (TYPE_UNSIGNED (outer)
9822 /* If we are widening something of an unsigned type, OUTER type
9823 contains all values of INNER type. In particular, both INNER
9824 and OUTER types have zero in common. */
9825 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9829 /* If we are widening a signed type to another signed type, we
9830 want to obtain -2^^(iprec-1). If we are keeping the
9831 precision or narrowing to a signed type, we want to obtain
9833 unsigned prec = oprec > iprec ? iprec : oprec;
9835 if (prec <= HOST_BITS_PER_WIDE_INT)
9837 hi = ~(unsigned HOST_WIDE_INT) 0;
9838 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9842 hi = ((~(unsigned HOST_WIDE_INT) 0)
9843 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9848 return build_int_cst_wide (outer, lo, hi);
9851 /* Return nonzero if two operands that are suitable for PHI nodes are
9852 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9853 SSA_NAME or invariant. Note that this is strictly an optimization.
9854 That is, callers of this function can directly call operand_equal_p
9855 and get the same result, only slower. */
9858 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9862 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9864 return operand_equal_p (arg0, arg1, 0);
9867 /* Returns number of zeros at the end of binary representation of X.
9869 ??? Use ffs if available? */
9872 num_ending_zeros (const_tree x)
9874 unsigned HOST_WIDE_INT fr, nfr;
9875 unsigned num, abits;
9876 tree type = TREE_TYPE (x);
9878 if (TREE_INT_CST_LOW (x) == 0)
9880 num = HOST_BITS_PER_WIDE_INT;
9881 fr = TREE_INT_CST_HIGH (x);
9886 fr = TREE_INT_CST_LOW (x);
9889 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9892 if (nfr << abits == fr)
9899 if (num > TYPE_PRECISION (type))
9900 num = TYPE_PRECISION (type);
9902 return build_int_cst_type (type, num);
9906 #define WALK_SUBTREE(NODE) \
9909 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9915 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9916 be walked whenever a type is seen in the tree. Rest of operands and return
9917 value are as for walk_tree. */
9920 walk_type_fields (tree type, walk_tree_fn func, void *data,
9921 struct pointer_set_t *pset, walk_tree_lh lh)
9923 tree result = NULL_TREE;
9925 switch (TREE_CODE (type))
9928 case REFERENCE_TYPE:
9929 /* We have to worry about mutually recursive pointers. These can't
9930 be written in C. They can in Ada. It's pathological, but
9931 there's an ACATS test (c38102a) that checks it. Deal with this
9932 by checking if we're pointing to another pointer, that one
9933 points to another pointer, that one does too, and we have no htab.
9934 If so, get a hash table. We check three levels deep to avoid
9935 the cost of the hash table if we don't need one. */
9936 if (POINTER_TYPE_P (TREE_TYPE (type))
9937 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9938 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9941 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9949 /* ... fall through ... */
9952 WALK_SUBTREE (TREE_TYPE (type));
9956 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9961 WALK_SUBTREE (TREE_TYPE (type));
9965 /* We never want to walk into default arguments. */
9966 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9967 WALK_SUBTREE (TREE_VALUE (arg));
9972 /* Don't follow this nodes's type if a pointer for fear that
9973 we'll have infinite recursion. If we have a PSET, then we
9976 || (!POINTER_TYPE_P (TREE_TYPE (type))
9977 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9978 WALK_SUBTREE (TREE_TYPE (type));
9979 WALK_SUBTREE (TYPE_DOMAIN (type));
9983 WALK_SUBTREE (TREE_TYPE (type));
9984 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9994 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9995 called with the DATA and the address of each sub-tree. If FUNC returns a
9996 non-NULL value, the traversal is stopped, and the value returned by FUNC
9997 is returned. If PSET is non-NULL it is used to record the nodes visited,
9998 and to avoid visiting a node more than once. */
10001 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10002 struct pointer_set_t *pset, walk_tree_lh lh)
10004 enum tree_code code;
10008 #define WALK_SUBTREE_TAIL(NODE) \
10012 goto tail_recurse; \
10017 /* Skip empty subtrees. */
10021 /* Don't walk the same tree twice, if the user has requested
10022 that we avoid doing so. */
10023 if (pset && pointer_set_insert (pset, *tp))
10026 /* Call the function. */
10028 result = (*func) (tp, &walk_subtrees, data);
10030 /* If we found something, return it. */
10034 code = TREE_CODE (*tp);
10036 /* Even if we didn't, FUNC may have decided that there was nothing
10037 interesting below this point in the tree. */
10038 if (!walk_subtrees)
10040 /* But we still need to check our siblings. */
10041 if (code == TREE_LIST)
10042 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10043 else if (code == OMP_CLAUSE)
10044 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10051 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10052 if (result || !walk_subtrees)
10059 case IDENTIFIER_NODE:
10066 case PLACEHOLDER_EXPR:
10070 /* None of these have subtrees other than those already walked
10075 WALK_SUBTREE (TREE_VALUE (*tp));
10076 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10081 int len = TREE_VEC_LENGTH (*tp);
10086 /* Walk all elements but the first. */
10088 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10090 /* Now walk the first one as a tail call. */
10091 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10095 WALK_SUBTREE (TREE_REALPART (*tp));
10096 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10100 unsigned HOST_WIDE_INT idx;
10101 constructor_elt *ce;
10104 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10106 WALK_SUBTREE (ce->value);
10111 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10116 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10118 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10119 into declarations that are just mentioned, rather than
10120 declared; they don't really belong to this part of the tree.
10121 And, we can see cycles: the initializer for a declaration
10122 can refer to the declaration itself. */
10123 WALK_SUBTREE (DECL_INITIAL (decl));
10124 WALK_SUBTREE (DECL_SIZE (decl));
10125 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10127 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10130 case STATEMENT_LIST:
10132 tree_stmt_iterator i;
10133 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10134 WALK_SUBTREE (*tsi_stmt_ptr (i));
10139 switch (OMP_CLAUSE_CODE (*tp))
10141 case OMP_CLAUSE_PRIVATE:
10142 case OMP_CLAUSE_SHARED:
10143 case OMP_CLAUSE_FIRSTPRIVATE:
10144 case OMP_CLAUSE_COPYIN:
10145 case OMP_CLAUSE_COPYPRIVATE:
10146 case OMP_CLAUSE_IF:
10147 case OMP_CLAUSE_NUM_THREADS:
10148 case OMP_CLAUSE_SCHEDULE:
10149 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10152 case OMP_CLAUSE_NOWAIT:
10153 case OMP_CLAUSE_ORDERED:
10154 case OMP_CLAUSE_DEFAULT:
10155 case OMP_CLAUSE_UNTIED:
10156 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10158 case OMP_CLAUSE_LASTPRIVATE:
10159 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10160 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10161 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10163 case OMP_CLAUSE_COLLAPSE:
10166 for (i = 0; i < 3; i++)
10167 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10168 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10171 case OMP_CLAUSE_REDUCTION:
10174 for (i = 0; i < 4; i++)
10175 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10176 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10180 gcc_unreachable ();
10188 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10189 But, we only want to walk once. */
10190 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10191 for (i = 0; i < len; ++i)
10192 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10193 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10197 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10198 defining. We only want to walk into these fields of a type in this
10199 case and not in the general case of a mere reference to the type.
10201 The criterion is as follows: if the field can be an expression, it
10202 must be walked only here. This should be in keeping with the fields
10203 that are directly gimplified in gimplify_type_sizes in order for the
10204 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10205 variable-sized types.
10207 Note that DECLs get walked as part of processing the BIND_EXPR. */
10208 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10210 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10211 if (TREE_CODE (*type_p) == ERROR_MARK)
10214 /* Call the function for the type. See if it returns anything or
10215 doesn't want us to continue. If we are to continue, walk both
10216 the normal fields and those for the declaration case. */
10217 result = (*func) (type_p, &walk_subtrees, data);
10218 if (result || !walk_subtrees)
10221 result = walk_type_fields (*type_p, func, data, pset, lh);
10225 /* If this is a record type, also walk the fields. */
10226 if (RECORD_OR_UNION_TYPE_P (*type_p))
10230 for (field = TYPE_FIELDS (*type_p); field;
10231 field = TREE_CHAIN (field))
10233 /* We'd like to look at the type of the field, but we can
10234 easily get infinite recursion. So assume it's pointed
10235 to elsewhere in the tree. Also, ignore things that
10237 if (TREE_CODE (field) != FIELD_DECL)
10240 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10241 WALK_SUBTREE (DECL_SIZE (field));
10242 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10243 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10244 WALK_SUBTREE (DECL_QUALIFIER (field));
10248 /* Same for scalar types. */
10249 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10250 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10251 || TREE_CODE (*type_p) == INTEGER_TYPE
10252 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10253 || TREE_CODE (*type_p) == REAL_TYPE)
10255 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10256 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10259 WALK_SUBTREE (TYPE_SIZE (*type_p));
10260 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10265 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10269 /* Walk over all the sub-trees of this operand. */
10270 len = TREE_OPERAND_LENGTH (*tp);
10272 /* Go through the subtrees. We need to do this in forward order so
10273 that the scope of a FOR_EXPR is handled properly. */
10276 for (i = 0; i < len - 1; ++i)
10277 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10278 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10281 /* If this is a type, walk the needed fields in the type. */
10282 else if (TYPE_P (*tp))
10283 return walk_type_fields (*tp, func, data, pset, lh);
10287 /* We didn't find what we were looking for. */
10290 #undef WALK_SUBTREE_TAIL
10292 #undef WALK_SUBTREE
10294 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10297 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10301 struct pointer_set_t *pset;
10303 pset = pointer_set_create ();
10304 result = walk_tree_1 (tp, func, data, pset, lh);
10305 pointer_set_destroy (pset);
10311 tree_block (tree t)
10313 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10315 if (IS_EXPR_CODE_CLASS (c))
10316 return &t->exp.block;
10317 gcc_unreachable ();
10321 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10322 FIXME: don't use this function. It exists for compatibility with
10323 the old representation of CALL_EXPRs where a list was used to hold the
10324 arguments. Places that currently extract the arglist from a CALL_EXPR
10325 ought to be rewritten to use the CALL_EXPR itself. */
10327 call_expr_arglist (tree exp)
10329 tree arglist = NULL_TREE;
10331 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10332 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10337 /* Create a nameless artificial label and put it in the current
10338 function context. The label has a location of LOC. Returns the
10339 newly created label. */
10342 create_artificial_label (location_t loc)
10344 tree lab = build_decl (loc,
10345 LABEL_DECL, NULL_TREE, void_type_node);
10347 DECL_ARTIFICIAL (lab) = 1;
10348 DECL_IGNORED_P (lab) = 1;
10349 DECL_CONTEXT (lab) = current_function_decl;
10353 /* Given a tree, try to return a useful variable name that we can use
10354 to prefix a temporary that is being assigned the value of the tree.
10355 I.E. given <temp> = &A, return A. */
10360 tree stripped_decl;
10363 STRIP_NOPS (stripped_decl);
10364 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10365 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10368 switch (TREE_CODE (stripped_decl))
10371 return get_name (TREE_OPERAND (stripped_decl, 0));
10378 /* Return true if TYPE has a variable argument list. */
10381 stdarg_p (tree fntype)
10383 function_args_iterator args_iter;
10384 tree n = NULL_TREE, t;
10389 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10394 return n != NULL_TREE && n != void_type_node;
10397 /* Return true if TYPE has a prototype. */
10400 prototype_p (tree fntype)
10404 gcc_assert (fntype != NULL_TREE);
10406 t = TYPE_ARG_TYPES (fntype);
10407 return (t != NULL_TREE);
10410 /* If BLOCK is inlined from an __attribute__((__artificial__))
10411 routine, return pointer to location from where it has been
10414 block_nonartificial_location (tree block)
10416 location_t *ret = NULL;
10418 while (block && TREE_CODE (block) == BLOCK
10419 && BLOCK_ABSTRACT_ORIGIN (block))
10421 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10423 while (TREE_CODE (ao) == BLOCK
10424 && BLOCK_ABSTRACT_ORIGIN (ao)
10425 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10426 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10428 if (TREE_CODE (ao) == FUNCTION_DECL)
10430 /* If AO is an artificial inline, point RET to the
10431 call site locus at which it has been inlined and continue
10432 the loop, in case AO's caller is also an artificial
10434 if (DECL_DECLARED_INLINE_P (ao)
10435 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10436 ret = &BLOCK_SOURCE_LOCATION (block);
10440 else if (TREE_CODE (ao) != BLOCK)
10443 block = BLOCK_SUPERCONTEXT (block);
10449 /* If EXP is inlined from an __attribute__((__artificial__))
10450 function, return the location of the original call expression. */
10453 tree_nonartificial_location (tree exp)
10455 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10460 return EXPR_LOCATION (exp);
10464 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10467 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10470 cl_option_hash_hash (const void *x)
10472 const_tree const t = (const_tree) x;
10476 hashval_t hash = 0;
10478 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10480 p = (const char *)TREE_OPTIMIZATION (t);
10481 len = sizeof (struct cl_optimization);
10484 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10486 p = (const char *)TREE_TARGET_OPTION (t);
10487 len = sizeof (struct cl_target_option);
10491 gcc_unreachable ();
10493 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10495 for (i = 0; i < len; i++)
10497 hash = (hash << 4) ^ ((i << 2) | p[i]);
10502 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10503 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10507 cl_option_hash_eq (const void *x, const void *y)
10509 const_tree const xt = (const_tree) x;
10510 const_tree const yt = (const_tree) y;
10515 if (TREE_CODE (xt) != TREE_CODE (yt))
10518 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10520 xp = (const char *)TREE_OPTIMIZATION (xt);
10521 yp = (const char *)TREE_OPTIMIZATION (yt);
10522 len = sizeof (struct cl_optimization);
10525 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10527 xp = (const char *)TREE_TARGET_OPTION (xt);
10528 yp = (const char *)TREE_TARGET_OPTION (yt);
10529 len = sizeof (struct cl_target_option);
10533 gcc_unreachable ();
10535 return (memcmp (xp, yp, len) == 0);
10538 /* Build an OPTIMIZATION_NODE based on the current options. */
10541 build_optimization_node (void)
10546 /* Use the cache of optimization nodes. */
10548 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10550 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10554 /* Insert this one into the hash table. */
10555 t = cl_optimization_node;
10558 /* Make a new node for next time round. */
10559 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10565 /* Build a TARGET_OPTION_NODE based on the current options. */
10568 build_target_option_node (void)
10573 /* Use the cache of optimization nodes. */
10575 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10577 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10581 /* Insert this one into the hash table. */
10582 t = cl_target_option_node;
10585 /* Make a new node for next time round. */
10586 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10592 /* Determine the "ultimate origin" of a block. The block may be an inlined
10593 instance of an inlined instance of a block which is local to an inline
10594 function, so we have to trace all of the way back through the origin chain
10595 to find out what sort of node actually served as the original seed for the
10599 block_ultimate_origin (const_tree block)
10601 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10603 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10604 nodes in the function to point to themselves; ignore that if
10605 we're trying to output the abstract instance of this function. */
10606 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10609 if (immediate_origin == NULL_TREE)
10614 tree lookahead = immediate_origin;
10618 ret_val = lookahead;
10619 lookahead = (TREE_CODE (ret_val) == BLOCK
10620 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10622 while (lookahead != NULL && lookahead != ret_val);
10624 /* The block's abstract origin chain may not be the *ultimate* origin of
10625 the block. It could lead to a DECL that has an abstract origin set.
10626 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10627 will give us if it has one). Note that DECL's abstract origins are
10628 supposed to be the most distant ancestor (or so decl_ultimate_origin
10629 claims), so we don't need to loop following the DECL origins. */
10630 if (DECL_P (ret_val))
10631 return DECL_ORIGIN (ret_val);
10637 /* Return true if T1 and T2 are equivalent lists. */
10640 list_equal_p (const_tree t1, const_tree t2)
10642 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10643 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10648 /* Return true iff conversion in EXP generates no instruction. Mark
10649 it inline so that we fully inline into the stripping functions even
10650 though we have two uses of this function. */
10653 tree_nop_conversion (const_tree exp)
10655 tree outer_type, inner_type;
10657 if (!CONVERT_EXPR_P (exp)
10658 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10660 if (TREE_OPERAND (exp, 0) == error_mark_node)
10663 outer_type = TREE_TYPE (exp);
10664 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10669 /* Use precision rather then machine mode when we can, which gives
10670 the correct answer even for submode (bit-field) types. */
10671 if ((INTEGRAL_TYPE_P (outer_type)
10672 || POINTER_TYPE_P (outer_type)
10673 || TREE_CODE (outer_type) == OFFSET_TYPE)
10674 && (INTEGRAL_TYPE_P (inner_type)
10675 || POINTER_TYPE_P (inner_type)
10676 || TREE_CODE (inner_type) == OFFSET_TYPE))
10677 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10679 /* Otherwise fall back on comparing machine modes (e.g. for
10680 aggregate types, floats). */
10681 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10684 /* Return true iff conversion in EXP generates no instruction. Don't
10685 consider conversions changing the signedness. */
10688 tree_sign_nop_conversion (const_tree exp)
10690 tree outer_type, inner_type;
10692 if (!tree_nop_conversion (exp))
10695 outer_type = TREE_TYPE (exp);
10696 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10698 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10699 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10702 /* Strip conversions from EXP according to tree_nop_conversion and
10703 return the resulting expression. */
10706 tree_strip_nop_conversions (tree exp)
10708 while (tree_nop_conversion (exp))
10709 exp = TREE_OPERAND (exp, 0);
10713 /* Strip conversions from EXP according to tree_sign_nop_conversion
10714 and return the resulting expression. */
10717 tree_strip_sign_nop_conversions (tree exp)
10719 while (tree_sign_nop_conversion (exp))
10720 exp = TREE_OPERAND (exp, 0);
10724 static GTY(()) tree gcc_eh_personality_decl;
10726 /* Return the GCC personality function decl. */
10729 lhd_gcc_personality (void)
10731 if (!gcc_eh_personality_decl)
10732 gcc_eh_personality_decl
10733 = build_personality_function (USING_SJLJ_EXCEPTIONS
10734 ? "__gcc_personality_sj0"
10735 : "__gcc_personality_v0");
10737 return gcc_eh_personality_decl;
10740 #include "gt-tree.h"