1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
148 #endif /* GATHER_STATISTICS */
150 /* Unique id for next decl created. */
151 static GTY(()) int next_decl_uid;
152 /* Unique id for next type created. */
153 static GTY(()) int next_type_uid = 1;
154 /* Unique id for next debug decl created. Use negative numbers,
155 to catch erroneous uses. */
156 static GTY(()) int next_debug_decl_uid;
158 /* Since we cannot rehash a type after it is in the table, we have to
159 keep the hash code. */
161 struct GTY(()) type_hash {
166 /* Initial size of the hash table (rounded to next prime). */
167 #define TYPE_HASH_INITIAL_SIZE 1000
169 /* Now here is the hash table. When recording a type, it is added to
170 the slot whose index is the hash code. Note that the hash table is
171 used for several kinds of types (function types, array types and
172 array index range types, for now). While all these live in the
173 same table, they are completely independent, and the hash code is
174 computed differently for each of these. */
176 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
177 htab_t type_hash_table;
179 /* Hash table and temporary node for larger integer const values. */
180 static GTY (()) tree int_cst_node;
181 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
182 htab_t int_cst_hash_table;
184 /* Hash table for optimization flags and target option flags. Use the same
185 hash table for both sets of options. Nodes for building the current
186 optimization and target option nodes. The assumption is most of the time
187 the options created will already be in the hash table, so we avoid
188 allocating and freeing up a node repeatably. */
189 static GTY (()) tree cl_optimization_node;
190 static GTY (()) tree cl_target_option_node;
191 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
192 htab_t cl_option_hash_table;
194 /* General tree->tree mapping structure for use in hash tables. */
197 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
198 htab_t debug_expr_for_decl;
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
201 htab_t value_expr_for_decl;
203 static GTY ((if_marked ("tree_priority_map_marked_p"),
204 param_is (struct tree_priority_map)))
205 htab_t init_priority_for_decl;
207 static void set_type_quals (tree, int);
208 static int type_hash_eq (const void *, const void *);
209 static hashval_t type_hash_hash (const void *);
210 static hashval_t int_cst_hash_hash (const void *);
211 static int int_cst_hash_eq (const void *, const void *);
212 static hashval_t cl_option_hash_hash (const void *);
213 static int cl_option_hash_eq (const void *, const void *);
214 static void print_type_hash_statistics (void);
215 static void print_debug_expr_statistics (void);
216 static void print_value_expr_statistics (void);
217 static int type_hash_marked_p (const void *);
218 static unsigned int type_hash_list (const_tree, hashval_t);
219 static unsigned int attribute_hash_list (const_tree, hashval_t);
221 tree global_trees[TI_MAX];
222 tree integer_types[itk_none];
224 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
226 /* Number of operands for each OpenMP clause. */
227 unsigned const char omp_clause_num_ops[] =
229 0, /* OMP_CLAUSE_ERROR */
230 1, /* OMP_CLAUSE_PRIVATE */
231 1, /* OMP_CLAUSE_SHARED */
232 1, /* OMP_CLAUSE_FIRSTPRIVATE */
233 2, /* OMP_CLAUSE_LASTPRIVATE */
234 4, /* OMP_CLAUSE_REDUCTION */
235 1, /* OMP_CLAUSE_COPYIN */
236 1, /* OMP_CLAUSE_COPYPRIVATE */
237 1, /* OMP_CLAUSE_IF */
238 1, /* OMP_CLAUSE_NUM_THREADS */
239 1, /* OMP_CLAUSE_SCHEDULE */
240 0, /* OMP_CLAUSE_NOWAIT */
241 0, /* OMP_CLAUSE_ORDERED */
242 0, /* OMP_CLAUSE_DEFAULT */
243 3, /* OMP_CLAUSE_COLLAPSE */
244 0 /* OMP_CLAUSE_UNTIED */
247 const char * const omp_clause_code_name[] =
268 /* Return the tree node structure used by tree code CODE. */
270 static inline enum tree_node_structure_enum
271 tree_node_structure_for_code (enum tree_code code)
273 switch (TREE_CODE_CLASS (code))
275 case tcc_declaration:
280 return TS_FIELD_DECL;
286 return TS_LABEL_DECL;
288 return TS_RESULT_DECL;
289 case DEBUG_EXPR_DECL:
292 return TS_CONST_DECL;
296 return TS_FUNCTION_DECL;
297 case TRANSLATION_UNIT_DECL:
298 return TS_TRANSLATION_UNIT_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);
469 case TS_TRANSLATION_UNIT_DECL:
470 MARK_TS_DECL_COMMON (code);
478 /* Basic consistency checks for attributes used in fold. */
479 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
480 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
481 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
488 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
489 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
490 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
494 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
495 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
496 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
503 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
504 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
505 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
507 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
508 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
509 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
510 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
511 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
512 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
513 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
514 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
515 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
516 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
517 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
520 #undef MARK_TS_COMMON
521 #undef MARK_TS_DECL_MINIMAL
522 #undef MARK_TS_DECL_COMMON
523 #undef MARK_TS_DECL_WRTL
524 #undef MARK_TS_DECL_WITH_VIS
525 #undef MARK_TS_DECL_NON_COMMON
534 /* Initialize the hash table of types. */
535 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
538 debug_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
539 tree_decl_map_eq, 0);
541 value_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
542 tree_decl_map_eq, 0);
543 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
544 tree_priority_map_eq, 0);
546 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
547 int_cst_hash_eq, NULL);
549 int_cst_node = make_node (INTEGER_CST);
551 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
552 cl_option_hash_eq, NULL);
554 cl_optimization_node = make_node (OPTIMIZATION_NODE);
555 cl_target_option_node = make_node (TARGET_OPTION_NODE);
557 /* Initialize the tree_contains_struct array. */
558 initialize_tree_contains_struct ();
559 lang_hooks.init_ts ();
563 /* The name of the object as the assembler will see it (but before any
564 translations made by ASM_OUTPUT_LABELREF). Often this is the same
565 as DECL_NAME. It is an IDENTIFIER_NODE. */
567 decl_assembler_name (tree decl)
569 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
570 lang_hooks.set_decl_assembler_name (decl);
571 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
574 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
577 decl_assembler_name_equal (tree decl, const_tree asmname)
579 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
580 const char *decl_str;
581 const char *asmname_str;
584 if (decl_asmname == asmname)
587 decl_str = IDENTIFIER_POINTER (decl_asmname);
588 asmname_str = IDENTIFIER_POINTER (asmname);
591 /* If the target assembler name was set by the user, things are trickier.
592 We have a leading '*' to begin with. After that, it's arguable what
593 is the correct thing to do with -fleading-underscore. Arguably, we've
594 historically been doing the wrong thing in assemble_alias by always
595 printing the leading underscore. Since we're not changing that, make
596 sure user_label_prefix follows the '*' before matching. */
597 if (decl_str[0] == '*')
599 size_t ulp_len = strlen (user_label_prefix);
605 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
606 decl_str += ulp_len, test=true;
610 if (asmname_str[0] == '*')
612 size_t ulp_len = strlen (user_label_prefix);
618 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
619 asmname_str += ulp_len, test=true;
626 return strcmp (decl_str, asmname_str) == 0;
629 /* Hash asmnames ignoring the user specified marks. */
632 decl_assembler_name_hash (const_tree asmname)
634 if (IDENTIFIER_POINTER (asmname)[0] == '*')
636 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
637 size_t ulp_len = strlen (user_label_prefix);
641 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
644 return htab_hash_string (decl_str);
647 return htab_hash_string (IDENTIFIER_POINTER (asmname));
650 /* Compute the number of bytes occupied by a tree with code CODE.
651 This function cannot be used for nodes that have variable sizes,
652 including TREE_VEC, STRING_CST, and CALL_EXPR. */
654 tree_code_size (enum tree_code code)
656 switch (TREE_CODE_CLASS (code))
658 case tcc_declaration: /* A decl node */
663 return sizeof (struct tree_field_decl);
665 return sizeof (struct tree_parm_decl);
667 return sizeof (struct tree_var_decl);
669 return sizeof (struct tree_label_decl);
671 return sizeof (struct tree_result_decl);
673 return sizeof (struct tree_const_decl);
675 return sizeof (struct tree_type_decl);
677 return sizeof (struct tree_function_decl);
678 case DEBUG_EXPR_DECL:
679 return sizeof (struct tree_decl_with_rtl);
681 return sizeof (struct tree_decl_non_common);
685 case tcc_type: /* a type node */
686 return sizeof (struct tree_type);
688 case tcc_reference: /* a reference */
689 case tcc_expression: /* an expression */
690 case tcc_statement: /* an expression with side effects */
691 case tcc_comparison: /* a comparison expression */
692 case tcc_unary: /* a unary arithmetic expression */
693 case tcc_binary: /* a binary arithmetic expression */
694 return (sizeof (struct tree_exp)
695 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
697 case tcc_constant: /* a constant */
700 case INTEGER_CST: return sizeof (struct tree_int_cst);
701 case REAL_CST: return sizeof (struct tree_real_cst);
702 case FIXED_CST: return sizeof (struct tree_fixed_cst);
703 case COMPLEX_CST: return sizeof (struct tree_complex);
704 case VECTOR_CST: return sizeof (struct tree_vector);
705 case STRING_CST: gcc_unreachable ();
707 return lang_hooks.tree_size (code);
710 case tcc_exceptional: /* something random, like an identifier. */
713 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
714 case TREE_LIST: return sizeof (struct tree_list);
717 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
720 case OMP_CLAUSE: gcc_unreachable ();
722 case SSA_NAME: return sizeof (struct tree_ssa_name);
724 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
725 case BLOCK: return sizeof (struct tree_block);
726 case CONSTRUCTOR: return sizeof (struct tree_constructor);
727 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
728 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
731 return lang_hooks.tree_size (code);
739 /* Compute the number of bytes occupied by NODE. This routine only
740 looks at TREE_CODE, except for those nodes that have variable sizes. */
742 tree_size (const_tree node)
744 const enum tree_code code = TREE_CODE (node);
748 return (offsetof (struct tree_binfo, base_binfos)
749 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
752 return (sizeof (struct tree_vec)
753 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
756 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
759 return (sizeof (struct tree_omp_clause)
760 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
764 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
765 return (sizeof (struct tree_exp)
766 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
768 return tree_code_size (code);
772 /* Return a newly allocated node of code CODE. For decl and type
773 nodes, some other fields are initialized. The rest of the node is
774 initialized to zero. This function cannot be used for TREE_VEC or
775 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
777 Achoo! I got a code in the node. */
780 make_node_stat (enum tree_code code MEM_STAT_DECL)
783 enum tree_code_class type = TREE_CODE_CLASS (code);
784 size_t length = tree_code_size (code);
785 #ifdef GATHER_STATISTICS
790 case tcc_declaration: /* A decl node */
794 case tcc_type: /* a type node */
798 case tcc_statement: /* an expression with side effects */
802 case tcc_reference: /* a reference */
806 case tcc_expression: /* an expression */
807 case tcc_comparison: /* a comparison expression */
808 case tcc_unary: /* a unary arithmetic expression */
809 case tcc_binary: /* a binary arithmetic expression */
813 case tcc_constant: /* a constant */
817 case tcc_exceptional: /* something random, like an identifier. */
820 case IDENTIFIER_NODE:
833 kind = ssa_name_kind;
854 tree_node_counts[(int) kind]++;
855 tree_node_sizes[(int) kind] += length;
858 t = ggc_alloc_zone_cleared_tree_node_stat (
859 (code == IDENTIFIER_NODE) ? &tree_id_zone : &tree_zone,
860 length PASS_MEM_STAT);
861 TREE_SET_CODE (t, code);
866 TREE_SIDE_EFFECTS (t) = 1;
869 case tcc_declaration:
870 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
872 if (code == FUNCTION_DECL)
874 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
875 DECL_MODE (t) = FUNCTION_MODE;
880 DECL_SOURCE_LOCATION (t) = input_location;
881 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
882 DECL_UID (t) = --next_debug_decl_uid;
885 DECL_UID (t) = next_decl_uid++;
886 SET_DECL_PT_UID (t, -1);
888 if (TREE_CODE (t) == LABEL_DECL)
889 LABEL_DECL_UID (t) = -1;
894 TYPE_UID (t) = next_type_uid++;
895 TYPE_ALIGN (t) = BITS_PER_UNIT;
896 TYPE_USER_ALIGN (t) = 0;
897 TYPE_MAIN_VARIANT (t) = t;
898 TYPE_CANONICAL (t) = t;
900 /* Default to no attributes for type, but let target change that. */
901 TYPE_ATTRIBUTES (t) = NULL_TREE;
902 targetm.set_default_type_attributes (t);
904 /* We have not yet computed the alias set for this type. */
905 TYPE_ALIAS_SET (t) = -1;
909 TREE_CONSTANT (t) = 1;
918 case PREDECREMENT_EXPR:
919 case PREINCREMENT_EXPR:
920 case POSTDECREMENT_EXPR:
921 case POSTINCREMENT_EXPR:
922 /* All of these have side-effects, no matter what their
924 TREE_SIDE_EFFECTS (t) = 1;
933 /* Other classes need no special treatment. */
940 /* Return a new node with the same contents as NODE except that its
941 TREE_CHAIN is zero and it has a fresh uid. */
944 copy_node_stat (tree node MEM_STAT_DECL)
947 enum tree_code code = TREE_CODE (node);
950 gcc_assert (code != STATEMENT_LIST);
952 length = tree_size (node);
953 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
954 memcpy (t, node, length);
957 TREE_ASM_WRITTEN (t) = 0;
958 TREE_VISITED (t) = 0;
959 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
960 *DECL_VAR_ANN_PTR (t) = 0;
962 if (TREE_CODE_CLASS (code) == tcc_declaration)
964 if (code == DEBUG_EXPR_DECL)
965 DECL_UID (t) = --next_debug_decl_uid;
968 DECL_UID (t) = next_decl_uid++;
969 if (DECL_PT_UID_SET_P (node))
970 SET_DECL_PT_UID (t, DECL_PT_UID (node));
972 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
973 && DECL_HAS_VALUE_EXPR_P (node))
975 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
976 DECL_HAS_VALUE_EXPR_P (t) = 1;
978 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
980 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
981 DECL_HAS_INIT_PRIORITY_P (t) = 1;
984 else if (TREE_CODE_CLASS (code) == tcc_type)
986 TYPE_UID (t) = next_type_uid++;
987 /* The following is so that the debug code for
988 the copy is different from the original type.
989 The two statements usually duplicate each other
990 (because they clear fields of the same union),
991 but the optimizer should catch that. */
992 TYPE_SYMTAB_POINTER (t) = 0;
993 TYPE_SYMTAB_ADDRESS (t) = 0;
995 /* Do not copy the values cache. */
996 if (TYPE_CACHED_VALUES_P(t))
998 TYPE_CACHED_VALUES_P (t) = 0;
999 TYPE_CACHED_VALUES (t) = NULL_TREE;
1006 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1007 For example, this can copy a list made of TREE_LIST nodes. */
1010 copy_list (tree list)
1018 head = prev = copy_node (list);
1019 next = TREE_CHAIN (list);
1022 TREE_CHAIN (prev) = copy_node (next);
1023 prev = TREE_CHAIN (prev);
1024 next = TREE_CHAIN (next);
1030 /* Create an INT_CST node with a LOW value sign extended. */
1033 build_int_cst (tree type, HOST_WIDE_INT low)
1035 /* Support legacy code. */
1037 type = integer_type_node;
1039 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1042 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1043 if it is negative. This function is similar to build_int_cst, but
1044 the extra bits outside of the type precision are cleared. Constants
1045 with these extra bits may confuse the fold so that it detects overflows
1046 even in cases when they do not occur, and in general should be avoided.
1047 We cannot however make this a default behavior of build_int_cst without
1048 more intrusive changes, since there are parts of gcc that rely on the extra
1049 precision of the integer constants. */
1052 build_int_cst_type (tree type, HOST_WIDE_INT low)
1056 return double_int_to_tree (type, shwi_to_double_int (low));
1059 /* Constructs tree in type TYPE from with value given by CST. Signedness
1060 of CST is assumed to be the same as the signedness of TYPE. */
1063 double_int_to_tree (tree type, double_int cst)
1065 /* Size types *are* sign extended. */
1066 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1067 || (TREE_CODE (type) == INTEGER_TYPE
1068 && TYPE_IS_SIZETYPE (type)));
1070 cst = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1072 return build_int_cst_wide (type, cst.low, cst.high);
1075 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1076 to be the same as the signedness of TYPE. */
1079 double_int_fits_to_tree_p (const_tree type, double_int cst)
1081 /* Size types *are* sign extended. */
1082 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1083 || (TREE_CODE (type) == INTEGER_TYPE
1084 && TYPE_IS_SIZETYPE (type)));
1087 = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1089 return double_int_equal_p (cst, ext);
1092 /* We force the double_int CST to the range of the type TYPE by sign or
1093 zero extending it. OVERFLOWABLE indicates if we are interested in
1094 overflow of the value, when >0 we are only interested in signed
1095 overflow, for <0 we are interested in any overflow. OVERFLOWED
1096 indicates whether overflow has already occurred. CONST_OVERFLOWED
1097 indicates whether constant overflow has already occurred. We force
1098 T's value to be within range of T's type (by setting to 0 or 1 all
1099 the bits outside the type's range). We set TREE_OVERFLOWED if,
1100 OVERFLOWED is nonzero,
1101 or OVERFLOWABLE is >0 and signed overflow occurs
1102 or OVERFLOWABLE is <0 and any overflow occurs
1103 We return a new tree node for the extended double_int. The node
1104 is shared if no overflow flags are set. */
1108 force_fit_type_double (tree type, double_int cst, int overflowable,
1111 bool sign_extended_type;
1113 /* Size types *are* sign extended. */
1114 sign_extended_type = (!TYPE_UNSIGNED (type)
1115 || (TREE_CODE (type) == INTEGER_TYPE
1116 && TYPE_IS_SIZETYPE (type)));
1118 /* If we need to set overflow flags, return a new unshared node. */
1119 if (overflowed || !double_int_fits_to_tree_p(type, cst))
1123 || (overflowable > 0 && sign_extended_type))
1125 tree t = make_node (INTEGER_CST);
1126 TREE_INT_CST (t) = double_int_ext (cst, TYPE_PRECISION (type),
1127 !sign_extended_type);
1128 TREE_TYPE (t) = type;
1129 TREE_OVERFLOW (t) = 1;
1134 /* Else build a shared node. */
1135 return double_int_to_tree (type, cst);
1138 /* These are the hash table functions for the hash table of INTEGER_CST
1139 nodes of a sizetype. */
1141 /* Return the hash code code X, an INTEGER_CST. */
1144 int_cst_hash_hash (const void *x)
1146 const_tree const t = (const_tree) x;
1148 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1149 ^ htab_hash_pointer (TREE_TYPE (t)));
1152 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1153 is the same as that given by *Y, which is the same. */
1156 int_cst_hash_eq (const void *x, const void *y)
1158 const_tree const xt = (const_tree) x;
1159 const_tree const yt = (const_tree) y;
1161 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1162 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1163 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1166 /* Create an INT_CST node of TYPE and value HI:LOW.
1167 The returned node is always shared. For small integers we use a
1168 per-type vector cache, for larger ones we use a single hash table. */
1171 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1179 switch (TREE_CODE (type))
1182 gcc_assert (hi == 0 && low == 0);
1186 case REFERENCE_TYPE:
1187 /* Cache NULL pointer. */
1196 /* Cache false or true. */
1204 if (TYPE_UNSIGNED (type))
1207 limit = INTEGER_SHARE_LIMIT;
1208 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1214 limit = INTEGER_SHARE_LIMIT + 1;
1215 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1217 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1231 /* Look for it in the type's vector of small shared ints. */
1232 if (!TYPE_CACHED_VALUES_P (type))
1234 TYPE_CACHED_VALUES_P (type) = 1;
1235 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1238 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1241 /* Make sure no one is clobbering the shared constant. */
1242 gcc_assert (TREE_TYPE (t) == type);
1243 gcc_assert (TREE_INT_CST_LOW (t) == low);
1244 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1248 /* Create a new shared int. */
1249 t = make_node (INTEGER_CST);
1251 TREE_INT_CST_LOW (t) = low;
1252 TREE_INT_CST_HIGH (t) = hi;
1253 TREE_TYPE (t) = type;
1255 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1260 /* Use the cache of larger shared ints. */
1263 TREE_INT_CST_LOW (int_cst_node) = low;
1264 TREE_INT_CST_HIGH (int_cst_node) = hi;
1265 TREE_TYPE (int_cst_node) = type;
1267 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1271 /* Insert this one into the hash table. */
1274 /* Make a new node for next time round. */
1275 int_cst_node = make_node (INTEGER_CST);
1282 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1283 and the rest are zeros. */
1286 build_low_bits_mask (tree type, unsigned bits)
1290 gcc_assert (bits <= TYPE_PRECISION (type));
1292 if (bits == TYPE_PRECISION (type)
1293 && !TYPE_UNSIGNED (type))
1294 /* Sign extended all-ones mask. */
1295 mask = double_int_minus_one;
1297 mask = double_int_mask (bits);
1299 return build_int_cst_wide (type, mask.low, mask.high);
1302 /* Checks that X is integer constant that can be expressed in (unsigned)
1303 HOST_WIDE_INT without loss of precision. */
1306 cst_and_fits_in_hwi (const_tree x)
1308 if (TREE_CODE (x) != INTEGER_CST)
1311 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1314 return (TREE_INT_CST_HIGH (x) == 0
1315 || TREE_INT_CST_HIGH (x) == -1);
1318 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1319 are in a list pointed to by VALS. */
1322 build_vector (tree type, tree vals)
1324 tree v = make_node (VECTOR_CST);
1329 TREE_VECTOR_CST_ELTS (v) = vals;
1330 TREE_TYPE (v) = type;
1332 /* Iterate through elements and check for overflow. */
1333 for (link = vals; link; link = TREE_CHAIN (link))
1335 tree value = TREE_VALUE (link);
1338 /* Don't crash if we get an address constant. */
1339 if (!CONSTANT_CLASS_P (value))
1342 over |= TREE_OVERFLOW (value);
1345 gcc_assert (cnt == TYPE_VECTOR_SUBPARTS (type));
1347 TREE_OVERFLOW (v) = over;
1351 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1352 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1355 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1357 tree list = NULL_TREE;
1358 unsigned HOST_WIDE_INT idx;
1361 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1362 list = tree_cons (NULL_TREE, value, list);
1363 for (; idx < TYPE_VECTOR_SUBPARTS (type); ++idx)
1364 list = tree_cons (NULL_TREE,
1365 fold_convert (TREE_TYPE (type), integer_zero_node), list);
1366 return build_vector (type, nreverse (list));
1369 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1370 are in the VEC pointed to by VALS. */
1372 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1374 tree c = make_node (CONSTRUCTOR);
1376 constructor_elt *elt;
1377 bool constant_p = true;
1379 TREE_TYPE (c) = type;
1380 CONSTRUCTOR_ELTS (c) = vals;
1382 FOR_EACH_VEC_ELT (constructor_elt, vals, i, elt)
1383 if (!TREE_CONSTANT (elt->value))
1389 TREE_CONSTANT (c) = constant_p;
1394 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1397 build_constructor_single (tree type, tree index, tree value)
1399 VEC(constructor_elt,gc) *v;
1400 constructor_elt *elt;
1402 v = VEC_alloc (constructor_elt, gc, 1);
1403 elt = VEC_quick_push (constructor_elt, v, NULL);
1407 return build_constructor (type, v);
1411 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1412 are in a list pointed to by VALS. */
1414 build_constructor_from_list (tree type, tree vals)
1417 VEC(constructor_elt,gc) *v = NULL;
1421 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1422 for (t = vals; t; t = TREE_CHAIN (t))
1423 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1426 return build_constructor (type, v);
1429 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1432 build_fixed (tree type, FIXED_VALUE_TYPE f)
1435 FIXED_VALUE_TYPE *fp;
1437 v = make_node (FIXED_CST);
1438 fp = ggc_alloc_fixed_value ();
1439 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1441 TREE_TYPE (v) = type;
1442 TREE_FIXED_CST_PTR (v) = fp;
1446 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1449 build_real (tree type, REAL_VALUE_TYPE d)
1452 REAL_VALUE_TYPE *dp;
1455 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1456 Consider doing it via real_convert now. */
1458 v = make_node (REAL_CST);
1459 dp = ggc_alloc_real_value ();
1460 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1462 TREE_TYPE (v) = type;
1463 TREE_REAL_CST_PTR (v) = dp;
1464 TREE_OVERFLOW (v) = overflow;
1468 /* Return a new REAL_CST node whose type is TYPE
1469 and whose value is the integer value of the INTEGER_CST node I. */
1472 real_value_from_int_cst (const_tree type, const_tree i)
1476 /* Clear all bits of the real value type so that we can later do
1477 bitwise comparisons to see if two values are the same. */
1478 memset (&d, 0, sizeof d);
1480 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1481 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1482 TYPE_UNSIGNED (TREE_TYPE (i)));
1486 /* Given a tree representing an integer constant I, return a tree
1487 representing the same value as a floating-point constant of type TYPE. */
1490 build_real_from_int_cst (tree type, const_tree i)
1493 int overflow = TREE_OVERFLOW (i);
1495 v = build_real (type, real_value_from_int_cst (type, i));
1497 TREE_OVERFLOW (v) |= overflow;
1501 /* Return a newly constructed STRING_CST node whose value is
1502 the LEN characters at STR.
1503 The TREE_TYPE is not initialized. */
1506 build_string (int len, const char *str)
1511 /* Do not waste bytes provided by padding of struct tree_string. */
1512 length = len + offsetof (struct tree_string, str) + 1;
1514 #ifdef GATHER_STATISTICS
1515 tree_node_counts[(int) c_kind]++;
1516 tree_node_sizes[(int) c_kind] += length;
1519 s = ggc_alloc_tree_node (length);
1521 memset (s, 0, sizeof (struct tree_common));
1522 TREE_SET_CODE (s, STRING_CST);
1523 TREE_CONSTANT (s) = 1;
1524 TREE_STRING_LENGTH (s) = len;
1525 memcpy (s->string.str, str, len);
1526 s->string.str[len] = '\0';
1531 /* Return a newly constructed COMPLEX_CST node whose value is
1532 specified by the real and imaginary parts REAL and IMAG.
1533 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1534 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1537 build_complex (tree type, tree real, tree imag)
1539 tree t = make_node (COMPLEX_CST);
1541 TREE_REALPART (t) = real;
1542 TREE_IMAGPART (t) = imag;
1543 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1544 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1548 /* Return a constant of arithmetic type TYPE which is the
1549 multiplicative identity of the set TYPE. */
1552 build_one_cst (tree type)
1554 switch (TREE_CODE (type))
1556 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1557 case POINTER_TYPE: case REFERENCE_TYPE:
1559 return build_int_cst (type, 1);
1562 return build_real (type, dconst1);
1564 case FIXED_POINT_TYPE:
1565 /* We can only generate 1 for accum types. */
1566 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1567 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1574 scalar = build_one_cst (TREE_TYPE (type));
1576 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1578 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1579 cst = tree_cons (NULL_TREE, scalar, cst);
1581 return build_vector (type, cst);
1585 return build_complex (type,
1586 build_one_cst (TREE_TYPE (type)),
1587 fold_convert (TREE_TYPE (type), integer_zero_node));
1594 /* Build 0 constant of type TYPE. This is used by constructor folding and thus
1595 the constant should correspond zero in memory representation. */
1598 build_zero_cst (tree type)
1600 if (!AGGREGATE_TYPE_P (type))
1601 return fold_convert (type, integer_zero_node);
1602 return build_constructor (type, NULL);
1606 /* Build a BINFO with LEN language slots. */
1609 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1612 size_t length = (offsetof (struct tree_binfo, base_binfos)
1613 + VEC_embedded_size (tree, base_binfos));
1615 #ifdef GATHER_STATISTICS
1616 tree_node_counts[(int) binfo_kind]++;
1617 tree_node_sizes[(int) binfo_kind] += length;
1620 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1622 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1624 TREE_SET_CODE (t, TREE_BINFO);
1626 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1632 /* Build a newly constructed TREE_VEC node of length LEN. */
1635 make_tree_vec_stat (int len MEM_STAT_DECL)
1638 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1640 #ifdef GATHER_STATISTICS
1641 tree_node_counts[(int) vec_kind]++;
1642 tree_node_sizes[(int) vec_kind] += length;
1645 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1647 TREE_SET_CODE (t, TREE_VEC);
1648 TREE_VEC_LENGTH (t) = len;
1653 /* Return 1 if EXPR is the integer constant zero or a complex constant
1657 integer_zerop (const_tree expr)
1661 return ((TREE_CODE (expr) == INTEGER_CST
1662 && TREE_INT_CST_LOW (expr) == 0
1663 && TREE_INT_CST_HIGH (expr) == 0)
1664 || (TREE_CODE (expr) == COMPLEX_CST
1665 && integer_zerop (TREE_REALPART (expr))
1666 && integer_zerop (TREE_IMAGPART (expr))));
1669 /* Return 1 if EXPR is the integer constant one or the corresponding
1670 complex constant. */
1673 integer_onep (const_tree expr)
1677 return ((TREE_CODE (expr) == INTEGER_CST
1678 && TREE_INT_CST_LOW (expr) == 1
1679 && TREE_INT_CST_HIGH (expr) == 0)
1680 || (TREE_CODE (expr) == COMPLEX_CST
1681 && integer_onep (TREE_REALPART (expr))
1682 && integer_zerop (TREE_IMAGPART (expr))));
1685 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1686 it contains. Likewise for the corresponding complex constant. */
1689 integer_all_onesp (const_tree expr)
1696 if (TREE_CODE (expr) == COMPLEX_CST
1697 && integer_all_onesp (TREE_REALPART (expr))
1698 && integer_zerop (TREE_IMAGPART (expr)))
1701 else if (TREE_CODE (expr) != INTEGER_CST)
1704 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1705 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1706 && TREE_INT_CST_HIGH (expr) == -1)
1711 /* Note that using TYPE_PRECISION here is wrong. We care about the
1712 actual bits, not the (arbitrary) range of the type. */
1713 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1714 if (prec >= HOST_BITS_PER_WIDE_INT)
1716 HOST_WIDE_INT high_value;
1719 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1721 /* Can not handle precisions greater than twice the host int size. */
1722 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1723 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1724 /* Shifting by the host word size is undefined according to the ANSI
1725 standard, so we must handle this as a special case. */
1728 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1730 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1731 && TREE_INT_CST_HIGH (expr) == high_value);
1734 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1737 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1741 integer_pow2p (const_tree expr)
1744 HOST_WIDE_INT high, low;
1748 if (TREE_CODE (expr) == COMPLEX_CST
1749 && integer_pow2p (TREE_REALPART (expr))
1750 && integer_zerop (TREE_IMAGPART (expr)))
1753 if (TREE_CODE (expr) != INTEGER_CST)
1756 prec = TYPE_PRECISION (TREE_TYPE (expr));
1757 high = TREE_INT_CST_HIGH (expr);
1758 low = TREE_INT_CST_LOW (expr);
1760 /* First clear all bits that are beyond the type's precision in case
1761 we've been sign extended. */
1763 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1765 else if (prec > HOST_BITS_PER_WIDE_INT)
1766 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1770 if (prec < HOST_BITS_PER_WIDE_INT)
1771 low &= ~((HOST_WIDE_INT) (-1) << prec);
1774 if (high == 0 && low == 0)
1777 return ((high == 0 && (low & (low - 1)) == 0)
1778 || (low == 0 && (high & (high - 1)) == 0));
1781 /* Return 1 if EXPR is an integer constant other than zero or a
1782 complex constant other than zero. */
1785 integer_nonzerop (const_tree expr)
1789 return ((TREE_CODE (expr) == INTEGER_CST
1790 && (TREE_INT_CST_LOW (expr) != 0
1791 || TREE_INT_CST_HIGH (expr) != 0))
1792 || (TREE_CODE (expr) == COMPLEX_CST
1793 && (integer_nonzerop (TREE_REALPART (expr))
1794 || integer_nonzerop (TREE_IMAGPART (expr)))));
1797 /* Return 1 if EXPR is the fixed-point constant zero. */
1800 fixed_zerop (const_tree expr)
1802 return (TREE_CODE (expr) == FIXED_CST
1803 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1806 /* Return the power of two represented by a tree node known to be a
1810 tree_log2 (const_tree expr)
1813 HOST_WIDE_INT high, low;
1817 if (TREE_CODE (expr) == COMPLEX_CST)
1818 return tree_log2 (TREE_REALPART (expr));
1820 prec = TYPE_PRECISION (TREE_TYPE (expr));
1821 high = TREE_INT_CST_HIGH (expr);
1822 low = TREE_INT_CST_LOW (expr);
1824 /* First clear all bits that are beyond the type's precision in case
1825 we've been sign extended. */
1827 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1829 else if (prec > HOST_BITS_PER_WIDE_INT)
1830 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1834 if (prec < HOST_BITS_PER_WIDE_INT)
1835 low &= ~((HOST_WIDE_INT) (-1) << prec);
1838 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1839 : exact_log2 (low));
1842 /* Similar, but return the largest integer Y such that 2 ** Y is less
1843 than or equal to EXPR. */
1846 tree_floor_log2 (const_tree expr)
1849 HOST_WIDE_INT high, low;
1853 if (TREE_CODE (expr) == COMPLEX_CST)
1854 return tree_log2 (TREE_REALPART (expr));
1856 prec = TYPE_PRECISION (TREE_TYPE (expr));
1857 high = TREE_INT_CST_HIGH (expr);
1858 low = TREE_INT_CST_LOW (expr);
1860 /* First clear all bits that are beyond the type's precision in case
1861 we've been sign extended. Ignore if type's precision hasn't been set
1862 since what we are doing is setting it. */
1864 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1866 else if (prec > HOST_BITS_PER_WIDE_INT)
1867 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1871 if (prec < HOST_BITS_PER_WIDE_INT)
1872 low &= ~((HOST_WIDE_INT) (-1) << prec);
1875 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1876 : floor_log2 (low));
1879 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1880 decimal float constants, so don't return 1 for them. */
1883 real_zerop (const_tree expr)
1887 return ((TREE_CODE (expr) == REAL_CST
1888 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1889 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1890 || (TREE_CODE (expr) == COMPLEX_CST
1891 && real_zerop (TREE_REALPART (expr))
1892 && real_zerop (TREE_IMAGPART (expr))));
1895 /* Return 1 if EXPR is the real constant one in real or complex form.
1896 Trailing zeroes matter for decimal float constants, so don't return
1900 real_onep (const_tree expr)
1904 return ((TREE_CODE (expr) == REAL_CST
1905 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1906 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1907 || (TREE_CODE (expr) == COMPLEX_CST
1908 && real_onep (TREE_REALPART (expr))
1909 && real_zerop (TREE_IMAGPART (expr))));
1912 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1913 for decimal float constants, so don't return 1 for them. */
1916 real_twop (const_tree expr)
1920 return ((TREE_CODE (expr) == REAL_CST
1921 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1922 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1923 || (TREE_CODE (expr) == COMPLEX_CST
1924 && real_twop (TREE_REALPART (expr))
1925 && real_zerop (TREE_IMAGPART (expr))));
1928 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1929 matter for decimal float constants, so don't return 1 for them. */
1932 real_minus_onep (const_tree expr)
1936 return ((TREE_CODE (expr) == REAL_CST
1937 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1938 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1939 || (TREE_CODE (expr) == COMPLEX_CST
1940 && real_minus_onep (TREE_REALPART (expr))
1941 && real_zerop (TREE_IMAGPART (expr))));
1944 /* Nonzero if EXP is a constant or a cast of a constant. */
1947 really_constant_p (const_tree exp)
1949 /* This is not quite the same as STRIP_NOPS. It does more. */
1950 while (CONVERT_EXPR_P (exp)
1951 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1952 exp = TREE_OPERAND (exp, 0);
1953 return TREE_CONSTANT (exp);
1956 /* Return first list element whose TREE_VALUE is ELEM.
1957 Return 0 if ELEM is not in LIST. */
1960 value_member (tree elem, tree list)
1964 if (elem == TREE_VALUE (list))
1966 list = TREE_CHAIN (list);
1971 /* Return first list element whose TREE_PURPOSE is ELEM.
1972 Return 0 if ELEM is not in LIST. */
1975 purpose_member (const_tree elem, tree list)
1979 if (elem == TREE_PURPOSE (list))
1981 list = TREE_CHAIN (list);
1986 /* Return true if ELEM is in V. */
1989 vec_member (const_tree elem, VEC(tree,gc) *v)
1993 FOR_EACH_VEC_ELT (tree, v, ix, t)
1999 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2003 chain_index (int idx, tree chain)
2005 for (; chain && idx > 0; --idx)
2006 chain = TREE_CHAIN (chain);
2010 /* Return nonzero if ELEM is part of the chain CHAIN. */
2013 chain_member (const_tree elem, const_tree chain)
2019 chain = DECL_CHAIN (chain);
2025 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2026 We expect a null pointer to mark the end of the chain.
2027 This is the Lisp primitive `length'. */
2030 list_length (const_tree t)
2033 #ifdef ENABLE_TREE_CHECKING
2041 #ifdef ENABLE_TREE_CHECKING
2044 gcc_assert (p != q);
2052 /* Returns the number of FIELD_DECLs in TYPE. */
2055 fields_length (const_tree type)
2057 tree t = TYPE_FIELDS (type);
2060 for (; t; t = DECL_CHAIN (t))
2061 if (TREE_CODE (t) == FIELD_DECL)
2067 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2068 UNION_TYPE TYPE, or NULL_TREE if none. */
2071 first_field (const_tree type)
2073 tree t = TYPE_FIELDS (type);
2074 while (t && TREE_CODE (t) != FIELD_DECL)
2079 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2080 by modifying the last node in chain 1 to point to chain 2.
2081 This is the Lisp primitive `nconc'. */
2084 chainon (tree op1, tree op2)
2093 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2095 TREE_CHAIN (t1) = op2;
2097 #ifdef ENABLE_TREE_CHECKING
2100 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2101 gcc_assert (t2 != t1);
2108 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2111 tree_last (tree chain)
2115 while ((next = TREE_CHAIN (chain)))
2120 /* Reverse the order of elements in the chain T,
2121 and return the new head of the chain (old last element). */
2126 tree prev = 0, decl, next;
2127 for (decl = t; decl; decl = next)
2129 /* We shouldn't be using this function to reverse BLOCK chains; we
2130 have blocks_nreverse for that. */
2131 gcc_checking_assert (TREE_CODE (decl) != BLOCK);
2132 next = TREE_CHAIN (decl);
2133 TREE_CHAIN (decl) = prev;
2139 /* Return a newly created TREE_LIST node whose
2140 purpose and value fields are PARM and VALUE. */
2143 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2145 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2146 TREE_PURPOSE (t) = parm;
2147 TREE_VALUE (t) = value;
2151 /* Build a chain of TREE_LIST nodes from a vector. */
2154 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2156 tree ret = NULL_TREE;
2160 FOR_EACH_VEC_ELT (tree, vec, i, t)
2162 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2163 pp = &TREE_CHAIN (*pp);
2168 /* Return a newly created TREE_LIST node whose
2169 purpose and value fields are PURPOSE and VALUE
2170 and whose TREE_CHAIN is CHAIN. */
2173 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2177 node = ggc_alloc_zone_tree_node_stat (&tree_zone, sizeof (struct tree_list)
2179 memset (node, 0, sizeof (struct tree_common));
2181 #ifdef GATHER_STATISTICS
2182 tree_node_counts[(int) x_kind]++;
2183 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2186 TREE_SET_CODE (node, TREE_LIST);
2187 TREE_CHAIN (node) = chain;
2188 TREE_PURPOSE (node) = purpose;
2189 TREE_VALUE (node) = value;
2193 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2197 ctor_to_vec (tree ctor)
2199 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2203 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2204 VEC_quick_push (tree, vec, val);
2209 /* Return the size nominally occupied by an object of type TYPE
2210 when it resides in memory. The value is measured in units of bytes,
2211 and its data type is that normally used for type sizes
2212 (which is the first type created by make_signed_type or
2213 make_unsigned_type). */
2216 size_in_bytes (const_tree type)
2220 if (type == error_mark_node)
2221 return integer_zero_node;
2223 type = TYPE_MAIN_VARIANT (type);
2224 t = TYPE_SIZE_UNIT (type);
2228 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2229 return size_zero_node;
2235 /* Return the size of TYPE (in bytes) as a wide integer
2236 or return -1 if the size can vary or is larger than an integer. */
2239 int_size_in_bytes (const_tree type)
2243 if (type == error_mark_node)
2246 type = TYPE_MAIN_VARIANT (type);
2247 t = TYPE_SIZE_UNIT (type);
2249 || TREE_CODE (t) != INTEGER_CST
2250 || TREE_INT_CST_HIGH (t) != 0
2251 /* If the result would appear negative, it's too big to represent. */
2252 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2255 return TREE_INT_CST_LOW (t);
2258 /* Return the maximum size of TYPE (in bytes) as a wide integer
2259 or return -1 if the size can vary or is larger than an integer. */
2262 max_int_size_in_bytes (const_tree type)
2264 HOST_WIDE_INT size = -1;
2267 /* If this is an array type, check for a possible MAX_SIZE attached. */
2269 if (TREE_CODE (type) == ARRAY_TYPE)
2271 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2273 if (size_tree && host_integerp (size_tree, 1))
2274 size = tree_low_cst (size_tree, 1);
2277 /* If we still haven't been able to get a size, see if the language
2278 can compute a maximum size. */
2282 size_tree = lang_hooks.types.max_size (type);
2284 if (size_tree && host_integerp (size_tree, 1))
2285 size = tree_low_cst (size_tree, 1);
2291 /* Returns a tree for the size of EXP in bytes. */
2294 tree_expr_size (const_tree exp)
2297 && DECL_SIZE_UNIT (exp) != 0)
2298 return DECL_SIZE_UNIT (exp);
2300 return size_in_bytes (TREE_TYPE (exp));
2303 /* Return the bit position of FIELD, in bits from the start of the record.
2304 This is a tree of type bitsizetype. */
2307 bit_position (const_tree field)
2309 return bit_from_pos (DECL_FIELD_OFFSET (field),
2310 DECL_FIELD_BIT_OFFSET (field));
2313 /* Likewise, but return as an integer. It must be representable in
2314 that way (since it could be a signed value, we don't have the
2315 option of returning -1 like int_size_in_byte can. */
2318 int_bit_position (const_tree field)
2320 return tree_low_cst (bit_position (field), 0);
2323 /* Return the byte position of FIELD, in bytes from the start of the record.
2324 This is a tree of type sizetype. */
2327 byte_position (const_tree field)
2329 return byte_from_pos (DECL_FIELD_OFFSET (field),
2330 DECL_FIELD_BIT_OFFSET (field));
2333 /* Likewise, but return as an integer. It must be representable in
2334 that way (since it could be a signed value, we don't have the
2335 option of returning -1 like int_size_in_byte can. */
2338 int_byte_position (const_tree field)
2340 return tree_low_cst (byte_position (field), 0);
2343 /* Return the strictest alignment, in bits, that T is known to have. */
2346 expr_align (const_tree t)
2348 unsigned int align0, align1;
2350 switch (TREE_CODE (t))
2352 CASE_CONVERT: case NON_LVALUE_EXPR:
2353 /* If we have conversions, we know that the alignment of the
2354 object must meet each of the alignments of the types. */
2355 align0 = expr_align (TREE_OPERAND (t, 0));
2356 align1 = TYPE_ALIGN (TREE_TYPE (t));
2357 return MAX (align0, align1);
2359 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2360 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2361 case CLEANUP_POINT_EXPR:
2362 /* These don't change the alignment of an object. */
2363 return expr_align (TREE_OPERAND (t, 0));
2366 /* The best we can do is say that the alignment is the least aligned
2368 align0 = expr_align (TREE_OPERAND (t, 1));
2369 align1 = expr_align (TREE_OPERAND (t, 2));
2370 return MIN (align0, align1);
2372 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2373 meaningfully, it's always 1. */
2374 case LABEL_DECL: case CONST_DECL:
2375 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2377 gcc_assert (DECL_ALIGN (t) != 0);
2378 return DECL_ALIGN (t);
2384 /* Otherwise take the alignment from that of the type. */
2385 return TYPE_ALIGN (TREE_TYPE (t));
2388 /* Return, as a tree node, the number of elements for TYPE (which is an
2389 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2392 array_type_nelts (const_tree type)
2394 tree index_type, min, max;
2396 /* If they did it with unspecified bounds, then we should have already
2397 given an error about it before we got here. */
2398 if (! TYPE_DOMAIN (type))
2399 return error_mark_node;
2401 index_type = TYPE_DOMAIN (type);
2402 min = TYPE_MIN_VALUE (index_type);
2403 max = TYPE_MAX_VALUE (index_type);
2405 return (integer_zerop (min)
2407 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2410 /* If arg is static -- a reference to an object in static storage -- then
2411 return the object. This is not the same as the C meaning of `static'.
2412 If arg isn't static, return NULL. */
2417 switch (TREE_CODE (arg))
2420 /* Nested functions are static, even though taking their address will
2421 involve a trampoline as we unnest the nested function and create
2422 the trampoline on the tree level. */
2426 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2427 && ! DECL_THREAD_LOCAL_P (arg)
2428 && ! DECL_DLLIMPORT_P (arg)
2432 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2436 return TREE_STATIC (arg) ? arg : NULL;
2443 /* If the thing being referenced is not a field, then it is
2444 something language specific. */
2445 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2447 /* If we are referencing a bitfield, we can't evaluate an
2448 ADDR_EXPR at compile time and so it isn't a constant. */
2449 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2452 return staticp (TREE_OPERAND (arg, 0));
2458 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2461 case ARRAY_RANGE_REF:
2462 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2463 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2464 return staticp (TREE_OPERAND (arg, 0));
2468 case COMPOUND_LITERAL_EXPR:
2469 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2479 /* Return whether OP is a DECL whose address is function-invariant. */
2482 decl_address_invariant_p (const_tree op)
2484 /* The conditions below are slightly less strict than the one in
2487 switch (TREE_CODE (op))
2496 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2497 || DECL_THREAD_LOCAL_P (op)
2498 || DECL_CONTEXT (op) == current_function_decl
2499 || decl_function_context (op) == current_function_decl)
2504 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2505 || decl_function_context (op) == current_function_decl)
2516 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2519 decl_address_ip_invariant_p (const_tree op)
2521 /* The conditions below are slightly less strict than the one in
2524 switch (TREE_CODE (op))
2532 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2533 && !DECL_DLLIMPORT_P (op))
2534 || DECL_THREAD_LOCAL_P (op))
2539 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2551 /* Return true if T is function-invariant (internal function, does
2552 not handle arithmetic; that's handled in skip_simple_arithmetic and
2553 tree_invariant_p). */
2555 static bool tree_invariant_p (tree t);
2558 tree_invariant_p_1 (tree t)
2562 if (TREE_CONSTANT (t)
2563 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2566 switch (TREE_CODE (t))
2572 op = TREE_OPERAND (t, 0);
2573 while (handled_component_p (op))
2575 switch (TREE_CODE (op))
2578 case ARRAY_RANGE_REF:
2579 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2580 || TREE_OPERAND (op, 2) != NULL_TREE
2581 || TREE_OPERAND (op, 3) != NULL_TREE)
2586 if (TREE_OPERAND (op, 2) != NULL_TREE)
2592 op = TREE_OPERAND (op, 0);
2595 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2604 /* Return true if T is function-invariant. */
2607 tree_invariant_p (tree t)
2609 tree inner = skip_simple_arithmetic (t);
2610 return tree_invariant_p_1 (inner);
2613 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2614 Do this to any expression which may be used in more than one place,
2615 but must be evaluated only once.
2617 Normally, expand_expr would reevaluate the expression each time.
2618 Calling save_expr produces something that is evaluated and recorded
2619 the first time expand_expr is called on it. Subsequent calls to
2620 expand_expr just reuse the recorded value.
2622 The call to expand_expr that generates code that actually computes
2623 the value is the first call *at compile time*. Subsequent calls
2624 *at compile time* generate code to use the saved value.
2625 This produces correct result provided that *at run time* control
2626 always flows through the insns made by the first expand_expr
2627 before reaching the other places where the save_expr was evaluated.
2628 You, the caller of save_expr, must make sure this is so.
2630 Constants, and certain read-only nodes, are returned with no
2631 SAVE_EXPR because that is safe. Expressions containing placeholders
2632 are not touched; see tree.def for an explanation of what these
2636 save_expr (tree expr)
2638 tree t = fold (expr);
2641 /* If the tree evaluates to a constant, then we don't want to hide that
2642 fact (i.e. this allows further folding, and direct checks for constants).
2643 However, a read-only object that has side effects cannot be bypassed.
2644 Since it is no problem to reevaluate literals, we just return the
2646 inner = skip_simple_arithmetic (t);
2647 if (TREE_CODE (inner) == ERROR_MARK)
2650 if (tree_invariant_p_1 (inner))
2653 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2654 it means that the size or offset of some field of an object depends on
2655 the value within another field.
2657 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2658 and some variable since it would then need to be both evaluated once and
2659 evaluated more than once. Front-ends must assure this case cannot
2660 happen by surrounding any such subexpressions in their own SAVE_EXPR
2661 and forcing evaluation at the proper time. */
2662 if (contains_placeholder_p (inner))
2665 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2666 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2668 /* This expression might be placed ahead of a jump to ensure that the
2669 value was computed on both sides of the jump. So make sure it isn't
2670 eliminated as dead. */
2671 TREE_SIDE_EFFECTS (t) = 1;
2675 /* Look inside EXPR and into any simple arithmetic operations. Return
2676 the innermost non-arithmetic node. */
2679 skip_simple_arithmetic (tree expr)
2683 /* We don't care about whether this can be used as an lvalue in this
2685 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2686 expr = TREE_OPERAND (expr, 0);
2688 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2689 a constant, it will be more efficient to not make another SAVE_EXPR since
2690 it will allow better simplification and GCSE will be able to merge the
2691 computations if they actually occur. */
2695 if (UNARY_CLASS_P (inner))
2696 inner = TREE_OPERAND (inner, 0);
2697 else if (BINARY_CLASS_P (inner))
2699 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2700 inner = TREE_OPERAND (inner, 0);
2701 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2702 inner = TREE_OPERAND (inner, 1);
2714 /* Return which tree structure is used by T. */
2716 enum tree_node_structure_enum
2717 tree_node_structure (const_tree t)
2719 const enum tree_code code = TREE_CODE (t);
2720 return tree_node_structure_for_code (code);
2723 /* Set various status flags when building a CALL_EXPR object T. */
2726 process_call_operands (tree t)
2728 bool side_effects = TREE_SIDE_EFFECTS (t);
2729 bool read_only = false;
2730 int i = call_expr_flags (t);
2732 /* Calls have side-effects, except those to const or pure functions. */
2733 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2734 side_effects = true;
2735 /* Propagate TREE_READONLY of arguments for const functions. */
2739 if (!side_effects || read_only)
2740 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2742 tree op = TREE_OPERAND (t, i);
2743 if (op && TREE_SIDE_EFFECTS (op))
2744 side_effects = true;
2745 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2749 TREE_SIDE_EFFECTS (t) = side_effects;
2750 TREE_READONLY (t) = read_only;
2753 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2754 or offset that depends on a field within a record. */
2757 contains_placeholder_p (const_tree exp)
2759 enum tree_code code;
2764 code = TREE_CODE (exp);
2765 if (code == PLACEHOLDER_EXPR)
2768 switch (TREE_CODE_CLASS (code))
2771 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2772 position computations since they will be converted into a
2773 WITH_RECORD_EXPR involving the reference, which will assume
2774 here will be valid. */
2775 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2777 case tcc_exceptional:
2778 if (code == TREE_LIST)
2779 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2780 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2785 case tcc_comparison:
2786 case tcc_expression:
2790 /* Ignoring the first operand isn't quite right, but works best. */
2791 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2794 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2795 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2796 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2799 /* The save_expr function never wraps anything containing
2800 a PLACEHOLDER_EXPR. */
2807 switch (TREE_CODE_LENGTH (code))
2810 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2812 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2813 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2824 const_call_expr_arg_iterator iter;
2825 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2826 if (CONTAINS_PLACEHOLDER_P (arg))
2840 /* Return true if any part of the computation of TYPE involves a
2841 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2842 (for QUAL_UNION_TYPE) and field positions. */
2845 type_contains_placeholder_1 (const_tree type)
2847 /* If the size contains a placeholder or the parent type (component type in
2848 the case of arrays) type involves a placeholder, this type does. */
2849 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2850 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2851 || (TREE_TYPE (type) != 0
2852 && type_contains_placeholder_p (TREE_TYPE (type))))
2855 /* Now do type-specific checks. Note that the last part of the check above
2856 greatly limits what we have to do below. */
2857 switch (TREE_CODE (type))
2865 case REFERENCE_TYPE:
2873 case FIXED_POINT_TYPE:
2874 /* Here we just check the bounds. */
2875 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2876 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2879 /* We're already checked the component type (TREE_TYPE), so just check
2881 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2885 case QUAL_UNION_TYPE:
2889 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2890 if (TREE_CODE (field) == FIELD_DECL
2891 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2892 || (TREE_CODE (type) == QUAL_UNION_TYPE
2893 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2894 || type_contains_placeholder_p (TREE_TYPE (field))))
2906 type_contains_placeholder_p (tree type)
2910 /* If the contains_placeholder_bits field has been initialized,
2911 then we know the answer. */
2912 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2913 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2915 /* Indicate that we've seen this type node, and the answer is false.
2916 This is what we want to return if we run into recursion via fields. */
2917 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2919 /* Compute the real value. */
2920 result = type_contains_placeholder_1 (type);
2922 /* Store the real value. */
2923 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2928 /* Push tree EXP onto vector QUEUE if it is not already present. */
2931 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2936 FOR_EACH_VEC_ELT (tree, *queue, i, iter)
2937 if (simple_cst_equal (iter, exp) == 1)
2941 VEC_safe_push (tree, heap, *queue, exp);
2944 /* Given a tree EXP, find all occurences of references to fields
2945 in a PLACEHOLDER_EXPR and place them in vector REFS without
2946 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2947 we assume here that EXP contains only arithmetic expressions
2948 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2952 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2954 enum tree_code code = TREE_CODE (exp);
2958 /* We handle TREE_LIST and COMPONENT_REF separately. */
2959 if (code == TREE_LIST)
2961 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2962 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2964 else if (code == COMPONENT_REF)
2966 for (inner = TREE_OPERAND (exp, 0);
2967 REFERENCE_CLASS_P (inner);
2968 inner = TREE_OPERAND (inner, 0))
2971 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2972 push_without_duplicates (exp, refs);
2974 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2977 switch (TREE_CODE_CLASS (code))
2982 case tcc_declaration:
2983 /* Variables allocated to static storage can stay. */
2984 if (!TREE_STATIC (exp))
2985 push_without_duplicates (exp, refs);
2988 case tcc_expression:
2989 /* This is the pattern built in ada/make_aligning_type. */
2990 if (code == ADDR_EXPR
2991 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2993 push_without_duplicates (exp, refs);
2997 /* Fall through... */
2999 case tcc_exceptional:
3002 case tcc_comparison:
3004 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
3005 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3009 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3010 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
3018 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3019 return a tree with all occurrences of references to F in a
3020 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3021 CONST_DECLs. Note that we assume here that EXP contains only
3022 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3023 occurring only in their argument list. */
3026 substitute_in_expr (tree exp, tree f, tree r)
3028 enum tree_code code = TREE_CODE (exp);
3029 tree op0, op1, op2, op3;
3032 /* We handle TREE_LIST and COMPONENT_REF separately. */
3033 if (code == TREE_LIST)
3035 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3036 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3037 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3040 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3042 else if (code == COMPONENT_REF)
3046 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3047 and it is the right field, replace it with R. */
3048 for (inner = TREE_OPERAND (exp, 0);
3049 REFERENCE_CLASS_P (inner);
3050 inner = TREE_OPERAND (inner, 0))
3054 op1 = TREE_OPERAND (exp, 1);
3056 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3059 /* If this expression hasn't been completed let, leave it alone. */
3060 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3063 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3064 if (op0 == TREE_OPERAND (exp, 0))
3068 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3071 switch (TREE_CODE_CLASS (code))
3076 case tcc_declaration:
3082 case tcc_expression:
3086 /* Fall through... */
3088 case tcc_exceptional:
3091 case tcc_comparison:
3093 switch (TREE_CODE_LENGTH (code))
3099 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3100 if (op0 == TREE_OPERAND (exp, 0))
3103 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3107 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3108 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3110 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3113 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3117 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3118 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3119 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3121 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3122 && op2 == TREE_OPERAND (exp, 2))
3125 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3129 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3130 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3131 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3132 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3134 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3135 && op2 == TREE_OPERAND (exp, 2)
3136 && op3 == TREE_OPERAND (exp, 3))
3140 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3152 new_tree = NULL_TREE;
3154 /* If we are trying to replace F with a constant, inline back
3155 functions which do nothing else than computing a value from
3156 the arguments they are passed. This makes it possible to
3157 fold partially or entirely the replacement expression. */
3158 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3160 tree t = maybe_inline_call_in_expr (exp);
3162 return SUBSTITUTE_IN_EXPR (t, f, r);
3165 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3167 tree op = TREE_OPERAND (exp, i);
3168 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3172 new_tree = copy_node (exp);
3173 TREE_OPERAND (new_tree, i) = new_op;
3179 new_tree = fold (new_tree);
3180 if (TREE_CODE (new_tree) == CALL_EXPR)
3181 process_call_operands (new_tree);
3192 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3196 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3197 for it within OBJ, a tree that is an object or a chain of references. */
3200 substitute_placeholder_in_expr (tree exp, tree obj)
3202 enum tree_code code = TREE_CODE (exp);
3203 tree op0, op1, op2, op3;
3206 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3207 in the chain of OBJ. */
3208 if (code == PLACEHOLDER_EXPR)
3210 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3213 for (elt = obj; elt != 0;
3214 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3215 || TREE_CODE (elt) == COND_EXPR)
3216 ? TREE_OPERAND (elt, 1)
3217 : (REFERENCE_CLASS_P (elt)
3218 || UNARY_CLASS_P (elt)
3219 || BINARY_CLASS_P (elt)
3220 || VL_EXP_CLASS_P (elt)
3221 || EXPRESSION_CLASS_P (elt))
3222 ? TREE_OPERAND (elt, 0) : 0))
3223 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3226 for (elt = obj; elt != 0;
3227 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3228 || TREE_CODE (elt) == COND_EXPR)
3229 ? TREE_OPERAND (elt, 1)
3230 : (REFERENCE_CLASS_P (elt)
3231 || UNARY_CLASS_P (elt)
3232 || BINARY_CLASS_P (elt)
3233 || VL_EXP_CLASS_P (elt)
3234 || EXPRESSION_CLASS_P (elt))
3235 ? TREE_OPERAND (elt, 0) : 0))
3236 if (POINTER_TYPE_P (TREE_TYPE (elt))
3237 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3239 return fold_build1 (INDIRECT_REF, need_type, elt);
3241 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3242 survives until RTL generation, there will be an error. */
3246 /* TREE_LIST is special because we need to look at TREE_VALUE
3247 and TREE_CHAIN, not TREE_OPERANDS. */
3248 else if (code == TREE_LIST)
3250 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3251 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3252 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3255 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3258 switch (TREE_CODE_CLASS (code))
3261 case tcc_declaration:
3264 case tcc_exceptional:
3267 case tcc_comparison:
3268 case tcc_expression:
3271 switch (TREE_CODE_LENGTH (code))
3277 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3278 if (op0 == TREE_OPERAND (exp, 0))
3281 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3285 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3286 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3288 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3291 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3295 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3296 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3297 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3299 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3300 && op2 == TREE_OPERAND (exp, 2))
3303 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3307 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3308 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3309 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3310 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3312 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3313 && op2 == TREE_OPERAND (exp, 2)
3314 && op3 == TREE_OPERAND (exp, 3))
3318 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3330 new_tree = NULL_TREE;
3332 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3334 tree op = TREE_OPERAND (exp, i);
3335 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3339 new_tree = copy_node (exp);
3340 TREE_OPERAND (new_tree, i) = new_op;
3346 new_tree = fold (new_tree);
3347 if (TREE_CODE (new_tree) == CALL_EXPR)
3348 process_call_operands (new_tree);
3359 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3363 /* Stabilize a reference so that we can use it any number of times
3364 without causing its operands to be evaluated more than once.
3365 Returns the stabilized reference. This works by means of save_expr,
3366 so see the caveats in the comments about save_expr.
3368 Also allows conversion expressions whose operands are references.
3369 Any other kind of expression is returned unchanged. */
3372 stabilize_reference (tree ref)
3375 enum tree_code code = TREE_CODE (ref);
3382 /* No action is needed in this case. */
3387 case FIX_TRUNC_EXPR:
3388 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3392 result = build_nt (INDIRECT_REF,
3393 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3397 result = build_nt (COMPONENT_REF,
3398 stabilize_reference (TREE_OPERAND (ref, 0)),
3399 TREE_OPERAND (ref, 1), NULL_TREE);
3403 result = build_nt (BIT_FIELD_REF,
3404 stabilize_reference (TREE_OPERAND (ref, 0)),
3405 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3406 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3410 result = build_nt (ARRAY_REF,
3411 stabilize_reference (TREE_OPERAND (ref, 0)),
3412 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3413 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3416 case ARRAY_RANGE_REF:
3417 result = build_nt (ARRAY_RANGE_REF,
3418 stabilize_reference (TREE_OPERAND (ref, 0)),
3419 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3420 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3424 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3425 it wouldn't be ignored. This matters when dealing with
3427 return stabilize_reference_1 (ref);
3429 /* If arg isn't a kind of lvalue we recognize, make no change.
3430 Caller should recognize the error for an invalid lvalue. */
3435 return error_mark_node;
3438 TREE_TYPE (result) = TREE_TYPE (ref);
3439 TREE_READONLY (result) = TREE_READONLY (ref);
3440 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3441 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3446 /* Subroutine of stabilize_reference; this is called for subtrees of
3447 references. Any expression with side-effects must be put in a SAVE_EXPR
3448 to ensure that it is only evaluated once.
3450 We don't put SAVE_EXPR nodes around everything, because assigning very
3451 simple expressions to temporaries causes us to miss good opportunities
3452 for optimizations. Among other things, the opportunity to fold in the
3453 addition of a constant into an addressing mode often gets lost, e.g.
3454 "y[i+1] += x;". In general, we take the approach that we should not make
3455 an assignment unless we are forced into it - i.e., that any non-side effect
3456 operator should be allowed, and that cse should take care of coalescing
3457 multiple utterances of the same expression should that prove fruitful. */
3460 stabilize_reference_1 (tree e)
3463 enum tree_code code = TREE_CODE (e);
3465 /* We cannot ignore const expressions because it might be a reference
3466 to a const array but whose index contains side-effects. But we can
3467 ignore things that are actual constant or that already have been
3468 handled by this function. */
3470 if (tree_invariant_p (e))
3473 switch (TREE_CODE_CLASS (code))
3475 case tcc_exceptional:
3477 case tcc_declaration:
3478 case tcc_comparison:
3480 case tcc_expression:
3483 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3484 so that it will only be evaluated once. */
3485 /* The reference (r) and comparison (<) classes could be handled as
3486 below, but it is generally faster to only evaluate them once. */
3487 if (TREE_SIDE_EFFECTS (e))
3488 return save_expr (e);
3492 /* Constants need no processing. In fact, we should never reach
3497 /* Division is slow and tends to be compiled with jumps,
3498 especially the division by powers of 2 that is often
3499 found inside of an array reference. So do it just once. */
3500 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3501 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3502 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3503 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3504 return save_expr (e);
3505 /* Recursively stabilize each operand. */
3506 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3507 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3511 /* Recursively stabilize each operand. */
3512 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3519 TREE_TYPE (result) = TREE_TYPE (e);
3520 TREE_READONLY (result) = TREE_READONLY (e);
3521 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3522 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3527 /* Low-level constructors for expressions. */
3529 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3530 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3533 recompute_tree_invariant_for_addr_expr (tree t)
3536 bool tc = true, se = false;
3538 /* We started out assuming this address is both invariant and constant, but
3539 does not have side effects. Now go down any handled components and see if
3540 any of them involve offsets that are either non-constant or non-invariant.
3541 Also check for side-effects.
3543 ??? Note that this code makes no attempt to deal with the case where
3544 taking the address of something causes a copy due to misalignment. */
3546 #define UPDATE_FLAGS(NODE) \
3547 do { tree _node = (NODE); \
3548 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3549 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3551 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3552 node = TREE_OPERAND (node, 0))
3554 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3555 array reference (probably made temporarily by the G++ front end),
3556 so ignore all the operands. */
3557 if ((TREE_CODE (node) == ARRAY_REF
3558 || TREE_CODE (node) == ARRAY_RANGE_REF)
3559 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3561 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3562 if (TREE_OPERAND (node, 2))
3563 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3564 if (TREE_OPERAND (node, 3))
3565 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3567 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3568 FIELD_DECL, apparently. The G++ front end can put something else
3569 there, at least temporarily. */
3570 else if (TREE_CODE (node) == COMPONENT_REF
3571 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3573 if (TREE_OPERAND (node, 2))
3574 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3576 else if (TREE_CODE (node) == BIT_FIELD_REF)
3577 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3580 node = lang_hooks.expr_to_decl (node, &tc, &se);
3582 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3583 the address, since &(*a)->b is a form of addition. If it's a constant, the
3584 address is constant too. If it's a decl, its address is constant if the
3585 decl is static. Everything else is not constant and, furthermore,
3586 taking the address of a volatile variable is not volatile. */
3587 if (TREE_CODE (node) == INDIRECT_REF
3588 || TREE_CODE (node) == MEM_REF)
3589 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3590 else if (CONSTANT_CLASS_P (node))
3592 else if (DECL_P (node))
3593 tc &= (staticp (node) != NULL_TREE);
3597 se |= TREE_SIDE_EFFECTS (node);
3601 TREE_CONSTANT (t) = tc;
3602 TREE_SIDE_EFFECTS (t) = se;
3606 /* Build an expression of code CODE, data type TYPE, and operands as
3607 specified. Expressions and reference nodes can be created this way.
3608 Constants, decls, types and misc nodes cannot be.
3610 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3611 enough for all extant tree codes. */
3614 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3618 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3620 t = make_node_stat (code PASS_MEM_STAT);
3627 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3629 int length = sizeof (struct tree_exp);
3630 #ifdef GATHER_STATISTICS
3631 tree_node_kind kind;
3635 #ifdef GATHER_STATISTICS
3636 switch (TREE_CODE_CLASS (code))
3638 case tcc_statement: /* an expression with side effects */
3641 case tcc_reference: /* a reference */
3649 tree_node_counts[(int) kind]++;
3650 tree_node_sizes[(int) kind] += length;
3653 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3655 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3657 memset (t, 0, sizeof (struct tree_common));
3659 TREE_SET_CODE (t, code);
3661 TREE_TYPE (t) = type;
3662 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3663 TREE_OPERAND (t, 0) = node;
3664 TREE_BLOCK (t) = NULL_TREE;
3665 if (node && !TYPE_P (node))
3667 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3668 TREE_READONLY (t) = TREE_READONLY (node);
3671 if (TREE_CODE_CLASS (code) == tcc_statement)
3672 TREE_SIDE_EFFECTS (t) = 1;
3676 /* All of these have side-effects, no matter what their
3678 TREE_SIDE_EFFECTS (t) = 1;
3679 TREE_READONLY (t) = 0;
3683 /* Whether a dereference is readonly has nothing to do with whether
3684 its operand is readonly. */
3685 TREE_READONLY (t) = 0;
3690 recompute_tree_invariant_for_addr_expr (t);
3694 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3695 && node && !TYPE_P (node)
3696 && TREE_CONSTANT (node))
3697 TREE_CONSTANT (t) = 1;
3698 if (TREE_CODE_CLASS (code) == tcc_reference
3699 && node && TREE_THIS_VOLATILE (node))
3700 TREE_THIS_VOLATILE (t) = 1;
3707 #define PROCESS_ARG(N) \
3709 TREE_OPERAND (t, N) = arg##N; \
3710 if (arg##N &&!TYPE_P (arg##N)) \
3712 if (TREE_SIDE_EFFECTS (arg##N)) \
3714 if (!TREE_READONLY (arg##N) \
3715 && !CONSTANT_CLASS_P (arg##N)) \
3716 (void) (read_only = 0); \
3717 if (!TREE_CONSTANT (arg##N)) \
3718 (void) (constant = 0); \
3723 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3725 bool constant, read_only, side_effects;
3728 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3730 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3731 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3732 /* When sizetype precision doesn't match that of pointers
3733 we need to be able to build explicit extensions or truncations
3734 of the offset argument. */
3735 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3736 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3737 && TREE_CODE (arg1) == INTEGER_CST);
3739 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3740 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3741 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3742 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3744 t = make_node_stat (code PASS_MEM_STAT);
3747 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3748 result based on those same flags for the arguments. But if the
3749 arguments aren't really even `tree' expressions, we shouldn't be trying
3752 /* Expressions without side effects may be constant if their
3753 arguments are as well. */
3754 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3755 || TREE_CODE_CLASS (code) == tcc_binary);
3757 side_effects = TREE_SIDE_EFFECTS (t);
3762 TREE_READONLY (t) = read_only;
3763 TREE_CONSTANT (t) = constant;
3764 TREE_SIDE_EFFECTS (t) = side_effects;
3765 TREE_THIS_VOLATILE (t)
3766 = (TREE_CODE_CLASS (code) == tcc_reference
3767 && arg0 && TREE_THIS_VOLATILE (arg0));
3774 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3775 tree arg2 MEM_STAT_DECL)
3777 bool constant, read_only, side_effects;
3780 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3781 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3783 t = make_node_stat (code PASS_MEM_STAT);
3788 /* As a special exception, if COND_EXPR has NULL branches, we
3789 assume that it is a gimple statement and always consider
3790 it to have side effects. */
3791 if (code == COND_EXPR
3792 && tt == void_type_node
3793 && arg1 == NULL_TREE
3794 && arg2 == NULL_TREE)
3795 side_effects = true;
3797 side_effects = TREE_SIDE_EFFECTS (t);
3803 if (code == COND_EXPR)
3804 TREE_READONLY (t) = read_only;
3806 TREE_SIDE_EFFECTS (t) = side_effects;
3807 TREE_THIS_VOLATILE (t)
3808 = (TREE_CODE_CLASS (code) == tcc_reference
3809 && arg0 && TREE_THIS_VOLATILE (arg0));
3815 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3816 tree arg2, tree arg3 MEM_STAT_DECL)
3818 bool constant, read_only, side_effects;
3821 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3823 t = make_node_stat (code PASS_MEM_STAT);
3826 side_effects = TREE_SIDE_EFFECTS (t);
3833 TREE_SIDE_EFFECTS (t) = side_effects;
3834 TREE_THIS_VOLATILE (t)
3835 = (TREE_CODE_CLASS (code) == tcc_reference
3836 && arg0 && TREE_THIS_VOLATILE (arg0));
3842 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3843 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3845 bool constant, read_only, side_effects;
3848 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3850 t = make_node_stat (code PASS_MEM_STAT);
3853 side_effects = TREE_SIDE_EFFECTS (t);
3861 TREE_SIDE_EFFECTS (t) = side_effects;
3862 TREE_THIS_VOLATILE (t)
3863 = (TREE_CODE_CLASS (code) == tcc_reference
3864 && arg0 && TREE_THIS_VOLATILE (arg0));
3870 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3871 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3873 bool constant, read_only, side_effects;
3876 gcc_assert (code == TARGET_MEM_REF);
3878 t = make_node_stat (code PASS_MEM_STAT);
3881 side_effects = TREE_SIDE_EFFECTS (t);
3888 if (code == TARGET_MEM_REF)
3892 TREE_SIDE_EFFECTS (t) = side_effects;
3893 TREE_THIS_VOLATILE (t)
3894 = (code == TARGET_MEM_REF
3895 && arg5 && TREE_THIS_VOLATILE (arg5));
3900 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3901 on the pointer PTR. */
3904 build_simple_mem_ref_loc (location_t loc, tree ptr)
3906 HOST_WIDE_INT offset = 0;
3907 tree ptype = TREE_TYPE (ptr);
3909 /* For convenience allow addresses that collapse to a simple base
3911 if (TREE_CODE (ptr) == ADDR_EXPR
3912 && (handled_component_p (TREE_OPERAND (ptr, 0))
3913 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3915 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3917 ptr = build_fold_addr_expr (ptr);
3918 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3920 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3921 ptr, build_int_cst (ptype, offset));
3922 SET_EXPR_LOCATION (tem, loc);
3926 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3929 mem_ref_offset (const_tree t)
3931 tree toff = TREE_OPERAND (t, 1);
3932 return double_int_sext (tree_to_double_int (toff),
3933 TYPE_PRECISION (TREE_TYPE (toff)));
3936 /* Return the pointer-type relevant for TBAA purposes from the
3937 gimple memory reference tree T. This is the type to be used for
3938 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3941 reference_alias_ptr_type (const_tree t)
3943 const_tree base = t;
3944 while (handled_component_p (base))
3945 base = TREE_OPERAND (base, 0);
3946 if (TREE_CODE (base) == MEM_REF)
3947 return TREE_TYPE (TREE_OPERAND (base, 1));
3948 else if (TREE_CODE (base) == TARGET_MEM_REF)
3949 return TREE_TYPE (TMR_OFFSET (base));
3951 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
3954 /* Similar except don't specify the TREE_TYPE
3955 and leave the TREE_SIDE_EFFECTS as 0.
3956 It is permissible for arguments to be null,
3957 or even garbage if their values do not matter. */
3960 build_nt (enum tree_code code, ...)
3967 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3971 t = make_node (code);
3972 length = TREE_CODE_LENGTH (code);
3974 for (i = 0; i < length; i++)
3975 TREE_OPERAND (t, i) = va_arg (p, tree);
3981 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3985 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3990 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3991 CALL_EXPR_FN (ret) = fn;
3992 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3993 FOR_EACH_VEC_ELT (tree, args, ix, t)
3994 CALL_EXPR_ARG (ret, ix) = t;
3998 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3999 We do NOT enter this node in any sort of symbol table.
4001 LOC is the location of the decl.
4003 layout_decl is used to set up the decl's storage layout.
4004 Other slots are initialized to 0 or null pointers. */
4007 build_decl_stat (location_t loc, enum tree_code code, tree name,
4008 tree type MEM_STAT_DECL)
4012 t = make_node_stat (code PASS_MEM_STAT);
4013 DECL_SOURCE_LOCATION (t) = loc;
4015 /* if (type == error_mark_node)
4016 type = integer_type_node; */
4017 /* That is not done, deliberately, so that having error_mark_node
4018 as the type can suppress useless errors in the use of this variable. */
4020 DECL_NAME (t) = name;
4021 TREE_TYPE (t) = type;
4023 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4029 /* Builds and returns function declaration with NAME and TYPE. */
4032 build_fn_decl (const char *name, tree type)
4034 tree id = get_identifier (name);
4035 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4037 DECL_EXTERNAL (decl) = 1;
4038 TREE_PUBLIC (decl) = 1;
4039 DECL_ARTIFICIAL (decl) = 1;
4040 TREE_NOTHROW (decl) = 1;
4045 VEC(tree,gc) *all_translation_units;
4047 /* Builds a new translation-unit decl with name NAME, queues it in the
4048 global list of translation-unit decls and returns it. */
4051 build_translation_unit_decl (tree name)
4053 tree tu = build_decl (UNKNOWN_LOCATION, TRANSLATION_UNIT_DECL,
4055 TRANSLATION_UNIT_LANGUAGE (tu) = lang_hooks.name;
4056 VEC_safe_push (tree, gc, all_translation_units, tu);
4061 /* BLOCK nodes are used to represent the structure of binding contours
4062 and declarations, once those contours have been exited and their contents
4063 compiled. This information is used for outputting debugging info. */
4066 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4068 tree block = make_node (BLOCK);
4070 BLOCK_VARS (block) = vars;
4071 BLOCK_SUBBLOCKS (block) = subblocks;
4072 BLOCK_SUPERCONTEXT (block) = supercontext;
4073 BLOCK_CHAIN (block) = chain;
4078 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4080 LOC is the location to use in tree T. */
4083 protected_set_expr_location (tree t, location_t loc)
4085 if (t && CAN_HAVE_LOCATION_P (t))
4086 SET_EXPR_LOCATION (t, loc);
4089 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4093 build_decl_attribute_variant (tree ddecl, tree attribute)
4095 DECL_ATTRIBUTES (ddecl) = attribute;
4099 /* Borrowed from hashtab.c iterative_hash implementation. */
4100 #define mix(a,b,c) \
4102 a -= b; a -= c; a ^= (c>>13); \
4103 b -= c; b -= a; b ^= (a<< 8); \
4104 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4105 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4106 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4107 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4108 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4109 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4110 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4114 /* Produce good hash value combining VAL and VAL2. */
4116 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4118 /* the golden ratio; an arbitrary value. */
4119 hashval_t a = 0x9e3779b9;
4125 /* Produce good hash value combining VAL and VAL2. */
4127 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4129 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4130 return iterative_hash_hashval_t (val, val2);
4133 hashval_t a = (hashval_t) val;
4134 /* Avoid warnings about shifting of more than the width of the type on
4135 hosts that won't execute this path. */
4137 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4139 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4141 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4142 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4149 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4150 is ATTRIBUTE and its qualifiers are QUALS.
4152 Record such modified types already made so we don't make duplicates. */
4155 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4157 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4159 hashval_t hashcode = 0;
4161 enum tree_code code = TREE_CODE (ttype);
4163 /* Building a distinct copy of a tagged type is inappropriate; it
4164 causes breakage in code that expects there to be a one-to-one
4165 relationship between a struct and its fields.
4166 build_duplicate_type is another solution (as used in
4167 handle_transparent_union_attribute), but that doesn't play well
4168 with the stronger C++ type identity model. */
4169 if (TREE_CODE (ttype) == RECORD_TYPE
4170 || TREE_CODE (ttype) == UNION_TYPE
4171 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4172 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4174 warning (OPT_Wattributes,
4175 "ignoring attributes applied to %qT after definition",
4176 TYPE_MAIN_VARIANT (ttype));
4177 return build_qualified_type (ttype, quals);
4180 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4181 ntype = build_distinct_type_copy (ttype);
4183 TYPE_ATTRIBUTES (ntype) = attribute;
4185 hashcode = iterative_hash_object (code, hashcode);
4186 if (TREE_TYPE (ntype))
4187 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4189 hashcode = attribute_hash_list (attribute, hashcode);
4191 switch (TREE_CODE (ntype))
4194 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4197 if (TYPE_DOMAIN (ntype))
4198 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4202 hashcode = iterative_hash_object
4203 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4204 hashcode = iterative_hash_object
4205 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4208 case FIXED_POINT_TYPE:
4210 unsigned int precision = TYPE_PRECISION (ntype);
4211 hashcode = iterative_hash_object (precision, hashcode);
4218 ntype = type_hash_canon (hashcode, ntype);
4220 /* If the target-dependent attributes make NTYPE different from
4221 its canonical type, we will need to use structural equality
4222 checks for this type. */
4223 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4224 || !targetm.comp_type_attributes (ntype, ttype))
4225 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4226 else if (TYPE_CANONICAL (ntype) == ntype)
4227 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4229 ttype = build_qualified_type (ntype, quals);
4231 else if (TYPE_QUALS (ttype) != quals)
4232 ttype = build_qualified_type (ttype, quals);
4238 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4241 Record such modified types already made so we don't make duplicates. */
4244 build_type_attribute_variant (tree ttype, tree attribute)
4246 return build_type_attribute_qual_variant (ttype, attribute,
4247 TYPE_QUALS (ttype));
4251 /* Reset the expression *EXPR_P, a size or position.
4253 ??? We could reset all non-constant sizes or positions. But it's cheap
4254 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4256 We need to reset self-referential sizes or positions because they cannot
4257 be gimplified and thus can contain a CALL_EXPR after the gimplification
4258 is finished, which will run afoul of LTO streaming. And they need to be
4259 reset to something essentially dummy but not constant, so as to preserve
4260 the properties of the object they are attached to. */
4263 free_lang_data_in_one_sizepos (tree *expr_p)
4265 tree expr = *expr_p;
4266 if (CONTAINS_PLACEHOLDER_P (expr))
4267 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4271 /* Reset all the fields in a binfo node BINFO. We only keep
4272 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4275 free_lang_data_in_binfo (tree binfo)
4280 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4282 BINFO_VTABLE (binfo) = NULL_TREE;
4283 BINFO_BASE_ACCESSES (binfo) = NULL;
4284 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4285 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4287 FOR_EACH_VEC_ELT (tree, BINFO_BASE_BINFOS (binfo), i, t)
4288 free_lang_data_in_binfo (t);
4292 /* Reset all language specific information still present in TYPE. */
4295 free_lang_data_in_type (tree type)
4297 gcc_assert (TYPE_P (type));
4299 /* Give the FE a chance to remove its own data first. */
4300 lang_hooks.free_lang_data (type);
4302 TREE_LANG_FLAG_0 (type) = 0;
4303 TREE_LANG_FLAG_1 (type) = 0;
4304 TREE_LANG_FLAG_2 (type) = 0;
4305 TREE_LANG_FLAG_3 (type) = 0;
4306 TREE_LANG_FLAG_4 (type) = 0;
4307 TREE_LANG_FLAG_5 (type) = 0;
4308 TREE_LANG_FLAG_6 (type) = 0;
4310 if (TREE_CODE (type) == FUNCTION_TYPE)
4312 /* Remove the const and volatile qualifiers from arguments. The
4313 C++ front end removes them, but the C front end does not,
4314 leading to false ODR violation errors when merging two
4315 instances of the same function signature compiled by
4316 different front ends. */
4319 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4321 tree arg_type = TREE_VALUE (p);
4323 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4325 int quals = TYPE_QUALS (arg_type)
4327 & ~TYPE_QUAL_VOLATILE;
4328 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4329 free_lang_data_in_type (TREE_VALUE (p));
4334 /* Remove members that are not actually FIELD_DECLs from the field
4335 list of an aggregate. These occur in C++. */
4336 if (RECORD_OR_UNION_TYPE_P (type))
4340 /* Note that TYPE_FIELDS can be shared across distinct
4341 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4342 to be removed, we cannot set its TREE_CHAIN to NULL.
4343 Otherwise, we would not be able to find all the other fields
4344 in the other instances of this TREE_TYPE.
4346 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4348 member = TYPE_FIELDS (type);
4351 if (TREE_CODE (member) == FIELD_DECL)
4354 TREE_CHAIN (prev) = member;
4356 TYPE_FIELDS (type) = member;
4360 member = TREE_CHAIN (member);
4364 TREE_CHAIN (prev) = NULL_TREE;
4366 TYPE_FIELDS (type) = NULL_TREE;
4368 TYPE_METHODS (type) = NULL_TREE;
4369 if (TYPE_BINFO (type))
4370 free_lang_data_in_binfo (TYPE_BINFO (type));
4374 /* For non-aggregate types, clear out the language slot (which
4375 overloads TYPE_BINFO). */
4376 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4378 if (INTEGRAL_TYPE_P (type)
4379 || SCALAR_FLOAT_TYPE_P (type)
4380 || FIXED_POINT_TYPE_P (type))
4382 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4383 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4387 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4388 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4390 if (debug_info_level < DINFO_LEVEL_TERSE
4391 || (TYPE_CONTEXT (type)
4392 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4393 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4394 TYPE_CONTEXT (type) = NULL_TREE;
4396 if (debug_info_level < DINFO_LEVEL_TERSE)
4397 TYPE_STUB_DECL (type) = NULL_TREE;
4401 /* Return true if DECL may need an assembler name to be set. */
4404 need_assembler_name_p (tree decl)
4406 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4407 if (TREE_CODE (decl) != FUNCTION_DECL
4408 && TREE_CODE (decl) != VAR_DECL)
4411 /* If DECL already has its assembler name set, it does not need a
4413 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4414 || DECL_ASSEMBLER_NAME_SET_P (decl))
4417 /* Abstract decls do not need an assembler name. */
4418 if (DECL_ABSTRACT (decl))
4421 /* For VAR_DECLs, only static, public and external symbols need an
4423 if (TREE_CODE (decl) == VAR_DECL
4424 && !TREE_STATIC (decl)
4425 && !TREE_PUBLIC (decl)
4426 && !DECL_EXTERNAL (decl))
4429 if (TREE_CODE (decl) == FUNCTION_DECL)
4431 /* Do not set assembler name on builtins. Allow RTL expansion to
4432 decide whether to expand inline or via a regular call. */
4433 if (DECL_BUILT_IN (decl)
4434 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4437 /* Functions represented in the callgraph need an assembler name. */
4438 if (cgraph_get_node (decl) != NULL)
4441 /* Unused and not public functions don't need an assembler name. */
4442 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4450 /* Reset all language specific information still present in symbol
4454 free_lang_data_in_decl (tree decl)
4456 gcc_assert (DECL_P (decl));
4458 /* Give the FE a chance to remove its own data first. */
4459 lang_hooks.free_lang_data (decl);
4461 TREE_LANG_FLAG_0 (decl) = 0;
4462 TREE_LANG_FLAG_1 (decl) = 0;
4463 TREE_LANG_FLAG_2 (decl) = 0;
4464 TREE_LANG_FLAG_3 (decl) = 0;
4465 TREE_LANG_FLAG_4 (decl) = 0;
4466 TREE_LANG_FLAG_5 (decl) = 0;
4467 TREE_LANG_FLAG_6 (decl) = 0;
4469 /* Identifiers need not have a type. */
4470 if (DECL_NAME (decl))
4471 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4473 if (TREE_CODE (decl) == VAR_DECL)
4475 tree context = DECL_CONTEXT (decl);
4479 enum tree_code code = TREE_CODE (context);
4480 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4482 /* Do not clear the decl context here, that will promote
4483 all vars to global ones. */
4484 DECL_INITIAL (decl) = NULL_TREE;
4489 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4490 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4491 if (TREE_CODE (decl) == FIELD_DECL)
4492 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4494 /* DECL_FCONTEXT is only used for debug info generation. */
4495 if (TREE_CODE (decl) == FIELD_DECL
4496 && debug_info_level < DINFO_LEVEL_TERSE)
4497 DECL_FCONTEXT (decl) = NULL_TREE;
4499 if (TREE_CODE (decl) == FUNCTION_DECL)
4501 if (gimple_has_body_p (decl))
4505 /* If DECL has a gimple body, then the context for its
4506 arguments must be DECL. Otherwise, it doesn't really
4507 matter, as we will not be emitting any code for DECL. In
4508 general, there may be other instances of DECL created by
4509 the front end and since PARM_DECLs are generally shared,
4510 their DECL_CONTEXT changes as the replicas of DECL are
4511 created. The only time where DECL_CONTEXT is important
4512 is for the FUNCTION_DECLs that have a gimple body (since
4513 the PARM_DECL will be used in the function's body). */
4514 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4515 DECL_CONTEXT (t) = decl;
4518 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4519 At this point, it is not needed anymore. */
4520 DECL_SAVED_TREE (decl) = NULL_TREE;
4522 else if (TREE_CODE (decl) == VAR_DECL)
4524 if (DECL_EXTERNAL (decl)
4525 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4526 DECL_INITIAL (decl) = NULL_TREE;
4528 else if (TREE_CODE (decl) == TYPE_DECL)
4529 DECL_INITIAL (decl) = NULL_TREE;
4533 /* Data used when collecting DECLs and TYPEs for language data removal. */
4535 struct free_lang_data_d
4537 /* Worklist to avoid excessive recursion. */
4538 VEC(tree,heap) *worklist;
4540 /* Set of traversed objects. Used to avoid duplicate visits. */
4541 struct pointer_set_t *pset;
4543 /* Array of symbols to process with free_lang_data_in_decl. */
4544 VEC(tree,heap) *decls;
4546 /* Array of types to process with free_lang_data_in_type. */
4547 VEC(tree,heap) *types;
4551 /* Save all language fields needed to generate proper debug information
4552 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4555 save_debug_info_for_decl (tree t)
4557 /*struct saved_debug_info_d *sdi;*/
4559 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4561 /* FIXME. Partial implementation for saving debug info removed. */
4565 /* Save all language fields needed to generate proper debug information
4566 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4569 save_debug_info_for_type (tree t)
4571 /*struct saved_debug_info_d *sdi;*/
4573 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4575 /* FIXME. Partial implementation for saving debug info removed. */
4579 /* Add type or decl T to one of the list of tree nodes that need their
4580 language data removed. The lists are held inside FLD. */
4583 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4587 VEC_safe_push (tree, heap, fld->decls, t);
4588 if (debug_info_level > DINFO_LEVEL_TERSE)
4589 save_debug_info_for_decl (t);
4591 else if (TYPE_P (t))
4593 VEC_safe_push (tree, heap, fld->types, t);
4594 if (debug_info_level > DINFO_LEVEL_TERSE)
4595 save_debug_info_for_type (t);
4601 /* Push tree node T into FLD->WORKLIST. */
4604 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4606 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4607 VEC_safe_push (tree, heap, fld->worklist, (t));
4611 /* Operand callback helper for free_lang_data_in_node. *TP is the
4612 subtree operand being considered. */
4615 find_decls_types_r (tree *tp, int *ws, void *data)
4618 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4620 if (TREE_CODE (t) == TREE_LIST)
4623 /* Language specific nodes will be removed, so there is no need
4624 to gather anything under them. */
4625 if (is_lang_specific (t))
4633 /* Note that walk_tree does not traverse every possible field in
4634 decls, so we have to do our own traversals here. */
4635 add_tree_to_fld_list (t, fld);
4637 fld_worklist_push (DECL_NAME (t), fld);
4638 fld_worklist_push (DECL_CONTEXT (t), fld);
4639 fld_worklist_push (DECL_SIZE (t), fld);
4640 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4642 /* We are going to remove everything under DECL_INITIAL for
4643 TYPE_DECLs. No point walking them. */
4644 if (TREE_CODE (t) != TYPE_DECL)
4645 fld_worklist_push (DECL_INITIAL (t), fld);
4647 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4648 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4650 if (TREE_CODE (t) == FUNCTION_DECL)
4652 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4653 fld_worklist_push (DECL_RESULT (t), fld);
4655 else if (TREE_CODE (t) == TYPE_DECL)
4657 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4658 fld_worklist_push (DECL_VINDEX (t), fld);
4660 else if (TREE_CODE (t) == FIELD_DECL)
4662 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4663 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4664 fld_worklist_push (DECL_QUALIFIER (t), fld);
4665 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4666 fld_worklist_push (DECL_FCONTEXT (t), fld);
4668 else if (TREE_CODE (t) == VAR_DECL)
4670 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4671 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4674 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4675 && DECL_HAS_VALUE_EXPR_P (t))
4676 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4678 if (TREE_CODE (t) != FIELD_DECL
4679 && TREE_CODE (t) != TYPE_DECL)
4680 fld_worklist_push (TREE_CHAIN (t), fld);
4683 else if (TYPE_P (t))
4685 /* Note that walk_tree does not traverse every possible field in
4686 types, so we have to do our own traversals here. */
4687 add_tree_to_fld_list (t, fld);
4689 if (!RECORD_OR_UNION_TYPE_P (t))
4690 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4691 fld_worklist_push (TYPE_SIZE (t), fld);
4692 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4693 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4694 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4695 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4696 fld_worklist_push (TYPE_NAME (t), fld);
4697 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4698 them and thus do not and want not to reach unused pointer types
4700 if (!POINTER_TYPE_P (t))
4701 fld_worklist_push (TYPE_MINVAL (t), fld);
4702 if (!RECORD_OR_UNION_TYPE_P (t))
4703 fld_worklist_push (TYPE_MAXVAL (t), fld);
4704 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4705 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4706 do not and want not to reach unused variants this way. */
4707 fld_worklist_push (TYPE_CONTEXT (t), fld);
4708 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4709 and want not to reach unused types this way. */
4711 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4715 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4717 fld_worklist_push (TREE_TYPE (tem), fld);
4718 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4720 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4721 && TREE_CODE (tem) == TREE_LIST)
4724 fld_worklist_push (TREE_VALUE (tem), fld);
4725 tem = TREE_CHAIN (tem);
4729 if (RECORD_OR_UNION_TYPE_P (t))
4732 /* Push all TYPE_FIELDS - there can be interleaving interesting
4733 and non-interesting things. */
4734 tem = TYPE_FIELDS (t);
4737 if (TREE_CODE (tem) == FIELD_DECL)
4738 fld_worklist_push (tem, fld);
4739 tem = TREE_CHAIN (tem);
4743 fld_worklist_push (TREE_CHAIN (t), fld);
4746 else if (TREE_CODE (t) == BLOCK)
4749 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4750 fld_worklist_push (tem, fld);
4751 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4752 fld_worklist_push (tem, fld);
4753 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4756 fld_worklist_push (TREE_TYPE (t), fld);
4762 /* Find decls and types in T. */
4765 find_decls_types (tree t, struct free_lang_data_d *fld)
4769 if (!pointer_set_contains (fld->pset, t))
4770 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4771 if (VEC_empty (tree, fld->worklist))
4773 t = VEC_pop (tree, fld->worklist);
4777 /* Translate all the types in LIST with the corresponding runtime
4781 get_eh_types_for_runtime (tree list)
4785 if (list == NULL_TREE)
4788 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4790 list = TREE_CHAIN (list);
4793 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4794 TREE_CHAIN (prev) = n;
4795 prev = TREE_CHAIN (prev);
4796 list = TREE_CHAIN (list);
4803 /* Find decls and types referenced in EH region R and store them in
4804 FLD->DECLS and FLD->TYPES. */
4807 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4818 /* The types referenced in each catch must first be changed to the
4819 EH types used at runtime. This removes references to FE types
4821 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4823 c->type_list = get_eh_types_for_runtime (c->type_list);
4824 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4829 case ERT_ALLOWED_EXCEPTIONS:
4830 r->u.allowed.type_list
4831 = get_eh_types_for_runtime (r->u.allowed.type_list);
4832 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4835 case ERT_MUST_NOT_THROW:
4836 walk_tree (&r->u.must_not_throw.failure_decl,
4837 find_decls_types_r, fld, fld->pset);
4843 /* Find decls and types referenced in cgraph node N and store them in
4844 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4845 look for *every* kind of DECL and TYPE node reachable from N,
4846 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4847 NAMESPACE_DECLs, etc). */
4850 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4853 struct function *fn;
4857 find_decls_types (n->decl, fld);
4859 if (!gimple_has_body_p (n->decl))
4862 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4864 fn = DECL_STRUCT_FUNCTION (n->decl);
4866 /* Traverse locals. */
4867 FOR_EACH_LOCAL_DECL (fn, ix, t)
4868 find_decls_types (t, fld);
4870 /* Traverse EH regions in FN. */
4873 FOR_ALL_EH_REGION_FN (r, fn)
4874 find_decls_types_in_eh_region (r, fld);
4877 /* Traverse every statement in FN. */
4878 FOR_EACH_BB_FN (bb, fn)
4880 gimple_stmt_iterator si;
4883 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4885 gimple phi = gsi_stmt (si);
4887 for (i = 0; i < gimple_phi_num_args (phi); i++)
4889 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4890 find_decls_types (*arg_p, fld);
4894 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4896 gimple stmt = gsi_stmt (si);
4898 for (i = 0; i < gimple_num_ops (stmt); i++)
4900 tree arg = gimple_op (stmt, i);
4901 find_decls_types (arg, fld);
4908 /* Find decls and types referenced in varpool node N and store them in
4909 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4910 look for *every* kind of DECL and TYPE node reachable from N,
4911 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4912 NAMESPACE_DECLs, etc). */
4915 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4917 find_decls_types (v->decl, fld);
4920 /* If T needs an assembler name, have one created for it. */
4923 assign_assembler_name_if_neeeded (tree t)
4925 if (need_assembler_name_p (t))
4927 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4928 diagnostics that use input_location to show locus
4929 information. The problem here is that, at this point,
4930 input_location is generally anchored to the end of the file
4931 (since the parser is long gone), so we don't have a good
4932 position to pin it to.
4934 To alleviate this problem, this uses the location of T's
4935 declaration. Examples of this are
4936 testsuite/g++.dg/template/cond2.C and
4937 testsuite/g++.dg/template/pr35240.C. */
4938 location_t saved_location = input_location;
4939 input_location = DECL_SOURCE_LOCATION (t);
4941 decl_assembler_name (t);
4943 input_location = saved_location;
4948 /* Free language specific information for every operand and expression
4949 in every node of the call graph. This process operates in three stages:
4951 1- Every callgraph node and varpool node is traversed looking for
4952 decls and types embedded in them. This is a more exhaustive
4953 search than that done by find_referenced_vars, because it will
4954 also collect individual fields, decls embedded in types, etc.
4956 2- All the decls found are sent to free_lang_data_in_decl.
4958 3- All the types found are sent to free_lang_data_in_type.
4960 The ordering between decls and types is important because
4961 free_lang_data_in_decl sets assembler names, which includes
4962 mangling. So types cannot be freed up until assembler names have
4966 free_lang_data_in_cgraph (void)
4968 struct cgraph_node *n;
4969 struct varpool_node *v;
4970 struct free_lang_data_d fld;
4975 /* Initialize sets and arrays to store referenced decls and types. */
4976 fld.pset = pointer_set_create ();
4977 fld.worklist = NULL;
4978 fld.decls = VEC_alloc (tree, heap, 100);
4979 fld.types = VEC_alloc (tree, heap, 100);
4981 /* Find decls and types in the body of every function in the callgraph. */
4982 for (n = cgraph_nodes; n; n = n->next)
4983 find_decls_types_in_node (n, &fld);
4985 FOR_EACH_VEC_ELT (alias_pair, alias_pairs, i, p)
4986 find_decls_types (p->decl, &fld);
4988 /* Find decls and types in every varpool symbol. */
4989 for (v = varpool_nodes; v; v = v->next)
4990 find_decls_types_in_var (v, &fld);
4992 /* Set the assembler name on every decl found. We need to do this
4993 now because free_lang_data_in_decl will invalidate data needed
4994 for mangling. This breaks mangling on interdependent decls. */
4995 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
4996 assign_assembler_name_if_neeeded (t);
4998 /* Traverse every decl found freeing its language data. */
4999 FOR_EACH_VEC_ELT (tree, fld.decls, i, t)
5000 free_lang_data_in_decl (t);
5002 /* Traverse every type found freeing its language data. */
5003 FOR_EACH_VEC_ELT (tree, fld.types, i, t)
5004 free_lang_data_in_type (t);
5006 pointer_set_destroy (fld.pset);
5007 VEC_free (tree, heap, fld.worklist);
5008 VEC_free (tree, heap, fld.decls);
5009 VEC_free (tree, heap, fld.types);
5013 /* Free resources that are used by FE but are not needed once they are done. */
5016 free_lang_data (void)
5020 /* If we are the LTO frontend we have freed lang-specific data already. */
5022 || !flag_generate_lto)
5025 /* Allocate and assign alias sets to the standard integer types
5026 while the slots are still in the way the frontends generated them. */
5027 for (i = 0; i < itk_none; ++i)
5028 if (integer_types[i])
5029 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5031 /* Traverse the IL resetting language specific information for
5032 operands, expressions, etc. */
5033 free_lang_data_in_cgraph ();
5035 /* Create gimple variants for common types. */
5036 ptrdiff_type_node = integer_type_node;
5037 fileptr_type_node = ptr_type_node;
5038 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
5039 || (TYPE_MODE (boolean_type_node)
5040 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
5041 || TYPE_PRECISION (boolean_type_node) != 1
5042 || !TYPE_UNSIGNED (boolean_type_node))
5044 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5045 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5046 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5047 TYPE_PRECISION (boolean_type_node) = 1;
5048 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5049 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5052 /* Unify char_type_node with its properly signed variant. */
5053 if (TYPE_UNSIGNED (char_type_node))
5054 unsigned_char_type_node = char_type_node;
5056 signed_char_type_node = char_type_node;
5058 /* Reset some langhooks. Do not reset types_compatible_p, it may
5059 still be used indirectly via the get_alias_set langhook. */
5060 lang_hooks.callgraph.analyze_expr = NULL;
5061 lang_hooks.dwarf_name = lhd_dwarf_name;
5062 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5063 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
5065 /* Reset diagnostic machinery. */
5066 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5067 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5068 diagnostic_format_decoder (global_dc) = default_tree_printer;
5074 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5078 "*free_lang_data", /* name */
5080 free_lang_data, /* execute */
5083 0, /* static_pass_number */
5084 TV_IPA_FREE_LANG_DATA, /* tv_id */
5085 0, /* properties_required */
5086 0, /* properties_provided */
5087 0, /* properties_destroyed */
5088 0, /* todo_flags_start */
5089 TODO_ggc_collect /* todo_flags_finish */
5093 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5096 We try both `text' and `__text__', ATTR may be either one. */
5097 /* ??? It might be a reasonable simplification to require ATTR to be only
5098 `text'. One might then also require attribute lists to be stored in
5099 their canonicalized form. */
5102 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5107 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5110 p = IDENTIFIER_POINTER (ident);
5111 ident_len = IDENTIFIER_LENGTH (ident);
5113 if (ident_len == attr_len
5114 && strcmp (attr, p) == 0)
5117 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5120 gcc_assert (attr[1] == '_');
5121 gcc_assert (attr[attr_len - 2] == '_');
5122 gcc_assert (attr[attr_len - 1] == '_');
5123 if (ident_len == attr_len - 4
5124 && strncmp (attr + 2, p, attr_len - 4) == 0)
5129 if (ident_len == attr_len + 4
5130 && p[0] == '_' && p[1] == '_'
5131 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5132 && strncmp (attr, p + 2, attr_len) == 0)
5139 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5142 We try both `text' and `__text__', ATTR may be either one. */
5145 is_attribute_p (const char *attr, const_tree ident)
5147 return is_attribute_with_length_p (attr, strlen (attr), ident);
5150 /* Given an attribute name and a list of attributes, return a pointer to the
5151 attribute's list element if the attribute is part of the list, or NULL_TREE
5152 if not found. If the attribute appears more than once, this only
5153 returns the first occurrence; the TREE_CHAIN of the return value should
5154 be passed back in if further occurrences are wanted. */
5157 lookup_attribute (const char *attr_name, tree list)
5160 size_t attr_len = strlen (attr_name);
5162 for (l = list; l; l = TREE_CHAIN (l))
5164 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5165 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5171 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5175 remove_attribute (const char *attr_name, tree list)
5178 size_t attr_len = strlen (attr_name);
5180 for (p = &list; *p; )
5183 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5184 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5185 *p = TREE_CHAIN (l);
5187 p = &TREE_CHAIN (l);
5193 /* Return an attribute list that is the union of a1 and a2. */
5196 merge_attributes (tree a1, tree a2)
5200 /* Either one unset? Take the set one. */
5202 if ((attributes = a1) == 0)
5205 /* One that completely contains the other? Take it. */
5207 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5209 if (attribute_list_contained (a2, a1))
5213 /* Pick the longest list, and hang on the other list. */
5215 if (list_length (a1) < list_length (a2))
5216 attributes = a2, a2 = a1;
5218 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5221 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5224 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5227 if (TREE_VALUE (a) != NULL
5228 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5229 && TREE_VALUE (a2) != NULL
5230 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5232 if (simple_cst_list_equal (TREE_VALUE (a),
5233 TREE_VALUE (a2)) == 1)
5236 else if (simple_cst_equal (TREE_VALUE (a),
5237 TREE_VALUE (a2)) == 1)
5242 a1 = copy_node (a2);
5243 TREE_CHAIN (a1) = attributes;
5252 /* Given types T1 and T2, merge their attributes and return
5256 merge_type_attributes (tree t1, tree t2)
5258 return merge_attributes (TYPE_ATTRIBUTES (t1),
5259 TYPE_ATTRIBUTES (t2));
5262 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5266 merge_decl_attributes (tree olddecl, tree newdecl)
5268 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5269 DECL_ATTRIBUTES (newdecl));
5272 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5274 /* Specialization of merge_decl_attributes for various Windows targets.
5276 This handles the following situation:
5278 __declspec (dllimport) int foo;
5281 The second instance of `foo' nullifies the dllimport. */
5284 merge_dllimport_decl_attributes (tree old, tree new_tree)
5287 int delete_dllimport_p = 1;
5289 /* What we need to do here is remove from `old' dllimport if it doesn't
5290 appear in `new'. dllimport behaves like extern: if a declaration is
5291 marked dllimport and a definition appears later, then the object
5292 is not dllimport'd. We also remove a `new' dllimport if the old list
5293 contains dllexport: dllexport always overrides dllimport, regardless
5294 of the order of declaration. */
5295 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5296 delete_dllimport_p = 0;
5297 else if (DECL_DLLIMPORT_P (new_tree)
5298 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5300 DECL_DLLIMPORT_P (new_tree) = 0;
5301 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5302 "dllimport ignored", new_tree);
5304 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5306 /* Warn about overriding a symbol that has already been used, e.g.:
5307 extern int __attribute__ ((dllimport)) foo;
5308 int* bar () {return &foo;}
5311 if (TREE_USED (old))
5313 warning (0, "%q+D redeclared without dllimport attribute "
5314 "after being referenced with dll linkage", new_tree);
5315 /* If we have used a variable's address with dllimport linkage,
5316 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5317 decl may already have had TREE_CONSTANT computed.
5318 We still remove the attribute so that assembler code refers
5319 to '&foo rather than '_imp__foo'. */
5320 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5321 DECL_DLLIMPORT_P (new_tree) = 1;
5324 /* Let an inline definition silently override the external reference,
5325 but otherwise warn about attribute inconsistency. */
5326 else if (TREE_CODE (new_tree) == VAR_DECL
5327 || !DECL_DECLARED_INLINE_P (new_tree))
5328 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5329 "previous dllimport ignored", new_tree);
5332 delete_dllimport_p = 0;
5334 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5336 if (delete_dllimport_p)
5339 const size_t attr_len = strlen ("dllimport");
5341 /* Scan the list for dllimport and delete it. */
5342 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5344 if (is_attribute_with_length_p ("dllimport", attr_len,
5347 if (prev == NULL_TREE)
5350 TREE_CHAIN (prev) = TREE_CHAIN (t);
5359 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5360 struct attribute_spec.handler. */
5363 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5369 /* These attributes may apply to structure and union types being created,
5370 but otherwise should pass to the declaration involved. */
5373 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5374 | (int) ATTR_FLAG_ARRAY_NEXT))
5376 *no_add_attrs = true;
5377 return tree_cons (name, args, NULL_TREE);
5379 if (TREE_CODE (node) == RECORD_TYPE
5380 || TREE_CODE (node) == UNION_TYPE)
5382 node = TYPE_NAME (node);
5388 warning (OPT_Wattributes, "%qE attribute ignored",
5390 *no_add_attrs = true;
5395 if (TREE_CODE (node) != FUNCTION_DECL
5396 && TREE_CODE (node) != VAR_DECL
5397 && TREE_CODE (node) != TYPE_DECL)
5399 *no_add_attrs = true;
5400 warning (OPT_Wattributes, "%qE attribute ignored",
5405 if (TREE_CODE (node) == TYPE_DECL
5406 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5407 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5409 *no_add_attrs = true;
5410 warning (OPT_Wattributes, "%qE attribute ignored",
5415 is_dllimport = is_attribute_p ("dllimport", name);
5417 /* Report error on dllimport ambiguities seen now before they cause
5421 /* Honor any target-specific overrides. */
5422 if (!targetm.valid_dllimport_attribute_p (node))
5423 *no_add_attrs = true;
5425 else if (TREE_CODE (node) == FUNCTION_DECL
5426 && DECL_DECLARED_INLINE_P (node))
5428 warning (OPT_Wattributes, "inline function %q+D declared as "
5429 " dllimport: attribute ignored", node);
5430 *no_add_attrs = true;
5432 /* Like MS, treat definition of dllimported variables and
5433 non-inlined functions on declaration as syntax errors. */
5434 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5436 error ("function %q+D definition is marked dllimport", node);
5437 *no_add_attrs = true;
5440 else if (TREE_CODE (node) == VAR_DECL)
5442 if (DECL_INITIAL (node))
5444 error ("variable %q+D definition is marked dllimport",
5446 *no_add_attrs = true;
5449 /* `extern' needn't be specified with dllimport.
5450 Specify `extern' now and hope for the best. Sigh. */
5451 DECL_EXTERNAL (node) = 1;
5452 /* Also, implicitly give dllimport'd variables declared within
5453 a function global scope, unless declared static. */
5454 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5455 TREE_PUBLIC (node) = 1;
5458 if (*no_add_attrs == false)
5459 DECL_DLLIMPORT_P (node) = 1;
5461 else if (TREE_CODE (node) == FUNCTION_DECL
5462 && DECL_DECLARED_INLINE_P (node))
5463 /* An exported function, even if inline, must be emitted. */
5464 DECL_EXTERNAL (node) = 0;
5466 /* Report error if symbol is not accessible at global scope. */
5467 if (!TREE_PUBLIC (node)
5468 && (TREE_CODE (node) == VAR_DECL
5469 || TREE_CODE (node) == FUNCTION_DECL))
5471 error ("external linkage required for symbol %q+D because of "
5472 "%qE attribute", node, name);
5473 *no_add_attrs = true;
5476 /* A dllexport'd entity must have default visibility so that other
5477 program units (shared libraries or the main executable) can see
5478 it. A dllimport'd entity must have default visibility so that
5479 the linker knows that undefined references within this program
5480 unit can be resolved by the dynamic linker. */
5483 if (DECL_VISIBILITY_SPECIFIED (node)
5484 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5485 error ("%qE implies default visibility, but %qD has already "
5486 "been declared with a different visibility",
5488 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5489 DECL_VISIBILITY_SPECIFIED (node) = 1;
5495 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5497 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5498 of the various TYPE_QUAL values. */
5501 set_type_quals (tree type, int type_quals)
5503 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5504 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5505 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5506 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5509 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5512 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5514 return (TYPE_QUALS (cand) == type_quals
5515 && TYPE_NAME (cand) == TYPE_NAME (base)
5516 /* Apparently this is needed for Objective-C. */
5517 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5518 /* Check alignment. */
5519 && TYPE_ALIGN (cand) == TYPE_ALIGN (base)
5520 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5521 TYPE_ATTRIBUTES (base)));
5524 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5527 check_aligned_type (const_tree cand, const_tree base, unsigned int align)
5529 return (TYPE_QUALS (cand) == TYPE_QUALS (base)
5530 && TYPE_NAME (cand) == TYPE_NAME (base)
5531 /* Apparently this is needed for Objective-C. */
5532 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5533 /* Check alignment. */
5534 && TYPE_ALIGN (cand) == align
5535 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5536 TYPE_ATTRIBUTES (base)));
5539 /* Return a version of the TYPE, qualified as indicated by the
5540 TYPE_QUALS, if one exists. If no qualified version exists yet,
5541 return NULL_TREE. */
5544 get_qualified_type (tree type, int type_quals)
5548 if (TYPE_QUALS (type) == type_quals)
5551 /* Search the chain of variants to see if there is already one there just
5552 like the one we need to have. If so, use that existing one. We must
5553 preserve the TYPE_NAME, since there is code that depends on this. */
5554 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5555 if (check_qualified_type (t, type, type_quals))
5561 /* Like get_qualified_type, but creates the type if it does not
5562 exist. This function never returns NULL_TREE. */
5565 build_qualified_type (tree type, int type_quals)
5569 /* See if we already have the appropriate qualified variant. */
5570 t = get_qualified_type (type, type_quals);
5572 /* If not, build it. */
5575 t = build_variant_type_copy (type);
5576 set_type_quals (t, type_quals);
5578 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5579 /* Propagate structural equality. */
5580 SET_TYPE_STRUCTURAL_EQUALITY (t);
5581 else if (TYPE_CANONICAL (type) != type)
5582 /* Build the underlying canonical type, since it is different
5584 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5587 /* T is its own canonical type. */
5588 TYPE_CANONICAL (t) = t;
5595 /* Create a variant of type T with alignment ALIGN. */
5598 build_aligned_type (tree type, unsigned int align)
5602 if (TYPE_PACKED (type)
5603 || TYPE_ALIGN (type) == align)
5606 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5607 if (check_aligned_type (t, type, align))
5610 t = build_variant_type_copy (type);
5611 TYPE_ALIGN (t) = align;
5616 /* Create a new distinct copy of TYPE. The new type is made its own
5617 MAIN_VARIANT. If TYPE requires structural equality checks, the
5618 resulting type requires structural equality checks; otherwise, its
5619 TYPE_CANONICAL points to itself. */
5622 build_distinct_type_copy (tree type)
5624 tree t = copy_node (type);
5626 TYPE_POINTER_TO (t) = 0;
5627 TYPE_REFERENCE_TO (t) = 0;
5629 /* Set the canonical type either to a new equivalence class, or
5630 propagate the need for structural equality checks. */
5631 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5632 SET_TYPE_STRUCTURAL_EQUALITY (t);
5634 TYPE_CANONICAL (t) = t;
5636 /* Make it its own variant. */
5637 TYPE_MAIN_VARIANT (t) = t;
5638 TYPE_NEXT_VARIANT (t) = 0;
5640 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5641 whose TREE_TYPE is not t. This can also happen in the Ada
5642 frontend when using subtypes. */
5647 /* Create a new variant of TYPE, equivalent but distinct. This is so
5648 the caller can modify it. TYPE_CANONICAL for the return type will
5649 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5650 are considered equal by the language itself (or that both types
5651 require structural equality checks). */
5654 build_variant_type_copy (tree type)
5656 tree t, m = TYPE_MAIN_VARIANT (type);
5658 t = build_distinct_type_copy (type);
5660 /* Since we're building a variant, assume that it is a non-semantic
5661 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5662 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5664 /* Add the new type to the chain of variants of TYPE. */
5665 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5666 TYPE_NEXT_VARIANT (m) = t;
5667 TYPE_MAIN_VARIANT (t) = m;
5672 /* Return true if the from tree in both tree maps are equal. */
5675 tree_map_base_eq (const void *va, const void *vb)
5677 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5678 *const b = (const struct tree_map_base *) vb;
5679 return (a->from == b->from);
5682 /* Hash a from tree in a tree_base_map. */
5685 tree_map_base_hash (const void *item)
5687 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5690 /* Return true if this tree map structure is marked for garbage collection
5691 purposes. We simply return true if the from tree is marked, so that this
5692 structure goes away when the from tree goes away. */
5695 tree_map_base_marked_p (const void *p)
5697 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5700 /* Hash a from tree in a tree_map. */
5703 tree_map_hash (const void *item)
5705 return (((const struct tree_map *) item)->hash);
5708 /* Hash a from tree in a tree_decl_map. */
5711 tree_decl_map_hash (const void *item)
5713 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5716 /* Return the initialization priority for DECL. */
5719 decl_init_priority_lookup (tree decl)
5721 struct tree_priority_map *h;
5722 struct tree_map_base in;
5724 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5726 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5727 return h ? h->init : DEFAULT_INIT_PRIORITY;
5730 /* Return the finalization priority for DECL. */
5733 decl_fini_priority_lookup (tree decl)
5735 struct tree_priority_map *h;
5736 struct tree_map_base in;
5738 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5740 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5741 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5744 /* Return the initialization and finalization priority information for
5745 DECL. If there is no previous priority information, a freshly
5746 allocated structure is returned. */
5748 static struct tree_priority_map *
5749 decl_priority_info (tree decl)
5751 struct tree_priority_map in;
5752 struct tree_priority_map *h;
5755 in.base.from = decl;
5756 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5757 h = (struct tree_priority_map *) *loc;
5760 h = ggc_alloc_cleared_tree_priority_map ();
5762 h->base.from = decl;
5763 h->init = DEFAULT_INIT_PRIORITY;
5764 h->fini = DEFAULT_INIT_PRIORITY;
5770 /* Set the initialization priority for DECL to PRIORITY. */
5773 decl_init_priority_insert (tree decl, priority_type priority)
5775 struct tree_priority_map *h;
5777 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5778 h = decl_priority_info (decl);
5782 /* Set the finalization priority for DECL to PRIORITY. */
5785 decl_fini_priority_insert (tree decl, priority_type priority)
5787 struct tree_priority_map *h;
5789 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5790 h = decl_priority_info (decl);
5794 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5797 print_debug_expr_statistics (void)
5799 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5800 (long) htab_size (debug_expr_for_decl),
5801 (long) htab_elements (debug_expr_for_decl),
5802 htab_collisions (debug_expr_for_decl));
5805 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5808 print_value_expr_statistics (void)
5810 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5811 (long) htab_size (value_expr_for_decl),
5812 (long) htab_elements (value_expr_for_decl),
5813 htab_collisions (value_expr_for_decl));
5816 /* Lookup a debug expression for FROM, and return it if we find one. */
5819 decl_debug_expr_lookup (tree from)
5821 struct tree_decl_map *h, in;
5822 in.base.from = from;
5824 h = (struct tree_decl_map *)
5825 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5831 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5834 decl_debug_expr_insert (tree from, tree to)
5836 struct tree_decl_map *h;
5839 h = ggc_alloc_tree_decl_map ();
5840 h->base.from = from;
5842 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
5844 *(struct tree_decl_map **) loc = h;
5847 /* Lookup a value expression for FROM, and return it if we find one. */
5850 decl_value_expr_lookup (tree from)
5852 struct tree_decl_map *h, in;
5853 in.base.from = from;
5855 h = (struct tree_decl_map *)
5856 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
5862 /* Insert a mapping FROM->TO in the value expression hashtable. */
5865 decl_value_expr_insert (tree from, tree to)
5867 struct tree_decl_map *h;
5870 h = ggc_alloc_tree_decl_map ();
5871 h->base.from = from;
5873 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
5875 *(struct tree_decl_map **) loc = h;
5878 /* Hashing of types so that we don't make duplicates.
5879 The entry point is `type_hash_canon'. */
5881 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5882 with types in the TREE_VALUE slots), by adding the hash codes
5883 of the individual types. */
5886 type_hash_list (const_tree list, hashval_t hashcode)
5890 for (tail = list; tail; tail = TREE_CHAIN (tail))
5891 if (TREE_VALUE (tail) != error_mark_node)
5892 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5898 /* These are the Hashtable callback functions. */
5900 /* Returns true iff the types are equivalent. */
5903 type_hash_eq (const void *va, const void *vb)
5905 const struct type_hash *const a = (const struct type_hash *) va,
5906 *const b = (const struct type_hash *) vb;
5908 /* First test the things that are the same for all types. */
5909 if (a->hash != b->hash
5910 || TREE_CODE (a->type) != TREE_CODE (b->type)
5911 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5912 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5913 TYPE_ATTRIBUTES (b->type))
5914 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5915 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5916 || (TREE_CODE (a->type) != COMPLEX_TYPE
5917 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5920 switch (TREE_CODE (a->type))
5925 case REFERENCE_TYPE:
5929 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5932 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5933 && !(TYPE_VALUES (a->type)
5934 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5935 && TYPE_VALUES (b->type)
5936 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5937 && type_list_equal (TYPE_VALUES (a->type),
5938 TYPE_VALUES (b->type))))
5941 /* ... fall through ... */
5946 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5947 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5948 TYPE_MAX_VALUE (b->type)))
5949 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5950 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5951 TYPE_MIN_VALUE (b->type))));
5953 case FIXED_POINT_TYPE:
5954 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5957 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5960 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5961 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5962 || (TYPE_ARG_TYPES (a->type)
5963 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5964 && TYPE_ARG_TYPES (b->type)
5965 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5966 && type_list_equal (TYPE_ARG_TYPES (a->type),
5967 TYPE_ARG_TYPES (b->type)))));
5970 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5974 case QUAL_UNION_TYPE:
5975 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5976 || (TYPE_FIELDS (a->type)
5977 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5978 && TYPE_FIELDS (b->type)
5979 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5980 && type_list_equal (TYPE_FIELDS (a->type),
5981 TYPE_FIELDS (b->type))));
5984 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5985 || (TYPE_ARG_TYPES (a->type)
5986 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5987 && TYPE_ARG_TYPES (b->type)
5988 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5989 && type_list_equal (TYPE_ARG_TYPES (a->type),
5990 TYPE_ARG_TYPES (b->type))))
5998 if (lang_hooks.types.type_hash_eq != NULL)
5999 return lang_hooks.types.type_hash_eq (a->type, b->type);
6004 /* Return the cached hash value. */
6007 type_hash_hash (const void *item)
6009 return ((const struct type_hash *) item)->hash;
6012 /* Look in the type hash table for a type isomorphic to TYPE.
6013 If one is found, return it. Otherwise return 0. */
6016 type_hash_lookup (hashval_t hashcode, tree type)
6018 struct type_hash *h, in;
6020 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6021 must call that routine before comparing TYPE_ALIGNs. */
6027 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6034 /* Add an entry to the type-hash-table
6035 for a type TYPE whose hash code is HASHCODE. */
6038 type_hash_add (hashval_t hashcode, tree type)
6040 struct type_hash *h;
6043 h = ggc_alloc_type_hash ();
6046 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6050 /* Given TYPE, and HASHCODE its hash code, return the canonical
6051 object for an identical type if one already exists.
6052 Otherwise, return TYPE, and record it as the canonical object.
6054 To use this function, first create a type of the sort you want.
6055 Then compute its hash code from the fields of the type that
6056 make it different from other similar types.
6057 Then call this function and use the value. */
6060 type_hash_canon (unsigned int hashcode, tree type)
6064 /* The hash table only contains main variants, so ensure that's what we're
6066 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6068 /* See if the type is in the hash table already. If so, return it.
6069 Otherwise, add the type. */
6070 t1 = type_hash_lookup (hashcode, type);
6073 #ifdef GATHER_STATISTICS
6074 tree_node_counts[(int) t_kind]--;
6075 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
6081 type_hash_add (hashcode, type);
6086 /* See if the data pointed to by the type hash table is marked. We consider
6087 it marked if the type is marked or if a debug type number or symbol
6088 table entry has been made for the type. */
6091 type_hash_marked_p (const void *p)
6093 const_tree const type = ((const struct type_hash *) p)->type;
6095 return ggc_marked_p (type);
6099 print_type_hash_statistics (void)
6101 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6102 (long) htab_size (type_hash_table),
6103 (long) htab_elements (type_hash_table),
6104 htab_collisions (type_hash_table));
6107 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6108 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6109 by adding the hash codes of the individual attributes. */
6112 attribute_hash_list (const_tree list, hashval_t hashcode)
6116 for (tail = list; tail; tail = TREE_CHAIN (tail))
6117 /* ??? Do we want to add in TREE_VALUE too? */
6118 hashcode = iterative_hash_object
6119 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6123 /* Given two lists of attributes, return true if list l2 is
6124 equivalent to l1. */
6127 attribute_list_equal (const_tree l1, const_tree l2)
6129 return attribute_list_contained (l1, l2)
6130 && attribute_list_contained (l2, l1);
6133 /* Given two lists of attributes, return true if list L2 is
6134 completely contained within L1. */
6135 /* ??? This would be faster if attribute names were stored in a canonicalized
6136 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6137 must be used to show these elements are equivalent (which they are). */
6138 /* ??? It's not clear that attributes with arguments will always be handled
6142 attribute_list_contained (const_tree l1, const_tree l2)
6146 /* First check the obvious, maybe the lists are identical. */
6150 /* Maybe the lists are similar. */
6151 for (t1 = l1, t2 = l2;
6153 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6154 && TREE_VALUE (t1) == TREE_VALUE (t2);
6155 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6157 /* Maybe the lists are equal. */
6158 if (t1 == 0 && t2 == 0)
6161 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6164 /* This CONST_CAST is okay because lookup_attribute does not
6165 modify its argument and the return value is assigned to a
6167 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6168 CONST_CAST_TREE(l1));
6170 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6173 if (TREE_VALUE (t2) != NULL
6174 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6175 && TREE_VALUE (attr) != NULL
6176 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6178 if (simple_cst_list_equal (TREE_VALUE (t2),
6179 TREE_VALUE (attr)) == 1)
6182 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6193 /* Given two lists of types
6194 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6195 return 1 if the lists contain the same types in the same order.
6196 Also, the TREE_PURPOSEs must match. */
6199 type_list_equal (const_tree l1, const_tree l2)
6203 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6204 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6205 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6206 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6207 && (TREE_TYPE (TREE_PURPOSE (t1))
6208 == TREE_TYPE (TREE_PURPOSE (t2))))))
6214 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6215 given by TYPE. If the argument list accepts variable arguments,
6216 then this function counts only the ordinary arguments. */
6219 type_num_arguments (const_tree type)
6224 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6225 /* If the function does not take a variable number of arguments,
6226 the last element in the list will have type `void'. */
6227 if (VOID_TYPE_P (TREE_VALUE (t)))
6235 /* Nonzero if integer constants T1 and T2
6236 represent the same constant value. */
6239 tree_int_cst_equal (const_tree t1, const_tree t2)
6244 if (t1 == 0 || t2 == 0)
6247 if (TREE_CODE (t1) == INTEGER_CST
6248 && TREE_CODE (t2) == INTEGER_CST
6249 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6250 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6256 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6257 The precise way of comparison depends on their data type. */
6260 tree_int_cst_lt (const_tree t1, const_tree t2)
6265 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6267 int t1_sgn = tree_int_cst_sgn (t1);
6268 int t2_sgn = tree_int_cst_sgn (t2);
6270 if (t1_sgn < t2_sgn)
6272 else if (t1_sgn > t2_sgn)
6274 /* Otherwise, both are non-negative, so we compare them as
6275 unsigned just in case one of them would overflow a signed
6278 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6279 return INT_CST_LT (t1, t2);
6281 return INT_CST_LT_UNSIGNED (t1, t2);
6284 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6287 tree_int_cst_compare (const_tree t1, const_tree t2)
6289 if (tree_int_cst_lt (t1, t2))
6291 else if (tree_int_cst_lt (t2, t1))
6297 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6298 the host. If POS is zero, the value can be represented in a single
6299 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6300 be represented in a single unsigned HOST_WIDE_INT. */
6303 host_integerp (const_tree t, int pos)
6308 return (TREE_CODE (t) == INTEGER_CST
6309 && ((TREE_INT_CST_HIGH (t) == 0
6310 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6311 || (! pos && TREE_INT_CST_HIGH (t) == -1
6312 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6313 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6314 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6315 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6316 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6319 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6320 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6321 be non-negative. We must be able to satisfy the above conditions. */
6324 tree_low_cst (const_tree t, int pos)
6326 gcc_assert (host_integerp (t, pos));
6327 return TREE_INT_CST_LOW (t);
6330 /* Return the most significant bit of the integer constant T. */
6333 tree_int_cst_msb (const_tree t)
6337 unsigned HOST_WIDE_INT l;
6339 /* Note that using TYPE_PRECISION here is wrong. We care about the
6340 actual bits, not the (arbitrary) range of the type. */
6341 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6342 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6343 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6344 return (l & 1) == 1;
6347 /* Return an indication of the sign of the integer constant T.
6348 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6349 Note that -1 will never be returned if T's type is unsigned. */
6352 tree_int_cst_sgn (const_tree t)
6354 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6356 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6358 else if (TREE_INT_CST_HIGH (t) < 0)
6364 /* Return the minimum number of bits needed to represent VALUE in a
6365 signed or unsigned type, UNSIGNEDP says which. */
6368 tree_int_cst_min_precision (tree value, bool unsignedp)
6372 /* If the value is negative, compute its negative minus 1. The latter
6373 adjustment is because the absolute value of the largest negative value
6374 is one larger than the largest positive value. This is equivalent to
6375 a bit-wise negation, so use that operation instead. */
6377 if (tree_int_cst_sgn (value) < 0)
6378 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6380 /* Return the number of bits needed, taking into account the fact
6381 that we need one more bit for a signed than unsigned type. */
6383 if (integer_zerop (value))
6386 log = tree_floor_log2 (value);
6388 return log + 1 + !unsignedp;
6391 /* Compare two constructor-element-type constants. Return 1 if the lists
6392 are known to be equal; otherwise return 0. */
6395 simple_cst_list_equal (const_tree l1, const_tree l2)
6397 while (l1 != NULL_TREE && l2 != NULL_TREE)
6399 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6402 l1 = TREE_CHAIN (l1);
6403 l2 = TREE_CHAIN (l2);
6409 /* Return truthvalue of whether T1 is the same tree structure as T2.
6410 Return 1 if they are the same.
6411 Return 0 if they are understandably different.
6412 Return -1 if either contains tree structure not understood by
6416 simple_cst_equal (const_tree t1, const_tree t2)
6418 enum tree_code code1, code2;
6424 if (t1 == 0 || t2 == 0)
6427 code1 = TREE_CODE (t1);
6428 code2 = TREE_CODE (t2);
6430 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6432 if (CONVERT_EXPR_CODE_P (code2)
6433 || code2 == NON_LVALUE_EXPR)
6434 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6436 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6439 else if (CONVERT_EXPR_CODE_P (code2)
6440 || code2 == NON_LVALUE_EXPR)
6441 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6449 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6450 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6453 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6456 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6459 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6460 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6461 TREE_STRING_LENGTH (t1)));
6465 unsigned HOST_WIDE_INT idx;
6466 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6467 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6469 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6472 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6473 /* ??? Should we handle also fields here? */
6474 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6475 VEC_index (constructor_elt, v2, idx)->value))
6481 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6484 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6487 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6490 const_tree arg1, arg2;
6491 const_call_expr_arg_iterator iter1, iter2;
6492 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6493 arg2 = first_const_call_expr_arg (t2, &iter2);
6495 arg1 = next_const_call_expr_arg (&iter1),
6496 arg2 = next_const_call_expr_arg (&iter2))
6498 cmp = simple_cst_equal (arg1, arg2);
6502 return arg1 == arg2;
6506 /* Special case: if either target is an unallocated VAR_DECL,
6507 it means that it's going to be unified with whatever the
6508 TARGET_EXPR is really supposed to initialize, so treat it
6509 as being equivalent to anything. */
6510 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6511 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6512 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6513 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6514 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6515 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6518 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6523 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6525 case WITH_CLEANUP_EXPR:
6526 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6530 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6533 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6534 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6548 /* This general rule works for most tree codes. All exceptions should be
6549 handled above. If this is a language-specific tree code, we can't
6550 trust what might be in the operand, so say we don't know
6552 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6555 switch (TREE_CODE_CLASS (code1))
6559 case tcc_comparison:
6560 case tcc_expression:
6564 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6566 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6578 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6579 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6580 than U, respectively. */
6583 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6585 if (tree_int_cst_sgn (t) < 0)
6587 else if (TREE_INT_CST_HIGH (t) != 0)
6589 else if (TREE_INT_CST_LOW (t) == u)
6591 else if (TREE_INT_CST_LOW (t) < u)
6597 /* Return true if CODE represents an associative tree code. Otherwise
6600 associative_tree_code (enum tree_code code)
6619 /* Return true if CODE represents a commutative tree code. Otherwise
6622 commutative_tree_code (enum tree_code code)
6635 case UNORDERED_EXPR:
6639 case TRUTH_AND_EXPR:
6640 case TRUTH_XOR_EXPR:
6650 /* Return true if CODE represents a ternary tree code for which the
6651 first two operands are commutative. Otherwise return false. */
6653 commutative_ternary_tree_code (enum tree_code code)
6657 case WIDEN_MULT_PLUS_EXPR:
6658 case WIDEN_MULT_MINUS_EXPR:
6667 /* Generate a hash value for an expression. This can be used iteratively
6668 by passing a previous result as the VAL argument.
6670 This function is intended to produce the same hash for expressions which
6671 would compare equal using operand_equal_p. */
6674 iterative_hash_expr (const_tree t, hashval_t val)
6677 enum tree_code code;
6681 return iterative_hash_hashval_t (0, val);
6683 code = TREE_CODE (t);
6687 /* Alas, constants aren't shared, so we can't rely on pointer
6690 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6691 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6694 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6696 return iterative_hash_hashval_t (val2, val);
6700 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6702 return iterative_hash_hashval_t (val2, val);
6705 return iterative_hash (TREE_STRING_POINTER (t),
6706 TREE_STRING_LENGTH (t), val);
6708 val = iterative_hash_expr (TREE_REALPART (t), val);
6709 return iterative_hash_expr (TREE_IMAGPART (t), val);
6711 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6713 /* We can just compare by pointer. */
6714 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6715 case PLACEHOLDER_EXPR:
6716 /* The node itself doesn't matter. */
6719 /* A list of expressions, for a CALL_EXPR or as the elements of a
6721 for (; t; t = TREE_CHAIN (t))
6722 val = iterative_hash_expr (TREE_VALUE (t), val);
6726 unsigned HOST_WIDE_INT idx;
6728 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6730 val = iterative_hash_expr (field, val);
6731 val = iterative_hash_expr (value, val);
6737 /* The type of the second operand is relevant, except for
6738 its top-level qualifiers. */
6739 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t, 1)));
6741 val = iterative_hash_object (TYPE_HASH (type), val);
6743 /* We could use the standard hash computation from this point
6745 val = iterative_hash_object (code, val);
6746 val = iterative_hash_expr (TREE_OPERAND (t, 1), val);
6747 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6751 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6752 Otherwise nodes that compare equal according to operand_equal_p might
6753 get different hash codes. However, don't do this for machine specific
6754 or front end builtins, since the function code is overloaded in those
6756 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6757 && built_in_decls[DECL_FUNCTION_CODE (t)])
6759 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6760 code = TREE_CODE (t);
6764 tclass = TREE_CODE_CLASS (code);
6766 if (tclass == tcc_declaration)
6768 /* DECL's have a unique ID */
6769 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6773 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6775 val = iterative_hash_object (code, val);
6777 /* Don't hash the type, that can lead to having nodes which
6778 compare equal according to operand_equal_p, but which
6779 have different hash codes. */
6780 if (CONVERT_EXPR_CODE_P (code)
6781 || code == NON_LVALUE_EXPR)
6783 /* Make sure to include signness in the hash computation. */
6784 val += TYPE_UNSIGNED (TREE_TYPE (t));
6785 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6788 else if (commutative_tree_code (code))
6790 /* It's a commutative expression. We want to hash it the same
6791 however it appears. We do this by first hashing both operands
6792 and then rehashing based on the order of their independent
6794 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6795 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6799 t = one, one = two, two = t;
6801 val = iterative_hash_hashval_t (one, val);
6802 val = iterative_hash_hashval_t (two, val);
6805 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6806 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6813 /* Generate a hash value for a pair of expressions. This can be used
6814 iteratively by passing a previous result as the VAL argument.
6816 The same hash value is always returned for a given pair of expressions,
6817 regardless of the order in which they are presented. This is useful in
6818 hashing the operands of commutative functions. */
6821 iterative_hash_exprs_commutative (const_tree t1,
6822 const_tree t2, hashval_t val)
6824 hashval_t one = iterative_hash_expr (t1, 0);
6825 hashval_t two = iterative_hash_expr (t2, 0);
6829 t = one, one = two, two = t;
6830 val = iterative_hash_hashval_t (one, val);
6831 val = iterative_hash_hashval_t (two, val);
6836 /* Constructors for pointer, array and function types.
6837 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6838 constructed by language-dependent code, not here.) */
6840 /* Construct, lay out and return the type of pointers to TO_TYPE with
6841 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6842 reference all of memory. If such a type has already been
6843 constructed, reuse it. */
6846 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6851 if (to_type == error_mark_node)
6852 return error_mark_node;
6854 /* If the pointed-to type has the may_alias attribute set, force
6855 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6856 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6857 can_alias_all = true;
6859 /* In some cases, languages will have things that aren't a POINTER_TYPE
6860 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6861 In that case, return that type without regard to the rest of our
6864 ??? This is a kludge, but consistent with the way this function has
6865 always operated and there doesn't seem to be a good way to avoid this
6867 if (TYPE_POINTER_TO (to_type) != 0
6868 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6869 return TYPE_POINTER_TO (to_type);
6871 /* First, if we already have a type for pointers to TO_TYPE and it's
6872 the proper mode, use it. */
6873 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6874 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6877 t = make_node (POINTER_TYPE);
6879 TREE_TYPE (t) = to_type;
6880 SET_TYPE_MODE (t, mode);
6881 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6882 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6883 TYPE_POINTER_TO (to_type) = t;
6885 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6886 SET_TYPE_STRUCTURAL_EQUALITY (t);
6887 else if (TYPE_CANONICAL (to_type) != to_type)
6889 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6890 mode, can_alias_all);
6892 /* Lay out the type. This function has many callers that are concerned
6893 with expression-construction, and this simplifies them all. */
6899 /* By default build pointers in ptr_mode. */
6902 build_pointer_type (tree to_type)
6904 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6905 : TYPE_ADDR_SPACE (to_type);
6906 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6907 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6910 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6913 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6918 if (to_type == error_mark_node)
6919 return error_mark_node;
6921 /* If the pointed-to type has the may_alias attribute set, force
6922 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6923 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6924 can_alias_all = true;
6926 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6927 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6928 In that case, return that type without regard to the rest of our
6931 ??? This is a kludge, but consistent with the way this function has
6932 always operated and there doesn't seem to be a good way to avoid this
6934 if (TYPE_REFERENCE_TO (to_type) != 0
6935 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6936 return TYPE_REFERENCE_TO (to_type);
6938 /* First, if we already have a type for pointers to TO_TYPE and it's
6939 the proper mode, use it. */
6940 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6941 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6944 t = make_node (REFERENCE_TYPE);
6946 TREE_TYPE (t) = to_type;
6947 SET_TYPE_MODE (t, mode);
6948 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6949 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6950 TYPE_REFERENCE_TO (to_type) = t;
6952 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6953 SET_TYPE_STRUCTURAL_EQUALITY (t);
6954 else if (TYPE_CANONICAL (to_type) != to_type)
6956 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6957 mode, can_alias_all);
6965 /* Build the node for the type of references-to-TO_TYPE by default
6969 build_reference_type (tree to_type)
6971 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6972 : TYPE_ADDR_SPACE (to_type);
6973 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6974 return build_reference_type_for_mode (to_type, pointer_mode, false);
6977 /* Build a type that is compatible with t but has no cv quals anywhere
6980 const char *const *const * -> char ***. */
6983 build_type_no_quals (tree t)
6985 switch (TREE_CODE (t))
6988 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6990 TYPE_REF_CAN_ALIAS_ALL (t));
6991 case REFERENCE_TYPE:
6993 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6995 TYPE_REF_CAN_ALIAS_ALL (t));
6997 return TYPE_MAIN_VARIANT (t);
7001 #define MAX_INT_CACHED_PREC \
7002 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7003 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7005 /* Builds a signed or unsigned integer type of precision PRECISION.
7006 Used for C bitfields whose precision does not match that of
7007 built-in target types. */
7009 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7015 unsignedp = MAX_INT_CACHED_PREC + 1;
7017 if (precision <= MAX_INT_CACHED_PREC)
7019 itype = nonstandard_integer_type_cache[precision + unsignedp];
7024 itype = make_node (INTEGER_TYPE);
7025 TYPE_PRECISION (itype) = precision;
7028 fixup_unsigned_type (itype);
7030 fixup_signed_type (itype);
7033 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7034 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7035 if (precision <= MAX_INT_CACHED_PREC)
7036 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7041 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7042 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7043 is true, reuse such a type that has already been constructed. */
7046 build_range_type_1 (tree type, tree lowval, tree highval, bool shared)
7048 tree itype = make_node (INTEGER_TYPE);
7050 TREE_TYPE (itype) = type;
7052 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7053 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7055 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7056 SET_TYPE_MODE (itype, TYPE_MODE (type));
7057 TYPE_SIZE (itype) = TYPE_SIZE (type);
7058 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7059 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7060 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7062 if ((TYPE_MIN_VALUE (itype)
7063 && TREE_CODE (TYPE_MIN_VALUE (itype)) != INTEGER_CST)
7064 || (TYPE_MAX_VALUE (itype)
7065 && TREE_CODE (TYPE_MAX_VALUE (itype)) != INTEGER_CST))
7067 /* Since we cannot reliably merge this type, we need to compare it using
7068 structural equality checks. */
7069 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7075 hashval_t hash = iterative_hash_expr (TYPE_MIN_VALUE (itype), 0);
7076 hash = iterative_hash_expr (TYPE_MAX_VALUE (itype), hash);
7077 hash = iterative_hash_hashval_t (TYPE_HASH (type), hash);
7078 itype = type_hash_canon (hash, itype);
7084 /* Wrapper around build_range_type_1 with SHARED set to true. */
7087 build_range_type (tree type, tree lowval, tree highval)
7089 return build_range_type_1 (type, lowval, highval, true);
7092 /* Wrapper around build_range_type_1 with SHARED set to false. */
7095 build_nonshared_range_type (tree type, tree lowval, tree highval)
7097 return build_range_type_1 (type, lowval, highval, false);
7100 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7101 MAXVAL should be the maximum value in the domain
7102 (one less than the length of the array).
7104 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7105 We don't enforce this limit, that is up to caller (e.g. language front end).
7106 The limit exists because the result is a signed type and we don't handle
7107 sizes that use more than one HOST_WIDE_INT. */
7110 build_index_type (tree maxval)
7112 return build_range_type (sizetype, size_zero_node, maxval);
7115 /* Return true if the debug information for TYPE, a subtype, should be emitted
7116 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7117 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7118 debug info and doesn't reflect the source code. */
7121 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7123 tree base_type = TREE_TYPE (type), low, high;
7125 /* Subrange types have a base type which is an integral type. */
7126 if (!INTEGRAL_TYPE_P (base_type))
7129 /* Get the real bounds of the subtype. */
7130 if (lang_hooks.types.get_subrange_bounds)
7131 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7134 low = TYPE_MIN_VALUE (type);
7135 high = TYPE_MAX_VALUE (type);
7138 /* If the type and its base type have the same representation and the same
7139 name, then the type is not a subrange but a copy of the base type. */
7140 if ((TREE_CODE (base_type) == INTEGER_TYPE
7141 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7142 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7143 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7144 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7146 tree type_name = TYPE_NAME (type);
7147 tree base_type_name = TYPE_NAME (base_type);
7149 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7150 type_name = DECL_NAME (type_name);
7152 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7153 base_type_name = DECL_NAME (base_type_name);
7155 if (type_name == base_type_name)
7166 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7167 and number of elements specified by the range of values of INDEX_TYPE.
7168 If SHARED is true, reuse such a type that has already been constructed. */
7171 build_array_type_1 (tree elt_type, tree index_type, bool shared)
7175 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7177 error ("arrays of functions are not meaningful");
7178 elt_type = integer_type_node;
7181 t = make_node (ARRAY_TYPE);
7182 TREE_TYPE (t) = elt_type;
7183 TYPE_DOMAIN (t) = index_type;
7184 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7187 /* If the element type is incomplete at this point we get marked for
7188 structural equality. Do not record these types in the canonical
7190 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7195 hashval_t hashcode = iterative_hash_object (TYPE_HASH (elt_type), 0);
7197 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7198 t = type_hash_canon (hashcode, t);
7201 if (TYPE_CANONICAL (t) == t)
7203 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7204 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7205 SET_TYPE_STRUCTURAL_EQUALITY (t);
7206 else if (TYPE_CANONICAL (elt_type) != elt_type
7207 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7209 = build_array_type_1 (TYPE_CANONICAL (elt_type),
7211 ? TYPE_CANONICAL (index_type) : NULL_TREE,
7218 /* Wrapper around build_array_type_1 with SHARED set to true. */
7221 build_array_type (tree elt_type, tree index_type)
7223 return build_array_type_1 (elt_type, index_type, true);
7226 /* Wrapper around build_array_type_1 with SHARED set to false. */
7229 build_nonshared_array_type (tree elt_type, tree index_type)
7231 return build_array_type_1 (elt_type, index_type, false);
7234 /* Recursively examines the array elements of TYPE, until a non-array
7235 element type is found. */
7238 strip_array_types (tree type)
7240 while (TREE_CODE (type) == ARRAY_TYPE)
7241 type = TREE_TYPE (type);
7246 /* Computes the canonical argument types from the argument type list
7249 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7250 on entry to this function, or if any of the ARGTYPES are
7253 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7254 true on entry to this function, or if any of the ARGTYPES are
7257 Returns a canonical argument list, which may be ARGTYPES when the
7258 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7259 true) or would not differ from ARGTYPES. */
7262 maybe_canonicalize_argtypes(tree argtypes,
7263 bool *any_structural_p,
7264 bool *any_noncanonical_p)
7267 bool any_noncanonical_argtypes_p = false;
7269 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7271 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7272 /* Fail gracefully by stating that the type is structural. */
7273 *any_structural_p = true;
7274 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7275 *any_structural_p = true;
7276 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7277 || TREE_PURPOSE (arg))
7278 /* If the argument has a default argument, we consider it
7279 non-canonical even though the type itself is canonical.
7280 That way, different variants of function and method types
7281 with default arguments will all point to the variant with
7282 no defaults as their canonical type. */
7283 any_noncanonical_argtypes_p = true;
7286 if (*any_structural_p)
7289 if (any_noncanonical_argtypes_p)
7291 /* Build the canonical list of argument types. */
7292 tree canon_argtypes = NULL_TREE;
7293 bool is_void = false;
7295 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7297 if (arg == void_list_node)
7300 canon_argtypes = tree_cons (NULL_TREE,
7301 TYPE_CANONICAL (TREE_VALUE (arg)),
7305 canon_argtypes = nreverse (canon_argtypes);
7307 canon_argtypes = chainon (canon_argtypes, void_list_node);
7309 /* There is a non-canonical type. */
7310 *any_noncanonical_p = true;
7311 return canon_argtypes;
7314 /* The canonical argument types are the same as ARGTYPES. */
7318 /* Construct, lay out and return
7319 the type of functions returning type VALUE_TYPE
7320 given arguments of types ARG_TYPES.
7321 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7322 are data type nodes for the arguments of the function.
7323 If such a type has already been constructed, reuse it. */
7326 build_function_type (tree value_type, tree arg_types)
7329 hashval_t hashcode = 0;
7330 bool any_structural_p, any_noncanonical_p;
7331 tree canon_argtypes;
7333 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7335 error ("function return type cannot be function");
7336 value_type = integer_type_node;
7339 /* Make a node of the sort we want. */
7340 t = make_node (FUNCTION_TYPE);
7341 TREE_TYPE (t) = value_type;
7342 TYPE_ARG_TYPES (t) = arg_types;
7344 /* If we already have such a type, use the old one. */
7345 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7346 hashcode = type_hash_list (arg_types, hashcode);
7347 t = type_hash_canon (hashcode, t);
7349 /* Set up the canonical type. */
7350 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7351 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7352 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7354 &any_noncanonical_p);
7355 if (any_structural_p)
7356 SET_TYPE_STRUCTURAL_EQUALITY (t);
7357 else if (any_noncanonical_p)
7358 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7361 if (!COMPLETE_TYPE_P (t))
7366 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7369 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7371 tree new_type = NULL;
7372 tree args, new_args = NULL, t;
7376 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7377 args = TREE_CHAIN (args), i++)
7378 if (!bitmap_bit_p (args_to_skip, i))
7379 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7381 new_reversed = nreverse (new_args);
7385 TREE_CHAIN (new_args) = void_list_node;
7387 new_reversed = void_list_node;
7390 /* Use copy_node to preserve as much as possible from original type
7391 (debug info, attribute lists etc.)
7392 Exception is METHOD_TYPEs must have THIS argument.
7393 When we are asked to remove it, we need to build new FUNCTION_TYPE
7395 if (TREE_CODE (orig_type) != METHOD_TYPE
7396 || !bitmap_bit_p (args_to_skip, 0))
7398 new_type = build_distinct_type_copy (orig_type);
7399 TYPE_ARG_TYPES (new_type) = new_reversed;
7404 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7406 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7409 /* This is a new type, not a copy of an old type. Need to reassociate
7410 variants. We can handle everything except the main variant lazily. */
7411 t = TYPE_MAIN_VARIANT (orig_type);
7414 TYPE_MAIN_VARIANT (new_type) = t;
7415 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7416 TYPE_NEXT_VARIANT (t) = new_type;
7420 TYPE_MAIN_VARIANT (new_type) = new_type;
7421 TYPE_NEXT_VARIANT (new_type) = NULL;
7426 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7428 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7429 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7430 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7433 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7435 tree new_decl = copy_node (orig_decl);
7438 new_type = TREE_TYPE (orig_decl);
7439 if (prototype_p (new_type))
7440 new_type = build_function_type_skip_args (new_type, args_to_skip);
7441 TREE_TYPE (new_decl) = new_type;
7443 /* For declarations setting DECL_VINDEX (i.e. methods)
7444 we expect first argument to be THIS pointer. */
7445 if (bitmap_bit_p (args_to_skip, 0))
7446 DECL_VINDEX (new_decl) = NULL_TREE;
7448 /* When signature changes, we need to clear builtin info. */
7449 if (DECL_BUILT_IN (new_decl) && !bitmap_empty_p (args_to_skip))
7451 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7452 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7457 /* Build a function type. The RETURN_TYPE is the type returned by the
7458 function. If VAARGS is set, no void_type_node is appended to the
7459 the list. ARGP must be always be terminated be a NULL_TREE. */
7462 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7466 t = va_arg (argp, tree);
7467 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7468 args = tree_cons (NULL_TREE, t, args);
7473 if (args != NULL_TREE)
7474 args = nreverse (args);
7475 gcc_assert (last != void_list_node);
7477 else if (args == NULL_TREE)
7478 args = void_list_node;
7482 args = nreverse (args);
7483 TREE_CHAIN (last) = void_list_node;
7485 args = build_function_type (return_type, args);
7490 /* Build a function type. The RETURN_TYPE is the type returned by the
7491 function. If additional arguments are provided, they are
7492 additional argument types. The list of argument types must always
7493 be terminated by NULL_TREE. */
7496 build_function_type_list (tree return_type, ...)
7501 va_start (p, return_type);
7502 args = build_function_type_list_1 (false, return_type, p);
7507 /* Build a variable argument function type. The RETURN_TYPE is the
7508 type returned by the function. If additional arguments are provided,
7509 they are additional argument types. The list of argument types must
7510 always be terminated by NULL_TREE. */
7513 build_varargs_function_type_list (tree return_type, ...)
7518 va_start (p, return_type);
7519 args = build_function_type_list_1 (true, return_type, p);
7525 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7526 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7527 for the method. An implicit additional parameter (of type
7528 pointer-to-BASETYPE) is added to the ARGTYPES. */
7531 build_method_type_directly (tree basetype,
7538 bool any_structural_p, any_noncanonical_p;
7539 tree canon_argtypes;
7541 /* Make a node of the sort we want. */
7542 t = make_node (METHOD_TYPE);
7544 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7545 TREE_TYPE (t) = rettype;
7546 ptype = build_pointer_type (basetype);
7548 /* The actual arglist for this function includes a "hidden" argument
7549 which is "this". Put it into the list of argument types. */
7550 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7551 TYPE_ARG_TYPES (t) = argtypes;
7553 /* If we already have such a type, use the old one. */
7554 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7555 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7556 hashcode = type_hash_list (argtypes, hashcode);
7557 t = type_hash_canon (hashcode, t);
7559 /* Set up the canonical type. */
7561 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7562 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7564 = (TYPE_CANONICAL (basetype) != basetype
7565 || TYPE_CANONICAL (rettype) != rettype);
7566 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7568 &any_noncanonical_p);
7569 if (any_structural_p)
7570 SET_TYPE_STRUCTURAL_EQUALITY (t);
7571 else if (any_noncanonical_p)
7573 = build_method_type_directly (TYPE_CANONICAL (basetype),
7574 TYPE_CANONICAL (rettype),
7576 if (!COMPLETE_TYPE_P (t))
7582 /* Construct, lay out and return the type of methods belonging to class
7583 BASETYPE and whose arguments and values are described by TYPE.
7584 If that type exists already, reuse it.
7585 TYPE must be a FUNCTION_TYPE node. */
7588 build_method_type (tree basetype, tree type)
7590 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7592 return build_method_type_directly (basetype,
7594 TYPE_ARG_TYPES (type));
7597 /* Construct, lay out and return the type of offsets to a value
7598 of type TYPE, within an object of type BASETYPE.
7599 If a suitable offset type exists already, reuse it. */
7602 build_offset_type (tree basetype, tree type)
7605 hashval_t hashcode = 0;
7607 /* Make a node of the sort we want. */
7608 t = make_node (OFFSET_TYPE);
7610 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7611 TREE_TYPE (t) = type;
7613 /* If we already have such a type, use the old one. */
7614 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7615 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7616 t = type_hash_canon (hashcode, t);
7618 if (!COMPLETE_TYPE_P (t))
7621 if (TYPE_CANONICAL (t) == t)
7623 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7624 || TYPE_STRUCTURAL_EQUALITY_P (type))
7625 SET_TYPE_STRUCTURAL_EQUALITY (t);
7626 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7627 || TYPE_CANONICAL (type) != type)
7629 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7630 TYPE_CANONICAL (type));
7636 /* Create a complex type whose components are COMPONENT_TYPE. */
7639 build_complex_type (tree component_type)
7644 gcc_assert (INTEGRAL_TYPE_P (component_type)
7645 || SCALAR_FLOAT_TYPE_P (component_type)
7646 || FIXED_POINT_TYPE_P (component_type));
7648 /* Make a node of the sort we want. */
7649 t = make_node (COMPLEX_TYPE);
7651 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7653 /* If we already have such a type, use the old one. */
7654 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7655 t = type_hash_canon (hashcode, t);
7657 if (!COMPLETE_TYPE_P (t))
7660 if (TYPE_CANONICAL (t) == t)
7662 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7663 SET_TYPE_STRUCTURAL_EQUALITY (t);
7664 else if (TYPE_CANONICAL (component_type) != component_type)
7666 = build_complex_type (TYPE_CANONICAL (component_type));
7669 /* We need to create a name, since complex is a fundamental type. */
7670 if (! TYPE_NAME (t))
7673 if (component_type == char_type_node)
7674 name = "complex char";
7675 else if (component_type == signed_char_type_node)
7676 name = "complex signed char";
7677 else if (component_type == unsigned_char_type_node)
7678 name = "complex unsigned char";
7679 else if (component_type == short_integer_type_node)
7680 name = "complex short int";
7681 else if (component_type == short_unsigned_type_node)
7682 name = "complex short unsigned int";
7683 else if (component_type == integer_type_node)
7684 name = "complex int";
7685 else if (component_type == unsigned_type_node)
7686 name = "complex unsigned int";
7687 else if (component_type == long_integer_type_node)
7688 name = "complex long int";
7689 else if (component_type == long_unsigned_type_node)
7690 name = "complex long unsigned int";
7691 else if (component_type == long_long_integer_type_node)
7692 name = "complex long long int";
7693 else if (component_type == long_long_unsigned_type_node)
7694 name = "complex long long unsigned int";
7699 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7700 get_identifier (name), t);
7703 return build_qualified_type (t, TYPE_QUALS (component_type));
7706 /* If TYPE is a real or complex floating-point type and the target
7707 does not directly support arithmetic on TYPE then return the wider
7708 type to be used for arithmetic on TYPE. Otherwise, return
7712 excess_precision_type (tree type)
7714 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7716 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7717 switch (TREE_CODE (type))
7720 switch (flt_eval_method)
7723 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7724 return double_type_node;
7727 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7728 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7729 return long_double_type_node;
7736 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7738 switch (flt_eval_method)
7741 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7742 return complex_double_type_node;
7745 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7746 || (TYPE_MODE (TREE_TYPE (type))
7747 == TYPE_MODE (double_type_node)))
7748 return complex_long_double_type_node;
7761 /* Return OP, stripped of any conversions to wider types as much as is safe.
7762 Converting the value back to OP's type makes a value equivalent to OP.
7764 If FOR_TYPE is nonzero, we return a value which, if converted to
7765 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7767 OP must have integer, real or enumeral type. Pointers are not allowed!
7769 There are some cases where the obvious value we could return
7770 would regenerate to OP if converted to OP's type,
7771 but would not extend like OP to wider types.
7772 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7773 For example, if OP is (unsigned short)(signed char)-1,
7774 we avoid returning (signed char)-1 if FOR_TYPE is int,
7775 even though extending that to an unsigned short would regenerate OP,
7776 since the result of extending (signed char)-1 to (int)
7777 is different from (int) OP. */
7780 get_unwidened (tree op, tree for_type)
7782 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7783 tree type = TREE_TYPE (op);
7785 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7787 = (for_type != 0 && for_type != type
7788 && final_prec > TYPE_PRECISION (type)
7789 && TYPE_UNSIGNED (type));
7792 while (CONVERT_EXPR_P (op))
7796 /* TYPE_PRECISION on vector types has different meaning
7797 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7798 so avoid them here. */
7799 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7802 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7803 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7805 /* Truncations are many-one so cannot be removed.
7806 Unless we are later going to truncate down even farther. */
7808 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7811 /* See what's inside this conversion. If we decide to strip it,
7813 op = TREE_OPERAND (op, 0);
7815 /* If we have not stripped any zero-extensions (uns is 0),
7816 we can strip any kind of extension.
7817 If we have previously stripped a zero-extension,
7818 only zero-extensions can safely be stripped.
7819 Any extension can be stripped if the bits it would produce
7820 are all going to be discarded later by truncating to FOR_TYPE. */
7824 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7826 /* TYPE_UNSIGNED says whether this is a zero-extension.
7827 Let's avoid computing it if it does not affect WIN
7828 and if UNS will not be needed again. */
7830 || CONVERT_EXPR_P (op))
7831 && TYPE_UNSIGNED (TREE_TYPE (op)))
7839 /* If we finally reach a constant see if it fits in for_type and
7840 in that case convert it. */
7842 && TREE_CODE (win) == INTEGER_CST
7843 && TREE_TYPE (win) != for_type
7844 && int_fits_type_p (win, for_type))
7845 win = fold_convert (for_type, win);
7850 /* Return OP or a simpler expression for a narrower value
7851 which can be sign-extended or zero-extended to give back OP.
7852 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7853 or 0 if the value should be sign-extended. */
7856 get_narrower (tree op, int *unsignedp_ptr)
7861 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7863 while (TREE_CODE (op) == NOP_EXPR)
7866 = (TYPE_PRECISION (TREE_TYPE (op))
7867 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7869 /* Truncations are many-one so cannot be removed. */
7873 /* See what's inside this conversion. If we decide to strip it,
7878 op = TREE_OPERAND (op, 0);
7879 /* An extension: the outermost one can be stripped,
7880 but remember whether it is zero or sign extension. */
7882 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7883 /* Otherwise, if a sign extension has been stripped,
7884 only sign extensions can now be stripped;
7885 if a zero extension has been stripped, only zero-extensions. */
7886 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7890 else /* bitschange == 0 */
7892 /* A change in nominal type can always be stripped, but we must
7893 preserve the unsignedness. */
7895 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7897 op = TREE_OPERAND (op, 0);
7898 /* Keep trying to narrow, but don't assign op to win if it
7899 would turn an integral type into something else. */
7900 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7907 if (TREE_CODE (op) == COMPONENT_REF
7908 /* Since type_for_size always gives an integer type. */
7909 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7910 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7911 /* Ensure field is laid out already. */
7912 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7913 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7915 unsigned HOST_WIDE_INT innerprec
7916 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7917 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7918 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7919 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7921 /* We can get this structure field in a narrower type that fits it,
7922 but the resulting extension to its nominal type (a fullword type)
7923 must satisfy the same conditions as for other extensions.
7925 Do this only for fields that are aligned (not bit-fields),
7926 because when bit-field insns will be used there is no
7927 advantage in doing this. */
7929 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7930 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7931 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7935 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7936 win = fold_convert (type, op);
7940 *unsignedp_ptr = uns;
7944 /* Returns true if integer constant C has a value that is permissible
7945 for type TYPE (an INTEGER_TYPE). */
7948 int_fits_type_p (const_tree c, const_tree type)
7950 tree type_low_bound, type_high_bound;
7951 bool ok_for_low_bound, ok_for_high_bound, unsc;
7954 dc = tree_to_double_int (c);
7955 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7957 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7958 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7960 /* So c is an unsigned integer whose type is sizetype and type is not.
7961 sizetype'd integers are sign extended even though they are
7962 unsigned. If the integer value fits in the lower end word of c,
7963 and if the higher end word has all its bits set to 1, that
7964 means the higher end bits are set to 1 only for sign extension.
7965 So let's convert c into an equivalent zero extended unsigned
7967 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7970 type_low_bound = TYPE_MIN_VALUE (type);
7971 type_high_bound = TYPE_MAX_VALUE (type);
7973 /* If at least one bound of the type is a constant integer, we can check
7974 ourselves and maybe make a decision. If no such decision is possible, but
7975 this type is a subtype, try checking against that. Otherwise, use
7976 double_int_fits_to_tree_p, which checks against the precision.
7978 Compute the status for each possibly constant bound, and return if we see
7979 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7980 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7981 for "constant known to fit". */
7983 /* Check if c >= type_low_bound. */
7984 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7986 dd = tree_to_double_int (type_low_bound);
7987 if (TREE_CODE (type) == INTEGER_TYPE
7988 && TYPE_IS_SIZETYPE (type)
7989 && TYPE_UNSIGNED (type))
7990 dd = double_int_zext (dd, TYPE_PRECISION (type));
7991 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7993 int c_neg = (!unsc && double_int_negative_p (dc));
7994 int t_neg = (unsc && double_int_negative_p (dd));
7996 if (c_neg && !t_neg)
7998 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
8001 else if (double_int_cmp (dc, dd, unsc) < 0)
8003 ok_for_low_bound = true;
8006 ok_for_low_bound = false;
8008 /* Check if c <= type_high_bound. */
8009 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
8011 dd = tree_to_double_int (type_high_bound);
8012 if (TREE_CODE (type) == INTEGER_TYPE
8013 && TYPE_IS_SIZETYPE (type)
8014 && TYPE_UNSIGNED (type))
8015 dd = double_int_zext (dd, TYPE_PRECISION (type));
8016 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
8018 int c_neg = (!unsc && double_int_negative_p (dc));
8019 int t_neg = (unsc && double_int_negative_p (dd));
8021 if (t_neg && !c_neg)
8023 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
8026 else if (double_int_cmp (dc, dd, unsc) > 0)
8028 ok_for_high_bound = true;
8031 ok_for_high_bound = false;
8033 /* If the constant fits both bounds, the result is known. */
8034 if (ok_for_low_bound && ok_for_high_bound)
8037 /* Perform some generic filtering which may allow making a decision
8038 even if the bounds are not constant. First, negative integers
8039 never fit in unsigned types, */
8040 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8043 /* Second, narrower types always fit in wider ones. */
8044 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8047 /* Third, unsigned integers with top bit set never fit signed types. */
8048 if (! TYPE_UNSIGNED (type) && unsc)
8050 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8051 if (prec < HOST_BITS_PER_WIDE_INT)
8053 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8056 else if (((((unsigned HOST_WIDE_INT) 1)
8057 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8061 /* If we haven't been able to decide at this point, there nothing more we
8062 can check ourselves here. Look at the base type if we have one and it
8063 has the same precision. */
8064 if (TREE_CODE (type) == INTEGER_TYPE
8065 && TREE_TYPE (type) != 0
8066 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8068 type = TREE_TYPE (type);
8072 /* Or to double_int_fits_to_tree_p, if nothing else. */
8073 return double_int_fits_to_tree_p (type, dc);
8076 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8077 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8078 represented (assuming two's-complement arithmetic) within the bit
8079 precision of the type are returned instead. */
8082 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8084 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8085 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8086 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8087 TYPE_UNSIGNED (type));
8090 if (TYPE_UNSIGNED (type))
8091 mpz_set_ui (min, 0);
8095 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8096 mn = double_int_sext (double_int_add (mn, double_int_one),
8097 TYPE_PRECISION (type));
8098 mpz_set_double_int (min, mn, false);
8102 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8103 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8104 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8105 TYPE_UNSIGNED (type));
8108 if (TYPE_UNSIGNED (type))
8109 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8112 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8117 /* Return true if VAR is an automatic variable defined in function FN. */
8120 auto_var_in_fn_p (const_tree var, const_tree fn)
8122 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8123 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8124 || TREE_CODE (var) == PARM_DECL)
8125 && ! TREE_STATIC (var))
8126 || TREE_CODE (var) == LABEL_DECL
8127 || TREE_CODE (var) == RESULT_DECL));
8130 /* Subprogram of following function. Called by walk_tree.
8132 Return *TP if it is an automatic variable or parameter of the
8133 function passed in as DATA. */
8136 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8138 tree fn = (tree) data;
8143 else if (DECL_P (*tp)
8144 && auto_var_in_fn_p (*tp, fn))
8150 /* Returns true if T is, contains, or refers to a type with variable
8151 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8152 arguments, but not the return type. If FN is nonzero, only return
8153 true if a modifier of the type or position of FN is a variable or
8154 parameter inside FN.
8156 This concept is more general than that of C99 'variably modified types':
8157 in C99, a struct type is never variably modified because a VLA may not
8158 appear as a structure member. However, in GNU C code like:
8160 struct S { int i[f()]; };
8162 is valid, and other languages may define similar constructs. */
8165 variably_modified_type_p (tree type, tree fn)
8169 /* Test if T is either variable (if FN is zero) or an expression containing
8170 a variable in FN. */
8171 #define RETURN_TRUE_IF_VAR(T) \
8172 do { tree _t = (T); \
8173 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8174 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8175 return true; } while (0)
8177 if (type == error_mark_node)
8180 /* If TYPE itself has variable size, it is variably modified. */
8181 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8182 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8184 switch (TREE_CODE (type))
8187 case REFERENCE_TYPE:
8189 if (variably_modified_type_p (TREE_TYPE (type), fn))
8195 /* If TYPE is a function type, it is variably modified if the
8196 return type is variably modified. */
8197 if (variably_modified_type_p (TREE_TYPE (type), fn))
8203 case FIXED_POINT_TYPE:
8206 /* Scalar types are variably modified if their end points
8208 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8209 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8214 case QUAL_UNION_TYPE:
8215 /* We can't see if any of the fields are variably-modified by the
8216 definition we normally use, since that would produce infinite
8217 recursion via pointers. */
8218 /* This is variably modified if some field's type is. */
8219 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8220 if (TREE_CODE (t) == FIELD_DECL)
8222 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8223 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8224 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8226 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8227 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8232 /* Do not call ourselves to avoid infinite recursion. This is
8233 variably modified if the element type is. */
8234 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8235 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8242 /* The current language may have other cases to check, but in general,
8243 all other types are not variably modified. */
8244 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8246 #undef RETURN_TRUE_IF_VAR
8249 /* Given a DECL or TYPE, return the scope in which it was declared, or
8250 NULL_TREE if there is no containing scope. */
8253 get_containing_scope (const_tree t)
8255 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8258 /* Return the innermost context enclosing DECL that is
8259 a FUNCTION_DECL, or zero if none. */
8262 decl_function_context (const_tree decl)
8266 if (TREE_CODE (decl) == ERROR_MARK)
8269 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8270 where we look up the function at runtime. Such functions always take
8271 a first argument of type 'pointer to real context'.
8273 C++ should really be fixed to use DECL_CONTEXT for the real context,
8274 and use something else for the "virtual context". */
8275 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8278 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8280 context = DECL_CONTEXT (decl);
8282 while (context && TREE_CODE (context) != FUNCTION_DECL)
8284 if (TREE_CODE (context) == BLOCK)
8285 context = BLOCK_SUPERCONTEXT (context);
8287 context = get_containing_scope (context);
8293 /* Return the innermost context enclosing DECL that is
8294 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8295 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8298 decl_type_context (const_tree decl)
8300 tree context = DECL_CONTEXT (decl);
8303 switch (TREE_CODE (context))
8305 case NAMESPACE_DECL:
8306 case TRANSLATION_UNIT_DECL:
8311 case QUAL_UNION_TYPE:
8316 context = DECL_CONTEXT (context);
8320 context = BLOCK_SUPERCONTEXT (context);
8330 /* CALL is a CALL_EXPR. Return the declaration for the function
8331 called, or NULL_TREE if the called function cannot be
8335 get_callee_fndecl (const_tree call)
8339 if (call == error_mark_node)
8340 return error_mark_node;
8342 /* It's invalid to call this function with anything but a
8344 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8346 /* The first operand to the CALL is the address of the function
8348 addr = CALL_EXPR_FN (call);
8352 /* If this is a readonly function pointer, extract its initial value. */
8353 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8354 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8355 && DECL_INITIAL (addr))
8356 addr = DECL_INITIAL (addr);
8358 /* If the address is just `&f' for some function `f', then we know
8359 that `f' is being called. */
8360 if (TREE_CODE (addr) == ADDR_EXPR
8361 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8362 return TREE_OPERAND (addr, 0);
8364 /* We couldn't figure out what was being called. */
8368 /* Print debugging information about tree nodes generated during the compile,
8369 and any language-specific information. */
8372 dump_tree_statistics (void)
8374 #ifdef GATHER_STATISTICS
8376 int total_nodes, total_bytes;
8379 fprintf (stderr, "\n??? tree nodes created\n\n");
8380 #ifdef GATHER_STATISTICS
8381 fprintf (stderr, "Kind Nodes Bytes\n");
8382 fprintf (stderr, "---------------------------------------\n");
8383 total_nodes = total_bytes = 0;
8384 for (i = 0; i < (int) all_kinds; i++)
8386 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8387 tree_node_counts[i], tree_node_sizes[i]);
8388 total_nodes += tree_node_counts[i];
8389 total_bytes += tree_node_sizes[i];
8391 fprintf (stderr, "---------------------------------------\n");
8392 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8393 fprintf (stderr, "---------------------------------------\n");
8394 ssanames_print_statistics ();
8395 phinodes_print_statistics ();
8397 fprintf (stderr, "(No per-node statistics)\n");
8399 print_type_hash_statistics ();
8400 print_debug_expr_statistics ();
8401 print_value_expr_statistics ();
8402 lang_hooks.print_statistics ();
8405 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8407 /* Generate a crc32 of a string. */
8410 crc32_string (unsigned chksum, const char *string)
8414 unsigned value = *string << 24;
8417 for (ix = 8; ix--; value <<= 1)
8421 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8430 /* P is a string that will be used in a symbol. Mask out any characters
8431 that are not valid in that context. */
8434 clean_symbol_name (char *p)
8438 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8441 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8448 /* Generate a name for a special-purpose function function.
8449 The generated name may need to be unique across the whole link.
8450 TYPE is some string to identify the purpose of this function to the
8451 linker or collect2; it must start with an uppercase letter,
8453 I - for constructors
8455 N - for C++ anonymous namespaces
8456 F - for DWARF unwind frame information. */
8459 get_file_function_name (const char *type)
8465 /* If we already have a name we know to be unique, just use that. */
8466 if (first_global_object_name)
8467 p = q = ASTRDUP (first_global_object_name);
8468 /* If the target is handling the constructors/destructors, they
8469 will be local to this file and the name is only necessary for
8470 debugging purposes. */
8471 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8473 const char *file = main_input_filename;
8475 file = input_filename;
8476 /* Just use the file's basename, because the full pathname
8477 might be quite long. */
8478 p = strrchr (file, '/');
8483 p = q = ASTRDUP (p);
8487 /* Otherwise, the name must be unique across the entire link.
8488 We don't have anything that we know to be unique to this translation
8489 unit, so use what we do have and throw in some randomness. */
8491 const char *name = weak_global_object_name;
8492 const char *file = main_input_filename;
8497 file = input_filename;
8499 len = strlen (file);
8500 q = (char *) alloca (9 * 2 + len + 1);
8501 memcpy (q, file, len + 1);
8503 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8504 crc32_string (0, get_random_seed (false)));
8509 clean_symbol_name (q);
8510 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8513 /* Set up the name of the file-level functions we may need.
8514 Use a global object (which is already required to be unique over
8515 the program) rather than the file name (which imposes extra
8517 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8519 return get_identifier (buf);
8522 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8524 /* Complain that the tree code of NODE does not match the expected 0
8525 terminated list of trailing codes. The trailing code list can be
8526 empty, for a more vague error message. FILE, LINE, and FUNCTION
8527 are of the caller. */
8530 tree_check_failed (const_tree node, const char *file,
8531 int line, const char *function, ...)
8535 unsigned length = 0;
8538 va_start (args, function);
8539 while ((code = va_arg (args, int)))
8540 length += 4 + strlen (tree_code_name[code]);
8545 va_start (args, function);
8546 length += strlen ("expected ");
8547 buffer = tmp = (char *) alloca (length);
8549 while ((code = va_arg (args, int)))
8551 const char *prefix = length ? " or " : "expected ";
8553 strcpy (tmp + length, prefix);
8554 length += strlen (prefix);
8555 strcpy (tmp + length, tree_code_name[code]);
8556 length += strlen (tree_code_name[code]);
8561 buffer = "unexpected node";
8563 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8564 buffer, tree_code_name[TREE_CODE (node)],
8565 function, trim_filename (file), line);
8568 /* Complain that the tree code of NODE does match the expected 0
8569 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8573 tree_not_check_failed (const_tree node, const char *file,
8574 int line, const char *function, ...)
8578 unsigned length = 0;
8581 va_start (args, function);
8582 while ((code = va_arg (args, int)))
8583 length += 4 + strlen (tree_code_name[code]);
8585 va_start (args, function);
8586 buffer = (char *) alloca (length);
8588 while ((code = va_arg (args, int)))
8592 strcpy (buffer + length, " or ");
8595 strcpy (buffer + length, tree_code_name[code]);
8596 length += strlen (tree_code_name[code]);
8600 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8601 buffer, tree_code_name[TREE_CODE (node)],
8602 function, trim_filename (file), line);
8605 /* Similar to tree_check_failed, except that we check for a class of tree
8606 code, given in CL. */
8609 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8610 const char *file, int line, const char *function)
8613 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8614 TREE_CODE_CLASS_STRING (cl),
8615 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8616 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8619 /* Similar to tree_check_failed, except that instead of specifying a
8620 dozen codes, use the knowledge that they're all sequential. */
8623 tree_range_check_failed (const_tree node, const char *file, int line,
8624 const char *function, enum tree_code c1,
8628 unsigned length = 0;
8631 for (c = c1; c <= c2; ++c)
8632 length += 4 + strlen (tree_code_name[c]);
8634 length += strlen ("expected ");
8635 buffer = (char *) alloca (length);
8638 for (c = c1; c <= c2; ++c)
8640 const char *prefix = length ? " or " : "expected ";
8642 strcpy (buffer + length, prefix);
8643 length += strlen (prefix);
8644 strcpy (buffer + length, tree_code_name[c]);
8645 length += strlen (tree_code_name[c]);
8648 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8649 buffer, tree_code_name[TREE_CODE (node)],
8650 function, trim_filename (file), line);
8654 /* Similar to tree_check_failed, except that we check that a tree does
8655 not have the specified code, given in CL. */
8658 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8659 const char *file, int line, const char *function)
8662 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8663 TREE_CODE_CLASS_STRING (cl),
8664 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8665 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8669 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8672 omp_clause_check_failed (const_tree node, const char *file, int line,
8673 const char *function, enum omp_clause_code code)
8675 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8676 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8677 function, trim_filename (file), line);
8681 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8684 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8685 const char *function, enum omp_clause_code c1,
8686 enum omp_clause_code c2)
8689 unsigned length = 0;
8692 for (c = c1; c <= c2; ++c)
8693 length += 4 + strlen (omp_clause_code_name[c]);
8695 length += strlen ("expected ");
8696 buffer = (char *) alloca (length);
8699 for (c = c1; c <= c2; ++c)
8701 const char *prefix = length ? " or " : "expected ";
8703 strcpy (buffer + length, prefix);
8704 length += strlen (prefix);
8705 strcpy (buffer + length, omp_clause_code_name[c]);
8706 length += strlen (omp_clause_code_name[c]);
8709 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8710 buffer, omp_clause_code_name[TREE_CODE (node)],
8711 function, trim_filename (file), line);
8715 #undef DEFTREESTRUCT
8716 #define DEFTREESTRUCT(VAL, NAME) NAME,
8718 static const char *ts_enum_names[] = {
8719 #include "treestruct.def"
8721 #undef DEFTREESTRUCT
8723 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8725 /* Similar to tree_class_check_failed, except that we check for
8726 whether CODE contains the tree structure identified by EN. */
8729 tree_contains_struct_check_failed (const_tree node,
8730 const enum tree_node_structure_enum en,
8731 const char *file, int line,
8732 const char *function)
8735 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8737 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8741 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8742 (dynamically sized) vector. */
8745 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8746 const char *function)
8749 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8750 idx + 1, len, function, trim_filename (file), line);
8753 /* Similar to above, except that the check is for the bounds of the operand
8754 vector of an expression node EXP. */
8757 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8758 int line, const char *function)
8760 int code = TREE_CODE (exp);
8762 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8763 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8764 function, trim_filename (file), line);
8767 /* Similar to above, except that the check is for the number of
8768 operands of an OMP_CLAUSE node. */
8771 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8772 int line, const char *function)
8775 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8776 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8777 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8778 trim_filename (file), line);
8780 #endif /* ENABLE_TREE_CHECKING */
8782 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8783 and mapped to the machine mode MODE. Initialize its fields and build
8784 the information necessary for debugging output. */
8787 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8790 hashval_t hashcode = 0;
8792 t = make_node (VECTOR_TYPE);
8793 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8794 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8795 SET_TYPE_MODE (t, mode);
8797 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8798 SET_TYPE_STRUCTURAL_EQUALITY (t);
8799 else if (TYPE_CANONICAL (innertype) != innertype
8800 || mode != VOIDmode)
8802 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8806 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8807 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8808 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8809 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8810 t = type_hash_canon (hashcode, t);
8812 /* We have built a main variant, based on the main variant of the
8813 inner type. Use it to build the variant we return. */
8814 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8815 && TREE_TYPE (t) != innertype)
8816 return build_type_attribute_qual_variant (t,
8817 TYPE_ATTRIBUTES (innertype),
8818 TYPE_QUALS (innertype));
8824 make_or_reuse_type (unsigned size, int unsignedp)
8826 if (size == INT_TYPE_SIZE)
8827 return unsignedp ? unsigned_type_node : integer_type_node;
8828 if (size == CHAR_TYPE_SIZE)
8829 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8830 if (size == SHORT_TYPE_SIZE)
8831 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8832 if (size == LONG_TYPE_SIZE)
8833 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8834 if (size == LONG_LONG_TYPE_SIZE)
8835 return (unsignedp ? long_long_unsigned_type_node
8836 : long_long_integer_type_node);
8837 if (size == 128 && int128_integer_type_node)
8838 return (unsignedp ? int128_unsigned_type_node
8839 : int128_integer_type_node);
8842 return make_unsigned_type (size);
8844 return make_signed_type (size);
8847 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8850 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8854 if (size == SHORT_FRACT_TYPE_SIZE)
8855 return unsignedp ? sat_unsigned_short_fract_type_node
8856 : sat_short_fract_type_node;
8857 if (size == FRACT_TYPE_SIZE)
8858 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8859 if (size == LONG_FRACT_TYPE_SIZE)
8860 return unsignedp ? sat_unsigned_long_fract_type_node
8861 : sat_long_fract_type_node;
8862 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8863 return unsignedp ? sat_unsigned_long_long_fract_type_node
8864 : sat_long_long_fract_type_node;
8868 if (size == SHORT_FRACT_TYPE_SIZE)
8869 return unsignedp ? unsigned_short_fract_type_node
8870 : short_fract_type_node;
8871 if (size == FRACT_TYPE_SIZE)
8872 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8873 if (size == LONG_FRACT_TYPE_SIZE)
8874 return unsignedp ? unsigned_long_fract_type_node
8875 : long_fract_type_node;
8876 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8877 return unsignedp ? unsigned_long_long_fract_type_node
8878 : long_long_fract_type_node;
8881 return make_fract_type (size, unsignedp, satp);
8884 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8887 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8891 if (size == SHORT_ACCUM_TYPE_SIZE)
8892 return unsignedp ? sat_unsigned_short_accum_type_node
8893 : sat_short_accum_type_node;
8894 if (size == ACCUM_TYPE_SIZE)
8895 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8896 if (size == LONG_ACCUM_TYPE_SIZE)
8897 return unsignedp ? sat_unsigned_long_accum_type_node
8898 : sat_long_accum_type_node;
8899 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8900 return unsignedp ? sat_unsigned_long_long_accum_type_node
8901 : sat_long_long_accum_type_node;
8905 if (size == SHORT_ACCUM_TYPE_SIZE)
8906 return unsignedp ? unsigned_short_accum_type_node
8907 : short_accum_type_node;
8908 if (size == ACCUM_TYPE_SIZE)
8909 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8910 if (size == LONG_ACCUM_TYPE_SIZE)
8911 return unsignedp ? unsigned_long_accum_type_node
8912 : long_accum_type_node;
8913 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8914 return unsignedp ? unsigned_long_long_accum_type_node
8915 : long_long_accum_type_node;
8918 return make_accum_type (size, unsignedp, satp);
8921 /* Create nodes for all integer types (and error_mark_node) using the sizes
8922 of C datatypes. The caller should call set_sizetype soon after calling
8923 this function to select one of the types as sizetype. */
8926 build_common_tree_nodes (bool signed_char)
8928 error_mark_node = make_node (ERROR_MARK);
8929 TREE_TYPE (error_mark_node) = error_mark_node;
8931 initialize_sizetypes ();
8933 /* Define both `signed char' and `unsigned char'. */
8934 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8935 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8936 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8937 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8939 /* Define `char', which is like either `signed char' or `unsigned char'
8940 but not the same as either. */
8943 ? make_signed_type (CHAR_TYPE_SIZE)
8944 : make_unsigned_type (CHAR_TYPE_SIZE));
8945 TYPE_STRING_FLAG (char_type_node) = 1;
8947 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8948 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8949 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8950 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8951 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8952 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8953 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8954 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8955 #if HOST_BITS_PER_WIDE_INT >= 64
8956 /* TODO: This isn't correct, but as logic depends at the moment on
8957 host's instead of target's wide-integer.
8958 If there is a target not supporting TImode, but has an 128-bit
8959 integer-scalar register, this target check needs to be adjusted. */
8960 if (targetm.scalar_mode_supported_p (TImode))
8962 int128_integer_type_node = make_signed_type (128);
8963 int128_unsigned_type_node = make_unsigned_type (128);
8966 /* Define a boolean type. This type only represents boolean values but
8967 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8968 Front ends which want to override this size (i.e. Java) can redefine
8969 boolean_type_node before calling build_common_tree_nodes_2. */
8970 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8971 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8972 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8973 TYPE_PRECISION (boolean_type_node) = 1;
8975 /* Fill in the rest of the sized types. Reuse existing type nodes
8977 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8978 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8979 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8980 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8981 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8983 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8984 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8985 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8986 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8987 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8989 access_public_node = get_identifier ("public");
8990 access_protected_node = get_identifier ("protected");
8991 access_private_node = get_identifier ("private");
8994 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8995 It will create several other common tree nodes. */
8998 build_common_tree_nodes_2 (int short_double)
9000 /* Define these next since types below may used them. */
9001 integer_zero_node = build_int_cst (integer_type_node, 0);
9002 integer_one_node = build_int_cst (integer_type_node, 1);
9003 integer_three_node = build_int_cst (integer_type_node, 3);
9004 integer_minus_one_node = build_int_cst (integer_type_node, -1);
9006 size_zero_node = size_int (0);
9007 size_one_node = size_int (1);
9008 bitsize_zero_node = bitsize_int (0);
9009 bitsize_one_node = bitsize_int (1);
9010 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
9012 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
9013 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9015 void_type_node = make_node (VOID_TYPE);
9016 layout_type (void_type_node);
9018 /* We are not going to have real types in C with less than byte alignment,
9019 so we might as well not have any types that claim to have it. */
9020 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9021 TYPE_USER_ALIGN (void_type_node) = 0;
9023 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9024 layout_type (TREE_TYPE (null_pointer_node));
9026 ptr_type_node = build_pointer_type (void_type_node);
9028 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9029 fileptr_type_node = ptr_type_node;
9031 float_type_node = make_node (REAL_TYPE);
9032 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9033 layout_type (float_type_node);
9035 double_type_node = make_node (REAL_TYPE);
9037 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9039 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9040 layout_type (double_type_node);
9042 long_double_type_node = make_node (REAL_TYPE);
9043 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9044 layout_type (long_double_type_node);
9046 float_ptr_type_node = build_pointer_type (float_type_node);
9047 double_ptr_type_node = build_pointer_type (double_type_node);
9048 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9049 integer_ptr_type_node = build_pointer_type (integer_type_node);
9051 /* Fixed size integer types. */
9052 uint32_type_node = build_nonstandard_integer_type (32, true);
9053 uint64_type_node = build_nonstandard_integer_type (64, true);
9055 /* Decimal float types. */
9056 dfloat32_type_node = make_node (REAL_TYPE);
9057 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9058 layout_type (dfloat32_type_node);
9059 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9060 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9062 dfloat64_type_node = make_node (REAL_TYPE);
9063 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9064 layout_type (dfloat64_type_node);
9065 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9066 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9068 dfloat128_type_node = make_node (REAL_TYPE);
9069 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9070 layout_type (dfloat128_type_node);
9071 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9072 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9074 complex_integer_type_node = build_complex_type (integer_type_node);
9075 complex_float_type_node = build_complex_type (float_type_node);
9076 complex_double_type_node = build_complex_type (double_type_node);
9077 complex_long_double_type_node = build_complex_type (long_double_type_node);
9079 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9080 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9081 sat_ ## KIND ## _type_node = \
9082 make_sat_signed_ ## KIND ## _type (SIZE); \
9083 sat_unsigned_ ## KIND ## _type_node = \
9084 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9085 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9086 unsigned_ ## KIND ## _type_node = \
9087 make_unsigned_ ## KIND ## _type (SIZE);
9089 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9090 sat_ ## WIDTH ## KIND ## _type_node = \
9091 make_sat_signed_ ## KIND ## _type (SIZE); \
9092 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9093 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9094 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9095 unsigned_ ## WIDTH ## KIND ## _type_node = \
9096 make_unsigned_ ## KIND ## _type (SIZE);
9098 /* Make fixed-point type nodes based on four different widths. */
9099 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9100 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9101 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9102 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9103 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9105 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9106 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9107 NAME ## _type_node = \
9108 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9109 u ## NAME ## _type_node = \
9110 make_or_reuse_unsigned_ ## KIND ## _type \
9111 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9112 sat_ ## NAME ## _type_node = \
9113 make_or_reuse_sat_signed_ ## KIND ## _type \
9114 (GET_MODE_BITSIZE (MODE ## mode)); \
9115 sat_u ## NAME ## _type_node = \
9116 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9117 (GET_MODE_BITSIZE (U ## MODE ## mode));
9119 /* Fixed-point type and mode nodes. */
9120 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9121 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9122 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9123 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9124 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9125 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9126 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9127 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9128 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9129 MAKE_FIXED_MODE_NODE (accum, da, DA)
9130 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9133 tree t = targetm.build_builtin_va_list ();
9135 /* Many back-ends define record types without setting TYPE_NAME.
9136 If we copied the record type here, we'd keep the original
9137 record type without a name. This breaks name mangling. So,
9138 don't copy record types and let c_common_nodes_and_builtins()
9139 declare the type to be __builtin_va_list. */
9140 if (TREE_CODE (t) != RECORD_TYPE)
9141 t = build_variant_type_copy (t);
9143 va_list_type_node = t;
9147 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9150 local_define_builtin (const char *name, tree type, enum built_in_function code,
9151 const char *library_name, int ecf_flags)
9155 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9156 library_name, NULL_TREE);
9157 if (ecf_flags & ECF_CONST)
9158 TREE_READONLY (decl) = 1;
9159 if (ecf_flags & ECF_PURE)
9160 DECL_PURE_P (decl) = 1;
9161 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9162 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9163 if (ecf_flags & ECF_NORETURN)
9164 TREE_THIS_VOLATILE (decl) = 1;
9165 if (ecf_flags & ECF_NOTHROW)
9166 TREE_NOTHROW (decl) = 1;
9167 if (ecf_flags & ECF_MALLOC)
9168 DECL_IS_MALLOC (decl) = 1;
9169 if (ecf_flags & ECF_LEAF)
9170 DECL_ATTRIBUTES (decl) = tree_cons (get_identifier ("leaf"),
9171 NULL, DECL_ATTRIBUTES (decl));
9173 built_in_decls[code] = decl;
9174 implicit_built_in_decls[code] = decl;
9177 /* Call this function after instantiating all builtins that the language
9178 front end cares about. This will build the rest of the builtins that
9179 are relied upon by the tree optimizers and the middle-end. */
9182 build_common_builtin_nodes (void)
9186 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9187 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9189 ftype = build_function_type_list (ptr_type_node,
9190 ptr_type_node, const_ptr_type_node,
9191 size_type_node, NULL_TREE);
9193 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9194 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9195 "memcpy", ECF_NOTHROW | ECF_LEAF);
9196 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9197 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9198 "memmove", ECF_NOTHROW | ECF_LEAF);
9201 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9203 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9204 const_ptr_type_node, size_type_node,
9206 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9207 "memcmp", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9210 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9212 ftype = build_function_type_list (ptr_type_node,
9213 ptr_type_node, integer_type_node,
9214 size_type_node, NULL_TREE);
9215 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9216 "memset", ECF_NOTHROW | ECF_LEAF);
9219 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9221 ftype = build_function_type_list (ptr_type_node,
9222 size_type_node, NULL_TREE);
9223 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9224 "alloca", ECF_MALLOC | ECF_NOTHROW | ECF_LEAF);
9227 /* If we're checking the stack, `alloca' can throw. */
9228 if (flag_stack_check)
9229 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9231 ftype = build_function_type_list (void_type_node,
9232 ptr_type_node, ptr_type_node,
9233 ptr_type_node, NULL_TREE);
9234 local_define_builtin ("__builtin_init_trampoline", ftype,
9235 BUILT_IN_INIT_TRAMPOLINE,
9236 "__builtin_init_trampoline", ECF_NOTHROW | ECF_LEAF);
9238 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9239 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9240 BUILT_IN_ADJUST_TRAMPOLINE,
9241 "__builtin_adjust_trampoline",
9242 ECF_CONST | ECF_NOTHROW);
9244 ftype = build_function_type_list (void_type_node,
9245 ptr_type_node, ptr_type_node, NULL_TREE);
9246 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9247 BUILT_IN_NONLOCAL_GOTO,
9248 "__builtin_nonlocal_goto",
9249 ECF_NORETURN | ECF_NOTHROW);
9251 ftype = build_function_type_list (void_type_node,
9252 ptr_type_node, ptr_type_node, NULL_TREE);
9253 local_define_builtin ("__builtin_setjmp_setup", ftype,
9254 BUILT_IN_SETJMP_SETUP,
9255 "__builtin_setjmp_setup", ECF_NOTHROW);
9257 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9258 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9259 BUILT_IN_SETJMP_DISPATCHER,
9260 "__builtin_setjmp_dispatcher",
9261 ECF_PURE | ECF_NOTHROW);
9263 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9264 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9265 BUILT_IN_SETJMP_RECEIVER,
9266 "__builtin_setjmp_receiver", ECF_NOTHROW);
9268 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9269 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9270 "__builtin_stack_save", ECF_NOTHROW | ECF_LEAF);
9272 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9273 local_define_builtin ("__builtin_stack_restore", ftype,
9274 BUILT_IN_STACK_RESTORE,
9275 "__builtin_stack_restore", ECF_NOTHROW | ECF_LEAF);
9277 ftype = build_function_type_list (void_type_node, NULL_TREE);
9278 local_define_builtin ("__builtin_profile_func_enter", ftype,
9279 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9280 local_define_builtin ("__builtin_profile_func_exit", ftype,
9281 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9283 /* If there's a possibility that we might use the ARM EABI, build the
9284 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9285 if (targetm.arm_eabi_unwinder)
9287 ftype = build_function_type_list (void_type_node, NULL_TREE);
9288 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9289 BUILT_IN_CXA_END_CLEANUP,
9290 "__cxa_end_cleanup", ECF_NORETURN | ECF_LEAF);
9293 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9294 local_define_builtin ("__builtin_unwind_resume", ftype,
9295 BUILT_IN_UNWIND_RESUME,
9296 (targetm.except_unwind_info () == UI_SJLJ
9297 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9300 /* The exception object and filter values from the runtime. The argument
9301 must be zero before exception lowering, i.e. from the front end. After
9302 exception lowering, it will be the region number for the exception
9303 landing pad. These functions are PURE instead of CONST to prevent
9304 them from being hoisted past the exception edge that will initialize
9305 its value in the landing pad. */
9306 ftype = build_function_type_list (ptr_type_node,
9307 integer_type_node, NULL_TREE);
9308 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9309 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9311 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9312 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9313 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9314 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW | ECF_LEAF);
9316 ftype = build_function_type_list (void_type_node,
9317 integer_type_node, integer_type_node,
9319 local_define_builtin ("__builtin_eh_copy_values", ftype,
9320 BUILT_IN_EH_COPY_VALUES,
9321 "__builtin_eh_copy_values", ECF_NOTHROW);
9323 /* Complex multiplication and division. These are handled as builtins
9324 rather than optabs because emit_library_call_value doesn't support
9325 complex. Further, we can do slightly better with folding these
9326 beasties if the real and complex parts of the arguments are separate. */
9330 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9332 char mode_name_buf[4], *q;
9334 enum built_in_function mcode, dcode;
9335 tree type, inner_type;
9337 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9340 inner_type = TREE_TYPE (type);
9342 ftype = build_function_type_list (type, inner_type, inner_type,
9343 inner_type, inner_type, NULL_TREE);
9345 mcode = ((enum built_in_function)
9346 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9347 dcode = ((enum built_in_function)
9348 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9350 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9354 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9355 local_define_builtin (built_in_names[mcode], ftype, mcode,
9356 built_in_names[mcode], ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9358 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9359 local_define_builtin (built_in_names[dcode], ftype, dcode,
9360 built_in_names[dcode], ECF_CONST | ECF_NOTHROW | ECF_LEAF);
9365 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9368 If we requested a pointer to a vector, build up the pointers that
9369 we stripped off while looking for the inner type. Similarly for
9370 return values from functions.
9372 The argument TYPE is the top of the chain, and BOTTOM is the
9373 new type which we will point to. */
9376 reconstruct_complex_type (tree type, tree bottom)
9380 if (TREE_CODE (type) == POINTER_TYPE)
9382 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9383 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9384 TYPE_REF_CAN_ALIAS_ALL (type));
9386 else if (TREE_CODE (type) == REFERENCE_TYPE)
9388 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9389 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9390 TYPE_REF_CAN_ALIAS_ALL (type));
9392 else if (TREE_CODE (type) == ARRAY_TYPE)
9394 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9395 outer = build_array_type (inner, TYPE_DOMAIN (type));
9397 else if (TREE_CODE (type) == FUNCTION_TYPE)
9399 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9400 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9402 else if (TREE_CODE (type) == METHOD_TYPE)
9404 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9405 /* The build_method_type_directly() routine prepends 'this' to argument list,
9406 so we must compensate by getting rid of it. */
9408 = build_method_type_directly
9409 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9411 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9413 else if (TREE_CODE (type) == OFFSET_TYPE)
9415 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9416 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9421 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9425 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9428 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9432 switch (GET_MODE_CLASS (mode))
9434 case MODE_VECTOR_INT:
9435 case MODE_VECTOR_FLOAT:
9436 case MODE_VECTOR_FRACT:
9437 case MODE_VECTOR_UFRACT:
9438 case MODE_VECTOR_ACCUM:
9439 case MODE_VECTOR_UACCUM:
9440 nunits = GET_MODE_NUNITS (mode);
9444 /* Check that there are no leftover bits. */
9445 gcc_assert (GET_MODE_BITSIZE (mode)
9446 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9448 nunits = GET_MODE_BITSIZE (mode)
9449 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9456 return make_vector_type (innertype, nunits, mode);
9459 /* Similarly, but takes the inner type and number of units, which must be
9463 build_vector_type (tree innertype, int nunits)
9465 return make_vector_type (innertype, nunits, VOIDmode);
9468 /* Similarly, but takes the inner type and number of units, which must be
9472 build_opaque_vector_type (tree innertype, int nunits)
9475 innertype = build_distinct_type_copy (innertype);
9476 t = make_vector_type (innertype, nunits, VOIDmode);
9477 TYPE_VECTOR_OPAQUE (t) = true;
9482 /* Given an initializer INIT, return TRUE if INIT is zero or some
9483 aggregate of zeros. Otherwise return FALSE. */
9485 initializer_zerop (const_tree init)
9491 switch (TREE_CODE (init))
9494 return integer_zerop (init);
9497 /* ??? Note that this is not correct for C4X float formats. There,
9498 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9499 negative exponent. */
9500 return real_zerop (init)
9501 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9504 return fixed_zerop (init);
9507 return integer_zerop (init)
9508 || (real_zerop (init)
9509 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9510 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9513 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9514 if (!initializer_zerop (TREE_VALUE (elt)))
9520 unsigned HOST_WIDE_INT idx;
9522 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9523 if (!initializer_zerop (elt))
9532 /* We need to loop through all elements to handle cases like
9533 "\0" and "\0foobar". */
9534 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9535 if (TREE_STRING_POINTER (init)[i] != '\0')
9546 /* Build an empty statement at location LOC. */
9549 build_empty_stmt (location_t loc)
9551 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9552 SET_EXPR_LOCATION (t, loc);
9557 /* Build an OpenMP clause with code CODE. LOC is the location of the
9561 build_omp_clause (location_t loc, enum omp_clause_code code)
9566 length = omp_clause_num_ops[code];
9567 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9569 t = ggc_alloc_tree_node (size);
9570 memset (t, 0, size);
9571 TREE_SET_CODE (t, OMP_CLAUSE);
9572 OMP_CLAUSE_SET_CODE (t, code);
9573 OMP_CLAUSE_LOCATION (t) = loc;
9575 #ifdef GATHER_STATISTICS
9576 tree_node_counts[(int) omp_clause_kind]++;
9577 tree_node_sizes[(int) omp_clause_kind] += size;
9583 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9584 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9585 Except for the CODE and operand count field, other storage for the
9586 object is initialized to zeros. */
9589 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9592 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9594 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9595 gcc_assert (len >= 1);
9597 #ifdef GATHER_STATISTICS
9598 tree_node_counts[(int) e_kind]++;
9599 tree_node_sizes[(int) e_kind] += length;
9602 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9604 TREE_SET_CODE (t, code);
9606 /* Can't use TREE_OPERAND to store the length because if checking is
9607 enabled, it will try to check the length before we store it. :-P */
9608 t->exp.operands[0] = build_int_cst (sizetype, len);
9613 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9614 FN and a null static chain slot. NARGS is the number of call arguments
9615 which are specified as "..." arguments. */
9618 build_call_nary (tree return_type, tree fn, int nargs, ...)
9622 va_start (args, nargs);
9623 ret = build_call_valist (return_type, fn, nargs, args);
9628 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9629 FN and a null static chain slot. NARGS is the number of call arguments
9630 which are specified as a va_list ARGS. */
9633 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9638 t = build_vl_exp (CALL_EXPR, nargs + 3);
9639 TREE_TYPE (t) = return_type;
9640 CALL_EXPR_FN (t) = fn;
9641 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9642 for (i = 0; i < nargs; i++)
9643 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9644 process_call_operands (t);
9648 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9649 FN and a null static chain slot. NARGS is the number of call arguments
9650 which are specified as a tree array ARGS. */
9653 build_call_array_loc (location_t loc, tree return_type, tree fn,
9654 int nargs, const tree *args)
9659 t = build_vl_exp (CALL_EXPR, nargs + 3);
9660 TREE_TYPE (t) = return_type;
9661 CALL_EXPR_FN (t) = fn;
9662 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9663 for (i = 0; i < nargs; i++)
9664 CALL_EXPR_ARG (t, i) = args[i];
9665 process_call_operands (t);
9666 SET_EXPR_LOCATION (t, loc);
9670 /* Like build_call_array, but takes a VEC. */
9673 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9678 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9679 TREE_TYPE (ret) = return_type;
9680 CALL_EXPR_FN (ret) = fn;
9681 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9682 FOR_EACH_VEC_ELT (tree, args, ix, t)
9683 CALL_EXPR_ARG (ret, ix) = t;
9684 process_call_operands (ret);
9689 /* Returns true if it is possible to prove that the index of
9690 an array access REF (an ARRAY_REF expression) falls into the
9694 in_array_bounds_p (tree ref)
9696 tree idx = TREE_OPERAND (ref, 1);
9699 if (TREE_CODE (idx) != INTEGER_CST)
9702 min = array_ref_low_bound (ref);
9703 max = array_ref_up_bound (ref);
9706 || TREE_CODE (min) != INTEGER_CST
9707 || TREE_CODE (max) != INTEGER_CST)
9710 if (tree_int_cst_lt (idx, min)
9711 || tree_int_cst_lt (max, idx))
9717 /* Returns true if it is possible to prove that the range of
9718 an array access REF (an ARRAY_RANGE_REF expression) falls
9719 into the array bounds. */
9722 range_in_array_bounds_p (tree ref)
9724 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9725 tree range_min, range_max, min, max;
9727 range_min = TYPE_MIN_VALUE (domain_type);
9728 range_max = TYPE_MAX_VALUE (domain_type);
9731 || TREE_CODE (range_min) != INTEGER_CST
9732 || TREE_CODE (range_max) != INTEGER_CST)
9735 min = array_ref_low_bound (ref);
9736 max = array_ref_up_bound (ref);
9739 || TREE_CODE (min) != INTEGER_CST
9740 || TREE_CODE (max) != INTEGER_CST)
9743 if (tree_int_cst_lt (range_min, min)
9744 || tree_int_cst_lt (max, range_max))
9750 /* Return true if T (assumed to be a DECL) must be assigned a memory
9754 needs_to_live_in_memory (const_tree t)
9756 if (TREE_CODE (t) == SSA_NAME)
9757 t = SSA_NAME_VAR (t);
9759 return (TREE_ADDRESSABLE (t)
9760 || is_global_var (t)
9761 || (TREE_CODE (t) == RESULT_DECL
9762 && !DECL_BY_REFERENCE (t)
9763 && aggregate_value_p (t, current_function_decl)));
9766 /* There are situations in which a language considers record types
9767 compatible which have different field lists. Decide if two fields
9768 are compatible. It is assumed that the parent records are compatible. */
9771 fields_compatible_p (const_tree f1, const_tree f2)
9773 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9774 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9777 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9778 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9781 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9787 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9790 find_compatible_field (tree record, tree orig_field)
9794 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9795 if (TREE_CODE (f) == FIELD_DECL
9796 && fields_compatible_p (f, orig_field))
9799 /* ??? Why isn't this on the main fields list? */
9800 f = TYPE_VFIELD (record);
9801 if (f && TREE_CODE (f) == FIELD_DECL
9802 && fields_compatible_p (f, orig_field))
9805 /* ??? We should abort here, but Java appears to do Bad Things
9806 with inherited fields. */
9810 /* Return value of a constant X and sign-extend it. */
9813 int_cst_value (const_tree x)
9815 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9816 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9818 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9819 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9820 || TREE_INT_CST_HIGH (x) == -1);
9822 if (bits < HOST_BITS_PER_WIDE_INT)
9824 bool negative = ((val >> (bits - 1)) & 1) != 0;
9826 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9828 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9834 /* Return value of a constant X and sign-extend it. */
9837 widest_int_cst_value (const_tree x)
9839 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9840 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9842 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9843 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9844 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9845 << HOST_BITS_PER_WIDE_INT);
9847 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9848 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9849 || TREE_INT_CST_HIGH (x) == -1);
9852 if (bits < HOST_BITS_PER_WIDEST_INT)
9854 bool negative = ((val >> (bits - 1)) & 1) != 0;
9856 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9858 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9864 /* If TYPE is an integral type, return an equivalent type which is
9865 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9866 return TYPE itself. */
9869 signed_or_unsigned_type_for (int unsignedp, tree type)
9872 if (POINTER_TYPE_P (type))
9874 /* If the pointer points to the normal address space, use the
9875 size_type_node. Otherwise use an appropriate size for the pointer
9876 based on the named address space it points to. */
9877 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9880 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9883 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9886 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9889 /* Returns unsigned variant of TYPE. */
9892 unsigned_type_for (tree type)
9894 return signed_or_unsigned_type_for (1, type);
9897 /* Returns signed variant of TYPE. */
9900 signed_type_for (tree type)
9902 return signed_or_unsigned_type_for (0, type);
9905 /* Returns the largest value obtainable by casting something in INNER type to
9909 upper_bound_in_type (tree outer, tree inner)
9911 unsigned HOST_WIDE_INT lo, hi;
9912 unsigned int det = 0;
9913 unsigned oprec = TYPE_PRECISION (outer);
9914 unsigned iprec = TYPE_PRECISION (inner);
9917 /* Compute a unique number for every combination. */
9918 det |= (oprec > iprec) ? 4 : 0;
9919 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9920 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9922 /* Determine the exponent to use. */
9927 /* oprec <= iprec, outer: signed, inner: don't care. */
9932 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9936 /* oprec > iprec, outer: signed, inner: signed. */
9940 /* oprec > iprec, outer: signed, inner: unsigned. */
9944 /* oprec > iprec, outer: unsigned, inner: signed. */
9948 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9955 /* Compute 2^^prec - 1. */
9956 if (prec <= HOST_BITS_PER_WIDE_INT)
9959 lo = ((~(unsigned HOST_WIDE_INT) 0)
9960 >> (HOST_BITS_PER_WIDE_INT - prec));
9964 hi = ((~(unsigned HOST_WIDE_INT) 0)
9965 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9966 lo = ~(unsigned HOST_WIDE_INT) 0;
9969 return build_int_cst_wide (outer, lo, hi);
9972 /* Returns the smallest value obtainable by casting something in INNER type to
9976 lower_bound_in_type (tree outer, tree inner)
9978 unsigned HOST_WIDE_INT lo, hi;
9979 unsigned oprec = TYPE_PRECISION (outer);
9980 unsigned iprec = TYPE_PRECISION (inner);
9982 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9984 if (TYPE_UNSIGNED (outer)
9985 /* If we are widening something of an unsigned type, OUTER type
9986 contains all values of INNER type. In particular, both INNER
9987 and OUTER types have zero in common. */
9988 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9992 /* If we are widening a signed type to another signed type, we
9993 want to obtain -2^^(iprec-1). If we are keeping the
9994 precision or narrowing to a signed type, we want to obtain
9996 unsigned prec = oprec > iprec ? iprec : oprec;
9998 if (prec <= HOST_BITS_PER_WIDE_INT)
10000 hi = ~(unsigned HOST_WIDE_INT) 0;
10001 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
10005 hi = ((~(unsigned HOST_WIDE_INT) 0)
10006 << (prec - HOST_BITS_PER_WIDE_INT - 1));
10011 return build_int_cst_wide (outer, lo, hi);
10014 /* Return nonzero if two operands that are suitable for PHI nodes are
10015 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10016 SSA_NAME or invariant. Note that this is strictly an optimization.
10017 That is, callers of this function can directly call operand_equal_p
10018 and get the same result, only slower. */
10021 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10025 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10027 return operand_equal_p (arg0, arg1, 0);
10030 /* Returns number of zeros at the end of binary representation of X.
10032 ??? Use ffs if available? */
10035 num_ending_zeros (const_tree x)
10037 unsigned HOST_WIDE_INT fr, nfr;
10038 unsigned num, abits;
10039 tree type = TREE_TYPE (x);
10041 if (TREE_INT_CST_LOW (x) == 0)
10043 num = HOST_BITS_PER_WIDE_INT;
10044 fr = TREE_INT_CST_HIGH (x);
10049 fr = TREE_INT_CST_LOW (x);
10052 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10055 if (nfr << abits == fr)
10062 if (num > TYPE_PRECISION (type))
10063 num = TYPE_PRECISION (type);
10065 return build_int_cst_type (type, num);
10069 #define WALK_SUBTREE(NODE) \
10072 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10078 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10079 be walked whenever a type is seen in the tree. Rest of operands and return
10080 value are as for walk_tree. */
10083 walk_type_fields (tree type, walk_tree_fn func, void *data,
10084 struct pointer_set_t *pset, walk_tree_lh lh)
10086 tree result = NULL_TREE;
10088 switch (TREE_CODE (type))
10091 case REFERENCE_TYPE:
10092 /* We have to worry about mutually recursive pointers. These can't
10093 be written in C. They can in Ada. It's pathological, but
10094 there's an ACATS test (c38102a) that checks it. Deal with this
10095 by checking if we're pointing to another pointer, that one
10096 points to another pointer, that one does too, and we have no htab.
10097 If so, get a hash table. We check three levels deep to avoid
10098 the cost of the hash table if we don't need one. */
10099 if (POINTER_TYPE_P (TREE_TYPE (type))
10100 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10101 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10104 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10112 /* ... fall through ... */
10115 WALK_SUBTREE (TREE_TYPE (type));
10119 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10121 /* Fall through. */
10123 case FUNCTION_TYPE:
10124 WALK_SUBTREE (TREE_TYPE (type));
10128 /* We never want to walk into default arguments. */
10129 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10130 WALK_SUBTREE (TREE_VALUE (arg));
10135 /* Don't follow this nodes's type if a pointer for fear that
10136 we'll have infinite recursion. If we have a PSET, then we
10139 || (!POINTER_TYPE_P (TREE_TYPE (type))
10140 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10141 WALK_SUBTREE (TREE_TYPE (type));
10142 WALK_SUBTREE (TYPE_DOMAIN (type));
10146 WALK_SUBTREE (TREE_TYPE (type));
10147 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10157 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10158 called with the DATA and the address of each sub-tree. If FUNC returns a
10159 non-NULL value, the traversal is stopped, and the value returned by FUNC
10160 is returned. If PSET is non-NULL it is used to record the nodes visited,
10161 and to avoid visiting a node more than once. */
10164 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10165 struct pointer_set_t *pset, walk_tree_lh lh)
10167 enum tree_code code;
10171 #define WALK_SUBTREE_TAIL(NODE) \
10175 goto tail_recurse; \
10180 /* Skip empty subtrees. */
10184 /* Don't walk the same tree twice, if the user has requested
10185 that we avoid doing so. */
10186 if (pset && pointer_set_insert (pset, *tp))
10189 /* Call the function. */
10191 result = (*func) (tp, &walk_subtrees, data);
10193 /* If we found something, return it. */
10197 code = TREE_CODE (*tp);
10199 /* Even if we didn't, FUNC may have decided that there was nothing
10200 interesting below this point in the tree. */
10201 if (!walk_subtrees)
10203 /* But we still need to check our siblings. */
10204 if (code == TREE_LIST)
10205 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10206 else if (code == OMP_CLAUSE)
10207 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10214 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10215 if (result || !walk_subtrees)
10222 case IDENTIFIER_NODE:
10229 case PLACEHOLDER_EXPR:
10233 /* None of these have subtrees other than those already walked
10238 WALK_SUBTREE (TREE_VALUE (*tp));
10239 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10244 int len = TREE_VEC_LENGTH (*tp);
10249 /* Walk all elements but the first. */
10251 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10253 /* Now walk the first one as a tail call. */
10254 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10258 WALK_SUBTREE (TREE_REALPART (*tp));
10259 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10263 unsigned HOST_WIDE_INT idx;
10264 constructor_elt *ce;
10267 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10269 WALK_SUBTREE (ce->value);
10274 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10279 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10281 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10282 into declarations that are just mentioned, rather than
10283 declared; they don't really belong to this part of the tree.
10284 And, we can see cycles: the initializer for a declaration
10285 can refer to the declaration itself. */
10286 WALK_SUBTREE (DECL_INITIAL (decl));
10287 WALK_SUBTREE (DECL_SIZE (decl));
10288 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10290 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10293 case STATEMENT_LIST:
10295 tree_stmt_iterator i;
10296 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10297 WALK_SUBTREE (*tsi_stmt_ptr (i));
10302 switch (OMP_CLAUSE_CODE (*tp))
10304 case OMP_CLAUSE_PRIVATE:
10305 case OMP_CLAUSE_SHARED:
10306 case OMP_CLAUSE_FIRSTPRIVATE:
10307 case OMP_CLAUSE_COPYIN:
10308 case OMP_CLAUSE_COPYPRIVATE:
10309 case OMP_CLAUSE_IF:
10310 case OMP_CLAUSE_NUM_THREADS:
10311 case OMP_CLAUSE_SCHEDULE:
10312 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10315 case OMP_CLAUSE_NOWAIT:
10316 case OMP_CLAUSE_ORDERED:
10317 case OMP_CLAUSE_DEFAULT:
10318 case OMP_CLAUSE_UNTIED:
10319 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10321 case OMP_CLAUSE_LASTPRIVATE:
10322 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10323 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10324 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10326 case OMP_CLAUSE_COLLAPSE:
10329 for (i = 0; i < 3; i++)
10330 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10331 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10334 case OMP_CLAUSE_REDUCTION:
10337 for (i = 0; i < 4; i++)
10338 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10339 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10343 gcc_unreachable ();
10351 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10352 But, we only want to walk once. */
10353 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10354 for (i = 0; i < len; ++i)
10355 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10356 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10360 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10361 defining. We only want to walk into these fields of a type in this
10362 case and not in the general case of a mere reference to the type.
10364 The criterion is as follows: if the field can be an expression, it
10365 must be walked only here. This should be in keeping with the fields
10366 that are directly gimplified in gimplify_type_sizes in order for the
10367 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10368 variable-sized types.
10370 Note that DECLs get walked as part of processing the BIND_EXPR. */
10371 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10373 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10374 if (TREE_CODE (*type_p) == ERROR_MARK)
10377 /* Call the function for the type. See if it returns anything or
10378 doesn't want us to continue. If we are to continue, walk both
10379 the normal fields and those for the declaration case. */
10380 result = (*func) (type_p, &walk_subtrees, data);
10381 if (result || !walk_subtrees)
10384 result = walk_type_fields (*type_p, func, data, pset, lh);
10388 /* If this is a record type, also walk the fields. */
10389 if (RECORD_OR_UNION_TYPE_P (*type_p))
10393 for (field = TYPE_FIELDS (*type_p); field;
10394 field = DECL_CHAIN (field))
10396 /* We'd like to look at the type of the field, but we can
10397 easily get infinite recursion. So assume it's pointed
10398 to elsewhere in the tree. Also, ignore things that
10400 if (TREE_CODE (field) != FIELD_DECL)
10403 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10404 WALK_SUBTREE (DECL_SIZE (field));
10405 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10406 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10407 WALK_SUBTREE (DECL_QUALIFIER (field));
10411 /* Same for scalar types. */
10412 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10413 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10414 || TREE_CODE (*type_p) == INTEGER_TYPE
10415 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10416 || TREE_CODE (*type_p) == REAL_TYPE)
10418 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10419 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10422 WALK_SUBTREE (TYPE_SIZE (*type_p));
10423 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10428 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10432 /* Walk over all the sub-trees of this operand. */
10433 len = TREE_OPERAND_LENGTH (*tp);
10435 /* Go through the subtrees. We need to do this in forward order so
10436 that the scope of a FOR_EXPR is handled properly. */
10439 for (i = 0; i < len - 1; ++i)
10440 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10441 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10444 /* If this is a type, walk the needed fields in the type. */
10445 else if (TYPE_P (*tp))
10446 return walk_type_fields (*tp, func, data, pset, lh);
10450 /* We didn't find what we were looking for. */
10453 #undef WALK_SUBTREE_TAIL
10455 #undef WALK_SUBTREE
10457 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10460 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10464 struct pointer_set_t *pset;
10466 pset = pointer_set_create ();
10467 result = walk_tree_1 (tp, func, data, pset, lh);
10468 pointer_set_destroy (pset);
10474 tree_block (tree t)
10476 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10478 if (IS_EXPR_CODE_CLASS (c))
10479 return &t->exp.block;
10480 gcc_unreachable ();
10484 /* Create a nameless artificial label and put it in the current
10485 function context. The label has a location of LOC. Returns the
10486 newly created label. */
10489 create_artificial_label (location_t loc)
10491 tree lab = build_decl (loc,
10492 LABEL_DECL, NULL_TREE, void_type_node);
10494 DECL_ARTIFICIAL (lab) = 1;
10495 DECL_IGNORED_P (lab) = 1;
10496 DECL_CONTEXT (lab) = current_function_decl;
10500 /* Given a tree, try to return a useful variable name that we can use
10501 to prefix a temporary that is being assigned the value of the tree.
10502 I.E. given <temp> = &A, return A. */
10507 tree stripped_decl;
10510 STRIP_NOPS (stripped_decl);
10511 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10512 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10515 switch (TREE_CODE (stripped_decl))
10518 return get_name (TREE_OPERAND (stripped_decl, 0));
10525 /* Return true if TYPE has a variable argument list. */
10528 stdarg_p (const_tree fntype)
10530 function_args_iterator args_iter;
10531 tree n = NULL_TREE, t;
10536 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10541 return n != NULL_TREE && n != void_type_node;
10544 /* Return true if TYPE has a prototype. */
10547 prototype_p (tree fntype)
10551 gcc_assert (fntype != NULL_TREE);
10553 t = TYPE_ARG_TYPES (fntype);
10554 return (t != NULL_TREE);
10557 /* If BLOCK is inlined from an __attribute__((__artificial__))
10558 routine, return pointer to location from where it has been
10561 block_nonartificial_location (tree block)
10563 location_t *ret = NULL;
10565 while (block && TREE_CODE (block) == BLOCK
10566 && BLOCK_ABSTRACT_ORIGIN (block))
10568 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10570 while (TREE_CODE (ao) == BLOCK
10571 && BLOCK_ABSTRACT_ORIGIN (ao)
10572 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10573 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10575 if (TREE_CODE (ao) == FUNCTION_DECL)
10577 /* If AO is an artificial inline, point RET to the
10578 call site locus at which it has been inlined and continue
10579 the loop, in case AO's caller is also an artificial
10581 if (DECL_DECLARED_INLINE_P (ao)
10582 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10583 ret = &BLOCK_SOURCE_LOCATION (block);
10587 else if (TREE_CODE (ao) != BLOCK)
10590 block = BLOCK_SUPERCONTEXT (block);
10596 /* If EXP is inlined from an __attribute__((__artificial__))
10597 function, return the location of the original call expression. */
10600 tree_nonartificial_location (tree exp)
10602 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10607 return EXPR_LOCATION (exp);
10611 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10614 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10617 cl_option_hash_hash (const void *x)
10619 const_tree const t = (const_tree) x;
10623 hashval_t hash = 0;
10625 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10627 p = (const char *)TREE_OPTIMIZATION (t);
10628 len = sizeof (struct cl_optimization);
10631 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10633 p = (const char *)TREE_TARGET_OPTION (t);
10634 len = sizeof (struct cl_target_option);
10638 gcc_unreachable ();
10640 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10642 for (i = 0; i < len; i++)
10644 hash = (hash << 4) ^ ((i << 2) | p[i]);
10649 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10650 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10654 cl_option_hash_eq (const void *x, const void *y)
10656 const_tree const xt = (const_tree) x;
10657 const_tree const yt = (const_tree) y;
10662 if (TREE_CODE (xt) != TREE_CODE (yt))
10665 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10667 xp = (const char *)TREE_OPTIMIZATION (xt);
10668 yp = (const char *)TREE_OPTIMIZATION (yt);
10669 len = sizeof (struct cl_optimization);
10672 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10674 xp = (const char *)TREE_TARGET_OPTION (xt);
10675 yp = (const char *)TREE_TARGET_OPTION (yt);
10676 len = sizeof (struct cl_target_option);
10680 gcc_unreachable ();
10682 return (memcmp (xp, yp, len) == 0);
10685 /* Build an OPTIMIZATION_NODE based on the current options. */
10688 build_optimization_node (void)
10693 /* Use the cache of optimization nodes. */
10695 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node),
10698 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10702 /* Insert this one into the hash table. */
10703 t = cl_optimization_node;
10706 /* Make a new node for next time round. */
10707 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10713 /* Build a TARGET_OPTION_NODE based on the current options. */
10716 build_target_option_node (void)
10721 /* Use the cache of optimization nodes. */
10723 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node),
10726 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10730 /* Insert this one into the hash table. */
10731 t = cl_target_option_node;
10734 /* Make a new node for next time round. */
10735 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10741 /* Determine the "ultimate origin" of a block. The block may be an inlined
10742 instance of an inlined instance of a block which is local to an inline
10743 function, so we have to trace all of the way back through the origin chain
10744 to find out what sort of node actually served as the original seed for the
10748 block_ultimate_origin (const_tree block)
10750 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10752 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10753 nodes in the function to point to themselves; ignore that if
10754 we're trying to output the abstract instance of this function. */
10755 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10758 if (immediate_origin == NULL_TREE)
10763 tree lookahead = immediate_origin;
10767 ret_val = lookahead;
10768 lookahead = (TREE_CODE (ret_val) == BLOCK
10769 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10771 while (lookahead != NULL && lookahead != ret_val);
10773 /* The block's abstract origin chain may not be the *ultimate* origin of
10774 the block. It could lead to a DECL that has an abstract origin set.
10775 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10776 will give us if it has one). Note that DECL's abstract origins are
10777 supposed to be the most distant ancestor (or so decl_ultimate_origin
10778 claims), so we don't need to loop following the DECL origins. */
10779 if (DECL_P (ret_val))
10780 return DECL_ORIGIN (ret_val);
10786 /* Return true if T1 and T2 are equivalent lists. */
10789 list_equal_p (const_tree t1, const_tree t2)
10791 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10792 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10797 /* Return true iff conversion in EXP generates no instruction. Mark
10798 it inline so that we fully inline into the stripping functions even
10799 though we have two uses of this function. */
10802 tree_nop_conversion (const_tree exp)
10804 tree outer_type, inner_type;
10806 if (!CONVERT_EXPR_P (exp)
10807 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10809 if (TREE_OPERAND (exp, 0) == error_mark_node)
10812 outer_type = TREE_TYPE (exp);
10813 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10818 /* Use precision rather then machine mode when we can, which gives
10819 the correct answer even for submode (bit-field) types. */
10820 if ((INTEGRAL_TYPE_P (outer_type)
10821 || POINTER_TYPE_P (outer_type)
10822 || TREE_CODE (outer_type) == OFFSET_TYPE)
10823 && (INTEGRAL_TYPE_P (inner_type)
10824 || POINTER_TYPE_P (inner_type)
10825 || TREE_CODE (inner_type) == OFFSET_TYPE))
10826 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10828 /* Otherwise fall back on comparing machine modes (e.g. for
10829 aggregate types, floats). */
10830 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10833 /* Return true iff conversion in EXP generates no instruction. Don't
10834 consider conversions changing the signedness. */
10837 tree_sign_nop_conversion (const_tree exp)
10839 tree outer_type, inner_type;
10841 if (!tree_nop_conversion (exp))
10844 outer_type = TREE_TYPE (exp);
10845 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10847 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10848 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10851 /* Strip conversions from EXP according to tree_nop_conversion and
10852 return the resulting expression. */
10855 tree_strip_nop_conversions (tree exp)
10857 while (tree_nop_conversion (exp))
10858 exp = TREE_OPERAND (exp, 0);
10862 /* Strip conversions from EXP according to tree_sign_nop_conversion
10863 and return the resulting expression. */
10866 tree_strip_sign_nop_conversions (tree exp)
10868 while (tree_sign_nop_conversion (exp))
10869 exp = TREE_OPERAND (exp, 0);
10873 static GTY(()) tree gcc_eh_personality_decl;
10875 /* Return the GCC personality function decl. */
10878 lhd_gcc_personality (void)
10880 if (!gcc_eh_personality_decl)
10881 gcc_eh_personality_decl = build_personality_function ("gcc");
10882 return gcc_eh_personality_decl;
10885 /* Try to find a base info of BINFO that would have its field decl at offset
10886 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10887 found, return, otherwise return NULL_TREE. */
10890 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
10897 type = TREE_TYPE (binfo);
10900 tree base_binfo, found_binfo;
10901 HOST_WIDE_INT pos, size;
10905 if (TREE_CODE (type) != RECORD_TYPE)
10908 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
10910 if (TREE_CODE (fld) != FIELD_DECL)
10913 pos = int_bit_position (fld);
10914 size = tree_low_cst (DECL_SIZE (fld), 1);
10915 if (pos <= offset && (pos + size) > offset)
10921 found_binfo = NULL_TREE;
10922 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
10923 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
10925 found_binfo = base_binfo;
10932 type = TREE_TYPE (fld);
10933 binfo = found_binfo;
10936 if (type != expected_type)
10941 /* Returns true if X is a typedef decl. */
10944 is_typedef_decl (tree x)
10946 return (x && TREE_CODE (x) == TYPE_DECL
10947 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
10950 /* Returns true iff TYPE is a type variant created for a typedef. */
10953 typedef_variant_p (tree type)
10955 return is_typedef_decl (TYPE_NAME (type));
10958 #include "gt-tree.h"