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"
56 /* Tree code classes. */
58 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
59 #define END_OF_BASE_TREE_CODES tcc_exceptional,
61 const enum tree_code_class tree_code_type[] = {
62 #include "all-tree.def"
66 #undef END_OF_BASE_TREE_CODES
68 /* Table indexed by tree code giving number of expression
69 operands beyond the fixed part of the node structure.
70 Not used for types or decls. */
72 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
73 #define END_OF_BASE_TREE_CODES 0,
75 const unsigned char tree_code_length[] = {
76 #include "all-tree.def"
80 #undef END_OF_BASE_TREE_CODES
82 /* Names of tree components.
83 Used for printing out the tree and error messages. */
84 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
85 #define END_OF_BASE_TREE_CODES "@dummy",
87 const char *const tree_code_name[] = {
88 #include "all-tree.def"
92 #undef END_OF_BASE_TREE_CODES
94 /* Each tree code class has an associated string representation.
95 These must correspond to the tree_code_class entries. */
97 const char *const tree_code_class_strings[] =
112 /* obstack.[ch] explicitly declined to prototype this. */
113 extern int _obstack_allocated_p (struct obstack *h, void *obj);
115 #ifdef GATHER_STATISTICS
116 /* Statistics-gathering stuff. */
118 int tree_node_counts[(int) all_kinds];
119 int tree_node_sizes[(int) all_kinds];
121 /* Keep in sync with tree.h:enum tree_node_kind. */
122 static const char * const tree_node_kind_names[] = {
142 #endif /* GATHER_STATISTICS */
144 /* Unique id for next decl created. */
145 static GTY(()) int next_decl_uid;
146 /* Unique id for next type created. */
147 static GTY(()) int next_type_uid = 1;
149 /* Since we cannot rehash a type after it is in the table, we have to
150 keep the hash code. */
152 struct GTY(()) type_hash {
157 /* Initial size of the hash table (rounded to next prime). */
158 #define TYPE_HASH_INITIAL_SIZE 1000
160 /* Now here is the hash table. When recording a type, it is added to
161 the slot whose index is the hash code. Note that the hash table is
162 used for several kinds of types (function types, array types and
163 array index range types, for now). While all these live in the
164 same table, they are completely independent, and the hash code is
165 computed differently for each of these. */
167 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
168 htab_t type_hash_table;
170 /* Hash table and temporary node for larger integer const values. */
171 static GTY (()) tree int_cst_node;
172 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
173 htab_t int_cst_hash_table;
175 /* Hash table for optimization flags and target option flags. Use the same
176 hash table for both sets of options. Nodes for building the current
177 optimization and target option nodes. The assumption is most of the time
178 the options created will already be in the hash table, so we avoid
179 allocating and freeing up a node repeatably. */
180 static GTY (()) tree cl_optimization_node;
181 static GTY (()) tree cl_target_option_node;
182 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
183 htab_t cl_option_hash_table;
185 /* General tree->tree mapping structure for use in hash tables. */
188 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
189 htab_t debug_expr_for_decl;
191 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
192 htab_t value_expr_for_decl;
194 static GTY ((if_marked ("tree_priority_map_marked_p"),
195 param_is (struct tree_priority_map)))
196 htab_t init_priority_for_decl;
198 static void set_type_quals (tree, int);
199 static int type_hash_eq (const void *, const void *);
200 static hashval_t type_hash_hash (const void *);
201 static hashval_t int_cst_hash_hash (const void *);
202 static int int_cst_hash_eq (const void *, const void *);
203 static hashval_t cl_option_hash_hash (const void *);
204 static int cl_option_hash_eq (const void *, const void *);
205 static void print_type_hash_statistics (void);
206 static void print_debug_expr_statistics (void);
207 static void print_value_expr_statistics (void);
208 static int type_hash_marked_p (const void *);
209 static unsigned int type_hash_list (const_tree, hashval_t);
210 static unsigned int attribute_hash_list (const_tree, hashval_t);
212 tree global_trees[TI_MAX];
213 tree integer_types[itk_none];
215 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
217 /* Number of operands for each OpenMP clause. */
218 unsigned const char omp_clause_num_ops[] =
220 0, /* OMP_CLAUSE_ERROR */
221 1, /* OMP_CLAUSE_PRIVATE */
222 1, /* OMP_CLAUSE_SHARED */
223 1, /* OMP_CLAUSE_FIRSTPRIVATE */
224 2, /* OMP_CLAUSE_LASTPRIVATE */
225 4, /* OMP_CLAUSE_REDUCTION */
226 1, /* OMP_CLAUSE_COPYIN */
227 1, /* OMP_CLAUSE_COPYPRIVATE */
228 1, /* OMP_CLAUSE_IF */
229 1, /* OMP_CLAUSE_NUM_THREADS */
230 1, /* OMP_CLAUSE_SCHEDULE */
231 0, /* OMP_CLAUSE_NOWAIT */
232 0, /* OMP_CLAUSE_ORDERED */
233 0, /* OMP_CLAUSE_DEFAULT */
234 3, /* OMP_CLAUSE_COLLAPSE */
235 0 /* OMP_CLAUSE_UNTIED */
238 const char * const omp_clause_code_name[] =
259 /* Return the tree node structure used by tree code CODE. */
261 static inline enum tree_node_structure_enum
262 tree_node_structure_for_code (enum tree_code code)
264 switch (TREE_CODE_CLASS (code))
266 case tcc_declaration:
271 return TS_FIELD_DECL;
277 return TS_LABEL_DECL;
279 return TS_RESULT_DECL;
281 return TS_CONST_DECL;
285 return TS_FUNCTION_DECL;
287 return TS_DECL_NON_COMMON;
300 default: /* tcc_constant and tcc_exceptional */
305 /* tcc_constant cases. */
306 case INTEGER_CST: return TS_INT_CST;
307 case REAL_CST: return TS_REAL_CST;
308 case FIXED_CST: return TS_FIXED_CST;
309 case COMPLEX_CST: return TS_COMPLEX;
310 case VECTOR_CST: return TS_VECTOR;
311 case STRING_CST: return TS_STRING;
312 /* tcc_exceptional cases. */
313 case ERROR_MARK: return TS_COMMON;
314 case IDENTIFIER_NODE: return TS_IDENTIFIER;
315 case TREE_LIST: return TS_LIST;
316 case TREE_VEC: return TS_VEC;
317 case SSA_NAME: return TS_SSA_NAME;
318 case PLACEHOLDER_EXPR: return TS_COMMON;
319 case STATEMENT_LIST: return TS_STATEMENT_LIST;
320 case BLOCK: return TS_BLOCK;
321 case CONSTRUCTOR: return TS_CONSTRUCTOR;
322 case TREE_BINFO: return TS_BINFO;
323 case OMP_CLAUSE: return TS_OMP_CLAUSE;
324 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
325 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
333 /* Initialize tree_contains_struct to describe the hierarchy of tree
337 initialize_tree_contains_struct (void)
341 #define MARK_TS_BASE(C) \
343 tree_contains_struct[C][TS_BASE] = 1; \
346 #define MARK_TS_COMMON(C) \
349 tree_contains_struct[C][TS_COMMON] = 1; \
352 #define MARK_TS_DECL_MINIMAL(C) \
354 MARK_TS_COMMON (C); \
355 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
358 #define MARK_TS_DECL_COMMON(C) \
360 MARK_TS_DECL_MINIMAL (C); \
361 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
364 #define MARK_TS_DECL_WRTL(C) \
366 MARK_TS_DECL_COMMON (C); \
367 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
370 #define MARK_TS_DECL_WITH_VIS(C) \
372 MARK_TS_DECL_WRTL (C); \
373 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
376 #define MARK_TS_DECL_NON_COMMON(C) \
378 MARK_TS_DECL_WITH_VIS (C); \
379 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
382 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
385 enum tree_node_structure_enum ts_code;
387 code = (enum tree_code) i;
388 ts_code = tree_node_structure_for_code (code);
390 /* Mark the TS structure itself. */
391 tree_contains_struct[code][ts_code] = 1;
393 /* Mark all the structures that TS is derived from. */
407 case TS_DECL_MINIMAL:
415 case TS_STATEMENT_LIST:
418 case TS_OPTIMIZATION:
419 case TS_TARGET_OPTION:
420 MARK_TS_COMMON (code);
424 MARK_TS_DECL_MINIMAL (code);
428 MARK_TS_DECL_COMMON (code);
431 case TS_DECL_NON_COMMON:
432 MARK_TS_DECL_WITH_VIS (code);
435 case TS_DECL_WITH_VIS:
440 MARK_TS_DECL_WRTL (code);
444 MARK_TS_DECL_COMMON (code);
448 MARK_TS_DECL_WITH_VIS (code);
452 case TS_FUNCTION_DECL:
453 MARK_TS_DECL_NON_COMMON (code);
461 /* Basic consistency checks for attributes used in fold. */
462 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
463 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
464 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
465 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
466 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
467 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
468 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
469 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
470 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
471 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
472 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
473 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
474 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
475 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
476 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
477 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
478 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
479 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
480 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
481 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
482 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
483 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
484 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
485 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
486 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
487 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
488 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
489 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
490 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
491 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
492 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
493 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
494 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
495 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
496 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
497 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
498 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
499 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
500 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
501 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
505 #undef MARK_TS_COMMON
506 #undef MARK_TS_DECL_MINIMAL
507 #undef MARK_TS_DECL_COMMON
508 #undef MARK_TS_DECL_WRTL
509 #undef MARK_TS_DECL_WITH_VIS
510 #undef MARK_TS_DECL_NON_COMMON
519 /* Initialize the hash table of types. */
520 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
523 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
526 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
528 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
529 tree_priority_map_eq, 0);
531 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
532 int_cst_hash_eq, NULL);
534 int_cst_node = make_node (INTEGER_CST);
536 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
537 cl_option_hash_eq, NULL);
539 cl_optimization_node = make_node (OPTIMIZATION_NODE);
540 cl_target_option_node = make_node (TARGET_OPTION_NODE);
542 /* Initialize the tree_contains_struct array. */
543 initialize_tree_contains_struct ();
544 lang_hooks.init_ts ();
548 /* The name of the object as the assembler will see it (but before any
549 translations made by ASM_OUTPUT_LABELREF). Often this is the same
550 as DECL_NAME. It is an IDENTIFIER_NODE. */
552 decl_assembler_name (tree decl)
554 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
555 lang_hooks.set_decl_assembler_name (decl);
556 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
559 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
562 decl_assembler_name_equal (tree decl, const_tree asmname)
564 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
565 const char *decl_str;
566 const char *asmname_str;
569 if (decl_asmname == asmname)
572 decl_str = IDENTIFIER_POINTER (decl_asmname);
573 asmname_str = IDENTIFIER_POINTER (asmname);
576 /* If the target assembler name was set by the user, things are trickier.
577 We have a leading '*' to begin with. After that, it's arguable what
578 is the correct thing to do with -fleading-underscore. Arguably, we've
579 historically been doing the wrong thing in assemble_alias by always
580 printing the leading underscore. Since we're not changing that, make
581 sure user_label_prefix follows the '*' before matching. */
582 if (decl_str[0] == '*')
584 size_t ulp_len = strlen (user_label_prefix);
590 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
591 decl_str += ulp_len, test=true;
595 if (asmname_str[0] == '*')
597 size_t ulp_len = strlen (user_label_prefix);
603 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
604 asmname_str += ulp_len, test=true;
611 return strcmp (decl_str, asmname_str) == 0;
614 /* Hash asmnames ignoring the user specified marks. */
617 decl_assembler_name_hash (const_tree asmname)
619 if (IDENTIFIER_POINTER (asmname)[0] == '*')
621 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
622 size_t ulp_len = strlen (user_label_prefix);
626 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
629 return htab_hash_string (decl_str);
632 return htab_hash_string (IDENTIFIER_POINTER (asmname));
635 /* Compute the number of bytes occupied by a tree with code CODE.
636 This function cannot be used for nodes that have variable sizes,
637 including TREE_VEC, STRING_CST, and CALL_EXPR. */
639 tree_code_size (enum tree_code code)
641 switch (TREE_CODE_CLASS (code))
643 case tcc_declaration: /* A decl node */
648 return sizeof (struct tree_field_decl);
650 return sizeof (struct tree_parm_decl);
652 return sizeof (struct tree_var_decl);
654 return sizeof (struct tree_label_decl);
656 return sizeof (struct tree_result_decl);
658 return sizeof (struct tree_const_decl);
660 return sizeof (struct tree_type_decl);
662 return sizeof (struct tree_function_decl);
664 return sizeof (struct tree_decl_non_common);
668 case tcc_type: /* a type node */
669 return sizeof (struct tree_type);
671 case tcc_reference: /* a reference */
672 case tcc_expression: /* an expression */
673 case tcc_statement: /* an expression with side effects */
674 case tcc_comparison: /* a comparison expression */
675 case tcc_unary: /* a unary arithmetic expression */
676 case tcc_binary: /* a binary arithmetic expression */
677 return (sizeof (struct tree_exp)
678 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
680 case tcc_constant: /* a constant */
683 case INTEGER_CST: return sizeof (struct tree_int_cst);
684 case REAL_CST: return sizeof (struct tree_real_cst);
685 case FIXED_CST: return sizeof (struct tree_fixed_cst);
686 case COMPLEX_CST: return sizeof (struct tree_complex);
687 case VECTOR_CST: return sizeof (struct tree_vector);
688 case STRING_CST: gcc_unreachable ();
690 return lang_hooks.tree_size (code);
693 case tcc_exceptional: /* something random, like an identifier. */
696 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
697 case TREE_LIST: return sizeof (struct tree_list);
700 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
703 case OMP_CLAUSE: gcc_unreachable ();
705 case SSA_NAME: return sizeof (struct tree_ssa_name);
707 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
708 case BLOCK: return sizeof (struct tree_block);
709 case CONSTRUCTOR: return sizeof (struct tree_constructor);
710 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
711 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
714 return lang_hooks.tree_size (code);
722 /* Compute the number of bytes occupied by NODE. This routine only
723 looks at TREE_CODE, except for those nodes that have variable sizes. */
725 tree_size (const_tree node)
727 const enum tree_code code = TREE_CODE (node);
731 return (offsetof (struct tree_binfo, base_binfos)
732 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
735 return (sizeof (struct tree_vec)
736 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
739 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
742 return (sizeof (struct tree_omp_clause)
743 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
747 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
748 return (sizeof (struct tree_exp)
749 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
751 return tree_code_size (code);
755 /* Return a newly allocated node of code CODE. For decl and type
756 nodes, some other fields are initialized. The rest of the node is
757 initialized to zero. This function cannot be used for TREE_VEC or
758 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
760 Achoo! I got a code in the node. */
763 make_node_stat (enum tree_code code MEM_STAT_DECL)
766 enum tree_code_class type = TREE_CODE_CLASS (code);
767 size_t length = tree_code_size (code);
768 #ifdef GATHER_STATISTICS
773 case tcc_declaration: /* A decl node */
777 case tcc_type: /* a type node */
781 case tcc_statement: /* an expression with side effects */
785 case tcc_reference: /* a reference */
789 case tcc_expression: /* an expression */
790 case tcc_comparison: /* a comparison expression */
791 case tcc_unary: /* a unary arithmetic expression */
792 case tcc_binary: /* a binary arithmetic expression */
796 case tcc_constant: /* a constant */
800 case tcc_exceptional: /* something random, like an identifier. */
803 case IDENTIFIER_NODE:
816 kind = ssa_name_kind;
837 tree_node_counts[(int) kind]++;
838 tree_node_sizes[(int) kind] += length;
841 if (code == IDENTIFIER_NODE)
842 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
844 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
846 memset (t, 0, length);
848 TREE_SET_CODE (t, code);
853 TREE_SIDE_EFFECTS (t) = 1;
856 case tcc_declaration:
857 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
859 if (code == FUNCTION_DECL)
861 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
862 DECL_MODE (t) = FUNCTION_MODE;
867 DECL_SOURCE_LOCATION (t) = input_location;
868 DECL_UID (t) = next_decl_uid++;
869 if (TREE_CODE (t) == LABEL_DECL)
870 LABEL_DECL_UID (t) = -1;
875 TYPE_UID (t) = next_type_uid++;
876 TYPE_ALIGN (t) = BITS_PER_UNIT;
877 TYPE_USER_ALIGN (t) = 0;
878 TYPE_MAIN_VARIANT (t) = t;
879 TYPE_CANONICAL (t) = t;
881 /* Default to no attributes for type, but let target change that. */
882 TYPE_ATTRIBUTES (t) = NULL_TREE;
883 targetm.set_default_type_attributes (t);
885 /* We have not yet computed the alias set for this type. */
886 TYPE_ALIAS_SET (t) = -1;
890 TREE_CONSTANT (t) = 1;
899 case PREDECREMENT_EXPR:
900 case PREINCREMENT_EXPR:
901 case POSTDECREMENT_EXPR:
902 case POSTINCREMENT_EXPR:
903 /* All of these have side-effects, no matter what their
905 TREE_SIDE_EFFECTS (t) = 1;
914 /* Other classes need no special treatment. */
921 /* Return a new node with the same contents as NODE except that its
922 TREE_CHAIN is zero and it has a fresh uid. */
925 copy_node_stat (tree node MEM_STAT_DECL)
928 enum tree_code code = TREE_CODE (node);
931 gcc_assert (code != STATEMENT_LIST);
933 length = tree_size (node);
934 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
935 memcpy (t, node, length);
938 TREE_ASM_WRITTEN (t) = 0;
939 TREE_VISITED (t) = 0;
942 if (TREE_CODE_CLASS (code) == tcc_declaration)
944 DECL_UID (t) = next_decl_uid++;
945 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
946 && DECL_HAS_VALUE_EXPR_P (node))
948 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
949 DECL_HAS_VALUE_EXPR_P (t) = 1;
951 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
953 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
954 DECL_HAS_INIT_PRIORITY_P (t) = 1;
957 else if (TREE_CODE_CLASS (code) == tcc_type)
959 TYPE_UID (t) = next_type_uid++;
960 /* The following is so that the debug code for
961 the copy is different from the original type.
962 The two statements usually duplicate each other
963 (because they clear fields of the same union),
964 but the optimizer should catch that. */
965 TYPE_SYMTAB_POINTER (t) = 0;
966 TYPE_SYMTAB_ADDRESS (t) = 0;
968 /* Do not copy the values cache. */
969 if (TYPE_CACHED_VALUES_P(t))
971 TYPE_CACHED_VALUES_P (t) = 0;
972 TYPE_CACHED_VALUES (t) = NULL_TREE;
979 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
980 For example, this can copy a list made of TREE_LIST nodes. */
983 copy_list (tree list)
991 head = prev = copy_node (list);
992 next = TREE_CHAIN (list);
995 TREE_CHAIN (prev) = copy_node (next);
996 prev = TREE_CHAIN (prev);
997 next = TREE_CHAIN (next);
1003 /* Create an INT_CST node with a LOW value sign extended. */
1006 build_int_cst (tree type, HOST_WIDE_INT low)
1008 /* Support legacy code. */
1010 type = integer_type_node;
1012 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1015 /* Create an INT_CST node with a LOW value zero extended. */
1018 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1020 return build_int_cst_wide (type, low, 0);
1023 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1024 if it is negative. This function is similar to build_int_cst, but
1025 the extra bits outside of the type precision are cleared. Constants
1026 with these extra bits may confuse the fold so that it detects overflows
1027 even in cases when they do not occur, and in general should be avoided.
1028 We cannot however make this a default behavior of build_int_cst without
1029 more intrusive changes, since there are parts of gcc that rely on the extra
1030 precision of the integer constants. */
1033 build_int_cst_type (tree type, HOST_WIDE_INT low)
1035 unsigned HOST_WIDE_INT low1;
1040 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1042 return build_int_cst_wide (type, low1, hi);
1045 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1046 and sign extended according to the value range of TYPE. */
1049 build_int_cst_wide_type (tree type,
1050 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1052 fit_double_type (low, high, &low, &high, type);
1053 return build_int_cst_wide (type, low, high);
1056 /* These are the hash table functions for the hash table of INTEGER_CST
1057 nodes of a sizetype. */
1059 /* Return the hash code code X, an INTEGER_CST. */
1062 int_cst_hash_hash (const void *x)
1064 const_tree const t = (const_tree) x;
1066 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1067 ^ htab_hash_pointer (TREE_TYPE (t)));
1070 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1071 is the same as that given by *Y, which is the same. */
1074 int_cst_hash_eq (const void *x, const void *y)
1076 const_tree const xt = (const_tree) x;
1077 const_tree const yt = (const_tree) y;
1079 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1080 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1081 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1084 /* Create an INT_CST node of TYPE and value HI:LOW.
1085 The returned node is always shared. For small integers we use a
1086 per-type vector cache, for larger ones we use a single hash table. */
1089 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1097 switch (TREE_CODE (type))
1100 case REFERENCE_TYPE:
1101 /* Cache NULL pointer. */
1110 /* Cache false or true. */
1118 if (TYPE_UNSIGNED (type))
1121 limit = INTEGER_SHARE_LIMIT;
1122 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1128 limit = INTEGER_SHARE_LIMIT + 1;
1129 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1131 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1145 /* Look for it in the type's vector of small shared ints. */
1146 if (!TYPE_CACHED_VALUES_P (type))
1148 TYPE_CACHED_VALUES_P (type) = 1;
1149 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1152 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1155 /* Make sure no one is clobbering the shared constant. */
1156 gcc_assert (TREE_TYPE (t) == type);
1157 gcc_assert (TREE_INT_CST_LOW (t) == low);
1158 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1162 /* Create a new shared int. */
1163 t = make_node (INTEGER_CST);
1165 TREE_INT_CST_LOW (t) = low;
1166 TREE_INT_CST_HIGH (t) = hi;
1167 TREE_TYPE (t) = type;
1169 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1174 /* Use the cache of larger shared ints. */
1177 TREE_INT_CST_LOW (int_cst_node) = low;
1178 TREE_INT_CST_HIGH (int_cst_node) = hi;
1179 TREE_TYPE (int_cst_node) = type;
1181 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1185 /* Insert this one into the hash table. */
1188 /* Make a new node for next time round. */
1189 int_cst_node = make_node (INTEGER_CST);
1196 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1197 and the rest are zeros. */
1200 build_low_bits_mask (tree type, unsigned bits)
1202 unsigned HOST_WIDE_INT low;
1204 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1206 gcc_assert (bits <= TYPE_PRECISION (type));
1208 if (bits == TYPE_PRECISION (type)
1209 && !TYPE_UNSIGNED (type))
1211 /* Sign extended all-ones mask. */
1215 else if (bits <= HOST_BITS_PER_WIDE_INT)
1217 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1222 bits -= HOST_BITS_PER_WIDE_INT;
1224 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1227 return build_int_cst_wide (type, low, high);
1230 /* Checks that X is integer constant that can be expressed in (unsigned)
1231 HOST_WIDE_INT without loss of precision. */
1234 cst_and_fits_in_hwi (const_tree x)
1236 if (TREE_CODE (x) != INTEGER_CST)
1239 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1242 return (TREE_INT_CST_HIGH (x) == 0
1243 || TREE_INT_CST_HIGH (x) == -1);
1246 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1247 are in a list pointed to by VALS. */
1250 build_vector (tree type, tree vals)
1252 tree v = make_node (VECTOR_CST);
1256 TREE_VECTOR_CST_ELTS (v) = vals;
1257 TREE_TYPE (v) = type;
1259 /* Iterate through elements and check for overflow. */
1260 for (link = vals; link; link = TREE_CHAIN (link))
1262 tree value = TREE_VALUE (link);
1264 /* Don't crash if we get an address constant. */
1265 if (!CONSTANT_CLASS_P (value))
1268 over |= TREE_OVERFLOW (value);
1271 TREE_OVERFLOW (v) = over;
1275 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1276 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1279 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1281 tree list = NULL_TREE;
1282 unsigned HOST_WIDE_INT idx;
1285 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1286 list = tree_cons (NULL_TREE, value, list);
1287 return build_vector (type, nreverse (list));
1290 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1291 are in the VEC pointed to by VALS. */
1293 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1295 tree c = make_node (CONSTRUCTOR);
1296 TREE_TYPE (c) = type;
1297 CONSTRUCTOR_ELTS (c) = vals;
1301 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1304 build_constructor_single (tree type, tree index, tree value)
1306 VEC(constructor_elt,gc) *v;
1307 constructor_elt *elt;
1310 v = VEC_alloc (constructor_elt, gc, 1);
1311 elt = VEC_quick_push (constructor_elt, v, NULL);
1315 t = build_constructor (type, v);
1316 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1321 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1322 are in a list pointed to by VALS. */
1324 build_constructor_from_list (tree type, tree vals)
1327 VEC(constructor_elt,gc) *v = NULL;
1328 bool constant_p = true;
1332 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1333 for (t = vals; t; t = TREE_CHAIN (t))
1335 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1336 val = TREE_VALUE (t);
1337 elt->index = TREE_PURPOSE (t);
1339 if (!TREE_CONSTANT (val))
1344 t = build_constructor (type, v);
1345 TREE_CONSTANT (t) = constant_p;
1349 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1352 build_fixed (tree type, FIXED_VALUE_TYPE f)
1355 FIXED_VALUE_TYPE *fp;
1357 v = make_node (FIXED_CST);
1358 fp = GGC_NEW (FIXED_VALUE_TYPE);
1359 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1361 TREE_TYPE (v) = type;
1362 TREE_FIXED_CST_PTR (v) = fp;
1366 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1369 build_real (tree type, REAL_VALUE_TYPE d)
1372 REAL_VALUE_TYPE *dp;
1375 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1376 Consider doing it via real_convert now. */
1378 v = make_node (REAL_CST);
1379 dp = GGC_NEW (REAL_VALUE_TYPE);
1380 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1382 TREE_TYPE (v) = type;
1383 TREE_REAL_CST_PTR (v) = dp;
1384 TREE_OVERFLOW (v) = overflow;
1388 /* Return a new REAL_CST node whose type is TYPE
1389 and whose value is the integer value of the INTEGER_CST node I. */
1392 real_value_from_int_cst (const_tree type, const_tree i)
1396 /* Clear all bits of the real value type so that we can later do
1397 bitwise comparisons to see if two values are the same. */
1398 memset (&d, 0, sizeof d);
1400 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1401 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1402 TYPE_UNSIGNED (TREE_TYPE (i)));
1406 /* Given a tree representing an integer constant I, return a tree
1407 representing the same value as a floating-point constant of type TYPE. */
1410 build_real_from_int_cst (tree type, const_tree i)
1413 int overflow = TREE_OVERFLOW (i);
1415 v = build_real (type, real_value_from_int_cst (type, i));
1417 TREE_OVERFLOW (v) |= overflow;
1421 /* Return a newly constructed STRING_CST node whose value is
1422 the LEN characters at STR.
1423 The TREE_TYPE is not initialized. */
1426 build_string (int len, const char *str)
1431 /* Do not waste bytes provided by padding of struct tree_string. */
1432 length = len + offsetof (struct tree_string, str) + 1;
1434 #ifdef GATHER_STATISTICS
1435 tree_node_counts[(int) c_kind]++;
1436 tree_node_sizes[(int) c_kind] += length;
1439 s = ggc_alloc_tree (length);
1441 memset (s, 0, sizeof (struct tree_common));
1442 TREE_SET_CODE (s, STRING_CST);
1443 TREE_CONSTANT (s) = 1;
1444 TREE_STRING_LENGTH (s) = len;
1445 memcpy (s->string.str, str, len);
1446 s->string.str[len] = '\0';
1451 /* Return a newly constructed COMPLEX_CST node whose value is
1452 specified by the real and imaginary parts REAL and IMAG.
1453 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1454 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1457 build_complex (tree type, tree real, tree imag)
1459 tree t = make_node (COMPLEX_CST);
1461 TREE_REALPART (t) = real;
1462 TREE_IMAGPART (t) = imag;
1463 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1464 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1468 /* Return a constant of arithmetic type TYPE which is the
1469 multiplicative identity of the set TYPE. */
1472 build_one_cst (tree type)
1474 switch (TREE_CODE (type))
1476 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1477 case POINTER_TYPE: case REFERENCE_TYPE:
1479 return build_int_cst (type, 1);
1482 return build_real (type, dconst1);
1484 case FIXED_POINT_TYPE:
1485 /* We can only generate 1 for accum types. */
1486 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1487 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1494 scalar = build_one_cst (TREE_TYPE (type));
1496 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1498 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1499 cst = tree_cons (NULL_TREE, scalar, cst);
1501 return build_vector (type, cst);
1505 return build_complex (type,
1506 build_one_cst (TREE_TYPE (type)),
1507 fold_convert (TREE_TYPE (type), integer_zero_node));
1514 /* Build a BINFO with LEN language slots. */
1517 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1520 size_t length = (offsetof (struct tree_binfo, base_binfos)
1521 + VEC_embedded_size (tree, base_binfos));
1523 #ifdef GATHER_STATISTICS
1524 tree_node_counts[(int) binfo_kind]++;
1525 tree_node_sizes[(int) binfo_kind] += length;
1528 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1530 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1532 TREE_SET_CODE (t, TREE_BINFO);
1534 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1540 /* Build a newly constructed TREE_VEC node of length LEN. */
1543 make_tree_vec_stat (int len MEM_STAT_DECL)
1546 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1548 #ifdef GATHER_STATISTICS
1549 tree_node_counts[(int) vec_kind]++;
1550 tree_node_sizes[(int) vec_kind] += length;
1553 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1555 memset (t, 0, length);
1557 TREE_SET_CODE (t, TREE_VEC);
1558 TREE_VEC_LENGTH (t) = len;
1563 /* Return 1 if EXPR is the integer constant zero or a complex constant
1567 integer_zerop (const_tree expr)
1571 return ((TREE_CODE (expr) == INTEGER_CST
1572 && TREE_INT_CST_LOW (expr) == 0
1573 && TREE_INT_CST_HIGH (expr) == 0)
1574 || (TREE_CODE (expr) == COMPLEX_CST
1575 && integer_zerop (TREE_REALPART (expr))
1576 && integer_zerop (TREE_IMAGPART (expr))));
1579 /* Return 1 if EXPR is the integer constant one or the corresponding
1580 complex constant. */
1583 integer_onep (const_tree expr)
1587 return ((TREE_CODE (expr) == INTEGER_CST
1588 && TREE_INT_CST_LOW (expr) == 1
1589 && TREE_INT_CST_HIGH (expr) == 0)
1590 || (TREE_CODE (expr) == COMPLEX_CST
1591 && integer_onep (TREE_REALPART (expr))
1592 && integer_zerop (TREE_IMAGPART (expr))));
1595 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1596 it contains. Likewise for the corresponding complex constant. */
1599 integer_all_onesp (const_tree expr)
1606 if (TREE_CODE (expr) == COMPLEX_CST
1607 && integer_all_onesp (TREE_REALPART (expr))
1608 && integer_zerop (TREE_IMAGPART (expr)))
1611 else if (TREE_CODE (expr) != INTEGER_CST)
1614 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1615 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1616 && TREE_INT_CST_HIGH (expr) == -1)
1621 /* Note that using TYPE_PRECISION here is wrong. We care about the
1622 actual bits, not the (arbitrary) range of the type. */
1623 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1624 if (prec >= HOST_BITS_PER_WIDE_INT)
1626 HOST_WIDE_INT high_value;
1629 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1631 /* Can not handle precisions greater than twice the host int size. */
1632 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1633 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1634 /* Shifting by the host word size is undefined according to the ANSI
1635 standard, so we must handle this as a special case. */
1638 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1640 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1641 && TREE_INT_CST_HIGH (expr) == high_value);
1644 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1647 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1651 integer_pow2p (const_tree expr)
1654 HOST_WIDE_INT high, low;
1658 if (TREE_CODE (expr) == COMPLEX_CST
1659 && integer_pow2p (TREE_REALPART (expr))
1660 && integer_zerop (TREE_IMAGPART (expr)))
1663 if (TREE_CODE (expr) != INTEGER_CST)
1666 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1667 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1668 high = TREE_INT_CST_HIGH (expr);
1669 low = TREE_INT_CST_LOW (expr);
1671 /* First clear all bits that are beyond the type's precision in case
1672 we've been sign extended. */
1674 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1676 else if (prec > HOST_BITS_PER_WIDE_INT)
1677 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1681 if (prec < HOST_BITS_PER_WIDE_INT)
1682 low &= ~((HOST_WIDE_INT) (-1) << prec);
1685 if (high == 0 && low == 0)
1688 return ((high == 0 && (low & (low - 1)) == 0)
1689 || (low == 0 && (high & (high - 1)) == 0));
1692 /* Return 1 if EXPR is an integer constant other than zero or a
1693 complex constant other than zero. */
1696 integer_nonzerop (const_tree expr)
1700 return ((TREE_CODE (expr) == INTEGER_CST
1701 && (TREE_INT_CST_LOW (expr) != 0
1702 || TREE_INT_CST_HIGH (expr) != 0))
1703 || (TREE_CODE (expr) == COMPLEX_CST
1704 && (integer_nonzerop (TREE_REALPART (expr))
1705 || integer_nonzerop (TREE_IMAGPART (expr)))));
1708 /* Return 1 if EXPR is the fixed-point constant zero. */
1711 fixed_zerop (const_tree expr)
1713 return (TREE_CODE (expr) == FIXED_CST
1714 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1717 /* Return the power of two represented by a tree node known to be a
1721 tree_log2 (const_tree expr)
1724 HOST_WIDE_INT high, low;
1728 if (TREE_CODE (expr) == COMPLEX_CST)
1729 return tree_log2 (TREE_REALPART (expr));
1731 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1732 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1734 high = TREE_INT_CST_HIGH (expr);
1735 low = TREE_INT_CST_LOW (expr);
1737 /* First clear all bits that are beyond the type's precision in case
1738 we've been sign extended. */
1740 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1742 else if (prec > HOST_BITS_PER_WIDE_INT)
1743 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1747 if (prec < HOST_BITS_PER_WIDE_INT)
1748 low &= ~((HOST_WIDE_INT) (-1) << prec);
1751 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1752 : exact_log2 (low));
1755 /* Similar, but return the largest integer Y such that 2 ** Y is less
1756 than or equal to EXPR. */
1759 tree_floor_log2 (const_tree expr)
1762 HOST_WIDE_INT high, low;
1766 if (TREE_CODE (expr) == COMPLEX_CST)
1767 return tree_log2 (TREE_REALPART (expr));
1769 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1770 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1772 high = TREE_INT_CST_HIGH (expr);
1773 low = TREE_INT_CST_LOW (expr);
1775 /* First clear all bits that are beyond the type's precision in case
1776 we've been sign extended. Ignore if type's precision hasn't been set
1777 since what we are doing is setting it. */
1779 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1781 else if (prec > HOST_BITS_PER_WIDE_INT)
1782 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1786 if (prec < HOST_BITS_PER_WIDE_INT)
1787 low &= ~((HOST_WIDE_INT) (-1) << prec);
1790 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1791 : floor_log2 (low));
1794 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1795 decimal float constants, so don't return 1 for them. */
1798 real_zerop (const_tree expr)
1802 return ((TREE_CODE (expr) == REAL_CST
1803 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1804 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1805 || (TREE_CODE (expr) == COMPLEX_CST
1806 && real_zerop (TREE_REALPART (expr))
1807 && real_zerop (TREE_IMAGPART (expr))));
1810 /* Return 1 if EXPR is the real constant one in real or complex form.
1811 Trailing zeroes matter for decimal float constants, so don't return
1815 real_onep (const_tree expr)
1819 return ((TREE_CODE (expr) == REAL_CST
1820 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1821 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1822 || (TREE_CODE (expr) == COMPLEX_CST
1823 && real_onep (TREE_REALPART (expr))
1824 && real_zerop (TREE_IMAGPART (expr))));
1827 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1828 for decimal float constants, so don't return 1 for them. */
1831 real_twop (const_tree expr)
1835 return ((TREE_CODE (expr) == REAL_CST
1836 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1837 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1838 || (TREE_CODE (expr) == COMPLEX_CST
1839 && real_twop (TREE_REALPART (expr))
1840 && real_zerop (TREE_IMAGPART (expr))));
1843 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1844 matter for decimal float constants, so don't return 1 for them. */
1847 real_minus_onep (const_tree expr)
1851 return ((TREE_CODE (expr) == REAL_CST
1852 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1853 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1854 || (TREE_CODE (expr) == COMPLEX_CST
1855 && real_minus_onep (TREE_REALPART (expr))
1856 && real_zerop (TREE_IMAGPART (expr))));
1859 /* Nonzero if EXP is a constant or a cast of a constant. */
1862 really_constant_p (const_tree exp)
1864 /* This is not quite the same as STRIP_NOPS. It does more. */
1865 while (CONVERT_EXPR_P (exp)
1866 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1867 exp = TREE_OPERAND (exp, 0);
1868 return TREE_CONSTANT (exp);
1871 /* Return first list element whose TREE_VALUE is ELEM.
1872 Return 0 if ELEM is not in LIST. */
1875 value_member (tree elem, tree list)
1879 if (elem == TREE_VALUE (list))
1881 list = TREE_CHAIN (list);
1886 /* Return first list element whose TREE_PURPOSE is ELEM.
1887 Return 0 if ELEM is not in LIST. */
1890 purpose_member (const_tree elem, tree list)
1894 if (elem == TREE_PURPOSE (list))
1896 list = TREE_CHAIN (list);
1901 /* Return nonzero if ELEM is part of the chain CHAIN. */
1904 chain_member (const_tree elem, const_tree chain)
1910 chain = TREE_CHAIN (chain);
1916 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1917 We expect a null pointer to mark the end of the chain.
1918 This is the Lisp primitive `length'. */
1921 list_length (const_tree t)
1924 #ifdef ENABLE_TREE_CHECKING
1932 #ifdef ENABLE_TREE_CHECKING
1935 gcc_assert (p != q);
1943 /* Returns the number of FIELD_DECLs in TYPE. */
1946 fields_length (const_tree type)
1948 tree t = TYPE_FIELDS (type);
1951 for (; t; t = TREE_CHAIN (t))
1952 if (TREE_CODE (t) == FIELD_DECL)
1958 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1959 by modifying the last node in chain 1 to point to chain 2.
1960 This is the Lisp primitive `nconc'. */
1963 chainon (tree op1, tree op2)
1972 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1974 TREE_CHAIN (t1) = op2;
1976 #ifdef ENABLE_TREE_CHECKING
1979 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1980 gcc_assert (t2 != t1);
1987 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1990 tree_last (tree chain)
1994 while ((next = TREE_CHAIN (chain)))
1999 /* Return the node in a chain of nodes whose value is x, NULL if not found. */
2002 tree_find_value (tree chain, tree x)
2005 for (list = chain; list; list = TREE_CHAIN (list))
2006 if (TREE_VALUE (list) == x)
2011 /* Reverse the order of elements in the chain T,
2012 and return the new head of the chain (old last element). */
2017 tree prev = 0, decl, next;
2018 for (decl = t; decl; decl = next)
2020 next = TREE_CHAIN (decl);
2021 TREE_CHAIN (decl) = prev;
2027 /* Return a newly created TREE_LIST node whose
2028 purpose and value fields are PARM and VALUE. */
2031 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2033 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2034 TREE_PURPOSE (t) = parm;
2035 TREE_VALUE (t) = value;
2039 /* Build a chain of TREE_LIST nodes from a vector. */
2042 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2044 tree ret = NULL_TREE;
2048 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2050 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2051 pp = &TREE_CHAIN (*pp);
2056 /* Return a newly created TREE_LIST node whose
2057 purpose and value fields are PURPOSE and VALUE
2058 and whose TREE_CHAIN is CHAIN. */
2061 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2065 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2067 memset (node, 0, sizeof (struct tree_common));
2069 #ifdef GATHER_STATISTICS
2070 tree_node_counts[(int) x_kind]++;
2071 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2074 TREE_SET_CODE (node, TREE_LIST);
2075 TREE_CHAIN (node) = chain;
2076 TREE_PURPOSE (node) = purpose;
2077 TREE_VALUE (node) = value;
2081 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2084 ctor_to_list (tree ctor)
2086 tree list = NULL_TREE;
2091 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2093 *p = build_tree_list (purpose, val);
2094 p = &TREE_CHAIN (*p);
2100 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2104 ctor_to_vec (tree ctor)
2106 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2110 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2111 VEC_quick_push (tree, vec, val);
2116 /* Return the size nominally occupied by an object of type TYPE
2117 when it resides in memory. The value is measured in units of bytes,
2118 and its data type is that normally used for type sizes
2119 (which is the first type created by make_signed_type or
2120 make_unsigned_type). */
2123 size_in_bytes (const_tree type)
2127 if (type == error_mark_node)
2128 return integer_zero_node;
2130 type = TYPE_MAIN_VARIANT (type);
2131 t = TYPE_SIZE_UNIT (type);
2135 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2136 return size_zero_node;
2142 /* Return the size of TYPE (in bytes) as a wide integer
2143 or return -1 if the size can vary or is larger than an integer. */
2146 int_size_in_bytes (const_tree type)
2150 if (type == error_mark_node)
2153 type = TYPE_MAIN_VARIANT (type);
2154 t = TYPE_SIZE_UNIT (type);
2156 || TREE_CODE (t) != INTEGER_CST
2157 || TREE_INT_CST_HIGH (t) != 0
2158 /* If the result would appear negative, it's too big to represent. */
2159 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2162 return TREE_INT_CST_LOW (t);
2165 /* Return the maximum size of TYPE (in bytes) as a wide integer
2166 or return -1 if the size can vary or is larger than an integer. */
2169 max_int_size_in_bytes (const_tree type)
2171 HOST_WIDE_INT size = -1;
2174 /* If this is an array type, check for a possible MAX_SIZE attached. */
2176 if (TREE_CODE (type) == ARRAY_TYPE)
2178 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2180 if (size_tree && host_integerp (size_tree, 1))
2181 size = tree_low_cst (size_tree, 1);
2184 /* If we still haven't been able to get a size, see if the language
2185 can compute a maximum size. */
2189 size_tree = lang_hooks.types.max_size (type);
2191 if (size_tree && host_integerp (size_tree, 1))
2192 size = tree_low_cst (size_tree, 1);
2198 /* Return the bit position of FIELD, in bits from the start of the record.
2199 This is a tree of type bitsizetype. */
2202 bit_position (const_tree field)
2204 return bit_from_pos (DECL_FIELD_OFFSET (field),
2205 DECL_FIELD_BIT_OFFSET (field));
2208 /* Likewise, but return as an integer. It must be representable in
2209 that way (since it could be a signed value, we don't have the
2210 option of returning -1 like int_size_in_byte can. */
2213 int_bit_position (const_tree field)
2215 return tree_low_cst (bit_position (field), 0);
2218 /* Return the byte position of FIELD, in bytes from the start of the record.
2219 This is a tree of type sizetype. */
2222 byte_position (const_tree field)
2224 return byte_from_pos (DECL_FIELD_OFFSET (field),
2225 DECL_FIELD_BIT_OFFSET (field));
2228 /* Likewise, but return as an integer. It must be representable in
2229 that way (since it could be a signed value, we don't have the
2230 option of returning -1 like int_size_in_byte can. */
2233 int_byte_position (const_tree field)
2235 return tree_low_cst (byte_position (field), 0);
2238 /* Return the strictest alignment, in bits, that T is known to have. */
2241 expr_align (const_tree t)
2243 unsigned int align0, align1;
2245 switch (TREE_CODE (t))
2247 CASE_CONVERT: case NON_LVALUE_EXPR:
2248 /* If we have conversions, we know that the alignment of the
2249 object must meet each of the alignments of the types. */
2250 align0 = expr_align (TREE_OPERAND (t, 0));
2251 align1 = TYPE_ALIGN (TREE_TYPE (t));
2252 return MAX (align0, align1);
2254 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2255 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2256 case CLEANUP_POINT_EXPR:
2257 /* These don't change the alignment of an object. */
2258 return expr_align (TREE_OPERAND (t, 0));
2261 /* The best we can do is say that the alignment is the least aligned
2263 align0 = expr_align (TREE_OPERAND (t, 1));
2264 align1 = expr_align (TREE_OPERAND (t, 2));
2265 return MIN (align0, align1);
2267 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2268 meaningfully, it's always 1. */
2269 case LABEL_DECL: case CONST_DECL:
2270 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2272 gcc_assert (DECL_ALIGN (t) != 0);
2273 return DECL_ALIGN (t);
2279 /* Otherwise take the alignment from that of the type. */
2280 return TYPE_ALIGN (TREE_TYPE (t));
2283 /* Return, as a tree node, the number of elements for TYPE (which is an
2284 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2287 array_type_nelts (const_tree type)
2289 tree index_type, min, max;
2291 /* If they did it with unspecified bounds, then we should have already
2292 given an error about it before we got here. */
2293 if (! TYPE_DOMAIN (type))
2294 return error_mark_node;
2296 index_type = TYPE_DOMAIN (type);
2297 min = TYPE_MIN_VALUE (index_type);
2298 max = TYPE_MAX_VALUE (index_type);
2300 return (integer_zerop (min)
2302 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2305 /* If arg is static -- a reference to an object in static storage -- then
2306 return the object. This is not the same as the C meaning of `static'.
2307 If arg isn't static, return NULL. */
2312 switch (TREE_CODE (arg))
2315 /* Nested functions are static, even though taking their address will
2316 involve a trampoline as we unnest the nested function and create
2317 the trampoline on the tree level. */
2321 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2322 && ! DECL_THREAD_LOCAL_P (arg)
2323 && ! DECL_DLLIMPORT_P (arg)
2327 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2331 return TREE_STATIC (arg) ? arg : NULL;
2338 /* If the thing being referenced is not a field, then it is
2339 something language specific. */
2340 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2342 /* If we are referencing a bitfield, we can't evaluate an
2343 ADDR_EXPR at compile time and so it isn't a constant. */
2344 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2347 return staticp (TREE_OPERAND (arg, 0));
2352 case MISALIGNED_INDIRECT_REF:
2353 case ALIGN_INDIRECT_REF:
2355 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2358 case ARRAY_RANGE_REF:
2359 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2360 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2361 return staticp (TREE_OPERAND (arg, 0));
2365 case COMPOUND_LITERAL_EXPR:
2366 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2376 /* Return whether OP is a DECL whose address is function-invariant. */
2379 decl_address_invariant_p (const_tree op)
2381 /* The conditions below are slightly less strict than the one in
2384 switch (TREE_CODE (op))
2393 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2394 && !DECL_DLLIMPORT_P (op))
2395 || DECL_THREAD_LOCAL_P (op)
2396 || DECL_CONTEXT (op) == current_function_decl
2397 || decl_function_context (op) == current_function_decl)
2402 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2403 || decl_function_context (op) == current_function_decl)
2414 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2417 decl_address_ip_invariant_p (const_tree op)
2419 /* The conditions below are slightly less strict than the one in
2422 switch (TREE_CODE (op))
2430 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2431 && !DECL_DLLIMPORT_P (op))
2432 || DECL_THREAD_LOCAL_P (op))
2437 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2449 /* Return true if T is function-invariant (internal function, does
2450 not handle arithmetic; that's handled in skip_simple_arithmetic and
2451 tree_invariant_p). */
2453 static bool tree_invariant_p (tree t);
2456 tree_invariant_p_1 (tree t)
2460 if (TREE_CONSTANT (t)
2461 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2464 switch (TREE_CODE (t))
2470 op = TREE_OPERAND (t, 0);
2471 while (handled_component_p (op))
2473 switch (TREE_CODE (op))
2476 case ARRAY_RANGE_REF:
2477 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2478 || TREE_OPERAND (op, 2) != NULL_TREE
2479 || TREE_OPERAND (op, 3) != NULL_TREE)
2484 if (TREE_OPERAND (op, 2) != NULL_TREE)
2490 op = TREE_OPERAND (op, 0);
2493 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2502 /* Return true if T is function-invariant. */
2505 tree_invariant_p (tree t)
2507 tree inner = skip_simple_arithmetic (t);
2508 return tree_invariant_p_1 (inner);
2511 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2512 Do this to any expression which may be used in more than one place,
2513 but must be evaluated only once.
2515 Normally, expand_expr would reevaluate the expression each time.
2516 Calling save_expr produces something that is evaluated and recorded
2517 the first time expand_expr is called on it. Subsequent calls to
2518 expand_expr just reuse the recorded value.
2520 The call to expand_expr that generates code that actually computes
2521 the value is the first call *at compile time*. Subsequent calls
2522 *at compile time* generate code to use the saved value.
2523 This produces correct result provided that *at run time* control
2524 always flows through the insns made by the first expand_expr
2525 before reaching the other places where the save_expr was evaluated.
2526 You, the caller of save_expr, must make sure this is so.
2528 Constants, and certain read-only nodes, are returned with no
2529 SAVE_EXPR because that is safe. Expressions containing placeholders
2530 are not touched; see tree.def for an explanation of what these
2534 save_expr (tree expr)
2536 tree t = fold (expr);
2539 /* If the tree evaluates to a constant, then we don't want to hide that
2540 fact (i.e. this allows further folding, and direct checks for constants).
2541 However, a read-only object that has side effects cannot be bypassed.
2542 Since it is no problem to reevaluate literals, we just return the
2544 inner = skip_simple_arithmetic (t);
2545 if (TREE_CODE (inner) == ERROR_MARK)
2548 if (tree_invariant_p_1 (inner))
2551 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2552 it means that the size or offset of some field of an object depends on
2553 the value within another field.
2555 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2556 and some variable since it would then need to be both evaluated once and
2557 evaluated more than once. Front-ends must assure this case cannot
2558 happen by surrounding any such subexpressions in their own SAVE_EXPR
2559 and forcing evaluation at the proper time. */
2560 if (contains_placeholder_p (inner))
2563 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2564 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2566 /* This expression might be placed ahead of a jump to ensure that the
2567 value was computed on both sides of the jump. So make sure it isn't
2568 eliminated as dead. */
2569 TREE_SIDE_EFFECTS (t) = 1;
2573 /* Look inside EXPR and into any simple arithmetic operations. Return
2574 the innermost non-arithmetic node. */
2577 skip_simple_arithmetic (tree expr)
2581 /* We don't care about whether this can be used as an lvalue in this
2583 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2584 expr = TREE_OPERAND (expr, 0);
2586 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2587 a constant, it will be more efficient to not make another SAVE_EXPR since
2588 it will allow better simplification and GCSE will be able to merge the
2589 computations if they actually occur. */
2593 if (UNARY_CLASS_P (inner))
2594 inner = TREE_OPERAND (inner, 0);
2595 else if (BINARY_CLASS_P (inner))
2597 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2598 inner = TREE_OPERAND (inner, 0);
2599 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2600 inner = TREE_OPERAND (inner, 1);
2612 /* Return which tree structure is used by T. */
2614 enum tree_node_structure_enum
2615 tree_node_structure (const_tree t)
2617 const enum tree_code code = TREE_CODE (t);
2618 return tree_node_structure_for_code (code);
2621 /* Set various status flags when building a CALL_EXPR object T. */
2624 process_call_operands (tree t)
2626 bool side_effects = TREE_SIDE_EFFECTS (t);
2627 bool read_only = false;
2628 int i = call_expr_flags (t);
2630 /* Calls have side-effects, except those to const or pure functions. */
2631 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2632 side_effects = true;
2633 /* Propagate TREE_READONLY of arguments for const functions. */
2637 if (!side_effects || read_only)
2638 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2640 tree op = TREE_OPERAND (t, i);
2641 if (op && TREE_SIDE_EFFECTS (op))
2642 side_effects = true;
2643 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2647 TREE_SIDE_EFFECTS (t) = side_effects;
2648 TREE_READONLY (t) = read_only;
2651 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2652 or offset that depends on a field within a record. */
2655 contains_placeholder_p (const_tree exp)
2657 enum tree_code code;
2662 code = TREE_CODE (exp);
2663 if (code == PLACEHOLDER_EXPR)
2666 switch (TREE_CODE_CLASS (code))
2669 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2670 position computations since they will be converted into a
2671 WITH_RECORD_EXPR involving the reference, which will assume
2672 here will be valid. */
2673 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2675 case tcc_exceptional:
2676 if (code == TREE_LIST)
2677 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2678 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2683 case tcc_comparison:
2684 case tcc_expression:
2688 /* Ignoring the first operand isn't quite right, but works best. */
2689 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2692 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2693 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2694 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2697 /* The save_expr function never wraps anything containing
2698 a PLACEHOLDER_EXPR. */
2705 switch (TREE_CODE_LENGTH (code))
2708 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2710 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2711 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2722 const_call_expr_arg_iterator iter;
2723 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2724 if (CONTAINS_PLACEHOLDER_P (arg))
2738 /* Return true if any part of the computation of TYPE involves a
2739 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2740 (for QUAL_UNION_TYPE) and field positions. */
2743 type_contains_placeholder_1 (const_tree type)
2745 /* If the size contains a placeholder or the parent type (component type in
2746 the case of arrays) type involves a placeholder, this type does. */
2747 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2748 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2749 || (TREE_TYPE (type) != 0
2750 && type_contains_placeholder_p (TREE_TYPE (type))))
2753 /* Now do type-specific checks. Note that the last part of the check above
2754 greatly limits what we have to do below. */
2755 switch (TREE_CODE (type))
2763 case REFERENCE_TYPE:
2771 case FIXED_POINT_TYPE:
2772 /* Here we just check the bounds. */
2773 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2774 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2777 /* We're already checked the component type (TREE_TYPE), so just check
2779 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2783 case QUAL_UNION_TYPE:
2787 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2788 if (TREE_CODE (field) == FIELD_DECL
2789 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2790 || (TREE_CODE (type) == QUAL_UNION_TYPE
2791 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2792 || type_contains_placeholder_p (TREE_TYPE (field))))
2804 type_contains_placeholder_p (tree type)
2808 /* If the contains_placeholder_bits field has been initialized,
2809 then we know the answer. */
2810 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2811 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2813 /* Indicate that we've seen this type node, and the answer is false.
2814 This is what we want to return if we run into recursion via fields. */
2815 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2817 /* Compute the real value. */
2818 result = type_contains_placeholder_1 (type);
2820 /* Store the real value. */
2821 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2826 /* Push tree EXP onto vector QUEUE if it is not already present. */
2829 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2834 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2835 if (simple_cst_equal (iter, exp) == 1)
2839 VEC_safe_push (tree, heap, *queue, exp);
2842 /* Given a tree EXP, find all occurences of references to fields
2843 in a PLACEHOLDER_EXPR and place them in vector REFS without
2844 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2845 we assume here that EXP contains only arithmetic expressions
2846 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2850 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2852 enum tree_code code = TREE_CODE (exp);
2856 /* We handle TREE_LIST and COMPONENT_REF separately. */
2857 if (code == TREE_LIST)
2859 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2860 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2862 else if (code == COMPONENT_REF)
2864 for (inner = TREE_OPERAND (exp, 0);
2865 REFERENCE_CLASS_P (inner);
2866 inner = TREE_OPERAND (inner, 0))
2869 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2870 push_without_duplicates (exp, refs);
2872 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2875 switch (TREE_CODE_CLASS (code))
2880 case tcc_declaration:
2881 /* Variables allocated to static storage can stay. */
2882 if (!TREE_STATIC (exp))
2883 push_without_duplicates (exp, refs);
2886 case tcc_expression:
2887 /* This is the pattern built in ada/make_aligning_type. */
2888 if (code == ADDR_EXPR
2889 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2891 push_without_duplicates (exp, refs);
2895 /* Fall through... */
2897 case tcc_exceptional:
2900 case tcc_comparison:
2902 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2903 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2907 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2908 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2916 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2917 return a tree with all occurrences of references to F in a
2918 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2919 CONST_DECLs. Note that we assume here that EXP contains only
2920 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2921 occurring only in their argument list. */
2924 substitute_in_expr (tree exp, tree f, tree r)
2926 enum tree_code code = TREE_CODE (exp);
2927 tree op0, op1, op2, op3;
2930 /* We handle TREE_LIST and COMPONENT_REF separately. */
2931 if (code == TREE_LIST)
2933 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2934 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2935 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2938 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2940 else if (code == COMPONENT_REF)
2944 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2945 and it is the right field, replace it with R. */
2946 for (inner = TREE_OPERAND (exp, 0);
2947 REFERENCE_CLASS_P (inner);
2948 inner = TREE_OPERAND (inner, 0))
2952 op1 = TREE_OPERAND (exp, 1);
2954 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2957 /* If this expression hasn't been completed let, leave it alone. */
2958 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2961 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2962 if (op0 == TREE_OPERAND (exp, 0))
2966 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
2969 switch (TREE_CODE_CLASS (code))
2974 case tcc_declaration:
2980 case tcc_expression:
2984 /* Fall through... */
2986 case tcc_exceptional:
2989 case tcc_comparison:
2991 switch (TREE_CODE_LENGTH (code))
2997 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2998 if (op0 == TREE_OPERAND (exp, 0))
3001 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3005 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3006 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3008 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3011 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3015 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3016 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3017 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3019 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3020 && op2 == TREE_OPERAND (exp, 2))
3023 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3027 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3028 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3029 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3030 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3032 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3033 && op2 == TREE_OPERAND (exp, 2)
3034 && op3 == TREE_OPERAND (exp, 3))
3038 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3050 new_tree = NULL_TREE;
3052 /* If we are trying to replace F with a constant, inline back
3053 functions which do nothing else than computing a value from
3054 the arguments they are passed. This makes it possible to
3055 fold partially or entirely the replacement expression. */
3056 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3058 tree t = maybe_inline_call_in_expr (exp);
3060 return SUBSTITUTE_IN_EXPR (t, f, r);
3063 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3065 tree op = TREE_OPERAND (exp, i);
3066 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3070 new_tree = copy_node (exp);
3071 TREE_OPERAND (new_tree, i) = new_op;
3077 new_tree = fold (new_tree);
3078 if (TREE_CODE (new_tree) == CALL_EXPR)
3079 process_call_operands (new_tree);
3090 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3094 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3095 for it within OBJ, a tree that is an object or a chain of references. */
3098 substitute_placeholder_in_expr (tree exp, tree obj)
3100 enum tree_code code = TREE_CODE (exp);
3101 tree op0, op1, op2, op3;
3104 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3105 in the chain of OBJ. */
3106 if (code == PLACEHOLDER_EXPR)
3108 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3111 for (elt = obj; elt != 0;
3112 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3113 || TREE_CODE (elt) == COND_EXPR)
3114 ? TREE_OPERAND (elt, 1)
3115 : (REFERENCE_CLASS_P (elt)
3116 || UNARY_CLASS_P (elt)
3117 || BINARY_CLASS_P (elt)
3118 || VL_EXP_CLASS_P (elt)
3119 || EXPRESSION_CLASS_P (elt))
3120 ? TREE_OPERAND (elt, 0) : 0))
3121 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3124 for (elt = obj; elt != 0;
3125 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3126 || TREE_CODE (elt) == COND_EXPR)
3127 ? TREE_OPERAND (elt, 1)
3128 : (REFERENCE_CLASS_P (elt)
3129 || UNARY_CLASS_P (elt)
3130 || BINARY_CLASS_P (elt)
3131 || VL_EXP_CLASS_P (elt)
3132 || EXPRESSION_CLASS_P (elt))
3133 ? TREE_OPERAND (elt, 0) : 0))
3134 if (POINTER_TYPE_P (TREE_TYPE (elt))
3135 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3137 return fold_build1 (INDIRECT_REF, need_type, elt);
3139 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3140 survives until RTL generation, there will be an error. */
3144 /* TREE_LIST is special because we need to look at TREE_VALUE
3145 and TREE_CHAIN, not TREE_OPERANDS. */
3146 else if (code == TREE_LIST)
3148 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3149 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3150 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3153 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3156 switch (TREE_CODE_CLASS (code))
3159 case tcc_declaration:
3162 case tcc_exceptional:
3165 case tcc_comparison:
3166 case tcc_expression:
3169 switch (TREE_CODE_LENGTH (code))
3175 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3176 if (op0 == TREE_OPERAND (exp, 0))
3179 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3183 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3184 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3186 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3189 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3193 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3194 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3195 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3197 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3198 && op2 == TREE_OPERAND (exp, 2))
3201 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3205 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3206 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3207 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3208 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3210 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3211 && op2 == TREE_OPERAND (exp, 2)
3212 && op3 == TREE_OPERAND (exp, 3))
3216 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3228 new_tree = NULL_TREE;
3230 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3232 tree op = TREE_OPERAND (exp, i);
3233 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3237 new_tree = copy_node (exp);
3238 TREE_OPERAND (new_tree, i) = new_op;
3244 new_tree = fold (new_tree);
3245 if (TREE_CODE (new_tree) == CALL_EXPR)
3246 process_call_operands (new_tree);
3257 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3261 /* Stabilize a reference so that we can use it any number of times
3262 without causing its operands to be evaluated more than once.
3263 Returns the stabilized reference. This works by means of save_expr,
3264 so see the caveats in the comments about save_expr.
3266 Also allows conversion expressions whose operands are references.
3267 Any other kind of expression is returned unchanged. */
3270 stabilize_reference (tree ref)
3273 enum tree_code code = TREE_CODE (ref);
3280 /* No action is needed in this case. */
3285 case FIX_TRUNC_EXPR:
3286 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3290 result = build_nt (INDIRECT_REF,
3291 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3295 result = build_nt (COMPONENT_REF,
3296 stabilize_reference (TREE_OPERAND (ref, 0)),
3297 TREE_OPERAND (ref, 1), NULL_TREE);
3301 result = build_nt (BIT_FIELD_REF,
3302 stabilize_reference (TREE_OPERAND (ref, 0)),
3303 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3304 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3308 result = build_nt (ARRAY_REF,
3309 stabilize_reference (TREE_OPERAND (ref, 0)),
3310 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3311 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3314 case ARRAY_RANGE_REF:
3315 result = build_nt (ARRAY_RANGE_REF,
3316 stabilize_reference (TREE_OPERAND (ref, 0)),
3317 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3318 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3322 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3323 it wouldn't be ignored. This matters when dealing with
3325 return stabilize_reference_1 (ref);
3327 /* If arg isn't a kind of lvalue we recognize, make no change.
3328 Caller should recognize the error for an invalid lvalue. */
3333 return error_mark_node;
3336 TREE_TYPE (result) = TREE_TYPE (ref);
3337 TREE_READONLY (result) = TREE_READONLY (ref);
3338 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3339 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3344 /* Subroutine of stabilize_reference; this is called for subtrees of
3345 references. Any expression with side-effects must be put in a SAVE_EXPR
3346 to ensure that it is only evaluated once.
3348 We don't put SAVE_EXPR nodes around everything, because assigning very
3349 simple expressions to temporaries causes us to miss good opportunities
3350 for optimizations. Among other things, the opportunity to fold in the
3351 addition of a constant into an addressing mode often gets lost, e.g.
3352 "y[i+1] += x;". In general, we take the approach that we should not make
3353 an assignment unless we are forced into it - i.e., that any non-side effect
3354 operator should be allowed, and that cse should take care of coalescing
3355 multiple utterances of the same expression should that prove fruitful. */
3358 stabilize_reference_1 (tree e)
3361 enum tree_code code = TREE_CODE (e);
3363 /* We cannot ignore const expressions because it might be a reference
3364 to a const array but whose index contains side-effects. But we can
3365 ignore things that are actual constant or that already have been
3366 handled by this function. */
3368 if (tree_invariant_p (e))
3371 switch (TREE_CODE_CLASS (code))
3373 case tcc_exceptional:
3375 case tcc_declaration:
3376 case tcc_comparison:
3378 case tcc_expression:
3381 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3382 so that it will only be evaluated once. */
3383 /* The reference (r) and comparison (<) classes could be handled as
3384 below, but it is generally faster to only evaluate them once. */
3385 if (TREE_SIDE_EFFECTS (e))
3386 return save_expr (e);
3390 /* Constants need no processing. In fact, we should never reach
3395 /* Division is slow and tends to be compiled with jumps,
3396 especially the division by powers of 2 that is often
3397 found inside of an array reference. So do it just once. */
3398 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3399 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3400 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3401 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3402 return save_expr (e);
3403 /* Recursively stabilize each operand. */
3404 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3405 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3409 /* Recursively stabilize each operand. */
3410 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3417 TREE_TYPE (result) = TREE_TYPE (e);
3418 TREE_READONLY (result) = TREE_READONLY (e);
3419 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3420 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3425 /* Low-level constructors for expressions. */
3427 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3428 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3431 recompute_tree_invariant_for_addr_expr (tree t)
3434 bool tc = true, se = false;
3436 /* We started out assuming this address is both invariant and constant, but
3437 does not have side effects. Now go down any handled components and see if
3438 any of them involve offsets that are either non-constant or non-invariant.
3439 Also check for side-effects.
3441 ??? Note that this code makes no attempt to deal with the case where
3442 taking the address of something causes a copy due to misalignment. */
3444 #define UPDATE_FLAGS(NODE) \
3445 do { tree _node = (NODE); \
3446 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3447 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3449 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3450 node = TREE_OPERAND (node, 0))
3452 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3453 array reference (probably made temporarily by the G++ front end),
3454 so ignore all the operands. */
3455 if ((TREE_CODE (node) == ARRAY_REF
3456 || TREE_CODE (node) == ARRAY_RANGE_REF)
3457 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3459 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3460 if (TREE_OPERAND (node, 2))
3461 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3462 if (TREE_OPERAND (node, 3))
3463 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3465 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3466 FIELD_DECL, apparently. The G++ front end can put something else
3467 there, at least temporarily. */
3468 else if (TREE_CODE (node) == COMPONENT_REF
3469 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3471 if (TREE_OPERAND (node, 2))
3472 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3474 else if (TREE_CODE (node) == BIT_FIELD_REF)
3475 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3478 node = lang_hooks.expr_to_decl (node, &tc, &se);
3480 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3481 the address, since &(*a)->b is a form of addition. If it's a constant, the
3482 address is constant too. If it's a decl, its address is constant if the
3483 decl is static. Everything else is not constant and, furthermore,
3484 taking the address of a volatile variable is not volatile. */
3485 if (TREE_CODE (node) == INDIRECT_REF)
3486 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3487 else if (CONSTANT_CLASS_P (node))
3489 else if (DECL_P (node))
3490 tc &= (staticp (node) != NULL_TREE);
3494 se |= TREE_SIDE_EFFECTS (node);
3498 TREE_CONSTANT (t) = tc;
3499 TREE_SIDE_EFFECTS (t) = se;
3503 /* Build an expression of code CODE, data type TYPE, and operands as
3504 specified. Expressions and reference nodes can be created this way.
3505 Constants, decls, types and misc nodes cannot be.
3507 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3508 enough for all extant tree codes. */
3511 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3515 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3517 t = make_node_stat (code PASS_MEM_STAT);
3524 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3526 int length = sizeof (struct tree_exp);
3527 #ifdef GATHER_STATISTICS
3528 tree_node_kind kind;
3532 #ifdef GATHER_STATISTICS
3533 switch (TREE_CODE_CLASS (code))
3535 case tcc_statement: /* an expression with side effects */
3538 case tcc_reference: /* a reference */
3546 tree_node_counts[(int) kind]++;
3547 tree_node_sizes[(int) kind] += length;
3550 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3552 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3554 memset (t, 0, sizeof (struct tree_common));
3556 TREE_SET_CODE (t, code);
3558 TREE_TYPE (t) = type;
3559 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3560 TREE_OPERAND (t, 0) = node;
3561 TREE_BLOCK (t) = NULL_TREE;
3562 if (node && !TYPE_P (node))
3564 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3565 TREE_READONLY (t) = TREE_READONLY (node);
3568 if (TREE_CODE_CLASS (code) == tcc_statement)
3569 TREE_SIDE_EFFECTS (t) = 1;
3573 /* All of these have side-effects, no matter what their
3575 TREE_SIDE_EFFECTS (t) = 1;
3576 TREE_READONLY (t) = 0;
3579 case MISALIGNED_INDIRECT_REF:
3580 case ALIGN_INDIRECT_REF:
3582 /* Whether a dereference is readonly has nothing to do with whether
3583 its operand is readonly. */
3584 TREE_READONLY (t) = 0;
3589 recompute_tree_invariant_for_addr_expr (t);
3593 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3594 && node && !TYPE_P (node)
3595 && TREE_CONSTANT (node))
3596 TREE_CONSTANT (t) = 1;
3597 if (TREE_CODE_CLASS (code) == tcc_reference
3598 && node && TREE_THIS_VOLATILE (node))
3599 TREE_THIS_VOLATILE (t) = 1;
3606 #define PROCESS_ARG(N) \
3608 TREE_OPERAND (t, N) = arg##N; \
3609 if (arg##N &&!TYPE_P (arg##N)) \
3611 if (TREE_SIDE_EFFECTS (arg##N)) \
3613 if (!TREE_READONLY (arg##N) \
3614 && !CONSTANT_CLASS_P (arg##N)) \
3616 if (!TREE_CONSTANT (arg##N)) \
3622 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3624 bool constant, read_only, side_effects;
3627 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3629 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3630 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3631 /* When sizetype precision doesn't match that of pointers
3632 we need to be able to build explicit extensions or truncations
3633 of the offset argument. */
3634 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3635 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3636 && TREE_CODE (arg1) == INTEGER_CST);
3638 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3639 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3640 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3641 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3643 t = make_node_stat (code PASS_MEM_STAT);
3646 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3647 result based on those same flags for the arguments. But if the
3648 arguments aren't really even `tree' expressions, we shouldn't be trying
3651 /* Expressions without side effects may be constant if their
3652 arguments are as well. */
3653 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3654 || TREE_CODE_CLASS (code) == tcc_binary);
3656 side_effects = TREE_SIDE_EFFECTS (t);
3661 TREE_READONLY (t) = read_only;
3662 TREE_CONSTANT (t) = constant;
3663 TREE_SIDE_EFFECTS (t) = side_effects;
3664 TREE_THIS_VOLATILE (t)
3665 = (TREE_CODE_CLASS (code) == tcc_reference
3666 && arg0 && TREE_THIS_VOLATILE (arg0));
3673 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3674 tree arg2 MEM_STAT_DECL)
3676 bool constant, read_only, side_effects;
3679 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3680 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3682 t = make_node_stat (code PASS_MEM_STAT);
3687 /* As a special exception, if COND_EXPR has NULL branches, we
3688 assume that it is a gimple statement and always consider
3689 it to have side effects. */
3690 if (code == COND_EXPR
3691 && tt == void_type_node
3692 && arg1 == NULL_TREE
3693 && arg2 == NULL_TREE)
3694 side_effects = true;
3696 side_effects = TREE_SIDE_EFFECTS (t);
3702 if (code == COND_EXPR)
3703 TREE_READONLY (t) = read_only;
3705 TREE_SIDE_EFFECTS (t) = side_effects;
3706 TREE_THIS_VOLATILE (t)
3707 = (TREE_CODE_CLASS (code) == tcc_reference
3708 && arg0 && TREE_THIS_VOLATILE (arg0));
3714 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3715 tree arg2, tree arg3 MEM_STAT_DECL)
3717 bool constant, read_only, side_effects;
3720 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3722 t = make_node_stat (code PASS_MEM_STAT);
3725 side_effects = TREE_SIDE_EFFECTS (t);
3732 TREE_SIDE_EFFECTS (t) = side_effects;
3733 TREE_THIS_VOLATILE (t)
3734 = (TREE_CODE_CLASS (code) == tcc_reference
3735 && arg0 && TREE_THIS_VOLATILE (arg0));
3741 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3742 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3744 bool constant, read_only, side_effects;
3747 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3749 t = make_node_stat (code PASS_MEM_STAT);
3752 side_effects = TREE_SIDE_EFFECTS (t);
3760 TREE_SIDE_EFFECTS (t) = side_effects;
3761 TREE_THIS_VOLATILE (t)
3762 = (TREE_CODE_CLASS (code) == tcc_reference
3763 && arg0 && TREE_THIS_VOLATILE (arg0));
3769 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3770 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3772 bool constant, read_only, side_effects;
3775 gcc_assert (code == TARGET_MEM_REF);
3777 t = make_node_stat (code PASS_MEM_STAT);
3780 side_effects = TREE_SIDE_EFFECTS (t);
3789 TREE_SIDE_EFFECTS (t) = side_effects;
3790 TREE_THIS_VOLATILE (t) = 0;
3795 /* Similar except don't specify the TREE_TYPE
3796 and leave the TREE_SIDE_EFFECTS as 0.
3797 It is permissible for arguments to be null,
3798 or even garbage if their values do not matter. */
3801 build_nt (enum tree_code code, ...)
3808 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3812 t = make_node (code);
3813 length = TREE_CODE_LENGTH (code);
3815 for (i = 0; i < length; i++)
3816 TREE_OPERAND (t, i) = va_arg (p, tree);
3822 /* Similar to build_nt, but for creating a CALL_EXPR object with
3823 ARGLIST passed as a list. */
3826 build_nt_call_list (tree fn, tree arglist)
3831 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3832 CALL_EXPR_FN (t) = fn;
3833 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3834 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3835 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3839 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3843 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3848 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3849 CALL_EXPR_FN (ret) = fn;
3850 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3851 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3852 CALL_EXPR_ARG (ret, ix) = t;
3856 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3857 We do NOT enter this node in any sort of symbol table.
3859 LOC is the location of the decl.
3861 layout_decl is used to set up the decl's storage layout.
3862 Other slots are initialized to 0 or null pointers. */
3865 build_decl_stat (location_t loc, enum tree_code code, tree name,
3866 tree type MEM_STAT_DECL)
3870 t = make_node_stat (code PASS_MEM_STAT);
3871 DECL_SOURCE_LOCATION (t) = loc;
3873 /* if (type == error_mark_node)
3874 type = integer_type_node; */
3875 /* That is not done, deliberately, so that having error_mark_node
3876 as the type can suppress useless errors in the use of this variable. */
3878 DECL_NAME (t) = name;
3879 TREE_TYPE (t) = type;
3881 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3887 /* Builds and returns function declaration with NAME and TYPE. */
3890 build_fn_decl (const char *name, tree type)
3892 tree id = get_identifier (name);
3893 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3895 DECL_EXTERNAL (decl) = 1;
3896 TREE_PUBLIC (decl) = 1;
3897 DECL_ARTIFICIAL (decl) = 1;
3898 TREE_NOTHROW (decl) = 1;
3904 /* BLOCK nodes are used to represent the structure of binding contours
3905 and declarations, once those contours have been exited and their contents
3906 compiled. This information is used for outputting debugging info. */
3909 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3911 tree block = make_node (BLOCK);
3913 BLOCK_VARS (block) = vars;
3914 BLOCK_SUBBLOCKS (block) = subblocks;
3915 BLOCK_SUPERCONTEXT (block) = supercontext;
3916 BLOCK_CHAIN (block) = chain;
3921 expand_location (source_location loc)
3923 expanded_location xloc;
3933 const struct line_map *map = linemap_lookup (line_table, loc);
3934 xloc.file = map->to_file;
3935 xloc.line = SOURCE_LINE (map, loc);
3936 xloc.column = SOURCE_COLUMN (map, loc);
3937 xloc.sysp = map->sysp != 0;
3943 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3945 LOC is the location to use in tree T. */
3948 protected_set_expr_location (tree t, location_t loc)
3950 if (t && CAN_HAVE_LOCATION_P (t))
3951 SET_EXPR_LOCATION (t, loc);
3954 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3958 build_decl_attribute_variant (tree ddecl, tree attribute)
3960 DECL_ATTRIBUTES (ddecl) = attribute;
3964 /* Borrowed from hashtab.c iterative_hash implementation. */
3965 #define mix(a,b,c) \
3967 a -= b; a -= c; a ^= (c>>13); \
3968 b -= c; b -= a; b ^= (a<< 8); \
3969 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3970 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3971 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3972 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3973 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3974 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3975 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3979 /* Produce good hash value combining VAL and VAL2. */
3981 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3983 /* the golden ratio; an arbitrary value. */
3984 hashval_t a = 0x9e3779b9;
3990 /* Produce good hash value combining VAL and VAL2. */
3991 static inline hashval_t
3992 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3994 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3995 return iterative_hash_hashval_t (val, val2);
3998 hashval_t a = (hashval_t) val;
3999 /* Avoid warnings about shifting of more than the width of the type on
4000 hosts that won't execute this path. */
4002 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4004 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4006 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4007 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4014 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4015 is ATTRIBUTE and its qualifiers are QUALS.
4017 Record such modified types already made so we don't make duplicates. */
4020 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4022 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4024 hashval_t hashcode = 0;
4026 enum tree_code code = TREE_CODE (ttype);
4028 /* Building a distinct copy of a tagged type is inappropriate; it
4029 causes breakage in code that expects there to be a one-to-one
4030 relationship between a struct and its fields.
4031 build_duplicate_type is another solution (as used in
4032 handle_transparent_union_attribute), but that doesn't play well
4033 with the stronger C++ type identity model. */
4034 if (TREE_CODE (ttype) == RECORD_TYPE
4035 || TREE_CODE (ttype) == UNION_TYPE
4036 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4037 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4039 warning (OPT_Wattributes,
4040 "ignoring attributes applied to %qT after definition",
4041 TYPE_MAIN_VARIANT (ttype));
4042 return build_qualified_type (ttype, quals);
4045 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4046 ntype = build_distinct_type_copy (ttype);
4048 TYPE_ATTRIBUTES (ntype) = attribute;
4050 hashcode = iterative_hash_object (code, hashcode);
4051 if (TREE_TYPE (ntype))
4052 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4054 hashcode = attribute_hash_list (attribute, hashcode);
4056 switch (TREE_CODE (ntype))
4059 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4062 if (TYPE_DOMAIN (ntype))
4063 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4067 hashcode = iterative_hash_object
4068 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4069 hashcode = iterative_hash_object
4070 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4073 case FIXED_POINT_TYPE:
4075 unsigned int precision = TYPE_PRECISION (ntype);
4076 hashcode = iterative_hash_object (precision, hashcode);
4083 ntype = type_hash_canon (hashcode, ntype);
4085 /* If the target-dependent attributes make NTYPE different from
4086 its canonical type, we will need to use structural equality
4087 checks for this type. */
4088 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4089 || !targetm.comp_type_attributes (ntype, ttype))
4090 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4091 else if (TYPE_CANONICAL (ntype) == ntype)
4092 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4094 ttype = build_qualified_type (ntype, quals);
4096 else if (TYPE_QUALS (ttype) != quals)
4097 ttype = build_qualified_type (ttype, quals);
4103 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4106 Record such modified types already made so we don't make duplicates. */
4109 build_type_attribute_variant (tree ttype, tree attribute)
4111 return build_type_attribute_qual_variant (ttype, attribute,
4112 TYPE_QUALS (ttype));
4115 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4118 We try both `text' and `__text__', ATTR may be either one. */
4119 /* ??? It might be a reasonable simplification to require ATTR to be only
4120 `text'. One might then also require attribute lists to be stored in
4121 their canonicalized form. */
4124 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
4129 if (TREE_CODE (ident) != IDENTIFIER_NODE)
4132 p = IDENTIFIER_POINTER (ident);
4133 ident_len = IDENTIFIER_LENGTH (ident);
4135 if (ident_len == attr_len
4136 && strcmp (attr, p) == 0)
4139 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
4142 gcc_assert (attr[1] == '_');
4143 gcc_assert (attr[attr_len - 2] == '_');
4144 gcc_assert (attr[attr_len - 1] == '_');
4145 if (ident_len == attr_len - 4
4146 && strncmp (attr + 2, p, attr_len - 4) == 0)
4151 if (ident_len == attr_len + 4
4152 && p[0] == '_' && p[1] == '_'
4153 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
4154 && strncmp (attr, p + 2, attr_len) == 0)
4161 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4164 We try both `text' and `__text__', ATTR may be either one. */
4167 is_attribute_p (const char *attr, const_tree ident)
4169 return is_attribute_with_length_p (attr, strlen (attr), ident);
4172 /* Given an attribute name and a list of attributes, return a pointer to the
4173 attribute's list element if the attribute is part of the list, or NULL_TREE
4174 if not found. If the attribute appears more than once, this only
4175 returns the first occurrence; the TREE_CHAIN of the return value should
4176 be passed back in if further occurrences are wanted. */
4179 lookup_attribute (const char *attr_name, tree list)
4182 size_t attr_len = strlen (attr_name);
4184 for (l = list; l; l = TREE_CHAIN (l))
4186 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
4187 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
4193 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4197 remove_attribute (const char *attr_name, tree list)
4200 size_t attr_len = strlen (attr_name);
4202 for (p = &list; *p; )
4205 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
4206 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
4207 *p = TREE_CHAIN (l);
4209 p = &TREE_CHAIN (l);
4215 /* Return an attribute list that is the union of a1 and a2. */
4218 merge_attributes (tree a1, tree a2)
4222 /* Either one unset? Take the set one. */
4224 if ((attributes = a1) == 0)
4227 /* One that completely contains the other? Take it. */
4229 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
4231 if (attribute_list_contained (a2, a1))
4235 /* Pick the longest list, and hang on the other list. */
4237 if (list_length (a1) < list_length (a2))
4238 attributes = a2, a2 = a1;
4240 for (; a2 != 0; a2 = TREE_CHAIN (a2))
4243 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
4246 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
4249 if (TREE_VALUE (a) != NULL
4250 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
4251 && TREE_VALUE (a2) != NULL
4252 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
4254 if (simple_cst_list_equal (TREE_VALUE (a),
4255 TREE_VALUE (a2)) == 1)
4258 else if (simple_cst_equal (TREE_VALUE (a),
4259 TREE_VALUE (a2)) == 1)
4264 a1 = copy_node (a2);
4265 TREE_CHAIN (a1) = attributes;
4274 /* Given types T1 and T2, merge their attributes and return
4278 merge_type_attributes (tree t1, tree t2)
4280 return merge_attributes (TYPE_ATTRIBUTES (t1),
4281 TYPE_ATTRIBUTES (t2));
4284 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
4288 merge_decl_attributes (tree olddecl, tree newdecl)
4290 return merge_attributes (DECL_ATTRIBUTES (olddecl),
4291 DECL_ATTRIBUTES (newdecl));
4294 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
4296 /* Specialization of merge_decl_attributes for various Windows targets.
4298 This handles the following situation:
4300 __declspec (dllimport) int foo;
4303 The second instance of `foo' nullifies the dllimport. */
4306 merge_dllimport_decl_attributes (tree old, tree new_tree)
4309 int delete_dllimport_p = 1;
4311 /* What we need to do here is remove from `old' dllimport if it doesn't
4312 appear in `new'. dllimport behaves like extern: if a declaration is
4313 marked dllimport and a definition appears later, then the object
4314 is not dllimport'd. We also remove a `new' dllimport if the old list
4315 contains dllexport: dllexport always overrides dllimport, regardless
4316 of the order of declaration. */
4317 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
4318 delete_dllimport_p = 0;
4319 else if (DECL_DLLIMPORT_P (new_tree)
4320 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
4322 DECL_DLLIMPORT_P (new_tree) = 0;
4323 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
4324 "dllimport ignored", new_tree);
4326 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
4328 /* Warn about overriding a symbol that has already been used, e.g.:
4329 extern int __attribute__ ((dllimport)) foo;
4330 int* bar () {return &foo;}
4333 if (TREE_USED (old))
4335 warning (0, "%q+D redeclared without dllimport attribute "
4336 "after being referenced with dll linkage", new_tree);
4337 /* If we have used a variable's address with dllimport linkage,
4338 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
4339 decl may already have had TREE_CONSTANT computed.
4340 We still remove the attribute so that assembler code refers
4341 to '&foo rather than '_imp__foo'. */
4342 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
4343 DECL_DLLIMPORT_P (new_tree) = 1;
4346 /* Let an inline definition silently override the external reference,
4347 but otherwise warn about attribute inconsistency. */
4348 else if (TREE_CODE (new_tree) == VAR_DECL
4349 || !DECL_DECLARED_INLINE_P (new_tree))
4350 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
4351 "previous dllimport ignored", new_tree);
4354 delete_dllimport_p = 0;
4356 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
4358 if (delete_dllimport_p)
4361 const size_t attr_len = strlen ("dllimport");
4363 /* Scan the list for dllimport and delete it. */
4364 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
4366 if (is_attribute_with_length_p ("dllimport", attr_len,
4369 if (prev == NULL_TREE)
4372 TREE_CHAIN (prev) = TREE_CHAIN (t);
4381 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4382 struct attribute_spec.handler. */
4385 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4391 /* These attributes may apply to structure and union types being created,
4392 but otherwise should pass to the declaration involved. */
4395 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4396 | (int) ATTR_FLAG_ARRAY_NEXT))
4398 *no_add_attrs = true;
4399 return tree_cons (name, args, NULL_TREE);
4401 if (TREE_CODE (node) == RECORD_TYPE
4402 || TREE_CODE (node) == UNION_TYPE)
4404 node = TYPE_NAME (node);
4410 warning (OPT_Wattributes, "%qE attribute ignored",
4412 *no_add_attrs = true;
4417 if (TREE_CODE (node) != FUNCTION_DECL
4418 && TREE_CODE (node) != VAR_DECL
4419 && TREE_CODE (node) != TYPE_DECL)
4421 *no_add_attrs = true;
4422 warning (OPT_Wattributes, "%qE attribute ignored",
4427 if (TREE_CODE (node) == TYPE_DECL
4428 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
4429 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
4431 *no_add_attrs = true;
4432 warning (OPT_Wattributes, "%qE attribute ignored",
4437 is_dllimport = is_attribute_p ("dllimport", name);
4439 /* Report error on dllimport ambiguities seen now before they cause
4443 /* Honor any target-specific overrides. */
4444 if (!targetm.valid_dllimport_attribute_p (node))
4445 *no_add_attrs = true;
4447 else if (TREE_CODE (node) == FUNCTION_DECL
4448 && DECL_DECLARED_INLINE_P (node))
4450 warning (OPT_Wattributes, "inline function %q+D declared as "
4451 " dllimport: attribute ignored", node);
4452 *no_add_attrs = true;
4454 /* Like MS, treat definition of dllimported variables and
4455 non-inlined functions on declaration as syntax errors. */
4456 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4458 error ("function %q+D definition is marked dllimport", node);
4459 *no_add_attrs = true;
4462 else if (TREE_CODE (node) == VAR_DECL)
4464 if (DECL_INITIAL (node))
4466 error ("variable %q+D definition is marked dllimport",
4468 *no_add_attrs = true;
4471 /* `extern' needn't be specified with dllimport.
4472 Specify `extern' now and hope for the best. Sigh. */
4473 DECL_EXTERNAL (node) = 1;
4474 /* Also, implicitly give dllimport'd variables declared within
4475 a function global scope, unless declared static. */
4476 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4477 TREE_PUBLIC (node) = 1;
4480 if (*no_add_attrs == false)
4481 DECL_DLLIMPORT_P (node) = 1;
4483 else if (TREE_CODE (node) == FUNCTION_DECL
4484 && DECL_DECLARED_INLINE_P (node))
4485 /* An exported function, even if inline, must be emitted. */
4486 DECL_EXTERNAL (node) = 0;
4488 /* Report error if symbol is not accessible at global scope. */
4489 if (!TREE_PUBLIC (node)
4490 && (TREE_CODE (node) == VAR_DECL
4491 || TREE_CODE (node) == FUNCTION_DECL))
4493 error ("external linkage required for symbol %q+D because of "
4494 "%qE attribute", node, name);
4495 *no_add_attrs = true;
4498 /* A dllexport'd entity must have default visibility so that other
4499 program units (shared libraries or the main executable) can see
4500 it. A dllimport'd entity must have default visibility so that
4501 the linker knows that undefined references within this program
4502 unit can be resolved by the dynamic linker. */
4505 if (DECL_VISIBILITY_SPECIFIED (node)
4506 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4507 error ("%qE implies default visibility, but %qD has already "
4508 "been declared with a different visibility",
4510 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4511 DECL_VISIBILITY_SPECIFIED (node) = 1;
4517 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4519 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4520 of the various TYPE_QUAL values. */
4523 set_type_quals (tree type, int type_quals)
4525 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4526 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4527 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4530 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4533 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4535 return (TYPE_QUALS (cand) == type_quals
4536 && TYPE_NAME (cand) == TYPE_NAME (base)
4537 /* Apparently this is needed for Objective-C. */
4538 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4539 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4540 TYPE_ATTRIBUTES (base)));
4543 /* Return a version of the TYPE, qualified as indicated by the
4544 TYPE_QUALS, if one exists. If no qualified version exists yet,
4545 return NULL_TREE. */
4548 get_qualified_type (tree type, int type_quals)
4552 if (TYPE_QUALS (type) == type_quals)
4555 /* Search the chain of variants to see if there is already one there just
4556 like the one we need to have. If so, use that existing one. We must
4557 preserve the TYPE_NAME, since there is code that depends on this. */
4558 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4559 if (check_qualified_type (t, type, type_quals))
4565 /* Like get_qualified_type, but creates the type if it does not
4566 exist. This function never returns NULL_TREE. */
4569 build_qualified_type (tree type, int type_quals)
4573 /* See if we already have the appropriate qualified variant. */
4574 t = get_qualified_type (type, type_quals);
4576 /* If not, build it. */
4579 t = build_variant_type_copy (type);
4580 set_type_quals (t, type_quals);
4582 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4583 /* Propagate structural equality. */
4584 SET_TYPE_STRUCTURAL_EQUALITY (t);
4585 else if (TYPE_CANONICAL (type) != type)
4586 /* Build the underlying canonical type, since it is different
4588 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4591 /* T is its own canonical type. */
4592 TYPE_CANONICAL (t) = t;
4599 /* Create a new distinct copy of TYPE. The new type is made its own
4600 MAIN_VARIANT. If TYPE requires structural equality checks, the
4601 resulting type requires structural equality checks; otherwise, its
4602 TYPE_CANONICAL points to itself. */
4605 build_distinct_type_copy (tree type)
4607 tree t = copy_node (type);
4609 TYPE_POINTER_TO (t) = 0;
4610 TYPE_REFERENCE_TO (t) = 0;
4612 /* Set the canonical type either to a new equivalence class, or
4613 propagate the need for structural equality checks. */
4614 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4615 SET_TYPE_STRUCTURAL_EQUALITY (t);
4617 TYPE_CANONICAL (t) = t;
4619 /* Make it its own variant. */
4620 TYPE_MAIN_VARIANT (t) = t;
4621 TYPE_NEXT_VARIANT (t) = 0;
4623 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4624 whose TREE_TYPE is not t. This can also happen in the Ada
4625 frontend when using subtypes. */
4630 /* Create a new variant of TYPE, equivalent but distinct. This is so
4631 the caller can modify it. TYPE_CANONICAL for the return type will
4632 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4633 are considered equal by the language itself (or that both types
4634 require structural equality checks). */
4637 build_variant_type_copy (tree type)
4639 tree t, m = TYPE_MAIN_VARIANT (type);
4641 t = build_distinct_type_copy (type);
4643 /* Since we're building a variant, assume that it is a non-semantic
4644 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4645 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4647 /* Add the new type to the chain of variants of TYPE. */
4648 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4649 TYPE_NEXT_VARIANT (m) = t;
4650 TYPE_MAIN_VARIANT (t) = m;
4655 /* Return true if the from tree in both tree maps are equal. */
4658 tree_map_base_eq (const void *va, const void *vb)
4660 const struct tree_map_base *const a = (const struct tree_map_base *) va,
4661 *const b = (const struct tree_map_base *) vb;
4662 return (a->from == b->from);
4665 /* Hash a from tree in a tree_map. */
4668 tree_map_base_hash (const void *item)
4670 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4673 /* Return true if this tree map structure is marked for garbage collection
4674 purposes. We simply return true if the from tree is marked, so that this
4675 structure goes away when the from tree goes away. */
4678 tree_map_base_marked_p (const void *p)
4680 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4684 tree_map_hash (const void *item)
4686 return (((const struct tree_map *) item)->hash);
4689 /* Return the initialization priority for DECL. */
4692 decl_init_priority_lookup (tree decl)
4694 struct tree_priority_map *h;
4695 struct tree_map_base in;
4697 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4699 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4700 return h ? h->init : DEFAULT_INIT_PRIORITY;
4703 /* Return the finalization priority for DECL. */
4706 decl_fini_priority_lookup (tree decl)
4708 struct tree_priority_map *h;
4709 struct tree_map_base in;
4711 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4713 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4714 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4717 /* Return the initialization and finalization priority information for
4718 DECL. If there is no previous priority information, a freshly
4719 allocated structure is returned. */
4721 static struct tree_priority_map *
4722 decl_priority_info (tree decl)
4724 struct tree_priority_map in;
4725 struct tree_priority_map *h;
4728 in.base.from = decl;
4729 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4730 h = (struct tree_priority_map *) *loc;
4733 h = GGC_CNEW (struct tree_priority_map);
4735 h->base.from = decl;
4736 h->init = DEFAULT_INIT_PRIORITY;
4737 h->fini = DEFAULT_INIT_PRIORITY;
4743 /* Set the initialization priority for DECL to PRIORITY. */
4746 decl_init_priority_insert (tree decl, priority_type priority)
4748 struct tree_priority_map *h;
4750 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4751 h = decl_priority_info (decl);
4755 /* Set the finalization priority for DECL to PRIORITY. */
4758 decl_fini_priority_insert (tree decl, priority_type priority)
4760 struct tree_priority_map *h;
4762 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4763 h = decl_priority_info (decl);
4767 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4770 print_debug_expr_statistics (void)
4772 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4773 (long) htab_size (debug_expr_for_decl),
4774 (long) htab_elements (debug_expr_for_decl),
4775 htab_collisions (debug_expr_for_decl));
4778 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4781 print_value_expr_statistics (void)
4783 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4784 (long) htab_size (value_expr_for_decl),
4785 (long) htab_elements (value_expr_for_decl),
4786 htab_collisions (value_expr_for_decl));
4789 /* Lookup a debug expression for FROM, and return it if we find one. */
4792 decl_debug_expr_lookup (tree from)
4794 struct tree_map *h, in;
4795 in.base.from = from;
4797 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
4798 htab_hash_pointer (from));
4804 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4807 decl_debug_expr_insert (tree from, tree to)
4812 h = GGC_NEW (struct tree_map);
4813 h->hash = htab_hash_pointer (from);
4814 h->base.from = from;
4816 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4817 *(struct tree_map **) loc = h;
4820 /* Lookup a value expression for FROM, and return it if we find one. */
4823 decl_value_expr_lookup (tree from)
4825 struct tree_map *h, in;
4826 in.base.from = from;
4828 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
4829 htab_hash_pointer (from));
4835 /* Insert a mapping FROM->TO in the value expression hashtable. */
4838 decl_value_expr_insert (tree from, tree to)
4843 h = GGC_NEW (struct tree_map);
4844 h->hash = htab_hash_pointer (from);
4845 h->base.from = from;
4847 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4848 *(struct tree_map **) loc = h;
4851 /* Hashing of types so that we don't make duplicates.
4852 The entry point is `type_hash_canon'. */
4854 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4855 with types in the TREE_VALUE slots), by adding the hash codes
4856 of the individual types. */
4859 type_hash_list (const_tree list, hashval_t hashcode)
4863 for (tail = list; tail; tail = TREE_CHAIN (tail))
4864 if (TREE_VALUE (tail) != error_mark_node)
4865 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4871 /* These are the Hashtable callback functions. */
4873 /* Returns true iff the types are equivalent. */
4876 type_hash_eq (const void *va, const void *vb)
4878 const struct type_hash *const a = (const struct type_hash *) va,
4879 *const b = (const struct type_hash *) vb;
4881 /* First test the things that are the same for all types. */
4882 if (a->hash != b->hash
4883 || TREE_CODE (a->type) != TREE_CODE (b->type)
4884 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4885 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4886 TYPE_ATTRIBUTES (b->type))
4887 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4888 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
4889 || (TREE_CODE (a->type) != COMPLEX_TYPE
4890 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
4893 switch (TREE_CODE (a->type))
4898 case REFERENCE_TYPE:
4902 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4905 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4906 && !(TYPE_VALUES (a->type)
4907 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4908 && TYPE_VALUES (b->type)
4909 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4910 && type_list_equal (TYPE_VALUES (a->type),
4911 TYPE_VALUES (b->type))))
4914 /* ... fall through ... */
4919 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4920 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4921 TYPE_MAX_VALUE (b->type)))
4922 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4923 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4924 TYPE_MIN_VALUE (b->type))));
4926 case FIXED_POINT_TYPE:
4927 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4930 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4933 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4934 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4935 || (TYPE_ARG_TYPES (a->type)
4936 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4937 && TYPE_ARG_TYPES (b->type)
4938 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4939 && type_list_equal (TYPE_ARG_TYPES (a->type),
4940 TYPE_ARG_TYPES (b->type)))));
4943 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4947 case QUAL_UNION_TYPE:
4948 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4949 || (TYPE_FIELDS (a->type)
4950 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4951 && TYPE_FIELDS (b->type)
4952 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4953 && type_list_equal (TYPE_FIELDS (a->type),
4954 TYPE_FIELDS (b->type))));
4957 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4958 || (TYPE_ARG_TYPES (a->type)
4959 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4960 && TYPE_ARG_TYPES (b->type)
4961 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4962 && type_list_equal (TYPE_ARG_TYPES (a->type),
4963 TYPE_ARG_TYPES (b->type))))
4971 if (lang_hooks.types.type_hash_eq != NULL)
4972 return lang_hooks.types.type_hash_eq (a->type, b->type);
4977 /* Return the cached hash value. */
4980 type_hash_hash (const void *item)
4982 return ((const struct type_hash *) item)->hash;
4985 /* Look in the type hash table for a type isomorphic to TYPE.
4986 If one is found, return it. Otherwise return 0. */
4989 type_hash_lookup (hashval_t hashcode, tree type)
4991 struct type_hash *h, in;
4993 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4994 must call that routine before comparing TYPE_ALIGNs. */
5000 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5007 /* Add an entry to the type-hash-table
5008 for a type TYPE whose hash code is HASHCODE. */
5011 type_hash_add (hashval_t hashcode, tree type)
5013 struct type_hash *h;
5016 h = GGC_NEW (struct type_hash);
5019 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5023 /* Given TYPE, and HASHCODE its hash code, return the canonical
5024 object for an identical type if one already exists.
5025 Otherwise, return TYPE, and record it as the canonical object.
5027 To use this function, first create a type of the sort you want.
5028 Then compute its hash code from the fields of the type that
5029 make it different from other similar types.
5030 Then call this function and use the value. */
5033 type_hash_canon (unsigned int hashcode, tree type)
5037 /* The hash table only contains main variants, so ensure that's what we're
5039 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5041 if (!lang_hooks.types.hash_types)
5044 /* See if the type is in the hash table already. If so, return it.
5045 Otherwise, add the type. */
5046 t1 = type_hash_lookup (hashcode, type);
5049 #ifdef GATHER_STATISTICS
5050 tree_node_counts[(int) t_kind]--;
5051 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5057 type_hash_add (hashcode, type);
5062 /* See if the data pointed to by the type hash table is marked. We consider
5063 it marked if the type is marked or if a debug type number or symbol
5064 table entry has been made for the type. This reduces the amount of
5065 debugging output and eliminates that dependency of the debug output on
5066 the number of garbage collections. */
5069 type_hash_marked_p (const void *p)
5071 const_tree const type = ((const struct type_hash *) p)->type;
5073 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5077 print_type_hash_statistics (void)
5079 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5080 (long) htab_size (type_hash_table),
5081 (long) htab_elements (type_hash_table),
5082 htab_collisions (type_hash_table));
5085 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5086 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5087 by adding the hash codes of the individual attributes. */
5090 attribute_hash_list (const_tree list, hashval_t hashcode)
5094 for (tail = list; tail; tail = TREE_CHAIN (tail))
5095 /* ??? Do we want to add in TREE_VALUE too? */
5096 hashcode = iterative_hash_object
5097 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
5101 /* Given two lists of attributes, return true if list l2 is
5102 equivalent to l1. */
5105 attribute_list_equal (const_tree l1, const_tree l2)
5107 return attribute_list_contained (l1, l2)
5108 && attribute_list_contained (l2, l1);
5111 /* Given two lists of attributes, return true if list L2 is
5112 completely contained within L1. */
5113 /* ??? This would be faster if attribute names were stored in a canonicalized
5114 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
5115 must be used to show these elements are equivalent (which they are). */
5116 /* ??? It's not clear that attributes with arguments will always be handled
5120 attribute_list_contained (const_tree l1, const_tree l2)
5124 /* First check the obvious, maybe the lists are identical. */
5128 /* Maybe the lists are similar. */
5129 for (t1 = l1, t2 = l2;
5131 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
5132 && TREE_VALUE (t1) == TREE_VALUE (t2);
5133 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
5135 /* Maybe the lists are equal. */
5136 if (t1 == 0 && t2 == 0)
5139 for (; t2 != 0; t2 = TREE_CHAIN (t2))
5142 /* This CONST_CAST is okay because lookup_attribute does not
5143 modify its argument and the return value is assigned to a
5145 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
5146 CONST_CAST_TREE(l1));
5148 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
5151 if (TREE_VALUE (t2) != NULL
5152 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
5153 && TREE_VALUE (attr) != NULL
5154 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
5156 if (simple_cst_list_equal (TREE_VALUE (t2),
5157 TREE_VALUE (attr)) == 1)
5160 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
5171 /* Given two lists of types
5172 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
5173 return 1 if the lists contain the same types in the same order.
5174 Also, the TREE_PURPOSEs must match. */
5177 type_list_equal (const_tree l1, const_tree l2)
5181 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
5182 if (TREE_VALUE (t1) != TREE_VALUE (t2)
5183 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
5184 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
5185 && (TREE_TYPE (TREE_PURPOSE (t1))
5186 == TREE_TYPE (TREE_PURPOSE (t2))))))
5192 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
5193 given by TYPE. If the argument list accepts variable arguments,
5194 then this function counts only the ordinary arguments. */
5197 type_num_arguments (const_tree type)
5202 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
5203 /* If the function does not take a variable number of arguments,
5204 the last element in the list will have type `void'. */
5205 if (VOID_TYPE_P (TREE_VALUE (t)))
5213 /* Nonzero if integer constants T1 and T2
5214 represent the same constant value. */
5217 tree_int_cst_equal (const_tree t1, const_tree t2)
5222 if (t1 == 0 || t2 == 0)
5225 if (TREE_CODE (t1) == INTEGER_CST
5226 && TREE_CODE (t2) == INTEGER_CST
5227 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5228 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
5234 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
5235 The precise way of comparison depends on their data type. */
5238 tree_int_cst_lt (const_tree t1, const_tree t2)
5243 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
5245 int t1_sgn = tree_int_cst_sgn (t1);
5246 int t2_sgn = tree_int_cst_sgn (t2);
5248 if (t1_sgn < t2_sgn)
5250 else if (t1_sgn > t2_sgn)
5252 /* Otherwise, both are non-negative, so we compare them as
5253 unsigned just in case one of them would overflow a signed
5256 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
5257 return INT_CST_LT (t1, t2);
5259 return INT_CST_LT_UNSIGNED (t1, t2);
5262 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
5265 tree_int_cst_compare (const_tree t1, const_tree t2)
5267 if (tree_int_cst_lt (t1, t2))
5269 else if (tree_int_cst_lt (t2, t1))
5275 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
5276 the host. If POS is zero, the value can be represented in a single
5277 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
5278 be represented in a single unsigned HOST_WIDE_INT. */
5281 host_integerp (const_tree t, int pos)
5283 return (TREE_CODE (t) == INTEGER_CST
5284 && ((TREE_INT_CST_HIGH (t) == 0
5285 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
5286 || (! pos && TREE_INT_CST_HIGH (t) == -1
5287 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
5288 && (!TYPE_UNSIGNED (TREE_TYPE (t))
5289 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
5290 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
5291 || (pos && TREE_INT_CST_HIGH (t) == 0)));
5294 /* Return the HOST_WIDE_INT least significant bits of T if it is an
5295 INTEGER_CST and there is no overflow. POS is nonzero if the result must
5296 be non-negative. We must be able to satisfy the above conditions. */
5299 tree_low_cst (const_tree t, int pos)
5301 gcc_assert (host_integerp (t, pos));
5302 return TREE_INT_CST_LOW (t);
5305 /* Return the most significant bit of the integer constant T. */
5308 tree_int_cst_msb (const_tree t)
5312 unsigned HOST_WIDE_INT l;
5314 /* Note that using TYPE_PRECISION here is wrong. We care about the
5315 actual bits, not the (arbitrary) range of the type. */
5316 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
5317 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
5318 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
5319 return (l & 1) == 1;
5322 /* Return an indication of the sign of the integer constant T.
5323 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
5324 Note that -1 will never be returned if T's type is unsigned. */
5327 tree_int_cst_sgn (const_tree t)
5329 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
5331 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
5333 else if (TREE_INT_CST_HIGH (t) < 0)
5339 /* Return the minimum number of bits needed to represent VALUE in a
5340 signed or unsigned type, UNSIGNEDP says which. */
5343 tree_int_cst_min_precision (tree value, bool unsignedp)
5347 /* If the value is negative, compute its negative minus 1. The latter
5348 adjustment is because the absolute value of the largest negative value
5349 is one larger than the largest positive value. This is equivalent to
5350 a bit-wise negation, so use that operation instead. */
5352 if (tree_int_cst_sgn (value) < 0)
5353 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
5355 /* Return the number of bits needed, taking into account the fact
5356 that we need one more bit for a signed than unsigned type. */
5358 if (integer_zerop (value))
5361 log = tree_floor_log2 (value);
5363 return log + 1 + !unsignedp;
5366 /* Compare two constructor-element-type constants. Return 1 if the lists
5367 are known to be equal; otherwise return 0. */
5370 simple_cst_list_equal (const_tree l1, const_tree l2)
5372 while (l1 != NULL_TREE && l2 != NULL_TREE)
5374 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
5377 l1 = TREE_CHAIN (l1);
5378 l2 = TREE_CHAIN (l2);
5384 /* Return truthvalue of whether T1 is the same tree structure as T2.
5385 Return 1 if they are the same.
5386 Return 0 if they are understandably different.
5387 Return -1 if either contains tree structure not understood by
5391 simple_cst_equal (const_tree t1, const_tree t2)
5393 enum tree_code code1, code2;
5399 if (t1 == 0 || t2 == 0)
5402 code1 = TREE_CODE (t1);
5403 code2 = TREE_CODE (t2);
5405 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
5407 if (CONVERT_EXPR_CODE_P (code2)
5408 || code2 == NON_LVALUE_EXPR)
5409 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5411 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5414 else if (CONVERT_EXPR_CODE_P (code2)
5415 || code2 == NON_LVALUE_EXPR)
5416 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5424 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5425 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5428 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5431 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5434 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5435 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5436 TREE_STRING_LENGTH (t1)));
5440 unsigned HOST_WIDE_INT idx;
5441 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5442 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5444 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5447 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5448 /* ??? Should we handle also fields here? */
5449 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5450 VEC_index (constructor_elt, v2, idx)->value))
5456 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5459 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5462 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5465 const_tree arg1, arg2;
5466 const_call_expr_arg_iterator iter1, iter2;
5467 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5468 arg2 = first_const_call_expr_arg (t2, &iter2);
5470 arg1 = next_const_call_expr_arg (&iter1),
5471 arg2 = next_const_call_expr_arg (&iter2))
5473 cmp = simple_cst_equal (arg1, arg2);
5477 return arg1 == arg2;
5481 /* Special case: if either target is an unallocated VAR_DECL,
5482 it means that it's going to be unified with whatever the
5483 TARGET_EXPR is really supposed to initialize, so treat it
5484 as being equivalent to anything. */
5485 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5486 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5487 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5488 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5489 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5490 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5493 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5498 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5500 case WITH_CLEANUP_EXPR:
5501 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5505 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5508 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5509 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5523 /* This general rule works for most tree codes. All exceptions should be
5524 handled above. If this is a language-specific tree code, we can't
5525 trust what might be in the operand, so say we don't know
5527 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5530 switch (TREE_CODE_CLASS (code1))
5534 case tcc_comparison:
5535 case tcc_expression:
5539 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5541 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5553 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5554 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5555 than U, respectively. */
5558 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5560 if (tree_int_cst_sgn (t) < 0)
5562 else if (TREE_INT_CST_HIGH (t) != 0)
5564 else if (TREE_INT_CST_LOW (t) == u)
5566 else if (TREE_INT_CST_LOW (t) < u)
5572 /* Return true if CODE represents an associative tree code. Otherwise
5575 associative_tree_code (enum tree_code code)
5594 /* Return true if CODE represents a commutative tree code. Otherwise
5597 commutative_tree_code (enum tree_code code)
5610 case UNORDERED_EXPR:
5614 case TRUTH_AND_EXPR:
5615 case TRUTH_XOR_EXPR:
5625 /* Generate a hash value for an expression. This can be used iteratively
5626 by passing a previous result as the VAL argument.
5628 This function is intended to produce the same hash for expressions which
5629 would compare equal using operand_equal_p. */
5632 iterative_hash_expr (const_tree t, hashval_t val)
5635 enum tree_code code;
5639 return iterative_hash_hashval_t (0, val);
5641 code = TREE_CODE (t);
5645 /* Alas, constants aren't shared, so we can't rely on pointer
5648 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5649 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5652 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5654 return iterative_hash_hashval_t (val2, val);
5658 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5660 return iterative_hash_hashval_t (val2, val);
5663 return iterative_hash (TREE_STRING_POINTER (t),
5664 TREE_STRING_LENGTH (t), val);
5666 val = iterative_hash_expr (TREE_REALPART (t), val);
5667 return iterative_hash_expr (TREE_IMAGPART (t), val);
5669 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5672 /* we can just compare by pointer. */
5673 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
5676 /* A list of expressions, for a CALL_EXPR or as the elements of a
5678 for (; t; t = TREE_CHAIN (t))
5679 val = iterative_hash_expr (TREE_VALUE (t), val);
5683 unsigned HOST_WIDE_INT idx;
5685 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5687 val = iterative_hash_expr (field, val);
5688 val = iterative_hash_expr (value, val);
5693 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
5694 Otherwise nodes that compare equal according to operand_equal_p might
5695 get different hash codes. However, don't do this for machine specific
5696 or front end builtins, since the function code is overloaded in those
5698 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
5699 && built_in_decls[DECL_FUNCTION_CODE (t)])
5701 t = built_in_decls[DECL_FUNCTION_CODE (t)];
5702 code = TREE_CODE (t);
5706 tclass = TREE_CODE_CLASS (code);
5708 if (tclass == tcc_declaration)
5710 /* DECL's have a unique ID */
5711 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5715 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
5717 val = iterative_hash_object (code, val);
5719 /* Don't hash the type, that can lead to having nodes which
5720 compare equal according to operand_equal_p, but which
5721 have different hash codes. */
5722 if (CONVERT_EXPR_CODE_P (code)
5723 || code == NON_LVALUE_EXPR)
5725 /* Make sure to include signness in the hash computation. */
5726 val += TYPE_UNSIGNED (TREE_TYPE (t));
5727 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5730 else if (commutative_tree_code (code))
5732 /* It's a commutative expression. We want to hash it the same
5733 however it appears. We do this by first hashing both operands
5734 and then rehashing based on the order of their independent
5736 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5737 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5741 t = one, one = two, two = t;
5743 val = iterative_hash_hashval_t (one, val);
5744 val = iterative_hash_hashval_t (two, val);
5747 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5748 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5755 /* Generate a hash value for a pair of expressions. This can be used
5756 iteratively by passing a previous result as the VAL argument.
5758 The same hash value is always returned for a given pair of expressions,
5759 regardless of the order in which they are presented. This is useful in
5760 hashing the operands of commutative functions. */
5763 iterative_hash_exprs_commutative (const_tree t1,
5764 const_tree t2, hashval_t val)
5766 hashval_t one = iterative_hash_expr (t1, 0);
5767 hashval_t two = iterative_hash_expr (t2, 0);
5771 t = one, one = two, two = t;
5772 val = iterative_hash_hashval_t (one, val);
5773 val = iterative_hash_hashval_t (two, val);
5778 /* Constructors for pointer, array and function types.
5779 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5780 constructed by language-dependent code, not here.) */
5782 /* Construct, lay out and return the type of pointers to TO_TYPE with
5783 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5784 reference all of memory. If such a type has already been
5785 constructed, reuse it. */
5788 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5793 if (to_type == error_mark_node)
5794 return error_mark_node;
5796 /* If the pointed-to type has the may_alias attribute set, force
5797 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5798 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5799 can_alias_all = true;
5801 /* In some cases, languages will have things that aren't a POINTER_TYPE
5802 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5803 In that case, return that type without regard to the rest of our
5806 ??? This is a kludge, but consistent with the way this function has
5807 always operated and there doesn't seem to be a good way to avoid this
5809 if (TYPE_POINTER_TO (to_type) != 0
5810 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5811 return TYPE_POINTER_TO (to_type);
5813 /* First, if we already have a type for pointers to TO_TYPE and it's
5814 the proper mode, use it. */
5815 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5816 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5819 t = make_node (POINTER_TYPE);
5821 TREE_TYPE (t) = to_type;
5822 SET_TYPE_MODE (t, mode);
5823 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5824 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5825 TYPE_POINTER_TO (to_type) = t;
5827 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5828 SET_TYPE_STRUCTURAL_EQUALITY (t);
5829 else if (TYPE_CANONICAL (to_type) != to_type)
5831 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5832 mode, can_alias_all);
5834 /* Lay out the type. This function has many callers that are concerned
5835 with expression-construction, and this simplifies them all. */
5841 /* By default build pointers in ptr_mode. */
5844 build_pointer_type (tree to_type)
5846 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5849 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5852 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5857 if (to_type == error_mark_node)
5858 return error_mark_node;
5860 /* If the pointed-to type has the may_alias attribute set, force
5861 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5862 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5863 can_alias_all = true;
5865 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5866 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5867 In that case, return that type without regard to the rest of our
5870 ??? This is a kludge, but consistent with the way this function has
5871 always operated and there doesn't seem to be a good way to avoid this
5873 if (TYPE_REFERENCE_TO (to_type) != 0
5874 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5875 return TYPE_REFERENCE_TO (to_type);
5877 /* First, if we already have a type for pointers to TO_TYPE and it's
5878 the proper mode, use it. */
5879 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5880 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5883 t = make_node (REFERENCE_TYPE);
5885 TREE_TYPE (t) = to_type;
5886 SET_TYPE_MODE (t, mode);
5887 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5888 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5889 TYPE_REFERENCE_TO (to_type) = t;
5891 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5892 SET_TYPE_STRUCTURAL_EQUALITY (t);
5893 else if (TYPE_CANONICAL (to_type) != to_type)
5895 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5896 mode, can_alias_all);
5904 /* Build the node for the type of references-to-TO_TYPE by default
5908 build_reference_type (tree to_type)
5910 return build_reference_type_for_mode (to_type, ptr_mode, false);
5913 /* Build a type that is compatible with t but has no cv quals anywhere
5916 const char *const *const * -> char ***. */
5919 build_type_no_quals (tree t)
5921 switch (TREE_CODE (t))
5924 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5926 TYPE_REF_CAN_ALIAS_ALL (t));
5927 case REFERENCE_TYPE:
5929 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5931 TYPE_REF_CAN_ALIAS_ALL (t));
5933 return TYPE_MAIN_VARIANT (t);
5937 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5938 MAXVAL should be the maximum value in the domain
5939 (one less than the length of the array).
5941 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5942 We don't enforce this limit, that is up to caller (e.g. language front end).
5943 The limit exists because the result is a signed type and we don't handle
5944 sizes that use more than one HOST_WIDE_INT. */
5947 build_index_type (tree maxval)
5949 tree itype = make_node (INTEGER_TYPE);
5951 TREE_TYPE (itype) = sizetype;
5952 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5953 TYPE_MIN_VALUE (itype) = size_zero_node;
5954 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5955 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
5956 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5957 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5958 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5959 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5961 if (host_integerp (maxval, 1))
5962 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5965 /* Since we cannot hash this type, we need to compare it using
5966 structural equality checks. */
5967 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5972 /* Builds a signed or unsigned integer type of precision PRECISION.
5973 Used for C bitfields whose precision does not match that of
5974 built-in target types. */
5976 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5979 tree itype = make_node (INTEGER_TYPE);
5981 TYPE_PRECISION (itype) = precision;
5984 fixup_unsigned_type (itype);
5986 fixup_signed_type (itype);
5988 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5989 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5994 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5995 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5996 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5999 build_range_type (tree type, tree lowval, tree highval)
6001 tree itype = make_node (INTEGER_TYPE);
6003 TREE_TYPE (itype) = type;
6004 if (type == NULL_TREE)
6007 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6008 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6010 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6011 SET_TYPE_MODE (itype, TYPE_MODE (type));
6012 TYPE_SIZE (itype) = TYPE_SIZE (type);
6013 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6014 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6015 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6017 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6018 return type_hash_canon (tree_low_cst (highval, 0)
6019 - tree_low_cst (lowval, 0),
6025 /* Return true if the debug information for TYPE, a subtype, should be emitted
6026 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6027 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6028 debug info and doesn't reflect the source code. */
6031 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6033 tree base_type = TREE_TYPE (type), low, high;
6035 /* Subrange types have a base type which is an integral type. */
6036 if (!INTEGRAL_TYPE_P (base_type))
6039 /* Get the real bounds of the subtype. */
6040 if (lang_hooks.types.get_subrange_bounds)
6041 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6044 low = TYPE_MIN_VALUE (type);
6045 high = TYPE_MAX_VALUE (type);
6048 /* If the type and its base type have the same representation and the same
6049 name, then the type is not a subrange but a copy of the base type. */
6050 if ((TREE_CODE (base_type) == INTEGER_TYPE
6051 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6052 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6053 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6054 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6056 tree type_name = TYPE_NAME (type);
6057 tree base_type_name = TYPE_NAME (base_type);
6059 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6060 type_name = DECL_NAME (type_name);
6062 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6063 base_type_name = DECL_NAME (base_type_name);
6065 if (type_name == base_type_name)
6076 /* Just like build_index_type, but takes lowval and highval instead
6077 of just highval (maxval). */
6080 build_index_2_type (tree lowval, tree highval)
6082 return build_range_type (sizetype, lowval, highval);
6085 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6086 and number of elements specified by the range of values of INDEX_TYPE.
6087 If such a type has already been constructed, reuse it. */
6090 build_array_type (tree elt_type, tree index_type)
6093 hashval_t hashcode = 0;
6095 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
6097 error ("arrays of functions are not meaningful");
6098 elt_type = integer_type_node;
6101 t = make_node (ARRAY_TYPE);
6102 TREE_TYPE (t) = elt_type;
6103 TYPE_DOMAIN (t) = index_type;
6105 if (index_type == 0)
6108 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
6109 t = type_hash_canon (hashcode, t);
6113 if (TYPE_CANONICAL (t) == t)
6115 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
6116 SET_TYPE_STRUCTURAL_EQUALITY (t);
6117 else if (TYPE_CANONICAL (elt_type) != elt_type)
6119 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
6125 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
6126 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
6127 t = type_hash_canon (hashcode, t);
6129 if (!COMPLETE_TYPE_P (t))
6132 if (TYPE_CANONICAL (t) == t)
6134 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
6135 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
6136 SET_TYPE_STRUCTURAL_EQUALITY (t);
6137 else if (TYPE_CANONICAL (elt_type) != elt_type
6138 || TYPE_CANONICAL (index_type) != index_type)
6140 = build_array_type (TYPE_CANONICAL (elt_type),
6141 TYPE_CANONICAL (index_type));
6147 /* Recursively examines the array elements of TYPE, until a non-array
6148 element type is found. */
6151 strip_array_types (tree type)
6153 while (TREE_CODE (type) == ARRAY_TYPE)
6154 type = TREE_TYPE (type);
6159 /* Computes the canonical argument types from the argument type list
6162 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
6163 on entry to this function, or if any of the ARGTYPES are
6166 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
6167 true on entry to this function, or if any of the ARGTYPES are
6170 Returns a canonical argument list, which may be ARGTYPES when the
6171 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
6172 true) or would not differ from ARGTYPES. */
6175 maybe_canonicalize_argtypes(tree argtypes,
6176 bool *any_structural_p,
6177 bool *any_noncanonical_p)
6180 bool any_noncanonical_argtypes_p = false;
6182 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
6184 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
6185 /* Fail gracefully by stating that the type is structural. */
6186 *any_structural_p = true;
6187 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
6188 *any_structural_p = true;
6189 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
6190 || TREE_PURPOSE (arg))
6191 /* If the argument has a default argument, we consider it
6192 non-canonical even though the type itself is canonical.
6193 That way, different variants of function and method types
6194 with default arguments will all point to the variant with
6195 no defaults as their canonical type. */
6196 any_noncanonical_argtypes_p = true;
6199 if (*any_structural_p)
6202 if (any_noncanonical_argtypes_p)
6204 /* Build the canonical list of argument types. */
6205 tree canon_argtypes = NULL_TREE;
6206 bool is_void = false;
6208 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
6210 if (arg == void_list_node)
6213 canon_argtypes = tree_cons (NULL_TREE,
6214 TYPE_CANONICAL (TREE_VALUE (arg)),
6218 canon_argtypes = nreverse (canon_argtypes);
6220 canon_argtypes = chainon (canon_argtypes, void_list_node);
6222 /* There is a non-canonical type. */
6223 *any_noncanonical_p = true;
6224 return canon_argtypes;
6227 /* The canonical argument types are the same as ARGTYPES. */
6231 /* Construct, lay out and return
6232 the type of functions returning type VALUE_TYPE
6233 given arguments of types ARG_TYPES.
6234 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
6235 are data type nodes for the arguments of the function.
6236 If such a type has already been constructed, reuse it. */
6239 build_function_type (tree value_type, tree arg_types)
6242 hashval_t hashcode = 0;
6243 bool any_structural_p, any_noncanonical_p;
6244 tree canon_argtypes;
6246 if (TREE_CODE (value_type) == FUNCTION_TYPE)
6248 error ("function return type cannot be function");
6249 value_type = integer_type_node;
6252 /* Make a node of the sort we want. */
6253 t = make_node (FUNCTION_TYPE);
6254 TREE_TYPE (t) = value_type;
6255 TYPE_ARG_TYPES (t) = arg_types;
6257 /* If we already have such a type, use the old one. */
6258 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
6259 hashcode = type_hash_list (arg_types, hashcode);
6260 t = type_hash_canon (hashcode, t);
6262 /* Set up the canonical type. */
6263 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
6264 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
6265 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
6267 &any_noncanonical_p);
6268 if (any_structural_p)
6269 SET_TYPE_STRUCTURAL_EQUALITY (t);
6270 else if (any_noncanonical_p)
6271 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
6274 if (!COMPLETE_TYPE_P (t))
6279 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
6282 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
6284 tree new_type = NULL;
6285 tree args, new_args = NULL, t;
6289 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
6290 args = TREE_CHAIN (args), i++)
6291 if (!bitmap_bit_p (args_to_skip, i))
6292 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
6294 new_reversed = nreverse (new_args);
6298 TREE_CHAIN (new_args) = void_list_node;
6300 new_reversed = void_list_node;
6302 gcc_assert (new_reversed);
6304 /* Use copy_node to preserve as much as possible from original type
6305 (debug info, attribute lists etc.)
6306 Exception is METHOD_TYPEs must have THIS argument.
6307 When we are asked to remove it, we need to build new FUNCTION_TYPE
6309 if (TREE_CODE (orig_type) != METHOD_TYPE
6310 || !bitmap_bit_p (args_to_skip, 0))
6312 new_type = copy_node (orig_type);
6313 TYPE_ARG_TYPES (new_type) = new_reversed;
6318 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
6320 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
6323 /* This is a new type, not a copy of an old type. Need to reassociate
6324 variants. We can handle everything except the main variant lazily. */
6325 t = TYPE_MAIN_VARIANT (orig_type);
6328 TYPE_MAIN_VARIANT (new_type) = t;
6329 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
6330 TYPE_NEXT_VARIANT (t) = new_type;
6334 TYPE_MAIN_VARIANT (new_type) = new_type;
6335 TYPE_NEXT_VARIANT (new_type) = NULL;
6340 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
6342 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
6343 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
6344 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
6347 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
6349 tree new_decl = copy_node (orig_decl);
6352 new_type = TREE_TYPE (orig_decl);
6353 if (prototype_p (new_type))
6354 new_type = build_function_type_skip_args (new_type, args_to_skip);
6355 TREE_TYPE (new_decl) = new_type;
6357 /* For declarations setting DECL_VINDEX (i.e. methods)
6358 we expect first argument to be THIS pointer. */
6359 if (bitmap_bit_p (args_to_skip, 0))
6360 DECL_VINDEX (new_decl) = NULL_TREE;
6364 /* Build a function type. The RETURN_TYPE is the type returned by the
6365 function. If VAARGS is set, no void_type_node is appended to the
6366 the list. ARGP muse be alway be terminated be a NULL_TREE. */
6369 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
6373 t = va_arg (argp, tree);
6374 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
6375 args = tree_cons (NULL_TREE, t, args);
6380 if (args != NULL_TREE)
6381 args = nreverse (args);
6382 gcc_assert (args != NULL_TREE && last != void_list_node);
6384 else if (args == NULL_TREE)
6385 args = void_list_node;
6389 args = nreverse (args);
6390 TREE_CHAIN (last) = void_list_node;
6392 args = build_function_type (return_type, args);
6397 /* Build a function type. The RETURN_TYPE is the type returned by the
6398 function. If additional arguments are provided, they are
6399 additional argument types. The list of argument types must always
6400 be terminated by NULL_TREE. */
6403 build_function_type_list (tree return_type, ...)
6408 va_start (p, return_type);
6409 args = build_function_type_list_1 (false, return_type, p);
6414 /* Build a variable argument function type. The RETURN_TYPE is the
6415 type returned by the function. If additional arguments are provided,
6416 they are additional argument types. The list of argument types must
6417 always be terminated by NULL_TREE. */
6420 build_varargs_function_type_list (tree return_type, ...)
6425 va_start (p, return_type);
6426 args = build_function_type_list_1 (true, return_type, p);
6432 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
6433 and ARGTYPES (a TREE_LIST) are the return type and arguments types
6434 for the method. An implicit additional parameter (of type
6435 pointer-to-BASETYPE) is added to the ARGTYPES. */
6438 build_method_type_directly (tree basetype,
6445 bool any_structural_p, any_noncanonical_p;
6446 tree canon_argtypes;
6448 /* Make a node of the sort we want. */
6449 t = make_node (METHOD_TYPE);
6451 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6452 TREE_TYPE (t) = rettype;
6453 ptype = build_pointer_type (basetype);
6455 /* The actual arglist for this function includes a "hidden" argument
6456 which is "this". Put it into the list of argument types. */
6457 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
6458 TYPE_ARG_TYPES (t) = argtypes;
6460 /* If we already have such a type, use the old one. */
6461 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6462 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
6463 hashcode = type_hash_list (argtypes, hashcode);
6464 t = type_hash_canon (hashcode, t);
6466 /* Set up the canonical type. */
6468 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6469 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
6471 = (TYPE_CANONICAL (basetype) != basetype
6472 || TYPE_CANONICAL (rettype) != rettype);
6473 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
6475 &any_noncanonical_p);
6476 if (any_structural_p)
6477 SET_TYPE_STRUCTURAL_EQUALITY (t);
6478 else if (any_noncanonical_p)
6480 = build_method_type_directly (TYPE_CANONICAL (basetype),
6481 TYPE_CANONICAL (rettype),
6483 if (!COMPLETE_TYPE_P (t))
6489 /* Construct, lay out and return the type of methods belonging to class
6490 BASETYPE and whose arguments and values are described by TYPE.
6491 If that type exists already, reuse it.
6492 TYPE must be a FUNCTION_TYPE node. */
6495 build_method_type (tree basetype, tree type)
6497 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
6499 return build_method_type_directly (basetype,
6501 TYPE_ARG_TYPES (type));
6504 /* Construct, lay out and return the type of offsets to a value
6505 of type TYPE, within an object of type BASETYPE.
6506 If a suitable offset type exists already, reuse it. */
6509 build_offset_type (tree basetype, tree type)
6512 hashval_t hashcode = 0;
6514 /* Make a node of the sort we want. */
6515 t = make_node (OFFSET_TYPE);
6517 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6518 TREE_TYPE (t) = type;
6520 /* If we already have such a type, use the old one. */
6521 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6522 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
6523 t = type_hash_canon (hashcode, t);
6525 if (!COMPLETE_TYPE_P (t))
6528 if (TYPE_CANONICAL (t) == t)
6530 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6531 || TYPE_STRUCTURAL_EQUALITY_P (type))
6532 SET_TYPE_STRUCTURAL_EQUALITY (t);
6533 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
6534 || TYPE_CANONICAL (type) != type)
6536 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
6537 TYPE_CANONICAL (type));
6543 /* Create a complex type whose components are COMPONENT_TYPE. */
6546 build_complex_type (tree component_type)
6551 gcc_assert (INTEGRAL_TYPE_P (component_type)
6552 || SCALAR_FLOAT_TYPE_P (component_type)
6553 || FIXED_POINT_TYPE_P (component_type));
6555 /* Make a node of the sort we want. */
6556 t = make_node (COMPLEX_TYPE);
6558 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
6560 /* If we already have such a type, use the old one. */
6561 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
6562 t = type_hash_canon (hashcode, t);
6564 if (!COMPLETE_TYPE_P (t))
6567 if (TYPE_CANONICAL (t) == t)
6569 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
6570 SET_TYPE_STRUCTURAL_EQUALITY (t);
6571 else if (TYPE_CANONICAL (component_type) != component_type)
6573 = build_complex_type (TYPE_CANONICAL (component_type));
6576 /* We need to create a name, since complex is a fundamental type. */
6577 if (! TYPE_NAME (t))
6580 if (component_type == char_type_node)
6581 name = "complex char";
6582 else if (component_type == signed_char_type_node)
6583 name = "complex signed char";
6584 else if (component_type == unsigned_char_type_node)
6585 name = "complex unsigned char";
6586 else if (component_type == short_integer_type_node)
6587 name = "complex short int";
6588 else if (component_type == short_unsigned_type_node)
6589 name = "complex short unsigned int";
6590 else if (component_type == integer_type_node)
6591 name = "complex int";
6592 else if (component_type == unsigned_type_node)
6593 name = "complex unsigned int";
6594 else if (component_type == long_integer_type_node)
6595 name = "complex long int";
6596 else if (component_type == long_unsigned_type_node)
6597 name = "complex long unsigned int";
6598 else if (component_type == long_long_integer_type_node)
6599 name = "complex long long int";
6600 else if (component_type == long_long_unsigned_type_node)
6601 name = "complex long long unsigned int";
6606 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
6607 get_identifier (name), t);
6610 return build_qualified_type (t, TYPE_QUALS (component_type));
6613 /* If TYPE is a real or complex floating-point type and the target
6614 does not directly support arithmetic on TYPE then return the wider
6615 type to be used for arithmetic on TYPE. Otherwise, return
6619 excess_precision_type (tree type)
6621 if (flag_excess_precision != EXCESS_PRECISION_FAST)
6623 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
6624 switch (TREE_CODE (type))
6627 switch (flt_eval_method)
6630 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
6631 return double_type_node;
6634 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
6635 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
6636 return long_double_type_node;
6643 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
6645 switch (flt_eval_method)
6648 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
6649 return complex_double_type_node;
6652 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
6653 || (TYPE_MODE (TREE_TYPE (type))
6654 == TYPE_MODE (double_type_node)))
6655 return complex_long_double_type_node;
6668 /* Return OP, stripped of any conversions to wider types as much as is safe.
6669 Converting the value back to OP's type makes a value equivalent to OP.
6671 If FOR_TYPE is nonzero, we return a value which, if converted to
6672 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6674 OP must have integer, real or enumeral type. Pointers are not allowed!
6676 There are some cases where the obvious value we could return
6677 would regenerate to OP if converted to OP's type,
6678 but would not extend like OP to wider types.
6679 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6680 For example, if OP is (unsigned short)(signed char)-1,
6681 we avoid returning (signed char)-1 if FOR_TYPE is int,
6682 even though extending that to an unsigned short would regenerate OP,
6683 since the result of extending (signed char)-1 to (int)
6684 is different from (int) OP. */
6687 get_unwidened (tree op, tree for_type)
6689 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6690 tree type = TREE_TYPE (op);
6692 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6694 = (for_type != 0 && for_type != type
6695 && final_prec > TYPE_PRECISION (type)
6696 && TYPE_UNSIGNED (type));
6699 while (CONVERT_EXPR_P (op))
6703 /* TYPE_PRECISION on vector types has different meaning
6704 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6705 so avoid them here. */
6706 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6709 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6710 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6712 /* Truncations are many-one so cannot be removed.
6713 Unless we are later going to truncate down even farther. */
6715 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6718 /* See what's inside this conversion. If we decide to strip it,
6720 op = TREE_OPERAND (op, 0);
6722 /* If we have not stripped any zero-extensions (uns is 0),
6723 we can strip any kind of extension.
6724 If we have previously stripped a zero-extension,
6725 only zero-extensions can safely be stripped.
6726 Any extension can be stripped if the bits it would produce
6727 are all going to be discarded later by truncating to FOR_TYPE. */
6731 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6733 /* TYPE_UNSIGNED says whether this is a zero-extension.
6734 Let's avoid computing it if it does not affect WIN
6735 and if UNS will not be needed again. */
6737 || CONVERT_EXPR_P (op))
6738 && TYPE_UNSIGNED (TREE_TYPE (op)))
6749 /* Return OP or a simpler expression for a narrower value
6750 which can be sign-extended or zero-extended to give back OP.
6751 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6752 or 0 if the value should be sign-extended. */
6755 get_narrower (tree op, int *unsignedp_ptr)
6760 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6762 while (TREE_CODE (op) == NOP_EXPR)
6765 = (TYPE_PRECISION (TREE_TYPE (op))
6766 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6768 /* Truncations are many-one so cannot be removed. */
6772 /* See what's inside this conversion. If we decide to strip it,
6777 op = TREE_OPERAND (op, 0);
6778 /* An extension: the outermost one can be stripped,
6779 but remember whether it is zero or sign extension. */
6781 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6782 /* Otherwise, if a sign extension has been stripped,
6783 only sign extensions can now be stripped;
6784 if a zero extension has been stripped, only zero-extensions. */
6785 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6789 else /* bitschange == 0 */
6791 /* A change in nominal type can always be stripped, but we must
6792 preserve the unsignedness. */
6794 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6796 op = TREE_OPERAND (op, 0);
6797 /* Keep trying to narrow, but don't assign op to win if it
6798 would turn an integral type into something else. */
6799 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6806 if (TREE_CODE (op) == COMPONENT_REF
6807 /* Since type_for_size always gives an integer type. */
6808 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6809 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6810 /* Ensure field is laid out already. */
6811 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6812 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6814 unsigned HOST_WIDE_INT innerprec
6815 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6816 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6817 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6818 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6820 /* We can get this structure field in a narrower type that fits it,
6821 but the resulting extension to its nominal type (a fullword type)
6822 must satisfy the same conditions as for other extensions.
6824 Do this only for fields that are aligned (not bit-fields),
6825 because when bit-field insns will be used there is no
6826 advantage in doing this. */
6828 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6829 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6830 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6834 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6835 win = fold_convert (type, op);
6839 *unsignedp_ptr = uns;
6843 /* Nonzero if integer constant C has a value that is permissible
6844 for type TYPE (an INTEGER_TYPE). */
6847 int_fits_type_p (const_tree c, const_tree type)
6849 tree type_low_bound, type_high_bound;
6850 bool ok_for_low_bound, ok_for_high_bound, unsc;
6853 dc = tree_to_double_int (c);
6854 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
6856 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
6857 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
6859 /* So c is an unsigned integer whose type is sizetype and type is not.
6860 sizetype'd integers are sign extended even though they are
6861 unsigned. If the integer value fits in the lower end word of c,
6862 and if the higher end word has all its bits set to 1, that
6863 means the higher end bits are set to 1 only for sign extension.
6864 So let's convert c into an equivalent zero extended unsigned
6866 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
6869 type_low_bound = TYPE_MIN_VALUE (type);
6870 type_high_bound = TYPE_MAX_VALUE (type);
6872 /* If at least one bound of the type is a constant integer, we can check
6873 ourselves and maybe make a decision. If no such decision is possible, but
6874 this type is a subtype, try checking against that. Otherwise, use
6875 fit_double_type, which checks against the precision.
6877 Compute the status for each possibly constant bound, and return if we see
6878 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6879 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6880 for "constant known to fit". */
6882 /* Check if c >= type_low_bound. */
6883 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6885 dd = tree_to_double_int (type_low_bound);
6886 if (TREE_CODE (type) == INTEGER_TYPE
6887 && TYPE_IS_SIZETYPE (type)
6888 && TYPE_UNSIGNED (type))
6889 dd = double_int_zext (dd, TYPE_PRECISION (type));
6890 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
6892 int c_neg = (!unsc && double_int_negative_p (dc));
6893 int t_neg = (unsc && double_int_negative_p (dd));
6895 if (c_neg && !t_neg)
6897 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
6900 else if (double_int_cmp (dc, dd, unsc) < 0)
6902 ok_for_low_bound = true;
6905 ok_for_low_bound = false;
6907 /* Check if c <= type_high_bound. */
6908 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6910 dd = tree_to_double_int (type_high_bound);
6911 if (TREE_CODE (type) == INTEGER_TYPE
6912 && TYPE_IS_SIZETYPE (type)
6913 && TYPE_UNSIGNED (type))
6914 dd = double_int_zext (dd, TYPE_PRECISION (type));
6915 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
6917 int c_neg = (!unsc && double_int_negative_p (dc));
6918 int t_neg = (unsc && double_int_negative_p (dd));
6920 if (t_neg && !c_neg)
6922 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
6925 else if (double_int_cmp (dc, dd, unsc) > 0)
6927 ok_for_high_bound = true;
6930 ok_for_high_bound = false;
6932 /* If the constant fits both bounds, the result is known. */
6933 if (ok_for_low_bound && ok_for_high_bound)
6936 /* Perform some generic filtering which may allow making a decision
6937 even if the bounds are not constant. First, negative integers
6938 never fit in unsigned types, */
6939 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
6942 /* Second, narrower types always fit in wider ones. */
6943 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6946 /* Third, unsigned integers with top bit set never fit signed types. */
6947 if (! TYPE_UNSIGNED (type) && unsc)
6949 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
6950 if (prec < HOST_BITS_PER_WIDE_INT)
6952 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
6955 else if (((((unsigned HOST_WIDE_INT) 1)
6956 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
6960 /* If we haven't been able to decide at this point, there nothing more we
6961 can check ourselves here. Look at the base type if we have one and it
6962 has the same precision. */
6963 if (TREE_CODE (type) == INTEGER_TYPE
6964 && TREE_TYPE (type) != 0
6965 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6967 type = TREE_TYPE (type);
6971 /* Or to fit_double_type, if nothing else. */
6972 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
6975 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6976 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6977 represented (assuming two's-complement arithmetic) within the bit
6978 precision of the type are returned instead. */
6981 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6983 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6984 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6985 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6986 TYPE_UNSIGNED (type));
6989 if (TYPE_UNSIGNED (type))
6990 mpz_set_ui (min, 0);
6994 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6995 mn = double_int_sext (double_int_add (mn, double_int_one),
6996 TYPE_PRECISION (type));
6997 mpz_set_double_int (min, mn, false);
7001 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7002 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7003 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7004 TYPE_UNSIGNED (type));
7007 if (TYPE_UNSIGNED (type))
7008 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7011 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7016 /* Return true if VAR is an automatic variable defined in function FN. */
7019 auto_var_in_fn_p (const_tree var, const_tree fn)
7021 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7022 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
7023 && ! TREE_STATIC (var))
7024 || TREE_CODE (var) == LABEL_DECL
7025 || TREE_CODE (var) == RESULT_DECL));
7028 /* Subprogram of following function. Called by walk_tree.
7030 Return *TP if it is an automatic variable or parameter of the
7031 function passed in as DATA. */
7034 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7036 tree fn = (tree) data;
7041 else if (DECL_P (*tp)
7042 && auto_var_in_fn_p (*tp, fn))
7048 /* Returns true if T is, contains, or refers to a type with variable
7049 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7050 arguments, but not the return type. If FN is nonzero, only return
7051 true if a modifier of the type or position of FN is a variable or
7052 parameter inside FN.
7054 This concept is more general than that of C99 'variably modified types':
7055 in C99, a struct type is never variably modified because a VLA may not
7056 appear as a structure member. However, in GNU C code like:
7058 struct S { int i[f()]; };
7060 is valid, and other languages may define similar constructs. */
7063 variably_modified_type_p (tree type, tree fn)
7067 /* Test if T is either variable (if FN is zero) or an expression containing
7068 a variable in FN. */
7069 #define RETURN_TRUE_IF_VAR(T) \
7070 do { tree _t = (T); \
7071 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7072 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7073 return true; } while (0)
7075 if (type == error_mark_node)
7078 /* If TYPE itself has variable size, it is variably modified. */
7079 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7080 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
7082 switch (TREE_CODE (type))
7085 case REFERENCE_TYPE:
7087 if (variably_modified_type_p (TREE_TYPE (type), fn))
7093 /* If TYPE is a function type, it is variably modified if the
7094 return type is variably modified. */
7095 if (variably_modified_type_p (TREE_TYPE (type), fn))
7101 case FIXED_POINT_TYPE:
7104 /* Scalar types are variably modified if their end points
7106 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
7107 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
7112 case QUAL_UNION_TYPE:
7113 /* We can't see if any of the fields are variably-modified by the
7114 definition we normally use, since that would produce infinite
7115 recursion via pointers. */
7116 /* This is variably modified if some field's type is. */
7117 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
7118 if (TREE_CODE (t) == FIELD_DECL)
7120 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
7121 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
7122 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
7124 if (TREE_CODE (type) == QUAL_UNION_TYPE)
7125 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
7130 /* Do not call ourselves to avoid infinite recursion. This is
7131 variably modified if the element type is. */
7132 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
7133 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
7140 /* The current language may have other cases to check, but in general,
7141 all other types are not variably modified. */
7142 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
7144 #undef RETURN_TRUE_IF_VAR
7147 /* Given a DECL or TYPE, return the scope in which it was declared, or
7148 NULL_TREE if there is no containing scope. */
7151 get_containing_scope (const_tree t)
7153 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
7156 /* Return the innermost context enclosing DECL that is
7157 a FUNCTION_DECL, or zero if none. */
7160 decl_function_context (const_tree decl)
7164 if (TREE_CODE (decl) == ERROR_MARK)
7167 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
7168 where we look up the function at runtime. Such functions always take
7169 a first argument of type 'pointer to real context'.
7171 C++ should really be fixed to use DECL_CONTEXT for the real context,
7172 and use something else for the "virtual context". */
7173 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
7176 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
7178 context = DECL_CONTEXT (decl);
7180 while (context && TREE_CODE (context) != FUNCTION_DECL)
7182 if (TREE_CODE (context) == BLOCK)
7183 context = BLOCK_SUPERCONTEXT (context);
7185 context = get_containing_scope (context);
7191 /* Return the innermost context enclosing DECL that is
7192 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
7193 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
7196 decl_type_context (const_tree decl)
7198 tree context = DECL_CONTEXT (decl);
7201 switch (TREE_CODE (context))
7203 case NAMESPACE_DECL:
7204 case TRANSLATION_UNIT_DECL:
7209 case QUAL_UNION_TYPE:
7214 context = DECL_CONTEXT (context);
7218 context = BLOCK_SUPERCONTEXT (context);
7228 /* CALL is a CALL_EXPR. Return the declaration for the function
7229 called, or NULL_TREE if the called function cannot be
7233 get_callee_fndecl (const_tree call)
7237 if (call == error_mark_node)
7238 return error_mark_node;
7240 /* It's invalid to call this function with anything but a
7242 gcc_assert (TREE_CODE (call) == CALL_EXPR);
7244 /* The first operand to the CALL is the address of the function
7246 addr = CALL_EXPR_FN (call);
7250 /* If this is a readonly function pointer, extract its initial value. */
7251 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
7252 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
7253 && DECL_INITIAL (addr))
7254 addr = DECL_INITIAL (addr);
7256 /* If the address is just `&f' for some function `f', then we know
7257 that `f' is being called. */
7258 if (TREE_CODE (addr) == ADDR_EXPR
7259 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
7260 return TREE_OPERAND (addr, 0);
7262 /* We couldn't figure out what was being called. */
7266 /* Print debugging information about tree nodes generated during the compile,
7267 and any language-specific information. */
7270 dump_tree_statistics (void)
7272 #ifdef GATHER_STATISTICS
7274 int total_nodes, total_bytes;
7277 fprintf (stderr, "\n??? tree nodes created\n\n");
7278 #ifdef GATHER_STATISTICS
7279 fprintf (stderr, "Kind Nodes Bytes\n");
7280 fprintf (stderr, "---------------------------------------\n");
7281 total_nodes = total_bytes = 0;
7282 for (i = 0; i < (int) all_kinds; i++)
7284 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
7285 tree_node_counts[i], tree_node_sizes[i]);
7286 total_nodes += tree_node_counts[i];
7287 total_bytes += tree_node_sizes[i];
7289 fprintf (stderr, "---------------------------------------\n");
7290 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
7291 fprintf (stderr, "---------------------------------------\n");
7292 ssanames_print_statistics ();
7293 phinodes_print_statistics ();
7295 fprintf (stderr, "(No per-node statistics)\n");
7297 print_type_hash_statistics ();
7298 print_debug_expr_statistics ();
7299 print_value_expr_statistics ();
7300 lang_hooks.print_statistics ();
7303 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
7305 /* Generate a crc32 of a string. */
7308 crc32_string (unsigned chksum, const char *string)
7312 unsigned value = *string << 24;
7315 for (ix = 8; ix--; value <<= 1)
7319 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
7328 /* P is a string that will be used in a symbol. Mask out any characters
7329 that are not valid in that context. */
7332 clean_symbol_name (char *p)
7336 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
7339 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
7346 /* Generate a name for a special-purpose function function.
7347 The generated name may need to be unique across the whole link.
7348 TYPE is some string to identify the purpose of this function to the
7349 linker or collect2; it must start with an uppercase letter,
7351 I - for constructors
7353 N - for C++ anonymous namespaces
7354 F - for DWARF unwind frame information. */
7357 get_file_function_name (const char *type)
7363 /* If we already have a name we know to be unique, just use that. */
7364 if (first_global_object_name)
7365 p = q = ASTRDUP (first_global_object_name);
7366 /* If the target is handling the constructors/destructors, they
7367 will be local to this file and the name is only necessary for
7368 debugging purposes. */
7369 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
7371 const char *file = main_input_filename;
7373 file = input_filename;
7374 /* Just use the file's basename, because the full pathname
7375 might be quite long. */
7376 p = strrchr (file, '/');
7381 p = q = ASTRDUP (p);
7385 /* Otherwise, the name must be unique across the entire link.
7386 We don't have anything that we know to be unique to this translation
7387 unit, so use what we do have and throw in some randomness. */
7389 const char *name = weak_global_object_name;
7390 const char *file = main_input_filename;
7395 file = input_filename;
7397 len = strlen (file);
7398 q = (char *) alloca (9 * 2 + len + 1);
7399 memcpy (q, file, len + 1);
7401 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
7402 crc32_string (0, get_random_seed (false)));
7407 clean_symbol_name (q);
7408 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
7411 /* Set up the name of the file-level functions we may need.
7412 Use a global object (which is already required to be unique over
7413 the program) rather than the file name (which imposes extra
7415 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
7417 return get_identifier (buf);
7420 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
7422 /* Complain that the tree code of NODE does not match the expected 0
7423 terminated list of trailing codes. The trailing code list can be
7424 empty, for a more vague error message. FILE, LINE, and FUNCTION
7425 are of the caller. */
7428 tree_check_failed (const_tree node, const char *file,
7429 int line, const char *function, ...)
7433 unsigned length = 0;
7436 va_start (args, function);
7437 while ((code = va_arg (args, int)))
7438 length += 4 + strlen (tree_code_name[code]);
7443 va_start (args, function);
7444 length += strlen ("expected ");
7445 buffer = tmp = (char *) alloca (length);
7447 while ((code = va_arg (args, int)))
7449 const char *prefix = length ? " or " : "expected ";
7451 strcpy (tmp + length, prefix);
7452 length += strlen (prefix);
7453 strcpy (tmp + length, tree_code_name[code]);
7454 length += strlen (tree_code_name[code]);
7459 buffer = "unexpected node";
7461 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7462 buffer, tree_code_name[TREE_CODE (node)],
7463 function, trim_filename (file), line);
7466 /* Complain that the tree code of NODE does match the expected 0
7467 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
7471 tree_not_check_failed (const_tree node, const char *file,
7472 int line, const char *function, ...)
7476 unsigned length = 0;
7479 va_start (args, function);
7480 while ((code = va_arg (args, int)))
7481 length += 4 + strlen (tree_code_name[code]);
7483 va_start (args, function);
7484 buffer = (char *) alloca (length);
7486 while ((code = va_arg (args, int)))
7490 strcpy (buffer + length, " or ");
7493 strcpy (buffer + length, tree_code_name[code]);
7494 length += strlen (tree_code_name[code]);
7498 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
7499 buffer, tree_code_name[TREE_CODE (node)],
7500 function, trim_filename (file), line);
7503 /* Similar to tree_check_failed, except that we check for a class of tree
7504 code, given in CL. */
7507 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
7508 const char *file, int line, const char *function)
7511 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
7512 TREE_CODE_CLASS_STRING (cl),
7513 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
7514 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7517 /* Similar to tree_check_failed, except that instead of specifying a
7518 dozen codes, use the knowledge that they're all sequential. */
7521 tree_range_check_failed (const_tree node, const char *file, int line,
7522 const char *function, enum tree_code c1,
7526 unsigned length = 0;
7529 for (c = c1; c <= c2; ++c)
7530 length += 4 + strlen (tree_code_name[c]);
7532 length += strlen ("expected ");
7533 buffer = (char *) alloca (length);
7536 for (c = c1; c <= c2; ++c)
7538 const char *prefix = length ? " or " : "expected ";
7540 strcpy (buffer + length, prefix);
7541 length += strlen (prefix);
7542 strcpy (buffer + length, tree_code_name[c]);
7543 length += strlen (tree_code_name[c]);
7546 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7547 buffer, tree_code_name[TREE_CODE (node)],
7548 function, trim_filename (file), line);
7552 /* Similar to tree_check_failed, except that we check that a tree does
7553 not have the specified code, given in CL. */
7556 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
7557 const char *file, int line, const char *function)
7560 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
7561 TREE_CODE_CLASS_STRING (cl),
7562 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
7563 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7567 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
7570 omp_clause_check_failed (const_tree node, const char *file, int line,
7571 const char *function, enum omp_clause_code code)
7573 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
7574 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
7575 function, trim_filename (file), line);
7579 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
7582 omp_clause_range_check_failed (const_tree node, const char *file, int line,
7583 const char *function, enum omp_clause_code c1,
7584 enum omp_clause_code c2)
7587 unsigned length = 0;
7590 for (c = c1; c <= c2; ++c)
7591 length += 4 + strlen (omp_clause_code_name[c]);
7593 length += strlen ("expected ");
7594 buffer = (char *) alloca (length);
7597 for (c = c1; c <= c2; ++c)
7599 const char *prefix = length ? " or " : "expected ";
7601 strcpy (buffer + length, prefix);
7602 length += strlen (prefix);
7603 strcpy (buffer + length, omp_clause_code_name[c]);
7604 length += strlen (omp_clause_code_name[c]);
7607 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7608 buffer, omp_clause_code_name[TREE_CODE (node)],
7609 function, trim_filename (file), line);
7613 #undef DEFTREESTRUCT
7614 #define DEFTREESTRUCT(VAL, NAME) NAME,
7616 static const char *ts_enum_names[] = {
7617 #include "treestruct.def"
7619 #undef DEFTREESTRUCT
7621 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
7623 /* Similar to tree_class_check_failed, except that we check for
7624 whether CODE contains the tree structure identified by EN. */
7627 tree_contains_struct_check_failed (const_tree node,
7628 const enum tree_node_structure_enum en,
7629 const char *file, int line,
7630 const char *function)
7633 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7635 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7639 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7640 (dynamically sized) vector. */
7643 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
7644 const char *function)
7647 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7648 idx + 1, len, function, trim_filename (file), line);
7651 /* Similar to above, except that the check is for the bounds of the operand
7652 vector of an expression node EXP. */
7655 tree_operand_check_failed (int idx, const_tree exp, const char *file,
7656 int line, const char *function)
7658 int code = TREE_CODE (exp);
7660 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7661 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
7662 function, trim_filename (file), line);
7665 /* Similar to above, except that the check is for the number of
7666 operands of an OMP_CLAUSE node. */
7669 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
7670 int line, const char *function)
7673 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7674 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
7675 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
7676 trim_filename (file), line);
7678 #endif /* ENABLE_TREE_CHECKING */
7680 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7681 and mapped to the machine mode MODE. Initialize its fields and build
7682 the information necessary for debugging output. */
7685 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7688 hashval_t hashcode = 0;
7690 /* Build a main variant, based on the main variant of the inner type, then
7691 use it to build the variant we return. */
7692 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7693 && TYPE_MAIN_VARIANT (innertype) != innertype)
7694 return build_type_attribute_qual_variant (
7695 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7696 TYPE_ATTRIBUTES (innertype),
7697 TYPE_QUALS (innertype));
7699 t = make_node (VECTOR_TYPE);
7700 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7701 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7702 SET_TYPE_MODE (t, mode);
7703 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7704 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7706 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7707 SET_TYPE_STRUCTURAL_EQUALITY (t);
7708 else if (TYPE_CANONICAL (innertype) != innertype
7709 || mode != VOIDmode)
7711 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7716 tree index = build_int_cst (NULL_TREE, nunits - 1);
7717 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
7718 build_index_type (index));
7719 tree rt = make_node (RECORD_TYPE);
7721 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
7722 get_identifier ("f"), array);
7723 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7725 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7726 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7727 the representation type, and we want to find that die when looking up
7728 the vector type. This is most easily achieved by making the TYPE_UID
7730 TYPE_UID (rt) = TYPE_UID (t);
7733 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7734 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7735 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7736 return type_hash_canon (hashcode, t);
7740 make_or_reuse_type (unsigned size, int unsignedp)
7742 if (size == INT_TYPE_SIZE)
7743 return unsignedp ? unsigned_type_node : integer_type_node;
7744 if (size == CHAR_TYPE_SIZE)
7745 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7746 if (size == SHORT_TYPE_SIZE)
7747 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7748 if (size == LONG_TYPE_SIZE)
7749 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7750 if (size == LONG_LONG_TYPE_SIZE)
7751 return (unsignedp ? long_long_unsigned_type_node
7752 : long_long_integer_type_node);
7755 return make_unsigned_type (size);
7757 return make_signed_type (size);
7760 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7763 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7767 if (size == SHORT_FRACT_TYPE_SIZE)
7768 return unsignedp ? sat_unsigned_short_fract_type_node
7769 : sat_short_fract_type_node;
7770 if (size == FRACT_TYPE_SIZE)
7771 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7772 if (size == LONG_FRACT_TYPE_SIZE)
7773 return unsignedp ? sat_unsigned_long_fract_type_node
7774 : sat_long_fract_type_node;
7775 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7776 return unsignedp ? sat_unsigned_long_long_fract_type_node
7777 : sat_long_long_fract_type_node;
7781 if (size == SHORT_FRACT_TYPE_SIZE)
7782 return unsignedp ? unsigned_short_fract_type_node
7783 : short_fract_type_node;
7784 if (size == FRACT_TYPE_SIZE)
7785 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7786 if (size == LONG_FRACT_TYPE_SIZE)
7787 return unsignedp ? unsigned_long_fract_type_node
7788 : long_fract_type_node;
7789 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7790 return unsignedp ? unsigned_long_long_fract_type_node
7791 : long_long_fract_type_node;
7794 return make_fract_type (size, unsignedp, satp);
7797 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7800 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7804 if (size == SHORT_ACCUM_TYPE_SIZE)
7805 return unsignedp ? sat_unsigned_short_accum_type_node
7806 : sat_short_accum_type_node;
7807 if (size == ACCUM_TYPE_SIZE)
7808 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7809 if (size == LONG_ACCUM_TYPE_SIZE)
7810 return unsignedp ? sat_unsigned_long_accum_type_node
7811 : sat_long_accum_type_node;
7812 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7813 return unsignedp ? sat_unsigned_long_long_accum_type_node
7814 : sat_long_long_accum_type_node;
7818 if (size == SHORT_ACCUM_TYPE_SIZE)
7819 return unsignedp ? unsigned_short_accum_type_node
7820 : short_accum_type_node;
7821 if (size == ACCUM_TYPE_SIZE)
7822 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7823 if (size == LONG_ACCUM_TYPE_SIZE)
7824 return unsignedp ? unsigned_long_accum_type_node
7825 : long_accum_type_node;
7826 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7827 return unsignedp ? unsigned_long_long_accum_type_node
7828 : long_long_accum_type_node;
7831 return make_accum_type (size, unsignedp, satp);
7834 /* Create nodes for all integer types (and error_mark_node) using the sizes
7835 of C datatypes. The caller should call set_sizetype soon after calling
7836 this function to select one of the types as sizetype. */
7839 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7841 error_mark_node = make_node (ERROR_MARK);
7842 TREE_TYPE (error_mark_node) = error_mark_node;
7844 initialize_sizetypes (signed_sizetype);
7846 /* Define both `signed char' and `unsigned char'. */
7847 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7848 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7849 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7850 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7852 /* Define `char', which is like either `signed char' or `unsigned char'
7853 but not the same as either. */
7856 ? make_signed_type (CHAR_TYPE_SIZE)
7857 : make_unsigned_type (CHAR_TYPE_SIZE));
7858 TYPE_STRING_FLAG (char_type_node) = 1;
7860 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7861 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7862 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7863 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7864 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7865 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7866 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7867 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7869 /* Define a boolean type. This type only represents boolean values but
7870 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7871 Front ends which want to override this size (i.e. Java) can redefine
7872 boolean_type_node before calling build_common_tree_nodes_2. */
7873 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7874 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7875 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7876 TYPE_PRECISION (boolean_type_node) = 1;
7878 /* Fill in the rest of the sized types. Reuse existing type nodes
7880 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7881 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7882 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7883 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7884 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7886 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7887 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7888 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7889 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7890 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7892 access_public_node = get_identifier ("public");
7893 access_protected_node = get_identifier ("protected");
7894 access_private_node = get_identifier ("private");
7897 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7898 It will create several other common tree nodes. */
7901 build_common_tree_nodes_2 (int short_double)
7903 /* Define these next since types below may used them. */
7904 integer_zero_node = build_int_cst (NULL_TREE, 0);
7905 integer_one_node = build_int_cst (NULL_TREE, 1);
7906 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7908 size_zero_node = size_int (0);
7909 size_one_node = size_int (1);
7910 bitsize_zero_node = bitsize_int (0);
7911 bitsize_one_node = bitsize_int (1);
7912 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7914 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7915 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7917 void_type_node = make_node (VOID_TYPE);
7918 layout_type (void_type_node);
7920 /* We are not going to have real types in C with less than byte alignment,
7921 so we might as well not have any types that claim to have it. */
7922 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7923 TYPE_USER_ALIGN (void_type_node) = 0;
7925 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7926 layout_type (TREE_TYPE (null_pointer_node));
7928 ptr_type_node = build_pointer_type (void_type_node);
7930 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7931 fileptr_type_node = ptr_type_node;
7933 float_type_node = make_node (REAL_TYPE);
7934 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7935 layout_type (float_type_node);
7937 double_type_node = make_node (REAL_TYPE);
7939 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7941 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7942 layout_type (double_type_node);
7944 long_double_type_node = make_node (REAL_TYPE);
7945 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7946 layout_type (long_double_type_node);
7948 float_ptr_type_node = build_pointer_type (float_type_node);
7949 double_ptr_type_node = build_pointer_type (double_type_node);
7950 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7951 integer_ptr_type_node = build_pointer_type (integer_type_node);
7953 /* Fixed size integer types. */
7954 uint32_type_node = build_nonstandard_integer_type (32, true);
7955 uint64_type_node = build_nonstandard_integer_type (64, true);
7957 /* Decimal float types. */
7958 dfloat32_type_node = make_node (REAL_TYPE);
7959 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7960 layout_type (dfloat32_type_node);
7961 SET_TYPE_MODE (dfloat32_type_node, SDmode);
7962 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7964 dfloat64_type_node = make_node (REAL_TYPE);
7965 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7966 layout_type (dfloat64_type_node);
7967 SET_TYPE_MODE (dfloat64_type_node, DDmode);
7968 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7970 dfloat128_type_node = make_node (REAL_TYPE);
7971 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7972 layout_type (dfloat128_type_node);
7973 SET_TYPE_MODE (dfloat128_type_node, TDmode);
7974 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7976 complex_integer_type_node = build_complex_type (integer_type_node);
7977 complex_float_type_node = build_complex_type (float_type_node);
7978 complex_double_type_node = build_complex_type (double_type_node);
7979 complex_long_double_type_node = build_complex_type (long_double_type_node);
7981 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7982 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
7983 sat_ ## KIND ## _type_node = \
7984 make_sat_signed_ ## KIND ## _type (SIZE); \
7985 sat_unsigned_ ## KIND ## _type_node = \
7986 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7987 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7988 unsigned_ ## KIND ## _type_node = \
7989 make_unsigned_ ## KIND ## _type (SIZE);
7991 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
7992 sat_ ## WIDTH ## KIND ## _type_node = \
7993 make_sat_signed_ ## KIND ## _type (SIZE); \
7994 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7995 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7996 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7997 unsigned_ ## WIDTH ## KIND ## _type_node = \
7998 make_unsigned_ ## KIND ## _type (SIZE);
8000 /* Make fixed-point type nodes based on four different widths. */
8001 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8002 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8003 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8004 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8005 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8007 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8008 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8009 NAME ## _type_node = \
8010 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8011 u ## NAME ## _type_node = \
8012 make_or_reuse_unsigned_ ## KIND ## _type \
8013 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8014 sat_ ## NAME ## _type_node = \
8015 make_or_reuse_sat_signed_ ## KIND ## _type \
8016 (GET_MODE_BITSIZE (MODE ## mode)); \
8017 sat_u ## NAME ## _type_node = \
8018 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8019 (GET_MODE_BITSIZE (U ## MODE ## mode));
8021 /* Fixed-point type and mode nodes. */
8022 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8023 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8024 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8025 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8026 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8027 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8028 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8029 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8030 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8031 MAKE_FIXED_MODE_NODE (accum, da, DA)
8032 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8035 tree t = targetm.build_builtin_va_list ();
8037 /* Many back-ends define record types without setting TYPE_NAME.
8038 If we copied the record type here, we'd keep the original
8039 record type without a name. This breaks name mangling. So,
8040 don't copy record types and let c_common_nodes_and_builtins()
8041 declare the type to be __builtin_va_list. */
8042 if (TREE_CODE (t) != RECORD_TYPE)
8043 t = build_variant_type_copy (t);
8045 va_list_type_node = t;
8049 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8052 local_define_builtin (const char *name, tree type, enum built_in_function code,
8053 const char *library_name, int ecf_flags)
8057 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8058 library_name, NULL_TREE);
8059 if (ecf_flags & ECF_CONST)
8060 TREE_READONLY (decl) = 1;
8061 if (ecf_flags & ECF_PURE)
8062 DECL_PURE_P (decl) = 1;
8063 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8064 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8065 if (ecf_flags & ECF_NORETURN)
8066 TREE_THIS_VOLATILE (decl) = 1;
8067 if (ecf_flags & ECF_NOTHROW)
8068 TREE_NOTHROW (decl) = 1;
8069 if (ecf_flags & ECF_MALLOC)
8070 DECL_IS_MALLOC (decl) = 1;
8072 built_in_decls[code] = decl;
8073 implicit_built_in_decls[code] = decl;
8076 /* Call this function after instantiating all builtins that the language
8077 front end cares about. This will build the rest of the builtins that
8078 are relied upon by the tree optimizers and the middle-end. */
8081 build_common_builtin_nodes (void)
8085 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
8086 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8088 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8089 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8090 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8091 ftype = build_function_type (ptr_type_node, tmp);
8093 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
8094 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
8095 "memcpy", ECF_NOTHROW);
8096 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8097 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
8098 "memmove", ECF_NOTHROW);
8101 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
8103 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8104 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8105 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8106 ftype = build_function_type (integer_type_node, tmp);
8107 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
8108 "memcmp", ECF_PURE | ECF_NOTHROW);
8111 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
8113 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8114 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
8115 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8116 ftype = build_function_type (ptr_type_node, tmp);
8117 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
8118 "memset", ECF_NOTHROW);
8121 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
8123 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8124 ftype = build_function_type (ptr_type_node, tmp);
8125 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
8126 "alloca", ECF_NOTHROW | ECF_MALLOC);
8129 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8130 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8131 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8132 ftype = build_function_type (void_type_node, tmp);
8133 local_define_builtin ("__builtin_init_trampoline", ftype,
8134 BUILT_IN_INIT_TRAMPOLINE,
8135 "__builtin_init_trampoline", ECF_NOTHROW);
8137 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8138 ftype = build_function_type (ptr_type_node, tmp);
8139 local_define_builtin ("__builtin_adjust_trampoline", ftype,
8140 BUILT_IN_ADJUST_TRAMPOLINE,
8141 "__builtin_adjust_trampoline",
8142 ECF_CONST | ECF_NOTHROW);
8144 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8145 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8146 ftype = build_function_type (void_type_node, tmp);
8147 local_define_builtin ("__builtin_nonlocal_goto", ftype,
8148 BUILT_IN_NONLOCAL_GOTO,
8149 "__builtin_nonlocal_goto",
8150 ECF_NORETURN | ECF_NOTHROW);
8152 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8153 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8154 ftype = build_function_type (void_type_node, tmp);
8155 local_define_builtin ("__builtin_setjmp_setup", ftype,
8156 BUILT_IN_SETJMP_SETUP,
8157 "__builtin_setjmp_setup", ECF_NOTHROW);
8159 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8160 ftype = build_function_type (ptr_type_node, tmp);
8161 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
8162 BUILT_IN_SETJMP_DISPATCHER,
8163 "__builtin_setjmp_dispatcher",
8164 ECF_PURE | ECF_NOTHROW);
8166 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8167 ftype = build_function_type (void_type_node, tmp);
8168 local_define_builtin ("__builtin_setjmp_receiver", ftype,
8169 BUILT_IN_SETJMP_RECEIVER,
8170 "__builtin_setjmp_receiver", ECF_NOTHROW);
8172 ftype = build_function_type (ptr_type_node, void_list_node);
8173 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
8174 "__builtin_stack_save", ECF_NOTHROW);
8176 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8177 ftype = build_function_type (void_type_node, tmp);
8178 local_define_builtin ("__builtin_stack_restore", ftype,
8179 BUILT_IN_STACK_RESTORE,
8180 "__builtin_stack_restore", ECF_NOTHROW);
8182 ftype = build_function_type (void_type_node, void_list_node);
8183 local_define_builtin ("__builtin_profile_func_enter", ftype,
8184 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
8185 local_define_builtin ("__builtin_profile_func_exit", ftype,
8186 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
8188 /* Complex multiplication and division. These are handled as builtins
8189 rather than optabs because emit_library_call_value doesn't support
8190 complex. Further, we can do slightly better with folding these
8191 beasties if the real and complex parts of the arguments are separate. */
8195 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
8197 char mode_name_buf[4], *q;
8199 enum built_in_function mcode, dcode;
8200 tree type, inner_type;
8202 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
8205 inner_type = TREE_TYPE (type);
8207 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
8208 tmp = tree_cons (NULL_TREE, inner_type, tmp);
8209 tmp = tree_cons (NULL_TREE, inner_type, tmp);
8210 tmp = tree_cons (NULL_TREE, inner_type, tmp);
8211 ftype = build_function_type (type, tmp);
8213 mcode = ((enum built_in_function)
8214 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
8215 dcode = ((enum built_in_function)
8216 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
8218 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
8222 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
8223 local_define_builtin (built_in_names[mcode], ftype, mcode,
8224 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
8226 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
8227 local_define_builtin (built_in_names[dcode], ftype, dcode,
8228 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
8233 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
8236 If we requested a pointer to a vector, build up the pointers that
8237 we stripped off while looking for the inner type. Similarly for
8238 return values from functions.
8240 The argument TYPE is the top of the chain, and BOTTOM is the
8241 new type which we will point to. */
8244 reconstruct_complex_type (tree type, tree bottom)
8248 if (TREE_CODE (type) == POINTER_TYPE)
8250 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8251 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
8252 TYPE_REF_CAN_ALIAS_ALL (type));
8254 else if (TREE_CODE (type) == REFERENCE_TYPE)
8256 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8257 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
8258 TYPE_REF_CAN_ALIAS_ALL (type));
8260 else if (TREE_CODE (type) == ARRAY_TYPE)
8262 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8263 outer = build_array_type (inner, TYPE_DOMAIN (type));
8265 else if (TREE_CODE (type) == FUNCTION_TYPE)
8267 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8268 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
8270 else if (TREE_CODE (type) == METHOD_TYPE)
8272 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8273 /* The build_method_type_directly() routine prepends 'this' to argument list,
8274 so we must compensate by getting rid of it. */
8276 = build_method_type_directly
8277 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
8279 TREE_CHAIN (TYPE_ARG_TYPES (type)));
8281 else if (TREE_CODE (type) == OFFSET_TYPE)
8283 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8284 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
8289 return build_qualified_type (outer, TYPE_QUALS (type));
8292 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
8295 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
8299 switch (GET_MODE_CLASS (mode))
8301 case MODE_VECTOR_INT:
8302 case MODE_VECTOR_FLOAT:
8303 case MODE_VECTOR_FRACT:
8304 case MODE_VECTOR_UFRACT:
8305 case MODE_VECTOR_ACCUM:
8306 case MODE_VECTOR_UACCUM:
8307 nunits = GET_MODE_NUNITS (mode);
8311 /* Check that there are no leftover bits. */
8312 gcc_assert (GET_MODE_BITSIZE (mode)
8313 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
8315 nunits = GET_MODE_BITSIZE (mode)
8316 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
8323 return make_vector_type (innertype, nunits, mode);
8326 /* Similarly, but takes the inner type and number of units, which must be
8330 build_vector_type (tree innertype, int nunits)
8332 return make_vector_type (innertype, nunits, VOIDmode);
8335 /* Similarly, but takes the inner type and number of units, which must be
8339 build_opaque_vector_type (tree innertype, int nunits)
8342 innertype = build_distinct_type_copy (innertype);
8343 t = make_vector_type (innertype, nunits, VOIDmode);
8344 TYPE_VECTOR_OPAQUE (t) = true;
8349 /* Build RESX_EXPR with given REGION_NUMBER. */
8351 build_resx (int region_number)
8354 t = build1 (RESX_EXPR, void_type_node,
8355 build_int_cst (NULL_TREE, region_number));
8359 /* Given an initializer INIT, return TRUE if INIT is zero or some
8360 aggregate of zeros. Otherwise return FALSE. */
8362 initializer_zerop (const_tree init)
8368 switch (TREE_CODE (init))
8371 return integer_zerop (init);
8374 /* ??? Note that this is not correct for C4X float formats. There,
8375 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
8376 negative exponent. */
8377 return real_zerop (init)
8378 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
8381 return fixed_zerop (init);
8384 return integer_zerop (init)
8385 || (real_zerop (init)
8386 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
8387 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
8390 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
8391 if (!initializer_zerop (TREE_VALUE (elt)))
8397 unsigned HOST_WIDE_INT idx;
8399 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
8400 if (!initializer_zerop (elt))
8410 /* Build an empty statement at location LOC. */
8413 build_empty_stmt (location_t loc)
8415 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
8416 SET_EXPR_LOCATION (t, loc);
8421 /* Build an OpenMP clause with code CODE. LOC is the location of the
8425 build_omp_clause (location_t loc, enum omp_clause_code code)
8430 length = omp_clause_num_ops[code];
8431 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
8433 t = GGC_NEWVAR (union tree_node, size);
8434 memset (t, 0, size);
8435 TREE_SET_CODE (t, OMP_CLAUSE);
8436 OMP_CLAUSE_SET_CODE (t, code);
8437 OMP_CLAUSE_LOCATION (t) = loc;
8439 #ifdef GATHER_STATISTICS
8440 tree_node_counts[(int) omp_clause_kind]++;
8441 tree_node_sizes[(int) omp_clause_kind] += size;
8447 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
8448 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
8449 Except for the CODE and operand count field, other storage for the
8450 object is initialized to zeros. */
8453 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
8456 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
8458 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
8459 gcc_assert (len >= 1);
8461 #ifdef GATHER_STATISTICS
8462 tree_node_counts[(int) e_kind]++;
8463 tree_node_sizes[(int) e_kind] += length;
8466 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
8468 memset (t, 0, length);
8470 TREE_SET_CODE (t, code);
8472 /* Can't use TREE_OPERAND to store the length because if checking is
8473 enabled, it will try to check the length before we store it. :-P */
8474 t->exp.operands[0] = build_int_cst (sizetype, len);
8480 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
8481 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
8485 build_call_list (tree return_type, tree fn, tree arglist)
8490 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
8491 TREE_TYPE (t) = return_type;
8492 CALL_EXPR_FN (t) = fn;
8493 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8494 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
8495 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
8496 process_call_operands (t);
8500 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8501 FN and a null static chain slot. NARGS is the number of call arguments
8502 which are specified as "..." arguments. */
8505 build_call_nary (tree return_type, tree fn, int nargs, ...)
8509 va_start (args, nargs);
8510 ret = build_call_valist (return_type, fn, nargs, args);
8515 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8516 FN and a null static chain slot. NARGS is the number of call arguments
8517 which are specified as a va_list ARGS. */
8520 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
8525 t = build_vl_exp (CALL_EXPR, nargs + 3);
8526 TREE_TYPE (t) = return_type;
8527 CALL_EXPR_FN (t) = fn;
8528 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8529 for (i = 0; i < nargs; i++)
8530 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
8531 process_call_operands (t);
8535 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8536 FN and a null static chain slot. NARGS is the number of call arguments
8537 which are specified as a tree array ARGS. */
8540 build_call_array (tree return_type, tree fn, int nargs, const tree *args)
8545 t = build_vl_exp (CALL_EXPR, nargs + 3);
8546 TREE_TYPE (t) = return_type;
8547 CALL_EXPR_FN (t) = fn;
8548 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8549 for (i = 0; i < nargs; i++)
8550 CALL_EXPR_ARG (t, i) = args[i];
8551 process_call_operands (t);
8555 /* Like build_call_array, but takes a VEC. */
8558 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
8563 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
8564 TREE_TYPE (ret) = return_type;
8565 CALL_EXPR_FN (ret) = fn;
8566 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
8567 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
8568 CALL_EXPR_ARG (ret, ix) = t;
8569 process_call_operands (ret);
8574 /* Returns true if it is possible to prove that the index of
8575 an array access REF (an ARRAY_REF expression) falls into the
8579 in_array_bounds_p (tree ref)
8581 tree idx = TREE_OPERAND (ref, 1);
8584 if (TREE_CODE (idx) != INTEGER_CST)
8587 min = array_ref_low_bound (ref);
8588 max = array_ref_up_bound (ref);
8591 || TREE_CODE (min) != INTEGER_CST
8592 || TREE_CODE (max) != INTEGER_CST)
8595 if (tree_int_cst_lt (idx, min)
8596 || tree_int_cst_lt (max, idx))
8602 /* Returns true if it is possible to prove that the range of
8603 an array access REF (an ARRAY_RANGE_REF expression) falls
8604 into the array bounds. */
8607 range_in_array_bounds_p (tree ref)
8609 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
8610 tree range_min, range_max, min, max;
8612 range_min = TYPE_MIN_VALUE (domain_type);
8613 range_max = TYPE_MAX_VALUE (domain_type);
8616 || TREE_CODE (range_min) != INTEGER_CST
8617 || TREE_CODE (range_max) != INTEGER_CST)
8620 min = array_ref_low_bound (ref);
8621 max = array_ref_up_bound (ref);
8624 || TREE_CODE (min) != INTEGER_CST
8625 || TREE_CODE (max) != INTEGER_CST)
8628 if (tree_int_cst_lt (range_min, min)
8629 || tree_int_cst_lt (max, range_max))
8635 /* Return true if T (assumed to be a DECL) must be assigned a memory
8639 needs_to_live_in_memory (const_tree t)
8641 if (TREE_CODE (t) == SSA_NAME)
8642 t = SSA_NAME_VAR (t);
8644 return (TREE_ADDRESSABLE (t)
8645 || is_global_var (t)
8646 || (TREE_CODE (t) == RESULT_DECL
8647 && aggregate_value_p (t, current_function_decl)));
8650 /* There are situations in which a language considers record types
8651 compatible which have different field lists. Decide if two fields
8652 are compatible. It is assumed that the parent records are compatible. */
8655 fields_compatible_p (const_tree f1, const_tree f2)
8657 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
8658 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
8661 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
8662 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
8665 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
8671 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8674 find_compatible_field (tree record, tree orig_field)
8678 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
8679 if (TREE_CODE (f) == FIELD_DECL
8680 && fields_compatible_p (f, orig_field))
8683 /* ??? Why isn't this on the main fields list? */
8684 f = TYPE_VFIELD (record);
8685 if (f && TREE_CODE (f) == FIELD_DECL
8686 && fields_compatible_p (f, orig_field))
8689 /* ??? We should abort here, but Java appears to do Bad Things
8690 with inherited fields. */
8694 /* Return value of a constant X and sign-extend it. */
8697 int_cst_value (const_tree x)
8699 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8700 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8702 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8703 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8704 || TREE_INT_CST_HIGH (x) == -1);
8706 if (bits < HOST_BITS_PER_WIDE_INT)
8708 bool negative = ((val >> (bits - 1)) & 1) != 0;
8710 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8712 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8718 /* Return value of a constant X and sign-extend it. */
8721 widest_int_cst_value (const_tree x)
8723 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8724 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
8726 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
8727 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
8728 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
8729 << HOST_BITS_PER_WIDE_INT);
8731 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8732 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8733 || TREE_INT_CST_HIGH (x) == -1);
8736 if (bits < HOST_BITS_PER_WIDEST_INT)
8738 bool negative = ((val >> (bits - 1)) & 1) != 0;
8740 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
8742 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
8748 /* If TYPE is an integral type, return an equivalent type which is
8749 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8750 return TYPE itself. */
8753 signed_or_unsigned_type_for (int unsignedp, tree type)
8756 if (POINTER_TYPE_P (type))
8759 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8762 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8765 /* Returns unsigned variant of TYPE. */
8768 unsigned_type_for (tree type)
8770 return signed_or_unsigned_type_for (1, type);
8773 /* Returns signed variant of TYPE. */
8776 signed_type_for (tree type)
8778 return signed_or_unsigned_type_for (0, type);
8781 /* Returns the largest value obtainable by casting something in INNER type to
8785 upper_bound_in_type (tree outer, tree inner)
8787 unsigned HOST_WIDE_INT lo, hi;
8788 unsigned int det = 0;
8789 unsigned oprec = TYPE_PRECISION (outer);
8790 unsigned iprec = TYPE_PRECISION (inner);
8793 /* Compute a unique number for every combination. */
8794 det |= (oprec > iprec) ? 4 : 0;
8795 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8796 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8798 /* Determine the exponent to use. */
8803 /* oprec <= iprec, outer: signed, inner: don't care. */
8808 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8812 /* oprec > iprec, outer: signed, inner: signed. */
8816 /* oprec > iprec, outer: signed, inner: unsigned. */
8820 /* oprec > iprec, outer: unsigned, inner: signed. */
8824 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8831 /* Compute 2^^prec - 1. */
8832 if (prec <= HOST_BITS_PER_WIDE_INT)
8835 lo = ((~(unsigned HOST_WIDE_INT) 0)
8836 >> (HOST_BITS_PER_WIDE_INT - prec));
8840 hi = ((~(unsigned HOST_WIDE_INT) 0)
8841 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8842 lo = ~(unsigned HOST_WIDE_INT) 0;
8845 return build_int_cst_wide (outer, lo, hi);
8848 /* Returns the smallest value obtainable by casting something in INNER type to
8852 lower_bound_in_type (tree outer, tree inner)
8854 unsigned HOST_WIDE_INT lo, hi;
8855 unsigned oprec = TYPE_PRECISION (outer);
8856 unsigned iprec = TYPE_PRECISION (inner);
8858 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8860 if (TYPE_UNSIGNED (outer)
8861 /* If we are widening something of an unsigned type, OUTER type
8862 contains all values of INNER type. In particular, both INNER
8863 and OUTER types have zero in common. */
8864 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8868 /* If we are widening a signed type to another signed type, we
8869 want to obtain -2^^(iprec-1). If we are keeping the
8870 precision or narrowing to a signed type, we want to obtain
8872 unsigned prec = oprec > iprec ? iprec : oprec;
8874 if (prec <= HOST_BITS_PER_WIDE_INT)
8876 hi = ~(unsigned HOST_WIDE_INT) 0;
8877 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8881 hi = ((~(unsigned HOST_WIDE_INT) 0)
8882 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8887 return build_int_cst_wide (outer, lo, hi);
8890 /* Return nonzero if two operands that are suitable for PHI nodes are
8891 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8892 SSA_NAME or invariant. Note that this is strictly an optimization.
8893 That is, callers of this function can directly call operand_equal_p
8894 and get the same result, only slower. */
8897 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8901 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8903 return operand_equal_p (arg0, arg1, 0);
8906 /* Returns number of zeros at the end of binary representation of X.
8908 ??? Use ffs if available? */
8911 num_ending_zeros (const_tree x)
8913 unsigned HOST_WIDE_INT fr, nfr;
8914 unsigned num, abits;
8915 tree type = TREE_TYPE (x);
8917 if (TREE_INT_CST_LOW (x) == 0)
8919 num = HOST_BITS_PER_WIDE_INT;
8920 fr = TREE_INT_CST_HIGH (x);
8925 fr = TREE_INT_CST_LOW (x);
8928 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8931 if (nfr << abits == fr)
8938 if (num > TYPE_PRECISION (type))
8939 num = TYPE_PRECISION (type);
8941 return build_int_cst_type (type, num);
8945 #define WALK_SUBTREE(NODE) \
8948 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8954 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8955 be walked whenever a type is seen in the tree. Rest of operands and return
8956 value are as for walk_tree. */
8959 walk_type_fields (tree type, walk_tree_fn func, void *data,
8960 struct pointer_set_t *pset, walk_tree_lh lh)
8962 tree result = NULL_TREE;
8964 switch (TREE_CODE (type))
8967 case REFERENCE_TYPE:
8968 /* We have to worry about mutually recursive pointers. These can't
8969 be written in C. They can in Ada. It's pathological, but
8970 there's an ACATS test (c38102a) that checks it. Deal with this
8971 by checking if we're pointing to another pointer, that one
8972 points to another pointer, that one does too, and we have no htab.
8973 If so, get a hash table. We check three levels deep to avoid
8974 the cost of the hash table if we don't need one. */
8975 if (POINTER_TYPE_P (TREE_TYPE (type))
8976 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8977 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8980 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8988 /* ... fall through ... */
8991 WALK_SUBTREE (TREE_TYPE (type));
8995 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9000 WALK_SUBTREE (TREE_TYPE (type));
9004 /* We never want to walk into default arguments. */
9005 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9006 WALK_SUBTREE (TREE_VALUE (arg));
9011 /* Don't follow this nodes's type if a pointer for fear that
9012 we'll have infinite recursion. If we have a PSET, then we
9015 || (!POINTER_TYPE_P (TREE_TYPE (type))
9016 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9017 WALK_SUBTREE (TREE_TYPE (type));
9018 WALK_SUBTREE (TYPE_DOMAIN (type));
9022 WALK_SUBTREE (TREE_TYPE (type));
9023 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9033 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9034 called with the DATA and the address of each sub-tree. If FUNC returns a
9035 non-NULL value, the traversal is stopped, and the value returned by FUNC
9036 is returned. If PSET is non-NULL it is used to record the nodes visited,
9037 and to avoid visiting a node more than once. */
9040 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
9041 struct pointer_set_t *pset, walk_tree_lh lh)
9043 enum tree_code code;
9047 #define WALK_SUBTREE_TAIL(NODE) \
9051 goto tail_recurse; \
9056 /* Skip empty subtrees. */
9060 /* Don't walk the same tree twice, if the user has requested
9061 that we avoid doing so. */
9062 if (pset && pointer_set_insert (pset, *tp))
9065 /* Call the function. */
9067 result = (*func) (tp, &walk_subtrees, data);
9069 /* If we found something, return it. */
9073 code = TREE_CODE (*tp);
9075 /* Even if we didn't, FUNC may have decided that there was nothing
9076 interesting below this point in the tree. */
9079 /* But we still need to check our siblings. */
9080 if (code == TREE_LIST)
9081 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
9082 else if (code == OMP_CLAUSE)
9083 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9090 result = (*lh) (tp, &walk_subtrees, func, data, pset);
9091 if (result || !walk_subtrees)
9098 case IDENTIFIER_NODE:
9105 case PLACEHOLDER_EXPR:
9109 /* None of these have subtrees other than those already walked
9114 WALK_SUBTREE (TREE_VALUE (*tp));
9115 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
9120 int len = TREE_VEC_LENGTH (*tp);
9125 /* Walk all elements but the first. */
9127 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
9129 /* Now walk the first one as a tail call. */
9130 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
9134 WALK_SUBTREE (TREE_REALPART (*tp));
9135 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
9139 unsigned HOST_WIDE_INT idx;
9140 constructor_elt *ce;
9143 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
9145 WALK_SUBTREE (ce->value);
9150 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
9155 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
9157 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
9158 into declarations that are just mentioned, rather than
9159 declared; they don't really belong to this part of the tree.
9160 And, we can see cycles: the initializer for a declaration
9161 can refer to the declaration itself. */
9162 WALK_SUBTREE (DECL_INITIAL (decl));
9163 WALK_SUBTREE (DECL_SIZE (decl));
9164 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
9166 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
9169 case STATEMENT_LIST:
9171 tree_stmt_iterator i;
9172 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
9173 WALK_SUBTREE (*tsi_stmt_ptr (i));
9178 switch (OMP_CLAUSE_CODE (*tp))
9180 case OMP_CLAUSE_PRIVATE:
9181 case OMP_CLAUSE_SHARED:
9182 case OMP_CLAUSE_FIRSTPRIVATE:
9183 case OMP_CLAUSE_COPYIN:
9184 case OMP_CLAUSE_COPYPRIVATE:
9186 case OMP_CLAUSE_NUM_THREADS:
9187 case OMP_CLAUSE_SCHEDULE:
9188 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
9191 case OMP_CLAUSE_NOWAIT:
9192 case OMP_CLAUSE_ORDERED:
9193 case OMP_CLAUSE_DEFAULT:
9194 case OMP_CLAUSE_UNTIED:
9195 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9197 case OMP_CLAUSE_LASTPRIVATE:
9198 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
9199 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
9200 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9202 case OMP_CLAUSE_COLLAPSE:
9205 for (i = 0; i < 3; i++)
9206 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
9207 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9210 case OMP_CLAUSE_REDUCTION:
9213 for (i = 0; i < 4; i++)
9214 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
9215 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9227 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
9228 But, we only want to walk once. */
9229 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
9230 for (i = 0; i < len; ++i)
9231 WALK_SUBTREE (TREE_OPERAND (*tp, i));
9232 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
9236 /* If this is a TYPE_DECL, walk into the fields of the type that it's
9237 defining. We only want to walk into these fields of a type in this
9238 case and not in the general case of a mere reference to the type.
9240 The criterion is as follows: if the field can be an expression, it
9241 must be walked only here. This should be in keeping with the fields
9242 that are directly gimplified in gimplify_type_sizes in order for the
9243 mark/copy-if-shared/unmark machinery of the gimplifier to work with
9244 variable-sized types.
9246 Note that DECLs get walked as part of processing the BIND_EXPR. */
9247 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
9249 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
9250 if (TREE_CODE (*type_p) == ERROR_MARK)
9253 /* Call the function for the type. See if it returns anything or
9254 doesn't want us to continue. If we are to continue, walk both
9255 the normal fields and those for the declaration case. */
9256 result = (*func) (type_p, &walk_subtrees, data);
9257 if (result || !walk_subtrees)
9260 result = walk_type_fields (*type_p, func, data, pset, lh);
9264 /* If this is a record type, also walk the fields. */
9265 if (TREE_CODE (*type_p) == RECORD_TYPE
9266 || TREE_CODE (*type_p) == UNION_TYPE
9267 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
9271 for (field = TYPE_FIELDS (*type_p); field;
9272 field = TREE_CHAIN (field))
9274 /* We'd like to look at the type of the field, but we can
9275 easily get infinite recursion. So assume it's pointed
9276 to elsewhere in the tree. Also, ignore things that
9278 if (TREE_CODE (field) != FIELD_DECL)
9281 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
9282 WALK_SUBTREE (DECL_SIZE (field));
9283 WALK_SUBTREE (DECL_SIZE_UNIT (field));
9284 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
9285 WALK_SUBTREE (DECL_QUALIFIER (field));
9289 /* Same for scalar types. */
9290 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
9291 || TREE_CODE (*type_p) == ENUMERAL_TYPE
9292 || TREE_CODE (*type_p) == INTEGER_TYPE
9293 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
9294 || TREE_CODE (*type_p) == REAL_TYPE)
9296 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
9297 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
9300 WALK_SUBTREE (TYPE_SIZE (*type_p));
9301 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
9306 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
9310 /* Walk over all the sub-trees of this operand. */
9311 len = TREE_OPERAND_LENGTH (*tp);
9313 /* Go through the subtrees. We need to do this in forward order so
9314 that the scope of a FOR_EXPR is handled properly. */
9317 for (i = 0; i < len - 1; ++i)
9318 WALK_SUBTREE (TREE_OPERAND (*tp, i));
9319 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
9322 /* If this is a type, walk the needed fields in the type. */
9323 else if (TYPE_P (*tp))
9324 return walk_type_fields (*tp, func, data, pset, lh);
9328 /* We didn't find what we were looking for. */
9331 #undef WALK_SUBTREE_TAIL
9335 /* Like walk_tree, but does not walk duplicate nodes more than once. */
9338 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
9342 struct pointer_set_t *pset;
9344 pset = pointer_set_create ();
9345 result = walk_tree_1 (tp, func, data, pset, lh);
9346 pointer_set_destroy (pset);
9354 char const c = TREE_CODE_CLASS (TREE_CODE (t));
9356 if (IS_EXPR_CODE_CLASS (c))
9357 return &t->exp.block;
9362 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
9363 FIXME: don't use this function. It exists for compatibility with
9364 the old representation of CALL_EXPRs where a list was used to hold the
9365 arguments. Places that currently extract the arglist from a CALL_EXPR
9366 ought to be rewritten to use the CALL_EXPR itself. */
9368 call_expr_arglist (tree exp)
9370 tree arglist = NULL_TREE;
9372 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
9373 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
9378 /* Create a nameless artificial label and put it in the current
9379 function context. The label has a location of LOC. Returns the
9380 newly created label. */
9383 create_artificial_label (location_t loc)
9385 tree lab = build_decl (loc,
9386 LABEL_DECL, NULL_TREE, void_type_node);
9388 DECL_ARTIFICIAL (lab) = 1;
9389 DECL_IGNORED_P (lab) = 1;
9390 DECL_CONTEXT (lab) = current_function_decl;
9394 /* Given a tree, try to return a useful variable name that we can use
9395 to prefix a temporary that is being assigned the value of the tree.
9396 I.E. given <temp> = &A, return A. */
9404 STRIP_NOPS (stripped_decl);
9405 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
9406 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
9409 switch (TREE_CODE (stripped_decl))
9412 return get_name (TREE_OPERAND (stripped_decl, 0));
9419 /* Return true if TYPE has a variable argument list. */
9422 stdarg_p (tree fntype)
9424 function_args_iterator args_iter;
9425 tree n = NULL_TREE, t;
9430 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
9435 return n != NULL_TREE && n != void_type_node;
9438 /* Return true if TYPE has a prototype. */
9441 prototype_p (tree fntype)
9445 gcc_assert (fntype != NULL_TREE);
9447 t = TYPE_ARG_TYPES (fntype);
9448 return (t != NULL_TREE);
9451 /* If BLOCK is inlined from an __attribute__((__artificial__))
9452 routine, return pointer to location from where it has been
9455 block_nonartificial_location (tree block)
9457 location_t *ret = NULL;
9459 while (block && TREE_CODE (block) == BLOCK
9460 && BLOCK_ABSTRACT_ORIGIN (block))
9462 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
9464 while (TREE_CODE (ao) == BLOCK
9465 && BLOCK_ABSTRACT_ORIGIN (ao)
9466 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
9467 ao = BLOCK_ABSTRACT_ORIGIN (ao);
9469 if (TREE_CODE (ao) == FUNCTION_DECL)
9471 /* If AO is an artificial inline, point RET to the
9472 call site locus at which it has been inlined and continue
9473 the loop, in case AO's caller is also an artificial
9475 if (DECL_DECLARED_INLINE_P (ao)
9476 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
9477 ret = &BLOCK_SOURCE_LOCATION (block);
9481 else if (TREE_CODE (ao) != BLOCK)
9484 block = BLOCK_SUPERCONTEXT (block);
9490 /* If EXP is inlined from an __attribute__((__artificial__))
9491 function, return the location of the original call expression. */
9494 tree_nonartificial_location (tree exp)
9496 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
9501 return EXPR_LOCATION (exp);
9505 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
9508 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
9511 cl_option_hash_hash (const void *x)
9513 const_tree const t = (const_tree) x;
9519 if (TREE_CODE (t) == OPTIMIZATION_NODE)
9521 p = (const char *)TREE_OPTIMIZATION (t);
9522 len = sizeof (struct cl_optimization);
9525 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
9527 p = (const char *)TREE_TARGET_OPTION (t);
9528 len = sizeof (struct cl_target_option);
9534 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
9536 for (i = 0; i < len; i++)
9538 hash = (hash << 4) ^ ((i << 2) | p[i]);
9543 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
9544 TARGET_OPTION tree node) is the same as that given by *Y, which is the
9548 cl_option_hash_eq (const void *x, const void *y)
9550 const_tree const xt = (const_tree) x;
9551 const_tree const yt = (const_tree) y;
9556 if (TREE_CODE (xt) != TREE_CODE (yt))
9559 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
9561 xp = (const char *)TREE_OPTIMIZATION (xt);
9562 yp = (const char *)TREE_OPTIMIZATION (yt);
9563 len = sizeof (struct cl_optimization);
9566 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
9568 xp = (const char *)TREE_TARGET_OPTION (xt);
9569 yp = (const char *)TREE_TARGET_OPTION (yt);
9570 len = sizeof (struct cl_target_option);
9576 return (memcmp (xp, yp, len) == 0);
9579 /* Build an OPTIMIZATION_NODE based on the current options. */
9582 build_optimization_node (void)
9587 /* Use the cache of optimization nodes. */
9589 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
9591 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
9595 /* Insert this one into the hash table. */
9596 t = cl_optimization_node;
9599 /* Make a new node for next time round. */
9600 cl_optimization_node = make_node (OPTIMIZATION_NODE);
9606 /* Build a TARGET_OPTION_NODE based on the current options. */
9609 build_target_option_node (void)
9614 /* Use the cache of optimization nodes. */
9616 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
9618 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
9622 /* Insert this one into the hash table. */
9623 t = cl_target_option_node;
9626 /* Make a new node for next time round. */
9627 cl_target_option_node = make_node (TARGET_OPTION_NODE);
9633 /* Determine the "ultimate origin" of a block. The block may be an inlined
9634 instance of an inlined instance of a block which is local to an inline
9635 function, so we have to trace all of the way back through the origin chain
9636 to find out what sort of node actually served as the original seed for the
9640 block_ultimate_origin (const_tree block)
9642 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
9644 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
9645 nodes in the function to point to themselves; ignore that if
9646 we're trying to output the abstract instance of this function. */
9647 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
9650 if (immediate_origin == NULL_TREE)
9655 tree lookahead = immediate_origin;
9659 ret_val = lookahead;
9660 lookahead = (TREE_CODE (ret_val) == BLOCK
9661 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
9663 while (lookahead != NULL && lookahead != ret_val);
9665 /* The block's abstract origin chain may not be the *ultimate* origin of
9666 the block. It could lead to a DECL that has an abstract origin set.
9667 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
9668 will give us if it has one). Note that DECL's abstract origins are
9669 supposed to be the most distant ancestor (or so decl_ultimate_origin
9670 claims), so we don't need to loop following the DECL origins. */
9671 if (DECL_P (ret_val))
9672 return DECL_ORIGIN (ret_val);
9678 /* Return true if T1 and T2 are equivalent lists. */
9681 list_equal_p (const_tree t1, const_tree t2)
9683 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
9684 if (TREE_VALUE (t1) != TREE_VALUE (t2))
9689 /* Return true iff conversion in EXP generates no instruction. Mark
9690 it inline so that we fully inline into the stripping functions even
9691 though we have two uses of this function. */
9694 tree_nop_conversion (const_tree exp)
9696 tree outer_type, inner_type;
9698 if (!CONVERT_EXPR_P (exp)
9699 && TREE_CODE (exp) != NON_LVALUE_EXPR)
9701 if (TREE_OPERAND (exp, 0) == error_mark_node)
9704 outer_type = TREE_TYPE (exp);
9705 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9707 /* Use precision rather then machine mode when we can, which gives
9708 the correct answer even for submode (bit-field) types. */
9709 if ((INTEGRAL_TYPE_P (outer_type)
9710 || POINTER_TYPE_P (outer_type)
9711 || TREE_CODE (outer_type) == OFFSET_TYPE)
9712 && (INTEGRAL_TYPE_P (inner_type)
9713 || POINTER_TYPE_P (inner_type)
9714 || TREE_CODE (inner_type) == OFFSET_TYPE))
9715 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
9717 /* Otherwise fall back on comparing machine modes (e.g. for
9718 aggregate types, floats). */
9719 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
9722 /* Return true iff conversion in EXP generates no instruction. Don't
9723 consider conversions changing the signedness. */
9726 tree_sign_nop_conversion (const_tree exp)
9728 tree outer_type, inner_type;
9730 if (!tree_nop_conversion (exp))
9733 outer_type = TREE_TYPE (exp);
9734 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
9736 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
9737 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
9740 /* Strip conversions from EXP according to tree_nop_conversion and
9741 return the resulting expression. */
9744 tree_strip_nop_conversions (tree exp)
9746 while (tree_nop_conversion (exp))
9747 exp = TREE_OPERAND (exp, 0);
9751 /* Strip conversions from EXP according to tree_sign_nop_conversion
9752 and return the resulting expression. */
9755 tree_strip_sign_nop_conversions (tree exp)
9757 while (tree_sign_nop_conversion (exp))
9758 exp = TREE_OPERAND (exp, 0);
9763 #include "gt-tree.h"