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;
958 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
959 *DECL_VAR_ANN_PTR (t) = 0;
961 if (TREE_CODE_CLASS (code) == tcc_declaration)
963 if (code == DEBUG_EXPR_DECL)
964 DECL_UID (t) = --next_debug_decl_uid;
966 DECL_UID (t) = next_decl_uid++;
967 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
968 && DECL_HAS_VALUE_EXPR_P (node))
970 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
971 DECL_HAS_VALUE_EXPR_P (t) = 1;
973 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
975 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
976 DECL_HAS_INIT_PRIORITY_P (t) = 1;
979 else if (TREE_CODE_CLASS (code) == tcc_type)
981 TYPE_UID (t) = next_type_uid++;
982 /* The following is so that the debug code for
983 the copy is different from the original type.
984 The two statements usually duplicate each other
985 (because they clear fields of the same union),
986 but the optimizer should catch that. */
987 TYPE_SYMTAB_POINTER (t) = 0;
988 TYPE_SYMTAB_ADDRESS (t) = 0;
990 /* Do not copy the values cache. */
991 if (TYPE_CACHED_VALUES_P(t))
993 TYPE_CACHED_VALUES_P (t) = 0;
994 TYPE_CACHED_VALUES (t) = NULL_TREE;
1001 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1002 For example, this can copy a list made of TREE_LIST nodes. */
1005 copy_list (tree list)
1013 head = prev = copy_node (list);
1014 next = TREE_CHAIN (list);
1017 TREE_CHAIN (prev) = copy_node (next);
1018 prev = TREE_CHAIN (prev);
1019 next = TREE_CHAIN (next);
1025 /* Create an INT_CST node with a LOW value sign extended. */
1028 build_int_cst (tree type, HOST_WIDE_INT low)
1030 /* Support legacy code. */
1032 type = integer_type_node;
1034 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1037 /* Create an INT_CST node with a LOW value zero extended. */
1040 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1042 return build_int_cst_wide (type, low, 0);
1045 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1046 if it is negative. This function is similar to build_int_cst, but
1047 the extra bits outside of the type precision are cleared. Constants
1048 with these extra bits may confuse the fold so that it detects overflows
1049 even in cases when they do not occur, and in general should be avoided.
1050 We cannot however make this a default behavior of build_int_cst without
1051 more intrusive changes, since there are parts of gcc that rely on the extra
1052 precision of the integer constants. */
1055 build_int_cst_type (tree type, HOST_WIDE_INT low)
1057 unsigned HOST_WIDE_INT low1;
1062 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1064 return build_int_cst_wide (type, low1, hi);
1067 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1068 and sign extended according to the value range of TYPE. */
1071 build_int_cst_wide_type (tree type,
1072 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1074 fit_double_type (low, high, &low, &high, type);
1075 return build_int_cst_wide (type, low, high);
1078 /* These are the hash table functions for the hash table of INTEGER_CST
1079 nodes of a sizetype. */
1081 /* Return the hash code code X, an INTEGER_CST. */
1084 int_cst_hash_hash (const void *x)
1086 const_tree const t = (const_tree) x;
1088 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1089 ^ htab_hash_pointer (TREE_TYPE (t)));
1092 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1093 is the same as that given by *Y, which is the same. */
1096 int_cst_hash_eq (const void *x, const void *y)
1098 const_tree const xt = (const_tree) x;
1099 const_tree const yt = (const_tree) y;
1101 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1102 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1103 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1106 /* Create an INT_CST node of TYPE and value HI:LOW.
1107 The returned node is always shared. For small integers we use a
1108 per-type vector cache, for larger ones we use a single hash table. */
1111 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1119 switch (TREE_CODE (type))
1122 case REFERENCE_TYPE:
1123 /* Cache NULL pointer. */
1132 /* Cache false or true. */
1140 if (TYPE_UNSIGNED (type))
1143 limit = INTEGER_SHARE_LIMIT;
1144 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1150 limit = INTEGER_SHARE_LIMIT + 1;
1151 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1153 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1167 /* Look for it in the type's vector of small shared ints. */
1168 if (!TYPE_CACHED_VALUES_P (type))
1170 TYPE_CACHED_VALUES_P (type) = 1;
1171 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1174 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1177 /* Make sure no one is clobbering the shared constant. */
1178 gcc_assert (TREE_TYPE (t) == type);
1179 gcc_assert (TREE_INT_CST_LOW (t) == low);
1180 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1184 /* Create a new shared int. */
1185 t = make_node (INTEGER_CST);
1187 TREE_INT_CST_LOW (t) = low;
1188 TREE_INT_CST_HIGH (t) = hi;
1189 TREE_TYPE (t) = type;
1191 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1196 /* Use the cache of larger shared ints. */
1199 TREE_INT_CST_LOW (int_cst_node) = low;
1200 TREE_INT_CST_HIGH (int_cst_node) = hi;
1201 TREE_TYPE (int_cst_node) = type;
1203 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1207 /* Insert this one into the hash table. */
1210 /* Make a new node for next time round. */
1211 int_cst_node = make_node (INTEGER_CST);
1218 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1219 and the rest are zeros. */
1222 build_low_bits_mask (tree type, unsigned bits)
1224 unsigned HOST_WIDE_INT low;
1226 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1228 gcc_assert (bits <= TYPE_PRECISION (type));
1230 if (bits == TYPE_PRECISION (type)
1231 && !TYPE_UNSIGNED (type))
1233 /* Sign extended all-ones mask. */
1237 else if (bits <= HOST_BITS_PER_WIDE_INT)
1239 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1244 bits -= HOST_BITS_PER_WIDE_INT;
1246 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1249 return build_int_cst_wide (type, low, high);
1252 /* Checks that X is integer constant that can be expressed in (unsigned)
1253 HOST_WIDE_INT without loss of precision. */
1256 cst_and_fits_in_hwi (const_tree x)
1258 if (TREE_CODE (x) != INTEGER_CST)
1261 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1264 return (TREE_INT_CST_HIGH (x) == 0
1265 || TREE_INT_CST_HIGH (x) == -1);
1268 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1269 are in a list pointed to by VALS. */
1272 build_vector (tree type, tree vals)
1274 tree v = make_node (VECTOR_CST);
1278 TREE_VECTOR_CST_ELTS (v) = vals;
1279 TREE_TYPE (v) = type;
1281 /* Iterate through elements and check for overflow. */
1282 for (link = vals; link; link = TREE_CHAIN (link))
1284 tree value = TREE_VALUE (link);
1286 /* Don't crash if we get an address constant. */
1287 if (!CONSTANT_CLASS_P (value))
1290 over |= TREE_OVERFLOW (value);
1293 TREE_OVERFLOW (v) = over;
1297 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1298 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1301 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1303 tree list = NULL_TREE;
1304 unsigned HOST_WIDE_INT idx;
1307 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1308 list = tree_cons (NULL_TREE, value, list);
1309 return build_vector (type, nreverse (list));
1312 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1313 are in the VEC pointed to by VALS. */
1315 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1317 tree c = make_node (CONSTRUCTOR);
1318 TREE_TYPE (c) = type;
1319 CONSTRUCTOR_ELTS (c) = vals;
1323 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1326 build_constructor_single (tree type, tree index, tree value)
1328 VEC(constructor_elt,gc) *v;
1329 constructor_elt *elt;
1332 v = VEC_alloc (constructor_elt, gc, 1);
1333 elt = VEC_quick_push (constructor_elt, v, NULL);
1337 t = build_constructor (type, v);
1338 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1343 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1344 are in a list pointed to by VALS. */
1346 build_constructor_from_list (tree type, tree vals)
1349 VEC(constructor_elt,gc) *v = NULL;
1350 bool constant_p = true;
1354 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1355 for (t = vals; t; t = TREE_CHAIN (t))
1357 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1358 val = TREE_VALUE (t);
1359 elt->index = TREE_PURPOSE (t);
1361 if (!TREE_CONSTANT (val))
1366 t = build_constructor (type, v);
1367 TREE_CONSTANT (t) = constant_p;
1371 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1374 build_fixed (tree type, FIXED_VALUE_TYPE f)
1377 FIXED_VALUE_TYPE *fp;
1379 v = make_node (FIXED_CST);
1380 fp = GGC_NEW (FIXED_VALUE_TYPE);
1381 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1383 TREE_TYPE (v) = type;
1384 TREE_FIXED_CST_PTR (v) = fp;
1388 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1391 build_real (tree type, REAL_VALUE_TYPE d)
1394 REAL_VALUE_TYPE *dp;
1397 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1398 Consider doing it via real_convert now. */
1400 v = make_node (REAL_CST);
1401 dp = GGC_NEW (REAL_VALUE_TYPE);
1402 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1404 TREE_TYPE (v) = type;
1405 TREE_REAL_CST_PTR (v) = dp;
1406 TREE_OVERFLOW (v) = overflow;
1410 /* Return a new REAL_CST node whose type is TYPE
1411 and whose value is the integer value of the INTEGER_CST node I. */
1414 real_value_from_int_cst (const_tree type, const_tree i)
1418 /* Clear all bits of the real value type so that we can later do
1419 bitwise comparisons to see if two values are the same. */
1420 memset (&d, 0, sizeof d);
1422 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1423 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1424 TYPE_UNSIGNED (TREE_TYPE (i)));
1428 /* Given a tree representing an integer constant I, return a tree
1429 representing the same value as a floating-point constant of type TYPE. */
1432 build_real_from_int_cst (tree type, const_tree i)
1435 int overflow = TREE_OVERFLOW (i);
1437 v = build_real (type, real_value_from_int_cst (type, i));
1439 TREE_OVERFLOW (v) |= overflow;
1443 /* Return a newly constructed STRING_CST node whose value is
1444 the LEN characters at STR.
1445 The TREE_TYPE is not initialized. */
1448 build_string (int len, const char *str)
1453 /* Do not waste bytes provided by padding of struct tree_string. */
1454 length = len + offsetof (struct tree_string, str) + 1;
1456 #ifdef GATHER_STATISTICS
1457 tree_node_counts[(int) c_kind]++;
1458 tree_node_sizes[(int) c_kind] += length;
1461 s = ggc_alloc_tree (length);
1463 memset (s, 0, sizeof (struct tree_common));
1464 TREE_SET_CODE (s, STRING_CST);
1465 TREE_CONSTANT (s) = 1;
1466 TREE_STRING_LENGTH (s) = len;
1467 memcpy (s->string.str, str, len);
1468 s->string.str[len] = '\0';
1473 /* Return a newly constructed COMPLEX_CST node whose value is
1474 specified by the real and imaginary parts REAL and IMAG.
1475 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1476 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1479 build_complex (tree type, tree real, tree imag)
1481 tree t = make_node (COMPLEX_CST);
1483 TREE_REALPART (t) = real;
1484 TREE_IMAGPART (t) = imag;
1485 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1486 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1490 /* Return a constant of arithmetic type TYPE which is the
1491 multiplicative identity of the set TYPE. */
1494 build_one_cst (tree type)
1496 switch (TREE_CODE (type))
1498 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1499 case POINTER_TYPE: case REFERENCE_TYPE:
1501 return build_int_cst (type, 1);
1504 return build_real (type, dconst1);
1506 case FIXED_POINT_TYPE:
1507 /* We can only generate 1 for accum types. */
1508 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1509 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1516 scalar = build_one_cst (TREE_TYPE (type));
1518 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1520 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1521 cst = tree_cons (NULL_TREE, scalar, cst);
1523 return build_vector (type, cst);
1527 return build_complex (type,
1528 build_one_cst (TREE_TYPE (type)),
1529 fold_convert (TREE_TYPE (type), integer_zero_node));
1536 /* Build a BINFO with LEN language slots. */
1539 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1542 size_t length = (offsetof (struct tree_binfo, base_binfos)
1543 + VEC_embedded_size (tree, base_binfos));
1545 #ifdef GATHER_STATISTICS
1546 tree_node_counts[(int) binfo_kind]++;
1547 tree_node_sizes[(int) binfo_kind] += length;
1550 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1552 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1554 TREE_SET_CODE (t, TREE_BINFO);
1556 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1562 /* Build a newly constructed TREE_VEC node of length LEN. */
1565 make_tree_vec_stat (int len MEM_STAT_DECL)
1568 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1570 #ifdef GATHER_STATISTICS
1571 tree_node_counts[(int) vec_kind]++;
1572 tree_node_sizes[(int) vec_kind] += length;
1575 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1577 memset (t, 0, length);
1579 TREE_SET_CODE (t, TREE_VEC);
1580 TREE_VEC_LENGTH (t) = len;
1585 /* Return 1 if EXPR is the integer constant zero or a complex constant
1589 integer_zerop (const_tree expr)
1593 return ((TREE_CODE (expr) == INTEGER_CST
1594 && TREE_INT_CST_LOW (expr) == 0
1595 && TREE_INT_CST_HIGH (expr) == 0)
1596 || (TREE_CODE (expr) == COMPLEX_CST
1597 && integer_zerop (TREE_REALPART (expr))
1598 && integer_zerop (TREE_IMAGPART (expr))));
1601 /* Return 1 if EXPR is the integer constant one or the corresponding
1602 complex constant. */
1605 integer_onep (const_tree expr)
1609 return ((TREE_CODE (expr) == INTEGER_CST
1610 && TREE_INT_CST_LOW (expr) == 1
1611 && TREE_INT_CST_HIGH (expr) == 0)
1612 || (TREE_CODE (expr) == COMPLEX_CST
1613 && integer_onep (TREE_REALPART (expr))
1614 && integer_zerop (TREE_IMAGPART (expr))));
1617 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1618 it contains. Likewise for the corresponding complex constant. */
1621 integer_all_onesp (const_tree expr)
1628 if (TREE_CODE (expr) == COMPLEX_CST
1629 && integer_all_onesp (TREE_REALPART (expr))
1630 && integer_zerop (TREE_IMAGPART (expr)))
1633 else if (TREE_CODE (expr) != INTEGER_CST)
1636 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1637 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1638 && TREE_INT_CST_HIGH (expr) == -1)
1643 /* Note that using TYPE_PRECISION here is wrong. We care about the
1644 actual bits, not the (arbitrary) range of the type. */
1645 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1646 if (prec >= HOST_BITS_PER_WIDE_INT)
1648 HOST_WIDE_INT high_value;
1651 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1653 /* Can not handle precisions greater than twice the host int size. */
1654 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1655 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1656 /* Shifting by the host word size is undefined according to the ANSI
1657 standard, so we must handle this as a special case. */
1660 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1662 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1663 && TREE_INT_CST_HIGH (expr) == high_value);
1666 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1669 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1673 integer_pow2p (const_tree expr)
1676 HOST_WIDE_INT high, low;
1680 if (TREE_CODE (expr) == COMPLEX_CST
1681 && integer_pow2p (TREE_REALPART (expr))
1682 && integer_zerop (TREE_IMAGPART (expr)))
1685 if (TREE_CODE (expr) != INTEGER_CST)
1688 prec = TYPE_PRECISION (TREE_TYPE (expr));
1689 high = TREE_INT_CST_HIGH (expr);
1690 low = TREE_INT_CST_LOW (expr);
1692 /* First clear all bits that are beyond the type's precision in case
1693 we've been sign extended. */
1695 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1697 else if (prec > HOST_BITS_PER_WIDE_INT)
1698 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1702 if (prec < HOST_BITS_PER_WIDE_INT)
1703 low &= ~((HOST_WIDE_INT) (-1) << prec);
1706 if (high == 0 && low == 0)
1709 return ((high == 0 && (low & (low - 1)) == 0)
1710 || (low == 0 && (high & (high - 1)) == 0));
1713 /* Return 1 if EXPR is an integer constant other than zero or a
1714 complex constant other than zero. */
1717 integer_nonzerop (const_tree expr)
1721 return ((TREE_CODE (expr) == INTEGER_CST
1722 && (TREE_INT_CST_LOW (expr) != 0
1723 || TREE_INT_CST_HIGH (expr) != 0))
1724 || (TREE_CODE (expr) == COMPLEX_CST
1725 && (integer_nonzerop (TREE_REALPART (expr))
1726 || integer_nonzerop (TREE_IMAGPART (expr)))));
1729 /* Return 1 if EXPR is the fixed-point constant zero. */
1732 fixed_zerop (const_tree expr)
1734 return (TREE_CODE (expr) == FIXED_CST
1735 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1738 /* Return the power of two represented by a tree node known to be a
1742 tree_log2 (const_tree expr)
1745 HOST_WIDE_INT high, low;
1749 if (TREE_CODE (expr) == COMPLEX_CST)
1750 return tree_log2 (TREE_REALPART (expr));
1752 prec = TYPE_PRECISION (TREE_TYPE (expr));
1753 high = TREE_INT_CST_HIGH (expr);
1754 low = TREE_INT_CST_LOW (expr);
1756 /* First clear all bits that are beyond the type's precision in case
1757 we've been sign extended. */
1759 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1761 else if (prec > HOST_BITS_PER_WIDE_INT)
1762 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1766 if (prec < HOST_BITS_PER_WIDE_INT)
1767 low &= ~((HOST_WIDE_INT) (-1) << prec);
1770 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1771 : exact_log2 (low));
1774 /* Similar, but return the largest integer Y such that 2 ** Y is less
1775 than or equal to EXPR. */
1778 tree_floor_log2 (const_tree expr)
1781 HOST_WIDE_INT high, low;
1785 if (TREE_CODE (expr) == COMPLEX_CST)
1786 return tree_log2 (TREE_REALPART (expr));
1788 prec = TYPE_PRECISION (TREE_TYPE (expr));
1789 high = TREE_INT_CST_HIGH (expr);
1790 low = TREE_INT_CST_LOW (expr);
1792 /* First clear all bits that are beyond the type's precision in case
1793 we've been sign extended. Ignore if type's precision hasn't been set
1794 since what we are doing is setting it. */
1796 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1798 else if (prec > HOST_BITS_PER_WIDE_INT)
1799 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1803 if (prec < HOST_BITS_PER_WIDE_INT)
1804 low &= ~((HOST_WIDE_INT) (-1) << prec);
1807 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1808 : floor_log2 (low));
1811 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1812 decimal float constants, so don't return 1 for them. */
1815 real_zerop (const_tree expr)
1819 return ((TREE_CODE (expr) == REAL_CST
1820 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1821 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1822 || (TREE_CODE (expr) == COMPLEX_CST
1823 && real_zerop (TREE_REALPART (expr))
1824 && real_zerop (TREE_IMAGPART (expr))));
1827 /* Return 1 if EXPR is the real constant one in real or complex form.
1828 Trailing zeroes matter for decimal float constants, so don't return
1832 real_onep (const_tree expr)
1836 return ((TREE_CODE (expr) == REAL_CST
1837 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1838 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1839 || (TREE_CODE (expr) == COMPLEX_CST
1840 && real_onep (TREE_REALPART (expr))
1841 && real_zerop (TREE_IMAGPART (expr))));
1844 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1845 for decimal float constants, so don't return 1 for them. */
1848 real_twop (const_tree expr)
1852 return ((TREE_CODE (expr) == REAL_CST
1853 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1854 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1855 || (TREE_CODE (expr) == COMPLEX_CST
1856 && real_twop (TREE_REALPART (expr))
1857 && real_zerop (TREE_IMAGPART (expr))));
1860 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1861 matter for decimal float constants, so don't return 1 for them. */
1864 real_minus_onep (const_tree expr)
1868 return ((TREE_CODE (expr) == REAL_CST
1869 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1870 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1871 || (TREE_CODE (expr) == COMPLEX_CST
1872 && real_minus_onep (TREE_REALPART (expr))
1873 && real_zerop (TREE_IMAGPART (expr))));
1876 /* Nonzero if EXP is a constant or a cast of a constant. */
1879 really_constant_p (const_tree exp)
1881 /* This is not quite the same as STRIP_NOPS. It does more. */
1882 while (CONVERT_EXPR_P (exp)
1883 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1884 exp = TREE_OPERAND (exp, 0);
1885 return TREE_CONSTANT (exp);
1888 /* Return first list element whose TREE_VALUE is ELEM.
1889 Return 0 if ELEM is not in LIST. */
1892 value_member (tree elem, tree list)
1896 if (elem == TREE_VALUE (list))
1898 list = TREE_CHAIN (list);
1903 /* Return first list element whose TREE_PURPOSE is ELEM.
1904 Return 0 if ELEM is not in LIST. */
1907 purpose_member (const_tree elem, tree list)
1911 if (elem == TREE_PURPOSE (list))
1913 list = TREE_CHAIN (list);
1918 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1922 chain_index (int idx, tree chain)
1924 for (; chain && idx > 0; --idx)
1925 chain = TREE_CHAIN (chain);
1929 /* Return nonzero if ELEM is part of the chain CHAIN. */
1932 chain_member (const_tree elem, const_tree chain)
1938 chain = TREE_CHAIN (chain);
1944 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1945 We expect a null pointer to mark the end of the chain.
1946 This is the Lisp primitive `length'. */
1949 list_length (const_tree t)
1952 #ifdef ENABLE_TREE_CHECKING
1960 #ifdef ENABLE_TREE_CHECKING
1963 gcc_assert (p != q);
1971 /* Returns the number of FIELD_DECLs in TYPE. */
1974 fields_length (const_tree type)
1976 tree t = TYPE_FIELDS (type);
1979 for (; t; t = TREE_CHAIN (t))
1980 if (TREE_CODE (t) == FIELD_DECL)
1986 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
1987 UNION_TYPE TYPE, or NULL_TREE if none. */
1990 first_field (const_tree type)
1992 tree t = TYPE_FIELDS (type);
1993 while (t && TREE_CODE (t) != FIELD_DECL)
1998 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1999 by modifying the last node in chain 1 to point to chain 2.
2000 This is the Lisp primitive `nconc'. */
2003 chainon (tree op1, tree op2)
2012 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2014 TREE_CHAIN (t1) = op2;
2016 #ifdef ENABLE_TREE_CHECKING
2019 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2020 gcc_assert (t2 != t1);
2027 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2030 tree_last (tree chain)
2034 while ((next = TREE_CHAIN (chain)))
2039 /* Reverse the order of elements in the chain T,
2040 and return the new head of the chain (old last element). */
2045 tree prev = 0, decl, next;
2046 for (decl = t; decl; decl = next)
2048 next = TREE_CHAIN (decl);
2049 TREE_CHAIN (decl) = prev;
2055 /* Return a newly created TREE_LIST node whose
2056 purpose and value fields are PARM and VALUE. */
2059 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2061 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2062 TREE_PURPOSE (t) = parm;
2063 TREE_VALUE (t) = value;
2067 /* Build a chain of TREE_LIST nodes from a vector. */
2070 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2072 tree ret = NULL_TREE;
2076 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2078 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2079 pp = &TREE_CHAIN (*pp);
2084 /* Return a newly created TREE_LIST node whose
2085 purpose and value fields are PURPOSE and VALUE
2086 and whose TREE_CHAIN is CHAIN. */
2089 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2093 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2095 memset (node, 0, sizeof (struct tree_common));
2097 #ifdef GATHER_STATISTICS
2098 tree_node_counts[(int) x_kind]++;
2099 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2102 TREE_SET_CODE (node, TREE_LIST);
2103 TREE_CHAIN (node) = chain;
2104 TREE_PURPOSE (node) = purpose;
2105 TREE_VALUE (node) = value;
2109 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2112 ctor_to_list (tree ctor)
2114 tree list = NULL_TREE;
2119 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2121 *p = build_tree_list (purpose, val);
2122 p = &TREE_CHAIN (*p);
2128 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2132 ctor_to_vec (tree ctor)
2134 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2138 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2139 VEC_quick_push (tree, vec, val);
2144 /* Return the size nominally occupied by an object of type TYPE
2145 when it resides in memory. The value is measured in units of bytes,
2146 and its data type is that normally used for type sizes
2147 (which is the first type created by make_signed_type or
2148 make_unsigned_type). */
2151 size_in_bytes (const_tree type)
2155 if (type == error_mark_node)
2156 return integer_zero_node;
2158 type = TYPE_MAIN_VARIANT (type);
2159 t = TYPE_SIZE_UNIT (type);
2163 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2164 return size_zero_node;
2170 /* Return the size of TYPE (in bytes) as a wide integer
2171 or return -1 if the size can vary or is larger than an integer. */
2174 int_size_in_bytes (const_tree type)
2178 if (type == error_mark_node)
2181 type = TYPE_MAIN_VARIANT (type);
2182 t = TYPE_SIZE_UNIT (type);
2184 || TREE_CODE (t) != INTEGER_CST
2185 || TREE_INT_CST_HIGH (t) != 0
2186 /* If the result would appear negative, it's too big to represent. */
2187 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2190 return TREE_INT_CST_LOW (t);
2193 /* Return the maximum size of TYPE (in bytes) as a wide integer
2194 or return -1 if the size can vary or is larger than an integer. */
2197 max_int_size_in_bytes (const_tree type)
2199 HOST_WIDE_INT size = -1;
2202 /* If this is an array type, check for a possible MAX_SIZE attached. */
2204 if (TREE_CODE (type) == ARRAY_TYPE)
2206 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2208 if (size_tree && host_integerp (size_tree, 1))
2209 size = tree_low_cst (size_tree, 1);
2212 /* If we still haven't been able to get a size, see if the language
2213 can compute a maximum size. */
2217 size_tree = lang_hooks.types.max_size (type);
2219 if (size_tree && host_integerp (size_tree, 1))
2220 size = tree_low_cst (size_tree, 1);
2226 /* Returns a tree for the size of EXP in bytes. */
2229 tree_expr_size (const_tree exp)
2232 && DECL_SIZE_UNIT (exp) != 0)
2233 return DECL_SIZE_UNIT (exp);
2235 return size_in_bytes (TREE_TYPE (exp));
2238 /* Return the bit position of FIELD, in bits from the start of the record.
2239 This is a tree of type bitsizetype. */
2242 bit_position (const_tree field)
2244 return bit_from_pos (DECL_FIELD_OFFSET (field),
2245 DECL_FIELD_BIT_OFFSET (field));
2248 /* Likewise, but return as an integer. It must be representable in
2249 that way (since it could be a signed value, we don't have the
2250 option of returning -1 like int_size_in_byte can. */
2253 int_bit_position (const_tree field)
2255 return tree_low_cst (bit_position (field), 0);
2258 /* Return the byte position of FIELD, in bytes from the start of the record.
2259 This is a tree of type sizetype. */
2262 byte_position (const_tree field)
2264 return byte_from_pos (DECL_FIELD_OFFSET (field),
2265 DECL_FIELD_BIT_OFFSET (field));
2268 /* Likewise, but return as an integer. It must be representable in
2269 that way (since it could be a signed value, we don't have the
2270 option of returning -1 like int_size_in_byte can. */
2273 int_byte_position (const_tree field)
2275 return tree_low_cst (byte_position (field), 0);
2278 /* Return the strictest alignment, in bits, that T is known to have. */
2281 expr_align (const_tree t)
2283 unsigned int align0, align1;
2285 switch (TREE_CODE (t))
2287 CASE_CONVERT: case NON_LVALUE_EXPR:
2288 /* If we have conversions, we know that the alignment of the
2289 object must meet each of the alignments of the types. */
2290 align0 = expr_align (TREE_OPERAND (t, 0));
2291 align1 = TYPE_ALIGN (TREE_TYPE (t));
2292 return MAX (align0, align1);
2294 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2295 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2296 case CLEANUP_POINT_EXPR:
2297 /* These don't change the alignment of an object. */
2298 return expr_align (TREE_OPERAND (t, 0));
2301 /* The best we can do is say that the alignment is the least aligned
2303 align0 = expr_align (TREE_OPERAND (t, 1));
2304 align1 = expr_align (TREE_OPERAND (t, 2));
2305 return MIN (align0, align1);
2307 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2308 meaningfully, it's always 1. */
2309 case LABEL_DECL: case CONST_DECL:
2310 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2312 gcc_assert (DECL_ALIGN (t) != 0);
2313 return DECL_ALIGN (t);
2319 /* Otherwise take the alignment from that of the type. */
2320 return TYPE_ALIGN (TREE_TYPE (t));
2323 /* Return, as a tree node, the number of elements for TYPE (which is an
2324 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2327 array_type_nelts (const_tree type)
2329 tree index_type, min, max;
2331 /* If they did it with unspecified bounds, then we should have already
2332 given an error about it before we got here. */
2333 if (! TYPE_DOMAIN (type))
2334 return error_mark_node;
2336 index_type = TYPE_DOMAIN (type);
2337 min = TYPE_MIN_VALUE (index_type);
2338 max = TYPE_MAX_VALUE (index_type);
2340 return (integer_zerop (min)
2342 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2345 /* If arg is static -- a reference to an object in static storage -- then
2346 return the object. This is not the same as the C meaning of `static'.
2347 If arg isn't static, return NULL. */
2352 switch (TREE_CODE (arg))
2355 /* Nested functions are static, even though taking their address will
2356 involve a trampoline as we unnest the nested function and create
2357 the trampoline on the tree level. */
2361 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2362 && ! DECL_THREAD_LOCAL_P (arg)
2363 && ! DECL_DLLIMPORT_P (arg)
2367 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2371 return TREE_STATIC (arg) ? arg : NULL;
2378 /* If the thing being referenced is not a field, then it is
2379 something language specific. */
2380 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2382 /* If we are referencing a bitfield, we can't evaluate an
2383 ADDR_EXPR at compile time and so it isn't a constant. */
2384 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2387 return staticp (TREE_OPERAND (arg, 0));
2392 case MISALIGNED_INDIRECT_REF:
2393 case ALIGN_INDIRECT_REF:
2395 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2398 case ARRAY_RANGE_REF:
2399 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2400 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2401 return staticp (TREE_OPERAND (arg, 0));
2405 case COMPOUND_LITERAL_EXPR:
2406 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2416 /* Return whether OP is a DECL whose address is function-invariant. */
2419 decl_address_invariant_p (const_tree op)
2421 /* The conditions below are slightly less strict than the one in
2424 switch (TREE_CODE (op))
2433 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2434 && !DECL_DLLIMPORT_P (op))
2435 || DECL_THREAD_LOCAL_P (op)
2436 || DECL_CONTEXT (op) == current_function_decl
2437 || decl_function_context (op) == current_function_decl)
2442 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2443 || decl_function_context (op) == current_function_decl)
2454 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2457 decl_address_ip_invariant_p (const_tree op)
2459 /* The conditions below are slightly less strict than the one in
2462 switch (TREE_CODE (op))
2470 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2471 && !DECL_DLLIMPORT_P (op))
2472 || DECL_THREAD_LOCAL_P (op))
2477 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2489 /* Return true if T is function-invariant (internal function, does
2490 not handle arithmetic; that's handled in skip_simple_arithmetic and
2491 tree_invariant_p). */
2493 static bool tree_invariant_p (tree t);
2496 tree_invariant_p_1 (tree t)
2500 if (TREE_CONSTANT (t)
2501 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2504 switch (TREE_CODE (t))
2510 op = TREE_OPERAND (t, 0);
2511 while (handled_component_p (op))
2513 switch (TREE_CODE (op))
2516 case ARRAY_RANGE_REF:
2517 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2518 || TREE_OPERAND (op, 2) != NULL_TREE
2519 || TREE_OPERAND (op, 3) != NULL_TREE)
2524 if (TREE_OPERAND (op, 2) != NULL_TREE)
2530 op = TREE_OPERAND (op, 0);
2533 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2542 /* Return true if T is function-invariant. */
2545 tree_invariant_p (tree t)
2547 tree inner = skip_simple_arithmetic (t);
2548 return tree_invariant_p_1 (inner);
2551 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2552 Do this to any expression which may be used in more than one place,
2553 but must be evaluated only once.
2555 Normally, expand_expr would reevaluate the expression each time.
2556 Calling save_expr produces something that is evaluated and recorded
2557 the first time expand_expr is called on it. Subsequent calls to
2558 expand_expr just reuse the recorded value.
2560 The call to expand_expr that generates code that actually computes
2561 the value is the first call *at compile time*. Subsequent calls
2562 *at compile time* generate code to use the saved value.
2563 This produces correct result provided that *at run time* control
2564 always flows through the insns made by the first expand_expr
2565 before reaching the other places where the save_expr was evaluated.
2566 You, the caller of save_expr, must make sure this is so.
2568 Constants, and certain read-only nodes, are returned with no
2569 SAVE_EXPR because that is safe. Expressions containing placeholders
2570 are not touched; see tree.def for an explanation of what these
2574 save_expr (tree expr)
2576 tree t = fold (expr);
2579 /* If the tree evaluates to a constant, then we don't want to hide that
2580 fact (i.e. this allows further folding, and direct checks for constants).
2581 However, a read-only object that has side effects cannot be bypassed.
2582 Since it is no problem to reevaluate literals, we just return the
2584 inner = skip_simple_arithmetic (t);
2585 if (TREE_CODE (inner) == ERROR_MARK)
2588 if (tree_invariant_p_1 (inner))
2591 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2592 it means that the size or offset of some field of an object depends on
2593 the value within another field.
2595 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2596 and some variable since it would then need to be both evaluated once and
2597 evaluated more than once. Front-ends must assure this case cannot
2598 happen by surrounding any such subexpressions in their own SAVE_EXPR
2599 and forcing evaluation at the proper time. */
2600 if (contains_placeholder_p (inner))
2603 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2604 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2606 /* This expression might be placed ahead of a jump to ensure that the
2607 value was computed on both sides of the jump. So make sure it isn't
2608 eliminated as dead. */
2609 TREE_SIDE_EFFECTS (t) = 1;
2613 /* Look inside EXPR and into any simple arithmetic operations. Return
2614 the innermost non-arithmetic node. */
2617 skip_simple_arithmetic (tree expr)
2621 /* We don't care about whether this can be used as an lvalue in this
2623 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2624 expr = TREE_OPERAND (expr, 0);
2626 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2627 a constant, it will be more efficient to not make another SAVE_EXPR since
2628 it will allow better simplification and GCSE will be able to merge the
2629 computations if they actually occur. */
2633 if (UNARY_CLASS_P (inner))
2634 inner = TREE_OPERAND (inner, 0);
2635 else if (BINARY_CLASS_P (inner))
2637 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2638 inner = TREE_OPERAND (inner, 0);
2639 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2640 inner = TREE_OPERAND (inner, 1);
2652 /* Return which tree structure is used by T. */
2654 enum tree_node_structure_enum
2655 tree_node_structure (const_tree t)
2657 const enum tree_code code = TREE_CODE (t);
2658 return tree_node_structure_for_code (code);
2661 /* Set various status flags when building a CALL_EXPR object T. */
2664 process_call_operands (tree t)
2666 bool side_effects = TREE_SIDE_EFFECTS (t);
2667 bool read_only = false;
2668 int i = call_expr_flags (t);
2670 /* Calls have side-effects, except those to const or pure functions. */
2671 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2672 side_effects = true;
2673 /* Propagate TREE_READONLY of arguments for const functions. */
2677 if (!side_effects || read_only)
2678 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2680 tree op = TREE_OPERAND (t, i);
2681 if (op && TREE_SIDE_EFFECTS (op))
2682 side_effects = true;
2683 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2687 TREE_SIDE_EFFECTS (t) = side_effects;
2688 TREE_READONLY (t) = read_only;
2691 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2692 or offset that depends on a field within a record. */
2695 contains_placeholder_p (const_tree exp)
2697 enum tree_code code;
2702 code = TREE_CODE (exp);
2703 if (code == PLACEHOLDER_EXPR)
2706 switch (TREE_CODE_CLASS (code))
2709 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2710 position computations since they will be converted into a
2711 WITH_RECORD_EXPR involving the reference, which will assume
2712 here will be valid. */
2713 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2715 case tcc_exceptional:
2716 if (code == TREE_LIST)
2717 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2718 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2723 case tcc_comparison:
2724 case tcc_expression:
2728 /* Ignoring the first operand isn't quite right, but works best. */
2729 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2732 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2733 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2734 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2737 /* The save_expr function never wraps anything containing
2738 a PLACEHOLDER_EXPR. */
2745 switch (TREE_CODE_LENGTH (code))
2748 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2750 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2751 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2762 const_call_expr_arg_iterator iter;
2763 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2764 if (CONTAINS_PLACEHOLDER_P (arg))
2778 /* Return true if any part of the computation of TYPE involves a
2779 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2780 (for QUAL_UNION_TYPE) and field positions. */
2783 type_contains_placeholder_1 (const_tree type)
2785 /* If the size contains a placeholder or the parent type (component type in
2786 the case of arrays) type involves a placeholder, this type does. */
2787 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2788 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2789 || (TREE_TYPE (type) != 0
2790 && type_contains_placeholder_p (TREE_TYPE (type))))
2793 /* Now do type-specific checks. Note that the last part of the check above
2794 greatly limits what we have to do below. */
2795 switch (TREE_CODE (type))
2803 case REFERENCE_TYPE:
2811 case FIXED_POINT_TYPE:
2812 /* Here we just check the bounds. */
2813 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2814 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2817 /* We're already checked the component type (TREE_TYPE), so just check
2819 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2823 case QUAL_UNION_TYPE:
2827 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2828 if (TREE_CODE (field) == FIELD_DECL
2829 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2830 || (TREE_CODE (type) == QUAL_UNION_TYPE
2831 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2832 || type_contains_placeholder_p (TREE_TYPE (field))))
2844 type_contains_placeholder_p (tree type)
2848 /* If the contains_placeholder_bits field has been initialized,
2849 then we know the answer. */
2850 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2851 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2853 /* Indicate that we've seen this type node, and the answer is false.
2854 This is what we want to return if we run into recursion via fields. */
2855 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2857 /* Compute the real value. */
2858 result = type_contains_placeholder_1 (type);
2860 /* Store the real value. */
2861 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2866 /* Push tree EXP onto vector QUEUE if it is not already present. */
2869 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2874 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2875 if (simple_cst_equal (iter, exp) == 1)
2879 VEC_safe_push (tree, heap, *queue, exp);
2882 /* Given a tree EXP, find all occurences of references to fields
2883 in a PLACEHOLDER_EXPR and place them in vector REFS without
2884 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2885 we assume here that EXP contains only arithmetic expressions
2886 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2890 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2892 enum tree_code code = TREE_CODE (exp);
2896 /* We handle TREE_LIST and COMPONENT_REF separately. */
2897 if (code == TREE_LIST)
2899 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2900 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2902 else if (code == COMPONENT_REF)
2904 for (inner = TREE_OPERAND (exp, 0);
2905 REFERENCE_CLASS_P (inner);
2906 inner = TREE_OPERAND (inner, 0))
2909 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2910 push_without_duplicates (exp, refs);
2912 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2915 switch (TREE_CODE_CLASS (code))
2920 case tcc_declaration:
2921 /* Variables allocated to static storage can stay. */
2922 if (!TREE_STATIC (exp))
2923 push_without_duplicates (exp, refs);
2926 case tcc_expression:
2927 /* This is the pattern built in ada/make_aligning_type. */
2928 if (code == ADDR_EXPR
2929 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2931 push_without_duplicates (exp, refs);
2935 /* Fall through... */
2937 case tcc_exceptional:
2940 case tcc_comparison:
2942 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2943 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2947 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2948 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2956 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2957 return a tree with all occurrences of references to F in a
2958 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2959 CONST_DECLs. Note that we assume here that EXP contains only
2960 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2961 occurring only in their argument list. */
2964 substitute_in_expr (tree exp, tree f, tree r)
2966 enum tree_code code = TREE_CODE (exp);
2967 tree op0, op1, op2, op3;
2970 /* We handle TREE_LIST and COMPONENT_REF separately. */
2971 if (code == TREE_LIST)
2973 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2974 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2975 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2978 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2980 else if (code == COMPONENT_REF)
2984 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2985 and it is the right field, replace it with R. */
2986 for (inner = TREE_OPERAND (exp, 0);
2987 REFERENCE_CLASS_P (inner);
2988 inner = TREE_OPERAND (inner, 0))
2992 op1 = TREE_OPERAND (exp, 1);
2994 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2997 /* If this expression hasn't been completed let, leave it alone. */
2998 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3001 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3002 if (op0 == TREE_OPERAND (exp, 0))
3006 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3009 switch (TREE_CODE_CLASS (code))
3014 case tcc_declaration:
3020 case tcc_expression:
3024 /* Fall through... */
3026 case tcc_exceptional:
3029 case tcc_comparison:
3031 switch (TREE_CODE_LENGTH (code))
3037 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3038 if (op0 == TREE_OPERAND (exp, 0))
3041 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3045 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3046 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3048 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3051 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3055 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3056 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3057 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3059 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3060 && op2 == TREE_OPERAND (exp, 2))
3063 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3067 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3068 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3069 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3070 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3072 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3073 && op2 == TREE_OPERAND (exp, 2)
3074 && op3 == TREE_OPERAND (exp, 3))
3078 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3090 new_tree = NULL_TREE;
3092 /* If we are trying to replace F with a constant, inline back
3093 functions which do nothing else than computing a value from
3094 the arguments they are passed. This makes it possible to
3095 fold partially or entirely the replacement expression. */
3096 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3098 tree t = maybe_inline_call_in_expr (exp);
3100 return SUBSTITUTE_IN_EXPR (t, f, r);
3103 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3105 tree op = TREE_OPERAND (exp, i);
3106 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3110 new_tree = copy_node (exp);
3111 TREE_OPERAND (new_tree, i) = new_op;
3117 new_tree = fold (new_tree);
3118 if (TREE_CODE (new_tree) == CALL_EXPR)
3119 process_call_operands (new_tree);
3130 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3134 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3135 for it within OBJ, a tree that is an object or a chain of references. */
3138 substitute_placeholder_in_expr (tree exp, tree obj)
3140 enum tree_code code = TREE_CODE (exp);
3141 tree op0, op1, op2, op3;
3144 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3145 in the chain of OBJ. */
3146 if (code == PLACEHOLDER_EXPR)
3148 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
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 (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3164 for (elt = obj; elt != 0;
3165 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3166 || TREE_CODE (elt) == COND_EXPR)
3167 ? TREE_OPERAND (elt, 1)
3168 : (REFERENCE_CLASS_P (elt)
3169 || UNARY_CLASS_P (elt)
3170 || BINARY_CLASS_P (elt)
3171 || VL_EXP_CLASS_P (elt)
3172 || EXPRESSION_CLASS_P (elt))
3173 ? TREE_OPERAND (elt, 0) : 0))
3174 if (POINTER_TYPE_P (TREE_TYPE (elt))
3175 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3177 return fold_build1 (INDIRECT_REF, need_type, elt);
3179 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3180 survives until RTL generation, there will be an error. */
3184 /* TREE_LIST is special because we need to look at TREE_VALUE
3185 and TREE_CHAIN, not TREE_OPERANDS. */
3186 else if (code == TREE_LIST)
3188 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3189 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3190 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3193 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3196 switch (TREE_CODE_CLASS (code))
3199 case tcc_declaration:
3202 case tcc_exceptional:
3205 case tcc_comparison:
3206 case tcc_expression:
3209 switch (TREE_CODE_LENGTH (code))
3215 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3216 if (op0 == TREE_OPERAND (exp, 0))
3219 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3223 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3224 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3226 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3229 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3233 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3234 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3235 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3237 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3238 && op2 == TREE_OPERAND (exp, 2))
3241 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3245 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3246 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3247 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3248 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3250 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3251 && op2 == TREE_OPERAND (exp, 2)
3252 && op3 == TREE_OPERAND (exp, 3))
3256 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3268 new_tree = NULL_TREE;
3270 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3272 tree op = TREE_OPERAND (exp, i);
3273 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3277 new_tree = copy_node (exp);
3278 TREE_OPERAND (new_tree, i) = new_op;
3284 new_tree = fold (new_tree);
3285 if (TREE_CODE (new_tree) == CALL_EXPR)
3286 process_call_operands (new_tree);
3297 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3301 /* Stabilize a reference so that we can use it any number of times
3302 without causing its operands to be evaluated more than once.
3303 Returns the stabilized reference. This works by means of save_expr,
3304 so see the caveats in the comments about save_expr.
3306 Also allows conversion expressions whose operands are references.
3307 Any other kind of expression is returned unchanged. */
3310 stabilize_reference (tree ref)
3313 enum tree_code code = TREE_CODE (ref);
3320 /* No action is needed in this case. */
3325 case FIX_TRUNC_EXPR:
3326 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3330 result = build_nt (INDIRECT_REF,
3331 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3335 result = build_nt (COMPONENT_REF,
3336 stabilize_reference (TREE_OPERAND (ref, 0)),
3337 TREE_OPERAND (ref, 1), NULL_TREE);
3341 result = build_nt (BIT_FIELD_REF,
3342 stabilize_reference (TREE_OPERAND (ref, 0)),
3343 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3344 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3348 result = build_nt (ARRAY_REF,
3349 stabilize_reference (TREE_OPERAND (ref, 0)),
3350 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3351 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3354 case ARRAY_RANGE_REF:
3355 result = build_nt (ARRAY_RANGE_REF,
3356 stabilize_reference (TREE_OPERAND (ref, 0)),
3357 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3358 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3362 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3363 it wouldn't be ignored. This matters when dealing with
3365 return stabilize_reference_1 (ref);
3367 /* If arg isn't a kind of lvalue we recognize, make no change.
3368 Caller should recognize the error for an invalid lvalue. */
3373 return error_mark_node;
3376 TREE_TYPE (result) = TREE_TYPE (ref);
3377 TREE_READONLY (result) = TREE_READONLY (ref);
3378 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3379 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3384 /* Subroutine of stabilize_reference; this is called for subtrees of
3385 references. Any expression with side-effects must be put in a SAVE_EXPR
3386 to ensure that it is only evaluated once.
3388 We don't put SAVE_EXPR nodes around everything, because assigning very
3389 simple expressions to temporaries causes us to miss good opportunities
3390 for optimizations. Among other things, the opportunity to fold in the
3391 addition of a constant into an addressing mode often gets lost, e.g.
3392 "y[i+1] += x;". In general, we take the approach that we should not make
3393 an assignment unless we are forced into it - i.e., that any non-side effect
3394 operator should be allowed, and that cse should take care of coalescing
3395 multiple utterances of the same expression should that prove fruitful. */
3398 stabilize_reference_1 (tree e)
3401 enum tree_code code = TREE_CODE (e);
3403 /* We cannot ignore const expressions because it might be a reference
3404 to a const array but whose index contains side-effects. But we can
3405 ignore things that are actual constant or that already have been
3406 handled by this function. */
3408 if (tree_invariant_p (e))
3411 switch (TREE_CODE_CLASS (code))
3413 case tcc_exceptional:
3415 case tcc_declaration:
3416 case tcc_comparison:
3418 case tcc_expression:
3421 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3422 so that it will only be evaluated once. */
3423 /* The reference (r) and comparison (<) classes could be handled as
3424 below, but it is generally faster to only evaluate them once. */
3425 if (TREE_SIDE_EFFECTS (e))
3426 return save_expr (e);
3430 /* Constants need no processing. In fact, we should never reach
3435 /* Division is slow and tends to be compiled with jumps,
3436 especially the division by powers of 2 that is often
3437 found inside of an array reference. So do it just once. */
3438 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3439 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3440 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3441 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3442 return save_expr (e);
3443 /* Recursively stabilize each operand. */
3444 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3445 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3449 /* Recursively stabilize each operand. */
3450 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3457 TREE_TYPE (result) = TREE_TYPE (e);
3458 TREE_READONLY (result) = TREE_READONLY (e);
3459 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3460 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3465 /* Low-level constructors for expressions. */
3467 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3468 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3471 recompute_tree_invariant_for_addr_expr (tree t)
3474 bool tc = true, se = false;
3476 /* We started out assuming this address is both invariant and constant, but
3477 does not have side effects. Now go down any handled components and see if
3478 any of them involve offsets that are either non-constant or non-invariant.
3479 Also check for side-effects.
3481 ??? Note that this code makes no attempt to deal with the case where
3482 taking the address of something causes a copy due to misalignment. */
3484 #define UPDATE_FLAGS(NODE) \
3485 do { tree _node = (NODE); \
3486 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3487 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3489 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3490 node = TREE_OPERAND (node, 0))
3492 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3493 array reference (probably made temporarily by the G++ front end),
3494 so ignore all the operands. */
3495 if ((TREE_CODE (node) == ARRAY_REF
3496 || TREE_CODE (node) == ARRAY_RANGE_REF)
3497 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3499 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3500 if (TREE_OPERAND (node, 2))
3501 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3502 if (TREE_OPERAND (node, 3))
3503 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3505 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3506 FIELD_DECL, apparently. The G++ front end can put something else
3507 there, at least temporarily. */
3508 else if (TREE_CODE (node) == COMPONENT_REF
3509 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3511 if (TREE_OPERAND (node, 2))
3512 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3514 else if (TREE_CODE (node) == BIT_FIELD_REF)
3515 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3518 node = lang_hooks.expr_to_decl (node, &tc, &se);
3520 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3521 the address, since &(*a)->b is a form of addition. If it's a constant, the
3522 address is constant too. If it's a decl, its address is constant if the
3523 decl is static. Everything else is not constant and, furthermore,
3524 taking the address of a volatile variable is not volatile. */
3525 if (TREE_CODE (node) == INDIRECT_REF)
3526 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3527 else if (CONSTANT_CLASS_P (node))
3529 else if (DECL_P (node))
3530 tc &= (staticp (node) != NULL_TREE);
3534 se |= TREE_SIDE_EFFECTS (node);
3538 TREE_CONSTANT (t) = tc;
3539 TREE_SIDE_EFFECTS (t) = se;
3543 /* Build an expression of code CODE, data type TYPE, and operands as
3544 specified. Expressions and reference nodes can be created this way.
3545 Constants, decls, types and misc nodes cannot be.
3547 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3548 enough for all extant tree codes. */
3551 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3555 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3557 t = make_node_stat (code PASS_MEM_STAT);
3564 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3566 int length = sizeof (struct tree_exp);
3567 #ifdef GATHER_STATISTICS
3568 tree_node_kind kind;
3572 #ifdef GATHER_STATISTICS
3573 switch (TREE_CODE_CLASS (code))
3575 case tcc_statement: /* an expression with side effects */
3578 case tcc_reference: /* a reference */
3586 tree_node_counts[(int) kind]++;
3587 tree_node_sizes[(int) kind] += length;
3590 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3592 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3594 memset (t, 0, sizeof (struct tree_common));
3596 TREE_SET_CODE (t, code);
3598 TREE_TYPE (t) = type;
3599 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3600 TREE_OPERAND (t, 0) = node;
3601 TREE_BLOCK (t) = NULL_TREE;
3602 if (node && !TYPE_P (node))
3604 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3605 TREE_READONLY (t) = TREE_READONLY (node);
3608 if (TREE_CODE_CLASS (code) == tcc_statement)
3609 TREE_SIDE_EFFECTS (t) = 1;
3613 /* All of these have side-effects, no matter what their
3615 TREE_SIDE_EFFECTS (t) = 1;
3616 TREE_READONLY (t) = 0;
3619 case MISALIGNED_INDIRECT_REF:
3620 case ALIGN_INDIRECT_REF:
3622 /* Whether a dereference is readonly has nothing to do with whether
3623 its operand is readonly. */
3624 TREE_READONLY (t) = 0;
3629 recompute_tree_invariant_for_addr_expr (t);
3633 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3634 && node && !TYPE_P (node)
3635 && TREE_CONSTANT (node))
3636 TREE_CONSTANT (t) = 1;
3637 if (TREE_CODE_CLASS (code) == tcc_reference
3638 && node && TREE_THIS_VOLATILE (node))
3639 TREE_THIS_VOLATILE (t) = 1;
3646 #define PROCESS_ARG(N) \
3648 TREE_OPERAND (t, N) = arg##N; \
3649 if (arg##N &&!TYPE_P (arg##N)) \
3651 if (TREE_SIDE_EFFECTS (arg##N)) \
3653 if (!TREE_READONLY (arg##N) \
3654 && !CONSTANT_CLASS_P (arg##N)) \
3656 if (!TREE_CONSTANT (arg##N)) \
3662 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3664 bool constant, read_only, side_effects;
3667 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3669 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3670 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3671 /* When sizetype precision doesn't match that of pointers
3672 we need to be able to build explicit extensions or truncations
3673 of the offset argument. */
3674 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3675 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3676 && TREE_CODE (arg1) == INTEGER_CST);
3678 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3679 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3680 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3681 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3683 t = make_node_stat (code PASS_MEM_STAT);
3686 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3687 result based on those same flags for the arguments. But if the
3688 arguments aren't really even `tree' expressions, we shouldn't be trying
3691 /* Expressions without side effects may be constant if their
3692 arguments are as well. */
3693 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3694 || TREE_CODE_CLASS (code) == tcc_binary);
3696 side_effects = TREE_SIDE_EFFECTS (t);
3701 TREE_READONLY (t) = read_only;
3702 TREE_CONSTANT (t) = constant;
3703 TREE_SIDE_EFFECTS (t) = side_effects;
3704 TREE_THIS_VOLATILE (t)
3705 = (TREE_CODE_CLASS (code) == tcc_reference
3706 && arg0 && TREE_THIS_VOLATILE (arg0));
3713 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3714 tree arg2 MEM_STAT_DECL)
3716 bool constant, read_only, side_effects;
3719 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3720 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3722 t = make_node_stat (code PASS_MEM_STAT);
3727 /* As a special exception, if COND_EXPR has NULL branches, we
3728 assume that it is a gimple statement and always consider
3729 it to have side effects. */
3730 if (code == COND_EXPR
3731 && tt == void_type_node
3732 && arg1 == NULL_TREE
3733 && arg2 == NULL_TREE)
3734 side_effects = true;
3736 side_effects = TREE_SIDE_EFFECTS (t);
3742 if (code == COND_EXPR)
3743 TREE_READONLY (t) = read_only;
3745 TREE_SIDE_EFFECTS (t) = side_effects;
3746 TREE_THIS_VOLATILE (t)
3747 = (TREE_CODE_CLASS (code) == tcc_reference
3748 && arg0 && TREE_THIS_VOLATILE (arg0));
3754 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3755 tree arg2, tree arg3 MEM_STAT_DECL)
3757 bool constant, read_only, side_effects;
3760 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3762 t = make_node_stat (code PASS_MEM_STAT);
3765 side_effects = TREE_SIDE_EFFECTS (t);
3772 TREE_SIDE_EFFECTS (t) = side_effects;
3773 TREE_THIS_VOLATILE (t)
3774 = (TREE_CODE_CLASS (code) == tcc_reference
3775 && arg0 && TREE_THIS_VOLATILE (arg0));
3781 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3782 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3784 bool constant, read_only, side_effects;
3787 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3789 t = make_node_stat (code PASS_MEM_STAT);
3792 side_effects = TREE_SIDE_EFFECTS (t);
3800 TREE_SIDE_EFFECTS (t) = side_effects;
3801 TREE_THIS_VOLATILE (t)
3802 = (TREE_CODE_CLASS (code) == tcc_reference
3803 && arg0 && TREE_THIS_VOLATILE (arg0));
3809 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3810 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3812 bool constant, read_only, side_effects;
3815 gcc_assert (code == TARGET_MEM_REF);
3817 t = make_node_stat (code PASS_MEM_STAT);
3820 side_effects = TREE_SIDE_EFFECTS (t);
3829 TREE_SIDE_EFFECTS (t) = side_effects;
3830 TREE_THIS_VOLATILE (t) = 0;
3835 /* Similar except don't specify the TREE_TYPE
3836 and leave the TREE_SIDE_EFFECTS as 0.
3837 It is permissible for arguments to be null,
3838 or even garbage if their values do not matter. */
3841 build_nt (enum tree_code code, ...)
3848 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3852 t = make_node (code);
3853 length = TREE_CODE_LENGTH (code);
3855 for (i = 0; i < length; i++)
3856 TREE_OPERAND (t, i) = va_arg (p, tree);
3862 /* Similar to build_nt, but for creating a CALL_EXPR object with
3863 ARGLIST passed as a list. */
3866 build_nt_call_list (tree fn, tree arglist)
3871 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3872 CALL_EXPR_FN (t) = fn;
3873 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3874 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3875 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3879 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3883 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3888 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3889 CALL_EXPR_FN (ret) = fn;
3890 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3891 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3892 CALL_EXPR_ARG (ret, ix) = t;
3896 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3897 We do NOT enter this node in any sort of symbol table.
3899 LOC is the location of the decl.
3901 layout_decl is used to set up the decl's storage layout.
3902 Other slots are initialized to 0 or null pointers. */
3905 build_decl_stat (location_t loc, enum tree_code code, tree name,
3906 tree type MEM_STAT_DECL)
3910 t = make_node_stat (code PASS_MEM_STAT);
3911 DECL_SOURCE_LOCATION (t) = loc;
3913 /* if (type == error_mark_node)
3914 type = integer_type_node; */
3915 /* That is not done, deliberately, so that having error_mark_node
3916 as the type can suppress useless errors in the use of this variable. */
3918 DECL_NAME (t) = name;
3919 TREE_TYPE (t) = type;
3921 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3927 /* Builds and returns function declaration with NAME and TYPE. */
3930 build_fn_decl (const char *name, tree type)
3932 tree id = get_identifier (name);
3933 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3935 DECL_EXTERNAL (decl) = 1;
3936 TREE_PUBLIC (decl) = 1;
3937 DECL_ARTIFICIAL (decl) = 1;
3938 TREE_NOTHROW (decl) = 1;
3944 /* BLOCK nodes are used to represent the structure of binding contours
3945 and declarations, once those contours have been exited and their contents
3946 compiled. This information is used for outputting debugging info. */
3949 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3951 tree block = make_node (BLOCK);
3953 BLOCK_VARS (block) = vars;
3954 BLOCK_SUBBLOCKS (block) = subblocks;
3955 BLOCK_SUPERCONTEXT (block) = supercontext;
3956 BLOCK_CHAIN (block) = chain;
3961 expand_location (source_location loc)
3963 expanded_location xloc;
3964 if (loc <= BUILTINS_LOCATION)
3966 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3973 const struct line_map *map = linemap_lookup (line_table, loc);
3974 xloc.file = map->to_file;
3975 xloc.line = SOURCE_LINE (map, loc);
3976 xloc.column = SOURCE_COLUMN (map, loc);
3977 xloc.sysp = map->sysp != 0;
3983 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3985 LOC is the location to use in tree T. */
3988 protected_set_expr_location (tree t, location_t loc)
3990 if (t && CAN_HAVE_LOCATION_P (t))
3991 SET_EXPR_LOCATION (t, loc);
3994 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3998 build_decl_attribute_variant (tree ddecl, tree attribute)
4000 DECL_ATTRIBUTES (ddecl) = attribute;
4004 /* Borrowed from hashtab.c iterative_hash implementation. */
4005 #define mix(a,b,c) \
4007 a -= b; a -= c; a ^= (c>>13); \
4008 b -= c; b -= a; b ^= (a<< 8); \
4009 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4010 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4011 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4012 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4013 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4014 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4015 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4019 /* Produce good hash value combining VAL and VAL2. */
4021 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4023 /* the golden ratio; an arbitrary value. */
4024 hashval_t a = 0x9e3779b9;
4030 /* Produce good hash value combining VAL and VAL2. */
4032 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4034 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4035 return iterative_hash_hashval_t (val, val2);
4038 hashval_t a = (hashval_t) val;
4039 /* Avoid warnings about shifting of more than the width of the type on
4040 hosts that won't execute this path. */
4042 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4044 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4046 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4047 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4054 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4055 is ATTRIBUTE and its qualifiers are QUALS.
4057 Record such modified types already made so we don't make duplicates. */
4060 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4062 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4064 hashval_t hashcode = 0;
4066 enum tree_code code = TREE_CODE (ttype);
4068 /* Building a distinct copy of a tagged type is inappropriate; it
4069 causes breakage in code that expects there to be a one-to-one
4070 relationship between a struct and its fields.
4071 build_duplicate_type is another solution (as used in
4072 handle_transparent_union_attribute), but that doesn't play well
4073 with the stronger C++ type identity model. */
4074 if (TREE_CODE (ttype) == RECORD_TYPE
4075 || TREE_CODE (ttype) == UNION_TYPE
4076 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4077 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4079 warning (OPT_Wattributes,
4080 "ignoring attributes applied to %qT after definition",
4081 TYPE_MAIN_VARIANT (ttype));
4082 return build_qualified_type (ttype, quals);
4085 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4086 ntype = build_distinct_type_copy (ttype);
4088 TYPE_ATTRIBUTES (ntype) = attribute;
4090 hashcode = iterative_hash_object (code, hashcode);
4091 if (TREE_TYPE (ntype))
4092 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4094 hashcode = attribute_hash_list (attribute, hashcode);
4096 switch (TREE_CODE (ntype))
4099 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4102 if (TYPE_DOMAIN (ntype))
4103 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4107 hashcode = iterative_hash_object
4108 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4109 hashcode = iterative_hash_object
4110 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4113 case FIXED_POINT_TYPE:
4115 unsigned int precision = TYPE_PRECISION (ntype);
4116 hashcode = iterative_hash_object (precision, hashcode);
4123 ntype = type_hash_canon (hashcode, ntype);
4125 /* If the target-dependent attributes make NTYPE different from
4126 its canonical type, we will need to use structural equality
4127 checks for this type. */
4128 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4129 || !targetm.comp_type_attributes (ntype, ttype))
4130 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4131 else if (TYPE_CANONICAL (ntype) == ntype)
4132 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4134 ttype = build_qualified_type (ntype, quals);
4136 else if (TYPE_QUALS (ttype) != quals)
4137 ttype = build_qualified_type (ttype, quals);
4143 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4146 Record such modified types already made so we don't make duplicates. */
4149 build_type_attribute_variant (tree ttype, tree attribute)
4151 return build_type_attribute_qual_variant (ttype, attribute,
4152 TYPE_QUALS (ttype));
4156 /* Reset all the fields in a binfo node BINFO. We only keep
4157 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4160 free_lang_data_in_binfo (tree binfo)
4165 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4167 BINFO_VTABLE (binfo) = NULL_TREE;
4168 BINFO_BASE_ACCESSES (binfo) = NULL;
4169 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4170 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4172 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4173 free_lang_data_in_binfo (t);
4177 /* Reset all language specific information still present in TYPE. */
4180 free_lang_data_in_type (tree type)
4182 gcc_assert (TYPE_P (type));
4184 /* Give the FE a chance to remove its own data first. */
4185 lang_hooks.free_lang_data (type);
4187 TREE_LANG_FLAG_0 (type) = 0;
4188 TREE_LANG_FLAG_1 (type) = 0;
4189 TREE_LANG_FLAG_2 (type) = 0;
4190 TREE_LANG_FLAG_3 (type) = 0;
4191 TREE_LANG_FLAG_4 (type) = 0;
4192 TREE_LANG_FLAG_5 (type) = 0;
4193 TREE_LANG_FLAG_6 (type) = 0;
4195 if (TREE_CODE (type) == FUNCTION_TYPE)
4197 /* Remove the const and volatile qualifiers from arguments. The
4198 C++ front end removes them, but the C front end does not,
4199 leading to false ODR violation errors when merging two
4200 instances of the same function signature compiled by
4201 different front ends. */
4204 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4206 tree arg_type = TREE_VALUE (p);
4208 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4210 int quals = TYPE_QUALS (arg_type)
4212 & ~TYPE_QUAL_VOLATILE;
4213 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4214 free_lang_data_in_type (TREE_VALUE (p));
4219 /* Remove members that are not actually FIELD_DECLs from the field
4220 list of an aggregate. These occur in C++. */
4221 if (RECORD_OR_UNION_TYPE_P (type))
4225 /* Note that TYPE_FIELDS can be shared across distinct
4226 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4227 to be removed, we cannot set its TREE_CHAIN to NULL.
4228 Otherwise, we would not be able to find all the other fields
4229 in the other instances of this TREE_TYPE.
4231 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4233 member = TYPE_FIELDS (type);
4236 if (TREE_CODE (member) == FIELD_DECL)
4239 TREE_CHAIN (prev) = member;
4241 TYPE_FIELDS (type) = member;
4245 member = TREE_CHAIN (member);
4249 TREE_CHAIN (prev) = NULL_TREE;
4251 TYPE_FIELDS (type) = NULL_TREE;
4253 TYPE_METHODS (type) = NULL_TREE;
4254 if (TYPE_BINFO (type))
4255 free_lang_data_in_binfo (TYPE_BINFO (type));
4259 /* For non-aggregate types, clear out the language slot (which
4260 overloads TYPE_BINFO). */
4261 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4264 TYPE_CONTEXT (type) = NULL_TREE;
4265 if (debug_info_level < DINFO_LEVEL_TERSE)
4266 TYPE_STUB_DECL (type) = NULL_TREE;
4270 /* Return true if DECL may need an assembler name to be set. */
4273 need_assembler_name_p (tree decl)
4275 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4276 if (TREE_CODE (decl) != FUNCTION_DECL
4277 && TREE_CODE (decl) != VAR_DECL)
4280 /* If DECL already has its assembler name set, it does not need a
4282 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4283 || DECL_ASSEMBLER_NAME_SET_P (decl))
4286 /* Abstract decls do not need an assembler name. */
4287 if (DECL_ABSTRACT (decl))
4290 /* For VAR_DECLs, only static, public and external symbols need an
4292 if (TREE_CODE (decl) == VAR_DECL
4293 && !TREE_STATIC (decl)
4294 && !TREE_PUBLIC (decl)
4295 && !DECL_EXTERNAL (decl))
4298 if (TREE_CODE (decl) == FUNCTION_DECL)
4300 /* Do not set assembler name on builtins. Allow RTL expansion to
4301 decide whether to expand inline or via a regular call. */
4302 if (DECL_BUILT_IN (decl)
4303 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4306 /* Functions represented in the callgraph need an assembler name. */
4307 if (cgraph_get_node (decl) != NULL)
4310 /* Unused and not public functions don't need an assembler name. */
4311 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4319 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4320 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4321 in BLOCK that is not in LOCALS is removed. */
4324 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4328 tp = &BLOCK_VARS (block);
4331 if (!pointer_set_contains (locals, *tp))
4332 *tp = TREE_CHAIN (*tp);
4334 tp = &TREE_CHAIN (*tp);
4337 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4338 free_lang_data_in_block (fn, t, locals);
4342 /* Reset all language specific information still present in symbol
4346 free_lang_data_in_decl (tree decl)
4348 gcc_assert (DECL_P (decl));
4350 /* Give the FE a chance to remove its own data first. */
4351 lang_hooks.free_lang_data (decl);
4353 TREE_LANG_FLAG_0 (decl) = 0;
4354 TREE_LANG_FLAG_1 (decl) = 0;
4355 TREE_LANG_FLAG_2 (decl) = 0;
4356 TREE_LANG_FLAG_3 (decl) = 0;
4357 TREE_LANG_FLAG_4 (decl) = 0;
4358 TREE_LANG_FLAG_5 (decl) = 0;
4359 TREE_LANG_FLAG_6 (decl) = 0;
4361 /* Identifiers need not have a type. */
4362 if (DECL_NAME (decl))
4363 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4365 /* Ignore any intervening types, because we are going to clear their
4366 TYPE_CONTEXT fields. */
4367 if (TREE_CODE (decl) != FIELD_DECL)
4368 DECL_CONTEXT (decl) = decl_function_context (decl);
4370 if (DECL_CONTEXT (decl)
4371 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4372 DECL_CONTEXT (decl) = NULL_TREE;
4374 if (TREE_CODE (decl) == VAR_DECL)
4376 tree context = DECL_CONTEXT (decl);
4380 enum tree_code code = TREE_CODE (context);
4381 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4383 /* Do not clear the decl context here, that will promote
4384 all vars to global ones. */
4385 DECL_INITIAL (decl) = NULL_TREE;
4388 if (TREE_STATIC (decl))
4389 DECL_CONTEXT (decl) = NULL_TREE;
4393 /* ??? We could free non-constant DECL_SIZE, DECL_SIZE_UNIT
4394 and DECL_FIELD_OFFSET. But it's cheap enough to not do
4395 that and refrain from adding workarounds to dwarf2out.c */
4397 /* DECL_FCONTEXT is only used for debug info generation. */
4398 if (TREE_CODE (decl) == FIELD_DECL
4399 && debug_info_level < DINFO_LEVEL_TERSE)
4400 DECL_FCONTEXT (decl) = NULL_TREE;
4402 if (TREE_CODE (decl) == FUNCTION_DECL)
4404 if (gimple_has_body_p (decl))
4407 struct pointer_set_t *locals;
4409 /* If DECL has a gimple body, then the context for its
4410 arguments must be DECL. Otherwise, it doesn't really
4411 matter, as we will not be emitting any code for DECL. In
4412 general, there may be other instances of DECL created by
4413 the front end and since PARM_DECLs are generally shared,
4414 their DECL_CONTEXT changes as the replicas of DECL are
4415 created. The only time where DECL_CONTEXT is important
4416 is for the FUNCTION_DECLs that have a gimple body (since
4417 the PARM_DECL will be used in the function's body). */
4418 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4419 DECL_CONTEXT (t) = decl;
4421 /* Collect all the symbols declared in DECL. */
4422 locals = pointer_set_create ();
4423 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4424 for (; t; t = TREE_CHAIN (t))
4426 pointer_set_insert (locals, TREE_VALUE (t));
4428 /* All the local symbols should have DECL as their
4430 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4433 /* Get rid of any decl not in local_decls. */
4434 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4436 pointer_set_destroy (locals);
4439 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4440 At this point, it is not needed anymore. */
4441 DECL_SAVED_TREE (decl) = NULL_TREE;
4443 else if (TREE_CODE (decl) == VAR_DECL)
4445 tree expr = DECL_DEBUG_EXPR (decl);
4447 && TREE_CODE (expr) == VAR_DECL
4448 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4449 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4451 if (DECL_EXTERNAL (decl)
4452 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4453 DECL_INITIAL (decl) = NULL_TREE;
4455 else if (TREE_CODE (decl) == TYPE_DECL)
4457 DECL_INITIAL (decl) = NULL_TREE;
4459 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4460 FIELD_DECLs, which should be preserved. Otherwise,
4461 we shouldn't be concerned with source-level lexical
4462 nesting beyond this point. */
4463 DECL_CONTEXT (decl) = NULL_TREE;
4468 /* Data used when collecting DECLs and TYPEs for language data removal. */
4470 struct free_lang_data_d
4472 /* Worklist to avoid excessive recursion. */
4473 VEC(tree,heap) *worklist;
4475 /* Set of traversed objects. Used to avoid duplicate visits. */
4476 struct pointer_set_t *pset;
4478 /* Array of symbols to process with free_lang_data_in_decl. */
4479 VEC(tree,heap) *decls;
4481 /* Array of types to process with free_lang_data_in_type. */
4482 VEC(tree,heap) *types;
4486 /* Save all language fields needed to generate proper debug information
4487 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4490 save_debug_info_for_decl (tree t)
4492 /*struct saved_debug_info_d *sdi;*/
4494 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4496 /* FIXME. Partial implementation for saving debug info removed. */
4500 /* Save all language fields needed to generate proper debug information
4501 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4504 save_debug_info_for_type (tree t)
4506 /*struct saved_debug_info_d *sdi;*/
4508 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4510 /* FIXME. Partial implementation for saving debug info removed. */
4514 /* Add type or decl T to one of the list of tree nodes that need their
4515 language data removed. The lists are held inside FLD. */
4518 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4522 VEC_safe_push (tree, heap, fld->decls, t);
4523 if (debug_info_level > DINFO_LEVEL_TERSE)
4524 save_debug_info_for_decl (t);
4526 else if (TYPE_P (t))
4528 VEC_safe_push (tree, heap, fld->types, t);
4529 if (debug_info_level > DINFO_LEVEL_TERSE)
4530 save_debug_info_for_type (t);
4536 /* Push tree node T into FLD->WORKLIST. */
4539 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4541 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4542 VEC_safe_push (tree, heap, fld->worklist, (t));
4546 /* Operand callback helper for free_lang_data_in_node. *TP is the
4547 subtree operand being considered. */
4550 find_decls_types_r (tree *tp, int *ws, void *data)
4553 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4555 if (TREE_CODE (t) == TREE_LIST)
4558 /* Language specific nodes will be removed, so there is no need
4559 to gather anything under them. */
4560 if (is_lang_specific (t))
4568 /* Note that walk_tree does not traverse every possible field in
4569 decls, so we have to do our own traversals here. */
4570 add_tree_to_fld_list (t, fld);
4572 fld_worklist_push (DECL_NAME (t), fld);
4573 fld_worklist_push (DECL_CONTEXT (t), fld);
4574 fld_worklist_push (DECL_SIZE (t), fld);
4575 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4577 /* We are going to remove everything under DECL_INITIAL for
4578 TYPE_DECLs. No point walking them. */
4579 if (TREE_CODE (t) != TYPE_DECL)
4580 fld_worklist_push (DECL_INITIAL (t), fld);
4582 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4583 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4585 if (TREE_CODE (t) == FUNCTION_DECL)
4587 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4588 fld_worklist_push (DECL_RESULT (t), fld);
4590 else if (TREE_CODE (t) == TYPE_DECL)
4592 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4593 fld_worklist_push (DECL_VINDEX (t), fld);
4595 else if (TREE_CODE (t) == FIELD_DECL)
4597 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4598 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4599 fld_worklist_push (DECL_QUALIFIER (t), fld);
4600 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4601 fld_worklist_push (DECL_FCONTEXT (t), fld);
4603 else if (TREE_CODE (t) == VAR_DECL)
4605 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4606 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4609 if (TREE_CODE (t) != FIELD_DECL)
4610 fld_worklist_push (TREE_CHAIN (t), fld);
4613 else if (TYPE_P (t))
4615 /* Note that walk_tree does not traverse every possible field in
4616 types, so we have to do our own traversals here. */
4617 add_tree_to_fld_list (t, fld);
4619 if (!RECORD_OR_UNION_TYPE_P (t))
4620 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4621 fld_worklist_push (TYPE_SIZE (t), fld);
4622 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4623 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4624 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4625 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4626 fld_worklist_push (TYPE_NAME (t), fld);
4627 fld_worklist_push (TYPE_MINVAL (t), fld);
4628 if (!RECORD_OR_UNION_TYPE_P (t))
4629 fld_worklist_push (TYPE_MAXVAL (t), fld);
4630 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4631 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4632 fld_worklist_push (TYPE_CONTEXT (t), fld);
4633 fld_worklist_push (TYPE_CANONICAL (t), fld);
4635 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4639 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4641 fld_worklist_push (TREE_TYPE (tem), fld);
4642 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4644 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4645 && TREE_CODE (tem) == TREE_LIST)
4648 fld_worklist_push (TREE_VALUE (tem), fld);
4649 tem = TREE_CHAIN (tem);
4653 if (RECORD_OR_UNION_TYPE_P (t))
4656 /* Push all TYPE_FIELDS - there can be interleaving interesting
4657 and non-interesting things. */
4658 tem = TYPE_FIELDS (t);
4661 if (TREE_CODE (tem) == FIELD_DECL)
4662 fld_worklist_push (tem, fld);
4663 tem = TREE_CHAIN (tem);
4667 fld_worklist_push (TREE_CHAIN (t), fld);
4671 fld_worklist_push (TREE_TYPE (t), fld);
4677 /* Find decls and types in T. */
4680 find_decls_types (tree t, struct free_lang_data_d *fld)
4684 if (!pointer_set_contains (fld->pset, t))
4685 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4686 if (VEC_empty (tree, fld->worklist))
4688 t = VEC_pop (tree, fld->worklist);
4692 /* Translate all the types in LIST with the corresponding runtime
4696 get_eh_types_for_runtime (tree list)
4700 if (list == NULL_TREE)
4703 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4705 list = TREE_CHAIN (list);
4708 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4709 TREE_CHAIN (prev) = n;
4710 prev = TREE_CHAIN (prev);
4711 list = TREE_CHAIN (list);
4718 /* Find decls and types referenced in EH region R and store them in
4719 FLD->DECLS and FLD->TYPES. */
4722 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4733 /* The types referenced in each catch must first be changed to the
4734 EH types used at runtime. This removes references to FE types
4736 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4738 c->type_list = get_eh_types_for_runtime (c->type_list);
4739 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4744 case ERT_ALLOWED_EXCEPTIONS:
4745 r->u.allowed.type_list
4746 = get_eh_types_for_runtime (r->u.allowed.type_list);
4747 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4750 case ERT_MUST_NOT_THROW:
4751 walk_tree (&r->u.must_not_throw.failure_decl,
4752 find_decls_types_r, fld, fld->pset);
4758 /* Find decls and types referenced in cgraph node N and store them in
4759 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4760 look for *every* kind of DECL and TYPE node reachable from N,
4761 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4762 NAMESPACE_DECLs, etc). */
4765 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4768 struct function *fn;
4771 find_decls_types (n->decl, fld);
4773 if (!gimple_has_body_p (n->decl))
4776 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4778 fn = DECL_STRUCT_FUNCTION (n->decl);
4780 /* Traverse locals. */
4781 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4782 find_decls_types (TREE_VALUE (t), fld);
4784 /* Traverse EH regions in FN. */
4787 FOR_ALL_EH_REGION_FN (r, fn)
4788 find_decls_types_in_eh_region (r, fld);
4791 /* Traverse every statement in FN. */
4792 FOR_EACH_BB_FN (bb, fn)
4794 gimple_stmt_iterator si;
4797 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4799 gimple phi = gsi_stmt (si);
4801 for (i = 0; i < gimple_phi_num_args (phi); i++)
4803 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4804 find_decls_types (*arg_p, fld);
4808 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4810 gimple stmt = gsi_stmt (si);
4812 for (i = 0; i < gimple_num_ops (stmt); i++)
4814 tree arg = gimple_op (stmt, i);
4815 find_decls_types (arg, fld);
4822 /* Find decls and types referenced in varpool node N and store them in
4823 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4824 look for *every* kind of DECL and TYPE node reachable from N,
4825 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4826 NAMESPACE_DECLs, etc). */
4829 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4831 find_decls_types (v->decl, fld);
4835 /* Free language specific information for every operand and expression
4836 in every node of the call graph. This process operates in three stages:
4838 1- Every callgraph node and varpool node is traversed looking for
4839 decls and types embedded in them. This is a more exhaustive
4840 search than that done by find_referenced_vars, because it will
4841 also collect individual fields, decls embedded in types, etc.
4843 2- All the decls found are sent to free_lang_data_in_decl.
4845 3- All the types found are sent to free_lang_data_in_type.
4847 The ordering between decls and types is important because
4848 free_lang_data_in_decl sets assembler names, which includes
4849 mangling. So types cannot be freed up until assembler names have
4853 free_lang_data_in_cgraph (void)
4855 struct cgraph_node *n;
4856 struct varpool_node *v;
4857 struct free_lang_data_d fld;
4862 /* Initialize sets and arrays to store referenced decls and types. */
4863 fld.pset = pointer_set_create ();
4864 fld.worklist = NULL;
4865 fld.decls = VEC_alloc (tree, heap, 100);
4866 fld.types = VEC_alloc (tree, heap, 100);
4868 /* Find decls and types in the body of every function in the callgraph. */
4869 for (n = cgraph_nodes; n; n = n->next)
4870 find_decls_types_in_node (n, &fld);
4872 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4873 find_decls_types (p->decl, &fld);
4875 /* Find decls and types in every varpool symbol. */
4876 for (v = varpool_nodes_queue; v; v = v->next_needed)
4877 find_decls_types_in_var (v, &fld);
4879 /* Set the assembler name on every decl found. We need to do this
4880 now because free_lang_data_in_decl will invalidate data needed
4881 for mangling. This breaks mangling on interdependent decls. */
4882 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4883 if (need_assembler_name_p (t))
4885 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4886 diagnostics that use input_location to show locus
4887 information. The problem here is that, at this point,
4888 input_location is generally anchored to the end of the file
4889 (since the parser is long gone), so we don't have a good
4890 position to pin it to.
4892 To alleviate this problem, this uses the location of T's
4893 declaration. Examples of this are
4894 testsuite/g++.dg/template/cond2.C and
4895 testsuite/g++.dg/template/pr35240.C. */
4896 location_t saved_location = input_location;
4897 input_location = DECL_SOURCE_LOCATION (t);
4899 decl_assembler_name (t);
4901 input_location = saved_location;
4904 /* Traverse every decl found freeing its language data. */
4905 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4906 free_lang_data_in_decl (t);
4908 /* Traverse every type found freeing its language data. */
4909 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4910 free_lang_data_in_type (t);
4912 pointer_set_destroy (fld.pset);
4913 VEC_free (tree, heap, fld.worklist);
4914 VEC_free (tree, heap, fld.decls);
4915 VEC_free (tree, heap, fld.types);
4919 /* Free resources that are used by FE but are not needed once they are done. */
4922 free_lang_data (void)
4926 /* If we are the LTO frontend we have freed lang-specific data already. */
4928 || !flag_generate_lto)
4931 /* Allocate and assign alias sets to the standard integer types
4932 while the slots are still in the way the frontends generated them. */
4933 for (i = 0; i < itk_none; ++i)
4934 if (integer_types[i])
4935 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
4937 /* Traverse the IL resetting language specific information for
4938 operands, expressions, etc. */
4939 free_lang_data_in_cgraph ();
4941 /* Create gimple variants for common types. */
4942 ptrdiff_type_node = integer_type_node;
4943 fileptr_type_node = ptr_type_node;
4944 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4945 || (TYPE_MODE (boolean_type_node)
4946 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4947 || TYPE_PRECISION (boolean_type_node) != 1
4948 || !TYPE_UNSIGNED (boolean_type_node))
4950 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4951 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4952 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4953 TYPE_PRECISION (boolean_type_node) = 1;
4954 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4955 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4958 /* Unify char_type_node with its properly signed variant. */
4959 if (TYPE_UNSIGNED (char_type_node))
4960 unsigned_char_type_node = char_type_node;
4962 signed_char_type_node = char_type_node;
4964 /* Reset some langhooks. Do not reset types_compatible_p, it may
4965 still be used indirectly via the get_alias_set langhook. */
4966 lang_hooks.callgraph.analyze_expr = NULL;
4967 lang_hooks.dwarf_name = lhd_dwarf_name;
4968 lang_hooks.decl_printable_name = gimple_decl_printable_name;
4969 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
4970 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
4972 /* Reset diagnostic machinery. */
4973 diagnostic_starter (global_dc) = default_diagnostic_starter;
4974 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
4975 diagnostic_format_decoder (global_dc) = default_tree_printer;
4981 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
4985 "*free_lang_data", /* name */
4987 free_lang_data, /* execute */
4990 0, /* static_pass_number */
4991 TV_IPA_FREE_LANG_DATA, /* tv_id */
4992 0, /* properties_required */
4993 0, /* properties_provided */
4994 0, /* properties_destroyed */
4995 0, /* todo_flags_start */
4996 TODO_ggc_collect /* todo_flags_finish */
5000 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5003 We try both `text' and `__text__', ATTR may be either one. */
5004 /* ??? It might be a reasonable simplification to require ATTR to be only
5005 `text'. One might then also require attribute lists to be stored in
5006 their canonicalized form. */
5009 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5014 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5017 p = IDENTIFIER_POINTER (ident);
5018 ident_len = IDENTIFIER_LENGTH (ident);
5020 if (ident_len == attr_len
5021 && strcmp (attr, p) == 0)
5024 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5027 gcc_assert (attr[1] == '_');
5028 gcc_assert (attr[attr_len - 2] == '_');
5029 gcc_assert (attr[attr_len - 1] == '_');
5030 if (ident_len == attr_len - 4
5031 && strncmp (attr + 2, p, attr_len - 4) == 0)
5036 if (ident_len == attr_len + 4
5037 && p[0] == '_' && p[1] == '_'
5038 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5039 && strncmp (attr, p + 2, attr_len) == 0)
5046 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5049 We try both `text' and `__text__', ATTR may be either one. */
5052 is_attribute_p (const char *attr, const_tree ident)
5054 return is_attribute_with_length_p (attr, strlen (attr), ident);
5057 /* Given an attribute name and a list of attributes, return a pointer to the
5058 attribute's list element if the attribute is part of the list, or NULL_TREE
5059 if not found. If the attribute appears more than once, this only
5060 returns the first occurrence; the TREE_CHAIN of the return value should
5061 be passed back in if further occurrences are wanted. */
5064 lookup_attribute (const char *attr_name, tree list)
5067 size_t attr_len = strlen (attr_name);
5069 for (l = list; l; l = TREE_CHAIN (l))
5071 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5072 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5078 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5082 remove_attribute (const char *attr_name, tree list)
5085 size_t attr_len = strlen (attr_name);
5087 for (p = &list; *p; )
5090 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5091 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5092 *p = TREE_CHAIN (l);
5094 p = &TREE_CHAIN (l);
5100 /* Return an attribute list that is the union of a1 and a2. */
5103 merge_attributes (tree a1, tree a2)
5107 /* Either one unset? Take the set one. */
5109 if ((attributes = a1) == 0)
5112 /* One that completely contains the other? Take it. */
5114 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5116 if (attribute_list_contained (a2, a1))
5120 /* Pick the longest list, and hang on the other list. */
5122 if (list_length (a1) < list_length (a2))
5123 attributes = a2, a2 = a1;
5125 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5128 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5131 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5134 if (TREE_VALUE (a) != NULL
5135 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5136 && TREE_VALUE (a2) != NULL
5137 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5139 if (simple_cst_list_equal (TREE_VALUE (a),
5140 TREE_VALUE (a2)) == 1)
5143 else if (simple_cst_equal (TREE_VALUE (a),
5144 TREE_VALUE (a2)) == 1)
5149 a1 = copy_node (a2);
5150 TREE_CHAIN (a1) = attributes;
5159 /* Given types T1 and T2, merge their attributes and return
5163 merge_type_attributes (tree t1, tree t2)
5165 return merge_attributes (TYPE_ATTRIBUTES (t1),
5166 TYPE_ATTRIBUTES (t2));
5169 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5173 merge_decl_attributes (tree olddecl, tree newdecl)
5175 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5176 DECL_ATTRIBUTES (newdecl));
5179 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5181 /* Specialization of merge_decl_attributes for various Windows targets.
5183 This handles the following situation:
5185 __declspec (dllimport) int foo;
5188 The second instance of `foo' nullifies the dllimport. */
5191 merge_dllimport_decl_attributes (tree old, tree new_tree)
5194 int delete_dllimport_p = 1;
5196 /* What we need to do here is remove from `old' dllimport if it doesn't
5197 appear in `new'. dllimport behaves like extern: if a declaration is
5198 marked dllimport and a definition appears later, then the object
5199 is not dllimport'd. We also remove a `new' dllimport if the old list
5200 contains dllexport: dllexport always overrides dllimport, regardless
5201 of the order of declaration. */
5202 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5203 delete_dllimport_p = 0;
5204 else if (DECL_DLLIMPORT_P (new_tree)
5205 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5207 DECL_DLLIMPORT_P (new_tree) = 0;
5208 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5209 "dllimport ignored", new_tree);
5211 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5213 /* Warn about overriding a symbol that has already been used, e.g.:
5214 extern int __attribute__ ((dllimport)) foo;
5215 int* bar () {return &foo;}
5218 if (TREE_USED (old))
5220 warning (0, "%q+D redeclared without dllimport attribute "
5221 "after being referenced with dll linkage", new_tree);
5222 /* If we have used a variable's address with dllimport linkage,
5223 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5224 decl may already have had TREE_CONSTANT computed.
5225 We still remove the attribute so that assembler code refers
5226 to '&foo rather than '_imp__foo'. */
5227 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5228 DECL_DLLIMPORT_P (new_tree) = 1;
5231 /* Let an inline definition silently override the external reference,
5232 but otherwise warn about attribute inconsistency. */
5233 else if (TREE_CODE (new_tree) == VAR_DECL
5234 || !DECL_DECLARED_INLINE_P (new_tree))
5235 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5236 "previous dllimport ignored", new_tree);
5239 delete_dllimport_p = 0;
5241 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5243 if (delete_dllimport_p)
5246 const size_t attr_len = strlen ("dllimport");
5248 /* Scan the list for dllimport and delete it. */
5249 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5251 if (is_attribute_with_length_p ("dllimport", attr_len,
5254 if (prev == NULL_TREE)
5257 TREE_CHAIN (prev) = TREE_CHAIN (t);
5266 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5267 struct attribute_spec.handler. */
5270 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5276 /* These attributes may apply to structure and union types being created,
5277 but otherwise should pass to the declaration involved. */
5280 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5281 | (int) ATTR_FLAG_ARRAY_NEXT))
5283 *no_add_attrs = true;
5284 return tree_cons (name, args, NULL_TREE);
5286 if (TREE_CODE (node) == RECORD_TYPE
5287 || TREE_CODE (node) == UNION_TYPE)
5289 node = TYPE_NAME (node);
5295 warning (OPT_Wattributes, "%qE attribute ignored",
5297 *no_add_attrs = true;
5302 if (TREE_CODE (node) != FUNCTION_DECL
5303 && TREE_CODE (node) != VAR_DECL
5304 && TREE_CODE (node) != TYPE_DECL)
5306 *no_add_attrs = true;
5307 warning (OPT_Wattributes, "%qE attribute ignored",
5312 if (TREE_CODE (node) == TYPE_DECL
5313 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5314 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5316 *no_add_attrs = true;
5317 warning (OPT_Wattributes, "%qE attribute ignored",
5322 is_dllimport = is_attribute_p ("dllimport", name);
5324 /* Report error on dllimport ambiguities seen now before they cause
5328 /* Honor any target-specific overrides. */
5329 if (!targetm.valid_dllimport_attribute_p (node))
5330 *no_add_attrs = true;
5332 else if (TREE_CODE (node) == FUNCTION_DECL
5333 && DECL_DECLARED_INLINE_P (node))
5335 warning (OPT_Wattributes, "inline function %q+D declared as "
5336 " dllimport: attribute ignored", node);
5337 *no_add_attrs = true;
5339 /* Like MS, treat definition of dllimported variables and
5340 non-inlined functions on declaration as syntax errors. */
5341 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5343 error ("function %q+D definition is marked dllimport", node);
5344 *no_add_attrs = true;
5347 else if (TREE_CODE (node) == VAR_DECL)
5349 if (DECL_INITIAL (node))
5351 error ("variable %q+D definition is marked dllimport",
5353 *no_add_attrs = true;
5356 /* `extern' needn't be specified with dllimport.
5357 Specify `extern' now and hope for the best. Sigh. */
5358 DECL_EXTERNAL (node) = 1;
5359 /* Also, implicitly give dllimport'd variables declared within
5360 a function global scope, unless declared static. */
5361 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5362 TREE_PUBLIC (node) = 1;
5365 if (*no_add_attrs == false)
5366 DECL_DLLIMPORT_P (node) = 1;
5368 else if (TREE_CODE (node) == FUNCTION_DECL
5369 && DECL_DECLARED_INLINE_P (node))
5370 /* An exported function, even if inline, must be emitted. */
5371 DECL_EXTERNAL (node) = 0;
5373 /* Report error if symbol is not accessible at global scope. */
5374 if (!TREE_PUBLIC (node)
5375 && (TREE_CODE (node) == VAR_DECL
5376 || TREE_CODE (node) == FUNCTION_DECL))
5378 error ("external linkage required for symbol %q+D because of "
5379 "%qE attribute", node, name);
5380 *no_add_attrs = true;
5383 /* A dllexport'd entity must have default visibility so that other
5384 program units (shared libraries or the main executable) can see
5385 it. A dllimport'd entity must have default visibility so that
5386 the linker knows that undefined references within this program
5387 unit can be resolved by the dynamic linker. */
5390 if (DECL_VISIBILITY_SPECIFIED (node)
5391 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5392 error ("%qE implies default visibility, but %qD has already "
5393 "been declared with a different visibility",
5395 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5396 DECL_VISIBILITY_SPECIFIED (node) = 1;
5402 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5404 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5405 of the various TYPE_QUAL values. */
5408 set_type_quals (tree type, int type_quals)
5410 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5411 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5412 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5413 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5416 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5419 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5421 return (TYPE_QUALS (cand) == type_quals
5422 && TYPE_NAME (cand) == TYPE_NAME (base)
5423 /* Apparently this is needed for Objective-C. */
5424 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5425 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5426 TYPE_ATTRIBUTES (base)));
5429 /* Return a version of the TYPE, qualified as indicated by the
5430 TYPE_QUALS, if one exists. If no qualified version exists yet,
5431 return NULL_TREE. */
5434 get_qualified_type (tree type, int type_quals)
5438 if (TYPE_QUALS (type) == type_quals)
5441 /* Search the chain of variants to see if there is already one there just
5442 like the one we need to have. If so, use that existing one. We must
5443 preserve the TYPE_NAME, since there is code that depends on this. */
5444 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5445 if (check_qualified_type (t, type, type_quals))
5451 /* Like get_qualified_type, but creates the type if it does not
5452 exist. This function never returns NULL_TREE. */
5455 build_qualified_type (tree type, int type_quals)
5459 /* See if we already have the appropriate qualified variant. */
5460 t = get_qualified_type (type, type_quals);
5462 /* If not, build it. */
5465 t = build_variant_type_copy (type);
5466 set_type_quals (t, type_quals);
5468 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5469 /* Propagate structural equality. */
5470 SET_TYPE_STRUCTURAL_EQUALITY (t);
5471 else if (TYPE_CANONICAL (type) != type)
5472 /* Build the underlying canonical type, since it is different
5474 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5477 /* T is its own canonical type. */
5478 TYPE_CANONICAL (t) = t;
5485 /* Create a new distinct copy of TYPE. The new type is made its own
5486 MAIN_VARIANT. If TYPE requires structural equality checks, the
5487 resulting type requires structural equality checks; otherwise, its
5488 TYPE_CANONICAL points to itself. */
5491 build_distinct_type_copy (tree type)
5493 tree t = copy_node (type);
5495 TYPE_POINTER_TO (t) = 0;
5496 TYPE_REFERENCE_TO (t) = 0;
5498 /* Set the canonical type either to a new equivalence class, or
5499 propagate the need for structural equality checks. */
5500 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5501 SET_TYPE_STRUCTURAL_EQUALITY (t);
5503 TYPE_CANONICAL (t) = t;
5505 /* Make it its own variant. */
5506 TYPE_MAIN_VARIANT (t) = t;
5507 TYPE_NEXT_VARIANT (t) = 0;
5509 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5510 whose TREE_TYPE is not t. This can also happen in the Ada
5511 frontend when using subtypes. */
5516 /* Create a new variant of TYPE, equivalent but distinct. This is so
5517 the caller can modify it. TYPE_CANONICAL for the return type will
5518 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5519 are considered equal by the language itself (or that both types
5520 require structural equality checks). */
5523 build_variant_type_copy (tree type)
5525 tree t, m = TYPE_MAIN_VARIANT (type);
5527 t = build_distinct_type_copy (type);
5529 /* Since we're building a variant, assume that it is a non-semantic
5530 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5531 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5533 /* Add the new type to the chain of variants of TYPE. */
5534 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5535 TYPE_NEXT_VARIANT (m) = t;
5536 TYPE_MAIN_VARIANT (t) = m;
5541 /* Return true if the from tree in both tree maps are equal. */
5544 tree_map_base_eq (const void *va, const void *vb)
5546 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5547 *const b = (const struct tree_map_base *) vb;
5548 return (a->from == b->from);
5551 /* Hash a from tree in a tree_map. */
5554 tree_map_base_hash (const void *item)
5556 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5559 /* Return true if this tree map structure is marked for garbage collection
5560 purposes. We simply return true if the from tree is marked, so that this
5561 structure goes away when the from tree goes away. */
5564 tree_map_base_marked_p (const void *p)
5566 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5570 tree_map_hash (const void *item)
5572 return (((const struct tree_map *) item)->hash);
5575 /* Return the initialization priority for DECL. */
5578 decl_init_priority_lookup (tree decl)
5580 struct tree_priority_map *h;
5581 struct tree_map_base in;
5583 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5585 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5586 return h ? h->init : DEFAULT_INIT_PRIORITY;
5589 /* Return the finalization priority for DECL. */
5592 decl_fini_priority_lookup (tree decl)
5594 struct tree_priority_map *h;
5595 struct tree_map_base in;
5597 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5599 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5600 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5603 /* Return the initialization and finalization priority information for
5604 DECL. If there is no previous priority information, a freshly
5605 allocated structure is returned. */
5607 static struct tree_priority_map *
5608 decl_priority_info (tree decl)
5610 struct tree_priority_map in;
5611 struct tree_priority_map *h;
5614 in.base.from = decl;
5615 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5616 h = (struct tree_priority_map *) *loc;
5619 h = GGC_CNEW (struct tree_priority_map);
5621 h->base.from = decl;
5622 h->init = DEFAULT_INIT_PRIORITY;
5623 h->fini = DEFAULT_INIT_PRIORITY;
5629 /* Set the initialization priority for DECL to PRIORITY. */
5632 decl_init_priority_insert (tree decl, priority_type priority)
5634 struct tree_priority_map *h;
5636 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5637 h = decl_priority_info (decl);
5641 /* Set the finalization priority for DECL to PRIORITY. */
5644 decl_fini_priority_insert (tree decl, priority_type priority)
5646 struct tree_priority_map *h;
5648 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5649 h = decl_priority_info (decl);
5653 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5656 print_debug_expr_statistics (void)
5658 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5659 (long) htab_size (debug_expr_for_decl),
5660 (long) htab_elements (debug_expr_for_decl),
5661 htab_collisions (debug_expr_for_decl));
5664 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5667 print_value_expr_statistics (void)
5669 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5670 (long) htab_size (value_expr_for_decl),
5671 (long) htab_elements (value_expr_for_decl),
5672 htab_collisions (value_expr_for_decl));
5675 /* Lookup a debug expression for FROM, and return it if we find one. */
5678 decl_debug_expr_lookup (tree from)
5680 struct tree_map *h, in;
5681 in.base.from = from;
5683 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5684 htab_hash_pointer (from));
5690 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5693 decl_debug_expr_insert (tree from, tree to)
5698 h = GGC_NEW (struct tree_map);
5699 h->hash = htab_hash_pointer (from);
5700 h->base.from = from;
5702 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5703 *(struct tree_map **) loc = h;
5706 /* Lookup a value expression for FROM, and return it if we find one. */
5709 decl_value_expr_lookup (tree from)
5711 struct tree_map *h, in;
5712 in.base.from = from;
5714 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5715 htab_hash_pointer (from));
5721 /* Insert a mapping FROM->TO in the value expression hashtable. */
5724 decl_value_expr_insert (tree from, tree to)
5729 h = GGC_NEW (struct tree_map);
5730 h->hash = htab_hash_pointer (from);
5731 h->base.from = from;
5733 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5734 *(struct tree_map **) loc = h;
5737 /* Hashing of types so that we don't make duplicates.
5738 The entry point is `type_hash_canon'. */
5740 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5741 with types in the TREE_VALUE slots), by adding the hash codes
5742 of the individual types. */
5745 type_hash_list (const_tree list, hashval_t hashcode)
5749 for (tail = list; tail; tail = TREE_CHAIN (tail))
5750 if (TREE_VALUE (tail) != error_mark_node)
5751 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5757 /* These are the Hashtable callback functions. */
5759 /* Returns true iff the types are equivalent. */
5762 type_hash_eq (const void *va, const void *vb)
5764 const struct type_hash *const a = (const struct type_hash *) va,
5765 *const b = (const struct type_hash *) vb;
5767 /* First test the things that are the same for all types. */
5768 if (a->hash != b->hash
5769 || TREE_CODE (a->type) != TREE_CODE (b->type)
5770 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5771 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5772 TYPE_ATTRIBUTES (b->type))
5773 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5774 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5775 || (TREE_CODE (a->type) != COMPLEX_TYPE
5776 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5779 switch (TREE_CODE (a->type))
5784 case REFERENCE_TYPE:
5788 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5791 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5792 && !(TYPE_VALUES (a->type)
5793 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5794 && TYPE_VALUES (b->type)
5795 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5796 && type_list_equal (TYPE_VALUES (a->type),
5797 TYPE_VALUES (b->type))))
5800 /* ... fall through ... */
5805 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5806 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5807 TYPE_MAX_VALUE (b->type)))
5808 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5809 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5810 TYPE_MIN_VALUE (b->type))));
5812 case FIXED_POINT_TYPE:
5813 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5816 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5819 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5820 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5821 || (TYPE_ARG_TYPES (a->type)
5822 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5823 && TYPE_ARG_TYPES (b->type)
5824 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5825 && type_list_equal (TYPE_ARG_TYPES (a->type),
5826 TYPE_ARG_TYPES (b->type)))));
5829 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5833 case QUAL_UNION_TYPE:
5834 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5835 || (TYPE_FIELDS (a->type)
5836 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5837 && TYPE_FIELDS (b->type)
5838 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5839 && type_list_equal (TYPE_FIELDS (a->type),
5840 TYPE_FIELDS (b->type))));
5843 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5844 || (TYPE_ARG_TYPES (a->type)
5845 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5846 && TYPE_ARG_TYPES (b->type)
5847 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5848 && type_list_equal (TYPE_ARG_TYPES (a->type),
5849 TYPE_ARG_TYPES (b->type))))
5857 if (lang_hooks.types.type_hash_eq != NULL)
5858 return lang_hooks.types.type_hash_eq (a->type, b->type);
5863 /* Return the cached hash value. */
5866 type_hash_hash (const void *item)
5868 return ((const struct type_hash *) item)->hash;
5871 /* Look in the type hash table for a type isomorphic to TYPE.
5872 If one is found, return it. Otherwise return 0. */
5875 type_hash_lookup (hashval_t hashcode, tree type)
5877 struct type_hash *h, in;
5879 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5880 must call that routine before comparing TYPE_ALIGNs. */
5886 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5893 /* Add an entry to the type-hash-table
5894 for a type TYPE whose hash code is HASHCODE. */
5897 type_hash_add (hashval_t hashcode, tree type)
5899 struct type_hash *h;
5902 h = GGC_NEW (struct type_hash);
5905 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5909 /* Given TYPE, and HASHCODE its hash code, return the canonical
5910 object for an identical type if one already exists.
5911 Otherwise, return TYPE, and record it as the canonical object.
5913 To use this function, first create a type of the sort you want.
5914 Then compute its hash code from the fields of the type that
5915 make it different from other similar types.
5916 Then call this function and use the value. */
5919 type_hash_canon (unsigned int hashcode, tree type)
5923 /* The hash table only contains main variants, so ensure that's what we're
5925 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5927 if (!lang_hooks.types.hash_types)
5930 /* See if the type is in the hash table already. If so, return it.
5931 Otherwise, add the type. */
5932 t1 = type_hash_lookup (hashcode, type);
5935 #ifdef GATHER_STATISTICS
5936 tree_node_counts[(int) t_kind]--;
5937 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5943 type_hash_add (hashcode, type);
5948 /* See if the data pointed to by the type hash table is marked. We consider
5949 it marked if the type is marked or if a debug type number or symbol
5950 table entry has been made for the type. This reduces the amount of
5951 debugging output and eliminates that dependency of the debug output on
5952 the number of garbage collections. */
5955 type_hash_marked_p (const void *p)
5957 const_tree const type = ((const struct type_hash *) p)->type;
5959 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5963 print_type_hash_statistics (void)
5965 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5966 (long) htab_size (type_hash_table),
5967 (long) htab_elements (type_hash_table),
5968 htab_collisions (type_hash_table));
5971 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5972 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5973 by adding the hash codes of the individual attributes. */
5976 attribute_hash_list (const_tree list, hashval_t hashcode)
5980 for (tail = list; tail; tail = TREE_CHAIN (tail))
5981 /* ??? Do we want to add in TREE_VALUE too? */
5982 hashcode = iterative_hash_object
5983 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
5987 /* Given two lists of attributes, return true if list l2 is
5988 equivalent to l1. */
5991 attribute_list_equal (const_tree l1, const_tree l2)
5993 return attribute_list_contained (l1, l2)
5994 && attribute_list_contained (l2, l1);
5997 /* Given two lists of attributes, return true if list L2 is
5998 completely contained within L1. */
5999 /* ??? This would be faster if attribute names were stored in a canonicalized
6000 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6001 must be used to show these elements are equivalent (which they are). */
6002 /* ??? It's not clear that attributes with arguments will always be handled
6006 attribute_list_contained (const_tree l1, const_tree l2)
6010 /* First check the obvious, maybe the lists are identical. */
6014 /* Maybe the lists are similar. */
6015 for (t1 = l1, t2 = l2;
6017 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6018 && TREE_VALUE (t1) == TREE_VALUE (t2);
6019 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6021 /* Maybe the lists are equal. */
6022 if (t1 == 0 && t2 == 0)
6025 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6028 /* This CONST_CAST is okay because lookup_attribute does not
6029 modify its argument and the return value is assigned to a
6031 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6032 CONST_CAST_TREE(l1));
6034 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6037 if (TREE_VALUE (t2) != NULL
6038 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6039 && TREE_VALUE (attr) != NULL
6040 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6042 if (simple_cst_list_equal (TREE_VALUE (t2),
6043 TREE_VALUE (attr)) == 1)
6046 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6057 /* Given two lists of types
6058 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6059 return 1 if the lists contain the same types in the same order.
6060 Also, the TREE_PURPOSEs must match. */
6063 type_list_equal (const_tree l1, const_tree l2)
6067 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6068 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6069 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6070 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6071 && (TREE_TYPE (TREE_PURPOSE (t1))
6072 == TREE_TYPE (TREE_PURPOSE (t2))))))
6078 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6079 given by TYPE. If the argument list accepts variable arguments,
6080 then this function counts only the ordinary arguments. */
6083 type_num_arguments (const_tree type)
6088 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6089 /* If the function does not take a variable number of arguments,
6090 the last element in the list will have type `void'. */
6091 if (VOID_TYPE_P (TREE_VALUE (t)))
6099 /* Nonzero if integer constants T1 and T2
6100 represent the same constant value. */
6103 tree_int_cst_equal (const_tree t1, const_tree t2)
6108 if (t1 == 0 || t2 == 0)
6111 if (TREE_CODE (t1) == INTEGER_CST
6112 && TREE_CODE (t2) == INTEGER_CST
6113 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6114 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6120 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6121 The precise way of comparison depends on their data type. */
6124 tree_int_cst_lt (const_tree t1, const_tree t2)
6129 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6131 int t1_sgn = tree_int_cst_sgn (t1);
6132 int t2_sgn = tree_int_cst_sgn (t2);
6134 if (t1_sgn < t2_sgn)
6136 else if (t1_sgn > t2_sgn)
6138 /* Otherwise, both are non-negative, so we compare them as
6139 unsigned just in case one of them would overflow a signed
6142 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6143 return INT_CST_LT (t1, t2);
6145 return INT_CST_LT_UNSIGNED (t1, t2);
6148 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6151 tree_int_cst_compare (const_tree t1, const_tree t2)
6153 if (tree_int_cst_lt (t1, t2))
6155 else if (tree_int_cst_lt (t2, t1))
6161 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6162 the host. If POS is zero, the value can be represented in a single
6163 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6164 be represented in a single unsigned HOST_WIDE_INT. */
6167 host_integerp (const_tree t, int pos)
6172 return (TREE_CODE (t) == INTEGER_CST
6173 && ((TREE_INT_CST_HIGH (t) == 0
6174 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6175 || (! pos && TREE_INT_CST_HIGH (t) == -1
6176 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6177 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6178 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6179 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6180 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6183 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6184 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6185 be non-negative. We must be able to satisfy the above conditions. */
6188 tree_low_cst (const_tree t, int pos)
6190 gcc_assert (host_integerp (t, pos));
6191 return TREE_INT_CST_LOW (t);
6194 /* Return the most significant bit of the integer constant T. */
6197 tree_int_cst_msb (const_tree t)
6201 unsigned HOST_WIDE_INT l;
6203 /* Note that using TYPE_PRECISION here is wrong. We care about the
6204 actual bits, not the (arbitrary) range of the type. */
6205 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6206 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6207 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6208 return (l & 1) == 1;
6211 /* Return an indication of the sign of the integer constant T.
6212 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6213 Note that -1 will never be returned if T's type is unsigned. */
6216 tree_int_cst_sgn (const_tree t)
6218 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6220 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6222 else if (TREE_INT_CST_HIGH (t) < 0)
6228 /* Return the minimum number of bits needed to represent VALUE in a
6229 signed or unsigned type, UNSIGNEDP says which. */
6232 tree_int_cst_min_precision (tree value, bool unsignedp)
6236 /* If the value is negative, compute its negative minus 1. The latter
6237 adjustment is because the absolute value of the largest negative value
6238 is one larger than the largest positive value. This is equivalent to
6239 a bit-wise negation, so use that operation instead. */
6241 if (tree_int_cst_sgn (value) < 0)
6242 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6244 /* Return the number of bits needed, taking into account the fact
6245 that we need one more bit for a signed than unsigned type. */
6247 if (integer_zerop (value))
6250 log = tree_floor_log2 (value);
6252 return log + 1 + !unsignedp;
6255 /* Compare two constructor-element-type constants. Return 1 if the lists
6256 are known to be equal; otherwise return 0. */
6259 simple_cst_list_equal (const_tree l1, const_tree l2)
6261 while (l1 != NULL_TREE && l2 != NULL_TREE)
6263 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6266 l1 = TREE_CHAIN (l1);
6267 l2 = TREE_CHAIN (l2);
6273 /* Return truthvalue of whether T1 is the same tree structure as T2.
6274 Return 1 if they are the same.
6275 Return 0 if they are understandably different.
6276 Return -1 if either contains tree structure not understood by
6280 simple_cst_equal (const_tree t1, const_tree t2)
6282 enum tree_code code1, code2;
6288 if (t1 == 0 || t2 == 0)
6291 code1 = TREE_CODE (t1);
6292 code2 = TREE_CODE (t2);
6294 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6296 if (CONVERT_EXPR_CODE_P (code2)
6297 || code2 == NON_LVALUE_EXPR)
6298 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6300 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6303 else if (CONVERT_EXPR_CODE_P (code2)
6304 || code2 == NON_LVALUE_EXPR)
6305 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6313 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6314 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6317 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6320 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6323 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6324 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6325 TREE_STRING_LENGTH (t1)));
6329 unsigned HOST_WIDE_INT idx;
6330 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6331 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6333 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6336 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6337 /* ??? Should we handle also fields here? */
6338 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6339 VEC_index (constructor_elt, v2, idx)->value))
6345 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6348 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6351 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6354 const_tree arg1, arg2;
6355 const_call_expr_arg_iterator iter1, iter2;
6356 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6357 arg2 = first_const_call_expr_arg (t2, &iter2);
6359 arg1 = next_const_call_expr_arg (&iter1),
6360 arg2 = next_const_call_expr_arg (&iter2))
6362 cmp = simple_cst_equal (arg1, arg2);
6366 return arg1 == arg2;
6370 /* Special case: if either target is an unallocated VAR_DECL,
6371 it means that it's going to be unified with whatever the
6372 TARGET_EXPR is really supposed to initialize, so treat it
6373 as being equivalent to anything. */
6374 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6375 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6376 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6377 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6378 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6379 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6382 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6387 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6389 case WITH_CLEANUP_EXPR:
6390 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6394 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6397 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6398 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6412 /* This general rule works for most tree codes. All exceptions should be
6413 handled above. If this is a language-specific tree code, we can't
6414 trust what might be in the operand, so say we don't know
6416 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6419 switch (TREE_CODE_CLASS (code1))
6423 case tcc_comparison:
6424 case tcc_expression:
6428 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6430 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6442 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6443 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6444 than U, respectively. */
6447 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6449 if (tree_int_cst_sgn (t) < 0)
6451 else if (TREE_INT_CST_HIGH (t) != 0)
6453 else if (TREE_INT_CST_LOW (t) == u)
6455 else if (TREE_INT_CST_LOW (t) < u)
6461 /* Return true if CODE represents an associative tree code. Otherwise
6464 associative_tree_code (enum tree_code code)
6483 /* Return true if CODE represents a commutative tree code. Otherwise
6486 commutative_tree_code (enum tree_code code)
6499 case UNORDERED_EXPR:
6503 case TRUTH_AND_EXPR:
6504 case TRUTH_XOR_EXPR:
6514 /* Generate a hash value for an expression. This can be used iteratively
6515 by passing a previous result as the VAL argument.
6517 This function is intended to produce the same hash for expressions which
6518 would compare equal using operand_equal_p. */
6521 iterative_hash_expr (const_tree t, hashval_t val)
6524 enum tree_code code;
6528 return iterative_hash_hashval_t (0, val);
6530 code = TREE_CODE (t);
6534 /* Alas, constants aren't shared, so we can't rely on pointer
6537 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6538 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6541 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6543 return iterative_hash_hashval_t (val2, val);
6547 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6549 return iterative_hash_hashval_t (val2, val);
6552 return iterative_hash (TREE_STRING_POINTER (t),
6553 TREE_STRING_LENGTH (t), val);
6555 val = iterative_hash_expr (TREE_REALPART (t), val);
6556 return iterative_hash_expr (TREE_IMAGPART (t), val);
6558 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6561 /* we can just compare by pointer. */
6562 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6565 /* A list of expressions, for a CALL_EXPR or as the elements of a
6567 for (; t; t = TREE_CHAIN (t))
6568 val = iterative_hash_expr (TREE_VALUE (t), val);
6572 unsigned HOST_WIDE_INT idx;
6574 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6576 val = iterative_hash_expr (field, val);
6577 val = iterative_hash_expr (value, val);
6582 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6583 Otherwise nodes that compare equal according to operand_equal_p might
6584 get different hash codes. However, don't do this for machine specific
6585 or front end builtins, since the function code is overloaded in those
6587 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6588 && built_in_decls[DECL_FUNCTION_CODE (t)])
6590 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6591 code = TREE_CODE (t);
6595 tclass = TREE_CODE_CLASS (code);
6597 if (tclass == tcc_declaration)
6599 /* DECL's have a unique ID */
6600 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6604 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6606 val = iterative_hash_object (code, val);
6608 /* Don't hash the type, that can lead to having nodes which
6609 compare equal according to operand_equal_p, but which
6610 have different hash codes. */
6611 if (CONVERT_EXPR_CODE_P (code)
6612 || code == NON_LVALUE_EXPR)
6614 /* Make sure to include signness in the hash computation. */
6615 val += TYPE_UNSIGNED (TREE_TYPE (t));
6616 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6619 else if (commutative_tree_code (code))
6621 /* It's a commutative expression. We want to hash it the same
6622 however it appears. We do this by first hashing both operands
6623 and then rehashing based on the order of their independent
6625 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6626 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6630 t = one, one = two, two = t;
6632 val = iterative_hash_hashval_t (one, val);
6633 val = iterative_hash_hashval_t (two, val);
6636 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6637 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6644 /* Generate a hash value for a pair of expressions. This can be used
6645 iteratively by passing a previous result as the VAL argument.
6647 The same hash value is always returned for a given pair of expressions,
6648 regardless of the order in which they are presented. This is useful in
6649 hashing the operands of commutative functions. */
6652 iterative_hash_exprs_commutative (const_tree t1,
6653 const_tree t2, hashval_t val)
6655 hashval_t one = iterative_hash_expr (t1, 0);
6656 hashval_t two = iterative_hash_expr (t2, 0);
6660 t = one, one = two, two = t;
6661 val = iterative_hash_hashval_t (one, val);
6662 val = iterative_hash_hashval_t (two, val);
6667 /* Constructors for pointer, array and function types.
6668 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6669 constructed by language-dependent code, not here.) */
6671 /* Construct, lay out and return the type of pointers to TO_TYPE with
6672 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6673 reference all of memory. If such a type has already been
6674 constructed, reuse it. */
6677 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6682 if (to_type == error_mark_node)
6683 return error_mark_node;
6685 /* If the pointed-to type has the may_alias attribute set, force
6686 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6687 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6688 can_alias_all = true;
6690 /* In some cases, languages will have things that aren't a POINTER_TYPE
6691 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6692 In that case, return that type without regard to the rest of our
6695 ??? This is a kludge, but consistent with the way this function has
6696 always operated and there doesn't seem to be a good way to avoid this
6698 if (TYPE_POINTER_TO (to_type) != 0
6699 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6700 return TYPE_POINTER_TO (to_type);
6702 /* First, if we already have a type for pointers to TO_TYPE and it's
6703 the proper mode, use it. */
6704 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6705 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6708 t = make_node (POINTER_TYPE);
6710 TREE_TYPE (t) = to_type;
6711 SET_TYPE_MODE (t, mode);
6712 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6713 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6714 TYPE_POINTER_TO (to_type) = t;
6716 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6717 SET_TYPE_STRUCTURAL_EQUALITY (t);
6718 else if (TYPE_CANONICAL (to_type) != to_type)
6720 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6721 mode, can_alias_all);
6723 /* Lay out the type. This function has many callers that are concerned
6724 with expression-construction, and this simplifies them all. */
6730 /* By default build pointers in ptr_mode. */
6733 build_pointer_type (tree to_type)
6735 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6736 : TYPE_ADDR_SPACE (to_type);
6737 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6738 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6741 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6744 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6749 if (to_type == error_mark_node)
6750 return error_mark_node;
6752 /* If the pointed-to type has the may_alias attribute set, force
6753 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6754 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6755 can_alias_all = true;
6757 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6758 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6759 In that case, return that type without regard to the rest of our
6762 ??? This is a kludge, but consistent with the way this function has
6763 always operated and there doesn't seem to be a good way to avoid this
6765 if (TYPE_REFERENCE_TO (to_type) != 0
6766 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6767 return TYPE_REFERENCE_TO (to_type);
6769 /* First, if we already have a type for pointers to TO_TYPE and it's
6770 the proper mode, use it. */
6771 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6772 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6775 t = make_node (REFERENCE_TYPE);
6777 TREE_TYPE (t) = to_type;
6778 SET_TYPE_MODE (t, mode);
6779 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6780 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6781 TYPE_REFERENCE_TO (to_type) = t;
6783 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6784 SET_TYPE_STRUCTURAL_EQUALITY (t);
6785 else if (TYPE_CANONICAL (to_type) != to_type)
6787 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6788 mode, can_alias_all);
6796 /* Build the node for the type of references-to-TO_TYPE by default
6800 build_reference_type (tree to_type)
6802 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6803 : TYPE_ADDR_SPACE (to_type);
6804 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6805 return build_reference_type_for_mode (to_type, pointer_mode, false);
6808 /* Build a type that is compatible with t but has no cv quals anywhere
6811 const char *const *const * -> char ***. */
6814 build_type_no_quals (tree t)
6816 switch (TREE_CODE (t))
6819 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6821 TYPE_REF_CAN_ALIAS_ALL (t));
6822 case REFERENCE_TYPE:
6824 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6826 TYPE_REF_CAN_ALIAS_ALL (t));
6828 return TYPE_MAIN_VARIANT (t);
6832 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6833 MAXVAL should be the maximum value in the domain
6834 (one less than the length of the array).
6836 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6837 We don't enforce this limit, that is up to caller (e.g. language front end).
6838 The limit exists because the result is a signed type and we don't handle
6839 sizes that use more than one HOST_WIDE_INT. */
6842 build_index_type (tree maxval)
6844 tree itype = make_node (INTEGER_TYPE);
6846 TREE_TYPE (itype) = sizetype;
6847 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6848 TYPE_MIN_VALUE (itype) = size_zero_node;
6849 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6850 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6851 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6852 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6853 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6854 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6856 if (host_integerp (maxval, 1))
6857 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6860 /* Since we cannot hash this type, we need to compare it using
6861 structural equality checks. */
6862 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6867 /* Builds a signed or unsigned integer type of precision PRECISION.
6868 Used for C bitfields whose precision does not match that of
6869 built-in target types. */
6871 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6874 tree itype = make_node (INTEGER_TYPE);
6876 TYPE_PRECISION (itype) = precision;
6879 fixup_unsigned_type (itype);
6881 fixup_signed_type (itype);
6883 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6884 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6889 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6890 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6891 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6894 build_range_type (tree type, tree lowval, tree highval)
6896 tree itype = make_node (INTEGER_TYPE);
6898 TREE_TYPE (itype) = type;
6899 if (type == NULL_TREE)
6902 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6903 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6905 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6906 SET_TYPE_MODE (itype, TYPE_MODE (type));
6907 TYPE_SIZE (itype) = TYPE_SIZE (type);
6908 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6909 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6910 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6912 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6913 return type_hash_canon (tree_low_cst (highval, 0)
6914 - tree_low_cst (lowval, 0),
6920 /* Return true if the debug information for TYPE, a subtype, should be emitted
6921 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6922 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6923 debug info and doesn't reflect the source code. */
6926 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6928 tree base_type = TREE_TYPE (type), low, high;
6930 /* Subrange types have a base type which is an integral type. */
6931 if (!INTEGRAL_TYPE_P (base_type))
6934 /* Get the real bounds of the subtype. */
6935 if (lang_hooks.types.get_subrange_bounds)
6936 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6939 low = TYPE_MIN_VALUE (type);
6940 high = TYPE_MAX_VALUE (type);
6943 /* If the type and its base type have the same representation and the same
6944 name, then the type is not a subrange but a copy of the base type. */
6945 if ((TREE_CODE (base_type) == INTEGER_TYPE
6946 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6947 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6948 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6949 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6951 tree type_name = TYPE_NAME (type);
6952 tree base_type_name = TYPE_NAME (base_type);
6954 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6955 type_name = DECL_NAME (type_name);
6957 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6958 base_type_name = DECL_NAME (base_type_name);
6960 if (type_name == base_type_name)
6971 /* Just like build_index_type, but takes lowval and highval instead
6972 of just highval (maxval). */
6975 build_index_2_type (tree lowval, tree highval)
6977 return build_range_type (sizetype, lowval, highval);
6980 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6981 and number of elements specified by the range of values of INDEX_TYPE.
6982 If such a type has already been constructed, reuse it. */
6985 build_array_type (tree elt_type, tree index_type)
6988 hashval_t hashcode = 0;
6990 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
6992 error ("arrays of functions are not meaningful");
6993 elt_type = integer_type_node;
6996 t = make_node (ARRAY_TYPE);
6997 TREE_TYPE (t) = elt_type;
6998 TYPE_DOMAIN (t) = index_type;
6999 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7002 /* If the element type is incomplete at this point we get marked for
7003 structural equality. Do not record these types in the canonical
7005 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7008 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7010 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7011 t = type_hash_canon (hashcode, t);
7013 if (TYPE_CANONICAL (t) == t)
7015 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7016 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7017 SET_TYPE_STRUCTURAL_EQUALITY (t);
7018 else if (TYPE_CANONICAL (elt_type) != elt_type
7019 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7021 = build_array_type (TYPE_CANONICAL (elt_type),
7022 index_type ? TYPE_CANONICAL (index_type) : NULL);
7028 /* Recursively examines the array elements of TYPE, until a non-array
7029 element type is found. */
7032 strip_array_types (tree type)
7034 while (TREE_CODE (type) == ARRAY_TYPE)
7035 type = TREE_TYPE (type);
7040 /* Computes the canonical argument types from the argument type list
7043 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7044 on entry to this function, or if any of the ARGTYPES are
7047 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7048 true on entry to this function, or if any of the ARGTYPES are
7051 Returns a canonical argument list, which may be ARGTYPES when the
7052 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7053 true) or would not differ from ARGTYPES. */
7056 maybe_canonicalize_argtypes(tree argtypes,
7057 bool *any_structural_p,
7058 bool *any_noncanonical_p)
7061 bool any_noncanonical_argtypes_p = false;
7063 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7065 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7066 /* Fail gracefully by stating that the type is structural. */
7067 *any_structural_p = true;
7068 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7069 *any_structural_p = true;
7070 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7071 || TREE_PURPOSE (arg))
7072 /* If the argument has a default argument, we consider it
7073 non-canonical even though the type itself is canonical.
7074 That way, different variants of function and method types
7075 with default arguments will all point to the variant with
7076 no defaults as their canonical type. */
7077 any_noncanonical_argtypes_p = true;
7080 if (*any_structural_p)
7083 if (any_noncanonical_argtypes_p)
7085 /* Build the canonical list of argument types. */
7086 tree canon_argtypes = NULL_TREE;
7087 bool is_void = false;
7089 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7091 if (arg == void_list_node)
7094 canon_argtypes = tree_cons (NULL_TREE,
7095 TYPE_CANONICAL (TREE_VALUE (arg)),
7099 canon_argtypes = nreverse (canon_argtypes);
7101 canon_argtypes = chainon (canon_argtypes, void_list_node);
7103 /* There is a non-canonical type. */
7104 *any_noncanonical_p = true;
7105 return canon_argtypes;
7108 /* The canonical argument types are the same as ARGTYPES. */
7112 /* Construct, lay out and return
7113 the type of functions returning type VALUE_TYPE
7114 given arguments of types ARG_TYPES.
7115 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7116 are data type nodes for the arguments of the function.
7117 If such a type has already been constructed, reuse it. */
7120 build_function_type (tree value_type, tree arg_types)
7123 hashval_t hashcode = 0;
7124 bool any_structural_p, any_noncanonical_p;
7125 tree canon_argtypes;
7127 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7129 error ("function return type cannot be function");
7130 value_type = integer_type_node;
7133 /* Make a node of the sort we want. */
7134 t = make_node (FUNCTION_TYPE);
7135 TREE_TYPE (t) = value_type;
7136 TYPE_ARG_TYPES (t) = arg_types;
7138 /* If we already have such a type, use the old one. */
7139 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7140 hashcode = type_hash_list (arg_types, hashcode);
7141 t = type_hash_canon (hashcode, t);
7143 /* Set up the canonical type. */
7144 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7145 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7146 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7148 &any_noncanonical_p);
7149 if (any_structural_p)
7150 SET_TYPE_STRUCTURAL_EQUALITY (t);
7151 else if (any_noncanonical_p)
7152 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7155 if (!COMPLETE_TYPE_P (t))
7160 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7163 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7165 tree new_type = NULL;
7166 tree args, new_args = NULL, t;
7170 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7171 args = TREE_CHAIN (args), i++)
7172 if (!bitmap_bit_p (args_to_skip, i))
7173 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7175 new_reversed = nreverse (new_args);
7179 TREE_CHAIN (new_args) = void_list_node;
7181 new_reversed = void_list_node;
7184 /* Use copy_node to preserve as much as possible from original type
7185 (debug info, attribute lists etc.)
7186 Exception is METHOD_TYPEs must have THIS argument.
7187 When we are asked to remove it, we need to build new FUNCTION_TYPE
7189 if (TREE_CODE (orig_type) != METHOD_TYPE
7190 || !bitmap_bit_p (args_to_skip, 0))
7192 new_type = copy_node (orig_type);
7193 TYPE_ARG_TYPES (new_type) = new_reversed;
7198 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7200 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7203 /* This is a new type, not a copy of an old type. Need to reassociate
7204 variants. We can handle everything except the main variant lazily. */
7205 t = TYPE_MAIN_VARIANT (orig_type);
7208 TYPE_MAIN_VARIANT (new_type) = t;
7209 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7210 TYPE_NEXT_VARIANT (t) = new_type;
7214 TYPE_MAIN_VARIANT (new_type) = new_type;
7215 TYPE_NEXT_VARIANT (new_type) = NULL;
7220 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7222 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7223 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7224 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7227 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7229 tree new_decl = copy_node (orig_decl);
7232 new_type = TREE_TYPE (orig_decl);
7233 if (prototype_p (new_type))
7234 new_type = build_function_type_skip_args (new_type, args_to_skip);
7235 TREE_TYPE (new_decl) = new_type;
7237 /* For declarations setting DECL_VINDEX (i.e. methods)
7238 we expect first argument to be THIS pointer. */
7239 if (bitmap_bit_p (args_to_skip, 0))
7240 DECL_VINDEX (new_decl) = NULL_TREE;
7244 /* Build a function type. The RETURN_TYPE is the type returned by the
7245 function. If VAARGS is set, no void_type_node is appended to the
7246 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7249 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7253 t = va_arg (argp, tree);
7254 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7255 args = tree_cons (NULL_TREE, t, args);
7260 if (args != NULL_TREE)
7261 args = nreverse (args);
7262 gcc_assert (args != NULL_TREE && last != void_list_node);
7264 else if (args == NULL_TREE)
7265 args = void_list_node;
7269 args = nreverse (args);
7270 TREE_CHAIN (last) = void_list_node;
7272 args = build_function_type (return_type, args);
7277 /* Build a function type. The RETURN_TYPE is the type returned by the
7278 function. If additional arguments are provided, they are
7279 additional argument types. The list of argument types must always
7280 be terminated by NULL_TREE. */
7283 build_function_type_list (tree return_type, ...)
7288 va_start (p, return_type);
7289 args = build_function_type_list_1 (false, return_type, p);
7294 /* Build a variable argument function type. The RETURN_TYPE is the
7295 type returned by the function. If additional arguments are provided,
7296 they are additional argument types. The list of argument types must
7297 always be terminated by NULL_TREE. */
7300 build_varargs_function_type_list (tree return_type, ...)
7305 va_start (p, return_type);
7306 args = build_function_type_list_1 (true, return_type, p);
7312 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7313 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7314 for the method. An implicit additional parameter (of type
7315 pointer-to-BASETYPE) is added to the ARGTYPES. */
7318 build_method_type_directly (tree basetype,
7325 bool any_structural_p, any_noncanonical_p;
7326 tree canon_argtypes;
7328 /* Make a node of the sort we want. */
7329 t = make_node (METHOD_TYPE);
7331 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7332 TREE_TYPE (t) = rettype;
7333 ptype = build_pointer_type (basetype);
7335 /* The actual arglist for this function includes a "hidden" argument
7336 which is "this". Put it into the list of argument types. */
7337 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7338 TYPE_ARG_TYPES (t) = argtypes;
7340 /* If we already have such a type, use the old one. */
7341 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7342 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7343 hashcode = type_hash_list (argtypes, hashcode);
7344 t = type_hash_canon (hashcode, t);
7346 /* Set up the canonical type. */
7348 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7349 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7351 = (TYPE_CANONICAL (basetype) != basetype
7352 || TYPE_CANONICAL (rettype) != rettype);
7353 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7355 &any_noncanonical_p);
7356 if (any_structural_p)
7357 SET_TYPE_STRUCTURAL_EQUALITY (t);
7358 else if (any_noncanonical_p)
7360 = build_method_type_directly (TYPE_CANONICAL (basetype),
7361 TYPE_CANONICAL (rettype),
7363 if (!COMPLETE_TYPE_P (t))
7369 /* Construct, lay out and return the type of methods belonging to class
7370 BASETYPE and whose arguments and values are described by TYPE.
7371 If that type exists already, reuse it.
7372 TYPE must be a FUNCTION_TYPE node. */
7375 build_method_type (tree basetype, tree type)
7377 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7379 return build_method_type_directly (basetype,
7381 TYPE_ARG_TYPES (type));
7384 /* Construct, lay out and return the type of offsets to a value
7385 of type TYPE, within an object of type BASETYPE.
7386 If a suitable offset type exists already, reuse it. */
7389 build_offset_type (tree basetype, tree type)
7392 hashval_t hashcode = 0;
7394 /* Make a node of the sort we want. */
7395 t = make_node (OFFSET_TYPE);
7397 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7398 TREE_TYPE (t) = type;
7400 /* If we already have such a type, use the old one. */
7401 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7402 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7403 t = type_hash_canon (hashcode, t);
7405 if (!COMPLETE_TYPE_P (t))
7408 if (TYPE_CANONICAL (t) == t)
7410 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7411 || TYPE_STRUCTURAL_EQUALITY_P (type))
7412 SET_TYPE_STRUCTURAL_EQUALITY (t);
7413 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7414 || TYPE_CANONICAL (type) != type)
7416 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7417 TYPE_CANONICAL (type));
7423 /* Create a complex type whose components are COMPONENT_TYPE. */
7426 build_complex_type (tree component_type)
7431 gcc_assert (INTEGRAL_TYPE_P (component_type)
7432 || SCALAR_FLOAT_TYPE_P (component_type)
7433 || FIXED_POINT_TYPE_P (component_type));
7435 /* Make a node of the sort we want. */
7436 t = make_node (COMPLEX_TYPE);
7438 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7440 /* If we already have such a type, use the old one. */
7441 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7442 t = type_hash_canon (hashcode, t);
7444 if (!COMPLETE_TYPE_P (t))
7447 if (TYPE_CANONICAL (t) == t)
7449 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7450 SET_TYPE_STRUCTURAL_EQUALITY (t);
7451 else if (TYPE_CANONICAL (component_type) != component_type)
7453 = build_complex_type (TYPE_CANONICAL (component_type));
7456 /* We need to create a name, since complex is a fundamental type. */
7457 if (! TYPE_NAME (t))
7460 if (component_type == char_type_node)
7461 name = "complex char";
7462 else if (component_type == signed_char_type_node)
7463 name = "complex signed char";
7464 else if (component_type == unsigned_char_type_node)
7465 name = "complex unsigned char";
7466 else if (component_type == short_integer_type_node)
7467 name = "complex short int";
7468 else if (component_type == short_unsigned_type_node)
7469 name = "complex short unsigned int";
7470 else if (component_type == integer_type_node)
7471 name = "complex int";
7472 else if (component_type == unsigned_type_node)
7473 name = "complex unsigned int";
7474 else if (component_type == long_integer_type_node)
7475 name = "complex long int";
7476 else if (component_type == long_unsigned_type_node)
7477 name = "complex long unsigned int";
7478 else if (component_type == long_long_integer_type_node)
7479 name = "complex long long int";
7480 else if (component_type == long_long_unsigned_type_node)
7481 name = "complex long long unsigned int";
7486 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7487 get_identifier (name), t);
7490 return build_qualified_type (t, TYPE_QUALS (component_type));
7493 /* If TYPE is a real or complex floating-point type and the target
7494 does not directly support arithmetic on TYPE then return the wider
7495 type to be used for arithmetic on TYPE. Otherwise, return
7499 excess_precision_type (tree type)
7501 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7503 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7504 switch (TREE_CODE (type))
7507 switch (flt_eval_method)
7510 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7511 return double_type_node;
7514 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7515 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7516 return long_double_type_node;
7523 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7525 switch (flt_eval_method)
7528 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7529 return complex_double_type_node;
7532 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7533 || (TYPE_MODE (TREE_TYPE (type))
7534 == TYPE_MODE (double_type_node)))
7535 return complex_long_double_type_node;
7548 /* Return OP, stripped of any conversions to wider types as much as is safe.
7549 Converting the value back to OP's type makes a value equivalent to OP.
7551 If FOR_TYPE is nonzero, we return a value which, if converted to
7552 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7554 OP must have integer, real or enumeral type. Pointers are not allowed!
7556 There are some cases where the obvious value we could return
7557 would regenerate to OP if converted to OP's type,
7558 but would not extend like OP to wider types.
7559 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7560 For example, if OP is (unsigned short)(signed char)-1,
7561 we avoid returning (signed char)-1 if FOR_TYPE is int,
7562 even though extending that to an unsigned short would regenerate OP,
7563 since the result of extending (signed char)-1 to (int)
7564 is different from (int) OP. */
7567 get_unwidened (tree op, tree for_type)
7569 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7570 tree type = TREE_TYPE (op);
7572 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7574 = (for_type != 0 && for_type != type
7575 && final_prec > TYPE_PRECISION (type)
7576 && TYPE_UNSIGNED (type));
7579 while (CONVERT_EXPR_P (op))
7583 /* TYPE_PRECISION on vector types has different meaning
7584 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7585 so avoid them here. */
7586 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7589 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7590 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7592 /* Truncations are many-one so cannot be removed.
7593 Unless we are later going to truncate down even farther. */
7595 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7598 /* See what's inside this conversion. If we decide to strip it,
7600 op = TREE_OPERAND (op, 0);
7602 /* If we have not stripped any zero-extensions (uns is 0),
7603 we can strip any kind of extension.
7604 If we have previously stripped a zero-extension,
7605 only zero-extensions can safely be stripped.
7606 Any extension can be stripped if the bits it would produce
7607 are all going to be discarded later by truncating to FOR_TYPE. */
7611 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7613 /* TYPE_UNSIGNED says whether this is a zero-extension.
7614 Let's avoid computing it if it does not affect WIN
7615 and if UNS will not be needed again. */
7617 || CONVERT_EXPR_P (op))
7618 && TYPE_UNSIGNED (TREE_TYPE (op)))
7629 /* Return OP or a simpler expression for a narrower value
7630 which can be sign-extended or zero-extended to give back OP.
7631 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7632 or 0 if the value should be sign-extended. */
7635 get_narrower (tree op, int *unsignedp_ptr)
7640 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7642 while (TREE_CODE (op) == NOP_EXPR)
7645 = (TYPE_PRECISION (TREE_TYPE (op))
7646 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7648 /* Truncations are many-one so cannot be removed. */
7652 /* See what's inside this conversion. If we decide to strip it,
7657 op = TREE_OPERAND (op, 0);
7658 /* An extension: the outermost one can be stripped,
7659 but remember whether it is zero or sign extension. */
7661 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7662 /* Otherwise, if a sign extension has been stripped,
7663 only sign extensions can now be stripped;
7664 if a zero extension has been stripped, only zero-extensions. */
7665 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7669 else /* bitschange == 0 */
7671 /* A change in nominal type can always be stripped, but we must
7672 preserve the unsignedness. */
7674 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7676 op = TREE_OPERAND (op, 0);
7677 /* Keep trying to narrow, but don't assign op to win if it
7678 would turn an integral type into something else. */
7679 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7686 if (TREE_CODE (op) == COMPONENT_REF
7687 /* Since type_for_size always gives an integer type. */
7688 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7689 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7690 /* Ensure field is laid out already. */
7691 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7692 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7694 unsigned HOST_WIDE_INT innerprec
7695 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7696 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7697 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7698 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7700 /* We can get this structure field in a narrower type that fits it,
7701 but the resulting extension to its nominal type (a fullword type)
7702 must satisfy the same conditions as for other extensions.
7704 Do this only for fields that are aligned (not bit-fields),
7705 because when bit-field insns will be used there is no
7706 advantage in doing this. */
7708 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7709 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7710 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7714 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7715 win = fold_convert (type, op);
7719 *unsignedp_ptr = uns;
7723 /* Nonzero if integer constant C has a value that is permissible
7724 for type TYPE (an INTEGER_TYPE). */
7727 int_fits_type_p (const_tree c, const_tree type)
7729 tree type_low_bound, type_high_bound;
7730 bool ok_for_low_bound, ok_for_high_bound, unsc;
7733 dc = tree_to_double_int (c);
7734 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7736 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7737 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7739 /* So c is an unsigned integer whose type is sizetype and type is not.
7740 sizetype'd integers are sign extended even though they are
7741 unsigned. If the integer value fits in the lower end word of c,
7742 and if the higher end word has all its bits set to 1, that
7743 means the higher end bits are set to 1 only for sign extension.
7744 So let's convert c into an equivalent zero extended unsigned
7746 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7749 type_low_bound = TYPE_MIN_VALUE (type);
7750 type_high_bound = TYPE_MAX_VALUE (type);
7752 /* If at least one bound of the type is a constant integer, we can check
7753 ourselves and maybe make a decision. If no such decision is possible, but
7754 this type is a subtype, try checking against that. Otherwise, use
7755 fit_double_type, which checks against the precision.
7757 Compute the status for each possibly constant bound, and return if we see
7758 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7759 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7760 for "constant known to fit". */
7762 /* Check if c >= type_low_bound. */
7763 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7765 dd = tree_to_double_int (type_low_bound);
7766 if (TREE_CODE (type) == INTEGER_TYPE
7767 && TYPE_IS_SIZETYPE (type)
7768 && TYPE_UNSIGNED (type))
7769 dd = double_int_zext (dd, TYPE_PRECISION (type));
7770 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7772 int c_neg = (!unsc && double_int_negative_p (dc));
7773 int t_neg = (unsc && double_int_negative_p (dd));
7775 if (c_neg && !t_neg)
7777 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7780 else if (double_int_cmp (dc, dd, unsc) < 0)
7782 ok_for_low_bound = true;
7785 ok_for_low_bound = false;
7787 /* Check if c <= type_high_bound. */
7788 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7790 dd = tree_to_double_int (type_high_bound);
7791 if (TREE_CODE (type) == INTEGER_TYPE
7792 && TYPE_IS_SIZETYPE (type)
7793 && TYPE_UNSIGNED (type))
7794 dd = double_int_zext (dd, TYPE_PRECISION (type));
7795 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7797 int c_neg = (!unsc && double_int_negative_p (dc));
7798 int t_neg = (unsc && double_int_negative_p (dd));
7800 if (t_neg && !c_neg)
7802 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7805 else if (double_int_cmp (dc, dd, unsc) > 0)
7807 ok_for_high_bound = true;
7810 ok_for_high_bound = false;
7812 /* If the constant fits both bounds, the result is known. */
7813 if (ok_for_low_bound && ok_for_high_bound)
7816 /* Perform some generic filtering which may allow making a decision
7817 even if the bounds are not constant. First, negative integers
7818 never fit in unsigned types, */
7819 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7822 /* Second, narrower types always fit in wider ones. */
7823 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7826 /* Third, unsigned integers with top bit set never fit signed types. */
7827 if (! TYPE_UNSIGNED (type) && unsc)
7829 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7830 if (prec < HOST_BITS_PER_WIDE_INT)
7832 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7835 else if (((((unsigned HOST_WIDE_INT) 1)
7836 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7840 /* If we haven't been able to decide at this point, there nothing more we
7841 can check ourselves here. Look at the base type if we have one and it
7842 has the same precision. */
7843 if (TREE_CODE (type) == INTEGER_TYPE
7844 && TREE_TYPE (type) != 0
7845 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7847 type = TREE_TYPE (type);
7851 /* Or to fit_double_type, if nothing else. */
7852 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7855 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7856 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7857 represented (assuming two's-complement arithmetic) within the bit
7858 precision of the type are returned instead. */
7861 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7863 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7864 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7865 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7866 TYPE_UNSIGNED (type));
7869 if (TYPE_UNSIGNED (type))
7870 mpz_set_ui (min, 0);
7874 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7875 mn = double_int_sext (double_int_add (mn, double_int_one),
7876 TYPE_PRECISION (type));
7877 mpz_set_double_int (min, mn, false);
7881 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7882 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7883 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7884 TYPE_UNSIGNED (type));
7887 if (TYPE_UNSIGNED (type))
7888 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7891 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7896 /* Return true if VAR is an automatic variable defined in function FN. */
7899 auto_var_in_fn_p (const_tree var, const_tree fn)
7901 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7902 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
7903 && ! TREE_STATIC (var))
7904 || TREE_CODE (var) == LABEL_DECL
7905 || TREE_CODE (var) == RESULT_DECL));
7908 /* Subprogram of following function. Called by walk_tree.
7910 Return *TP if it is an automatic variable or parameter of the
7911 function passed in as DATA. */
7914 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7916 tree fn = (tree) data;
7921 else if (DECL_P (*tp)
7922 && auto_var_in_fn_p (*tp, fn))
7928 /* Returns true if T is, contains, or refers to a type with variable
7929 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7930 arguments, but not the return type. If FN is nonzero, only return
7931 true if a modifier of the type or position of FN is a variable or
7932 parameter inside FN.
7934 This concept is more general than that of C99 'variably modified types':
7935 in C99, a struct type is never variably modified because a VLA may not
7936 appear as a structure member. However, in GNU C code like:
7938 struct S { int i[f()]; };
7940 is valid, and other languages may define similar constructs. */
7943 variably_modified_type_p (tree type, tree fn)
7947 /* Test if T is either variable (if FN is zero) or an expression containing
7948 a variable in FN. */
7949 #define RETURN_TRUE_IF_VAR(T) \
7950 do { tree _t = (T); \
7951 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7952 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7953 return true; } while (0)
7955 if (type == error_mark_node)
7958 /* If TYPE itself has variable size, it is variably modified. */
7959 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7960 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
7962 switch (TREE_CODE (type))
7965 case REFERENCE_TYPE:
7967 if (variably_modified_type_p (TREE_TYPE (type), fn))
7973 /* If TYPE is a function type, it is variably modified if the
7974 return type is variably modified. */
7975 if (variably_modified_type_p (TREE_TYPE (type), fn))
7981 case FIXED_POINT_TYPE:
7984 /* Scalar types are variably modified if their end points
7986 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
7987 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
7992 case QUAL_UNION_TYPE:
7993 /* We can't see if any of the fields are variably-modified by the
7994 definition we normally use, since that would produce infinite
7995 recursion via pointers. */
7996 /* This is variably modified if some field's type is. */
7997 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
7998 if (TREE_CODE (t) == FIELD_DECL)
8000 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8001 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8002 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8004 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8005 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8010 /* Do not call ourselves to avoid infinite recursion. This is
8011 variably modified if the element type is. */
8012 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8013 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8020 /* The current language may have other cases to check, but in general,
8021 all other types are not variably modified. */
8022 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8024 #undef RETURN_TRUE_IF_VAR
8027 /* Given a DECL or TYPE, return the scope in which it was declared, or
8028 NULL_TREE if there is no containing scope. */
8031 get_containing_scope (const_tree t)
8033 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8036 /* Return the innermost context enclosing DECL that is
8037 a FUNCTION_DECL, or zero if none. */
8040 decl_function_context (const_tree decl)
8044 if (TREE_CODE (decl) == ERROR_MARK)
8047 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8048 where we look up the function at runtime. Such functions always take
8049 a first argument of type 'pointer to real context'.
8051 C++ should really be fixed to use DECL_CONTEXT for the real context,
8052 and use something else for the "virtual context". */
8053 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8056 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8058 context = DECL_CONTEXT (decl);
8060 while (context && TREE_CODE (context) != FUNCTION_DECL)
8062 if (TREE_CODE (context) == BLOCK)
8063 context = BLOCK_SUPERCONTEXT (context);
8065 context = get_containing_scope (context);
8071 /* Return the innermost context enclosing DECL that is
8072 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8073 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8076 decl_type_context (const_tree decl)
8078 tree context = DECL_CONTEXT (decl);
8081 switch (TREE_CODE (context))
8083 case NAMESPACE_DECL:
8084 case TRANSLATION_UNIT_DECL:
8089 case QUAL_UNION_TYPE:
8094 context = DECL_CONTEXT (context);
8098 context = BLOCK_SUPERCONTEXT (context);
8108 /* CALL is a CALL_EXPR. Return the declaration for the function
8109 called, or NULL_TREE if the called function cannot be
8113 get_callee_fndecl (const_tree call)
8117 if (call == error_mark_node)
8118 return error_mark_node;
8120 /* It's invalid to call this function with anything but a
8122 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8124 /* The first operand to the CALL is the address of the function
8126 addr = CALL_EXPR_FN (call);
8130 /* If this is a readonly function pointer, extract its initial value. */
8131 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8132 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8133 && DECL_INITIAL (addr))
8134 addr = DECL_INITIAL (addr);
8136 /* If the address is just `&f' for some function `f', then we know
8137 that `f' is being called. */
8138 if (TREE_CODE (addr) == ADDR_EXPR
8139 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8140 return TREE_OPERAND (addr, 0);
8142 /* We couldn't figure out what was being called. */
8146 /* Print debugging information about tree nodes generated during the compile,
8147 and any language-specific information. */
8150 dump_tree_statistics (void)
8152 #ifdef GATHER_STATISTICS
8154 int total_nodes, total_bytes;
8157 fprintf (stderr, "\n??? tree nodes created\n\n");
8158 #ifdef GATHER_STATISTICS
8159 fprintf (stderr, "Kind Nodes Bytes\n");
8160 fprintf (stderr, "---------------------------------------\n");
8161 total_nodes = total_bytes = 0;
8162 for (i = 0; i < (int) all_kinds; i++)
8164 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8165 tree_node_counts[i], tree_node_sizes[i]);
8166 total_nodes += tree_node_counts[i];
8167 total_bytes += tree_node_sizes[i];
8169 fprintf (stderr, "---------------------------------------\n");
8170 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8171 fprintf (stderr, "---------------------------------------\n");
8172 ssanames_print_statistics ();
8173 phinodes_print_statistics ();
8175 fprintf (stderr, "(No per-node statistics)\n");
8177 print_type_hash_statistics ();
8178 print_debug_expr_statistics ();
8179 print_value_expr_statistics ();
8180 lang_hooks.print_statistics ();
8183 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8185 /* Generate a crc32 of a string. */
8188 crc32_string (unsigned chksum, const char *string)
8192 unsigned value = *string << 24;
8195 for (ix = 8; ix--; value <<= 1)
8199 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8208 /* P is a string that will be used in a symbol. Mask out any characters
8209 that are not valid in that context. */
8212 clean_symbol_name (char *p)
8216 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8219 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8226 /* Generate a name for a special-purpose function function.
8227 The generated name may need to be unique across the whole link.
8228 TYPE is some string to identify the purpose of this function to the
8229 linker or collect2; it must start with an uppercase letter,
8231 I - for constructors
8233 N - for C++ anonymous namespaces
8234 F - for DWARF unwind frame information. */
8237 get_file_function_name (const char *type)
8243 /* If we already have a name we know to be unique, just use that. */
8244 if (first_global_object_name)
8245 p = q = ASTRDUP (first_global_object_name);
8246 /* If the target is handling the constructors/destructors, they
8247 will be local to this file and the name is only necessary for
8248 debugging purposes. */
8249 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8251 const char *file = main_input_filename;
8253 file = input_filename;
8254 /* Just use the file's basename, because the full pathname
8255 might be quite long. */
8256 p = strrchr (file, '/');
8261 p = q = ASTRDUP (p);
8265 /* Otherwise, the name must be unique across the entire link.
8266 We don't have anything that we know to be unique to this translation
8267 unit, so use what we do have and throw in some randomness. */
8269 const char *name = weak_global_object_name;
8270 const char *file = main_input_filename;
8275 file = input_filename;
8277 len = strlen (file);
8278 q = (char *) alloca (9 * 2 + len + 1);
8279 memcpy (q, file, len + 1);
8281 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8282 crc32_string (0, get_random_seed (false)));
8287 clean_symbol_name (q);
8288 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8291 /* Set up the name of the file-level functions we may need.
8292 Use a global object (which is already required to be unique over
8293 the program) rather than the file name (which imposes extra
8295 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8297 return get_identifier (buf);
8300 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8302 /* Complain that the tree code of NODE does not match the expected 0
8303 terminated list of trailing codes. The trailing code list can be
8304 empty, for a more vague error message. FILE, LINE, and FUNCTION
8305 are of the caller. */
8308 tree_check_failed (const_tree node, const char *file,
8309 int line, const char *function, ...)
8313 unsigned length = 0;
8316 va_start (args, function);
8317 while ((code = va_arg (args, int)))
8318 length += 4 + strlen (tree_code_name[code]);
8323 va_start (args, function);
8324 length += strlen ("expected ");
8325 buffer = tmp = (char *) alloca (length);
8327 while ((code = va_arg (args, int)))
8329 const char *prefix = length ? " or " : "expected ";
8331 strcpy (tmp + length, prefix);
8332 length += strlen (prefix);
8333 strcpy (tmp + length, tree_code_name[code]);
8334 length += strlen (tree_code_name[code]);
8339 buffer = "unexpected node";
8341 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8342 buffer, tree_code_name[TREE_CODE (node)],
8343 function, trim_filename (file), line);
8346 /* Complain that the tree code of NODE does match the expected 0
8347 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8351 tree_not_check_failed (const_tree node, const char *file,
8352 int line, const char *function, ...)
8356 unsigned length = 0;
8359 va_start (args, function);
8360 while ((code = va_arg (args, int)))
8361 length += 4 + strlen (tree_code_name[code]);
8363 va_start (args, function);
8364 buffer = (char *) alloca (length);
8366 while ((code = va_arg (args, int)))
8370 strcpy (buffer + length, " or ");
8373 strcpy (buffer + length, tree_code_name[code]);
8374 length += strlen (tree_code_name[code]);
8378 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8379 buffer, tree_code_name[TREE_CODE (node)],
8380 function, trim_filename (file), line);
8383 /* Similar to tree_check_failed, except that we check for a class of tree
8384 code, given in CL. */
8387 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8388 const char *file, int line, const char *function)
8391 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8392 TREE_CODE_CLASS_STRING (cl),
8393 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8394 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8397 /* Similar to tree_check_failed, except that instead of specifying a
8398 dozen codes, use the knowledge that they're all sequential. */
8401 tree_range_check_failed (const_tree node, const char *file, int line,
8402 const char *function, enum tree_code c1,
8406 unsigned length = 0;
8409 for (c = c1; c <= c2; ++c)
8410 length += 4 + strlen (tree_code_name[c]);
8412 length += strlen ("expected ");
8413 buffer = (char *) alloca (length);
8416 for (c = c1; c <= c2; ++c)
8418 const char *prefix = length ? " or " : "expected ";
8420 strcpy (buffer + length, prefix);
8421 length += strlen (prefix);
8422 strcpy (buffer + length, tree_code_name[c]);
8423 length += strlen (tree_code_name[c]);
8426 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8427 buffer, tree_code_name[TREE_CODE (node)],
8428 function, trim_filename (file), line);
8432 /* Similar to tree_check_failed, except that we check that a tree does
8433 not have the specified code, given in CL. */
8436 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8437 const char *file, int line, const char *function)
8440 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8441 TREE_CODE_CLASS_STRING (cl),
8442 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8443 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8447 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8450 omp_clause_check_failed (const_tree node, const char *file, int line,
8451 const char *function, enum omp_clause_code code)
8453 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8454 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8455 function, trim_filename (file), line);
8459 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8462 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8463 const char *function, enum omp_clause_code c1,
8464 enum omp_clause_code c2)
8467 unsigned length = 0;
8470 for (c = c1; c <= c2; ++c)
8471 length += 4 + strlen (omp_clause_code_name[c]);
8473 length += strlen ("expected ");
8474 buffer = (char *) alloca (length);
8477 for (c = c1; c <= c2; ++c)
8479 const char *prefix = length ? " or " : "expected ";
8481 strcpy (buffer + length, prefix);
8482 length += strlen (prefix);
8483 strcpy (buffer + length, omp_clause_code_name[c]);
8484 length += strlen (omp_clause_code_name[c]);
8487 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8488 buffer, omp_clause_code_name[TREE_CODE (node)],
8489 function, trim_filename (file), line);
8493 #undef DEFTREESTRUCT
8494 #define DEFTREESTRUCT(VAL, NAME) NAME,
8496 static const char *ts_enum_names[] = {
8497 #include "treestruct.def"
8499 #undef DEFTREESTRUCT
8501 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8503 /* Similar to tree_class_check_failed, except that we check for
8504 whether CODE contains the tree structure identified by EN. */
8507 tree_contains_struct_check_failed (const_tree node,
8508 const enum tree_node_structure_enum en,
8509 const char *file, int line,
8510 const char *function)
8513 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8515 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8519 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8520 (dynamically sized) vector. */
8523 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8524 const char *function)
8527 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8528 idx + 1, len, function, trim_filename (file), line);
8531 /* Similar to above, except that the check is for the bounds of the operand
8532 vector of an expression node EXP. */
8535 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8536 int line, const char *function)
8538 int code = TREE_CODE (exp);
8540 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8541 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8542 function, trim_filename (file), line);
8545 /* Similar to above, except that the check is for the number of
8546 operands of an OMP_CLAUSE node. */
8549 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8550 int line, const char *function)
8553 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8554 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8555 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8556 trim_filename (file), line);
8558 #endif /* ENABLE_TREE_CHECKING */
8560 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8561 and mapped to the machine mode MODE. Initialize its fields and build
8562 the information necessary for debugging output. */
8565 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8568 hashval_t hashcode = 0;
8570 t = make_node (VECTOR_TYPE);
8571 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8572 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8573 SET_TYPE_MODE (t, mode);
8575 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8576 SET_TYPE_STRUCTURAL_EQUALITY (t);
8577 else if (TYPE_CANONICAL (innertype) != innertype
8578 || mode != VOIDmode)
8580 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8585 tree index = build_int_cst (NULL_TREE, nunits - 1);
8586 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8587 build_index_type (index));
8588 tree rt = make_node (RECORD_TYPE);
8590 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8591 get_identifier ("f"), array);
8592 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8594 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8595 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8596 the representation type, and we want to find that die when looking up
8597 the vector type. This is most easily achieved by making the TYPE_UID
8599 TYPE_UID (rt) = TYPE_UID (t);
8602 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8603 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8604 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8605 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8606 t = type_hash_canon (hashcode, t);
8608 /* We have built a main variant, based on the main variant of the
8609 inner type. Use it to build the variant we return. */
8610 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8611 && TREE_TYPE (t) != innertype)
8612 return build_type_attribute_qual_variant (t,
8613 TYPE_ATTRIBUTES (innertype),
8614 TYPE_QUALS (innertype));
8620 make_or_reuse_type (unsigned size, int unsignedp)
8622 if (size == INT_TYPE_SIZE)
8623 return unsignedp ? unsigned_type_node : integer_type_node;
8624 if (size == CHAR_TYPE_SIZE)
8625 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8626 if (size == SHORT_TYPE_SIZE)
8627 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8628 if (size == LONG_TYPE_SIZE)
8629 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8630 if (size == LONG_LONG_TYPE_SIZE)
8631 return (unsignedp ? long_long_unsigned_type_node
8632 : long_long_integer_type_node);
8635 return make_unsigned_type (size);
8637 return make_signed_type (size);
8640 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8643 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8647 if (size == SHORT_FRACT_TYPE_SIZE)
8648 return unsignedp ? sat_unsigned_short_fract_type_node
8649 : sat_short_fract_type_node;
8650 if (size == FRACT_TYPE_SIZE)
8651 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8652 if (size == LONG_FRACT_TYPE_SIZE)
8653 return unsignedp ? sat_unsigned_long_fract_type_node
8654 : sat_long_fract_type_node;
8655 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8656 return unsignedp ? sat_unsigned_long_long_fract_type_node
8657 : sat_long_long_fract_type_node;
8661 if (size == SHORT_FRACT_TYPE_SIZE)
8662 return unsignedp ? unsigned_short_fract_type_node
8663 : short_fract_type_node;
8664 if (size == FRACT_TYPE_SIZE)
8665 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8666 if (size == LONG_FRACT_TYPE_SIZE)
8667 return unsignedp ? unsigned_long_fract_type_node
8668 : long_fract_type_node;
8669 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8670 return unsignedp ? unsigned_long_long_fract_type_node
8671 : long_long_fract_type_node;
8674 return make_fract_type (size, unsignedp, satp);
8677 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8680 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8684 if (size == SHORT_ACCUM_TYPE_SIZE)
8685 return unsignedp ? sat_unsigned_short_accum_type_node
8686 : sat_short_accum_type_node;
8687 if (size == ACCUM_TYPE_SIZE)
8688 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8689 if (size == LONG_ACCUM_TYPE_SIZE)
8690 return unsignedp ? sat_unsigned_long_accum_type_node
8691 : sat_long_accum_type_node;
8692 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8693 return unsignedp ? sat_unsigned_long_long_accum_type_node
8694 : sat_long_long_accum_type_node;
8698 if (size == SHORT_ACCUM_TYPE_SIZE)
8699 return unsignedp ? unsigned_short_accum_type_node
8700 : short_accum_type_node;
8701 if (size == ACCUM_TYPE_SIZE)
8702 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8703 if (size == LONG_ACCUM_TYPE_SIZE)
8704 return unsignedp ? unsigned_long_accum_type_node
8705 : long_accum_type_node;
8706 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8707 return unsignedp ? unsigned_long_long_accum_type_node
8708 : long_long_accum_type_node;
8711 return make_accum_type (size, unsignedp, satp);
8714 /* Create nodes for all integer types (and error_mark_node) using the sizes
8715 of C datatypes. The caller should call set_sizetype soon after calling
8716 this function to select one of the types as sizetype. */
8719 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
8721 error_mark_node = make_node (ERROR_MARK);
8722 TREE_TYPE (error_mark_node) = error_mark_node;
8724 initialize_sizetypes (signed_sizetype);
8726 /* Define both `signed char' and `unsigned char'. */
8727 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8728 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8729 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8730 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8732 /* Define `char', which is like either `signed char' or `unsigned char'
8733 but not the same as either. */
8736 ? make_signed_type (CHAR_TYPE_SIZE)
8737 : make_unsigned_type (CHAR_TYPE_SIZE));
8738 TYPE_STRING_FLAG (char_type_node) = 1;
8740 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8741 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8742 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8743 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8744 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8745 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8746 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8747 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8749 /* Define a boolean type. This type only represents boolean values but
8750 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8751 Front ends which want to override this size (i.e. Java) can redefine
8752 boolean_type_node before calling build_common_tree_nodes_2. */
8753 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8754 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8755 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8756 TYPE_PRECISION (boolean_type_node) = 1;
8758 /* Fill in the rest of the sized types. Reuse existing type nodes
8760 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8761 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8762 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8763 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8764 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8766 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8767 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8768 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8769 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8770 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8772 access_public_node = get_identifier ("public");
8773 access_protected_node = get_identifier ("protected");
8774 access_private_node = get_identifier ("private");
8777 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8778 It will create several other common tree nodes. */
8781 build_common_tree_nodes_2 (int short_double)
8783 /* Define these next since types below may used them. */
8784 integer_zero_node = build_int_cst (NULL_TREE, 0);
8785 integer_one_node = build_int_cst (NULL_TREE, 1);
8786 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8788 size_zero_node = size_int (0);
8789 size_one_node = size_int (1);
8790 bitsize_zero_node = bitsize_int (0);
8791 bitsize_one_node = bitsize_int (1);
8792 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8794 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8795 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8797 void_type_node = make_node (VOID_TYPE);
8798 layout_type (void_type_node);
8800 /* We are not going to have real types in C with less than byte alignment,
8801 so we might as well not have any types that claim to have it. */
8802 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8803 TYPE_USER_ALIGN (void_type_node) = 0;
8805 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8806 layout_type (TREE_TYPE (null_pointer_node));
8808 ptr_type_node = build_pointer_type (void_type_node);
8810 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8811 fileptr_type_node = ptr_type_node;
8813 float_type_node = make_node (REAL_TYPE);
8814 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8815 layout_type (float_type_node);
8817 double_type_node = make_node (REAL_TYPE);
8819 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8821 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8822 layout_type (double_type_node);
8824 long_double_type_node = make_node (REAL_TYPE);
8825 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8826 layout_type (long_double_type_node);
8828 float_ptr_type_node = build_pointer_type (float_type_node);
8829 double_ptr_type_node = build_pointer_type (double_type_node);
8830 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8831 integer_ptr_type_node = build_pointer_type (integer_type_node);
8833 /* Fixed size integer types. */
8834 uint32_type_node = build_nonstandard_integer_type (32, true);
8835 uint64_type_node = build_nonstandard_integer_type (64, true);
8837 /* Decimal float types. */
8838 dfloat32_type_node = make_node (REAL_TYPE);
8839 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8840 layout_type (dfloat32_type_node);
8841 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8842 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8844 dfloat64_type_node = make_node (REAL_TYPE);
8845 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8846 layout_type (dfloat64_type_node);
8847 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8848 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8850 dfloat128_type_node = make_node (REAL_TYPE);
8851 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8852 layout_type (dfloat128_type_node);
8853 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8854 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8856 complex_integer_type_node = build_complex_type (integer_type_node);
8857 complex_float_type_node = build_complex_type (float_type_node);
8858 complex_double_type_node = build_complex_type (double_type_node);
8859 complex_long_double_type_node = build_complex_type (long_double_type_node);
8861 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8862 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8863 sat_ ## KIND ## _type_node = \
8864 make_sat_signed_ ## KIND ## _type (SIZE); \
8865 sat_unsigned_ ## KIND ## _type_node = \
8866 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8867 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8868 unsigned_ ## KIND ## _type_node = \
8869 make_unsigned_ ## KIND ## _type (SIZE);
8871 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8872 sat_ ## WIDTH ## KIND ## _type_node = \
8873 make_sat_signed_ ## KIND ## _type (SIZE); \
8874 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8875 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8876 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8877 unsigned_ ## WIDTH ## KIND ## _type_node = \
8878 make_unsigned_ ## KIND ## _type (SIZE);
8880 /* Make fixed-point type nodes based on four different widths. */
8881 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8882 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8883 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8884 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8885 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8887 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8888 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8889 NAME ## _type_node = \
8890 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8891 u ## NAME ## _type_node = \
8892 make_or_reuse_unsigned_ ## KIND ## _type \
8893 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8894 sat_ ## NAME ## _type_node = \
8895 make_or_reuse_sat_signed_ ## KIND ## _type \
8896 (GET_MODE_BITSIZE (MODE ## mode)); \
8897 sat_u ## NAME ## _type_node = \
8898 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8899 (GET_MODE_BITSIZE (U ## MODE ## mode));
8901 /* Fixed-point type and mode nodes. */
8902 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8903 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8904 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8905 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8906 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8907 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8908 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8909 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8910 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8911 MAKE_FIXED_MODE_NODE (accum, da, DA)
8912 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8915 tree t = targetm.build_builtin_va_list ();
8917 /* Many back-ends define record types without setting TYPE_NAME.
8918 If we copied the record type here, we'd keep the original
8919 record type without a name. This breaks name mangling. So,
8920 don't copy record types and let c_common_nodes_and_builtins()
8921 declare the type to be __builtin_va_list. */
8922 if (TREE_CODE (t) != RECORD_TYPE)
8923 t = build_variant_type_copy (t);
8925 va_list_type_node = t;
8929 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8932 local_define_builtin (const char *name, tree type, enum built_in_function code,
8933 const char *library_name, int ecf_flags)
8937 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8938 library_name, NULL_TREE);
8939 if (ecf_flags & ECF_CONST)
8940 TREE_READONLY (decl) = 1;
8941 if (ecf_flags & ECF_PURE)
8942 DECL_PURE_P (decl) = 1;
8943 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8944 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8945 if (ecf_flags & ECF_NORETURN)
8946 TREE_THIS_VOLATILE (decl) = 1;
8947 if (ecf_flags & ECF_NOTHROW)
8948 TREE_NOTHROW (decl) = 1;
8949 if (ecf_flags & ECF_MALLOC)
8950 DECL_IS_MALLOC (decl) = 1;
8952 built_in_decls[code] = decl;
8953 implicit_built_in_decls[code] = decl;
8956 /* Call this function after instantiating all builtins that the language
8957 front end cares about. This will build the rest of the builtins that
8958 are relied upon by the tree optimizers and the middle-end. */
8961 build_common_builtin_nodes (void)
8963 tree tmp, tmp2, ftype;
8965 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
8966 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8968 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8969 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8970 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8971 ftype = build_function_type (ptr_type_node, tmp);
8973 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
8974 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
8975 "memcpy", ECF_NOTHROW);
8976 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8977 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
8978 "memmove", ECF_NOTHROW);
8981 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
8983 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8984 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8985 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8986 ftype = build_function_type (integer_type_node, tmp);
8987 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
8988 "memcmp", ECF_PURE | ECF_NOTHROW);
8991 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
8993 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8994 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
8995 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8996 ftype = build_function_type (ptr_type_node, tmp);
8997 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
8998 "memset", ECF_NOTHROW);
9001 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9003 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9004 ftype = build_function_type (ptr_type_node, tmp);
9005 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9007 ECF_MALLOC | (flag_stack_check ? 0 : ECF_NOTHROW));
9010 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9011 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9012 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9013 ftype = build_function_type (void_type_node, tmp);
9014 local_define_builtin ("__builtin_init_trampoline", ftype,
9015 BUILT_IN_INIT_TRAMPOLINE,
9016 "__builtin_init_trampoline", ECF_NOTHROW);
9018 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9019 ftype = build_function_type (ptr_type_node, tmp);
9020 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9021 BUILT_IN_ADJUST_TRAMPOLINE,
9022 "__builtin_adjust_trampoline",
9023 ECF_CONST | ECF_NOTHROW);
9025 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9026 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9027 ftype = build_function_type (void_type_node, tmp);
9028 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9029 BUILT_IN_NONLOCAL_GOTO,
9030 "__builtin_nonlocal_goto",
9031 ECF_NORETURN | ECF_NOTHROW);
9033 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9034 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9035 ftype = build_function_type (void_type_node, tmp);
9036 local_define_builtin ("__builtin_setjmp_setup", ftype,
9037 BUILT_IN_SETJMP_SETUP,
9038 "__builtin_setjmp_setup", ECF_NOTHROW);
9040 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9041 ftype = build_function_type (ptr_type_node, tmp);
9042 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9043 BUILT_IN_SETJMP_DISPATCHER,
9044 "__builtin_setjmp_dispatcher",
9045 ECF_PURE | ECF_NOTHROW);
9047 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9048 ftype = build_function_type (void_type_node, tmp);
9049 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9050 BUILT_IN_SETJMP_RECEIVER,
9051 "__builtin_setjmp_receiver", ECF_NOTHROW);
9053 ftype = build_function_type (ptr_type_node, void_list_node);
9054 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9055 "__builtin_stack_save", ECF_NOTHROW);
9057 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9058 ftype = build_function_type (void_type_node, tmp);
9059 local_define_builtin ("__builtin_stack_restore", ftype,
9060 BUILT_IN_STACK_RESTORE,
9061 "__builtin_stack_restore", ECF_NOTHROW);
9063 ftype = build_function_type (void_type_node, void_list_node);
9064 local_define_builtin ("__builtin_profile_func_enter", ftype,
9065 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9066 local_define_builtin ("__builtin_profile_func_exit", ftype,
9067 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9069 /* If there's a possibility that we might use the ARM EABI, build the
9070 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9071 if (targetm.arm_eabi_unwinder)
9073 ftype = build_function_type (void_type_node, void_list_node);
9074 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9075 BUILT_IN_CXA_END_CLEANUP,
9076 "__cxa_end_cleanup", ECF_NORETURN);
9079 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9080 ftype = build_function_type (void_type_node, tmp);
9081 local_define_builtin ("__builtin_unwind_resume", ftype,
9082 BUILT_IN_UNWIND_RESUME,
9083 (USING_SJLJ_EXCEPTIONS
9084 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9087 /* The exception object and filter values from the runtime. The argument
9088 must be zero before exception lowering, i.e. from the front end. After
9089 exception lowering, it will be the region number for the exception
9090 landing pad. These functions are PURE instead of CONST to prevent
9091 them from being hoisted past the exception edge that will initialize
9092 its value in the landing pad. */
9093 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9094 ftype = build_function_type (ptr_type_node, tmp);
9095 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9096 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9098 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9099 ftype = build_function_type (tmp2, tmp);
9100 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9101 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9103 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9104 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9105 ftype = build_function_type (void_type_node, tmp);
9106 local_define_builtin ("__builtin_eh_copy_values", ftype,
9107 BUILT_IN_EH_COPY_VALUES,
9108 "__builtin_eh_copy_values", ECF_NOTHROW);
9110 /* Complex multiplication and division. These are handled as builtins
9111 rather than optabs because emit_library_call_value doesn't support
9112 complex. Further, we can do slightly better with folding these
9113 beasties if the real and complex parts of the arguments are separate. */
9117 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9119 char mode_name_buf[4], *q;
9121 enum built_in_function mcode, dcode;
9122 tree type, inner_type;
9124 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9127 inner_type = TREE_TYPE (type);
9129 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9130 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9131 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9132 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9133 ftype = build_function_type (type, tmp);
9135 mcode = ((enum built_in_function)
9136 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9137 dcode = ((enum built_in_function)
9138 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9140 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9144 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9145 local_define_builtin (built_in_names[mcode], ftype, mcode,
9146 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9148 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9149 local_define_builtin (built_in_names[dcode], ftype, dcode,
9150 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9155 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9158 If we requested a pointer to a vector, build up the pointers that
9159 we stripped off while looking for the inner type. Similarly for
9160 return values from functions.
9162 The argument TYPE is the top of the chain, and BOTTOM is the
9163 new type which we will point to. */
9166 reconstruct_complex_type (tree type, tree bottom)
9170 if (TREE_CODE (type) == POINTER_TYPE)
9172 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9173 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9174 TYPE_REF_CAN_ALIAS_ALL (type));
9176 else if (TREE_CODE (type) == REFERENCE_TYPE)
9178 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9179 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9180 TYPE_REF_CAN_ALIAS_ALL (type));
9182 else if (TREE_CODE (type) == ARRAY_TYPE)
9184 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9185 outer = build_array_type (inner, TYPE_DOMAIN (type));
9187 else if (TREE_CODE (type) == FUNCTION_TYPE)
9189 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9190 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9192 else if (TREE_CODE (type) == METHOD_TYPE)
9194 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9195 /* The build_method_type_directly() routine prepends 'this' to argument list,
9196 so we must compensate by getting rid of it. */
9198 = build_method_type_directly
9199 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9201 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9203 else if (TREE_CODE (type) == OFFSET_TYPE)
9205 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9206 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9211 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9215 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9218 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9222 switch (GET_MODE_CLASS (mode))
9224 case MODE_VECTOR_INT:
9225 case MODE_VECTOR_FLOAT:
9226 case MODE_VECTOR_FRACT:
9227 case MODE_VECTOR_UFRACT:
9228 case MODE_VECTOR_ACCUM:
9229 case MODE_VECTOR_UACCUM:
9230 nunits = GET_MODE_NUNITS (mode);
9234 /* Check that there are no leftover bits. */
9235 gcc_assert (GET_MODE_BITSIZE (mode)
9236 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9238 nunits = GET_MODE_BITSIZE (mode)
9239 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9246 return make_vector_type (innertype, nunits, mode);
9249 /* Similarly, but takes the inner type and number of units, which must be
9253 build_vector_type (tree innertype, int nunits)
9255 return make_vector_type (innertype, nunits, VOIDmode);
9258 /* Similarly, but takes the inner type and number of units, which must be
9262 build_opaque_vector_type (tree innertype, int nunits)
9265 innertype = build_distinct_type_copy (innertype);
9266 t = make_vector_type (innertype, nunits, VOIDmode);
9267 TYPE_VECTOR_OPAQUE (t) = true;
9272 /* Given an initializer INIT, return TRUE if INIT is zero or some
9273 aggregate of zeros. Otherwise return FALSE. */
9275 initializer_zerop (const_tree init)
9281 switch (TREE_CODE (init))
9284 return integer_zerop (init);
9287 /* ??? Note that this is not correct for C4X float formats. There,
9288 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9289 negative exponent. */
9290 return real_zerop (init)
9291 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9294 return fixed_zerop (init);
9297 return integer_zerop (init)
9298 || (real_zerop (init)
9299 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9300 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9303 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9304 if (!initializer_zerop (TREE_VALUE (elt)))
9310 unsigned HOST_WIDE_INT idx;
9312 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9313 if (!initializer_zerop (elt))
9323 /* Build an empty statement at location LOC. */
9326 build_empty_stmt (location_t loc)
9328 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9329 SET_EXPR_LOCATION (t, loc);
9334 /* Build an OpenMP clause with code CODE. LOC is the location of the
9338 build_omp_clause (location_t loc, enum omp_clause_code code)
9343 length = omp_clause_num_ops[code];
9344 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9346 t = GGC_NEWVAR (union tree_node, size);
9347 memset (t, 0, size);
9348 TREE_SET_CODE (t, OMP_CLAUSE);
9349 OMP_CLAUSE_SET_CODE (t, code);
9350 OMP_CLAUSE_LOCATION (t) = loc;
9352 #ifdef GATHER_STATISTICS
9353 tree_node_counts[(int) omp_clause_kind]++;
9354 tree_node_sizes[(int) omp_clause_kind] += size;
9360 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9361 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9362 Except for the CODE and operand count field, other storage for the
9363 object is initialized to zeros. */
9366 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9369 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9371 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9372 gcc_assert (len >= 1);
9374 #ifdef GATHER_STATISTICS
9375 tree_node_counts[(int) e_kind]++;
9376 tree_node_sizes[(int) e_kind] += length;
9379 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9381 memset (t, 0, length);
9383 TREE_SET_CODE (t, code);
9385 /* Can't use TREE_OPERAND to store the length because if checking is
9386 enabled, it will try to check the length before we store it. :-P */
9387 t->exp.operands[0] = build_int_cst (sizetype, len);
9393 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9394 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9398 build_call_list (tree return_type, tree fn, tree arglist)
9403 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9404 TREE_TYPE (t) = return_type;
9405 CALL_EXPR_FN (t) = fn;
9406 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9407 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9408 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9409 process_call_operands (t);
9413 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9414 FN and a null static chain slot. NARGS is the number of call arguments
9415 which are specified as "..." arguments. */
9418 build_call_nary (tree return_type, tree fn, int nargs, ...)
9422 va_start (args, nargs);
9423 ret = build_call_valist (return_type, fn, nargs, args);
9428 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9429 FN and a null static chain slot. NARGS is the number of call arguments
9430 which are specified as a va_list ARGS. */
9433 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9438 t = build_vl_exp (CALL_EXPR, nargs + 3);
9439 TREE_TYPE (t) = return_type;
9440 CALL_EXPR_FN (t) = fn;
9441 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9442 for (i = 0; i < nargs; i++)
9443 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9444 process_call_operands (t);
9448 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9449 FN and a null static chain slot. NARGS is the number of call arguments
9450 which are specified as a tree array ARGS. */
9453 build_call_array_loc (location_t loc, tree return_type, tree fn,
9454 int nargs, const tree *args)
9459 t = build_vl_exp (CALL_EXPR, nargs + 3);
9460 TREE_TYPE (t) = return_type;
9461 CALL_EXPR_FN (t) = fn;
9462 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9463 for (i = 0; i < nargs; i++)
9464 CALL_EXPR_ARG (t, i) = args[i];
9465 process_call_operands (t);
9466 SET_EXPR_LOCATION (t, loc);
9470 /* Like build_call_array, but takes a VEC. */
9473 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9478 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9479 TREE_TYPE (ret) = return_type;
9480 CALL_EXPR_FN (ret) = fn;
9481 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9482 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9483 CALL_EXPR_ARG (ret, ix) = t;
9484 process_call_operands (ret);
9489 /* Returns true if it is possible to prove that the index of
9490 an array access REF (an ARRAY_REF expression) falls into the
9494 in_array_bounds_p (tree ref)
9496 tree idx = TREE_OPERAND (ref, 1);
9499 if (TREE_CODE (idx) != INTEGER_CST)
9502 min = array_ref_low_bound (ref);
9503 max = array_ref_up_bound (ref);
9506 || TREE_CODE (min) != INTEGER_CST
9507 || TREE_CODE (max) != INTEGER_CST)
9510 if (tree_int_cst_lt (idx, min)
9511 || tree_int_cst_lt (max, idx))
9517 /* Returns true if it is possible to prove that the range of
9518 an array access REF (an ARRAY_RANGE_REF expression) falls
9519 into the array bounds. */
9522 range_in_array_bounds_p (tree ref)
9524 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9525 tree range_min, range_max, min, max;
9527 range_min = TYPE_MIN_VALUE (domain_type);
9528 range_max = TYPE_MAX_VALUE (domain_type);
9531 || TREE_CODE (range_min) != INTEGER_CST
9532 || TREE_CODE (range_max) != INTEGER_CST)
9535 min = array_ref_low_bound (ref);
9536 max = array_ref_up_bound (ref);
9539 || TREE_CODE (min) != INTEGER_CST
9540 || TREE_CODE (max) != INTEGER_CST)
9543 if (tree_int_cst_lt (range_min, min)
9544 || tree_int_cst_lt (max, range_max))
9550 /* Return true if T (assumed to be a DECL) must be assigned a memory
9554 needs_to_live_in_memory (const_tree t)
9556 if (TREE_CODE (t) == SSA_NAME)
9557 t = SSA_NAME_VAR (t);
9559 return (TREE_ADDRESSABLE (t)
9560 || is_global_var (t)
9561 || (TREE_CODE (t) == RESULT_DECL
9562 && aggregate_value_p (t, current_function_decl)));
9565 /* There are situations in which a language considers record types
9566 compatible which have different field lists. Decide if two fields
9567 are compatible. It is assumed that the parent records are compatible. */
9570 fields_compatible_p (const_tree f1, const_tree f2)
9572 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9573 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9576 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9577 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9580 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9586 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9589 find_compatible_field (tree record, tree orig_field)
9593 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9594 if (TREE_CODE (f) == FIELD_DECL
9595 && fields_compatible_p (f, orig_field))
9598 /* ??? Why isn't this on the main fields list? */
9599 f = TYPE_VFIELD (record);
9600 if (f && TREE_CODE (f) == FIELD_DECL
9601 && fields_compatible_p (f, orig_field))
9604 /* ??? We should abort here, but Java appears to do Bad Things
9605 with inherited fields. */
9609 /* Return value of a constant X and sign-extend it. */
9612 int_cst_value (const_tree x)
9614 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9615 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9617 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9618 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9619 || TREE_INT_CST_HIGH (x) == -1);
9621 if (bits < HOST_BITS_PER_WIDE_INT)
9623 bool negative = ((val >> (bits - 1)) & 1) != 0;
9625 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9627 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9633 /* Return value of a constant X and sign-extend it. */
9636 widest_int_cst_value (const_tree x)
9638 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9639 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9641 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9642 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9643 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9644 << HOST_BITS_PER_WIDE_INT);
9646 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9647 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9648 || TREE_INT_CST_HIGH (x) == -1);
9651 if (bits < HOST_BITS_PER_WIDEST_INT)
9653 bool negative = ((val >> (bits - 1)) & 1) != 0;
9655 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9657 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9663 /* If TYPE is an integral type, return an equivalent type which is
9664 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9665 return TYPE itself. */
9668 signed_or_unsigned_type_for (int unsignedp, tree type)
9671 if (POINTER_TYPE_P (type))
9673 /* If the pointer points to the normal address space, use the
9674 size_type_node. Otherwise use an appropriate size for the pointer
9675 based on the named address space it points to. */
9676 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9679 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9682 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9685 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9688 /* Returns unsigned variant of TYPE. */
9691 unsigned_type_for (tree type)
9693 return signed_or_unsigned_type_for (1, type);
9696 /* Returns signed variant of TYPE. */
9699 signed_type_for (tree type)
9701 return signed_or_unsigned_type_for (0, type);
9704 /* Returns the largest value obtainable by casting something in INNER type to
9708 upper_bound_in_type (tree outer, tree inner)
9710 unsigned HOST_WIDE_INT lo, hi;
9711 unsigned int det = 0;
9712 unsigned oprec = TYPE_PRECISION (outer);
9713 unsigned iprec = TYPE_PRECISION (inner);
9716 /* Compute a unique number for every combination. */
9717 det |= (oprec > iprec) ? 4 : 0;
9718 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9719 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9721 /* Determine the exponent to use. */
9726 /* oprec <= iprec, outer: signed, inner: don't care. */
9731 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9735 /* oprec > iprec, outer: signed, inner: signed. */
9739 /* oprec > iprec, outer: signed, inner: unsigned. */
9743 /* oprec > iprec, outer: unsigned, inner: signed. */
9747 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9754 /* Compute 2^^prec - 1. */
9755 if (prec <= HOST_BITS_PER_WIDE_INT)
9758 lo = ((~(unsigned HOST_WIDE_INT) 0)
9759 >> (HOST_BITS_PER_WIDE_INT - prec));
9763 hi = ((~(unsigned HOST_WIDE_INT) 0)
9764 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9765 lo = ~(unsigned HOST_WIDE_INT) 0;
9768 return build_int_cst_wide (outer, lo, hi);
9771 /* Returns the smallest value obtainable by casting something in INNER type to
9775 lower_bound_in_type (tree outer, tree inner)
9777 unsigned HOST_WIDE_INT lo, hi;
9778 unsigned oprec = TYPE_PRECISION (outer);
9779 unsigned iprec = TYPE_PRECISION (inner);
9781 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9783 if (TYPE_UNSIGNED (outer)
9784 /* If we are widening something of an unsigned type, OUTER type
9785 contains all values of INNER type. In particular, both INNER
9786 and OUTER types have zero in common. */
9787 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9791 /* If we are widening a signed type to another signed type, we
9792 want to obtain -2^^(iprec-1). If we are keeping the
9793 precision or narrowing to a signed type, we want to obtain
9795 unsigned prec = oprec > iprec ? iprec : oprec;
9797 if (prec <= HOST_BITS_PER_WIDE_INT)
9799 hi = ~(unsigned HOST_WIDE_INT) 0;
9800 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9804 hi = ((~(unsigned HOST_WIDE_INT) 0)
9805 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9810 return build_int_cst_wide (outer, lo, hi);
9813 /* Return nonzero if two operands that are suitable for PHI nodes are
9814 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9815 SSA_NAME or invariant. Note that this is strictly an optimization.
9816 That is, callers of this function can directly call operand_equal_p
9817 and get the same result, only slower. */
9820 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9824 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9826 return operand_equal_p (arg0, arg1, 0);
9829 /* Returns number of zeros at the end of binary representation of X.
9831 ??? Use ffs if available? */
9834 num_ending_zeros (const_tree x)
9836 unsigned HOST_WIDE_INT fr, nfr;
9837 unsigned num, abits;
9838 tree type = TREE_TYPE (x);
9840 if (TREE_INT_CST_LOW (x) == 0)
9842 num = HOST_BITS_PER_WIDE_INT;
9843 fr = TREE_INT_CST_HIGH (x);
9848 fr = TREE_INT_CST_LOW (x);
9851 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9854 if (nfr << abits == fr)
9861 if (num > TYPE_PRECISION (type))
9862 num = TYPE_PRECISION (type);
9864 return build_int_cst_type (type, num);
9868 #define WALK_SUBTREE(NODE) \
9871 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9877 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9878 be walked whenever a type is seen in the tree. Rest of operands and return
9879 value are as for walk_tree. */
9882 walk_type_fields (tree type, walk_tree_fn func, void *data,
9883 struct pointer_set_t *pset, walk_tree_lh lh)
9885 tree result = NULL_TREE;
9887 switch (TREE_CODE (type))
9890 case REFERENCE_TYPE:
9891 /* We have to worry about mutually recursive pointers. These can't
9892 be written in C. They can in Ada. It's pathological, but
9893 there's an ACATS test (c38102a) that checks it. Deal with this
9894 by checking if we're pointing to another pointer, that one
9895 points to another pointer, that one does too, and we have no htab.
9896 If so, get a hash table. We check three levels deep to avoid
9897 the cost of the hash table if we don't need one. */
9898 if (POINTER_TYPE_P (TREE_TYPE (type))
9899 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9900 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9903 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9911 /* ... fall through ... */
9914 WALK_SUBTREE (TREE_TYPE (type));
9918 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9923 WALK_SUBTREE (TREE_TYPE (type));
9927 /* We never want to walk into default arguments. */
9928 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9929 WALK_SUBTREE (TREE_VALUE (arg));
9934 /* Don't follow this nodes's type if a pointer for fear that
9935 we'll have infinite recursion. If we have a PSET, then we
9938 || (!POINTER_TYPE_P (TREE_TYPE (type))
9939 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9940 WALK_SUBTREE (TREE_TYPE (type));
9941 WALK_SUBTREE (TYPE_DOMAIN (type));
9945 WALK_SUBTREE (TREE_TYPE (type));
9946 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9956 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9957 called with the DATA and the address of each sub-tree. If FUNC returns a
9958 non-NULL value, the traversal is stopped, and the value returned by FUNC
9959 is returned. If PSET is non-NULL it is used to record the nodes visited,
9960 and to avoid visiting a node more than once. */
9963 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
9964 struct pointer_set_t *pset, walk_tree_lh lh)
9966 enum tree_code code;
9970 #define WALK_SUBTREE_TAIL(NODE) \
9974 goto tail_recurse; \
9979 /* Skip empty subtrees. */
9983 /* Don't walk the same tree twice, if the user has requested
9984 that we avoid doing so. */
9985 if (pset && pointer_set_insert (pset, *tp))
9988 /* Call the function. */
9990 result = (*func) (tp, &walk_subtrees, data);
9992 /* If we found something, return it. */
9996 code = TREE_CODE (*tp);
9998 /* Even if we didn't, FUNC may have decided that there was nothing
9999 interesting below this point in the tree. */
10000 if (!walk_subtrees)
10002 /* But we still need to check our siblings. */
10003 if (code == TREE_LIST)
10004 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10005 else if (code == OMP_CLAUSE)
10006 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10013 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10014 if (result || !walk_subtrees)
10021 case IDENTIFIER_NODE:
10028 case PLACEHOLDER_EXPR:
10032 /* None of these have subtrees other than those already walked
10037 WALK_SUBTREE (TREE_VALUE (*tp));
10038 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10043 int len = TREE_VEC_LENGTH (*tp);
10048 /* Walk all elements but the first. */
10050 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10052 /* Now walk the first one as a tail call. */
10053 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10057 WALK_SUBTREE (TREE_REALPART (*tp));
10058 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10062 unsigned HOST_WIDE_INT idx;
10063 constructor_elt *ce;
10066 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10068 WALK_SUBTREE (ce->value);
10073 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10078 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10080 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10081 into declarations that are just mentioned, rather than
10082 declared; they don't really belong to this part of the tree.
10083 And, we can see cycles: the initializer for a declaration
10084 can refer to the declaration itself. */
10085 WALK_SUBTREE (DECL_INITIAL (decl));
10086 WALK_SUBTREE (DECL_SIZE (decl));
10087 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10089 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10092 case STATEMENT_LIST:
10094 tree_stmt_iterator i;
10095 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10096 WALK_SUBTREE (*tsi_stmt_ptr (i));
10101 switch (OMP_CLAUSE_CODE (*tp))
10103 case OMP_CLAUSE_PRIVATE:
10104 case OMP_CLAUSE_SHARED:
10105 case OMP_CLAUSE_FIRSTPRIVATE:
10106 case OMP_CLAUSE_COPYIN:
10107 case OMP_CLAUSE_COPYPRIVATE:
10108 case OMP_CLAUSE_IF:
10109 case OMP_CLAUSE_NUM_THREADS:
10110 case OMP_CLAUSE_SCHEDULE:
10111 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10114 case OMP_CLAUSE_NOWAIT:
10115 case OMP_CLAUSE_ORDERED:
10116 case OMP_CLAUSE_DEFAULT:
10117 case OMP_CLAUSE_UNTIED:
10118 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10120 case OMP_CLAUSE_LASTPRIVATE:
10121 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10122 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10123 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10125 case OMP_CLAUSE_COLLAPSE:
10128 for (i = 0; i < 3; i++)
10129 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10130 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10133 case OMP_CLAUSE_REDUCTION:
10136 for (i = 0; i < 4; i++)
10137 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10138 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10142 gcc_unreachable ();
10150 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10151 But, we only want to walk once. */
10152 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10153 for (i = 0; i < len; ++i)
10154 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10155 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10159 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10160 defining. We only want to walk into these fields of a type in this
10161 case and not in the general case of a mere reference to the type.
10163 The criterion is as follows: if the field can be an expression, it
10164 must be walked only here. This should be in keeping with the fields
10165 that are directly gimplified in gimplify_type_sizes in order for the
10166 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10167 variable-sized types.
10169 Note that DECLs get walked as part of processing the BIND_EXPR. */
10170 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10172 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10173 if (TREE_CODE (*type_p) == ERROR_MARK)
10176 /* Call the function for the type. See if it returns anything or
10177 doesn't want us to continue. If we are to continue, walk both
10178 the normal fields and those for the declaration case. */
10179 result = (*func) (type_p, &walk_subtrees, data);
10180 if (result || !walk_subtrees)
10183 result = walk_type_fields (*type_p, func, data, pset, lh);
10187 /* If this is a record type, also walk the fields. */
10188 if (RECORD_OR_UNION_TYPE_P (*type_p))
10192 for (field = TYPE_FIELDS (*type_p); field;
10193 field = TREE_CHAIN (field))
10195 /* We'd like to look at the type of the field, but we can
10196 easily get infinite recursion. So assume it's pointed
10197 to elsewhere in the tree. Also, ignore things that
10199 if (TREE_CODE (field) != FIELD_DECL)
10202 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10203 WALK_SUBTREE (DECL_SIZE (field));
10204 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10205 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10206 WALK_SUBTREE (DECL_QUALIFIER (field));
10210 /* Same for scalar types. */
10211 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10212 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10213 || TREE_CODE (*type_p) == INTEGER_TYPE
10214 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10215 || TREE_CODE (*type_p) == REAL_TYPE)
10217 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10218 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10221 WALK_SUBTREE (TYPE_SIZE (*type_p));
10222 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10227 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10231 /* Walk over all the sub-trees of this operand. */
10232 len = TREE_OPERAND_LENGTH (*tp);
10234 /* Go through the subtrees. We need to do this in forward order so
10235 that the scope of a FOR_EXPR is handled properly. */
10238 for (i = 0; i < len - 1; ++i)
10239 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10240 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10243 /* If this is a type, walk the needed fields in the type. */
10244 else if (TYPE_P (*tp))
10245 return walk_type_fields (*tp, func, data, pset, lh);
10249 /* We didn't find what we were looking for. */
10252 #undef WALK_SUBTREE_TAIL
10254 #undef WALK_SUBTREE
10256 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10259 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10263 struct pointer_set_t *pset;
10265 pset = pointer_set_create ();
10266 result = walk_tree_1 (tp, func, data, pset, lh);
10267 pointer_set_destroy (pset);
10273 tree_block (tree t)
10275 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10277 if (IS_EXPR_CODE_CLASS (c))
10278 return &t->exp.block;
10279 gcc_unreachable ();
10283 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10284 FIXME: don't use this function. It exists for compatibility with
10285 the old representation of CALL_EXPRs where a list was used to hold the
10286 arguments. Places that currently extract the arglist from a CALL_EXPR
10287 ought to be rewritten to use the CALL_EXPR itself. */
10289 call_expr_arglist (tree exp)
10291 tree arglist = NULL_TREE;
10293 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10294 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10299 /* Create a nameless artificial label and put it in the current
10300 function context. The label has a location of LOC. Returns the
10301 newly created label. */
10304 create_artificial_label (location_t loc)
10306 tree lab = build_decl (loc,
10307 LABEL_DECL, NULL_TREE, void_type_node);
10309 DECL_ARTIFICIAL (lab) = 1;
10310 DECL_IGNORED_P (lab) = 1;
10311 DECL_CONTEXT (lab) = current_function_decl;
10315 /* Given a tree, try to return a useful variable name that we can use
10316 to prefix a temporary that is being assigned the value of the tree.
10317 I.E. given <temp> = &A, return A. */
10322 tree stripped_decl;
10325 STRIP_NOPS (stripped_decl);
10326 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10327 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10330 switch (TREE_CODE (stripped_decl))
10333 return get_name (TREE_OPERAND (stripped_decl, 0));
10340 /* Return true if TYPE has a variable argument list. */
10343 stdarg_p (tree fntype)
10345 function_args_iterator args_iter;
10346 tree n = NULL_TREE, t;
10351 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10356 return n != NULL_TREE && n != void_type_node;
10359 /* Return true if TYPE has a prototype. */
10362 prototype_p (tree fntype)
10366 gcc_assert (fntype != NULL_TREE);
10368 t = TYPE_ARG_TYPES (fntype);
10369 return (t != NULL_TREE);
10372 /* If BLOCK is inlined from an __attribute__((__artificial__))
10373 routine, return pointer to location from where it has been
10376 block_nonartificial_location (tree block)
10378 location_t *ret = NULL;
10380 while (block && TREE_CODE (block) == BLOCK
10381 && BLOCK_ABSTRACT_ORIGIN (block))
10383 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10385 while (TREE_CODE (ao) == BLOCK
10386 && BLOCK_ABSTRACT_ORIGIN (ao)
10387 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10388 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10390 if (TREE_CODE (ao) == FUNCTION_DECL)
10392 /* If AO is an artificial inline, point RET to the
10393 call site locus at which it has been inlined and continue
10394 the loop, in case AO's caller is also an artificial
10396 if (DECL_DECLARED_INLINE_P (ao)
10397 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10398 ret = &BLOCK_SOURCE_LOCATION (block);
10402 else if (TREE_CODE (ao) != BLOCK)
10405 block = BLOCK_SUPERCONTEXT (block);
10411 /* If EXP is inlined from an __attribute__((__artificial__))
10412 function, return the location of the original call expression. */
10415 tree_nonartificial_location (tree exp)
10417 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10422 return EXPR_LOCATION (exp);
10426 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10429 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10432 cl_option_hash_hash (const void *x)
10434 const_tree const t = (const_tree) x;
10438 hashval_t hash = 0;
10440 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10442 p = (const char *)TREE_OPTIMIZATION (t);
10443 len = sizeof (struct cl_optimization);
10446 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10448 p = (const char *)TREE_TARGET_OPTION (t);
10449 len = sizeof (struct cl_target_option);
10453 gcc_unreachable ();
10455 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10457 for (i = 0; i < len; i++)
10459 hash = (hash << 4) ^ ((i << 2) | p[i]);
10464 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10465 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10469 cl_option_hash_eq (const void *x, const void *y)
10471 const_tree const xt = (const_tree) x;
10472 const_tree const yt = (const_tree) y;
10477 if (TREE_CODE (xt) != TREE_CODE (yt))
10480 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10482 xp = (const char *)TREE_OPTIMIZATION (xt);
10483 yp = (const char *)TREE_OPTIMIZATION (yt);
10484 len = sizeof (struct cl_optimization);
10487 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10489 xp = (const char *)TREE_TARGET_OPTION (xt);
10490 yp = (const char *)TREE_TARGET_OPTION (yt);
10491 len = sizeof (struct cl_target_option);
10495 gcc_unreachable ();
10497 return (memcmp (xp, yp, len) == 0);
10500 /* Build an OPTIMIZATION_NODE based on the current options. */
10503 build_optimization_node (void)
10508 /* Use the cache of optimization nodes. */
10510 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10512 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10516 /* Insert this one into the hash table. */
10517 t = cl_optimization_node;
10520 /* Make a new node for next time round. */
10521 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10527 /* Build a TARGET_OPTION_NODE based on the current options. */
10530 build_target_option_node (void)
10535 /* Use the cache of optimization nodes. */
10537 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10539 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10543 /* Insert this one into the hash table. */
10544 t = cl_target_option_node;
10547 /* Make a new node for next time round. */
10548 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10554 /* Determine the "ultimate origin" of a block. The block may be an inlined
10555 instance of an inlined instance of a block which is local to an inline
10556 function, so we have to trace all of the way back through the origin chain
10557 to find out what sort of node actually served as the original seed for the
10561 block_ultimate_origin (const_tree block)
10563 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10565 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10566 nodes in the function to point to themselves; ignore that if
10567 we're trying to output the abstract instance of this function. */
10568 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10571 if (immediate_origin == NULL_TREE)
10576 tree lookahead = immediate_origin;
10580 ret_val = lookahead;
10581 lookahead = (TREE_CODE (ret_val) == BLOCK
10582 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10584 while (lookahead != NULL && lookahead != ret_val);
10586 /* The block's abstract origin chain may not be the *ultimate* origin of
10587 the block. It could lead to a DECL that has an abstract origin set.
10588 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10589 will give us if it has one). Note that DECL's abstract origins are
10590 supposed to be the most distant ancestor (or so decl_ultimate_origin
10591 claims), so we don't need to loop following the DECL origins. */
10592 if (DECL_P (ret_val))
10593 return DECL_ORIGIN (ret_val);
10599 /* Return true if T1 and T2 are equivalent lists. */
10602 list_equal_p (const_tree t1, const_tree t2)
10604 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10605 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10610 /* Return true iff conversion in EXP generates no instruction. Mark
10611 it inline so that we fully inline into the stripping functions even
10612 though we have two uses of this function. */
10615 tree_nop_conversion (const_tree exp)
10617 tree outer_type, inner_type;
10619 if (!CONVERT_EXPR_P (exp)
10620 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10622 if (TREE_OPERAND (exp, 0) == error_mark_node)
10625 outer_type = TREE_TYPE (exp);
10626 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10628 /* Use precision rather then machine mode when we can, which gives
10629 the correct answer even for submode (bit-field) types. */
10630 if ((INTEGRAL_TYPE_P (outer_type)
10631 || POINTER_TYPE_P (outer_type)
10632 || TREE_CODE (outer_type) == OFFSET_TYPE)
10633 && (INTEGRAL_TYPE_P (inner_type)
10634 || POINTER_TYPE_P (inner_type)
10635 || TREE_CODE (inner_type) == OFFSET_TYPE))
10636 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10638 /* Otherwise fall back on comparing machine modes (e.g. for
10639 aggregate types, floats). */
10640 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10643 /* Return true iff conversion in EXP generates no instruction. Don't
10644 consider conversions changing the signedness. */
10647 tree_sign_nop_conversion (const_tree exp)
10649 tree outer_type, inner_type;
10651 if (!tree_nop_conversion (exp))
10654 outer_type = TREE_TYPE (exp);
10655 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10657 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10658 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10661 /* Strip conversions from EXP according to tree_nop_conversion and
10662 return the resulting expression. */
10665 tree_strip_nop_conversions (tree exp)
10667 while (tree_nop_conversion (exp))
10668 exp = TREE_OPERAND (exp, 0);
10672 /* Strip conversions from EXP according to tree_sign_nop_conversion
10673 and return the resulting expression. */
10676 tree_strip_sign_nop_conversions (tree exp)
10678 while (tree_sign_nop_conversion (exp))
10679 exp = TREE_OPERAND (exp, 0);
10683 static GTY(()) tree gcc_eh_personality_decl;
10685 /* Return the GCC personality function decl. */
10688 lhd_gcc_personality (void)
10690 if (!gcc_eh_personality_decl)
10691 gcc_eh_personality_decl
10692 = build_personality_function (USING_SJLJ_EXCEPTIONS
10693 ? "__gcc_personality_sj0"
10694 : "__gcc_personality_v0");
10696 return gcc_eh_personality_decl;
10699 #include "gt-tree.h"