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
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid = 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash {
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
179 htab_t type_hash_table;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
184 htab_t int_cst_hash_table;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node;
192 static GTY (()) tree cl_target_option_node;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
194 htab_t cl_option_hash_table;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
200 htab_t debug_expr_for_decl;
202 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
203 htab_t value_expr_for_decl;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map)))
207 htab_t init_priority_for_decl;
209 static void set_type_quals (tree, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t type_hash_hash (const void *);
212 static hashval_t int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree, hashval_t);
221 static unsigned int attribute_hash_list (const_tree, hashval_t);
223 tree global_trees[TI_MAX];
224 tree integer_types[itk_none];
226 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0 /* OMP_CLAUSE_UNTIED */
249 const char * const omp_clause_code_name[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code)
275 switch (TREE_CODE_CLASS (code))
277 case tcc_declaration:
282 return TS_FIELD_DECL;
288 return TS_LABEL_DECL;
290 return TS_RESULT_DECL;
291 case DEBUG_EXPR_DECL:
294 return TS_CONST_DECL;
298 return TS_FUNCTION_DECL;
300 return TS_DECL_NON_COMMON;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST: return TS_INT_CST;
320 case REAL_CST: return TS_REAL_CST;
321 case FIXED_CST: return TS_FIXED_CST;
322 case COMPLEX_CST: return TS_COMPLEX;
323 case VECTOR_CST: return TS_VECTOR;
324 case STRING_CST: return TS_STRING;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK: return TS_COMMON;
327 case IDENTIFIER_NODE: return TS_IDENTIFIER;
328 case TREE_LIST: return TS_LIST;
329 case TREE_VEC: return TS_VEC;
330 case SSA_NAME: return TS_SSA_NAME;
331 case PLACEHOLDER_EXPR: return TS_COMMON;
332 case STATEMENT_LIST: return TS_STATEMENT_LIST;
333 case BLOCK: return TS_BLOCK;
334 case CONSTRUCTOR: return TS_CONSTRUCTOR;
335 case TREE_BINFO: return TS_BINFO;
336 case OMP_CLAUSE: return TS_OMP_CLAUSE;
337 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
338 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
398 enum tree_node_structure_enum ts_code;
400 code = (enum tree_code) i;
401 ts_code = tree_node_structure_for_code (code);
403 /* Mark the TS structure itself. */
404 tree_contains_struct[code][ts_code] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL:
428 case TS_STATEMENT_LIST:
431 case TS_OPTIMIZATION:
432 case TS_TARGET_OPTION:
433 MARK_TS_COMMON (code);
437 MARK_TS_DECL_MINIMAL (code);
441 MARK_TS_DECL_COMMON (code);
444 case TS_DECL_NON_COMMON:
445 MARK_TS_DECL_WITH_VIS (code);
448 case TS_DECL_WITH_VIS:
453 MARK_TS_DECL_WRTL (code);
457 MARK_TS_DECL_COMMON (code);
461 MARK_TS_DECL_WITH_VIS (code);
465 case TS_FUNCTION_DECL:
466 MARK_TS_DECL_NON_COMMON (code);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
476 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
478 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
503 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
504 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
505 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
507 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
508 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
509 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
510 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
511 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
512 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
513 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
514 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
515 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
536 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
539 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
541 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
542 tree_priority_map_eq, 0);
544 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
545 int_cst_hash_eq, NULL);
547 int_cst_node = make_node (INTEGER_CST);
549 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
550 cl_option_hash_eq, NULL);
552 cl_optimization_node = make_node (OPTIMIZATION_NODE);
553 cl_target_option_node = make_node (TARGET_OPTION_NODE);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
568 lang_hooks.set_decl_assembler_name (decl);
569 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl, const_tree asmname)
577 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
578 const char *decl_str;
579 const char *asmname_str;
582 if (decl_asmname == asmname)
585 decl_str = IDENTIFIER_POINTER (decl_asmname);
586 asmname_str = IDENTIFIER_POINTER (asmname);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str[0] == '*')
597 size_t ulp_len = strlen (user_label_prefix);
603 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
604 decl_str += ulp_len, test=true;
608 if (asmname_str[0] == '*')
610 size_t ulp_len = strlen (user_label_prefix);
616 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
617 asmname_str += ulp_len, test=true;
624 return strcmp (decl_str, asmname_str) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname)
632 if (IDENTIFIER_POINTER (asmname)[0] == '*')
634 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
635 size_t ulp_len = strlen (user_label_prefix);
639 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
642 return htab_hash_string (decl_str);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code)
654 switch (TREE_CODE_CLASS (code))
656 case tcc_declaration: /* A decl node */
661 return sizeof (struct tree_field_decl);
663 return sizeof (struct tree_parm_decl);
665 return sizeof (struct tree_var_decl);
667 return sizeof (struct tree_label_decl);
669 return sizeof (struct tree_result_decl);
671 return sizeof (struct tree_const_decl);
673 return sizeof (struct tree_type_decl);
675 return sizeof (struct tree_function_decl);
676 case DEBUG_EXPR_DECL:
677 return sizeof (struct tree_decl_with_rtl);
679 return sizeof (struct tree_decl_non_common);
683 case tcc_type: /* a type node */
684 return sizeof (struct tree_type);
686 case tcc_reference: /* a reference */
687 case tcc_expression: /* an expression */
688 case tcc_statement: /* an expression with side effects */
689 case tcc_comparison: /* a comparison expression */
690 case tcc_unary: /* a unary arithmetic expression */
691 case tcc_binary: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp)
693 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
695 case tcc_constant: /* a constant */
698 case INTEGER_CST: return sizeof (struct tree_int_cst);
699 case REAL_CST: return sizeof (struct tree_real_cst);
700 case FIXED_CST: return sizeof (struct tree_fixed_cst);
701 case COMPLEX_CST: return sizeof (struct tree_complex);
702 case VECTOR_CST: return sizeof (struct tree_vector);
703 case STRING_CST: gcc_unreachable ();
705 return lang_hooks.tree_size (code);
708 case tcc_exceptional: /* something random, like an identifier. */
711 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
712 case TREE_LIST: return sizeof (struct tree_list);
715 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
718 case OMP_CLAUSE: gcc_unreachable ();
720 case SSA_NAME: return sizeof (struct tree_ssa_name);
722 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
723 case BLOCK: return sizeof (struct tree_block);
724 case CONSTRUCTOR: return sizeof (struct tree_constructor);
725 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
726 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
729 return lang_hooks.tree_size (code);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node)
742 const enum tree_code code = TREE_CODE (node);
746 return (offsetof (struct tree_binfo, base_binfos)
747 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
750 return (sizeof (struct tree_vec)
751 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
754 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
757 return (sizeof (struct tree_omp_clause)
758 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
762 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
763 return (sizeof (struct tree_exp)
764 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
766 return tree_code_size (code);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL)
781 enum tree_code_class type = TREE_CODE_CLASS (code);
782 size_t length = tree_code_size (code);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration: /* A decl node */
792 case tcc_type: /* a type node */
796 case tcc_statement: /* an expression with side effects */
800 case tcc_reference: /* a reference */
804 case tcc_expression: /* an expression */
805 case tcc_comparison: /* a comparison expression */
806 case tcc_unary: /* a unary arithmetic expression */
807 case tcc_binary: /* a binary arithmetic expression */
811 case tcc_constant: /* a constant */
815 case tcc_exceptional: /* something random, like an identifier. */
818 case IDENTIFIER_NODE:
831 kind = ssa_name_kind;
852 tree_node_counts[(int) kind]++;
853 tree_node_sizes[(int) kind] += length;
856 if (code == IDENTIFIER_NODE)
857 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
859 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
861 memset (t, 0, length);
863 TREE_SET_CODE (t, code);
868 TREE_SIDE_EFFECTS (t) = 1;
871 case tcc_declaration:
872 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
874 if (code == FUNCTION_DECL)
876 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
877 DECL_MODE (t) = FUNCTION_MODE;
882 DECL_SOURCE_LOCATION (t) = input_location;
883 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
884 DECL_UID (t) = --next_debug_decl_uid;
886 DECL_UID (t) = next_decl_uid++;
887 if (TREE_CODE (t) == LABEL_DECL)
888 LABEL_DECL_UID (t) = -1;
893 TYPE_UID (t) = next_type_uid++;
894 TYPE_ALIGN (t) = BITS_PER_UNIT;
895 TYPE_USER_ALIGN (t) = 0;
896 TYPE_MAIN_VARIANT (t) = t;
897 TYPE_CANONICAL (t) = t;
899 /* Default to no attributes for type, but let target change that. */
900 TYPE_ATTRIBUTES (t) = NULL_TREE;
901 targetm.set_default_type_attributes (t);
903 /* We have not yet computed the alias set for this type. */
904 TYPE_ALIAS_SET (t) = -1;
908 TREE_CONSTANT (t) = 1;
917 case PREDECREMENT_EXPR:
918 case PREINCREMENT_EXPR:
919 case POSTDECREMENT_EXPR:
920 case POSTINCREMENT_EXPR:
921 /* All of these have side-effects, no matter what their
923 TREE_SIDE_EFFECTS (t) = 1;
932 /* Other classes need no special treatment. */
939 /* Return a new node with the same contents as NODE except that its
940 TREE_CHAIN is zero and it has a fresh uid. */
943 copy_node_stat (tree node MEM_STAT_DECL)
946 enum tree_code code = TREE_CODE (node);
949 gcc_assert (code != STATEMENT_LIST);
951 length = tree_size (node);
952 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
953 memcpy (t, node, length);
956 TREE_ASM_WRITTEN (t) = 0;
957 TREE_VISITED (t) = 0;
960 if (TREE_CODE_CLASS (code) == tcc_declaration)
962 if (code == DEBUG_EXPR_DECL)
963 DECL_UID (t) = --next_debug_decl_uid;
965 DECL_UID (t) = next_decl_uid++;
966 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
967 && DECL_HAS_VALUE_EXPR_P (node))
969 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
970 DECL_HAS_VALUE_EXPR_P (t) = 1;
972 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
974 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
975 DECL_HAS_INIT_PRIORITY_P (t) = 1;
978 else if (TREE_CODE_CLASS (code) == tcc_type)
980 TYPE_UID (t) = next_type_uid++;
981 /* The following is so that the debug code for
982 the copy is different from the original type.
983 The two statements usually duplicate each other
984 (because they clear fields of the same union),
985 but the optimizer should catch that. */
986 TYPE_SYMTAB_POINTER (t) = 0;
987 TYPE_SYMTAB_ADDRESS (t) = 0;
989 /* Do not copy the values cache. */
990 if (TYPE_CACHED_VALUES_P(t))
992 TYPE_CACHED_VALUES_P (t) = 0;
993 TYPE_CACHED_VALUES (t) = NULL_TREE;
1000 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1001 For example, this can copy a list made of TREE_LIST nodes. */
1004 copy_list (tree list)
1012 head = prev = copy_node (list);
1013 next = TREE_CHAIN (list);
1016 TREE_CHAIN (prev) = copy_node (next);
1017 prev = TREE_CHAIN (prev);
1018 next = TREE_CHAIN (next);
1024 /* Create an INT_CST node with a LOW value sign extended. */
1027 build_int_cst (tree type, HOST_WIDE_INT low)
1029 /* Support legacy code. */
1031 type = integer_type_node;
1033 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1036 /* Create an INT_CST node with a LOW value zero extended. */
1039 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1041 return build_int_cst_wide (type, low, 0);
1044 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1045 if it is negative. This function is similar to build_int_cst, but
1046 the extra bits outside of the type precision are cleared. Constants
1047 with these extra bits may confuse the fold so that it detects overflows
1048 even in cases when they do not occur, and in general should be avoided.
1049 We cannot however make this a default behavior of build_int_cst without
1050 more intrusive changes, since there are parts of gcc that rely on the extra
1051 precision of the integer constants. */
1054 build_int_cst_type (tree type, HOST_WIDE_INT low)
1056 unsigned HOST_WIDE_INT low1;
1061 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1063 return build_int_cst_wide (type, low1, hi);
1066 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1067 and sign extended according to the value range of TYPE. */
1070 build_int_cst_wide_type (tree type,
1071 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1073 fit_double_type (low, high, &low, &high, type);
1074 return build_int_cst_wide (type, low, high);
1077 /* These are the hash table functions for the hash table of INTEGER_CST
1078 nodes of a sizetype. */
1080 /* Return the hash code code X, an INTEGER_CST. */
1083 int_cst_hash_hash (const void *x)
1085 const_tree const t = (const_tree) x;
1087 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1088 ^ htab_hash_pointer (TREE_TYPE (t)));
1091 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1092 is the same as that given by *Y, which is the same. */
1095 int_cst_hash_eq (const void *x, const void *y)
1097 const_tree const xt = (const_tree) x;
1098 const_tree const yt = (const_tree) y;
1100 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1101 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1102 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1105 /* Create an INT_CST node of TYPE and value HI:LOW.
1106 The returned node is always shared. For small integers we use a
1107 per-type vector cache, for larger ones we use a single hash table. */
1110 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1118 switch (TREE_CODE (type))
1121 case REFERENCE_TYPE:
1122 /* Cache NULL pointer. */
1131 /* Cache false or true. */
1139 if (TYPE_UNSIGNED (type))
1142 limit = INTEGER_SHARE_LIMIT;
1143 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1149 limit = INTEGER_SHARE_LIMIT + 1;
1150 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1152 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1166 /* Look for it in the type's vector of small shared ints. */
1167 if (!TYPE_CACHED_VALUES_P (type))
1169 TYPE_CACHED_VALUES_P (type) = 1;
1170 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1173 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1176 /* Make sure no one is clobbering the shared constant. */
1177 gcc_assert (TREE_TYPE (t) == type);
1178 gcc_assert (TREE_INT_CST_LOW (t) == low);
1179 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1183 /* Create a new shared int. */
1184 t = make_node (INTEGER_CST);
1186 TREE_INT_CST_LOW (t) = low;
1187 TREE_INT_CST_HIGH (t) = hi;
1188 TREE_TYPE (t) = type;
1190 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1195 /* Use the cache of larger shared ints. */
1198 TREE_INT_CST_LOW (int_cst_node) = low;
1199 TREE_INT_CST_HIGH (int_cst_node) = hi;
1200 TREE_TYPE (int_cst_node) = type;
1202 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1206 /* Insert this one into the hash table. */
1209 /* Make a new node for next time round. */
1210 int_cst_node = make_node (INTEGER_CST);
1217 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1218 and the rest are zeros. */
1221 build_low_bits_mask (tree type, unsigned bits)
1223 unsigned HOST_WIDE_INT low;
1225 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1227 gcc_assert (bits <= TYPE_PRECISION (type));
1229 if (bits == TYPE_PRECISION (type)
1230 && !TYPE_UNSIGNED (type))
1232 /* Sign extended all-ones mask. */
1236 else if (bits <= HOST_BITS_PER_WIDE_INT)
1238 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1243 bits -= HOST_BITS_PER_WIDE_INT;
1245 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1248 return build_int_cst_wide (type, low, high);
1251 /* Checks that X is integer constant that can be expressed in (unsigned)
1252 HOST_WIDE_INT without loss of precision. */
1255 cst_and_fits_in_hwi (const_tree x)
1257 if (TREE_CODE (x) != INTEGER_CST)
1260 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1263 return (TREE_INT_CST_HIGH (x) == 0
1264 || TREE_INT_CST_HIGH (x) == -1);
1267 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1268 are in a list pointed to by VALS. */
1271 build_vector (tree type, tree vals)
1273 tree v = make_node (VECTOR_CST);
1277 TREE_VECTOR_CST_ELTS (v) = vals;
1278 TREE_TYPE (v) = type;
1280 /* Iterate through elements and check for overflow. */
1281 for (link = vals; link; link = TREE_CHAIN (link))
1283 tree value = TREE_VALUE (link);
1285 /* Don't crash if we get an address constant. */
1286 if (!CONSTANT_CLASS_P (value))
1289 over |= TREE_OVERFLOW (value);
1292 TREE_OVERFLOW (v) = over;
1296 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1297 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1300 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1302 tree list = NULL_TREE;
1303 unsigned HOST_WIDE_INT idx;
1306 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1307 list = tree_cons (NULL_TREE, value, list);
1308 return build_vector (type, nreverse (list));
1311 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1312 are in the VEC pointed to by VALS. */
1314 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1316 tree c = make_node (CONSTRUCTOR);
1317 TREE_TYPE (c) = type;
1318 CONSTRUCTOR_ELTS (c) = vals;
1322 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1325 build_constructor_single (tree type, tree index, tree value)
1327 VEC(constructor_elt,gc) *v;
1328 constructor_elt *elt;
1331 v = VEC_alloc (constructor_elt, gc, 1);
1332 elt = VEC_quick_push (constructor_elt, v, NULL);
1336 t = build_constructor (type, v);
1337 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1342 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1343 are in a list pointed to by VALS. */
1345 build_constructor_from_list (tree type, tree vals)
1348 VEC(constructor_elt,gc) *v = NULL;
1349 bool constant_p = true;
1353 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1354 for (t = vals; t; t = TREE_CHAIN (t))
1356 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1357 val = TREE_VALUE (t);
1358 elt->index = TREE_PURPOSE (t);
1360 if (!TREE_CONSTANT (val))
1365 t = build_constructor (type, v);
1366 TREE_CONSTANT (t) = constant_p;
1370 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1373 build_fixed (tree type, FIXED_VALUE_TYPE f)
1376 FIXED_VALUE_TYPE *fp;
1378 v = make_node (FIXED_CST);
1379 fp = GGC_NEW (FIXED_VALUE_TYPE);
1380 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1382 TREE_TYPE (v) = type;
1383 TREE_FIXED_CST_PTR (v) = fp;
1387 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1390 build_real (tree type, REAL_VALUE_TYPE d)
1393 REAL_VALUE_TYPE *dp;
1396 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1397 Consider doing it via real_convert now. */
1399 v = make_node (REAL_CST);
1400 dp = GGC_NEW (REAL_VALUE_TYPE);
1401 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1403 TREE_TYPE (v) = type;
1404 TREE_REAL_CST_PTR (v) = dp;
1405 TREE_OVERFLOW (v) = overflow;
1409 /* Return a new REAL_CST node whose type is TYPE
1410 and whose value is the integer value of the INTEGER_CST node I. */
1413 real_value_from_int_cst (const_tree type, const_tree i)
1417 /* Clear all bits of the real value type so that we can later do
1418 bitwise comparisons to see if two values are the same. */
1419 memset (&d, 0, sizeof d);
1421 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1422 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1423 TYPE_UNSIGNED (TREE_TYPE (i)));
1427 /* Given a tree representing an integer constant I, return a tree
1428 representing the same value as a floating-point constant of type TYPE. */
1431 build_real_from_int_cst (tree type, const_tree i)
1434 int overflow = TREE_OVERFLOW (i);
1436 v = build_real (type, real_value_from_int_cst (type, i));
1438 TREE_OVERFLOW (v) |= overflow;
1442 /* Return a newly constructed STRING_CST node whose value is
1443 the LEN characters at STR.
1444 The TREE_TYPE is not initialized. */
1447 build_string (int len, const char *str)
1452 /* Do not waste bytes provided by padding of struct tree_string. */
1453 length = len + offsetof (struct tree_string, str) + 1;
1455 #ifdef GATHER_STATISTICS
1456 tree_node_counts[(int) c_kind]++;
1457 tree_node_sizes[(int) c_kind] += length;
1460 s = ggc_alloc_tree (length);
1462 memset (s, 0, sizeof (struct tree_common));
1463 TREE_SET_CODE (s, STRING_CST);
1464 TREE_CONSTANT (s) = 1;
1465 TREE_STRING_LENGTH (s) = len;
1466 memcpy (s->string.str, str, len);
1467 s->string.str[len] = '\0';
1472 /* Return a newly constructed COMPLEX_CST node whose value is
1473 specified by the real and imaginary parts REAL and IMAG.
1474 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1475 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1478 build_complex (tree type, tree real, tree imag)
1480 tree t = make_node (COMPLEX_CST);
1482 TREE_REALPART (t) = real;
1483 TREE_IMAGPART (t) = imag;
1484 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1485 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1489 /* Return a constant of arithmetic type TYPE which is the
1490 multiplicative identity of the set TYPE. */
1493 build_one_cst (tree type)
1495 switch (TREE_CODE (type))
1497 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1498 case POINTER_TYPE: case REFERENCE_TYPE:
1500 return build_int_cst (type, 1);
1503 return build_real (type, dconst1);
1505 case FIXED_POINT_TYPE:
1506 /* We can only generate 1 for accum types. */
1507 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1508 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1515 scalar = build_one_cst (TREE_TYPE (type));
1517 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1519 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1520 cst = tree_cons (NULL_TREE, scalar, cst);
1522 return build_vector (type, cst);
1526 return build_complex (type,
1527 build_one_cst (TREE_TYPE (type)),
1528 fold_convert (TREE_TYPE (type), integer_zero_node));
1535 /* Build a BINFO with LEN language slots. */
1538 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1541 size_t length = (offsetof (struct tree_binfo, base_binfos)
1542 + VEC_embedded_size (tree, base_binfos));
1544 #ifdef GATHER_STATISTICS
1545 tree_node_counts[(int) binfo_kind]++;
1546 tree_node_sizes[(int) binfo_kind] += length;
1549 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1551 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1553 TREE_SET_CODE (t, TREE_BINFO);
1555 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1561 /* Build a newly constructed TREE_VEC node of length LEN. */
1564 make_tree_vec_stat (int len MEM_STAT_DECL)
1567 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1569 #ifdef GATHER_STATISTICS
1570 tree_node_counts[(int) vec_kind]++;
1571 tree_node_sizes[(int) vec_kind] += length;
1574 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1576 memset (t, 0, length);
1578 TREE_SET_CODE (t, TREE_VEC);
1579 TREE_VEC_LENGTH (t) = len;
1584 /* Return 1 if EXPR is the integer constant zero or a complex constant
1588 integer_zerop (const_tree expr)
1592 return ((TREE_CODE (expr) == INTEGER_CST
1593 && TREE_INT_CST_LOW (expr) == 0
1594 && TREE_INT_CST_HIGH (expr) == 0)
1595 || (TREE_CODE (expr) == COMPLEX_CST
1596 && integer_zerop (TREE_REALPART (expr))
1597 && integer_zerop (TREE_IMAGPART (expr))));
1600 /* Return 1 if EXPR is the integer constant one or the corresponding
1601 complex constant. */
1604 integer_onep (const_tree expr)
1608 return ((TREE_CODE (expr) == INTEGER_CST
1609 && TREE_INT_CST_LOW (expr) == 1
1610 && TREE_INT_CST_HIGH (expr) == 0)
1611 || (TREE_CODE (expr) == COMPLEX_CST
1612 && integer_onep (TREE_REALPART (expr))
1613 && integer_zerop (TREE_IMAGPART (expr))));
1616 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1617 it contains. Likewise for the corresponding complex constant. */
1620 integer_all_onesp (const_tree expr)
1627 if (TREE_CODE (expr) == COMPLEX_CST
1628 && integer_all_onesp (TREE_REALPART (expr))
1629 && integer_zerop (TREE_IMAGPART (expr)))
1632 else if (TREE_CODE (expr) != INTEGER_CST)
1635 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1636 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1637 && TREE_INT_CST_HIGH (expr) == -1)
1642 /* Note that using TYPE_PRECISION here is wrong. We care about the
1643 actual bits, not the (arbitrary) range of the type. */
1644 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1645 if (prec >= HOST_BITS_PER_WIDE_INT)
1647 HOST_WIDE_INT high_value;
1650 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1652 /* Can not handle precisions greater than twice the host int size. */
1653 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1654 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1655 /* Shifting by the host word size is undefined according to the ANSI
1656 standard, so we must handle this as a special case. */
1659 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1661 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1662 && TREE_INT_CST_HIGH (expr) == high_value);
1665 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1668 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1672 integer_pow2p (const_tree expr)
1675 HOST_WIDE_INT high, low;
1679 if (TREE_CODE (expr) == COMPLEX_CST
1680 && integer_pow2p (TREE_REALPART (expr))
1681 && integer_zerop (TREE_IMAGPART (expr)))
1684 if (TREE_CODE (expr) != INTEGER_CST)
1687 prec = int_or_pointer_precision (TREE_TYPE (expr));
1688 high = TREE_INT_CST_HIGH (expr);
1689 low = TREE_INT_CST_LOW (expr);
1691 /* First clear all bits that are beyond the type's precision in case
1692 we've been sign extended. */
1694 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1696 else if (prec > HOST_BITS_PER_WIDE_INT)
1697 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1701 if (prec < HOST_BITS_PER_WIDE_INT)
1702 low &= ~((HOST_WIDE_INT) (-1) << prec);
1705 if (high == 0 && low == 0)
1708 return ((high == 0 && (low & (low - 1)) == 0)
1709 || (low == 0 && (high & (high - 1)) == 0));
1712 /* Return 1 if EXPR is an integer constant other than zero or a
1713 complex constant other than zero. */
1716 integer_nonzerop (const_tree expr)
1720 return ((TREE_CODE (expr) == INTEGER_CST
1721 && (TREE_INT_CST_LOW (expr) != 0
1722 || TREE_INT_CST_HIGH (expr) != 0))
1723 || (TREE_CODE (expr) == COMPLEX_CST
1724 && (integer_nonzerop (TREE_REALPART (expr))
1725 || integer_nonzerop (TREE_IMAGPART (expr)))));
1728 /* Return 1 if EXPR is the fixed-point constant zero. */
1731 fixed_zerop (const_tree expr)
1733 return (TREE_CODE (expr) == FIXED_CST
1734 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1737 /* Return the power of two represented by a tree node known to be a
1741 tree_log2 (const_tree expr)
1744 HOST_WIDE_INT high, low;
1748 if (TREE_CODE (expr) == COMPLEX_CST)
1749 return tree_log2 (TREE_REALPART (expr));
1751 prec = int_or_pointer_precision (TREE_TYPE (expr));
1752 high = TREE_INT_CST_HIGH (expr);
1753 low = TREE_INT_CST_LOW (expr);
1755 /* First clear all bits that are beyond the type's precision in case
1756 we've been sign extended. */
1758 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1760 else if (prec > HOST_BITS_PER_WIDE_INT)
1761 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1765 if (prec < HOST_BITS_PER_WIDE_INT)
1766 low &= ~((HOST_WIDE_INT) (-1) << prec);
1769 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1770 : exact_log2 (low));
1773 /* Similar, but return the largest integer Y such that 2 ** Y is less
1774 than or equal to EXPR. */
1777 tree_floor_log2 (const_tree expr)
1780 HOST_WIDE_INT high, low;
1784 if (TREE_CODE (expr) == COMPLEX_CST)
1785 return tree_log2 (TREE_REALPART (expr));
1787 prec = int_or_pointer_precision (TREE_TYPE (expr));
1788 high = TREE_INT_CST_HIGH (expr);
1789 low = TREE_INT_CST_LOW (expr);
1791 /* First clear all bits that are beyond the type's precision in case
1792 we've been sign extended. Ignore if type's precision hasn't been set
1793 since what we are doing is setting it. */
1795 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1797 else if (prec > HOST_BITS_PER_WIDE_INT)
1798 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1802 if (prec < HOST_BITS_PER_WIDE_INT)
1803 low &= ~((HOST_WIDE_INT) (-1) << prec);
1806 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1807 : floor_log2 (low));
1810 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1811 decimal float constants, so don't return 1 for them. */
1814 real_zerop (const_tree expr)
1818 return ((TREE_CODE (expr) == REAL_CST
1819 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1820 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1821 || (TREE_CODE (expr) == COMPLEX_CST
1822 && real_zerop (TREE_REALPART (expr))
1823 && real_zerop (TREE_IMAGPART (expr))));
1826 /* Return 1 if EXPR is the real constant one in real or complex form.
1827 Trailing zeroes matter for decimal float constants, so don't return
1831 real_onep (const_tree expr)
1835 return ((TREE_CODE (expr) == REAL_CST
1836 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1837 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1838 || (TREE_CODE (expr) == COMPLEX_CST
1839 && real_onep (TREE_REALPART (expr))
1840 && real_zerop (TREE_IMAGPART (expr))));
1843 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1844 for decimal float constants, so don't return 1 for them. */
1847 real_twop (const_tree expr)
1851 return ((TREE_CODE (expr) == REAL_CST
1852 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1853 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1854 || (TREE_CODE (expr) == COMPLEX_CST
1855 && real_twop (TREE_REALPART (expr))
1856 && real_zerop (TREE_IMAGPART (expr))));
1859 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1860 matter for decimal float constants, so don't return 1 for them. */
1863 real_minus_onep (const_tree expr)
1867 return ((TREE_CODE (expr) == REAL_CST
1868 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1869 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1870 || (TREE_CODE (expr) == COMPLEX_CST
1871 && real_minus_onep (TREE_REALPART (expr))
1872 && real_zerop (TREE_IMAGPART (expr))));
1875 /* Nonzero if EXP is a constant or a cast of a constant. */
1878 really_constant_p (const_tree exp)
1880 /* This is not quite the same as STRIP_NOPS. It does more. */
1881 while (CONVERT_EXPR_P (exp)
1882 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1883 exp = TREE_OPERAND (exp, 0);
1884 return TREE_CONSTANT (exp);
1887 /* Return first list element whose TREE_VALUE is ELEM.
1888 Return 0 if ELEM is not in LIST. */
1891 value_member (tree elem, tree list)
1895 if (elem == TREE_VALUE (list))
1897 list = TREE_CHAIN (list);
1902 /* Return first list element whose TREE_PURPOSE is ELEM.
1903 Return 0 if ELEM is not in LIST. */
1906 purpose_member (const_tree elem, tree list)
1910 if (elem == TREE_PURPOSE (list))
1912 list = TREE_CHAIN (list);
1917 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1921 chain_index (int idx, tree chain)
1923 for (; chain && idx > 0; --idx)
1924 chain = TREE_CHAIN (chain);
1928 /* Return nonzero if ELEM is part of the chain CHAIN. */
1931 chain_member (const_tree elem, const_tree chain)
1937 chain = TREE_CHAIN (chain);
1943 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1944 We expect a null pointer to mark the end of the chain.
1945 This is the Lisp primitive `length'. */
1948 list_length (const_tree t)
1951 #ifdef ENABLE_TREE_CHECKING
1959 #ifdef ENABLE_TREE_CHECKING
1962 gcc_assert (p != q);
1970 /* Returns the number of FIELD_DECLs in TYPE. */
1973 fields_length (const_tree type)
1975 tree t = TYPE_FIELDS (type);
1978 for (; t; t = TREE_CHAIN (t))
1979 if (TREE_CODE (t) == FIELD_DECL)
1985 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1986 by modifying the last node in chain 1 to point to chain 2.
1987 This is the Lisp primitive `nconc'. */
1990 chainon (tree op1, tree op2)
1999 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2001 TREE_CHAIN (t1) = op2;
2003 #ifdef ENABLE_TREE_CHECKING
2006 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2007 gcc_assert (t2 != t1);
2014 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2017 tree_last (tree chain)
2021 while ((next = TREE_CHAIN (chain)))
2026 /* Reverse the order of elements in the chain T,
2027 and return the new head of the chain (old last element). */
2032 tree prev = 0, decl, next;
2033 for (decl = t; decl; decl = next)
2035 next = TREE_CHAIN (decl);
2036 TREE_CHAIN (decl) = prev;
2042 /* Return a newly created TREE_LIST node whose
2043 purpose and value fields are PARM and VALUE. */
2046 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2048 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2049 TREE_PURPOSE (t) = parm;
2050 TREE_VALUE (t) = value;
2054 /* Build a chain of TREE_LIST nodes from a vector. */
2057 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2059 tree ret = NULL_TREE;
2063 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2065 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2066 pp = &TREE_CHAIN (*pp);
2071 /* Return a newly created TREE_LIST node whose
2072 purpose and value fields are PURPOSE and VALUE
2073 and whose TREE_CHAIN is CHAIN. */
2076 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2080 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2082 memset (node, 0, sizeof (struct tree_common));
2084 #ifdef GATHER_STATISTICS
2085 tree_node_counts[(int) x_kind]++;
2086 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2089 TREE_SET_CODE (node, TREE_LIST);
2090 TREE_CHAIN (node) = chain;
2091 TREE_PURPOSE (node) = purpose;
2092 TREE_VALUE (node) = value;
2096 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2099 ctor_to_list (tree ctor)
2101 tree list = NULL_TREE;
2106 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2108 *p = build_tree_list (purpose, val);
2109 p = &TREE_CHAIN (*p);
2115 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2119 ctor_to_vec (tree ctor)
2121 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2125 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2126 VEC_quick_push (tree, vec, val);
2131 /* Return the size nominally occupied by an object of type TYPE
2132 when it resides in memory. The value is measured in units of bytes,
2133 and its data type is that normally used for type sizes
2134 (which is the first type created by make_signed_type or
2135 make_unsigned_type). */
2138 size_in_bytes (const_tree type)
2142 if (type == error_mark_node)
2143 return integer_zero_node;
2145 type = TYPE_MAIN_VARIANT (type);
2146 t = TYPE_SIZE_UNIT (type);
2150 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2151 return size_zero_node;
2157 /* Return the size of TYPE (in bytes) as a wide integer
2158 or return -1 if the size can vary or is larger than an integer. */
2161 int_size_in_bytes (const_tree type)
2165 if (type == error_mark_node)
2168 type = TYPE_MAIN_VARIANT (type);
2169 t = TYPE_SIZE_UNIT (type);
2171 || TREE_CODE (t) != INTEGER_CST
2172 || TREE_INT_CST_HIGH (t) != 0
2173 /* If the result would appear negative, it's too big to represent. */
2174 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2177 return TREE_INT_CST_LOW (t);
2180 /* Return the maximum size of TYPE (in bytes) as a wide integer
2181 or return -1 if the size can vary or is larger than an integer. */
2184 max_int_size_in_bytes (const_tree type)
2186 HOST_WIDE_INT size = -1;
2189 /* If this is an array type, check for a possible MAX_SIZE attached. */
2191 if (TREE_CODE (type) == ARRAY_TYPE)
2193 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2195 if (size_tree && host_integerp (size_tree, 1))
2196 size = tree_low_cst (size_tree, 1);
2199 /* If we still haven't been able to get a size, see if the language
2200 can compute a maximum size. */
2204 size_tree = lang_hooks.types.max_size (type);
2206 if (size_tree && host_integerp (size_tree, 1))
2207 size = tree_low_cst (size_tree, 1);
2213 /* Returns a tree for the size of EXP in bytes. */
2216 tree_expr_size (const_tree exp)
2219 && DECL_SIZE_UNIT (exp) != 0)
2220 return DECL_SIZE_UNIT (exp);
2222 return size_in_bytes (TREE_TYPE (exp));
2225 /* Return the bit position of FIELD, in bits from the start of the record.
2226 This is a tree of type bitsizetype. */
2229 bit_position (const_tree field)
2231 return bit_from_pos (DECL_FIELD_OFFSET (field),
2232 DECL_FIELD_BIT_OFFSET (field));
2235 /* Likewise, but return as an integer. It must be representable in
2236 that way (since it could be a signed value, we don't have the
2237 option of returning -1 like int_size_in_byte can. */
2240 int_bit_position (const_tree field)
2242 return tree_low_cst (bit_position (field), 0);
2245 /* Return the byte position of FIELD, in bytes from the start of the record.
2246 This is a tree of type sizetype. */
2249 byte_position (const_tree field)
2251 return byte_from_pos (DECL_FIELD_OFFSET (field),
2252 DECL_FIELD_BIT_OFFSET (field));
2255 /* Likewise, but return as an integer. It must be representable in
2256 that way (since it could be a signed value, we don't have the
2257 option of returning -1 like int_size_in_byte can. */
2260 int_byte_position (const_tree field)
2262 return tree_low_cst (byte_position (field), 0);
2265 /* Return the strictest alignment, in bits, that T is known to have. */
2268 expr_align (const_tree t)
2270 unsigned int align0, align1;
2272 switch (TREE_CODE (t))
2274 CASE_CONVERT: case NON_LVALUE_EXPR:
2275 /* If we have conversions, we know that the alignment of the
2276 object must meet each of the alignments of the types. */
2277 align0 = expr_align (TREE_OPERAND (t, 0));
2278 align1 = TYPE_ALIGN (TREE_TYPE (t));
2279 return MAX (align0, align1);
2281 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2282 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2283 case CLEANUP_POINT_EXPR:
2284 /* These don't change the alignment of an object. */
2285 return expr_align (TREE_OPERAND (t, 0));
2288 /* The best we can do is say that the alignment is the least aligned
2290 align0 = expr_align (TREE_OPERAND (t, 1));
2291 align1 = expr_align (TREE_OPERAND (t, 2));
2292 return MIN (align0, align1);
2294 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2295 meaningfully, it's always 1. */
2296 case LABEL_DECL: case CONST_DECL:
2297 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2299 gcc_assert (DECL_ALIGN (t) != 0);
2300 return DECL_ALIGN (t);
2306 /* Otherwise take the alignment from that of the type. */
2307 return TYPE_ALIGN (TREE_TYPE (t));
2310 /* Return, as a tree node, the number of elements for TYPE (which is an
2311 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2314 array_type_nelts (const_tree type)
2316 tree index_type, min, max;
2318 /* If they did it with unspecified bounds, then we should have already
2319 given an error about it before we got here. */
2320 if (! TYPE_DOMAIN (type))
2321 return error_mark_node;
2323 index_type = TYPE_DOMAIN (type);
2324 min = TYPE_MIN_VALUE (index_type);
2325 max = TYPE_MAX_VALUE (index_type);
2327 return (integer_zerop (min)
2329 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2332 /* If arg is static -- a reference to an object in static storage -- then
2333 return the object. This is not the same as the C meaning of `static'.
2334 If arg isn't static, return NULL. */
2339 switch (TREE_CODE (arg))
2342 /* Nested functions are static, even though taking their address will
2343 involve a trampoline as we unnest the nested function and create
2344 the trampoline on the tree level. */
2348 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2349 && ! DECL_THREAD_LOCAL_P (arg)
2350 && ! DECL_DLLIMPORT_P (arg)
2354 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2358 return TREE_STATIC (arg) ? arg : NULL;
2365 /* If the thing being referenced is not a field, then it is
2366 something language specific. */
2367 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2369 /* If we are referencing a bitfield, we can't evaluate an
2370 ADDR_EXPR at compile time and so it isn't a constant. */
2371 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2374 return staticp (TREE_OPERAND (arg, 0));
2379 case MISALIGNED_INDIRECT_REF:
2380 case ALIGN_INDIRECT_REF:
2382 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2385 case ARRAY_RANGE_REF:
2386 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2387 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2388 return staticp (TREE_OPERAND (arg, 0));
2392 case COMPOUND_LITERAL_EXPR:
2393 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2403 /* Return whether OP is a DECL whose address is function-invariant. */
2406 decl_address_invariant_p (const_tree op)
2408 /* The conditions below are slightly less strict than the one in
2411 switch (TREE_CODE (op))
2420 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2421 && !DECL_DLLIMPORT_P (op))
2422 || DECL_THREAD_LOCAL_P (op)
2423 || DECL_CONTEXT (op) == current_function_decl
2424 || decl_function_context (op) == current_function_decl)
2429 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2430 || decl_function_context (op) == current_function_decl)
2441 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2444 decl_address_ip_invariant_p (const_tree op)
2446 /* The conditions below are slightly less strict than the one in
2449 switch (TREE_CODE (op))
2457 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2458 && !DECL_DLLIMPORT_P (op))
2459 || DECL_THREAD_LOCAL_P (op))
2464 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2476 /* Return true if T is function-invariant (internal function, does
2477 not handle arithmetic; that's handled in skip_simple_arithmetic and
2478 tree_invariant_p). */
2480 static bool tree_invariant_p (tree t);
2483 tree_invariant_p_1 (tree t)
2487 if (TREE_CONSTANT (t)
2488 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2491 switch (TREE_CODE (t))
2497 op = TREE_OPERAND (t, 0);
2498 while (handled_component_p (op))
2500 switch (TREE_CODE (op))
2503 case ARRAY_RANGE_REF:
2504 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2505 || TREE_OPERAND (op, 2) != NULL_TREE
2506 || TREE_OPERAND (op, 3) != NULL_TREE)
2511 if (TREE_OPERAND (op, 2) != NULL_TREE)
2517 op = TREE_OPERAND (op, 0);
2520 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2529 /* Return true if T is function-invariant. */
2532 tree_invariant_p (tree t)
2534 tree inner = skip_simple_arithmetic (t);
2535 return tree_invariant_p_1 (inner);
2538 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2539 Do this to any expression which may be used in more than one place,
2540 but must be evaluated only once.
2542 Normally, expand_expr would reevaluate the expression each time.
2543 Calling save_expr produces something that is evaluated and recorded
2544 the first time expand_expr is called on it. Subsequent calls to
2545 expand_expr just reuse the recorded value.
2547 The call to expand_expr that generates code that actually computes
2548 the value is the first call *at compile time*. Subsequent calls
2549 *at compile time* generate code to use the saved value.
2550 This produces correct result provided that *at run time* control
2551 always flows through the insns made by the first expand_expr
2552 before reaching the other places where the save_expr was evaluated.
2553 You, the caller of save_expr, must make sure this is so.
2555 Constants, and certain read-only nodes, are returned with no
2556 SAVE_EXPR because that is safe. Expressions containing placeholders
2557 are not touched; see tree.def for an explanation of what these
2561 save_expr (tree expr)
2563 tree t = fold (expr);
2566 /* If the tree evaluates to a constant, then we don't want to hide that
2567 fact (i.e. this allows further folding, and direct checks for constants).
2568 However, a read-only object that has side effects cannot be bypassed.
2569 Since it is no problem to reevaluate literals, we just return the
2571 inner = skip_simple_arithmetic (t);
2572 if (TREE_CODE (inner) == ERROR_MARK)
2575 if (tree_invariant_p_1 (inner))
2578 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2579 it means that the size or offset of some field of an object depends on
2580 the value within another field.
2582 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2583 and some variable since it would then need to be both evaluated once and
2584 evaluated more than once. Front-ends must assure this case cannot
2585 happen by surrounding any such subexpressions in their own SAVE_EXPR
2586 and forcing evaluation at the proper time. */
2587 if (contains_placeholder_p (inner))
2590 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2591 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2593 /* This expression might be placed ahead of a jump to ensure that the
2594 value was computed on both sides of the jump. So make sure it isn't
2595 eliminated as dead. */
2596 TREE_SIDE_EFFECTS (t) = 1;
2600 /* Look inside EXPR and into any simple arithmetic operations. Return
2601 the innermost non-arithmetic node. */
2604 skip_simple_arithmetic (tree expr)
2608 /* We don't care about whether this can be used as an lvalue in this
2610 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2611 expr = TREE_OPERAND (expr, 0);
2613 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2614 a constant, it will be more efficient to not make another SAVE_EXPR since
2615 it will allow better simplification and GCSE will be able to merge the
2616 computations if they actually occur. */
2620 if (UNARY_CLASS_P (inner))
2621 inner = TREE_OPERAND (inner, 0);
2622 else if (BINARY_CLASS_P (inner))
2624 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2625 inner = TREE_OPERAND (inner, 0);
2626 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2627 inner = TREE_OPERAND (inner, 1);
2639 /* Return which tree structure is used by T. */
2641 enum tree_node_structure_enum
2642 tree_node_structure (const_tree t)
2644 const enum tree_code code = TREE_CODE (t);
2645 return tree_node_structure_for_code (code);
2648 /* Set various status flags when building a CALL_EXPR object T. */
2651 process_call_operands (tree t)
2653 bool side_effects = TREE_SIDE_EFFECTS (t);
2654 bool read_only = false;
2655 int i = call_expr_flags (t);
2657 /* Calls have side-effects, except those to const or pure functions. */
2658 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2659 side_effects = true;
2660 /* Propagate TREE_READONLY of arguments for const functions. */
2664 if (!side_effects || read_only)
2665 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2667 tree op = TREE_OPERAND (t, i);
2668 if (op && TREE_SIDE_EFFECTS (op))
2669 side_effects = true;
2670 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2674 TREE_SIDE_EFFECTS (t) = side_effects;
2675 TREE_READONLY (t) = read_only;
2678 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2679 or offset that depends on a field within a record. */
2682 contains_placeholder_p (const_tree exp)
2684 enum tree_code code;
2689 code = TREE_CODE (exp);
2690 if (code == PLACEHOLDER_EXPR)
2693 switch (TREE_CODE_CLASS (code))
2696 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2697 position computations since they will be converted into a
2698 WITH_RECORD_EXPR involving the reference, which will assume
2699 here will be valid. */
2700 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2702 case tcc_exceptional:
2703 if (code == TREE_LIST)
2704 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2705 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2710 case tcc_comparison:
2711 case tcc_expression:
2715 /* Ignoring the first operand isn't quite right, but works best. */
2716 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2719 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2720 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2721 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2724 /* The save_expr function never wraps anything containing
2725 a PLACEHOLDER_EXPR. */
2732 switch (TREE_CODE_LENGTH (code))
2735 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2737 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2738 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2749 const_call_expr_arg_iterator iter;
2750 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2751 if (CONTAINS_PLACEHOLDER_P (arg))
2765 /* Return true if any part of the computation of TYPE involves a
2766 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2767 (for QUAL_UNION_TYPE) and field positions. */
2770 type_contains_placeholder_1 (const_tree type)
2772 /* If the size contains a placeholder or the parent type (component type in
2773 the case of arrays) type involves a placeholder, this type does. */
2774 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2775 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2776 || (TREE_TYPE (type) != 0
2777 && type_contains_placeholder_p (TREE_TYPE (type))))
2780 /* Now do type-specific checks. Note that the last part of the check above
2781 greatly limits what we have to do below. */
2782 switch (TREE_CODE (type))
2790 case REFERENCE_TYPE:
2798 case FIXED_POINT_TYPE:
2799 /* Here we just check the bounds. */
2800 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2801 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2804 /* We're already checked the component type (TREE_TYPE), so just check
2806 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2810 case QUAL_UNION_TYPE:
2814 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2815 if (TREE_CODE (field) == FIELD_DECL
2816 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2817 || (TREE_CODE (type) == QUAL_UNION_TYPE
2818 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2819 || type_contains_placeholder_p (TREE_TYPE (field))))
2831 type_contains_placeholder_p (tree type)
2835 /* If the contains_placeholder_bits field has been initialized,
2836 then we know the answer. */
2837 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2838 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2840 /* Indicate that we've seen this type node, and the answer is false.
2841 This is what we want to return if we run into recursion via fields. */
2842 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2844 /* Compute the real value. */
2845 result = type_contains_placeholder_1 (type);
2847 /* Store the real value. */
2848 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2853 /* Push tree EXP onto vector QUEUE if it is not already present. */
2856 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2861 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2862 if (simple_cst_equal (iter, exp) == 1)
2866 VEC_safe_push (tree, heap, *queue, exp);
2869 /* Given a tree EXP, find all occurences of references to fields
2870 in a PLACEHOLDER_EXPR and place them in vector REFS without
2871 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2872 we assume here that EXP contains only arithmetic expressions
2873 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2877 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2879 enum tree_code code = TREE_CODE (exp);
2883 /* We handle TREE_LIST and COMPONENT_REF separately. */
2884 if (code == TREE_LIST)
2886 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2887 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2889 else if (code == COMPONENT_REF)
2891 for (inner = TREE_OPERAND (exp, 0);
2892 REFERENCE_CLASS_P (inner);
2893 inner = TREE_OPERAND (inner, 0))
2896 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2897 push_without_duplicates (exp, refs);
2899 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2902 switch (TREE_CODE_CLASS (code))
2907 case tcc_declaration:
2908 /* Variables allocated to static storage can stay. */
2909 if (!TREE_STATIC (exp))
2910 push_without_duplicates (exp, refs);
2913 case tcc_expression:
2914 /* This is the pattern built in ada/make_aligning_type. */
2915 if (code == ADDR_EXPR
2916 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2918 push_without_duplicates (exp, refs);
2922 /* Fall through... */
2924 case tcc_exceptional:
2927 case tcc_comparison:
2929 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2930 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2934 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2935 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2943 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2944 return a tree with all occurrences of references to F in a
2945 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2946 CONST_DECLs. Note that we assume here that EXP contains only
2947 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2948 occurring only in their argument list. */
2951 substitute_in_expr (tree exp, tree f, tree r)
2953 enum tree_code code = TREE_CODE (exp);
2954 tree op0, op1, op2, op3;
2957 /* We handle TREE_LIST and COMPONENT_REF separately. */
2958 if (code == TREE_LIST)
2960 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2961 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2962 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2965 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2967 else if (code == COMPONENT_REF)
2971 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2972 and it is the right field, replace it with R. */
2973 for (inner = TREE_OPERAND (exp, 0);
2974 REFERENCE_CLASS_P (inner);
2975 inner = TREE_OPERAND (inner, 0))
2979 op1 = TREE_OPERAND (exp, 1);
2981 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2984 /* If this expression hasn't been completed let, leave it alone. */
2985 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2988 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2989 if (op0 == TREE_OPERAND (exp, 0))
2993 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
2996 switch (TREE_CODE_CLASS (code))
3001 case tcc_declaration:
3007 case tcc_expression:
3011 /* Fall through... */
3013 case tcc_exceptional:
3016 case tcc_comparison:
3018 switch (TREE_CODE_LENGTH (code))
3024 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3025 if (op0 == TREE_OPERAND (exp, 0))
3028 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3032 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3033 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3035 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3038 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3042 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3043 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3044 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3046 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3047 && op2 == TREE_OPERAND (exp, 2))
3050 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3054 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3055 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3056 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3057 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3059 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3060 && op2 == TREE_OPERAND (exp, 2)
3061 && op3 == TREE_OPERAND (exp, 3))
3065 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3077 new_tree = NULL_TREE;
3079 /* If we are trying to replace F with a constant, inline back
3080 functions which do nothing else than computing a value from
3081 the arguments they are passed. This makes it possible to
3082 fold partially or entirely the replacement expression. */
3083 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3085 tree t = maybe_inline_call_in_expr (exp);
3087 return SUBSTITUTE_IN_EXPR (t, f, r);
3090 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3092 tree op = TREE_OPERAND (exp, i);
3093 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3097 new_tree = copy_node (exp);
3098 TREE_OPERAND (new_tree, i) = new_op;
3104 new_tree = fold (new_tree);
3105 if (TREE_CODE (new_tree) == CALL_EXPR)
3106 process_call_operands (new_tree);
3117 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3121 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3122 for it within OBJ, a tree that is an object or a chain of references. */
3125 substitute_placeholder_in_expr (tree exp, tree obj)
3127 enum tree_code code = TREE_CODE (exp);
3128 tree op0, op1, op2, op3;
3131 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3132 in the chain of OBJ. */
3133 if (code == PLACEHOLDER_EXPR)
3135 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3138 for (elt = obj; elt != 0;
3139 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3140 || TREE_CODE (elt) == COND_EXPR)
3141 ? TREE_OPERAND (elt, 1)
3142 : (REFERENCE_CLASS_P (elt)
3143 || UNARY_CLASS_P (elt)
3144 || BINARY_CLASS_P (elt)
3145 || VL_EXP_CLASS_P (elt)
3146 || EXPRESSION_CLASS_P (elt))
3147 ? TREE_OPERAND (elt, 0) : 0))
3148 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3151 for (elt = obj; elt != 0;
3152 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3153 || TREE_CODE (elt) == COND_EXPR)
3154 ? TREE_OPERAND (elt, 1)
3155 : (REFERENCE_CLASS_P (elt)
3156 || UNARY_CLASS_P (elt)
3157 || BINARY_CLASS_P (elt)
3158 || VL_EXP_CLASS_P (elt)
3159 || EXPRESSION_CLASS_P (elt))
3160 ? TREE_OPERAND (elt, 0) : 0))
3161 if (POINTER_TYPE_P (TREE_TYPE (elt))
3162 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3164 return fold_build1 (INDIRECT_REF, need_type, elt);
3166 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3167 survives until RTL generation, there will be an error. */
3171 /* TREE_LIST is special because we need to look at TREE_VALUE
3172 and TREE_CHAIN, not TREE_OPERANDS. */
3173 else if (code == TREE_LIST)
3175 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3176 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3177 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3180 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3183 switch (TREE_CODE_CLASS (code))
3186 case tcc_declaration:
3189 case tcc_exceptional:
3192 case tcc_comparison:
3193 case tcc_expression:
3196 switch (TREE_CODE_LENGTH (code))
3202 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3203 if (op0 == TREE_OPERAND (exp, 0))
3206 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3210 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3211 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3213 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3216 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3220 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3221 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3222 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3224 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3225 && op2 == TREE_OPERAND (exp, 2))
3228 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3232 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3233 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3234 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3235 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3237 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3238 && op2 == TREE_OPERAND (exp, 2)
3239 && op3 == TREE_OPERAND (exp, 3))
3243 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3255 new_tree = NULL_TREE;
3257 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3259 tree op = TREE_OPERAND (exp, i);
3260 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3264 new_tree = copy_node (exp);
3265 TREE_OPERAND (new_tree, i) = new_op;
3271 new_tree = fold (new_tree);
3272 if (TREE_CODE (new_tree) == CALL_EXPR)
3273 process_call_operands (new_tree);
3284 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3288 /* Stabilize a reference so that we can use it any number of times
3289 without causing its operands to be evaluated more than once.
3290 Returns the stabilized reference. This works by means of save_expr,
3291 so see the caveats in the comments about save_expr.
3293 Also allows conversion expressions whose operands are references.
3294 Any other kind of expression is returned unchanged. */
3297 stabilize_reference (tree ref)
3300 enum tree_code code = TREE_CODE (ref);
3307 /* No action is needed in this case. */
3312 case FIX_TRUNC_EXPR:
3313 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3317 result = build_nt (INDIRECT_REF,
3318 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3322 result = build_nt (COMPONENT_REF,
3323 stabilize_reference (TREE_OPERAND (ref, 0)),
3324 TREE_OPERAND (ref, 1), NULL_TREE);
3328 result = build_nt (BIT_FIELD_REF,
3329 stabilize_reference (TREE_OPERAND (ref, 0)),
3330 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3331 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3335 result = build_nt (ARRAY_REF,
3336 stabilize_reference (TREE_OPERAND (ref, 0)),
3337 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3338 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3341 case ARRAY_RANGE_REF:
3342 result = build_nt (ARRAY_RANGE_REF,
3343 stabilize_reference (TREE_OPERAND (ref, 0)),
3344 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3345 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3349 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3350 it wouldn't be ignored. This matters when dealing with
3352 return stabilize_reference_1 (ref);
3354 /* If arg isn't a kind of lvalue we recognize, make no change.
3355 Caller should recognize the error for an invalid lvalue. */
3360 return error_mark_node;
3363 TREE_TYPE (result) = TREE_TYPE (ref);
3364 TREE_READONLY (result) = TREE_READONLY (ref);
3365 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3366 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3371 /* Subroutine of stabilize_reference; this is called for subtrees of
3372 references. Any expression with side-effects must be put in a SAVE_EXPR
3373 to ensure that it is only evaluated once.
3375 We don't put SAVE_EXPR nodes around everything, because assigning very
3376 simple expressions to temporaries causes us to miss good opportunities
3377 for optimizations. Among other things, the opportunity to fold in the
3378 addition of a constant into an addressing mode often gets lost, e.g.
3379 "y[i+1] += x;". In general, we take the approach that we should not make
3380 an assignment unless we are forced into it - i.e., that any non-side effect
3381 operator should be allowed, and that cse should take care of coalescing
3382 multiple utterances of the same expression should that prove fruitful. */
3385 stabilize_reference_1 (tree e)
3388 enum tree_code code = TREE_CODE (e);
3390 /* We cannot ignore const expressions because it might be a reference
3391 to a const array but whose index contains side-effects. But we can
3392 ignore things that are actual constant or that already have been
3393 handled by this function. */
3395 if (tree_invariant_p (e))
3398 switch (TREE_CODE_CLASS (code))
3400 case tcc_exceptional:
3402 case tcc_declaration:
3403 case tcc_comparison:
3405 case tcc_expression:
3408 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3409 so that it will only be evaluated once. */
3410 /* The reference (r) and comparison (<) classes could be handled as
3411 below, but it is generally faster to only evaluate them once. */
3412 if (TREE_SIDE_EFFECTS (e))
3413 return save_expr (e);
3417 /* Constants need no processing. In fact, we should never reach
3422 /* Division is slow and tends to be compiled with jumps,
3423 especially the division by powers of 2 that is often
3424 found inside of an array reference. So do it just once. */
3425 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3426 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3427 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3428 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3429 return save_expr (e);
3430 /* Recursively stabilize each operand. */
3431 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3432 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3436 /* Recursively stabilize each operand. */
3437 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3444 TREE_TYPE (result) = TREE_TYPE (e);
3445 TREE_READONLY (result) = TREE_READONLY (e);
3446 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3447 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3452 /* Low-level constructors for expressions. */
3454 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3455 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3458 recompute_tree_invariant_for_addr_expr (tree t)
3461 bool tc = true, se = false;
3463 /* We started out assuming this address is both invariant and constant, but
3464 does not have side effects. Now go down any handled components and see if
3465 any of them involve offsets that are either non-constant or non-invariant.
3466 Also check for side-effects.
3468 ??? Note that this code makes no attempt to deal with the case where
3469 taking the address of something causes a copy due to misalignment. */
3471 #define UPDATE_FLAGS(NODE) \
3472 do { tree _node = (NODE); \
3473 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3474 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3476 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3477 node = TREE_OPERAND (node, 0))
3479 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3480 array reference (probably made temporarily by the G++ front end),
3481 so ignore all the operands. */
3482 if ((TREE_CODE (node) == ARRAY_REF
3483 || TREE_CODE (node) == ARRAY_RANGE_REF)
3484 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3486 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3487 if (TREE_OPERAND (node, 2))
3488 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3489 if (TREE_OPERAND (node, 3))
3490 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3492 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3493 FIELD_DECL, apparently. The G++ front end can put something else
3494 there, at least temporarily. */
3495 else if (TREE_CODE (node) == COMPONENT_REF
3496 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3498 if (TREE_OPERAND (node, 2))
3499 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3501 else if (TREE_CODE (node) == BIT_FIELD_REF)
3502 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3505 node = lang_hooks.expr_to_decl (node, &tc, &se);
3507 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3508 the address, since &(*a)->b is a form of addition. If it's a constant, the
3509 address is constant too. If it's a decl, its address is constant if the
3510 decl is static. Everything else is not constant and, furthermore,
3511 taking the address of a volatile variable is not volatile. */
3512 if (TREE_CODE (node) == INDIRECT_REF)
3513 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3514 else if (CONSTANT_CLASS_P (node))
3516 else if (DECL_P (node))
3517 tc &= (staticp (node) != NULL_TREE);
3521 se |= TREE_SIDE_EFFECTS (node);
3525 TREE_CONSTANT (t) = tc;
3526 TREE_SIDE_EFFECTS (t) = se;
3530 /* Build an expression of code CODE, data type TYPE, and operands as
3531 specified. Expressions and reference nodes can be created this way.
3532 Constants, decls, types and misc nodes cannot be.
3534 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3535 enough for all extant tree codes. */
3538 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3542 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3544 t = make_node_stat (code PASS_MEM_STAT);
3551 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3553 int length = sizeof (struct tree_exp);
3554 #ifdef GATHER_STATISTICS
3555 tree_node_kind kind;
3559 #ifdef GATHER_STATISTICS
3560 switch (TREE_CODE_CLASS (code))
3562 case tcc_statement: /* an expression with side effects */
3565 case tcc_reference: /* a reference */
3573 tree_node_counts[(int) kind]++;
3574 tree_node_sizes[(int) kind] += length;
3577 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3579 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3581 memset (t, 0, sizeof (struct tree_common));
3583 TREE_SET_CODE (t, code);
3585 TREE_TYPE (t) = type;
3586 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3587 TREE_OPERAND (t, 0) = node;
3588 TREE_BLOCK (t) = NULL_TREE;
3589 if (node && !TYPE_P (node))
3591 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3592 TREE_READONLY (t) = TREE_READONLY (node);
3595 if (TREE_CODE_CLASS (code) == tcc_statement)
3596 TREE_SIDE_EFFECTS (t) = 1;
3600 /* All of these have side-effects, no matter what their
3602 TREE_SIDE_EFFECTS (t) = 1;
3603 TREE_READONLY (t) = 0;
3606 case MISALIGNED_INDIRECT_REF:
3607 case ALIGN_INDIRECT_REF:
3609 /* Whether a dereference is readonly has nothing to do with whether
3610 its operand is readonly. */
3611 TREE_READONLY (t) = 0;
3616 recompute_tree_invariant_for_addr_expr (t);
3620 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3621 && node && !TYPE_P (node)
3622 && TREE_CONSTANT (node))
3623 TREE_CONSTANT (t) = 1;
3624 if (TREE_CODE_CLASS (code) == tcc_reference
3625 && node && TREE_THIS_VOLATILE (node))
3626 TREE_THIS_VOLATILE (t) = 1;
3633 #define PROCESS_ARG(N) \
3635 TREE_OPERAND (t, N) = arg##N; \
3636 if (arg##N &&!TYPE_P (arg##N)) \
3638 if (TREE_SIDE_EFFECTS (arg##N)) \
3640 if (!TREE_READONLY (arg##N) \
3641 && !CONSTANT_CLASS_P (arg##N)) \
3643 if (!TREE_CONSTANT (arg##N)) \
3649 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3651 bool constant, read_only, side_effects;
3654 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3656 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3657 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3658 /* When sizetype precision doesn't match that of pointers
3659 we need to be able to build explicit extensions or truncations
3660 of the offset argument. */
3661 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3662 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3663 && TREE_CODE (arg1) == INTEGER_CST);
3665 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3666 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3667 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3668 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3670 t = make_node_stat (code PASS_MEM_STAT);
3673 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3674 result based on those same flags for the arguments. But if the
3675 arguments aren't really even `tree' expressions, we shouldn't be trying
3678 /* Expressions without side effects may be constant if their
3679 arguments are as well. */
3680 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3681 || TREE_CODE_CLASS (code) == tcc_binary);
3683 side_effects = TREE_SIDE_EFFECTS (t);
3688 TREE_READONLY (t) = read_only;
3689 TREE_CONSTANT (t) = constant;
3690 TREE_SIDE_EFFECTS (t) = side_effects;
3691 TREE_THIS_VOLATILE (t)
3692 = (TREE_CODE_CLASS (code) == tcc_reference
3693 && arg0 && TREE_THIS_VOLATILE (arg0));
3700 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3701 tree arg2 MEM_STAT_DECL)
3703 bool constant, read_only, side_effects;
3706 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3707 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3709 t = make_node_stat (code PASS_MEM_STAT);
3714 /* As a special exception, if COND_EXPR has NULL branches, we
3715 assume that it is a gimple statement and always consider
3716 it to have side effects. */
3717 if (code == COND_EXPR
3718 && tt == void_type_node
3719 && arg1 == NULL_TREE
3720 && arg2 == NULL_TREE)
3721 side_effects = true;
3723 side_effects = TREE_SIDE_EFFECTS (t);
3729 if (code == COND_EXPR)
3730 TREE_READONLY (t) = read_only;
3732 TREE_SIDE_EFFECTS (t) = side_effects;
3733 TREE_THIS_VOLATILE (t)
3734 = (TREE_CODE_CLASS (code) == tcc_reference
3735 && arg0 && TREE_THIS_VOLATILE (arg0));
3741 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3742 tree arg2, tree arg3 MEM_STAT_DECL)
3744 bool constant, read_only, side_effects;
3747 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3749 t = make_node_stat (code PASS_MEM_STAT);
3752 side_effects = TREE_SIDE_EFFECTS (t);
3759 TREE_SIDE_EFFECTS (t) = side_effects;
3760 TREE_THIS_VOLATILE (t)
3761 = (TREE_CODE_CLASS (code) == tcc_reference
3762 && arg0 && TREE_THIS_VOLATILE (arg0));
3768 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3769 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3771 bool constant, read_only, side_effects;
3774 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3776 t = make_node_stat (code PASS_MEM_STAT);
3779 side_effects = TREE_SIDE_EFFECTS (t);
3787 TREE_SIDE_EFFECTS (t) = side_effects;
3788 TREE_THIS_VOLATILE (t)
3789 = (TREE_CODE_CLASS (code) == tcc_reference
3790 && arg0 && TREE_THIS_VOLATILE (arg0));
3796 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3797 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3799 bool constant, read_only, side_effects;
3802 gcc_assert (code == TARGET_MEM_REF);
3804 t = make_node_stat (code PASS_MEM_STAT);
3807 side_effects = TREE_SIDE_EFFECTS (t);
3816 TREE_SIDE_EFFECTS (t) = side_effects;
3817 TREE_THIS_VOLATILE (t) = 0;
3822 /* Similar except don't specify the TREE_TYPE
3823 and leave the TREE_SIDE_EFFECTS as 0.
3824 It is permissible for arguments to be null,
3825 or even garbage if their values do not matter. */
3828 build_nt (enum tree_code code, ...)
3835 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3839 t = make_node (code);
3840 length = TREE_CODE_LENGTH (code);
3842 for (i = 0; i < length; i++)
3843 TREE_OPERAND (t, i) = va_arg (p, tree);
3849 /* Similar to build_nt, but for creating a CALL_EXPR object with
3850 ARGLIST passed as a list. */
3853 build_nt_call_list (tree fn, tree arglist)
3858 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3859 CALL_EXPR_FN (t) = fn;
3860 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3861 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3862 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3866 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3870 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3875 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3876 CALL_EXPR_FN (ret) = fn;
3877 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3878 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3879 CALL_EXPR_ARG (ret, ix) = t;
3883 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3884 We do NOT enter this node in any sort of symbol table.
3886 LOC is the location of the decl.
3888 layout_decl is used to set up the decl's storage layout.
3889 Other slots are initialized to 0 or null pointers. */
3892 build_decl_stat (location_t loc, enum tree_code code, tree name,
3893 tree type MEM_STAT_DECL)
3897 t = make_node_stat (code PASS_MEM_STAT);
3898 DECL_SOURCE_LOCATION (t) = loc;
3900 /* if (type == error_mark_node)
3901 type = integer_type_node; */
3902 /* That is not done, deliberately, so that having error_mark_node
3903 as the type can suppress useless errors in the use of this variable. */
3905 DECL_NAME (t) = name;
3906 TREE_TYPE (t) = type;
3908 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3914 /* Builds and returns function declaration with NAME and TYPE. */
3917 build_fn_decl (const char *name, tree type)
3919 tree id = get_identifier (name);
3920 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3922 DECL_EXTERNAL (decl) = 1;
3923 TREE_PUBLIC (decl) = 1;
3924 DECL_ARTIFICIAL (decl) = 1;
3925 TREE_NOTHROW (decl) = 1;
3931 /* BLOCK nodes are used to represent the structure of binding contours
3932 and declarations, once those contours have been exited and their contents
3933 compiled. This information is used for outputting debugging info. */
3936 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3938 tree block = make_node (BLOCK);
3940 BLOCK_VARS (block) = vars;
3941 BLOCK_SUBBLOCKS (block) = subblocks;
3942 BLOCK_SUPERCONTEXT (block) = supercontext;
3943 BLOCK_CHAIN (block) = chain;
3948 expand_location (source_location loc)
3950 expanded_location xloc;
3951 if (loc <= BUILTINS_LOCATION)
3953 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3960 const struct line_map *map = linemap_lookup (line_table, loc);
3961 xloc.file = map->to_file;
3962 xloc.line = SOURCE_LINE (map, loc);
3963 xloc.column = SOURCE_COLUMN (map, loc);
3964 xloc.sysp = map->sysp != 0;
3970 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3972 LOC is the location to use in tree T. */
3975 protected_set_expr_location (tree t, location_t loc)
3977 if (t && CAN_HAVE_LOCATION_P (t))
3978 SET_EXPR_LOCATION (t, loc);
3981 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3985 build_decl_attribute_variant (tree ddecl, tree attribute)
3987 DECL_ATTRIBUTES (ddecl) = attribute;
3991 /* Borrowed from hashtab.c iterative_hash implementation. */
3992 #define mix(a,b,c) \
3994 a -= b; a -= c; a ^= (c>>13); \
3995 b -= c; b -= a; b ^= (a<< 8); \
3996 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3997 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3998 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3999 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4000 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4001 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4002 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4006 /* Produce good hash value combining VAL and VAL2. */
4008 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4010 /* the golden ratio; an arbitrary value. */
4011 hashval_t a = 0x9e3779b9;
4017 /* Produce good hash value combining VAL and VAL2. */
4019 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4021 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4022 return iterative_hash_hashval_t (val, val2);
4025 hashval_t a = (hashval_t) val;
4026 /* Avoid warnings about shifting of more than the width of the type on
4027 hosts that won't execute this path. */
4029 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4031 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4033 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4034 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4041 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4042 is ATTRIBUTE and its qualifiers are QUALS.
4044 Record such modified types already made so we don't make duplicates. */
4047 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4049 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4051 hashval_t hashcode = 0;
4053 enum tree_code code = TREE_CODE (ttype);
4055 /* Building a distinct copy of a tagged type is inappropriate; it
4056 causes breakage in code that expects there to be a one-to-one
4057 relationship between a struct and its fields.
4058 build_duplicate_type is another solution (as used in
4059 handle_transparent_union_attribute), but that doesn't play well
4060 with the stronger C++ type identity model. */
4061 if (TREE_CODE (ttype) == RECORD_TYPE
4062 || TREE_CODE (ttype) == UNION_TYPE
4063 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4064 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4066 warning (OPT_Wattributes,
4067 "ignoring attributes applied to %qT after definition",
4068 TYPE_MAIN_VARIANT (ttype));
4069 return build_qualified_type (ttype, quals);
4072 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4073 ntype = build_distinct_type_copy (ttype);
4075 TYPE_ATTRIBUTES (ntype) = attribute;
4077 hashcode = iterative_hash_object (code, hashcode);
4078 if (TREE_TYPE (ntype))
4079 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4081 hashcode = attribute_hash_list (attribute, hashcode);
4083 switch (TREE_CODE (ntype))
4086 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4089 if (TYPE_DOMAIN (ntype))
4090 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4094 hashcode = iterative_hash_object
4095 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4096 hashcode = iterative_hash_object
4097 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4100 case FIXED_POINT_TYPE:
4102 unsigned int precision = TYPE_PRECISION (ntype);
4103 hashcode = iterative_hash_object (precision, hashcode);
4110 ntype = type_hash_canon (hashcode, ntype);
4112 /* If the target-dependent attributes make NTYPE different from
4113 its canonical type, we will need to use structural equality
4114 checks for this type. */
4115 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4116 || !targetm.comp_type_attributes (ntype, ttype))
4117 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4118 else if (TYPE_CANONICAL (ntype) == ntype)
4119 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4121 ttype = build_qualified_type (ntype, quals);
4123 else if (TYPE_QUALS (ttype) != quals)
4124 ttype = build_qualified_type (ttype, quals);
4130 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4133 Record such modified types already made so we don't make duplicates. */
4136 build_type_attribute_variant (tree ttype, tree attribute)
4138 return build_type_attribute_qual_variant (ttype, attribute,
4139 TYPE_QUALS (ttype));
4143 /* Reset all the fields in a binfo node BINFO. We only keep
4144 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4147 free_lang_data_in_binfo (tree binfo)
4152 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4154 BINFO_OFFSET (binfo) = NULL_TREE;
4155 BINFO_VTABLE (binfo) = NULL_TREE;
4156 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4157 BINFO_BASE_ACCESSES (binfo) = NULL;
4158 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4159 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4160 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4162 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4163 free_lang_data_in_binfo (t);
4167 /* Reset all language specific information still present in TYPE. */
4170 free_lang_data_in_type (tree type)
4172 gcc_assert (TYPE_P (type));
4174 /* Give the FE a chance to remove its own data first. */
4175 lang_hooks.free_lang_data (type);
4177 TREE_LANG_FLAG_0 (type) = 0;
4178 TREE_LANG_FLAG_1 (type) = 0;
4179 TREE_LANG_FLAG_2 (type) = 0;
4180 TREE_LANG_FLAG_3 (type) = 0;
4181 TREE_LANG_FLAG_4 (type) = 0;
4182 TREE_LANG_FLAG_5 (type) = 0;
4183 TREE_LANG_FLAG_6 (type) = 0;
4185 if (TREE_CODE (type) == FUNCTION_TYPE)
4187 /* Remove the const and volatile qualifiers from arguments. The
4188 C++ front end removes them, but the C front end does not,
4189 leading to false ODR violation errors when merging two
4190 instances of the same function signature compiled by
4191 different front ends. */
4194 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4196 tree arg_type = TREE_VALUE (p);
4198 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4200 int quals = TYPE_QUALS (arg_type)
4202 & ~TYPE_QUAL_VOLATILE;
4203 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4204 free_lang_data_in_type (TREE_VALUE (p));
4209 /* Remove members that are not actually FIELD_DECLs from the field
4210 list of an aggregate. These occur in C++. */
4211 if (RECORD_OR_UNION_TYPE_P (type))
4215 /* Note that TYPE_FIELDS can be shared across distinct
4216 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4217 to be removed, we cannot set its TREE_CHAIN to NULL.
4218 Otherwise, we would not be able to find all the other fields
4219 in the other instances of this TREE_TYPE.
4221 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4223 member = TYPE_FIELDS (type);
4226 if (TREE_CODE (member) == FIELD_DECL)
4229 TREE_CHAIN (prev) = member;
4231 TYPE_FIELDS (type) = member;
4235 member = TREE_CHAIN (member);
4239 TREE_CHAIN (prev) = NULL_TREE;
4241 TYPE_FIELDS (type) = NULL_TREE;
4243 TYPE_METHODS (type) = NULL_TREE;
4244 if (TYPE_BINFO (type))
4245 free_lang_data_in_binfo (TYPE_BINFO (type));
4249 /* For non-aggregate types, clear out the language slot (which
4250 overloads TYPE_BINFO). */
4251 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4254 TYPE_CONTEXT (type) = NULL_TREE;
4255 TYPE_STUB_DECL (type) = NULL_TREE;
4259 /* Return true if DECL may need an assembler name to be set. */
4262 need_assembler_name_p (tree decl)
4264 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4265 if (TREE_CODE (decl) != FUNCTION_DECL
4266 && TREE_CODE (decl) != VAR_DECL)
4269 /* If DECL already has its assembler name set, it does not need a
4271 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4272 || DECL_ASSEMBLER_NAME_SET_P (decl))
4275 /* For VAR_DECLs, only static, public and external symbols need an
4277 if (TREE_CODE (decl) == VAR_DECL
4278 && !TREE_STATIC (decl)
4279 && !TREE_PUBLIC (decl)
4280 && !DECL_EXTERNAL (decl))
4283 if (TREE_CODE (decl) == FUNCTION_DECL)
4285 /* Do not set assembler name on builtins. Allow RTL expansion to
4286 decide whether to expand inline or via a regular call. */
4287 if (DECL_BUILT_IN (decl)
4288 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4291 /* Functions represented in the callgraph need an assembler name. */
4292 if (cgraph_get_node (decl) != NULL)
4295 /* Unused and not public functions don't need an assembler name. */
4296 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4304 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4305 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4306 in BLOCK that is not in LOCALS is removed. */
4309 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4313 tp = &BLOCK_VARS (block);
4316 if (!pointer_set_contains (locals, *tp))
4317 *tp = TREE_CHAIN (*tp);
4319 tp = &TREE_CHAIN (*tp);
4322 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4323 free_lang_data_in_block (fn, t, locals);
4327 /* Reset all language specific information still present in symbol
4331 free_lang_data_in_decl (tree decl)
4333 gcc_assert (DECL_P (decl));
4335 /* Give the FE a chance to remove its own data first. */
4336 lang_hooks.free_lang_data (decl);
4338 TREE_LANG_FLAG_0 (decl) = 0;
4339 TREE_LANG_FLAG_1 (decl) = 0;
4340 TREE_LANG_FLAG_2 (decl) = 0;
4341 TREE_LANG_FLAG_3 (decl) = 0;
4342 TREE_LANG_FLAG_4 (decl) = 0;
4343 TREE_LANG_FLAG_5 (decl) = 0;
4344 TREE_LANG_FLAG_6 (decl) = 0;
4346 /* Identifiers need not have a type. */
4347 if (DECL_NAME (decl))
4348 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4350 /* Ignore any intervening types, because we are going to clear their
4351 TYPE_CONTEXT fields. */
4352 if (TREE_CODE (decl) != FIELD_DECL)
4353 DECL_CONTEXT (decl) = decl_function_context (decl);
4355 if (DECL_CONTEXT (decl)
4356 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4357 DECL_CONTEXT (decl) = NULL_TREE;
4359 if (TREE_CODE (decl) == VAR_DECL)
4361 tree context = DECL_CONTEXT (decl);
4365 enum tree_code code = TREE_CODE (context);
4366 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4368 /* Do not clear the decl context here, that will promote
4369 all vars to global ones. */
4370 DECL_INITIAL (decl) = NULL_TREE;
4373 if (TREE_STATIC (decl))
4374 DECL_CONTEXT (decl) = NULL_TREE;
4378 if (TREE_CODE (decl) == PARM_DECL
4379 || TREE_CODE (decl) == FIELD_DECL
4380 || TREE_CODE (decl) == RESULT_DECL)
4382 tree unit_size = DECL_SIZE_UNIT (decl);
4383 tree size = DECL_SIZE (decl);
4384 if ((unit_size && TREE_CODE (unit_size) != INTEGER_CST)
4385 || (size && TREE_CODE (size) != INTEGER_CST))
4387 DECL_SIZE_UNIT (decl) = NULL_TREE;
4388 DECL_SIZE (decl) = NULL_TREE;
4391 if (TREE_CODE (decl) == FIELD_DECL
4392 && DECL_FIELD_OFFSET (decl)
4393 && TREE_CODE (DECL_FIELD_OFFSET (decl)) != INTEGER_CST)
4394 DECL_FIELD_OFFSET (decl) = NULL_TREE;
4396 /* DECL_FCONTEXT is only used for debug info generation. */
4397 if (TREE_CODE (decl) == FIELD_DECL)
4398 DECL_FCONTEXT (decl) = NULL_TREE;
4400 else if (TREE_CODE (decl) == FUNCTION_DECL)
4402 if (gimple_has_body_p (decl))
4405 struct pointer_set_t *locals;
4407 /* If DECL has a gimple body, then the context for its
4408 arguments must be DECL. Otherwise, it doesn't really
4409 matter, as we will not be emitting any code for DECL. In
4410 general, there may be other instances of DECL created by
4411 the front end and since PARM_DECLs are generally shared,
4412 their DECL_CONTEXT changes as the replicas of DECL are
4413 created. The only time where DECL_CONTEXT is important
4414 is for the FUNCTION_DECLs that have a gimple body (since
4415 the PARM_DECL will be used in the function's body). */
4416 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4417 DECL_CONTEXT (t) = decl;
4419 /* Collect all the symbols declared in DECL. */
4420 locals = pointer_set_create ();
4421 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4422 for (; t; t = TREE_CHAIN (t))
4424 pointer_set_insert (locals, TREE_VALUE (t));
4426 /* All the local symbols should have DECL as their
4428 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4431 /* Get rid of any decl not in local_decls. */
4432 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4434 pointer_set_destroy (locals);
4437 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4438 At this point, it is not needed anymore. */
4439 DECL_SAVED_TREE (decl) = NULL_TREE;
4441 else if (TREE_CODE (decl) == VAR_DECL)
4443 tree expr = DECL_DEBUG_EXPR (decl);
4445 && TREE_CODE (expr) == VAR_DECL
4446 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4447 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4449 if (DECL_EXTERNAL (decl)
4450 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4451 DECL_INITIAL (decl) = NULL_TREE;
4453 else if (TREE_CODE (decl) == TYPE_DECL)
4455 DECL_INITIAL (decl) = NULL_TREE;
4457 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4458 FIELD_DECLs, which should be preserved. Otherwise,
4459 we shouldn't be concerned with source-level lexical
4460 nesting beyond this point. */
4461 DECL_CONTEXT (decl) = NULL_TREE;
4466 /* Data used when collecting DECLs and TYPEs for language data removal. */
4468 struct free_lang_data_d
4470 /* Worklist to avoid excessive recursion. */
4471 VEC(tree,heap) *worklist;
4473 /* Set of traversed objects. Used to avoid duplicate visits. */
4474 struct pointer_set_t *pset;
4476 /* Array of symbols to process with free_lang_data_in_decl. */
4477 VEC(tree,heap) *decls;
4479 /* Array of types to process with free_lang_data_in_type. */
4480 VEC(tree,heap) *types;
4484 /* Save all language fields needed to generate proper debug information
4485 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4488 save_debug_info_for_decl (tree t)
4490 /*struct saved_debug_info_d *sdi;*/
4492 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4494 /* FIXME. Partial implementation for saving debug info removed. */
4498 /* Save all language fields needed to generate proper debug information
4499 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4502 save_debug_info_for_type (tree t)
4504 /*struct saved_debug_info_d *sdi;*/
4506 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4508 /* FIXME. Partial implementation for saving debug info removed. */
4512 /* Add type or decl T to one of the list of tree nodes that need their
4513 language data removed. The lists are held inside FLD. */
4516 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4520 VEC_safe_push (tree, heap, fld->decls, t);
4521 if (debug_info_level > DINFO_LEVEL_TERSE)
4522 save_debug_info_for_decl (t);
4524 else if (TYPE_P (t))
4526 VEC_safe_push (tree, heap, fld->types, t);
4527 if (debug_info_level > DINFO_LEVEL_TERSE)
4528 save_debug_info_for_type (t);
4534 /* Push tree node T into FLD->WORKLIST. */
4537 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4539 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4540 VEC_safe_push (tree, heap, fld->worklist, (t));
4544 /* Operand callback helper for free_lang_data_in_node. *TP is the
4545 subtree operand being considered. */
4548 find_decls_types_r (tree *tp, int *ws, void *data)
4551 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4553 if (TREE_CODE (t) == TREE_LIST)
4556 /* Language specific nodes will be removed, so there is no need
4557 to gather anything under them. */
4558 if (is_lang_specific (t))
4566 /* Note that walk_tree does not traverse every possible field in
4567 decls, so we have to do our own traversals here. */
4568 add_tree_to_fld_list (t, fld);
4570 fld_worklist_push (DECL_NAME (t), fld);
4571 fld_worklist_push (DECL_CONTEXT (t), fld);
4572 fld_worklist_push (DECL_SIZE (t), fld);
4573 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4575 /* We are going to remove everything under DECL_INITIAL for
4576 TYPE_DECLs. No point walking them. */
4577 if (TREE_CODE (t) != TYPE_DECL)
4578 fld_worklist_push (DECL_INITIAL (t), fld);
4580 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4581 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4583 if (TREE_CODE (t) == FUNCTION_DECL)
4585 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4586 fld_worklist_push (DECL_RESULT (t), fld);
4588 else if (TREE_CODE (t) == TYPE_DECL)
4590 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4591 fld_worklist_push (DECL_VINDEX (t), fld);
4593 else if (TREE_CODE (t) == FIELD_DECL)
4595 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4596 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4597 fld_worklist_push (DECL_QUALIFIER (t), fld);
4598 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4599 fld_worklist_push (DECL_FCONTEXT (t), fld);
4601 else if (TREE_CODE (t) == VAR_DECL)
4603 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4604 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4607 if (TREE_CODE (t) != FIELD_DECL)
4608 fld_worklist_push (TREE_CHAIN (t), fld);
4611 else if (TYPE_P (t))
4613 /* Note that walk_tree does not traverse every possible field in
4614 types, so we have to do our own traversals here. */
4615 add_tree_to_fld_list (t, fld);
4617 if (!RECORD_OR_UNION_TYPE_P (t))
4618 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4619 fld_worklist_push (TYPE_SIZE (t), fld);
4620 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4621 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4622 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4623 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4624 fld_worklist_push (TYPE_NAME (t), fld);
4625 fld_worklist_push (TYPE_MINVAL (t), fld);
4626 if (!RECORD_OR_UNION_TYPE_P (t))
4627 fld_worklist_push (TYPE_MAXVAL (t), fld);
4628 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4629 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4630 fld_worklist_push (TYPE_CONTEXT (t), fld);
4631 fld_worklist_push (TYPE_CANONICAL (t), fld);
4633 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4637 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4639 fld_worklist_push (TREE_TYPE (tem), fld);
4640 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4642 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4643 && TREE_CODE (tem) == TREE_LIST)
4646 fld_worklist_push (TREE_VALUE (tem), fld);
4647 tem = TREE_CHAIN (tem);
4651 if (RECORD_OR_UNION_TYPE_P (t))
4654 /* Push all TYPE_FIELDS - there can be interleaving interesting
4655 and non-interesting things. */
4656 tem = TYPE_FIELDS (t);
4659 if (TREE_CODE (tem) == FIELD_DECL)
4660 fld_worklist_push (tem, fld);
4661 tem = TREE_CHAIN (tem);
4665 fld_worklist_push (TREE_CHAIN (t), fld);
4669 fld_worklist_push (TREE_TYPE (t), fld);
4675 /* Find decls and types in T. */
4678 find_decls_types (tree t, struct free_lang_data_d *fld)
4682 if (!pointer_set_contains (fld->pset, t))
4683 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4684 if (VEC_empty (tree, fld->worklist))
4686 t = VEC_pop (tree, fld->worklist);
4690 /* Translate all the types in LIST with the corresponding runtime
4694 get_eh_types_for_runtime (tree list)
4698 if (list == NULL_TREE)
4701 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4703 list = TREE_CHAIN (list);
4706 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4707 TREE_CHAIN (prev) = n;
4708 prev = TREE_CHAIN (prev);
4709 list = TREE_CHAIN (list);
4716 /* Find decls and types referenced in EH region R and store them in
4717 FLD->DECLS and FLD->TYPES. */
4720 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4731 /* The types referenced in each catch must first be changed to the
4732 EH types used at runtime. This removes references to FE types
4734 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4736 c->type_list = get_eh_types_for_runtime (c->type_list);
4737 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4742 case ERT_ALLOWED_EXCEPTIONS:
4743 r->u.allowed.type_list
4744 = get_eh_types_for_runtime (r->u.allowed.type_list);
4745 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4748 case ERT_MUST_NOT_THROW:
4749 walk_tree (&r->u.must_not_throw.failure_decl,
4750 find_decls_types_r, fld, fld->pset);
4756 /* Find decls and types referenced in cgraph node N and store them in
4757 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4758 look for *every* kind of DECL and TYPE node reachable from N,
4759 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4760 NAMESPACE_DECLs, etc). */
4763 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4766 struct function *fn;
4769 find_decls_types (n->decl, fld);
4771 if (!gimple_has_body_p (n->decl))
4774 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4776 fn = DECL_STRUCT_FUNCTION (n->decl);
4778 /* Traverse locals. */
4779 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4780 find_decls_types (TREE_VALUE (t), fld);
4782 /* Traverse EH regions in FN. */
4785 FOR_ALL_EH_REGION_FN (r, fn)
4786 find_decls_types_in_eh_region (r, fld);
4789 /* Traverse every statement in FN. */
4790 FOR_EACH_BB_FN (bb, fn)
4792 gimple_stmt_iterator si;
4795 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4797 gimple phi = gsi_stmt (si);
4799 for (i = 0; i < gimple_phi_num_args (phi); i++)
4801 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4802 find_decls_types (*arg_p, fld);
4806 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4808 gimple stmt = gsi_stmt (si);
4810 for (i = 0; i < gimple_num_ops (stmt); i++)
4812 tree arg = gimple_op (stmt, i);
4813 find_decls_types (arg, fld);
4820 /* Find decls and types referenced in varpool node N and store them in
4821 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4822 look for *every* kind of DECL and TYPE node reachable from N,
4823 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4824 NAMESPACE_DECLs, etc). */
4827 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4829 find_decls_types (v->decl, fld);
4833 /* Free language specific information for every operand and expression
4834 in every node of the call graph. This process operates in three stages:
4836 1- Every callgraph node and varpool node is traversed looking for
4837 decls and types embedded in them. This is a more exhaustive
4838 search than that done by find_referenced_vars, because it will
4839 also collect individual fields, decls embedded in types, etc.
4841 2- All the decls found are sent to free_lang_data_in_decl.
4843 3- All the types found are sent to free_lang_data_in_type.
4845 The ordering between decls and types is important because
4846 free_lang_data_in_decl sets assembler names, which includes
4847 mangling. So types cannot be freed up until assembler names have
4851 free_lang_data_in_cgraph (void)
4853 struct cgraph_node *n;
4854 struct varpool_node *v;
4855 struct free_lang_data_d fld;
4860 /* Initialize sets and arrays to store referenced decls and types. */
4861 fld.pset = pointer_set_create ();
4862 fld.worklist = NULL;
4863 fld.decls = VEC_alloc (tree, heap, 100);
4864 fld.types = VEC_alloc (tree, heap, 100);
4866 /* Find decls and types in the body of every function in the callgraph. */
4867 for (n = cgraph_nodes; n; n = n->next)
4868 find_decls_types_in_node (n, &fld);
4870 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4871 find_decls_types (p->decl, &fld);
4873 /* Find decls and types in every varpool symbol. */
4874 for (v = varpool_nodes_queue; v; v = v->next_needed)
4875 find_decls_types_in_var (v, &fld);
4877 /* Set the assembler name on every decl found. We need to do this
4878 now because free_lang_data_in_decl will invalidate data needed
4879 for mangling. This breaks mangling on interdependent decls. */
4880 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4881 if (need_assembler_name_p (t))
4883 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4884 diagnostics that use input_location to show locus
4885 information. The problem here is that, at this point,
4886 input_location is generally anchored to the end of the file
4887 (since the parser is long gone), so we don't have a good
4888 position to pin it to.
4890 To alleviate this problem, this uses the location of T's
4891 declaration. Examples of this are
4892 testsuite/g++.dg/template/cond2.C and
4893 testsuite/g++.dg/template/pr35240.C. */
4894 location_t saved_location = input_location;
4895 input_location = DECL_SOURCE_LOCATION (t);
4897 decl_assembler_name (t);
4899 input_location = saved_location;
4902 /* Traverse every decl found freeing its language data. */
4903 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4904 free_lang_data_in_decl (t);
4906 /* Traverse every type found freeing its language data. */
4907 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4908 free_lang_data_in_type (t);
4910 pointer_set_destroy (fld.pset);
4911 VEC_free (tree, heap, fld.worklist);
4912 VEC_free (tree, heap, fld.decls);
4913 VEC_free (tree, heap, fld.types);
4917 /* Free resources that are used by FE but are not needed once they are done. */
4920 free_lang_data (void)
4924 /* If we are the LTO frontend we have freed lang-specific data already. */
4928 /* Allocate and assign alias sets to the standard integer types
4929 while the slots are still in the way the frontends generated them. */
4930 for (i = 0; i < itk_none; ++i)
4931 if (integer_types[i])
4932 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
4934 /* FIXME. Remove after save_debug_info is working. */
4935 if (!(flag_generate_lto
4936 || (!flag_gtoggle && debug_info_level <= DINFO_LEVEL_TERSE)))
4939 /* Traverse the IL resetting language specific information for
4940 operands, expressions, etc. */
4941 free_lang_data_in_cgraph ();
4943 /* Create gimple variants for common types. */
4944 ptrdiff_type_node = integer_type_node;
4945 fileptr_type_node = ptr_type_node;
4946 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4947 || (TYPE_MODE (boolean_type_node)
4948 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4949 || TYPE_PRECISION (boolean_type_node) != 1
4950 || !TYPE_UNSIGNED (boolean_type_node))
4952 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4953 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4954 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4955 TYPE_PRECISION (boolean_type_node) = 1;
4956 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4957 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4960 /* Unify char_type_node with its properly signed variant. */
4961 if (TYPE_UNSIGNED (char_type_node))
4962 unsigned_char_type_node = char_type_node;
4964 signed_char_type_node = char_type_node;
4966 /* Reset some langhooks. Do not reset types_compatible_p, it may
4967 still be used indirectly via the get_alias_set langhook. */
4968 lang_hooks.callgraph.analyze_expr = NULL;
4969 lang_hooks.dwarf_name = lhd_dwarf_name;
4970 lang_hooks.decl_printable_name = gimple_decl_printable_name;
4971 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
4972 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
4974 /* Reset diagnostic machinery. */
4975 diagnostic_starter (global_dc) = default_diagnostic_starter;
4976 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
4977 diagnostic_format_decoder (global_dc) = default_tree_printer;
4979 /* FIXME. We remove sufficient language data that the debug
4980 info writer gets completely confused. Disable debug information
4982 debug_info_level = DINFO_LEVEL_NONE;
4983 write_symbols = NO_DEBUG;
4984 debug_hooks = &do_nothing_debug_hooks;
4990 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
4994 "*free_lang_data", /* name */
4996 free_lang_data, /* execute */
4999 0, /* static_pass_number */
5000 TV_IPA_FREE_LANG_DATA, /* tv_id */
5001 0, /* properties_required */
5002 0, /* properties_provided */
5003 0, /* properties_destroyed */
5004 0, /* todo_flags_start */
5005 TODO_ggc_collect /* todo_flags_finish */
5009 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5012 We try both `text' and `__text__', ATTR may be either one. */
5013 /* ??? It might be a reasonable simplification to require ATTR to be only
5014 `text'. One might then also require attribute lists to be stored in
5015 their canonicalized form. */
5018 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5023 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5026 p = IDENTIFIER_POINTER (ident);
5027 ident_len = IDENTIFIER_LENGTH (ident);
5029 if (ident_len == attr_len
5030 && strcmp (attr, p) == 0)
5033 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5036 gcc_assert (attr[1] == '_');
5037 gcc_assert (attr[attr_len - 2] == '_');
5038 gcc_assert (attr[attr_len - 1] == '_');
5039 if (ident_len == attr_len - 4
5040 && strncmp (attr + 2, p, attr_len - 4) == 0)
5045 if (ident_len == attr_len + 4
5046 && p[0] == '_' && p[1] == '_'
5047 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5048 && strncmp (attr, p + 2, attr_len) == 0)
5055 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5058 We try both `text' and `__text__', ATTR may be either one. */
5061 is_attribute_p (const char *attr, const_tree ident)
5063 return is_attribute_with_length_p (attr, strlen (attr), ident);
5066 /* Given an attribute name and a list of attributes, return a pointer to the
5067 attribute's list element if the attribute is part of the list, or NULL_TREE
5068 if not found. If the attribute appears more than once, this only
5069 returns the first occurrence; the TREE_CHAIN of the return value should
5070 be passed back in if further occurrences are wanted. */
5073 lookup_attribute (const char *attr_name, tree list)
5076 size_t attr_len = strlen (attr_name);
5078 for (l = list; l; l = TREE_CHAIN (l))
5080 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5081 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5087 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5091 remove_attribute (const char *attr_name, tree list)
5094 size_t attr_len = strlen (attr_name);
5096 for (p = &list; *p; )
5099 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5100 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5101 *p = TREE_CHAIN (l);
5103 p = &TREE_CHAIN (l);
5109 /* Return an attribute list that is the union of a1 and a2. */
5112 merge_attributes (tree a1, tree a2)
5116 /* Either one unset? Take the set one. */
5118 if ((attributes = a1) == 0)
5121 /* One that completely contains the other? Take it. */
5123 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5125 if (attribute_list_contained (a2, a1))
5129 /* Pick the longest list, and hang on the other list. */
5131 if (list_length (a1) < list_length (a2))
5132 attributes = a2, a2 = a1;
5134 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5137 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5140 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5143 if (TREE_VALUE (a) != NULL
5144 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5145 && TREE_VALUE (a2) != NULL
5146 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5148 if (simple_cst_list_equal (TREE_VALUE (a),
5149 TREE_VALUE (a2)) == 1)
5152 else if (simple_cst_equal (TREE_VALUE (a),
5153 TREE_VALUE (a2)) == 1)
5158 a1 = copy_node (a2);
5159 TREE_CHAIN (a1) = attributes;
5168 /* Given types T1 and T2, merge their attributes and return
5172 merge_type_attributes (tree t1, tree t2)
5174 return merge_attributes (TYPE_ATTRIBUTES (t1),
5175 TYPE_ATTRIBUTES (t2));
5178 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5182 merge_decl_attributes (tree olddecl, tree newdecl)
5184 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5185 DECL_ATTRIBUTES (newdecl));
5188 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5190 /* Specialization of merge_decl_attributes for various Windows targets.
5192 This handles the following situation:
5194 __declspec (dllimport) int foo;
5197 The second instance of `foo' nullifies the dllimport. */
5200 merge_dllimport_decl_attributes (tree old, tree new_tree)
5203 int delete_dllimport_p = 1;
5205 /* What we need to do here is remove from `old' dllimport if it doesn't
5206 appear in `new'. dllimport behaves like extern: if a declaration is
5207 marked dllimport and a definition appears later, then the object
5208 is not dllimport'd. We also remove a `new' dllimport if the old list
5209 contains dllexport: dllexport always overrides dllimport, regardless
5210 of the order of declaration. */
5211 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5212 delete_dllimport_p = 0;
5213 else if (DECL_DLLIMPORT_P (new_tree)
5214 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5216 DECL_DLLIMPORT_P (new_tree) = 0;
5217 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5218 "dllimport ignored", new_tree);
5220 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5222 /* Warn about overriding a symbol that has already been used, e.g.:
5223 extern int __attribute__ ((dllimport)) foo;
5224 int* bar () {return &foo;}
5227 if (TREE_USED (old))
5229 warning (0, "%q+D redeclared without dllimport attribute "
5230 "after being referenced with dll linkage", new_tree);
5231 /* If we have used a variable's address with dllimport linkage,
5232 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5233 decl may already have had TREE_CONSTANT computed.
5234 We still remove the attribute so that assembler code refers
5235 to '&foo rather than '_imp__foo'. */
5236 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5237 DECL_DLLIMPORT_P (new_tree) = 1;
5240 /* Let an inline definition silently override the external reference,
5241 but otherwise warn about attribute inconsistency. */
5242 else if (TREE_CODE (new_tree) == VAR_DECL
5243 || !DECL_DECLARED_INLINE_P (new_tree))
5244 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5245 "previous dllimport ignored", new_tree);
5248 delete_dllimport_p = 0;
5250 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5252 if (delete_dllimport_p)
5255 const size_t attr_len = strlen ("dllimport");
5257 /* Scan the list for dllimport and delete it. */
5258 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5260 if (is_attribute_with_length_p ("dllimport", attr_len,
5263 if (prev == NULL_TREE)
5266 TREE_CHAIN (prev) = TREE_CHAIN (t);
5275 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5276 struct attribute_spec.handler. */
5279 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5285 /* These attributes may apply to structure and union types being created,
5286 but otherwise should pass to the declaration involved. */
5289 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5290 | (int) ATTR_FLAG_ARRAY_NEXT))
5292 *no_add_attrs = true;
5293 return tree_cons (name, args, NULL_TREE);
5295 if (TREE_CODE (node) == RECORD_TYPE
5296 || TREE_CODE (node) == UNION_TYPE)
5298 node = TYPE_NAME (node);
5304 warning (OPT_Wattributes, "%qE attribute ignored",
5306 *no_add_attrs = true;
5311 if (TREE_CODE (node) != FUNCTION_DECL
5312 && TREE_CODE (node) != VAR_DECL
5313 && TREE_CODE (node) != TYPE_DECL)
5315 *no_add_attrs = true;
5316 warning (OPT_Wattributes, "%qE attribute ignored",
5321 if (TREE_CODE (node) == TYPE_DECL
5322 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5323 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5325 *no_add_attrs = true;
5326 warning (OPT_Wattributes, "%qE attribute ignored",
5331 is_dllimport = is_attribute_p ("dllimport", name);
5333 /* Report error on dllimport ambiguities seen now before they cause
5337 /* Honor any target-specific overrides. */
5338 if (!targetm.valid_dllimport_attribute_p (node))
5339 *no_add_attrs = true;
5341 else if (TREE_CODE (node) == FUNCTION_DECL
5342 && DECL_DECLARED_INLINE_P (node))
5344 warning (OPT_Wattributes, "inline function %q+D declared as "
5345 " dllimport: attribute ignored", node);
5346 *no_add_attrs = true;
5348 /* Like MS, treat definition of dllimported variables and
5349 non-inlined functions on declaration as syntax errors. */
5350 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5352 error ("function %q+D definition is marked dllimport", node);
5353 *no_add_attrs = true;
5356 else if (TREE_CODE (node) == VAR_DECL)
5358 if (DECL_INITIAL (node))
5360 error ("variable %q+D definition is marked dllimport",
5362 *no_add_attrs = true;
5365 /* `extern' needn't be specified with dllimport.
5366 Specify `extern' now and hope for the best. Sigh. */
5367 DECL_EXTERNAL (node) = 1;
5368 /* Also, implicitly give dllimport'd variables declared within
5369 a function global scope, unless declared static. */
5370 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5371 TREE_PUBLIC (node) = 1;
5374 if (*no_add_attrs == false)
5375 DECL_DLLIMPORT_P (node) = 1;
5377 else if (TREE_CODE (node) == FUNCTION_DECL
5378 && DECL_DECLARED_INLINE_P (node))
5379 /* An exported function, even if inline, must be emitted. */
5380 DECL_EXTERNAL (node) = 0;
5382 /* Report error if symbol is not accessible at global scope. */
5383 if (!TREE_PUBLIC (node)
5384 && (TREE_CODE (node) == VAR_DECL
5385 || TREE_CODE (node) == FUNCTION_DECL))
5387 error ("external linkage required for symbol %q+D because of "
5388 "%qE attribute", node, name);
5389 *no_add_attrs = true;
5392 /* A dllexport'd entity must have default visibility so that other
5393 program units (shared libraries or the main executable) can see
5394 it. A dllimport'd entity must have default visibility so that
5395 the linker knows that undefined references within this program
5396 unit can be resolved by the dynamic linker. */
5399 if (DECL_VISIBILITY_SPECIFIED (node)
5400 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5401 error ("%qE implies default visibility, but %qD has already "
5402 "been declared with a different visibility",
5404 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5405 DECL_VISIBILITY_SPECIFIED (node) = 1;
5411 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5413 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5414 of the various TYPE_QUAL values. */
5417 set_type_quals (tree type, int type_quals)
5419 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5420 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5421 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5422 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5425 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5428 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5430 return (TYPE_QUALS (cand) == type_quals
5431 && TYPE_NAME (cand) == TYPE_NAME (base)
5432 /* Apparently this is needed for Objective-C. */
5433 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5434 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5435 TYPE_ATTRIBUTES (base)));
5438 /* Return a version of the TYPE, qualified as indicated by the
5439 TYPE_QUALS, if one exists. If no qualified version exists yet,
5440 return NULL_TREE. */
5443 get_qualified_type (tree type, int type_quals)
5447 if (TYPE_QUALS (type) == type_quals)
5450 /* Search the chain of variants to see if there is already one there just
5451 like the one we need to have. If so, use that existing one. We must
5452 preserve the TYPE_NAME, since there is code that depends on this. */
5453 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5454 if (check_qualified_type (t, type, type_quals))
5460 /* Like get_qualified_type, but creates the type if it does not
5461 exist. This function never returns NULL_TREE. */
5464 build_qualified_type (tree type, int type_quals)
5468 /* See if we already have the appropriate qualified variant. */
5469 t = get_qualified_type (type, type_quals);
5471 /* If not, build it. */
5474 t = build_variant_type_copy (type);
5475 set_type_quals (t, type_quals);
5477 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5478 /* Propagate structural equality. */
5479 SET_TYPE_STRUCTURAL_EQUALITY (t);
5480 else if (TYPE_CANONICAL (type) != type)
5481 /* Build the underlying canonical type, since it is different
5483 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5486 /* T is its own canonical type. */
5487 TYPE_CANONICAL (t) = t;
5494 /* Create a new distinct copy of TYPE. The new type is made its own
5495 MAIN_VARIANT. If TYPE requires structural equality checks, the
5496 resulting type requires structural equality checks; otherwise, its
5497 TYPE_CANONICAL points to itself. */
5500 build_distinct_type_copy (tree type)
5502 tree t = copy_node (type);
5504 TYPE_POINTER_TO (t) = 0;
5505 TYPE_REFERENCE_TO (t) = 0;
5507 /* Set the canonical type either to a new equivalence class, or
5508 propagate the need for structural equality checks. */
5509 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5510 SET_TYPE_STRUCTURAL_EQUALITY (t);
5512 TYPE_CANONICAL (t) = t;
5514 /* Make it its own variant. */
5515 TYPE_MAIN_VARIANT (t) = t;
5516 TYPE_NEXT_VARIANT (t) = 0;
5518 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5519 whose TREE_TYPE is not t. This can also happen in the Ada
5520 frontend when using subtypes. */
5525 /* Create a new variant of TYPE, equivalent but distinct. This is so
5526 the caller can modify it. TYPE_CANONICAL for the return type will
5527 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5528 are considered equal by the language itself (or that both types
5529 require structural equality checks). */
5532 build_variant_type_copy (tree type)
5534 tree t, m = TYPE_MAIN_VARIANT (type);
5536 t = build_distinct_type_copy (type);
5538 /* Since we're building a variant, assume that it is a non-semantic
5539 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5540 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5542 /* Add the new type to the chain of variants of TYPE. */
5543 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5544 TYPE_NEXT_VARIANT (m) = t;
5545 TYPE_MAIN_VARIANT (t) = m;
5550 /* Return true if the from tree in both tree maps are equal. */
5553 tree_map_base_eq (const void *va, const void *vb)
5555 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5556 *const b = (const struct tree_map_base *) vb;
5557 return (a->from == b->from);
5560 /* Hash a from tree in a tree_map. */
5563 tree_map_base_hash (const void *item)
5565 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5568 /* Return true if this tree map structure is marked for garbage collection
5569 purposes. We simply return true if the from tree is marked, so that this
5570 structure goes away when the from tree goes away. */
5573 tree_map_base_marked_p (const void *p)
5575 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5579 tree_map_hash (const void *item)
5581 return (((const struct tree_map *) item)->hash);
5584 /* Return the initialization priority for DECL. */
5587 decl_init_priority_lookup (tree decl)
5589 struct tree_priority_map *h;
5590 struct tree_map_base in;
5592 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5594 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5595 return h ? h->init : DEFAULT_INIT_PRIORITY;
5598 /* Return the finalization priority for DECL. */
5601 decl_fini_priority_lookup (tree decl)
5603 struct tree_priority_map *h;
5604 struct tree_map_base in;
5606 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5608 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5609 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5612 /* Return the initialization and finalization priority information for
5613 DECL. If there is no previous priority information, a freshly
5614 allocated structure is returned. */
5616 static struct tree_priority_map *
5617 decl_priority_info (tree decl)
5619 struct tree_priority_map in;
5620 struct tree_priority_map *h;
5623 in.base.from = decl;
5624 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5625 h = (struct tree_priority_map *) *loc;
5628 h = GGC_CNEW (struct tree_priority_map);
5630 h->base.from = decl;
5631 h->init = DEFAULT_INIT_PRIORITY;
5632 h->fini = DEFAULT_INIT_PRIORITY;
5638 /* Set the initialization priority for DECL to PRIORITY. */
5641 decl_init_priority_insert (tree decl, priority_type priority)
5643 struct tree_priority_map *h;
5645 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5646 h = decl_priority_info (decl);
5650 /* Set the finalization priority for DECL to PRIORITY. */
5653 decl_fini_priority_insert (tree decl, priority_type priority)
5655 struct tree_priority_map *h;
5657 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5658 h = decl_priority_info (decl);
5662 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5665 print_debug_expr_statistics (void)
5667 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5668 (long) htab_size (debug_expr_for_decl),
5669 (long) htab_elements (debug_expr_for_decl),
5670 htab_collisions (debug_expr_for_decl));
5673 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5676 print_value_expr_statistics (void)
5678 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5679 (long) htab_size (value_expr_for_decl),
5680 (long) htab_elements (value_expr_for_decl),
5681 htab_collisions (value_expr_for_decl));
5684 /* Lookup a debug expression for FROM, and return it if we find one. */
5687 decl_debug_expr_lookup (tree from)
5689 struct tree_map *h, in;
5690 in.base.from = from;
5692 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5693 htab_hash_pointer (from));
5699 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5702 decl_debug_expr_insert (tree from, tree to)
5707 h = GGC_NEW (struct tree_map);
5708 h->hash = htab_hash_pointer (from);
5709 h->base.from = from;
5711 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5712 *(struct tree_map **) loc = h;
5715 /* Lookup a value expression for FROM, and return it if we find one. */
5718 decl_value_expr_lookup (tree from)
5720 struct tree_map *h, in;
5721 in.base.from = from;
5723 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5724 htab_hash_pointer (from));
5730 /* Insert a mapping FROM->TO in the value expression hashtable. */
5733 decl_value_expr_insert (tree from, tree to)
5738 h = GGC_NEW (struct tree_map);
5739 h->hash = htab_hash_pointer (from);
5740 h->base.from = from;
5742 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5743 *(struct tree_map **) loc = h;
5746 /* Hashing of types so that we don't make duplicates.
5747 The entry point is `type_hash_canon'. */
5749 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5750 with types in the TREE_VALUE slots), by adding the hash codes
5751 of the individual types. */
5754 type_hash_list (const_tree list, hashval_t hashcode)
5758 for (tail = list; tail; tail = TREE_CHAIN (tail))
5759 if (TREE_VALUE (tail) != error_mark_node)
5760 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5766 /* These are the Hashtable callback functions. */
5768 /* Returns true iff the types are equivalent. */
5771 type_hash_eq (const void *va, const void *vb)
5773 const struct type_hash *const a = (const struct type_hash *) va,
5774 *const b = (const struct type_hash *) vb;
5776 /* First test the things that are the same for all types. */
5777 if (a->hash != b->hash
5778 || TREE_CODE (a->type) != TREE_CODE (b->type)
5779 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5780 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5781 TYPE_ATTRIBUTES (b->type))
5782 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5783 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5784 || (TREE_CODE (a->type) != COMPLEX_TYPE
5785 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5788 switch (TREE_CODE (a->type))
5793 case REFERENCE_TYPE:
5797 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5800 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5801 && !(TYPE_VALUES (a->type)
5802 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5803 && TYPE_VALUES (b->type)
5804 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5805 && type_list_equal (TYPE_VALUES (a->type),
5806 TYPE_VALUES (b->type))))
5809 /* ... fall through ... */
5814 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5815 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5816 TYPE_MAX_VALUE (b->type)))
5817 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5818 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5819 TYPE_MIN_VALUE (b->type))));
5821 case FIXED_POINT_TYPE:
5822 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5825 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5828 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5829 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5830 || (TYPE_ARG_TYPES (a->type)
5831 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5832 && TYPE_ARG_TYPES (b->type)
5833 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5834 && type_list_equal (TYPE_ARG_TYPES (a->type),
5835 TYPE_ARG_TYPES (b->type)))));
5838 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5842 case QUAL_UNION_TYPE:
5843 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5844 || (TYPE_FIELDS (a->type)
5845 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5846 && TYPE_FIELDS (b->type)
5847 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5848 && type_list_equal (TYPE_FIELDS (a->type),
5849 TYPE_FIELDS (b->type))));
5852 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5853 || (TYPE_ARG_TYPES (a->type)
5854 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5855 && TYPE_ARG_TYPES (b->type)
5856 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5857 && type_list_equal (TYPE_ARG_TYPES (a->type),
5858 TYPE_ARG_TYPES (b->type))))
5866 if (lang_hooks.types.type_hash_eq != NULL)
5867 return lang_hooks.types.type_hash_eq (a->type, b->type);
5872 /* Return the cached hash value. */
5875 type_hash_hash (const void *item)
5877 return ((const struct type_hash *) item)->hash;
5880 /* Look in the type hash table for a type isomorphic to TYPE.
5881 If one is found, return it. Otherwise return 0. */
5884 type_hash_lookup (hashval_t hashcode, tree type)
5886 struct type_hash *h, in;
5888 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5889 must call that routine before comparing TYPE_ALIGNs. */
5895 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5902 /* Add an entry to the type-hash-table
5903 for a type TYPE whose hash code is HASHCODE. */
5906 type_hash_add (hashval_t hashcode, tree type)
5908 struct type_hash *h;
5911 h = GGC_NEW (struct type_hash);
5914 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5918 /* Given TYPE, and HASHCODE its hash code, return the canonical
5919 object for an identical type if one already exists.
5920 Otherwise, return TYPE, and record it as the canonical object.
5922 To use this function, first create a type of the sort you want.
5923 Then compute its hash code from the fields of the type that
5924 make it different from other similar types.
5925 Then call this function and use the value. */
5928 type_hash_canon (unsigned int hashcode, tree type)
5932 /* The hash table only contains main variants, so ensure that's what we're
5934 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5936 if (!lang_hooks.types.hash_types)
5939 /* See if the type is in the hash table already. If so, return it.
5940 Otherwise, add the type. */
5941 t1 = type_hash_lookup (hashcode, type);
5944 #ifdef GATHER_STATISTICS
5945 tree_node_counts[(int) t_kind]--;
5946 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5952 type_hash_add (hashcode, type);
5957 /* See if the data pointed to by the type hash table is marked. We consider
5958 it marked if the type is marked or if a debug type number or symbol
5959 table entry has been made for the type. This reduces the amount of
5960 debugging output and eliminates that dependency of the debug output on
5961 the number of garbage collections. */
5964 type_hash_marked_p (const void *p)
5966 const_tree const type = ((const struct type_hash *) p)->type;
5968 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5972 print_type_hash_statistics (void)
5974 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5975 (long) htab_size (type_hash_table),
5976 (long) htab_elements (type_hash_table),
5977 htab_collisions (type_hash_table));
5980 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5981 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5982 by adding the hash codes of the individual attributes. */
5985 attribute_hash_list (const_tree list, hashval_t hashcode)
5989 for (tail = list; tail; tail = TREE_CHAIN (tail))
5990 /* ??? Do we want to add in TREE_VALUE too? */
5991 hashcode = iterative_hash_object
5992 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
5996 /* Given two lists of attributes, return true if list l2 is
5997 equivalent to l1. */
6000 attribute_list_equal (const_tree l1, const_tree l2)
6002 return attribute_list_contained (l1, l2)
6003 && attribute_list_contained (l2, l1);
6006 /* Given two lists of attributes, return true if list L2 is
6007 completely contained within L1. */
6008 /* ??? This would be faster if attribute names were stored in a canonicalized
6009 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6010 must be used to show these elements are equivalent (which they are). */
6011 /* ??? It's not clear that attributes with arguments will always be handled
6015 attribute_list_contained (const_tree l1, const_tree l2)
6019 /* First check the obvious, maybe the lists are identical. */
6023 /* Maybe the lists are similar. */
6024 for (t1 = l1, t2 = l2;
6026 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6027 && TREE_VALUE (t1) == TREE_VALUE (t2);
6028 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6030 /* Maybe the lists are equal. */
6031 if (t1 == 0 && t2 == 0)
6034 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6037 /* This CONST_CAST is okay because lookup_attribute does not
6038 modify its argument and the return value is assigned to a
6040 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6041 CONST_CAST_TREE(l1));
6043 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6046 if (TREE_VALUE (t2) != NULL
6047 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6048 && TREE_VALUE (attr) != NULL
6049 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6051 if (simple_cst_list_equal (TREE_VALUE (t2),
6052 TREE_VALUE (attr)) == 1)
6055 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6066 /* Given two lists of types
6067 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6068 return 1 if the lists contain the same types in the same order.
6069 Also, the TREE_PURPOSEs must match. */
6072 type_list_equal (const_tree l1, const_tree l2)
6076 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6077 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6078 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6079 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6080 && (TREE_TYPE (TREE_PURPOSE (t1))
6081 == TREE_TYPE (TREE_PURPOSE (t2))))))
6087 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6088 given by TYPE. If the argument list accepts variable arguments,
6089 then this function counts only the ordinary arguments. */
6092 type_num_arguments (const_tree type)
6097 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6098 /* If the function does not take a variable number of arguments,
6099 the last element in the list will have type `void'. */
6100 if (VOID_TYPE_P (TREE_VALUE (t)))
6108 /* Nonzero if integer constants T1 and T2
6109 represent the same constant value. */
6112 tree_int_cst_equal (const_tree t1, const_tree t2)
6117 if (t1 == 0 || t2 == 0)
6120 if (TREE_CODE (t1) == INTEGER_CST
6121 && TREE_CODE (t2) == INTEGER_CST
6122 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6123 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6129 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6130 The precise way of comparison depends on their data type. */
6133 tree_int_cst_lt (const_tree t1, const_tree t2)
6138 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6140 int t1_sgn = tree_int_cst_sgn (t1);
6141 int t2_sgn = tree_int_cst_sgn (t2);
6143 if (t1_sgn < t2_sgn)
6145 else if (t1_sgn > t2_sgn)
6147 /* Otherwise, both are non-negative, so we compare them as
6148 unsigned just in case one of them would overflow a signed
6151 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6152 return INT_CST_LT (t1, t2);
6154 return INT_CST_LT_UNSIGNED (t1, t2);
6157 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6160 tree_int_cst_compare (const_tree t1, const_tree t2)
6162 if (tree_int_cst_lt (t1, t2))
6164 else if (tree_int_cst_lt (t2, t1))
6170 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6171 the host. If POS is zero, the value can be represented in a single
6172 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6173 be represented in a single unsigned HOST_WIDE_INT. */
6176 host_integerp (const_tree t, int pos)
6181 return (TREE_CODE (t) == INTEGER_CST
6182 && ((TREE_INT_CST_HIGH (t) == 0
6183 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6184 || (! pos && TREE_INT_CST_HIGH (t) == -1
6185 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6186 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6187 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6188 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6189 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6192 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6193 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6194 be non-negative. We must be able to satisfy the above conditions. */
6197 tree_low_cst (const_tree t, int pos)
6199 gcc_assert (host_integerp (t, pos));
6200 return TREE_INT_CST_LOW (t);
6203 /* Return the most significant bit of the integer constant T. */
6206 tree_int_cst_msb (const_tree t)
6210 unsigned HOST_WIDE_INT l;
6212 /* Note that using TYPE_PRECISION here is wrong. We care about the
6213 actual bits, not the (arbitrary) range of the type. */
6214 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6215 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6216 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6217 return (l & 1) == 1;
6220 /* Return an indication of the sign of the integer constant T.
6221 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6222 Note that -1 will never be returned if T's type is unsigned. */
6225 tree_int_cst_sgn (const_tree t)
6227 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6229 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6231 else if (TREE_INT_CST_HIGH (t) < 0)
6237 /* Return the minimum number of bits needed to represent VALUE in a
6238 signed or unsigned type, UNSIGNEDP says which. */
6241 tree_int_cst_min_precision (tree value, bool unsignedp)
6245 /* If the value is negative, compute its negative minus 1. The latter
6246 adjustment is because the absolute value of the largest negative value
6247 is one larger than the largest positive value. This is equivalent to
6248 a bit-wise negation, so use that operation instead. */
6250 if (tree_int_cst_sgn (value) < 0)
6251 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6253 /* Return the number of bits needed, taking into account the fact
6254 that we need one more bit for a signed than unsigned type. */
6256 if (integer_zerop (value))
6259 log = tree_floor_log2 (value);
6261 return log + 1 + !unsignedp;
6264 /* Compare two constructor-element-type constants. Return 1 if the lists
6265 are known to be equal; otherwise return 0. */
6268 simple_cst_list_equal (const_tree l1, const_tree l2)
6270 while (l1 != NULL_TREE && l2 != NULL_TREE)
6272 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6275 l1 = TREE_CHAIN (l1);
6276 l2 = TREE_CHAIN (l2);
6282 /* Return truthvalue of whether T1 is the same tree structure as T2.
6283 Return 1 if they are the same.
6284 Return 0 if they are understandably different.
6285 Return -1 if either contains tree structure not understood by
6289 simple_cst_equal (const_tree t1, const_tree t2)
6291 enum tree_code code1, code2;
6297 if (t1 == 0 || t2 == 0)
6300 code1 = TREE_CODE (t1);
6301 code2 = TREE_CODE (t2);
6303 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6305 if (CONVERT_EXPR_CODE_P (code2)
6306 || code2 == NON_LVALUE_EXPR)
6307 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6309 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6312 else if (CONVERT_EXPR_CODE_P (code2)
6313 || code2 == NON_LVALUE_EXPR)
6314 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6322 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6323 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6326 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6329 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6332 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6333 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6334 TREE_STRING_LENGTH (t1)));
6338 unsigned HOST_WIDE_INT idx;
6339 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6340 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6342 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6345 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6346 /* ??? Should we handle also fields here? */
6347 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6348 VEC_index (constructor_elt, v2, idx)->value))
6354 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6357 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6360 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6363 const_tree arg1, arg2;
6364 const_call_expr_arg_iterator iter1, iter2;
6365 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6366 arg2 = first_const_call_expr_arg (t2, &iter2);
6368 arg1 = next_const_call_expr_arg (&iter1),
6369 arg2 = next_const_call_expr_arg (&iter2))
6371 cmp = simple_cst_equal (arg1, arg2);
6375 return arg1 == arg2;
6379 /* Special case: if either target is an unallocated VAR_DECL,
6380 it means that it's going to be unified with whatever the
6381 TARGET_EXPR is really supposed to initialize, so treat it
6382 as being equivalent to anything. */
6383 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6384 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6385 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6386 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6387 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6388 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6391 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6396 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6398 case WITH_CLEANUP_EXPR:
6399 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6403 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6406 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6407 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6421 /* This general rule works for most tree codes. All exceptions should be
6422 handled above. If this is a language-specific tree code, we can't
6423 trust what might be in the operand, so say we don't know
6425 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6428 switch (TREE_CODE_CLASS (code1))
6432 case tcc_comparison:
6433 case tcc_expression:
6437 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6439 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6451 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6452 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6453 than U, respectively. */
6456 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6458 if (tree_int_cst_sgn (t) < 0)
6460 else if (TREE_INT_CST_HIGH (t) != 0)
6462 else if (TREE_INT_CST_LOW (t) == u)
6464 else if (TREE_INT_CST_LOW (t) < u)
6470 /* Return true if CODE represents an associative tree code. Otherwise
6473 associative_tree_code (enum tree_code code)
6492 /* Return true if CODE represents a commutative tree code. Otherwise
6495 commutative_tree_code (enum tree_code code)
6508 case UNORDERED_EXPR:
6512 case TRUTH_AND_EXPR:
6513 case TRUTH_XOR_EXPR:
6523 /* Generate a hash value for an expression. This can be used iteratively
6524 by passing a previous result as the VAL argument.
6526 This function is intended to produce the same hash for expressions which
6527 would compare equal using operand_equal_p. */
6530 iterative_hash_expr (const_tree t, hashval_t val)
6533 enum tree_code code;
6537 return iterative_hash_hashval_t (0, val);
6539 code = TREE_CODE (t);
6543 /* Alas, constants aren't shared, so we can't rely on pointer
6546 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6547 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6550 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6552 return iterative_hash_hashval_t (val2, val);
6556 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6558 return iterative_hash_hashval_t (val2, val);
6561 return iterative_hash (TREE_STRING_POINTER (t),
6562 TREE_STRING_LENGTH (t), val);
6564 val = iterative_hash_expr (TREE_REALPART (t), val);
6565 return iterative_hash_expr (TREE_IMAGPART (t), val);
6567 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6570 /* we can just compare by pointer. */
6571 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6574 /* A list of expressions, for a CALL_EXPR or as the elements of a
6576 for (; t; t = TREE_CHAIN (t))
6577 val = iterative_hash_expr (TREE_VALUE (t), val);
6581 unsigned HOST_WIDE_INT idx;
6583 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6585 val = iterative_hash_expr (field, val);
6586 val = iterative_hash_expr (value, val);
6591 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6592 Otherwise nodes that compare equal according to operand_equal_p might
6593 get different hash codes. However, don't do this for machine specific
6594 or front end builtins, since the function code is overloaded in those
6596 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6597 && built_in_decls[DECL_FUNCTION_CODE (t)])
6599 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6600 code = TREE_CODE (t);
6604 tclass = TREE_CODE_CLASS (code);
6606 if (tclass == tcc_declaration)
6608 /* DECL's have a unique ID */
6609 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6613 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6615 val = iterative_hash_object (code, val);
6617 /* Don't hash the type, that can lead to having nodes which
6618 compare equal according to operand_equal_p, but which
6619 have different hash codes. */
6620 if (CONVERT_EXPR_CODE_P (code)
6621 || code == NON_LVALUE_EXPR)
6623 /* Make sure to include signness in the hash computation. */
6624 val += TYPE_UNSIGNED (TREE_TYPE (t));
6625 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6628 else if (commutative_tree_code (code))
6630 /* It's a commutative expression. We want to hash it the same
6631 however it appears. We do this by first hashing both operands
6632 and then rehashing based on the order of their independent
6634 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6635 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6639 t = one, one = two, two = t;
6641 val = iterative_hash_hashval_t (one, val);
6642 val = iterative_hash_hashval_t (two, val);
6645 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6646 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6653 /* Generate a hash value for a pair of expressions. This can be used
6654 iteratively by passing a previous result as the VAL argument.
6656 The same hash value is always returned for a given pair of expressions,
6657 regardless of the order in which they are presented. This is useful in
6658 hashing the operands of commutative functions. */
6661 iterative_hash_exprs_commutative (const_tree t1,
6662 const_tree t2, hashval_t val)
6664 hashval_t one = iterative_hash_expr (t1, 0);
6665 hashval_t two = iterative_hash_expr (t2, 0);
6669 t = one, one = two, two = t;
6670 val = iterative_hash_hashval_t (one, val);
6671 val = iterative_hash_hashval_t (two, val);
6676 /* Constructors for pointer, array and function types.
6677 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6678 constructed by language-dependent code, not here.) */
6680 /* Construct, lay out and return the type of pointers to TO_TYPE with
6681 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6682 reference all of memory. If such a type has already been
6683 constructed, reuse it. */
6686 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6691 if (to_type == error_mark_node)
6692 return error_mark_node;
6694 /* If the pointed-to type has the may_alias attribute set, force
6695 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6696 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6697 can_alias_all = true;
6699 /* In some cases, languages will have things that aren't a POINTER_TYPE
6700 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6701 In that case, return that type without regard to the rest of our
6704 ??? This is a kludge, but consistent with the way this function has
6705 always operated and there doesn't seem to be a good way to avoid this
6707 if (TYPE_POINTER_TO (to_type) != 0
6708 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6709 return TYPE_POINTER_TO (to_type);
6711 /* First, if we already have a type for pointers to TO_TYPE and it's
6712 the proper mode, use it. */
6713 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6714 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6717 t = make_node (POINTER_TYPE);
6719 TREE_TYPE (t) = to_type;
6720 SET_TYPE_MODE (t, mode);
6721 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6722 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6723 TYPE_POINTER_TO (to_type) = t;
6725 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6726 SET_TYPE_STRUCTURAL_EQUALITY (t);
6727 else if (TYPE_CANONICAL (to_type) != to_type)
6729 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6730 mode, can_alias_all);
6732 /* Lay out the type. This function has many callers that are concerned
6733 with expression-construction, and this simplifies them all. */
6739 /* By default build pointers in ptr_mode. */
6742 build_pointer_type (tree to_type)
6744 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6745 : TYPE_ADDR_SPACE (to_type);
6746 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6747 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6750 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6753 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6758 if (to_type == error_mark_node)
6759 return error_mark_node;
6761 /* If the pointed-to type has the may_alias attribute set, force
6762 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6763 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6764 can_alias_all = true;
6766 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6767 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6768 In that case, return that type without regard to the rest of our
6771 ??? This is a kludge, but consistent with the way this function has
6772 always operated and there doesn't seem to be a good way to avoid this
6774 if (TYPE_REFERENCE_TO (to_type) != 0
6775 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6776 return TYPE_REFERENCE_TO (to_type);
6778 /* First, if we already have a type for pointers to TO_TYPE and it's
6779 the proper mode, use it. */
6780 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6781 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6784 t = make_node (REFERENCE_TYPE);
6786 TREE_TYPE (t) = to_type;
6787 SET_TYPE_MODE (t, mode);
6788 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6789 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6790 TYPE_REFERENCE_TO (to_type) = t;
6792 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6793 SET_TYPE_STRUCTURAL_EQUALITY (t);
6794 else if (TYPE_CANONICAL (to_type) != to_type)
6796 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6797 mode, can_alias_all);
6805 /* Build the node for the type of references-to-TO_TYPE by default
6809 build_reference_type (tree to_type)
6811 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6812 : TYPE_ADDR_SPACE (to_type);
6813 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6814 return build_reference_type_for_mode (to_type, pointer_mode, false);
6817 /* Build a type that is compatible with t but has no cv quals anywhere
6820 const char *const *const * -> char ***. */
6823 build_type_no_quals (tree t)
6825 switch (TREE_CODE (t))
6828 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6830 TYPE_REF_CAN_ALIAS_ALL (t));
6831 case REFERENCE_TYPE:
6833 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6835 TYPE_REF_CAN_ALIAS_ALL (t));
6837 return TYPE_MAIN_VARIANT (t);
6841 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6842 MAXVAL should be the maximum value in the domain
6843 (one less than the length of the array).
6845 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6846 We don't enforce this limit, that is up to caller (e.g. language front end).
6847 The limit exists because the result is a signed type and we don't handle
6848 sizes that use more than one HOST_WIDE_INT. */
6851 build_index_type (tree maxval)
6853 tree itype = make_node (INTEGER_TYPE);
6855 TREE_TYPE (itype) = sizetype;
6856 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6857 TYPE_MIN_VALUE (itype) = size_zero_node;
6858 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6859 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6860 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6861 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6862 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6863 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6865 if (host_integerp (maxval, 1))
6866 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6869 /* Since we cannot hash this type, we need to compare it using
6870 structural equality checks. */
6871 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6876 /* Builds a signed or unsigned integer type of precision PRECISION.
6877 Used for C bitfields whose precision does not match that of
6878 built-in target types. */
6880 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6883 tree itype = make_node (INTEGER_TYPE);
6885 TYPE_PRECISION (itype) = precision;
6888 fixup_unsigned_type (itype);
6890 fixup_signed_type (itype);
6892 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6893 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6898 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6899 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6900 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6903 build_range_type (tree type, tree lowval, tree highval)
6905 tree itype = make_node (INTEGER_TYPE);
6907 TREE_TYPE (itype) = type;
6908 if (type == NULL_TREE)
6911 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6912 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6914 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6915 SET_TYPE_MODE (itype, TYPE_MODE (type));
6916 TYPE_SIZE (itype) = TYPE_SIZE (type);
6917 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6918 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6919 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6921 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6922 return type_hash_canon (tree_low_cst (highval, 0)
6923 - tree_low_cst (lowval, 0),
6929 /* Return true if the debug information for TYPE, a subtype, should be emitted
6930 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6931 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6932 debug info and doesn't reflect the source code. */
6935 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6937 tree base_type = TREE_TYPE (type), low, high;
6939 /* Subrange types have a base type which is an integral type. */
6940 if (!INTEGRAL_TYPE_P (base_type))
6943 /* Get the real bounds of the subtype. */
6944 if (lang_hooks.types.get_subrange_bounds)
6945 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6948 low = TYPE_MIN_VALUE (type);
6949 high = TYPE_MAX_VALUE (type);
6952 /* If the type and its base type have the same representation and the same
6953 name, then the type is not a subrange but a copy of the base type. */
6954 if ((TREE_CODE (base_type) == INTEGER_TYPE
6955 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6956 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6957 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6958 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6960 tree type_name = TYPE_NAME (type);
6961 tree base_type_name = TYPE_NAME (base_type);
6963 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6964 type_name = DECL_NAME (type_name);
6966 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6967 base_type_name = DECL_NAME (base_type_name);
6969 if (type_name == base_type_name)
6980 /* Just like build_index_type, but takes lowval and highval instead
6981 of just highval (maxval). */
6984 build_index_2_type (tree lowval, tree highval)
6986 return build_range_type (sizetype, lowval, highval);
6989 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6990 and number of elements specified by the range of values of INDEX_TYPE.
6991 If such a type has already been constructed, reuse it. */
6994 build_array_type (tree elt_type, tree index_type)
6997 hashval_t hashcode = 0;
6999 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7001 error ("arrays of functions are not meaningful");
7002 elt_type = integer_type_node;
7005 t = make_node (ARRAY_TYPE);
7006 TREE_TYPE (t) = elt_type;
7007 TYPE_DOMAIN (t) = index_type;
7008 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7011 /* If the element type is incomplete at this point we get marked for
7012 structural equality. Do not record these types in the canonical
7014 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7017 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7019 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7020 t = type_hash_canon (hashcode, t);
7022 if (TYPE_CANONICAL (t) == t)
7024 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7025 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7026 SET_TYPE_STRUCTURAL_EQUALITY (t);
7027 else if (TYPE_CANONICAL (elt_type) != elt_type
7028 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7030 = build_array_type (TYPE_CANONICAL (elt_type),
7031 index_type ? TYPE_CANONICAL (index_type) : NULL);
7037 /* Recursively examines the array elements of TYPE, until a non-array
7038 element type is found. */
7041 strip_array_types (tree type)
7043 while (TREE_CODE (type) == ARRAY_TYPE)
7044 type = TREE_TYPE (type);
7049 /* Computes the canonical argument types from the argument type list
7052 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7053 on entry to this function, or if any of the ARGTYPES are
7056 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7057 true on entry to this function, or if any of the ARGTYPES are
7060 Returns a canonical argument list, which may be ARGTYPES when the
7061 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7062 true) or would not differ from ARGTYPES. */
7065 maybe_canonicalize_argtypes(tree argtypes,
7066 bool *any_structural_p,
7067 bool *any_noncanonical_p)
7070 bool any_noncanonical_argtypes_p = false;
7072 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7074 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7075 /* Fail gracefully by stating that the type is structural. */
7076 *any_structural_p = true;
7077 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7078 *any_structural_p = true;
7079 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7080 || TREE_PURPOSE (arg))
7081 /* If the argument has a default argument, we consider it
7082 non-canonical even though the type itself is canonical.
7083 That way, different variants of function and method types
7084 with default arguments will all point to the variant with
7085 no defaults as their canonical type. */
7086 any_noncanonical_argtypes_p = true;
7089 if (*any_structural_p)
7092 if (any_noncanonical_argtypes_p)
7094 /* Build the canonical list of argument types. */
7095 tree canon_argtypes = NULL_TREE;
7096 bool is_void = false;
7098 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7100 if (arg == void_list_node)
7103 canon_argtypes = tree_cons (NULL_TREE,
7104 TYPE_CANONICAL (TREE_VALUE (arg)),
7108 canon_argtypes = nreverse (canon_argtypes);
7110 canon_argtypes = chainon (canon_argtypes, void_list_node);
7112 /* There is a non-canonical type. */
7113 *any_noncanonical_p = true;
7114 return canon_argtypes;
7117 /* The canonical argument types are the same as ARGTYPES. */
7121 /* Construct, lay out and return
7122 the type of functions returning type VALUE_TYPE
7123 given arguments of types ARG_TYPES.
7124 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7125 are data type nodes for the arguments of the function.
7126 If such a type has already been constructed, reuse it. */
7129 build_function_type (tree value_type, tree arg_types)
7132 hashval_t hashcode = 0;
7133 bool any_structural_p, any_noncanonical_p;
7134 tree canon_argtypes;
7136 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7138 error ("function return type cannot be function");
7139 value_type = integer_type_node;
7142 /* Make a node of the sort we want. */
7143 t = make_node (FUNCTION_TYPE);
7144 TREE_TYPE (t) = value_type;
7145 TYPE_ARG_TYPES (t) = arg_types;
7147 /* If we already have such a type, use the old one. */
7148 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7149 hashcode = type_hash_list (arg_types, hashcode);
7150 t = type_hash_canon (hashcode, t);
7152 /* Set up the canonical type. */
7153 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7154 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7155 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7157 &any_noncanonical_p);
7158 if (any_structural_p)
7159 SET_TYPE_STRUCTURAL_EQUALITY (t);
7160 else if (any_noncanonical_p)
7161 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7164 if (!COMPLETE_TYPE_P (t))
7169 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7172 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7174 tree new_type = NULL;
7175 tree args, new_args = NULL, t;
7179 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7180 args = TREE_CHAIN (args), i++)
7181 if (!bitmap_bit_p (args_to_skip, i))
7182 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7184 new_reversed = nreverse (new_args);
7188 TREE_CHAIN (new_args) = void_list_node;
7190 new_reversed = void_list_node;
7193 /* Use copy_node to preserve as much as possible from original type
7194 (debug info, attribute lists etc.)
7195 Exception is METHOD_TYPEs must have THIS argument.
7196 When we are asked to remove it, we need to build new FUNCTION_TYPE
7198 if (TREE_CODE (orig_type) != METHOD_TYPE
7199 || !bitmap_bit_p (args_to_skip, 0))
7201 new_type = copy_node (orig_type);
7202 TYPE_ARG_TYPES (new_type) = new_reversed;
7207 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7209 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7212 /* This is a new type, not a copy of an old type. Need to reassociate
7213 variants. We can handle everything except the main variant lazily. */
7214 t = TYPE_MAIN_VARIANT (orig_type);
7217 TYPE_MAIN_VARIANT (new_type) = t;
7218 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7219 TYPE_NEXT_VARIANT (t) = new_type;
7223 TYPE_MAIN_VARIANT (new_type) = new_type;
7224 TYPE_NEXT_VARIANT (new_type) = NULL;
7229 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7231 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7232 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7233 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7236 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7238 tree new_decl = copy_node (orig_decl);
7241 new_type = TREE_TYPE (orig_decl);
7242 if (prototype_p (new_type))
7243 new_type = build_function_type_skip_args (new_type, args_to_skip);
7244 TREE_TYPE (new_decl) = new_type;
7246 /* For declarations setting DECL_VINDEX (i.e. methods)
7247 we expect first argument to be THIS pointer. */
7248 if (bitmap_bit_p (args_to_skip, 0))
7249 DECL_VINDEX (new_decl) = NULL_TREE;
7253 /* Build a function type. The RETURN_TYPE is the type returned by the
7254 function. If VAARGS is set, no void_type_node is appended to the
7255 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7258 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7262 t = va_arg (argp, tree);
7263 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7264 args = tree_cons (NULL_TREE, t, args);
7269 if (args != NULL_TREE)
7270 args = nreverse (args);
7271 gcc_assert (args != NULL_TREE && last != void_list_node);
7273 else if (args == NULL_TREE)
7274 args = void_list_node;
7278 args = nreverse (args);
7279 TREE_CHAIN (last) = void_list_node;
7281 args = build_function_type (return_type, args);
7286 /* Build a function type. The RETURN_TYPE is the type returned by the
7287 function. If additional arguments are provided, they are
7288 additional argument types. The list of argument types must always
7289 be terminated by NULL_TREE. */
7292 build_function_type_list (tree return_type, ...)
7297 va_start (p, return_type);
7298 args = build_function_type_list_1 (false, return_type, p);
7303 /* Build a variable argument function type. The RETURN_TYPE is the
7304 type returned by the function. If additional arguments are provided,
7305 they are additional argument types. The list of argument types must
7306 always be terminated by NULL_TREE. */
7309 build_varargs_function_type_list (tree return_type, ...)
7314 va_start (p, return_type);
7315 args = build_function_type_list_1 (true, return_type, p);
7321 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7322 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7323 for the method. An implicit additional parameter (of type
7324 pointer-to-BASETYPE) is added to the ARGTYPES. */
7327 build_method_type_directly (tree basetype,
7334 bool any_structural_p, any_noncanonical_p;
7335 tree canon_argtypes;
7337 /* Make a node of the sort we want. */
7338 t = make_node (METHOD_TYPE);
7340 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7341 TREE_TYPE (t) = rettype;
7342 ptype = build_pointer_type (basetype);
7344 /* The actual arglist for this function includes a "hidden" argument
7345 which is "this". Put it into the list of argument types. */
7346 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7347 TYPE_ARG_TYPES (t) = argtypes;
7349 /* If we already have such a type, use the old one. */
7350 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7351 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7352 hashcode = type_hash_list (argtypes, hashcode);
7353 t = type_hash_canon (hashcode, t);
7355 /* Set up the canonical type. */
7357 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7358 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7360 = (TYPE_CANONICAL (basetype) != basetype
7361 || TYPE_CANONICAL (rettype) != rettype);
7362 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7364 &any_noncanonical_p);
7365 if (any_structural_p)
7366 SET_TYPE_STRUCTURAL_EQUALITY (t);
7367 else if (any_noncanonical_p)
7369 = build_method_type_directly (TYPE_CANONICAL (basetype),
7370 TYPE_CANONICAL (rettype),
7372 if (!COMPLETE_TYPE_P (t))
7378 /* Construct, lay out and return the type of methods belonging to class
7379 BASETYPE and whose arguments and values are described by TYPE.
7380 If that type exists already, reuse it.
7381 TYPE must be a FUNCTION_TYPE node. */
7384 build_method_type (tree basetype, tree type)
7386 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7388 return build_method_type_directly (basetype,
7390 TYPE_ARG_TYPES (type));
7393 /* Construct, lay out and return the type of offsets to a value
7394 of type TYPE, within an object of type BASETYPE.
7395 If a suitable offset type exists already, reuse it. */
7398 build_offset_type (tree basetype, tree type)
7401 hashval_t hashcode = 0;
7403 /* Make a node of the sort we want. */
7404 t = make_node (OFFSET_TYPE);
7406 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7407 TREE_TYPE (t) = type;
7409 /* If we already have such a type, use the old one. */
7410 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7411 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7412 t = type_hash_canon (hashcode, t);
7414 if (!COMPLETE_TYPE_P (t))
7417 if (TYPE_CANONICAL (t) == t)
7419 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7420 || TYPE_STRUCTURAL_EQUALITY_P (type))
7421 SET_TYPE_STRUCTURAL_EQUALITY (t);
7422 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7423 || TYPE_CANONICAL (type) != type)
7425 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7426 TYPE_CANONICAL (type));
7432 /* Create a complex type whose components are COMPONENT_TYPE. */
7435 build_complex_type (tree component_type)
7440 gcc_assert (INTEGRAL_TYPE_P (component_type)
7441 || SCALAR_FLOAT_TYPE_P (component_type)
7442 || FIXED_POINT_TYPE_P (component_type));
7444 /* Make a node of the sort we want. */
7445 t = make_node (COMPLEX_TYPE);
7447 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7449 /* If we already have such a type, use the old one. */
7450 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7451 t = type_hash_canon (hashcode, t);
7453 if (!COMPLETE_TYPE_P (t))
7456 if (TYPE_CANONICAL (t) == t)
7458 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7459 SET_TYPE_STRUCTURAL_EQUALITY (t);
7460 else if (TYPE_CANONICAL (component_type) != component_type)
7462 = build_complex_type (TYPE_CANONICAL (component_type));
7465 /* We need to create a name, since complex is a fundamental type. */
7466 if (! TYPE_NAME (t))
7469 if (component_type == char_type_node)
7470 name = "complex char";
7471 else if (component_type == signed_char_type_node)
7472 name = "complex signed char";
7473 else if (component_type == unsigned_char_type_node)
7474 name = "complex unsigned char";
7475 else if (component_type == short_integer_type_node)
7476 name = "complex short int";
7477 else if (component_type == short_unsigned_type_node)
7478 name = "complex short unsigned int";
7479 else if (component_type == integer_type_node)
7480 name = "complex int";
7481 else if (component_type == unsigned_type_node)
7482 name = "complex unsigned int";
7483 else if (component_type == long_integer_type_node)
7484 name = "complex long int";
7485 else if (component_type == long_unsigned_type_node)
7486 name = "complex long unsigned int";
7487 else if (component_type == long_long_integer_type_node)
7488 name = "complex long long int";
7489 else if (component_type == long_long_unsigned_type_node)
7490 name = "complex long long unsigned int";
7495 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7496 get_identifier (name), t);
7499 return build_qualified_type (t, TYPE_QUALS (component_type));
7502 /* If TYPE is a real or complex floating-point type and the target
7503 does not directly support arithmetic on TYPE then return the wider
7504 type to be used for arithmetic on TYPE. Otherwise, return
7508 excess_precision_type (tree type)
7510 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7512 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7513 switch (TREE_CODE (type))
7516 switch (flt_eval_method)
7519 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7520 return double_type_node;
7523 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7524 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7525 return long_double_type_node;
7532 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7534 switch (flt_eval_method)
7537 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7538 return complex_double_type_node;
7541 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7542 || (TYPE_MODE (TREE_TYPE (type))
7543 == TYPE_MODE (double_type_node)))
7544 return complex_long_double_type_node;
7557 /* Return OP, stripped of any conversions to wider types as much as is safe.
7558 Converting the value back to OP's type makes a value equivalent to OP.
7560 If FOR_TYPE is nonzero, we return a value which, if converted to
7561 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7563 OP must have integer, real or enumeral type. Pointers are not allowed!
7565 There are some cases where the obvious value we could return
7566 would regenerate to OP if converted to OP's type,
7567 but would not extend like OP to wider types.
7568 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7569 For example, if OP is (unsigned short)(signed char)-1,
7570 we avoid returning (signed char)-1 if FOR_TYPE is int,
7571 even though extending that to an unsigned short would regenerate OP,
7572 since the result of extending (signed char)-1 to (int)
7573 is different from (int) OP. */
7576 get_unwidened (tree op, tree for_type)
7578 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7579 tree type = TREE_TYPE (op);
7581 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7583 = (for_type != 0 && for_type != type
7584 && final_prec > TYPE_PRECISION (type)
7585 && TYPE_UNSIGNED (type));
7588 while (CONVERT_EXPR_P (op))
7592 /* TYPE_PRECISION on vector types has different meaning
7593 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7594 so avoid them here. */
7595 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7598 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7599 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7601 /* Truncations are many-one so cannot be removed.
7602 Unless we are later going to truncate down even farther. */
7604 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7607 /* See what's inside this conversion. If we decide to strip it,
7609 op = TREE_OPERAND (op, 0);
7611 /* If we have not stripped any zero-extensions (uns is 0),
7612 we can strip any kind of extension.
7613 If we have previously stripped a zero-extension,
7614 only zero-extensions can safely be stripped.
7615 Any extension can be stripped if the bits it would produce
7616 are all going to be discarded later by truncating to FOR_TYPE. */
7620 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7622 /* TYPE_UNSIGNED says whether this is a zero-extension.
7623 Let's avoid computing it if it does not affect WIN
7624 and if UNS will not be needed again. */
7626 || CONVERT_EXPR_P (op))
7627 && TYPE_UNSIGNED (TREE_TYPE (op)))
7638 /* Return OP or a simpler expression for a narrower value
7639 which can be sign-extended or zero-extended to give back OP.
7640 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7641 or 0 if the value should be sign-extended. */
7644 get_narrower (tree op, int *unsignedp_ptr)
7649 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7651 while (TREE_CODE (op) == NOP_EXPR)
7654 = (TYPE_PRECISION (TREE_TYPE (op))
7655 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7657 /* Truncations are many-one so cannot be removed. */
7661 /* See what's inside this conversion. If we decide to strip it,
7666 op = TREE_OPERAND (op, 0);
7667 /* An extension: the outermost one can be stripped,
7668 but remember whether it is zero or sign extension. */
7670 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7671 /* Otherwise, if a sign extension has been stripped,
7672 only sign extensions can now be stripped;
7673 if a zero extension has been stripped, only zero-extensions. */
7674 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7678 else /* bitschange == 0 */
7680 /* A change in nominal type can always be stripped, but we must
7681 preserve the unsignedness. */
7683 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7685 op = TREE_OPERAND (op, 0);
7686 /* Keep trying to narrow, but don't assign op to win if it
7687 would turn an integral type into something else. */
7688 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7695 if (TREE_CODE (op) == COMPONENT_REF
7696 /* Since type_for_size always gives an integer type. */
7697 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7698 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7699 /* Ensure field is laid out already. */
7700 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7701 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7703 unsigned HOST_WIDE_INT innerprec
7704 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7705 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7706 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7707 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7709 /* We can get this structure field in a narrower type that fits it,
7710 but the resulting extension to its nominal type (a fullword type)
7711 must satisfy the same conditions as for other extensions.
7713 Do this only for fields that are aligned (not bit-fields),
7714 because when bit-field insns will be used there is no
7715 advantage in doing this. */
7717 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7718 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7719 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7723 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7724 win = fold_convert (type, op);
7728 *unsignedp_ptr = uns;
7732 /* Nonzero if integer constant C has a value that is permissible
7733 for type TYPE (an INTEGER_TYPE). */
7736 int_fits_type_p (const_tree c, const_tree type)
7738 tree type_low_bound, type_high_bound;
7739 bool ok_for_low_bound, ok_for_high_bound, unsc;
7742 dc = tree_to_double_int (c);
7743 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7745 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7746 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7748 /* So c is an unsigned integer whose type is sizetype and type is not.
7749 sizetype'd integers are sign extended even though they are
7750 unsigned. If the integer value fits in the lower end word of c,
7751 and if the higher end word has all its bits set to 1, that
7752 means the higher end bits are set to 1 only for sign extension.
7753 So let's convert c into an equivalent zero extended unsigned
7755 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7758 type_low_bound = TYPE_MIN_VALUE (type);
7759 type_high_bound = TYPE_MAX_VALUE (type);
7761 /* If at least one bound of the type is a constant integer, we can check
7762 ourselves and maybe make a decision. If no such decision is possible, but
7763 this type is a subtype, try checking against that. Otherwise, use
7764 fit_double_type, which checks against the precision.
7766 Compute the status for each possibly constant bound, and return if we see
7767 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7768 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7769 for "constant known to fit". */
7771 /* Check if c >= type_low_bound. */
7772 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7774 dd = tree_to_double_int (type_low_bound);
7775 if (TREE_CODE (type) == INTEGER_TYPE
7776 && TYPE_IS_SIZETYPE (type)
7777 && TYPE_UNSIGNED (type))
7778 dd = double_int_zext (dd, TYPE_PRECISION (type));
7779 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7781 int c_neg = (!unsc && double_int_negative_p (dc));
7782 int t_neg = (unsc && double_int_negative_p (dd));
7784 if (c_neg && !t_neg)
7786 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7789 else if (double_int_cmp (dc, dd, unsc) < 0)
7791 ok_for_low_bound = true;
7794 ok_for_low_bound = false;
7796 /* Check if c <= type_high_bound. */
7797 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7799 dd = tree_to_double_int (type_high_bound);
7800 if (TREE_CODE (type) == INTEGER_TYPE
7801 && TYPE_IS_SIZETYPE (type)
7802 && TYPE_UNSIGNED (type))
7803 dd = double_int_zext (dd, TYPE_PRECISION (type));
7804 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7806 int c_neg = (!unsc && double_int_negative_p (dc));
7807 int t_neg = (unsc && double_int_negative_p (dd));
7809 if (t_neg && !c_neg)
7811 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7814 else if (double_int_cmp (dc, dd, unsc) > 0)
7816 ok_for_high_bound = true;
7819 ok_for_high_bound = false;
7821 /* If the constant fits both bounds, the result is known. */
7822 if (ok_for_low_bound && ok_for_high_bound)
7825 /* Perform some generic filtering which may allow making a decision
7826 even if the bounds are not constant. First, negative integers
7827 never fit in unsigned types, */
7828 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7831 /* Second, narrower types always fit in wider ones. */
7832 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7835 /* Third, unsigned integers with top bit set never fit signed types. */
7836 if (! TYPE_UNSIGNED (type) && unsc)
7838 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7839 if (prec < HOST_BITS_PER_WIDE_INT)
7841 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7844 else if (((((unsigned HOST_WIDE_INT) 1)
7845 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7849 /* If we haven't been able to decide at this point, there nothing more we
7850 can check ourselves here. Look at the base type if we have one and it
7851 has the same precision. */
7852 if (TREE_CODE (type) == INTEGER_TYPE
7853 && TREE_TYPE (type) != 0
7854 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7856 type = TREE_TYPE (type);
7860 /* Or to fit_double_type, if nothing else. */
7861 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7864 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7865 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7866 represented (assuming two's-complement arithmetic) within the bit
7867 precision of the type are returned instead. */
7870 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7872 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7873 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7874 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7875 TYPE_UNSIGNED (type));
7878 if (TYPE_UNSIGNED (type))
7879 mpz_set_ui (min, 0);
7883 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7884 mn = double_int_sext (double_int_add (mn, double_int_one),
7885 TYPE_PRECISION (type));
7886 mpz_set_double_int (min, mn, false);
7890 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7891 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7892 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7893 TYPE_UNSIGNED (type));
7896 if (TYPE_UNSIGNED (type))
7897 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7900 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7905 /* Return true if VAR is an automatic variable defined in function FN. */
7908 auto_var_in_fn_p (const_tree var, const_tree fn)
7910 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7911 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
7912 && ! TREE_STATIC (var))
7913 || TREE_CODE (var) == LABEL_DECL
7914 || TREE_CODE (var) == RESULT_DECL));
7917 /* Subprogram of following function. Called by walk_tree.
7919 Return *TP if it is an automatic variable or parameter of the
7920 function passed in as DATA. */
7923 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7925 tree fn = (tree) data;
7930 else if (DECL_P (*tp)
7931 && auto_var_in_fn_p (*tp, fn))
7937 /* Returns true if T is, contains, or refers to a type with variable
7938 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7939 arguments, but not the return type. If FN is nonzero, only return
7940 true if a modifier of the type or position of FN is a variable or
7941 parameter inside FN.
7943 This concept is more general than that of C99 'variably modified types':
7944 in C99, a struct type is never variably modified because a VLA may not
7945 appear as a structure member. However, in GNU C code like:
7947 struct S { int i[f()]; };
7949 is valid, and other languages may define similar constructs. */
7952 variably_modified_type_p (tree type, tree fn)
7956 /* Test if T is either variable (if FN is zero) or an expression containing
7957 a variable in FN. */
7958 #define RETURN_TRUE_IF_VAR(T) \
7959 do { tree _t = (T); \
7960 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7961 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7962 return true; } while (0)
7964 if (type == error_mark_node)
7967 /* If TYPE itself has variable size, it is variably modified. */
7968 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7969 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
7971 switch (TREE_CODE (type))
7974 case REFERENCE_TYPE:
7976 if (variably_modified_type_p (TREE_TYPE (type), fn))
7982 /* If TYPE is a function type, it is variably modified if the
7983 return type is variably modified. */
7984 if (variably_modified_type_p (TREE_TYPE (type), fn))
7990 case FIXED_POINT_TYPE:
7993 /* Scalar types are variably modified if their end points
7995 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
7996 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8001 case QUAL_UNION_TYPE:
8002 /* We can't see if any of the fields are variably-modified by the
8003 definition we normally use, since that would produce infinite
8004 recursion via pointers. */
8005 /* This is variably modified if some field's type is. */
8006 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8007 if (TREE_CODE (t) == FIELD_DECL)
8009 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8010 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8011 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8013 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8014 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8019 /* Do not call ourselves to avoid infinite recursion. This is
8020 variably modified if the element type is. */
8021 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8022 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8029 /* The current language may have other cases to check, but in general,
8030 all other types are not variably modified. */
8031 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8033 #undef RETURN_TRUE_IF_VAR
8036 /* Given a DECL or TYPE, return the scope in which it was declared, or
8037 NULL_TREE if there is no containing scope. */
8040 get_containing_scope (const_tree t)
8042 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8045 /* Return the innermost context enclosing DECL that is
8046 a FUNCTION_DECL, or zero if none. */
8049 decl_function_context (const_tree decl)
8053 if (TREE_CODE (decl) == ERROR_MARK)
8056 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8057 where we look up the function at runtime. Such functions always take
8058 a first argument of type 'pointer to real context'.
8060 C++ should really be fixed to use DECL_CONTEXT for the real context,
8061 and use something else for the "virtual context". */
8062 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8065 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8067 context = DECL_CONTEXT (decl);
8069 while (context && TREE_CODE (context) != FUNCTION_DECL)
8071 if (TREE_CODE (context) == BLOCK)
8072 context = BLOCK_SUPERCONTEXT (context);
8074 context = get_containing_scope (context);
8080 /* Return the innermost context enclosing DECL that is
8081 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8082 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8085 decl_type_context (const_tree decl)
8087 tree context = DECL_CONTEXT (decl);
8090 switch (TREE_CODE (context))
8092 case NAMESPACE_DECL:
8093 case TRANSLATION_UNIT_DECL:
8098 case QUAL_UNION_TYPE:
8103 context = DECL_CONTEXT (context);
8107 context = BLOCK_SUPERCONTEXT (context);
8117 /* CALL is a CALL_EXPR. Return the declaration for the function
8118 called, or NULL_TREE if the called function cannot be
8122 get_callee_fndecl (const_tree call)
8126 if (call == error_mark_node)
8127 return error_mark_node;
8129 /* It's invalid to call this function with anything but a
8131 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8133 /* The first operand to the CALL is the address of the function
8135 addr = CALL_EXPR_FN (call);
8139 /* If this is a readonly function pointer, extract its initial value. */
8140 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8141 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8142 && DECL_INITIAL (addr))
8143 addr = DECL_INITIAL (addr);
8145 /* If the address is just `&f' for some function `f', then we know
8146 that `f' is being called. */
8147 if (TREE_CODE (addr) == ADDR_EXPR
8148 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8149 return TREE_OPERAND (addr, 0);
8151 /* We couldn't figure out what was being called. */
8155 /* Print debugging information about tree nodes generated during the compile,
8156 and any language-specific information. */
8159 dump_tree_statistics (void)
8161 #ifdef GATHER_STATISTICS
8163 int total_nodes, total_bytes;
8166 fprintf (stderr, "\n??? tree nodes created\n\n");
8167 #ifdef GATHER_STATISTICS
8168 fprintf (stderr, "Kind Nodes Bytes\n");
8169 fprintf (stderr, "---------------------------------------\n");
8170 total_nodes = total_bytes = 0;
8171 for (i = 0; i < (int) all_kinds; i++)
8173 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8174 tree_node_counts[i], tree_node_sizes[i]);
8175 total_nodes += tree_node_counts[i];
8176 total_bytes += tree_node_sizes[i];
8178 fprintf (stderr, "---------------------------------------\n");
8179 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8180 fprintf (stderr, "---------------------------------------\n");
8181 ssanames_print_statistics ();
8182 phinodes_print_statistics ();
8184 fprintf (stderr, "(No per-node statistics)\n");
8186 print_type_hash_statistics ();
8187 print_debug_expr_statistics ();
8188 print_value_expr_statistics ();
8189 lang_hooks.print_statistics ();
8192 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8194 /* Generate a crc32 of a string. */
8197 crc32_string (unsigned chksum, const char *string)
8201 unsigned value = *string << 24;
8204 for (ix = 8; ix--; value <<= 1)
8208 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8217 /* P is a string that will be used in a symbol. Mask out any characters
8218 that are not valid in that context. */
8221 clean_symbol_name (char *p)
8225 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8228 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8235 /* Generate a name for a special-purpose function function.
8236 The generated name may need to be unique across the whole link.
8237 TYPE is some string to identify the purpose of this function to the
8238 linker or collect2; it must start with an uppercase letter,
8240 I - for constructors
8242 N - for C++ anonymous namespaces
8243 F - for DWARF unwind frame information. */
8246 get_file_function_name (const char *type)
8252 /* If we already have a name we know to be unique, just use that. */
8253 if (first_global_object_name)
8254 p = q = ASTRDUP (first_global_object_name);
8255 /* If the target is handling the constructors/destructors, they
8256 will be local to this file and the name is only necessary for
8257 debugging purposes. */
8258 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8260 const char *file = main_input_filename;
8262 file = input_filename;
8263 /* Just use the file's basename, because the full pathname
8264 might be quite long. */
8265 p = strrchr (file, '/');
8270 p = q = ASTRDUP (p);
8274 /* Otherwise, the name must be unique across the entire link.
8275 We don't have anything that we know to be unique to this translation
8276 unit, so use what we do have and throw in some randomness. */
8278 const char *name = weak_global_object_name;
8279 const char *file = main_input_filename;
8284 file = input_filename;
8286 len = strlen (file);
8287 q = (char *) alloca (9 * 2 + len + 1);
8288 memcpy (q, file, len + 1);
8290 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8291 crc32_string (0, get_random_seed (false)));
8296 clean_symbol_name (q);
8297 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8300 /* Set up the name of the file-level functions we may need.
8301 Use a global object (which is already required to be unique over
8302 the program) rather than the file name (which imposes extra
8304 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8306 return get_identifier (buf);
8309 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8311 /* Complain that the tree code of NODE does not match the expected 0
8312 terminated list of trailing codes. The trailing code list can be
8313 empty, for a more vague error message. FILE, LINE, and FUNCTION
8314 are of the caller. */
8317 tree_check_failed (const_tree node, const char *file,
8318 int line, const char *function, ...)
8322 unsigned length = 0;
8325 va_start (args, function);
8326 while ((code = va_arg (args, int)))
8327 length += 4 + strlen (tree_code_name[code]);
8332 va_start (args, function);
8333 length += strlen ("expected ");
8334 buffer = tmp = (char *) alloca (length);
8336 while ((code = va_arg (args, int)))
8338 const char *prefix = length ? " or " : "expected ";
8340 strcpy (tmp + length, prefix);
8341 length += strlen (prefix);
8342 strcpy (tmp + length, tree_code_name[code]);
8343 length += strlen (tree_code_name[code]);
8348 buffer = "unexpected node";
8350 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8351 buffer, tree_code_name[TREE_CODE (node)],
8352 function, trim_filename (file), line);
8355 /* Complain that the tree code of NODE does match the expected 0
8356 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8360 tree_not_check_failed (const_tree node, const char *file,
8361 int line, const char *function, ...)
8365 unsigned length = 0;
8368 va_start (args, function);
8369 while ((code = va_arg (args, int)))
8370 length += 4 + strlen (tree_code_name[code]);
8372 va_start (args, function);
8373 buffer = (char *) alloca (length);
8375 while ((code = va_arg (args, int)))
8379 strcpy (buffer + length, " or ");
8382 strcpy (buffer + length, tree_code_name[code]);
8383 length += strlen (tree_code_name[code]);
8387 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8388 buffer, tree_code_name[TREE_CODE (node)],
8389 function, trim_filename (file), line);
8392 /* Similar to tree_check_failed, except that we check for a class of tree
8393 code, given in CL. */
8396 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8397 const char *file, int line, const char *function)
8400 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8401 TREE_CODE_CLASS_STRING (cl),
8402 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8403 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8406 /* Similar to tree_check_failed, except that instead of specifying a
8407 dozen codes, use the knowledge that they're all sequential. */
8410 tree_range_check_failed (const_tree node, const char *file, int line,
8411 const char *function, enum tree_code c1,
8415 unsigned length = 0;
8418 for (c = c1; c <= c2; ++c)
8419 length += 4 + strlen (tree_code_name[c]);
8421 length += strlen ("expected ");
8422 buffer = (char *) alloca (length);
8425 for (c = c1; c <= c2; ++c)
8427 const char *prefix = length ? " or " : "expected ";
8429 strcpy (buffer + length, prefix);
8430 length += strlen (prefix);
8431 strcpy (buffer + length, tree_code_name[c]);
8432 length += strlen (tree_code_name[c]);
8435 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8436 buffer, tree_code_name[TREE_CODE (node)],
8437 function, trim_filename (file), line);
8441 /* Similar to tree_check_failed, except that we check that a tree does
8442 not have the specified code, given in CL. */
8445 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8446 const char *file, int line, const char *function)
8449 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8450 TREE_CODE_CLASS_STRING (cl),
8451 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8452 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8456 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8459 omp_clause_check_failed (const_tree node, const char *file, int line,
8460 const char *function, enum omp_clause_code code)
8462 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8463 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8464 function, trim_filename (file), line);
8468 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8471 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8472 const char *function, enum omp_clause_code c1,
8473 enum omp_clause_code c2)
8476 unsigned length = 0;
8479 for (c = c1; c <= c2; ++c)
8480 length += 4 + strlen (omp_clause_code_name[c]);
8482 length += strlen ("expected ");
8483 buffer = (char *) alloca (length);
8486 for (c = c1; c <= c2; ++c)
8488 const char *prefix = length ? " or " : "expected ";
8490 strcpy (buffer + length, prefix);
8491 length += strlen (prefix);
8492 strcpy (buffer + length, omp_clause_code_name[c]);
8493 length += strlen (omp_clause_code_name[c]);
8496 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8497 buffer, omp_clause_code_name[TREE_CODE (node)],
8498 function, trim_filename (file), line);
8502 #undef DEFTREESTRUCT
8503 #define DEFTREESTRUCT(VAL, NAME) NAME,
8505 static const char *ts_enum_names[] = {
8506 #include "treestruct.def"
8508 #undef DEFTREESTRUCT
8510 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8512 /* Similar to tree_class_check_failed, except that we check for
8513 whether CODE contains the tree structure identified by EN. */
8516 tree_contains_struct_check_failed (const_tree node,
8517 const enum tree_node_structure_enum en,
8518 const char *file, int line,
8519 const char *function)
8522 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8524 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8528 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8529 (dynamically sized) vector. */
8532 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8533 const char *function)
8536 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8537 idx + 1, len, function, trim_filename (file), line);
8540 /* Similar to above, except that the check is for the bounds of the operand
8541 vector of an expression node EXP. */
8544 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8545 int line, const char *function)
8547 int code = TREE_CODE (exp);
8549 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8550 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8551 function, trim_filename (file), line);
8554 /* Similar to above, except that the check is for the number of
8555 operands of an OMP_CLAUSE node. */
8558 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8559 int line, const char *function)
8562 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8563 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8564 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8565 trim_filename (file), line);
8567 #endif /* ENABLE_TREE_CHECKING */
8569 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8570 and mapped to the machine mode MODE. Initialize its fields and build
8571 the information necessary for debugging output. */
8574 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8577 hashval_t hashcode = 0;
8579 t = make_node (VECTOR_TYPE);
8580 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8581 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8582 SET_TYPE_MODE (t, mode);
8584 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8585 SET_TYPE_STRUCTURAL_EQUALITY (t);
8586 else if (TYPE_CANONICAL (innertype) != innertype
8587 || mode != VOIDmode)
8589 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8594 tree index = build_int_cst (NULL_TREE, nunits - 1);
8595 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8596 build_index_type (index));
8597 tree rt = make_node (RECORD_TYPE);
8599 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8600 get_identifier ("f"), array);
8601 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8603 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8604 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8605 the representation type, and we want to find that die when looking up
8606 the vector type. This is most easily achieved by making the TYPE_UID
8608 TYPE_UID (rt) = TYPE_UID (t);
8611 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8612 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8613 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8614 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8615 t = type_hash_canon (hashcode, t);
8617 /* We have built a main variant, based on the main variant of the
8618 inner type. Use it to build the variant we return. */
8619 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8620 && TREE_TYPE (t) != innertype)
8621 return build_type_attribute_qual_variant (t,
8622 TYPE_ATTRIBUTES (innertype),
8623 TYPE_QUALS (innertype));
8629 make_or_reuse_type (unsigned size, int unsignedp)
8631 if (size == INT_TYPE_SIZE)
8632 return unsignedp ? unsigned_type_node : integer_type_node;
8633 if (size == CHAR_TYPE_SIZE)
8634 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8635 if (size == SHORT_TYPE_SIZE)
8636 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8637 if (size == LONG_TYPE_SIZE)
8638 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8639 if (size == LONG_LONG_TYPE_SIZE)
8640 return (unsignedp ? long_long_unsigned_type_node
8641 : long_long_integer_type_node);
8644 return make_unsigned_type (size);
8646 return make_signed_type (size);
8649 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8652 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8656 if (size == SHORT_FRACT_TYPE_SIZE)
8657 return unsignedp ? sat_unsigned_short_fract_type_node
8658 : sat_short_fract_type_node;
8659 if (size == FRACT_TYPE_SIZE)
8660 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8661 if (size == LONG_FRACT_TYPE_SIZE)
8662 return unsignedp ? sat_unsigned_long_fract_type_node
8663 : sat_long_fract_type_node;
8664 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8665 return unsignedp ? sat_unsigned_long_long_fract_type_node
8666 : sat_long_long_fract_type_node;
8670 if (size == SHORT_FRACT_TYPE_SIZE)
8671 return unsignedp ? unsigned_short_fract_type_node
8672 : short_fract_type_node;
8673 if (size == FRACT_TYPE_SIZE)
8674 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8675 if (size == LONG_FRACT_TYPE_SIZE)
8676 return unsignedp ? unsigned_long_fract_type_node
8677 : long_fract_type_node;
8678 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8679 return unsignedp ? unsigned_long_long_fract_type_node
8680 : long_long_fract_type_node;
8683 return make_fract_type (size, unsignedp, satp);
8686 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8689 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8693 if (size == SHORT_ACCUM_TYPE_SIZE)
8694 return unsignedp ? sat_unsigned_short_accum_type_node
8695 : sat_short_accum_type_node;
8696 if (size == ACCUM_TYPE_SIZE)
8697 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8698 if (size == LONG_ACCUM_TYPE_SIZE)
8699 return unsignedp ? sat_unsigned_long_accum_type_node
8700 : sat_long_accum_type_node;
8701 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8702 return unsignedp ? sat_unsigned_long_long_accum_type_node
8703 : sat_long_long_accum_type_node;
8707 if (size == SHORT_ACCUM_TYPE_SIZE)
8708 return unsignedp ? unsigned_short_accum_type_node
8709 : short_accum_type_node;
8710 if (size == ACCUM_TYPE_SIZE)
8711 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8712 if (size == LONG_ACCUM_TYPE_SIZE)
8713 return unsignedp ? unsigned_long_accum_type_node
8714 : long_accum_type_node;
8715 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8716 return unsignedp ? unsigned_long_long_accum_type_node
8717 : long_long_accum_type_node;
8720 return make_accum_type (size, unsignedp, satp);
8723 /* Create nodes for all integer types (and error_mark_node) using the sizes
8724 of C datatypes. The caller should call set_sizetype soon after calling
8725 this function to select one of the types as sizetype. */
8728 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
8730 error_mark_node = make_node (ERROR_MARK);
8731 TREE_TYPE (error_mark_node) = error_mark_node;
8733 initialize_sizetypes (signed_sizetype);
8735 /* Define both `signed char' and `unsigned char'. */
8736 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8737 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8738 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8739 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8741 /* Define `char', which is like either `signed char' or `unsigned char'
8742 but not the same as either. */
8745 ? make_signed_type (CHAR_TYPE_SIZE)
8746 : make_unsigned_type (CHAR_TYPE_SIZE));
8747 TYPE_STRING_FLAG (char_type_node) = 1;
8749 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8750 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8751 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8752 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8753 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8754 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8755 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8756 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8758 /* Define a boolean type. This type only represents boolean values but
8759 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8760 Front ends which want to override this size (i.e. Java) can redefine
8761 boolean_type_node before calling build_common_tree_nodes_2. */
8762 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8763 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8764 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8765 TYPE_PRECISION (boolean_type_node) = 1;
8767 /* Fill in the rest of the sized types. Reuse existing type nodes
8769 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8770 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8771 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8772 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8773 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8775 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8776 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8777 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8778 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8779 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8781 access_public_node = get_identifier ("public");
8782 access_protected_node = get_identifier ("protected");
8783 access_private_node = get_identifier ("private");
8786 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8787 It will create several other common tree nodes. */
8790 build_common_tree_nodes_2 (int short_double)
8792 /* Define these next since types below may used them. */
8793 integer_zero_node = build_int_cst (NULL_TREE, 0);
8794 integer_one_node = build_int_cst (NULL_TREE, 1);
8795 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8797 size_zero_node = size_int (0);
8798 size_one_node = size_int (1);
8799 bitsize_zero_node = bitsize_int (0);
8800 bitsize_one_node = bitsize_int (1);
8801 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8803 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8804 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8806 void_type_node = make_node (VOID_TYPE);
8807 layout_type (void_type_node);
8809 /* We are not going to have real types in C with less than byte alignment,
8810 so we might as well not have any types that claim to have it. */
8811 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8812 TYPE_USER_ALIGN (void_type_node) = 0;
8814 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8815 layout_type (TREE_TYPE (null_pointer_node));
8817 ptr_type_node = build_pointer_type (void_type_node);
8819 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8820 fileptr_type_node = ptr_type_node;
8822 float_type_node = make_node (REAL_TYPE);
8823 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8824 layout_type (float_type_node);
8826 double_type_node = make_node (REAL_TYPE);
8828 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8830 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8831 layout_type (double_type_node);
8833 long_double_type_node = make_node (REAL_TYPE);
8834 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8835 layout_type (long_double_type_node);
8837 float_ptr_type_node = build_pointer_type (float_type_node);
8838 double_ptr_type_node = build_pointer_type (double_type_node);
8839 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8840 integer_ptr_type_node = build_pointer_type (integer_type_node);
8842 /* Fixed size integer types. */
8843 uint32_type_node = build_nonstandard_integer_type (32, true);
8844 uint64_type_node = build_nonstandard_integer_type (64, true);
8846 /* Decimal float types. */
8847 dfloat32_type_node = make_node (REAL_TYPE);
8848 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8849 layout_type (dfloat32_type_node);
8850 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8851 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8853 dfloat64_type_node = make_node (REAL_TYPE);
8854 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8855 layout_type (dfloat64_type_node);
8856 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8857 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8859 dfloat128_type_node = make_node (REAL_TYPE);
8860 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8861 layout_type (dfloat128_type_node);
8862 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8863 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8865 complex_integer_type_node = build_complex_type (integer_type_node);
8866 complex_float_type_node = build_complex_type (float_type_node);
8867 complex_double_type_node = build_complex_type (double_type_node);
8868 complex_long_double_type_node = build_complex_type (long_double_type_node);
8870 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8871 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8872 sat_ ## KIND ## _type_node = \
8873 make_sat_signed_ ## KIND ## _type (SIZE); \
8874 sat_unsigned_ ## KIND ## _type_node = \
8875 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8876 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8877 unsigned_ ## KIND ## _type_node = \
8878 make_unsigned_ ## KIND ## _type (SIZE);
8880 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8881 sat_ ## WIDTH ## KIND ## _type_node = \
8882 make_sat_signed_ ## KIND ## _type (SIZE); \
8883 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8884 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8885 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8886 unsigned_ ## WIDTH ## KIND ## _type_node = \
8887 make_unsigned_ ## KIND ## _type (SIZE);
8889 /* Make fixed-point type nodes based on four different widths. */
8890 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8891 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8892 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8893 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8894 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8896 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8897 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8898 NAME ## _type_node = \
8899 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8900 u ## NAME ## _type_node = \
8901 make_or_reuse_unsigned_ ## KIND ## _type \
8902 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8903 sat_ ## NAME ## _type_node = \
8904 make_or_reuse_sat_signed_ ## KIND ## _type \
8905 (GET_MODE_BITSIZE (MODE ## mode)); \
8906 sat_u ## NAME ## _type_node = \
8907 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8908 (GET_MODE_BITSIZE (U ## MODE ## mode));
8910 /* Fixed-point type and mode nodes. */
8911 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8912 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8913 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8914 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8915 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8916 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8917 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8918 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8919 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8920 MAKE_FIXED_MODE_NODE (accum, da, DA)
8921 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8924 tree t = targetm.build_builtin_va_list ();
8926 /* Many back-ends define record types without setting TYPE_NAME.
8927 If we copied the record type here, we'd keep the original
8928 record type without a name. This breaks name mangling. So,
8929 don't copy record types and let c_common_nodes_and_builtins()
8930 declare the type to be __builtin_va_list. */
8931 if (TREE_CODE (t) != RECORD_TYPE)
8932 t = build_variant_type_copy (t);
8934 va_list_type_node = t;
8938 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8941 local_define_builtin (const char *name, tree type, enum built_in_function code,
8942 const char *library_name, int ecf_flags)
8946 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8947 library_name, NULL_TREE);
8948 if (ecf_flags & ECF_CONST)
8949 TREE_READONLY (decl) = 1;
8950 if (ecf_flags & ECF_PURE)
8951 DECL_PURE_P (decl) = 1;
8952 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8953 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8954 if (ecf_flags & ECF_NORETURN)
8955 TREE_THIS_VOLATILE (decl) = 1;
8956 if (ecf_flags & ECF_NOTHROW)
8957 TREE_NOTHROW (decl) = 1;
8958 if (ecf_flags & ECF_MALLOC)
8959 DECL_IS_MALLOC (decl) = 1;
8961 built_in_decls[code] = decl;
8962 implicit_built_in_decls[code] = decl;
8965 /* Call this function after instantiating all builtins that the language
8966 front end cares about. This will build the rest of the builtins that
8967 are relied upon by the tree optimizers and the middle-end. */
8970 build_common_builtin_nodes (void)
8972 tree tmp, tmp2, ftype;
8974 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
8975 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8977 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8978 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8979 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8980 ftype = build_function_type (ptr_type_node, tmp);
8982 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
8983 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
8984 "memcpy", ECF_NOTHROW);
8985 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8986 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
8987 "memmove", ECF_NOTHROW);
8990 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
8992 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8993 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8994 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8995 ftype = build_function_type (integer_type_node, tmp);
8996 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
8997 "memcmp", ECF_PURE | ECF_NOTHROW);
9000 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9002 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9003 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9004 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9005 ftype = build_function_type (ptr_type_node, tmp);
9006 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9007 "memset", ECF_NOTHROW);
9010 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9012 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9013 ftype = build_function_type (ptr_type_node, tmp);
9014 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9016 ECF_MALLOC | (flag_stack_check ? 0 : ECF_NOTHROW));
9019 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9020 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9021 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9022 ftype = build_function_type (void_type_node, tmp);
9023 local_define_builtin ("__builtin_init_trampoline", ftype,
9024 BUILT_IN_INIT_TRAMPOLINE,
9025 "__builtin_init_trampoline", ECF_NOTHROW);
9027 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9028 ftype = build_function_type (ptr_type_node, tmp);
9029 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9030 BUILT_IN_ADJUST_TRAMPOLINE,
9031 "__builtin_adjust_trampoline",
9032 ECF_CONST | ECF_NOTHROW);
9034 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9035 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9036 ftype = build_function_type (void_type_node, tmp);
9037 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9038 BUILT_IN_NONLOCAL_GOTO,
9039 "__builtin_nonlocal_goto",
9040 ECF_NORETURN | ECF_NOTHROW);
9042 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9043 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9044 ftype = build_function_type (void_type_node, tmp);
9045 local_define_builtin ("__builtin_setjmp_setup", ftype,
9046 BUILT_IN_SETJMP_SETUP,
9047 "__builtin_setjmp_setup", ECF_NOTHROW);
9049 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9050 ftype = build_function_type (ptr_type_node, tmp);
9051 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9052 BUILT_IN_SETJMP_DISPATCHER,
9053 "__builtin_setjmp_dispatcher",
9054 ECF_PURE | ECF_NOTHROW);
9056 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9057 ftype = build_function_type (void_type_node, tmp);
9058 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9059 BUILT_IN_SETJMP_RECEIVER,
9060 "__builtin_setjmp_receiver", ECF_NOTHROW);
9062 ftype = build_function_type (ptr_type_node, void_list_node);
9063 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9064 "__builtin_stack_save", ECF_NOTHROW);
9066 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9067 ftype = build_function_type (void_type_node, tmp);
9068 local_define_builtin ("__builtin_stack_restore", ftype,
9069 BUILT_IN_STACK_RESTORE,
9070 "__builtin_stack_restore", ECF_NOTHROW);
9072 ftype = build_function_type (void_type_node, void_list_node);
9073 local_define_builtin ("__builtin_profile_func_enter", ftype,
9074 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9075 local_define_builtin ("__builtin_profile_func_exit", ftype,
9076 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9078 /* If there's a possibility that we might use the ARM EABI, build the
9079 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9080 if (targetm.arm_eabi_unwinder)
9082 ftype = build_function_type (void_type_node, void_list_node);
9083 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9084 BUILT_IN_CXA_END_CLEANUP,
9085 "__cxa_end_cleanup", ECF_NORETURN);
9088 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9089 ftype = build_function_type (void_type_node, tmp);
9090 local_define_builtin ("__builtin_unwind_resume", ftype,
9091 BUILT_IN_UNWIND_RESUME,
9092 (USING_SJLJ_EXCEPTIONS
9093 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9096 /* The exception object and filter values from the runtime. The argument
9097 must be zero before exception lowering, i.e. from the front end. After
9098 exception lowering, it will be the region number for the exception
9099 landing pad. These functions are PURE instead of CONST to prevent
9100 them from being hoisted past the exception edge that will initialize
9101 its value in the landing pad. */
9102 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9103 ftype = build_function_type (ptr_type_node, tmp);
9104 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9105 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9107 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9108 ftype = build_function_type (tmp2, tmp);
9109 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9110 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9112 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9113 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9114 ftype = build_function_type (void_type_node, tmp);
9115 local_define_builtin ("__builtin_eh_copy_values", ftype,
9116 BUILT_IN_EH_COPY_VALUES,
9117 "__builtin_eh_copy_values", ECF_NOTHROW);
9119 /* Complex multiplication and division. These are handled as builtins
9120 rather than optabs because emit_library_call_value doesn't support
9121 complex. Further, we can do slightly better with folding these
9122 beasties if the real and complex parts of the arguments are separate. */
9126 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9128 char mode_name_buf[4], *q;
9130 enum built_in_function mcode, dcode;
9131 tree type, inner_type;
9133 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9136 inner_type = TREE_TYPE (type);
9138 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9139 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9140 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9141 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9142 ftype = build_function_type (type, tmp);
9144 mcode = ((enum built_in_function)
9145 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9146 dcode = ((enum built_in_function)
9147 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9149 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9153 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9154 local_define_builtin (built_in_names[mcode], ftype, mcode,
9155 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9157 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9158 local_define_builtin (built_in_names[dcode], ftype, dcode,
9159 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9164 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9167 If we requested a pointer to a vector, build up the pointers that
9168 we stripped off while looking for the inner type. Similarly for
9169 return values from functions.
9171 The argument TYPE is the top of the chain, and BOTTOM is the
9172 new type which we will point to. */
9175 reconstruct_complex_type (tree type, tree bottom)
9179 if (TREE_CODE (type) == POINTER_TYPE)
9181 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9182 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9183 TYPE_REF_CAN_ALIAS_ALL (type));
9185 else if (TREE_CODE (type) == REFERENCE_TYPE)
9187 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9188 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9189 TYPE_REF_CAN_ALIAS_ALL (type));
9191 else if (TREE_CODE (type) == ARRAY_TYPE)
9193 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9194 outer = build_array_type (inner, TYPE_DOMAIN (type));
9196 else if (TREE_CODE (type) == FUNCTION_TYPE)
9198 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9199 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9201 else if (TREE_CODE (type) == METHOD_TYPE)
9203 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9204 /* The build_method_type_directly() routine prepends 'this' to argument list,
9205 so we must compensate by getting rid of it. */
9207 = build_method_type_directly
9208 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9210 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9212 else if (TREE_CODE (type) == OFFSET_TYPE)
9214 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9215 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9220 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9224 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9227 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9231 switch (GET_MODE_CLASS (mode))
9233 case MODE_VECTOR_INT:
9234 case MODE_VECTOR_FLOAT:
9235 case MODE_VECTOR_FRACT:
9236 case MODE_VECTOR_UFRACT:
9237 case MODE_VECTOR_ACCUM:
9238 case MODE_VECTOR_UACCUM:
9239 nunits = GET_MODE_NUNITS (mode);
9243 /* Check that there are no leftover bits. */
9244 gcc_assert (GET_MODE_BITSIZE (mode)
9245 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9247 nunits = GET_MODE_BITSIZE (mode)
9248 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9255 return make_vector_type (innertype, nunits, mode);
9258 /* Similarly, but takes the inner type and number of units, which must be
9262 build_vector_type (tree innertype, int nunits)
9264 return make_vector_type (innertype, nunits, VOIDmode);
9267 /* Similarly, but takes the inner type and number of units, which must be
9271 build_opaque_vector_type (tree innertype, int nunits)
9274 innertype = build_distinct_type_copy (innertype);
9275 t = make_vector_type (innertype, nunits, VOIDmode);
9276 TYPE_VECTOR_OPAQUE (t) = true;
9281 /* Given an initializer INIT, return TRUE if INIT is zero or some
9282 aggregate of zeros. Otherwise return FALSE. */
9284 initializer_zerop (const_tree init)
9290 switch (TREE_CODE (init))
9293 return integer_zerop (init);
9296 /* ??? Note that this is not correct for C4X float formats. There,
9297 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9298 negative exponent. */
9299 return real_zerop (init)
9300 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9303 return fixed_zerop (init);
9306 return integer_zerop (init)
9307 || (real_zerop (init)
9308 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9309 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9312 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9313 if (!initializer_zerop (TREE_VALUE (elt)))
9319 unsigned HOST_WIDE_INT idx;
9321 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9322 if (!initializer_zerop (elt))
9332 /* Build an empty statement at location LOC. */
9335 build_empty_stmt (location_t loc)
9337 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9338 SET_EXPR_LOCATION (t, loc);
9343 /* Build an OpenMP clause with code CODE. LOC is the location of the
9347 build_omp_clause (location_t loc, enum omp_clause_code code)
9352 length = omp_clause_num_ops[code];
9353 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9355 t = GGC_NEWVAR (union tree_node, size);
9356 memset (t, 0, size);
9357 TREE_SET_CODE (t, OMP_CLAUSE);
9358 OMP_CLAUSE_SET_CODE (t, code);
9359 OMP_CLAUSE_LOCATION (t) = loc;
9361 #ifdef GATHER_STATISTICS
9362 tree_node_counts[(int) omp_clause_kind]++;
9363 tree_node_sizes[(int) omp_clause_kind] += size;
9369 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9370 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9371 Except for the CODE and operand count field, other storage for the
9372 object is initialized to zeros. */
9375 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9378 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9380 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9381 gcc_assert (len >= 1);
9383 #ifdef GATHER_STATISTICS
9384 tree_node_counts[(int) e_kind]++;
9385 tree_node_sizes[(int) e_kind] += length;
9388 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9390 memset (t, 0, length);
9392 TREE_SET_CODE (t, code);
9394 /* Can't use TREE_OPERAND to store the length because if checking is
9395 enabled, it will try to check the length before we store it. :-P */
9396 t->exp.operands[0] = build_int_cst (sizetype, len);
9402 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9403 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9407 build_call_list (tree return_type, tree fn, tree arglist)
9412 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9413 TREE_TYPE (t) = return_type;
9414 CALL_EXPR_FN (t) = fn;
9415 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9416 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9417 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9418 process_call_operands (t);
9422 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9423 FN and a null static chain slot. NARGS is the number of call arguments
9424 which are specified as "..." arguments. */
9427 build_call_nary (tree return_type, tree fn, int nargs, ...)
9431 va_start (args, nargs);
9432 ret = build_call_valist (return_type, fn, nargs, args);
9437 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9438 FN and a null static chain slot. NARGS is the number of call arguments
9439 which are specified as a va_list ARGS. */
9442 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9447 t = build_vl_exp (CALL_EXPR, nargs + 3);
9448 TREE_TYPE (t) = return_type;
9449 CALL_EXPR_FN (t) = fn;
9450 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9451 for (i = 0; i < nargs; i++)
9452 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9453 process_call_operands (t);
9457 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9458 FN and a null static chain slot. NARGS is the number of call arguments
9459 which are specified as a tree array ARGS. */
9462 build_call_array_loc (location_t loc, tree return_type, tree fn,
9463 int nargs, const tree *args)
9468 t = build_vl_exp (CALL_EXPR, nargs + 3);
9469 TREE_TYPE (t) = return_type;
9470 CALL_EXPR_FN (t) = fn;
9471 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9472 for (i = 0; i < nargs; i++)
9473 CALL_EXPR_ARG (t, i) = args[i];
9474 process_call_operands (t);
9475 SET_EXPR_LOCATION (t, loc);
9479 /* Like build_call_array, but takes a VEC. */
9482 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9487 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9488 TREE_TYPE (ret) = return_type;
9489 CALL_EXPR_FN (ret) = fn;
9490 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9491 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9492 CALL_EXPR_ARG (ret, ix) = t;
9493 process_call_operands (ret);
9498 /* Returns true if it is possible to prove that the index of
9499 an array access REF (an ARRAY_REF expression) falls into the
9503 in_array_bounds_p (tree ref)
9505 tree idx = TREE_OPERAND (ref, 1);
9508 if (TREE_CODE (idx) != INTEGER_CST)
9511 min = array_ref_low_bound (ref);
9512 max = array_ref_up_bound (ref);
9515 || TREE_CODE (min) != INTEGER_CST
9516 || TREE_CODE (max) != INTEGER_CST)
9519 if (tree_int_cst_lt (idx, min)
9520 || tree_int_cst_lt (max, idx))
9526 /* Returns true if it is possible to prove that the range of
9527 an array access REF (an ARRAY_RANGE_REF expression) falls
9528 into the array bounds. */
9531 range_in_array_bounds_p (tree ref)
9533 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9534 tree range_min, range_max, min, max;
9536 range_min = TYPE_MIN_VALUE (domain_type);
9537 range_max = TYPE_MAX_VALUE (domain_type);
9540 || TREE_CODE (range_min) != INTEGER_CST
9541 || TREE_CODE (range_max) != INTEGER_CST)
9544 min = array_ref_low_bound (ref);
9545 max = array_ref_up_bound (ref);
9548 || TREE_CODE (min) != INTEGER_CST
9549 || TREE_CODE (max) != INTEGER_CST)
9552 if (tree_int_cst_lt (range_min, min)
9553 || tree_int_cst_lt (max, range_max))
9559 /* Return true if T (assumed to be a DECL) must be assigned a memory
9563 needs_to_live_in_memory (const_tree t)
9565 if (TREE_CODE (t) == SSA_NAME)
9566 t = SSA_NAME_VAR (t);
9568 return (TREE_ADDRESSABLE (t)
9569 || is_global_var (t)
9570 || (TREE_CODE (t) == RESULT_DECL
9571 && aggregate_value_p (t, current_function_decl)));
9574 /* There are situations in which a language considers record types
9575 compatible which have different field lists. Decide if two fields
9576 are compatible. It is assumed that the parent records are compatible. */
9579 fields_compatible_p (const_tree f1, const_tree f2)
9581 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9582 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9585 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9586 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9589 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9595 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9598 find_compatible_field (tree record, tree orig_field)
9602 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9603 if (TREE_CODE (f) == FIELD_DECL
9604 && fields_compatible_p (f, orig_field))
9607 /* ??? Why isn't this on the main fields list? */
9608 f = TYPE_VFIELD (record);
9609 if (f && TREE_CODE (f) == FIELD_DECL
9610 && fields_compatible_p (f, orig_field))
9613 /* ??? We should abort here, but Java appears to do Bad Things
9614 with inherited fields. */
9618 /* Return value of a constant X and sign-extend it. */
9621 int_cst_value (const_tree x)
9623 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9624 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9626 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9627 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9628 || TREE_INT_CST_HIGH (x) == -1);
9630 if (bits < HOST_BITS_PER_WIDE_INT)
9632 bool negative = ((val >> (bits - 1)) & 1) != 0;
9634 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9636 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9642 /* Return value of a constant X and sign-extend it. */
9645 widest_int_cst_value (const_tree x)
9647 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9648 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9650 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9651 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9652 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9653 << HOST_BITS_PER_WIDE_INT);
9655 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9656 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9657 || TREE_INT_CST_HIGH (x) == -1);
9660 if (bits < HOST_BITS_PER_WIDEST_INT)
9662 bool negative = ((val >> (bits - 1)) & 1) != 0;
9664 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9666 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9672 /* If TYPE is an integral type, return an equivalent type which is
9673 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9674 return TYPE itself. */
9677 signed_or_unsigned_type_for (int unsignedp, tree type)
9680 if (POINTER_TYPE_P (type))
9682 /* If the pointer points to the normal address space, use the
9683 size_type_node. Otherwise use an appropriate size for the pointer
9684 based on the named address space it points to. */
9685 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9690 int prec = int_or_pointer_precision (t);
9691 return lang_hooks.types.type_for_size (prec, unsignedp);
9695 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9698 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9701 /* Returns unsigned variant of TYPE. */
9704 unsigned_type_for (tree type)
9706 return signed_or_unsigned_type_for (1, type);
9709 /* Returns signed variant of TYPE. */
9712 signed_type_for (tree type)
9714 return signed_or_unsigned_type_for (0, type);
9717 /* Returns the largest value obtainable by casting something in INNER type to
9721 upper_bound_in_type (tree outer, tree inner)
9723 unsigned HOST_WIDE_INT lo, hi;
9724 unsigned int det = 0;
9725 unsigned oprec = TYPE_PRECISION (outer);
9726 unsigned iprec = TYPE_PRECISION (inner);
9729 /* Compute a unique number for every combination. */
9730 det |= (oprec > iprec) ? 4 : 0;
9731 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9732 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9734 /* Determine the exponent to use. */
9739 /* oprec <= iprec, outer: signed, inner: don't care. */
9744 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9748 /* oprec > iprec, outer: signed, inner: signed. */
9752 /* oprec > iprec, outer: signed, inner: unsigned. */
9756 /* oprec > iprec, outer: unsigned, inner: signed. */
9760 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9767 /* Compute 2^^prec - 1. */
9768 if (prec <= HOST_BITS_PER_WIDE_INT)
9771 lo = ((~(unsigned HOST_WIDE_INT) 0)
9772 >> (HOST_BITS_PER_WIDE_INT - prec));
9776 hi = ((~(unsigned HOST_WIDE_INT) 0)
9777 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9778 lo = ~(unsigned HOST_WIDE_INT) 0;
9781 return build_int_cst_wide (outer, lo, hi);
9784 /* Returns the smallest value obtainable by casting something in INNER type to
9788 lower_bound_in_type (tree outer, tree inner)
9790 unsigned HOST_WIDE_INT lo, hi;
9791 unsigned oprec = TYPE_PRECISION (outer);
9792 unsigned iprec = TYPE_PRECISION (inner);
9794 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9796 if (TYPE_UNSIGNED (outer)
9797 /* If we are widening something of an unsigned type, OUTER type
9798 contains all values of INNER type. In particular, both INNER
9799 and OUTER types have zero in common. */
9800 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9804 /* If we are widening a signed type to another signed type, we
9805 want to obtain -2^^(iprec-1). If we are keeping the
9806 precision or narrowing to a signed type, we want to obtain
9808 unsigned prec = oprec > iprec ? iprec : oprec;
9810 if (prec <= HOST_BITS_PER_WIDE_INT)
9812 hi = ~(unsigned HOST_WIDE_INT) 0;
9813 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9817 hi = ((~(unsigned HOST_WIDE_INT) 0)
9818 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9823 return build_int_cst_wide (outer, lo, hi);
9826 /* Return nonzero if two operands that are suitable for PHI nodes are
9827 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9828 SSA_NAME or invariant. Note that this is strictly an optimization.
9829 That is, callers of this function can directly call operand_equal_p
9830 and get the same result, only slower. */
9833 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9837 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9839 return operand_equal_p (arg0, arg1, 0);
9842 /* Returns number of zeros at the end of binary representation of X.
9844 ??? Use ffs if available? */
9847 num_ending_zeros (const_tree x)
9849 unsigned HOST_WIDE_INT fr, nfr;
9850 unsigned num, abits;
9851 tree type = TREE_TYPE (x);
9853 if (TREE_INT_CST_LOW (x) == 0)
9855 num = HOST_BITS_PER_WIDE_INT;
9856 fr = TREE_INT_CST_HIGH (x);
9861 fr = TREE_INT_CST_LOW (x);
9864 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9867 if (nfr << abits == fr)
9874 if (num > TYPE_PRECISION (type))
9875 num = TYPE_PRECISION (type);
9877 return build_int_cst_type (type, num);
9881 #define WALK_SUBTREE(NODE) \
9884 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9890 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9891 be walked whenever a type is seen in the tree. Rest of operands and return
9892 value are as for walk_tree. */
9895 walk_type_fields (tree type, walk_tree_fn func, void *data,
9896 struct pointer_set_t *pset, walk_tree_lh lh)
9898 tree result = NULL_TREE;
9900 switch (TREE_CODE (type))
9903 case REFERENCE_TYPE:
9904 /* We have to worry about mutually recursive pointers. These can't
9905 be written in C. They can in Ada. It's pathological, but
9906 there's an ACATS test (c38102a) that checks it. Deal with this
9907 by checking if we're pointing to another pointer, that one
9908 points to another pointer, that one does too, and we have no htab.
9909 If so, get a hash table. We check three levels deep to avoid
9910 the cost of the hash table if we don't need one. */
9911 if (POINTER_TYPE_P (TREE_TYPE (type))
9912 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9913 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9916 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9924 /* ... fall through ... */
9927 WALK_SUBTREE (TREE_TYPE (type));
9931 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9936 WALK_SUBTREE (TREE_TYPE (type));
9940 /* We never want to walk into default arguments. */
9941 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9942 WALK_SUBTREE (TREE_VALUE (arg));
9947 /* Don't follow this nodes's type if a pointer for fear that
9948 we'll have infinite recursion. If we have a PSET, then we
9951 || (!POINTER_TYPE_P (TREE_TYPE (type))
9952 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9953 WALK_SUBTREE (TREE_TYPE (type));
9954 WALK_SUBTREE (TYPE_DOMAIN (type));
9958 WALK_SUBTREE (TREE_TYPE (type));
9959 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9969 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9970 called with the DATA and the address of each sub-tree. If FUNC returns a
9971 non-NULL value, the traversal is stopped, and the value returned by FUNC
9972 is returned. If PSET is non-NULL it is used to record the nodes visited,
9973 and to avoid visiting a node more than once. */
9976 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
9977 struct pointer_set_t *pset, walk_tree_lh lh)
9979 enum tree_code code;
9983 #define WALK_SUBTREE_TAIL(NODE) \
9987 goto tail_recurse; \
9992 /* Skip empty subtrees. */
9996 /* Don't walk the same tree twice, if the user has requested
9997 that we avoid doing so. */
9998 if (pset && pointer_set_insert (pset, *tp))
10001 /* Call the function. */
10003 result = (*func) (tp, &walk_subtrees, data);
10005 /* If we found something, return it. */
10009 code = TREE_CODE (*tp);
10011 /* Even if we didn't, FUNC may have decided that there was nothing
10012 interesting below this point in the tree. */
10013 if (!walk_subtrees)
10015 /* But we still need to check our siblings. */
10016 if (code == TREE_LIST)
10017 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10018 else if (code == OMP_CLAUSE)
10019 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10026 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10027 if (result || !walk_subtrees)
10034 case IDENTIFIER_NODE:
10041 case PLACEHOLDER_EXPR:
10045 /* None of these have subtrees other than those already walked
10050 WALK_SUBTREE (TREE_VALUE (*tp));
10051 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10056 int len = TREE_VEC_LENGTH (*tp);
10061 /* Walk all elements but the first. */
10063 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10065 /* Now walk the first one as a tail call. */
10066 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10070 WALK_SUBTREE (TREE_REALPART (*tp));
10071 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10075 unsigned HOST_WIDE_INT idx;
10076 constructor_elt *ce;
10079 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10081 WALK_SUBTREE (ce->value);
10086 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10091 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10093 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10094 into declarations that are just mentioned, rather than
10095 declared; they don't really belong to this part of the tree.
10096 And, we can see cycles: the initializer for a declaration
10097 can refer to the declaration itself. */
10098 WALK_SUBTREE (DECL_INITIAL (decl));
10099 WALK_SUBTREE (DECL_SIZE (decl));
10100 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10102 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10105 case STATEMENT_LIST:
10107 tree_stmt_iterator i;
10108 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10109 WALK_SUBTREE (*tsi_stmt_ptr (i));
10114 switch (OMP_CLAUSE_CODE (*tp))
10116 case OMP_CLAUSE_PRIVATE:
10117 case OMP_CLAUSE_SHARED:
10118 case OMP_CLAUSE_FIRSTPRIVATE:
10119 case OMP_CLAUSE_COPYIN:
10120 case OMP_CLAUSE_COPYPRIVATE:
10121 case OMP_CLAUSE_IF:
10122 case OMP_CLAUSE_NUM_THREADS:
10123 case OMP_CLAUSE_SCHEDULE:
10124 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10127 case OMP_CLAUSE_NOWAIT:
10128 case OMP_CLAUSE_ORDERED:
10129 case OMP_CLAUSE_DEFAULT:
10130 case OMP_CLAUSE_UNTIED:
10131 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10133 case OMP_CLAUSE_LASTPRIVATE:
10134 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10135 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10136 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10138 case OMP_CLAUSE_COLLAPSE:
10141 for (i = 0; i < 3; i++)
10142 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10143 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10146 case OMP_CLAUSE_REDUCTION:
10149 for (i = 0; i < 4; i++)
10150 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10151 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10155 gcc_unreachable ();
10163 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10164 But, we only want to walk once. */
10165 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10166 for (i = 0; i < len; ++i)
10167 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10168 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10172 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10173 defining. We only want to walk into these fields of a type in this
10174 case and not in the general case of a mere reference to the type.
10176 The criterion is as follows: if the field can be an expression, it
10177 must be walked only here. This should be in keeping with the fields
10178 that are directly gimplified in gimplify_type_sizes in order for the
10179 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10180 variable-sized types.
10182 Note that DECLs get walked as part of processing the BIND_EXPR. */
10183 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10185 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10186 if (TREE_CODE (*type_p) == ERROR_MARK)
10189 /* Call the function for the type. See if it returns anything or
10190 doesn't want us to continue. If we are to continue, walk both
10191 the normal fields and those for the declaration case. */
10192 result = (*func) (type_p, &walk_subtrees, data);
10193 if (result || !walk_subtrees)
10196 result = walk_type_fields (*type_p, func, data, pset, lh);
10200 /* If this is a record type, also walk the fields. */
10201 if (RECORD_OR_UNION_TYPE_P (*type_p))
10205 for (field = TYPE_FIELDS (*type_p); field;
10206 field = TREE_CHAIN (field))
10208 /* We'd like to look at the type of the field, but we can
10209 easily get infinite recursion. So assume it's pointed
10210 to elsewhere in the tree. Also, ignore things that
10212 if (TREE_CODE (field) != FIELD_DECL)
10215 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10216 WALK_SUBTREE (DECL_SIZE (field));
10217 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10218 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10219 WALK_SUBTREE (DECL_QUALIFIER (field));
10223 /* Same for scalar types. */
10224 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10225 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10226 || TREE_CODE (*type_p) == INTEGER_TYPE
10227 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10228 || TREE_CODE (*type_p) == REAL_TYPE)
10230 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10231 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10234 WALK_SUBTREE (TYPE_SIZE (*type_p));
10235 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10240 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10244 /* Walk over all the sub-trees of this operand. */
10245 len = TREE_OPERAND_LENGTH (*tp);
10247 /* Go through the subtrees. We need to do this in forward order so
10248 that the scope of a FOR_EXPR is handled properly. */
10251 for (i = 0; i < len - 1; ++i)
10252 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10253 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10256 /* If this is a type, walk the needed fields in the type. */
10257 else if (TYPE_P (*tp))
10258 return walk_type_fields (*tp, func, data, pset, lh);
10262 /* We didn't find what we were looking for. */
10265 #undef WALK_SUBTREE_TAIL
10267 #undef WALK_SUBTREE
10269 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10272 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10276 struct pointer_set_t *pset;
10278 pset = pointer_set_create ();
10279 result = walk_tree_1 (tp, func, data, pset, lh);
10280 pointer_set_destroy (pset);
10286 tree_block (tree t)
10288 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10290 if (IS_EXPR_CODE_CLASS (c))
10291 return &t->exp.block;
10292 gcc_unreachable ();
10296 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10297 FIXME: don't use this function. It exists for compatibility with
10298 the old representation of CALL_EXPRs where a list was used to hold the
10299 arguments. Places that currently extract the arglist from a CALL_EXPR
10300 ought to be rewritten to use the CALL_EXPR itself. */
10302 call_expr_arglist (tree exp)
10304 tree arglist = NULL_TREE;
10306 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10307 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10312 /* Create a nameless artificial label and put it in the current
10313 function context. The label has a location of LOC. Returns the
10314 newly created label. */
10317 create_artificial_label (location_t loc)
10319 tree lab = build_decl (loc,
10320 LABEL_DECL, NULL_TREE, void_type_node);
10322 DECL_ARTIFICIAL (lab) = 1;
10323 DECL_IGNORED_P (lab) = 1;
10324 DECL_CONTEXT (lab) = current_function_decl;
10328 /* Given a tree, try to return a useful variable name that we can use
10329 to prefix a temporary that is being assigned the value of the tree.
10330 I.E. given <temp> = &A, return A. */
10335 tree stripped_decl;
10338 STRIP_NOPS (stripped_decl);
10339 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10340 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10343 switch (TREE_CODE (stripped_decl))
10346 return get_name (TREE_OPERAND (stripped_decl, 0));
10353 /* Return true if TYPE has a variable argument list. */
10356 stdarg_p (tree fntype)
10358 function_args_iterator args_iter;
10359 tree n = NULL_TREE, t;
10364 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10369 return n != NULL_TREE && n != void_type_node;
10372 /* Return true if TYPE has a prototype. */
10375 prototype_p (tree fntype)
10379 gcc_assert (fntype != NULL_TREE);
10381 t = TYPE_ARG_TYPES (fntype);
10382 return (t != NULL_TREE);
10385 /* If BLOCK is inlined from an __attribute__((__artificial__))
10386 routine, return pointer to location from where it has been
10389 block_nonartificial_location (tree block)
10391 location_t *ret = NULL;
10393 while (block && TREE_CODE (block) == BLOCK
10394 && BLOCK_ABSTRACT_ORIGIN (block))
10396 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10398 while (TREE_CODE (ao) == BLOCK
10399 && BLOCK_ABSTRACT_ORIGIN (ao)
10400 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10401 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10403 if (TREE_CODE (ao) == FUNCTION_DECL)
10405 /* If AO is an artificial inline, point RET to the
10406 call site locus at which it has been inlined and continue
10407 the loop, in case AO's caller is also an artificial
10409 if (DECL_DECLARED_INLINE_P (ao)
10410 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10411 ret = &BLOCK_SOURCE_LOCATION (block);
10415 else if (TREE_CODE (ao) != BLOCK)
10418 block = BLOCK_SUPERCONTEXT (block);
10424 /* If EXP is inlined from an __attribute__((__artificial__))
10425 function, return the location of the original call expression. */
10428 tree_nonartificial_location (tree exp)
10430 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10435 return EXPR_LOCATION (exp);
10439 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10442 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10445 cl_option_hash_hash (const void *x)
10447 const_tree const t = (const_tree) x;
10451 hashval_t hash = 0;
10453 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10455 p = (const char *)TREE_OPTIMIZATION (t);
10456 len = sizeof (struct cl_optimization);
10459 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10461 p = (const char *)TREE_TARGET_OPTION (t);
10462 len = sizeof (struct cl_target_option);
10466 gcc_unreachable ();
10468 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10470 for (i = 0; i < len; i++)
10472 hash = (hash << 4) ^ ((i << 2) | p[i]);
10477 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10478 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10482 cl_option_hash_eq (const void *x, const void *y)
10484 const_tree const xt = (const_tree) x;
10485 const_tree const yt = (const_tree) y;
10490 if (TREE_CODE (xt) != TREE_CODE (yt))
10493 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10495 xp = (const char *)TREE_OPTIMIZATION (xt);
10496 yp = (const char *)TREE_OPTIMIZATION (yt);
10497 len = sizeof (struct cl_optimization);
10500 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10502 xp = (const char *)TREE_TARGET_OPTION (xt);
10503 yp = (const char *)TREE_TARGET_OPTION (yt);
10504 len = sizeof (struct cl_target_option);
10508 gcc_unreachable ();
10510 return (memcmp (xp, yp, len) == 0);
10513 /* Build an OPTIMIZATION_NODE based on the current options. */
10516 build_optimization_node (void)
10521 /* Use the cache of optimization nodes. */
10523 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10525 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10529 /* Insert this one into the hash table. */
10530 t = cl_optimization_node;
10533 /* Make a new node for next time round. */
10534 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10540 /* Build a TARGET_OPTION_NODE based on the current options. */
10543 build_target_option_node (void)
10548 /* Use the cache of optimization nodes. */
10550 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10552 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10556 /* Insert this one into the hash table. */
10557 t = cl_target_option_node;
10560 /* Make a new node for next time round. */
10561 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10567 /* Return the size in bits of an integer or pointer type. TYPE_PRECISION
10568 contains the bits, but in the past it was not set in some cases and there
10569 was special purpose code that checked for POINTER_TYPE_P or OFFSET_TYPE, so
10570 check that it is consitant when assertion checking is used. */
10573 int_or_pointer_precision (const_tree type)
10575 #if ENABLE_ASSERT_CHECKING
10578 if (POINTER_TYPE_P (type))
10580 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (type));
10581 prec = GET_MODE_BITSIZE (targetm.addr_space.pointer_mode (as));
10582 gcc_assert (prec == TYPE_PRECISION (type));
10584 else if (TREE_CODE (type) == OFFSET_TYPE)
10586 prec = POINTER_SIZE;
10587 gcc_assert (prec == TYPE_PRECISION (type));
10591 prec = TYPE_PRECISION (type);
10592 gcc_assert (prec != 0);
10598 return TYPE_PRECISION (type);
10602 /* Determine the "ultimate origin" of a block. The block may be an inlined
10603 instance of an inlined instance of a block which is local to an inline
10604 function, so we have to trace all of the way back through the origin chain
10605 to find out what sort of node actually served as the original seed for the
10609 block_ultimate_origin (const_tree block)
10611 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10613 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10614 nodes in the function to point to themselves; ignore that if
10615 we're trying to output the abstract instance of this function. */
10616 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10619 if (immediate_origin == NULL_TREE)
10624 tree lookahead = immediate_origin;
10628 ret_val = lookahead;
10629 lookahead = (TREE_CODE (ret_val) == BLOCK
10630 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10632 while (lookahead != NULL && lookahead != ret_val);
10634 /* The block's abstract origin chain may not be the *ultimate* origin of
10635 the block. It could lead to a DECL that has an abstract origin set.
10636 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10637 will give us if it has one). Note that DECL's abstract origins are
10638 supposed to be the most distant ancestor (or so decl_ultimate_origin
10639 claims), so we don't need to loop following the DECL origins. */
10640 if (DECL_P (ret_val))
10641 return DECL_ORIGIN (ret_val);
10647 /* Return true if T1 and T2 are equivalent lists. */
10650 list_equal_p (const_tree t1, const_tree t2)
10652 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10653 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10658 /* Return true iff conversion in EXP generates no instruction. Mark
10659 it inline so that we fully inline into the stripping functions even
10660 though we have two uses of this function. */
10663 tree_nop_conversion (const_tree exp)
10665 tree outer_type, inner_type;
10667 if (!CONVERT_EXPR_P (exp)
10668 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10670 if (TREE_OPERAND (exp, 0) == error_mark_node)
10673 outer_type = TREE_TYPE (exp);
10674 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10676 /* Use precision rather then machine mode when we can, which gives
10677 the correct answer even for submode (bit-field) types. */
10678 if ((INTEGRAL_TYPE_P (outer_type)
10679 || POINTER_TYPE_P (outer_type)
10680 || TREE_CODE (outer_type) == OFFSET_TYPE)
10681 && (INTEGRAL_TYPE_P (inner_type)
10682 || POINTER_TYPE_P (inner_type)
10683 || TREE_CODE (inner_type) == OFFSET_TYPE))
10684 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10686 /* Otherwise fall back on comparing machine modes (e.g. for
10687 aggregate types, floats). */
10688 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10691 /* Return true iff conversion in EXP generates no instruction. Don't
10692 consider conversions changing the signedness. */
10695 tree_sign_nop_conversion (const_tree exp)
10697 tree outer_type, inner_type;
10699 if (!tree_nop_conversion (exp))
10702 outer_type = TREE_TYPE (exp);
10703 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10705 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10706 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10709 /* Strip conversions from EXP according to tree_nop_conversion and
10710 return the resulting expression. */
10713 tree_strip_nop_conversions (tree exp)
10715 while (tree_nop_conversion (exp))
10716 exp = TREE_OPERAND (exp, 0);
10720 /* Strip conversions from EXP according to tree_sign_nop_conversion
10721 and return the resulting expression. */
10724 tree_strip_sign_nop_conversions (tree exp)
10726 while (tree_sign_nop_conversion (exp))
10727 exp = TREE_OPERAND (exp, 0);
10731 static GTY(()) tree gcc_eh_personality_decl;
10733 /* Return the GCC personality function decl. */
10736 lhd_gcc_personality (void)
10738 if (!gcc_eh_personality_decl)
10739 gcc_eh_personality_decl
10740 = build_personality_function (USING_SJLJ_EXCEPTIONS
10741 ? "__gcc_personality_sj0"
10742 : "__gcc_personality_v0");
10744 return gcc_eh_personality_decl;
10747 #include "gt-tree.h"