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-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "fixed-value.h"
55 /* Tree code classes. */
57 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
58 #define END_OF_BASE_TREE_CODES tcc_exceptional,
60 const enum tree_code_class tree_code_type[] = {
61 #include "all-tree.def"
65 #undef END_OF_BASE_TREE_CODES
67 /* Table indexed by tree code giving number of expression
68 operands beyond the fixed part of the node structure.
69 Not used for types or decls. */
71 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
72 #define END_OF_BASE_TREE_CODES 0,
74 const unsigned char tree_code_length[] = {
75 #include "all-tree.def"
79 #undef END_OF_BASE_TREE_CODES
81 /* Names of tree components.
82 Used for printing out the tree and error messages. */
83 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 #define END_OF_BASE_TREE_CODES "@dummy",
86 const char *const tree_code_name[] = {
87 #include "all-tree.def"
91 #undef END_OF_BASE_TREE_CODES
93 /* Each tree code class has an associated string representation.
94 These must correspond to the tree_code_class entries. */
96 const char *const tree_code_class_strings[] =
111 /* obstack.[ch] explicitly declined to prototype this. */
112 extern int _obstack_allocated_p (struct obstack *h, void *obj);
114 #ifdef GATHER_STATISTICS
115 /* Statistics-gathering stuff. */
117 int tree_node_counts[(int) all_kinds];
118 int tree_node_sizes[(int) all_kinds];
120 /* Keep in sync with tree.h:enum tree_node_kind. */
121 static const char * const tree_node_kind_names[] = {
141 #endif /* GATHER_STATISTICS */
143 /* Unique id for next decl created. */
144 static GTY(()) int next_decl_uid;
145 /* Unique id for next type created. */
146 static GTY(()) int next_type_uid = 1;
148 /* Since we cannot rehash a type after it is in the table, we have to
149 keep the hash code. */
151 struct GTY(()) type_hash {
156 /* Initial size of the hash table (rounded to next prime). */
157 #define TYPE_HASH_INITIAL_SIZE 1000
159 /* Now here is the hash table. When recording a type, it is added to
160 the slot whose index is the hash code. Note that the hash table is
161 used for several kinds of types (function types, array types and
162 array index range types, for now). While all these live in the
163 same table, they are completely independent, and the hash code is
164 computed differently for each of these. */
166 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
167 htab_t type_hash_table;
169 /* Hash table and temporary node for larger integer const values. */
170 static GTY (()) tree int_cst_node;
171 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
172 htab_t int_cst_hash_table;
174 /* Hash table for optimization flags and target option flags. Use the same
175 hash table for both sets of options. Nodes for building the current
176 optimization and target option nodes. The assumption is most of the time
177 the options created will already be in the hash table, so we avoid
178 allocating and freeing up a node repeatably. */
179 static GTY (()) tree cl_optimization_node;
180 static GTY (()) tree cl_target_option_node;
181 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
182 htab_t cl_option_hash_table;
184 /* General tree->tree mapping structure for use in hash tables. */
187 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
188 htab_t debug_expr_for_decl;
190 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
191 htab_t value_expr_for_decl;
193 static GTY ((if_marked ("tree_priority_map_marked_p"),
194 param_is (struct tree_priority_map)))
195 htab_t init_priority_for_decl;
197 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
198 htab_t restrict_base_for_decl;
200 static void set_type_quals (tree, int);
201 static int type_hash_eq (const void *, const void *);
202 static hashval_t type_hash_hash (const void *);
203 static hashval_t int_cst_hash_hash (const void *);
204 static int int_cst_hash_eq (const void *, const void *);
205 static hashval_t cl_option_hash_hash (const void *);
206 static int cl_option_hash_eq (const void *, const void *);
207 static void print_type_hash_statistics (void);
208 static void print_debug_expr_statistics (void);
209 static void print_value_expr_statistics (void);
210 static int type_hash_marked_p (const void *);
211 static unsigned int type_hash_list (const_tree, hashval_t);
212 static unsigned int attribute_hash_list (const_tree, hashval_t);
214 tree global_trees[TI_MAX];
215 tree integer_types[itk_none];
217 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
219 /* Number of operands for each OpenMP clause. */
220 unsigned const char omp_clause_num_ops[] =
222 0, /* OMP_CLAUSE_ERROR */
223 1, /* OMP_CLAUSE_PRIVATE */
224 1, /* OMP_CLAUSE_SHARED */
225 1, /* OMP_CLAUSE_FIRSTPRIVATE */
226 2, /* OMP_CLAUSE_LASTPRIVATE */
227 4, /* OMP_CLAUSE_REDUCTION */
228 1, /* OMP_CLAUSE_COPYIN */
229 1, /* OMP_CLAUSE_COPYPRIVATE */
230 1, /* OMP_CLAUSE_IF */
231 1, /* OMP_CLAUSE_NUM_THREADS */
232 1, /* OMP_CLAUSE_SCHEDULE */
233 0, /* OMP_CLAUSE_NOWAIT */
234 0, /* OMP_CLAUSE_ORDERED */
235 0, /* OMP_CLAUSE_DEFAULT */
236 3, /* OMP_CLAUSE_COLLAPSE */
237 0 /* OMP_CLAUSE_UNTIED */
240 const char * const omp_clause_code_name[] =
265 /* Initialize the hash table of types. */
266 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
269 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
272 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
274 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
275 tree_priority_map_eq, 0);
276 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
279 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
280 int_cst_hash_eq, NULL);
282 int_cst_node = make_node (INTEGER_CST);
284 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
285 cl_option_hash_eq, NULL);
287 cl_optimization_node = make_node (OPTIMIZATION_NODE);
288 cl_target_option_node = make_node (TARGET_OPTION_NODE);
290 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
291 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
292 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
295 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
296 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
297 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
298 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
299 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
300 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
301 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
302 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
303 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
306 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
307 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
308 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
309 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
310 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
311 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
313 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
314 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
315 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
316 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
317 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
318 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
319 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
320 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
321 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
323 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
324 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
325 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
326 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
328 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
329 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
330 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
331 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
332 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
333 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
334 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
335 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
336 tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL] = 1;
337 tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON] = 1;
339 lang_hooks.init_ts ();
343 /* The name of the object as the assembler will see it (but before any
344 translations made by ASM_OUTPUT_LABELREF). Often this is the same
345 as DECL_NAME. It is an IDENTIFIER_NODE. */
347 decl_assembler_name (tree decl)
349 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
350 lang_hooks.set_decl_assembler_name (decl);
351 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
354 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
357 decl_assembler_name_equal (tree decl, const_tree asmname)
359 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
360 const char *decl_str;
361 const char *asmname_str;
364 if (decl_asmname == asmname)
367 decl_str = IDENTIFIER_POINTER (decl_asmname);
368 asmname_str = IDENTIFIER_POINTER (asmname);
371 /* If the target assembler name was set by the user, things are trickier.
372 We have a leading '*' to begin with. After that, it's arguable what
373 is the correct thing to do with -fleading-underscore. Arguably, we've
374 historically been doing the wrong thing in assemble_alias by always
375 printing the leading underscore. Since we're not changing that, make
376 sure user_label_prefix follows the '*' before matching. */
377 if (decl_str[0] == '*')
379 size_t ulp_len = strlen (user_label_prefix);
385 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
386 decl_str += ulp_len, test=true;
390 if (asmname_str[0] == '*')
392 size_t ulp_len = strlen (user_label_prefix);
398 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
399 asmname_str += ulp_len, test=true;
406 return strcmp (decl_str, asmname_str) == 0;
409 /* Hash asmnames ignoring the user specified marks. */
412 decl_assembler_name_hash (const_tree asmname)
414 if (IDENTIFIER_POINTER (asmname)[0] == '*')
416 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
417 size_t ulp_len = strlen (user_label_prefix);
421 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
424 return htab_hash_string (decl_str);
427 return htab_hash_string (IDENTIFIER_POINTER (asmname));
430 /* Compute the number of bytes occupied by a tree with code CODE.
431 This function cannot be used for nodes that have variable sizes,
432 including TREE_VEC, STRING_CST, and CALL_EXPR. */
434 tree_code_size (enum tree_code code)
436 switch (TREE_CODE_CLASS (code))
438 case tcc_declaration: /* A decl node */
443 return sizeof (struct tree_field_decl);
445 return sizeof (struct tree_parm_decl);
447 return sizeof (struct tree_var_decl);
449 return sizeof (struct tree_label_decl);
451 return sizeof (struct tree_result_decl);
453 return sizeof (struct tree_const_decl);
455 return sizeof (struct tree_type_decl);
457 return sizeof (struct tree_function_decl);
459 return sizeof (struct tree_decl_non_common);
463 case tcc_type: /* a type node */
464 return sizeof (struct tree_type);
466 case tcc_reference: /* a reference */
467 case tcc_expression: /* an expression */
468 case tcc_statement: /* an expression with side effects */
469 case tcc_comparison: /* a comparison expression */
470 case tcc_unary: /* a unary arithmetic expression */
471 case tcc_binary: /* a binary arithmetic expression */
472 return (sizeof (struct tree_exp)
473 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
475 case tcc_constant: /* a constant */
478 case INTEGER_CST: return sizeof (struct tree_int_cst);
479 case REAL_CST: return sizeof (struct tree_real_cst);
480 case FIXED_CST: return sizeof (struct tree_fixed_cst);
481 case COMPLEX_CST: return sizeof (struct tree_complex);
482 case VECTOR_CST: return sizeof (struct tree_vector);
483 case STRING_CST: gcc_unreachable ();
485 return lang_hooks.tree_size (code);
488 case tcc_exceptional: /* something random, like an identifier. */
491 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
492 case TREE_LIST: return sizeof (struct tree_list);
495 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
498 case OMP_CLAUSE: gcc_unreachable ();
500 case SSA_NAME: return sizeof (struct tree_ssa_name);
502 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
503 case BLOCK: return sizeof (struct tree_block);
504 case CONSTRUCTOR: return sizeof (struct tree_constructor);
505 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
506 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
509 return lang_hooks.tree_size (code);
517 /* Compute the number of bytes occupied by NODE. This routine only
518 looks at TREE_CODE, except for those nodes that have variable sizes. */
520 tree_size (const_tree node)
522 const enum tree_code code = TREE_CODE (node);
526 return (offsetof (struct tree_binfo, base_binfos)
527 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
530 return (sizeof (struct tree_vec)
531 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
534 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
537 return (sizeof (struct tree_omp_clause)
538 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
542 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
543 return (sizeof (struct tree_exp)
544 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
546 return tree_code_size (code);
550 /* Return a newly allocated node of code CODE. For decl and type
551 nodes, some other fields are initialized. The rest of the node is
552 initialized to zero. This function cannot be used for TREE_VEC or
553 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
555 Achoo! I got a code in the node. */
558 make_node_stat (enum tree_code code MEM_STAT_DECL)
561 enum tree_code_class type = TREE_CODE_CLASS (code);
562 size_t length = tree_code_size (code);
563 #ifdef GATHER_STATISTICS
568 case tcc_declaration: /* A decl node */
572 case tcc_type: /* a type node */
576 case tcc_statement: /* an expression with side effects */
580 case tcc_reference: /* a reference */
584 case tcc_expression: /* an expression */
585 case tcc_comparison: /* a comparison expression */
586 case tcc_unary: /* a unary arithmetic expression */
587 case tcc_binary: /* a binary arithmetic expression */
591 case tcc_constant: /* a constant */
595 case tcc_exceptional: /* something random, like an identifier. */
598 case IDENTIFIER_NODE:
611 kind = ssa_name_kind;
632 tree_node_counts[(int) kind]++;
633 tree_node_sizes[(int) kind] += length;
636 if (code == IDENTIFIER_NODE)
637 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
639 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
641 memset (t, 0, length);
643 TREE_SET_CODE (t, code);
648 TREE_SIDE_EFFECTS (t) = 1;
651 case tcc_declaration:
652 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
654 if (code == FUNCTION_DECL)
656 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
657 DECL_MODE (t) = FUNCTION_MODE;
661 /* We have not yet computed the alias set for this declaration. */
662 DECL_POINTER_ALIAS_SET (t) = -1;
664 DECL_SOURCE_LOCATION (t) = input_location;
665 DECL_UID (t) = next_decl_uid++;
670 TYPE_UID (t) = next_type_uid++;
671 TYPE_ALIGN (t) = BITS_PER_UNIT;
672 TYPE_USER_ALIGN (t) = 0;
673 TYPE_MAIN_VARIANT (t) = t;
674 TYPE_CANONICAL (t) = t;
676 /* Default to no attributes for type, but let target change that. */
677 TYPE_ATTRIBUTES (t) = NULL_TREE;
678 targetm.set_default_type_attributes (t);
680 /* We have not yet computed the alias set for this type. */
681 TYPE_ALIAS_SET (t) = -1;
685 TREE_CONSTANT (t) = 1;
694 case PREDECREMENT_EXPR:
695 case PREINCREMENT_EXPR:
696 case POSTDECREMENT_EXPR:
697 case POSTINCREMENT_EXPR:
698 /* All of these have side-effects, no matter what their
700 TREE_SIDE_EFFECTS (t) = 1;
709 /* Other classes need no special treatment. */
716 /* Return a new node with the same contents as NODE except that its
717 TREE_CHAIN is zero and it has a fresh uid. */
720 copy_node_stat (tree node MEM_STAT_DECL)
723 enum tree_code code = TREE_CODE (node);
726 gcc_assert (code != STATEMENT_LIST);
728 length = tree_size (node);
729 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
730 memcpy (t, node, length);
733 TREE_ASM_WRITTEN (t) = 0;
734 TREE_VISITED (t) = 0;
737 if (TREE_CODE_CLASS (code) == tcc_declaration)
739 DECL_UID (t) = next_decl_uid++;
740 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
741 && DECL_HAS_VALUE_EXPR_P (node))
743 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
744 DECL_HAS_VALUE_EXPR_P (t) = 1;
746 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
748 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
749 DECL_HAS_INIT_PRIORITY_P (t) = 1;
751 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
753 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
754 DECL_BASED_ON_RESTRICT_P (t) = 1;
757 else if (TREE_CODE_CLASS (code) == tcc_type)
759 TYPE_UID (t) = next_type_uid++;
760 /* The following is so that the debug code for
761 the copy is different from the original type.
762 The two statements usually duplicate each other
763 (because they clear fields of the same union),
764 but the optimizer should catch that. */
765 TYPE_SYMTAB_POINTER (t) = 0;
766 TYPE_SYMTAB_ADDRESS (t) = 0;
768 /* Do not copy the values cache. */
769 if (TYPE_CACHED_VALUES_P(t))
771 TYPE_CACHED_VALUES_P (t) = 0;
772 TYPE_CACHED_VALUES (t) = NULL_TREE;
779 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
780 For example, this can copy a list made of TREE_LIST nodes. */
783 copy_list (tree list)
791 head = prev = copy_node (list);
792 next = TREE_CHAIN (list);
795 TREE_CHAIN (prev) = copy_node (next);
796 prev = TREE_CHAIN (prev);
797 next = TREE_CHAIN (next);
803 /* Create an INT_CST node with a LOW value sign extended. */
806 build_int_cst (tree type, HOST_WIDE_INT low)
808 /* Support legacy code. */
810 type = integer_type_node;
812 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
815 /* Create an INT_CST node with a LOW value zero extended. */
818 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
820 return build_int_cst_wide (type, low, 0);
823 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
824 if it is negative. This function is similar to build_int_cst, but
825 the extra bits outside of the type precision are cleared. Constants
826 with these extra bits may confuse the fold so that it detects overflows
827 even in cases when they do not occur, and in general should be avoided.
828 We cannot however make this a default behavior of build_int_cst without
829 more intrusive changes, since there are parts of gcc that rely on the extra
830 precision of the integer constants. */
833 build_int_cst_type (tree type, HOST_WIDE_INT low)
835 unsigned HOST_WIDE_INT low1;
840 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
842 return build_int_cst_wide (type, low1, hi);
845 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
846 and sign extended according to the value range of TYPE. */
849 build_int_cst_wide_type (tree type,
850 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
852 fit_double_type (low, high, &low, &high, type);
853 return build_int_cst_wide (type, low, high);
856 /* These are the hash table functions for the hash table of INTEGER_CST
857 nodes of a sizetype. */
859 /* Return the hash code code X, an INTEGER_CST. */
862 int_cst_hash_hash (const void *x)
864 const_tree const t = (const_tree) x;
866 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
867 ^ htab_hash_pointer (TREE_TYPE (t)));
870 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
871 is the same as that given by *Y, which is the same. */
874 int_cst_hash_eq (const void *x, const void *y)
876 const_tree const xt = (const_tree) x;
877 const_tree const yt = (const_tree) y;
879 return (TREE_TYPE (xt) == TREE_TYPE (yt)
880 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
881 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
884 /* Create an INT_CST node of TYPE and value HI:LOW.
885 The returned node is always shared. For small integers we use a
886 per-type vector cache, for larger ones we use a single hash table. */
889 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
897 switch (TREE_CODE (type))
901 /* Cache NULL pointer. */
910 /* Cache false or true. */
918 if (TYPE_UNSIGNED (type))
921 limit = INTEGER_SHARE_LIMIT;
922 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
928 limit = INTEGER_SHARE_LIMIT + 1;
929 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
931 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
945 /* Look for it in the type's vector of small shared ints. */
946 if (!TYPE_CACHED_VALUES_P (type))
948 TYPE_CACHED_VALUES_P (type) = 1;
949 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
952 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
955 /* Make sure no one is clobbering the shared constant. */
956 gcc_assert (TREE_TYPE (t) == type);
957 gcc_assert (TREE_INT_CST_LOW (t) == low);
958 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
962 /* Create a new shared int. */
963 t = make_node (INTEGER_CST);
965 TREE_INT_CST_LOW (t) = low;
966 TREE_INT_CST_HIGH (t) = hi;
967 TREE_TYPE (t) = type;
969 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
974 /* Use the cache of larger shared ints. */
977 TREE_INT_CST_LOW (int_cst_node) = low;
978 TREE_INT_CST_HIGH (int_cst_node) = hi;
979 TREE_TYPE (int_cst_node) = type;
981 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
985 /* Insert this one into the hash table. */
988 /* Make a new node for next time round. */
989 int_cst_node = make_node (INTEGER_CST);
996 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
997 and the rest are zeros. */
1000 build_low_bits_mask (tree type, unsigned bits)
1002 unsigned HOST_WIDE_INT low;
1004 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1006 gcc_assert (bits <= TYPE_PRECISION (type));
1008 if (bits == TYPE_PRECISION (type)
1009 && !TYPE_UNSIGNED (type))
1011 /* Sign extended all-ones mask. */
1015 else if (bits <= HOST_BITS_PER_WIDE_INT)
1017 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1022 bits -= HOST_BITS_PER_WIDE_INT;
1024 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1027 return build_int_cst_wide (type, low, high);
1030 /* Checks that X is integer constant that can be expressed in (unsigned)
1031 HOST_WIDE_INT without loss of precision. */
1034 cst_and_fits_in_hwi (const_tree x)
1036 if (TREE_CODE (x) != INTEGER_CST)
1039 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1042 return (TREE_INT_CST_HIGH (x) == 0
1043 || TREE_INT_CST_HIGH (x) == -1);
1046 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1047 are in a list pointed to by VALS. */
1050 build_vector (tree type, tree vals)
1052 tree v = make_node (VECTOR_CST);
1056 TREE_VECTOR_CST_ELTS (v) = vals;
1057 TREE_TYPE (v) = type;
1059 /* Iterate through elements and check for overflow. */
1060 for (link = vals; link; link = TREE_CHAIN (link))
1062 tree value = TREE_VALUE (link);
1064 /* Don't crash if we get an address constant. */
1065 if (!CONSTANT_CLASS_P (value))
1068 over |= TREE_OVERFLOW (value);
1071 TREE_OVERFLOW (v) = over;
1075 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1076 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1079 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1081 tree list = NULL_TREE;
1082 unsigned HOST_WIDE_INT idx;
1085 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1086 list = tree_cons (NULL_TREE, value, list);
1087 return build_vector (type, nreverse (list));
1090 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1091 are in the VEC pointed to by VALS. */
1093 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1095 tree c = make_node (CONSTRUCTOR);
1096 TREE_TYPE (c) = type;
1097 CONSTRUCTOR_ELTS (c) = vals;
1101 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1104 build_constructor_single (tree type, tree index, tree value)
1106 VEC(constructor_elt,gc) *v;
1107 constructor_elt *elt;
1110 v = VEC_alloc (constructor_elt, gc, 1);
1111 elt = VEC_quick_push (constructor_elt, v, NULL);
1115 t = build_constructor (type, v);
1116 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1121 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1122 are in a list pointed to by VALS. */
1124 build_constructor_from_list (tree type, tree vals)
1127 VEC(constructor_elt,gc) *v = NULL;
1128 bool constant_p = true;
1132 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1133 for (t = vals; t; t = TREE_CHAIN (t))
1135 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1136 val = TREE_VALUE (t);
1137 elt->index = TREE_PURPOSE (t);
1139 if (!TREE_CONSTANT (val))
1144 t = build_constructor (type, v);
1145 TREE_CONSTANT (t) = constant_p;
1149 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1152 build_fixed (tree type, FIXED_VALUE_TYPE f)
1155 FIXED_VALUE_TYPE *fp;
1157 v = make_node (FIXED_CST);
1158 fp = GGC_NEW (FIXED_VALUE_TYPE);
1159 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1161 TREE_TYPE (v) = type;
1162 TREE_FIXED_CST_PTR (v) = fp;
1166 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1169 build_real (tree type, REAL_VALUE_TYPE d)
1172 REAL_VALUE_TYPE *dp;
1175 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1176 Consider doing it via real_convert now. */
1178 v = make_node (REAL_CST);
1179 dp = GGC_NEW (REAL_VALUE_TYPE);
1180 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1182 TREE_TYPE (v) = type;
1183 TREE_REAL_CST_PTR (v) = dp;
1184 TREE_OVERFLOW (v) = overflow;
1188 /* Return a new REAL_CST node whose type is TYPE
1189 and whose value is the integer value of the INTEGER_CST node I. */
1192 real_value_from_int_cst (const_tree type, const_tree i)
1196 /* Clear all bits of the real value type so that we can later do
1197 bitwise comparisons to see if two values are the same. */
1198 memset (&d, 0, sizeof d);
1200 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1201 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1202 TYPE_UNSIGNED (TREE_TYPE (i)));
1206 /* Given a tree representing an integer constant I, return a tree
1207 representing the same value as a floating-point constant of type TYPE. */
1210 build_real_from_int_cst (tree type, const_tree i)
1213 int overflow = TREE_OVERFLOW (i);
1215 v = build_real (type, real_value_from_int_cst (type, i));
1217 TREE_OVERFLOW (v) |= overflow;
1221 /* Return a newly constructed STRING_CST node whose value is
1222 the LEN characters at STR.
1223 The TREE_TYPE is not initialized. */
1226 build_string (int len, const char *str)
1231 /* Do not waste bytes provided by padding of struct tree_string. */
1232 length = len + offsetof (struct tree_string, str) + 1;
1234 #ifdef GATHER_STATISTICS
1235 tree_node_counts[(int) c_kind]++;
1236 tree_node_sizes[(int) c_kind] += length;
1239 s = ggc_alloc_tree (length);
1241 memset (s, 0, sizeof (struct tree_common));
1242 TREE_SET_CODE (s, STRING_CST);
1243 TREE_CONSTANT (s) = 1;
1244 TREE_STRING_LENGTH (s) = len;
1245 memcpy (s->string.str, str, len);
1246 s->string.str[len] = '\0';
1251 /* Return a newly constructed COMPLEX_CST node whose value is
1252 specified by the real and imaginary parts REAL and IMAG.
1253 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1254 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1257 build_complex (tree type, tree real, tree imag)
1259 tree t = make_node (COMPLEX_CST);
1261 TREE_REALPART (t) = real;
1262 TREE_IMAGPART (t) = imag;
1263 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1264 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1268 /* Return a constant of arithmetic type TYPE which is the
1269 multiplicative identity of the set TYPE. */
1272 build_one_cst (tree type)
1274 switch (TREE_CODE (type))
1276 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1277 case POINTER_TYPE: case REFERENCE_TYPE:
1279 return build_int_cst (type, 1);
1282 return build_real (type, dconst1);
1284 case FIXED_POINT_TYPE:
1285 /* We can only generate 1 for accum types. */
1286 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1287 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1294 scalar = build_one_cst (TREE_TYPE (type));
1296 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1298 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1299 cst = tree_cons (NULL_TREE, scalar, cst);
1301 return build_vector (type, cst);
1305 return build_complex (type,
1306 build_one_cst (TREE_TYPE (type)),
1307 fold_convert (TREE_TYPE (type), integer_zero_node));
1314 /* Build a BINFO with LEN language slots. */
1317 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1320 size_t length = (offsetof (struct tree_binfo, base_binfos)
1321 + VEC_embedded_size (tree, base_binfos));
1323 #ifdef GATHER_STATISTICS
1324 tree_node_counts[(int) binfo_kind]++;
1325 tree_node_sizes[(int) binfo_kind] += length;
1328 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1330 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1332 TREE_SET_CODE (t, TREE_BINFO);
1334 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1340 /* Build a newly constructed TREE_VEC node of length LEN. */
1343 make_tree_vec_stat (int len MEM_STAT_DECL)
1346 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1348 #ifdef GATHER_STATISTICS
1349 tree_node_counts[(int) vec_kind]++;
1350 tree_node_sizes[(int) vec_kind] += length;
1353 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1355 memset (t, 0, length);
1357 TREE_SET_CODE (t, TREE_VEC);
1358 TREE_VEC_LENGTH (t) = len;
1363 /* Return 1 if EXPR is the integer constant zero or a complex constant
1367 integer_zerop (const_tree expr)
1371 return ((TREE_CODE (expr) == INTEGER_CST
1372 && TREE_INT_CST_LOW (expr) == 0
1373 && TREE_INT_CST_HIGH (expr) == 0)
1374 || (TREE_CODE (expr) == COMPLEX_CST
1375 && integer_zerop (TREE_REALPART (expr))
1376 && integer_zerop (TREE_IMAGPART (expr))));
1379 /* Return 1 if EXPR is the integer constant one or the corresponding
1380 complex constant. */
1383 integer_onep (const_tree expr)
1387 return ((TREE_CODE (expr) == INTEGER_CST
1388 && TREE_INT_CST_LOW (expr) == 1
1389 && TREE_INT_CST_HIGH (expr) == 0)
1390 || (TREE_CODE (expr) == COMPLEX_CST
1391 && integer_onep (TREE_REALPART (expr))
1392 && integer_zerop (TREE_IMAGPART (expr))));
1395 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1396 it contains. Likewise for the corresponding complex constant. */
1399 integer_all_onesp (const_tree expr)
1406 if (TREE_CODE (expr) == COMPLEX_CST
1407 && integer_all_onesp (TREE_REALPART (expr))
1408 && integer_zerop (TREE_IMAGPART (expr)))
1411 else if (TREE_CODE (expr) != INTEGER_CST)
1414 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1415 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1416 && TREE_INT_CST_HIGH (expr) == -1)
1421 /* Note that using TYPE_PRECISION here is wrong. We care about the
1422 actual bits, not the (arbitrary) range of the type. */
1423 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1424 if (prec >= HOST_BITS_PER_WIDE_INT)
1426 HOST_WIDE_INT high_value;
1429 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1431 /* Can not handle precisions greater than twice the host int size. */
1432 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1433 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1434 /* Shifting by the host word size is undefined according to the ANSI
1435 standard, so we must handle this as a special case. */
1438 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1440 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1441 && TREE_INT_CST_HIGH (expr) == high_value);
1444 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1447 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1451 integer_pow2p (const_tree expr)
1454 HOST_WIDE_INT high, low;
1458 if (TREE_CODE (expr) == COMPLEX_CST
1459 && integer_pow2p (TREE_REALPART (expr))
1460 && integer_zerop (TREE_IMAGPART (expr)))
1463 if (TREE_CODE (expr) != INTEGER_CST)
1466 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1467 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1468 high = TREE_INT_CST_HIGH (expr);
1469 low = TREE_INT_CST_LOW (expr);
1471 /* First clear all bits that are beyond the type's precision in case
1472 we've been sign extended. */
1474 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1476 else if (prec > HOST_BITS_PER_WIDE_INT)
1477 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1481 if (prec < HOST_BITS_PER_WIDE_INT)
1482 low &= ~((HOST_WIDE_INT) (-1) << prec);
1485 if (high == 0 && low == 0)
1488 return ((high == 0 && (low & (low - 1)) == 0)
1489 || (low == 0 && (high & (high - 1)) == 0));
1492 /* Return 1 if EXPR is an integer constant other than zero or a
1493 complex constant other than zero. */
1496 integer_nonzerop (const_tree expr)
1500 return ((TREE_CODE (expr) == INTEGER_CST
1501 && (TREE_INT_CST_LOW (expr) != 0
1502 || TREE_INT_CST_HIGH (expr) != 0))
1503 || (TREE_CODE (expr) == COMPLEX_CST
1504 && (integer_nonzerop (TREE_REALPART (expr))
1505 || integer_nonzerop (TREE_IMAGPART (expr)))));
1508 /* Return 1 if EXPR is the fixed-point constant zero. */
1511 fixed_zerop (const_tree expr)
1513 return (TREE_CODE (expr) == FIXED_CST
1514 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1517 /* Return the power of two represented by a tree node known to be a
1521 tree_log2 (const_tree expr)
1524 HOST_WIDE_INT high, low;
1528 if (TREE_CODE (expr) == COMPLEX_CST)
1529 return tree_log2 (TREE_REALPART (expr));
1531 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1532 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1534 high = TREE_INT_CST_HIGH (expr);
1535 low = TREE_INT_CST_LOW (expr);
1537 /* First clear all bits that are beyond the type's precision in case
1538 we've been sign extended. */
1540 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1542 else if (prec > HOST_BITS_PER_WIDE_INT)
1543 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1547 if (prec < HOST_BITS_PER_WIDE_INT)
1548 low &= ~((HOST_WIDE_INT) (-1) << prec);
1551 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1552 : exact_log2 (low));
1555 /* Similar, but return the largest integer Y such that 2 ** Y is less
1556 than or equal to EXPR. */
1559 tree_floor_log2 (const_tree expr)
1562 HOST_WIDE_INT high, low;
1566 if (TREE_CODE (expr) == COMPLEX_CST)
1567 return tree_log2 (TREE_REALPART (expr));
1569 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1570 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1572 high = TREE_INT_CST_HIGH (expr);
1573 low = TREE_INT_CST_LOW (expr);
1575 /* First clear all bits that are beyond the type's precision in case
1576 we've been sign extended. Ignore if type's precision hasn't been set
1577 since what we are doing is setting it. */
1579 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1581 else if (prec > HOST_BITS_PER_WIDE_INT)
1582 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1586 if (prec < HOST_BITS_PER_WIDE_INT)
1587 low &= ~((HOST_WIDE_INT) (-1) << prec);
1590 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1591 : floor_log2 (low));
1594 /* Return 1 if EXPR is the real constant zero. */
1597 real_zerop (const_tree expr)
1601 return ((TREE_CODE (expr) == REAL_CST
1602 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1603 || (TREE_CODE (expr) == COMPLEX_CST
1604 && real_zerop (TREE_REALPART (expr))
1605 && real_zerop (TREE_IMAGPART (expr))));
1608 /* Return 1 if EXPR is the real constant one in real or complex form. */
1611 real_onep (const_tree expr)
1615 return ((TREE_CODE (expr) == REAL_CST
1616 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1617 || (TREE_CODE (expr) == COMPLEX_CST
1618 && real_onep (TREE_REALPART (expr))
1619 && real_zerop (TREE_IMAGPART (expr))));
1622 /* Return 1 if EXPR is the real constant two. */
1625 real_twop (const_tree expr)
1629 return ((TREE_CODE (expr) == REAL_CST
1630 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1631 || (TREE_CODE (expr) == COMPLEX_CST
1632 && real_twop (TREE_REALPART (expr))
1633 && real_zerop (TREE_IMAGPART (expr))));
1636 /* Return 1 if EXPR is the real constant minus one. */
1639 real_minus_onep (const_tree expr)
1643 return ((TREE_CODE (expr) == REAL_CST
1644 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1645 || (TREE_CODE (expr) == COMPLEX_CST
1646 && real_minus_onep (TREE_REALPART (expr))
1647 && real_zerop (TREE_IMAGPART (expr))));
1650 /* Nonzero if EXP is a constant or a cast of a constant. */
1653 really_constant_p (const_tree exp)
1655 /* This is not quite the same as STRIP_NOPS. It does more. */
1656 while (CONVERT_EXPR_P (exp)
1657 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1658 exp = TREE_OPERAND (exp, 0);
1659 return TREE_CONSTANT (exp);
1662 /* Return first list element whose TREE_VALUE is ELEM.
1663 Return 0 if ELEM is not in LIST. */
1666 value_member (tree elem, tree list)
1670 if (elem == TREE_VALUE (list))
1672 list = TREE_CHAIN (list);
1677 /* Return first list element whose TREE_PURPOSE is ELEM.
1678 Return 0 if ELEM is not in LIST. */
1681 purpose_member (const_tree elem, tree list)
1685 if (elem == TREE_PURPOSE (list))
1687 list = TREE_CHAIN (list);
1692 /* Return nonzero if ELEM is part of the chain CHAIN. */
1695 chain_member (const_tree elem, const_tree chain)
1701 chain = TREE_CHAIN (chain);
1707 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1708 We expect a null pointer to mark the end of the chain.
1709 This is the Lisp primitive `length'. */
1712 list_length (const_tree t)
1715 #ifdef ENABLE_TREE_CHECKING
1723 #ifdef ENABLE_TREE_CHECKING
1726 gcc_assert (p != q);
1734 /* Returns the number of FIELD_DECLs in TYPE. */
1737 fields_length (const_tree type)
1739 tree t = TYPE_FIELDS (type);
1742 for (; t; t = TREE_CHAIN (t))
1743 if (TREE_CODE (t) == FIELD_DECL)
1749 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1750 by modifying the last node in chain 1 to point to chain 2.
1751 This is the Lisp primitive `nconc'. */
1754 chainon (tree op1, tree op2)
1763 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1765 TREE_CHAIN (t1) = op2;
1767 #ifdef ENABLE_TREE_CHECKING
1770 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1771 gcc_assert (t2 != t1);
1778 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1781 tree_last (tree chain)
1785 while ((next = TREE_CHAIN (chain)))
1790 /* Return the node in a chain of nodes whose value is x, NULL if not found. */
1793 tree_find_value (tree chain, tree x)
1796 for (list = chain; list; list = TREE_CHAIN (list))
1797 if (TREE_VALUE (list) == x)
1802 /* Reverse the order of elements in the chain T,
1803 and return the new head of the chain (old last element). */
1808 tree prev = 0, decl, next;
1809 for (decl = t; decl; decl = next)
1811 next = TREE_CHAIN (decl);
1812 TREE_CHAIN (decl) = prev;
1818 /* Return a newly created TREE_LIST node whose
1819 purpose and value fields are PARM and VALUE. */
1822 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1824 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1825 TREE_PURPOSE (t) = parm;
1826 TREE_VALUE (t) = value;
1830 /* Build a chain of TREE_LIST nodes from a vector. */
1833 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
1835 tree ret = NULL_TREE;
1839 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
1841 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
1842 pp = &TREE_CHAIN (*pp);
1847 /* Return a newly created TREE_LIST node whose
1848 purpose and value fields are PURPOSE and VALUE
1849 and whose TREE_CHAIN is CHAIN. */
1852 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1856 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1858 memset (node, 0, sizeof (struct tree_common));
1860 #ifdef GATHER_STATISTICS
1861 tree_node_counts[(int) x_kind]++;
1862 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1865 TREE_SET_CODE (node, TREE_LIST);
1866 TREE_CHAIN (node) = chain;
1867 TREE_PURPOSE (node) = purpose;
1868 TREE_VALUE (node) = value;
1872 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
1875 ctor_to_list (tree ctor)
1877 tree list = NULL_TREE;
1882 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
1884 *p = build_tree_list (purpose, val);
1885 p = &TREE_CHAIN (*p);
1891 /* Return the values of the elements of a CONSTRUCTOR as a vector of
1895 ctor_to_vec (tree ctor)
1897 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
1901 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
1902 VEC_quick_push (tree, vec, val);
1907 /* Return the size nominally occupied by an object of type TYPE
1908 when it resides in memory. The value is measured in units of bytes,
1909 and its data type is that normally used for type sizes
1910 (which is the first type created by make_signed_type or
1911 make_unsigned_type). */
1914 size_in_bytes (const_tree type)
1918 if (type == error_mark_node)
1919 return integer_zero_node;
1921 type = TYPE_MAIN_VARIANT (type);
1922 t = TYPE_SIZE_UNIT (type);
1926 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1927 return size_zero_node;
1933 /* Return the size of TYPE (in bytes) as a wide integer
1934 or return -1 if the size can vary or is larger than an integer. */
1937 int_size_in_bytes (const_tree type)
1941 if (type == error_mark_node)
1944 type = TYPE_MAIN_VARIANT (type);
1945 t = TYPE_SIZE_UNIT (type);
1947 || TREE_CODE (t) != INTEGER_CST
1948 || TREE_INT_CST_HIGH (t) != 0
1949 /* If the result would appear negative, it's too big to represent. */
1950 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1953 return TREE_INT_CST_LOW (t);
1956 /* Return the maximum size of TYPE (in bytes) as a wide integer
1957 or return -1 if the size can vary or is larger than an integer. */
1960 max_int_size_in_bytes (const_tree type)
1962 HOST_WIDE_INT size = -1;
1965 /* If this is an array type, check for a possible MAX_SIZE attached. */
1967 if (TREE_CODE (type) == ARRAY_TYPE)
1969 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1971 if (size_tree && host_integerp (size_tree, 1))
1972 size = tree_low_cst (size_tree, 1);
1975 /* If we still haven't been able to get a size, see if the language
1976 can compute a maximum size. */
1980 size_tree = lang_hooks.types.max_size (type);
1982 if (size_tree && host_integerp (size_tree, 1))
1983 size = tree_low_cst (size_tree, 1);
1989 /* Return the bit position of FIELD, in bits from the start of the record.
1990 This is a tree of type bitsizetype. */
1993 bit_position (const_tree field)
1995 return bit_from_pos (DECL_FIELD_OFFSET (field),
1996 DECL_FIELD_BIT_OFFSET (field));
1999 /* Likewise, but return as an integer. It must be representable in
2000 that way (since it could be a signed value, we don't have the
2001 option of returning -1 like int_size_in_byte can. */
2004 int_bit_position (const_tree field)
2006 return tree_low_cst (bit_position (field), 0);
2009 /* Return the byte position of FIELD, in bytes from the start of the record.
2010 This is a tree of type sizetype. */
2013 byte_position (const_tree field)
2015 return byte_from_pos (DECL_FIELD_OFFSET (field),
2016 DECL_FIELD_BIT_OFFSET (field));
2019 /* Likewise, but return as an integer. It must be representable in
2020 that way (since it could be a signed value, we don't have the
2021 option of returning -1 like int_size_in_byte can. */
2024 int_byte_position (const_tree field)
2026 return tree_low_cst (byte_position (field), 0);
2029 /* Return the strictest alignment, in bits, that T is known to have. */
2032 expr_align (const_tree t)
2034 unsigned int align0, align1;
2036 switch (TREE_CODE (t))
2038 CASE_CONVERT: case NON_LVALUE_EXPR:
2039 /* If we have conversions, we know that the alignment of the
2040 object must meet each of the alignments of the types. */
2041 align0 = expr_align (TREE_OPERAND (t, 0));
2042 align1 = TYPE_ALIGN (TREE_TYPE (t));
2043 return MAX (align0, align1);
2045 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2046 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2047 case CLEANUP_POINT_EXPR:
2048 /* These don't change the alignment of an object. */
2049 return expr_align (TREE_OPERAND (t, 0));
2052 /* The best we can do is say that the alignment is the least aligned
2054 align0 = expr_align (TREE_OPERAND (t, 1));
2055 align1 = expr_align (TREE_OPERAND (t, 2));
2056 return MIN (align0, align1);
2058 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2059 meaningfully, it's always 1. */
2060 case LABEL_DECL: case CONST_DECL:
2061 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2063 gcc_assert (DECL_ALIGN (t) != 0);
2064 return DECL_ALIGN (t);
2070 /* Otherwise take the alignment from that of the type. */
2071 return TYPE_ALIGN (TREE_TYPE (t));
2074 /* Return, as a tree node, the number of elements for TYPE (which is an
2075 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2078 array_type_nelts (const_tree type)
2080 tree index_type, min, max;
2082 /* If they did it with unspecified bounds, then we should have already
2083 given an error about it before we got here. */
2084 if (! TYPE_DOMAIN (type))
2085 return error_mark_node;
2087 index_type = TYPE_DOMAIN (type);
2088 min = TYPE_MIN_VALUE (index_type);
2089 max = TYPE_MAX_VALUE (index_type);
2091 return (integer_zerop (min)
2093 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2096 /* If arg is static -- a reference to an object in static storage -- then
2097 return the object. This is not the same as the C meaning of `static'.
2098 If arg isn't static, return NULL. */
2103 switch (TREE_CODE (arg))
2106 /* Nested functions are static, even though taking their address will
2107 involve a trampoline as we unnest the nested function and create
2108 the trampoline on the tree level. */
2112 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2113 && ! DECL_THREAD_LOCAL_P (arg)
2114 && ! DECL_DLLIMPORT_P (arg)
2118 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2122 return TREE_STATIC (arg) ? arg : NULL;
2129 /* If the thing being referenced is not a field, then it is
2130 something language specific. */
2131 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2133 /* If we are referencing a bitfield, we can't evaluate an
2134 ADDR_EXPR at compile time and so it isn't a constant. */
2135 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2138 return staticp (TREE_OPERAND (arg, 0));
2143 case MISALIGNED_INDIRECT_REF:
2144 case ALIGN_INDIRECT_REF:
2146 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2149 case ARRAY_RANGE_REF:
2150 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2151 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2152 return staticp (TREE_OPERAND (arg, 0));
2156 case COMPOUND_LITERAL_EXPR:
2157 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2167 /* Return whether OP is a DECL whose address is function-invariant. */
2170 decl_address_invariant_p (const_tree op)
2172 /* The conditions below are slightly less strict than the one in
2175 switch (TREE_CODE (op))
2184 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2185 && !DECL_DLLIMPORT_P (op))
2186 || DECL_THREAD_LOCAL_P (op)
2187 || DECL_CONTEXT (op) == current_function_decl
2188 || decl_function_context (op) == current_function_decl)
2193 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2194 || decl_function_context (op) == current_function_decl)
2205 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2208 decl_address_ip_invariant_p (const_tree op)
2210 /* The conditions below are slightly less strict than the one in
2213 switch (TREE_CODE (op))
2221 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2222 && !DECL_DLLIMPORT_P (op))
2223 || DECL_THREAD_LOCAL_P (op))
2228 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2240 /* Return true if T is function-invariant (internal function, does
2241 not handle arithmetic; that's handled in skip_simple_arithmetic and
2242 tree_invariant_p). */
2244 static bool tree_invariant_p (tree t);
2247 tree_invariant_p_1 (tree t)
2251 if (TREE_CONSTANT (t)
2252 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2255 switch (TREE_CODE (t))
2261 op = TREE_OPERAND (t, 0);
2262 while (handled_component_p (op))
2264 switch (TREE_CODE (op))
2267 case ARRAY_RANGE_REF:
2268 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2269 || TREE_OPERAND (op, 2) != NULL_TREE
2270 || TREE_OPERAND (op, 3) != NULL_TREE)
2275 if (TREE_OPERAND (op, 2) != NULL_TREE)
2281 op = TREE_OPERAND (op, 0);
2284 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2293 /* Return true if T is function-invariant. */
2296 tree_invariant_p (tree t)
2298 tree inner = skip_simple_arithmetic (t);
2299 return tree_invariant_p_1 (inner);
2302 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2303 Do this to any expression which may be used in more than one place,
2304 but must be evaluated only once.
2306 Normally, expand_expr would reevaluate the expression each time.
2307 Calling save_expr produces something that is evaluated and recorded
2308 the first time expand_expr is called on it. Subsequent calls to
2309 expand_expr just reuse the recorded value.
2311 The call to expand_expr that generates code that actually computes
2312 the value is the first call *at compile time*. Subsequent calls
2313 *at compile time* generate code to use the saved value.
2314 This produces correct result provided that *at run time* control
2315 always flows through the insns made by the first expand_expr
2316 before reaching the other places where the save_expr was evaluated.
2317 You, the caller of save_expr, must make sure this is so.
2319 Constants, and certain read-only nodes, are returned with no
2320 SAVE_EXPR because that is safe. Expressions containing placeholders
2321 are not touched; see tree.def for an explanation of what these
2325 save_expr (tree expr)
2327 tree t = fold (expr);
2330 /* If the tree evaluates to a constant, then we don't want to hide that
2331 fact (i.e. this allows further folding, and direct checks for constants).
2332 However, a read-only object that has side effects cannot be bypassed.
2333 Since it is no problem to reevaluate literals, we just return the
2335 inner = skip_simple_arithmetic (t);
2336 if (TREE_CODE (inner) == ERROR_MARK)
2339 if (tree_invariant_p_1 (inner))
2342 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2343 it means that the size or offset of some field of an object depends on
2344 the value within another field.
2346 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2347 and some variable since it would then need to be both evaluated once and
2348 evaluated more than once. Front-ends must assure this case cannot
2349 happen by surrounding any such subexpressions in their own SAVE_EXPR
2350 and forcing evaluation at the proper time. */
2351 if (contains_placeholder_p (inner))
2354 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2356 /* This expression might be placed ahead of a jump to ensure that the
2357 value was computed on both sides of the jump. So make sure it isn't
2358 eliminated as dead. */
2359 TREE_SIDE_EFFECTS (t) = 1;
2363 /* Look inside EXPR and into any simple arithmetic operations. Return
2364 the innermost non-arithmetic node. */
2367 skip_simple_arithmetic (tree expr)
2371 /* We don't care about whether this can be used as an lvalue in this
2373 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2374 expr = TREE_OPERAND (expr, 0);
2376 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2377 a constant, it will be more efficient to not make another SAVE_EXPR since
2378 it will allow better simplification and GCSE will be able to merge the
2379 computations if they actually occur. */
2383 if (UNARY_CLASS_P (inner))
2384 inner = TREE_OPERAND (inner, 0);
2385 else if (BINARY_CLASS_P (inner))
2387 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2388 inner = TREE_OPERAND (inner, 0);
2389 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2390 inner = TREE_OPERAND (inner, 1);
2401 /* Return which tree structure is used by T. */
2403 enum tree_node_structure_enum
2404 tree_node_structure (const_tree t)
2406 const enum tree_code code = TREE_CODE (t);
2408 switch (TREE_CODE_CLASS (code))
2410 case tcc_declaration:
2415 return TS_FIELD_DECL;
2417 return TS_PARM_DECL;
2421 return TS_LABEL_DECL;
2423 return TS_RESULT_DECL;
2425 return TS_CONST_DECL;
2427 return TS_TYPE_DECL;
2429 return TS_FUNCTION_DECL;
2431 return TS_DECL_NON_COMMON;
2437 case tcc_comparison:
2440 case tcc_expression:
2444 default: /* tcc_constant and tcc_exceptional */
2449 /* tcc_constant cases. */
2450 case INTEGER_CST: return TS_INT_CST;
2451 case REAL_CST: return TS_REAL_CST;
2452 case FIXED_CST: return TS_FIXED_CST;
2453 case COMPLEX_CST: return TS_COMPLEX;
2454 case VECTOR_CST: return TS_VECTOR;
2455 case STRING_CST: return TS_STRING;
2456 /* tcc_exceptional cases. */
2457 case ERROR_MARK: return TS_COMMON;
2458 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2459 case TREE_LIST: return TS_LIST;
2460 case TREE_VEC: return TS_VEC;
2461 case SSA_NAME: return TS_SSA_NAME;
2462 case PLACEHOLDER_EXPR: return TS_COMMON;
2463 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2464 case BLOCK: return TS_BLOCK;
2465 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2466 case TREE_BINFO: return TS_BINFO;
2467 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2468 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
2469 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
2476 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2477 or offset that depends on a field within a record. */
2480 contains_placeholder_p (const_tree exp)
2482 enum tree_code code;
2487 code = TREE_CODE (exp);
2488 if (code == PLACEHOLDER_EXPR)
2491 switch (TREE_CODE_CLASS (code))
2494 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2495 position computations since they will be converted into a
2496 WITH_RECORD_EXPR involving the reference, which will assume
2497 here will be valid. */
2498 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2500 case tcc_exceptional:
2501 if (code == TREE_LIST)
2502 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2503 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2508 case tcc_comparison:
2509 case tcc_expression:
2513 /* Ignoring the first operand isn't quite right, but works best. */
2514 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2517 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2518 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2519 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2522 /* The save_expr function never wraps anything containing
2523 a PLACEHOLDER_EXPR. */
2530 switch (TREE_CODE_LENGTH (code))
2533 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2535 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2536 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2547 const_call_expr_arg_iterator iter;
2548 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2549 if (CONTAINS_PLACEHOLDER_P (arg))
2563 /* Return true if any part of the computation of TYPE involves a
2564 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2565 (for QUAL_UNION_TYPE) and field positions. */
2568 type_contains_placeholder_1 (const_tree type)
2570 /* If the size contains a placeholder or the parent type (component type in
2571 the case of arrays) type involves a placeholder, this type does. */
2572 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2573 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2574 || (TREE_TYPE (type) != 0
2575 && type_contains_placeholder_p (TREE_TYPE (type))))
2578 /* Now do type-specific checks. Note that the last part of the check above
2579 greatly limits what we have to do below. */
2580 switch (TREE_CODE (type))
2588 case REFERENCE_TYPE:
2596 case FIXED_POINT_TYPE:
2597 /* Here we just check the bounds. */
2598 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2599 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2602 /* We're already checked the component type (TREE_TYPE), so just check
2604 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2608 case QUAL_UNION_TYPE:
2612 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2613 if (TREE_CODE (field) == FIELD_DECL
2614 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2615 || (TREE_CODE (type) == QUAL_UNION_TYPE
2616 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2617 || type_contains_placeholder_p (TREE_TYPE (field))))
2629 type_contains_placeholder_p (tree type)
2633 /* If the contains_placeholder_bits field has been initialized,
2634 then we know the answer. */
2635 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2636 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2638 /* Indicate that we've seen this type node, and the answer is false.
2639 This is what we want to return if we run into recursion via fields. */
2640 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2642 /* Compute the real value. */
2643 result = type_contains_placeholder_1 (type);
2645 /* Store the real value. */
2646 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2651 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2652 return a tree with all occurrences of references to F in a
2653 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2654 contains only arithmetic expressions or a CALL_EXPR with a
2655 PLACEHOLDER_EXPR occurring only in its arglist. */
2658 substitute_in_expr (tree exp, tree f, tree r)
2660 enum tree_code code = TREE_CODE (exp);
2661 tree op0, op1, op2, op3;
2662 tree new_tree, inner;
2664 /* We handle TREE_LIST and COMPONENT_REF separately. */
2665 if (code == TREE_LIST)
2667 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2668 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2669 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2672 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2674 else if (code == COMPONENT_REF)
2676 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2677 and it is the right field, replace it with R. */
2678 for (inner = TREE_OPERAND (exp, 0);
2679 REFERENCE_CLASS_P (inner);
2680 inner = TREE_OPERAND (inner, 0))
2682 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2683 && TREE_OPERAND (exp, 1) == f)
2686 /* If this expression hasn't been completed let, leave it alone. */
2687 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2690 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2691 if (op0 == TREE_OPERAND (exp, 0))
2694 new_tree = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2695 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2698 switch (TREE_CODE_CLASS (code))
2701 case tcc_declaration:
2704 case tcc_exceptional:
2707 case tcc_comparison:
2708 case tcc_expression:
2710 switch (TREE_CODE_LENGTH (code))
2716 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2717 if (op0 == TREE_OPERAND (exp, 0))
2720 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
2724 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2725 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2727 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2730 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2734 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2735 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2736 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2738 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2739 && op2 == TREE_OPERAND (exp, 2))
2742 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2746 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2747 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2748 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2749 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2751 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2752 && op2 == TREE_OPERAND (exp, 2)
2753 && op3 == TREE_OPERAND (exp, 3))
2756 new_tree = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2766 tree copy = NULL_TREE;
2769 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2771 tree op = TREE_OPERAND (exp, i);
2772 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
2776 copy = copy_node (exp);
2777 TREE_OPERAND (copy, i) = new_op;
2782 new_tree = fold (copy);
2792 TREE_READONLY (new_tree) = TREE_READONLY (exp);
2796 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2797 for it within OBJ, a tree that is an object or a chain of references. */
2800 substitute_placeholder_in_expr (tree exp, tree obj)
2802 enum tree_code code = TREE_CODE (exp);
2803 tree op0, op1, op2, op3;
2805 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2806 in the chain of OBJ. */
2807 if (code == PLACEHOLDER_EXPR)
2809 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2812 for (elt = obj; elt != 0;
2813 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2814 || TREE_CODE (elt) == COND_EXPR)
2815 ? TREE_OPERAND (elt, 1)
2816 : (REFERENCE_CLASS_P (elt)
2817 || UNARY_CLASS_P (elt)
2818 || BINARY_CLASS_P (elt)
2819 || VL_EXP_CLASS_P (elt)
2820 || EXPRESSION_CLASS_P (elt))
2821 ? TREE_OPERAND (elt, 0) : 0))
2822 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2825 for (elt = obj; elt != 0;
2826 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2827 || TREE_CODE (elt) == COND_EXPR)
2828 ? TREE_OPERAND (elt, 1)
2829 : (REFERENCE_CLASS_P (elt)
2830 || UNARY_CLASS_P (elt)
2831 || BINARY_CLASS_P (elt)
2832 || VL_EXP_CLASS_P (elt)
2833 || EXPRESSION_CLASS_P (elt))
2834 ? TREE_OPERAND (elt, 0) : 0))
2835 if (POINTER_TYPE_P (TREE_TYPE (elt))
2836 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2838 return fold_build1 (INDIRECT_REF, need_type, elt);
2840 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2841 survives until RTL generation, there will be an error. */
2845 /* TREE_LIST is special because we need to look at TREE_VALUE
2846 and TREE_CHAIN, not TREE_OPERANDS. */
2847 else if (code == TREE_LIST)
2849 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2850 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2851 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2854 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2857 switch (TREE_CODE_CLASS (code))
2860 case tcc_declaration:
2863 case tcc_exceptional:
2866 case tcc_comparison:
2867 case tcc_expression:
2870 switch (TREE_CODE_LENGTH (code))
2876 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2877 if (op0 == TREE_OPERAND (exp, 0))
2880 return fold_build1 (code, TREE_TYPE (exp), op0);
2883 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2884 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2886 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2889 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2892 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2893 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2894 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2896 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2897 && op2 == TREE_OPERAND (exp, 2))
2900 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2903 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2904 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2905 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2906 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2908 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2909 && op2 == TREE_OPERAND (exp, 2)
2910 && op3 == TREE_OPERAND (exp, 3))
2913 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2922 tree copy = NULL_TREE;
2925 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2927 tree op = TREE_OPERAND (exp, i);
2928 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2932 copy = copy_node (exp);
2933 TREE_OPERAND (copy, i) = new_op;
2948 /* Stabilize a reference so that we can use it any number of times
2949 without causing its operands to be evaluated more than once.
2950 Returns the stabilized reference. This works by means of save_expr,
2951 so see the caveats in the comments about save_expr.
2953 Also allows conversion expressions whose operands are references.
2954 Any other kind of expression is returned unchanged. */
2957 stabilize_reference (tree ref)
2960 enum tree_code code = TREE_CODE (ref);
2967 /* No action is needed in this case. */
2972 case FIX_TRUNC_EXPR:
2973 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2977 result = build_nt (INDIRECT_REF,
2978 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2982 result = build_nt (COMPONENT_REF,
2983 stabilize_reference (TREE_OPERAND (ref, 0)),
2984 TREE_OPERAND (ref, 1), NULL_TREE);
2988 result = build_nt (BIT_FIELD_REF,
2989 stabilize_reference (TREE_OPERAND (ref, 0)),
2990 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2991 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2995 result = build_nt (ARRAY_REF,
2996 stabilize_reference (TREE_OPERAND (ref, 0)),
2997 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2998 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3001 case ARRAY_RANGE_REF:
3002 result = build_nt (ARRAY_RANGE_REF,
3003 stabilize_reference (TREE_OPERAND (ref, 0)),
3004 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3005 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3009 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3010 it wouldn't be ignored. This matters when dealing with
3012 return stabilize_reference_1 (ref);
3014 /* If arg isn't a kind of lvalue we recognize, make no change.
3015 Caller should recognize the error for an invalid lvalue. */
3020 return error_mark_node;
3023 TREE_TYPE (result) = TREE_TYPE (ref);
3024 TREE_READONLY (result) = TREE_READONLY (ref);
3025 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3026 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3031 /* Subroutine of stabilize_reference; this is called for subtrees of
3032 references. Any expression with side-effects must be put in a SAVE_EXPR
3033 to ensure that it is only evaluated once.
3035 We don't put SAVE_EXPR nodes around everything, because assigning very
3036 simple expressions to temporaries causes us to miss good opportunities
3037 for optimizations. Among other things, the opportunity to fold in the
3038 addition of a constant into an addressing mode often gets lost, e.g.
3039 "y[i+1] += x;". In general, we take the approach that we should not make
3040 an assignment unless we are forced into it - i.e., that any non-side effect
3041 operator should be allowed, and that cse should take care of coalescing
3042 multiple utterances of the same expression should that prove fruitful. */
3045 stabilize_reference_1 (tree e)
3048 enum tree_code code = TREE_CODE (e);
3050 /* We cannot ignore const expressions because it might be a reference
3051 to a const array but whose index contains side-effects. But we can
3052 ignore things that are actual constant or that already have been
3053 handled by this function. */
3055 if (tree_invariant_p (e))
3058 switch (TREE_CODE_CLASS (code))
3060 case tcc_exceptional:
3062 case tcc_declaration:
3063 case tcc_comparison:
3065 case tcc_expression:
3068 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3069 so that it will only be evaluated once. */
3070 /* The reference (r) and comparison (<) classes could be handled as
3071 below, but it is generally faster to only evaluate them once. */
3072 if (TREE_SIDE_EFFECTS (e))
3073 return save_expr (e);
3077 /* Constants need no processing. In fact, we should never reach
3082 /* Division is slow and tends to be compiled with jumps,
3083 especially the division by powers of 2 that is often
3084 found inside of an array reference. So do it just once. */
3085 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3086 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3087 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3088 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3089 return save_expr (e);
3090 /* Recursively stabilize each operand. */
3091 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3092 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3096 /* Recursively stabilize each operand. */
3097 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3104 TREE_TYPE (result) = TREE_TYPE (e);
3105 TREE_READONLY (result) = TREE_READONLY (e);
3106 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3107 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3112 /* Low-level constructors for expressions. */
3114 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3115 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3118 recompute_tree_invariant_for_addr_expr (tree t)
3121 bool tc = true, se = false;
3123 /* We started out assuming this address is both invariant and constant, but
3124 does not have side effects. Now go down any handled components and see if
3125 any of them involve offsets that are either non-constant or non-invariant.
3126 Also check for side-effects.
3128 ??? Note that this code makes no attempt to deal with the case where
3129 taking the address of something causes a copy due to misalignment. */
3131 #define UPDATE_FLAGS(NODE) \
3132 do { tree _node = (NODE); \
3133 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3134 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3136 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3137 node = TREE_OPERAND (node, 0))
3139 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3140 array reference (probably made temporarily by the G++ front end),
3141 so ignore all the operands. */
3142 if ((TREE_CODE (node) == ARRAY_REF
3143 || TREE_CODE (node) == ARRAY_RANGE_REF)
3144 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3146 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3147 if (TREE_OPERAND (node, 2))
3148 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3149 if (TREE_OPERAND (node, 3))
3150 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3152 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3153 FIELD_DECL, apparently. The G++ front end can put something else
3154 there, at least temporarily. */
3155 else if (TREE_CODE (node) == COMPONENT_REF
3156 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3158 if (TREE_OPERAND (node, 2))
3159 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3161 else if (TREE_CODE (node) == BIT_FIELD_REF)
3162 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3165 node = lang_hooks.expr_to_decl (node, &tc, &se);
3167 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3168 the address, since &(*a)->b is a form of addition. If it's a constant, the
3169 address is constant too. If it's a decl, its address is constant if the
3170 decl is static. Everything else is not constant and, furthermore,
3171 taking the address of a volatile variable is not volatile. */
3172 if (TREE_CODE (node) == INDIRECT_REF)
3173 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3174 else if (CONSTANT_CLASS_P (node))
3176 else if (DECL_P (node))
3177 tc &= (staticp (node) != NULL_TREE);
3181 se |= TREE_SIDE_EFFECTS (node);
3185 TREE_CONSTANT (t) = tc;
3186 TREE_SIDE_EFFECTS (t) = se;
3190 /* Build an expression of code CODE, data type TYPE, and operands as
3191 specified. Expressions and reference nodes can be created this way.
3192 Constants, decls, types and misc nodes cannot be.
3194 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3195 enough for all extant tree codes. */
3198 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3202 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3204 t = make_node_stat (code PASS_MEM_STAT);
3211 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3213 int length = sizeof (struct tree_exp);
3214 #ifdef GATHER_STATISTICS
3215 tree_node_kind kind;
3219 #ifdef GATHER_STATISTICS
3220 switch (TREE_CODE_CLASS (code))
3222 case tcc_statement: /* an expression with side effects */
3225 case tcc_reference: /* a reference */
3233 tree_node_counts[(int) kind]++;
3234 tree_node_sizes[(int) kind] += length;
3237 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3239 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3241 memset (t, 0, sizeof (struct tree_common));
3243 TREE_SET_CODE (t, code);
3245 TREE_TYPE (t) = type;
3246 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3247 TREE_OPERAND (t, 0) = node;
3248 TREE_BLOCK (t) = NULL_TREE;
3249 if (node && !TYPE_P (node))
3251 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3252 TREE_READONLY (t) = TREE_READONLY (node);
3255 if (TREE_CODE_CLASS (code) == tcc_statement)
3256 TREE_SIDE_EFFECTS (t) = 1;
3260 /* All of these have side-effects, no matter what their
3262 TREE_SIDE_EFFECTS (t) = 1;
3263 TREE_READONLY (t) = 0;
3266 case MISALIGNED_INDIRECT_REF:
3267 case ALIGN_INDIRECT_REF:
3269 /* Whether a dereference is readonly has nothing to do with whether
3270 its operand is readonly. */
3271 TREE_READONLY (t) = 0;
3276 recompute_tree_invariant_for_addr_expr (t);
3280 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3281 && node && !TYPE_P (node)
3282 && TREE_CONSTANT (node))
3283 TREE_CONSTANT (t) = 1;
3284 if (TREE_CODE_CLASS (code) == tcc_reference
3285 && node && TREE_THIS_VOLATILE (node))
3286 TREE_THIS_VOLATILE (t) = 1;
3293 #define PROCESS_ARG(N) \
3295 TREE_OPERAND (t, N) = arg##N; \
3296 if (arg##N &&!TYPE_P (arg##N)) \
3298 if (TREE_SIDE_EFFECTS (arg##N)) \
3300 if (!TREE_READONLY (arg##N)) \
3302 if (!TREE_CONSTANT (arg##N)) \
3308 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3310 bool constant, read_only, side_effects;
3313 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3315 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3316 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3317 /* When sizetype precision doesn't match that of pointers
3318 we need to be able to build explicit extensions or truncations
3319 of the offset argument. */
3320 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3321 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3322 && TREE_CODE (arg1) == INTEGER_CST);
3324 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3325 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3326 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3327 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3329 t = make_node_stat (code PASS_MEM_STAT);
3332 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3333 result based on those same flags for the arguments. But if the
3334 arguments aren't really even `tree' expressions, we shouldn't be trying
3337 /* Expressions without side effects may be constant if their
3338 arguments are as well. */
3339 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3340 || TREE_CODE_CLASS (code) == tcc_binary);
3342 side_effects = TREE_SIDE_EFFECTS (t);
3347 TREE_READONLY (t) = read_only;
3348 TREE_CONSTANT (t) = constant;
3349 TREE_SIDE_EFFECTS (t) = side_effects;
3350 TREE_THIS_VOLATILE (t)
3351 = (TREE_CODE_CLASS (code) == tcc_reference
3352 && arg0 && TREE_THIS_VOLATILE (arg0));
3359 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3360 tree arg2 MEM_STAT_DECL)
3362 bool constant, read_only, side_effects;
3365 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3366 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3368 t = make_node_stat (code PASS_MEM_STAT);
3371 /* As a special exception, if COND_EXPR has NULL branches, we
3372 assume that it is a gimple statement and always consider
3373 it to have side effects. */
3374 if (code == COND_EXPR
3375 && tt == void_type_node
3376 && arg1 == NULL_TREE
3377 && arg2 == NULL_TREE)
3378 side_effects = true;
3380 side_effects = TREE_SIDE_EFFECTS (t);
3386 TREE_SIDE_EFFECTS (t) = side_effects;
3387 TREE_THIS_VOLATILE (t)
3388 = (TREE_CODE_CLASS (code) == tcc_reference
3389 && arg0 && TREE_THIS_VOLATILE (arg0));
3395 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3396 tree arg2, tree arg3 MEM_STAT_DECL)
3398 bool constant, read_only, side_effects;
3401 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3403 t = make_node_stat (code PASS_MEM_STAT);
3406 side_effects = TREE_SIDE_EFFECTS (t);
3413 TREE_SIDE_EFFECTS (t) = side_effects;
3414 TREE_THIS_VOLATILE (t)
3415 = (TREE_CODE_CLASS (code) == tcc_reference
3416 && arg0 && TREE_THIS_VOLATILE (arg0));
3422 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3423 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3425 bool constant, read_only, side_effects;
3428 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3430 t = make_node_stat (code PASS_MEM_STAT);
3433 side_effects = TREE_SIDE_EFFECTS (t);
3441 TREE_SIDE_EFFECTS (t) = side_effects;
3442 TREE_THIS_VOLATILE (t)
3443 = (TREE_CODE_CLASS (code) == tcc_reference
3444 && arg0 && TREE_THIS_VOLATILE (arg0));
3450 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3451 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3453 bool constant, read_only, side_effects;
3456 gcc_assert (code == TARGET_MEM_REF);
3458 t = make_node_stat (code PASS_MEM_STAT);
3461 side_effects = TREE_SIDE_EFFECTS (t);
3470 TREE_SIDE_EFFECTS (t) = side_effects;
3471 TREE_THIS_VOLATILE (t) = 0;
3476 /* Similar except don't specify the TREE_TYPE
3477 and leave the TREE_SIDE_EFFECTS as 0.
3478 It is permissible for arguments to be null,
3479 or even garbage if their values do not matter. */
3482 build_nt (enum tree_code code, ...)
3489 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3493 t = make_node (code);
3494 length = TREE_CODE_LENGTH (code);
3496 for (i = 0; i < length; i++)
3497 TREE_OPERAND (t, i) = va_arg (p, tree);
3503 /* Similar to build_nt, but for creating a CALL_EXPR object with
3504 ARGLIST passed as a list. */
3507 build_nt_call_list (tree fn, tree arglist)
3512 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3513 CALL_EXPR_FN (t) = fn;
3514 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3515 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3516 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3520 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3524 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3529 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3530 CALL_EXPR_FN (ret) = fn;
3531 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3532 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3533 CALL_EXPR_ARG (ret, ix) = t;
3537 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3538 We do NOT enter this node in any sort of symbol table.
3540 layout_decl is used to set up the decl's storage layout.
3541 Other slots are initialized to 0 or null pointers. */
3544 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3548 t = make_node_stat (code PASS_MEM_STAT);
3550 /* if (type == error_mark_node)
3551 type = integer_type_node; */
3552 /* That is not done, deliberately, so that having error_mark_node
3553 as the type can suppress useless errors in the use of this variable. */
3555 DECL_NAME (t) = name;
3556 TREE_TYPE (t) = type;
3558 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3564 /* Builds and returns function declaration with NAME and TYPE. */
3567 build_fn_decl (const char *name, tree type)
3569 tree id = get_identifier (name);
3570 tree decl = build_decl (FUNCTION_DECL, id, type);
3572 DECL_EXTERNAL (decl) = 1;
3573 TREE_PUBLIC (decl) = 1;
3574 DECL_ARTIFICIAL (decl) = 1;
3575 TREE_NOTHROW (decl) = 1;
3581 /* BLOCK nodes are used to represent the structure of binding contours
3582 and declarations, once those contours have been exited and their contents
3583 compiled. This information is used for outputting debugging info. */
3586 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3588 tree block = make_node (BLOCK);
3590 BLOCK_VARS (block) = vars;
3591 BLOCK_SUBBLOCKS (block) = subblocks;
3592 BLOCK_SUPERCONTEXT (block) = supercontext;
3593 BLOCK_CHAIN (block) = chain;
3598 expand_location (source_location loc)
3600 expanded_location xloc;
3610 const struct line_map *map = linemap_lookup (line_table, loc);
3611 xloc.file = map->to_file;
3612 xloc.line = SOURCE_LINE (map, loc);
3613 xloc.column = SOURCE_COLUMN (map, loc);
3614 xloc.sysp = map->sysp != 0;
3620 /* Source location accessor functions. */
3624 set_expr_locus (tree node, source_location *loc)
3627 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3629 EXPR_CHECK (node)->exp.locus = *loc;
3632 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3634 LOC is the location to use in tree T. */
3637 protected_set_expr_location (tree t, location_t loc)
3639 if (t && CAN_HAVE_LOCATION_P (t))
3640 SET_EXPR_LOCATION (t, loc);
3643 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3647 build_decl_attribute_variant (tree ddecl, tree attribute)
3649 DECL_ATTRIBUTES (ddecl) = attribute;
3653 /* Borrowed from hashtab.c iterative_hash implementation. */
3654 #define mix(a,b,c) \
3656 a -= b; a -= c; a ^= (c>>13); \
3657 b -= c; b -= a; b ^= (a<< 8); \
3658 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3659 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3660 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3661 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3662 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3663 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3664 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3668 /* Produce good hash value combining VAL and VAL2. */
3670 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3672 /* the golden ratio; an arbitrary value. */
3673 hashval_t a = 0x9e3779b9;
3679 /* Produce good hash value combining VAL and VAL2. */
3680 static inline hashval_t
3681 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3683 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3684 return iterative_hash_hashval_t (val, val2);
3687 hashval_t a = (hashval_t) val;
3688 /* Avoid warnings about shifting of more than the width of the type on
3689 hosts that won't execute this path. */
3691 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3693 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3695 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3696 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3703 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3704 is ATTRIBUTE and its qualifiers are QUALS.
3706 Record such modified types already made so we don't make duplicates. */
3709 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3711 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3713 hashval_t hashcode = 0;
3715 enum tree_code code = TREE_CODE (ttype);
3717 /* Building a distinct copy of a tagged type is inappropriate; it
3718 causes breakage in code that expects there to be a one-to-one
3719 relationship between a struct and its fields.
3720 build_duplicate_type is another solution (as used in
3721 handle_transparent_union_attribute), but that doesn't play well
3722 with the stronger C++ type identity model. */
3723 if (TREE_CODE (ttype) == RECORD_TYPE
3724 || TREE_CODE (ttype) == UNION_TYPE
3725 || TREE_CODE (ttype) == QUAL_UNION_TYPE
3726 || TREE_CODE (ttype) == ENUMERAL_TYPE)
3728 warning (OPT_Wattributes,
3729 "ignoring attributes applied to %qT after definition",
3730 TYPE_MAIN_VARIANT (ttype));
3731 return build_qualified_type (ttype, quals);
3734 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
3735 ntype = build_distinct_type_copy (ttype);
3737 TYPE_ATTRIBUTES (ntype) = attribute;
3739 hashcode = iterative_hash_object (code, hashcode);
3740 if (TREE_TYPE (ntype))
3741 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3743 hashcode = attribute_hash_list (attribute, hashcode);
3745 switch (TREE_CODE (ntype))
3748 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3751 if (TYPE_DOMAIN (ntype))
3752 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3756 hashcode = iterative_hash_object
3757 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3758 hashcode = iterative_hash_object
3759 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3762 case FIXED_POINT_TYPE:
3764 unsigned int precision = TYPE_PRECISION (ntype);
3765 hashcode = iterative_hash_object (precision, hashcode);
3772 ntype = type_hash_canon (hashcode, ntype);
3774 /* If the target-dependent attributes make NTYPE different from
3775 its canonical type, we will need to use structural equality
3776 checks for this type. */
3777 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
3778 || !targetm.comp_type_attributes (ntype, ttype))
3779 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3780 else if (TYPE_CANONICAL (ntype) == ntype)
3781 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
3783 ttype = build_qualified_type (ntype, quals);
3785 else if (TYPE_QUALS (ttype) != quals)
3786 ttype = build_qualified_type (ttype, quals);
3792 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3795 Record such modified types already made so we don't make duplicates. */
3798 build_type_attribute_variant (tree ttype, tree attribute)
3800 return build_type_attribute_qual_variant (ttype, attribute,
3801 TYPE_QUALS (ttype));
3804 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3807 We try both `text' and `__text__', ATTR may be either one. */
3808 /* ??? It might be a reasonable simplification to require ATTR to be only
3809 `text'. One might then also require attribute lists to be stored in
3810 their canonicalized form. */
3813 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
3818 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3821 p = IDENTIFIER_POINTER (ident);
3822 ident_len = IDENTIFIER_LENGTH (ident);
3824 if (ident_len == attr_len
3825 && strcmp (attr, p) == 0)
3828 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3831 gcc_assert (attr[1] == '_');
3832 gcc_assert (attr[attr_len - 2] == '_');
3833 gcc_assert (attr[attr_len - 1] == '_');
3834 if (ident_len == attr_len - 4
3835 && strncmp (attr + 2, p, attr_len - 4) == 0)
3840 if (ident_len == attr_len + 4
3841 && p[0] == '_' && p[1] == '_'
3842 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3843 && strncmp (attr, p + 2, attr_len) == 0)
3850 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3853 We try both `text' and `__text__', ATTR may be either one. */
3856 is_attribute_p (const char *attr, const_tree ident)
3858 return is_attribute_with_length_p (attr, strlen (attr), ident);
3861 /* Given an attribute name and a list of attributes, return a pointer to the
3862 attribute's list element if the attribute is part of the list, or NULL_TREE
3863 if not found. If the attribute appears more than once, this only
3864 returns the first occurrence; the TREE_CHAIN of the return value should
3865 be passed back in if further occurrences are wanted. */
3868 lookup_attribute (const char *attr_name, tree list)
3871 size_t attr_len = strlen (attr_name);
3873 for (l = list; l; l = TREE_CHAIN (l))
3875 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3876 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3882 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3886 remove_attribute (const char *attr_name, tree list)
3889 size_t attr_len = strlen (attr_name);
3891 for (p = &list; *p; )
3894 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3895 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3896 *p = TREE_CHAIN (l);
3898 p = &TREE_CHAIN (l);
3904 /* Return an attribute list that is the union of a1 and a2. */
3907 merge_attributes (tree a1, tree a2)
3911 /* Either one unset? Take the set one. */
3913 if ((attributes = a1) == 0)
3916 /* One that completely contains the other? Take it. */
3918 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3920 if (attribute_list_contained (a2, a1))
3924 /* Pick the longest list, and hang on the other list. */
3926 if (list_length (a1) < list_length (a2))
3927 attributes = a2, a2 = a1;
3929 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3932 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3935 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3938 if (TREE_VALUE (a) != NULL
3939 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3940 && TREE_VALUE (a2) != NULL
3941 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3943 if (simple_cst_list_equal (TREE_VALUE (a),
3944 TREE_VALUE (a2)) == 1)
3947 else if (simple_cst_equal (TREE_VALUE (a),
3948 TREE_VALUE (a2)) == 1)
3953 a1 = copy_node (a2);
3954 TREE_CHAIN (a1) = attributes;
3963 /* Given types T1 and T2, merge their attributes and return
3967 merge_type_attributes (tree t1, tree t2)
3969 return merge_attributes (TYPE_ATTRIBUTES (t1),
3970 TYPE_ATTRIBUTES (t2));
3973 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3977 merge_decl_attributes (tree olddecl, tree newdecl)
3979 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3980 DECL_ATTRIBUTES (newdecl));
3983 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3985 /* Specialization of merge_decl_attributes for various Windows targets.
3987 This handles the following situation:
3989 __declspec (dllimport) int foo;
3992 The second instance of `foo' nullifies the dllimport. */
3995 merge_dllimport_decl_attributes (tree old, tree new_tree)
3998 int delete_dllimport_p = 1;
4000 /* What we need to do here is remove from `old' dllimport if it doesn't
4001 appear in `new'. dllimport behaves like extern: if a declaration is
4002 marked dllimport and a definition appears later, then the object
4003 is not dllimport'd. We also remove a `new' dllimport if the old list
4004 contains dllexport: dllexport always overrides dllimport, regardless
4005 of the order of declaration. */
4006 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
4007 delete_dllimport_p = 0;
4008 else if (DECL_DLLIMPORT_P (new_tree)
4009 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
4011 DECL_DLLIMPORT_P (new_tree) = 0;
4012 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
4013 "dllimport ignored", new_tree);
4015 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
4017 /* Warn about overriding a symbol that has already been used, e.g.:
4018 extern int __attribute__ ((dllimport)) foo;
4019 int* bar () {return &foo;}
4022 if (TREE_USED (old))
4024 warning (0, "%q+D redeclared without dllimport attribute "
4025 "after being referenced with dll linkage", new_tree);
4026 /* If we have used a variable's address with dllimport linkage,
4027 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
4028 decl may already have had TREE_CONSTANT computed.
4029 We still remove the attribute so that assembler code refers
4030 to '&foo rather than '_imp__foo'. */
4031 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
4032 DECL_DLLIMPORT_P (new_tree) = 1;
4035 /* Let an inline definition silently override the external reference,
4036 but otherwise warn about attribute inconsistency. */
4037 else if (TREE_CODE (new_tree) == VAR_DECL
4038 || !DECL_DECLARED_INLINE_P (new_tree))
4039 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
4040 "previous dllimport ignored", new_tree);
4043 delete_dllimport_p = 0;
4045 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
4047 if (delete_dllimport_p)
4050 const size_t attr_len = strlen ("dllimport");
4052 /* Scan the list for dllimport and delete it. */
4053 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
4055 if (is_attribute_with_length_p ("dllimport", attr_len,
4058 if (prev == NULL_TREE)
4061 TREE_CHAIN (prev) = TREE_CHAIN (t);
4070 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4071 struct attribute_spec.handler. */
4074 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4080 /* These attributes may apply to structure and union types being created,
4081 but otherwise should pass to the declaration involved. */
4084 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4085 | (int) ATTR_FLAG_ARRAY_NEXT))
4087 *no_add_attrs = true;
4088 return tree_cons (name, args, NULL_TREE);
4090 if (TREE_CODE (node) == RECORD_TYPE
4091 || TREE_CODE (node) == UNION_TYPE)
4093 node = TYPE_NAME (node);
4099 warning (OPT_Wattributes, "%qE attribute ignored",
4101 *no_add_attrs = true;
4106 if (TREE_CODE (node) != FUNCTION_DECL
4107 && TREE_CODE (node) != VAR_DECL
4108 && TREE_CODE (node) != TYPE_DECL)
4110 *no_add_attrs = true;
4111 warning (OPT_Wattributes, "%qE attribute ignored",
4116 if (TREE_CODE (node) == TYPE_DECL
4117 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
4118 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
4120 *no_add_attrs = true;
4121 warning (OPT_Wattributes, "%qE attribute ignored",
4126 is_dllimport = is_attribute_p ("dllimport", name);
4128 /* Report error on dllimport ambiguities seen now before they cause
4132 /* Honor any target-specific overrides. */
4133 if (!targetm.valid_dllimport_attribute_p (node))
4134 *no_add_attrs = true;
4136 else if (TREE_CODE (node) == FUNCTION_DECL
4137 && DECL_DECLARED_INLINE_P (node))
4139 warning (OPT_Wattributes, "inline function %q+D declared as "
4140 " dllimport: attribute ignored", node);
4141 *no_add_attrs = true;
4143 /* Like MS, treat definition of dllimported variables and
4144 non-inlined functions on declaration as syntax errors. */
4145 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4147 error ("function %q+D definition is marked dllimport", node);
4148 *no_add_attrs = true;
4151 else if (TREE_CODE (node) == VAR_DECL)
4153 if (DECL_INITIAL (node))
4155 error ("variable %q+D definition is marked dllimport",
4157 *no_add_attrs = true;
4160 /* `extern' needn't be specified with dllimport.
4161 Specify `extern' now and hope for the best. Sigh. */
4162 DECL_EXTERNAL (node) = 1;
4163 /* Also, implicitly give dllimport'd variables declared within
4164 a function global scope, unless declared static. */
4165 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4166 TREE_PUBLIC (node) = 1;
4169 if (*no_add_attrs == false)
4170 DECL_DLLIMPORT_P (node) = 1;
4172 else if (TREE_CODE (node) == FUNCTION_DECL
4173 && DECL_DECLARED_INLINE_P (node))
4174 /* An exported function, even if inline, must be emitted. */
4175 DECL_EXTERNAL (node) = 0;
4177 /* Report error if symbol is not accessible at global scope. */
4178 if (!TREE_PUBLIC (node)
4179 && (TREE_CODE (node) == VAR_DECL
4180 || TREE_CODE (node) == FUNCTION_DECL))
4182 error ("external linkage required for symbol %q+D because of "
4183 "%qE attribute", node, name);
4184 *no_add_attrs = true;
4187 /* A dllexport'd entity must have default visibility so that other
4188 program units (shared libraries or the main executable) can see
4189 it. A dllimport'd entity must have default visibility so that
4190 the linker knows that undefined references within this program
4191 unit can be resolved by the dynamic linker. */
4194 if (DECL_VISIBILITY_SPECIFIED (node)
4195 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4196 error ("%qE implies default visibility, but %qD has already "
4197 "been declared with a different visibility",
4199 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4200 DECL_VISIBILITY_SPECIFIED (node) = 1;
4206 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4208 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4209 of the various TYPE_QUAL values. */
4212 set_type_quals (tree type, int type_quals)
4214 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4215 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4216 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4219 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4222 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4224 return (TYPE_QUALS (cand) == type_quals
4225 && TYPE_NAME (cand) == TYPE_NAME (base)
4226 /* Apparently this is needed for Objective-C. */
4227 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4228 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4229 TYPE_ATTRIBUTES (base)));
4232 /* Return a version of the TYPE, qualified as indicated by the
4233 TYPE_QUALS, if one exists. If no qualified version exists yet,
4234 return NULL_TREE. */
4237 get_qualified_type (tree type, int type_quals)
4241 if (TYPE_QUALS (type) == type_quals)
4244 /* Search the chain of variants to see if there is already one there just
4245 like the one we need to have. If so, use that existing one. We must
4246 preserve the TYPE_NAME, since there is code that depends on this. */
4247 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4248 if (check_qualified_type (t, type, type_quals))
4254 /* Like get_qualified_type, but creates the type if it does not
4255 exist. This function never returns NULL_TREE. */
4258 build_qualified_type (tree type, int type_quals)
4262 /* See if we already have the appropriate qualified variant. */
4263 t = get_qualified_type (type, type_quals);
4265 /* If not, build it. */
4268 t = build_variant_type_copy (type);
4269 set_type_quals (t, type_quals);
4271 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4272 /* Propagate structural equality. */
4273 SET_TYPE_STRUCTURAL_EQUALITY (t);
4274 else if (TYPE_CANONICAL (type) != type)
4275 /* Build the underlying canonical type, since it is different
4277 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4280 /* T is its own canonical type. */
4281 TYPE_CANONICAL (t) = t;
4288 /* Create a new distinct copy of TYPE. The new type is made its own
4289 MAIN_VARIANT. If TYPE requires structural equality checks, the
4290 resulting type requires structural equality checks; otherwise, its
4291 TYPE_CANONICAL points to itself. */
4294 build_distinct_type_copy (tree type)
4296 tree t = copy_node (type);
4298 TYPE_POINTER_TO (t) = 0;
4299 TYPE_REFERENCE_TO (t) = 0;
4301 /* Set the canonical type either to a new equivalence class, or
4302 propagate the need for structural equality checks. */
4303 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4304 SET_TYPE_STRUCTURAL_EQUALITY (t);
4306 TYPE_CANONICAL (t) = t;
4308 /* Make it its own variant. */
4309 TYPE_MAIN_VARIANT (t) = t;
4310 TYPE_NEXT_VARIANT (t) = 0;
4312 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4313 whose TREE_TYPE is not t. This can also happen in the Ada
4314 frontend when using subtypes. */
4319 /* Create a new variant of TYPE, equivalent but distinct. This is so
4320 the caller can modify it. TYPE_CANONICAL for the return type will
4321 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4322 are considered equal by the language itself (or that both types
4323 require structural equality checks). */
4326 build_variant_type_copy (tree type)
4328 tree t, m = TYPE_MAIN_VARIANT (type);
4330 t = build_distinct_type_copy (type);
4332 /* Since we're building a variant, assume that it is a non-semantic
4333 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4334 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4336 /* Add the new type to the chain of variants of TYPE. */
4337 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4338 TYPE_NEXT_VARIANT (m) = t;
4339 TYPE_MAIN_VARIANT (t) = m;
4344 /* Return true if the from tree in both tree maps are equal. */
4347 tree_map_base_eq (const void *va, const void *vb)
4349 const struct tree_map_base *const a = (const struct tree_map_base *) va,
4350 *const b = (const struct tree_map_base *) vb;
4351 return (a->from == b->from);
4354 /* Hash a from tree in a tree_map. */
4357 tree_map_base_hash (const void *item)
4359 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4362 /* Return true if this tree map structure is marked for garbage collection
4363 purposes. We simply return true if the from tree is marked, so that this
4364 structure goes away when the from tree goes away. */
4367 tree_map_base_marked_p (const void *p)
4369 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4373 tree_map_hash (const void *item)
4375 return (((const struct tree_map *) item)->hash);
4378 /* Return the initialization priority for DECL. */
4381 decl_init_priority_lookup (tree decl)
4383 struct tree_priority_map *h;
4384 struct tree_map_base in;
4386 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4388 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4389 return h ? h->init : DEFAULT_INIT_PRIORITY;
4392 /* Return the finalization priority for DECL. */
4395 decl_fini_priority_lookup (tree decl)
4397 struct tree_priority_map *h;
4398 struct tree_map_base in;
4400 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4402 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4403 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4406 /* Return the initialization and finalization priority information for
4407 DECL. If there is no previous priority information, a freshly
4408 allocated structure is returned. */
4410 static struct tree_priority_map *
4411 decl_priority_info (tree decl)
4413 struct tree_priority_map in;
4414 struct tree_priority_map *h;
4417 in.base.from = decl;
4418 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4419 h = (struct tree_priority_map *) *loc;
4422 h = GGC_CNEW (struct tree_priority_map);
4424 h->base.from = decl;
4425 h->init = DEFAULT_INIT_PRIORITY;
4426 h->fini = DEFAULT_INIT_PRIORITY;
4432 /* Set the initialization priority for DECL to PRIORITY. */
4435 decl_init_priority_insert (tree decl, priority_type priority)
4437 struct tree_priority_map *h;
4439 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4440 h = decl_priority_info (decl);
4444 /* Set the finalization priority for DECL to PRIORITY. */
4447 decl_fini_priority_insert (tree decl, priority_type priority)
4449 struct tree_priority_map *h;
4451 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4452 h = decl_priority_info (decl);
4456 /* Look up a restrict qualified base decl for FROM. */
4459 decl_restrict_base_lookup (tree from)
4464 in.base.from = from;
4465 h = (struct tree_map *) htab_find_with_hash (restrict_base_for_decl, &in,
4466 htab_hash_pointer (from));
4467 return h ? h->to : NULL_TREE;
4470 /* Record the restrict qualified base TO for FROM. */
4473 decl_restrict_base_insert (tree from, tree to)
4478 h = GGC_NEW (struct tree_map);
4479 h->hash = htab_hash_pointer (from);
4480 h->base.from = from;
4482 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4483 *(struct tree_map **) loc = h;
4486 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4489 print_debug_expr_statistics (void)
4491 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4492 (long) htab_size (debug_expr_for_decl),
4493 (long) htab_elements (debug_expr_for_decl),
4494 htab_collisions (debug_expr_for_decl));
4497 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4500 print_value_expr_statistics (void)
4502 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4503 (long) htab_size (value_expr_for_decl),
4504 (long) htab_elements (value_expr_for_decl),
4505 htab_collisions (value_expr_for_decl));
4508 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4509 don't print anything if the table is empty. */
4512 print_restrict_base_statistics (void)
4514 if (htab_elements (restrict_base_for_decl) != 0)
4516 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4517 (long) htab_size (restrict_base_for_decl),
4518 (long) htab_elements (restrict_base_for_decl),
4519 htab_collisions (restrict_base_for_decl));
4522 /* Lookup a debug expression for FROM, and return it if we find one. */
4525 decl_debug_expr_lookup (tree from)
4527 struct tree_map *h, in;
4528 in.base.from = from;
4530 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
4531 htab_hash_pointer (from));
4537 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4540 decl_debug_expr_insert (tree from, tree to)
4545 h = GGC_NEW (struct tree_map);
4546 h->hash = htab_hash_pointer (from);
4547 h->base.from = from;
4549 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4550 *(struct tree_map **) loc = h;
4553 /* Lookup a value expression for FROM, and return it if we find one. */
4556 decl_value_expr_lookup (tree from)
4558 struct tree_map *h, in;
4559 in.base.from = from;
4561 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
4562 htab_hash_pointer (from));
4568 /* Insert a mapping FROM->TO in the value expression hashtable. */
4571 decl_value_expr_insert (tree from, tree to)
4576 h = GGC_NEW (struct tree_map);
4577 h->hash = htab_hash_pointer (from);
4578 h->base.from = from;
4580 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4581 *(struct tree_map **) loc = h;
4584 /* Hashing of types so that we don't make duplicates.
4585 The entry point is `type_hash_canon'. */
4587 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4588 with types in the TREE_VALUE slots), by adding the hash codes
4589 of the individual types. */
4592 type_hash_list (const_tree list, hashval_t hashcode)
4596 for (tail = list; tail; tail = TREE_CHAIN (tail))
4597 if (TREE_VALUE (tail) != error_mark_node)
4598 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4604 /* These are the Hashtable callback functions. */
4606 /* Returns true iff the types are equivalent. */
4609 type_hash_eq (const void *va, const void *vb)
4611 const struct type_hash *const a = (const struct type_hash *) va,
4612 *const b = (const struct type_hash *) vb;
4614 /* First test the things that are the same for all types. */
4615 if (a->hash != b->hash
4616 || TREE_CODE (a->type) != TREE_CODE (b->type)
4617 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4618 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4619 TYPE_ATTRIBUTES (b->type))
4620 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4621 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
4622 || (TREE_CODE (a->type) != COMPLEX_TYPE
4623 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
4626 switch (TREE_CODE (a->type))
4631 case REFERENCE_TYPE:
4635 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4638 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4639 && !(TYPE_VALUES (a->type)
4640 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4641 && TYPE_VALUES (b->type)
4642 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4643 && type_list_equal (TYPE_VALUES (a->type),
4644 TYPE_VALUES (b->type))))
4647 /* ... fall through ... */
4652 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4653 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4654 TYPE_MAX_VALUE (b->type)))
4655 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4656 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4657 TYPE_MIN_VALUE (b->type))));
4659 case FIXED_POINT_TYPE:
4660 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4663 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4666 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4667 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4668 || (TYPE_ARG_TYPES (a->type)
4669 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4670 && TYPE_ARG_TYPES (b->type)
4671 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4672 && type_list_equal (TYPE_ARG_TYPES (a->type),
4673 TYPE_ARG_TYPES (b->type)))));
4676 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4680 case QUAL_UNION_TYPE:
4681 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4682 || (TYPE_FIELDS (a->type)
4683 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4684 && TYPE_FIELDS (b->type)
4685 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4686 && type_list_equal (TYPE_FIELDS (a->type),
4687 TYPE_FIELDS (b->type))));
4690 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4691 || (TYPE_ARG_TYPES (a->type)
4692 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4693 && TYPE_ARG_TYPES (b->type)
4694 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4695 && type_list_equal (TYPE_ARG_TYPES (a->type),
4696 TYPE_ARG_TYPES (b->type))))
4704 if (lang_hooks.types.type_hash_eq != NULL)
4705 return lang_hooks.types.type_hash_eq (a->type, b->type);
4710 /* Return the cached hash value. */
4713 type_hash_hash (const void *item)
4715 return ((const struct type_hash *) item)->hash;
4718 /* Look in the type hash table for a type isomorphic to TYPE.
4719 If one is found, return it. Otherwise return 0. */
4722 type_hash_lookup (hashval_t hashcode, tree type)
4724 struct type_hash *h, in;
4726 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4727 must call that routine before comparing TYPE_ALIGNs. */
4733 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
4740 /* Add an entry to the type-hash-table
4741 for a type TYPE whose hash code is HASHCODE. */
4744 type_hash_add (hashval_t hashcode, tree type)
4746 struct type_hash *h;
4749 h = GGC_NEW (struct type_hash);
4752 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4756 /* Given TYPE, and HASHCODE its hash code, return the canonical
4757 object for an identical type if one already exists.
4758 Otherwise, return TYPE, and record it as the canonical object.
4760 To use this function, first create a type of the sort you want.
4761 Then compute its hash code from the fields of the type that
4762 make it different from other similar types.
4763 Then call this function and use the value. */
4766 type_hash_canon (unsigned int hashcode, tree type)
4770 /* The hash table only contains main variants, so ensure that's what we're
4772 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4774 if (!lang_hooks.types.hash_types)
4777 /* See if the type is in the hash table already. If so, return it.
4778 Otherwise, add the type. */
4779 t1 = type_hash_lookup (hashcode, type);
4782 #ifdef GATHER_STATISTICS
4783 tree_node_counts[(int) t_kind]--;
4784 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4790 type_hash_add (hashcode, type);
4795 /* See if the data pointed to by the type hash table is marked. We consider
4796 it marked if the type is marked or if a debug type number or symbol
4797 table entry has been made for the type. This reduces the amount of
4798 debugging output and eliminates that dependency of the debug output on
4799 the number of garbage collections. */
4802 type_hash_marked_p (const void *p)
4804 const_tree const type = ((const struct type_hash *) p)->type;
4806 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4810 print_type_hash_statistics (void)
4812 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4813 (long) htab_size (type_hash_table),
4814 (long) htab_elements (type_hash_table),
4815 htab_collisions (type_hash_table));
4818 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4819 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4820 by adding the hash codes of the individual attributes. */
4823 attribute_hash_list (const_tree list, hashval_t hashcode)
4827 for (tail = list; tail; tail = TREE_CHAIN (tail))
4828 /* ??? Do we want to add in TREE_VALUE too? */
4829 hashcode = iterative_hash_object
4830 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4834 /* Given two lists of attributes, return true if list l2 is
4835 equivalent to l1. */
4838 attribute_list_equal (const_tree l1, const_tree l2)
4840 return attribute_list_contained (l1, l2)
4841 && attribute_list_contained (l2, l1);
4844 /* Given two lists of attributes, return true if list L2 is
4845 completely contained within L1. */
4846 /* ??? This would be faster if attribute names were stored in a canonicalized
4847 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4848 must be used to show these elements are equivalent (which they are). */
4849 /* ??? It's not clear that attributes with arguments will always be handled
4853 attribute_list_contained (const_tree l1, const_tree l2)
4857 /* First check the obvious, maybe the lists are identical. */
4861 /* Maybe the lists are similar. */
4862 for (t1 = l1, t2 = l2;
4864 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4865 && TREE_VALUE (t1) == TREE_VALUE (t2);
4866 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4868 /* Maybe the lists are equal. */
4869 if (t1 == 0 && t2 == 0)
4872 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4875 /* This CONST_CAST is okay because lookup_attribute does not
4876 modify its argument and the return value is assigned to a
4878 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4879 CONST_CAST_TREE(l1));
4881 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4884 if (TREE_VALUE (t2) != NULL
4885 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4886 && TREE_VALUE (attr) != NULL
4887 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4889 if (simple_cst_list_equal (TREE_VALUE (t2),
4890 TREE_VALUE (attr)) == 1)
4893 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4904 /* Given two lists of types
4905 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4906 return 1 if the lists contain the same types in the same order.
4907 Also, the TREE_PURPOSEs must match. */
4910 type_list_equal (const_tree l1, const_tree l2)
4914 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4915 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4916 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4917 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4918 && (TREE_TYPE (TREE_PURPOSE (t1))
4919 == TREE_TYPE (TREE_PURPOSE (t2))))))
4925 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4926 given by TYPE. If the argument list accepts variable arguments,
4927 then this function counts only the ordinary arguments. */
4930 type_num_arguments (const_tree type)
4935 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4936 /* If the function does not take a variable number of arguments,
4937 the last element in the list will have type `void'. */
4938 if (VOID_TYPE_P (TREE_VALUE (t)))
4946 /* Nonzero if integer constants T1 and T2
4947 represent the same constant value. */
4950 tree_int_cst_equal (const_tree t1, const_tree t2)
4955 if (t1 == 0 || t2 == 0)
4958 if (TREE_CODE (t1) == INTEGER_CST
4959 && TREE_CODE (t2) == INTEGER_CST
4960 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4961 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4967 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4968 The precise way of comparison depends on their data type. */
4971 tree_int_cst_lt (const_tree t1, const_tree t2)
4976 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4978 int t1_sgn = tree_int_cst_sgn (t1);
4979 int t2_sgn = tree_int_cst_sgn (t2);
4981 if (t1_sgn < t2_sgn)
4983 else if (t1_sgn > t2_sgn)
4985 /* Otherwise, both are non-negative, so we compare them as
4986 unsigned just in case one of them would overflow a signed
4989 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4990 return INT_CST_LT (t1, t2);
4992 return INT_CST_LT_UNSIGNED (t1, t2);
4995 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4998 tree_int_cst_compare (const_tree t1, const_tree t2)
5000 if (tree_int_cst_lt (t1, t2))
5002 else if (tree_int_cst_lt (t2, t1))
5008 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
5009 the host. If POS is zero, the value can be represented in a single
5010 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
5011 be represented in a single unsigned HOST_WIDE_INT. */
5014 host_integerp (const_tree t, int pos)
5016 return (TREE_CODE (t) == INTEGER_CST
5017 && ((TREE_INT_CST_HIGH (t) == 0
5018 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
5019 || (! pos && TREE_INT_CST_HIGH (t) == -1
5020 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
5021 && (!TYPE_UNSIGNED (TREE_TYPE (t))
5022 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
5023 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
5024 || (pos && TREE_INT_CST_HIGH (t) == 0)));
5027 /* Return the HOST_WIDE_INT least significant bits of T if it is an
5028 INTEGER_CST and there is no overflow. POS is nonzero if the result must
5029 be non-negative. We must be able to satisfy the above conditions. */
5032 tree_low_cst (const_tree t, int pos)
5034 gcc_assert (host_integerp (t, pos));
5035 return TREE_INT_CST_LOW (t);
5038 /* Return the most significant bit of the integer constant T. */
5041 tree_int_cst_msb (const_tree t)
5045 unsigned HOST_WIDE_INT l;
5047 /* Note that using TYPE_PRECISION here is wrong. We care about the
5048 actual bits, not the (arbitrary) range of the type. */
5049 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
5050 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
5051 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
5052 return (l & 1) == 1;
5055 /* Return an indication of the sign of the integer constant T.
5056 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
5057 Note that -1 will never be returned if T's type is unsigned. */
5060 tree_int_cst_sgn (const_tree t)
5062 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
5064 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
5066 else if (TREE_INT_CST_HIGH (t) < 0)
5072 /* Return the minimum number of bits needed to represent VALUE in a
5073 signed or unsigned type, UNSIGNEDP says which. */
5076 tree_int_cst_min_precision (tree value, bool unsignedp)
5080 /* If the value is negative, compute its negative minus 1. The latter
5081 adjustment is because the absolute value of the largest negative value
5082 is one larger than the largest positive value. This is equivalent to
5083 a bit-wise negation, so use that operation instead. */
5085 if (tree_int_cst_sgn (value) < 0)
5086 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
5088 /* Return the number of bits needed, taking into account the fact
5089 that we need one more bit for a signed than unsigned type. */
5091 if (integer_zerop (value))
5094 log = tree_floor_log2 (value);
5096 return log + 1 + !unsignedp;
5099 /* Compare two constructor-element-type constants. Return 1 if the lists
5100 are known to be equal; otherwise return 0. */
5103 simple_cst_list_equal (const_tree l1, const_tree l2)
5105 while (l1 != NULL_TREE && l2 != NULL_TREE)
5107 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
5110 l1 = TREE_CHAIN (l1);
5111 l2 = TREE_CHAIN (l2);
5117 /* Return truthvalue of whether T1 is the same tree structure as T2.
5118 Return 1 if they are the same.
5119 Return 0 if they are understandably different.
5120 Return -1 if either contains tree structure not understood by
5124 simple_cst_equal (const_tree t1, const_tree t2)
5126 enum tree_code code1, code2;
5132 if (t1 == 0 || t2 == 0)
5135 code1 = TREE_CODE (t1);
5136 code2 = TREE_CODE (t2);
5138 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
5140 if (CONVERT_EXPR_CODE_P (code2)
5141 || code2 == NON_LVALUE_EXPR)
5142 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5144 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5147 else if (CONVERT_EXPR_CODE_P (code2)
5148 || code2 == NON_LVALUE_EXPR)
5149 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5157 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5158 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5161 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5164 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5167 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5168 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5169 TREE_STRING_LENGTH (t1)));
5173 unsigned HOST_WIDE_INT idx;
5174 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5175 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5177 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5180 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5181 /* ??? Should we handle also fields here? */
5182 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5183 VEC_index (constructor_elt, v2, idx)->value))
5189 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5192 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5195 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5198 const_tree arg1, arg2;
5199 const_call_expr_arg_iterator iter1, iter2;
5200 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5201 arg2 = first_const_call_expr_arg (t2, &iter2);
5203 arg1 = next_const_call_expr_arg (&iter1),
5204 arg2 = next_const_call_expr_arg (&iter2))
5206 cmp = simple_cst_equal (arg1, arg2);
5210 return arg1 == arg2;
5214 /* Special case: if either target is an unallocated VAR_DECL,
5215 it means that it's going to be unified with whatever the
5216 TARGET_EXPR is really supposed to initialize, so treat it
5217 as being equivalent to anything. */
5218 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5219 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5220 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5221 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5222 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5223 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5226 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5231 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5233 case WITH_CLEANUP_EXPR:
5234 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5238 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5241 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5242 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5256 /* This general rule works for most tree codes. All exceptions should be
5257 handled above. If this is a language-specific tree code, we can't
5258 trust what might be in the operand, so say we don't know
5260 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5263 switch (TREE_CODE_CLASS (code1))
5267 case tcc_comparison:
5268 case tcc_expression:
5272 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5274 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5286 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5287 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5288 than U, respectively. */
5291 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5293 if (tree_int_cst_sgn (t) < 0)
5295 else if (TREE_INT_CST_HIGH (t) != 0)
5297 else if (TREE_INT_CST_LOW (t) == u)
5299 else if (TREE_INT_CST_LOW (t) < u)
5305 /* Return true if CODE represents an associative tree code. Otherwise
5308 associative_tree_code (enum tree_code code)
5327 /* Return true if CODE represents a commutative tree code. Otherwise
5330 commutative_tree_code (enum tree_code code)
5343 case UNORDERED_EXPR:
5347 case TRUTH_AND_EXPR:
5348 case TRUTH_XOR_EXPR:
5358 /* Generate a hash value for an expression. This can be used iteratively
5359 by passing a previous result as the VAL argument.
5361 This function is intended to produce the same hash for expressions which
5362 would compare equal using operand_equal_p. */
5365 iterative_hash_expr (const_tree t, hashval_t val)
5368 enum tree_code code;
5372 return iterative_hash_hashval_t (0, val);
5374 code = TREE_CODE (t);
5378 /* Alas, constants aren't shared, so we can't rely on pointer
5381 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5382 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5385 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5387 return iterative_hash_hashval_t (val2, val);
5391 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5393 return iterative_hash_hashval_t (val2, val);
5396 return iterative_hash (TREE_STRING_POINTER (t),
5397 TREE_STRING_LENGTH (t), val);
5399 val = iterative_hash_expr (TREE_REALPART (t), val);
5400 return iterative_hash_expr (TREE_IMAGPART (t), val);
5402 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5405 /* we can just compare by pointer. */
5406 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
5409 /* A list of expressions, for a CALL_EXPR or as the elements of a
5411 for (; t; t = TREE_CHAIN (t))
5412 val = iterative_hash_expr (TREE_VALUE (t), val);
5416 unsigned HOST_WIDE_INT idx;
5418 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5420 val = iterative_hash_expr (field, val);
5421 val = iterative_hash_expr (value, val);
5426 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
5427 Otherwise nodes that compare equal according to operand_equal_p might
5428 get different hash codes. However, don't do this for machine specific
5429 or front end builtins, since the function code is overloaded in those
5431 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
5432 && built_in_decls[DECL_FUNCTION_CODE (t)])
5434 t = built_in_decls[DECL_FUNCTION_CODE (t)];
5435 code = TREE_CODE (t);
5439 tclass = TREE_CODE_CLASS (code);
5441 if (tclass == tcc_declaration)
5443 /* DECL's have a unique ID */
5444 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5448 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
5450 val = iterative_hash_object (code, val);
5452 /* Don't hash the type, that can lead to having nodes which
5453 compare equal according to operand_equal_p, but which
5454 have different hash codes. */
5455 if (CONVERT_EXPR_CODE_P (code)
5456 || code == NON_LVALUE_EXPR)
5458 /* Make sure to include signness in the hash computation. */
5459 val += TYPE_UNSIGNED (TREE_TYPE (t));
5460 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5463 else if (commutative_tree_code (code))
5465 /* It's a commutative expression. We want to hash it the same
5466 however it appears. We do this by first hashing both operands
5467 and then rehashing based on the order of their independent
5469 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5470 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5474 t = one, one = two, two = t;
5476 val = iterative_hash_hashval_t (one, val);
5477 val = iterative_hash_hashval_t (two, val);
5480 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5481 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5488 /* Generate a hash value for a pair of expressions. This can be used
5489 iteratively by passing a previous result as the VAL argument.
5491 The same hash value is always returned for a given pair of expressions,
5492 regardless of the order in which they are presented. This is useful in
5493 hashing the operands of commutative functions. */
5496 iterative_hash_exprs_commutative (const_tree t1,
5497 const_tree t2, hashval_t val)
5499 hashval_t one = iterative_hash_expr (t1, 0);
5500 hashval_t two = iterative_hash_expr (t2, 0);
5504 t = one, one = two, two = t;
5505 val = iterative_hash_hashval_t (one, val);
5506 val = iterative_hash_hashval_t (two, val);
5511 /* Constructors for pointer, array and function types.
5512 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5513 constructed by language-dependent code, not here.) */
5515 /* Construct, lay out and return the type of pointers to TO_TYPE with
5516 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5517 reference all of memory. If such a type has already been
5518 constructed, reuse it. */
5521 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5526 if (to_type == error_mark_node)
5527 return error_mark_node;
5529 /* If the pointed-to type has the may_alias attribute set, force
5530 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5531 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5532 can_alias_all = true;
5534 /* In some cases, languages will have things that aren't a POINTER_TYPE
5535 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5536 In that case, return that type without regard to the rest of our
5539 ??? This is a kludge, but consistent with the way this function has
5540 always operated and there doesn't seem to be a good way to avoid this
5542 if (TYPE_POINTER_TO (to_type) != 0
5543 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5544 return TYPE_POINTER_TO (to_type);
5546 /* First, if we already have a type for pointers to TO_TYPE and it's
5547 the proper mode, use it. */
5548 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5549 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5552 t = make_node (POINTER_TYPE);
5554 TREE_TYPE (t) = to_type;
5555 SET_TYPE_MODE (t, mode);
5556 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5557 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5558 TYPE_POINTER_TO (to_type) = t;
5560 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5561 SET_TYPE_STRUCTURAL_EQUALITY (t);
5562 else if (TYPE_CANONICAL (to_type) != to_type)
5564 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5565 mode, can_alias_all);
5567 /* Lay out the type. This function has many callers that are concerned
5568 with expression-construction, and this simplifies them all. */
5574 /* By default build pointers in ptr_mode. */
5577 build_pointer_type (tree to_type)
5579 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5582 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5585 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5590 if (to_type == error_mark_node)
5591 return error_mark_node;
5593 /* If the pointed-to type has the may_alias attribute set, force
5594 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5595 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5596 can_alias_all = true;
5598 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5599 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5600 In that case, return that type without regard to the rest of our
5603 ??? This is a kludge, but consistent with the way this function has
5604 always operated and there doesn't seem to be a good way to avoid this
5606 if (TYPE_REFERENCE_TO (to_type) != 0
5607 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5608 return TYPE_REFERENCE_TO (to_type);
5610 /* First, if we already have a type for pointers to TO_TYPE and it's
5611 the proper mode, use it. */
5612 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5613 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5616 t = make_node (REFERENCE_TYPE);
5618 TREE_TYPE (t) = to_type;
5619 SET_TYPE_MODE (t, mode);
5620 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5621 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5622 TYPE_REFERENCE_TO (to_type) = t;
5624 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5625 SET_TYPE_STRUCTURAL_EQUALITY (t);
5626 else if (TYPE_CANONICAL (to_type) != to_type)
5628 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5629 mode, can_alias_all);
5637 /* Build the node for the type of references-to-TO_TYPE by default
5641 build_reference_type (tree to_type)
5643 return build_reference_type_for_mode (to_type, ptr_mode, false);
5646 /* Build a type that is compatible with t but has no cv quals anywhere
5649 const char *const *const * -> char ***. */
5652 build_type_no_quals (tree t)
5654 switch (TREE_CODE (t))
5657 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5659 TYPE_REF_CAN_ALIAS_ALL (t));
5660 case REFERENCE_TYPE:
5662 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5664 TYPE_REF_CAN_ALIAS_ALL (t));
5666 return TYPE_MAIN_VARIANT (t);
5670 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5671 MAXVAL should be the maximum value in the domain
5672 (one less than the length of the array).
5674 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5675 We don't enforce this limit, that is up to caller (e.g. language front end).
5676 The limit exists because the result is a signed type and we don't handle
5677 sizes that use more than one HOST_WIDE_INT. */
5680 build_index_type (tree maxval)
5682 tree itype = make_node (INTEGER_TYPE);
5684 TREE_TYPE (itype) = sizetype;
5685 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5686 TYPE_MIN_VALUE (itype) = size_zero_node;
5687 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5688 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
5689 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5690 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5691 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5692 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5694 if (host_integerp (maxval, 1))
5695 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5698 /* Since we cannot hash this type, we need to compare it using
5699 structural equality checks. */
5700 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5705 /* Builds a signed or unsigned integer type of precision PRECISION.
5706 Used for C bitfields whose precision does not match that of
5707 built-in target types. */
5709 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5712 tree itype = make_node (INTEGER_TYPE);
5714 TYPE_PRECISION (itype) = precision;
5717 fixup_unsigned_type (itype);
5719 fixup_signed_type (itype);
5721 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5722 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5727 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5728 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5729 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5732 build_range_type (tree type, tree lowval, tree highval)
5734 tree itype = make_node (INTEGER_TYPE);
5736 TREE_TYPE (itype) = type;
5737 if (type == NULL_TREE)
5740 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5741 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5743 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5744 SET_TYPE_MODE (itype, TYPE_MODE (type));
5745 TYPE_SIZE (itype) = TYPE_SIZE (type);
5746 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5747 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5748 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5750 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5751 return type_hash_canon (tree_low_cst (highval, 0)
5752 - tree_low_cst (lowval, 0),
5758 /* Return true if the debug information for TYPE, a subtype, should be emitted
5759 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
5760 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
5761 debug info and doesn't reflect the source code. */
5764 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
5766 tree base_type = TREE_TYPE (type), low, high;
5768 /* Subrange types have a base type which is an integral type. */
5769 if (!INTEGRAL_TYPE_P (base_type))
5772 /* Get the real bounds of the subtype. */
5773 if (lang_hooks.types.get_subrange_bounds)
5774 lang_hooks.types.get_subrange_bounds (type, &low, &high);
5777 low = TYPE_MIN_VALUE (type);
5778 high = TYPE_MAX_VALUE (type);
5781 /* If the type and its base type have the same representation and the same
5782 name, then the type is not a subrange but a copy of the base type. */
5783 if ((TREE_CODE (base_type) == INTEGER_TYPE
5784 || TREE_CODE (base_type) == BOOLEAN_TYPE)
5785 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
5786 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
5787 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
5789 tree type_name = TYPE_NAME (type);
5790 tree base_type_name = TYPE_NAME (base_type);
5792 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
5793 type_name = DECL_NAME (type_name);
5795 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
5796 base_type_name = DECL_NAME (base_type_name);
5798 if (type_name == base_type_name)
5809 /* Just like build_index_type, but takes lowval and highval instead
5810 of just highval (maxval). */
5813 build_index_2_type (tree lowval, tree highval)
5815 return build_range_type (sizetype, lowval, highval);
5818 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5819 and number of elements specified by the range of values of INDEX_TYPE.
5820 If such a type has already been constructed, reuse it. */
5823 build_array_type (tree elt_type, tree index_type)
5826 hashval_t hashcode = 0;
5828 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5830 error ("arrays of functions are not meaningful");
5831 elt_type = integer_type_node;
5834 t = make_node (ARRAY_TYPE);
5835 TREE_TYPE (t) = elt_type;
5836 TYPE_DOMAIN (t) = index_type;
5838 if (index_type == 0)
5841 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5842 t = type_hash_canon (hashcode, t);
5846 if (TYPE_CANONICAL (t) == t)
5848 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5849 SET_TYPE_STRUCTURAL_EQUALITY (t);
5850 else if (TYPE_CANONICAL (elt_type) != elt_type)
5852 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5858 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5859 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5860 t = type_hash_canon (hashcode, t);
5862 if (!COMPLETE_TYPE_P (t))
5865 if (TYPE_CANONICAL (t) == t)
5867 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5868 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5869 SET_TYPE_STRUCTURAL_EQUALITY (t);
5870 else if (TYPE_CANONICAL (elt_type) != elt_type
5871 || TYPE_CANONICAL (index_type) != index_type)
5873 = build_array_type (TYPE_CANONICAL (elt_type),
5874 TYPE_CANONICAL (index_type));
5880 /* Recursively examines the array elements of TYPE, until a non-array
5881 element type is found. */
5884 strip_array_types (tree type)
5886 while (TREE_CODE (type) == ARRAY_TYPE)
5887 type = TREE_TYPE (type);
5892 /* Computes the canonical argument types from the argument type list
5895 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5896 on entry to this function, or if any of the ARGTYPES are
5899 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5900 true on entry to this function, or if any of the ARGTYPES are
5903 Returns a canonical argument list, which may be ARGTYPES when the
5904 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5905 true) or would not differ from ARGTYPES. */
5908 maybe_canonicalize_argtypes(tree argtypes,
5909 bool *any_structural_p,
5910 bool *any_noncanonical_p)
5913 bool any_noncanonical_argtypes_p = false;
5915 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
5917 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
5918 /* Fail gracefully by stating that the type is structural. */
5919 *any_structural_p = true;
5920 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
5921 *any_structural_p = true;
5922 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
5923 || TREE_PURPOSE (arg))
5924 /* If the argument has a default argument, we consider it
5925 non-canonical even though the type itself is canonical.
5926 That way, different variants of function and method types
5927 with default arguments will all point to the variant with
5928 no defaults as their canonical type. */
5929 any_noncanonical_argtypes_p = true;
5932 if (*any_structural_p)
5935 if (any_noncanonical_argtypes_p)
5937 /* Build the canonical list of argument types. */
5938 tree canon_argtypes = NULL_TREE;
5939 bool is_void = false;
5941 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
5943 if (arg == void_list_node)
5946 canon_argtypes = tree_cons (NULL_TREE,
5947 TYPE_CANONICAL (TREE_VALUE (arg)),
5951 canon_argtypes = nreverse (canon_argtypes);
5953 canon_argtypes = chainon (canon_argtypes, void_list_node);
5955 /* There is a non-canonical type. */
5956 *any_noncanonical_p = true;
5957 return canon_argtypes;
5960 /* The canonical argument types are the same as ARGTYPES. */
5964 /* Construct, lay out and return
5965 the type of functions returning type VALUE_TYPE
5966 given arguments of types ARG_TYPES.
5967 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5968 are data type nodes for the arguments of the function.
5969 If such a type has already been constructed, reuse it. */
5972 build_function_type (tree value_type, tree arg_types)
5975 hashval_t hashcode = 0;
5976 bool any_structural_p, any_noncanonical_p;
5977 tree canon_argtypes;
5979 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5981 error ("function return type cannot be function");
5982 value_type = integer_type_node;
5985 /* Make a node of the sort we want. */
5986 t = make_node (FUNCTION_TYPE);
5987 TREE_TYPE (t) = value_type;
5988 TYPE_ARG_TYPES (t) = arg_types;
5990 /* If we already have such a type, use the old one. */
5991 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5992 hashcode = type_hash_list (arg_types, hashcode);
5993 t = type_hash_canon (hashcode, t);
5995 /* Set up the canonical type. */
5996 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
5997 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
5998 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
6000 &any_noncanonical_p);
6001 if (any_structural_p)
6002 SET_TYPE_STRUCTURAL_EQUALITY (t);
6003 else if (any_noncanonical_p)
6004 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
6007 if (!COMPLETE_TYPE_P (t))
6012 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
6015 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
6017 tree new_type = NULL;
6018 tree args, new_args = NULL, t;
6022 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
6023 args = TREE_CHAIN (args), i++)
6024 if (!bitmap_bit_p (args_to_skip, i))
6025 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
6027 new_reversed = nreverse (new_args);
6031 TREE_CHAIN (new_args) = void_list_node;
6033 new_reversed = void_list_node;
6035 gcc_assert (new_reversed);
6037 /* Use copy_node to preserve as much as possible from original type
6038 (debug info, attribute lists etc.)
6039 Exception is METHOD_TYPEs must have THIS argument.
6040 When we are asked to remove it, we need to build new FUNCTION_TYPE
6042 if (TREE_CODE (orig_type) != METHOD_TYPE
6043 || !bitmap_bit_p (args_to_skip, 0))
6045 new_type = copy_node (orig_type);
6046 TYPE_ARG_TYPES (new_type) = new_reversed;
6051 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
6053 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
6056 /* This is a new type, not a copy of an old type. Need to reassociate
6057 variants. We can handle everything except the main variant lazily. */
6058 t = TYPE_MAIN_VARIANT (orig_type);
6061 TYPE_MAIN_VARIANT (new_type) = t;
6062 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
6063 TYPE_NEXT_VARIANT (t) = new_type;
6067 TYPE_MAIN_VARIANT (new_type) = new_type;
6068 TYPE_NEXT_VARIANT (new_type) = NULL;
6073 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
6075 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
6076 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
6077 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
6080 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
6082 tree new_decl = copy_node (orig_decl);
6085 new_type = TREE_TYPE (orig_decl);
6086 if (prototype_p (new_type))
6087 new_type = build_function_type_skip_args (new_type, args_to_skip);
6088 TREE_TYPE (new_decl) = new_type;
6090 /* For declarations setting DECL_VINDEX (i.e. methods)
6091 we expect first argument to be THIS pointer. */
6092 if (bitmap_bit_p (args_to_skip, 0))
6093 DECL_VINDEX (new_decl) = NULL_TREE;
6097 /* Build a function type. The RETURN_TYPE is the type returned by the
6098 function. If VAARGS is set, no void_type_node is appended to the
6099 the list. ARGP muse be alway be terminated be a NULL_TREE. */
6102 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
6106 t = va_arg (argp, tree);
6107 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
6108 args = tree_cons (NULL_TREE, t, args);
6113 if (args != NULL_TREE)
6114 args = nreverse (args);
6115 gcc_assert (args != NULL_TREE && last != void_list_node);
6117 else if (args == NULL_TREE)
6118 args = void_list_node;
6122 args = nreverse (args);
6123 TREE_CHAIN (last) = void_list_node;
6125 args = build_function_type (return_type, args);
6130 /* Build a function type. The RETURN_TYPE is the type returned by the
6131 function. If additional arguments are provided, they are
6132 additional argument types. The list of argument types must always
6133 be terminated by NULL_TREE. */
6136 build_function_type_list (tree return_type, ...)
6141 va_start (p, return_type);
6142 args = build_function_type_list_1 (false, return_type, p);
6147 /* Build a variable argument function type. The RETURN_TYPE is the
6148 type returned by the function. If additional arguments are provided,
6149 they are additional argument types. The list of argument types must
6150 always be terminated by NULL_TREE. */
6153 build_varargs_function_type_list (tree return_type, ...)
6158 va_start (p, return_type);
6159 args = build_function_type_list_1 (true, return_type, p);
6165 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
6166 and ARGTYPES (a TREE_LIST) are the return type and arguments types
6167 for the method. An implicit additional parameter (of type
6168 pointer-to-BASETYPE) is added to the ARGTYPES. */
6171 build_method_type_directly (tree basetype,
6178 bool any_structural_p, any_noncanonical_p;
6179 tree canon_argtypes;
6181 /* Make a node of the sort we want. */
6182 t = make_node (METHOD_TYPE);
6184 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6185 TREE_TYPE (t) = rettype;
6186 ptype = build_pointer_type (basetype);
6188 /* The actual arglist for this function includes a "hidden" argument
6189 which is "this". Put it into the list of argument types. */
6190 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
6191 TYPE_ARG_TYPES (t) = argtypes;
6193 /* If we already have such a type, use the old one. */
6194 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6195 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
6196 hashcode = type_hash_list (argtypes, hashcode);
6197 t = type_hash_canon (hashcode, t);
6199 /* Set up the canonical type. */
6201 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6202 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
6204 = (TYPE_CANONICAL (basetype) != basetype
6205 || TYPE_CANONICAL (rettype) != rettype);
6206 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
6208 &any_noncanonical_p);
6209 if (any_structural_p)
6210 SET_TYPE_STRUCTURAL_EQUALITY (t);
6211 else if (any_noncanonical_p)
6213 = build_method_type_directly (TYPE_CANONICAL (basetype),
6214 TYPE_CANONICAL (rettype),
6216 if (!COMPLETE_TYPE_P (t))
6222 /* Construct, lay out and return the type of methods belonging to class
6223 BASETYPE and whose arguments and values are described by TYPE.
6224 If that type exists already, reuse it.
6225 TYPE must be a FUNCTION_TYPE node. */
6228 build_method_type (tree basetype, tree type)
6230 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
6232 return build_method_type_directly (basetype,
6234 TYPE_ARG_TYPES (type));
6237 /* Construct, lay out and return the type of offsets to a value
6238 of type TYPE, within an object of type BASETYPE.
6239 If a suitable offset type exists already, reuse it. */
6242 build_offset_type (tree basetype, tree type)
6245 hashval_t hashcode = 0;
6247 /* Make a node of the sort we want. */
6248 t = make_node (OFFSET_TYPE);
6250 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6251 TREE_TYPE (t) = type;
6253 /* If we already have such a type, use the old one. */
6254 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6255 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
6256 t = type_hash_canon (hashcode, t);
6258 if (!COMPLETE_TYPE_P (t))
6261 if (TYPE_CANONICAL (t) == t)
6263 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6264 || TYPE_STRUCTURAL_EQUALITY_P (type))
6265 SET_TYPE_STRUCTURAL_EQUALITY (t);
6266 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
6267 || TYPE_CANONICAL (type) != type)
6269 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
6270 TYPE_CANONICAL (type));
6276 /* Create a complex type whose components are COMPONENT_TYPE. */
6279 build_complex_type (tree component_type)
6284 gcc_assert (INTEGRAL_TYPE_P (component_type)
6285 || SCALAR_FLOAT_TYPE_P (component_type)
6286 || FIXED_POINT_TYPE_P (component_type));
6288 /* Make a node of the sort we want. */
6289 t = make_node (COMPLEX_TYPE);
6291 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
6293 /* If we already have such a type, use the old one. */
6294 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
6295 t = type_hash_canon (hashcode, t);
6297 if (!COMPLETE_TYPE_P (t))
6300 if (TYPE_CANONICAL (t) == t)
6302 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
6303 SET_TYPE_STRUCTURAL_EQUALITY (t);
6304 else if (TYPE_CANONICAL (component_type) != component_type)
6306 = build_complex_type (TYPE_CANONICAL (component_type));
6309 /* We need to create a name, since complex is a fundamental type. */
6310 if (! TYPE_NAME (t))
6313 if (component_type == char_type_node)
6314 name = "complex char";
6315 else if (component_type == signed_char_type_node)
6316 name = "complex signed char";
6317 else if (component_type == unsigned_char_type_node)
6318 name = "complex unsigned char";
6319 else if (component_type == short_integer_type_node)
6320 name = "complex short int";
6321 else if (component_type == short_unsigned_type_node)
6322 name = "complex short unsigned int";
6323 else if (component_type == integer_type_node)
6324 name = "complex int";
6325 else if (component_type == unsigned_type_node)
6326 name = "complex unsigned int";
6327 else if (component_type == long_integer_type_node)
6328 name = "complex long int";
6329 else if (component_type == long_unsigned_type_node)
6330 name = "complex long unsigned int";
6331 else if (component_type == long_long_integer_type_node)
6332 name = "complex long long int";
6333 else if (component_type == long_long_unsigned_type_node)
6334 name = "complex long long unsigned int";
6339 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
6342 return build_qualified_type (t, TYPE_QUALS (component_type));
6345 /* If TYPE is a real or complex floating-point type and the target
6346 does not directly support arithmetic on TYPE then return the wider
6347 type to be used for arithmetic on TYPE. Otherwise, return
6351 excess_precision_type (tree type)
6353 if (flag_excess_precision != EXCESS_PRECISION_FAST)
6355 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
6356 switch (TREE_CODE (type))
6359 switch (flt_eval_method)
6362 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
6363 return double_type_node;
6366 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
6367 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
6368 return long_double_type_node;
6375 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
6377 switch (flt_eval_method)
6380 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
6381 return complex_double_type_node;
6384 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
6385 || (TYPE_MODE (TREE_TYPE (type))
6386 == TYPE_MODE (double_type_node)))
6387 return complex_long_double_type_node;
6400 /* Return OP, stripped of any conversions to wider types as much as is safe.
6401 Converting the value back to OP's type makes a value equivalent to OP.
6403 If FOR_TYPE is nonzero, we return a value which, if converted to
6404 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6406 OP must have integer, real or enumeral type. Pointers are not allowed!
6408 There are some cases where the obvious value we could return
6409 would regenerate to OP if converted to OP's type,
6410 but would not extend like OP to wider types.
6411 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6412 For example, if OP is (unsigned short)(signed char)-1,
6413 we avoid returning (signed char)-1 if FOR_TYPE is int,
6414 even though extending that to an unsigned short would regenerate OP,
6415 since the result of extending (signed char)-1 to (int)
6416 is different from (int) OP. */
6419 get_unwidened (tree op, tree for_type)
6421 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6422 tree type = TREE_TYPE (op);
6424 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6426 = (for_type != 0 && for_type != type
6427 && final_prec > TYPE_PRECISION (type)
6428 && TYPE_UNSIGNED (type));
6431 while (CONVERT_EXPR_P (op))
6435 /* TYPE_PRECISION on vector types has different meaning
6436 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6437 so avoid them here. */
6438 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6441 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6442 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6444 /* Truncations are many-one so cannot be removed.
6445 Unless we are later going to truncate down even farther. */
6447 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6450 /* See what's inside this conversion. If we decide to strip it,
6452 op = TREE_OPERAND (op, 0);
6454 /* If we have not stripped any zero-extensions (uns is 0),
6455 we can strip any kind of extension.
6456 If we have previously stripped a zero-extension,
6457 only zero-extensions can safely be stripped.
6458 Any extension can be stripped if the bits it would produce
6459 are all going to be discarded later by truncating to FOR_TYPE. */
6463 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6465 /* TYPE_UNSIGNED says whether this is a zero-extension.
6466 Let's avoid computing it if it does not affect WIN
6467 and if UNS will not be needed again. */
6469 || CONVERT_EXPR_P (op))
6470 && TYPE_UNSIGNED (TREE_TYPE (op)))
6481 /* Return OP or a simpler expression for a narrower value
6482 which can be sign-extended or zero-extended to give back OP.
6483 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6484 or 0 if the value should be sign-extended. */
6487 get_narrower (tree op, int *unsignedp_ptr)
6492 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6494 while (TREE_CODE (op) == NOP_EXPR)
6497 = (TYPE_PRECISION (TREE_TYPE (op))
6498 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6500 /* Truncations are many-one so cannot be removed. */
6504 /* See what's inside this conversion. If we decide to strip it,
6509 op = TREE_OPERAND (op, 0);
6510 /* An extension: the outermost one can be stripped,
6511 but remember whether it is zero or sign extension. */
6513 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6514 /* Otherwise, if a sign extension has been stripped,
6515 only sign extensions can now be stripped;
6516 if a zero extension has been stripped, only zero-extensions. */
6517 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6521 else /* bitschange == 0 */
6523 /* A change in nominal type can always be stripped, but we must
6524 preserve the unsignedness. */
6526 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6528 op = TREE_OPERAND (op, 0);
6529 /* Keep trying to narrow, but don't assign op to win if it
6530 would turn an integral type into something else. */
6531 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6538 if (TREE_CODE (op) == COMPONENT_REF
6539 /* Since type_for_size always gives an integer type. */
6540 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6541 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6542 /* Ensure field is laid out already. */
6543 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6544 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6546 unsigned HOST_WIDE_INT innerprec
6547 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6548 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6549 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6550 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6552 /* We can get this structure field in a narrower type that fits it,
6553 but the resulting extension to its nominal type (a fullword type)
6554 must satisfy the same conditions as for other extensions.
6556 Do this only for fields that are aligned (not bit-fields),
6557 because when bit-field insns will be used there is no
6558 advantage in doing this. */
6560 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6561 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6562 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6566 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6567 win = fold_convert (type, op);
6571 *unsignedp_ptr = uns;
6575 /* Nonzero if integer constant C has a value that is permissible
6576 for type TYPE (an INTEGER_TYPE). */
6579 int_fits_type_p (const_tree c, const_tree type)
6581 tree type_low_bound, type_high_bound;
6582 bool ok_for_low_bound, ok_for_high_bound, unsc;
6585 dc = tree_to_double_int (c);
6586 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
6588 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
6589 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
6591 /* So c is an unsigned integer whose type is sizetype and type is not.
6592 sizetype'd integers are sign extended even though they are
6593 unsigned. If the integer value fits in the lower end word of c,
6594 and if the higher end word has all its bits set to 1, that
6595 means the higher end bits are set to 1 only for sign extension.
6596 So let's convert c into an equivalent zero extended unsigned
6598 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
6601 type_low_bound = TYPE_MIN_VALUE (type);
6602 type_high_bound = TYPE_MAX_VALUE (type);
6604 /* If at least one bound of the type is a constant integer, we can check
6605 ourselves and maybe make a decision. If no such decision is possible, but
6606 this type is a subtype, try checking against that. Otherwise, use
6607 fit_double_type, which checks against the precision.
6609 Compute the status for each possibly constant bound, and return if we see
6610 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6611 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6612 for "constant known to fit". */
6614 /* Check if c >= type_low_bound. */
6615 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6617 dd = tree_to_double_int (type_low_bound);
6618 if (TREE_CODE (type) == INTEGER_TYPE
6619 && TYPE_IS_SIZETYPE (type)
6620 && TYPE_UNSIGNED (type))
6621 dd = double_int_zext (dd, TYPE_PRECISION (type));
6622 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
6624 int c_neg = (!unsc && double_int_negative_p (dc));
6625 int t_neg = (unsc && double_int_negative_p (dd));
6627 if (c_neg && !t_neg)
6629 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
6632 else if (double_int_cmp (dc, dd, unsc) < 0)
6634 ok_for_low_bound = true;
6637 ok_for_low_bound = false;
6639 /* Check if c <= type_high_bound. */
6640 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6642 dd = tree_to_double_int (type_high_bound);
6643 if (TREE_CODE (type) == INTEGER_TYPE
6644 && TYPE_IS_SIZETYPE (type)
6645 && TYPE_UNSIGNED (type))
6646 dd = double_int_zext (dd, TYPE_PRECISION (type));
6647 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
6649 int c_neg = (!unsc && double_int_negative_p (dc));
6650 int t_neg = (unsc && double_int_negative_p (dd));
6652 if (t_neg && !c_neg)
6654 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
6657 else if (double_int_cmp (dc, dd, unsc) > 0)
6659 ok_for_high_bound = true;
6662 ok_for_high_bound = false;
6664 /* If the constant fits both bounds, the result is known. */
6665 if (ok_for_low_bound && ok_for_high_bound)
6668 /* Perform some generic filtering which may allow making a decision
6669 even if the bounds are not constant. First, negative integers
6670 never fit in unsigned types, */
6671 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
6674 /* Second, narrower types always fit in wider ones. */
6675 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6678 /* Third, unsigned integers with top bit set never fit signed types. */
6679 if (! TYPE_UNSIGNED (type) && unsc)
6681 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
6682 if (prec < HOST_BITS_PER_WIDE_INT)
6684 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
6687 else if (((((unsigned HOST_WIDE_INT) 1)
6688 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
6692 /* If we haven't been able to decide at this point, there nothing more we
6693 can check ourselves here. Look at the base type if we have one and it
6694 has the same precision. */
6695 if (TREE_CODE (type) == INTEGER_TYPE
6696 && TREE_TYPE (type) != 0
6697 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6699 type = TREE_TYPE (type);
6703 /* Or to fit_double_type, if nothing else. */
6704 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
6707 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6708 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6709 represented (assuming two's-complement arithmetic) within the bit
6710 precision of the type are returned instead. */
6713 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6715 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6716 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6717 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6718 TYPE_UNSIGNED (type));
6721 if (TYPE_UNSIGNED (type))
6722 mpz_set_ui (min, 0);
6726 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6727 mn = double_int_sext (double_int_add (mn, double_int_one),
6728 TYPE_PRECISION (type));
6729 mpz_set_double_int (min, mn, false);
6733 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
6734 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
6735 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
6736 TYPE_UNSIGNED (type));
6739 if (TYPE_UNSIGNED (type))
6740 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
6743 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
6748 /* Return true if VAR is an automatic variable defined in function FN. */
6751 auto_var_in_fn_p (const_tree var, const_tree fn)
6753 return (DECL_P (var) && DECL_CONTEXT (var) == fn
6754 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
6755 && ! TREE_STATIC (var))
6756 || TREE_CODE (var) == LABEL_DECL
6757 || TREE_CODE (var) == RESULT_DECL));
6760 /* Subprogram of following function. Called by walk_tree.
6762 Return *TP if it is an automatic variable or parameter of the
6763 function passed in as DATA. */
6766 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6768 tree fn = (tree) data;
6773 else if (DECL_P (*tp)
6774 && auto_var_in_fn_p (*tp, fn))
6780 /* Returns true if T is, contains, or refers to a type with variable
6781 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6782 arguments, but not the return type. If FN is nonzero, only return
6783 true if a modifier of the type or position of FN is a variable or
6784 parameter inside FN.
6786 This concept is more general than that of C99 'variably modified types':
6787 in C99, a struct type is never variably modified because a VLA may not
6788 appear as a structure member. However, in GNU C code like:
6790 struct S { int i[f()]; };
6792 is valid, and other languages may define similar constructs. */
6795 variably_modified_type_p (tree type, tree fn)
6799 /* Test if T is either variable (if FN is zero) or an expression containing
6800 a variable in FN. */
6801 #define RETURN_TRUE_IF_VAR(T) \
6802 do { tree _t = (T); \
6803 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6804 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6805 return true; } while (0)
6807 if (type == error_mark_node)
6810 /* If TYPE itself has variable size, it is variably modified. */
6811 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6812 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6814 switch (TREE_CODE (type))
6817 case REFERENCE_TYPE:
6819 if (variably_modified_type_p (TREE_TYPE (type), fn))
6825 /* If TYPE is a function type, it is variably modified if the
6826 return type is variably modified. */
6827 if (variably_modified_type_p (TREE_TYPE (type), fn))
6833 case FIXED_POINT_TYPE:
6836 /* Scalar types are variably modified if their end points
6838 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6839 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6844 case QUAL_UNION_TYPE:
6845 /* We can't see if any of the fields are variably-modified by the
6846 definition we normally use, since that would produce infinite
6847 recursion via pointers. */
6848 /* This is variably modified if some field's type is. */
6849 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6850 if (TREE_CODE (t) == FIELD_DECL)
6852 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6853 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6854 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6856 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6857 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6862 /* Do not call ourselves to avoid infinite recursion. This is
6863 variably modified if the element type is. */
6864 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6865 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6872 /* The current language may have other cases to check, but in general,
6873 all other types are not variably modified. */
6874 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6876 #undef RETURN_TRUE_IF_VAR
6879 /* Given a DECL or TYPE, return the scope in which it was declared, or
6880 NULL_TREE if there is no containing scope. */
6883 get_containing_scope (const_tree t)
6885 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6888 /* Return the innermost context enclosing DECL that is
6889 a FUNCTION_DECL, or zero if none. */
6892 decl_function_context (const_tree decl)
6896 if (TREE_CODE (decl) == ERROR_MARK)
6899 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6900 where we look up the function at runtime. Such functions always take
6901 a first argument of type 'pointer to real context'.
6903 C++ should really be fixed to use DECL_CONTEXT for the real context,
6904 and use something else for the "virtual context". */
6905 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6908 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6910 context = DECL_CONTEXT (decl);
6912 while (context && TREE_CODE (context) != FUNCTION_DECL)
6914 if (TREE_CODE (context) == BLOCK)
6915 context = BLOCK_SUPERCONTEXT (context);
6917 context = get_containing_scope (context);
6923 /* Return the innermost context enclosing DECL that is
6924 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6925 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6928 decl_type_context (const_tree decl)
6930 tree context = DECL_CONTEXT (decl);
6933 switch (TREE_CODE (context))
6935 case NAMESPACE_DECL:
6936 case TRANSLATION_UNIT_DECL:
6941 case QUAL_UNION_TYPE:
6946 context = DECL_CONTEXT (context);
6950 context = BLOCK_SUPERCONTEXT (context);
6960 /* CALL is a CALL_EXPR. Return the declaration for the function
6961 called, or NULL_TREE if the called function cannot be
6965 get_callee_fndecl (const_tree call)
6969 if (call == error_mark_node)
6970 return error_mark_node;
6972 /* It's invalid to call this function with anything but a
6974 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6976 /* The first operand to the CALL is the address of the function
6978 addr = CALL_EXPR_FN (call);
6982 /* If this is a readonly function pointer, extract its initial value. */
6983 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6984 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6985 && DECL_INITIAL (addr))
6986 addr = DECL_INITIAL (addr);
6988 /* If the address is just `&f' for some function `f', then we know
6989 that `f' is being called. */
6990 if (TREE_CODE (addr) == ADDR_EXPR
6991 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6992 return TREE_OPERAND (addr, 0);
6994 /* We couldn't figure out what was being called. */
6998 /* Print debugging information about tree nodes generated during the compile,
6999 and any language-specific information. */
7002 dump_tree_statistics (void)
7004 #ifdef GATHER_STATISTICS
7006 int total_nodes, total_bytes;
7009 fprintf (stderr, "\n??? tree nodes created\n\n");
7010 #ifdef GATHER_STATISTICS
7011 fprintf (stderr, "Kind Nodes Bytes\n");
7012 fprintf (stderr, "---------------------------------------\n");
7013 total_nodes = total_bytes = 0;
7014 for (i = 0; i < (int) all_kinds; i++)
7016 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
7017 tree_node_counts[i], tree_node_sizes[i]);
7018 total_nodes += tree_node_counts[i];
7019 total_bytes += tree_node_sizes[i];
7021 fprintf (stderr, "---------------------------------------\n");
7022 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
7023 fprintf (stderr, "---------------------------------------\n");
7024 ssanames_print_statistics ();
7025 phinodes_print_statistics ();
7027 fprintf (stderr, "(No per-node statistics)\n");
7029 print_type_hash_statistics ();
7030 print_debug_expr_statistics ();
7031 print_value_expr_statistics ();
7032 print_restrict_base_statistics ();
7033 lang_hooks.print_statistics ();
7036 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
7038 /* Generate a crc32 of a string. */
7041 crc32_string (unsigned chksum, const char *string)
7045 unsigned value = *string << 24;
7048 for (ix = 8; ix--; value <<= 1)
7052 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
7061 /* P is a string that will be used in a symbol. Mask out any characters
7062 that are not valid in that context. */
7065 clean_symbol_name (char *p)
7069 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
7072 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
7079 /* Generate a name for a special-purpose function function.
7080 The generated name may need to be unique across the whole link.
7081 TYPE is some string to identify the purpose of this function to the
7082 linker or collect2; it must start with an uppercase letter,
7084 I - for constructors
7086 N - for C++ anonymous namespaces
7087 F - for DWARF unwind frame information. */
7090 get_file_function_name (const char *type)
7096 /* If we already have a name we know to be unique, just use that. */
7097 if (first_global_object_name)
7098 p = q = ASTRDUP (first_global_object_name);
7099 /* If the target is handling the constructors/destructors, they
7100 will be local to this file and the name is only necessary for
7101 debugging purposes. */
7102 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
7104 const char *file = main_input_filename;
7106 file = input_filename;
7107 /* Just use the file's basename, because the full pathname
7108 might be quite long. */
7109 p = strrchr (file, '/');
7114 p = q = ASTRDUP (p);
7118 /* Otherwise, the name must be unique across the entire link.
7119 We don't have anything that we know to be unique to this translation
7120 unit, so use what we do have and throw in some randomness. */
7122 const char *name = weak_global_object_name;
7123 const char *file = main_input_filename;
7128 file = input_filename;
7130 len = strlen (file);
7131 q = (char *) alloca (9 * 2 + len + 1);
7132 memcpy (q, file, len + 1);
7134 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
7135 crc32_string (0, get_random_seed (false)));
7140 clean_symbol_name (q);
7141 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
7144 /* Set up the name of the file-level functions we may need.
7145 Use a global object (which is already required to be unique over
7146 the program) rather than the file name (which imposes extra
7148 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
7150 return get_identifier (buf);
7153 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
7155 /* Complain that the tree code of NODE does not match the expected 0
7156 terminated list of trailing codes. The trailing code list can be
7157 empty, for a more vague error message. FILE, LINE, and FUNCTION
7158 are of the caller. */
7161 tree_check_failed (const_tree node, const char *file,
7162 int line, const char *function, ...)
7166 unsigned length = 0;
7169 va_start (args, function);
7170 while ((code = va_arg (args, int)))
7171 length += 4 + strlen (tree_code_name[code]);
7176 va_start (args, function);
7177 length += strlen ("expected ");
7178 buffer = tmp = (char *) alloca (length);
7180 while ((code = va_arg (args, int)))
7182 const char *prefix = length ? " or " : "expected ";
7184 strcpy (tmp + length, prefix);
7185 length += strlen (prefix);
7186 strcpy (tmp + length, tree_code_name[code]);
7187 length += strlen (tree_code_name[code]);
7192 buffer = "unexpected node";
7194 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7195 buffer, tree_code_name[TREE_CODE (node)],
7196 function, trim_filename (file), line);
7199 /* Complain that the tree code of NODE does match the expected 0
7200 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
7204 tree_not_check_failed (const_tree node, const char *file,
7205 int line, const char *function, ...)
7209 unsigned length = 0;
7212 va_start (args, function);
7213 while ((code = va_arg (args, int)))
7214 length += 4 + strlen (tree_code_name[code]);
7216 va_start (args, function);
7217 buffer = (char *) alloca (length);
7219 while ((code = va_arg (args, int)))
7223 strcpy (buffer + length, " or ");
7226 strcpy (buffer + length, tree_code_name[code]);
7227 length += strlen (tree_code_name[code]);
7231 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
7232 buffer, tree_code_name[TREE_CODE (node)],
7233 function, trim_filename (file), line);
7236 /* Similar to tree_check_failed, except that we check for a class of tree
7237 code, given in CL. */
7240 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
7241 const char *file, int line, const char *function)
7244 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
7245 TREE_CODE_CLASS_STRING (cl),
7246 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
7247 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7250 /* Similar to tree_check_failed, except that instead of specifying a
7251 dozen codes, use the knowledge that they're all sequential. */
7254 tree_range_check_failed (const_tree node, const char *file, int line,
7255 const char *function, enum tree_code c1,
7259 unsigned length = 0;
7262 for (c = c1; c <= c2; ++c)
7263 length += 4 + strlen (tree_code_name[c]);
7265 length += strlen ("expected ");
7266 buffer = (char *) alloca (length);
7269 for (c = c1; c <= c2; ++c)
7271 const char *prefix = length ? " or " : "expected ";
7273 strcpy (buffer + length, prefix);
7274 length += strlen (prefix);
7275 strcpy (buffer + length, tree_code_name[c]);
7276 length += strlen (tree_code_name[c]);
7279 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7280 buffer, tree_code_name[TREE_CODE (node)],
7281 function, trim_filename (file), line);
7285 /* Similar to tree_check_failed, except that we check that a tree does
7286 not have the specified code, given in CL. */
7289 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
7290 const char *file, int line, const char *function)
7293 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
7294 TREE_CODE_CLASS_STRING (cl),
7295 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
7296 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7300 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
7303 omp_clause_check_failed (const_tree node, const char *file, int line,
7304 const char *function, enum omp_clause_code code)
7306 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
7307 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
7308 function, trim_filename (file), line);
7312 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
7315 omp_clause_range_check_failed (const_tree node, const char *file, int line,
7316 const char *function, enum omp_clause_code c1,
7317 enum omp_clause_code c2)
7320 unsigned length = 0;
7323 for (c = c1; c <= c2; ++c)
7324 length += 4 + strlen (omp_clause_code_name[c]);
7326 length += strlen ("expected ");
7327 buffer = (char *) alloca (length);
7330 for (c = c1; c <= c2; ++c)
7332 const char *prefix = length ? " or " : "expected ";
7334 strcpy (buffer + length, prefix);
7335 length += strlen (prefix);
7336 strcpy (buffer + length, omp_clause_code_name[c]);
7337 length += strlen (omp_clause_code_name[c]);
7340 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7341 buffer, omp_clause_code_name[TREE_CODE (node)],
7342 function, trim_filename (file), line);
7346 #undef DEFTREESTRUCT
7347 #define DEFTREESTRUCT(VAL, NAME) NAME,
7349 static const char *ts_enum_names[] = {
7350 #include "treestruct.def"
7352 #undef DEFTREESTRUCT
7354 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
7356 /* Similar to tree_class_check_failed, except that we check for
7357 whether CODE contains the tree structure identified by EN. */
7360 tree_contains_struct_check_failed (const_tree node,
7361 const enum tree_node_structure_enum en,
7362 const char *file, int line,
7363 const char *function)
7366 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7368 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7372 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7373 (dynamically sized) vector. */
7376 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
7377 const char *function)
7380 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7381 idx + 1, len, function, trim_filename (file), line);
7384 /* Similar to above, except that the check is for the bounds of the operand
7385 vector of an expression node EXP. */
7388 tree_operand_check_failed (int idx, const_tree exp, const char *file,
7389 int line, const char *function)
7391 int code = TREE_CODE (exp);
7393 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7394 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
7395 function, trim_filename (file), line);
7398 /* Similar to above, except that the check is for the number of
7399 operands of an OMP_CLAUSE node. */
7402 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
7403 int line, const char *function)
7406 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7407 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
7408 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
7409 trim_filename (file), line);
7411 #endif /* ENABLE_TREE_CHECKING */
7413 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7414 and mapped to the machine mode MODE. Initialize its fields and build
7415 the information necessary for debugging output. */
7418 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7421 hashval_t hashcode = 0;
7423 /* Build a main variant, based on the main variant of the inner type, then
7424 use it to build the variant we return. */
7425 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7426 && TYPE_MAIN_VARIANT (innertype) != innertype)
7427 return build_type_attribute_qual_variant (
7428 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7429 TYPE_ATTRIBUTES (innertype),
7430 TYPE_QUALS (innertype));
7432 t = make_node (VECTOR_TYPE);
7433 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7434 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7435 SET_TYPE_MODE (t, mode);
7436 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7437 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7439 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7440 SET_TYPE_STRUCTURAL_EQUALITY (t);
7441 else if (TYPE_CANONICAL (innertype) != innertype
7442 || mode != VOIDmode)
7444 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7449 tree index = build_int_cst (NULL_TREE, nunits - 1);
7450 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
7451 build_index_type (index));
7452 tree rt = make_node (RECORD_TYPE);
7454 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
7455 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7457 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7458 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7459 the representation type, and we want to find that die when looking up
7460 the vector type. This is most easily achieved by making the TYPE_UID
7462 TYPE_UID (rt) = TYPE_UID (t);
7465 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7466 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7467 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7468 return type_hash_canon (hashcode, t);
7472 make_or_reuse_type (unsigned size, int unsignedp)
7474 if (size == INT_TYPE_SIZE)
7475 return unsignedp ? unsigned_type_node : integer_type_node;
7476 if (size == CHAR_TYPE_SIZE)
7477 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7478 if (size == SHORT_TYPE_SIZE)
7479 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7480 if (size == LONG_TYPE_SIZE)
7481 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7482 if (size == LONG_LONG_TYPE_SIZE)
7483 return (unsignedp ? long_long_unsigned_type_node
7484 : long_long_integer_type_node);
7487 return make_unsigned_type (size);
7489 return make_signed_type (size);
7492 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7495 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7499 if (size == SHORT_FRACT_TYPE_SIZE)
7500 return unsignedp ? sat_unsigned_short_fract_type_node
7501 : sat_short_fract_type_node;
7502 if (size == FRACT_TYPE_SIZE)
7503 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7504 if (size == LONG_FRACT_TYPE_SIZE)
7505 return unsignedp ? sat_unsigned_long_fract_type_node
7506 : sat_long_fract_type_node;
7507 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7508 return unsignedp ? sat_unsigned_long_long_fract_type_node
7509 : sat_long_long_fract_type_node;
7513 if (size == SHORT_FRACT_TYPE_SIZE)
7514 return unsignedp ? unsigned_short_fract_type_node
7515 : short_fract_type_node;
7516 if (size == FRACT_TYPE_SIZE)
7517 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7518 if (size == LONG_FRACT_TYPE_SIZE)
7519 return unsignedp ? unsigned_long_fract_type_node
7520 : long_fract_type_node;
7521 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7522 return unsignedp ? unsigned_long_long_fract_type_node
7523 : long_long_fract_type_node;
7526 return make_fract_type (size, unsignedp, satp);
7529 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7532 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7536 if (size == SHORT_ACCUM_TYPE_SIZE)
7537 return unsignedp ? sat_unsigned_short_accum_type_node
7538 : sat_short_accum_type_node;
7539 if (size == ACCUM_TYPE_SIZE)
7540 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7541 if (size == LONG_ACCUM_TYPE_SIZE)
7542 return unsignedp ? sat_unsigned_long_accum_type_node
7543 : sat_long_accum_type_node;
7544 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7545 return unsignedp ? sat_unsigned_long_long_accum_type_node
7546 : sat_long_long_accum_type_node;
7550 if (size == SHORT_ACCUM_TYPE_SIZE)
7551 return unsignedp ? unsigned_short_accum_type_node
7552 : short_accum_type_node;
7553 if (size == ACCUM_TYPE_SIZE)
7554 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7555 if (size == LONG_ACCUM_TYPE_SIZE)
7556 return unsignedp ? unsigned_long_accum_type_node
7557 : long_accum_type_node;
7558 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7559 return unsignedp ? unsigned_long_long_accum_type_node
7560 : long_long_accum_type_node;
7563 return make_accum_type (size, unsignedp, satp);
7566 /* Create nodes for all integer types (and error_mark_node) using the sizes
7567 of C datatypes. The caller should call set_sizetype soon after calling
7568 this function to select one of the types as sizetype. */
7571 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7573 error_mark_node = make_node (ERROR_MARK);
7574 TREE_TYPE (error_mark_node) = error_mark_node;
7576 initialize_sizetypes (signed_sizetype);
7578 /* Define both `signed char' and `unsigned char'. */
7579 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7580 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7581 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7582 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7584 /* Define `char', which is like either `signed char' or `unsigned char'
7585 but not the same as either. */
7588 ? make_signed_type (CHAR_TYPE_SIZE)
7589 : make_unsigned_type (CHAR_TYPE_SIZE));
7590 TYPE_STRING_FLAG (char_type_node) = 1;
7592 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7593 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7594 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7595 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7596 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7597 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7598 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7599 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7601 /* Define a boolean type. This type only represents boolean values but
7602 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7603 Front ends which want to override this size (i.e. Java) can redefine
7604 boolean_type_node before calling build_common_tree_nodes_2. */
7605 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7606 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7607 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7608 TYPE_PRECISION (boolean_type_node) = 1;
7610 /* Fill in the rest of the sized types. Reuse existing type nodes
7612 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7613 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7614 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7615 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7616 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7618 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7619 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7620 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7621 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7622 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7624 access_public_node = get_identifier ("public");
7625 access_protected_node = get_identifier ("protected");
7626 access_private_node = get_identifier ("private");
7629 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7630 It will create several other common tree nodes. */
7633 build_common_tree_nodes_2 (int short_double)
7635 /* Define these next since types below may used them. */
7636 integer_zero_node = build_int_cst (NULL_TREE, 0);
7637 integer_one_node = build_int_cst (NULL_TREE, 1);
7638 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7640 size_zero_node = size_int (0);
7641 size_one_node = size_int (1);
7642 bitsize_zero_node = bitsize_int (0);
7643 bitsize_one_node = bitsize_int (1);
7644 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7646 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7647 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7649 void_type_node = make_node (VOID_TYPE);
7650 layout_type (void_type_node);
7652 /* We are not going to have real types in C with less than byte alignment,
7653 so we might as well not have any types that claim to have it. */
7654 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7655 TYPE_USER_ALIGN (void_type_node) = 0;
7657 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7658 layout_type (TREE_TYPE (null_pointer_node));
7660 ptr_type_node = build_pointer_type (void_type_node);
7662 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7663 fileptr_type_node = ptr_type_node;
7665 float_type_node = make_node (REAL_TYPE);
7666 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7667 layout_type (float_type_node);
7669 double_type_node = make_node (REAL_TYPE);
7671 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7673 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7674 layout_type (double_type_node);
7676 long_double_type_node = make_node (REAL_TYPE);
7677 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7678 layout_type (long_double_type_node);
7680 float_ptr_type_node = build_pointer_type (float_type_node);
7681 double_ptr_type_node = build_pointer_type (double_type_node);
7682 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7683 integer_ptr_type_node = build_pointer_type (integer_type_node);
7685 /* Fixed size integer types. */
7686 uint32_type_node = build_nonstandard_integer_type (32, true);
7687 uint64_type_node = build_nonstandard_integer_type (64, true);
7689 /* Decimal float types. */
7690 dfloat32_type_node = make_node (REAL_TYPE);
7691 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7692 layout_type (dfloat32_type_node);
7693 SET_TYPE_MODE (dfloat32_type_node, SDmode);
7694 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7696 dfloat64_type_node = make_node (REAL_TYPE);
7697 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7698 layout_type (dfloat64_type_node);
7699 SET_TYPE_MODE (dfloat64_type_node, DDmode);
7700 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7702 dfloat128_type_node = make_node (REAL_TYPE);
7703 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7704 layout_type (dfloat128_type_node);
7705 SET_TYPE_MODE (dfloat128_type_node, TDmode);
7706 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7708 complex_integer_type_node = build_complex_type (integer_type_node);
7709 complex_float_type_node = build_complex_type (float_type_node);
7710 complex_double_type_node = build_complex_type (double_type_node);
7711 complex_long_double_type_node = build_complex_type (long_double_type_node);
7713 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7714 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
7715 sat_ ## KIND ## _type_node = \
7716 make_sat_signed_ ## KIND ## _type (SIZE); \
7717 sat_unsigned_ ## KIND ## _type_node = \
7718 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7719 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7720 unsigned_ ## KIND ## _type_node = \
7721 make_unsigned_ ## KIND ## _type (SIZE);
7723 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
7724 sat_ ## WIDTH ## KIND ## _type_node = \
7725 make_sat_signed_ ## KIND ## _type (SIZE); \
7726 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7727 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7728 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7729 unsigned_ ## WIDTH ## KIND ## _type_node = \
7730 make_unsigned_ ## KIND ## _type (SIZE);
7732 /* Make fixed-point type nodes based on four different widths. */
7733 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7734 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7735 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
7736 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7737 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7739 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7740 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7741 NAME ## _type_node = \
7742 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7743 u ## NAME ## _type_node = \
7744 make_or_reuse_unsigned_ ## KIND ## _type \
7745 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7746 sat_ ## NAME ## _type_node = \
7747 make_or_reuse_sat_signed_ ## KIND ## _type \
7748 (GET_MODE_BITSIZE (MODE ## mode)); \
7749 sat_u ## NAME ## _type_node = \
7750 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7751 (GET_MODE_BITSIZE (U ## MODE ## mode));
7753 /* Fixed-point type and mode nodes. */
7754 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
7755 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
7756 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
7757 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
7758 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
7759 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
7760 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
7761 MAKE_FIXED_MODE_NODE (accum, ha, HA)
7762 MAKE_FIXED_MODE_NODE (accum, sa, SA)
7763 MAKE_FIXED_MODE_NODE (accum, da, DA)
7764 MAKE_FIXED_MODE_NODE (accum, ta, TA)
7767 tree t = targetm.build_builtin_va_list ();
7769 /* Many back-ends define record types without setting TYPE_NAME.
7770 If we copied the record type here, we'd keep the original
7771 record type without a name. This breaks name mangling. So,
7772 don't copy record types and let c_common_nodes_and_builtins()
7773 declare the type to be __builtin_va_list. */
7774 if (TREE_CODE (t) != RECORD_TYPE)
7775 t = build_variant_type_copy (t);
7777 va_list_type_node = t;
7781 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7784 local_define_builtin (const char *name, tree type, enum built_in_function code,
7785 const char *library_name, int ecf_flags)
7789 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7790 library_name, NULL_TREE);
7791 if (ecf_flags & ECF_CONST)
7792 TREE_READONLY (decl) = 1;
7793 if (ecf_flags & ECF_PURE)
7794 DECL_PURE_P (decl) = 1;
7795 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
7796 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
7797 if (ecf_flags & ECF_NORETURN)
7798 TREE_THIS_VOLATILE (decl) = 1;
7799 if (ecf_flags & ECF_NOTHROW)
7800 TREE_NOTHROW (decl) = 1;
7801 if (ecf_flags & ECF_MALLOC)
7802 DECL_IS_MALLOC (decl) = 1;
7804 built_in_decls[code] = decl;
7805 implicit_built_in_decls[code] = decl;
7808 /* Call this function after instantiating all builtins that the language
7809 front end cares about. This will build the rest of the builtins that
7810 are relied upon by the tree optimizers and the middle-end. */
7813 build_common_builtin_nodes (void)
7817 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7818 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7820 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7821 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7822 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7823 ftype = build_function_type (ptr_type_node, tmp);
7825 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7826 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7827 "memcpy", ECF_NOTHROW);
7828 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7829 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7830 "memmove", ECF_NOTHROW);
7833 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7835 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7836 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7837 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7838 ftype = build_function_type (integer_type_node, tmp);
7839 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7840 "memcmp", ECF_PURE | ECF_NOTHROW);
7843 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7845 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7846 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7847 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7848 ftype = build_function_type (ptr_type_node, tmp);
7849 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7850 "memset", ECF_NOTHROW);
7853 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7855 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7856 ftype = build_function_type (ptr_type_node, tmp);
7857 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7858 "alloca", ECF_NOTHROW | ECF_MALLOC);
7861 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7862 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7863 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7864 ftype = build_function_type (void_type_node, tmp);
7865 local_define_builtin ("__builtin_init_trampoline", ftype,
7866 BUILT_IN_INIT_TRAMPOLINE,
7867 "__builtin_init_trampoline", ECF_NOTHROW);
7869 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7870 ftype = build_function_type (ptr_type_node, tmp);
7871 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7872 BUILT_IN_ADJUST_TRAMPOLINE,
7873 "__builtin_adjust_trampoline",
7874 ECF_CONST | ECF_NOTHROW);
7876 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7877 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7878 ftype = build_function_type (void_type_node, tmp);
7879 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7880 BUILT_IN_NONLOCAL_GOTO,
7881 "__builtin_nonlocal_goto",
7882 ECF_NORETURN | ECF_NOTHROW);
7884 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7885 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7886 ftype = build_function_type (void_type_node, tmp);
7887 local_define_builtin ("__builtin_setjmp_setup", ftype,
7888 BUILT_IN_SETJMP_SETUP,
7889 "__builtin_setjmp_setup", ECF_NOTHROW);
7891 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7892 ftype = build_function_type (ptr_type_node, tmp);
7893 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7894 BUILT_IN_SETJMP_DISPATCHER,
7895 "__builtin_setjmp_dispatcher",
7896 ECF_PURE | ECF_NOTHROW);
7898 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7899 ftype = build_function_type (void_type_node, tmp);
7900 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7901 BUILT_IN_SETJMP_RECEIVER,
7902 "__builtin_setjmp_receiver", ECF_NOTHROW);
7904 ftype = build_function_type (ptr_type_node, void_list_node);
7905 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7906 "__builtin_stack_save", ECF_NOTHROW);
7908 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7909 ftype = build_function_type (void_type_node, tmp);
7910 local_define_builtin ("__builtin_stack_restore", ftype,
7911 BUILT_IN_STACK_RESTORE,
7912 "__builtin_stack_restore", ECF_NOTHROW);
7914 ftype = build_function_type (void_type_node, void_list_node);
7915 local_define_builtin ("__builtin_profile_func_enter", ftype,
7916 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7917 local_define_builtin ("__builtin_profile_func_exit", ftype,
7918 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7920 /* Complex multiplication and division. These are handled as builtins
7921 rather than optabs because emit_library_call_value doesn't support
7922 complex. Further, we can do slightly better with folding these
7923 beasties if the real and complex parts of the arguments are separate. */
7927 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7929 char mode_name_buf[4], *q;
7931 enum built_in_function mcode, dcode;
7932 tree type, inner_type;
7934 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
7937 inner_type = TREE_TYPE (type);
7939 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7940 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7941 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7942 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7943 ftype = build_function_type (type, tmp);
7945 mcode = ((enum built_in_function)
7946 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
7947 dcode = ((enum built_in_function)
7948 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
7950 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7954 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7955 local_define_builtin (built_in_names[mcode], ftype, mcode,
7956 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7958 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7959 local_define_builtin (built_in_names[dcode], ftype, dcode,
7960 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7965 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7968 If we requested a pointer to a vector, build up the pointers that
7969 we stripped off while looking for the inner type. Similarly for
7970 return values from functions.
7972 The argument TYPE is the top of the chain, and BOTTOM is the
7973 new type which we will point to. */
7976 reconstruct_complex_type (tree type, tree bottom)
7980 if (TREE_CODE (type) == POINTER_TYPE)
7982 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7983 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7984 TYPE_REF_CAN_ALIAS_ALL (type));
7986 else if (TREE_CODE (type) == REFERENCE_TYPE)
7988 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7989 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7990 TYPE_REF_CAN_ALIAS_ALL (type));
7992 else if (TREE_CODE (type) == ARRAY_TYPE)
7994 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7995 outer = build_array_type (inner, TYPE_DOMAIN (type));
7997 else if (TREE_CODE (type) == FUNCTION_TYPE)
7999 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8000 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
8002 else if (TREE_CODE (type) == METHOD_TYPE)
8004 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8005 /* The build_method_type_directly() routine prepends 'this' to argument list,
8006 so we must compensate by getting rid of it. */
8008 = build_method_type_directly
8009 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
8011 TREE_CHAIN (TYPE_ARG_TYPES (type)));
8013 else if (TREE_CODE (type) == OFFSET_TYPE)
8015 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
8016 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
8021 return build_qualified_type (outer, TYPE_QUALS (type));
8024 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
8027 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
8031 switch (GET_MODE_CLASS (mode))
8033 case MODE_VECTOR_INT:
8034 case MODE_VECTOR_FLOAT:
8035 case MODE_VECTOR_FRACT:
8036 case MODE_VECTOR_UFRACT:
8037 case MODE_VECTOR_ACCUM:
8038 case MODE_VECTOR_UACCUM:
8039 nunits = GET_MODE_NUNITS (mode);
8043 /* Check that there are no leftover bits. */
8044 gcc_assert (GET_MODE_BITSIZE (mode)
8045 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
8047 nunits = GET_MODE_BITSIZE (mode)
8048 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
8055 return make_vector_type (innertype, nunits, mode);
8058 /* Similarly, but takes the inner type and number of units, which must be
8062 build_vector_type (tree innertype, int nunits)
8064 return make_vector_type (innertype, nunits, VOIDmode);
8067 /* Similarly, but takes the inner type and number of units, which must be
8071 build_opaque_vector_type (tree innertype, int nunits)
8074 innertype = build_distinct_type_copy (innertype);
8075 t = make_vector_type (innertype, nunits, VOIDmode);
8076 TYPE_VECTOR_OPAQUE (t) = true;
8081 /* Build RESX_EXPR with given REGION_NUMBER. */
8083 build_resx (int region_number)
8086 t = build1 (RESX_EXPR, void_type_node,
8087 build_int_cst (NULL_TREE, region_number));
8091 /* Given an initializer INIT, return TRUE if INIT is zero or some
8092 aggregate of zeros. Otherwise return FALSE. */
8094 initializer_zerop (const_tree init)
8100 switch (TREE_CODE (init))
8103 return integer_zerop (init);
8106 /* ??? Note that this is not correct for C4X float formats. There,
8107 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
8108 negative exponent. */
8109 return real_zerop (init)
8110 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
8113 return fixed_zerop (init);
8116 return integer_zerop (init)
8117 || (real_zerop (init)
8118 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
8119 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
8122 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
8123 if (!initializer_zerop (TREE_VALUE (elt)))
8129 unsigned HOST_WIDE_INT idx;
8131 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
8132 if (!initializer_zerop (elt))
8142 /* Build an empty statement. */
8145 build_empty_stmt (void)
8147 return build1 (NOP_EXPR, void_type_node, size_zero_node);
8151 /* Build an OpenMP clause with code CODE. */
8154 build_omp_clause (enum omp_clause_code code)
8159 length = omp_clause_num_ops[code];
8160 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
8162 t = GGC_NEWVAR (union tree_node, size);
8163 memset (t, 0, size);
8164 TREE_SET_CODE (t, OMP_CLAUSE);
8165 OMP_CLAUSE_SET_CODE (t, code);
8167 #ifdef GATHER_STATISTICS
8168 tree_node_counts[(int) omp_clause_kind]++;
8169 tree_node_sizes[(int) omp_clause_kind] += size;
8175 /* Set various status flags when building a CALL_EXPR object T. */
8178 process_call_operands (tree t)
8182 side_effects = TREE_SIDE_EFFECTS (t);
8186 n = TREE_OPERAND_LENGTH (t);
8187 for (i = 1; i < n; i++)
8189 tree op = TREE_OPERAND (t, i);
8190 if (op && TREE_SIDE_EFFECTS (op))
8201 /* Calls have side-effects, except those to const or
8203 i = call_expr_flags (t);
8204 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
8207 TREE_SIDE_EFFECTS (t) = side_effects;
8210 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
8211 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
8212 Except for the CODE and operand count field, other storage for the
8213 object is initialized to zeros. */
8216 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
8219 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
8221 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
8222 gcc_assert (len >= 1);
8224 #ifdef GATHER_STATISTICS
8225 tree_node_counts[(int) e_kind]++;
8226 tree_node_sizes[(int) e_kind] += length;
8229 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
8231 memset (t, 0, length);
8233 TREE_SET_CODE (t, code);
8235 /* Can't use TREE_OPERAND to store the length because if checking is
8236 enabled, it will try to check the length before we store it. :-P */
8237 t->exp.operands[0] = build_int_cst (sizetype, len);
8243 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
8244 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
8248 build_call_list (tree return_type, tree fn, tree arglist)
8253 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
8254 TREE_TYPE (t) = return_type;
8255 CALL_EXPR_FN (t) = fn;
8256 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8257 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
8258 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
8259 process_call_operands (t);
8263 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8264 FN and a null static chain slot. NARGS is the number of call arguments
8265 which are specified as "..." arguments. */
8268 build_call_nary (tree return_type, tree fn, int nargs, ...)
8272 va_start (args, nargs);
8273 ret = build_call_valist (return_type, fn, nargs, args);
8278 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8279 FN and a null static chain slot. NARGS is the number of call arguments
8280 which are specified as a va_list ARGS. */
8283 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
8288 t = build_vl_exp (CALL_EXPR, nargs + 3);
8289 TREE_TYPE (t) = return_type;
8290 CALL_EXPR_FN (t) = fn;
8291 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8292 for (i = 0; i < nargs; i++)
8293 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
8294 process_call_operands (t);
8298 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8299 FN and a null static chain slot. NARGS is the number of call arguments
8300 which are specified as a tree array ARGS. */
8303 build_call_array (tree return_type, tree fn, int nargs, const tree *args)
8308 t = build_vl_exp (CALL_EXPR, nargs + 3);
8309 TREE_TYPE (t) = return_type;
8310 CALL_EXPR_FN (t) = fn;
8311 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
8312 for (i = 0; i < nargs; i++)
8313 CALL_EXPR_ARG (t, i) = args[i];
8314 process_call_operands (t);
8318 /* Like build_call_array, but takes a VEC. */
8321 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
8326 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
8327 TREE_TYPE (ret) = return_type;
8328 CALL_EXPR_FN (ret) = fn;
8329 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
8330 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
8331 CALL_EXPR_ARG (ret, ix) = t;
8332 process_call_operands (ret);
8337 /* Returns true if it is possible to prove that the index of
8338 an array access REF (an ARRAY_REF expression) falls into the
8342 in_array_bounds_p (tree ref)
8344 tree idx = TREE_OPERAND (ref, 1);
8347 if (TREE_CODE (idx) != INTEGER_CST)
8350 min = array_ref_low_bound (ref);
8351 max = array_ref_up_bound (ref);
8354 || TREE_CODE (min) != INTEGER_CST
8355 || TREE_CODE (max) != INTEGER_CST)
8358 if (tree_int_cst_lt (idx, min)
8359 || tree_int_cst_lt (max, idx))
8365 /* Returns true if it is possible to prove that the range of
8366 an array access REF (an ARRAY_RANGE_REF expression) falls
8367 into the array bounds. */
8370 range_in_array_bounds_p (tree ref)
8372 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
8373 tree range_min, range_max, min, max;
8375 range_min = TYPE_MIN_VALUE (domain_type);
8376 range_max = TYPE_MAX_VALUE (domain_type);
8379 || TREE_CODE (range_min) != INTEGER_CST
8380 || TREE_CODE (range_max) != INTEGER_CST)
8383 min = array_ref_low_bound (ref);
8384 max = array_ref_up_bound (ref);
8387 || TREE_CODE (min) != INTEGER_CST
8388 || TREE_CODE (max) != INTEGER_CST)
8391 if (tree_int_cst_lt (range_min, min)
8392 || tree_int_cst_lt (max, range_max))
8398 /* Return true if T (assumed to be a DECL) must be assigned a memory
8402 needs_to_live_in_memory (const_tree t)
8404 if (TREE_CODE (t) == SSA_NAME)
8405 t = SSA_NAME_VAR (t);
8407 return (TREE_ADDRESSABLE (t)
8408 || is_global_var (t)
8409 || (TREE_CODE (t) == RESULT_DECL
8410 && aggregate_value_p (t, current_function_decl)));
8413 /* There are situations in which a language considers record types
8414 compatible which have different field lists. Decide if two fields
8415 are compatible. It is assumed that the parent records are compatible. */
8418 fields_compatible_p (const_tree f1, const_tree f2)
8420 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
8421 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
8424 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
8425 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
8428 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
8434 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8437 find_compatible_field (tree record, tree orig_field)
8441 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
8442 if (TREE_CODE (f) == FIELD_DECL
8443 && fields_compatible_p (f, orig_field))
8446 /* ??? Why isn't this on the main fields list? */
8447 f = TYPE_VFIELD (record);
8448 if (f && TREE_CODE (f) == FIELD_DECL
8449 && fields_compatible_p (f, orig_field))
8452 /* ??? We should abort here, but Java appears to do Bad Things
8453 with inherited fields. */
8457 /* Return value of a constant X and sign-extend it. */
8460 int_cst_value (const_tree x)
8462 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8463 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8465 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8466 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8467 || TREE_INT_CST_HIGH (x) == -1);
8469 if (bits < HOST_BITS_PER_WIDE_INT)
8471 bool negative = ((val >> (bits - 1)) & 1) != 0;
8473 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8475 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8481 /* If TYPE is an integral type, return an equivalent type which is
8482 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8483 return TYPE itself. */
8486 signed_or_unsigned_type_for (int unsignedp, tree type)
8489 if (POINTER_TYPE_P (type))
8492 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8495 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8498 /* Returns unsigned variant of TYPE. */
8501 unsigned_type_for (tree type)
8503 return signed_or_unsigned_type_for (1, type);
8506 /* Returns signed variant of TYPE. */
8509 signed_type_for (tree type)
8511 return signed_or_unsigned_type_for (0, type);
8514 /* Returns the largest value obtainable by casting something in INNER type to
8518 upper_bound_in_type (tree outer, tree inner)
8520 unsigned HOST_WIDE_INT lo, hi;
8521 unsigned int det = 0;
8522 unsigned oprec = TYPE_PRECISION (outer);
8523 unsigned iprec = TYPE_PRECISION (inner);
8526 /* Compute a unique number for every combination. */
8527 det |= (oprec > iprec) ? 4 : 0;
8528 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8529 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8531 /* Determine the exponent to use. */
8536 /* oprec <= iprec, outer: signed, inner: don't care. */
8541 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8545 /* oprec > iprec, outer: signed, inner: signed. */
8549 /* oprec > iprec, outer: signed, inner: unsigned. */
8553 /* oprec > iprec, outer: unsigned, inner: signed. */
8557 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8564 /* Compute 2^^prec - 1. */
8565 if (prec <= HOST_BITS_PER_WIDE_INT)
8568 lo = ((~(unsigned HOST_WIDE_INT) 0)
8569 >> (HOST_BITS_PER_WIDE_INT - prec));
8573 hi = ((~(unsigned HOST_WIDE_INT) 0)
8574 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8575 lo = ~(unsigned HOST_WIDE_INT) 0;
8578 return build_int_cst_wide (outer, lo, hi);
8581 /* Returns the smallest value obtainable by casting something in INNER type to
8585 lower_bound_in_type (tree outer, tree inner)
8587 unsigned HOST_WIDE_INT lo, hi;
8588 unsigned oprec = TYPE_PRECISION (outer);
8589 unsigned iprec = TYPE_PRECISION (inner);
8591 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8593 if (TYPE_UNSIGNED (outer)
8594 /* If we are widening something of an unsigned type, OUTER type
8595 contains all values of INNER type. In particular, both INNER
8596 and OUTER types have zero in common. */
8597 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8601 /* If we are widening a signed type to another signed type, we
8602 want to obtain -2^^(iprec-1). If we are keeping the
8603 precision or narrowing to a signed type, we want to obtain
8605 unsigned prec = oprec > iprec ? iprec : oprec;
8607 if (prec <= HOST_BITS_PER_WIDE_INT)
8609 hi = ~(unsigned HOST_WIDE_INT) 0;
8610 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8614 hi = ((~(unsigned HOST_WIDE_INT) 0)
8615 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8620 return build_int_cst_wide (outer, lo, hi);
8623 /* Return nonzero if two operands that are suitable for PHI nodes are
8624 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8625 SSA_NAME or invariant. Note that this is strictly an optimization.
8626 That is, callers of this function can directly call operand_equal_p
8627 and get the same result, only slower. */
8630 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8634 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8636 return operand_equal_p (arg0, arg1, 0);
8639 /* Returns number of zeros at the end of binary representation of X.
8641 ??? Use ffs if available? */
8644 num_ending_zeros (const_tree x)
8646 unsigned HOST_WIDE_INT fr, nfr;
8647 unsigned num, abits;
8648 tree type = TREE_TYPE (x);
8650 if (TREE_INT_CST_LOW (x) == 0)
8652 num = HOST_BITS_PER_WIDE_INT;
8653 fr = TREE_INT_CST_HIGH (x);
8658 fr = TREE_INT_CST_LOW (x);
8661 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8664 if (nfr << abits == fr)
8671 if (num > TYPE_PRECISION (type))
8672 num = TYPE_PRECISION (type);
8674 return build_int_cst_type (type, num);
8678 #define WALK_SUBTREE(NODE) \
8681 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8687 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8688 be walked whenever a type is seen in the tree. Rest of operands and return
8689 value are as for walk_tree. */
8692 walk_type_fields (tree type, walk_tree_fn func, void *data,
8693 struct pointer_set_t *pset, walk_tree_lh lh)
8695 tree result = NULL_TREE;
8697 switch (TREE_CODE (type))
8700 case REFERENCE_TYPE:
8701 /* We have to worry about mutually recursive pointers. These can't
8702 be written in C. They can in Ada. It's pathological, but
8703 there's an ACATS test (c38102a) that checks it. Deal with this
8704 by checking if we're pointing to another pointer, that one
8705 points to another pointer, that one does too, and we have no htab.
8706 If so, get a hash table. We check three levels deep to avoid
8707 the cost of the hash table if we don't need one. */
8708 if (POINTER_TYPE_P (TREE_TYPE (type))
8709 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8710 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8713 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8721 /* ... fall through ... */
8724 WALK_SUBTREE (TREE_TYPE (type));
8728 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
8733 WALK_SUBTREE (TREE_TYPE (type));
8737 /* We never want to walk into default arguments. */
8738 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
8739 WALK_SUBTREE (TREE_VALUE (arg));
8744 /* Don't follow this nodes's type if a pointer for fear that
8745 we'll have infinite recursion. If we have a PSET, then we
8748 || (!POINTER_TYPE_P (TREE_TYPE (type))
8749 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
8750 WALK_SUBTREE (TREE_TYPE (type));
8751 WALK_SUBTREE (TYPE_DOMAIN (type));
8755 WALK_SUBTREE (TREE_TYPE (type));
8756 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
8766 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8767 called with the DATA and the address of each sub-tree. If FUNC returns a
8768 non-NULL value, the traversal is stopped, and the value returned by FUNC
8769 is returned. If PSET is non-NULL it is used to record the nodes visited,
8770 and to avoid visiting a node more than once. */
8773 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
8774 struct pointer_set_t *pset, walk_tree_lh lh)
8776 enum tree_code code;
8780 #define WALK_SUBTREE_TAIL(NODE) \
8784 goto tail_recurse; \
8789 /* Skip empty subtrees. */
8793 /* Don't walk the same tree twice, if the user has requested
8794 that we avoid doing so. */
8795 if (pset && pointer_set_insert (pset, *tp))
8798 /* Call the function. */
8800 result = (*func) (tp, &walk_subtrees, data);
8802 /* If we found something, return it. */
8806 code = TREE_CODE (*tp);
8808 /* Even if we didn't, FUNC may have decided that there was nothing
8809 interesting below this point in the tree. */
8812 /* But we still need to check our siblings. */
8813 if (code == TREE_LIST)
8814 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8815 else if (code == OMP_CLAUSE)
8816 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8823 result = (*lh) (tp, &walk_subtrees, func, data, pset);
8824 if (result || !walk_subtrees)
8831 case IDENTIFIER_NODE:
8838 case PLACEHOLDER_EXPR:
8842 /* None of these have subtrees other than those already walked
8847 WALK_SUBTREE (TREE_VALUE (*tp));
8848 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8853 int len = TREE_VEC_LENGTH (*tp);
8858 /* Walk all elements but the first. */
8860 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8862 /* Now walk the first one as a tail call. */
8863 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8867 WALK_SUBTREE (TREE_REALPART (*tp));
8868 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8872 unsigned HOST_WIDE_INT idx;
8873 constructor_elt *ce;
8876 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8878 WALK_SUBTREE (ce->value);
8883 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8888 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8890 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8891 into declarations that are just mentioned, rather than
8892 declared; they don't really belong to this part of the tree.
8893 And, we can see cycles: the initializer for a declaration
8894 can refer to the declaration itself. */
8895 WALK_SUBTREE (DECL_INITIAL (decl));
8896 WALK_SUBTREE (DECL_SIZE (decl));
8897 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8899 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8902 case STATEMENT_LIST:
8904 tree_stmt_iterator i;
8905 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8906 WALK_SUBTREE (*tsi_stmt_ptr (i));
8911 switch (OMP_CLAUSE_CODE (*tp))
8913 case OMP_CLAUSE_PRIVATE:
8914 case OMP_CLAUSE_SHARED:
8915 case OMP_CLAUSE_FIRSTPRIVATE:
8916 case OMP_CLAUSE_COPYIN:
8917 case OMP_CLAUSE_COPYPRIVATE:
8919 case OMP_CLAUSE_NUM_THREADS:
8920 case OMP_CLAUSE_SCHEDULE:
8921 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8924 case OMP_CLAUSE_NOWAIT:
8925 case OMP_CLAUSE_ORDERED:
8926 case OMP_CLAUSE_DEFAULT:
8927 case OMP_CLAUSE_UNTIED:
8928 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8930 case OMP_CLAUSE_LASTPRIVATE:
8931 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
8932 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
8933 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8935 case OMP_CLAUSE_COLLAPSE:
8938 for (i = 0; i < 3; i++)
8939 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8940 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8943 case OMP_CLAUSE_REDUCTION:
8946 for (i = 0; i < 4; i++)
8947 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8948 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8960 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8961 But, we only want to walk once. */
8962 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8963 for (i = 0; i < len; ++i)
8964 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8965 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8969 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8970 defining. We only want to walk into these fields of a type in this
8971 case and not in the general case of a mere reference to the type.
8973 The criterion is as follows: if the field can be an expression, it
8974 must be walked only here. This should be in keeping with the fields
8975 that are directly gimplified in gimplify_type_sizes in order for the
8976 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8977 variable-sized types.
8979 Note that DECLs get walked as part of processing the BIND_EXPR. */
8980 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8982 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8983 if (TREE_CODE (*type_p) == ERROR_MARK)
8986 /* Call the function for the type. See if it returns anything or
8987 doesn't want us to continue. If we are to continue, walk both
8988 the normal fields and those for the declaration case. */
8989 result = (*func) (type_p, &walk_subtrees, data);
8990 if (result || !walk_subtrees)
8993 result = walk_type_fields (*type_p, func, data, pset, lh);
8997 /* If this is a record type, also walk the fields. */
8998 if (TREE_CODE (*type_p) == RECORD_TYPE
8999 || TREE_CODE (*type_p) == UNION_TYPE
9000 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
9004 for (field = TYPE_FIELDS (*type_p); field;
9005 field = TREE_CHAIN (field))
9007 /* We'd like to look at the type of the field, but we can
9008 easily get infinite recursion. So assume it's pointed
9009 to elsewhere in the tree. Also, ignore things that
9011 if (TREE_CODE (field) != FIELD_DECL)
9014 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
9015 WALK_SUBTREE (DECL_SIZE (field));
9016 WALK_SUBTREE (DECL_SIZE_UNIT (field));
9017 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
9018 WALK_SUBTREE (DECL_QUALIFIER (field));
9022 /* Same for scalar types. */
9023 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
9024 || TREE_CODE (*type_p) == ENUMERAL_TYPE
9025 || TREE_CODE (*type_p) == INTEGER_TYPE
9026 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
9027 || TREE_CODE (*type_p) == REAL_TYPE)
9029 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
9030 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
9033 WALK_SUBTREE (TYPE_SIZE (*type_p));
9034 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
9039 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
9043 /* Walk over all the sub-trees of this operand. */
9044 len = TREE_OPERAND_LENGTH (*tp);
9046 /* Go through the subtrees. We need to do this in forward order so
9047 that the scope of a FOR_EXPR is handled properly. */
9050 for (i = 0; i < len - 1; ++i)
9051 WALK_SUBTREE (TREE_OPERAND (*tp, i));
9052 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
9055 /* If this is a type, walk the needed fields in the type. */
9056 else if (TYPE_P (*tp))
9057 return walk_type_fields (*tp, func, data, pset, lh);
9061 /* We didn't find what we were looking for. */
9064 #undef WALK_SUBTREE_TAIL
9068 /* Like walk_tree, but does not walk duplicate nodes more than once. */
9071 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
9075 struct pointer_set_t *pset;
9077 pset = pointer_set_create ();
9078 result = walk_tree_1 (tp, func, data, pset, lh);
9079 pointer_set_destroy (pset);
9087 char const c = TREE_CODE_CLASS (TREE_CODE (t));
9089 if (IS_EXPR_CODE_CLASS (c))
9090 return &t->exp.block;
9095 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
9096 FIXME: don't use this function. It exists for compatibility with
9097 the old representation of CALL_EXPRs where a list was used to hold the
9098 arguments. Places that currently extract the arglist from a CALL_EXPR
9099 ought to be rewritten to use the CALL_EXPR itself. */
9101 call_expr_arglist (tree exp)
9103 tree arglist = NULL_TREE;
9105 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
9106 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
9111 /* Create a nameless artificial label and put it in the current function
9112 context. Returns the newly created label. */
9115 create_artificial_label (void)
9117 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
9119 DECL_ARTIFICIAL (lab) = 1;
9120 DECL_IGNORED_P (lab) = 1;
9121 DECL_CONTEXT (lab) = current_function_decl;
9125 /* Given a tree, try to return a useful variable name that we can use
9126 to prefix a temporary that is being assigned the value of the tree.
9127 I.E. given <temp> = &A, return A. */
9135 STRIP_NOPS (stripped_decl);
9136 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
9137 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
9140 switch (TREE_CODE (stripped_decl))
9143 return get_name (TREE_OPERAND (stripped_decl, 0));
9150 /* Return true if TYPE has a variable argument list. */
9153 stdarg_p (tree fntype)
9155 function_args_iterator args_iter;
9156 tree n = NULL_TREE, t;
9161 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
9166 return n != NULL_TREE && n != void_type_node;
9169 /* Return true if TYPE has a prototype. */
9172 prototype_p (tree fntype)
9176 gcc_assert (fntype != NULL_TREE);
9178 t = TYPE_ARG_TYPES (fntype);
9179 return (t != NULL_TREE);
9182 /* If BLOCK is inlined from an __attribute__((__artificial__))
9183 routine, return pointer to location from where it has been
9186 block_nonartificial_location (tree block)
9188 location_t *ret = NULL;
9190 while (block && TREE_CODE (block) == BLOCK
9191 && BLOCK_ABSTRACT_ORIGIN (block))
9193 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
9195 while (TREE_CODE (ao) == BLOCK
9196 && BLOCK_ABSTRACT_ORIGIN (ao)
9197 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
9198 ao = BLOCK_ABSTRACT_ORIGIN (ao);
9200 if (TREE_CODE (ao) == FUNCTION_DECL)
9202 /* If AO is an artificial inline, point RET to the
9203 call site locus at which it has been inlined and continue
9204 the loop, in case AO's caller is also an artificial
9206 if (DECL_DECLARED_INLINE_P (ao)
9207 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
9208 ret = &BLOCK_SOURCE_LOCATION (block);
9212 else if (TREE_CODE (ao) != BLOCK)
9215 block = BLOCK_SUPERCONTEXT (block);
9221 /* If EXP is inlined from an __attribute__((__artificial__))
9222 function, return the location of the original call expression. */
9225 tree_nonartificial_location (tree exp)
9227 tree block = TREE_BLOCK (exp);
9230 && TREE_CODE (block) == BLOCK
9231 && BLOCK_ABSTRACT_ORIGIN (block))
9233 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
9237 if (TREE_CODE (ao) == FUNCTION_DECL
9238 && DECL_DECLARED_INLINE_P (ao)
9239 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
9240 return BLOCK_SOURCE_LOCATION (block);
9241 else if (TREE_CODE (ao) == BLOCK
9242 && BLOCK_SUPERCONTEXT (ao) != ao)
9243 ao = BLOCK_SUPERCONTEXT (ao);
9249 block = BLOCK_SUPERCONTEXT (block);
9252 return EXPR_LOCATION (exp);
9256 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
9259 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
9262 cl_option_hash_hash (const void *x)
9264 const_tree const t = (const_tree) x;
9270 if (TREE_CODE (t) == OPTIMIZATION_NODE)
9272 p = (const char *)TREE_OPTIMIZATION (t);
9273 len = sizeof (struct cl_optimization);
9276 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
9278 p = (const char *)TREE_TARGET_OPTION (t);
9279 len = sizeof (struct cl_target_option);
9285 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
9287 for (i = 0; i < len; i++)
9289 hash = (hash << 4) ^ ((i << 2) | p[i]);
9294 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
9295 TARGET_OPTION tree node) is the same as that given by *Y, which is the
9299 cl_option_hash_eq (const void *x, const void *y)
9301 const_tree const xt = (const_tree) x;
9302 const_tree const yt = (const_tree) y;
9307 if (TREE_CODE (xt) != TREE_CODE (yt))
9310 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
9312 xp = (const char *)TREE_OPTIMIZATION (xt);
9313 yp = (const char *)TREE_OPTIMIZATION (yt);
9314 len = sizeof (struct cl_optimization);
9317 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
9319 xp = (const char *)TREE_TARGET_OPTION (xt);
9320 yp = (const char *)TREE_TARGET_OPTION (yt);
9321 len = sizeof (struct cl_target_option);
9327 return (memcmp (xp, yp, len) == 0);
9330 /* Build an OPTIMIZATION_NODE based on the current options. */
9333 build_optimization_node (void)
9338 /* Use the cache of optimization nodes. */
9340 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
9342 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
9346 /* Insert this one into the hash table. */
9347 t = cl_optimization_node;
9350 /* Make a new node for next time round. */
9351 cl_optimization_node = make_node (OPTIMIZATION_NODE);
9357 /* Build a TARGET_OPTION_NODE based on the current options. */
9360 build_target_option_node (void)
9365 /* Use the cache of optimization nodes. */
9367 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
9369 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
9373 /* Insert this one into the hash table. */
9374 t = cl_target_option_node;
9377 /* Make a new node for next time round. */
9378 cl_target_option_node = make_node (TARGET_OPTION_NODE);
9384 /* Determine the "ultimate origin" of a block. The block may be an inlined
9385 instance of an inlined instance of a block which is local to an inline
9386 function, so we have to trace all of the way back through the origin chain
9387 to find out what sort of node actually served as the original seed for the
9391 block_ultimate_origin (const_tree block)
9393 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
9395 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
9396 nodes in the function to point to themselves; ignore that if
9397 we're trying to output the abstract instance of this function. */
9398 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
9401 if (immediate_origin == NULL_TREE)
9406 tree lookahead = immediate_origin;
9410 ret_val = lookahead;
9411 lookahead = (TREE_CODE (ret_val) == BLOCK
9412 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
9414 while (lookahead != NULL && lookahead != ret_val);
9416 /* The block's abstract origin chain may not be the *ultimate* origin of
9417 the block. It could lead to a DECL that has an abstract origin set.
9418 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
9419 will give us if it has one). Note that DECL's abstract origins are
9420 supposed to be the most distant ancestor (or so decl_ultimate_origin
9421 claims), so we don't need to loop following the DECL origins. */
9422 if (DECL_P (ret_val))
9423 return DECL_ORIGIN (ret_val);
9429 /* Return true if T1 and T2 are equivalent lists. */
9432 list_equal_p (const_tree t1, const_tree t2)
9434 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
9435 if (TREE_VALUE (t1) != TREE_VALUE (t2))
9441 #include "gt-tree.h"