1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid = 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash {
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
179 htab_t type_hash_table;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
184 htab_t int_cst_hash_table;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node;
192 static GTY (()) tree cl_target_option_node;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
194 htab_t cl_option_hash_table;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
200 htab_t debug_expr_for_decl;
202 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
203 htab_t value_expr_for_decl;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map)))
207 htab_t init_priority_for_decl;
209 static void set_type_quals (tree, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t type_hash_hash (const void *);
212 static hashval_t int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree, hashval_t);
221 static unsigned int attribute_hash_list (const_tree, hashval_t);
223 tree global_trees[TI_MAX];
224 tree integer_types[itk_none];
226 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0 /* OMP_CLAUSE_UNTIED */
249 const char * const omp_clause_code_name[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code)
275 switch (TREE_CODE_CLASS (code))
277 case tcc_declaration:
282 return TS_FIELD_DECL;
288 return TS_LABEL_DECL;
290 return TS_RESULT_DECL;
291 case DEBUG_EXPR_DECL:
294 return TS_CONST_DECL;
298 return TS_FUNCTION_DECL;
300 return TS_DECL_NON_COMMON;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST: return TS_INT_CST;
320 case REAL_CST: return TS_REAL_CST;
321 case FIXED_CST: return TS_FIXED_CST;
322 case COMPLEX_CST: return TS_COMPLEX;
323 case VECTOR_CST: return TS_VECTOR;
324 case STRING_CST: return TS_STRING;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK: return TS_COMMON;
327 case IDENTIFIER_NODE: return TS_IDENTIFIER;
328 case TREE_LIST: return TS_LIST;
329 case TREE_VEC: return TS_VEC;
330 case SSA_NAME: return TS_SSA_NAME;
331 case PLACEHOLDER_EXPR: return TS_COMMON;
332 case STATEMENT_LIST: return TS_STATEMENT_LIST;
333 case BLOCK: return TS_BLOCK;
334 case CONSTRUCTOR: return TS_CONSTRUCTOR;
335 case TREE_BINFO: return TS_BINFO;
336 case OMP_CLAUSE: return TS_OMP_CLAUSE;
337 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
338 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
398 enum tree_node_structure_enum ts_code;
400 code = (enum tree_code) i;
401 ts_code = tree_node_structure_for_code (code);
403 /* Mark the TS structure itself. */
404 tree_contains_struct[code][ts_code] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL:
428 case TS_STATEMENT_LIST:
431 case TS_OPTIMIZATION:
432 case TS_TARGET_OPTION:
433 MARK_TS_COMMON (code);
437 MARK_TS_DECL_MINIMAL (code);
441 MARK_TS_DECL_COMMON (code);
444 case TS_DECL_NON_COMMON:
445 MARK_TS_DECL_WITH_VIS (code);
448 case TS_DECL_WITH_VIS:
453 MARK_TS_DECL_WRTL (code);
457 MARK_TS_DECL_COMMON (code);
461 MARK_TS_DECL_WITH_VIS (code);
465 case TS_FUNCTION_DECL:
466 MARK_TS_DECL_NON_COMMON (code);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
476 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
478 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
503 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
504 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
505 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
507 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
508 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
509 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
510 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
511 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
512 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
513 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
514 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
515 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
536 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
539 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
541 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
542 tree_priority_map_eq, 0);
544 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
545 int_cst_hash_eq, NULL);
547 int_cst_node = make_node (INTEGER_CST);
549 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
550 cl_option_hash_eq, NULL);
552 cl_optimization_node = make_node (OPTIMIZATION_NODE);
553 cl_target_option_node = make_node (TARGET_OPTION_NODE);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
568 lang_hooks.set_decl_assembler_name (decl);
569 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl, const_tree asmname)
577 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
578 const char *decl_str;
579 const char *asmname_str;
582 if (decl_asmname == asmname)
585 decl_str = IDENTIFIER_POINTER (decl_asmname);
586 asmname_str = IDENTIFIER_POINTER (asmname);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str[0] == '*')
597 size_t ulp_len = strlen (user_label_prefix);
603 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
604 decl_str += ulp_len, test=true;
608 if (asmname_str[0] == '*')
610 size_t ulp_len = strlen (user_label_prefix);
616 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
617 asmname_str += ulp_len, test=true;
624 return strcmp (decl_str, asmname_str) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname)
632 if (IDENTIFIER_POINTER (asmname)[0] == '*')
634 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
635 size_t ulp_len = strlen (user_label_prefix);
639 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
642 return htab_hash_string (decl_str);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code)
654 switch (TREE_CODE_CLASS (code))
656 case tcc_declaration: /* A decl node */
661 return sizeof (struct tree_field_decl);
663 return sizeof (struct tree_parm_decl);
665 return sizeof (struct tree_var_decl);
667 return sizeof (struct tree_label_decl);
669 return sizeof (struct tree_result_decl);
671 return sizeof (struct tree_const_decl);
673 return sizeof (struct tree_type_decl);
675 return sizeof (struct tree_function_decl);
676 case DEBUG_EXPR_DECL:
677 return sizeof (struct tree_decl_with_rtl);
679 return sizeof (struct tree_decl_non_common);
683 case tcc_type: /* a type node */
684 return sizeof (struct tree_type);
686 case tcc_reference: /* a reference */
687 case tcc_expression: /* an expression */
688 case tcc_statement: /* an expression with side effects */
689 case tcc_comparison: /* a comparison expression */
690 case tcc_unary: /* a unary arithmetic expression */
691 case tcc_binary: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp)
693 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
695 case tcc_constant: /* a constant */
698 case INTEGER_CST: return sizeof (struct tree_int_cst);
699 case REAL_CST: return sizeof (struct tree_real_cst);
700 case FIXED_CST: return sizeof (struct tree_fixed_cst);
701 case COMPLEX_CST: return sizeof (struct tree_complex);
702 case VECTOR_CST: return sizeof (struct tree_vector);
703 case STRING_CST: gcc_unreachable ();
705 return lang_hooks.tree_size (code);
708 case tcc_exceptional: /* something random, like an identifier. */
711 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
712 case TREE_LIST: return sizeof (struct tree_list);
715 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
718 case OMP_CLAUSE: gcc_unreachable ();
720 case SSA_NAME: return sizeof (struct tree_ssa_name);
722 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
723 case BLOCK: return sizeof (struct tree_block);
724 case CONSTRUCTOR: return sizeof (struct tree_constructor);
725 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
726 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
729 return lang_hooks.tree_size (code);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node)
742 const enum tree_code code = TREE_CODE (node);
746 return (offsetof (struct tree_binfo, base_binfos)
747 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
750 return (sizeof (struct tree_vec)
751 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
754 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
757 return (sizeof (struct tree_omp_clause)
758 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
762 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
763 return (sizeof (struct tree_exp)
764 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
766 return tree_code_size (code);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL)
781 enum tree_code_class type = TREE_CODE_CLASS (code);
782 size_t length = tree_code_size (code);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration: /* A decl node */
792 case tcc_type: /* a type node */
796 case tcc_statement: /* an expression with side effects */
800 case tcc_reference: /* a reference */
804 case tcc_expression: /* an expression */
805 case tcc_comparison: /* a comparison expression */
806 case tcc_unary: /* a unary arithmetic expression */
807 case tcc_binary: /* a binary arithmetic expression */
811 case tcc_constant: /* a constant */
815 case tcc_exceptional: /* something random, like an identifier. */
818 case IDENTIFIER_NODE:
831 kind = ssa_name_kind;
852 tree_node_counts[(int) kind]++;
853 tree_node_sizes[(int) kind] += length;
856 if (code == IDENTIFIER_NODE)
857 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
859 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
861 memset (t, 0, length);
863 TREE_SET_CODE (t, code);
868 TREE_SIDE_EFFECTS (t) = 1;
871 case tcc_declaration:
872 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
874 if (code == FUNCTION_DECL)
876 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
877 DECL_MODE (t) = FUNCTION_MODE;
882 DECL_SOURCE_LOCATION (t) = input_location;
883 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
884 DECL_UID (t) = --next_debug_decl_uid;
886 DECL_UID (t) = next_decl_uid++;
887 if (TREE_CODE (t) == LABEL_DECL)
888 LABEL_DECL_UID (t) = -1;
893 TYPE_UID (t) = next_type_uid++;
894 TYPE_ALIGN (t) = BITS_PER_UNIT;
895 TYPE_USER_ALIGN (t) = 0;
896 TYPE_MAIN_VARIANT (t) = t;
897 TYPE_CANONICAL (t) = t;
899 /* Default to no attributes for type, but let target change that. */
900 TYPE_ATTRIBUTES (t) = NULL_TREE;
901 targetm.set_default_type_attributes (t);
903 /* We have not yet computed the alias set for this type. */
904 TYPE_ALIAS_SET (t) = -1;
908 TREE_CONSTANT (t) = 1;
917 case PREDECREMENT_EXPR:
918 case PREINCREMENT_EXPR:
919 case POSTDECREMENT_EXPR:
920 case POSTINCREMENT_EXPR:
921 /* All of these have side-effects, no matter what their
923 TREE_SIDE_EFFECTS (t) = 1;
932 /* Other classes need no special treatment. */
939 /* Return a new node with the same contents as NODE except that its
940 TREE_CHAIN is zero and it has a fresh uid. */
943 copy_node_stat (tree node MEM_STAT_DECL)
946 enum tree_code code = TREE_CODE (node);
949 gcc_assert (code != STATEMENT_LIST);
951 length = tree_size (node);
952 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
953 memcpy (t, node, length);
956 TREE_ASM_WRITTEN (t) = 0;
957 TREE_VISITED (t) = 0;
960 if (TREE_CODE_CLASS (code) == tcc_declaration)
962 if (code == DEBUG_EXPR_DECL)
963 DECL_UID (t) = --next_debug_decl_uid;
965 DECL_UID (t) = next_decl_uid++;
966 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
967 && DECL_HAS_VALUE_EXPR_P (node))
969 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
970 DECL_HAS_VALUE_EXPR_P (t) = 1;
972 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
974 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
975 DECL_HAS_INIT_PRIORITY_P (t) = 1;
978 else if (TREE_CODE_CLASS (code) == tcc_type)
980 TYPE_UID (t) = next_type_uid++;
981 /* The following is so that the debug code for
982 the copy is different from the original type.
983 The two statements usually duplicate each other
984 (because they clear fields of the same union),
985 but the optimizer should catch that. */
986 TYPE_SYMTAB_POINTER (t) = 0;
987 TYPE_SYMTAB_ADDRESS (t) = 0;
989 /* Do not copy the values cache. */
990 if (TYPE_CACHED_VALUES_P(t))
992 TYPE_CACHED_VALUES_P (t) = 0;
993 TYPE_CACHED_VALUES (t) = NULL_TREE;
1000 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1001 For example, this can copy a list made of TREE_LIST nodes. */
1004 copy_list (tree list)
1012 head = prev = copy_node (list);
1013 next = TREE_CHAIN (list);
1016 TREE_CHAIN (prev) = copy_node (next);
1017 prev = TREE_CHAIN (prev);
1018 next = TREE_CHAIN (next);
1024 /* Create an INT_CST node with a LOW value sign extended. */
1027 build_int_cst (tree type, HOST_WIDE_INT low)
1029 /* Support legacy code. */
1031 type = integer_type_node;
1033 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1036 /* Create an INT_CST node with a LOW value zero extended. */
1039 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1041 return build_int_cst_wide (type, low, 0);
1044 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1045 if it is negative. This function is similar to build_int_cst, but
1046 the extra bits outside of the type precision are cleared. Constants
1047 with these extra bits may confuse the fold so that it detects overflows
1048 even in cases when they do not occur, and in general should be avoided.
1049 We cannot however make this a default behavior of build_int_cst without
1050 more intrusive changes, since there are parts of gcc that rely on the extra
1051 precision of the integer constants. */
1054 build_int_cst_type (tree type, HOST_WIDE_INT low)
1056 unsigned HOST_WIDE_INT low1;
1061 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1063 return build_int_cst_wide (type, low1, hi);
1066 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1067 and sign extended according to the value range of TYPE. */
1070 build_int_cst_wide_type (tree type,
1071 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1073 fit_double_type (low, high, &low, &high, type);
1074 return build_int_cst_wide (type, low, high);
1077 /* These are the hash table functions for the hash table of INTEGER_CST
1078 nodes of a sizetype. */
1080 /* Return the hash code code X, an INTEGER_CST. */
1083 int_cst_hash_hash (const void *x)
1085 const_tree const t = (const_tree) x;
1087 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1088 ^ htab_hash_pointer (TREE_TYPE (t)));
1091 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1092 is the same as that given by *Y, which is the same. */
1095 int_cst_hash_eq (const void *x, const void *y)
1097 const_tree const xt = (const_tree) x;
1098 const_tree const yt = (const_tree) y;
1100 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1101 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1102 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1105 /* Create an INT_CST node of TYPE and value HI:LOW.
1106 The returned node is always shared. For small integers we use a
1107 per-type vector cache, for larger ones we use a single hash table. */
1110 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1118 switch (TREE_CODE (type))
1121 case REFERENCE_TYPE:
1122 /* Cache NULL pointer. */
1131 /* Cache false or true. */
1139 if (TYPE_UNSIGNED (type))
1142 limit = INTEGER_SHARE_LIMIT;
1143 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1149 limit = INTEGER_SHARE_LIMIT + 1;
1150 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1152 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1166 /* Look for it in the type's vector of small shared ints. */
1167 if (!TYPE_CACHED_VALUES_P (type))
1169 TYPE_CACHED_VALUES_P (type) = 1;
1170 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1173 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1176 /* Make sure no one is clobbering the shared constant. */
1177 gcc_assert (TREE_TYPE (t) == type);
1178 gcc_assert (TREE_INT_CST_LOW (t) == low);
1179 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1183 /* Create a new shared int. */
1184 t = make_node (INTEGER_CST);
1186 TREE_INT_CST_LOW (t) = low;
1187 TREE_INT_CST_HIGH (t) = hi;
1188 TREE_TYPE (t) = type;
1190 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1195 /* Use the cache of larger shared ints. */
1198 TREE_INT_CST_LOW (int_cst_node) = low;
1199 TREE_INT_CST_HIGH (int_cst_node) = hi;
1200 TREE_TYPE (int_cst_node) = type;
1202 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1206 /* Insert this one into the hash table. */
1209 /* Make a new node for next time round. */
1210 int_cst_node = make_node (INTEGER_CST);
1217 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1218 and the rest are zeros. */
1221 build_low_bits_mask (tree type, unsigned bits)
1223 unsigned HOST_WIDE_INT low;
1225 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1227 gcc_assert (bits <= TYPE_PRECISION (type));
1229 if (bits == TYPE_PRECISION (type)
1230 && !TYPE_UNSIGNED (type))
1232 /* Sign extended all-ones mask. */
1236 else if (bits <= HOST_BITS_PER_WIDE_INT)
1238 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1243 bits -= HOST_BITS_PER_WIDE_INT;
1245 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1248 return build_int_cst_wide (type, low, high);
1251 /* Checks that X is integer constant that can be expressed in (unsigned)
1252 HOST_WIDE_INT without loss of precision. */
1255 cst_and_fits_in_hwi (const_tree x)
1257 if (TREE_CODE (x) != INTEGER_CST)
1260 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1263 return (TREE_INT_CST_HIGH (x) == 0
1264 || TREE_INT_CST_HIGH (x) == -1);
1267 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1268 are in a list pointed to by VALS. */
1271 build_vector (tree type, tree vals)
1273 tree v = make_node (VECTOR_CST);
1277 TREE_VECTOR_CST_ELTS (v) = vals;
1278 TREE_TYPE (v) = type;
1280 /* Iterate through elements and check for overflow. */
1281 for (link = vals; link; link = TREE_CHAIN (link))
1283 tree value = TREE_VALUE (link);
1285 /* Don't crash if we get an address constant. */
1286 if (!CONSTANT_CLASS_P (value))
1289 over |= TREE_OVERFLOW (value);
1292 TREE_OVERFLOW (v) = over;
1296 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1297 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1300 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1302 tree list = NULL_TREE;
1303 unsigned HOST_WIDE_INT idx;
1306 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1307 list = tree_cons (NULL_TREE, value, list);
1308 return build_vector (type, nreverse (list));
1311 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1312 are in the VEC pointed to by VALS. */
1314 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1316 tree c = make_node (CONSTRUCTOR);
1317 TREE_TYPE (c) = type;
1318 CONSTRUCTOR_ELTS (c) = vals;
1322 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1325 build_constructor_single (tree type, tree index, tree value)
1327 VEC(constructor_elt,gc) *v;
1328 constructor_elt *elt;
1331 v = VEC_alloc (constructor_elt, gc, 1);
1332 elt = VEC_quick_push (constructor_elt, v, NULL);
1336 t = build_constructor (type, v);
1337 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1342 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1343 are in a list pointed to by VALS. */
1345 build_constructor_from_list (tree type, tree vals)
1348 VEC(constructor_elt,gc) *v = NULL;
1349 bool constant_p = true;
1353 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1354 for (t = vals; t; t = TREE_CHAIN (t))
1356 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1357 val = TREE_VALUE (t);
1358 elt->index = TREE_PURPOSE (t);
1360 if (!TREE_CONSTANT (val))
1365 t = build_constructor (type, v);
1366 TREE_CONSTANT (t) = constant_p;
1370 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1373 build_fixed (tree type, FIXED_VALUE_TYPE f)
1376 FIXED_VALUE_TYPE *fp;
1378 v = make_node (FIXED_CST);
1379 fp = GGC_NEW (FIXED_VALUE_TYPE);
1380 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1382 TREE_TYPE (v) = type;
1383 TREE_FIXED_CST_PTR (v) = fp;
1387 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1390 build_real (tree type, REAL_VALUE_TYPE d)
1393 REAL_VALUE_TYPE *dp;
1396 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1397 Consider doing it via real_convert now. */
1399 v = make_node (REAL_CST);
1400 dp = GGC_NEW (REAL_VALUE_TYPE);
1401 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1403 TREE_TYPE (v) = type;
1404 TREE_REAL_CST_PTR (v) = dp;
1405 TREE_OVERFLOW (v) = overflow;
1409 /* Return a new REAL_CST node whose type is TYPE
1410 and whose value is the integer value of the INTEGER_CST node I. */
1413 real_value_from_int_cst (const_tree type, const_tree i)
1417 /* Clear all bits of the real value type so that we can later do
1418 bitwise comparisons to see if two values are the same. */
1419 memset (&d, 0, sizeof d);
1421 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1422 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1423 TYPE_UNSIGNED (TREE_TYPE (i)));
1427 /* Given a tree representing an integer constant I, return a tree
1428 representing the same value as a floating-point constant of type TYPE. */
1431 build_real_from_int_cst (tree type, const_tree i)
1434 int overflow = TREE_OVERFLOW (i);
1436 v = build_real (type, real_value_from_int_cst (type, i));
1438 TREE_OVERFLOW (v) |= overflow;
1442 /* Return a newly constructed STRING_CST node whose value is
1443 the LEN characters at STR.
1444 The TREE_TYPE is not initialized. */
1447 build_string (int len, const char *str)
1452 /* Do not waste bytes provided by padding of struct tree_string. */
1453 length = len + offsetof (struct tree_string, str) + 1;
1455 #ifdef GATHER_STATISTICS
1456 tree_node_counts[(int) c_kind]++;
1457 tree_node_sizes[(int) c_kind] += length;
1460 s = ggc_alloc_tree (length);
1462 memset (s, 0, sizeof (struct tree_common));
1463 TREE_SET_CODE (s, STRING_CST);
1464 TREE_CONSTANT (s) = 1;
1465 TREE_STRING_LENGTH (s) = len;
1466 memcpy (s->string.str, str, len);
1467 s->string.str[len] = '\0';
1472 /* Return a newly constructed COMPLEX_CST node whose value is
1473 specified by the real and imaginary parts REAL and IMAG.
1474 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1475 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1478 build_complex (tree type, tree real, tree imag)
1480 tree t = make_node (COMPLEX_CST);
1482 TREE_REALPART (t) = real;
1483 TREE_IMAGPART (t) = imag;
1484 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1485 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1489 /* Return a constant of arithmetic type TYPE which is the
1490 multiplicative identity of the set TYPE. */
1493 build_one_cst (tree type)
1495 switch (TREE_CODE (type))
1497 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1498 case POINTER_TYPE: case REFERENCE_TYPE:
1500 return build_int_cst (type, 1);
1503 return build_real (type, dconst1);
1505 case FIXED_POINT_TYPE:
1506 /* We can only generate 1 for accum types. */
1507 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1508 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1515 scalar = build_one_cst (TREE_TYPE (type));
1517 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1519 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1520 cst = tree_cons (NULL_TREE, scalar, cst);
1522 return build_vector (type, cst);
1526 return build_complex (type,
1527 build_one_cst (TREE_TYPE (type)),
1528 fold_convert (TREE_TYPE (type), integer_zero_node));
1535 /* Build a BINFO with LEN language slots. */
1538 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1541 size_t length = (offsetof (struct tree_binfo, base_binfos)
1542 + VEC_embedded_size (tree, base_binfos));
1544 #ifdef GATHER_STATISTICS
1545 tree_node_counts[(int) binfo_kind]++;
1546 tree_node_sizes[(int) binfo_kind] += length;
1549 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1551 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1553 TREE_SET_CODE (t, TREE_BINFO);
1555 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1561 /* Build a newly constructed TREE_VEC node of length LEN. */
1564 make_tree_vec_stat (int len MEM_STAT_DECL)
1567 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1569 #ifdef GATHER_STATISTICS
1570 tree_node_counts[(int) vec_kind]++;
1571 tree_node_sizes[(int) vec_kind] += length;
1574 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1576 memset (t, 0, length);
1578 TREE_SET_CODE (t, TREE_VEC);
1579 TREE_VEC_LENGTH (t) = len;
1584 /* Return 1 if EXPR is the integer constant zero or a complex constant
1588 integer_zerop (const_tree expr)
1592 return ((TREE_CODE (expr) == INTEGER_CST
1593 && TREE_INT_CST_LOW (expr) == 0
1594 && TREE_INT_CST_HIGH (expr) == 0)
1595 || (TREE_CODE (expr) == COMPLEX_CST
1596 && integer_zerop (TREE_REALPART (expr))
1597 && integer_zerop (TREE_IMAGPART (expr))));
1600 /* Return 1 if EXPR is the integer constant one or the corresponding
1601 complex constant. */
1604 integer_onep (const_tree expr)
1608 return ((TREE_CODE (expr) == INTEGER_CST
1609 && TREE_INT_CST_LOW (expr) == 1
1610 && TREE_INT_CST_HIGH (expr) == 0)
1611 || (TREE_CODE (expr) == COMPLEX_CST
1612 && integer_onep (TREE_REALPART (expr))
1613 && integer_zerop (TREE_IMAGPART (expr))));
1616 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1617 it contains. Likewise for the corresponding complex constant. */
1620 integer_all_onesp (const_tree expr)
1627 if (TREE_CODE (expr) == COMPLEX_CST
1628 && integer_all_onesp (TREE_REALPART (expr))
1629 && integer_zerop (TREE_IMAGPART (expr)))
1632 else if (TREE_CODE (expr) != INTEGER_CST)
1635 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1636 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1637 && TREE_INT_CST_HIGH (expr) == -1)
1642 /* Note that using TYPE_PRECISION here is wrong. We care about the
1643 actual bits, not the (arbitrary) range of the type. */
1644 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1645 if (prec >= HOST_BITS_PER_WIDE_INT)
1647 HOST_WIDE_INT high_value;
1650 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1652 /* Can not handle precisions greater than twice the host int size. */
1653 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1654 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1655 /* Shifting by the host word size is undefined according to the ANSI
1656 standard, so we must handle this as a special case. */
1659 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1661 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1662 && TREE_INT_CST_HIGH (expr) == high_value);
1665 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1668 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1672 integer_pow2p (const_tree expr)
1675 HOST_WIDE_INT high, low;
1679 if (TREE_CODE (expr) == COMPLEX_CST
1680 && integer_pow2p (TREE_REALPART (expr))
1681 && integer_zerop (TREE_IMAGPART (expr)))
1684 if (TREE_CODE (expr) != INTEGER_CST)
1687 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1688 ? POINTER_SIZE : 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 = (POINTER_TYPE_P (TREE_TYPE (expr))
1753 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1755 high = TREE_INT_CST_HIGH (expr);
1756 low = TREE_INT_CST_LOW (expr);
1758 /* First clear all bits that are beyond the type's precision in case
1759 we've been sign extended. */
1761 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1763 else if (prec > HOST_BITS_PER_WIDE_INT)
1764 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1768 if (prec < HOST_BITS_PER_WIDE_INT)
1769 low &= ~((HOST_WIDE_INT) (-1) << prec);
1772 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1773 : exact_log2 (low));
1776 /* Similar, but return the largest integer Y such that 2 ** Y is less
1777 than or equal to EXPR. */
1780 tree_floor_log2 (const_tree expr)
1783 HOST_WIDE_INT high, low;
1787 if (TREE_CODE (expr) == COMPLEX_CST)
1788 return tree_log2 (TREE_REALPART (expr));
1790 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1791 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1793 high = TREE_INT_CST_HIGH (expr);
1794 low = TREE_INT_CST_LOW (expr);
1796 /* First clear all bits that are beyond the type's precision in case
1797 we've been sign extended. Ignore if type's precision hasn't been set
1798 since what we are doing is setting it. */
1800 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1802 else if (prec > HOST_BITS_PER_WIDE_INT)
1803 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1807 if (prec < HOST_BITS_PER_WIDE_INT)
1808 low &= ~((HOST_WIDE_INT) (-1) << prec);
1811 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1812 : floor_log2 (low));
1815 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1816 decimal float constants, so don't return 1 for them. */
1819 real_zerop (const_tree expr)
1823 return ((TREE_CODE (expr) == REAL_CST
1824 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1825 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1826 || (TREE_CODE (expr) == COMPLEX_CST
1827 && real_zerop (TREE_REALPART (expr))
1828 && real_zerop (TREE_IMAGPART (expr))));
1831 /* Return 1 if EXPR is the real constant one in real or complex form.
1832 Trailing zeroes matter for decimal float constants, so don't return
1836 real_onep (const_tree expr)
1840 return ((TREE_CODE (expr) == REAL_CST
1841 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1842 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1843 || (TREE_CODE (expr) == COMPLEX_CST
1844 && real_onep (TREE_REALPART (expr))
1845 && real_zerop (TREE_IMAGPART (expr))));
1848 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1849 for decimal float constants, so don't return 1 for them. */
1852 real_twop (const_tree expr)
1856 return ((TREE_CODE (expr) == REAL_CST
1857 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1858 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1859 || (TREE_CODE (expr) == COMPLEX_CST
1860 && real_twop (TREE_REALPART (expr))
1861 && real_zerop (TREE_IMAGPART (expr))));
1864 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1865 matter for decimal float constants, so don't return 1 for them. */
1868 real_minus_onep (const_tree expr)
1872 return ((TREE_CODE (expr) == REAL_CST
1873 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1874 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1875 || (TREE_CODE (expr) == COMPLEX_CST
1876 && real_minus_onep (TREE_REALPART (expr))
1877 && real_zerop (TREE_IMAGPART (expr))));
1880 /* Nonzero if EXP is a constant or a cast of a constant. */
1883 really_constant_p (const_tree exp)
1885 /* This is not quite the same as STRIP_NOPS. It does more. */
1886 while (CONVERT_EXPR_P (exp)
1887 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1888 exp = TREE_OPERAND (exp, 0);
1889 return TREE_CONSTANT (exp);
1892 /* Return first list element whose TREE_VALUE is ELEM.
1893 Return 0 if ELEM is not in LIST. */
1896 value_member (tree elem, tree list)
1900 if (elem == TREE_VALUE (list))
1902 list = TREE_CHAIN (list);
1907 /* Return first list element whose TREE_PURPOSE is ELEM.
1908 Return 0 if ELEM is not in LIST. */
1911 purpose_member (const_tree elem, tree list)
1915 if (elem == TREE_PURPOSE (list))
1917 list = TREE_CHAIN (list);
1922 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1926 chain_index (int idx, tree chain)
1928 for (; chain && idx > 0; --idx)
1929 chain = TREE_CHAIN (chain);
1933 /* Return nonzero if ELEM is part of the chain CHAIN. */
1936 chain_member (const_tree elem, const_tree chain)
1942 chain = TREE_CHAIN (chain);
1948 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1949 We expect a null pointer to mark the end of the chain.
1950 This is the Lisp primitive `length'. */
1953 list_length (const_tree t)
1956 #ifdef ENABLE_TREE_CHECKING
1964 #ifdef ENABLE_TREE_CHECKING
1967 gcc_assert (p != q);
1975 /* Returns the number of FIELD_DECLs in TYPE. */
1978 fields_length (const_tree type)
1980 tree t = TYPE_FIELDS (type);
1983 for (; t; t = TREE_CHAIN (t))
1984 if (TREE_CODE (t) == FIELD_DECL)
1990 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1991 by modifying the last node in chain 1 to point to chain 2.
1992 This is the Lisp primitive `nconc'. */
1995 chainon (tree op1, tree op2)
2004 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2006 TREE_CHAIN (t1) = op2;
2008 #ifdef ENABLE_TREE_CHECKING
2011 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2012 gcc_assert (t2 != t1);
2019 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2022 tree_last (tree chain)
2026 while ((next = TREE_CHAIN (chain)))
2031 /* Reverse the order of elements in the chain T,
2032 and return the new head of the chain (old last element). */
2037 tree prev = 0, decl, next;
2038 for (decl = t; decl; decl = next)
2040 next = TREE_CHAIN (decl);
2041 TREE_CHAIN (decl) = prev;
2047 /* Return a newly created TREE_LIST node whose
2048 purpose and value fields are PARM and VALUE. */
2051 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2053 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2054 TREE_PURPOSE (t) = parm;
2055 TREE_VALUE (t) = value;
2059 /* Build a chain of TREE_LIST nodes from a vector. */
2062 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2064 tree ret = NULL_TREE;
2068 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2070 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2071 pp = &TREE_CHAIN (*pp);
2076 /* Return a newly created TREE_LIST node whose
2077 purpose and value fields are PURPOSE and VALUE
2078 and whose TREE_CHAIN is CHAIN. */
2081 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2085 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2087 memset (node, 0, sizeof (struct tree_common));
2089 #ifdef GATHER_STATISTICS
2090 tree_node_counts[(int) x_kind]++;
2091 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2094 TREE_SET_CODE (node, TREE_LIST);
2095 TREE_CHAIN (node) = chain;
2096 TREE_PURPOSE (node) = purpose;
2097 TREE_VALUE (node) = value;
2101 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2104 ctor_to_list (tree ctor)
2106 tree list = NULL_TREE;
2111 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2113 *p = build_tree_list (purpose, val);
2114 p = &TREE_CHAIN (*p);
2120 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2124 ctor_to_vec (tree ctor)
2126 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2130 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2131 VEC_quick_push (tree, vec, val);
2136 /* Return the size nominally occupied by an object of type TYPE
2137 when it resides in memory. The value is measured in units of bytes,
2138 and its data type is that normally used for type sizes
2139 (which is the first type created by make_signed_type or
2140 make_unsigned_type). */
2143 size_in_bytes (const_tree type)
2147 if (type == error_mark_node)
2148 return integer_zero_node;
2150 type = TYPE_MAIN_VARIANT (type);
2151 t = TYPE_SIZE_UNIT (type);
2155 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2156 return size_zero_node;
2162 /* Return the size of TYPE (in bytes) as a wide integer
2163 or return -1 if the size can vary or is larger than an integer. */
2166 int_size_in_bytes (const_tree type)
2170 if (type == error_mark_node)
2173 type = TYPE_MAIN_VARIANT (type);
2174 t = TYPE_SIZE_UNIT (type);
2176 || TREE_CODE (t) != INTEGER_CST
2177 || TREE_INT_CST_HIGH (t) != 0
2178 /* If the result would appear negative, it's too big to represent. */
2179 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2182 return TREE_INT_CST_LOW (t);
2185 /* Return the maximum size of TYPE (in bytes) as a wide integer
2186 or return -1 if the size can vary or is larger than an integer. */
2189 max_int_size_in_bytes (const_tree type)
2191 HOST_WIDE_INT size = -1;
2194 /* If this is an array type, check for a possible MAX_SIZE attached. */
2196 if (TREE_CODE (type) == ARRAY_TYPE)
2198 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2200 if (size_tree && host_integerp (size_tree, 1))
2201 size = tree_low_cst (size_tree, 1);
2204 /* If we still haven't been able to get a size, see if the language
2205 can compute a maximum size. */
2209 size_tree = lang_hooks.types.max_size (type);
2211 if (size_tree && host_integerp (size_tree, 1))
2212 size = tree_low_cst (size_tree, 1);
2218 /* Returns a tree for the size of EXP in bytes. */
2221 tree_expr_size (const_tree exp)
2224 && DECL_SIZE_UNIT (exp) != 0)
2225 return DECL_SIZE_UNIT (exp);
2227 return size_in_bytes (TREE_TYPE (exp));
2230 /* Return the bit position of FIELD, in bits from the start of the record.
2231 This is a tree of type bitsizetype. */
2234 bit_position (const_tree field)
2236 return bit_from_pos (DECL_FIELD_OFFSET (field),
2237 DECL_FIELD_BIT_OFFSET (field));
2240 /* Likewise, but return as an integer. It must be representable in
2241 that way (since it could be a signed value, we don't have the
2242 option of returning -1 like int_size_in_byte can. */
2245 int_bit_position (const_tree field)
2247 return tree_low_cst (bit_position (field), 0);
2250 /* Return the byte position of FIELD, in bytes from the start of the record.
2251 This is a tree of type sizetype. */
2254 byte_position (const_tree field)
2256 return byte_from_pos (DECL_FIELD_OFFSET (field),
2257 DECL_FIELD_BIT_OFFSET (field));
2260 /* Likewise, but return as an integer. It must be representable in
2261 that way (since it could be a signed value, we don't have the
2262 option of returning -1 like int_size_in_byte can. */
2265 int_byte_position (const_tree field)
2267 return tree_low_cst (byte_position (field), 0);
2270 /* Return the strictest alignment, in bits, that T is known to have. */
2273 expr_align (const_tree t)
2275 unsigned int align0, align1;
2277 switch (TREE_CODE (t))
2279 CASE_CONVERT: case NON_LVALUE_EXPR:
2280 /* If we have conversions, we know that the alignment of the
2281 object must meet each of the alignments of the types. */
2282 align0 = expr_align (TREE_OPERAND (t, 0));
2283 align1 = TYPE_ALIGN (TREE_TYPE (t));
2284 return MAX (align0, align1);
2286 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2287 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2288 case CLEANUP_POINT_EXPR:
2289 /* These don't change the alignment of an object. */
2290 return expr_align (TREE_OPERAND (t, 0));
2293 /* The best we can do is say that the alignment is the least aligned
2295 align0 = expr_align (TREE_OPERAND (t, 1));
2296 align1 = expr_align (TREE_OPERAND (t, 2));
2297 return MIN (align0, align1);
2299 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2300 meaningfully, it's always 1. */
2301 case LABEL_DECL: case CONST_DECL:
2302 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2304 gcc_assert (DECL_ALIGN (t) != 0);
2305 return DECL_ALIGN (t);
2311 /* Otherwise take the alignment from that of the type. */
2312 return TYPE_ALIGN (TREE_TYPE (t));
2315 /* Return, as a tree node, the number of elements for TYPE (which is an
2316 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2319 array_type_nelts (const_tree type)
2321 tree index_type, min, max;
2323 /* If they did it with unspecified bounds, then we should have already
2324 given an error about it before we got here. */
2325 if (! TYPE_DOMAIN (type))
2326 return error_mark_node;
2328 index_type = TYPE_DOMAIN (type);
2329 min = TYPE_MIN_VALUE (index_type);
2330 max = TYPE_MAX_VALUE (index_type);
2332 return (integer_zerop (min)
2334 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2337 /* If arg is static -- a reference to an object in static storage -- then
2338 return the object. This is not the same as the C meaning of `static'.
2339 If arg isn't static, return NULL. */
2344 switch (TREE_CODE (arg))
2347 /* Nested functions are static, even though taking their address will
2348 involve a trampoline as we unnest the nested function and create
2349 the trampoline on the tree level. */
2353 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2354 && ! DECL_THREAD_LOCAL_P (arg)
2355 && ! DECL_DLLIMPORT_P (arg)
2359 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2363 return TREE_STATIC (arg) ? arg : NULL;
2370 /* If the thing being referenced is not a field, then it is
2371 something language specific. */
2372 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2374 /* If we are referencing a bitfield, we can't evaluate an
2375 ADDR_EXPR at compile time and so it isn't a constant. */
2376 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2379 return staticp (TREE_OPERAND (arg, 0));
2384 case MISALIGNED_INDIRECT_REF:
2385 case ALIGN_INDIRECT_REF:
2387 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2390 case ARRAY_RANGE_REF:
2391 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2392 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2393 return staticp (TREE_OPERAND (arg, 0));
2397 case COMPOUND_LITERAL_EXPR:
2398 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2408 /* Return whether OP is a DECL whose address is function-invariant. */
2411 decl_address_invariant_p (const_tree op)
2413 /* The conditions below are slightly less strict than the one in
2416 switch (TREE_CODE (op))
2425 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2426 && !DECL_DLLIMPORT_P (op))
2427 || DECL_THREAD_LOCAL_P (op)
2428 || DECL_CONTEXT (op) == current_function_decl
2429 || decl_function_context (op) == current_function_decl)
2434 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2435 || decl_function_context (op) == current_function_decl)
2446 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2449 decl_address_ip_invariant_p (const_tree op)
2451 /* The conditions below are slightly less strict than the one in
2454 switch (TREE_CODE (op))
2462 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2463 && !DECL_DLLIMPORT_P (op))
2464 || DECL_THREAD_LOCAL_P (op))
2469 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2481 /* Return true if T is function-invariant (internal function, does
2482 not handle arithmetic; that's handled in skip_simple_arithmetic and
2483 tree_invariant_p). */
2485 static bool tree_invariant_p (tree t);
2488 tree_invariant_p_1 (tree t)
2492 if (TREE_CONSTANT (t)
2493 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2496 switch (TREE_CODE (t))
2502 op = TREE_OPERAND (t, 0);
2503 while (handled_component_p (op))
2505 switch (TREE_CODE (op))
2508 case ARRAY_RANGE_REF:
2509 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2510 || TREE_OPERAND (op, 2) != NULL_TREE
2511 || TREE_OPERAND (op, 3) != NULL_TREE)
2516 if (TREE_OPERAND (op, 2) != NULL_TREE)
2522 op = TREE_OPERAND (op, 0);
2525 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2534 /* Return true if T is function-invariant. */
2537 tree_invariant_p (tree t)
2539 tree inner = skip_simple_arithmetic (t);
2540 return tree_invariant_p_1 (inner);
2543 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2544 Do this to any expression which may be used in more than one place,
2545 but must be evaluated only once.
2547 Normally, expand_expr would reevaluate the expression each time.
2548 Calling save_expr produces something that is evaluated and recorded
2549 the first time expand_expr is called on it. Subsequent calls to
2550 expand_expr just reuse the recorded value.
2552 The call to expand_expr that generates code that actually computes
2553 the value is the first call *at compile time*. Subsequent calls
2554 *at compile time* generate code to use the saved value.
2555 This produces correct result provided that *at run time* control
2556 always flows through the insns made by the first expand_expr
2557 before reaching the other places where the save_expr was evaluated.
2558 You, the caller of save_expr, must make sure this is so.
2560 Constants, and certain read-only nodes, are returned with no
2561 SAVE_EXPR because that is safe. Expressions containing placeholders
2562 are not touched; see tree.def for an explanation of what these
2566 save_expr (tree expr)
2568 tree t = fold (expr);
2571 /* If the tree evaluates to a constant, then we don't want to hide that
2572 fact (i.e. this allows further folding, and direct checks for constants).
2573 However, a read-only object that has side effects cannot be bypassed.
2574 Since it is no problem to reevaluate literals, we just return the
2576 inner = skip_simple_arithmetic (t);
2577 if (TREE_CODE (inner) == ERROR_MARK)
2580 if (tree_invariant_p_1 (inner))
2583 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2584 it means that the size or offset of some field of an object depends on
2585 the value within another field.
2587 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2588 and some variable since it would then need to be both evaluated once and
2589 evaluated more than once. Front-ends must assure this case cannot
2590 happen by surrounding any such subexpressions in their own SAVE_EXPR
2591 and forcing evaluation at the proper time. */
2592 if (contains_placeholder_p (inner))
2595 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2596 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2598 /* This expression might be placed ahead of a jump to ensure that the
2599 value was computed on both sides of the jump. So make sure it isn't
2600 eliminated as dead. */
2601 TREE_SIDE_EFFECTS (t) = 1;
2605 /* Look inside EXPR and into any simple arithmetic operations. Return
2606 the innermost non-arithmetic node. */
2609 skip_simple_arithmetic (tree expr)
2613 /* We don't care about whether this can be used as an lvalue in this
2615 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2616 expr = TREE_OPERAND (expr, 0);
2618 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2619 a constant, it will be more efficient to not make another SAVE_EXPR since
2620 it will allow better simplification and GCSE will be able to merge the
2621 computations if they actually occur. */
2625 if (UNARY_CLASS_P (inner))
2626 inner = TREE_OPERAND (inner, 0);
2627 else if (BINARY_CLASS_P (inner))
2629 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2630 inner = TREE_OPERAND (inner, 0);
2631 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2632 inner = TREE_OPERAND (inner, 1);
2644 /* Return which tree structure is used by T. */
2646 enum tree_node_structure_enum
2647 tree_node_structure (const_tree t)
2649 const enum tree_code code = TREE_CODE (t);
2650 return tree_node_structure_for_code (code);
2653 /* Set various status flags when building a CALL_EXPR object T. */
2656 process_call_operands (tree t)
2658 bool side_effects = TREE_SIDE_EFFECTS (t);
2659 bool read_only = false;
2660 int i = call_expr_flags (t);
2662 /* Calls have side-effects, except those to const or pure functions. */
2663 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2664 side_effects = true;
2665 /* Propagate TREE_READONLY of arguments for const functions. */
2669 if (!side_effects || read_only)
2670 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2672 tree op = TREE_OPERAND (t, i);
2673 if (op && TREE_SIDE_EFFECTS (op))
2674 side_effects = true;
2675 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2679 TREE_SIDE_EFFECTS (t) = side_effects;
2680 TREE_READONLY (t) = read_only;
2683 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2684 or offset that depends on a field within a record. */
2687 contains_placeholder_p (const_tree exp)
2689 enum tree_code code;
2694 code = TREE_CODE (exp);
2695 if (code == PLACEHOLDER_EXPR)
2698 switch (TREE_CODE_CLASS (code))
2701 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2702 position computations since they will be converted into a
2703 WITH_RECORD_EXPR involving the reference, which will assume
2704 here will be valid. */
2705 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2707 case tcc_exceptional:
2708 if (code == TREE_LIST)
2709 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2710 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2715 case tcc_comparison:
2716 case tcc_expression:
2720 /* Ignoring the first operand isn't quite right, but works best. */
2721 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2724 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2725 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2726 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2729 /* The save_expr function never wraps anything containing
2730 a PLACEHOLDER_EXPR. */
2737 switch (TREE_CODE_LENGTH (code))
2740 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2742 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2743 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2754 const_call_expr_arg_iterator iter;
2755 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2756 if (CONTAINS_PLACEHOLDER_P (arg))
2770 /* Return true if any part of the computation of TYPE involves a
2771 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2772 (for QUAL_UNION_TYPE) and field positions. */
2775 type_contains_placeholder_1 (const_tree type)
2777 /* If the size contains a placeholder or the parent type (component type in
2778 the case of arrays) type involves a placeholder, this type does. */
2779 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2780 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2781 || (TREE_TYPE (type) != 0
2782 && type_contains_placeholder_p (TREE_TYPE (type))))
2785 /* Now do type-specific checks. Note that the last part of the check above
2786 greatly limits what we have to do below. */
2787 switch (TREE_CODE (type))
2795 case REFERENCE_TYPE:
2803 case FIXED_POINT_TYPE:
2804 /* Here we just check the bounds. */
2805 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2806 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2809 /* We're already checked the component type (TREE_TYPE), so just check
2811 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2815 case QUAL_UNION_TYPE:
2819 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2820 if (TREE_CODE (field) == FIELD_DECL
2821 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2822 || (TREE_CODE (type) == QUAL_UNION_TYPE
2823 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2824 || type_contains_placeholder_p (TREE_TYPE (field))))
2836 type_contains_placeholder_p (tree type)
2840 /* If the contains_placeholder_bits field has been initialized,
2841 then we know the answer. */
2842 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2843 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2845 /* Indicate that we've seen this type node, and the answer is false.
2846 This is what we want to return if we run into recursion via fields. */
2847 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2849 /* Compute the real value. */
2850 result = type_contains_placeholder_1 (type);
2852 /* Store the real value. */
2853 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2858 /* Push tree EXP onto vector QUEUE if it is not already present. */
2861 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2866 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2867 if (simple_cst_equal (iter, exp) == 1)
2871 VEC_safe_push (tree, heap, *queue, exp);
2874 /* Given a tree EXP, find all occurences of references to fields
2875 in a PLACEHOLDER_EXPR and place them in vector REFS without
2876 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2877 we assume here that EXP contains only arithmetic expressions
2878 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2882 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2884 enum tree_code code = TREE_CODE (exp);
2888 /* We handle TREE_LIST and COMPONENT_REF separately. */
2889 if (code == TREE_LIST)
2891 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2892 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2894 else if (code == COMPONENT_REF)
2896 for (inner = TREE_OPERAND (exp, 0);
2897 REFERENCE_CLASS_P (inner);
2898 inner = TREE_OPERAND (inner, 0))
2901 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2902 push_without_duplicates (exp, refs);
2904 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2907 switch (TREE_CODE_CLASS (code))
2912 case tcc_declaration:
2913 /* Variables allocated to static storage can stay. */
2914 if (!TREE_STATIC (exp))
2915 push_without_duplicates (exp, refs);
2918 case tcc_expression:
2919 /* This is the pattern built in ada/make_aligning_type. */
2920 if (code == ADDR_EXPR
2921 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2923 push_without_duplicates (exp, refs);
2927 /* Fall through... */
2929 case tcc_exceptional:
2932 case tcc_comparison:
2934 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2935 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2939 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2940 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2948 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2949 return a tree with all occurrences of references to F in a
2950 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2951 CONST_DECLs. Note that we assume here that EXP contains only
2952 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2953 occurring only in their argument list. */
2956 substitute_in_expr (tree exp, tree f, tree r)
2958 enum tree_code code = TREE_CODE (exp);
2959 tree op0, op1, op2, op3;
2962 /* We handle TREE_LIST and COMPONENT_REF separately. */
2963 if (code == TREE_LIST)
2965 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2966 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2967 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2970 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2972 else if (code == COMPONENT_REF)
2976 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2977 and it is the right field, replace it with R. */
2978 for (inner = TREE_OPERAND (exp, 0);
2979 REFERENCE_CLASS_P (inner);
2980 inner = TREE_OPERAND (inner, 0))
2984 op1 = TREE_OPERAND (exp, 1);
2986 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2989 /* If this expression hasn't been completed let, leave it alone. */
2990 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2993 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2994 if (op0 == TREE_OPERAND (exp, 0))
2998 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3001 switch (TREE_CODE_CLASS (code))
3006 case tcc_declaration:
3012 case tcc_expression:
3016 /* Fall through... */
3018 case tcc_exceptional:
3021 case tcc_comparison:
3023 switch (TREE_CODE_LENGTH (code))
3029 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3030 if (op0 == TREE_OPERAND (exp, 0))
3033 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3037 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3038 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3040 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3043 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3047 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3048 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3049 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3051 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3052 && op2 == TREE_OPERAND (exp, 2))
3055 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3059 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3060 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3061 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3062 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3064 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3065 && op2 == TREE_OPERAND (exp, 2)
3066 && op3 == TREE_OPERAND (exp, 3))
3070 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3082 new_tree = NULL_TREE;
3084 /* If we are trying to replace F with a constant, inline back
3085 functions which do nothing else than computing a value from
3086 the arguments they are passed. This makes it possible to
3087 fold partially or entirely the replacement expression. */
3088 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3090 tree t = maybe_inline_call_in_expr (exp);
3092 return SUBSTITUTE_IN_EXPR (t, f, r);
3095 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3097 tree op = TREE_OPERAND (exp, i);
3098 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3102 new_tree = copy_node (exp);
3103 TREE_OPERAND (new_tree, i) = new_op;
3109 new_tree = fold (new_tree);
3110 if (TREE_CODE (new_tree) == CALL_EXPR)
3111 process_call_operands (new_tree);
3122 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3126 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3127 for it within OBJ, a tree that is an object or a chain of references. */
3130 substitute_placeholder_in_expr (tree exp, tree obj)
3132 enum tree_code code = TREE_CODE (exp);
3133 tree op0, op1, op2, op3;
3136 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3137 in the chain of OBJ. */
3138 if (code == PLACEHOLDER_EXPR)
3140 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3143 for (elt = obj; elt != 0;
3144 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3145 || TREE_CODE (elt) == COND_EXPR)
3146 ? TREE_OPERAND (elt, 1)
3147 : (REFERENCE_CLASS_P (elt)
3148 || UNARY_CLASS_P (elt)
3149 || BINARY_CLASS_P (elt)
3150 || VL_EXP_CLASS_P (elt)
3151 || EXPRESSION_CLASS_P (elt))
3152 ? TREE_OPERAND (elt, 0) : 0))
3153 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3156 for (elt = obj; elt != 0;
3157 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3158 || TREE_CODE (elt) == COND_EXPR)
3159 ? TREE_OPERAND (elt, 1)
3160 : (REFERENCE_CLASS_P (elt)
3161 || UNARY_CLASS_P (elt)
3162 || BINARY_CLASS_P (elt)
3163 || VL_EXP_CLASS_P (elt)
3164 || EXPRESSION_CLASS_P (elt))
3165 ? TREE_OPERAND (elt, 0) : 0))
3166 if (POINTER_TYPE_P (TREE_TYPE (elt))
3167 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3169 return fold_build1 (INDIRECT_REF, need_type, elt);
3171 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3172 survives until RTL generation, there will be an error. */
3176 /* TREE_LIST is special because we need to look at TREE_VALUE
3177 and TREE_CHAIN, not TREE_OPERANDS. */
3178 else if (code == TREE_LIST)
3180 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3181 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3182 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3185 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3188 switch (TREE_CODE_CLASS (code))
3191 case tcc_declaration:
3194 case tcc_exceptional:
3197 case tcc_comparison:
3198 case tcc_expression:
3201 switch (TREE_CODE_LENGTH (code))
3207 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3208 if (op0 == TREE_OPERAND (exp, 0))
3211 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3215 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3216 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3218 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3221 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3225 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3226 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3227 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3229 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3230 && op2 == TREE_OPERAND (exp, 2))
3233 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3237 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3238 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3239 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3240 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3242 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3243 && op2 == TREE_OPERAND (exp, 2)
3244 && op3 == TREE_OPERAND (exp, 3))
3248 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3260 new_tree = NULL_TREE;
3262 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3264 tree op = TREE_OPERAND (exp, i);
3265 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3269 new_tree = copy_node (exp);
3270 TREE_OPERAND (new_tree, i) = new_op;
3276 new_tree = fold (new_tree);
3277 if (TREE_CODE (new_tree) == CALL_EXPR)
3278 process_call_operands (new_tree);
3289 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3293 /* Stabilize a reference so that we can use it any number of times
3294 without causing its operands to be evaluated more than once.
3295 Returns the stabilized reference. This works by means of save_expr,
3296 so see the caveats in the comments about save_expr.
3298 Also allows conversion expressions whose operands are references.
3299 Any other kind of expression is returned unchanged. */
3302 stabilize_reference (tree ref)
3305 enum tree_code code = TREE_CODE (ref);
3312 /* No action is needed in this case. */
3317 case FIX_TRUNC_EXPR:
3318 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3322 result = build_nt (INDIRECT_REF,
3323 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3327 result = build_nt (COMPONENT_REF,
3328 stabilize_reference (TREE_OPERAND (ref, 0)),
3329 TREE_OPERAND (ref, 1), NULL_TREE);
3333 result = build_nt (BIT_FIELD_REF,
3334 stabilize_reference (TREE_OPERAND (ref, 0)),
3335 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3336 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3340 result = build_nt (ARRAY_REF,
3341 stabilize_reference (TREE_OPERAND (ref, 0)),
3342 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3343 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3346 case ARRAY_RANGE_REF:
3347 result = build_nt (ARRAY_RANGE_REF,
3348 stabilize_reference (TREE_OPERAND (ref, 0)),
3349 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3350 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3354 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3355 it wouldn't be ignored. This matters when dealing with
3357 return stabilize_reference_1 (ref);
3359 /* If arg isn't a kind of lvalue we recognize, make no change.
3360 Caller should recognize the error for an invalid lvalue. */
3365 return error_mark_node;
3368 TREE_TYPE (result) = TREE_TYPE (ref);
3369 TREE_READONLY (result) = TREE_READONLY (ref);
3370 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3371 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3376 /* Subroutine of stabilize_reference; this is called for subtrees of
3377 references. Any expression with side-effects must be put in a SAVE_EXPR
3378 to ensure that it is only evaluated once.
3380 We don't put SAVE_EXPR nodes around everything, because assigning very
3381 simple expressions to temporaries causes us to miss good opportunities
3382 for optimizations. Among other things, the opportunity to fold in the
3383 addition of a constant into an addressing mode often gets lost, e.g.
3384 "y[i+1] += x;". In general, we take the approach that we should not make
3385 an assignment unless we are forced into it - i.e., that any non-side effect
3386 operator should be allowed, and that cse should take care of coalescing
3387 multiple utterances of the same expression should that prove fruitful. */
3390 stabilize_reference_1 (tree e)
3393 enum tree_code code = TREE_CODE (e);
3395 /* We cannot ignore const expressions because it might be a reference
3396 to a const array but whose index contains side-effects. But we can
3397 ignore things that are actual constant or that already have been
3398 handled by this function. */
3400 if (tree_invariant_p (e))
3403 switch (TREE_CODE_CLASS (code))
3405 case tcc_exceptional:
3407 case tcc_declaration:
3408 case tcc_comparison:
3410 case tcc_expression:
3413 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3414 so that it will only be evaluated once. */
3415 /* The reference (r) and comparison (<) classes could be handled as
3416 below, but it is generally faster to only evaluate them once. */
3417 if (TREE_SIDE_EFFECTS (e))
3418 return save_expr (e);
3422 /* Constants need no processing. In fact, we should never reach
3427 /* Division is slow and tends to be compiled with jumps,
3428 especially the division by powers of 2 that is often
3429 found inside of an array reference. So do it just once. */
3430 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3431 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3432 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3433 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3434 return save_expr (e);
3435 /* Recursively stabilize each operand. */
3436 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3437 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3441 /* Recursively stabilize each operand. */
3442 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3449 TREE_TYPE (result) = TREE_TYPE (e);
3450 TREE_READONLY (result) = TREE_READONLY (e);
3451 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3452 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3457 /* Low-level constructors for expressions. */
3459 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3460 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3463 recompute_tree_invariant_for_addr_expr (tree t)
3466 bool tc = true, se = false;
3468 /* We started out assuming this address is both invariant and constant, but
3469 does not have side effects. Now go down any handled components and see if
3470 any of them involve offsets that are either non-constant or non-invariant.
3471 Also check for side-effects.
3473 ??? Note that this code makes no attempt to deal with the case where
3474 taking the address of something causes a copy due to misalignment. */
3476 #define UPDATE_FLAGS(NODE) \
3477 do { tree _node = (NODE); \
3478 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3479 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3481 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3482 node = TREE_OPERAND (node, 0))
3484 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3485 array reference (probably made temporarily by the G++ front end),
3486 so ignore all the operands. */
3487 if ((TREE_CODE (node) == ARRAY_REF
3488 || TREE_CODE (node) == ARRAY_RANGE_REF)
3489 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3491 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3492 if (TREE_OPERAND (node, 2))
3493 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3494 if (TREE_OPERAND (node, 3))
3495 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3497 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3498 FIELD_DECL, apparently. The G++ front end can put something else
3499 there, at least temporarily. */
3500 else if (TREE_CODE (node) == COMPONENT_REF
3501 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3503 if (TREE_OPERAND (node, 2))
3504 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3506 else if (TREE_CODE (node) == BIT_FIELD_REF)
3507 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3510 node = lang_hooks.expr_to_decl (node, &tc, &se);
3512 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3513 the address, since &(*a)->b is a form of addition. If it's a constant, the
3514 address is constant too. If it's a decl, its address is constant if the
3515 decl is static. Everything else is not constant and, furthermore,
3516 taking the address of a volatile variable is not volatile. */
3517 if (TREE_CODE (node) == INDIRECT_REF)
3518 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3519 else if (CONSTANT_CLASS_P (node))
3521 else if (DECL_P (node))
3522 tc &= (staticp (node) != NULL_TREE);
3526 se |= TREE_SIDE_EFFECTS (node);
3530 TREE_CONSTANT (t) = tc;
3531 TREE_SIDE_EFFECTS (t) = se;
3535 /* Build an expression of code CODE, data type TYPE, and operands as
3536 specified. Expressions and reference nodes can be created this way.
3537 Constants, decls, types and misc nodes cannot be.
3539 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3540 enough for all extant tree codes. */
3543 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3547 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3549 t = make_node_stat (code PASS_MEM_STAT);
3556 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3558 int length = sizeof (struct tree_exp);
3559 #ifdef GATHER_STATISTICS
3560 tree_node_kind kind;
3564 #ifdef GATHER_STATISTICS
3565 switch (TREE_CODE_CLASS (code))
3567 case tcc_statement: /* an expression with side effects */
3570 case tcc_reference: /* a reference */
3578 tree_node_counts[(int) kind]++;
3579 tree_node_sizes[(int) kind] += length;
3582 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3584 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3586 memset (t, 0, sizeof (struct tree_common));
3588 TREE_SET_CODE (t, code);
3590 TREE_TYPE (t) = type;
3591 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3592 TREE_OPERAND (t, 0) = node;
3593 TREE_BLOCK (t) = NULL_TREE;
3594 if (node && !TYPE_P (node))
3596 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3597 TREE_READONLY (t) = TREE_READONLY (node);
3600 if (TREE_CODE_CLASS (code) == tcc_statement)
3601 TREE_SIDE_EFFECTS (t) = 1;
3605 /* All of these have side-effects, no matter what their
3607 TREE_SIDE_EFFECTS (t) = 1;
3608 TREE_READONLY (t) = 0;
3611 case MISALIGNED_INDIRECT_REF:
3612 case ALIGN_INDIRECT_REF:
3614 /* Whether a dereference is readonly has nothing to do with whether
3615 its operand is readonly. */
3616 TREE_READONLY (t) = 0;
3621 recompute_tree_invariant_for_addr_expr (t);
3625 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3626 && node && !TYPE_P (node)
3627 && TREE_CONSTANT (node))
3628 TREE_CONSTANT (t) = 1;
3629 if (TREE_CODE_CLASS (code) == tcc_reference
3630 && node && TREE_THIS_VOLATILE (node))
3631 TREE_THIS_VOLATILE (t) = 1;
3638 #define PROCESS_ARG(N) \
3640 TREE_OPERAND (t, N) = arg##N; \
3641 if (arg##N &&!TYPE_P (arg##N)) \
3643 if (TREE_SIDE_EFFECTS (arg##N)) \
3645 if (!TREE_READONLY (arg##N) \
3646 && !CONSTANT_CLASS_P (arg##N)) \
3648 if (!TREE_CONSTANT (arg##N)) \
3654 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3656 bool constant, read_only, side_effects;
3659 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3661 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3662 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3663 /* When sizetype precision doesn't match that of pointers
3664 we need to be able to build explicit extensions or truncations
3665 of the offset argument. */
3666 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3667 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3668 && TREE_CODE (arg1) == INTEGER_CST);
3670 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3671 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3672 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3673 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3675 t = make_node_stat (code PASS_MEM_STAT);
3678 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3679 result based on those same flags for the arguments. But if the
3680 arguments aren't really even `tree' expressions, we shouldn't be trying
3683 /* Expressions without side effects may be constant if their
3684 arguments are as well. */
3685 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3686 || TREE_CODE_CLASS (code) == tcc_binary);
3688 side_effects = TREE_SIDE_EFFECTS (t);
3693 TREE_READONLY (t) = read_only;
3694 TREE_CONSTANT (t) = constant;
3695 TREE_SIDE_EFFECTS (t) = side_effects;
3696 TREE_THIS_VOLATILE (t)
3697 = (TREE_CODE_CLASS (code) == tcc_reference
3698 && arg0 && TREE_THIS_VOLATILE (arg0));
3705 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3706 tree arg2 MEM_STAT_DECL)
3708 bool constant, read_only, side_effects;
3711 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3712 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3714 t = make_node_stat (code PASS_MEM_STAT);
3719 /* As a special exception, if COND_EXPR has NULL branches, we
3720 assume that it is a gimple statement and always consider
3721 it to have side effects. */
3722 if (code == COND_EXPR
3723 && tt == void_type_node
3724 && arg1 == NULL_TREE
3725 && arg2 == NULL_TREE)
3726 side_effects = true;
3728 side_effects = TREE_SIDE_EFFECTS (t);
3734 if (code == COND_EXPR)
3735 TREE_READONLY (t) = read_only;
3737 TREE_SIDE_EFFECTS (t) = side_effects;
3738 TREE_THIS_VOLATILE (t)
3739 = (TREE_CODE_CLASS (code) == tcc_reference
3740 && arg0 && TREE_THIS_VOLATILE (arg0));
3746 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3747 tree arg2, tree arg3 MEM_STAT_DECL)
3749 bool constant, read_only, side_effects;
3752 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3754 t = make_node_stat (code PASS_MEM_STAT);
3757 side_effects = TREE_SIDE_EFFECTS (t);
3764 TREE_SIDE_EFFECTS (t) = side_effects;
3765 TREE_THIS_VOLATILE (t)
3766 = (TREE_CODE_CLASS (code) == tcc_reference
3767 && arg0 && TREE_THIS_VOLATILE (arg0));
3773 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3774 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3776 bool constant, read_only, side_effects;
3779 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3781 t = make_node_stat (code PASS_MEM_STAT);
3784 side_effects = TREE_SIDE_EFFECTS (t);
3792 TREE_SIDE_EFFECTS (t) = side_effects;
3793 TREE_THIS_VOLATILE (t)
3794 = (TREE_CODE_CLASS (code) == tcc_reference
3795 && arg0 && TREE_THIS_VOLATILE (arg0));
3801 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3802 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3804 bool constant, read_only, side_effects;
3807 gcc_assert (code == TARGET_MEM_REF);
3809 t = make_node_stat (code PASS_MEM_STAT);
3812 side_effects = TREE_SIDE_EFFECTS (t);
3821 TREE_SIDE_EFFECTS (t) = side_effects;
3822 TREE_THIS_VOLATILE (t) = 0;
3827 /* Similar except don't specify the TREE_TYPE
3828 and leave the TREE_SIDE_EFFECTS as 0.
3829 It is permissible for arguments to be null,
3830 or even garbage if their values do not matter. */
3833 build_nt (enum tree_code code, ...)
3840 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3844 t = make_node (code);
3845 length = TREE_CODE_LENGTH (code);
3847 for (i = 0; i < length; i++)
3848 TREE_OPERAND (t, i) = va_arg (p, tree);
3854 /* Similar to build_nt, but for creating a CALL_EXPR object with
3855 ARGLIST passed as a list. */
3858 build_nt_call_list (tree fn, tree arglist)
3863 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3864 CALL_EXPR_FN (t) = fn;
3865 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3866 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3867 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3871 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3875 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3880 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3881 CALL_EXPR_FN (ret) = fn;
3882 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3883 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3884 CALL_EXPR_ARG (ret, ix) = t;
3888 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3889 We do NOT enter this node in any sort of symbol table.
3891 LOC is the location of the decl.
3893 layout_decl is used to set up the decl's storage layout.
3894 Other slots are initialized to 0 or null pointers. */
3897 build_decl_stat (location_t loc, enum tree_code code, tree name,
3898 tree type MEM_STAT_DECL)
3902 t = make_node_stat (code PASS_MEM_STAT);
3903 DECL_SOURCE_LOCATION (t) = loc;
3905 /* if (type == error_mark_node)
3906 type = integer_type_node; */
3907 /* That is not done, deliberately, so that having error_mark_node
3908 as the type can suppress useless errors in the use of this variable. */
3910 DECL_NAME (t) = name;
3911 TREE_TYPE (t) = type;
3913 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3919 /* Builds and returns function declaration with NAME and TYPE. */
3922 build_fn_decl (const char *name, tree type)
3924 tree id = get_identifier (name);
3925 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3927 DECL_EXTERNAL (decl) = 1;
3928 TREE_PUBLIC (decl) = 1;
3929 DECL_ARTIFICIAL (decl) = 1;
3930 TREE_NOTHROW (decl) = 1;
3936 /* BLOCK nodes are used to represent the structure of binding contours
3937 and declarations, once those contours have been exited and their contents
3938 compiled. This information is used for outputting debugging info. */
3941 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3943 tree block = make_node (BLOCK);
3945 BLOCK_VARS (block) = vars;
3946 BLOCK_SUBBLOCKS (block) = subblocks;
3947 BLOCK_SUPERCONTEXT (block) = supercontext;
3948 BLOCK_CHAIN (block) = chain;
3953 expand_location (source_location loc)
3955 expanded_location xloc;
3956 if (loc <= BUILTINS_LOCATION)
3958 xloc.file = loc == UNKNOWN_LOCATION ? NULL : _("<built-in>");
3965 const struct line_map *map = linemap_lookup (line_table, loc);
3966 xloc.file = map->to_file;
3967 xloc.line = SOURCE_LINE (map, loc);
3968 xloc.column = SOURCE_COLUMN (map, loc);
3969 xloc.sysp = map->sysp != 0;
3975 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3977 LOC is the location to use in tree T. */
3980 protected_set_expr_location (tree t, location_t loc)
3982 if (t && CAN_HAVE_LOCATION_P (t))
3983 SET_EXPR_LOCATION (t, loc);
3986 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3990 build_decl_attribute_variant (tree ddecl, tree attribute)
3992 DECL_ATTRIBUTES (ddecl) = attribute;
3996 /* Borrowed from hashtab.c iterative_hash implementation. */
3997 #define mix(a,b,c) \
3999 a -= b; a -= c; a ^= (c>>13); \
4000 b -= c; b -= a; b ^= (a<< 8); \
4001 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4002 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4003 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4004 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4005 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4006 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4007 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4011 /* Produce good hash value combining VAL and VAL2. */
4013 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4015 /* the golden ratio; an arbitrary value. */
4016 hashval_t a = 0x9e3779b9;
4022 /* Produce good hash value combining VAL and VAL2. */
4024 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4026 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4027 return iterative_hash_hashval_t (val, val2);
4030 hashval_t a = (hashval_t) val;
4031 /* Avoid warnings about shifting of more than the width of the type on
4032 hosts that won't execute this path. */
4034 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4036 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4038 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4039 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4046 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4047 is ATTRIBUTE and its qualifiers are QUALS.
4049 Record such modified types already made so we don't make duplicates. */
4052 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4054 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4056 hashval_t hashcode = 0;
4058 enum tree_code code = TREE_CODE (ttype);
4060 /* Building a distinct copy of a tagged type is inappropriate; it
4061 causes breakage in code that expects there to be a one-to-one
4062 relationship between a struct and its fields.
4063 build_duplicate_type is another solution (as used in
4064 handle_transparent_union_attribute), but that doesn't play well
4065 with the stronger C++ type identity model. */
4066 if (TREE_CODE (ttype) == RECORD_TYPE
4067 || TREE_CODE (ttype) == UNION_TYPE
4068 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4069 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4071 warning (OPT_Wattributes,
4072 "ignoring attributes applied to %qT after definition",
4073 TYPE_MAIN_VARIANT (ttype));
4074 return build_qualified_type (ttype, quals);
4077 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4078 ntype = build_distinct_type_copy (ttype);
4080 TYPE_ATTRIBUTES (ntype) = attribute;
4082 hashcode = iterative_hash_object (code, hashcode);
4083 if (TREE_TYPE (ntype))
4084 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4086 hashcode = attribute_hash_list (attribute, hashcode);
4088 switch (TREE_CODE (ntype))
4091 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4094 if (TYPE_DOMAIN (ntype))
4095 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4099 hashcode = iterative_hash_object
4100 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4101 hashcode = iterative_hash_object
4102 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4105 case FIXED_POINT_TYPE:
4107 unsigned int precision = TYPE_PRECISION (ntype);
4108 hashcode = iterative_hash_object (precision, hashcode);
4115 ntype = type_hash_canon (hashcode, ntype);
4117 /* If the target-dependent attributes make NTYPE different from
4118 its canonical type, we will need to use structural equality
4119 checks for this type. */
4120 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4121 || !targetm.comp_type_attributes (ntype, ttype))
4122 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4123 else if (TYPE_CANONICAL (ntype) == ntype)
4124 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4126 ttype = build_qualified_type (ntype, quals);
4128 else if (TYPE_QUALS (ttype) != quals)
4129 ttype = build_qualified_type (ttype, quals);
4135 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4138 Record such modified types already made so we don't make duplicates. */
4141 build_type_attribute_variant (tree ttype, tree attribute)
4143 return build_type_attribute_qual_variant (ttype, attribute,
4144 TYPE_QUALS (ttype));
4148 /* Reset all the fields in a binfo node BINFO. We only keep
4149 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4152 free_lang_data_in_binfo (tree binfo)
4157 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4159 BINFO_OFFSET (binfo) = NULL_TREE;
4160 BINFO_VTABLE (binfo) = NULL_TREE;
4161 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4162 BINFO_BASE_ACCESSES (binfo) = NULL;
4163 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4164 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4165 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4167 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4168 free_lang_data_in_binfo (t);
4172 /* Reset all language specific information still present in TYPE. */
4175 free_lang_data_in_type (tree type)
4177 gcc_assert (TYPE_P (type));
4179 /* Fill in the alias-set. We need to at least track zeroness here
4181 if (lang_hooks.get_alias_set (type) == 0)
4182 TYPE_ALIAS_SET (type) = 0;
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 TYPE_STUB_DECL (type) = NULL_TREE;
4269 /* Return true if DECL may need an assembler name to be set. */
4272 need_assembler_name_p (tree decl)
4274 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4275 if (TREE_CODE (decl) != FUNCTION_DECL
4276 && TREE_CODE (decl) != VAR_DECL)
4279 /* If DECL already has its assembler name set, it does not need a
4281 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4282 || DECL_ASSEMBLER_NAME_SET_P (decl))
4285 /* For VAR_DECLs, only static, public and external symbols need an
4287 if (TREE_CODE (decl) == VAR_DECL
4288 && !TREE_STATIC (decl)
4289 && !TREE_PUBLIC (decl)
4290 && !DECL_EXTERNAL (decl))
4293 if (TREE_CODE (decl) == FUNCTION_DECL)
4295 /* Do not set assembler name on builtins. Allow RTL expansion to
4296 decide whether to expand inline or via a regular call. */
4297 if (DECL_BUILT_IN (decl)
4298 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4301 /* Functions represented in the callgraph need an assembler name. */
4302 if (cgraph_node_for_decl (decl) != NULL)
4305 /* Unused and not public functions don't need an assembler name. */
4306 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4314 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4315 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4316 in BLOCK that is not in LOCALS is removed. */
4319 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4323 tp = &BLOCK_VARS (block);
4326 if (!pointer_set_contains (locals, *tp))
4327 *tp = TREE_CHAIN (*tp);
4329 tp = &TREE_CHAIN (*tp);
4332 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4333 free_lang_data_in_block (fn, t, locals);
4337 /* Reset all language specific information still present in symbol
4341 free_lang_data_in_decl (tree decl)
4343 gcc_assert (DECL_P (decl));
4345 /* Give the FE a chance to remove its own data first. */
4346 lang_hooks.free_lang_data (decl);
4348 TREE_LANG_FLAG_0 (decl) = 0;
4349 TREE_LANG_FLAG_1 (decl) = 0;
4350 TREE_LANG_FLAG_2 (decl) = 0;
4351 TREE_LANG_FLAG_3 (decl) = 0;
4352 TREE_LANG_FLAG_4 (decl) = 0;
4353 TREE_LANG_FLAG_5 (decl) = 0;
4354 TREE_LANG_FLAG_6 (decl) = 0;
4356 /* Identifiers need not have a type. */
4357 if (DECL_NAME (decl))
4358 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4360 /* Ignore any intervening types, because we are going to clear their
4361 TYPE_CONTEXT fields. */
4362 if (TREE_CODE (decl) != FIELD_DECL)
4363 DECL_CONTEXT (decl) = decl_function_context (decl);
4365 if (DECL_CONTEXT (decl)
4366 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4367 DECL_CONTEXT (decl) = NULL_TREE;
4369 if (TREE_CODE (decl) == VAR_DECL)
4371 tree context = DECL_CONTEXT (decl);
4375 enum tree_code code = TREE_CODE (context);
4376 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4378 /* Do not clear the decl context here, that will promote
4379 all vars to global ones. */
4380 DECL_INITIAL (decl) = NULL_TREE;
4383 if (TREE_STATIC (decl))
4384 DECL_CONTEXT (decl) = NULL_TREE;
4388 if (TREE_CODE (decl) == PARM_DECL
4389 || TREE_CODE (decl) == FIELD_DECL
4390 || TREE_CODE (decl) == RESULT_DECL)
4392 tree unit_size = DECL_SIZE_UNIT (decl);
4393 tree size = DECL_SIZE (decl);
4394 if ((unit_size && TREE_CODE (unit_size) != INTEGER_CST)
4395 || (size && TREE_CODE (size) != INTEGER_CST))
4397 DECL_SIZE_UNIT (decl) = NULL_TREE;
4398 DECL_SIZE (decl) = NULL_TREE;
4401 if (TREE_CODE (decl) == FIELD_DECL
4402 && DECL_FIELD_OFFSET (decl)
4403 && TREE_CODE (DECL_FIELD_OFFSET (decl)) != INTEGER_CST)
4404 DECL_FIELD_OFFSET (decl) = NULL_TREE;
4406 /* DECL_FCONTEXT is only used for debug info generation. */
4407 if (TREE_CODE (decl) == FIELD_DECL)
4408 DECL_FCONTEXT (decl) = NULL_TREE;
4410 else if (TREE_CODE (decl) == FUNCTION_DECL)
4412 if (gimple_has_body_p (decl))
4415 struct pointer_set_t *locals;
4417 /* If DECL has a gimple body, then the context for its
4418 arguments must be DECL. Otherwise, it doesn't really
4419 matter, as we will not be emitting any code for DECL. In
4420 general, there may be other instances of DECL created by
4421 the front end and since PARM_DECLs are generally shared,
4422 their DECL_CONTEXT changes as the replicas of DECL are
4423 created. The only time where DECL_CONTEXT is important
4424 is for the FUNCTION_DECLs that have a gimple body (since
4425 the PARM_DECL will be used in the function's body). */
4426 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4427 DECL_CONTEXT (t) = decl;
4429 /* Collect all the symbols declared in DECL. */
4430 locals = pointer_set_create ();
4431 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4432 for (; t; t = TREE_CHAIN (t))
4434 pointer_set_insert (locals, TREE_VALUE (t));
4436 /* All the local symbols should have DECL as their
4438 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4441 /* Get rid of any decl not in local_decls. */
4442 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4444 pointer_set_destroy (locals);
4447 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4448 At this point, it is not needed anymore. */
4449 DECL_SAVED_TREE (decl) = NULL_TREE;
4451 else if (TREE_CODE (decl) == VAR_DECL)
4453 tree expr = DECL_DEBUG_EXPR (decl);
4455 && TREE_CODE (expr) == VAR_DECL
4456 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4457 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4459 if (DECL_EXTERNAL (decl)
4460 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4461 DECL_INITIAL (decl) = NULL_TREE;
4463 else if (TREE_CODE (decl) == TYPE_DECL)
4465 DECL_INITIAL (decl) = NULL_TREE;
4467 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4468 FIELD_DECLs, which should be preserved. Otherwise,
4469 we shouldn't be concerned with source-level lexical
4470 nesting beyond this point. */
4471 DECL_CONTEXT (decl) = NULL_TREE;
4476 /* Data used when collecting DECLs and TYPEs for language data removal. */
4478 struct free_lang_data_d
4480 /* Worklist to avoid excessive recursion. */
4481 VEC(tree,heap) *worklist;
4483 /* Set of traversed objects. Used to avoid duplicate visits. */
4484 struct pointer_set_t *pset;
4486 /* Array of symbols to process with free_lang_data_in_decl. */
4487 VEC(tree,heap) *decls;
4489 /* Array of types to process with free_lang_data_in_type. */
4490 VEC(tree,heap) *types;
4494 /* Save all language fields needed to generate proper debug information
4495 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4498 save_debug_info_for_decl (tree t)
4500 /*struct saved_debug_info_d *sdi;*/
4502 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4504 /* FIXME. Partial implementation for saving debug info removed. */
4508 /* Save all language fields needed to generate proper debug information
4509 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4512 save_debug_info_for_type (tree t)
4514 /*struct saved_debug_info_d *sdi;*/
4516 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4518 /* FIXME. Partial implementation for saving debug info removed. */
4522 /* Add type or decl T to one of the list of tree nodes that need their
4523 language data removed. The lists are held inside FLD. */
4526 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4530 VEC_safe_push (tree, heap, fld->decls, t);
4531 if (debug_info_level > DINFO_LEVEL_TERSE)
4532 save_debug_info_for_decl (t);
4534 else if (TYPE_P (t))
4536 VEC_safe_push (tree, heap, fld->types, t);
4537 if (debug_info_level > DINFO_LEVEL_TERSE)
4538 save_debug_info_for_type (t);
4544 /* Push tree node T into FLD->WORKLIST. */
4547 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4549 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4550 VEC_safe_push (tree, heap, fld->worklist, (t));
4554 /* Operand callback helper for free_lang_data_in_node. *TP is the
4555 subtree operand being considered. */
4558 find_decls_types_r (tree *tp, int *ws, void *data)
4561 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4563 if (TREE_CODE (t) == TREE_LIST)
4566 /* Language specific nodes will be removed, so there is no need
4567 to gather anything under them. */
4568 if (is_lang_specific (t))
4576 /* Note that walk_tree does not traverse every possible field in
4577 decls, so we have to do our own traversals here. */
4578 add_tree_to_fld_list (t, fld);
4580 fld_worklist_push (DECL_NAME (t), fld);
4581 fld_worklist_push (DECL_CONTEXT (t), fld);
4582 fld_worklist_push (DECL_SIZE (t), fld);
4583 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4585 /* We are going to remove everything under DECL_INITIAL for
4586 TYPE_DECLs. No point walking them. */
4587 if (TREE_CODE (t) != TYPE_DECL)
4588 fld_worklist_push (DECL_INITIAL (t), fld);
4590 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4591 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4593 if (TREE_CODE (t) == FUNCTION_DECL)
4595 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4596 fld_worklist_push (DECL_RESULT (t), fld);
4598 else if (TREE_CODE (t) == TYPE_DECL)
4600 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4601 fld_worklist_push (DECL_VINDEX (t), fld);
4603 else if (TREE_CODE (t) == FIELD_DECL)
4605 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4606 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4607 fld_worklist_push (DECL_QUALIFIER (t), fld);
4608 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4609 fld_worklist_push (DECL_FCONTEXT (t), fld);
4611 else if (TREE_CODE (t) == VAR_DECL)
4613 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4614 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4617 if (TREE_CODE (t) != FIELD_DECL)
4618 fld_worklist_push (TREE_CHAIN (t), fld);
4621 else if (TYPE_P (t))
4623 /* Note that walk_tree does not traverse every possible field in
4624 types, so we have to do our own traversals here. */
4625 add_tree_to_fld_list (t, fld);
4627 if (!RECORD_OR_UNION_TYPE_P (t))
4628 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4629 fld_worklist_push (TYPE_SIZE (t), fld);
4630 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4631 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4632 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4633 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4634 fld_worklist_push (TYPE_NAME (t), fld);
4635 fld_worklist_push (TYPE_MINVAL (t), fld);
4636 if (!RECORD_OR_UNION_TYPE_P (t))
4637 fld_worklist_push (TYPE_MAXVAL (t), fld);
4638 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4639 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4640 fld_worklist_push (TYPE_CONTEXT (t), fld);
4641 fld_worklist_push (TYPE_CANONICAL (t), fld);
4643 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4647 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4649 fld_worklist_push (TREE_TYPE (tem), fld);
4650 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4652 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4653 && TREE_CODE (tem) == TREE_LIST)
4656 fld_worklist_push (TREE_VALUE (tem), fld);
4657 tem = TREE_CHAIN (tem);
4661 if (RECORD_OR_UNION_TYPE_P (t))
4664 /* Push all TYPE_FIELDS - there can be interleaving interesting
4665 and non-interesting things. */
4666 tem = TYPE_FIELDS (t);
4669 if (TREE_CODE (tem) == FIELD_DECL)
4670 fld_worklist_push (tem, fld);
4671 tem = TREE_CHAIN (tem);
4675 fld_worklist_push (TREE_CHAIN (t), fld);
4679 fld_worklist_push (TREE_TYPE (t), fld);
4685 /* Find decls and types in T. */
4688 find_decls_types (tree t, struct free_lang_data_d *fld)
4692 if (!pointer_set_contains (fld->pset, t))
4693 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4694 if (VEC_empty (tree, fld->worklist))
4696 t = VEC_pop (tree, fld->worklist);
4700 /* Translate all the types in LIST with the corresponding runtime
4704 get_eh_types_for_runtime (tree list)
4708 if (list == NULL_TREE)
4711 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4713 list = TREE_CHAIN (list);
4716 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4717 TREE_CHAIN (prev) = n;
4718 prev = TREE_CHAIN (prev);
4719 list = TREE_CHAIN (list);
4726 /* Find decls and types referenced in EH region R and store them in
4727 FLD->DECLS and FLD->TYPES. */
4730 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4741 /* The types referenced in each catch must first be changed to the
4742 EH types used at runtime. This removes references to FE types
4744 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4746 c->type_list = get_eh_types_for_runtime (c->type_list);
4747 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4752 case ERT_ALLOWED_EXCEPTIONS:
4753 r->u.allowed.type_list
4754 = get_eh_types_for_runtime (r->u.allowed.type_list);
4755 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4758 case ERT_MUST_NOT_THROW:
4759 walk_tree (&r->u.must_not_throw.failure_decl,
4760 find_decls_types_r, fld, fld->pset);
4766 /* Find decls and types referenced in cgraph node N and store them in
4767 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4768 look for *every* kind of DECL and TYPE node reachable from N,
4769 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4770 NAMESPACE_DECLs, etc). */
4773 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4776 struct function *fn;
4779 find_decls_types (n->decl, fld);
4781 if (!gimple_has_body_p (n->decl))
4784 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4786 fn = DECL_STRUCT_FUNCTION (n->decl);
4788 /* Traverse locals. */
4789 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4790 find_decls_types (TREE_VALUE (t), fld);
4792 /* Traverse EH regions in FN. */
4795 FOR_ALL_EH_REGION_FN (r, fn)
4796 find_decls_types_in_eh_region (r, fld);
4799 /* Traverse every statement in FN. */
4800 FOR_EACH_BB_FN (bb, fn)
4802 gimple_stmt_iterator si;
4805 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4807 gimple phi = gsi_stmt (si);
4809 for (i = 0; i < gimple_phi_num_args (phi); i++)
4811 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4812 find_decls_types (*arg_p, fld);
4816 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4818 gimple stmt = gsi_stmt (si);
4820 for (i = 0; i < gimple_num_ops (stmt); i++)
4822 tree arg = gimple_op (stmt, i);
4823 find_decls_types (arg, fld);
4830 /* Find decls and types referenced in varpool node N and store them in
4831 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4832 look for *every* kind of DECL and TYPE node reachable from N,
4833 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4834 NAMESPACE_DECLs, etc). */
4837 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4839 find_decls_types (v->decl, fld);
4843 /* Free language specific information for every operand and expression
4844 in every node of the call graph. This process operates in three stages:
4846 1- Every callgraph node and varpool node is traversed looking for
4847 decls and types embedded in them. This is a more exhaustive
4848 search than that done by find_referenced_vars, because it will
4849 also collect individual fields, decls embedded in types, etc.
4851 2- All the decls found are sent to free_lang_data_in_decl.
4853 3- All the types found are sent to free_lang_data_in_type.
4855 The ordering between decls and types is important because
4856 free_lang_data_in_decl sets assembler names, which includes
4857 mangling. So types cannot be freed up until assembler names have
4861 free_lang_data_in_cgraph (void)
4863 struct cgraph_node *n;
4864 struct varpool_node *v;
4865 struct free_lang_data_d fld;
4870 /* Initialize sets and arrays to store referenced decls and types. */
4871 fld.pset = pointer_set_create ();
4872 fld.worklist = NULL;
4873 fld.decls = VEC_alloc (tree, heap, 100);
4874 fld.types = VEC_alloc (tree, heap, 100);
4876 /* Find decls and types in the body of every function in the callgraph. */
4877 for (n = cgraph_nodes; n; n = n->next)
4878 find_decls_types_in_node (n, &fld);
4880 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4881 find_decls_types (p->decl, &fld);
4883 /* Find decls and types in every varpool symbol. */
4884 for (v = varpool_nodes_queue; v; v = v->next_needed)
4885 find_decls_types_in_var (v, &fld);
4887 /* Set the assembler name on every decl found. We need to do this
4888 now because free_lang_data_in_decl will invalidate data needed
4889 for mangling. This breaks mangling on interdependent decls. */
4890 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4891 if (need_assembler_name_p (t))
4893 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4894 diagnostics that use input_location to show locus
4895 information. The problem here is that, at this point,
4896 input_location is generally anchored to the end of the file
4897 (since the parser is long gone), so we don't have a good
4898 position to pin it to.
4900 To alleviate this problem, this uses the location of T's
4901 declaration. Examples of this are
4902 testsuite/g++.dg/template/cond2.C and
4903 testsuite/g++.dg/template/pr35240.C. */
4904 location_t saved_location = input_location;
4905 input_location = DECL_SOURCE_LOCATION (t);
4907 decl_assembler_name (t);
4909 input_location = saved_location;
4912 /* Traverse every decl found freeing its language data. */
4913 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4914 free_lang_data_in_decl (t);
4916 /* Traverse every type found freeing its language data. */
4917 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4918 free_lang_data_in_type (t);
4920 pointer_set_destroy (fld.pset);
4921 VEC_free (tree, heap, fld.worklist);
4922 VEC_free (tree, heap, fld.decls);
4923 VEC_free (tree, heap, fld.types);
4927 /* Free resources that are used by FE but are not needed once they are done. */
4930 free_lang_data (void)
4932 /* Traverse the IL resetting language specific information for
4933 operands, expressions, etc. */
4934 free_lang_data_in_cgraph ();
4936 /* Create gimple variants for common types. */
4937 ptrdiff_type_node = integer_type_node;
4938 fileptr_type_node = ptr_type_node;
4939 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4940 || (TYPE_MODE (boolean_type_node)
4941 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4942 || TYPE_PRECISION (boolean_type_node) != 1
4943 || !TYPE_UNSIGNED (boolean_type_node))
4945 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4946 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4947 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4948 TYPE_PRECISION (boolean_type_node) = 1;
4949 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4950 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4953 /* Unify char_type_node with its properly signed variant. */
4954 if (TYPE_UNSIGNED (char_type_node))
4955 unsigned_char_type_node = char_type_node;
4957 signed_char_type_node = char_type_node;
4959 /* Reset some langhooks. */
4960 lang_hooks.callgraph.analyze_expr = NULL;
4961 lang_hooks.types_compatible_p = NULL;
4962 lang_hooks.dwarf_name = lhd_dwarf_name;
4963 lang_hooks.decl_printable_name = gimple_decl_printable_name;
4964 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
4965 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
4967 /* Reset diagnostic machinery. */
4968 diagnostic_starter (global_dc) = default_diagnostic_starter;
4969 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
4970 diagnostic_format_decoder (global_dc) = default_tree_printer;
4972 /* FIXME. We remove sufficient language data that the debug
4973 info writer gets completely confused. Disable debug information
4975 debug_info_level = DINFO_LEVEL_NONE;
4976 write_symbols = NO_DEBUG;
4977 debug_hooks = &do_nothing_debug_hooks;
4983 /* Gate function for free_lang_data. */
4986 gate_free_lang_data (void)
4988 /* FIXME. Remove after save_debug_info is working. */
4989 return (flag_generate_lto
4991 && !flag_gtoggle && debug_info_level <= DINFO_LEVEL_TERSE));
4995 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5000 gate_free_lang_data, /* gate */
5001 free_lang_data, /* execute */
5004 0, /* static_pass_number */
5005 TV_IPA_FREE_LANG_DATA, /* tv_id */
5006 0, /* properties_required */
5007 0, /* properties_provided */
5008 0, /* properties_destroyed */
5009 0, /* todo_flags_start */
5010 TODO_ggc_collect /* todo_flags_finish */
5014 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5017 We try both `text' and `__text__', ATTR may be either one. */
5018 /* ??? It might be a reasonable simplification to require ATTR to be only
5019 `text'. One might then also require attribute lists to be stored in
5020 their canonicalized form. */
5023 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5028 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5031 p = IDENTIFIER_POINTER (ident);
5032 ident_len = IDENTIFIER_LENGTH (ident);
5034 if (ident_len == attr_len
5035 && strcmp (attr, p) == 0)
5038 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5041 gcc_assert (attr[1] == '_');
5042 gcc_assert (attr[attr_len - 2] == '_');
5043 gcc_assert (attr[attr_len - 1] == '_');
5044 if (ident_len == attr_len - 4
5045 && strncmp (attr + 2, p, attr_len - 4) == 0)
5050 if (ident_len == attr_len + 4
5051 && p[0] == '_' && p[1] == '_'
5052 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5053 && strncmp (attr, p + 2, attr_len) == 0)
5060 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5063 We try both `text' and `__text__', ATTR may be either one. */
5066 is_attribute_p (const char *attr, const_tree ident)
5068 return is_attribute_with_length_p (attr, strlen (attr), ident);
5071 /* Given an attribute name and a list of attributes, return a pointer to the
5072 attribute's list element if the attribute is part of the list, or NULL_TREE
5073 if not found. If the attribute appears more than once, this only
5074 returns the first occurrence; the TREE_CHAIN of the return value should
5075 be passed back in if further occurrences are wanted. */
5078 lookup_attribute (const char *attr_name, tree list)
5081 size_t attr_len = strlen (attr_name);
5083 for (l = list; l; l = TREE_CHAIN (l))
5085 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5086 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5092 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5096 remove_attribute (const char *attr_name, tree list)
5099 size_t attr_len = strlen (attr_name);
5101 for (p = &list; *p; )
5104 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5105 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5106 *p = TREE_CHAIN (l);
5108 p = &TREE_CHAIN (l);
5114 /* Return an attribute list that is the union of a1 and a2. */
5117 merge_attributes (tree a1, tree a2)
5121 /* Either one unset? Take the set one. */
5123 if ((attributes = a1) == 0)
5126 /* One that completely contains the other? Take it. */
5128 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5130 if (attribute_list_contained (a2, a1))
5134 /* Pick the longest list, and hang on the other list. */
5136 if (list_length (a1) < list_length (a2))
5137 attributes = a2, a2 = a1;
5139 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5142 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5145 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5148 if (TREE_VALUE (a) != NULL
5149 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5150 && TREE_VALUE (a2) != NULL
5151 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5153 if (simple_cst_list_equal (TREE_VALUE (a),
5154 TREE_VALUE (a2)) == 1)
5157 else if (simple_cst_equal (TREE_VALUE (a),
5158 TREE_VALUE (a2)) == 1)
5163 a1 = copy_node (a2);
5164 TREE_CHAIN (a1) = attributes;
5173 /* Given types T1 and T2, merge their attributes and return
5177 merge_type_attributes (tree t1, tree t2)
5179 return merge_attributes (TYPE_ATTRIBUTES (t1),
5180 TYPE_ATTRIBUTES (t2));
5183 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5187 merge_decl_attributes (tree olddecl, tree newdecl)
5189 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5190 DECL_ATTRIBUTES (newdecl));
5193 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5195 /* Specialization of merge_decl_attributes for various Windows targets.
5197 This handles the following situation:
5199 __declspec (dllimport) int foo;
5202 The second instance of `foo' nullifies the dllimport. */
5205 merge_dllimport_decl_attributes (tree old, tree new_tree)
5208 int delete_dllimport_p = 1;
5210 /* What we need to do here is remove from `old' dllimport if it doesn't
5211 appear in `new'. dllimport behaves like extern: if a declaration is
5212 marked dllimport and a definition appears later, then the object
5213 is not dllimport'd. We also remove a `new' dllimport if the old list
5214 contains dllexport: dllexport always overrides dllimport, regardless
5215 of the order of declaration. */
5216 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5217 delete_dllimport_p = 0;
5218 else if (DECL_DLLIMPORT_P (new_tree)
5219 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5221 DECL_DLLIMPORT_P (new_tree) = 0;
5222 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5223 "dllimport ignored", new_tree);
5225 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5227 /* Warn about overriding a symbol that has already been used, e.g.:
5228 extern int __attribute__ ((dllimport)) foo;
5229 int* bar () {return &foo;}
5232 if (TREE_USED (old))
5234 warning (0, "%q+D redeclared without dllimport attribute "
5235 "after being referenced with dll linkage", new_tree);
5236 /* If we have used a variable's address with dllimport linkage,
5237 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5238 decl may already have had TREE_CONSTANT computed.
5239 We still remove the attribute so that assembler code refers
5240 to '&foo rather than '_imp__foo'. */
5241 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5242 DECL_DLLIMPORT_P (new_tree) = 1;
5245 /* Let an inline definition silently override the external reference,
5246 but otherwise warn about attribute inconsistency. */
5247 else if (TREE_CODE (new_tree) == VAR_DECL
5248 || !DECL_DECLARED_INLINE_P (new_tree))
5249 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5250 "previous dllimport ignored", new_tree);
5253 delete_dllimport_p = 0;
5255 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5257 if (delete_dllimport_p)
5260 const size_t attr_len = strlen ("dllimport");
5262 /* Scan the list for dllimport and delete it. */
5263 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5265 if (is_attribute_with_length_p ("dllimport", attr_len,
5268 if (prev == NULL_TREE)
5271 TREE_CHAIN (prev) = TREE_CHAIN (t);
5280 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5281 struct attribute_spec.handler. */
5284 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5290 /* These attributes may apply to structure and union types being created,
5291 but otherwise should pass to the declaration involved. */
5294 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5295 | (int) ATTR_FLAG_ARRAY_NEXT))
5297 *no_add_attrs = true;
5298 return tree_cons (name, args, NULL_TREE);
5300 if (TREE_CODE (node) == RECORD_TYPE
5301 || TREE_CODE (node) == UNION_TYPE)
5303 node = TYPE_NAME (node);
5309 warning (OPT_Wattributes, "%qE attribute ignored",
5311 *no_add_attrs = true;
5316 if (TREE_CODE (node) != FUNCTION_DECL
5317 && TREE_CODE (node) != VAR_DECL
5318 && TREE_CODE (node) != TYPE_DECL)
5320 *no_add_attrs = true;
5321 warning (OPT_Wattributes, "%qE attribute ignored",
5326 if (TREE_CODE (node) == TYPE_DECL
5327 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5328 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5330 *no_add_attrs = true;
5331 warning (OPT_Wattributes, "%qE attribute ignored",
5336 is_dllimport = is_attribute_p ("dllimport", name);
5338 /* Report error on dllimport ambiguities seen now before they cause
5342 /* Honor any target-specific overrides. */
5343 if (!targetm.valid_dllimport_attribute_p (node))
5344 *no_add_attrs = true;
5346 else if (TREE_CODE (node) == FUNCTION_DECL
5347 && DECL_DECLARED_INLINE_P (node))
5349 warning (OPT_Wattributes, "inline function %q+D declared as "
5350 " dllimport: attribute ignored", node);
5351 *no_add_attrs = true;
5353 /* Like MS, treat definition of dllimported variables and
5354 non-inlined functions on declaration as syntax errors. */
5355 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5357 error ("function %q+D definition is marked dllimport", node);
5358 *no_add_attrs = true;
5361 else if (TREE_CODE (node) == VAR_DECL)
5363 if (DECL_INITIAL (node))
5365 error ("variable %q+D definition is marked dllimport",
5367 *no_add_attrs = true;
5370 /* `extern' needn't be specified with dllimport.
5371 Specify `extern' now and hope for the best. Sigh. */
5372 DECL_EXTERNAL (node) = 1;
5373 /* Also, implicitly give dllimport'd variables declared within
5374 a function global scope, unless declared static. */
5375 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5376 TREE_PUBLIC (node) = 1;
5379 if (*no_add_attrs == false)
5380 DECL_DLLIMPORT_P (node) = 1;
5382 else if (TREE_CODE (node) == FUNCTION_DECL
5383 && DECL_DECLARED_INLINE_P (node))
5384 /* An exported function, even if inline, must be emitted. */
5385 DECL_EXTERNAL (node) = 0;
5387 /* Report error if symbol is not accessible at global scope. */
5388 if (!TREE_PUBLIC (node)
5389 && (TREE_CODE (node) == VAR_DECL
5390 || TREE_CODE (node) == FUNCTION_DECL))
5392 error ("external linkage required for symbol %q+D because of "
5393 "%qE attribute", node, name);
5394 *no_add_attrs = true;
5397 /* A dllexport'd entity must have default visibility so that other
5398 program units (shared libraries or the main executable) can see
5399 it. A dllimport'd entity must have default visibility so that
5400 the linker knows that undefined references within this program
5401 unit can be resolved by the dynamic linker. */
5404 if (DECL_VISIBILITY_SPECIFIED (node)
5405 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5406 error ("%qE implies default visibility, but %qD has already "
5407 "been declared with a different visibility",
5409 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5410 DECL_VISIBILITY_SPECIFIED (node) = 1;
5416 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5418 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5419 of the various TYPE_QUAL values. */
5422 set_type_quals (tree type, int type_quals)
5424 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5425 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5426 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5427 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5430 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5433 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5435 return (TYPE_QUALS (cand) == type_quals
5436 && TYPE_NAME (cand) == TYPE_NAME (base)
5437 /* Apparently this is needed for Objective-C. */
5438 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5439 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5440 TYPE_ATTRIBUTES (base)));
5443 /* Return a version of the TYPE, qualified as indicated by the
5444 TYPE_QUALS, if one exists. If no qualified version exists yet,
5445 return NULL_TREE. */
5448 get_qualified_type (tree type, int type_quals)
5452 if (TYPE_QUALS (type) == type_quals)
5455 /* Search the chain of variants to see if there is already one there just
5456 like the one we need to have. If so, use that existing one. We must
5457 preserve the TYPE_NAME, since there is code that depends on this. */
5458 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5459 if (check_qualified_type (t, type, type_quals))
5465 /* Like get_qualified_type, but creates the type if it does not
5466 exist. This function never returns NULL_TREE. */
5469 build_qualified_type (tree type, int type_quals)
5473 /* See if we already have the appropriate qualified variant. */
5474 t = get_qualified_type (type, type_quals);
5476 /* If not, build it. */
5479 t = build_variant_type_copy (type);
5480 set_type_quals (t, type_quals);
5482 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5483 /* Propagate structural equality. */
5484 SET_TYPE_STRUCTURAL_EQUALITY (t);
5485 else if (TYPE_CANONICAL (type) != type)
5486 /* Build the underlying canonical type, since it is different
5488 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5491 /* T is its own canonical type. */
5492 TYPE_CANONICAL (t) = t;
5499 /* Create a new distinct copy of TYPE. The new type is made its own
5500 MAIN_VARIANT. If TYPE requires structural equality checks, the
5501 resulting type requires structural equality checks; otherwise, its
5502 TYPE_CANONICAL points to itself. */
5505 build_distinct_type_copy (tree type)
5507 tree t = copy_node (type);
5509 TYPE_POINTER_TO (t) = 0;
5510 TYPE_REFERENCE_TO (t) = 0;
5512 /* Set the canonical type either to a new equivalence class, or
5513 propagate the need for structural equality checks. */
5514 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5515 SET_TYPE_STRUCTURAL_EQUALITY (t);
5517 TYPE_CANONICAL (t) = t;
5519 /* Make it its own variant. */
5520 TYPE_MAIN_VARIANT (t) = t;
5521 TYPE_NEXT_VARIANT (t) = 0;
5523 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5524 whose TREE_TYPE is not t. This can also happen in the Ada
5525 frontend when using subtypes. */
5530 /* Create a new variant of TYPE, equivalent but distinct. This is so
5531 the caller can modify it. TYPE_CANONICAL for the return type will
5532 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5533 are considered equal by the language itself (or that both types
5534 require structural equality checks). */
5537 build_variant_type_copy (tree type)
5539 tree t, m = TYPE_MAIN_VARIANT (type);
5541 t = build_distinct_type_copy (type);
5543 /* Since we're building a variant, assume that it is a non-semantic
5544 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5545 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5547 /* Add the new type to the chain of variants of TYPE. */
5548 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5549 TYPE_NEXT_VARIANT (m) = t;
5550 TYPE_MAIN_VARIANT (t) = m;
5555 /* Return true if the from tree in both tree maps are equal. */
5558 tree_map_base_eq (const void *va, const void *vb)
5560 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5561 *const b = (const struct tree_map_base *) vb;
5562 return (a->from == b->from);
5565 /* Hash a from tree in a tree_map. */
5568 tree_map_base_hash (const void *item)
5570 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5573 /* Return true if this tree map structure is marked for garbage collection
5574 purposes. We simply return true if the from tree is marked, so that this
5575 structure goes away when the from tree goes away. */
5578 tree_map_base_marked_p (const void *p)
5580 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5584 tree_map_hash (const void *item)
5586 return (((const struct tree_map *) item)->hash);
5589 /* Return the initialization priority for DECL. */
5592 decl_init_priority_lookup (tree decl)
5594 struct tree_priority_map *h;
5595 struct tree_map_base in;
5597 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5599 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5600 return h ? h->init : DEFAULT_INIT_PRIORITY;
5603 /* Return the finalization priority for DECL. */
5606 decl_fini_priority_lookup (tree decl)
5608 struct tree_priority_map *h;
5609 struct tree_map_base in;
5611 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5613 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5614 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5617 /* Return the initialization and finalization priority information for
5618 DECL. If there is no previous priority information, a freshly
5619 allocated structure is returned. */
5621 static struct tree_priority_map *
5622 decl_priority_info (tree decl)
5624 struct tree_priority_map in;
5625 struct tree_priority_map *h;
5628 in.base.from = decl;
5629 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5630 h = (struct tree_priority_map *) *loc;
5633 h = GGC_CNEW (struct tree_priority_map);
5635 h->base.from = decl;
5636 h->init = DEFAULT_INIT_PRIORITY;
5637 h->fini = DEFAULT_INIT_PRIORITY;
5643 /* Set the initialization priority for DECL to PRIORITY. */
5646 decl_init_priority_insert (tree decl, priority_type priority)
5648 struct tree_priority_map *h;
5650 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5651 h = decl_priority_info (decl);
5655 /* Set the finalization priority for DECL to PRIORITY. */
5658 decl_fini_priority_insert (tree decl, priority_type priority)
5660 struct tree_priority_map *h;
5662 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5663 h = decl_priority_info (decl);
5667 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5670 print_debug_expr_statistics (void)
5672 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5673 (long) htab_size (debug_expr_for_decl),
5674 (long) htab_elements (debug_expr_for_decl),
5675 htab_collisions (debug_expr_for_decl));
5678 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5681 print_value_expr_statistics (void)
5683 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5684 (long) htab_size (value_expr_for_decl),
5685 (long) htab_elements (value_expr_for_decl),
5686 htab_collisions (value_expr_for_decl));
5689 /* Lookup a debug expression for FROM, and return it if we find one. */
5692 decl_debug_expr_lookup (tree from)
5694 struct tree_map *h, in;
5695 in.base.from = from;
5697 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5698 htab_hash_pointer (from));
5704 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5707 decl_debug_expr_insert (tree from, tree to)
5712 h = GGC_NEW (struct tree_map);
5713 h->hash = htab_hash_pointer (from);
5714 h->base.from = from;
5716 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5717 *(struct tree_map **) loc = h;
5720 /* Lookup a value expression for FROM, and return it if we find one. */
5723 decl_value_expr_lookup (tree from)
5725 struct tree_map *h, in;
5726 in.base.from = from;
5728 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5729 htab_hash_pointer (from));
5735 /* Insert a mapping FROM->TO in the value expression hashtable. */
5738 decl_value_expr_insert (tree from, tree to)
5743 h = GGC_NEW (struct tree_map);
5744 h->hash = htab_hash_pointer (from);
5745 h->base.from = from;
5747 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5748 *(struct tree_map **) loc = h;
5751 /* Hashing of types so that we don't make duplicates.
5752 The entry point is `type_hash_canon'. */
5754 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5755 with types in the TREE_VALUE slots), by adding the hash codes
5756 of the individual types. */
5759 type_hash_list (const_tree list, hashval_t hashcode)
5763 for (tail = list; tail; tail = TREE_CHAIN (tail))
5764 if (TREE_VALUE (tail) != error_mark_node)
5765 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5771 /* These are the Hashtable callback functions. */
5773 /* Returns true iff the types are equivalent. */
5776 type_hash_eq (const void *va, const void *vb)
5778 const struct type_hash *const a = (const struct type_hash *) va,
5779 *const b = (const struct type_hash *) vb;
5781 /* First test the things that are the same for all types. */
5782 if (a->hash != b->hash
5783 || TREE_CODE (a->type) != TREE_CODE (b->type)
5784 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5785 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5786 TYPE_ATTRIBUTES (b->type))
5787 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5788 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5789 || (TREE_CODE (a->type) != COMPLEX_TYPE
5790 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5793 switch (TREE_CODE (a->type))
5798 case REFERENCE_TYPE:
5802 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5805 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5806 && !(TYPE_VALUES (a->type)
5807 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5808 && TYPE_VALUES (b->type)
5809 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5810 && type_list_equal (TYPE_VALUES (a->type),
5811 TYPE_VALUES (b->type))))
5814 /* ... fall through ... */
5819 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5820 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5821 TYPE_MAX_VALUE (b->type)))
5822 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5823 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5824 TYPE_MIN_VALUE (b->type))));
5826 case FIXED_POINT_TYPE:
5827 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5830 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5833 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5834 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5835 || (TYPE_ARG_TYPES (a->type)
5836 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5837 && TYPE_ARG_TYPES (b->type)
5838 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5839 && type_list_equal (TYPE_ARG_TYPES (a->type),
5840 TYPE_ARG_TYPES (b->type)))));
5843 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5847 case QUAL_UNION_TYPE:
5848 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5849 || (TYPE_FIELDS (a->type)
5850 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5851 && TYPE_FIELDS (b->type)
5852 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5853 && type_list_equal (TYPE_FIELDS (a->type),
5854 TYPE_FIELDS (b->type))));
5857 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5858 || (TYPE_ARG_TYPES (a->type)
5859 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5860 && TYPE_ARG_TYPES (b->type)
5861 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5862 && type_list_equal (TYPE_ARG_TYPES (a->type),
5863 TYPE_ARG_TYPES (b->type))))
5871 if (lang_hooks.types.type_hash_eq != NULL)
5872 return lang_hooks.types.type_hash_eq (a->type, b->type);
5877 /* Return the cached hash value. */
5880 type_hash_hash (const void *item)
5882 return ((const struct type_hash *) item)->hash;
5885 /* Look in the type hash table for a type isomorphic to TYPE.
5886 If one is found, return it. Otherwise return 0. */
5889 type_hash_lookup (hashval_t hashcode, tree type)
5891 struct type_hash *h, in;
5893 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5894 must call that routine before comparing TYPE_ALIGNs. */
5900 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5907 /* Add an entry to the type-hash-table
5908 for a type TYPE whose hash code is HASHCODE. */
5911 type_hash_add (hashval_t hashcode, tree type)
5913 struct type_hash *h;
5916 h = GGC_NEW (struct type_hash);
5919 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5923 /* Given TYPE, and HASHCODE its hash code, return the canonical
5924 object for an identical type if one already exists.
5925 Otherwise, return TYPE, and record it as the canonical object.
5927 To use this function, first create a type of the sort you want.
5928 Then compute its hash code from the fields of the type that
5929 make it different from other similar types.
5930 Then call this function and use the value. */
5933 type_hash_canon (unsigned int hashcode, tree type)
5937 /* The hash table only contains main variants, so ensure that's what we're
5939 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5941 if (!lang_hooks.types.hash_types)
5944 /* See if the type is in the hash table already. If so, return it.
5945 Otherwise, add the type. */
5946 t1 = type_hash_lookup (hashcode, type);
5949 #ifdef GATHER_STATISTICS
5950 tree_node_counts[(int) t_kind]--;
5951 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5957 type_hash_add (hashcode, type);
5962 /* See if the data pointed to by the type hash table is marked. We consider
5963 it marked if the type is marked or if a debug type number or symbol
5964 table entry has been made for the type. This reduces the amount of
5965 debugging output and eliminates that dependency of the debug output on
5966 the number of garbage collections. */
5969 type_hash_marked_p (const void *p)
5971 const_tree const type = ((const struct type_hash *) p)->type;
5973 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5977 print_type_hash_statistics (void)
5979 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5980 (long) htab_size (type_hash_table),
5981 (long) htab_elements (type_hash_table),
5982 htab_collisions (type_hash_table));
5985 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5986 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5987 by adding the hash codes of the individual attributes. */
5990 attribute_hash_list (const_tree list, hashval_t hashcode)
5994 for (tail = list; tail; tail = TREE_CHAIN (tail))
5995 /* ??? Do we want to add in TREE_VALUE too? */
5996 hashcode = iterative_hash_object
5997 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6001 /* Given two lists of attributes, return true if list l2 is
6002 equivalent to l1. */
6005 attribute_list_equal (const_tree l1, const_tree l2)
6007 return attribute_list_contained (l1, l2)
6008 && attribute_list_contained (l2, l1);
6011 /* Given two lists of attributes, return true if list L2 is
6012 completely contained within L1. */
6013 /* ??? This would be faster if attribute names were stored in a canonicalized
6014 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6015 must be used to show these elements are equivalent (which they are). */
6016 /* ??? It's not clear that attributes with arguments will always be handled
6020 attribute_list_contained (const_tree l1, const_tree l2)
6024 /* First check the obvious, maybe the lists are identical. */
6028 /* Maybe the lists are similar. */
6029 for (t1 = l1, t2 = l2;
6031 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6032 && TREE_VALUE (t1) == TREE_VALUE (t2);
6033 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6035 /* Maybe the lists are equal. */
6036 if (t1 == 0 && t2 == 0)
6039 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6042 /* This CONST_CAST is okay because lookup_attribute does not
6043 modify its argument and the return value is assigned to a
6045 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6046 CONST_CAST_TREE(l1));
6048 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6051 if (TREE_VALUE (t2) != NULL
6052 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6053 && TREE_VALUE (attr) != NULL
6054 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6056 if (simple_cst_list_equal (TREE_VALUE (t2),
6057 TREE_VALUE (attr)) == 1)
6060 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6071 /* Given two lists of types
6072 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6073 return 1 if the lists contain the same types in the same order.
6074 Also, the TREE_PURPOSEs must match. */
6077 type_list_equal (const_tree l1, const_tree l2)
6081 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6082 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6083 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6084 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6085 && (TREE_TYPE (TREE_PURPOSE (t1))
6086 == TREE_TYPE (TREE_PURPOSE (t2))))))
6092 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6093 given by TYPE. If the argument list accepts variable arguments,
6094 then this function counts only the ordinary arguments. */
6097 type_num_arguments (const_tree type)
6102 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6103 /* If the function does not take a variable number of arguments,
6104 the last element in the list will have type `void'. */
6105 if (VOID_TYPE_P (TREE_VALUE (t)))
6113 /* Nonzero if integer constants T1 and T2
6114 represent the same constant value. */
6117 tree_int_cst_equal (const_tree t1, const_tree t2)
6122 if (t1 == 0 || t2 == 0)
6125 if (TREE_CODE (t1) == INTEGER_CST
6126 && TREE_CODE (t2) == INTEGER_CST
6127 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6128 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6134 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6135 The precise way of comparison depends on their data type. */
6138 tree_int_cst_lt (const_tree t1, const_tree t2)
6143 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6145 int t1_sgn = tree_int_cst_sgn (t1);
6146 int t2_sgn = tree_int_cst_sgn (t2);
6148 if (t1_sgn < t2_sgn)
6150 else if (t1_sgn > t2_sgn)
6152 /* Otherwise, both are non-negative, so we compare them as
6153 unsigned just in case one of them would overflow a signed
6156 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6157 return INT_CST_LT (t1, t2);
6159 return INT_CST_LT_UNSIGNED (t1, t2);
6162 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6165 tree_int_cst_compare (const_tree t1, const_tree t2)
6167 if (tree_int_cst_lt (t1, t2))
6169 else if (tree_int_cst_lt (t2, t1))
6175 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6176 the host. If POS is zero, the value can be represented in a single
6177 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6178 be represented in a single unsigned HOST_WIDE_INT. */
6181 host_integerp (const_tree t, int pos)
6186 return (TREE_CODE (t) == INTEGER_CST
6187 && ((TREE_INT_CST_HIGH (t) == 0
6188 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6189 || (! pos && TREE_INT_CST_HIGH (t) == -1
6190 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6191 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6192 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6193 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6194 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6197 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6198 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6199 be non-negative. We must be able to satisfy the above conditions. */
6202 tree_low_cst (const_tree t, int pos)
6204 gcc_assert (host_integerp (t, pos));
6205 return TREE_INT_CST_LOW (t);
6208 /* Return the most significant bit of the integer constant T. */
6211 tree_int_cst_msb (const_tree t)
6215 unsigned HOST_WIDE_INT l;
6217 /* Note that using TYPE_PRECISION here is wrong. We care about the
6218 actual bits, not the (arbitrary) range of the type. */
6219 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6220 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6221 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6222 return (l & 1) == 1;
6225 /* Return an indication of the sign of the integer constant T.
6226 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6227 Note that -1 will never be returned if T's type is unsigned. */
6230 tree_int_cst_sgn (const_tree t)
6232 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6234 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6236 else if (TREE_INT_CST_HIGH (t) < 0)
6242 /* Return the minimum number of bits needed to represent VALUE in a
6243 signed or unsigned type, UNSIGNEDP says which. */
6246 tree_int_cst_min_precision (tree value, bool unsignedp)
6250 /* If the value is negative, compute its negative minus 1. The latter
6251 adjustment is because the absolute value of the largest negative value
6252 is one larger than the largest positive value. This is equivalent to
6253 a bit-wise negation, so use that operation instead. */
6255 if (tree_int_cst_sgn (value) < 0)
6256 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6258 /* Return the number of bits needed, taking into account the fact
6259 that we need one more bit for a signed than unsigned type. */
6261 if (integer_zerop (value))
6264 log = tree_floor_log2 (value);
6266 return log + 1 + !unsignedp;
6269 /* Compare two constructor-element-type constants. Return 1 if the lists
6270 are known to be equal; otherwise return 0. */
6273 simple_cst_list_equal (const_tree l1, const_tree l2)
6275 while (l1 != NULL_TREE && l2 != NULL_TREE)
6277 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6280 l1 = TREE_CHAIN (l1);
6281 l2 = TREE_CHAIN (l2);
6287 /* Return truthvalue of whether T1 is the same tree structure as T2.
6288 Return 1 if they are the same.
6289 Return 0 if they are understandably different.
6290 Return -1 if either contains tree structure not understood by
6294 simple_cst_equal (const_tree t1, const_tree t2)
6296 enum tree_code code1, code2;
6302 if (t1 == 0 || t2 == 0)
6305 code1 = TREE_CODE (t1);
6306 code2 = TREE_CODE (t2);
6308 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6310 if (CONVERT_EXPR_CODE_P (code2)
6311 || code2 == NON_LVALUE_EXPR)
6312 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6314 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6317 else if (CONVERT_EXPR_CODE_P (code2)
6318 || code2 == NON_LVALUE_EXPR)
6319 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6327 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6328 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6331 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6334 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6337 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6338 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6339 TREE_STRING_LENGTH (t1)));
6343 unsigned HOST_WIDE_INT idx;
6344 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6345 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6347 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6350 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6351 /* ??? Should we handle also fields here? */
6352 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6353 VEC_index (constructor_elt, v2, idx)->value))
6359 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6362 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6365 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6368 const_tree arg1, arg2;
6369 const_call_expr_arg_iterator iter1, iter2;
6370 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6371 arg2 = first_const_call_expr_arg (t2, &iter2);
6373 arg1 = next_const_call_expr_arg (&iter1),
6374 arg2 = next_const_call_expr_arg (&iter2))
6376 cmp = simple_cst_equal (arg1, arg2);
6380 return arg1 == arg2;
6384 /* Special case: if either target is an unallocated VAR_DECL,
6385 it means that it's going to be unified with whatever the
6386 TARGET_EXPR is really supposed to initialize, so treat it
6387 as being equivalent to anything. */
6388 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6389 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6390 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6391 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6392 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6393 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6396 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6401 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6403 case WITH_CLEANUP_EXPR:
6404 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6408 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6411 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6412 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6426 /* This general rule works for most tree codes. All exceptions should be
6427 handled above. If this is a language-specific tree code, we can't
6428 trust what might be in the operand, so say we don't know
6430 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6433 switch (TREE_CODE_CLASS (code1))
6437 case tcc_comparison:
6438 case tcc_expression:
6442 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6444 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6456 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6457 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6458 than U, respectively. */
6461 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6463 if (tree_int_cst_sgn (t) < 0)
6465 else if (TREE_INT_CST_HIGH (t) != 0)
6467 else if (TREE_INT_CST_LOW (t) == u)
6469 else if (TREE_INT_CST_LOW (t) < u)
6475 /* Return true if CODE represents an associative tree code. Otherwise
6478 associative_tree_code (enum tree_code code)
6497 /* Return true if CODE represents a commutative tree code. Otherwise
6500 commutative_tree_code (enum tree_code code)
6513 case UNORDERED_EXPR:
6517 case TRUTH_AND_EXPR:
6518 case TRUTH_XOR_EXPR:
6528 /* Generate a hash value for an expression. This can be used iteratively
6529 by passing a previous result as the VAL argument.
6531 This function is intended to produce the same hash for expressions which
6532 would compare equal using operand_equal_p. */
6535 iterative_hash_expr (const_tree t, hashval_t val)
6538 enum tree_code code;
6542 return iterative_hash_hashval_t (0, val);
6544 code = TREE_CODE (t);
6548 /* Alas, constants aren't shared, so we can't rely on pointer
6551 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6552 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6555 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6557 return iterative_hash_hashval_t (val2, val);
6561 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6563 return iterative_hash_hashval_t (val2, val);
6566 return iterative_hash (TREE_STRING_POINTER (t),
6567 TREE_STRING_LENGTH (t), val);
6569 val = iterative_hash_expr (TREE_REALPART (t), val);
6570 return iterative_hash_expr (TREE_IMAGPART (t), val);
6572 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6575 /* we can just compare by pointer. */
6576 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6579 /* A list of expressions, for a CALL_EXPR or as the elements of a
6581 for (; t; t = TREE_CHAIN (t))
6582 val = iterative_hash_expr (TREE_VALUE (t), val);
6586 unsigned HOST_WIDE_INT idx;
6588 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6590 val = iterative_hash_expr (field, val);
6591 val = iterative_hash_expr (value, val);
6596 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6597 Otherwise nodes that compare equal according to operand_equal_p might
6598 get different hash codes. However, don't do this for machine specific
6599 or front end builtins, since the function code is overloaded in those
6601 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6602 && built_in_decls[DECL_FUNCTION_CODE (t)])
6604 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6605 code = TREE_CODE (t);
6609 tclass = TREE_CODE_CLASS (code);
6611 if (tclass == tcc_declaration)
6613 /* DECL's have a unique ID */
6614 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6618 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6620 val = iterative_hash_object (code, val);
6622 /* Don't hash the type, that can lead to having nodes which
6623 compare equal according to operand_equal_p, but which
6624 have different hash codes. */
6625 if (CONVERT_EXPR_CODE_P (code)
6626 || code == NON_LVALUE_EXPR)
6628 /* Make sure to include signness in the hash computation. */
6629 val += TYPE_UNSIGNED (TREE_TYPE (t));
6630 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6633 else if (commutative_tree_code (code))
6635 /* It's a commutative expression. We want to hash it the same
6636 however it appears. We do this by first hashing both operands
6637 and then rehashing based on the order of their independent
6639 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6640 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6644 t = one, one = two, two = t;
6646 val = iterative_hash_hashval_t (one, val);
6647 val = iterative_hash_hashval_t (two, val);
6650 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6651 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6658 /* Generate a hash value for a pair of expressions. This can be used
6659 iteratively by passing a previous result as the VAL argument.
6661 The same hash value is always returned for a given pair of expressions,
6662 regardless of the order in which they are presented. This is useful in
6663 hashing the operands of commutative functions. */
6666 iterative_hash_exprs_commutative (const_tree t1,
6667 const_tree t2, hashval_t val)
6669 hashval_t one = iterative_hash_expr (t1, 0);
6670 hashval_t two = iterative_hash_expr (t2, 0);
6674 t = one, one = two, two = t;
6675 val = iterative_hash_hashval_t (one, val);
6676 val = iterative_hash_hashval_t (two, val);
6681 /* Constructors for pointer, array and function types.
6682 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6683 constructed by language-dependent code, not here.) */
6685 /* Construct, lay out and return the type of pointers to TO_TYPE with
6686 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6687 reference all of memory. If such a type has already been
6688 constructed, reuse it. */
6691 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6696 if (to_type == error_mark_node)
6697 return error_mark_node;
6699 /* If the pointed-to type has the may_alias attribute set, force
6700 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6701 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6702 can_alias_all = true;
6704 /* In some cases, languages will have things that aren't a POINTER_TYPE
6705 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6706 In that case, return that type without regard to the rest of our
6709 ??? This is a kludge, but consistent with the way this function has
6710 always operated and there doesn't seem to be a good way to avoid this
6712 if (TYPE_POINTER_TO (to_type) != 0
6713 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6714 return TYPE_POINTER_TO (to_type);
6716 /* First, if we already have a type for pointers to TO_TYPE and it's
6717 the proper mode, use it. */
6718 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6719 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6722 t = make_node (POINTER_TYPE);
6724 TREE_TYPE (t) = to_type;
6725 SET_TYPE_MODE (t, mode);
6726 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6727 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6728 TYPE_POINTER_TO (to_type) = t;
6730 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6731 SET_TYPE_STRUCTURAL_EQUALITY (t);
6732 else if (TYPE_CANONICAL (to_type) != to_type)
6734 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6735 mode, can_alias_all);
6737 /* Lay out the type. This function has many callers that are concerned
6738 with expression-construction, and this simplifies them all. */
6744 /* By default build pointers in ptr_mode. */
6747 build_pointer_type (tree to_type)
6749 return build_pointer_type_for_mode (to_type, ptr_mode, false);
6752 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6755 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6760 if (to_type == error_mark_node)
6761 return error_mark_node;
6763 /* If the pointed-to type has the may_alias attribute set, force
6764 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6765 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6766 can_alias_all = true;
6768 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6769 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6770 In that case, return that type without regard to the rest of our
6773 ??? This is a kludge, but consistent with the way this function has
6774 always operated and there doesn't seem to be a good way to avoid this
6776 if (TYPE_REFERENCE_TO (to_type) != 0
6777 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6778 return TYPE_REFERENCE_TO (to_type);
6780 /* First, if we already have a type for pointers to TO_TYPE and it's
6781 the proper mode, use it. */
6782 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6783 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6786 t = make_node (REFERENCE_TYPE);
6788 TREE_TYPE (t) = to_type;
6789 SET_TYPE_MODE (t, mode);
6790 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6791 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6792 TYPE_REFERENCE_TO (to_type) = t;
6794 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6795 SET_TYPE_STRUCTURAL_EQUALITY (t);
6796 else if (TYPE_CANONICAL (to_type) != to_type)
6798 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6799 mode, can_alias_all);
6807 /* Build the node for the type of references-to-TO_TYPE by default
6811 build_reference_type (tree to_type)
6813 return build_reference_type_for_mode (to_type, ptr_mode, false);
6816 /* Build a type that is compatible with t but has no cv quals anywhere
6819 const char *const *const * -> char ***. */
6822 build_type_no_quals (tree t)
6824 switch (TREE_CODE (t))
6827 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6829 TYPE_REF_CAN_ALIAS_ALL (t));
6830 case REFERENCE_TYPE:
6832 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6834 TYPE_REF_CAN_ALIAS_ALL (t));
6836 return TYPE_MAIN_VARIANT (t);
6840 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6841 MAXVAL should be the maximum value in the domain
6842 (one less than the length of the array).
6844 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6845 We don't enforce this limit, that is up to caller (e.g. language front end).
6846 The limit exists because the result is a signed type and we don't handle
6847 sizes that use more than one HOST_WIDE_INT. */
6850 build_index_type (tree maxval)
6852 tree itype = make_node (INTEGER_TYPE);
6854 TREE_TYPE (itype) = sizetype;
6855 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6856 TYPE_MIN_VALUE (itype) = size_zero_node;
6857 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6858 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6859 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6860 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6861 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6862 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6864 if (host_integerp (maxval, 1))
6865 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6868 /* Since we cannot hash this type, we need to compare it using
6869 structural equality checks. */
6870 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6875 /* Builds a signed or unsigned integer type of precision PRECISION.
6876 Used for C bitfields whose precision does not match that of
6877 built-in target types. */
6879 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6882 tree itype = make_node (INTEGER_TYPE);
6884 TYPE_PRECISION (itype) = precision;
6887 fixup_unsigned_type (itype);
6889 fixup_signed_type (itype);
6891 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6892 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6897 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6898 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6899 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6902 build_range_type (tree type, tree lowval, tree highval)
6904 tree itype = make_node (INTEGER_TYPE);
6906 TREE_TYPE (itype) = type;
6907 if (type == NULL_TREE)
6910 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6911 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6913 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6914 SET_TYPE_MODE (itype, TYPE_MODE (type));
6915 TYPE_SIZE (itype) = TYPE_SIZE (type);
6916 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6917 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6918 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6920 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6921 return type_hash_canon (tree_low_cst (highval, 0)
6922 - tree_low_cst (lowval, 0),
6928 /* Return true if the debug information for TYPE, a subtype, should be emitted
6929 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6930 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6931 debug info and doesn't reflect the source code. */
6934 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6936 tree base_type = TREE_TYPE (type), low, high;
6938 /* Subrange types have a base type which is an integral type. */
6939 if (!INTEGRAL_TYPE_P (base_type))
6942 /* Get the real bounds of the subtype. */
6943 if (lang_hooks.types.get_subrange_bounds)
6944 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6947 low = TYPE_MIN_VALUE (type);
6948 high = TYPE_MAX_VALUE (type);
6951 /* If the type and its base type have the same representation and the same
6952 name, then the type is not a subrange but a copy of the base type. */
6953 if ((TREE_CODE (base_type) == INTEGER_TYPE
6954 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6955 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6956 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6957 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6959 tree type_name = TYPE_NAME (type);
6960 tree base_type_name = TYPE_NAME (base_type);
6962 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6963 type_name = DECL_NAME (type_name);
6965 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6966 base_type_name = DECL_NAME (base_type_name);
6968 if (type_name == base_type_name)
6979 /* Just like build_index_type, but takes lowval and highval instead
6980 of just highval (maxval). */
6983 build_index_2_type (tree lowval, tree highval)
6985 return build_range_type (sizetype, lowval, highval);
6988 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6989 and number of elements specified by the range of values of INDEX_TYPE.
6990 If such a type has already been constructed, reuse it. */
6993 build_array_type (tree elt_type, tree index_type)
6996 hashval_t hashcode = 0;
6998 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7000 error ("arrays of functions are not meaningful");
7001 elt_type = integer_type_node;
7004 t = make_node (ARRAY_TYPE);
7005 TREE_TYPE (t) = elt_type;
7006 TYPE_DOMAIN (t) = index_type;
7007 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7010 /* If the element type is incomplete at this point we get marked for
7011 structural equality. Do not record these types in the canonical
7013 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7016 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7018 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7019 t = type_hash_canon (hashcode, t);
7021 if (TYPE_CANONICAL (t) == t)
7023 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7024 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7025 SET_TYPE_STRUCTURAL_EQUALITY (t);
7026 else if (TYPE_CANONICAL (elt_type) != elt_type
7027 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7029 = build_array_type (TYPE_CANONICAL (elt_type),
7030 index_type ? TYPE_CANONICAL (index_type) : NULL);
7036 /* Recursively examines the array elements of TYPE, until a non-array
7037 element type is found. */
7040 strip_array_types (tree type)
7042 while (TREE_CODE (type) == ARRAY_TYPE)
7043 type = TREE_TYPE (type);
7048 /* Computes the canonical argument types from the argument type list
7051 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7052 on entry to this function, or if any of the ARGTYPES are
7055 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7056 true on entry to this function, or if any of the ARGTYPES are
7059 Returns a canonical argument list, which may be ARGTYPES when the
7060 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7061 true) or would not differ from ARGTYPES. */
7064 maybe_canonicalize_argtypes(tree argtypes,
7065 bool *any_structural_p,
7066 bool *any_noncanonical_p)
7069 bool any_noncanonical_argtypes_p = false;
7071 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7073 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7074 /* Fail gracefully by stating that the type is structural. */
7075 *any_structural_p = true;
7076 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7077 *any_structural_p = true;
7078 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7079 || TREE_PURPOSE (arg))
7080 /* If the argument has a default argument, we consider it
7081 non-canonical even though the type itself is canonical.
7082 That way, different variants of function and method types
7083 with default arguments will all point to the variant with
7084 no defaults as their canonical type. */
7085 any_noncanonical_argtypes_p = true;
7088 if (*any_structural_p)
7091 if (any_noncanonical_argtypes_p)
7093 /* Build the canonical list of argument types. */
7094 tree canon_argtypes = NULL_TREE;
7095 bool is_void = false;
7097 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7099 if (arg == void_list_node)
7102 canon_argtypes = tree_cons (NULL_TREE,
7103 TYPE_CANONICAL (TREE_VALUE (arg)),
7107 canon_argtypes = nreverse (canon_argtypes);
7109 canon_argtypes = chainon (canon_argtypes, void_list_node);
7111 /* There is a non-canonical type. */
7112 *any_noncanonical_p = true;
7113 return canon_argtypes;
7116 /* The canonical argument types are the same as ARGTYPES. */
7120 /* Construct, lay out and return
7121 the type of functions returning type VALUE_TYPE
7122 given arguments of types ARG_TYPES.
7123 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7124 are data type nodes for the arguments of the function.
7125 If such a type has already been constructed, reuse it. */
7128 build_function_type (tree value_type, tree arg_types)
7131 hashval_t hashcode = 0;
7132 bool any_structural_p, any_noncanonical_p;
7133 tree canon_argtypes;
7135 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7137 error ("function return type cannot be function");
7138 value_type = integer_type_node;
7141 /* Make a node of the sort we want. */
7142 t = make_node (FUNCTION_TYPE);
7143 TREE_TYPE (t) = value_type;
7144 TYPE_ARG_TYPES (t) = arg_types;
7146 /* If we already have such a type, use the old one. */
7147 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7148 hashcode = type_hash_list (arg_types, hashcode);
7149 t = type_hash_canon (hashcode, t);
7151 /* Set up the canonical type. */
7152 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7153 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7154 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7156 &any_noncanonical_p);
7157 if (any_structural_p)
7158 SET_TYPE_STRUCTURAL_EQUALITY (t);
7159 else if (any_noncanonical_p)
7160 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7163 if (!COMPLETE_TYPE_P (t))
7168 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7171 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7173 tree new_type = NULL;
7174 tree args, new_args = NULL, t;
7178 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7179 args = TREE_CHAIN (args), i++)
7180 if (!bitmap_bit_p (args_to_skip, i))
7181 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7183 new_reversed = nreverse (new_args);
7187 TREE_CHAIN (new_args) = void_list_node;
7189 new_reversed = void_list_node;
7192 /* Use copy_node to preserve as much as possible from original type
7193 (debug info, attribute lists etc.)
7194 Exception is METHOD_TYPEs must have THIS argument.
7195 When we are asked to remove it, we need to build new FUNCTION_TYPE
7197 if (TREE_CODE (orig_type) != METHOD_TYPE
7198 || !bitmap_bit_p (args_to_skip, 0))
7200 new_type = copy_node (orig_type);
7201 TYPE_ARG_TYPES (new_type) = new_reversed;
7206 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7208 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7211 /* This is a new type, not a copy of an old type. Need to reassociate
7212 variants. We can handle everything except the main variant lazily. */
7213 t = TYPE_MAIN_VARIANT (orig_type);
7216 TYPE_MAIN_VARIANT (new_type) = t;
7217 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7218 TYPE_NEXT_VARIANT (t) = new_type;
7222 TYPE_MAIN_VARIANT (new_type) = new_type;
7223 TYPE_NEXT_VARIANT (new_type) = NULL;
7228 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7230 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7231 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7232 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7235 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7237 tree new_decl = copy_node (orig_decl);
7240 new_type = TREE_TYPE (orig_decl);
7241 if (prototype_p (new_type))
7242 new_type = build_function_type_skip_args (new_type, args_to_skip);
7243 TREE_TYPE (new_decl) = new_type;
7245 /* For declarations setting DECL_VINDEX (i.e. methods)
7246 we expect first argument to be THIS pointer. */
7247 if (bitmap_bit_p (args_to_skip, 0))
7248 DECL_VINDEX (new_decl) = NULL_TREE;
7252 /* Build a function type. The RETURN_TYPE is the type returned by the
7253 function. If VAARGS is set, no void_type_node is appended to the
7254 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7257 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7261 t = va_arg (argp, tree);
7262 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7263 args = tree_cons (NULL_TREE, t, args);
7268 if (args != NULL_TREE)
7269 args = nreverse (args);
7270 gcc_assert (args != NULL_TREE && last != void_list_node);
7272 else if (args == NULL_TREE)
7273 args = void_list_node;
7277 args = nreverse (args);
7278 TREE_CHAIN (last) = void_list_node;
7280 args = build_function_type (return_type, args);
7285 /* Build a function type. The RETURN_TYPE is the type returned by the
7286 function. If additional arguments are provided, they are
7287 additional argument types. The list of argument types must always
7288 be terminated by NULL_TREE. */
7291 build_function_type_list (tree return_type, ...)
7296 va_start (p, return_type);
7297 args = build_function_type_list_1 (false, return_type, p);
7302 /* Build a variable argument function type. The RETURN_TYPE is the
7303 type returned by the function. If additional arguments are provided,
7304 they are additional argument types. The list of argument types must
7305 always be terminated by NULL_TREE. */
7308 build_varargs_function_type_list (tree return_type, ...)
7313 va_start (p, return_type);
7314 args = build_function_type_list_1 (true, return_type, p);
7320 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7321 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7322 for the method. An implicit additional parameter (of type
7323 pointer-to-BASETYPE) is added to the ARGTYPES. */
7326 build_method_type_directly (tree basetype,
7333 bool any_structural_p, any_noncanonical_p;
7334 tree canon_argtypes;
7336 /* Make a node of the sort we want. */
7337 t = make_node (METHOD_TYPE);
7339 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7340 TREE_TYPE (t) = rettype;
7341 ptype = build_pointer_type (basetype);
7343 /* The actual arglist for this function includes a "hidden" argument
7344 which is "this". Put it into the list of argument types. */
7345 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7346 TYPE_ARG_TYPES (t) = argtypes;
7348 /* If we already have such a type, use the old one. */
7349 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7350 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7351 hashcode = type_hash_list (argtypes, hashcode);
7352 t = type_hash_canon (hashcode, t);
7354 /* Set up the canonical type. */
7356 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7357 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7359 = (TYPE_CANONICAL (basetype) != basetype
7360 || TYPE_CANONICAL (rettype) != rettype);
7361 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7363 &any_noncanonical_p);
7364 if (any_structural_p)
7365 SET_TYPE_STRUCTURAL_EQUALITY (t);
7366 else if (any_noncanonical_p)
7368 = build_method_type_directly (TYPE_CANONICAL (basetype),
7369 TYPE_CANONICAL (rettype),
7371 if (!COMPLETE_TYPE_P (t))
7377 /* Construct, lay out and return the type of methods belonging to class
7378 BASETYPE and whose arguments and values are described by TYPE.
7379 If that type exists already, reuse it.
7380 TYPE must be a FUNCTION_TYPE node. */
7383 build_method_type (tree basetype, tree type)
7385 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7387 return build_method_type_directly (basetype,
7389 TYPE_ARG_TYPES (type));
7392 /* Construct, lay out and return the type of offsets to a value
7393 of type TYPE, within an object of type BASETYPE.
7394 If a suitable offset type exists already, reuse it. */
7397 build_offset_type (tree basetype, tree type)
7400 hashval_t hashcode = 0;
7402 /* Make a node of the sort we want. */
7403 t = make_node (OFFSET_TYPE);
7405 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7406 TREE_TYPE (t) = type;
7408 /* If we already have such a type, use the old one. */
7409 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7410 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7411 t = type_hash_canon (hashcode, t);
7413 if (!COMPLETE_TYPE_P (t))
7416 if (TYPE_CANONICAL (t) == t)
7418 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7419 || TYPE_STRUCTURAL_EQUALITY_P (type))
7420 SET_TYPE_STRUCTURAL_EQUALITY (t);
7421 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7422 || TYPE_CANONICAL (type) != type)
7424 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7425 TYPE_CANONICAL (type));
7431 /* Create a complex type whose components are COMPONENT_TYPE. */
7434 build_complex_type (tree component_type)
7439 gcc_assert (INTEGRAL_TYPE_P (component_type)
7440 || SCALAR_FLOAT_TYPE_P (component_type)
7441 || FIXED_POINT_TYPE_P (component_type));
7443 /* Make a node of the sort we want. */
7444 t = make_node (COMPLEX_TYPE);
7446 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7448 /* If we already have such a type, use the old one. */
7449 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7450 t = type_hash_canon (hashcode, t);
7452 if (!COMPLETE_TYPE_P (t))
7455 if (TYPE_CANONICAL (t) == t)
7457 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7458 SET_TYPE_STRUCTURAL_EQUALITY (t);
7459 else if (TYPE_CANONICAL (component_type) != component_type)
7461 = build_complex_type (TYPE_CANONICAL (component_type));
7464 /* We need to create a name, since complex is a fundamental type. */
7465 if (! TYPE_NAME (t))
7468 if (component_type == char_type_node)
7469 name = "complex char";
7470 else if (component_type == signed_char_type_node)
7471 name = "complex signed char";
7472 else if (component_type == unsigned_char_type_node)
7473 name = "complex unsigned char";
7474 else if (component_type == short_integer_type_node)
7475 name = "complex short int";
7476 else if (component_type == short_unsigned_type_node)
7477 name = "complex short unsigned int";
7478 else if (component_type == integer_type_node)
7479 name = "complex int";
7480 else if (component_type == unsigned_type_node)
7481 name = "complex unsigned int";
7482 else if (component_type == long_integer_type_node)
7483 name = "complex long int";
7484 else if (component_type == long_unsigned_type_node)
7485 name = "complex long unsigned int";
7486 else if (component_type == long_long_integer_type_node)
7487 name = "complex long long int";
7488 else if (component_type == long_long_unsigned_type_node)
7489 name = "complex long long unsigned int";
7494 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7495 get_identifier (name), t);
7498 return build_qualified_type (t, TYPE_QUALS (component_type));
7501 /* If TYPE is a real or complex floating-point type and the target
7502 does not directly support arithmetic on TYPE then return the wider
7503 type to be used for arithmetic on TYPE. Otherwise, return
7507 excess_precision_type (tree type)
7509 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7511 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7512 switch (TREE_CODE (type))
7515 switch (flt_eval_method)
7518 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7519 return double_type_node;
7522 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7523 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7524 return long_double_type_node;
7531 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7533 switch (flt_eval_method)
7536 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7537 return complex_double_type_node;
7540 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7541 || (TYPE_MODE (TREE_TYPE (type))
7542 == TYPE_MODE (double_type_node)))
7543 return complex_long_double_type_node;
7556 /* Return OP, stripped of any conversions to wider types as much as is safe.
7557 Converting the value back to OP's type makes a value equivalent to OP.
7559 If FOR_TYPE is nonzero, we return a value which, if converted to
7560 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7562 OP must have integer, real or enumeral type. Pointers are not allowed!
7564 There are some cases where the obvious value we could return
7565 would regenerate to OP if converted to OP's type,
7566 but would not extend like OP to wider types.
7567 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7568 For example, if OP is (unsigned short)(signed char)-1,
7569 we avoid returning (signed char)-1 if FOR_TYPE is int,
7570 even though extending that to an unsigned short would regenerate OP,
7571 since the result of extending (signed char)-1 to (int)
7572 is different from (int) OP. */
7575 get_unwidened (tree op, tree for_type)
7577 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7578 tree type = TREE_TYPE (op);
7580 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7582 = (for_type != 0 && for_type != type
7583 && final_prec > TYPE_PRECISION (type)
7584 && TYPE_UNSIGNED (type));
7587 while (CONVERT_EXPR_P (op))
7591 /* TYPE_PRECISION on vector types has different meaning
7592 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7593 so avoid them here. */
7594 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7597 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7598 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7600 /* Truncations are many-one so cannot be removed.
7601 Unless we are later going to truncate down even farther. */
7603 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7606 /* See what's inside this conversion. If we decide to strip it,
7608 op = TREE_OPERAND (op, 0);
7610 /* If we have not stripped any zero-extensions (uns is 0),
7611 we can strip any kind of extension.
7612 If we have previously stripped a zero-extension,
7613 only zero-extensions can safely be stripped.
7614 Any extension can be stripped if the bits it would produce
7615 are all going to be discarded later by truncating to FOR_TYPE. */
7619 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7621 /* TYPE_UNSIGNED says whether this is a zero-extension.
7622 Let's avoid computing it if it does not affect WIN
7623 and if UNS will not be needed again. */
7625 || CONVERT_EXPR_P (op))
7626 && TYPE_UNSIGNED (TREE_TYPE (op)))
7637 /* Return OP or a simpler expression for a narrower value
7638 which can be sign-extended or zero-extended to give back OP.
7639 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7640 or 0 if the value should be sign-extended. */
7643 get_narrower (tree op, int *unsignedp_ptr)
7648 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7650 while (TREE_CODE (op) == NOP_EXPR)
7653 = (TYPE_PRECISION (TREE_TYPE (op))
7654 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7656 /* Truncations are many-one so cannot be removed. */
7660 /* See what's inside this conversion. If we decide to strip it,
7665 op = TREE_OPERAND (op, 0);
7666 /* An extension: the outermost one can be stripped,
7667 but remember whether it is zero or sign extension. */
7669 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7670 /* Otherwise, if a sign extension has been stripped,
7671 only sign extensions can now be stripped;
7672 if a zero extension has been stripped, only zero-extensions. */
7673 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7677 else /* bitschange == 0 */
7679 /* A change in nominal type can always be stripped, but we must
7680 preserve the unsignedness. */
7682 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7684 op = TREE_OPERAND (op, 0);
7685 /* Keep trying to narrow, but don't assign op to win if it
7686 would turn an integral type into something else. */
7687 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7694 if (TREE_CODE (op) == COMPONENT_REF
7695 /* Since type_for_size always gives an integer type. */
7696 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7697 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7698 /* Ensure field is laid out already. */
7699 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7700 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7702 unsigned HOST_WIDE_INT innerprec
7703 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7704 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7705 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7706 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7708 /* We can get this structure field in a narrower type that fits it,
7709 but the resulting extension to its nominal type (a fullword type)
7710 must satisfy the same conditions as for other extensions.
7712 Do this only for fields that are aligned (not bit-fields),
7713 because when bit-field insns will be used there is no
7714 advantage in doing this. */
7716 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7717 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7718 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7722 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7723 win = fold_convert (type, op);
7727 *unsignedp_ptr = uns;
7731 /* Nonzero if integer constant C has a value that is permissible
7732 for type TYPE (an INTEGER_TYPE). */
7735 int_fits_type_p (const_tree c, const_tree type)
7737 tree type_low_bound, type_high_bound;
7738 bool ok_for_low_bound, ok_for_high_bound, unsc;
7741 dc = tree_to_double_int (c);
7742 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7744 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7745 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7747 /* So c is an unsigned integer whose type is sizetype and type is not.
7748 sizetype'd integers are sign extended even though they are
7749 unsigned. If the integer value fits in the lower end word of c,
7750 and if the higher end word has all its bits set to 1, that
7751 means the higher end bits are set to 1 only for sign extension.
7752 So let's convert c into an equivalent zero extended unsigned
7754 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7757 type_low_bound = TYPE_MIN_VALUE (type);
7758 type_high_bound = TYPE_MAX_VALUE (type);
7760 /* If at least one bound of the type is a constant integer, we can check
7761 ourselves and maybe make a decision. If no such decision is possible, but
7762 this type is a subtype, try checking against that. Otherwise, use
7763 fit_double_type, which checks against the precision.
7765 Compute the status for each possibly constant bound, and return if we see
7766 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7767 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7768 for "constant known to fit". */
7770 /* Check if c >= type_low_bound. */
7771 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7773 dd = tree_to_double_int (type_low_bound);
7774 if (TREE_CODE (type) == INTEGER_TYPE
7775 && TYPE_IS_SIZETYPE (type)
7776 && TYPE_UNSIGNED (type))
7777 dd = double_int_zext (dd, TYPE_PRECISION (type));
7778 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7780 int c_neg = (!unsc && double_int_negative_p (dc));
7781 int t_neg = (unsc && double_int_negative_p (dd));
7783 if (c_neg && !t_neg)
7785 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7788 else if (double_int_cmp (dc, dd, unsc) < 0)
7790 ok_for_low_bound = true;
7793 ok_for_low_bound = false;
7795 /* Check if c <= type_high_bound. */
7796 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7798 dd = tree_to_double_int (type_high_bound);
7799 if (TREE_CODE (type) == INTEGER_TYPE
7800 && TYPE_IS_SIZETYPE (type)
7801 && TYPE_UNSIGNED (type))
7802 dd = double_int_zext (dd, TYPE_PRECISION (type));
7803 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7805 int c_neg = (!unsc && double_int_negative_p (dc));
7806 int t_neg = (unsc && double_int_negative_p (dd));
7808 if (t_neg && !c_neg)
7810 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7813 else if (double_int_cmp (dc, dd, unsc) > 0)
7815 ok_for_high_bound = true;
7818 ok_for_high_bound = false;
7820 /* If the constant fits both bounds, the result is known. */
7821 if (ok_for_low_bound && ok_for_high_bound)
7824 /* Perform some generic filtering which may allow making a decision
7825 even if the bounds are not constant. First, negative integers
7826 never fit in unsigned types, */
7827 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7830 /* Second, narrower types always fit in wider ones. */
7831 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7834 /* Third, unsigned integers with top bit set never fit signed types. */
7835 if (! TYPE_UNSIGNED (type) && unsc)
7837 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7838 if (prec < HOST_BITS_PER_WIDE_INT)
7840 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7843 else if (((((unsigned HOST_WIDE_INT) 1)
7844 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7848 /* If we haven't been able to decide at this point, there nothing more we
7849 can check ourselves here. Look at the base type if we have one and it
7850 has the same precision. */
7851 if (TREE_CODE (type) == INTEGER_TYPE
7852 && TREE_TYPE (type) != 0
7853 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7855 type = TREE_TYPE (type);
7859 /* Or to fit_double_type, if nothing else. */
7860 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7863 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7864 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7865 represented (assuming two's-complement arithmetic) within the bit
7866 precision of the type are returned instead. */
7869 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7871 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7872 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7873 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7874 TYPE_UNSIGNED (type));
7877 if (TYPE_UNSIGNED (type))
7878 mpz_set_ui (min, 0);
7882 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7883 mn = double_int_sext (double_int_add (mn, double_int_one),
7884 TYPE_PRECISION (type));
7885 mpz_set_double_int (min, mn, false);
7889 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7890 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7891 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7892 TYPE_UNSIGNED (type));
7895 if (TYPE_UNSIGNED (type))
7896 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7899 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7904 /* Return true if VAR is an automatic variable defined in function FN. */
7907 auto_var_in_fn_p (const_tree var, const_tree fn)
7909 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7910 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
7911 && ! TREE_STATIC (var))
7912 || TREE_CODE (var) == LABEL_DECL
7913 || TREE_CODE (var) == RESULT_DECL));
7916 /* Subprogram of following function. Called by walk_tree.
7918 Return *TP if it is an automatic variable or parameter of the
7919 function passed in as DATA. */
7922 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7924 tree fn = (tree) data;
7929 else if (DECL_P (*tp)
7930 && auto_var_in_fn_p (*tp, fn))
7936 /* Returns true if T is, contains, or refers to a type with variable
7937 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7938 arguments, but not the return type. If FN is nonzero, only return
7939 true if a modifier of the type or position of FN is a variable or
7940 parameter inside FN.
7942 This concept is more general than that of C99 'variably modified types':
7943 in C99, a struct type is never variably modified because a VLA may not
7944 appear as a structure member. However, in GNU C code like:
7946 struct S { int i[f()]; };
7948 is valid, and other languages may define similar constructs. */
7951 variably_modified_type_p (tree type, tree fn)
7955 /* Test if T is either variable (if FN is zero) or an expression containing
7956 a variable in FN. */
7957 #define RETURN_TRUE_IF_VAR(T) \
7958 do { tree _t = (T); \
7959 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7960 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7961 return true; } while (0)
7963 if (type == error_mark_node)
7966 /* If TYPE itself has variable size, it is variably modified. */
7967 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7968 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
7970 switch (TREE_CODE (type))
7973 case REFERENCE_TYPE:
7975 if (variably_modified_type_p (TREE_TYPE (type), fn))
7981 /* If TYPE is a function type, it is variably modified if the
7982 return type is variably modified. */
7983 if (variably_modified_type_p (TREE_TYPE (type), fn))
7989 case FIXED_POINT_TYPE:
7992 /* Scalar types are variably modified if their end points
7994 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
7995 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8000 case QUAL_UNION_TYPE:
8001 /* We can't see if any of the fields are variably-modified by the
8002 definition we normally use, since that would produce infinite
8003 recursion via pointers. */
8004 /* This is variably modified if some field's type is. */
8005 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
8006 if (TREE_CODE (t) == FIELD_DECL)
8008 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8009 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8010 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8012 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8013 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8018 /* Do not call ourselves to avoid infinite recursion. This is
8019 variably modified if the element type is. */
8020 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8021 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8028 /* The current language may have other cases to check, but in general,
8029 all other types are not variably modified. */
8030 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8032 #undef RETURN_TRUE_IF_VAR
8035 /* Given a DECL or TYPE, return the scope in which it was declared, or
8036 NULL_TREE if there is no containing scope. */
8039 get_containing_scope (const_tree t)
8041 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8044 /* Return the innermost context enclosing DECL that is
8045 a FUNCTION_DECL, or zero if none. */
8048 decl_function_context (const_tree decl)
8052 if (TREE_CODE (decl) == ERROR_MARK)
8055 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8056 where we look up the function at runtime. Such functions always take
8057 a first argument of type 'pointer to real context'.
8059 C++ should really be fixed to use DECL_CONTEXT for the real context,
8060 and use something else for the "virtual context". */
8061 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8064 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8066 context = DECL_CONTEXT (decl);
8068 while (context && TREE_CODE (context) != FUNCTION_DECL)
8070 if (TREE_CODE (context) == BLOCK)
8071 context = BLOCK_SUPERCONTEXT (context);
8073 context = get_containing_scope (context);
8079 /* Return the innermost context enclosing DECL that is
8080 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8081 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8084 decl_type_context (const_tree decl)
8086 tree context = DECL_CONTEXT (decl);
8089 switch (TREE_CODE (context))
8091 case NAMESPACE_DECL:
8092 case TRANSLATION_UNIT_DECL:
8097 case QUAL_UNION_TYPE:
8102 context = DECL_CONTEXT (context);
8106 context = BLOCK_SUPERCONTEXT (context);
8116 /* CALL is a CALL_EXPR. Return the declaration for the function
8117 called, or NULL_TREE if the called function cannot be
8121 get_callee_fndecl (const_tree call)
8125 if (call == error_mark_node)
8126 return error_mark_node;
8128 /* It's invalid to call this function with anything but a
8130 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8132 /* The first operand to the CALL is the address of the function
8134 addr = CALL_EXPR_FN (call);
8138 /* If this is a readonly function pointer, extract its initial value. */
8139 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8140 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8141 && DECL_INITIAL (addr))
8142 addr = DECL_INITIAL (addr);
8144 /* If the address is just `&f' for some function `f', then we know
8145 that `f' is being called. */
8146 if (TREE_CODE (addr) == ADDR_EXPR
8147 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8148 return TREE_OPERAND (addr, 0);
8150 /* We couldn't figure out what was being called. */
8154 /* Print debugging information about tree nodes generated during the compile,
8155 and any language-specific information. */
8158 dump_tree_statistics (void)
8160 #ifdef GATHER_STATISTICS
8162 int total_nodes, total_bytes;
8165 fprintf (stderr, "\n??? tree nodes created\n\n");
8166 #ifdef GATHER_STATISTICS
8167 fprintf (stderr, "Kind Nodes Bytes\n");
8168 fprintf (stderr, "---------------------------------------\n");
8169 total_nodes = total_bytes = 0;
8170 for (i = 0; i < (int) all_kinds; i++)
8172 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8173 tree_node_counts[i], tree_node_sizes[i]);
8174 total_nodes += tree_node_counts[i];
8175 total_bytes += tree_node_sizes[i];
8177 fprintf (stderr, "---------------------------------------\n");
8178 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8179 fprintf (stderr, "---------------------------------------\n");
8180 ssanames_print_statistics ();
8181 phinodes_print_statistics ();
8183 fprintf (stderr, "(No per-node statistics)\n");
8185 print_type_hash_statistics ();
8186 print_debug_expr_statistics ();
8187 print_value_expr_statistics ();
8188 lang_hooks.print_statistics ();
8191 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8193 /* Generate a crc32 of a string. */
8196 crc32_string (unsigned chksum, const char *string)
8200 unsigned value = *string << 24;
8203 for (ix = 8; ix--; value <<= 1)
8207 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8216 /* P is a string that will be used in a symbol. Mask out any characters
8217 that are not valid in that context. */
8220 clean_symbol_name (char *p)
8224 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8227 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8234 /* Generate a name for a special-purpose function function.
8235 The generated name may need to be unique across the whole link.
8236 TYPE is some string to identify the purpose of this function to the
8237 linker or collect2; it must start with an uppercase letter,
8239 I - for constructors
8241 N - for C++ anonymous namespaces
8242 F - for DWARF unwind frame information. */
8245 get_file_function_name (const char *type)
8251 /* If we already have a name we know to be unique, just use that. */
8252 if (first_global_object_name)
8253 p = q = ASTRDUP (first_global_object_name);
8254 /* If the target is handling the constructors/destructors, they
8255 will be local to this file and the name is only necessary for
8256 debugging purposes. */
8257 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8259 const char *file = main_input_filename;
8261 file = input_filename;
8262 /* Just use the file's basename, because the full pathname
8263 might be quite long. */
8264 p = strrchr (file, '/');
8269 p = q = ASTRDUP (p);
8273 /* Otherwise, the name must be unique across the entire link.
8274 We don't have anything that we know to be unique to this translation
8275 unit, so use what we do have and throw in some randomness. */
8277 const char *name = weak_global_object_name;
8278 const char *file = main_input_filename;
8283 file = input_filename;
8285 len = strlen (file);
8286 q = (char *) alloca (9 * 2 + len + 1);
8287 memcpy (q, file, len + 1);
8289 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8290 crc32_string (0, get_random_seed (false)));
8295 clean_symbol_name (q);
8296 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8299 /* Set up the name of the file-level functions we may need.
8300 Use a global object (which is already required to be unique over
8301 the program) rather than the file name (which imposes extra
8303 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8305 return get_identifier (buf);
8308 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8310 /* Complain that the tree code of NODE does not match the expected 0
8311 terminated list of trailing codes. The trailing code list can be
8312 empty, for a more vague error message. FILE, LINE, and FUNCTION
8313 are of the caller. */
8316 tree_check_failed (const_tree node, const char *file,
8317 int line, const char *function, ...)
8321 unsigned length = 0;
8324 va_start (args, function);
8325 while ((code = va_arg (args, int)))
8326 length += 4 + strlen (tree_code_name[code]);
8331 va_start (args, function);
8332 length += strlen ("expected ");
8333 buffer = tmp = (char *) alloca (length);
8335 while ((code = va_arg (args, int)))
8337 const char *prefix = length ? " or " : "expected ";
8339 strcpy (tmp + length, prefix);
8340 length += strlen (prefix);
8341 strcpy (tmp + length, tree_code_name[code]);
8342 length += strlen (tree_code_name[code]);
8347 buffer = "unexpected node";
8349 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8350 buffer, tree_code_name[TREE_CODE (node)],
8351 function, trim_filename (file), line);
8354 /* Complain that the tree code of NODE does match the expected 0
8355 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8359 tree_not_check_failed (const_tree node, const char *file,
8360 int line, const char *function, ...)
8364 unsigned length = 0;
8367 va_start (args, function);
8368 while ((code = va_arg (args, int)))
8369 length += 4 + strlen (tree_code_name[code]);
8371 va_start (args, function);
8372 buffer = (char *) alloca (length);
8374 while ((code = va_arg (args, int)))
8378 strcpy (buffer + length, " or ");
8381 strcpy (buffer + length, tree_code_name[code]);
8382 length += strlen (tree_code_name[code]);
8386 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8387 buffer, tree_code_name[TREE_CODE (node)],
8388 function, trim_filename (file), line);
8391 /* Similar to tree_check_failed, except that we check for a class of tree
8392 code, given in CL. */
8395 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8396 const char *file, int line, const char *function)
8399 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8400 TREE_CODE_CLASS_STRING (cl),
8401 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8402 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8405 /* Similar to tree_check_failed, except that instead of specifying a
8406 dozen codes, use the knowledge that they're all sequential. */
8409 tree_range_check_failed (const_tree node, const char *file, int line,
8410 const char *function, enum tree_code c1,
8414 unsigned length = 0;
8417 for (c = c1; c <= c2; ++c)
8418 length += 4 + strlen (tree_code_name[c]);
8420 length += strlen ("expected ");
8421 buffer = (char *) alloca (length);
8424 for (c = c1; c <= c2; ++c)
8426 const char *prefix = length ? " or " : "expected ";
8428 strcpy (buffer + length, prefix);
8429 length += strlen (prefix);
8430 strcpy (buffer + length, tree_code_name[c]);
8431 length += strlen (tree_code_name[c]);
8434 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8435 buffer, tree_code_name[TREE_CODE (node)],
8436 function, trim_filename (file), line);
8440 /* Similar to tree_check_failed, except that we check that a tree does
8441 not have the specified code, given in CL. */
8444 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8445 const char *file, int line, const char *function)
8448 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8449 TREE_CODE_CLASS_STRING (cl),
8450 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8451 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8455 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8458 omp_clause_check_failed (const_tree node, const char *file, int line,
8459 const char *function, enum omp_clause_code code)
8461 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8462 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8463 function, trim_filename (file), line);
8467 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8470 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8471 const char *function, enum omp_clause_code c1,
8472 enum omp_clause_code c2)
8475 unsigned length = 0;
8478 for (c = c1; c <= c2; ++c)
8479 length += 4 + strlen (omp_clause_code_name[c]);
8481 length += strlen ("expected ");
8482 buffer = (char *) alloca (length);
8485 for (c = c1; c <= c2; ++c)
8487 const char *prefix = length ? " or " : "expected ";
8489 strcpy (buffer + length, prefix);
8490 length += strlen (prefix);
8491 strcpy (buffer + length, omp_clause_code_name[c]);
8492 length += strlen (omp_clause_code_name[c]);
8495 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8496 buffer, omp_clause_code_name[TREE_CODE (node)],
8497 function, trim_filename (file), line);
8501 #undef DEFTREESTRUCT
8502 #define DEFTREESTRUCT(VAL, NAME) NAME,
8504 static const char *ts_enum_names[] = {
8505 #include "treestruct.def"
8507 #undef DEFTREESTRUCT
8509 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8511 /* Similar to tree_class_check_failed, except that we check for
8512 whether CODE contains the tree structure identified by EN. */
8515 tree_contains_struct_check_failed (const_tree node,
8516 const enum tree_node_structure_enum en,
8517 const char *file, int line,
8518 const char *function)
8521 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8523 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8527 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8528 (dynamically sized) vector. */
8531 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8532 const char *function)
8535 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8536 idx + 1, len, function, trim_filename (file), line);
8539 /* Similar to above, except that the check is for the bounds of the operand
8540 vector of an expression node EXP. */
8543 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8544 int line, const char *function)
8546 int code = TREE_CODE (exp);
8548 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8549 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8550 function, trim_filename (file), line);
8553 /* Similar to above, except that the check is for the number of
8554 operands of an OMP_CLAUSE node. */
8557 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8558 int line, const char *function)
8561 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8562 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8563 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8564 trim_filename (file), line);
8566 #endif /* ENABLE_TREE_CHECKING */
8568 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8569 and mapped to the machine mode MODE. Initialize its fields and build
8570 the information necessary for debugging output. */
8573 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8576 hashval_t hashcode = 0;
8578 t = make_node (VECTOR_TYPE);
8579 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8580 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8581 SET_TYPE_MODE (t, mode);
8583 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8584 SET_TYPE_STRUCTURAL_EQUALITY (t);
8585 else if (TYPE_CANONICAL (innertype) != innertype
8586 || mode != VOIDmode)
8588 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8593 tree index = build_int_cst (NULL_TREE, nunits - 1);
8594 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8595 build_index_type (index));
8596 tree rt = make_node (RECORD_TYPE);
8598 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8599 get_identifier ("f"), array);
8600 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8602 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8603 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8604 the representation type, and we want to find that die when looking up
8605 the vector type. This is most easily achieved by making the TYPE_UID
8607 TYPE_UID (rt) = TYPE_UID (t);
8610 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8611 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8612 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8613 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8614 t = type_hash_canon (hashcode, t);
8616 /* We have built a main variant, based on the main variant of the
8617 inner type. Use it to build the variant we return. */
8618 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8619 && TREE_TYPE (t) != innertype)
8620 return build_type_attribute_qual_variant (t,
8621 TYPE_ATTRIBUTES (innertype),
8622 TYPE_QUALS (innertype));
8628 make_or_reuse_type (unsigned size, int unsignedp)
8630 if (size == INT_TYPE_SIZE)
8631 return unsignedp ? unsigned_type_node : integer_type_node;
8632 if (size == CHAR_TYPE_SIZE)
8633 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8634 if (size == SHORT_TYPE_SIZE)
8635 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8636 if (size == LONG_TYPE_SIZE)
8637 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8638 if (size == LONG_LONG_TYPE_SIZE)
8639 return (unsignedp ? long_long_unsigned_type_node
8640 : long_long_integer_type_node);
8643 return make_unsigned_type (size);
8645 return make_signed_type (size);
8648 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8651 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8655 if (size == SHORT_FRACT_TYPE_SIZE)
8656 return unsignedp ? sat_unsigned_short_fract_type_node
8657 : sat_short_fract_type_node;
8658 if (size == FRACT_TYPE_SIZE)
8659 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8660 if (size == LONG_FRACT_TYPE_SIZE)
8661 return unsignedp ? sat_unsigned_long_fract_type_node
8662 : sat_long_fract_type_node;
8663 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8664 return unsignedp ? sat_unsigned_long_long_fract_type_node
8665 : sat_long_long_fract_type_node;
8669 if (size == SHORT_FRACT_TYPE_SIZE)
8670 return unsignedp ? unsigned_short_fract_type_node
8671 : short_fract_type_node;
8672 if (size == FRACT_TYPE_SIZE)
8673 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8674 if (size == LONG_FRACT_TYPE_SIZE)
8675 return unsignedp ? unsigned_long_fract_type_node
8676 : long_fract_type_node;
8677 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8678 return unsignedp ? unsigned_long_long_fract_type_node
8679 : long_long_fract_type_node;
8682 return make_fract_type (size, unsignedp, satp);
8685 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8688 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8692 if (size == SHORT_ACCUM_TYPE_SIZE)
8693 return unsignedp ? sat_unsigned_short_accum_type_node
8694 : sat_short_accum_type_node;
8695 if (size == ACCUM_TYPE_SIZE)
8696 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8697 if (size == LONG_ACCUM_TYPE_SIZE)
8698 return unsignedp ? sat_unsigned_long_accum_type_node
8699 : sat_long_accum_type_node;
8700 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8701 return unsignedp ? sat_unsigned_long_long_accum_type_node
8702 : sat_long_long_accum_type_node;
8706 if (size == SHORT_ACCUM_TYPE_SIZE)
8707 return unsignedp ? unsigned_short_accum_type_node
8708 : short_accum_type_node;
8709 if (size == ACCUM_TYPE_SIZE)
8710 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8711 if (size == LONG_ACCUM_TYPE_SIZE)
8712 return unsignedp ? unsigned_long_accum_type_node
8713 : long_accum_type_node;
8714 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8715 return unsignedp ? unsigned_long_long_accum_type_node
8716 : long_long_accum_type_node;
8719 return make_accum_type (size, unsignedp, satp);
8722 /* Create nodes for all integer types (and error_mark_node) using the sizes
8723 of C datatypes. The caller should call set_sizetype soon after calling
8724 this function to select one of the types as sizetype. */
8727 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
8729 error_mark_node = make_node (ERROR_MARK);
8730 TREE_TYPE (error_mark_node) = error_mark_node;
8732 initialize_sizetypes (signed_sizetype);
8734 /* Define both `signed char' and `unsigned char'. */
8735 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8736 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8737 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8738 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8740 /* Define `char', which is like either `signed char' or `unsigned char'
8741 but not the same as either. */
8744 ? make_signed_type (CHAR_TYPE_SIZE)
8745 : make_unsigned_type (CHAR_TYPE_SIZE));
8746 TYPE_STRING_FLAG (char_type_node) = 1;
8748 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8749 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8750 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8751 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8752 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8753 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8754 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8755 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8757 /* Define a boolean type. This type only represents boolean values but
8758 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8759 Front ends which want to override this size (i.e. Java) can redefine
8760 boolean_type_node before calling build_common_tree_nodes_2. */
8761 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8762 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8763 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8764 TYPE_PRECISION (boolean_type_node) = 1;
8766 /* Fill in the rest of the sized types. Reuse existing type nodes
8768 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8769 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8770 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8771 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8772 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8774 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8775 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8776 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8777 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8778 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8780 access_public_node = get_identifier ("public");
8781 access_protected_node = get_identifier ("protected");
8782 access_private_node = get_identifier ("private");
8785 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8786 It will create several other common tree nodes. */
8789 build_common_tree_nodes_2 (int short_double)
8791 /* Define these next since types below may used them. */
8792 integer_zero_node = build_int_cst (NULL_TREE, 0);
8793 integer_one_node = build_int_cst (NULL_TREE, 1);
8794 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8796 size_zero_node = size_int (0);
8797 size_one_node = size_int (1);
8798 bitsize_zero_node = bitsize_int (0);
8799 bitsize_one_node = bitsize_int (1);
8800 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8802 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8803 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8805 void_type_node = make_node (VOID_TYPE);
8806 layout_type (void_type_node);
8808 /* We are not going to have real types in C with less than byte alignment,
8809 so we might as well not have any types that claim to have it. */
8810 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8811 TYPE_USER_ALIGN (void_type_node) = 0;
8813 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8814 layout_type (TREE_TYPE (null_pointer_node));
8816 ptr_type_node = build_pointer_type (void_type_node);
8818 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8819 fileptr_type_node = ptr_type_node;
8821 float_type_node = make_node (REAL_TYPE);
8822 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8823 layout_type (float_type_node);
8825 double_type_node = make_node (REAL_TYPE);
8827 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8829 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8830 layout_type (double_type_node);
8832 long_double_type_node = make_node (REAL_TYPE);
8833 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8834 layout_type (long_double_type_node);
8836 float_ptr_type_node = build_pointer_type (float_type_node);
8837 double_ptr_type_node = build_pointer_type (double_type_node);
8838 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8839 integer_ptr_type_node = build_pointer_type (integer_type_node);
8841 /* Fixed size integer types. */
8842 uint32_type_node = build_nonstandard_integer_type (32, true);
8843 uint64_type_node = build_nonstandard_integer_type (64, true);
8845 /* Decimal float types. */
8846 dfloat32_type_node = make_node (REAL_TYPE);
8847 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8848 layout_type (dfloat32_type_node);
8849 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8850 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8852 dfloat64_type_node = make_node (REAL_TYPE);
8853 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8854 layout_type (dfloat64_type_node);
8855 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8856 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8858 dfloat128_type_node = make_node (REAL_TYPE);
8859 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8860 layout_type (dfloat128_type_node);
8861 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8862 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8864 complex_integer_type_node = build_complex_type (integer_type_node);
8865 complex_float_type_node = build_complex_type (float_type_node);
8866 complex_double_type_node = build_complex_type (double_type_node);
8867 complex_long_double_type_node = build_complex_type (long_double_type_node);
8869 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8870 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8871 sat_ ## KIND ## _type_node = \
8872 make_sat_signed_ ## KIND ## _type (SIZE); \
8873 sat_unsigned_ ## KIND ## _type_node = \
8874 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8875 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8876 unsigned_ ## KIND ## _type_node = \
8877 make_unsigned_ ## KIND ## _type (SIZE);
8879 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8880 sat_ ## WIDTH ## KIND ## _type_node = \
8881 make_sat_signed_ ## KIND ## _type (SIZE); \
8882 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8883 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8884 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8885 unsigned_ ## WIDTH ## KIND ## _type_node = \
8886 make_unsigned_ ## KIND ## _type (SIZE);
8888 /* Make fixed-point type nodes based on four different widths. */
8889 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8890 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8891 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8892 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8893 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8895 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8896 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8897 NAME ## _type_node = \
8898 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8899 u ## NAME ## _type_node = \
8900 make_or_reuse_unsigned_ ## KIND ## _type \
8901 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8902 sat_ ## NAME ## _type_node = \
8903 make_or_reuse_sat_signed_ ## KIND ## _type \
8904 (GET_MODE_BITSIZE (MODE ## mode)); \
8905 sat_u ## NAME ## _type_node = \
8906 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8907 (GET_MODE_BITSIZE (U ## MODE ## mode));
8909 /* Fixed-point type and mode nodes. */
8910 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8911 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8912 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8913 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8914 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8915 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8916 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8917 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8918 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8919 MAKE_FIXED_MODE_NODE (accum, da, DA)
8920 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8923 tree t = targetm.build_builtin_va_list ();
8925 /* Many back-ends define record types without setting TYPE_NAME.
8926 If we copied the record type here, we'd keep the original
8927 record type without a name. This breaks name mangling. So,
8928 don't copy record types and let c_common_nodes_and_builtins()
8929 declare the type to be __builtin_va_list. */
8930 if (TREE_CODE (t) != RECORD_TYPE)
8931 t = build_variant_type_copy (t);
8933 va_list_type_node = t;
8937 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8940 local_define_builtin (const char *name, tree type, enum built_in_function code,
8941 const char *library_name, int ecf_flags)
8945 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8946 library_name, NULL_TREE);
8947 if (ecf_flags & ECF_CONST)
8948 TREE_READONLY (decl) = 1;
8949 if (ecf_flags & ECF_PURE)
8950 DECL_PURE_P (decl) = 1;
8951 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8952 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8953 if (ecf_flags & ECF_NORETURN)
8954 TREE_THIS_VOLATILE (decl) = 1;
8955 if (ecf_flags & ECF_NOTHROW)
8956 TREE_NOTHROW (decl) = 1;
8957 if (ecf_flags & ECF_MALLOC)
8958 DECL_IS_MALLOC (decl) = 1;
8960 built_in_decls[code] = decl;
8961 implicit_built_in_decls[code] = decl;
8964 /* Call this function after instantiating all builtins that the language
8965 front end cares about. This will build the rest of the builtins that
8966 are relied upon by the tree optimizers and the middle-end. */
8969 build_common_builtin_nodes (void)
8971 tree tmp, tmp2, ftype;
8973 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
8974 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8976 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8977 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8978 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8979 ftype = build_function_type (ptr_type_node, tmp);
8981 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
8982 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
8983 "memcpy", ECF_NOTHROW);
8984 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8985 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
8986 "memmove", ECF_NOTHROW);
8989 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
8991 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8992 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8993 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8994 ftype = build_function_type (integer_type_node, tmp);
8995 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
8996 "memcmp", ECF_PURE | ECF_NOTHROW);
8999 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9001 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9002 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9003 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9004 ftype = build_function_type (ptr_type_node, tmp);
9005 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9006 "memset", ECF_NOTHROW);
9009 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9011 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
9012 ftype = build_function_type (ptr_type_node, tmp);
9013 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9014 "alloca", ECF_NOTHROW | ECF_MALLOC);
9017 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9018 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9019 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9020 ftype = build_function_type (void_type_node, tmp);
9021 local_define_builtin ("__builtin_init_trampoline", ftype,
9022 BUILT_IN_INIT_TRAMPOLINE,
9023 "__builtin_init_trampoline", ECF_NOTHROW);
9025 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9026 ftype = build_function_type (ptr_type_node, tmp);
9027 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9028 BUILT_IN_ADJUST_TRAMPOLINE,
9029 "__builtin_adjust_trampoline",
9030 ECF_CONST | ECF_NOTHROW);
9032 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9033 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9034 ftype = build_function_type (void_type_node, tmp);
9035 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9036 BUILT_IN_NONLOCAL_GOTO,
9037 "__builtin_nonlocal_goto",
9038 ECF_NORETURN | ECF_NOTHROW);
9040 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9041 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9042 ftype = build_function_type (void_type_node, tmp);
9043 local_define_builtin ("__builtin_setjmp_setup", ftype,
9044 BUILT_IN_SETJMP_SETUP,
9045 "__builtin_setjmp_setup", ECF_NOTHROW);
9047 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9048 ftype = build_function_type (ptr_type_node, tmp);
9049 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9050 BUILT_IN_SETJMP_DISPATCHER,
9051 "__builtin_setjmp_dispatcher",
9052 ECF_PURE | ECF_NOTHROW);
9054 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9055 ftype = build_function_type (void_type_node, tmp);
9056 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9057 BUILT_IN_SETJMP_RECEIVER,
9058 "__builtin_setjmp_receiver", ECF_NOTHROW);
9060 ftype = build_function_type (ptr_type_node, void_list_node);
9061 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9062 "__builtin_stack_save", ECF_NOTHROW);
9064 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9065 ftype = build_function_type (void_type_node, tmp);
9066 local_define_builtin ("__builtin_stack_restore", ftype,
9067 BUILT_IN_STACK_RESTORE,
9068 "__builtin_stack_restore", ECF_NOTHROW);
9070 ftype = build_function_type (void_type_node, void_list_node);
9071 local_define_builtin ("__builtin_profile_func_enter", ftype,
9072 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9073 local_define_builtin ("__builtin_profile_func_exit", ftype,
9074 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9076 /* If there's a possibility that we might use the ARM EABI, build the
9077 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9078 if (targetm.arm_eabi_unwinder)
9080 ftype = build_function_type (void_type_node, void_list_node);
9081 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9082 BUILT_IN_CXA_END_CLEANUP,
9083 "__cxa_end_cleanup", ECF_NORETURN);
9086 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9087 ftype = build_function_type (void_type_node, tmp);
9088 local_define_builtin ("__builtin_unwind_resume", ftype,
9089 BUILT_IN_UNWIND_RESUME,
9090 (USING_SJLJ_EXCEPTIONS
9091 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9094 /* The exception object and filter values from the runtime. The argument
9095 must be zero before exception lowering, i.e. from the front end. After
9096 exception lowering, it will be the region number for the exception
9097 landing pad. These functions are PURE instead of CONST to prevent
9098 them from being hoisted past the exception edge that will initialize
9099 its value in the landing pad. */
9100 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9101 ftype = build_function_type (ptr_type_node, tmp);
9102 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9103 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9105 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9106 ftype = build_function_type (tmp2, tmp);
9107 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9108 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9110 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9111 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9112 ftype = build_function_type (void_type_node, tmp);
9113 local_define_builtin ("__builtin_eh_copy_values", ftype,
9114 BUILT_IN_EH_COPY_VALUES,
9115 "__builtin_eh_copy_values", ECF_NOTHROW);
9117 /* Complex multiplication and division. These are handled as builtins
9118 rather than optabs because emit_library_call_value doesn't support
9119 complex. Further, we can do slightly better with folding these
9120 beasties if the real and complex parts of the arguments are separate. */
9124 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9126 char mode_name_buf[4], *q;
9128 enum built_in_function mcode, dcode;
9129 tree type, inner_type;
9131 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9134 inner_type = TREE_TYPE (type);
9136 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9137 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9138 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9139 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9140 ftype = build_function_type (type, tmp);
9142 mcode = ((enum built_in_function)
9143 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9144 dcode = ((enum built_in_function)
9145 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9147 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9151 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9152 local_define_builtin (built_in_names[mcode], ftype, mcode,
9153 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9155 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9156 local_define_builtin (built_in_names[dcode], ftype, dcode,
9157 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9162 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9165 If we requested a pointer to a vector, build up the pointers that
9166 we stripped off while looking for the inner type. Similarly for
9167 return values from functions.
9169 The argument TYPE is the top of the chain, and BOTTOM is the
9170 new type which we will point to. */
9173 reconstruct_complex_type (tree type, tree bottom)
9177 if (TREE_CODE (type) == POINTER_TYPE)
9179 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9180 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9181 TYPE_REF_CAN_ALIAS_ALL (type));
9183 else if (TREE_CODE (type) == REFERENCE_TYPE)
9185 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9186 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9187 TYPE_REF_CAN_ALIAS_ALL (type));
9189 else if (TREE_CODE (type) == ARRAY_TYPE)
9191 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9192 outer = build_array_type (inner, TYPE_DOMAIN (type));
9194 else if (TREE_CODE (type) == FUNCTION_TYPE)
9196 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9197 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9199 else if (TREE_CODE (type) == METHOD_TYPE)
9201 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9202 /* The build_method_type_directly() routine prepends 'this' to argument list,
9203 so we must compensate by getting rid of it. */
9205 = build_method_type_directly
9206 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9208 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9210 else if (TREE_CODE (type) == OFFSET_TYPE)
9212 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9213 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9218 return build_qualified_type (outer, TYPE_QUALS (type));
9221 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9224 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9228 switch (GET_MODE_CLASS (mode))
9230 case MODE_VECTOR_INT:
9231 case MODE_VECTOR_FLOAT:
9232 case MODE_VECTOR_FRACT:
9233 case MODE_VECTOR_UFRACT:
9234 case MODE_VECTOR_ACCUM:
9235 case MODE_VECTOR_UACCUM:
9236 nunits = GET_MODE_NUNITS (mode);
9240 /* Check that there are no leftover bits. */
9241 gcc_assert (GET_MODE_BITSIZE (mode)
9242 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9244 nunits = GET_MODE_BITSIZE (mode)
9245 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9252 return make_vector_type (innertype, nunits, mode);
9255 /* Similarly, but takes the inner type and number of units, which must be
9259 build_vector_type (tree innertype, int nunits)
9261 return make_vector_type (innertype, nunits, VOIDmode);
9264 /* Similarly, but takes the inner type and number of units, which must be
9268 build_opaque_vector_type (tree innertype, int nunits)
9271 innertype = build_distinct_type_copy (innertype);
9272 t = make_vector_type (innertype, nunits, VOIDmode);
9273 TYPE_VECTOR_OPAQUE (t) = true;
9278 /* Given an initializer INIT, return TRUE if INIT is zero or some
9279 aggregate of zeros. Otherwise return FALSE. */
9281 initializer_zerop (const_tree init)
9287 switch (TREE_CODE (init))
9290 return integer_zerop (init);
9293 /* ??? Note that this is not correct for C4X float formats. There,
9294 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9295 negative exponent. */
9296 return real_zerop (init)
9297 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9300 return fixed_zerop (init);
9303 return integer_zerop (init)
9304 || (real_zerop (init)
9305 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9306 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9309 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9310 if (!initializer_zerop (TREE_VALUE (elt)))
9316 unsigned HOST_WIDE_INT idx;
9318 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9319 if (!initializer_zerop (elt))
9329 /* Build an empty statement at location LOC. */
9332 build_empty_stmt (location_t loc)
9334 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9335 SET_EXPR_LOCATION (t, loc);
9340 /* Build an OpenMP clause with code CODE. LOC is the location of the
9344 build_omp_clause (location_t loc, enum omp_clause_code code)
9349 length = omp_clause_num_ops[code];
9350 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9352 t = GGC_NEWVAR (union tree_node, size);
9353 memset (t, 0, size);
9354 TREE_SET_CODE (t, OMP_CLAUSE);
9355 OMP_CLAUSE_SET_CODE (t, code);
9356 OMP_CLAUSE_LOCATION (t) = loc;
9358 #ifdef GATHER_STATISTICS
9359 tree_node_counts[(int) omp_clause_kind]++;
9360 tree_node_sizes[(int) omp_clause_kind] += size;
9366 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9367 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9368 Except for the CODE and operand count field, other storage for the
9369 object is initialized to zeros. */
9372 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9375 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9377 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9378 gcc_assert (len >= 1);
9380 #ifdef GATHER_STATISTICS
9381 tree_node_counts[(int) e_kind]++;
9382 tree_node_sizes[(int) e_kind] += length;
9385 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9387 memset (t, 0, length);
9389 TREE_SET_CODE (t, code);
9391 /* Can't use TREE_OPERAND to store the length because if checking is
9392 enabled, it will try to check the length before we store it. :-P */
9393 t->exp.operands[0] = build_int_cst (sizetype, len);
9399 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9400 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9404 build_call_list (tree return_type, tree fn, tree arglist)
9409 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9410 TREE_TYPE (t) = return_type;
9411 CALL_EXPR_FN (t) = fn;
9412 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9413 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9414 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9415 process_call_operands (t);
9419 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9420 FN and a null static chain slot. NARGS is the number of call arguments
9421 which are specified as "..." arguments. */
9424 build_call_nary (tree return_type, tree fn, int nargs, ...)
9428 va_start (args, nargs);
9429 ret = build_call_valist (return_type, fn, nargs, args);
9434 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9435 FN and a null static chain slot. NARGS is the number of call arguments
9436 which are specified as a va_list ARGS. */
9439 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9444 t = build_vl_exp (CALL_EXPR, nargs + 3);
9445 TREE_TYPE (t) = return_type;
9446 CALL_EXPR_FN (t) = fn;
9447 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9448 for (i = 0; i < nargs; i++)
9449 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9450 process_call_operands (t);
9454 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9455 FN and a null static chain slot. NARGS is the number of call arguments
9456 which are specified as a tree array ARGS. */
9459 build_call_array_loc (location_t loc, tree return_type, tree fn,
9460 int nargs, const tree *args)
9465 t = build_vl_exp (CALL_EXPR, nargs + 3);
9466 TREE_TYPE (t) = return_type;
9467 CALL_EXPR_FN (t) = fn;
9468 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9469 for (i = 0; i < nargs; i++)
9470 CALL_EXPR_ARG (t, i) = args[i];
9471 process_call_operands (t);
9472 SET_EXPR_LOCATION (t, loc);
9476 /* Like build_call_array, but takes a VEC. */
9479 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9484 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9485 TREE_TYPE (ret) = return_type;
9486 CALL_EXPR_FN (ret) = fn;
9487 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9488 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9489 CALL_EXPR_ARG (ret, ix) = t;
9490 process_call_operands (ret);
9495 /* Returns true if it is possible to prove that the index of
9496 an array access REF (an ARRAY_REF expression) falls into the
9500 in_array_bounds_p (tree ref)
9502 tree idx = TREE_OPERAND (ref, 1);
9505 if (TREE_CODE (idx) != INTEGER_CST)
9508 min = array_ref_low_bound (ref);
9509 max = array_ref_up_bound (ref);
9512 || TREE_CODE (min) != INTEGER_CST
9513 || TREE_CODE (max) != INTEGER_CST)
9516 if (tree_int_cst_lt (idx, min)
9517 || tree_int_cst_lt (max, idx))
9523 /* Returns true if it is possible to prove that the range of
9524 an array access REF (an ARRAY_RANGE_REF expression) falls
9525 into the array bounds. */
9528 range_in_array_bounds_p (tree ref)
9530 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9531 tree range_min, range_max, min, max;
9533 range_min = TYPE_MIN_VALUE (domain_type);
9534 range_max = TYPE_MAX_VALUE (domain_type);
9537 || TREE_CODE (range_min) != INTEGER_CST
9538 || TREE_CODE (range_max) != INTEGER_CST)
9541 min = array_ref_low_bound (ref);
9542 max = array_ref_up_bound (ref);
9545 || TREE_CODE (min) != INTEGER_CST
9546 || TREE_CODE (max) != INTEGER_CST)
9549 if (tree_int_cst_lt (range_min, min)
9550 || tree_int_cst_lt (max, range_max))
9556 /* Return true if T (assumed to be a DECL) must be assigned a memory
9560 needs_to_live_in_memory (const_tree t)
9562 if (TREE_CODE (t) == SSA_NAME)
9563 t = SSA_NAME_VAR (t);
9565 return (TREE_ADDRESSABLE (t)
9566 || is_global_var (t)
9567 || (TREE_CODE (t) == RESULT_DECL
9568 && aggregate_value_p (t, current_function_decl)));
9571 /* There are situations in which a language considers record types
9572 compatible which have different field lists. Decide if two fields
9573 are compatible. It is assumed that the parent records are compatible. */
9576 fields_compatible_p (const_tree f1, const_tree f2)
9578 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9579 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9582 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9583 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9586 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9592 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9595 find_compatible_field (tree record, tree orig_field)
9599 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9600 if (TREE_CODE (f) == FIELD_DECL
9601 && fields_compatible_p (f, orig_field))
9604 /* ??? Why isn't this on the main fields list? */
9605 f = TYPE_VFIELD (record);
9606 if (f && TREE_CODE (f) == FIELD_DECL
9607 && fields_compatible_p (f, orig_field))
9610 /* ??? We should abort here, but Java appears to do Bad Things
9611 with inherited fields. */
9615 /* Return value of a constant X and sign-extend it. */
9618 int_cst_value (const_tree x)
9620 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9621 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9623 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9624 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9625 || TREE_INT_CST_HIGH (x) == -1);
9627 if (bits < HOST_BITS_PER_WIDE_INT)
9629 bool negative = ((val >> (bits - 1)) & 1) != 0;
9631 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9633 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9639 /* Return value of a constant X and sign-extend it. */
9642 widest_int_cst_value (const_tree x)
9644 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9645 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9647 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9648 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9649 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9650 << HOST_BITS_PER_WIDE_INT);
9652 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9653 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9654 || TREE_INT_CST_HIGH (x) == -1);
9657 if (bits < HOST_BITS_PER_WIDEST_INT)
9659 bool negative = ((val >> (bits - 1)) & 1) != 0;
9661 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9663 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9669 /* If TYPE is an integral type, return an equivalent type which is
9670 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9671 return TYPE itself. */
9674 signed_or_unsigned_type_for (int unsignedp, tree type)
9677 if (POINTER_TYPE_P (type))
9680 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9683 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9686 /* Returns unsigned variant of TYPE. */
9689 unsigned_type_for (tree type)
9691 return signed_or_unsigned_type_for (1, type);
9694 /* Returns signed variant of TYPE. */
9697 signed_type_for (tree type)
9699 return signed_or_unsigned_type_for (0, type);
9702 /* Returns the largest value obtainable by casting something in INNER type to
9706 upper_bound_in_type (tree outer, tree inner)
9708 unsigned HOST_WIDE_INT lo, hi;
9709 unsigned int det = 0;
9710 unsigned oprec = TYPE_PRECISION (outer);
9711 unsigned iprec = TYPE_PRECISION (inner);
9714 /* Compute a unique number for every combination. */
9715 det |= (oprec > iprec) ? 4 : 0;
9716 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9717 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9719 /* Determine the exponent to use. */
9724 /* oprec <= iprec, outer: signed, inner: don't care. */
9729 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9733 /* oprec > iprec, outer: signed, inner: signed. */
9737 /* oprec > iprec, outer: signed, inner: unsigned. */
9741 /* oprec > iprec, outer: unsigned, inner: signed. */
9745 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9752 /* Compute 2^^prec - 1. */
9753 if (prec <= HOST_BITS_PER_WIDE_INT)
9756 lo = ((~(unsigned HOST_WIDE_INT) 0)
9757 >> (HOST_BITS_PER_WIDE_INT - prec));
9761 hi = ((~(unsigned HOST_WIDE_INT) 0)
9762 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9763 lo = ~(unsigned HOST_WIDE_INT) 0;
9766 return build_int_cst_wide (outer, lo, hi);
9769 /* Returns the smallest value obtainable by casting something in INNER type to
9773 lower_bound_in_type (tree outer, tree inner)
9775 unsigned HOST_WIDE_INT lo, hi;
9776 unsigned oprec = TYPE_PRECISION (outer);
9777 unsigned iprec = TYPE_PRECISION (inner);
9779 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9781 if (TYPE_UNSIGNED (outer)
9782 /* If we are widening something of an unsigned type, OUTER type
9783 contains all values of INNER type. In particular, both INNER
9784 and OUTER types have zero in common. */
9785 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9789 /* If we are widening a signed type to another signed type, we
9790 want to obtain -2^^(iprec-1). If we are keeping the
9791 precision or narrowing to a signed type, we want to obtain
9793 unsigned prec = oprec > iprec ? iprec : oprec;
9795 if (prec <= HOST_BITS_PER_WIDE_INT)
9797 hi = ~(unsigned HOST_WIDE_INT) 0;
9798 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9802 hi = ((~(unsigned HOST_WIDE_INT) 0)
9803 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9808 return build_int_cst_wide (outer, lo, hi);
9811 /* Return nonzero if two operands that are suitable for PHI nodes are
9812 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9813 SSA_NAME or invariant. Note that this is strictly an optimization.
9814 That is, callers of this function can directly call operand_equal_p
9815 and get the same result, only slower. */
9818 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9822 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9824 return operand_equal_p (arg0, arg1, 0);
9827 /* Returns number of zeros at the end of binary representation of X.
9829 ??? Use ffs if available? */
9832 num_ending_zeros (const_tree x)
9834 unsigned HOST_WIDE_INT fr, nfr;
9835 unsigned num, abits;
9836 tree type = TREE_TYPE (x);
9838 if (TREE_INT_CST_LOW (x) == 0)
9840 num = HOST_BITS_PER_WIDE_INT;
9841 fr = TREE_INT_CST_HIGH (x);
9846 fr = TREE_INT_CST_LOW (x);
9849 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9852 if (nfr << abits == fr)
9859 if (num > TYPE_PRECISION (type))
9860 num = TYPE_PRECISION (type);
9862 return build_int_cst_type (type, num);
9866 #define WALK_SUBTREE(NODE) \
9869 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9875 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9876 be walked whenever a type is seen in the tree. Rest of operands and return
9877 value are as for walk_tree. */
9880 walk_type_fields (tree type, walk_tree_fn func, void *data,
9881 struct pointer_set_t *pset, walk_tree_lh lh)
9883 tree result = NULL_TREE;
9885 switch (TREE_CODE (type))
9888 case REFERENCE_TYPE:
9889 /* We have to worry about mutually recursive pointers. These can't
9890 be written in C. They can in Ada. It's pathological, but
9891 there's an ACATS test (c38102a) that checks it. Deal with this
9892 by checking if we're pointing to another pointer, that one
9893 points to another pointer, that one does too, and we have no htab.
9894 If so, get a hash table. We check three levels deep to avoid
9895 the cost of the hash table if we don't need one. */
9896 if (POINTER_TYPE_P (TREE_TYPE (type))
9897 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9898 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9901 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9909 /* ... fall through ... */
9912 WALK_SUBTREE (TREE_TYPE (type));
9916 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9921 WALK_SUBTREE (TREE_TYPE (type));
9925 /* We never want to walk into default arguments. */
9926 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9927 WALK_SUBTREE (TREE_VALUE (arg));
9932 /* Don't follow this nodes's type if a pointer for fear that
9933 we'll have infinite recursion. If we have a PSET, then we
9936 || (!POINTER_TYPE_P (TREE_TYPE (type))
9937 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9938 WALK_SUBTREE (TREE_TYPE (type));
9939 WALK_SUBTREE (TYPE_DOMAIN (type));
9943 WALK_SUBTREE (TREE_TYPE (type));
9944 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9954 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9955 called with the DATA and the address of each sub-tree. If FUNC returns a
9956 non-NULL value, the traversal is stopped, and the value returned by FUNC
9957 is returned. If PSET is non-NULL it is used to record the nodes visited,
9958 and to avoid visiting a node more than once. */
9961 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
9962 struct pointer_set_t *pset, walk_tree_lh lh)
9964 enum tree_code code;
9968 #define WALK_SUBTREE_TAIL(NODE) \
9972 goto tail_recurse; \
9977 /* Skip empty subtrees. */
9981 /* Don't walk the same tree twice, if the user has requested
9982 that we avoid doing so. */
9983 if (pset && pointer_set_insert (pset, *tp))
9986 /* Call the function. */
9988 result = (*func) (tp, &walk_subtrees, data);
9990 /* If we found something, return it. */
9994 code = TREE_CODE (*tp);
9996 /* Even if we didn't, FUNC may have decided that there was nothing
9997 interesting below this point in the tree. */
10000 /* But we still need to check our siblings. */
10001 if (code == TREE_LIST)
10002 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10003 else if (code == OMP_CLAUSE)
10004 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10011 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10012 if (result || !walk_subtrees)
10019 case IDENTIFIER_NODE:
10026 case PLACEHOLDER_EXPR:
10030 /* None of these have subtrees other than those already walked
10035 WALK_SUBTREE (TREE_VALUE (*tp));
10036 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10041 int len = TREE_VEC_LENGTH (*tp);
10046 /* Walk all elements but the first. */
10048 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10050 /* Now walk the first one as a tail call. */
10051 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10055 WALK_SUBTREE (TREE_REALPART (*tp));
10056 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10060 unsigned HOST_WIDE_INT idx;
10061 constructor_elt *ce;
10064 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10066 WALK_SUBTREE (ce->value);
10071 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10076 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10078 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10079 into declarations that are just mentioned, rather than
10080 declared; they don't really belong to this part of the tree.
10081 And, we can see cycles: the initializer for a declaration
10082 can refer to the declaration itself. */
10083 WALK_SUBTREE (DECL_INITIAL (decl));
10084 WALK_SUBTREE (DECL_SIZE (decl));
10085 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10087 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10090 case STATEMENT_LIST:
10092 tree_stmt_iterator i;
10093 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10094 WALK_SUBTREE (*tsi_stmt_ptr (i));
10099 switch (OMP_CLAUSE_CODE (*tp))
10101 case OMP_CLAUSE_PRIVATE:
10102 case OMP_CLAUSE_SHARED:
10103 case OMP_CLAUSE_FIRSTPRIVATE:
10104 case OMP_CLAUSE_COPYIN:
10105 case OMP_CLAUSE_COPYPRIVATE:
10106 case OMP_CLAUSE_IF:
10107 case OMP_CLAUSE_NUM_THREADS:
10108 case OMP_CLAUSE_SCHEDULE:
10109 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10112 case OMP_CLAUSE_NOWAIT:
10113 case OMP_CLAUSE_ORDERED:
10114 case OMP_CLAUSE_DEFAULT:
10115 case OMP_CLAUSE_UNTIED:
10116 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10118 case OMP_CLAUSE_LASTPRIVATE:
10119 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10120 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10121 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10123 case OMP_CLAUSE_COLLAPSE:
10126 for (i = 0; i < 3; i++)
10127 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10128 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10131 case OMP_CLAUSE_REDUCTION:
10134 for (i = 0; i < 4; i++)
10135 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10136 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10140 gcc_unreachable ();
10148 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10149 But, we only want to walk once. */
10150 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10151 for (i = 0; i < len; ++i)
10152 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10153 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10157 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10158 defining. We only want to walk into these fields of a type in this
10159 case and not in the general case of a mere reference to the type.
10161 The criterion is as follows: if the field can be an expression, it
10162 must be walked only here. This should be in keeping with the fields
10163 that are directly gimplified in gimplify_type_sizes in order for the
10164 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10165 variable-sized types.
10167 Note that DECLs get walked as part of processing the BIND_EXPR. */
10168 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10170 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10171 if (TREE_CODE (*type_p) == ERROR_MARK)
10174 /* Call the function for the type. See if it returns anything or
10175 doesn't want us to continue. If we are to continue, walk both
10176 the normal fields and those for the declaration case. */
10177 result = (*func) (type_p, &walk_subtrees, data);
10178 if (result || !walk_subtrees)
10181 result = walk_type_fields (*type_p, func, data, pset, lh);
10185 /* If this is a record type, also walk the fields. */
10186 if (RECORD_OR_UNION_TYPE_P (*type_p))
10190 for (field = TYPE_FIELDS (*type_p); field;
10191 field = TREE_CHAIN (field))
10193 /* We'd like to look at the type of the field, but we can
10194 easily get infinite recursion. So assume it's pointed
10195 to elsewhere in the tree. Also, ignore things that
10197 if (TREE_CODE (field) != FIELD_DECL)
10200 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10201 WALK_SUBTREE (DECL_SIZE (field));
10202 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10203 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10204 WALK_SUBTREE (DECL_QUALIFIER (field));
10208 /* Same for scalar types. */
10209 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10210 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10211 || TREE_CODE (*type_p) == INTEGER_TYPE
10212 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10213 || TREE_CODE (*type_p) == REAL_TYPE)
10215 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10216 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10219 WALK_SUBTREE (TYPE_SIZE (*type_p));
10220 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10225 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10229 /* Walk over all the sub-trees of this operand. */
10230 len = TREE_OPERAND_LENGTH (*tp);
10232 /* Go through the subtrees. We need to do this in forward order so
10233 that the scope of a FOR_EXPR is handled properly. */
10236 for (i = 0; i < len - 1; ++i)
10237 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10238 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10241 /* If this is a type, walk the needed fields in the type. */
10242 else if (TYPE_P (*tp))
10243 return walk_type_fields (*tp, func, data, pset, lh);
10247 /* We didn't find what we were looking for. */
10250 #undef WALK_SUBTREE_TAIL
10252 #undef WALK_SUBTREE
10254 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10257 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10261 struct pointer_set_t *pset;
10263 pset = pointer_set_create ();
10264 result = walk_tree_1 (tp, func, data, pset, lh);
10265 pointer_set_destroy (pset);
10271 tree_block (tree t)
10273 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10275 if (IS_EXPR_CODE_CLASS (c))
10276 return &t->exp.block;
10277 gcc_unreachable ();
10281 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10282 FIXME: don't use this function. It exists for compatibility with
10283 the old representation of CALL_EXPRs where a list was used to hold the
10284 arguments. Places that currently extract the arglist from a CALL_EXPR
10285 ought to be rewritten to use the CALL_EXPR itself. */
10287 call_expr_arglist (tree exp)
10289 tree arglist = NULL_TREE;
10291 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10292 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10297 /* Create a nameless artificial label and put it in the current
10298 function context. The label has a location of LOC. Returns the
10299 newly created label. */
10302 create_artificial_label (location_t loc)
10304 tree lab = build_decl (loc,
10305 LABEL_DECL, NULL_TREE, void_type_node);
10307 DECL_ARTIFICIAL (lab) = 1;
10308 DECL_IGNORED_P (lab) = 1;
10309 DECL_CONTEXT (lab) = current_function_decl;
10313 /* Given a tree, try to return a useful variable name that we can use
10314 to prefix a temporary that is being assigned the value of the tree.
10315 I.E. given <temp> = &A, return A. */
10320 tree stripped_decl;
10323 STRIP_NOPS (stripped_decl);
10324 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10325 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10328 switch (TREE_CODE (stripped_decl))
10331 return get_name (TREE_OPERAND (stripped_decl, 0));
10338 /* Return true if TYPE has a variable argument list. */
10341 stdarg_p (tree fntype)
10343 function_args_iterator args_iter;
10344 tree n = NULL_TREE, t;
10349 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10354 return n != NULL_TREE && n != void_type_node;
10357 /* Return true if TYPE has a prototype. */
10360 prototype_p (tree fntype)
10364 gcc_assert (fntype != NULL_TREE);
10366 t = TYPE_ARG_TYPES (fntype);
10367 return (t != NULL_TREE);
10370 /* If BLOCK is inlined from an __attribute__((__artificial__))
10371 routine, return pointer to location from where it has been
10374 block_nonartificial_location (tree block)
10376 location_t *ret = NULL;
10378 while (block && TREE_CODE (block) == BLOCK
10379 && BLOCK_ABSTRACT_ORIGIN (block))
10381 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10383 while (TREE_CODE (ao) == BLOCK
10384 && BLOCK_ABSTRACT_ORIGIN (ao)
10385 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10386 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10388 if (TREE_CODE (ao) == FUNCTION_DECL)
10390 /* If AO is an artificial inline, point RET to the
10391 call site locus at which it has been inlined and continue
10392 the loop, in case AO's caller is also an artificial
10394 if (DECL_DECLARED_INLINE_P (ao)
10395 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10396 ret = &BLOCK_SOURCE_LOCATION (block);
10400 else if (TREE_CODE (ao) != BLOCK)
10403 block = BLOCK_SUPERCONTEXT (block);
10409 /* If EXP is inlined from an __attribute__((__artificial__))
10410 function, return the location of the original call expression. */
10413 tree_nonartificial_location (tree exp)
10415 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10420 return EXPR_LOCATION (exp);
10424 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10427 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10430 cl_option_hash_hash (const void *x)
10432 const_tree const t = (const_tree) x;
10436 hashval_t hash = 0;
10438 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10440 p = (const char *)TREE_OPTIMIZATION (t);
10441 len = sizeof (struct cl_optimization);
10444 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10446 p = (const char *)TREE_TARGET_OPTION (t);
10447 len = sizeof (struct cl_target_option);
10451 gcc_unreachable ();
10453 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10455 for (i = 0; i < len; i++)
10457 hash = (hash << 4) ^ ((i << 2) | p[i]);
10462 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10463 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10467 cl_option_hash_eq (const void *x, const void *y)
10469 const_tree const xt = (const_tree) x;
10470 const_tree const yt = (const_tree) y;
10475 if (TREE_CODE (xt) != TREE_CODE (yt))
10478 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10480 xp = (const char *)TREE_OPTIMIZATION (xt);
10481 yp = (const char *)TREE_OPTIMIZATION (yt);
10482 len = sizeof (struct cl_optimization);
10485 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10487 xp = (const char *)TREE_TARGET_OPTION (xt);
10488 yp = (const char *)TREE_TARGET_OPTION (yt);
10489 len = sizeof (struct cl_target_option);
10493 gcc_unreachable ();
10495 return (memcmp (xp, yp, len) == 0);
10498 /* Build an OPTIMIZATION_NODE based on the current options. */
10501 build_optimization_node (void)
10506 /* Use the cache of optimization nodes. */
10508 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10510 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10514 /* Insert this one into the hash table. */
10515 t = cl_optimization_node;
10518 /* Make a new node for next time round. */
10519 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10525 /* Build a TARGET_OPTION_NODE based on the current options. */
10528 build_target_option_node (void)
10533 /* Use the cache of optimization nodes. */
10535 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10537 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10541 /* Insert this one into the hash table. */
10542 t = cl_target_option_node;
10545 /* Make a new node for next time round. */
10546 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10552 /* Determine the "ultimate origin" of a block. The block may be an inlined
10553 instance of an inlined instance of a block which is local to an inline
10554 function, so we have to trace all of the way back through the origin chain
10555 to find out what sort of node actually served as the original seed for the
10559 block_ultimate_origin (const_tree block)
10561 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10563 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10564 nodes in the function to point to themselves; ignore that if
10565 we're trying to output the abstract instance of this function. */
10566 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10569 if (immediate_origin == NULL_TREE)
10574 tree lookahead = immediate_origin;
10578 ret_val = lookahead;
10579 lookahead = (TREE_CODE (ret_val) == BLOCK
10580 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10582 while (lookahead != NULL && lookahead != ret_val);
10584 /* The block's abstract origin chain may not be the *ultimate* origin of
10585 the block. It could lead to a DECL that has an abstract origin set.
10586 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10587 will give us if it has one). Note that DECL's abstract origins are
10588 supposed to be the most distant ancestor (or so decl_ultimate_origin
10589 claims), so we don't need to loop following the DECL origins. */
10590 if (DECL_P (ret_val))
10591 return DECL_ORIGIN (ret_val);
10597 /* Return true if T1 and T2 are equivalent lists. */
10600 list_equal_p (const_tree t1, const_tree t2)
10602 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10603 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10608 /* Return true iff conversion in EXP generates no instruction. Mark
10609 it inline so that we fully inline into the stripping functions even
10610 though we have two uses of this function. */
10613 tree_nop_conversion (const_tree exp)
10615 tree outer_type, inner_type;
10617 if (!CONVERT_EXPR_P (exp)
10618 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10620 if (TREE_OPERAND (exp, 0) == error_mark_node)
10623 outer_type = TREE_TYPE (exp);
10624 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10626 /* Use precision rather then machine mode when we can, which gives
10627 the correct answer even for submode (bit-field) types. */
10628 if ((INTEGRAL_TYPE_P (outer_type)
10629 || POINTER_TYPE_P (outer_type)
10630 || TREE_CODE (outer_type) == OFFSET_TYPE)
10631 && (INTEGRAL_TYPE_P (inner_type)
10632 || POINTER_TYPE_P (inner_type)
10633 || TREE_CODE (inner_type) == OFFSET_TYPE))
10634 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10636 /* Otherwise fall back on comparing machine modes (e.g. for
10637 aggregate types, floats). */
10638 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10641 /* Return true iff conversion in EXP generates no instruction. Don't
10642 consider conversions changing the signedness. */
10645 tree_sign_nop_conversion (const_tree exp)
10647 tree outer_type, inner_type;
10649 if (!tree_nop_conversion (exp))
10652 outer_type = TREE_TYPE (exp);
10653 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10655 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10656 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10659 /* Strip conversions from EXP according to tree_nop_conversion and
10660 return the resulting expression. */
10663 tree_strip_nop_conversions (tree exp)
10665 while (tree_nop_conversion (exp))
10666 exp = TREE_OPERAND (exp, 0);
10670 /* Strip conversions from EXP according to tree_sign_nop_conversion
10671 and return the resulting expression. */
10674 tree_strip_sign_nop_conversions (tree exp)
10676 while (tree_sign_nop_conversion (exp))
10677 exp = TREE_OPERAND (exp, 0);
10681 static GTY(()) tree gcc_eh_personality_decl;
10683 /* Return the GCC personality function decl. */
10686 lhd_gcc_personality (void)
10688 if (!gcc_eh_personality_decl)
10689 gcc_eh_personality_decl
10690 = build_personality_function (USING_SJLJ_EXCEPTIONS
10691 ? "__gcc_personality_sj0"
10692 : "__gcc_personality_v0");
10694 return gcc_eh_personality_decl;
10697 #include "gt-tree.h"