1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid = 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash {
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
179 htab_t type_hash_table;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
184 htab_t int_cst_hash_table;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node;
192 static GTY (()) tree cl_target_option_node;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
194 htab_t cl_option_hash_table;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
200 htab_t debug_expr_for_decl;
202 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
203 htab_t value_expr_for_decl;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map)))
207 htab_t init_priority_for_decl;
209 static void set_type_quals (tree, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t type_hash_hash (const void *);
212 static hashval_t int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree, hashval_t);
221 static unsigned int attribute_hash_list (const_tree, hashval_t);
223 tree global_trees[TI_MAX];
224 tree integer_types[itk_none];
226 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0 /* OMP_CLAUSE_UNTIED */
249 const char * const omp_clause_code_name[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code)
275 switch (TREE_CODE_CLASS (code))
277 case tcc_declaration:
282 return TS_FIELD_DECL;
288 return TS_LABEL_DECL;
290 return TS_RESULT_DECL;
291 case DEBUG_EXPR_DECL:
294 return TS_CONST_DECL;
298 return TS_FUNCTION_DECL;
300 return TS_DECL_NON_COMMON;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST: return TS_INT_CST;
320 case REAL_CST: return TS_REAL_CST;
321 case FIXED_CST: return TS_FIXED_CST;
322 case COMPLEX_CST: return TS_COMPLEX;
323 case VECTOR_CST: return TS_VECTOR;
324 case STRING_CST: return TS_STRING;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK: return TS_COMMON;
327 case IDENTIFIER_NODE: return TS_IDENTIFIER;
328 case TREE_LIST: return TS_LIST;
329 case TREE_VEC: return TS_VEC;
330 case SSA_NAME: return TS_SSA_NAME;
331 case PLACEHOLDER_EXPR: return TS_COMMON;
332 case STATEMENT_LIST: return TS_STATEMENT_LIST;
333 case BLOCK: return TS_BLOCK;
334 case CONSTRUCTOR: return TS_CONSTRUCTOR;
335 case TREE_BINFO: return TS_BINFO;
336 case OMP_CLAUSE: return TS_OMP_CLAUSE;
337 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
338 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
398 enum tree_node_structure_enum ts_code;
400 code = (enum tree_code) i;
401 ts_code = tree_node_structure_for_code (code);
403 /* Mark the TS structure itself. */
404 tree_contains_struct[code][ts_code] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL:
428 case TS_STATEMENT_LIST:
431 case TS_OPTIMIZATION:
432 case TS_TARGET_OPTION:
433 MARK_TS_COMMON (code);
437 MARK_TS_DECL_MINIMAL (code);
441 MARK_TS_DECL_COMMON (code);
444 case TS_DECL_NON_COMMON:
445 MARK_TS_DECL_WITH_VIS (code);
448 case TS_DECL_WITH_VIS:
453 MARK_TS_DECL_WRTL (code);
457 MARK_TS_DECL_COMMON (code);
461 MARK_TS_DECL_WITH_VIS (code);
465 case TS_FUNCTION_DECL:
466 MARK_TS_DECL_NON_COMMON (code);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
476 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
478 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
503 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
504 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
505 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
507 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
508 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
509 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
510 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
511 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
512 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
513 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
514 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
515 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
536 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
539 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
541 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
542 tree_priority_map_eq, 0);
544 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
545 int_cst_hash_eq, NULL);
547 int_cst_node = make_node (INTEGER_CST);
549 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
550 cl_option_hash_eq, NULL);
552 cl_optimization_node = make_node (OPTIMIZATION_NODE);
553 cl_target_option_node = make_node (TARGET_OPTION_NODE);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
568 lang_hooks.set_decl_assembler_name (decl);
569 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl, const_tree asmname)
577 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
578 const char *decl_str;
579 const char *asmname_str;
582 if (decl_asmname == asmname)
585 decl_str = IDENTIFIER_POINTER (decl_asmname);
586 asmname_str = IDENTIFIER_POINTER (asmname);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str[0] == '*')
597 size_t ulp_len = strlen (user_label_prefix);
603 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
604 decl_str += ulp_len, test=true;
608 if (asmname_str[0] == '*')
610 size_t ulp_len = strlen (user_label_prefix);
616 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
617 asmname_str += ulp_len, test=true;
624 return strcmp (decl_str, asmname_str) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname)
632 if (IDENTIFIER_POINTER (asmname)[0] == '*')
634 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
635 size_t ulp_len = strlen (user_label_prefix);
639 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
642 return htab_hash_string (decl_str);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code)
654 switch (TREE_CODE_CLASS (code))
656 case tcc_declaration: /* A decl node */
661 return sizeof (struct tree_field_decl);
663 return sizeof (struct tree_parm_decl);
665 return sizeof (struct tree_var_decl);
667 return sizeof (struct tree_label_decl);
669 return sizeof (struct tree_result_decl);
671 return sizeof (struct tree_const_decl);
673 return sizeof (struct tree_type_decl);
675 return sizeof (struct tree_function_decl);
676 case DEBUG_EXPR_DECL:
677 return sizeof (struct tree_decl_with_rtl);
679 return sizeof (struct tree_decl_non_common);
683 case tcc_type: /* a type node */
684 return sizeof (struct tree_type);
686 case tcc_reference: /* a reference */
687 case tcc_expression: /* an expression */
688 case tcc_statement: /* an expression with side effects */
689 case tcc_comparison: /* a comparison expression */
690 case tcc_unary: /* a unary arithmetic expression */
691 case tcc_binary: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp)
693 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
695 case tcc_constant: /* a constant */
698 case INTEGER_CST: return sizeof (struct tree_int_cst);
699 case REAL_CST: return sizeof (struct tree_real_cst);
700 case FIXED_CST: return sizeof (struct tree_fixed_cst);
701 case COMPLEX_CST: return sizeof (struct tree_complex);
702 case VECTOR_CST: return sizeof (struct tree_vector);
703 case STRING_CST: gcc_unreachable ();
705 return lang_hooks.tree_size (code);
708 case tcc_exceptional: /* something random, like an identifier. */
711 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
712 case TREE_LIST: return sizeof (struct tree_list);
715 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
718 case OMP_CLAUSE: gcc_unreachable ();
720 case SSA_NAME: return sizeof (struct tree_ssa_name);
722 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
723 case BLOCK: return sizeof (struct tree_block);
724 case CONSTRUCTOR: return sizeof (struct tree_constructor);
725 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
726 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
729 return lang_hooks.tree_size (code);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node)
742 const enum tree_code code = TREE_CODE (node);
746 return (offsetof (struct tree_binfo, base_binfos)
747 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
750 return (sizeof (struct tree_vec)
751 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
754 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
757 return (sizeof (struct tree_omp_clause)
758 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
762 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
763 return (sizeof (struct tree_exp)
764 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
766 return tree_code_size (code);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL)
781 enum tree_code_class type = TREE_CODE_CLASS (code);
782 size_t length = tree_code_size (code);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration: /* A decl node */
792 case tcc_type: /* a type node */
796 case tcc_statement: /* an expression with side effects */
800 case tcc_reference: /* a reference */
804 case tcc_expression: /* an expression */
805 case tcc_comparison: /* a comparison expression */
806 case tcc_unary: /* a unary arithmetic expression */
807 case tcc_binary: /* a binary arithmetic expression */
811 case tcc_constant: /* a constant */
815 case tcc_exceptional: /* something random, like an identifier. */
818 case IDENTIFIER_NODE:
831 kind = ssa_name_kind;
852 tree_node_counts[(int) kind]++;
853 tree_node_sizes[(int) kind] += length;
856 if (code == IDENTIFIER_NODE)
857 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
859 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
861 memset (t, 0, length);
863 TREE_SET_CODE (t, code);
868 TREE_SIDE_EFFECTS (t) = 1;
871 case tcc_declaration:
872 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
874 if (code == FUNCTION_DECL)
876 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
877 DECL_MODE (t) = FUNCTION_MODE;
882 DECL_SOURCE_LOCATION (t) = input_location;
883 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
884 DECL_UID (t) = --next_debug_decl_uid;
887 DECL_UID (t) = next_decl_uid++;
888 SET_DECL_PT_UID (t, -1);
890 if (TREE_CODE (t) == LABEL_DECL)
891 LABEL_DECL_UID (t) = -1;
896 TYPE_UID (t) = next_type_uid++;
897 TYPE_ALIGN (t) = BITS_PER_UNIT;
898 TYPE_USER_ALIGN (t) = 0;
899 TYPE_MAIN_VARIANT (t) = t;
900 TYPE_CANONICAL (t) = t;
902 /* Default to no attributes for type, but let target change that. */
903 TYPE_ATTRIBUTES (t) = NULL_TREE;
904 targetm.set_default_type_attributes (t);
906 /* We have not yet computed the alias set for this type. */
907 TYPE_ALIAS_SET (t) = -1;
911 TREE_CONSTANT (t) = 1;
920 case PREDECREMENT_EXPR:
921 case PREINCREMENT_EXPR:
922 case POSTDECREMENT_EXPR:
923 case POSTINCREMENT_EXPR:
924 /* All of these have side-effects, no matter what their
926 TREE_SIDE_EFFECTS (t) = 1;
935 /* Other classes need no special treatment. */
942 /* Return a new node with the same contents as NODE except that its
943 TREE_CHAIN is zero and it has a fresh uid. */
946 copy_node_stat (tree node MEM_STAT_DECL)
949 enum tree_code code = TREE_CODE (node);
952 gcc_assert (code != STATEMENT_LIST);
954 length = tree_size (node);
955 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
956 memcpy (t, node, length);
959 TREE_ASM_WRITTEN (t) = 0;
960 TREE_VISITED (t) = 0;
961 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
962 *DECL_VAR_ANN_PTR (t) = 0;
964 if (TREE_CODE_CLASS (code) == tcc_declaration)
966 if (code == DEBUG_EXPR_DECL)
967 DECL_UID (t) = --next_debug_decl_uid;
970 DECL_UID (t) = next_decl_uid++;
971 if (DECL_PT_UID_SET_P (node))
972 SET_DECL_PT_UID (t, DECL_PT_UID (node));
974 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
975 && DECL_HAS_VALUE_EXPR_P (node))
977 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
978 DECL_HAS_VALUE_EXPR_P (t) = 1;
980 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
982 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
983 DECL_HAS_INIT_PRIORITY_P (t) = 1;
986 else if (TREE_CODE_CLASS (code) == tcc_type)
988 TYPE_UID (t) = next_type_uid++;
989 /* The following is so that the debug code for
990 the copy is different from the original type.
991 The two statements usually duplicate each other
992 (because they clear fields of the same union),
993 but the optimizer should catch that. */
994 TYPE_SYMTAB_POINTER (t) = 0;
995 TYPE_SYMTAB_ADDRESS (t) = 0;
997 /* Do not copy the values cache. */
998 if (TYPE_CACHED_VALUES_P(t))
1000 TYPE_CACHED_VALUES_P (t) = 0;
1001 TYPE_CACHED_VALUES (t) = NULL_TREE;
1008 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1009 For example, this can copy a list made of TREE_LIST nodes. */
1012 copy_list (tree list)
1020 head = prev = copy_node (list);
1021 next = TREE_CHAIN (list);
1024 TREE_CHAIN (prev) = copy_node (next);
1025 prev = TREE_CHAIN (prev);
1026 next = TREE_CHAIN (next);
1032 /* Create an INT_CST node with a LOW value sign extended. */
1035 build_int_cst (tree type, HOST_WIDE_INT low)
1037 /* Support legacy code. */
1039 type = integer_type_node;
1041 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1044 /* Create an INT_CST node with a LOW value zero extended. */
1047 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1049 return build_int_cst_wide (type, low, 0);
1052 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1053 if it is negative. This function is similar to build_int_cst, but
1054 the extra bits outside of the type precision are cleared. Constants
1055 with these extra bits may confuse the fold so that it detects overflows
1056 even in cases when they do not occur, and in general should be avoided.
1057 We cannot however make this a default behavior of build_int_cst without
1058 more intrusive changes, since there are parts of gcc that rely on the extra
1059 precision of the integer constants. */
1062 build_int_cst_type (tree type, HOST_WIDE_INT low)
1064 unsigned HOST_WIDE_INT low1;
1069 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1071 return build_int_cst_wide (type, low1, hi);
1074 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1075 and sign extended according to the value range of TYPE. */
1078 build_int_cst_wide_type (tree type,
1079 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1081 fit_double_type (low, high, &low, &high, type);
1082 return build_int_cst_wide (type, low, high);
1085 /* Constructs tree in type TYPE from with value given by CST. Signedness
1086 of CST is assumed to be the same as the signedness of TYPE. */
1089 double_int_to_tree (tree type, double_int cst)
1091 cst = double_int_ext (cst, TYPE_PRECISION (type), TYPE_UNSIGNED (type));
1093 return build_int_cst_wide (type, cst.low, cst.high);
1096 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1097 to be the same as the signedness of TYPE. */
1100 double_int_fits_to_tree_p (const_tree type, double_int cst)
1102 double_int ext = double_int_ext (cst,
1103 TYPE_PRECISION (type),
1104 TYPE_UNSIGNED (type));
1106 return double_int_equal_p (cst, ext);
1109 /* These are the hash table functions for the hash table of INTEGER_CST
1110 nodes of a sizetype. */
1112 /* Return the hash code code X, an INTEGER_CST. */
1115 int_cst_hash_hash (const void *x)
1117 const_tree const t = (const_tree) x;
1119 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1120 ^ htab_hash_pointer (TREE_TYPE (t)));
1123 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1124 is the same as that given by *Y, which is the same. */
1127 int_cst_hash_eq (const void *x, const void *y)
1129 const_tree const xt = (const_tree) x;
1130 const_tree const yt = (const_tree) y;
1132 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1133 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1134 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1137 /* Create an INT_CST node of TYPE and value HI:LOW.
1138 The returned node is always shared. For small integers we use a
1139 per-type vector cache, for larger ones we use a single hash table. */
1142 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1150 switch (TREE_CODE (type))
1153 case REFERENCE_TYPE:
1154 /* Cache NULL pointer. */
1163 /* Cache false or true. */
1171 if (TYPE_UNSIGNED (type))
1174 limit = INTEGER_SHARE_LIMIT;
1175 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1181 limit = INTEGER_SHARE_LIMIT + 1;
1182 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1184 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1198 /* Look for it in the type's vector of small shared ints. */
1199 if (!TYPE_CACHED_VALUES_P (type))
1201 TYPE_CACHED_VALUES_P (type) = 1;
1202 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1205 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1208 /* Make sure no one is clobbering the shared constant. */
1209 gcc_assert (TREE_TYPE (t) == type);
1210 gcc_assert (TREE_INT_CST_LOW (t) == low);
1211 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1215 /* Create a new shared int. */
1216 t = make_node (INTEGER_CST);
1218 TREE_INT_CST_LOW (t) = low;
1219 TREE_INT_CST_HIGH (t) = hi;
1220 TREE_TYPE (t) = type;
1222 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1227 /* Use the cache of larger shared ints. */
1230 TREE_INT_CST_LOW (int_cst_node) = low;
1231 TREE_INT_CST_HIGH (int_cst_node) = hi;
1232 TREE_TYPE (int_cst_node) = type;
1234 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1238 /* Insert this one into the hash table. */
1241 /* Make a new node for next time round. */
1242 int_cst_node = make_node (INTEGER_CST);
1249 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1250 and the rest are zeros. */
1253 build_low_bits_mask (tree type, unsigned bits)
1257 gcc_assert (bits <= TYPE_PRECISION (type));
1259 if (bits == TYPE_PRECISION (type)
1260 && !TYPE_UNSIGNED (type))
1261 /* Sign extended all-ones mask. */
1262 mask = double_int_minus_one;
1264 mask = double_int_mask (bits);
1266 return build_int_cst_wide (type, mask.low, mask.high);
1269 /* Checks that X is integer constant that can be expressed in (unsigned)
1270 HOST_WIDE_INT without loss of precision. */
1273 cst_and_fits_in_hwi (const_tree x)
1275 if (TREE_CODE (x) != INTEGER_CST)
1278 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1281 return (TREE_INT_CST_HIGH (x) == 0
1282 || TREE_INT_CST_HIGH (x) == -1);
1285 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1286 are in a list pointed to by VALS. */
1289 build_vector (tree type, tree vals)
1291 tree v = make_node (VECTOR_CST);
1295 TREE_VECTOR_CST_ELTS (v) = vals;
1296 TREE_TYPE (v) = type;
1298 /* Iterate through elements and check for overflow. */
1299 for (link = vals; link; link = TREE_CHAIN (link))
1301 tree value = TREE_VALUE (link);
1303 /* Don't crash if we get an address constant. */
1304 if (!CONSTANT_CLASS_P (value))
1307 over |= TREE_OVERFLOW (value);
1310 TREE_OVERFLOW (v) = over;
1314 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1315 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1318 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1320 tree list = NULL_TREE;
1321 unsigned HOST_WIDE_INT idx;
1324 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1325 list = tree_cons (NULL_TREE, value, list);
1326 return build_vector (type, nreverse (list));
1329 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1330 are in the VEC pointed to by VALS. */
1332 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1334 tree c = make_node (CONSTRUCTOR);
1335 TREE_TYPE (c) = type;
1336 CONSTRUCTOR_ELTS (c) = vals;
1340 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1343 build_constructor_single (tree type, tree index, tree value)
1345 VEC(constructor_elt,gc) *v;
1346 constructor_elt *elt;
1349 v = VEC_alloc (constructor_elt, gc, 1);
1350 elt = VEC_quick_push (constructor_elt, v, NULL);
1354 t = build_constructor (type, v);
1355 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1360 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1361 are in a list pointed to by VALS. */
1363 build_constructor_from_list (tree type, tree vals)
1366 VEC(constructor_elt,gc) *v = NULL;
1367 bool constant_p = true;
1371 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1372 for (t = vals; t; t = TREE_CHAIN (t))
1374 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1375 val = TREE_VALUE (t);
1376 elt->index = TREE_PURPOSE (t);
1378 if (!TREE_CONSTANT (val))
1383 t = build_constructor (type, v);
1384 TREE_CONSTANT (t) = constant_p;
1388 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1391 build_fixed (tree type, FIXED_VALUE_TYPE f)
1394 FIXED_VALUE_TYPE *fp;
1396 v = make_node (FIXED_CST);
1397 fp = GGC_NEW (FIXED_VALUE_TYPE);
1398 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1400 TREE_TYPE (v) = type;
1401 TREE_FIXED_CST_PTR (v) = fp;
1405 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1408 build_real (tree type, REAL_VALUE_TYPE d)
1411 REAL_VALUE_TYPE *dp;
1414 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1415 Consider doing it via real_convert now. */
1417 v = make_node (REAL_CST);
1418 dp = GGC_NEW (REAL_VALUE_TYPE);
1419 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1421 TREE_TYPE (v) = type;
1422 TREE_REAL_CST_PTR (v) = dp;
1423 TREE_OVERFLOW (v) = overflow;
1427 /* Return a new REAL_CST node whose type is TYPE
1428 and whose value is the integer value of the INTEGER_CST node I. */
1431 real_value_from_int_cst (const_tree type, const_tree i)
1435 /* Clear all bits of the real value type so that we can later do
1436 bitwise comparisons to see if two values are the same. */
1437 memset (&d, 0, sizeof d);
1439 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1440 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1441 TYPE_UNSIGNED (TREE_TYPE (i)));
1445 /* Given a tree representing an integer constant I, return a tree
1446 representing the same value as a floating-point constant of type TYPE. */
1449 build_real_from_int_cst (tree type, const_tree i)
1452 int overflow = TREE_OVERFLOW (i);
1454 v = build_real (type, real_value_from_int_cst (type, i));
1456 TREE_OVERFLOW (v) |= overflow;
1460 /* Return a newly constructed STRING_CST node whose value is
1461 the LEN characters at STR.
1462 The TREE_TYPE is not initialized. */
1465 build_string (int len, const char *str)
1470 /* Do not waste bytes provided by padding of struct tree_string. */
1471 length = len + offsetof (struct tree_string, str) + 1;
1473 #ifdef GATHER_STATISTICS
1474 tree_node_counts[(int) c_kind]++;
1475 tree_node_sizes[(int) c_kind] += length;
1478 s = ggc_alloc_tree (length);
1480 memset (s, 0, sizeof (struct tree_common));
1481 TREE_SET_CODE (s, STRING_CST);
1482 TREE_CONSTANT (s) = 1;
1483 TREE_STRING_LENGTH (s) = len;
1484 memcpy (s->string.str, str, len);
1485 s->string.str[len] = '\0';
1490 /* Return a newly constructed COMPLEX_CST node whose value is
1491 specified by the real and imaginary parts REAL and IMAG.
1492 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1493 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1496 build_complex (tree type, tree real, tree imag)
1498 tree t = make_node (COMPLEX_CST);
1500 TREE_REALPART (t) = real;
1501 TREE_IMAGPART (t) = imag;
1502 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1503 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1507 /* Return a constant of arithmetic type TYPE which is the
1508 multiplicative identity of the set TYPE. */
1511 build_one_cst (tree type)
1513 switch (TREE_CODE (type))
1515 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1516 case POINTER_TYPE: case REFERENCE_TYPE:
1518 return build_int_cst (type, 1);
1521 return build_real (type, dconst1);
1523 case FIXED_POINT_TYPE:
1524 /* We can only generate 1 for accum types. */
1525 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1526 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1533 scalar = build_one_cst (TREE_TYPE (type));
1535 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1537 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1538 cst = tree_cons (NULL_TREE, scalar, cst);
1540 return build_vector (type, cst);
1544 return build_complex (type,
1545 build_one_cst (TREE_TYPE (type)),
1546 fold_convert (TREE_TYPE (type), integer_zero_node));
1553 /* Build a BINFO with LEN language slots. */
1556 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1559 size_t length = (offsetof (struct tree_binfo, base_binfos)
1560 + VEC_embedded_size (tree, base_binfos));
1562 #ifdef GATHER_STATISTICS
1563 tree_node_counts[(int) binfo_kind]++;
1564 tree_node_sizes[(int) binfo_kind] += length;
1567 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1569 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1571 TREE_SET_CODE (t, TREE_BINFO);
1573 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1579 /* Build a newly constructed TREE_VEC node of length LEN. */
1582 make_tree_vec_stat (int len MEM_STAT_DECL)
1585 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1587 #ifdef GATHER_STATISTICS
1588 tree_node_counts[(int) vec_kind]++;
1589 tree_node_sizes[(int) vec_kind] += length;
1592 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1594 memset (t, 0, length);
1596 TREE_SET_CODE (t, TREE_VEC);
1597 TREE_VEC_LENGTH (t) = len;
1602 /* Return 1 if EXPR is the integer constant zero or a complex constant
1606 integer_zerop (const_tree expr)
1610 return ((TREE_CODE (expr) == INTEGER_CST
1611 && TREE_INT_CST_LOW (expr) == 0
1612 && TREE_INT_CST_HIGH (expr) == 0)
1613 || (TREE_CODE (expr) == COMPLEX_CST
1614 && integer_zerop (TREE_REALPART (expr))
1615 && integer_zerop (TREE_IMAGPART (expr))));
1618 /* Return 1 if EXPR is the integer constant one or the corresponding
1619 complex constant. */
1622 integer_onep (const_tree expr)
1626 return ((TREE_CODE (expr) == INTEGER_CST
1627 && TREE_INT_CST_LOW (expr) == 1
1628 && TREE_INT_CST_HIGH (expr) == 0)
1629 || (TREE_CODE (expr) == COMPLEX_CST
1630 && integer_onep (TREE_REALPART (expr))
1631 && integer_zerop (TREE_IMAGPART (expr))));
1634 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1635 it contains. Likewise for the corresponding complex constant. */
1638 integer_all_onesp (const_tree expr)
1645 if (TREE_CODE (expr) == COMPLEX_CST
1646 && integer_all_onesp (TREE_REALPART (expr))
1647 && integer_zerop (TREE_IMAGPART (expr)))
1650 else if (TREE_CODE (expr) != INTEGER_CST)
1653 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1654 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1655 && TREE_INT_CST_HIGH (expr) == -1)
1660 /* Note that using TYPE_PRECISION here is wrong. We care about the
1661 actual bits, not the (arbitrary) range of the type. */
1662 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1663 if (prec >= HOST_BITS_PER_WIDE_INT)
1665 HOST_WIDE_INT high_value;
1668 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1670 /* Can not handle precisions greater than twice the host int size. */
1671 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1672 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1673 /* Shifting by the host word size is undefined according to the ANSI
1674 standard, so we must handle this as a special case. */
1677 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1679 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1680 && TREE_INT_CST_HIGH (expr) == high_value);
1683 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1686 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1690 integer_pow2p (const_tree expr)
1693 HOST_WIDE_INT high, low;
1697 if (TREE_CODE (expr) == COMPLEX_CST
1698 && integer_pow2p (TREE_REALPART (expr))
1699 && integer_zerop (TREE_IMAGPART (expr)))
1702 if (TREE_CODE (expr) != INTEGER_CST)
1705 prec = TYPE_PRECISION (TREE_TYPE (expr));
1706 high = TREE_INT_CST_HIGH (expr);
1707 low = TREE_INT_CST_LOW (expr);
1709 /* First clear all bits that are beyond the type's precision in case
1710 we've been sign extended. */
1712 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1714 else if (prec > HOST_BITS_PER_WIDE_INT)
1715 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1719 if (prec < HOST_BITS_PER_WIDE_INT)
1720 low &= ~((HOST_WIDE_INT) (-1) << prec);
1723 if (high == 0 && low == 0)
1726 return ((high == 0 && (low & (low - 1)) == 0)
1727 || (low == 0 && (high & (high - 1)) == 0));
1730 /* Return 1 if EXPR is an integer constant other than zero or a
1731 complex constant other than zero. */
1734 integer_nonzerop (const_tree expr)
1738 return ((TREE_CODE (expr) == INTEGER_CST
1739 && (TREE_INT_CST_LOW (expr) != 0
1740 || TREE_INT_CST_HIGH (expr) != 0))
1741 || (TREE_CODE (expr) == COMPLEX_CST
1742 && (integer_nonzerop (TREE_REALPART (expr))
1743 || integer_nonzerop (TREE_IMAGPART (expr)))));
1746 /* Return 1 if EXPR is the fixed-point constant zero. */
1749 fixed_zerop (const_tree expr)
1751 return (TREE_CODE (expr) == FIXED_CST
1752 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1755 /* Return the power of two represented by a tree node known to be a
1759 tree_log2 (const_tree expr)
1762 HOST_WIDE_INT high, low;
1766 if (TREE_CODE (expr) == COMPLEX_CST)
1767 return tree_log2 (TREE_REALPART (expr));
1769 prec = TYPE_PRECISION (TREE_TYPE (expr));
1770 high = TREE_INT_CST_HIGH (expr);
1771 low = TREE_INT_CST_LOW (expr);
1773 /* First clear all bits that are beyond the type's precision in case
1774 we've been sign extended. */
1776 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1778 else if (prec > HOST_BITS_PER_WIDE_INT)
1779 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1783 if (prec < HOST_BITS_PER_WIDE_INT)
1784 low &= ~((HOST_WIDE_INT) (-1) << prec);
1787 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1788 : exact_log2 (low));
1791 /* Similar, but return the largest integer Y such that 2 ** Y is less
1792 than or equal to EXPR. */
1795 tree_floor_log2 (const_tree expr)
1798 HOST_WIDE_INT high, low;
1802 if (TREE_CODE (expr) == COMPLEX_CST)
1803 return tree_log2 (TREE_REALPART (expr));
1805 prec = TYPE_PRECISION (TREE_TYPE (expr));
1806 high = TREE_INT_CST_HIGH (expr);
1807 low = TREE_INT_CST_LOW (expr);
1809 /* First clear all bits that are beyond the type's precision in case
1810 we've been sign extended. Ignore if type's precision hasn't been set
1811 since what we are doing is setting it. */
1813 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1815 else if (prec > HOST_BITS_PER_WIDE_INT)
1816 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1820 if (prec < HOST_BITS_PER_WIDE_INT)
1821 low &= ~((HOST_WIDE_INT) (-1) << prec);
1824 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1825 : floor_log2 (low));
1828 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1829 decimal float constants, so don't return 1 for them. */
1832 real_zerop (const_tree expr)
1836 return ((TREE_CODE (expr) == REAL_CST
1837 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1838 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1839 || (TREE_CODE (expr) == COMPLEX_CST
1840 && real_zerop (TREE_REALPART (expr))
1841 && real_zerop (TREE_IMAGPART (expr))));
1844 /* Return 1 if EXPR is the real constant one in real or complex form.
1845 Trailing zeroes matter for decimal float constants, so don't return
1849 real_onep (const_tree expr)
1853 return ((TREE_CODE (expr) == REAL_CST
1854 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1855 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1856 || (TREE_CODE (expr) == COMPLEX_CST
1857 && real_onep (TREE_REALPART (expr))
1858 && real_zerop (TREE_IMAGPART (expr))));
1861 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1862 for decimal float constants, so don't return 1 for them. */
1865 real_twop (const_tree expr)
1869 return ((TREE_CODE (expr) == REAL_CST
1870 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1871 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1872 || (TREE_CODE (expr) == COMPLEX_CST
1873 && real_twop (TREE_REALPART (expr))
1874 && real_zerop (TREE_IMAGPART (expr))));
1877 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1878 matter for decimal float constants, so don't return 1 for them. */
1881 real_minus_onep (const_tree expr)
1885 return ((TREE_CODE (expr) == REAL_CST
1886 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1887 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1888 || (TREE_CODE (expr) == COMPLEX_CST
1889 && real_minus_onep (TREE_REALPART (expr))
1890 && real_zerop (TREE_IMAGPART (expr))));
1893 /* Nonzero if EXP is a constant or a cast of a constant. */
1896 really_constant_p (const_tree exp)
1898 /* This is not quite the same as STRIP_NOPS. It does more. */
1899 while (CONVERT_EXPR_P (exp)
1900 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1901 exp = TREE_OPERAND (exp, 0);
1902 return TREE_CONSTANT (exp);
1905 /* Return first list element whose TREE_VALUE is ELEM.
1906 Return 0 if ELEM is not in LIST. */
1909 value_member (tree elem, tree list)
1913 if (elem == TREE_VALUE (list))
1915 list = TREE_CHAIN (list);
1920 /* Return first list element whose TREE_PURPOSE is ELEM.
1921 Return 0 if ELEM is not in LIST. */
1924 purpose_member (const_tree elem, tree list)
1928 if (elem == TREE_PURPOSE (list))
1930 list = TREE_CHAIN (list);
1935 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1939 chain_index (int idx, tree chain)
1941 for (; chain && idx > 0; --idx)
1942 chain = TREE_CHAIN (chain);
1946 /* Return nonzero if ELEM is part of the chain CHAIN. */
1949 chain_member (const_tree elem, const_tree chain)
1955 chain = TREE_CHAIN (chain);
1961 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1962 We expect a null pointer to mark the end of the chain.
1963 This is the Lisp primitive `length'. */
1966 list_length (const_tree t)
1969 #ifdef ENABLE_TREE_CHECKING
1977 #ifdef ENABLE_TREE_CHECKING
1980 gcc_assert (p != q);
1988 /* Returns the number of FIELD_DECLs in TYPE. */
1991 fields_length (const_tree type)
1993 tree t = TYPE_FIELDS (type);
1996 for (; t; t = TREE_CHAIN (t))
1997 if (TREE_CODE (t) == FIELD_DECL)
2003 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2004 UNION_TYPE TYPE, or NULL_TREE if none. */
2007 first_field (const_tree type)
2009 tree t = TYPE_FIELDS (type);
2010 while (t && TREE_CODE (t) != FIELD_DECL)
2015 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2016 by modifying the last node in chain 1 to point to chain 2.
2017 This is the Lisp primitive `nconc'. */
2020 chainon (tree op1, tree op2)
2029 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2031 TREE_CHAIN (t1) = op2;
2033 #ifdef ENABLE_TREE_CHECKING
2036 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2037 gcc_assert (t2 != t1);
2044 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2047 tree_last (tree chain)
2051 while ((next = TREE_CHAIN (chain)))
2056 /* Reverse the order of elements in the chain T,
2057 and return the new head of the chain (old last element). */
2062 tree prev = 0, decl, next;
2063 for (decl = t; decl; decl = next)
2065 next = TREE_CHAIN (decl);
2066 TREE_CHAIN (decl) = prev;
2072 /* Return a newly created TREE_LIST node whose
2073 purpose and value fields are PARM and VALUE. */
2076 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2078 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2079 TREE_PURPOSE (t) = parm;
2080 TREE_VALUE (t) = value;
2084 /* Build a chain of TREE_LIST nodes from a vector. */
2087 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2089 tree ret = NULL_TREE;
2093 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2095 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2096 pp = &TREE_CHAIN (*pp);
2101 /* Return a newly created TREE_LIST node whose
2102 purpose and value fields are PURPOSE and VALUE
2103 and whose TREE_CHAIN is CHAIN. */
2106 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2110 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2112 memset (node, 0, sizeof (struct tree_common));
2114 #ifdef GATHER_STATISTICS
2115 tree_node_counts[(int) x_kind]++;
2116 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2119 TREE_SET_CODE (node, TREE_LIST);
2120 TREE_CHAIN (node) = chain;
2121 TREE_PURPOSE (node) = purpose;
2122 TREE_VALUE (node) = value;
2126 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2129 ctor_to_list (tree ctor)
2131 tree list = NULL_TREE;
2136 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2138 *p = build_tree_list (purpose, val);
2139 p = &TREE_CHAIN (*p);
2145 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2149 ctor_to_vec (tree ctor)
2151 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2155 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2156 VEC_quick_push (tree, vec, val);
2161 /* Return the size nominally occupied by an object of type TYPE
2162 when it resides in memory. The value is measured in units of bytes,
2163 and its data type is that normally used for type sizes
2164 (which is the first type created by make_signed_type or
2165 make_unsigned_type). */
2168 size_in_bytes (const_tree type)
2172 if (type == error_mark_node)
2173 return integer_zero_node;
2175 type = TYPE_MAIN_VARIANT (type);
2176 t = TYPE_SIZE_UNIT (type);
2180 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2181 return size_zero_node;
2187 /* Return the size of TYPE (in bytes) as a wide integer
2188 or return -1 if the size can vary or is larger than an integer. */
2191 int_size_in_bytes (const_tree type)
2195 if (type == error_mark_node)
2198 type = TYPE_MAIN_VARIANT (type);
2199 t = TYPE_SIZE_UNIT (type);
2201 || TREE_CODE (t) != INTEGER_CST
2202 || TREE_INT_CST_HIGH (t) != 0
2203 /* If the result would appear negative, it's too big to represent. */
2204 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2207 return TREE_INT_CST_LOW (t);
2210 /* Return the maximum size of TYPE (in bytes) as a wide integer
2211 or return -1 if the size can vary or is larger than an integer. */
2214 max_int_size_in_bytes (const_tree type)
2216 HOST_WIDE_INT size = -1;
2219 /* If this is an array type, check for a possible MAX_SIZE attached. */
2221 if (TREE_CODE (type) == ARRAY_TYPE)
2223 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2225 if (size_tree && host_integerp (size_tree, 1))
2226 size = tree_low_cst (size_tree, 1);
2229 /* If we still haven't been able to get a size, see if the language
2230 can compute a maximum size. */
2234 size_tree = lang_hooks.types.max_size (type);
2236 if (size_tree && host_integerp (size_tree, 1))
2237 size = tree_low_cst (size_tree, 1);
2243 /* Returns a tree for the size of EXP in bytes. */
2246 tree_expr_size (const_tree exp)
2249 && DECL_SIZE_UNIT (exp) != 0)
2250 return DECL_SIZE_UNIT (exp);
2252 return size_in_bytes (TREE_TYPE (exp));
2255 /* Return the bit position of FIELD, in bits from the start of the record.
2256 This is a tree of type bitsizetype. */
2259 bit_position (const_tree field)
2261 return bit_from_pos (DECL_FIELD_OFFSET (field),
2262 DECL_FIELD_BIT_OFFSET (field));
2265 /* Likewise, but return as an integer. It must be representable in
2266 that way (since it could be a signed value, we don't have the
2267 option of returning -1 like int_size_in_byte can. */
2270 int_bit_position (const_tree field)
2272 return tree_low_cst (bit_position (field), 0);
2275 /* Return the byte position of FIELD, in bytes from the start of the record.
2276 This is a tree of type sizetype. */
2279 byte_position (const_tree field)
2281 return byte_from_pos (DECL_FIELD_OFFSET (field),
2282 DECL_FIELD_BIT_OFFSET (field));
2285 /* Likewise, but return as an integer. It must be representable in
2286 that way (since it could be a signed value, we don't have the
2287 option of returning -1 like int_size_in_byte can. */
2290 int_byte_position (const_tree field)
2292 return tree_low_cst (byte_position (field), 0);
2295 /* Return the strictest alignment, in bits, that T is known to have. */
2298 expr_align (const_tree t)
2300 unsigned int align0, align1;
2302 switch (TREE_CODE (t))
2304 CASE_CONVERT: case NON_LVALUE_EXPR:
2305 /* If we have conversions, we know that the alignment of the
2306 object must meet each of the alignments of the types. */
2307 align0 = expr_align (TREE_OPERAND (t, 0));
2308 align1 = TYPE_ALIGN (TREE_TYPE (t));
2309 return MAX (align0, align1);
2311 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2312 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2313 case CLEANUP_POINT_EXPR:
2314 /* These don't change the alignment of an object. */
2315 return expr_align (TREE_OPERAND (t, 0));
2318 /* The best we can do is say that the alignment is the least aligned
2320 align0 = expr_align (TREE_OPERAND (t, 1));
2321 align1 = expr_align (TREE_OPERAND (t, 2));
2322 return MIN (align0, align1);
2324 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2325 meaningfully, it's always 1. */
2326 case LABEL_DECL: case CONST_DECL:
2327 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2329 gcc_assert (DECL_ALIGN (t) != 0);
2330 return DECL_ALIGN (t);
2336 /* Otherwise take the alignment from that of the type. */
2337 return TYPE_ALIGN (TREE_TYPE (t));
2340 /* Return, as a tree node, the number of elements for TYPE (which is an
2341 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2344 array_type_nelts (const_tree type)
2346 tree index_type, min, max;
2348 /* If they did it with unspecified bounds, then we should have already
2349 given an error about it before we got here. */
2350 if (! TYPE_DOMAIN (type))
2351 return error_mark_node;
2353 index_type = TYPE_DOMAIN (type);
2354 min = TYPE_MIN_VALUE (index_type);
2355 max = TYPE_MAX_VALUE (index_type);
2357 return (integer_zerop (min)
2359 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2362 /* If arg is static -- a reference to an object in static storage -- then
2363 return the object. This is not the same as the C meaning of `static'.
2364 If arg isn't static, return NULL. */
2369 switch (TREE_CODE (arg))
2372 /* Nested functions are static, even though taking their address will
2373 involve a trampoline as we unnest the nested function and create
2374 the trampoline on the tree level. */
2378 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2379 && ! DECL_THREAD_LOCAL_P (arg)
2380 && ! DECL_DLLIMPORT_P (arg)
2384 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2388 return TREE_STATIC (arg) ? arg : NULL;
2395 /* If the thing being referenced is not a field, then it is
2396 something language specific. */
2397 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2399 /* If we are referencing a bitfield, we can't evaluate an
2400 ADDR_EXPR at compile time and so it isn't a constant. */
2401 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2404 return staticp (TREE_OPERAND (arg, 0));
2409 case MISALIGNED_INDIRECT_REF:
2410 case ALIGN_INDIRECT_REF:
2412 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2415 case ARRAY_RANGE_REF:
2416 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2417 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2418 return staticp (TREE_OPERAND (arg, 0));
2422 case COMPOUND_LITERAL_EXPR:
2423 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2433 /* Return whether OP is a DECL whose address is function-invariant. */
2436 decl_address_invariant_p (const_tree op)
2438 /* The conditions below are slightly less strict than the one in
2441 switch (TREE_CODE (op))
2450 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2451 && !DECL_DLLIMPORT_P (op))
2452 || DECL_THREAD_LOCAL_P (op)
2453 || DECL_CONTEXT (op) == current_function_decl
2454 || decl_function_context (op) == current_function_decl)
2459 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2460 || decl_function_context (op) == current_function_decl)
2471 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2474 decl_address_ip_invariant_p (const_tree op)
2476 /* The conditions below are slightly less strict than the one in
2479 switch (TREE_CODE (op))
2487 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2488 && !DECL_DLLIMPORT_P (op))
2489 || DECL_THREAD_LOCAL_P (op))
2494 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2506 /* Return true if T is function-invariant (internal function, does
2507 not handle arithmetic; that's handled in skip_simple_arithmetic and
2508 tree_invariant_p). */
2510 static bool tree_invariant_p (tree t);
2513 tree_invariant_p_1 (tree t)
2517 if (TREE_CONSTANT (t)
2518 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2521 switch (TREE_CODE (t))
2527 op = TREE_OPERAND (t, 0);
2528 while (handled_component_p (op))
2530 switch (TREE_CODE (op))
2533 case ARRAY_RANGE_REF:
2534 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2535 || TREE_OPERAND (op, 2) != NULL_TREE
2536 || TREE_OPERAND (op, 3) != NULL_TREE)
2541 if (TREE_OPERAND (op, 2) != NULL_TREE)
2547 op = TREE_OPERAND (op, 0);
2550 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2559 /* Return true if T is function-invariant. */
2562 tree_invariant_p (tree t)
2564 tree inner = skip_simple_arithmetic (t);
2565 return tree_invariant_p_1 (inner);
2568 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2569 Do this to any expression which may be used in more than one place,
2570 but must be evaluated only once.
2572 Normally, expand_expr would reevaluate the expression each time.
2573 Calling save_expr produces something that is evaluated and recorded
2574 the first time expand_expr is called on it. Subsequent calls to
2575 expand_expr just reuse the recorded value.
2577 The call to expand_expr that generates code that actually computes
2578 the value is the first call *at compile time*. Subsequent calls
2579 *at compile time* generate code to use the saved value.
2580 This produces correct result provided that *at run time* control
2581 always flows through the insns made by the first expand_expr
2582 before reaching the other places where the save_expr was evaluated.
2583 You, the caller of save_expr, must make sure this is so.
2585 Constants, and certain read-only nodes, are returned with no
2586 SAVE_EXPR because that is safe. Expressions containing placeholders
2587 are not touched; see tree.def for an explanation of what these
2591 save_expr (tree expr)
2593 tree t = fold (expr);
2596 /* If the tree evaluates to a constant, then we don't want to hide that
2597 fact (i.e. this allows further folding, and direct checks for constants).
2598 However, a read-only object that has side effects cannot be bypassed.
2599 Since it is no problem to reevaluate literals, we just return the
2601 inner = skip_simple_arithmetic (t);
2602 if (TREE_CODE (inner) == ERROR_MARK)
2605 if (tree_invariant_p_1 (inner))
2608 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2609 it means that the size or offset of some field of an object depends on
2610 the value within another field.
2612 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2613 and some variable since it would then need to be both evaluated once and
2614 evaluated more than once. Front-ends must assure this case cannot
2615 happen by surrounding any such subexpressions in their own SAVE_EXPR
2616 and forcing evaluation at the proper time. */
2617 if (contains_placeholder_p (inner))
2620 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2621 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2623 /* This expression might be placed ahead of a jump to ensure that the
2624 value was computed on both sides of the jump. So make sure it isn't
2625 eliminated as dead. */
2626 TREE_SIDE_EFFECTS (t) = 1;
2630 /* Look inside EXPR and into any simple arithmetic operations. Return
2631 the innermost non-arithmetic node. */
2634 skip_simple_arithmetic (tree expr)
2638 /* We don't care about whether this can be used as an lvalue in this
2640 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2641 expr = TREE_OPERAND (expr, 0);
2643 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2644 a constant, it will be more efficient to not make another SAVE_EXPR since
2645 it will allow better simplification and GCSE will be able to merge the
2646 computations if they actually occur. */
2650 if (UNARY_CLASS_P (inner))
2651 inner = TREE_OPERAND (inner, 0);
2652 else if (BINARY_CLASS_P (inner))
2654 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2655 inner = TREE_OPERAND (inner, 0);
2656 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2657 inner = TREE_OPERAND (inner, 1);
2669 /* Return which tree structure is used by T. */
2671 enum tree_node_structure_enum
2672 tree_node_structure (const_tree t)
2674 const enum tree_code code = TREE_CODE (t);
2675 return tree_node_structure_for_code (code);
2678 /* Set various status flags when building a CALL_EXPR object T. */
2681 process_call_operands (tree t)
2683 bool side_effects = TREE_SIDE_EFFECTS (t);
2684 bool read_only = false;
2685 int i = call_expr_flags (t);
2687 /* Calls have side-effects, except those to const or pure functions. */
2688 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2689 side_effects = true;
2690 /* Propagate TREE_READONLY of arguments for const functions. */
2694 if (!side_effects || read_only)
2695 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2697 tree op = TREE_OPERAND (t, i);
2698 if (op && TREE_SIDE_EFFECTS (op))
2699 side_effects = true;
2700 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2704 TREE_SIDE_EFFECTS (t) = side_effects;
2705 TREE_READONLY (t) = read_only;
2708 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2709 or offset that depends on a field within a record. */
2712 contains_placeholder_p (const_tree exp)
2714 enum tree_code code;
2719 code = TREE_CODE (exp);
2720 if (code == PLACEHOLDER_EXPR)
2723 switch (TREE_CODE_CLASS (code))
2726 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2727 position computations since they will be converted into a
2728 WITH_RECORD_EXPR involving the reference, which will assume
2729 here will be valid. */
2730 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2732 case tcc_exceptional:
2733 if (code == TREE_LIST)
2734 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2735 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2740 case tcc_comparison:
2741 case tcc_expression:
2745 /* Ignoring the first operand isn't quite right, but works best. */
2746 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2749 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2750 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2751 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2754 /* The save_expr function never wraps anything containing
2755 a PLACEHOLDER_EXPR. */
2762 switch (TREE_CODE_LENGTH (code))
2765 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2767 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2768 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2779 const_call_expr_arg_iterator iter;
2780 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2781 if (CONTAINS_PLACEHOLDER_P (arg))
2795 /* Return true if any part of the computation of TYPE involves a
2796 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2797 (for QUAL_UNION_TYPE) and field positions. */
2800 type_contains_placeholder_1 (const_tree type)
2802 /* If the size contains a placeholder or the parent type (component type in
2803 the case of arrays) type involves a placeholder, this type does. */
2804 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2805 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2806 || (TREE_TYPE (type) != 0
2807 && type_contains_placeholder_p (TREE_TYPE (type))))
2810 /* Now do type-specific checks. Note that the last part of the check above
2811 greatly limits what we have to do below. */
2812 switch (TREE_CODE (type))
2820 case REFERENCE_TYPE:
2828 case FIXED_POINT_TYPE:
2829 /* Here we just check the bounds. */
2830 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2831 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2834 /* We're already checked the component type (TREE_TYPE), so just check
2836 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2840 case QUAL_UNION_TYPE:
2844 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2845 if (TREE_CODE (field) == FIELD_DECL
2846 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2847 || (TREE_CODE (type) == QUAL_UNION_TYPE
2848 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2849 || type_contains_placeholder_p (TREE_TYPE (field))))
2861 type_contains_placeholder_p (tree type)
2865 /* If the contains_placeholder_bits field has been initialized,
2866 then we know the answer. */
2867 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2868 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2870 /* Indicate that we've seen this type node, and the answer is false.
2871 This is what we want to return if we run into recursion via fields. */
2872 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2874 /* Compute the real value. */
2875 result = type_contains_placeholder_1 (type);
2877 /* Store the real value. */
2878 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2883 /* Push tree EXP onto vector QUEUE if it is not already present. */
2886 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2891 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2892 if (simple_cst_equal (iter, exp) == 1)
2896 VEC_safe_push (tree, heap, *queue, exp);
2899 /* Given a tree EXP, find all occurences of references to fields
2900 in a PLACEHOLDER_EXPR and place them in vector REFS without
2901 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2902 we assume here that EXP contains only arithmetic expressions
2903 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2907 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2909 enum tree_code code = TREE_CODE (exp);
2913 /* We handle TREE_LIST and COMPONENT_REF separately. */
2914 if (code == TREE_LIST)
2916 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2917 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2919 else if (code == COMPONENT_REF)
2921 for (inner = TREE_OPERAND (exp, 0);
2922 REFERENCE_CLASS_P (inner);
2923 inner = TREE_OPERAND (inner, 0))
2926 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2927 push_without_duplicates (exp, refs);
2929 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2932 switch (TREE_CODE_CLASS (code))
2937 case tcc_declaration:
2938 /* Variables allocated to static storage can stay. */
2939 if (!TREE_STATIC (exp))
2940 push_without_duplicates (exp, refs);
2943 case tcc_expression:
2944 /* This is the pattern built in ada/make_aligning_type. */
2945 if (code == ADDR_EXPR
2946 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2948 push_without_duplicates (exp, refs);
2952 /* Fall through... */
2954 case tcc_exceptional:
2957 case tcc_comparison:
2959 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2960 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2964 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2965 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2973 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2974 return a tree with all occurrences of references to F in a
2975 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2976 CONST_DECLs. Note that we assume here that EXP contains only
2977 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2978 occurring only in their argument list. */
2981 substitute_in_expr (tree exp, tree f, tree r)
2983 enum tree_code code = TREE_CODE (exp);
2984 tree op0, op1, op2, op3;
2987 /* We handle TREE_LIST and COMPONENT_REF separately. */
2988 if (code == TREE_LIST)
2990 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2991 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2992 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2995 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2997 else if (code == COMPONENT_REF)
3001 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3002 and it is the right field, replace it with R. */
3003 for (inner = TREE_OPERAND (exp, 0);
3004 REFERENCE_CLASS_P (inner);
3005 inner = TREE_OPERAND (inner, 0))
3009 op1 = TREE_OPERAND (exp, 1);
3011 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3014 /* If this expression hasn't been completed let, leave it alone. */
3015 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3018 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3019 if (op0 == TREE_OPERAND (exp, 0))
3023 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3026 switch (TREE_CODE_CLASS (code))
3031 case tcc_declaration:
3037 case tcc_expression:
3041 /* Fall through... */
3043 case tcc_exceptional:
3046 case tcc_comparison:
3048 switch (TREE_CODE_LENGTH (code))
3054 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3055 if (op0 == TREE_OPERAND (exp, 0))
3058 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3062 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3063 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3065 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3068 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3072 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3073 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3074 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3076 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3077 && op2 == TREE_OPERAND (exp, 2))
3080 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3084 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3085 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3086 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3087 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3089 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3090 && op2 == TREE_OPERAND (exp, 2)
3091 && op3 == TREE_OPERAND (exp, 3))
3095 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3107 new_tree = NULL_TREE;
3109 /* If we are trying to replace F with a constant, inline back
3110 functions which do nothing else than computing a value from
3111 the arguments they are passed. This makes it possible to
3112 fold partially or entirely the replacement expression. */
3113 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3115 tree t = maybe_inline_call_in_expr (exp);
3117 return SUBSTITUTE_IN_EXPR (t, f, r);
3120 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3122 tree op = TREE_OPERAND (exp, i);
3123 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3127 new_tree = copy_node (exp);
3128 TREE_OPERAND (new_tree, i) = new_op;
3134 new_tree = fold (new_tree);
3135 if (TREE_CODE (new_tree) == CALL_EXPR)
3136 process_call_operands (new_tree);
3147 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3151 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3152 for it within OBJ, a tree that is an object or a chain of references. */
3155 substitute_placeholder_in_expr (tree exp, tree obj)
3157 enum tree_code code = TREE_CODE (exp);
3158 tree op0, op1, op2, op3;
3161 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3162 in the chain of OBJ. */
3163 if (code == PLACEHOLDER_EXPR)
3165 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3168 for (elt = obj; elt != 0;
3169 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3170 || TREE_CODE (elt) == COND_EXPR)
3171 ? TREE_OPERAND (elt, 1)
3172 : (REFERENCE_CLASS_P (elt)
3173 || UNARY_CLASS_P (elt)
3174 || BINARY_CLASS_P (elt)
3175 || VL_EXP_CLASS_P (elt)
3176 || EXPRESSION_CLASS_P (elt))
3177 ? TREE_OPERAND (elt, 0) : 0))
3178 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3181 for (elt = obj; elt != 0;
3182 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3183 || TREE_CODE (elt) == COND_EXPR)
3184 ? TREE_OPERAND (elt, 1)
3185 : (REFERENCE_CLASS_P (elt)
3186 || UNARY_CLASS_P (elt)
3187 || BINARY_CLASS_P (elt)
3188 || VL_EXP_CLASS_P (elt)
3189 || EXPRESSION_CLASS_P (elt))
3190 ? TREE_OPERAND (elt, 0) : 0))
3191 if (POINTER_TYPE_P (TREE_TYPE (elt))
3192 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3194 return fold_build1 (INDIRECT_REF, need_type, elt);
3196 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3197 survives until RTL generation, there will be an error. */
3201 /* TREE_LIST is special because we need to look at TREE_VALUE
3202 and TREE_CHAIN, not TREE_OPERANDS. */
3203 else if (code == TREE_LIST)
3205 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3206 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3207 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3210 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3213 switch (TREE_CODE_CLASS (code))
3216 case tcc_declaration:
3219 case tcc_exceptional:
3222 case tcc_comparison:
3223 case tcc_expression:
3226 switch (TREE_CODE_LENGTH (code))
3232 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3233 if (op0 == TREE_OPERAND (exp, 0))
3236 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3240 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3241 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3243 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3246 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3250 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3251 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3252 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3254 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3255 && op2 == TREE_OPERAND (exp, 2))
3258 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3262 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3263 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3264 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3265 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3267 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3268 && op2 == TREE_OPERAND (exp, 2)
3269 && op3 == TREE_OPERAND (exp, 3))
3273 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3285 new_tree = NULL_TREE;
3287 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3289 tree op = TREE_OPERAND (exp, i);
3290 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3294 new_tree = copy_node (exp);
3295 TREE_OPERAND (new_tree, i) = new_op;
3301 new_tree = fold (new_tree);
3302 if (TREE_CODE (new_tree) == CALL_EXPR)
3303 process_call_operands (new_tree);
3314 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3318 /* Stabilize a reference so that we can use it any number of times
3319 without causing its operands to be evaluated more than once.
3320 Returns the stabilized reference. This works by means of save_expr,
3321 so see the caveats in the comments about save_expr.
3323 Also allows conversion expressions whose operands are references.
3324 Any other kind of expression is returned unchanged. */
3327 stabilize_reference (tree ref)
3330 enum tree_code code = TREE_CODE (ref);
3337 /* No action is needed in this case. */
3342 case FIX_TRUNC_EXPR:
3343 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3347 result = build_nt (INDIRECT_REF,
3348 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3352 result = build_nt (COMPONENT_REF,
3353 stabilize_reference (TREE_OPERAND (ref, 0)),
3354 TREE_OPERAND (ref, 1), NULL_TREE);
3358 result = build_nt (BIT_FIELD_REF,
3359 stabilize_reference (TREE_OPERAND (ref, 0)),
3360 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3361 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3365 result = build_nt (ARRAY_REF,
3366 stabilize_reference (TREE_OPERAND (ref, 0)),
3367 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3368 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3371 case ARRAY_RANGE_REF:
3372 result = build_nt (ARRAY_RANGE_REF,
3373 stabilize_reference (TREE_OPERAND (ref, 0)),
3374 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3375 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3379 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3380 it wouldn't be ignored. This matters when dealing with
3382 return stabilize_reference_1 (ref);
3384 /* If arg isn't a kind of lvalue we recognize, make no change.
3385 Caller should recognize the error for an invalid lvalue. */
3390 return error_mark_node;
3393 TREE_TYPE (result) = TREE_TYPE (ref);
3394 TREE_READONLY (result) = TREE_READONLY (ref);
3395 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3396 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3401 /* Subroutine of stabilize_reference; this is called for subtrees of
3402 references. Any expression with side-effects must be put in a SAVE_EXPR
3403 to ensure that it is only evaluated once.
3405 We don't put SAVE_EXPR nodes around everything, because assigning very
3406 simple expressions to temporaries causes us to miss good opportunities
3407 for optimizations. Among other things, the opportunity to fold in the
3408 addition of a constant into an addressing mode often gets lost, e.g.
3409 "y[i+1] += x;". In general, we take the approach that we should not make
3410 an assignment unless we are forced into it - i.e., that any non-side effect
3411 operator should be allowed, and that cse should take care of coalescing
3412 multiple utterances of the same expression should that prove fruitful. */
3415 stabilize_reference_1 (tree e)
3418 enum tree_code code = TREE_CODE (e);
3420 /* We cannot ignore const expressions because it might be a reference
3421 to a const array but whose index contains side-effects. But we can
3422 ignore things that are actual constant or that already have been
3423 handled by this function. */
3425 if (tree_invariant_p (e))
3428 switch (TREE_CODE_CLASS (code))
3430 case tcc_exceptional:
3432 case tcc_declaration:
3433 case tcc_comparison:
3435 case tcc_expression:
3438 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3439 so that it will only be evaluated once. */
3440 /* The reference (r) and comparison (<) classes could be handled as
3441 below, but it is generally faster to only evaluate them once. */
3442 if (TREE_SIDE_EFFECTS (e))
3443 return save_expr (e);
3447 /* Constants need no processing. In fact, we should never reach
3452 /* Division is slow and tends to be compiled with jumps,
3453 especially the division by powers of 2 that is often
3454 found inside of an array reference. So do it just once. */
3455 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3456 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3457 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3458 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3459 return save_expr (e);
3460 /* Recursively stabilize each operand. */
3461 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3462 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3466 /* Recursively stabilize each operand. */
3467 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3474 TREE_TYPE (result) = TREE_TYPE (e);
3475 TREE_READONLY (result) = TREE_READONLY (e);
3476 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3477 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3482 /* Low-level constructors for expressions. */
3484 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3485 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3488 recompute_tree_invariant_for_addr_expr (tree t)
3491 bool tc = true, se = false;
3493 /* We started out assuming this address is both invariant and constant, but
3494 does not have side effects. Now go down any handled components and see if
3495 any of them involve offsets that are either non-constant or non-invariant.
3496 Also check for side-effects.
3498 ??? Note that this code makes no attempt to deal with the case where
3499 taking the address of something causes a copy due to misalignment. */
3501 #define UPDATE_FLAGS(NODE) \
3502 do { tree _node = (NODE); \
3503 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3504 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3506 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3507 node = TREE_OPERAND (node, 0))
3509 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3510 array reference (probably made temporarily by the G++ front end),
3511 so ignore all the operands. */
3512 if ((TREE_CODE (node) == ARRAY_REF
3513 || TREE_CODE (node) == ARRAY_RANGE_REF)
3514 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3516 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3517 if (TREE_OPERAND (node, 2))
3518 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3519 if (TREE_OPERAND (node, 3))
3520 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3522 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3523 FIELD_DECL, apparently. The G++ front end can put something else
3524 there, at least temporarily. */
3525 else if (TREE_CODE (node) == COMPONENT_REF
3526 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3528 if (TREE_OPERAND (node, 2))
3529 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3531 else if (TREE_CODE (node) == BIT_FIELD_REF)
3532 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3535 node = lang_hooks.expr_to_decl (node, &tc, &se);
3537 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3538 the address, since &(*a)->b is a form of addition. If it's a constant, the
3539 address is constant too. If it's a decl, its address is constant if the
3540 decl is static. Everything else is not constant and, furthermore,
3541 taking the address of a volatile variable is not volatile. */
3542 if (TREE_CODE (node) == INDIRECT_REF)
3543 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3544 else if (CONSTANT_CLASS_P (node))
3546 else if (DECL_P (node))
3547 tc &= (staticp (node) != NULL_TREE);
3551 se |= TREE_SIDE_EFFECTS (node);
3555 TREE_CONSTANT (t) = tc;
3556 TREE_SIDE_EFFECTS (t) = se;
3560 /* Build an expression of code CODE, data type TYPE, and operands as
3561 specified. Expressions and reference nodes can be created this way.
3562 Constants, decls, types and misc nodes cannot be.
3564 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3565 enough for all extant tree codes. */
3568 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3572 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3574 t = make_node_stat (code PASS_MEM_STAT);
3581 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3583 int length = sizeof (struct tree_exp);
3584 #ifdef GATHER_STATISTICS
3585 tree_node_kind kind;
3589 #ifdef GATHER_STATISTICS
3590 switch (TREE_CODE_CLASS (code))
3592 case tcc_statement: /* an expression with side effects */
3595 case tcc_reference: /* a reference */
3603 tree_node_counts[(int) kind]++;
3604 tree_node_sizes[(int) kind] += length;
3607 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3609 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3611 memset (t, 0, sizeof (struct tree_common));
3613 TREE_SET_CODE (t, code);
3615 TREE_TYPE (t) = type;
3616 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3617 TREE_OPERAND (t, 0) = node;
3618 TREE_BLOCK (t) = NULL_TREE;
3619 if (node && !TYPE_P (node))
3621 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3622 TREE_READONLY (t) = TREE_READONLY (node);
3625 if (TREE_CODE_CLASS (code) == tcc_statement)
3626 TREE_SIDE_EFFECTS (t) = 1;
3630 /* All of these have side-effects, no matter what their
3632 TREE_SIDE_EFFECTS (t) = 1;
3633 TREE_READONLY (t) = 0;
3636 case MISALIGNED_INDIRECT_REF:
3637 case ALIGN_INDIRECT_REF:
3639 /* Whether a dereference is readonly has nothing to do with whether
3640 its operand is readonly. */
3641 TREE_READONLY (t) = 0;
3646 recompute_tree_invariant_for_addr_expr (t);
3650 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3651 && node && !TYPE_P (node)
3652 && TREE_CONSTANT (node))
3653 TREE_CONSTANT (t) = 1;
3654 if (TREE_CODE_CLASS (code) == tcc_reference
3655 && node && TREE_THIS_VOLATILE (node))
3656 TREE_THIS_VOLATILE (t) = 1;
3663 #define PROCESS_ARG(N) \
3665 TREE_OPERAND (t, N) = arg##N; \
3666 if (arg##N &&!TYPE_P (arg##N)) \
3668 if (TREE_SIDE_EFFECTS (arg##N)) \
3670 if (!TREE_READONLY (arg##N) \
3671 && !CONSTANT_CLASS_P (arg##N)) \
3672 (void) (read_only = 0); \
3673 if (!TREE_CONSTANT (arg##N)) \
3674 (void) (constant = 0); \
3679 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3681 bool constant, read_only, side_effects;
3684 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3686 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3687 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3688 /* When sizetype precision doesn't match that of pointers
3689 we need to be able to build explicit extensions or truncations
3690 of the offset argument. */
3691 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3692 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3693 && TREE_CODE (arg1) == INTEGER_CST);
3695 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3696 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3697 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3698 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3700 t = make_node_stat (code PASS_MEM_STAT);
3703 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3704 result based on those same flags for the arguments. But if the
3705 arguments aren't really even `tree' expressions, we shouldn't be trying
3708 /* Expressions without side effects may be constant if their
3709 arguments are as well. */
3710 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3711 || TREE_CODE_CLASS (code) == tcc_binary);
3713 side_effects = TREE_SIDE_EFFECTS (t);
3718 TREE_READONLY (t) = read_only;
3719 TREE_CONSTANT (t) = constant;
3720 TREE_SIDE_EFFECTS (t) = side_effects;
3721 TREE_THIS_VOLATILE (t)
3722 = (TREE_CODE_CLASS (code) == tcc_reference
3723 && arg0 && TREE_THIS_VOLATILE (arg0));
3730 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3731 tree arg2 MEM_STAT_DECL)
3733 bool constant, read_only, side_effects;
3736 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3737 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3739 t = make_node_stat (code PASS_MEM_STAT);
3744 /* As a special exception, if COND_EXPR has NULL branches, we
3745 assume that it is a gimple statement and always consider
3746 it to have side effects. */
3747 if (code == COND_EXPR
3748 && tt == void_type_node
3749 && arg1 == NULL_TREE
3750 && arg2 == NULL_TREE)
3751 side_effects = true;
3753 side_effects = TREE_SIDE_EFFECTS (t);
3759 if (code == COND_EXPR)
3760 TREE_READONLY (t) = read_only;
3762 TREE_SIDE_EFFECTS (t) = side_effects;
3763 TREE_THIS_VOLATILE (t)
3764 = (TREE_CODE_CLASS (code) == tcc_reference
3765 && arg0 && TREE_THIS_VOLATILE (arg0));
3771 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3772 tree arg2, tree arg3 MEM_STAT_DECL)
3774 bool constant, read_only, side_effects;
3777 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3779 t = make_node_stat (code PASS_MEM_STAT);
3782 side_effects = TREE_SIDE_EFFECTS (t);
3789 TREE_SIDE_EFFECTS (t) = side_effects;
3790 TREE_THIS_VOLATILE (t)
3791 = (TREE_CODE_CLASS (code) == tcc_reference
3792 && arg0 && TREE_THIS_VOLATILE (arg0));
3798 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3799 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3801 bool constant, read_only, side_effects;
3804 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3806 t = make_node_stat (code PASS_MEM_STAT);
3809 side_effects = TREE_SIDE_EFFECTS (t);
3817 TREE_SIDE_EFFECTS (t) = side_effects;
3818 TREE_THIS_VOLATILE (t)
3819 = (TREE_CODE_CLASS (code) == tcc_reference
3820 && arg0 && TREE_THIS_VOLATILE (arg0));
3826 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3827 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3829 bool constant, read_only, side_effects;
3832 gcc_assert (code == TARGET_MEM_REF);
3834 t = make_node_stat (code PASS_MEM_STAT);
3837 side_effects = TREE_SIDE_EFFECTS (t);
3844 if (code == TARGET_MEM_REF)
3848 TREE_SIDE_EFFECTS (t) = side_effects;
3849 TREE_THIS_VOLATILE (t)
3850 = (code == TARGET_MEM_REF
3851 && arg5 && TREE_THIS_VOLATILE (arg5));
3856 /* Similar except don't specify the TREE_TYPE
3857 and leave the TREE_SIDE_EFFECTS as 0.
3858 It is permissible for arguments to be null,
3859 or even garbage if their values do not matter. */
3862 build_nt (enum tree_code code, ...)
3869 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3873 t = make_node (code);
3874 length = TREE_CODE_LENGTH (code);
3876 for (i = 0; i < length; i++)
3877 TREE_OPERAND (t, i) = va_arg (p, tree);
3883 /* Similar to build_nt, but for creating a CALL_EXPR object with
3884 ARGLIST passed as a list. */
3887 build_nt_call_list (tree fn, tree arglist)
3892 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3893 CALL_EXPR_FN (t) = fn;
3894 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3895 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3896 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3900 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3904 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3909 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3910 CALL_EXPR_FN (ret) = fn;
3911 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3912 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3913 CALL_EXPR_ARG (ret, ix) = t;
3917 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3918 We do NOT enter this node in any sort of symbol table.
3920 LOC is the location of the decl.
3922 layout_decl is used to set up the decl's storage layout.
3923 Other slots are initialized to 0 or null pointers. */
3926 build_decl_stat (location_t loc, enum tree_code code, tree name,
3927 tree type MEM_STAT_DECL)
3931 t = make_node_stat (code PASS_MEM_STAT);
3932 DECL_SOURCE_LOCATION (t) = loc;
3934 /* if (type == error_mark_node)
3935 type = integer_type_node; */
3936 /* That is not done, deliberately, so that having error_mark_node
3937 as the type can suppress useless errors in the use of this variable. */
3939 DECL_NAME (t) = name;
3940 TREE_TYPE (t) = type;
3942 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3948 /* Builds and returns function declaration with NAME and TYPE. */
3951 build_fn_decl (const char *name, tree type)
3953 tree id = get_identifier (name);
3954 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3956 DECL_EXTERNAL (decl) = 1;
3957 TREE_PUBLIC (decl) = 1;
3958 DECL_ARTIFICIAL (decl) = 1;
3959 TREE_NOTHROW (decl) = 1;
3965 /* BLOCK nodes are used to represent the structure of binding contours
3966 and declarations, once those contours have been exited and their contents
3967 compiled. This information is used for outputting debugging info. */
3970 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3972 tree block = make_node (BLOCK);
3974 BLOCK_VARS (block) = vars;
3975 BLOCK_SUBBLOCKS (block) = subblocks;
3976 BLOCK_SUPERCONTEXT (block) = supercontext;
3977 BLOCK_CHAIN (block) = chain;
3982 expand_location (source_location loc)
3984 expanded_location xloc;
3985 if (loc <= BUILTINS_LOCATION)
3987 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3994 const struct line_map *map = linemap_lookup (line_table, loc);
3995 xloc.file = map->to_file;
3996 xloc.line = SOURCE_LINE (map, loc);
3997 xloc.column = SOURCE_COLUMN (map, loc);
3998 xloc.sysp = map->sysp != 0;
4004 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4006 LOC is the location to use in tree T. */
4009 protected_set_expr_location (tree t, location_t loc)
4011 if (t && CAN_HAVE_LOCATION_P (t))
4012 SET_EXPR_LOCATION (t, loc);
4015 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4019 build_decl_attribute_variant (tree ddecl, tree attribute)
4021 DECL_ATTRIBUTES (ddecl) = attribute;
4025 /* Borrowed from hashtab.c iterative_hash implementation. */
4026 #define mix(a,b,c) \
4028 a -= b; a -= c; a ^= (c>>13); \
4029 b -= c; b -= a; b ^= (a<< 8); \
4030 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4031 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4032 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4033 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4034 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4035 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4036 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4040 /* Produce good hash value combining VAL and VAL2. */
4042 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4044 /* the golden ratio; an arbitrary value. */
4045 hashval_t a = 0x9e3779b9;
4051 /* Produce good hash value combining VAL and VAL2. */
4053 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4055 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4056 return iterative_hash_hashval_t (val, val2);
4059 hashval_t a = (hashval_t) val;
4060 /* Avoid warnings about shifting of more than the width of the type on
4061 hosts that won't execute this path. */
4063 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4065 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4067 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4068 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4075 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4076 is ATTRIBUTE and its qualifiers are QUALS.
4078 Record such modified types already made so we don't make duplicates. */
4081 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4083 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4085 hashval_t hashcode = 0;
4087 enum tree_code code = TREE_CODE (ttype);
4089 /* Building a distinct copy of a tagged type is inappropriate; it
4090 causes breakage in code that expects there to be a one-to-one
4091 relationship between a struct and its fields.
4092 build_duplicate_type is another solution (as used in
4093 handle_transparent_union_attribute), but that doesn't play well
4094 with the stronger C++ type identity model. */
4095 if (TREE_CODE (ttype) == RECORD_TYPE
4096 || TREE_CODE (ttype) == UNION_TYPE
4097 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4098 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4100 warning (OPT_Wattributes,
4101 "ignoring attributes applied to %qT after definition",
4102 TYPE_MAIN_VARIANT (ttype));
4103 return build_qualified_type (ttype, quals);
4106 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4107 ntype = build_distinct_type_copy (ttype);
4109 TYPE_ATTRIBUTES (ntype) = attribute;
4111 hashcode = iterative_hash_object (code, hashcode);
4112 if (TREE_TYPE (ntype))
4113 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4115 hashcode = attribute_hash_list (attribute, hashcode);
4117 switch (TREE_CODE (ntype))
4120 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4123 if (TYPE_DOMAIN (ntype))
4124 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4128 hashcode = iterative_hash_object
4129 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4130 hashcode = iterative_hash_object
4131 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4134 case FIXED_POINT_TYPE:
4136 unsigned int precision = TYPE_PRECISION (ntype);
4137 hashcode = iterative_hash_object (precision, hashcode);
4144 ntype = type_hash_canon (hashcode, ntype);
4146 /* If the target-dependent attributes make NTYPE different from
4147 its canonical type, we will need to use structural equality
4148 checks for this type. */
4149 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4150 || !targetm.comp_type_attributes (ntype, ttype))
4151 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4152 else if (TYPE_CANONICAL (ntype) == ntype)
4153 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4155 ttype = build_qualified_type (ntype, quals);
4157 else if (TYPE_QUALS (ttype) != quals)
4158 ttype = build_qualified_type (ttype, quals);
4164 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4167 Record such modified types already made so we don't make duplicates. */
4170 build_type_attribute_variant (tree ttype, tree attribute)
4172 return build_type_attribute_qual_variant (ttype, attribute,
4173 TYPE_QUALS (ttype));
4177 /* Reset all the fields in a binfo node BINFO. We only keep
4178 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4181 free_lang_data_in_binfo (tree binfo)
4186 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4188 BINFO_VTABLE (binfo) = NULL_TREE;
4189 BINFO_BASE_ACCESSES (binfo) = NULL;
4190 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4191 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4193 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4194 free_lang_data_in_binfo (t);
4198 /* Reset all language specific information still present in TYPE. */
4201 free_lang_data_in_type (tree type)
4203 gcc_assert (TYPE_P (type));
4205 /* Give the FE a chance to remove its own data first. */
4206 lang_hooks.free_lang_data (type);
4208 TREE_LANG_FLAG_0 (type) = 0;
4209 TREE_LANG_FLAG_1 (type) = 0;
4210 TREE_LANG_FLAG_2 (type) = 0;
4211 TREE_LANG_FLAG_3 (type) = 0;
4212 TREE_LANG_FLAG_4 (type) = 0;
4213 TREE_LANG_FLAG_5 (type) = 0;
4214 TREE_LANG_FLAG_6 (type) = 0;
4216 if (TREE_CODE (type) == FUNCTION_TYPE)
4218 /* Remove the const and volatile qualifiers from arguments. The
4219 C++ front end removes them, but the C front end does not,
4220 leading to false ODR violation errors when merging two
4221 instances of the same function signature compiled by
4222 different front ends. */
4225 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4227 tree arg_type = TREE_VALUE (p);
4229 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4231 int quals = TYPE_QUALS (arg_type)
4233 & ~TYPE_QUAL_VOLATILE;
4234 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4235 free_lang_data_in_type (TREE_VALUE (p));
4240 /* Remove members that are not actually FIELD_DECLs from the field
4241 list of an aggregate. These occur in C++. */
4242 if (RECORD_OR_UNION_TYPE_P (type))
4246 /* Note that TYPE_FIELDS can be shared across distinct
4247 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4248 to be removed, we cannot set its TREE_CHAIN to NULL.
4249 Otherwise, we would not be able to find all the other fields
4250 in the other instances of this TREE_TYPE.
4252 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4254 member = TYPE_FIELDS (type);
4257 if (TREE_CODE (member) == FIELD_DECL)
4260 TREE_CHAIN (prev) = member;
4262 TYPE_FIELDS (type) = member;
4266 member = TREE_CHAIN (member);
4270 TREE_CHAIN (prev) = NULL_TREE;
4272 TYPE_FIELDS (type) = NULL_TREE;
4274 TYPE_METHODS (type) = NULL_TREE;
4275 if (TYPE_BINFO (type))
4276 free_lang_data_in_binfo (TYPE_BINFO (type));
4280 /* For non-aggregate types, clear out the language slot (which
4281 overloads TYPE_BINFO). */
4282 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4285 if (debug_info_level < DINFO_LEVEL_TERSE
4286 || (TYPE_CONTEXT (type)
4287 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4288 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4289 TYPE_CONTEXT (type) = NULL_TREE;
4291 if (debug_info_level < DINFO_LEVEL_TERSE)
4292 TYPE_STUB_DECL (type) = NULL_TREE;
4296 /* Return true if DECL may need an assembler name to be set. */
4299 need_assembler_name_p (tree decl)
4301 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4302 if (TREE_CODE (decl) != FUNCTION_DECL
4303 && TREE_CODE (decl) != VAR_DECL)
4306 /* If DECL already has its assembler name set, it does not need a
4308 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4309 || DECL_ASSEMBLER_NAME_SET_P (decl))
4312 /* Abstract decls do not need an assembler name. */
4313 if (DECL_ABSTRACT (decl))
4316 /* For VAR_DECLs, only static, public and external symbols need an
4318 if (TREE_CODE (decl) == VAR_DECL
4319 && !TREE_STATIC (decl)
4320 && !TREE_PUBLIC (decl)
4321 && !DECL_EXTERNAL (decl))
4324 if (TREE_CODE (decl) == FUNCTION_DECL)
4326 /* Do not set assembler name on builtins. Allow RTL expansion to
4327 decide whether to expand inline or via a regular call. */
4328 if (DECL_BUILT_IN (decl)
4329 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4332 /* Functions represented in the callgraph need an assembler name. */
4333 if (cgraph_get_node (decl) != NULL)
4336 /* Unused and not public functions don't need an assembler name. */
4337 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4345 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4346 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4347 in BLOCK that is not in LOCALS is removed. */
4350 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4354 tp = &BLOCK_VARS (block);
4357 if (!pointer_set_contains (locals, *tp))
4358 *tp = TREE_CHAIN (*tp);
4360 tp = &TREE_CHAIN (*tp);
4363 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4364 free_lang_data_in_block (fn, t, locals);
4368 /* Reset all language specific information still present in symbol
4372 free_lang_data_in_decl (tree decl)
4374 gcc_assert (DECL_P (decl));
4376 /* Give the FE a chance to remove its own data first. */
4377 lang_hooks.free_lang_data (decl);
4379 TREE_LANG_FLAG_0 (decl) = 0;
4380 TREE_LANG_FLAG_1 (decl) = 0;
4381 TREE_LANG_FLAG_2 (decl) = 0;
4382 TREE_LANG_FLAG_3 (decl) = 0;
4383 TREE_LANG_FLAG_4 (decl) = 0;
4384 TREE_LANG_FLAG_5 (decl) = 0;
4385 TREE_LANG_FLAG_6 (decl) = 0;
4387 /* Identifiers need not have a type. */
4388 if (DECL_NAME (decl))
4389 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4391 /* Ignore any intervening types, because we are going to clear their
4392 TYPE_CONTEXT fields. */
4393 if (TREE_CODE (decl) != FIELD_DECL
4394 && TREE_CODE (decl) != FUNCTION_DECL)
4395 DECL_CONTEXT (decl) = decl_function_context (decl);
4397 if (DECL_CONTEXT (decl)
4398 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4399 DECL_CONTEXT (decl) = NULL_TREE;
4401 if (TREE_CODE (decl) == VAR_DECL)
4403 tree context = DECL_CONTEXT (decl);
4407 enum tree_code code = TREE_CODE (context);
4408 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4410 /* Do not clear the decl context here, that will promote
4411 all vars to global ones. */
4412 DECL_INITIAL (decl) = NULL_TREE;
4415 if (TREE_STATIC (decl))
4416 DECL_CONTEXT (decl) = NULL_TREE;
4420 /* ??? We could free non-constant DECL_SIZE, DECL_SIZE_UNIT
4421 and DECL_FIELD_OFFSET. But it's cheap enough to not do
4422 that and refrain from adding workarounds to dwarf2out.c */
4424 /* DECL_FCONTEXT is only used for debug info generation. */
4425 if (TREE_CODE (decl) == FIELD_DECL
4426 && debug_info_level < DINFO_LEVEL_TERSE)
4427 DECL_FCONTEXT (decl) = NULL_TREE;
4429 if (TREE_CODE (decl) == FUNCTION_DECL)
4431 if (gimple_has_body_p (decl))
4434 struct pointer_set_t *locals;
4436 /* If DECL has a gimple body, then the context for its
4437 arguments must be DECL. Otherwise, it doesn't really
4438 matter, as we will not be emitting any code for DECL. In
4439 general, there may be other instances of DECL created by
4440 the front end and since PARM_DECLs are generally shared,
4441 their DECL_CONTEXT changes as the replicas of DECL are
4442 created. The only time where DECL_CONTEXT is important
4443 is for the FUNCTION_DECLs that have a gimple body (since
4444 the PARM_DECL will be used in the function's body). */
4445 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4446 DECL_CONTEXT (t) = decl;
4448 /* Collect all the symbols declared in DECL. */
4449 locals = pointer_set_create ();
4450 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4451 for (; t; t = TREE_CHAIN (t))
4453 pointer_set_insert (locals, TREE_VALUE (t));
4455 /* All the local symbols should have DECL as their
4457 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4460 /* Get rid of any decl not in local_decls. */
4461 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4463 pointer_set_destroy (locals);
4466 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4467 At this point, it is not needed anymore. */
4468 DECL_SAVED_TREE (decl) = NULL_TREE;
4470 else if (TREE_CODE (decl) == VAR_DECL)
4472 tree expr = DECL_DEBUG_EXPR (decl);
4474 && TREE_CODE (expr) == VAR_DECL
4475 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4476 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4478 if (DECL_EXTERNAL (decl)
4479 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4480 DECL_INITIAL (decl) = NULL_TREE;
4482 else if (TREE_CODE (decl) == TYPE_DECL)
4484 DECL_INITIAL (decl) = NULL_TREE;
4486 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4487 FIELD_DECLs, which should be preserved. Otherwise,
4488 we shouldn't be concerned with source-level lexical
4489 nesting beyond this point. */
4490 DECL_CONTEXT (decl) = NULL_TREE;
4495 /* Data used when collecting DECLs and TYPEs for language data removal. */
4497 struct free_lang_data_d
4499 /* Worklist to avoid excessive recursion. */
4500 VEC(tree,heap) *worklist;
4502 /* Set of traversed objects. Used to avoid duplicate visits. */
4503 struct pointer_set_t *pset;
4505 /* Array of symbols to process with free_lang_data_in_decl. */
4506 VEC(tree,heap) *decls;
4508 /* Array of types to process with free_lang_data_in_type. */
4509 VEC(tree,heap) *types;
4513 /* Save all language fields needed to generate proper debug information
4514 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4517 save_debug_info_for_decl (tree t)
4519 /*struct saved_debug_info_d *sdi;*/
4521 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4523 /* FIXME. Partial implementation for saving debug info removed. */
4527 /* Save all language fields needed to generate proper debug information
4528 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4531 save_debug_info_for_type (tree t)
4533 /*struct saved_debug_info_d *sdi;*/
4535 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4537 /* FIXME. Partial implementation for saving debug info removed. */
4541 /* Add type or decl T to one of the list of tree nodes that need their
4542 language data removed. The lists are held inside FLD. */
4545 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4549 VEC_safe_push (tree, heap, fld->decls, t);
4550 if (debug_info_level > DINFO_LEVEL_TERSE)
4551 save_debug_info_for_decl (t);
4553 else if (TYPE_P (t))
4555 VEC_safe_push (tree, heap, fld->types, t);
4556 if (debug_info_level > DINFO_LEVEL_TERSE)
4557 save_debug_info_for_type (t);
4563 /* Push tree node T into FLD->WORKLIST. */
4566 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4568 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4569 VEC_safe_push (tree, heap, fld->worklist, (t));
4573 /* Operand callback helper for free_lang_data_in_node. *TP is the
4574 subtree operand being considered. */
4577 find_decls_types_r (tree *tp, int *ws, void *data)
4580 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4582 if (TREE_CODE (t) == TREE_LIST)
4585 /* Language specific nodes will be removed, so there is no need
4586 to gather anything under them. */
4587 if (is_lang_specific (t))
4595 /* Note that walk_tree does not traverse every possible field in
4596 decls, so we have to do our own traversals here. */
4597 add_tree_to_fld_list (t, fld);
4599 fld_worklist_push (DECL_NAME (t), fld);
4600 fld_worklist_push (DECL_CONTEXT (t), fld);
4601 fld_worklist_push (DECL_SIZE (t), fld);
4602 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4604 /* We are going to remove everything under DECL_INITIAL for
4605 TYPE_DECLs. No point walking them. */
4606 if (TREE_CODE (t) != TYPE_DECL)
4607 fld_worklist_push (DECL_INITIAL (t), fld);
4609 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4610 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4612 if (TREE_CODE (t) == FUNCTION_DECL)
4614 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4615 fld_worklist_push (DECL_RESULT (t), fld);
4617 else if (TREE_CODE (t) == TYPE_DECL)
4619 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4620 fld_worklist_push (DECL_VINDEX (t), fld);
4622 else if (TREE_CODE (t) == FIELD_DECL)
4624 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4625 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4626 fld_worklist_push (DECL_QUALIFIER (t), fld);
4627 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4628 fld_worklist_push (DECL_FCONTEXT (t), fld);
4630 else if (TREE_CODE (t) == VAR_DECL)
4632 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4633 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4636 if (TREE_CODE (t) != FIELD_DECL)
4637 fld_worklist_push (TREE_CHAIN (t), fld);
4640 else if (TYPE_P (t))
4642 /* Note that walk_tree does not traverse every possible field in
4643 types, so we have to do our own traversals here. */
4644 add_tree_to_fld_list (t, fld);
4646 if (!RECORD_OR_UNION_TYPE_P (t))
4647 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4648 fld_worklist_push (TYPE_SIZE (t), fld);
4649 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4650 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4651 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4652 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4653 fld_worklist_push (TYPE_NAME (t), fld);
4654 fld_worklist_push (TYPE_MINVAL (t), fld);
4655 if (!RECORD_OR_UNION_TYPE_P (t))
4656 fld_worklist_push (TYPE_MAXVAL (t), fld);
4657 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4658 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4659 fld_worklist_push (TYPE_CONTEXT (t), fld);
4660 fld_worklist_push (TYPE_CANONICAL (t), fld);
4662 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4666 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4668 fld_worklist_push (TREE_TYPE (tem), fld);
4669 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4671 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4672 && TREE_CODE (tem) == TREE_LIST)
4675 fld_worklist_push (TREE_VALUE (tem), fld);
4676 tem = TREE_CHAIN (tem);
4680 if (RECORD_OR_UNION_TYPE_P (t))
4683 /* Push all TYPE_FIELDS - there can be interleaving interesting
4684 and non-interesting things. */
4685 tem = TYPE_FIELDS (t);
4688 if (TREE_CODE (tem) == FIELD_DECL)
4689 fld_worklist_push (tem, fld);
4690 tem = TREE_CHAIN (tem);
4694 fld_worklist_push (TREE_CHAIN (t), fld);
4698 fld_worklist_push (TREE_TYPE (t), fld);
4704 /* Find decls and types in T. */
4707 find_decls_types (tree t, struct free_lang_data_d *fld)
4711 if (!pointer_set_contains (fld->pset, t))
4712 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4713 if (VEC_empty (tree, fld->worklist))
4715 t = VEC_pop (tree, fld->worklist);
4719 /* Translate all the types in LIST with the corresponding runtime
4723 get_eh_types_for_runtime (tree list)
4727 if (list == NULL_TREE)
4730 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4732 list = TREE_CHAIN (list);
4735 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4736 TREE_CHAIN (prev) = n;
4737 prev = TREE_CHAIN (prev);
4738 list = TREE_CHAIN (list);
4745 /* Find decls and types referenced in EH region R and store them in
4746 FLD->DECLS and FLD->TYPES. */
4749 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4760 /* The types referenced in each catch must first be changed to the
4761 EH types used at runtime. This removes references to FE types
4763 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4765 c->type_list = get_eh_types_for_runtime (c->type_list);
4766 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4771 case ERT_ALLOWED_EXCEPTIONS:
4772 r->u.allowed.type_list
4773 = get_eh_types_for_runtime (r->u.allowed.type_list);
4774 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4777 case ERT_MUST_NOT_THROW:
4778 walk_tree (&r->u.must_not_throw.failure_decl,
4779 find_decls_types_r, fld, fld->pset);
4785 /* Find decls and types referenced in cgraph node N and store them in
4786 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4787 look for *every* kind of DECL and TYPE node reachable from N,
4788 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4789 NAMESPACE_DECLs, etc). */
4792 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4795 struct function *fn;
4798 find_decls_types (n->decl, fld);
4800 if (!gimple_has_body_p (n->decl))
4803 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4805 fn = DECL_STRUCT_FUNCTION (n->decl);
4807 /* Traverse locals. */
4808 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4809 find_decls_types (TREE_VALUE (t), fld);
4811 /* Traverse EH regions in FN. */
4814 FOR_ALL_EH_REGION_FN (r, fn)
4815 find_decls_types_in_eh_region (r, fld);
4818 /* Traverse every statement in FN. */
4819 FOR_EACH_BB_FN (bb, fn)
4821 gimple_stmt_iterator si;
4824 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4826 gimple phi = gsi_stmt (si);
4828 for (i = 0; i < gimple_phi_num_args (phi); i++)
4830 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4831 find_decls_types (*arg_p, fld);
4835 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4837 gimple stmt = gsi_stmt (si);
4839 for (i = 0; i < gimple_num_ops (stmt); i++)
4841 tree arg = gimple_op (stmt, i);
4842 find_decls_types (arg, fld);
4849 /* Find decls and types referenced in varpool node N and store them in
4850 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4851 look for *every* kind of DECL and TYPE node reachable from N,
4852 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4853 NAMESPACE_DECLs, etc). */
4856 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4858 find_decls_types (v->decl, fld);
4861 /* If T needs an assembler name, have one created for it. */
4864 assign_assembler_name_if_neeeded (tree t)
4866 if (need_assembler_name_p (t))
4868 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4869 diagnostics that use input_location to show locus
4870 information. The problem here is that, at this point,
4871 input_location is generally anchored to the end of the file
4872 (since the parser is long gone), so we don't have a good
4873 position to pin it to.
4875 To alleviate this problem, this uses the location of T's
4876 declaration. Examples of this are
4877 testsuite/g++.dg/template/cond2.C and
4878 testsuite/g++.dg/template/pr35240.C. */
4879 location_t saved_location = input_location;
4880 input_location = DECL_SOURCE_LOCATION (t);
4882 decl_assembler_name (t);
4884 input_location = saved_location;
4889 /* Free language specific information for every operand and expression
4890 in every node of the call graph. This process operates in three stages:
4892 1- Every callgraph node and varpool node is traversed looking for
4893 decls and types embedded in them. This is a more exhaustive
4894 search than that done by find_referenced_vars, because it will
4895 also collect individual fields, decls embedded in types, etc.
4897 2- All the decls found are sent to free_lang_data_in_decl.
4899 3- All the types found are sent to free_lang_data_in_type.
4901 The ordering between decls and types is important because
4902 free_lang_data_in_decl sets assembler names, which includes
4903 mangling. So types cannot be freed up until assembler names have
4907 free_lang_data_in_cgraph (void)
4909 struct cgraph_node *n;
4910 struct varpool_node *v;
4911 struct free_lang_data_d fld;
4916 /* Initialize sets and arrays to store referenced decls and types. */
4917 fld.pset = pointer_set_create ();
4918 fld.worklist = NULL;
4919 fld.decls = VEC_alloc (tree, heap, 100);
4920 fld.types = VEC_alloc (tree, heap, 100);
4922 /* Find decls and types in the body of every function in the callgraph. */
4923 for (n = cgraph_nodes; n; n = n->next)
4924 find_decls_types_in_node (n, &fld);
4926 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4927 find_decls_types (p->decl, &fld);
4929 /* Find decls and types in every varpool symbol. */
4930 for (v = varpool_nodes_queue; v; v = v->next_needed)
4931 find_decls_types_in_var (v, &fld);
4933 /* Set the assembler name on every decl found. We need to do this
4934 now because free_lang_data_in_decl will invalidate data needed
4935 for mangling. This breaks mangling on interdependent decls. */
4936 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4937 assign_assembler_name_if_neeeded (t);
4939 /* Traverse every decl found freeing its language data. */
4940 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4941 free_lang_data_in_decl (t);
4943 /* Traverse every type found freeing its language data. */
4944 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4945 free_lang_data_in_type (t);
4947 pointer_set_destroy (fld.pset);
4948 VEC_free (tree, heap, fld.worklist);
4949 VEC_free (tree, heap, fld.decls);
4950 VEC_free (tree, heap, fld.types);
4954 /* Free resources that are used by FE but are not needed once they are done. */
4957 free_lang_data (void)
4961 /* If we are the LTO frontend we have freed lang-specific data already. */
4963 || !flag_generate_lto)
4966 /* Allocate and assign alias sets to the standard integer types
4967 while the slots are still in the way the frontends generated them. */
4968 for (i = 0; i < itk_none; ++i)
4969 if (integer_types[i])
4970 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
4972 /* Traverse the IL resetting language specific information for
4973 operands, expressions, etc. */
4974 free_lang_data_in_cgraph ();
4976 /* Create gimple variants for common types. */
4977 ptrdiff_type_node = integer_type_node;
4978 fileptr_type_node = ptr_type_node;
4979 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4980 || (TYPE_MODE (boolean_type_node)
4981 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4982 || TYPE_PRECISION (boolean_type_node) != 1
4983 || !TYPE_UNSIGNED (boolean_type_node))
4985 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4986 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4987 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4988 TYPE_PRECISION (boolean_type_node) = 1;
4989 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4990 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4993 /* Unify char_type_node with its properly signed variant. */
4994 if (TYPE_UNSIGNED (char_type_node))
4995 unsigned_char_type_node = char_type_node;
4997 signed_char_type_node = char_type_node;
4999 /* Reset some langhooks. Do not reset types_compatible_p, it may
5000 still be used indirectly via the get_alias_set langhook. */
5001 lang_hooks.callgraph.analyze_expr = NULL;
5002 lang_hooks.dwarf_name = lhd_dwarf_name;
5003 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5004 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
5005 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
5007 /* Reset diagnostic machinery. */
5008 diagnostic_starter (global_dc) = default_diagnostic_starter;
5009 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5010 diagnostic_format_decoder (global_dc) = default_tree_printer;
5016 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5020 "*free_lang_data", /* name */
5022 free_lang_data, /* execute */
5025 0, /* static_pass_number */
5026 TV_IPA_FREE_LANG_DATA, /* tv_id */
5027 0, /* properties_required */
5028 0, /* properties_provided */
5029 0, /* properties_destroyed */
5030 0, /* todo_flags_start */
5031 TODO_ggc_collect /* todo_flags_finish */
5035 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5038 We try both `text' and `__text__', ATTR may be either one. */
5039 /* ??? It might be a reasonable simplification to require ATTR to be only
5040 `text'. One might then also require attribute lists to be stored in
5041 their canonicalized form. */
5044 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5049 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5052 p = IDENTIFIER_POINTER (ident);
5053 ident_len = IDENTIFIER_LENGTH (ident);
5055 if (ident_len == attr_len
5056 && strcmp (attr, p) == 0)
5059 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5062 gcc_assert (attr[1] == '_');
5063 gcc_assert (attr[attr_len - 2] == '_');
5064 gcc_assert (attr[attr_len - 1] == '_');
5065 if (ident_len == attr_len - 4
5066 && strncmp (attr + 2, p, attr_len - 4) == 0)
5071 if (ident_len == attr_len + 4
5072 && p[0] == '_' && p[1] == '_'
5073 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5074 && strncmp (attr, p + 2, attr_len) == 0)
5081 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5084 We try both `text' and `__text__', ATTR may be either one. */
5087 is_attribute_p (const char *attr, const_tree ident)
5089 return is_attribute_with_length_p (attr, strlen (attr), ident);
5092 /* Given an attribute name and a list of attributes, return a pointer to the
5093 attribute's list element if the attribute is part of the list, or NULL_TREE
5094 if not found. If the attribute appears more than once, this only
5095 returns the first occurrence; the TREE_CHAIN of the return value should
5096 be passed back in if further occurrences are wanted. */
5099 lookup_attribute (const char *attr_name, tree list)
5102 size_t attr_len = strlen (attr_name);
5104 for (l = list; l; l = TREE_CHAIN (l))
5106 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5107 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5113 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5117 remove_attribute (const char *attr_name, tree list)
5120 size_t attr_len = strlen (attr_name);
5122 for (p = &list; *p; )
5125 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5126 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5127 *p = TREE_CHAIN (l);
5129 p = &TREE_CHAIN (l);
5135 /* Return an attribute list that is the union of a1 and a2. */
5138 merge_attributes (tree a1, tree a2)
5142 /* Either one unset? Take the set one. */
5144 if ((attributes = a1) == 0)
5147 /* One that completely contains the other? Take it. */
5149 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5151 if (attribute_list_contained (a2, a1))
5155 /* Pick the longest list, and hang on the other list. */
5157 if (list_length (a1) < list_length (a2))
5158 attributes = a2, a2 = a1;
5160 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5163 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5166 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5169 if (TREE_VALUE (a) != NULL
5170 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5171 && TREE_VALUE (a2) != NULL
5172 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5174 if (simple_cst_list_equal (TREE_VALUE (a),
5175 TREE_VALUE (a2)) == 1)
5178 else if (simple_cst_equal (TREE_VALUE (a),
5179 TREE_VALUE (a2)) == 1)
5184 a1 = copy_node (a2);
5185 TREE_CHAIN (a1) = attributes;
5194 /* Given types T1 and T2, merge their attributes and return
5198 merge_type_attributes (tree t1, tree t2)
5200 return merge_attributes (TYPE_ATTRIBUTES (t1),
5201 TYPE_ATTRIBUTES (t2));
5204 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5208 merge_decl_attributes (tree olddecl, tree newdecl)
5210 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5211 DECL_ATTRIBUTES (newdecl));
5214 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5216 /* Specialization of merge_decl_attributes for various Windows targets.
5218 This handles the following situation:
5220 __declspec (dllimport) int foo;
5223 The second instance of `foo' nullifies the dllimport. */
5226 merge_dllimport_decl_attributes (tree old, tree new_tree)
5229 int delete_dllimport_p = 1;
5231 /* What we need to do here is remove from `old' dllimport if it doesn't
5232 appear in `new'. dllimport behaves like extern: if a declaration is
5233 marked dllimport and a definition appears later, then the object
5234 is not dllimport'd. We also remove a `new' dllimport if the old list
5235 contains dllexport: dllexport always overrides dllimport, regardless
5236 of the order of declaration. */
5237 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5238 delete_dllimport_p = 0;
5239 else if (DECL_DLLIMPORT_P (new_tree)
5240 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5242 DECL_DLLIMPORT_P (new_tree) = 0;
5243 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5244 "dllimport ignored", new_tree);
5246 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5248 /* Warn about overriding a symbol that has already been used, e.g.:
5249 extern int __attribute__ ((dllimport)) foo;
5250 int* bar () {return &foo;}
5253 if (TREE_USED (old))
5255 warning (0, "%q+D redeclared without dllimport attribute "
5256 "after being referenced with dll linkage", new_tree);
5257 /* If we have used a variable's address with dllimport linkage,
5258 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5259 decl may already have had TREE_CONSTANT computed.
5260 We still remove the attribute so that assembler code refers
5261 to '&foo rather than '_imp__foo'. */
5262 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5263 DECL_DLLIMPORT_P (new_tree) = 1;
5266 /* Let an inline definition silently override the external reference,
5267 but otherwise warn about attribute inconsistency. */
5268 else if (TREE_CODE (new_tree) == VAR_DECL
5269 || !DECL_DECLARED_INLINE_P (new_tree))
5270 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5271 "previous dllimport ignored", new_tree);
5274 delete_dllimport_p = 0;
5276 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5278 if (delete_dllimport_p)
5281 const size_t attr_len = strlen ("dllimport");
5283 /* Scan the list for dllimport and delete it. */
5284 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5286 if (is_attribute_with_length_p ("dllimport", attr_len,
5289 if (prev == NULL_TREE)
5292 TREE_CHAIN (prev) = TREE_CHAIN (t);
5301 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5302 struct attribute_spec.handler. */
5305 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5311 /* These attributes may apply to structure and union types being created,
5312 but otherwise should pass to the declaration involved. */
5315 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5316 | (int) ATTR_FLAG_ARRAY_NEXT))
5318 *no_add_attrs = true;
5319 return tree_cons (name, args, NULL_TREE);
5321 if (TREE_CODE (node) == RECORD_TYPE
5322 || TREE_CODE (node) == UNION_TYPE)
5324 node = TYPE_NAME (node);
5330 warning (OPT_Wattributes, "%qE attribute ignored",
5332 *no_add_attrs = true;
5337 if (TREE_CODE (node) != FUNCTION_DECL
5338 && TREE_CODE (node) != VAR_DECL
5339 && TREE_CODE (node) != TYPE_DECL)
5341 *no_add_attrs = true;
5342 warning (OPT_Wattributes, "%qE attribute ignored",
5347 if (TREE_CODE (node) == TYPE_DECL
5348 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5349 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5351 *no_add_attrs = true;
5352 warning (OPT_Wattributes, "%qE attribute ignored",
5357 is_dllimport = is_attribute_p ("dllimport", name);
5359 /* Report error on dllimport ambiguities seen now before they cause
5363 /* Honor any target-specific overrides. */
5364 if (!targetm.valid_dllimport_attribute_p (node))
5365 *no_add_attrs = true;
5367 else if (TREE_CODE (node) == FUNCTION_DECL
5368 && DECL_DECLARED_INLINE_P (node))
5370 warning (OPT_Wattributes, "inline function %q+D declared as "
5371 " dllimport: attribute ignored", node);
5372 *no_add_attrs = true;
5374 /* Like MS, treat definition of dllimported variables and
5375 non-inlined functions on declaration as syntax errors. */
5376 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5378 error ("function %q+D definition is marked dllimport", node);
5379 *no_add_attrs = true;
5382 else if (TREE_CODE (node) == VAR_DECL)
5384 if (DECL_INITIAL (node))
5386 error ("variable %q+D definition is marked dllimport",
5388 *no_add_attrs = true;
5391 /* `extern' needn't be specified with dllimport.
5392 Specify `extern' now and hope for the best. Sigh. */
5393 DECL_EXTERNAL (node) = 1;
5394 /* Also, implicitly give dllimport'd variables declared within
5395 a function global scope, unless declared static. */
5396 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5397 TREE_PUBLIC (node) = 1;
5400 if (*no_add_attrs == false)
5401 DECL_DLLIMPORT_P (node) = 1;
5403 else if (TREE_CODE (node) == FUNCTION_DECL
5404 && DECL_DECLARED_INLINE_P (node))
5405 /* An exported function, even if inline, must be emitted. */
5406 DECL_EXTERNAL (node) = 0;
5408 /* Report error if symbol is not accessible at global scope. */
5409 if (!TREE_PUBLIC (node)
5410 && (TREE_CODE (node) == VAR_DECL
5411 || TREE_CODE (node) == FUNCTION_DECL))
5413 error ("external linkage required for symbol %q+D because of "
5414 "%qE attribute", node, name);
5415 *no_add_attrs = true;
5418 /* A dllexport'd entity must have default visibility so that other
5419 program units (shared libraries or the main executable) can see
5420 it. A dllimport'd entity must have default visibility so that
5421 the linker knows that undefined references within this program
5422 unit can be resolved by the dynamic linker. */
5425 if (DECL_VISIBILITY_SPECIFIED (node)
5426 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5427 error ("%qE implies default visibility, but %qD has already "
5428 "been declared with a different visibility",
5430 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5431 DECL_VISIBILITY_SPECIFIED (node) = 1;
5437 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5439 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5440 of the various TYPE_QUAL values. */
5443 set_type_quals (tree type, int type_quals)
5445 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5446 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5447 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5448 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5451 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5454 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5456 return (TYPE_QUALS (cand) == type_quals
5457 && TYPE_NAME (cand) == TYPE_NAME (base)
5458 /* Apparently this is needed for Objective-C. */
5459 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5460 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5461 TYPE_ATTRIBUTES (base)));
5464 /* Return a version of the TYPE, qualified as indicated by the
5465 TYPE_QUALS, if one exists. If no qualified version exists yet,
5466 return NULL_TREE. */
5469 get_qualified_type (tree type, int type_quals)
5473 if (TYPE_QUALS (type) == type_quals)
5476 /* Search the chain of variants to see if there is already one there just
5477 like the one we need to have. If so, use that existing one. We must
5478 preserve the TYPE_NAME, since there is code that depends on this. */
5479 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5480 if (check_qualified_type (t, type, type_quals))
5486 /* Like get_qualified_type, but creates the type if it does not
5487 exist. This function never returns NULL_TREE. */
5490 build_qualified_type (tree type, int type_quals)
5494 /* See if we already have the appropriate qualified variant. */
5495 t = get_qualified_type (type, type_quals);
5497 /* If not, build it. */
5500 t = build_variant_type_copy (type);
5501 set_type_quals (t, type_quals);
5503 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5504 /* Propagate structural equality. */
5505 SET_TYPE_STRUCTURAL_EQUALITY (t);
5506 else if (TYPE_CANONICAL (type) != type)
5507 /* Build the underlying canonical type, since it is different
5509 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5512 /* T is its own canonical type. */
5513 TYPE_CANONICAL (t) = t;
5520 /* Create a new distinct copy of TYPE. The new type is made its own
5521 MAIN_VARIANT. If TYPE requires structural equality checks, the
5522 resulting type requires structural equality checks; otherwise, its
5523 TYPE_CANONICAL points to itself. */
5526 build_distinct_type_copy (tree type)
5528 tree t = copy_node (type);
5530 TYPE_POINTER_TO (t) = 0;
5531 TYPE_REFERENCE_TO (t) = 0;
5533 /* Set the canonical type either to a new equivalence class, or
5534 propagate the need for structural equality checks. */
5535 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5536 SET_TYPE_STRUCTURAL_EQUALITY (t);
5538 TYPE_CANONICAL (t) = t;
5540 /* Make it its own variant. */
5541 TYPE_MAIN_VARIANT (t) = t;
5542 TYPE_NEXT_VARIANT (t) = 0;
5544 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5545 whose TREE_TYPE is not t. This can also happen in the Ada
5546 frontend when using subtypes. */
5551 /* Create a new variant of TYPE, equivalent but distinct. This is so
5552 the caller can modify it. TYPE_CANONICAL for the return type will
5553 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5554 are considered equal by the language itself (or that both types
5555 require structural equality checks). */
5558 build_variant_type_copy (tree type)
5560 tree t, m = TYPE_MAIN_VARIANT (type);
5562 t = build_distinct_type_copy (type);
5564 /* Since we're building a variant, assume that it is a non-semantic
5565 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5566 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5568 /* Add the new type to the chain of variants of TYPE. */
5569 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5570 TYPE_NEXT_VARIANT (m) = t;
5571 TYPE_MAIN_VARIANT (t) = m;
5576 /* Return true if the from tree in both tree maps are equal. */
5579 tree_map_base_eq (const void *va, const void *vb)
5581 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5582 *const b = (const struct tree_map_base *) vb;
5583 return (a->from == b->from);
5586 /* Hash a from tree in a tree_map. */
5589 tree_map_base_hash (const void *item)
5591 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5594 /* Return true if this tree map structure is marked for garbage collection
5595 purposes. We simply return true if the from tree is marked, so that this
5596 structure goes away when the from tree goes away. */
5599 tree_map_base_marked_p (const void *p)
5601 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5605 tree_map_hash (const void *item)
5607 return (((const struct tree_map *) item)->hash);
5610 /* Return the initialization priority for DECL. */
5613 decl_init_priority_lookup (tree decl)
5615 struct tree_priority_map *h;
5616 struct tree_map_base in;
5618 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5620 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5621 return h ? h->init : DEFAULT_INIT_PRIORITY;
5624 /* Return the finalization priority for DECL. */
5627 decl_fini_priority_lookup (tree decl)
5629 struct tree_priority_map *h;
5630 struct tree_map_base in;
5632 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5634 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5635 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5638 /* Return the initialization and finalization priority information for
5639 DECL. If there is no previous priority information, a freshly
5640 allocated structure is returned. */
5642 static struct tree_priority_map *
5643 decl_priority_info (tree decl)
5645 struct tree_priority_map in;
5646 struct tree_priority_map *h;
5649 in.base.from = decl;
5650 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5651 h = (struct tree_priority_map *) *loc;
5654 h = GGC_CNEW (struct tree_priority_map);
5656 h->base.from = decl;
5657 h->init = DEFAULT_INIT_PRIORITY;
5658 h->fini = DEFAULT_INIT_PRIORITY;
5664 /* Set the initialization priority for DECL to PRIORITY. */
5667 decl_init_priority_insert (tree decl, priority_type priority)
5669 struct tree_priority_map *h;
5671 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5672 h = decl_priority_info (decl);
5676 /* Set the finalization priority for DECL to PRIORITY. */
5679 decl_fini_priority_insert (tree decl, priority_type priority)
5681 struct tree_priority_map *h;
5683 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5684 h = decl_priority_info (decl);
5688 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5691 print_debug_expr_statistics (void)
5693 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5694 (long) htab_size (debug_expr_for_decl),
5695 (long) htab_elements (debug_expr_for_decl),
5696 htab_collisions (debug_expr_for_decl));
5699 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5702 print_value_expr_statistics (void)
5704 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5705 (long) htab_size (value_expr_for_decl),
5706 (long) htab_elements (value_expr_for_decl),
5707 htab_collisions (value_expr_for_decl));
5710 /* Lookup a debug expression for FROM, and return it if we find one. */
5713 decl_debug_expr_lookup (tree from)
5715 struct tree_map *h, in;
5716 in.base.from = from;
5718 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5719 htab_hash_pointer (from));
5725 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5728 decl_debug_expr_insert (tree from, tree to)
5733 h = GGC_NEW (struct tree_map);
5734 h->hash = htab_hash_pointer (from);
5735 h->base.from = from;
5737 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5738 *(struct tree_map **) loc = h;
5741 /* Lookup a value expression for FROM, and return it if we find one. */
5744 decl_value_expr_lookup (tree from)
5746 struct tree_map *h, in;
5747 in.base.from = from;
5749 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5750 htab_hash_pointer (from));
5756 /* Insert a mapping FROM->TO in the value expression hashtable. */
5759 decl_value_expr_insert (tree from, tree to)
5764 h = GGC_NEW (struct tree_map);
5765 h->hash = htab_hash_pointer (from);
5766 h->base.from = from;
5768 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5769 *(struct tree_map **) loc = h;
5772 /* Hashing of types so that we don't make duplicates.
5773 The entry point is `type_hash_canon'. */
5775 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5776 with types in the TREE_VALUE slots), by adding the hash codes
5777 of the individual types. */
5780 type_hash_list (const_tree list, hashval_t hashcode)
5784 for (tail = list; tail; tail = TREE_CHAIN (tail))
5785 if (TREE_VALUE (tail) != error_mark_node)
5786 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5792 /* These are the Hashtable callback functions. */
5794 /* Returns true iff the types are equivalent. */
5797 type_hash_eq (const void *va, const void *vb)
5799 const struct type_hash *const a = (const struct type_hash *) va,
5800 *const b = (const struct type_hash *) vb;
5802 /* First test the things that are the same for all types. */
5803 if (a->hash != b->hash
5804 || TREE_CODE (a->type) != TREE_CODE (b->type)
5805 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5806 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5807 TYPE_ATTRIBUTES (b->type))
5808 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5809 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5810 || (TREE_CODE (a->type) != COMPLEX_TYPE
5811 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5814 switch (TREE_CODE (a->type))
5819 case REFERENCE_TYPE:
5823 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5826 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5827 && !(TYPE_VALUES (a->type)
5828 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5829 && TYPE_VALUES (b->type)
5830 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5831 && type_list_equal (TYPE_VALUES (a->type),
5832 TYPE_VALUES (b->type))))
5835 /* ... fall through ... */
5840 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5841 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5842 TYPE_MAX_VALUE (b->type)))
5843 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5844 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5845 TYPE_MIN_VALUE (b->type))));
5847 case FIXED_POINT_TYPE:
5848 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5851 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5854 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5855 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5856 || (TYPE_ARG_TYPES (a->type)
5857 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5858 && TYPE_ARG_TYPES (b->type)
5859 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5860 && type_list_equal (TYPE_ARG_TYPES (a->type),
5861 TYPE_ARG_TYPES (b->type)))));
5864 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5868 case QUAL_UNION_TYPE:
5869 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5870 || (TYPE_FIELDS (a->type)
5871 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5872 && TYPE_FIELDS (b->type)
5873 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5874 && type_list_equal (TYPE_FIELDS (a->type),
5875 TYPE_FIELDS (b->type))));
5878 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5879 || (TYPE_ARG_TYPES (a->type)
5880 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5881 && TYPE_ARG_TYPES (b->type)
5882 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5883 && type_list_equal (TYPE_ARG_TYPES (a->type),
5884 TYPE_ARG_TYPES (b->type))))
5892 if (lang_hooks.types.type_hash_eq != NULL)
5893 return lang_hooks.types.type_hash_eq (a->type, b->type);
5898 /* Return the cached hash value. */
5901 type_hash_hash (const void *item)
5903 return ((const struct type_hash *) item)->hash;
5906 /* Look in the type hash table for a type isomorphic to TYPE.
5907 If one is found, return it. Otherwise return 0. */
5910 type_hash_lookup (hashval_t hashcode, tree type)
5912 struct type_hash *h, in;
5914 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5915 must call that routine before comparing TYPE_ALIGNs. */
5921 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5928 /* Add an entry to the type-hash-table
5929 for a type TYPE whose hash code is HASHCODE. */
5932 type_hash_add (hashval_t hashcode, tree type)
5934 struct type_hash *h;
5937 h = GGC_NEW (struct type_hash);
5940 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5944 /* Given TYPE, and HASHCODE its hash code, return the canonical
5945 object for an identical type if one already exists.
5946 Otherwise, return TYPE, and record it as the canonical object.
5948 To use this function, first create a type of the sort you want.
5949 Then compute its hash code from the fields of the type that
5950 make it different from other similar types.
5951 Then call this function and use the value. */
5954 type_hash_canon (unsigned int hashcode, tree type)
5958 /* The hash table only contains main variants, so ensure that's what we're
5960 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5962 if (!lang_hooks.types.hash_types)
5965 /* See if the type is in the hash table already. If so, return it.
5966 Otherwise, add the type. */
5967 t1 = type_hash_lookup (hashcode, type);
5970 #ifdef GATHER_STATISTICS
5971 tree_node_counts[(int) t_kind]--;
5972 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5978 type_hash_add (hashcode, type);
5983 /* See if the data pointed to by the type hash table is marked. We consider
5984 it marked if the type is marked or if a debug type number or symbol
5985 table entry has been made for the type. This reduces the amount of
5986 debugging output and eliminates that dependency of the debug output on
5987 the number of garbage collections. */
5990 type_hash_marked_p (const void *p)
5992 const_tree const type = ((const struct type_hash *) p)->type;
5994 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5998 print_type_hash_statistics (void)
6000 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6001 (long) htab_size (type_hash_table),
6002 (long) htab_elements (type_hash_table),
6003 htab_collisions (type_hash_table));
6006 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6007 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6008 by adding the hash codes of the individual attributes. */
6011 attribute_hash_list (const_tree list, hashval_t hashcode)
6015 for (tail = list; tail; tail = TREE_CHAIN (tail))
6016 /* ??? Do we want to add in TREE_VALUE too? */
6017 hashcode = iterative_hash_object
6018 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6022 /* Given two lists of attributes, return true if list l2 is
6023 equivalent to l1. */
6026 attribute_list_equal (const_tree l1, const_tree l2)
6028 return attribute_list_contained (l1, l2)
6029 && attribute_list_contained (l2, l1);
6032 /* Given two lists of attributes, return true if list L2 is
6033 completely contained within L1. */
6034 /* ??? This would be faster if attribute names were stored in a canonicalized
6035 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6036 must be used to show these elements are equivalent (which they are). */
6037 /* ??? It's not clear that attributes with arguments will always be handled
6041 attribute_list_contained (const_tree l1, const_tree l2)
6045 /* First check the obvious, maybe the lists are identical. */
6049 /* Maybe the lists are similar. */
6050 for (t1 = l1, t2 = l2;
6052 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6053 && TREE_VALUE (t1) == TREE_VALUE (t2);
6054 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6056 /* Maybe the lists are equal. */
6057 if (t1 == 0 && t2 == 0)
6060 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6063 /* This CONST_CAST is okay because lookup_attribute does not
6064 modify its argument and the return value is assigned to a
6066 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6067 CONST_CAST_TREE(l1));
6069 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6072 if (TREE_VALUE (t2) != NULL
6073 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6074 && TREE_VALUE (attr) != NULL
6075 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6077 if (simple_cst_list_equal (TREE_VALUE (t2),
6078 TREE_VALUE (attr)) == 1)
6081 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6092 /* Given two lists of types
6093 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6094 return 1 if the lists contain the same types in the same order.
6095 Also, the TREE_PURPOSEs must match. */
6098 type_list_equal (const_tree l1, const_tree l2)
6102 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6103 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6104 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6105 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6106 && (TREE_TYPE (TREE_PURPOSE (t1))
6107 == TREE_TYPE (TREE_PURPOSE (t2))))))
6113 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6114 given by TYPE. If the argument list accepts variable arguments,
6115 then this function counts only the ordinary arguments. */
6118 type_num_arguments (const_tree type)
6123 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6124 /* If the function does not take a variable number of arguments,
6125 the last element in the list will have type `void'. */
6126 if (VOID_TYPE_P (TREE_VALUE (t)))
6134 /* Nonzero if integer constants T1 and T2
6135 represent the same constant value. */
6138 tree_int_cst_equal (const_tree t1, const_tree t2)
6143 if (t1 == 0 || t2 == 0)
6146 if (TREE_CODE (t1) == INTEGER_CST
6147 && TREE_CODE (t2) == INTEGER_CST
6148 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6149 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6155 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6156 The precise way of comparison depends on their data type. */
6159 tree_int_cst_lt (const_tree t1, const_tree t2)
6164 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6166 int t1_sgn = tree_int_cst_sgn (t1);
6167 int t2_sgn = tree_int_cst_sgn (t2);
6169 if (t1_sgn < t2_sgn)
6171 else if (t1_sgn > t2_sgn)
6173 /* Otherwise, both are non-negative, so we compare them as
6174 unsigned just in case one of them would overflow a signed
6177 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6178 return INT_CST_LT (t1, t2);
6180 return INT_CST_LT_UNSIGNED (t1, t2);
6183 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6186 tree_int_cst_compare (const_tree t1, const_tree t2)
6188 if (tree_int_cst_lt (t1, t2))
6190 else if (tree_int_cst_lt (t2, t1))
6196 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6197 the host. If POS is zero, the value can be represented in a single
6198 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6199 be represented in a single unsigned HOST_WIDE_INT. */
6202 host_integerp (const_tree t, int pos)
6207 return (TREE_CODE (t) == INTEGER_CST
6208 && ((TREE_INT_CST_HIGH (t) == 0
6209 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6210 || (! pos && TREE_INT_CST_HIGH (t) == -1
6211 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6212 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6213 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6214 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6215 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6218 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6219 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6220 be non-negative. We must be able to satisfy the above conditions. */
6223 tree_low_cst (const_tree t, int pos)
6225 gcc_assert (host_integerp (t, pos));
6226 return TREE_INT_CST_LOW (t);
6229 /* Return the most significant bit of the integer constant T. */
6232 tree_int_cst_msb (const_tree t)
6236 unsigned HOST_WIDE_INT l;
6238 /* Note that using TYPE_PRECISION here is wrong. We care about the
6239 actual bits, not the (arbitrary) range of the type. */
6240 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6241 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6242 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6243 return (l & 1) == 1;
6246 /* Return an indication of the sign of the integer constant T.
6247 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6248 Note that -1 will never be returned if T's type is unsigned. */
6251 tree_int_cst_sgn (const_tree t)
6253 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6255 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6257 else if (TREE_INT_CST_HIGH (t) < 0)
6263 /* Return the minimum number of bits needed to represent VALUE in a
6264 signed or unsigned type, UNSIGNEDP says which. */
6267 tree_int_cst_min_precision (tree value, bool unsignedp)
6271 /* If the value is negative, compute its negative minus 1. The latter
6272 adjustment is because the absolute value of the largest negative value
6273 is one larger than the largest positive value. This is equivalent to
6274 a bit-wise negation, so use that operation instead. */
6276 if (tree_int_cst_sgn (value) < 0)
6277 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6279 /* Return the number of bits needed, taking into account the fact
6280 that we need one more bit for a signed than unsigned type. */
6282 if (integer_zerop (value))
6285 log = tree_floor_log2 (value);
6287 return log + 1 + !unsignedp;
6290 /* Compare two constructor-element-type constants. Return 1 if the lists
6291 are known to be equal; otherwise return 0. */
6294 simple_cst_list_equal (const_tree l1, const_tree l2)
6296 while (l1 != NULL_TREE && l2 != NULL_TREE)
6298 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6301 l1 = TREE_CHAIN (l1);
6302 l2 = TREE_CHAIN (l2);
6308 /* Return truthvalue of whether T1 is the same tree structure as T2.
6309 Return 1 if they are the same.
6310 Return 0 if they are understandably different.
6311 Return -1 if either contains tree structure not understood by
6315 simple_cst_equal (const_tree t1, const_tree t2)
6317 enum tree_code code1, code2;
6323 if (t1 == 0 || t2 == 0)
6326 code1 = TREE_CODE (t1);
6327 code2 = TREE_CODE (t2);
6329 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6331 if (CONVERT_EXPR_CODE_P (code2)
6332 || code2 == NON_LVALUE_EXPR)
6333 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6335 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6338 else if (CONVERT_EXPR_CODE_P (code2)
6339 || code2 == NON_LVALUE_EXPR)
6340 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6348 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6349 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6352 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6355 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6358 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6359 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6360 TREE_STRING_LENGTH (t1)));
6364 unsigned HOST_WIDE_INT idx;
6365 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6366 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6368 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6371 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6372 /* ??? Should we handle also fields here? */
6373 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6374 VEC_index (constructor_elt, v2, idx)->value))
6380 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6383 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6386 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6389 const_tree arg1, arg2;
6390 const_call_expr_arg_iterator iter1, iter2;
6391 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6392 arg2 = first_const_call_expr_arg (t2, &iter2);
6394 arg1 = next_const_call_expr_arg (&iter1),
6395 arg2 = next_const_call_expr_arg (&iter2))
6397 cmp = simple_cst_equal (arg1, arg2);
6401 return arg1 == arg2;
6405 /* Special case: if either target is an unallocated VAR_DECL,
6406 it means that it's going to be unified with whatever the
6407 TARGET_EXPR is really supposed to initialize, so treat it
6408 as being equivalent to anything. */
6409 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6410 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6411 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6412 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6413 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6414 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6417 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6422 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6424 case WITH_CLEANUP_EXPR:
6425 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6429 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6432 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6433 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6447 /* This general rule works for most tree codes. All exceptions should be
6448 handled above. If this is a language-specific tree code, we can't
6449 trust what might be in the operand, so say we don't know
6451 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6454 switch (TREE_CODE_CLASS (code1))
6458 case tcc_comparison:
6459 case tcc_expression:
6463 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6465 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6477 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6478 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6479 than U, respectively. */
6482 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6484 if (tree_int_cst_sgn (t) < 0)
6486 else if (TREE_INT_CST_HIGH (t) != 0)
6488 else if (TREE_INT_CST_LOW (t) == u)
6490 else if (TREE_INT_CST_LOW (t) < u)
6496 /* Return true if CODE represents an associative tree code. Otherwise
6499 associative_tree_code (enum tree_code code)
6518 /* Return true if CODE represents a commutative tree code. Otherwise
6521 commutative_tree_code (enum tree_code code)
6534 case UNORDERED_EXPR:
6538 case TRUTH_AND_EXPR:
6539 case TRUTH_XOR_EXPR:
6549 /* Generate a hash value for an expression. This can be used iteratively
6550 by passing a previous result as the VAL argument.
6552 This function is intended to produce the same hash for expressions which
6553 would compare equal using operand_equal_p. */
6556 iterative_hash_expr (const_tree t, hashval_t val)
6559 enum tree_code code;
6563 return iterative_hash_hashval_t (0, val);
6565 code = TREE_CODE (t);
6569 /* Alas, constants aren't shared, so we can't rely on pointer
6572 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6573 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6576 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6578 return iterative_hash_hashval_t (val2, val);
6582 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6584 return iterative_hash_hashval_t (val2, val);
6587 return iterative_hash (TREE_STRING_POINTER (t),
6588 TREE_STRING_LENGTH (t), val);
6590 val = iterative_hash_expr (TREE_REALPART (t), val);
6591 return iterative_hash_expr (TREE_IMAGPART (t), val);
6593 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6596 /* we can just compare by pointer. */
6597 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6600 /* A list of expressions, for a CALL_EXPR or as the elements of a
6602 for (; t; t = TREE_CHAIN (t))
6603 val = iterative_hash_expr (TREE_VALUE (t), val);
6607 unsigned HOST_WIDE_INT idx;
6609 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6611 val = iterative_hash_expr (field, val);
6612 val = iterative_hash_expr (value, val);
6617 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6618 Otherwise nodes that compare equal according to operand_equal_p might
6619 get different hash codes. However, don't do this for machine specific
6620 or front end builtins, since the function code is overloaded in those
6622 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6623 && built_in_decls[DECL_FUNCTION_CODE (t)])
6625 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6626 code = TREE_CODE (t);
6630 tclass = TREE_CODE_CLASS (code);
6632 if (tclass == tcc_declaration)
6634 /* DECL's have a unique ID */
6635 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6639 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6641 val = iterative_hash_object (code, val);
6643 /* Don't hash the type, that can lead to having nodes which
6644 compare equal according to operand_equal_p, but which
6645 have different hash codes. */
6646 if (CONVERT_EXPR_CODE_P (code)
6647 || code == NON_LVALUE_EXPR)
6649 /* Make sure to include signness in the hash computation. */
6650 val += TYPE_UNSIGNED (TREE_TYPE (t));
6651 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6654 else if (commutative_tree_code (code))
6656 /* It's a commutative expression. We want to hash it the same
6657 however it appears. We do this by first hashing both operands
6658 and then rehashing based on the order of their independent
6660 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6661 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6665 t = one, one = two, two = t;
6667 val = iterative_hash_hashval_t (one, val);
6668 val = iterative_hash_hashval_t (two, val);
6671 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6672 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6679 /* Generate a hash value for a pair of expressions. This can be used
6680 iteratively by passing a previous result as the VAL argument.
6682 The same hash value is always returned for a given pair of expressions,
6683 regardless of the order in which they are presented. This is useful in
6684 hashing the operands of commutative functions. */
6687 iterative_hash_exprs_commutative (const_tree t1,
6688 const_tree t2, hashval_t val)
6690 hashval_t one = iterative_hash_expr (t1, 0);
6691 hashval_t two = iterative_hash_expr (t2, 0);
6695 t = one, one = two, two = t;
6696 val = iterative_hash_hashval_t (one, val);
6697 val = iterative_hash_hashval_t (two, val);
6702 /* Constructors for pointer, array and function types.
6703 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6704 constructed by language-dependent code, not here.) */
6706 /* Construct, lay out and return the type of pointers to TO_TYPE with
6707 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6708 reference all of memory. If such a type has already been
6709 constructed, reuse it. */
6712 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6717 if (to_type == error_mark_node)
6718 return error_mark_node;
6720 /* If the pointed-to type has the may_alias attribute set, force
6721 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6722 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6723 can_alias_all = true;
6725 /* In some cases, languages will have things that aren't a POINTER_TYPE
6726 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6727 In that case, return that type without regard to the rest of our
6730 ??? This is a kludge, but consistent with the way this function has
6731 always operated and there doesn't seem to be a good way to avoid this
6733 if (TYPE_POINTER_TO (to_type) != 0
6734 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6735 return TYPE_POINTER_TO (to_type);
6737 /* First, if we already have a type for pointers to TO_TYPE and it's
6738 the proper mode, use it. */
6739 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6740 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6743 t = make_node (POINTER_TYPE);
6745 TREE_TYPE (t) = to_type;
6746 SET_TYPE_MODE (t, mode);
6747 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6748 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6749 TYPE_POINTER_TO (to_type) = t;
6751 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6752 SET_TYPE_STRUCTURAL_EQUALITY (t);
6753 else if (TYPE_CANONICAL (to_type) != to_type)
6755 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6756 mode, can_alias_all);
6758 /* Lay out the type. This function has many callers that are concerned
6759 with expression-construction, and this simplifies them all. */
6765 /* By default build pointers in ptr_mode. */
6768 build_pointer_type (tree to_type)
6770 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6771 : TYPE_ADDR_SPACE (to_type);
6772 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6773 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6776 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6779 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6784 if (to_type == error_mark_node)
6785 return error_mark_node;
6787 /* If the pointed-to type has the may_alias attribute set, force
6788 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6789 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6790 can_alias_all = true;
6792 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6793 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6794 In that case, return that type without regard to the rest of our
6797 ??? This is a kludge, but consistent with the way this function has
6798 always operated and there doesn't seem to be a good way to avoid this
6800 if (TYPE_REFERENCE_TO (to_type) != 0
6801 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6802 return TYPE_REFERENCE_TO (to_type);
6804 /* First, if we already have a type for pointers to TO_TYPE and it's
6805 the proper mode, use it. */
6806 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6807 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6810 t = make_node (REFERENCE_TYPE);
6812 TREE_TYPE (t) = to_type;
6813 SET_TYPE_MODE (t, mode);
6814 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6815 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6816 TYPE_REFERENCE_TO (to_type) = t;
6818 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6819 SET_TYPE_STRUCTURAL_EQUALITY (t);
6820 else if (TYPE_CANONICAL (to_type) != to_type)
6822 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6823 mode, can_alias_all);
6831 /* Build the node for the type of references-to-TO_TYPE by default
6835 build_reference_type (tree to_type)
6837 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6838 : TYPE_ADDR_SPACE (to_type);
6839 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6840 return build_reference_type_for_mode (to_type, pointer_mode, false);
6843 /* Build a type that is compatible with t but has no cv quals anywhere
6846 const char *const *const * -> char ***. */
6849 build_type_no_quals (tree t)
6851 switch (TREE_CODE (t))
6854 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6856 TYPE_REF_CAN_ALIAS_ALL (t));
6857 case REFERENCE_TYPE:
6859 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6861 TYPE_REF_CAN_ALIAS_ALL (t));
6863 return TYPE_MAIN_VARIANT (t);
6867 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6868 MAXVAL should be the maximum value in the domain
6869 (one less than the length of the array).
6871 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6872 We don't enforce this limit, that is up to caller (e.g. language front end).
6873 The limit exists because the result is a signed type and we don't handle
6874 sizes that use more than one HOST_WIDE_INT. */
6877 build_index_type (tree maxval)
6879 tree itype = make_node (INTEGER_TYPE);
6881 TREE_TYPE (itype) = sizetype;
6882 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6883 TYPE_MIN_VALUE (itype) = size_zero_node;
6884 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6885 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6886 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6887 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6888 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6889 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6891 if (host_integerp (maxval, 1))
6892 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6895 /* Since we cannot hash this type, we need to compare it using
6896 structural equality checks. */
6897 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6902 #define MAX_INT_CACHED_PREC \
6903 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6904 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
6906 /* Builds a signed or unsigned integer type of precision PRECISION.
6907 Used for C bitfields whose precision does not match that of
6908 built-in target types. */
6910 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6916 unsignedp = MAX_INT_CACHED_PREC + 1;
6918 if (precision <= MAX_INT_CACHED_PREC)
6920 itype = nonstandard_integer_type_cache[precision + unsignedp];
6925 itype = make_node (INTEGER_TYPE);
6926 TYPE_PRECISION (itype) = precision;
6929 fixup_unsigned_type (itype);
6931 fixup_signed_type (itype);
6934 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6935 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6936 if (precision <= MAX_INT_CACHED_PREC && lang_hooks.types.hash_types)
6937 nonstandard_integer_type_cache[precision + unsignedp] = ret;
6942 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6943 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6944 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6947 build_range_type (tree type, tree lowval, tree highval)
6949 tree itype = make_node (INTEGER_TYPE);
6951 TREE_TYPE (itype) = type;
6952 if (type == NULL_TREE)
6955 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6956 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6958 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6959 SET_TYPE_MODE (itype, TYPE_MODE (type));
6960 TYPE_SIZE (itype) = TYPE_SIZE (type);
6961 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6962 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6963 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6965 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6966 return type_hash_canon (tree_low_cst (highval, 0)
6967 - tree_low_cst (lowval, 0),
6973 /* Return true if the debug information for TYPE, a subtype, should be emitted
6974 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6975 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6976 debug info and doesn't reflect the source code. */
6979 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6981 tree base_type = TREE_TYPE (type), low, high;
6983 /* Subrange types have a base type which is an integral type. */
6984 if (!INTEGRAL_TYPE_P (base_type))
6987 /* Get the real bounds of the subtype. */
6988 if (lang_hooks.types.get_subrange_bounds)
6989 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6992 low = TYPE_MIN_VALUE (type);
6993 high = TYPE_MAX_VALUE (type);
6996 /* If the type and its base type have the same representation and the same
6997 name, then the type is not a subrange but a copy of the base type. */
6998 if ((TREE_CODE (base_type) == INTEGER_TYPE
6999 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7000 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7001 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7002 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7004 tree type_name = TYPE_NAME (type);
7005 tree base_type_name = TYPE_NAME (base_type);
7007 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7008 type_name = DECL_NAME (type_name);
7010 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7011 base_type_name = DECL_NAME (base_type_name);
7013 if (type_name == base_type_name)
7024 /* Just like build_index_type, but takes lowval and highval instead
7025 of just highval (maxval). */
7028 build_index_2_type (tree lowval, tree highval)
7030 return build_range_type (sizetype, lowval, highval);
7033 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7034 and number of elements specified by the range of values of INDEX_TYPE.
7035 If such a type has already been constructed, reuse it. */
7038 build_array_type (tree elt_type, tree index_type)
7041 hashval_t hashcode = 0;
7043 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7045 error ("arrays of functions are not meaningful");
7046 elt_type = integer_type_node;
7049 t = make_node (ARRAY_TYPE);
7050 TREE_TYPE (t) = elt_type;
7051 TYPE_DOMAIN (t) = index_type;
7052 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7055 /* If the element type is incomplete at this point we get marked for
7056 structural equality. Do not record these types in the canonical
7058 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7061 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7063 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7064 t = type_hash_canon (hashcode, t);
7066 if (TYPE_CANONICAL (t) == t)
7068 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7069 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7070 SET_TYPE_STRUCTURAL_EQUALITY (t);
7071 else if (TYPE_CANONICAL (elt_type) != elt_type
7072 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7074 = build_array_type (TYPE_CANONICAL (elt_type),
7075 index_type ? TYPE_CANONICAL (index_type) : NULL);
7081 /* Recursively examines the array elements of TYPE, until a non-array
7082 element type is found. */
7085 strip_array_types (tree type)
7087 while (TREE_CODE (type) == ARRAY_TYPE)
7088 type = TREE_TYPE (type);
7093 /* Computes the canonical argument types from the argument type list
7096 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7097 on entry to this function, or if any of the ARGTYPES are
7100 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7101 true on entry to this function, or if any of the ARGTYPES are
7104 Returns a canonical argument list, which may be ARGTYPES when the
7105 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7106 true) or would not differ from ARGTYPES. */
7109 maybe_canonicalize_argtypes(tree argtypes,
7110 bool *any_structural_p,
7111 bool *any_noncanonical_p)
7114 bool any_noncanonical_argtypes_p = false;
7116 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7118 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7119 /* Fail gracefully by stating that the type is structural. */
7120 *any_structural_p = true;
7121 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7122 *any_structural_p = true;
7123 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7124 || TREE_PURPOSE (arg))
7125 /* If the argument has a default argument, we consider it
7126 non-canonical even though the type itself is canonical.
7127 That way, different variants of function and method types
7128 with default arguments will all point to the variant with
7129 no defaults as their canonical type. */
7130 any_noncanonical_argtypes_p = true;
7133 if (*any_structural_p)
7136 if (any_noncanonical_argtypes_p)
7138 /* Build the canonical list of argument types. */
7139 tree canon_argtypes = NULL_TREE;
7140 bool is_void = false;
7142 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7144 if (arg == void_list_node)
7147 canon_argtypes = tree_cons (NULL_TREE,
7148 TYPE_CANONICAL (TREE_VALUE (arg)),
7152 canon_argtypes = nreverse (canon_argtypes);
7154 canon_argtypes = chainon (canon_argtypes, void_list_node);
7156 /* There is a non-canonical type. */
7157 *any_noncanonical_p = true;
7158 return canon_argtypes;
7161 /* The canonical argument types are the same as ARGTYPES. */
7165 /* Construct, lay out and return
7166 the type of functions returning type VALUE_TYPE
7167 given arguments of types ARG_TYPES.
7168 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7169 are data type nodes for the arguments of the function.
7170 If such a type has already been constructed, reuse it. */
7173 build_function_type (tree value_type, tree arg_types)
7176 hashval_t hashcode = 0;
7177 bool any_structural_p, any_noncanonical_p;
7178 tree canon_argtypes;
7180 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7182 error ("function return type cannot be function");
7183 value_type = integer_type_node;
7186 /* Make a node of the sort we want. */
7187 t = make_node (FUNCTION_TYPE);
7188 TREE_TYPE (t) = value_type;
7189 TYPE_ARG_TYPES (t) = arg_types;
7191 /* If we already have such a type, use the old one. */
7192 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7193 hashcode = type_hash_list (arg_types, hashcode);
7194 t = type_hash_canon (hashcode, t);
7196 /* Set up the canonical type. */
7197 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7198 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7199 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7201 &any_noncanonical_p);
7202 if (any_structural_p)
7203 SET_TYPE_STRUCTURAL_EQUALITY (t);
7204 else if (any_noncanonical_p)
7205 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7208 if (!COMPLETE_TYPE_P (t))
7213 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7216 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7218 tree new_type = NULL;
7219 tree args, new_args = NULL, t;
7223 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7224 args = TREE_CHAIN (args), i++)
7225 if (!bitmap_bit_p (args_to_skip, i))
7226 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7228 new_reversed = nreverse (new_args);
7232 TREE_CHAIN (new_args) = void_list_node;
7234 new_reversed = void_list_node;
7237 /* Use copy_node to preserve as much as possible from original type
7238 (debug info, attribute lists etc.)
7239 Exception is METHOD_TYPEs must have THIS argument.
7240 When we are asked to remove it, we need to build new FUNCTION_TYPE
7242 if (TREE_CODE (orig_type) != METHOD_TYPE
7243 || !bitmap_bit_p (args_to_skip, 0))
7245 new_type = copy_node (orig_type);
7246 TYPE_ARG_TYPES (new_type) = new_reversed;
7251 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7253 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7256 /* This is a new type, not a copy of an old type. Need to reassociate
7257 variants. We can handle everything except the main variant lazily. */
7258 t = TYPE_MAIN_VARIANT (orig_type);
7261 TYPE_MAIN_VARIANT (new_type) = t;
7262 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7263 TYPE_NEXT_VARIANT (t) = new_type;
7267 TYPE_MAIN_VARIANT (new_type) = new_type;
7268 TYPE_NEXT_VARIANT (new_type) = NULL;
7273 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7275 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7276 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7277 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7280 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7282 tree new_decl = copy_node (orig_decl);
7285 new_type = TREE_TYPE (orig_decl);
7286 if (prototype_p (new_type))
7287 new_type = build_function_type_skip_args (new_type, args_to_skip);
7288 TREE_TYPE (new_decl) = new_type;
7290 /* For declarations setting DECL_VINDEX (i.e. methods)
7291 we expect first argument to be THIS pointer. */
7292 if (bitmap_bit_p (args_to_skip, 0))
7293 DECL_VINDEX (new_decl) = NULL_TREE;
7297 /* Build a function type. The RETURN_TYPE is the type returned by the
7298 function. If VAARGS is set, no void_type_node is appended to the
7299 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7302 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7306 t = va_arg (argp, tree);
7307 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7308 args = tree_cons (NULL_TREE, t, args);
7313 if (args != NULL_TREE)
7314 args = nreverse (args);
7315 gcc_assert (args != NULL_TREE && last != void_list_node);
7317 else if (args == NULL_TREE)
7318 args = void_list_node;
7322 args = nreverse (args);
7323 TREE_CHAIN (last) = void_list_node;
7325 args = build_function_type (return_type, args);
7330 /* Build a function type. The RETURN_TYPE is the type returned by the
7331 function. If additional arguments are provided, they are
7332 additional argument types. The list of argument types must always
7333 be terminated by NULL_TREE. */
7336 build_function_type_list (tree return_type, ...)
7341 va_start (p, return_type);
7342 args = build_function_type_list_1 (false, return_type, p);
7347 /* Build a variable argument function type. The RETURN_TYPE is the
7348 type returned by the function. If additional arguments are provided,
7349 they are additional argument types. The list of argument types must
7350 always be terminated by NULL_TREE. */
7353 build_varargs_function_type_list (tree return_type, ...)
7358 va_start (p, return_type);
7359 args = build_function_type_list_1 (true, return_type, p);
7365 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7366 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7367 for the method. An implicit additional parameter (of type
7368 pointer-to-BASETYPE) is added to the ARGTYPES. */
7371 build_method_type_directly (tree basetype,
7378 bool any_structural_p, any_noncanonical_p;
7379 tree canon_argtypes;
7381 /* Make a node of the sort we want. */
7382 t = make_node (METHOD_TYPE);
7384 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7385 TREE_TYPE (t) = rettype;
7386 ptype = build_pointer_type (basetype);
7388 /* The actual arglist for this function includes a "hidden" argument
7389 which is "this". Put it into the list of argument types. */
7390 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7391 TYPE_ARG_TYPES (t) = argtypes;
7393 /* If we already have such a type, use the old one. */
7394 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7395 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7396 hashcode = type_hash_list (argtypes, hashcode);
7397 t = type_hash_canon (hashcode, t);
7399 /* Set up the canonical type. */
7401 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7402 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7404 = (TYPE_CANONICAL (basetype) != basetype
7405 || TYPE_CANONICAL (rettype) != rettype);
7406 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7408 &any_noncanonical_p);
7409 if (any_structural_p)
7410 SET_TYPE_STRUCTURAL_EQUALITY (t);
7411 else if (any_noncanonical_p)
7413 = build_method_type_directly (TYPE_CANONICAL (basetype),
7414 TYPE_CANONICAL (rettype),
7416 if (!COMPLETE_TYPE_P (t))
7422 /* Construct, lay out and return the type of methods belonging to class
7423 BASETYPE and whose arguments and values are described by TYPE.
7424 If that type exists already, reuse it.
7425 TYPE must be a FUNCTION_TYPE node. */
7428 build_method_type (tree basetype, tree type)
7430 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7432 return build_method_type_directly (basetype,
7434 TYPE_ARG_TYPES (type));
7437 /* Construct, lay out and return the type of offsets to a value
7438 of type TYPE, within an object of type BASETYPE.
7439 If a suitable offset type exists already, reuse it. */
7442 build_offset_type (tree basetype, tree type)
7445 hashval_t hashcode = 0;
7447 /* Make a node of the sort we want. */
7448 t = make_node (OFFSET_TYPE);
7450 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7451 TREE_TYPE (t) = type;
7453 /* If we already have such a type, use the old one. */
7454 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7455 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7456 t = type_hash_canon (hashcode, t);
7458 if (!COMPLETE_TYPE_P (t))
7461 if (TYPE_CANONICAL (t) == t)
7463 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7464 || TYPE_STRUCTURAL_EQUALITY_P (type))
7465 SET_TYPE_STRUCTURAL_EQUALITY (t);
7466 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7467 || TYPE_CANONICAL (type) != type)
7469 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7470 TYPE_CANONICAL (type));
7476 /* Create a complex type whose components are COMPONENT_TYPE. */
7479 build_complex_type (tree component_type)
7484 gcc_assert (INTEGRAL_TYPE_P (component_type)
7485 || SCALAR_FLOAT_TYPE_P (component_type)
7486 || FIXED_POINT_TYPE_P (component_type));
7488 /* Make a node of the sort we want. */
7489 t = make_node (COMPLEX_TYPE);
7491 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7493 /* If we already have such a type, use the old one. */
7494 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7495 t = type_hash_canon (hashcode, t);
7497 if (!COMPLETE_TYPE_P (t))
7500 if (TYPE_CANONICAL (t) == t)
7502 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7503 SET_TYPE_STRUCTURAL_EQUALITY (t);
7504 else if (TYPE_CANONICAL (component_type) != component_type)
7506 = build_complex_type (TYPE_CANONICAL (component_type));
7509 /* We need to create a name, since complex is a fundamental type. */
7510 if (! TYPE_NAME (t))
7513 if (component_type == char_type_node)
7514 name = "complex char";
7515 else if (component_type == signed_char_type_node)
7516 name = "complex signed char";
7517 else if (component_type == unsigned_char_type_node)
7518 name = "complex unsigned char";
7519 else if (component_type == short_integer_type_node)
7520 name = "complex short int";
7521 else if (component_type == short_unsigned_type_node)
7522 name = "complex short unsigned int";
7523 else if (component_type == integer_type_node)
7524 name = "complex int";
7525 else if (component_type == unsigned_type_node)
7526 name = "complex unsigned int";
7527 else if (component_type == long_integer_type_node)
7528 name = "complex long int";
7529 else if (component_type == long_unsigned_type_node)
7530 name = "complex long unsigned int";
7531 else if (component_type == long_long_integer_type_node)
7532 name = "complex long long int";
7533 else if (component_type == long_long_unsigned_type_node)
7534 name = "complex long long unsigned int";
7539 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7540 get_identifier (name), t);
7543 return build_qualified_type (t, TYPE_QUALS (component_type));
7546 /* If TYPE is a real or complex floating-point type and the target
7547 does not directly support arithmetic on TYPE then return the wider
7548 type to be used for arithmetic on TYPE. Otherwise, return
7552 excess_precision_type (tree type)
7554 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7556 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7557 switch (TREE_CODE (type))
7560 switch (flt_eval_method)
7563 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7564 return double_type_node;
7567 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7568 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7569 return long_double_type_node;
7576 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7578 switch (flt_eval_method)
7581 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7582 return complex_double_type_node;
7585 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7586 || (TYPE_MODE (TREE_TYPE (type))
7587 == TYPE_MODE (double_type_node)))
7588 return complex_long_double_type_node;
7601 /* Return OP, stripped of any conversions to wider types as much as is safe.
7602 Converting the value back to OP's type makes a value equivalent to OP.
7604 If FOR_TYPE is nonzero, we return a value which, if converted to
7605 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7607 OP must have integer, real or enumeral type. Pointers are not allowed!
7609 There are some cases where the obvious value we could return
7610 would regenerate to OP if converted to OP's type,
7611 but would not extend like OP to wider types.
7612 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7613 For example, if OP is (unsigned short)(signed char)-1,
7614 we avoid returning (signed char)-1 if FOR_TYPE is int,
7615 even though extending that to an unsigned short would regenerate OP,
7616 since the result of extending (signed char)-1 to (int)
7617 is different from (int) OP. */
7620 get_unwidened (tree op, tree for_type)
7622 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7623 tree type = TREE_TYPE (op);
7625 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7627 = (for_type != 0 && for_type != type
7628 && final_prec > TYPE_PRECISION (type)
7629 && TYPE_UNSIGNED (type));
7632 while (CONVERT_EXPR_P (op))
7636 /* TYPE_PRECISION on vector types has different meaning
7637 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7638 so avoid them here. */
7639 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7642 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7643 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7645 /* Truncations are many-one so cannot be removed.
7646 Unless we are later going to truncate down even farther. */
7648 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7651 /* See what's inside this conversion. If we decide to strip it,
7653 op = TREE_OPERAND (op, 0);
7655 /* If we have not stripped any zero-extensions (uns is 0),
7656 we can strip any kind of extension.
7657 If we have previously stripped a zero-extension,
7658 only zero-extensions can safely be stripped.
7659 Any extension can be stripped if the bits it would produce
7660 are all going to be discarded later by truncating to FOR_TYPE. */
7664 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7666 /* TYPE_UNSIGNED says whether this is a zero-extension.
7667 Let's avoid computing it if it does not affect WIN
7668 and if UNS will not be needed again. */
7670 || CONVERT_EXPR_P (op))
7671 && TYPE_UNSIGNED (TREE_TYPE (op)))
7679 /* If we finally reach a constant see if it fits in for_type and
7680 in that case convert it. */
7682 && TREE_CODE (win) == INTEGER_CST
7683 && TREE_TYPE (win) != for_type
7684 && int_fits_type_p (win, for_type))
7685 win = fold_convert (for_type, win);
7690 /* Return OP or a simpler expression for a narrower value
7691 which can be sign-extended or zero-extended to give back OP.
7692 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7693 or 0 if the value should be sign-extended. */
7696 get_narrower (tree op, int *unsignedp_ptr)
7701 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7703 while (TREE_CODE (op) == NOP_EXPR)
7706 = (TYPE_PRECISION (TREE_TYPE (op))
7707 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7709 /* Truncations are many-one so cannot be removed. */
7713 /* See what's inside this conversion. If we decide to strip it,
7718 op = TREE_OPERAND (op, 0);
7719 /* An extension: the outermost one can be stripped,
7720 but remember whether it is zero or sign extension. */
7722 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7723 /* Otherwise, if a sign extension has been stripped,
7724 only sign extensions can now be stripped;
7725 if a zero extension has been stripped, only zero-extensions. */
7726 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7730 else /* bitschange == 0 */
7732 /* A change in nominal type can always be stripped, but we must
7733 preserve the unsignedness. */
7735 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7737 op = TREE_OPERAND (op, 0);
7738 /* Keep trying to narrow, but don't assign op to win if it
7739 would turn an integral type into something else. */
7740 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7747 if (TREE_CODE (op) == COMPONENT_REF
7748 /* Since type_for_size always gives an integer type. */
7749 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7750 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7751 /* Ensure field is laid out already. */
7752 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7753 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7755 unsigned HOST_WIDE_INT innerprec
7756 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7757 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7758 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7759 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7761 /* We can get this structure field in a narrower type that fits it,
7762 but the resulting extension to its nominal type (a fullword type)
7763 must satisfy the same conditions as for other extensions.
7765 Do this only for fields that are aligned (not bit-fields),
7766 because when bit-field insns will be used there is no
7767 advantage in doing this. */
7769 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7770 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7771 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7775 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7776 win = fold_convert (type, op);
7780 *unsignedp_ptr = uns;
7784 /* Nonzero if integer constant C has a value that is permissible
7785 for type TYPE (an INTEGER_TYPE). */
7788 int_fits_type_p (const_tree c, const_tree type)
7790 tree type_low_bound, type_high_bound;
7791 bool ok_for_low_bound, ok_for_high_bound, unsc;
7794 dc = tree_to_double_int (c);
7795 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7797 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7798 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7800 /* So c is an unsigned integer whose type is sizetype and type is not.
7801 sizetype'd integers are sign extended even though they are
7802 unsigned. If the integer value fits in the lower end word of c,
7803 and if the higher end word has all its bits set to 1, that
7804 means the higher end bits are set to 1 only for sign extension.
7805 So let's convert c into an equivalent zero extended unsigned
7807 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7810 type_low_bound = TYPE_MIN_VALUE (type);
7811 type_high_bound = TYPE_MAX_VALUE (type);
7813 /* If at least one bound of the type is a constant integer, we can check
7814 ourselves and maybe make a decision. If no such decision is possible, but
7815 this type is a subtype, try checking against that. Otherwise, use
7816 fit_double_type, which checks against the precision.
7818 Compute the status for each possibly constant bound, and return if we see
7819 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7820 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7821 for "constant known to fit". */
7823 /* Check if c >= type_low_bound. */
7824 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7826 dd = tree_to_double_int (type_low_bound);
7827 if (TREE_CODE (type) == INTEGER_TYPE
7828 && TYPE_IS_SIZETYPE (type)
7829 && TYPE_UNSIGNED (type))
7830 dd = double_int_zext (dd, TYPE_PRECISION (type));
7831 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7833 int c_neg = (!unsc && double_int_negative_p (dc));
7834 int t_neg = (unsc && double_int_negative_p (dd));
7836 if (c_neg && !t_neg)
7838 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7841 else if (double_int_cmp (dc, dd, unsc) < 0)
7843 ok_for_low_bound = true;
7846 ok_for_low_bound = false;
7848 /* Check if c <= type_high_bound. */
7849 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7851 dd = tree_to_double_int (type_high_bound);
7852 if (TREE_CODE (type) == INTEGER_TYPE
7853 && TYPE_IS_SIZETYPE (type)
7854 && TYPE_UNSIGNED (type))
7855 dd = double_int_zext (dd, TYPE_PRECISION (type));
7856 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7858 int c_neg = (!unsc && double_int_negative_p (dc));
7859 int t_neg = (unsc && double_int_negative_p (dd));
7861 if (t_neg && !c_neg)
7863 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7866 else if (double_int_cmp (dc, dd, unsc) > 0)
7868 ok_for_high_bound = true;
7871 ok_for_high_bound = false;
7873 /* If the constant fits both bounds, the result is known. */
7874 if (ok_for_low_bound && ok_for_high_bound)
7877 /* Perform some generic filtering which may allow making a decision
7878 even if the bounds are not constant. First, negative integers
7879 never fit in unsigned types, */
7880 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7883 /* Second, narrower types always fit in wider ones. */
7884 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7887 /* Third, unsigned integers with top bit set never fit signed types. */
7888 if (! TYPE_UNSIGNED (type) && unsc)
7890 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7891 if (prec < HOST_BITS_PER_WIDE_INT)
7893 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7896 else if (((((unsigned HOST_WIDE_INT) 1)
7897 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7901 /* If we haven't been able to decide at this point, there nothing more we
7902 can check ourselves here. Look at the base type if we have one and it
7903 has the same precision. */
7904 if (TREE_CODE (type) == INTEGER_TYPE
7905 && TREE_TYPE (type) != 0
7906 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7908 type = TREE_TYPE (type);
7912 /* Or to fit_double_type, if nothing else. */
7913 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7916 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7917 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7918 represented (assuming two's-complement arithmetic) within the bit
7919 precision of the type are returned instead. */
7922 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7924 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7925 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7926 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7927 TYPE_UNSIGNED (type));
7930 if (TYPE_UNSIGNED (type))
7931 mpz_set_ui (min, 0);
7935 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7936 mn = double_int_sext (double_int_add (mn, double_int_one),
7937 TYPE_PRECISION (type));
7938 mpz_set_double_int (min, mn, false);
7942 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7943 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7944 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7945 TYPE_UNSIGNED (type));
7948 if (TYPE_UNSIGNED (type))
7949 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7952 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7957 /* Return true if VAR is an automatic variable defined in function FN. */
7960 auto_var_in_fn_p (const_tree var, const_tree fn)
7962 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7963 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
7964 || TREE_CODE (var) == PARM_DECL)
7965 && ! TREE_STATIC (var))
7966 || TREE_CODE (var) == LABEL_DECL
7967 || TREE_CODE (var) == RESULT_DECL));
7970 /* Subprogram of following function. Called by walk_tree.
7972 Return *TP if it is an automatic variable or parameter of the
7973 function passed in as DATA. */
7976 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7978 tree fn = (tree) data;
7983 else if (DECL_P (*tp)
7984 && auto_var_in_fn_p (*tp, fn))
7990 /* Returns true if T is, contains, or refers to a type with variable
7991 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7992 arguments, but not the return type. If FN is nonzero, only return
7993 true if a modifier of the type or position of FN is a variable or
7994 parameter inside FN.
7996 This concept is more general than that of C99 'variably modified types':
7997 in C99, a struct type is never variably modified because a VLA may not
7998 appear as a structure member. However, in GNU C code like:
8000 struct S { int i[f()]; };
8002 is valid, and other languages may define similar constructs. */
8005 variably_modified_type_p (tree type, tree fn)
8009 /* Test if T is either variable (if FN is zero) or an expression containing
8010 a variable in FN. */
8011 #define RETURN_TRUE_IF_VAR(T) \
8012 do { tree _t = (T); \
8013 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8014 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8015 return true; } while (0)
8017 if (type == error_mark_node)
8020 /* If TYPE itself has variable size, it is variably modified. */
8021 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8022 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8024 switch (TREE_CODE (type))
8027 case REFERENCE_TYPE:
8029 if (variably_modified_type_p (TREE_TYPE (type), fn))
8035 /* If TYPE is a function type, it is variably modified if the
8036 return type is variably modified. */
8037 if (variably_modified_type_p (TREE_TYPE (type), fn))
8043 case FIXED_POINT_TYPE:
8046 /* Scalar types are variably modified if their end points
8048 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8049 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8054 case QUAL_UNION_TYPE:
8055 /* We can't see if any of the fields are variably-modified by the
8056 definition we normally use, since that would produce infinite
8057 recursion via pointers. */
8058 /* This is variably modified if some field's type is. */
8059 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8060 if (TREE_CODE (t) == FIELD_DECL)
8062 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8063 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8064 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8066 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8067 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8072 /* Do not call ourselves to avoid infinite recursion. This is
8073 variably modified if the element type is. */
8074 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8075 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8082 /* The current language may have other cases to check, but in general,
8083 all other types are not variably modified. */
8084 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8086 #undef RETURN_TRUE_IF_VAR
8089 /* Given a DECL or TYPE, return the scope in which it was declared, or
8090 NULL_TREE if there is no containing scope. */
8093 get_containing_scope (const_tree t)
8095 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8098 /* Return the innermost context enclosing DECL that is
8099 a FUNCTION_DECL, or zero if none. */
8102 decl_function_context (const_tree decl)
8106 if (TREE_CODE (decl) == ERROR_MARK)
8109 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8110 where we look up the function at runtime. Such functions always take
8111 a first argument of type 'pointer to real context'.
8113 C++ should really be fixed to use DECL_CONTEXT for the real context,
8114 and use something else for the "virtual context". */
8115 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8118 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8120 context = DECL_CONTEXT (decl);
8122 while (context && TREE_CODE (context) != FUNCTION_DECL)
8124 if (TREE_CODE (context) == BLOCK)
8125 context = BLOCK_SUPERCONTEXT (context);
8127 context = get_containing_scope (context);
8133 /* Return the innermost context enclosing DECL that is
8134 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8135 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8138 decl_type_context (const_tree decl)
8140 tree context = DECL_CONTEXT (decl);
8143 switch (TREE_CODE (context))
8145 case NAMESPACE_DECL:
8146 case TRANSLATION_UNIT_DECL:
8151 case QUAL_UNION_TYPE:
8156 context = DECL_CONTEXT (context);
8160 context = BLOCK_SUPERCONTEXT (context);
8170 /* CALL is a CALL_EXPR. Return the declaration for the function
8171 called, or NULL_TREE if the called function cannot be
8175 get_callee_fndecl (const_tree call)
8179 if (call == error_mark_node)
8180 return error_mark_node;
8182 /* It's invalid to call this function with anything but a
8184 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8186 /* The first operand to the CALL is the address of the function
8188 addr = CALL_EXPR_FN (call);
8192 /* If this is a readonly function pointer, extract its initial value. */
8193 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8194 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8195 && DECL_INITIAL (addr))
8196 addr = DECL_INITIAL (addr);
8198 /* If the address is just `&f' for some function `f', then we know
8199 that `f' is being called. */
8200 if (TREE_CODE (addr) == ADDR_EXPR
8201 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8202 return TREE_OPERAND (addr, 0);
8204 /* We couldn't figure out what was being called. */
8208 /* Print debugging information about tree nodes generated during the compile,
8209 and any language-specific information. */
8212 dump_tree_statistics (void)
8214 #ifdef GATHER_STATISTICS
8216 int total_nodes, total_bytes;
8219 fprintf (stderr, "\n??? tree nodes created\n\n");
8220 #ifdef GATHER_STATISTICS
8221 fprintf (stderr, "Kind Nodes Bytes\n");
8222 fprintf (stderr, "---------------------------------------\n");
8223 total_nodes = total_bytes = 0;
8224 for (i = 0; i < (int) all_kinds; i++)
8226 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8227 tree_node_counts[i], tree_node_sizes[i]);
8228 total_nodes += tree_node_counts[i];
8229 total_bytes += tree_node_sizes[i];
8231 fprintf (stderr, "---------------------------------------\n");
8232 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8233 fprintf (stderr, "---------------------------------------\n");
8234 ssanames_print_statistics ();
8235 phinodes_print_statistics ();
8237 fprintf (stderr, "(No per-node statistics)\n");
8239 print_type_hash_statistics ();
8240 print_debug_expr_statistics ();
8241 print_value_expr_statistics ();
8242 lang_hooks.print_statistics ();
8245 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8247 /* Generate a crc32 of a string. */
8250 crc32_string (unsigned chksum, const char *string)
8254 unsigned value = *string << 24;
8257 for (ix = 8; ix--; value <<= 1)
8261 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8270 /* P is a string that will be used in a symbol. Mask out any characters
8271 that are not valid in that context. */
8274 clean_symbol_name (char *p)
8278 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8281 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8288 /* Generate a name for a special-purpose function function.
8289 The generated name may need to be unique across the whole link.
8290 TYPE is some string to identify the purpose of this function to the
8291 linker or collect2; it must start with an uppercase letter,
8293 I - for constructors
8295 N - for C++ anonymous namespaces
8296 F - for DWARF unwind frame information. */
8299 get_file_function_name (const char *type)
8305 /* If we already have a name we know to be unique, just use that. */
8306 if (first_global_object_name)
8307 p = q = ASTRDUP (first_global_object_name);
8308 /* If the target is handling the constructors/destructors, they
8309 will be local to this file and the name is only necessary for
8310 debugging purposes. */
8311 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8313 const char *file = main_input_filename;
8315 file = input_filename;
8316 /* Just use the file's basename, because the full pathname
8317 might be quite long. */
8318 p = strrchr (file, '/');
8323 p = q = ASTRDUP (p);
8327 /* Otherwise, the name must be unique across the entire link.
8328 We don't have anything that we know to be unique to this translation
8329 unit, so use what we do have and throw in some randomness. */
8331 const char *name = weak_global_object_name;
8332 const char *file = main_input_filename;
8337 file = input_filename;
8339 len = strlen (file);
8340 q = (char *) alloca (9 * 2 + len + 1);
8341 memcpy (q, file, len + 1);
8343 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8344 crc32_string (0, get_random_seed (false)));
8349 clean_symbol_name (q);
8350 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8353 /* Set up the name of the file-level functions we may need.
8354 Use a global object (which is already required to be unique over
8355 the program) rather than the file name (which imposes extra
8357 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8359 return get_identifier (buf);
8362 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8364 /* Complain that the tree code of NODE does not match the expected 0
8365 terminated list of trailing codes. The trailing code list can be
8366 empty, for a more vague error message. FILE, LINE, and FUNCTION
8367 are of the caller. */
8370 tree_check_failed (const_tree node, const char *file,
8371 int line, const char *function, ...)
8375 unsigned length = 0;
8378 va_start (args, function);
8379 while ((code = va_arg (args, int)))
8380 length += 4 + strlen (tree_code_name[code]);
8385 va_start (args, function);
8386 length += strlen ("expected ");
8387 buffer = tmp = (char *) alloca (length);
8389 while ((code = va_arg (args, int)))
8391 const char *prefix = length ? " or " : "expected ";
8393 strcpy (tmp + length, prefix);
8394 length += strlen (prefix);
8395 strcpy (tmp + length, tree_code_name[code]);
8396 length += strlen (tree_code_name[code]);
8401 buffer = "unexpected node";
8403 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8404 buffer, tree_code_name[TREE_CODE (node)],
8405 function, trim_filename (file), line);
8408 /* Complain that the tree code of NODE does match the expected 0
8409 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8413 tree_not_check_failed (const_tree node, const char *file,
8414 int line, const char *function, ...)
8418 unsigned length = 0;
8421 va_start (args, function);
8422 while ((code = va_arg (args, int)))
8423 length += 4 + strlen (tree_code_name[code]);
8425 va_start (args, function);
8426 buffer = (char *) alloca (length);
8428 while ((code = va_arg (args, int)))
8432 strcpy (buffer + length, " or ");
8435 strcpy (buffer + length, tree_code_name[code]);
8436 length += strlen (tree_code_name[code]);
8440 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8441 buffer, tree_code_name[TREE_CODE (node)],
8442 function, trim_filename (file), line);
8445 /* Similar to tree_check_failed, except that we check for a class of tree
8446 code, given in CL. */
8449 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8450 const char *file, int line, const char *function)
8453 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8454 TREE_CODE_CLASS_STRING (cl),
8455 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8456 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8459 /* Similar to tree_check_failed, except that instead of specifying a
8460 dozen codes, use the knowledge that they're all sequential. */
8463 tree_range_check_failed (const_tree node, const char *file, int line,
8464 const char *function, enum tree_code c1,
8468 unsigned length = 0;
8471 for (c = c1; c <= c2; ++c)
8472 length += 4 + strlen (tree_code_name[c]);
8474 length += strlen ("expected ");
8475 buffer = (char *) alloca (length);
8478 for (c = c1; c <= c2; ++c)
8480 const char *prefix = length ? " or " : "expected ";
8482 strcpy (buffer + length, prefix);
8483 length += strlen (prefix);
8484 strcpy (buffer + length, tree_code_name[c]);
8485 length += strlen (tree_code_name[c]);
8488 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8489 buffer, tree_code_name[TREE_CODE (node)],
8490 function, trim_filename (file), line);
8494 /* Similar to tree_check_failed, except that we check that a tree does
8495 not have the specified code, given in CL. */
8498 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8499 const char *file, int line, const char *function)
8502 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8503 TREE_CODE_CLASS_STRING (cl),
8504 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8505 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8509 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8512 omp_clause_check_failed (const_tree node, const char *file, int line,
8513 const char *function, enum omp_clause_code code)
8515 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8516 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8517 function, trim_filename (file), line);
8521 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8524 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8525 const char *function, enum omp_clause_code c1,
8526 enum omp_clause_code c2)
8529 unsigned length = 0;
8532 for (c = c1; c <= c2; ++c)
8533 length += 4 + strlen (omp_clause_code_name[c]);
8535 length += strlen ("expected ");
8536 buffer = (char *) alloca (length);
8539 for (c = c1; c <= c2; ++c)
8541 const char *prefix = length ? " or " : "expected ";
8543 strcpy (buffer + length, prefix);
8544 length += strlen (prefix);
8545 strcpy (buffer + length, omp_clause_code_name[c]);
8546 length += strlen (omp_clause_code_name[c]);
8549 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8550 buffer, omp_clause_code_name[TREE_CODE (node)],
8551 function, trim_filename (file), line);
8555 #undef DEFTREESTRUCT
8556 #define DEFTREESTRUCT(VAL, NAME) NAME,
8558 static const char *ts_enum_names[] = {
8559 #include "treestruct.def"
8561 #undef DEFTREESTRUCT
8563 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8565 /* Similar to tree_class_check_failed, except that we check for
8566 whether CODE contains the tree structure identified by EN. */
8569 tree_contains_struct_check_failed (const_tree node,
8570 const enum tree_node_structure_enum en,
8571 const char *file, int line,
8572 const char *function)
8575 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8577 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8581 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8582 (dynamically sized) vector. */
8585 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8586 const char *function)
8589 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8590 idx + 1, len, function, trim_filename (file), line);
8593 /* Similar to above, except that the check is for the bounds of the operand
8594 vector of an expression node EXP. */
8597 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8598 int line, const char *function)
8600 int code = TREE_CODE (exp);
8602 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8603 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8604 function, trim_filename (file), line);
8607 /* Similar to above, except that the check is for the number of
8608 operands of an OMP_CLAUSE node. */
8611 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8612 int line, const char *function)
8615 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8616 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8617 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8618 trim_filename (file), line);
8620 #endif /* ENABLE_TREE_CHECKING */
8622 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8623 and mapped to the machine mode MODE. Initialize its fields and build
8624 the information necessary for debugging output. */
8627 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8630 hashval_t hashcode = 0;
8632 t = make_node (VECTOR_TYPE);
8633 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8634 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8635 SET_TYPE_MODE (t, mode);
8637 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8638 SET_TYPE_STRUCTURAL_EQUALITY (t);
8639 else if (TYPE_CANONICAL (innertype) != innertype
8640 || mode != VOIDmode)
8642 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8647 tree index = build_int_cst (NULL_TREE, nunits - 1);
8648 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8649 build_index_type (index));
8650 tree rt = make_node (RECORD_TYPE);
8652 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8653 get_identifier ("f"), array);
8654 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8656 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8657 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8658 the representation type, and we want to find that die when looking up
8659 the vector type. This is most easily achieved by making the TYPE_UID
8661 TYPE_UID (rt) = TYPE_UID (t);
8664 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8665 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8666 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8667 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8668 t = type_hash_canon (hashcode, t);
8670 /* We have built a main variant, based on the main variant of the
8671 inner type. Use it to build the variant we return. */
8672 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8673 && TREE_TYPE (t) != innertype)
8674 return build_type_attribute_qual_variant (t,
8675 TYPE_ATTRIBUTES (innertype),
8676 TYPE_QUALS (innertype));
8682 make_or_reuse_type (unsigned size, int unsignedp)
8684 if (size == INT_TYPE_SIZE)
8685 return unsignedp ? unsigned_type_node : integer_type_node;
8686 if (size == CHAR_TYPE_SIZE)
8687 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8688 if (size == SHORT_TYPE_SIZE)
8689 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8690 if (size == LONG_TYPE_SIZE)
8691 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8692 if (size == LONG_LONG_TYPE_SIZE)
8693 return (unsignedp ? long_long_unsigned_type_node
8694 : long_long_integer_type_node);
8697 return make_unsigned_type (size);
8699 return make_signed_type (size);
8702 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8705 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8709 if (size == SHORT_FRACT_TYPE_SIZE)
8710 return unsignedp ? sat_unsigned_short_fract_type_node
8711 : sat_short_fract_type_node;
8712 if (size == FRACT_TYPE_SIZE)
8713 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8714 if (size == LONG_FRACT_TYPE_SIZE)
8715 return unsignedp ? sat_unsigned_long_fract_type_node
8716 : sat_long_fract_type_node;
8717 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8718 return unsignedp ? sat_unsigned_long_long_fract_type_node
8719 : sat_long_long_fract_type_node;
8723 if (size == SHORT_FRACT_TYPE_SIZE)
8724 return unsignedp ? unsigned_short_fract_type_node
8725 : short_fract_type_node;
8726 if (size == FRACT_TYPE_SIZE)
8727 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8728 if (size == LONG_FRACT_TYPE_SIZE)
8729 return unsignedp ? unsigned_long_fract_type_node
8730 : long_fract_type_node;
8731 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8732 return unsignedp ? unsigned_long_long_fract_type_node
8733 : long_long_fract_type_node;
8736 return make_fract_type (size, unsignedp, satp);
8739 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8742 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8746 if (size == SHORT_ACCUM_TYPE_SIZE)
8747 return unsignedp ? sat_unsigned_short_accum_type_node
8748 : sat_short_accum_type_node;
8749 if (size == ACCUM_TYPE_SIZE)
8750 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8751 if (size == LONG_ACCUM_TYPE_SIZE)
8752 return unsignedp ? sat_unsigned_long_accum_type_node
8753 : sat_long_accum_type_node;
8754 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8755 return unsignedp ? sat_unsigned_long_long_accum_type_node
8756 : sat_long_long_accum_type_node;
8760 if (size == SHORT_ACCUM_TYPE_SIZE)
8761 return unsignedp ? unsigned_short_accum_type_node
8762 : short_accum_type_node;
8763 if (size == ACCUM_TYPE_SIZE)
8764 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8765 if (size == LONG_ACCUM_TYPE_SIZE)
8766 return unsignedp ? unsigned_long_accum_type_node
8767 : long_accum_type_node;
8768 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8769 return unsignedp ? unsigned_long_long_accum_type_node
8770 : long_long_accum_type_node;
8773 return make_accum_type (size, unsignedp, satp);
8776 /* Create nodes for all integer types (and error_mark_node) using the sizes
8777 of C datatypes. The caller should call set_sizetype soon after calling
8778 this function to select one of the types as sizetype. */
8781 build_common_tree_nodes (bool signed_char)
8783 error_mark_node = make_node (ERROR_MARK);
8784 TREE_TYPE (error_mark_node) = error_mark_node;
8786 initialize_sizetypes ();
8788 /* Define both `signed char' and `unsigned char'. */
8789 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8790 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8791 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8792 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8794 /* Define `char', which is like either `signed char' or `unsigned char'
8795 but not the same as either. */
8798 ? make_signed_type (CHAR_TYPE_SIZE)
8799 : make_unsigned_type (CHAR_TYPE_SIZE));
8800 TYPE_STRING_FLAG (char_type_node) = 1;
8802 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8803 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8804 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8805 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8806 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8807 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8808 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8809 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8811 /* Define a boolean type. This type only represents boolean values but
8812 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8813 Front ends which want to override this size (i.e. Java) can redefine
8814 boolean_type_node before calling build_common_tree_nodes_2. */
8815 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8816 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8817 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8818 TYPE_PRECISION (boolean_type_node) = 1;
8820 /* Fill in the rest of the sized types. Reuse existing type nodes
8822 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8823 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8824 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8825 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8826 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8828 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8829 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8830 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8831 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8832 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8834 access_public_node = get_identifier ("public");
8835 access_protected_node = get_identifier ("protected");
8836 access_private_node = get_identifier ("private");
8839 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8840 It will create several other common tree nodes. */
8843 build_common_tree_nodes_2 (int short_double)
8845 /* Define these next since types below may used them. */
8846 integer_zero_node = build_int_cst (NULL_TREE, 0);
8847 integer_one_node = build_int_cst (NULL_TREE, 1);
8848 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8850 size_zero_node = size_int (0);
8851 size_one_node = size_int (1);
8852 bitsize_zero_node = bitsize_int (0);
8853 bitsize_one_node = bitsize_int (1);
8854 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8856 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8857 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8859 void_type_node = make_node (VOID_TYPE);
8860 layout_type (void_type_node);
8862 /* We are not going to have real types in C with less than byte alignment,
8863 so we might as well not have any types that claim to have it. */
8864 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8865 TYPE_USER_ALIGN (void_type_node) = 0;
8867 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8868 layout_type (TREE_TYPE (null_pointer_node));
8870 ptr_type_node = build_pointer_type (void_type_node);
8872 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8873 fileptr_type_node = ptr_type_node;
8875 float_type_node = make_node (REAL_TYPE);
8876 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8877 layout_type (float_type_node);
8879 double_type_node = make_node (REAL_TYPE);
8881 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8883 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8884 layout_type (double_type_node);
8886 long_double_type_node = make_node (REAL_TYPE);
8887 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8888 layout_type (long_double_type_node);
8890 float_ptr_type_node = build_pointer_type (float_type_node);
8891 double_ptr_type_node = build_pointer_type (double_type_node);
8892 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8893 integer_ptr_type_node = build_pointer_type (integer_type_node);
8895 /* Fixed size integer types. */
8896 uint32_type_node = build_nonstandard_integer_type (32, true);
8897 uint64_type_node = build_nonstandard_integer_type (64, true);
8899 /* Decimal float types. */
8900 dfloat32_type_node = make_node (REAL_TYPE);
8901 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8902 layout_type (dfloat32_type_node);
8903 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8904 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8906 dfloat64_type_node = make_node (REAL_TYPE);
8907 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8908 layout_type (dfloat64_type_node);
8909 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8910 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8912 dfloat128_type_node = make_node (REAL_TYPE);
8913 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8914 layout_type (dfloat128_type_node);
8915 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8916 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8918 complex_integer_type_node = build_complex_type (integer_type_node);
8919 complex_float_type_node = build_complex_type (float_type_node);
8920 complex_double_type_node = build_complex_type (double_type_node);
8921 complex_long_double_type_node = build_complex_type (long_double_type_node);
8923 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8924 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8925 sat_ ## KIND ## _type_node = \
8926 make_sat_signed_ ## KIND ## _type (SIZE); \
8927 sat_unsigned_ ## KIND ## _type_node = \
8928 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8929 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8930 unsigned_ ## KIND ## _type_node = \
8931 make_unsigned_ ## KIND ## _type (SIZE);
8933 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8934 sat_ ## WIDTH ## KIND ## _type_node = \
8935 make_sat_signed_ ## KIND ## _type (SIZE); \
8936 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8937 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8938 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8939 unsigned_ ## WIDTH ## KIND ## _type_node = \
8940 make_unsigned_ ## KIND ## _type (SIZE);
8942 /* Make fixed-point type nodes based on four different widths. */
8943 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8944 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8945 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8946 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8947 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8949 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8950 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8951 NAME ## _type_node = \
8952 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8953 u ## NAME ## _type_node = \
8954 make_or_reuse_unsigned_ ## KIND ## _type \
8955 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8956 sat_ ## NAME ## _type_node = \
8957 make_or_reuse_sat_signed_ ## KIND ## _type \
8958 (GET_MODE_BITSIZE (MODE ## mode)); \
8959 sat_u ## NAME ## _type_node = \
8960 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8961 (GET_MODE_BITSIZE (U ## MODE ## mode));
8963 /* Fixed-point type and mode nodes. */
8964 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8965 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8966 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8967 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8968 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8969 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8970 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8971 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8972 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8973 MAKE_FIXED_MODE_NODE (accum, da, DA)
8974 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8977 tree t = targetm.build_builtin_va_list ();
8979 /* Many back-ends define record types without setting TYPE_NAME.
8980 If we copied the record type here, we'd keep the original
8981 record type without a name. This breaks name mangling. So,
8982 don't copy record types and let c_common_nodes_and_builtins()
8983 declare the type to be __builtin_va_list. */
8984 if (TREE_CODE (t) != RECORD_TYPE)
8985 t = build_variant_type_copy (t);
8987 va_list_type_node = t;
8991 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8994 local_define_builtin (const char *name, tree type, enum built_in_function code,
8995 const char *library_name, int ecf_flags)
8999 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9000 library_name, NULL_TREE);
9001 if (ecf_flags & ECF_CONST)
9002 TREE_READONLY (decl) = 1;
9003 if (ecf_flags & ECF_PURE)
9004 DECL_PURE_P (decl) = 1;
9005 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9006 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9007 if (ecf_flags & ECF_NORETURN)
9008 TREE_THIS_VOLATILE (decl) = 1;
9009 if (ecf_flags & ECF_NOTHROW)
9010 TREE_NOTHROW (decl) = 1;
9011 if (ecf_flags & ECF_MALLOC)
9012 DECL_IS_MALLOC (decl) = 1;
9014 built_in_decls[code] = decl;
9015 implicit_built_in_decls[code] = decl;
9018 /* Call this function after instantiating all builtins that the language
9019 front end cares about. This will build the rest of the builtins that
9020 are relied upon by the tree optimizers and the middle-end. */
9023 build_common_builtin_nodes (void)
9025 tree tmp, tmp2, ftype;
9027 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9028 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9030 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9031 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9032 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9033 ftype = build_function_type (ptr_type_node, tmp);
9035 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9036 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9037 "memcpy", ECF_NOTHROW);
9038 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9039 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9040 "memmove", ECF_NOTHROW);
9043 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9045 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9046 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9047 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
9048 ftype = build_function_type (integer_type_node, tmp);
9049 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9050 "memcmp", ECF_PURE | ECF_NOTHROW);
9053 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9055 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9056 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9057 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9058 ftype = build_function_type (ptr_type_node, tmp);
9059 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9060 "memset", ECF_NOTHROW);
9063 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9065 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9066 ftype = build_function_type (ptr_type_node, tmp);
9067 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9069 ECF_MALLOC | (flag_stack_check ? 0 : ECF_NOTHROW));
9072 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9073 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9074 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9075 ftype = build_function_type (void_type_node, tmp);
9076 local_define_builtin ("__builtin_init_trampoline", ftype,
9077 BUILT_IN_INIT_TRAMPOLINE,
9078 "__builtin_init_trampoline", ECF_NOTHROW);
9080 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9081 ftype = build_function_type (ptr_type_node, tmp);
9082 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9083 BUILT_IN_ADJUST_TRAMPOLINE,
9084 "__builtin_adjust_trampoline",
9085 ECF_CONST | ECF_NOTHROW);
9087 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9088 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9089 ftype = build_function_type (void_type_node, tmp);
9090 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9091 BUILT_IN_NONLOCAL_GOTO,
9092 "__builtin_nonlocal_goto",
9093 ECF_NORETURN | ECF_NOTHROW);
9095 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9096 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9097 ftype = build_function_type (void_type_node, tmp);
9098 local_define_builtin ("__builtin_setjmp_setup", ftype,
9099 BUILT_IN_SETJMP_SETUP,
9100 "__builtin_setjmp_setup", ECF_NOTHROW);
9102 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9103 ftype = build_function_type (ptr_type_node, tmp);
9104 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9105 BUILT_IN_SETJMP_DISPATCHER,
9106 "__builtin_setjmp_dispatcher",
9107 ECF_PURE | ECF_NOTHROW);
9109 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9110 ftype = build_function_type (void_type_node, tmp);
9111 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9112 BUILT_IN_SETJMP_RECEIVER,
9113 "__builtin_setjmp_receiver", ECF_NOTHROW);
9115 ftype = build_function_type (ptr_type_node, void_list_node);
9116 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9117 "__builtin_stack_save", ECF_NOTHROW);
9119 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9120 ftype = build_function_type (void_type_node, tmp);
9121 local_define_builtin ("__builtin_stack_restore", ftype,
9122 BUILT_IN_STACK_RESTORE,
9123 "__builtin_stack_restore", ECF_NOTHROW);
9125 ftype = build_function_type (void_type_node, void_list_node);
9126 local_define_builtin ("__builtin_profile_func_enter", ftype,
9127 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9128 local_define_builtin ("__builtin_profile_func_exit", ftype,
9129 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9131 /* If there's a possibility that we might use the ARM EABI, build the
9132 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9133 if (targetm.arm_eabi_unwinder)
9135 ftype = build_function_type (void_type_node, void_list_node);
9136 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9137 BUILT_IN_CXA_END_CLEANUP,
9138 "__cxa_end_cleanup", ECF_NORETURN);
9141 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9142 ftype = build_function_type (void_type_node, tmp);
9143 local_define_builtin ("__builtin_unwind_resume", ftype,
9144 BUILT_IN_UNWIND_RESUME,
9145 (USING_SJLJ_EXCEPTIONS
9146 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9149 /* The exception object and filter values from the runtime. The argument
9150 must be zero before exception lowering, i.e. from the front end. After
9151 exception lowering, it will be the region number for the exception
9152 landing pad. These functions are PURE instead of CONST to prevent
9153 them from being hoisted past the exception edge that will initialize
9154 its value in the landing pad. */
9155 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9156 ftype = build_function_type (ptr_type_node, tmp);
9157 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9158 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9160 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9161 ftype = build_function_type (tmp2, tmp);
9162 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9163 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9165 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9166 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9167 ftype = build_function_type (void_type_node, tmp);
9168 local_define_builtin ("__builtin_eh_copy_values", ftype,
9169 BUILT_IN_EH_COPY_VALUES,
9170 "__builtin_eh_copy_values", ECF_NOTHROW);
9172 /* Complex multiplication and division. These are handled as builtins
9173 rather than optabs because emit_library_call_value doesn't support
9174 complex. Further, we can do slightly better with folding these
9175 beasties if the real and complex parts of the arguments are separate. */
9179 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9181 char mode_name_buf[4], *q;
9183 enum built_in_function mcode, dcode;
9184 tree type, inner_type;
9186 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9189 inner_type = TREE_TYPE (type);
9191 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9192 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9193 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9194 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9195 ftype = build_function_type (type, tmp);
9197 mcode = ((enum built_in_function)
9198 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9199 dcode = ((enum built_in_function)
9200 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9202 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9206 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9207 local_define_builtin (built_in_names[mcode], ftype, mcode,
9208 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9210 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9211 local_define_builtin (built_in_names[dcode], ftype, dcode,
9212 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9217 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9220 If we requested a pointer to a vector, build up the pointers that
9221 we stripped off while looking for the inner type. Similarly for
9222 return values from functions.
9224 The argument TYPE is the top of the chain, and BOTTOM is the
9225 new type which we will point to. */
9228 reconstruct_complex_type (tree type, tree bottom)
9232 if (TREE_CODE (type) == POINTER_TYPE)
9234 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9235 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9236 TYPE_REF_CAN_ALIAS_ALL (type));
9238 else if (TREE_CODE (type) == REFERENCE_TYPE)
9240 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9241 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9242 TYPE_REF_CAN_ALIAS_ALL (type));
9244 else if (TREE_CODE (type) == ARRAY_TYPE)
9246 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9247 outer = build_array_type (inner, TYPE_DOMAIN (type));
9249 else if (TREE_CODE (type) == FUNCTION_TYPE)
9251 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9252 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9254 else if (TREE_CODE (type) == METHOD_TYPE)
9256 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9257 /* The build_method_type_directly() routine prepends 'this' to argument list,
9258 so we must compensate by getting rid of it. */
9260 = build_method_type_directly
9261 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9263 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9265 else if (TREE_CODE (type) == OFFSET_TYPE)
9267 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9268 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9273 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9277 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9280 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9284 switch (GET_MODE_CLASS (mode))
9286 case MODE_VECTOR_INT:
9287 case MODE_VECTOR_FLOAT:
9288 case MODE_VECTOR_FRACT:
9289 case MODE_VECTOR_UFRACT:
9290 case MODE_VECTOR_ACCUM:
9291 case MODE_VECTOR_UACCUM:
9292 nunits = GET_MODE_NUNITS (mode);
9296 /* Check that there are no leftover bits. */
9297 gcc_assert (GET_MODE_BITSIZE (mode)
9298 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9300 nunits = GET_MODE_BITSIZE (mode)
9301 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9308 return make_vector_type (innertype, nunits, mode);
9311 /* Similarly, but takes the inner type and number of units, which must be
9315 build_vector_type (tree innertype, int nunits)
9317 return make_vector_type (innertype, nunits, VOIDmode);
9320 /* Similarly, but takes the inner type and number of units, which must be
9324 build_opaque_vector_type (tree innertype, int nunits)
9327 innertype = build_distinct_type_copy (innertype);
9328 t = make_vector_type (innertype, nunits, VOIDmode);
9329 TYPE_VECTOR_OPAQUE (t) = true;
9334 /* Given an initializer INIT, return TRUE if INIT is zero or some
9335 aggregate of zeros. Otherwise return FALSE. */
9337 initializer_zerop (const_tree init)
9343 switch (TREE_CODE (init))
9346 return integer_zerop (init);
9349 /* ??? Note that this is not correct for C4X float formats. There,
9350 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9351 negative exponent. */
9352 return real_zerop (init)
9353 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9356 return fixed_zerop (init);
9359 return integer_zerop (init)
9360 || (real_zerop (init)
9361 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9362 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9365 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9366 if (!initializer_zerop (TREE_VALUE (elt)))
9372 unsigned HOST_WIDE_INT idx;
9374 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9375 if (!initializer_zerop (elt))
9385 /* Build an empty statement at location LOC. */
9388 build_empty_stmt (location_t loc)
9390 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9391 SET_EXPR_LOCATION (t, loc);
9396 /* Build an OpenMP clause with code CODE. LOC is the location of the
9400 build_omp_clause (location_t loc, enum omp_clause_code code)
9405 length = omp_clause_num_ops[code];
9406 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9408 t = GGC_NEWVAR (union tree_node, size);
9409 memset (t, 0, size);
9410 TREE_SET_CODE (t, OMP_CLAUSE);
9411 OMP_CLAUSE_SET_CODE (t, code);
9412 OMP_CLAUSE_LOCATION (t) = loc;
9414 #ifdef GATHER_STATISTICS
9415 tree_node_counts[(int) omp_clause_kind]++;
9416 tree_node_sizes[(int) omp_clause_kind] += size;
9422 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9423 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9424 Except for the CODE and operand count field, other storage for the
9425 object is initialized to zeros. */
9428 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9431 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9433 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9434 gcc_assert (len >= 1);
9436 #ifdef GATHER_STATISTICS
9437 tree_node_counts[(int) e_kind]++;
9438 tree_node_sizes[(int) e_kind] += length;
9441 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9443 memset (t, 0, length);
9445 TREE_SET_CODE (t, code);
9447 /* Can't use TREE_OPERAND to store the length because if checking is
9448 enabled, it will try to check the length before we store it. :-P */
9449 t->exp.operands[0] = build_int_cst (sizetype, len);
9455 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9456 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9460 build_call_list (tree return_type, tree fn, tree arglist)
9465 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9466 TREE_TYPE (t) = return_type;
9467 CALL_EXPR_FN (t) = fn;
9468 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9469 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9470 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9471 process_call_operands (t);
9475 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9476 FN and a null static chain slot. NARGS is the number of call arguments
9477 which are specified as "..." arguments. */
9480 build_call_nary (tree return_type, tree fn, int nargs, ...)
9484 va_start (args, nargs);
9485 ret = build_call_valist (return_type, fn, nargs, args);
9490 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9491 FN and a null static chain slot. NARGS is the number of call arguments
9492 which are specified as a va_list ARGS. */
9495 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9500 t = build_vl_exp (CALL_EXPR, nargs + 3);
9501 TREE_TYPE (t) = return_type;
9502 CALL_EXPR_FN (t) = fn;
9503 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9504 for (i = 0; i < nargs; i++)
9505 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9506 process_call_operands (t);
9510 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9511 FN and a null static chain slot. NARGS is the number of call arguments
9512 which are specified as a tree array ARGS. */
9515 build_call_array_loc (location_t loc, tree return_type, tree fn,
9516 int nargs, const tree *args)
9521 t = build_vl_exp (CALL_EXPR, nargs + 3);
9522 TREE_TYPE (t) = return_type;
9523 CALL_EXPR_FN (t) = fn;
9524 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9525 for (i = 0; i < nargs; i++)
9526 CALL_EXPR_ARG (t, i) = args[i];
9527 process_call_operands (t);
9528 SET_EXPR_LOCATION (t, loc);
9532 /* Like build_call_array, but takes a VEC. */
9535 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9540 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9541 TREE_TYPE (ret) = return_type;
9542 CALL_EXPR_FN (ret) = fn;
9543 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9544 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9545 CALL_EXPR_ARG (ret, ix) = t;
9546 process_call_operands (ret);
9551 /* Returns true if it is possible to prove that the index of
9552 an array access REF (an ARRAY_REF expression) falls into the
9556 in_array_bounds_p (tree ref)
9558 tree idx = TREE_OPERAND (ref, 1);
9561 if (TREE_CODE (idx) != INTEGER_CST)
9564 min = array_ref_low_bound (ref);
9565 max = array_ref_up_bound (ref);
9568 || TREE_CODE (min) != INTEGER_CST
9569 || TREE_CODE (max) != INTEGER_CST)
9572 if (tree_int_cst_lt (idx, min)
9573 || tree_int_cst_lt (max, idx))
9579 /* Returns true if it is possible to prove that the range of
9580 an array access REF (an ARRAY_RANGE_REF expression) falls
9581 into the array bounds. */
9584 range_in_array_bounds_p (tree ref)
9586 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9587 tree range_min, range_max, min, max;
9589 range_min = TYPE_MIN_VALUE (domain_type);
9590 range_max = TYPE_MAX_VALUE (domain_type);
9593 || TREE_CODE (range_min) != INTEGER_CST
9594 || TREE_CODE (range_max) != INTEGER_CST)
9597 min = array_ref_low_bound (ref);
9598 max = array_ref_up_bound (ref);
9601 || TREE_CODE (min) != INTEGER_CST
9602 || TREE_CODE (max) != INTEGER_CST)
9605 if (tree_int_cst_lt (range_min, min)
9606 || tree_int_cst_lt (max, range_max))
9612 /* Return true if T (assumed to be a DECL) must be assigned a memory
9616 needs_to_live_in_memory (const_tree t)
9618 if (TREE_CODE (t) == SSA_NAME)
9619 t = SSA_NAME_VAR (t);
9621 return (TREE_ADDRESSABLE (t)
9622 || is_global_var (t)
9623 || (TREE_CODE (t) == RESULT_DECL
9624 && aggregate_value_p (t, current_function_decl)));
9627 /* There are situations in which a language considers record types
9628 compatible which have different field lists. Decide if two fields
9629 are compatible. It is assumed that the parent records are compatible. */
9632 fields_compatible_p (const_tree f1, const_tree f2)
9634 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9635 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9638 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9639 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9642 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9648 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9651 find_compatible_field (tree record, tree orig_field)
9655 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9656 if (TREE_CODE (f) == FIELD_DECL
9657 && fields_compatible_p (f, orig_field))
9660 /* ??? Why isn't this on the main fields list? */
9661 f = TYPE_VFIELD (record);
9662 if (f && TREE_CODE (f) == FIELD_DECL
9663 && fields_compatible_p (f, orig_field))
9666 /* ??? We should abort here, but Java appears to do Bad Things
9667 with inherited fields. */
9671 /* Return value of a constant X and sign-extend it. */
9674 int_cst_value (const_tree x)
9676 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9677 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9679 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9680 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9681 || TREE_INT_CST_HIGH (x) == -1);
9683 if (bits < HOST_BITS_PER_WIDE_INT)
9685 bool negative = ((val >> (bits - 1)) & 1) != 0;
9687 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9689 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9695 /* Return value of a constant X and sign-extend it. */
9698 widest_int_cst_value (const_tree x)
9700 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9701 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9703 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9704 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9705 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9706 << HOST_BITS_PER_WIDE_INT);
9708 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9709 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9710 || TREE_INT_CST_HIGH (x) == -1);
9713 if (bits < HOST_BITS_PER_WIDEST_INT)
9715 bool negative = ((val >> (bits - 1)) & 1) != 0;
9717 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9719 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9725 /* If TYPE is an integral type, return an equivalent type which is
9726 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9727 return TYPE itself. */
9730 signed_or_unsigned_type_for (int unsignedp, tree type)
9733 if (POINTER_TYPE_P (type))
9735 /* If the pointer points to the normal address space, use the
9736 size_type_node. Otherwise use an appropriate size for the pointer
9737 based on the named address space it points to. */
9738 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9741 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9744 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9747 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9750 /* Returns unsigned variant of TYPE. */
9753 unsigned_type_for (tree type)
9755 return signed_or_unsigned_type_for (1, type);
9758 /* Returns signed variant of TYPE. */
9761 signed_type_for (tree type)
9763 return signed_or_unsigned_type_for (0, type);
9766 /* Returns the largest value obtainable by casting something in INNER type to
9770 upper_bound_in_type (tree outer, tree inner)
9772 unsigned HOST_WIDE_INT lo, hi;
9773 unsigned int det = 0;
9774 unsigned oprec = TYPE_PRECISION (outer);
9775 unsigned iprec = TYPE_PRECISION (inner);
9778 /* Compute a unique number for every combination. */
9779 det |= (oprec > iprec) ? 4 : 0;
9780 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9781 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9783 /* Determine the exponent to use. */
9788 /* oprec <= iprec, outer: signed, inner: don't care. */
9793 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9797 /* oprec > iprec, outer: signed, inner: signed. */
9801 /* oprec > iprec, outer: signed, inner: unsigned. */
9805 /* oprec > iprec, outer: unsigned, inner: signed. */
9809 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9816 /* Compute 2^^prec - 1. */
9817 if (prec <= HOST_BITS_PER_WIDE_INT)
9820 lo = ((~(unsigned HOST_WIDE_INT) 0)
9821 >> (HOST_BITS_PER_WIDE_INT - prec));
9825 hi = ((~(unsigned HOST_WIDE_INT) 0)
9826 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9827 lo = ~(unsigned HOST_WIDE_INT) 0;
9830 return build_int_cst_wide (outer, lo, hi);
9833 /* Returns the smallest value obtainable by casting something in INNER type to
9837 lower_bound_in_type (tree outer, tree inner)
9839 unsigned HOST_WIDE_INT lo, hi;
9840 unsigned oprec = TYPE_PRECISION (outer);
9841 unsigned iprec = TYPE_PRECISION (inner);
9843 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9845 if (TYPE_UNSIGNED (outer)
9846 /* If we are widening something of an unsigned type, OUTER type
9847 contains all values of INNER type. In particular, both INNER
9848 and OUTER types have zero in common. */
9849 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9853 /* If we are widening a signed type to another signed type, we
9854 want to obtain -2^^(iprec-1). If we are keeping the
9855 precision or narrowing to a signed type, we want to obtain
9857 unsigned prec = oprec > iprec ? iprec : oprec;
9859 if (prec <= HOST_BITS_PER_WIDE_INT)
9861 hi = ~(unsigned HOST_WIDE_INT) 0;
9862 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9866 hi = ((~(unsigned HOST_WIDE_INT) 0)
9867 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9872 return build_int_cst_wide (outer, lo, hi);
9875 /* Return nonzero if two operands that are suitable for PHI nodes are
9876 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9877 SSA_NAME or invariant. Note that this is strictly an optimization.
9878 That is, callers of this function can directly call operand_equal_p
9879 and get the same result, only slower. */
9882 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9886 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9888 return operand_equal_p (arg0, arg1, 0);
9891 /* Returns number of zeros at the end of binary representation of X.
9893 ??? Use ffs if available? */
9896 num_ending_zeros (const_tree x)
9898 unsigned HOST_WIDE_INT fr, nfr;
9899 unsigned num, abits;
9900 tree type = TREE_TYPE (x);
9902 if (TREE_INT_CST_LOW (x) == 0)
9904 num = HOST_BITS_PER_WIDE_INT;
9905 fr = TREE_INT_CST_HIGH (x);
9910 fr = TREE_INT_CST_LOW (x);
9913 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9916 if (nfr << abits == fr)
9923 if (num > TYPE_PRECISION (type))
9924 num = TYPE_PRECISION (type);
9926 return build_int_cst_type (type, num);
9930 #define WALK_SUBTREE(NODE) \
9933 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9939 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9940 be walked whenever a type is seen in the tree. Rest of operands and return
9941 value are as for walk_tree. */
9944 walk_type_fields (tree type, walk_tree_fn func, void *data,
9945 struct pointer_set_t *pset, walk_tree_lh lh)
9947 tree result = NULL_TREE;
9949 switch (TREE_CODE (type))
9952 case REFERENCE_TYPE:
9953 /* We have to worry about mutually recursive pointers. These can't
9954 be written in C. They can in Ada. It's pathological, but
9955 there's an ACATS test (c38102a) that checks it. Deal with this
9956 by checking if we're pointing to another pointer, that one
9957 points to another pointer, that one does too, and we have no htab.
9958 If so, get a hash table. We check three levels deep to avoid
9959 the cost of the hash table if we don't need one. */
9960 if (POINTER_TYPE_P (TREE_TYPE (type))
9961 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9962 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9965 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9973 /* ... fall through ... */
9976 WALK_SUBTREE (TREE_TYPE (type));
9980 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9985 WALK_SUBTREE (TREE_TYPE (type));
9989 /* We never want to walk into default arguments. */
9990 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9991 WALK_SUBTREE (TREE_VALUE (arg));
9996 /* Don't follow this nodes's type if a pointer for fear that
9997 we'll have infinite recursion. If we have a PSET, then we
10000 || (!POINTER_TYPE_P (TREE_TYPE (type))
10001 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10002 WALK_SUBTREE (TREE_TYPE (type));
10003 WALK_SUBTREE (TYPE_DOMAIN (type));
10007 WALK_SUBTREE (TREE_TYPE (type));
10008 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10018 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10019 called with the DATA and the address of each sub-tree. If FUNC returns a
10020 non-NULL value, the traversal is stopped, and the value returned by FUNC
10021 is returned. If PSET is non-NULL it is used to record the nodes visited,
10022 and to avoid visiting a node more than once. */
10025 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10026 struct pointer_set_t *pset, walk_tree_lh lh)
10028 enum tree_code code;
10032 #define WALK_SUBTREE_TAIL(NODE) \
10036 goto tail_recurse; \
10041 /* Skip empty subtrees. */
10045 /* Don't walk the same tree twice, if the user has requested
10046 that we avoid doing so. */
10047 if (pset && pointer_set_insert (pset, *tp))
10050 /* Call the function. */
10052 result = (*func) (tp, &walk_subtrees, data);
10054 /* If we found something, return it. */
10058 code = TREE_CODE (*tp);
10060 /* Even if we didn't, FUNC may have decided that there was nothing
10061 interesting below this point in the tree. */
10062 if (!walk_subtrees)
10064 /* But we still need to check our siblings. */
10065 if (code == TREE_LIST)
10066 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10067 else if (code == OMP_CLAUSE)
10068 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10075 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10076 if (result || !walk_subtrees)
10083 case IDENTIFIER_NODE:
10090 case PLACEHOLDER_EXPR:
10094 /* None of these have subtrees other than those already walked
10099 WALK_SUBTREE (TREE_VALUE (*tp));
10100 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10105 int len = TREE_VEC_LENGTH (*tp);
10110 /* Walk all elements but the first. */
10112 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10114 /* Now walk the first one as a tail call. */
10115 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10119 WALK_SUBTREE (TREE_REALPART (*tp));
10120 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10124 unsigned HOST_WIDE_INT idx;
10125 constructor_elt *ce;
10128 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10130 WALK_SUBTREE (ce->value);
10135 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10140 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10142 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10143 into declarations that are just mentioned, rather than
10144 declared; they don't really belong to this part of the tree.
10145 And, we can see cycles: the initializer for a declaration
10146 can refer to the declaration itself. */
10147 WALK_SUBTREE (DECL_INITIAL (decl));
10148 WALK_SUBTREE (DECL_SIZE (decl));
10149 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10151 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10154 case STATEMENT_LIST:
10156 tree_stmt_iterator i;
10157 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10158 WALK_SUBTREE (*tsi_stmt_ptr (i));
10163 switch (OMP_CLAUSE_CODE (*tp))
10165 case OMP_CLAUSE_PRIVATE:
10166 case OMP_CLAUSE_SHARED:
10167 case OMP_CLAUSE_FIRSTPRIVATE:
10168 case OMP_CLAUSE_COPYIN:
10169 case OMP_CLAUSE_COPYPRIVATE:
10170 case OMP_CLAUSE_IF:
10171 case OMP_CLAUSE_NUM_THREADS:
10172 case OMP_CLAUSE_SCHEDULE:
10173 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10176 case OMP_CLAUSE_NOWAIT:
10177 case OMP_CLAUSE_ORDERED:
10178 case OMP_CLAUSE_DEFAULT:
10179 case OMP_CLAUSE_UNTIED:
10180 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10182 case OMP_CLAUSE_LASTPRIVATE:
10183 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10184 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10185 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10187 case OMP_CLAUSE_COLLAPSE:
10190 for (i = 0; i < 3; i++)
10191 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10192 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10195 case OMP_CLAUSE_REDUCTION:
10198 for (i = 0; i < 4; i++)
10199 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10200 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10204 gcc_unreachable ();
10212 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10213 But, we only want to walk once. */
10214 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10215 for (i = 0; i < len; ++i)
10216 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10217 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10221 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10222 defining. We only want to walk into these fields of a type in this
10223 case and not in the general case of a mere reference to the type.
10225 The criterion is as follows: if the field can be an expression, it
10226 must be walked only here. This should be in keeping with the fields
10227 that are directly gimplified in gimplify_type_sizes in order for the
10228 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10229 variable-sized types.
10231 Note that DECLs get walked as part of processing the BIND_EXPR. */
10232 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10234 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10235 if (TREE_CODE (*type_p) == ERROR_MARK)
10238 /* Call the function for the type. See if it returns anything or
10239 doesn't want us to continue. If we are to continue, walk both
10240 the normal fields and those for the declaration case. */
10241 result = (*func) (type_p, &walk_subtrees, data);
10242 if (result || !walk_subtrees)
10245 result = walk_type_fields (*type_p, func, data, pset, lh);
10249 /* If this is a record type, also walk the fields. */
10250 if (RECORD_OR_UNION_TYPE_P (*type_p))
10254 for (field = TYPE_FIELDS (*type_p); field;
10255 field = TREE_CHAIN (field))
10257 /* We'd like to look at the type of the field, but we can
10258 easily get infinite recursion. So assume it's pointed
10259 to elsewhere in the tree. Also, ignore things that
10261 if (TREE_CODE (field) != FIELD_DECL)
10264 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10265 WALK_SUBTREE (DECL_SIZE (field));
10266 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10267 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10268 WALK_SUBTREE (DECL_QUALIFIER (field));
10272 /* Same for scalar types. */
10273 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10274 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10275 || TREE_CODE (*type_p) == INTEGER_TYPE
10276 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10277 || TREE_CODE (*type_p) == REAL_TYPE)
10279 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10280 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10283 WALK_SUBTREE (TYPE_SIZE (*type_p));
10284 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10289 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10293 /* Walk over all the sub-trees of this operand. */
10294 len = TREE_OPERAND_LENGTH (*tp);
10296 /* Go through the subtrees. We need to do this in forward order so
10297 that the scope of a FOR_EXPR is handled properly. */
10300 for (i = 0; i < len - 1; ++i)
10301 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10302 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10305 /* If this is a type, walk the needed fields in the type. */
10306 else if (TYPE_P (*tp))
10307 return walk_type_fields (*tp, func, data, pset, lh);
10311 /* We didn't find what we were looking for. */
10314 #undef WALK_SUBTREE_TAIL
10316 #undef WALK_SUBTREE
10318 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10321 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10325 struct pointer_set_t *pset;
10327 pset = pointer_set_create ();
10328 result = walk_tree_1 (tp, func, data, pset, lh);
10329 pointer_set_destroy (pset);
10335 tree_block (tree t)
10337 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10339 if (IS_EXPR_CODE_CLASS (c))
10340 return &t->exp.block;
10341 gcc_unreachable ();
10345 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10346 FIXME: don't use this function. It exists for compatibility with
10347 the old representation of CALL_EXPRs where a list was used to hold the
10348 arguments. Places that currently extract the arglist from a CALL_EXPR
10349 ought to be rewritten to use the CALL_EXPR itself. */
10351 call_expr_arglist (tree exp)
10353 tree arglist = NULL_TREE;
10355 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10356 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10361 /* Create a nameless artificial label and put it in the current
10362 function context. The label has a location of LOC. Returns the
10363 newly created label. */
10366 create_artificial_label (location_t loc)
10368 tree lab = build_decl (loc,
10369 LABEL_DECL, NULL_TREE, void_type_node);
10371 DECL_ARTIFICIAL (lab) = 1;
10372 DECL_IGNORED_P (lab) = 1;
10373 DECL_CONTEXT (lab) = current_function_decl;
10377 /* Given a tree, try to return a useful variable name that we can use
10378 to prefix a temporary that is being assigned the value of the tree.
10379 I.E. given <temp> = &A, return A. */
10384 tree stripped_decl;
10387 STRIP_NOPS (stripped_decl);
10388 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10389 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10392 switch (TREE_CODE (stripped_decl))
10395 return get_name (TREE_OPERAND (stripped_decl, 0));
10402 /* Return true if TYPE has a variable argument list. */
10405 stdarg_p (tree fntype)
10407 function_args_iterator args_iter;
10408 tree n = NULL_TREE, t;
10413 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10418 return n != NULL_TREE && n != void_type_node;
10421 /* Return true if TYPE has a prototype. */
10424 prototype_p (tree fntype)
10428 gcc_assert (fntype != NULL_TREE);
10430 t = TYPE_ARG_TYPES (fntype);
10431 return (t != NULL_TREE);
10434 /* If BLOCK is inlined from an __attribute__((__artificial__))
10435 routine, return pointer to location from where it has been
10438 block_nonartificial_location (tree block)
10440 location_t *ret = NULL;
10442 while (block && TREE_CODE (block) == BLOCK
10443 && BLOCK_ABSTRACT_ORIGIN (block))
10445 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10447 while (TREE_CODE (ao) == BLOCK
10448 && BLOCK_ABSTRACT_ORIGIN (ao)
10449 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10450 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10452 if (TREE_CODE (ao) == FUNCTION_DECL)
10454 /* If AO is an artificial inline, point RET to the
10455 call site locus at which it has been inlined and continue
10456 the loop, in case AO's caller is also an artificial
10458 if (DECL_DECLARED_INLINE_P (ao)
10459 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10460 ret = &BLOCK_SOURCE_LOCATION (block);
10464 else if (TREE_CODE (ao) != BLOCK)
10467 block = BLOCK_SUPERCONTEXT (block);
10473 /* If EXP is inlined from an __attribute__((__artificial__))
10474 function, return the location of the original call expression. */
10477 tree_nonartificial_location (tree exp)
10479 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10484 return EXPR_LOCATION (exp);
10488 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10491 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10494 cl_option_hash_hash (const void *x)
10496 const_tree const t = (const_tree) x;
10500 hashval_t hash = 0;
10502 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10504 p = (const char *)TREE_OPTIMIZATION (t);
10505 len = sizeof (struct cl_optimization);
10508 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10510 p = (const char *)TREE_TARGET_OPTION (t);
10511 len = sizeof (struct cl_target_option);
10515 gcc_unreachable ();
10517 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10519 for (i = 0; i < len; i++)
10521 hash = (hash << 4) ^ ((i << 2) | p[i]);
10526 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10527 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10531 cl_option_hash_eq (const void *x, const void *y)
10533 const_tree const xt = (const_tree) x;
10534 const_tree const yt = (const_tree) y;
10539 if (TREE_CODE (xt) != TREE_CODE (yt))
10542 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10544 xp = (const char *)TREE_OPTIMIZATION (xt);
10545 yp = (const char *)TREE_OPTIMIZATION (yt);
10546 len = sizeof (struct cl_optimization);
10549 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10551 xp = (const char *)TREE_TARGET_OPTION (xt);
10552 yp = (const char *)TREE_TARGET_OPTION (yt);
10553 len = sizeof (struct cl_target_option);
10557 gcc_unreachable ();
10559 return (memcmp (xp, yp, len) == 0);
10562 /* Build an OPTIMIZATION_NODE based on the current options. */
10565 build_optimization_node (void)
10570 /* Use the cache of optimization nodes. */
10572 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10574 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10578 /* Insert this one into the hash table. */
10579 t = cl_optimization_node;
10582 /* Make a new node for next time round. */
10583 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10589 /* Build a TARGET_OPTION_NODE based on the current options. */
10592 build_target_option_node (void)
10597 /* Use the cache of optimization nodes. */
10599 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10601 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10605 /* Insert this one into the hash table. */
10606 t = cl_target_option_node;
10609 /* Make a new node for next time round. */
10610 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10616 /* Determine the "ultimate origin" of a block. The block may be an inlined
10617 instance of an inlined instance of a block which is local to an inline
10618 function, so we have to trace all of the way back through the origin chain
10619 to find out what sort of node actually served as the original seed for the
10623 block_ultimate_origin (const_tree block)
10625 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10627 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10628 nodes in the function to point to themselves; ignore that if
10629 we're trying to output the abstract instance of this function. */
10630 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10633 if (immediate_origin == NULL_TREE)
10638 tree lookahead = immediate_origin;
10642 ret_val = lookahead;
10643 lookahead = (TREE_CODE (ret_val) == BLOCK
10644 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10646 while (lookahead != NULL && lookahead != ret_val);
10648 /* The block's abstract origin chain may not be the *ultimate* origin of
10649 the block. It could lead to a DECL that has an abstract origin set.
10650 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10651 will give us if it has one). Note that DECL's abstract origins are
10652 supposed to be the most distant ancestor (or so decl_ultimate_origin
10653 claims), so we don't need to loop following the DECL origins. */
10654 if (DECL_P (ret_val))
10655 return DECL_ORIGIN (ret_val);
10661 /* Return true if T1 and T2 are equivalent lists. */
10664 list_equal_p (const_tree t1, const_tree t2)
10666 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10667 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10672 /* Return true iff conversion in EXP generates no instruction. Mark
10673 it inline so that we fully inline into the stripping functions even
10674 though we have two uses of this function. */
10677 tree_nop_conversion (const_tree exp)
10679 tree outer_type, inner_type;
10681 if (!CONVERT_EXPR_P (exp)
10682 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10684 if (TREE_OPERAND (exp, 0) == error_mark_node)
10687 outer_type = TREE_TYPE (exp);
10688 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10693 /* Use precision rather then machine mode when we can, which gives
10694 the correct answer even for submode (bit-field) types. */
10695 if ((INTEGRAL_TYPE_P (outer_type)
10696 || POINTER_TYPE_P (outer_type)
10697 || TREE_CODE (outer_type) == OFFSET_TYPE)
10698 && (INTEGRAL_TYPE_P (inner_type)
10699 || POINTER_TYPE_P (inner_type)
10700 || TREE_CODE (inner_type) == OFFSET_TYPE))
10701 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10703 /* Otherwise fall back on comparing machine modes (e.g. for
10704 aggregate types, floats). */
10705 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10708 /* Return true iff conversion in EXP generates no instruction. Don't
10709 consider conversions changing the signedness. */
10712 tree_sign_nop_conversion (const_tree exp)
10714 tree outer_type, inner_type;
10716 if (!tree_nop_conversion (exp))
10719 outer_type = TREE_TYPE (exp);
10720 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10722 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10723 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10726 /* Strip conversions from EXP according to tree_nop_conversion and
10727 return the resulting expression. */
10730 tree_strip_nop_conversions (tree exp)
10732 while (tree_nop_conversion (exp))
10733 exp = TREE_OPERAND (exp, 0);
10737 /* Strip conversions from EXP according to tree_sign_nop_conversion
10738 and return the resulting expression. */
10741 tree_strip_sign_nop_conversions (tree exp)
10743 while (tree_sign_nop_conversion (exp))
10744 exp = TREE_OPERAND (exp, 0);
10748 static GTY(()) tree gcc_eh_personality_decl;
10750 /* Return the GCC personality function decl. */
10753 lhd_gcc_personality (void)
10755 if (!gcc_eh_personality_decl)
10756 gcc_eh_personality_decl
10757 = build_personality_function (USING_SJLJ_EXCEPTIONS
10758 ? "__gcc_personality_sj0"
10759 : "__gcc_personality_v0");
10761 return gcc_eh_personality_decl;
10764 #include "gt-tree.h"