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
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 2, 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 COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file contains the low level primitives for operating on tree nodes,
24 including allocation, list operations, interning of identifiers,
25 construction of data type nodes and statement nodes,
26 and construction of type conversion nodes. It also contains
27 tables index by tree code that describe how to take apart
30 It is intended to be language-independent, but occasionally
31 calls language-dependent routines defined (for C) in typecheck.c. */
35 #include "coretypes.h"
48 #include "langhooks.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
55 /* Each tree code class has an associated string representation.
56 These must correspond to the tree_code_class entries. */
58 const char *const tree_code_class_strings[] =
72 /* obstack.[ch] explicitly declined to prototype this. */
73 extern int _obstack_allocated_p (struct obstack *h, void *obj);
75 #ifdef GATHER_STATISTICS
76 /* Statistics-gathering stuff. */
78 int tree_node_counts[(int) all_kinds];
79 int tree_node_sizes[(int) all_kinds];
81 /* Keep in sync with tree.h:enum tree_node_kind. */
82 static const char * const tree_node_kind_names[] = {
104 #endif /* GATHER_STATISTICS */
106 /* Unique id for next decl created. */
107 static GTY(()) int next_decl_uid;
108 /* Unique id for next type created. */
109 static GTY(()) int next_type_uid = 1;
111 /* Since we cannot rehash a type after it is in the table, we have to
112 keep the hash code. */
114 struct type_hash GTY(())
120 /* Initial size of the hash table (rounded to next prime). */
121 #define TYPE_HASH_INITIAL_SIZE 1000
123 /* Now here is the hash table. When recording a type, it is added to
124 the slot whose index is the hash code. Note that the hash table is
125 used for several kinds of types (function types, array types and
126 array index range types, for now). While all these live in the
127 same table, they are completely independent, and the hash code is
128 computed differently for each of these. */
130 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
131 htab_t type_hash_table;
133 /* Hash table and temporary node for larger integer const values. */
134 static GTY (()) tree int_cst_node;
135 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
136 htab_t int_cst_hash_table;
138 /* General tree->tree mapping structure for use in hash tables. */
141 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
142 htab_t debug_expr_for_decl;
144 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
145 htab_t value_expr_for_decl;
147 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map)))
148 htab_t init_priority_for_decl;
150 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
151 htab_t restrict_base_for_decl;
153 struct tree_int_map GTY(())
158 static unsigned int tree_int_map_hash (const void *);
159 static int tree_int_map_eq (const void *, const void *);
160 static int tree_int_map_marked_p (const void *);
161 static void set_type_quals (tree, int);
162 static int type_hash_eq (const void *, const void *);
163 static hashval_t type_hash_hash (const void *);
164 static hashval_t int_cst_hash_hash (const void *);
165 static int int_cst_hash_eq (const void *, const void *);
166 static void print_type_hash_statistics (void);
167 static void print_debug_expr_statistics (void);
168 static void print_value_expr_statistics (void);
169 static int type_hash_marked_p (const void *);
170 static unsigned int type_hash_list (tree, hashval_t);
171 static unsigned int attribute_hash_list (tree, hashval_t);
173 tree global_trees[TI_MAX];
174 tree integer_types[itk_none];
176 unsigned char tree_contains_struct[256][64];
178 /* Number of operands for each OpenMP clause. */
179 unsigned const char omp_clause_num_ops[] =
181 0, /* OMP_CLAUSE_ERROR */
182 1, /* OMP_CLAUSE_PRIVATE */
183 1, /* OMP_CLAUSE_SHARED */
184 1, /* OMP_CLAUSE_FIRSTPRIVATE */
185 1, /* OMP_CLAUSE_LASTPRIVATE */
186 4, /* OMP_CLAUSE_REDUCTION */
187 1, /* OMP_CLAUSE_COPYIN */
188 1, /* OMP_CLAUSE_COPYPRIVATE */
189 1, /* OMP_CLAUSE_IF */
190 1, /* OMP_CLAUSE_NUM_THREADS */
191 1, /* OMP_CLAUSE_SCHEDULE */
192 0, /* OMP_CLAUSE_NOWAIT */
193 0, /* OMP_CLAUSE_ORDERED */
194 0 /* OMP_CLAUSE_DEFAULT */
197 const char * const omp_clause_code_name[] =
220 /* Initialize the hash table of types. */
221 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
224 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
227 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
229 init_priority_for_decl = htab_create_ggc (512, tree_int_map_hash,
231 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
234 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
235 int_cst_hash_eq, NULL);
237 int_cst_node = make_node (INTEGER_CST);
239 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
240 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
241 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
244 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
245 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
246 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
247 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
248 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
249 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
250 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
251 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
252 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
255 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
256 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
257 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
258 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
259 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
260 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
262 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
263 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
264 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
265 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
266 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
267 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
268 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
269 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
270 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
271 tree_contains_struct[STRUCT_FIELD_TAG][TS_DECL_MINIMAL] = 1;
272 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
273 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
275 tree_contains_struct[STRUCT_FIELD_TAG][TS_MEMORY_TAG] = 1;
276 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
277 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
279 tree_contains_struct[STRUCT_FIELD_TAG][TS_STRUCT_FIELD_TAG] = 1;
281 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
282 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
283 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
284 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
286 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
287 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
288 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
289 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
290 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
291 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
292 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
293 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
295 lang_hooks.init_ts ();
299 /* The name of the object as the assembler will see it (but before any
300 translations made by ASM_OUTPUT_LABELREF). Often this is the same
301 as DECL_NAME. It is an IDENTIFIER_NODE. */
303 decl_assembler_name (tree decl)
305 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
306 lang_hooks.set_decl_assembler_name (decl);
307 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
310 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
313 decl_assembler_name_equal (tree decl, tree asmname)
315 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
317 if (decl_asmname == asmname)
320 /* If the target assembler name was set by the user, things are trickier.
321 We have a leading '*' to begin with. After that, it's arguable what
322 is the correct thing to do with -fleading-underscore. Arguably, we've
323 historically been doing the wrong thing in assemble_alias by always
324 printing the leading underscore. Since we're not changing that, make
325 sure user_label_prefix follows the '*' before matching. */
326 if (IDENTIFIER_POINTER (decl_asmname)[0] == '*')
328 const char *decl_str = IDENTIFIER_POINTER (decl_asmname) + 1;
329 size_t ulp_len = strlen (user_label_prefix);
333 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
338 return strcmp (decl_str, IDENTIFIER_POINTER (asmname)) == 0;
344 /* Compute the number of bytes occupied by a tree with code CODE.
345 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
346 codes, which are of variable length. */
348 tree_code_size (enum tree_code code)
350 switch (TREE_CODE_CLASS (code))
352 case tcc_declaration: /* A decl node */
357 return sizeof (struct tree_field_decl);
359 return sizeof (struct tree_parm_decl);
361 return sizeof (struct tree_var_decl);
363 return sizeof (struct tree_label_decl);
365 return sizeof (struct tree_result_decl);
367 return sizeof (struct tree_const_decl);
369 return sizeof (struct tree_type_decl);
371 return sizeof (struct tree_function_decl);
372 case NAME_MEMORY_TAG:
373 case SYMBOL_MEMORY_TAG:
374 return sizeof (struct tree_memory_tag);
375 case STRUCT_FIELD_TAG:
376 return sizeof (struct tree_struct_field_tag);
378 return sizeof (struct tree_decl_non_common);
382 case tcc_type: /* a type node */
383 return sizeof (struct tree_type);
385 case tcc_reference: /* a reference */
386 case tcc_expression: /* an expression */
387 case tcc_statement: /* an expression with side effects */
388 case tcc_comparison: /* a comparison expression */
389 case tcc_unary: /* a unary arithmetic expression */
390 case tcc_binary: /* a binary arithmetic expression */
391 return (sizeof (struct tree_exp)
392 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
394 case tcc_gimple_stmt:
395 return (sizeof (struct gimple_stmt)
396 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
398 case tcc_constant: /* a constant */
401 case INTEGER_CST: return sizeof (struct tree_int_cst);
402 case REAL_CST: return sizeof (struct tree_real_cst);
403 case COMPLEX_CST: return sizeof (struct tree_complex);
404 case VECTOR_CST: return sizeof (struct tree_vector);
405 case STRING_CST: gcc_unreachable ();
407 return lang_hooks.tree_size (code);
410 case tcc_exceptional: /* something random, like an identifier. */
413 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
414 case TREE_LIST: return sizeof (struct tree_list);
417 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
421 case PHI_NODE: gcc_unreachable ();
423 case SSA_NAME: return sizeof (struct tree_ssa_name);
425 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
426 case BLOCK: return sizeof (struct tree_block);
427 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
428 case CONSTRUCTOR: return sizeof (struct tree_constructor);
431 return lang_hooks.tree_size (code);
439 /* Compute the number of bytes occupied by NODE. This routine only
440 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
442 tree_size (tree node)
444 enum tree_code code = TREE_CODE (node);
448 return (sizeof (struct tree_phi_node)
449 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
452 return (offsetof (struct tree_binfo, base_binfos)
453 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
456 return (sizeof (struct tree_vec)
457 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *));
460 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
463 return (sizeof (struct tree_omp_clause)
464 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
468 return tree_code_size (code);
472 /* Return a newly allocated node of code CODE. For decl and type
473 nodes, some other fields are initialized. The rest of the node is
474 initialized to zero. This function cannot be used for PHI_NODE,
475 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
478 Achoo! I got a code in the node. */
481 make_node_stat (enum tree_code code MEM_STAT_DECL)
484 enum tree_code_class type = TREE_CODE_CLASS (code);
485 size_t length = tree_code_size (code);
486 #ifdef GATHER_STATISTICS
491 case tcc_declaration: /* A decl node */
495 case tcc_type: /* a type node */
499 case tcc_statement: /* an expression with side effects */
503 case tcc_reference: /* a reference */
507 case tcc_expression: /* an expression */
508 case tcc_comparison: /* a comparison expression */
509 case tcc_unary: /* a unary arithmetic expression */
510 case tcc_binary: /* a binary arithmetic expression */
514 case tcc_constant: /* a constant */
518 case tcc_gimple_stmt:
519 kind = gimple_stmt_kind;
522 case tcc_exceptional: /* something random, like an identifier. */
525 case IDENTIFIER_NODE:
542 kind = ssa_name_kind;
563 tree_node_counts[(int) kind]++;
564 tree_node_sizes[(int) kind] += length;
567 if (code == IDENTIFIER_NODE)
568 t = ggc_alloc_zone_pass_stat (length, &tree_id_zone);
570 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
572 memset (t, 0, length);
574 TREE_SET_CODE (t, code);
579 TREE_SIDE_EFFECTS (t) = 1;
582 case tcc_declaration:
583 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
584 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
585 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
587 if (code != FUNCTION_DECL)
589 DECL_USER_ALIGN (t) = 0;
590 /* We have not yet computed the alias set for this declaration. */
591 DECL_POINTER_ALIAS_SET (t) = -1;
593 DECL_SOURCE_LOCATION (t) = input_location;
594 DECL_UID (t) = next_decl_uid++;
599 TYPE_UID (t) = next_type_uid++;
600 TYPE_ALIGN (t) = BITS_PER_UNIT;
601 TYPE_USER_ALIGN (t) = 0;
602 TYPE_MAIN_VARIANT (t) = t;
604 /* Default to no attributes for type, but let target change that. */
605 TYPE_ATTRIBUTES (t) = NULL_TREE;
606 targetm.set_default_type_attributes (t);
608 /* We have not yet computed the alias set for this type. */
609 TYPE_ALIAS_SET (t) = -1;
613 TREE_CONSTANT (t) = 1;
614 TREE_INVARIANT (t) = 1;
623 case PREDECREMENT_EXPR:
624 case PREINCREMENT_EXPR:
625 case POSTDECREMENT_EXPR:
626 case POSTINCREMENT_EXPR:
627 /* All of these have side-effects, no matter what their
629 TREE_SIDE_EFFECTS (t) = 1;
637 case tcc_gimple_stmt:
640 case GIMPLE_MODIFY_STMT:
641 TREE_SIDE_EFFECTS (t) = 1;
649 /* Other classes need no special treatment. */
656 /* Return a new node with the same contents as NODE except that its
657 TREE_CHAIN is zero and it has a fresh uid. */
660 copy_node_stat (tree node MEM_STAT_DECL)
663 enum tree_code code = TREE_CODE (node);
666 gcc_assert (code != STATEMENT_LIST);
668 length = tree_size (node);
669 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
670 memcpy (t, node, length);
672 if (!GIMPLE_TUPLE_P (node))
674 TREE_ASM_WRITTEN (t) = 0;
675 TREE_VISITED (t) = 0;
678 if (TREE_CODE_CLASS (code) == tcc_declaration)
680 DECL_UID (t) = next_decl_uid++;
681 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
682 && DECL_HAS_VALUE_EXPR_P (node))
684 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
685 DECL_HAS_VALUE_EXPR_P (t) = 1;
687 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
689 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
690 DECL_HAS_INIT_PRIORITY_P (t) = 1;
692 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
694 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
695 DECL_BASED_ON_RESTRICT_P (t) = 1;
698 else if (TREE_CODE_CLASS (code) == tcc_type)
700 TYPE_UID (t) = next_type_uid++;
701 /* The following is so that the debug code for
702 the copy is different from the original type.
703 The two statements usually duplicate each other
704 (because they clear fields of the same union),
705 but the optimizer should catch that. */
706 TYPE_SYMTAB_POINTER (t) = 0;
707 TYPE_SYMTAB_ADDRESS (t) = 0;
709 /* Do not copy the values cache. */
710 if (TYPE_CACHED_VALUES_P(t))
712 TYPE_CACHED_VALUES_P (t) = 0;
713 TYPE_CACHED_VALUES (t) = NULL_TREE;
720 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
721 For example, this can copy a list made of TREE_LIST nodes. */
724 copy_list (tree list)
732 head = prev = copy_node (list);
733 next = TREE_CHAIN (list);
736 TREE_CHAIN (prev) = copy_node (next);
737 prev = TREE_CHAIN (prev);
738 next = TREE_CHAIN (next);
744 /* Create an INT_CST node with a LOW value sign extended. */
747 build_int_cst (tree type, HOST_WIDE_INT low)
749 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
752 /* Create an INT_CST node with a LOW value zero extended. */
755 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
757 return build_int_cst_wide (type, low, 0);
760 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
761 if it is negative. This function is similar to build_int_cst, but
762 the extra bits outside of the type precision are cleared. Constants
763 with these extra bits may confuse the fold so that it detects overflows
764 even in cases when they do not occur, and in general should be avoided.
765 We cannot however make this a default behavior of build_int_cst without
766 more intrusive changes, since there are parts of gcc that rely on the extra
767 precision of the integer constants. */
770 build_int_cst_type (tree type, HOST_WIDE_INT low)
772 unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low;
773 unsigned HOST_WIDE_INT hi, mask;
779 type = integer_type_node;
781 bits = TYPE_PRECISION (type);
782 signed_p = !TYPE_UNSIGNED (type);
784 if (bits >= HOST_BITS_PER_WIDE_INT)
785 negative = (low < 0);
788 /* If the sign bit is inside precision of LOW, use it to determine
789 the sign of the constant. */
790 negative = ((val >> (bits - 1)) & 1) != 0;
792 /* Mask out the bits outside of the precision of the constant. */
793 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
795 if (signed_p && negative)
801 /* Determine the high bits. */
802 hi = (negative ? ~(unsigned HOST_WIDE_INT) 0 : 0);
804 /* For unsigned type we need to mask out the bits outside of the type
808 if (bits <= HOST_BITS_PER_WIDE_INT)
812 bits -= HOST_BITS_PER_WIDE_INT;
813 mask = (((unsigned HOST_WIDE_INT) 2) << (bits - 1)) - 1;
818 return build_int_cst_wide (type, val, hi);
821 /* These are the hash table functions for the hash table of INTEGER_CST
822 nodes of a sizetype. */
824 /* Return the hash code code X, an INTEGER_CST. */
827 int_cst_hash_hash (const void *x)
831 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
832 ^ htab_hash_pointer (TREE_TYPE (t)));
835 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
836 is the same as that given by *Y, which is the same. */
839 int_cst_hash_eq (const void *x, const void *y)
844 return (TREE_TYPE (xt) == TREE_TYPE (yt)
845 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
846 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
849 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
850 integer_type_node is used. The returned node is always shared.
851 For small integers we use a per-type vector cache, for larger ones
852 we use a single hash table. */
855 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
862 type = integer_type_node;
864 switch (TREE_CODE (type))
868 /* Cache NULL pointer. */
877 /* Cache false or true. */
885 if (TYPE_UNSIGNED (type))
888 limit = INTEGER_SHARE_LIMIT;
889 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
895 limit = INTEGER_SHARE_LIMIT + 1;
896 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
898 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
912 /* Look for it in the type's vector of small shared ints. */
913 if (!TYPE_CACHED_VALUES_P (type))
915 TYPE_CACHED_VALUES_P (type) = 1;
916 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
919 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
922 /* Make sure no one is clobbering the shared constant. */
923 gcc_assert (TREE_TYPE (t) == type);
924 gcc_assert (TREE_INT_CST_LOW (t) == low);
925 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
929 /* Create a new shared int. */
930 t = make_node (INTEGER_CST);
932 TREE_INT_CST_LOW (t) = low;
933 TREE_INT_CST_HIGH (t) = hi;
934 TREE_TYPE (t) = type;
936 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
941 /* Use the cache of larger shared ints. */
944 TREE_INT_CST_LOW (int_cst_node) = low;
945 TREE_INT_CST_HIGH (int_cst_node) = hi;
946 TREE_TYPE (int_cst_node) = type;
948 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
952 /* Insert this one into the hash table. */
955 /* Make a new node for next time round. */
956 int_cst_node = make_node (INTEGER_CST);
963 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
964 and the rest are zeros. */
967 build_low_bits_mask (tree type, unsigned bits)
969 unsigned HOST_WIDE_INT low;
971 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
973 gcc_assert (bits <= TYPE_PRECISION (type));
975 if (bits == TYPE_PRECISION (type)
976 && !TYPE_UNSIGNED (type))
978 /* Sign extended all-ones mask. */
982 else if (bits <= HOST_BITS_PER_WIDE_INT)
984 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
989 bits -= HOST_BITS_PER_WIDE_INT;
991 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
994 return build_int_cst_wide (type, low, high);
997 /* Checks that X is integer constant that can be expressed in (unsigned)
998 HOST_WIDE_INT without loss of precision. */
1001 cst_and_fits_in_hwi (tree x)
1003 if (TREE_CODE (x) != INTEGER_CST)
1006 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1009 return (TREE_INT_CST_HIGH (x) == 0
1010 || TREE_INT_CST_HIGH (x) == -1);
1013 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1014 are in a list pointed to by VALS. */
1017 build_vector (tree type, tree vals)
1019 tree v = make_node (VECTOR_CST);
1020 int over1 = 0, over2 = 0;
1023 TREE_VECTOR_CST_ELTS (v) = vals;
1024 TREE_TYPE (v) = type;
1026 /* Iterate through elements and check for overflow. */
1027 for (link = vals; link; link = TREE_CHAIN (link))
1029 tree value = TREE_VALUE (link);
1031 /* Don't crash if we get an address constant. */
1032 if (!CONSTANT_CLASS_P (value))
1035 over1 |= TREE_OVERFLOW (value);
1036 over2 |= TREE_CONSTANT_OVERFLOW (value);
1039 TREE_OVERFLOW (v) = over1;
1040 TREE_CONSTANT_OVERFLOW (v) = over2;
1045 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1046 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1049 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1051 tree list = NULL_TREE;
1052 unsigned HOST_WIDE_INT idx;
1055 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1056 list = tree_cons (NULL_TREE, value, list);
1057 return build_vector (type, nreverse (list));
1060 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1061 are in the VEC pointed to by VALS. */
1063 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1065 tree c = make_node (CONSTRUCTOR);
1066 TREE_TYPE (c) = type;
1067 CONSTRUCTOR_ELTS (c) = vals;
1071 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1074 build_constructor_single (tree type, tree index, tree value)
1076 VEC(constructor_elt,gc) *v;
1077 constructor_elt *elt;
1080 v = VEC_alloc (constructor_elt, gc, 1);
1081 elt = VEC_quick_push (constructor_elt, v, NULL);
1085 t = build_constructor (type, v);
1086 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1091 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1092 are in a list pointed to by VALS. */
1094 build_constructor_from_list (tree type, tree vals)
1097 VEC(constructor_elt,gc) *v = NULL;
1098 bool constant_p = true;
1102 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1103 for (t = vals; t; t = TREE_CHAIN (t))
1105 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1106 val = TREE_VALUE (t);
1107 elt->index = TREE_PURPOSE (t);
1109 if (!TREE_CONSTANT (val))
1114 t = build_constructor (type, v);
1115 TREE_CONSTANT (t) = constant_p;
1120 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1123 build_real (tree type, REAL_VALUE_TYPE d)
1126 REAL_VALUE_TYPE *dp;
1129 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1130 Consider doing it via real_convert now. */
1132 v = make_node (REAL_CST);
1133 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
1134 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1136 TREE_TYPE (v) = type;
1137 TREE_REAL_CST_PTR (v) = dp;
1138 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
1142 /* Return a new REAL_CST node whose type is TYPE
1143 and whose value is the integer value of the INTEGER_CST node I. */
1146 real_value_from_int_cst (tree type, tree i)
1150 /* Clear all bits of the real value type so that we can later do
1151 bitwise comparisons to see if two values are the same. */
1152 memset (&d, 0, sizeof d);
1154 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1155 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1156 TYPE_UNSIGNED (TREE_TYPE (i)));
1160 /* Given a tree representing an integer constant I, return a tree
1161 representing the same value as a floating-point constant of type TYPE. */
1164 build_real_from_int_cst (tree type, tree i)
1167 int overflow = TREE_OVERFLOW (i);
1169 v = build_real (type, real_value_from_int_cst (type, i));
1171 TREE_OVERFLOW (v) |= overflow;
1172 TREE_CONSTANT_OVERFLOW (v) |= overflow;
1176 /* Return a newly constructed STRING_CST node whose value is
1177 the LEN characters at STR.
1178 The TREE_TYPE is not initialized. */
1181 build_string (int len, const char *str)
1186 /* Do not waste bytes provided by padding of struct tree_string. */
1187 length = len + offsetof (struct tree_string, str) + 1;
1189 #ifdef GATHER_STATISTICS
1190 tree_node_counts[(int) c_kind]++;
1191 tree_node_sizes[(int) c_kind] += length;
1194 s = ggc_alloc_tree (length);
1196 memset (s, 0, sizeof (struct tree_common));
1197 TREE_SET_CODE (s, STRING_CST);
1198 TREE_CONSTANT (s) = 1;
1199 TREE_INVARIANT (s) = 1;
1200 TREE_STRING_LENGTH (s) = len;
1201 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
1202 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
1207 /* Return a newly constructed COMPLEX_CST node whose value is
1208 specified by the real and imaginary parts REAL and IMAG.
1209 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1210 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1213 build_complex (tree type, tree real, tree imag)
1215 tree t = make_node (COMPLEX_CST);
1217 TREE_REALPART (t) = real;
1218 TREE_IMAGPART (t) = imag;
1219 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1220 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1221 TREE_CONSTANT_OVERFLOW (t)
1222 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
1226 /* Return a constant of arithmetic type TYPE which is the
1227 multiplicative identity of the set TYPE. */
1230 build_one_cst (tree type)
1232 switch (TREE_CODE (type))
1234 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1235 case POINTER_TYPE: case REFERENCE_TYPE:
1237 return build_int_cst (type, 1);
1240 return build_real (type, dconst1);
1247 scalar = build_one_cst (TREE_TYPE (type));
1249 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1251 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1252 cst = tree_cons (NULL_TREE, scalar, cst);
1254 return build_vector (type, cst);
1258 return build_complex (type,
1259 build_one_cst (TREE_TYPE (type)),
1260 fold_convert (TREE_TYPE (type), integer_zero_node));
1267 /* Build a BINFO with LEN language slots. */
1270 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1273 size_t length = (offsetof (struct tree_binfo, base_binfos)
1274 + VEC_embedded_size (tree, base_binfos));
1276 #ifdef GATHER_STATISTICS
1277 tree_node_counts[(int) binfo_kind]++;
1278 tree_node_sizes[(int) binfo_kind] += length;
1281 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1283 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1285 TREE_SET_CODE (t, TREE_BINFO);
1287 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1293 /* Build a newly constructed TREE_VEC node of length LEN. */
1296 make_tree_vec_stat (int len MEM_STAT_DECL)
1299 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1301 #ifdef GATHER_STATISTICS
1302 tree_node_counts[(int) vec_kind]++;
1303 tree_node_sizes[(int) vec_kind] += length;
1306 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
1308 memset (t, 0, length);
1310 TREE_SET_CODE (t, TREE_VEC);
1311 TREE_VEC_LENGTH (t) = len;
1316 /* Return 1 if EXPR is the integer constant zero or a complex constant
1320 integer_zerop (tree expr)
1324 return ((TREE_CODE (expr) == INTEGER_CST
1325 && TREE_INT_CST_LOW (expr) == 0
1326 && TREE_INT_CST_HIGH (expr) == 0)
1327 || (TREE_CODE (expr) == COMPLEX_CST
1328 && integer_zerop (TREE_REALPART (expr))
1329 && integer_zerop (TREE_IMAGPART (expr))));
1332 /* Return 1 if EXPR is the integer constant one or the corresponding
1333 complex constant. */
1336 integer_onep (tree expr)
1340 return ((TREE_CODE (expr) == INTEGER_CST
1341 && TREE_INT_CST_LOW (expr) == 1
1342 && TREE_INT_CST_HIGH (expr) == 0)
1343 || (TREE_CODE (expr) == COMPLEX_CST
1344 && integer_onep (TREE_REALPART (expr))
1345 && integer_zerop (TREE_IMAGPART (expr))));
1348 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1349 it contains. Likewise for the corresponding complex constant. */
1352 integer_all_onesp (tree expr)
1359 if (TREE_CODE (expr) == COMPLEX_CST
1360 && integer_all_onesp (TREE_REALPART (expr))
1361 && integer_zerop (TREE_IMAGPART (expr)))
1364 else if (TREE_CODE (expr) != INTEGER_CST)
1367 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1368 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1369 && TREE_INT_CST_HIGH (expr) == -1)
1374 /* Note that using TYPE_PRECISION here is wrong. We care about the
1375 actual bits, not the (arbitrary) range of the type. */
1376 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1377 if (prec >= HOST_BITS_PER_WIDE_INT)
1379 HOST_WIDE_INT high_value;
1382 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1384 /* Can not handle precisions greater than twice the host int size. */
1385 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1386 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1387 /* Shifting by the host word size is undefined according to the ANSI
1388 standard, so we must handle this as a special case. */
1391 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1393 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1394 && TREE_INT_CST_HIGH (expr) == high_value);
1397 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1400 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1404 integer_pow2p (tree expr)
1407 HOST_WIDE_INT high, low;
1411 if (TREE_CODE (expr) == COMPLEX_CST
1412 && integer_pow2p (TREE_REALPART (expr))
1413 && integer_zerop (TREE_IMAGPART (expr)))
1416 if (TREE_CODE (expr) != INTEGER_CST)
1419 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1420 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1421 high = TREE_INT_CST_HIGH (expr);
1422 low = TREE_INT_CST_LOW (expr);
1424 /* First clear all bits that are beyond the type's precision in case
1425 we've been sign extended. */
1427 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1429 else if (prec > HOST_BITS_PER_WIDE_INT)
1430 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1434 if (prec < HOST_BITS_PER_WIDE_INT)
1435 low &= ~((HOST_WIDE_INT) (-1) << prec);
1438 if (high == 0 && low == 0)
1441 return ((high == 0 && (low & (low - 1)) == 0)
1442 || (low == 0 && (high & (high - 1)) == 0));
1445 /* Return 1 if EXPR is an integer constant other than zero or a
1446 complex constant other than zero. */
1449 integer_nonzerop (tree expr)
1453 return ((TREE_CODE (expr) == INTEGER_CST
1454 && (TREE_INT_CST_LOW (expr) != 0
1455 || TREE_INT_CST_HIGH (expr) != 0))
1456 || (TREE_CODE (expr) == COMPLEX_CST
1457 && (integer_nonzerop (TREE_REALPART (expr))
1458 || integer_nonzerop (TREE_IMAGPART (expr)))));
1461 /* Return the power of two represented by a tree node known to be a
1465 tree_log2 (tree expr)
1468 HOST_WIDE_INT high, low;
1472 if (TREE_CODE (expr) == COMPLEX_CST)
1473 return tree_log2 (TREE_REALPART (expr));
1475 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1476 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1478 high = TREE_INT_CST_HIGH (expr);
1479 low = TREE_INT_CST_LOW (expr);
1481 /* First clear all bits that are beyond the type's precision in case
1482 we've been sign extended. */
1484 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1486 else if (prec > HOST_BITS_PER_WIDE_INT)
1487 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1491 if (prec < HOST_BITS_PER_WIDE_INT)
1492 low &= ~((HOST_WIDE_INT) (-1) << prec);
1495 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1496 : exact_log2 (low));
1499 /* Similar, but return the largest integer Y such that 2 ** Y is less
1500 than or equal to EXPR. */
1503 tree_floor_log2 (tree expr)
1506 HOST_WIDE_INT high, low;
1510 if (TREE_CODE (expr) == COMPLEX_CST)
1511 return tree_log2 (TREE_REALPART (expr));
1513 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1514 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1516 high = TREE_INT_CST_HIGH (expr);
1517 low = TREE_INT_CST_LOW (expr);
1519 /* First clear all bits that are beyond the type's precision in case
1520 we've been sign extended. Ignore if type's precision hasn't been set
1521 since what we are doing is setting it. */
1523 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1525 else if (prec > HOST_BITS_PER_WIDE_INT)
1526 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1530 if (prec < HOST_BITS_PER_WIDE_INT)
1531 low &= ~((HOST_WIDE_INT) (-1) << prec);
1534 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1535 : floor_log2 (low));
1538 /* Return 1 if EXPR is the real constant zero. */
1541 real_zerop (tree expr)
1545 return ((TREE_CODE (expr) == REAL_CST
1546 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1547 || (TREE_CODE (expr) == COMPLEX_CST
1548 && real_zerop (TREE_REALPART (expr))
1549 && real_zerop (TREE_IMAGPART (expr))));
1552 /* Return 1 if EXPR is the real constant one in real or complex form. */
1555 real_onep (tree expr)
1559 return ((TREE_CODE (expr) == REAL_CST
1560 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1561 || (TREE_CODE (expr) == COMPLEX_CST
1562 && real_onep (TREE_REALPART (expr))
1563 && real_zerop (TREE_IMAGPART (expr))));
1566 /* Return 1 if EXPR is the real constant two. */
1569 real_twop (tree expr)
1573 return ((TREE_CODE (expr) == REAL_CST
1574 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1575 || (TREE_CODE (expr) == COMPLEX_CST
1576 && real_twop (TREE_REALPART (expr))
1577 && real_zerop (TREE_IMAGPART (expr))));
1580 /* Return 1 if EXPR is the real constant minus one. */
1583 real_minus_onep (tree expr)
1587 return ((TREE_CODE (expr) == REAL_CST
1588 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1589 || (TREE_CODE (expr) == COMPLEX_CST
1590 && real_minus_onep (TREE_REALPART (expr))
1591 && real_zerop (TREE_IMAGPART (expr))));
1594 /* Nonzero if EXP is a constant or a cast of a constant. */
1597 really_constant_p (tree exp)
1599 /* This is not quite the same as STRIP_NOPS. It does more. */
1600 while (TREE_CODE (exp) == NOP_EXPR
1601 || TREE_CODE (exp) == CONVERT_EXPR
1602 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1603 exp = TREE_OPERAND (exp, 0);
1604 return TREE_CONSTANT (exp);
1607 /* Return first list element whose TREE_VALUE is ELEM.
1608 Return 0 if ELEM is not in LIST. */
1611 value_member (tree elem, tree list)
1615 if (elem == TREE_VALUE (list))
1617 list = TREE_CHAIN (list);
1622 /* Return first list element whose TREE_PURPOSE is ELEM.
1623 Return 0 if ELEM is not in LIST. */
1626 purpose_member (tree elem, tree list)
1630 if (elem == TREE_PURPOSE (list))
1632 list = TREE_CHAIN (list);
1637 /* Return nonzero if ELEM is part of the chain CHAIN. */
1640 chain_member (tree elem, tree chain)
1646 chain = TREE_CHAIN (chain);
1652 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1653 We expect a null pointer to mark the end of the chain.
1654 This is the Lisp primitive `length'. */
1657 list_length (tree t)
1660 #ifdef ENABLE_TREE_CHECKING
1668 #ifdef ENABLE_TREE_CHECKING
1671 gcc_assert (p != q);
1679 /* Returns the number of FIELD_DECLs in TYPE. */
1682 fields_length (tree type)
1684 tree t = TYPE_FIELDS (type);
1687 for (; t; t = TREE_CHAIN (t))
1688 if (TREE_CODE (t) == FIELD_DECL)
1694 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1695 by modifying the last node in chain 1 to point to chain 2.
1696 This is the Lisp primitive `nconc'. */
1699 chainon (tree op1, tree op2)
1708 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1710 TREE_CHAIN (t1) = op2;
1712 #ifdef ENABLE_TREE_CHECKING
1715 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1716 gcc_assert (t2 != t1);
1723 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1726 tree_last (tree chain)
1730 while ((next = TREE_CHAIN (chain)))
1735 /* Reverse the order of elements in the chain T,
1736 and return the new head of the chain (old last element). */
1741 tree prev = 0, decl, next;
1742 for (decl = t; decl; decl = next)
1744 next = TREE_CHAIN (decl);
1745 TREE_CHAIN (decl) = prev;
1751 /* Return a newly created TREE_LIST node whose
1752 purpose and value fields are PARM and VALUE. */
1755 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1757 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1758 TREE_PURPOSE (t) = parm;
1759 TREE_VALUE (t) = value;
1763 /* Return a newly created TREE_LIST node whose
1764 purpose and value fields are PURPOSE and VALUE
1765 and whose TREE_CHAIN is CHAIN. */
1768 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1772 node = ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1774 memset (node, 0, sizeof (struct tree_common));
1776 #ifdef GATHER_STATISTICS
1777 tree_node_counts[(int) x_kind]++;
1778 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1781 TREE_SET_CODE (node, TREE_LIST);
1782 TREE_CHAIN (node) = chain;
1783 TREE_PURPOSE (node) = purpose;
1784 TREE_VALUE (node) = value;
1789 /* Return the size nominally occupied by an object of type TYPE
1790 when it resides in memory. The value is measured in units of bytes,
1791 and its data type is that normally used for type sizes
1792 (which is the first type created by make_signed_type or
1793 make_unsigned_type). */
1796 size_in_bytes (tree type)
1800 if (type == error_mark_node)
1801 return integer_zero_node;
1803 type = TYPE_MAIN_VARIANT (type);
1804 t = TYPE_SIZE_UNIT (type);
1808 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1809 return size_zero_node;
1812 if (TREE_CODE (t) == INTEGER_CST)
1813 t = force_fit_type (t, 0, false, false);
1818 /* Return the size of TYPE (in bytes) as a wide integer
1819 or return -1 if the size can vary or is larger than an integer. */
1822 int_size_in_bytes (tree type)
1826 if (type == error_mark_node)
1829 type = TYPE_MAIN_VARIANT (type);
1830 t = TYPE_SIZE_UNIT (type);
1832 || TREE_CODE (t) != INTEGER_CST
1833 || TREE_INT_CST_HIGH (t) != 0
1834 /* If the result would appear negative, it's too big to represent. */
1835 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1838 return TREE_INT_CST_LOW (t);
1841 /* Return the maximum size of TYPE (in bytes) as a wide integer
1842 or return -1 if the size can vary or is larger than an integer. */
1845 max_int_size_in_bytes (tree type)
1847 HOST_WIDE_INT size = -1;
1850 /* If this is an array type, check for a possible MAX_SIZE attached. */
1852 if (TREE_CODE (type) == ARRAY_TYPE)
1854 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1856 if (size_tree && host_integerp (size_tree, 1))
1857 size = tree_low_cst (size_tree, 1);
1860 /* If we still haven't been able to get a size, see if the language
1861 can compute a maximum size. */
1865 size_tree = lang_hooks.types.max_size (type);
1867 if (size_tree && host_integerp (size_tree, 1))
1868 size = tree_low_cst (size_tree, 1);
1874 /* Return the bit position of FIELD, in bits from the start of the record.
1875 This is a tree of type bitsizetype. */
1878 bit_position (tree field)
1880 return bit_from_pos (DECL_FIELD_OFFSET (field),
1881 DECL_FIELD_BIT_OFFSET (field));
1884 /* Likewise, but return as an integer. It must be representable in
1885 that way (since it could be a signed value, we don't have the
1886 option of returning -1 like int_size_in_byte can. */
1889 int_bit_position (tree field)
1891 return tree_low_cst (bit_position (field), 0);
1894 /* Return the byte position of FIELD, in bytes from the start of the record.
1895 This is a tree of type sizetype. */
1898 byte_position (tree field)
1900 return byte_from_pos (DECL_FIELD_OFFSET (field),
1901 DECL_FIELD_BIT_OFFSET (field));
1904 /* Likewise, but return as an integer. It must be representable in
1905 that way (since it could be a signed value, we don't have the
1906 option of returning -1 like int_size_in_byte can. */
1909 int_byte_position (tree field)
1911 return tree_low_cst (byte_position (field), 0);
1914 /* Return the strictest alignment, in bits, that T is known to have. */
1919 unsigned int align0, align1;
1921 switch (TREE_CODE (t))
1923 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1924 /* If we have conversions, we know that the alignment of the
1925 object must meet each of the alignments of the types. */
1926 align0 = expr_align (TREE_OPERAND (t, 0));
1927 align1 = TYPE_ALIGN (TREE_TYPE (t));
1928 return MAX (align0, align1);
1931 /* FIXME tuples: It is unclear to me if this function, which
1932 is only called from ADA, is called on gimple or non gimple
1933 trees. Let's assume it's from gimple trees unless we hit
1937 case SAVE_EXPR: case COMPOUND_EXPR: case GIMPLE_MODIFY_STMT:
1938 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1939 case CLEANUP_POINT_EXPR:
1940 /* These don't change the alignment of an object. */
1941 return expr_align (TREE_OPERAND (t, 0));
1944 /* The best we can do is say that the alignment is the least aligned
1946 align0 = expr_align (TREE_OPERAND (t, 1));
1947 align1 = expr_align (TREE_OPERAND (t, 2));
1948 return MIN (align0, align1);
1950 case LABEL_DECL: case CONST_DECL:
1951 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1952 if (DECL_ALIGN (t) != 0)
1953 return DECL_ALIGN (t);
1957 return FUNCTION_BOUNDARY;
1963 /* Otherwise take the alignment from that of the type. */
1964 return TYPE_ALIGN (TREE_TYPE (t));
1967 /* Return, as a tree node, the number of elements for TYPE (which is an
1968 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1971 array_type_nelts (tree type)
1973 tree index_type, min, max;
1975 /* If they did it with unspecified bounds, then we should have already
1976 given an error about it before we got here. */
1977 if (! TYPE_DOMAIN (type))
1978 return error_mark_node;
1980 index_type = TYPE_DOMAIN (type);
1981 min = TYPE_MIN_VALUE (index_type);
1982 max = TYPE_MAX_VALUE (index_type);
1984 return (integer_zerop (min)
1986 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
1989 /* If arg is static -- a reference to an object in static storage -- then
1990 return the object. This is not the same as the C meaning of `static'.
1991 If arg isn't static, return NULL. */
1996 switch (TREE_CODE (arg))
1999 /* Nested functions are static, even though taking their address will
2000 involve a trampoline as we unnest the nested function and create
2001 the trampoline on the tree level. */
2005 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2006 && ! DECL_THREAD_LOCAL_P (arg)
2007 && ! DECL_DLLIMPORT_P (arg)
2011 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2015 return TREE_STATIC (arg) ? arg : NULL;
2022 /* If the thing being referenced is not a field, then it is
2023 something language specific. */
2024 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2025 return (*lang_hooks.staticp) (arg);
2027 /* If we are referencing a bitfield, we can't evaluate an
2028 ADDR_EXPR at compile time and so it isn't a constant. */
2029 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2032 return staticp (TREE_OPERAND (arg, 0));
2037 case MISALIGNED_INDIRECT_REF:
2038 case ALIGN_INDIRECT_REF:
2040 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2043 case ARRAY_RANGE_REF:
2044 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2045 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2046 return staticp (TREE_OPERAND (arg, 0));
2051 if ((unsigned int) TREE_CODE (arg)
2052 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2053 return lang_hooks.staticp (arg);
2059 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2060 Do this to any expression which may be used in more than one place,
2061 but must be evaluated only once.
2063 Normally, expand_expr would reevaluate the expression each time.
2064 Calling save_expr produces something that is evaluated and recorded
2065 the first time expand_expr is called on it. Subsequent calls to
2066 expand_expr just reuse the recorded value.
2068 The call to expand_expr that generates code that actually computes
2069 the value is the first call *at compile time*. Subsequent calls
2070 *at compile time* generate code to use the saved value.
2071 This produces correct result provided that *at run time* control
2072 always flows through the insns made by the first expand_expr
2073 before reaching the other places where the save_expr was evaluated.
2074 You, the caller of save_expr, must make sure this is so.
2076 Constants, and certain read-only nodes, are returned with no
2077 SAVE_EXPR because that is safe. Expressions containing placeholders
2078 are not touched; see tree.def for an explanation of what these
2082 save_expr (tree expr)
2084 tree t = fold (expr);
2087 /* If the tree evaluates to a constant, then we don't want to hide that
2088 fact (i.e. this allows further folding, and direct checks for constants).
2089 However, a read-only object that has side effects cannot be bypassed.
2090 Since it is no problem to reevaluate literals, we just return the
2092 inner = skip_simple_arithmetic (t);
2094 if (TREE_INVARIANT (inner)
2095 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
2096 || TREE_CODE (inner) == SAVE_EXPR
2097 || TREE_CODE (inner) == ERROR_MARK)
2100 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2101 it means that the size or offset of some field of an object depends on
2102 the value within another field.
2104 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2105 and some variable since it would then need to be both evaluated once and
2106 evaluated more than once. Front-ends must assure this case cannot
2107 happen by surrounding any such subexpressions in their own SAVE_EXPR
2108 and forcing evaluation at the proper time. */
2109 if (contains_placeholder_p (inner))
2112 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2114 /* This expression might be placed ahead of a jump to ensure that the
2115 value was computed on both sides of the jump. So make sure it isn't
2116 eliminated as dead. */
2117 TREE_SIDE_EFFECTS (t) = 1;
2118 TREE_INVARIANT (t) = 1;
2122 /* Look inside EXPR and into any simple arithmetic operations. Return
2123 the innermost non-arithmetic node. */
2126 skip_simple_arithmetic (tree expr)
2130 /* We don't care about whether this can be used as an lvalue in this
2132 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2133 expr = TREE_OPERAND (expr, 0);
2135 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2136 a constant, it will be more efficient to not make another SAVE_EXPR since
2137 it will allow better simplification and GCSE will be able to merge the
2138 computations if they actually occur. */
2142 if (UNARY_CLASS_P (inner))
2143 inner = TREE_OPERAND (inner, 0);
2144 else if (BINARY_CLASS_P (inner))
2146 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
2147 inner = TREE_OPERAND (inner, 0);
2148 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
2149 inner = TREE_OPERAND (inner, 1);
2160 /* Return which tree structure is used by T. */
2162 enum tree_node_structure_enum
2163 tree_node_structure (tree t)
2165 enum tree_code code = TREE_CODE (t);
2167 switch (TREE_CODE_CLASS (code))
2169 case tcc_declaration:
2174 return TS_FIELD_DECL;
2176 return TS_PARM_DECL;
2180 return TS_LABEL_DECL;
2182 return TS_RESULT_DECL;
2184 return TS_CONST_DECL;
2186 return TS_TYPE_DECL;
2188 return TS_FUNCTION_DECL;
2189 case SYMBOL_MEMORY_TAG:
2190 case NAME_MEMORY_TAG:
2191 case STRUCT_FIELD_TAG:
2192 return TS_MEMORY_TAG;
2194 return TS_DECL_NON_COMMON;
2200 case tcc_comparison:
2203 case tcc_expression:
2206 case tcc_gimple_stmt:
2207 return TS_GIMPLE_STATEMENT;
2208 default: /* tcc_constant and tcc_exceptional */
2213 /* tcc_constant cases. */
2214 case INTEGER_CST: return TS_INT_CST;
2215 case REAL_CST: return TS_REAL_CST;
2216 case COMPLEX_CST: return TS_COMPLEX;
2217 case VECTOR_CST: return TS_VECTOR;
2218 case STRING_CST: return TS_STRING;
2219 /* tcc_exceptional cases. */
2220 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2222 case ERROR_MARK: return TS_COMMON;
2223 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2224 case TREE_LIST: return TS_LIST;
2225 case TREE_VEC: return TS_VEC;
2226 case PHI_NODE: return TS_PHI_NODE;
2227 case SSA_NAME: return TS_SSA_NAME;
2228 case PLACEHOLDER_EXPR: return TS_COMMON;
2229 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2230 case BLOCK: return TS_BLOCK;
2231 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2232 case TREE_BINFO: return TS_BINFO;
2233 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2234 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2241 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2242 or offset that depends on a field within a record. */
2245 contains_placeholder_p (tree exp)
2247 enum tree_code code;
2252 code = TREE_CODE (exp);
2253 if (code == PLACEHOLDER_EXPR)
2256 switch (TREE_CODE_CLASS (code))
2259 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2260 position computations since they will be converted into a
2261 WITH_RECORD_EXPR involving the reference, which will assume
2262 here will be valid. */
2263 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2265 case tcc_exceptional:
2266 if (code == TREE_LIST)
2267 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2268 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2273 case tcc_comparison:
2274 case tcc_expression:
2278 /* Ignoring the first operand isn't quite right, but works best. */
2279 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2282 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2283 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2284 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2287 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2293 switch (TREE_CODE_LENGTH (code))
2296 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2298 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2299 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2310 /* Return true if any part of the computation of TYPE involves a
2311 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2312 (for QUAL_UNION_TYPE) and field positions. */
2315 type_contains_placeholder_1 (tree type)
2317 /* If the size contains a placeholder or the parent type (component type in
2318 the case of arrays) type involves a placeholder, this type does. */
2319 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2320 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2321 || (TREE_TYPE (type) != 0
2322 && type_contains_placeholder_p (TREE_TYPE (type))))
2325 /* Now do type-specific checks. Note that the last part of the check above
2326 greatly limits what we have to do below. */
2327 switch (TREE_CODE (type))
2335 case REFERENCE_TYPE:
2343 /* Here we just check the bounds. */
2344 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2345 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2348 /* We're already checked the component type (TREE_TYPE), so just check
2350 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2354 case QUAL_UNION_TYPE:
2358 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2359 if (TREE_CODE (field) == FIELD_DECL
2360 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2361 || (TREE_CODE (type) == QUAL_UNION_TYPE
2362 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2363 || type_contains_placeholder_p (TREE_TYPE (field))))
2375 type_contains_placeholder_p (tree type)
2379 /* If the contains_placeholder_bits field has been initialized,
2380 then we know the answer. */
2381 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2382 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2384 /* Indicate that we've seen this type node, and the answer is false.
2385 This is what we want to return if we run into recursion via fields. */
2386 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2388 /* Compute the real value. */
2389 result = type_contains_placeholder_1 (type);
2391 /* Store the real value. */
2392 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2397 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2398 return a tree with all occurrences of references to F in a
2399 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2400 contains only arithmetic expressions or a CALL_EXPR with a
2401 PLACEHOLDER_EXPR occurring only in its arglist. */
2404 substitute_in_expr (tree exp, tree f, tree r)
2406 enum tree_code code = TREE_CODE (exp);
2407 tree op0, op1, op2, op3;
2411 /* We handle TREE_LIST and COMPONENT_REF separately. */
2412 if (code == TREE_LIST)
2414 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2415 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2416 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2419 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2421 else if (code == COMPONENT_REF)
2423 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2424 and it is the right field, replace it with R. */
2425 for (inner = TREE_OPERAND (exp, 0);
2426 REFERENCE_CLASS_P (inner);
2427 inner = TREE_OPERAND (inner, 0))
2429 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2430 && TREE_OPERAND (exp, 1) == f)
2433 /* If this expression hasn't been completed let, leave it alone. */
2434 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2437 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2438 if (op0 == TREE_OPERAND (exp, 0))
2441 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2442 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2445 switch (TREE_CODE_CLASS (code))
2448 case tcc_declaration:
2451 case tcc_exceptional:
2454 case tcc_comparison:
2455 case tcc_expression:
2457 switch (TREE_CODE_LENGTH (code))
2463 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2464 if (op0 == TREE_OPERAND (exp, 0))
2467 new = fold_build1 (code, TREE_TYPE (exp), op0);
2471 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2472 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2474 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2477 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2481 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2482 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2483 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2485 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2486 && op2 == TREE_OPERAND (exp, 2))
2489 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2493 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2494 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2495 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2496 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2498 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2499 && op2 == TREE_OPERAND (exp, 2)
2500 && op3 == TREE_OPERAND (exp, 3))
2503 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2515 TREE_READONLY (new) = TREE_READONLY (exp);
2519 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2520 for it within OBJ, a tree that is an object or a chain of references. */
2523 substitute_placeholder_in_expr (tree exp, tree obj)
2525 enum tree_code code = TREE_CODE (exp);
2526 tree op0, op1, op2, op3;
2528 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2529 in the chain of OBJ. */
2530 if (code == PLACEHOLDER_EXPR)
2532 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2535 for (elt = obj; elt != 0;
2536 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2537 || TREE_CODE (elt) == COND_EXPR)
2538 ? TREE_OPERAND (elt, 1)
2539 : (REFERENCE_CLASS_P (elt)
2540 || UNARY_CLASS_P (elt)
2541 || BINARY_CLASS_P (elt)
2542 || EXPRESSION_CLASS_P (elt))
2543 ? TREE_OPERAND (elt, 0) : 0))
2544 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2547 for (elt = obj; elt != 0;
2548 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2549 || TREE_CODE (elt) == COND_EXPR)
2550 ? TREE_OPERAND (elt, 1)
2551 : (REFERENCE_CLASS_P (elt)
2552 || UNARY_CLASS_P (elt)
2553 || BINARY_CLASS_P (elt)
2554 || EXPRESSION_CLASS_P (elt))
2555 ? TREE_OPERAND (elt, 0) : 0))
2556 if (POINTER_TYPE_P (TREE_TYPE (elt))
2557 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2559 return fold_build1 (INDIRECT_REF, need_type, elt);
2561 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2562 survives until RTL generation, there will be an error. */
2566 /* TREE_LIST is special because we need to look at TREE_VALUE
2567 and TREE_CHAIN, not TREE_OPERANDS. */
2568 else if (code == TREE_LIST)
2570 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2571 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2572 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2575 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2578 switch (TREE_CODE_CLASS (code))
2581 case tcc_declaration:
2584 case tcc_exceptional:
2587 case tcc_comparison:
2588 case tcc_expression:
2591 switch (TREE_CODE_LENGTH (code))
2597 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2598 if (op0 == TREE_OPERAND (exp, 0))
2601 return fold_build1 (code, TREE_TYPE (exp), op0);
2604 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2605 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2607 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2610 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2613 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2614 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2615 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2617 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2618 && op2 == TREE_OPERAND (exp, 2))
2621 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2624 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2625 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2626 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2627 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2629 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2630 && op2 == TREE_OPERAND (exp, 2)
2631 && op3 == TREE_OPERAND (exp, 3))
2634 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2646 /* Stabilize a reference so that we can use it any number of times
2647 without causing its operands to be evaluated more than once.
2648 Returns the stabilized reference. This works by means of save_expr,
2649 so see the caveats in the comments about save_expr.
2651 Also allows conversion expressions whose operands are references.
2652 Any other kind of expression is returned unchanged. */
2655 stabilize_reference (tree ref)
2658 enum tree_code code = TREE_CODE (ref);
2665 /* No action is needed in this case. */
2671 case FIX_TRUNC_EXPR:
2672 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2676 result = build_nt (INDIRECT_REF,
2677 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2681 result = build_nt (COMPONENT_REF,
2682 stabilize_reference (TREE_OPERAND (ref, 0)),
2683 TREE_OPERAND (ref, 1), NULL_TREE);
2687 result = build_nt (BIT_FIELD_REF,
2688 stabilize_reference (TREE_OPERAND (ref, 0)),
2689 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2690 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2694 result = build_nt (ARRAY_REF,
2695 stabilize_reference (TREE_OPERAND (ref, 0)),
2696 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2697 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2700 case ARRAY_RANGE_REF:
2701 result = build_nt (ARRAY_RANGE_REF,
2702 stabilize_reference (TREE_OPERAND (ref, 0)),
2703 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2704 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2708 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2709 it wouldn't be ignored. This matters when dealing with
2711 return stabilize_reference_1 (ref);
2713 /* If arg isn't a kind of lvalue we recognize, make no change.
2714 Caller should recognize the error for an invalid lvalue. */
2719 return error_mark_node;
2722 TREE_TYPE (result) = TREE_TYPE (ref);
2723 TREE_READONLY (result) = TREE_READONLY (ref);
2724 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2725 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2730 /* Subroutine of stabilize_reference; this is called for subtrees of
2731 references. Any expression with side-effects must be put in a SAVE_EXPR
2732 to ensure that it is only evaluated once.
2734 We don't put SAVE_EXPR nodes around everything, because assigning very
2735 simple expressions to temporaries causes us to miss good opportunities
2736 for optimizations. Among other things, the opportunity to fold in the
2737 addition of a constant into an addressing mode often gets lost, e.g.
2738 "y[i+1] += x;". In general, we take the approach that we should not make
2739 an assignment unless we are forced into it - i.e., that any non-side effect
2740 operator should be allowed, and that cse should take care of coalescing
2741 multiple utterances of the same expression should that prove fruitful. */
2744 stabilize_reference_1 (tree e)
2747 enum tree_code code = TREE_CODE (e);
2749 /* We cannot ignore const expressions because it might be a reference
2750 to a const array but whose index contains side-effects. But we can
2751 ignore things that are actual constant or that already have been
2752 handled by this function. */
2754 if (TREE_INVARIANT (e))
2757 switch (TREE_CODE_CLASS (code))
2759 case tcc_exceptional:
2761 case tcc_declaration:
2762 case tcc_comparison:
2764 case tcc_expression:
2766 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2767 so that it will only be evaluated once. */
2768 /* The reference (r) and comparison (<) classes could be handled as
2769 below, but it is generally faster to only evaluate them once. */
2770 if (TREE_SIDE_EFFECTS (e))
2771 return save_expr (e);
2775 /* Constants need no processing. In fact, we should never reach
2780 /* Division is slow and tends to be compiled with jumps,
2781 especially the division by powers of 2 that is often
2782 found inside of an array reference. So do it just once. */
2783 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2784 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2785 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2786 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2787 return save_expr (e);
2788 /* Recursively stabilize each operand. */
2789 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2790 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2794 /* Recursively stabilize each operand. */
2795 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2802 TREE_TYPE (result) = TREE_TYPE (e);
2803 TREE_READONLY (result) = TREE_READONLY (e);
2804 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2805 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2806 TREE_INVARIANT (result) = 1;
2811 /* Low-level constructors for expressions. */
2813 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2814 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2817 recompute_tree_invariant_for_addr_expr (tree t)
2820 bool tc = true, ti = true, se = false;
2822 /* We started out assuming this address is both invariant and constant, but
2823 does not have side effects. Now go down any handled components and see if
2824 any of them involve offsets that are either non-constant or non-invariant.
2825 Also check for side-effects.
2827 ??? Note that this code makes no attempt to deal with the case where
2828 taking the address of something causes a copy due to misalignment. */
2830 #define UPDATE_TITCSE(NODE) \
2831 do { tree _node = (NODE); \
2832 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2833 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2834 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2836 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2837 node = TREE_OPERAND (node, 0))
2839 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2840 array reference (probably made temporarily by the G++ front end),
2841 so ignore all the operands. */
2842 if ((TREE_CODE (node) == ARRAY_REF
2843 || TREE_CODE (node) == ARRAY_RANGE_REF)
2844 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2846 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2847 if (TREE_OPERAND (node, 2))
2848 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2849 if (TREE_OPERAND (node, 3))
2850 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2852 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2853 FIELD_DECL, apparently. The G++ front end can put something else
2854 there, at least temporarily. */
2855 else if (TREE_CODE (node) == COMPONENT_REF
2856 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2858 if (TREE_OPERAND (node, 2))
2859 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2861 else if (TREE_CODE (node) == BIT_FIELD_REF)
2862 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2865 node = lang_hooks.expr_to_decl (node, &tc, &ti, &se);
2867 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2868 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2869 invariant and constant if the decl is static. It's also invariant if it's
2870 a decl in the current function. Taking the address of a volatile variable
2871 is not volatile. If it's a constant, the address is both invariant and
2872 constant. Otherwise it's neither. */
2873 if (TREE_CODE (node) == INDIRECT_REF)
2874 UPDATE_TITCSE (TREE_OPERAND (node, 0));
2875 else if (DECL_P (node))
2879 else if (decl_function_context (node) == current_function_decl
2880 /* Addresses of thread-local variables are invariant. */
2881 || (TREE_CODE (node) == VAR_DECL
2882 && DECL_THREAD_LOCAL_P (node)))
2887 else if (CONSTANT_CLASS_P (node))
2892 se |= TREE_SIDE_EFFECTS (node);
2895 TREE_CONSTANT (t) = tc;
2896 TREE_INVARIANT (t) = ti;
2897 TREE_SIDE_EFFECTS (t) = se;
2898 #undef UPDATE_TITCSE
2901 /* Build an expression of code CODE, data type TYPE, and operands as
2902 specified. Expressions and reference nodes can be created this way.
2903 Constants, decls, types and misc nodes cannot be.
2905 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2906 enough for all extant tree codes. */
2909 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2913 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2915 t = make_node_stat (code PASS_MEM_STAT);
2922 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2924 int length = sizeof (struct tree_exp);
2925 #ifdef GATHER_STATISTICS
2926 tree_node_kind kind;
2930 #ifdef GATHER_STATISTICS
2931 switch (TREE_CODE_CLASS (code))
2933 case tcc_statement: /* an expression with side effects */
2936 case tcc_reference: /* a reference */
2944 tree_node_counts[(int) kind]++;
2945 tree_node_sizes[(int) kind] += length;
2948 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2950 t = ggc_alloc_zone_pass_stat (length, &tree_zone);
2952 memset (t, 0, sizeof (struct tree_common));
2954 TREE_SET_CODE (t, code);
2956 TREE_TYPE (t) = type;
2957 #ifdef USE_MAPPED_LOCATION
2958 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2960 SET_EXPR_LOCUS (t, NULL);
2962 TREE_COMPLEXITY (t) = 0;
2963 TREE_OPERAND (t, 0) = node;
2964 TREE_BLOCK (t) = NULL_TREE;
2965 if (node && !TYPE_P (node))
2967 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2968 TREE_READONLY (t) = TREE_READONLY (node);
2971 if (TREE_CODE_CLASS (code) == tcc_statement)
2972 TREE_SIDE_EFFECTS (t) = 1;
2976 /* All of these have side-effects, no matter what their
2978 TREE_SIDE_EFFECTS (t) = 1;
2979 TREE_READONLY (t) = 0;
2982 case MISALIGNED_INDIRECT_REF:
2983 case ALIGN_INDIRECT_REF:
2985 /* Whether a dereference is readonly has nothing to do with whether
2986 its operand is readonly. */
2987 TREE_READONLY (t) = 0;
2992 recompute_tree_invariant_for_addr_expr (t);
2996 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
2997 && node && !TYPE_P (node)
2998 && TREE_CONSTANT (node))
2999 TREE_CONSTANT (t) = 1;
3000 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3001 && node && TREE_INVARIANT (node))
3002 TREE_INVARIANT (t) = 1;
3003 if (TREE_CODE_CLASS (code) == tcc_reference
3004 && node && TREE_THIS_VOLATILE (node))
3005 TREE_THIS_VOLATILE (t) = 1;
3012 #define PROCESS_ARG(N) \
3014 TREE_OPERAND (t, N) = arg##N; \
3015 if (arg##N &&!TYPE_P (arg##N)) \
3017 if (TREE_SIDE_EFFECTS (arg##N)) \
3019 if (!TREE_READONLY (arg##N)) \
3021 if (!TREE_CONSTANT (arg##N)) \
3023 if (!TREE_INVARIANT (arg##N)) \
3029 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3031 bool constant, read_only, side_effects, invariant;
3034 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3036 if (code == MODIFY_EXPR && cfun && cfun->gimplified)
3038 /* We should be talking GIMPLE_MODIFY_STMT by now. */
3042 /* FIXME tuples: For now let's be lazy; later we must rewrite all
3043 build2 calls to build2_gimple calls. */
3044 if (TREE_CODE_CLASS (code) == tcc_gimple_stmt)
3045 return build2_gimple (code, arg0, arg1);
3047 t = make_node_stat (code PASS_MEM_STAT);
3050 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3051 result based on those same flags for the arguments. But if the
3052 arguments aren't really even `tree' expressions, we shouldn't be trying
3055 /* Expressions without side effects may be constant if their
3056 arguments are as well. */
3057 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3058 || TREE_CODE_CLASS (code) == tcc_binary);
3060 side_effects = TREE_SIDE_EFFECTS (t);
3061 invariant = constant;
3066 TREE_READONLY (t) = read_only;
3067 TREE_CONSTANT (t) = constant;
3068 TREE_INVARIANT (t) = invariant;
3069 TREE_SIDE_EFFECTS (t) = side_effects;
3070 TREE_THIS_VOLATILE (t)
3071 = (TREE_CODE_CLASS (code) == tcc_reference
3072 && arg0 && TREE_THIS_VOLATILE (arg0));
3078 /* Similar as build2_stat, but for GIMPLE tuples. For convenience's sake,
3079 arguments and return type are trees. */
3082 build2_gimple_stat (enum tree_code code, tree arg0, tree arg1 MEM_STAT_DECL)
3087 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3089 t = make_node_stat (code PASS_MEM_STAT);
3091 side_effects = TREE_SIDE_EFFECTS (t);
3093 /* ?? We don't care about setting flags for tuples... */
3094 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3095 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3097 /* ...except perhaps side_effects and volatility. ?? */
3098 TREE_SIDE_EFFECTS (t) = side_effects;
3099 TREE_THIS_VOLATILE (t) = (TREE_CODE_CLASS (code) == tcc_reference
3100 && arg0 && TREE_THIS_VOLATILE (arg0));
3107 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3108 tree arg2 MEM_STAT_DECL)
3110 bool constant, read_only, side_effects, invariant;
3113 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3115 t = make_node_stat (code PASS_MEM_STAT);
3118 side_effects = TREE_SIDE_EFFECTS (t);
3124 if (code == CALL_EXPR && !side_effects)
3129 /* Calls have side-effects, except those to const or
3131 i = call_expr_flags (t);
3132 if (!(i & (ECF_CONST | ECF_PURE)))
3135 /* And even those have side-effects if their arguments do. */
3136 else for (node = arg1; node; node = TREE_CHAIN (node))
3137 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
3144 TREE_SIDE_EFFECTS (t) = side_effects;
3145 TREE_THIS_VOLATILE (t)
3146 = (TREE_CODE_CLASS (code) == tcc_reference
3147 && arg0 && TREE_THIS_VOLATILE (arg0));
3153 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3154 tree arg2, tree arg3 MEM_STAT_DECL)
3156 bool constant, read_only, side_effects, invariant;
3159 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3161 t = make_node_stat (code PASS_MEM_STAT);
3164 side_effects = TREE_SIDE_EFFECTS (t);
3171 TREE_SIDE_EFFECTS (t) = side_effects;
3172 TREE_THIS_VOLATILE (t)
3173 = (TREE_CODE_CLASS (code) == tcc_reference
3174 && arg0 && TREE_THIS_VOLATILE (arg0));
3180 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3181 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3183 bool constant, read_only, side_effects, invariant;
3186 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3188 t = make_node_stat (code PASS_MEM_STAT);
3191 side_effects = TREE_SIDE_EFFECTS (t);
3199 TREE_SIDE_EFFECTS (t) = side_effects;
3200 TREE_THIS_VOLATILE (t)
3201 = (TREE_CODE_CLASS (code) == tcc_reference
3202 && arg0 && TREE_THIS_VOLATILE (arg0));
3208 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3209 tree arg2, tree arg3, tree arg4, tree arg5,
3210 tree arg6 MEM_STAT_DECL)
3212 bool constant, read_only, side_effects, invariant;
3215 gcc_assert (code == TARGET_MEM_REF);
3217 t = make_node_stat (code PASS_MEM_STAT);
3220 side_effects = TREE_SIDE_EFFECTS (t);
3230 TREE_SIDE_EFFECTS (t) = side_effects;
3231 TREE_THIS_VOLATILE (t) = 0;
3236 /* Similar except don't specify the TREE_TYPE
3237 and leave the TREE_SIDE_EFFECTS as 0.
3238 It is permissible for arguments to be null,
3239 or even garbage if their values do not matter. */
3242 build_nt (enum tree_code code, ...)
3251 t = make_node (code);
3252 length = TREE_CODE_LENGTH (code);
3254 for (i = 0; i < length; i++)
3255 TREE_OPERAND (t, i) = va_arg (p, tree);
3261 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3262 We do NOT enter this node in any sort of symbol table.
3264 layout_decl is used to set up the decl's storage layout.
3265 Other slots are initialized to 0 or null pointers. */
3268 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3272 t = make_node_stat (code PASS_MEM_STAT);
3274 /* if (type == error_mark_node)
3275 type = integer_type_node; */
3276 /* That is not done, deliberately, so that having error_mark_node
3277 as the type can suppress useless errors in the use of this variable. */
3279 DECL_NAME (t) = name;
3280 TREE_TYPE (t) = type;
3282 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3284 else if (code == FUNCTION_DECL)
3285 DECL_MODE (t) = FUNCTION_MODE;
3290 /* Builds and returns function declaration with NAME and TYPE. */
3293 build_fn_decl (const char *name, tree type)
3295 tree id = get_identifier (name);
3296 tree decl = build_decl (FUNCTION_DECL, id, type);
3298 DECL_EXTERNAL (decl) = 1;
3299 TREE_PUBLIC (decl) = 1;
3300 DECL_ARTIFICIAL (decl) = 1;
3301 TREE_NOTHROW (decl) = 1;
3307 /* BLOCK nodes are used to represent the structure of binding contours
3308 and declarations, once those contours have been exited and their contents
3309 compiled. This information is used for outputting debugging info. */
3312 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3314 tree block = make_node (BLOCK);
3316 BLOCK_VARS (block) = vars;
3317 BLOCK_SUBBLOCKS (block) = subblocks;
3318 BLOCK_SUPERCONTEXT (block) = supercontext;
3319 BLOCK_CHAIN (block) = chain;
3323 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3324 /* ??? gengtype doesn't handle conditionals */
3325 static GTY(()) source_locus last_annotated_node;
3328 #ifdef USE_MAPPED_LOCATION
3331 expand_location (source_location loc)
3333 expanded_location xloc;
3342 const struct line_map *map = linemap_lookup (&line_table, loc);
3343 xloc.file = map->to_file;
3344 xloc.line = SOURCE_LINE (map, loc);
3345 xloc.column = SOURCE_COLUMN (map, loc);
3352 /* Record the exact location where an expression or an identifier were
3356 annotate_with_file_line (tree node, const char *file, int line)
3358 /* Roughly one percent of the calls to this function are to annotate
3359 a node with the same information already attached to that node!
3360 Just return instead of wasting memory. */
3361 if (EXPR_LOCUS (node)
3362 && EXPR_LINENO (node) == line
3363 && (EXPR_FILENAME (node) == file
3364 || !strcmp (EXPR_FILENAME (node), file)))
3366 last_annotated_node = EXPR_LOCUS (node);
3370 /* In heavily macroized code (such as GCC itself) this single
3371 entry cache can reduce the number of allocations by more
3373 if (last_annotated_node
3374 && last_annotated_node->line == line
3375 && (last_annotated_node->file == file
3376 || !strcmp (last_annotated_node->file, file)))
3378 SET_EXPR_LOCUS (node, last_annotated_node);
3382 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
3383 EXPR_LINENO (node) = line;
3384 EXPR_FILENAME (node) = file;
3385 last_annotated_node = EXPR_LOCUS (node);
3389 annotate_with_locus (tree node, location_t locus)
3391 annotate_with_file_line (node, locus.file, locus.line);
3395 /* Source location accessor functions. */
3398 /* The source location of this expression. Non-tree_exp nodes such as
3399 decls and constants can be shared among multiple locations, so
3402 expr_location (tree node)
3404 #ifdef USE_MAPPED_LOCATION
3405 if (GIMPLE_STMT_P (node))
3406 return GIMPLE_STMT_LOCUS (node);
3407 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3409 if (GIMPLE_STMT_P (node))
3410 return EXPR_HAS_LOCATION (node)
3411 ? *GIMPLE_STMT_LOCUS (node) : UNKNOWN_LOCATION;
3412 return EXPR_HAS_LOCATION (node) ? *node->exp.locus : UNKNOWN_LOCATION;
3417 set_expr_location (tree node, location_t locus)
3419 #ifdef USE_MAPPED_LOCATION
3420 if (GIMPLE_STMT_P (node))
3421 GIMPLE_STMT_LOCUS (node) = locus;
3423 EXPR_CHECK (node)->exp.locus = locus;
3425 annotate_with_locus (node, locus);
3430 expr_has_location (tree node)
3432 #ifdef USE_MAPPED_LOCATION
3433 return expr_location (node) != UNKNOWN_LOCATION;
3435 return expr_locus (node) != NULL;
3439 #ifdef USE_MAPPED_LOCATION
3444 expr_locus (tree node)
3446 #ifdef USE_MAPPED_LOCATION
3447 if (GIMPLE_STMT_P (node))
3448 return &GIMPLE_STMT_LOCUS (node);
3449 return EXPR_P (node) ? &node->exp.locus : (location_t *) NULL;
3451 if (GIMPLE_STMT_P (node))
3452 return GIMPLE_STMT_LOCUS (node);
3453 /* ?? The cast below was originally "(location_t *)" in the macro,
3454 but that makes no sense. ?? */
3455 return EXPR_P (node) ? node->exp.locus : (source_locus) NULL;
3460 set_expr_locus (tree node,
3461 #ifdef USE_MAPPED_LOCATION
3462 source_location *loc
3468 #ifdef USE_MAPPED_LOCATION
3471 if (GIMPLE_STMT_P (node))
3472 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3474 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3478 if (GIMPLE_STMT_P (node))
3479 GIMPLE_STMT_LOCUS (node) = *loc;
3481 EXPR_CHECK (node)->exp.locus = *loc;
3484 if (GIMPLE_STMT_P (node))
3485 GIMPLE_STMT_LOCUS (node) = loc;
3487 EXPR_CHECK (node)->exp.locus = loc;
3492 expr_filename (tree node)
3494 #ifdef USE_MAPPED_LOCATION
3495 if (GIMPLE_STMT_P (node))
3496 return &LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3497 return &LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3499 if (GIMPLE_STMT_P (node))
3500 return &GIMPLE_STMT_LOCUS (node)->file;
3501 return &(EXPR_CHECK (node)->exp.locus->file);
3506 expr_lineno (tree node)
3508 #ifdef USE_MAPPED_LOCATION
3509 if (GIMPLE_STMT_P (node))
3510 return &LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3511 return &LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3513 if (GIMPLE_STMT_P (node))
3514 return &GIMPLE_STMT_LOCUS (node)->line;
3515 return &EXPR_CHECK (node)->exp.locus->line;
3519 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3523 build_decl_attribute_variant (tree ddecl, tree attribute)
3525 DECL_ATTRIBUTES (ddecl) = attribute;
3529 /* Borrowed from hashtab.c iterative_hash implementation. */
3530 #define mix(a,b,c) \
3532 a -= b; a -= c; a ^= (c>>13); \
3533 b -= c; b -= a; b ^= (a<< 8); \
3534 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3535 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3536 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3537 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3538 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3539 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3540 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3544 /* Produce good hash value combining VAL and VAL2. */
3545 static inline hashval_t
3546 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3548 /* the golden ratio; an arbitrary value. */
3549 hashval_t a = 0x9e3779b9;
3555 /* Produce good hash value combining PTR and VAL2. */
3556 static inline hashval_t
3557 iterative_hash_pointer (void *ptr, hashval_t val2)
3559 if (sizeof (ptr) == sizeof (hashval_t))
3560 return iterative_hash_hashval_t ((size_t) ptr, val2);
3563 hashval_t a = (hashval_t) (size_t) ptr;
3564 /* Avoid warnings about shifting of more than the width of the type on
3565 hosts that won't execute this path. */
3567 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3573 /* Produce good hash value combining VAL and VAL2. */
3574 static inline hashval_t
3575 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3577 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3578 return iterative_hash_hashval_t (val, val2);
3581 hashval_t a = (hashval_t) val;
3582 /* Avoid warnings about shifting of more than the width of the type on
3583 hosts that won't execute this path. */
3585 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3587 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3589 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3590 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3597 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3598 is ATTRIBUTE and its qualifiers are QUALS.
3600 Record such modified types already made so we don't make duplicates. */
3603 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3605 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3607 hashval_t hashcode = 0;
3609 enum tree_code code = TREE_CODE (ttype);
3611 ntype = copy_node (ttype);
3613 TYPE_POINTER_TO (ntype) = 0;
3614 TYPE_REFERENCE_TO (ntype) = 0;
3615 TYPE_ATTRIBUTES (ntype) = attribute;
3617 /* Create a new main variant of TYPE. */
3618 TYPE_MAIN_VARIANT (ntype) = ntype;
3619 TYPE_NEXT_VARIANT (ntype) = 0;
3620 set_type_quals (ntype, TYPE_UNQUALIFIED);
3622 hashcode = iterative_hash_object (code, hashcode);
3623 if (TREE_TYPE (ntype))
3624 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3626 hashcode = attribute_hash_list (attribute, hashcode);
3628 switch (TREE_CODE (ntype))
3631 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3634 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3638 hashcode = iterative_hash_object
3639 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3640 hashcode = iterative_hash_object
3641 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3645 unsigned int precision = TYPE_PRECISION (ntype);
3646 hashcode = iterative_hash_object (precision, hashcode);
3653 ntype = type_hash_canon (hashcode, ntype);
3654 ttype = build_qualified_type (ntype, quals);
3661 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3664 Record such modified types already made so we don't make duplicates. */
3667 build_type_attribute_variant (tree ttype, tree attribute)
3669 return build_type_attribute_qual_variant (ttype, attribute,
3670 TYPE_QUALS (ttype));
3673 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3676 We try both `text' and `__text__', ATTR may be either one. */
3677 /* ??? It might be a reasonable simplification to require ATTR to be only
3678 `text'. One might then also require attribute lists to be stored in
3679 their canonicalized form. */
3682 is_attribute_with_length_p (const char *attr, int attr_len, tree ident)
3687 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3690 p = IDENTIFIER_POINTER (ident);
3691 ident_len = IDENTIFIER_LENGTH (ident);
3693 if (ident_len == attr_len
3694 && strcmp (attr, p) == 0)
3697 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3700 gcc_assert (attr[1] == '_');
3701 gcc_assert (attr[attr_len - 2] == '_');
3702 gcc_assert (attr[attr_len - 1] == '_');
3703 if (ident_len == attr_len - 4
3704 && strncmp (attr + 2, p, attr_len - 4) == 0)
3709 if (ident_len == attr_len + 4
3710 && p[0] == '_' && p[1] == '_'
3711 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3712 && strncmp (attr, p + 2, attr_len) == 0)
3719 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3722 We try both `text' and `__text__', ATTR may be either one. */
3725 is_attribute_p (const char *attr, tree ident)
3727 return is_attribute_with_length_p (attr, strlen (attr), ident);
3730 /* Given an attribute name and a list of attributes, return a pointer to the
3731 attribute's list element if the attribute is part of the list, or NULL_TREE
3732 if not found. If the attribute appears more than once, this only
3733 returns the first occurrence; the TREE_CHAIN of the return value should
3734 be passed back in if further occurrences are wanted. */
3737 lookup_attribute (const char *attr_name, tree list)
3740 size_t attr_len = strlen (attr_name);
3742 for (l = list; l; l = TREE_CHAIN (l))
3744 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3745 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3752 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3756 remove_attribute (const char *attr_name, tree list)
3759 size_t attr_len = strlen (attr_name);
3761 for (p = &list; *p; )
3764 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3765 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3766 *p = TREE_CHAIN (l);
3768 p = &TREE_CHAIN (l);
3774 /* Return an attribute list that is the union of a1 and a2. */
3777 merge_attributes (tree a1, tree a2)
3781 /* Either one unset? Take the set one. */
3783 if ((attributes = a1) == 0)
3786 /* One that completely contains the other? Take it. */
3788 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3790 if (attribute_list_contained (a2, a1))
3794 /* Pick the longest list, and hang on the other list. */
3796 if (list_length (a1) < list_length (a2))
3797 attributes = a2, a2 = a1;
3799 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3802 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3805 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3808 if (TREE_VALUE (a) != NULL
3809 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3810 && TREE_VALUE (a2) != NULL
3811 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3813 if (simple_cst_list_equal (TREE_VALUE (a),
3814 TREE_VALUE (a2)) == 1)
3817 else if (simple_cst_equal (TREE_VALUE (a),
3818 TREE_VALUE (a2)) == 1)
3823 a1 = copy_node (a2);
3824 TREE_CHAIN (a1) = attributes;
3833 /* Given types T1 and T2, merge their attributes and return
3837 merge_type_attributes (tree t1, tree t2)
3839 return merge_attributes (TYPE_ATTRIBUTES (t1),
3840 TYPE_ATTRIBUTES (t2));
3843 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3847 merge_decl_attributes (tree olddecl, tree newdecl)
3849 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3850 DECL_ATTRIBUTES (newdecl));
3853 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3855 /* Specialization of merge_decl_attributes for various Windows targets.
3857 This handles the following situation:
3859 __declspec (dllimport) int foo;
3862 The second instance of `foo' nullifies the dllimport. */
3865 merge_dllimport_decl_attributes (tree old, tree new)
3868 int delete_dllimport_p = 1;
3870 /* What we need to do here is remove from `old' dllimport if it doesn't
3871 appear in `new'. dllimport behaves like extern: if a declaration is
3872 marked dllimport and a definition appears later, then the object
3873 is not dllimport'd. We also remove a `new' dllimport if the old list
3874 contains dllexport: dllexport always overrides dllimport, regardless
3875 of the order of declaration. */
3876 if (!VAR_OR_FUNCTION_DECL_P (new))
3877 delete_dllimport_p = 0;
3878 else if (DECL_DLLIMPORT_P (new)
3879 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3881 DECL_DLLIMPORT_P (new) = 0;
3882 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3883 "dllimport ignored", new);
3885 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3887 /* Warn about overriding a symbol that has already been used. eg:
3888 extern int __attribute__ ((dllimport)) foo;
3889 int* bar () {return &foo;}
3892 if (TREE_USED (old))
3894 warning (0, "%q+D redeclared without dllimport attribute "
3895 "after being referenced with dll linkage", new);
3896 /* If we have used a variable's address with dllimport linkage,
3897 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3898 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3900 We still remove the attribute so that assembler code refers
3901 to '&foo rather than '_imp__foo'. */
3902 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3903 DECL_DLLIMPORT_P (new) = 1;
3906 /* Let an inline definition silently override the external reference,
3907 but otherwise warn about attribute inconsistency. */
3908 else if (TREE_CODE (new) == VAR_DECL
3909 || !DECL_DECLARED_INLINE_P (new))
3910 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3911 "previous dllimport ignored", new);
3914 delete_dllimport_p = 0;
3916 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3918 if (delete_dllimport_p)
3921 const size_t attr_len = strlen ("dllimport");
3923 /* Scan the list for dllimport and delete it. */
3924 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3926 if (is_attribute_with_length_p ("dllimport", attr_len,
3929 if (prev == NULL_TREE)
3932 TREE_CHAIN (prev) = TREE_CHAIN (t);
3941 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3942 struct attribute_spec.handler. */
3945 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3950 /* These attributes may apply to structure and union types being created,
3951 but otherwise should pass to the declaration involved. */
3954 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3955 | (int) ATTR_FLAG_ARRAY_NEXT))
3957 *no_add_attrs = true;
3958 return tree_cons (name, args, NULL_TREE);
3960 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3962 warning (OPT_Wattributes, "%qs attribute ignored",
3963 IDENTIFIER_POINTER (name));
3964 *no_add_attrs = true;
3970 if (TREE_CODE (node) != FUNCTION_DECL
3971 && TREE_CODE (node) != VAR_DECL)
3973 *no_add_attrs = true;
3974 warning (OPT_Wattributes, "%qs attribute ignored",
3975 IDENTIFIER_POINTER (name));
3979 /* Report error on dllimport ambiguities seen now before they cause
3981 else if (is_attribute_p ("dllimport", name))
3983 /* Honor any target-specific overrides. */
3984 if (!targetm.valid_dllimport_attribute_p (node))
3985 *no_add_attrs = true;
3987 else if (TREE_CODE (node) == FUNCTION_DECL
3988 && DECL_DECLARED_INLINE_P (node))
3990 warning (OPT_Wattributes, "inline function %q+D declared as "
3991 " dllimport: attribute ignored", node);
3992 *no_add_attrs = true;
3994 /* Like MS, treat definition of dllimported variables and
3995 non-inlined functions on declaration as syntax errors. */
3996 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
3998 error ("function %q+D definition is marked dllimport", node);
3999 *no_add_attrs = true;
4002 else if (TREE_CODE (node) == VAR_DECL)
4004 if (DECL_INITIAL (node))
4006 error ("variable %q+D definition is marked dllimport",
4008 *no_add_attrs = true;
4011 /* `extern' needn't be specified with dllimport.
4012 Specify `extern' now and hope for the best. Sigh. */
4013 DECL_EXTERNAL (node) = 1;
4014 /* Also, implicitly give dllimport'd variables declared within
4015 a function global scope, unless declared static. */
4016 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4017 TREE_PUBLIC (node) = 1;
4020 if (*no_add_attrs == false)
4021 DECL_DLLIMPORT_P (node) = 1;
4024 /* Report error if symbol is not accessible at global scope. */
4025 if (!TREE_PUBLIC (node)
4026 && (TREE_CODE (node) == VAR_DECL
4027 || TREE_CODE (node) == FUNCTION_DECL))
4029 error ("external linkage required for symbol %q+D because of "
4030 "%qs attribute", node, IDENTIFIER_POINTER (name));
4031 *no_add_attrs = true;
4037 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4039 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4040 of the various TYPE_QUAL values. */
4043 set_type_quals (tree type, int type_quals)
4045 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4046 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4047 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4050 /* Returns true iff cand is equivalent to base with type_quals. */
4053 check_qualified_type (tree cand, tree base, int type_quals)
4055 return (TYPE_QUALS (cand) == type_quals
4056 && TYPE_NAME (cand) == TYPE_NAME (base)
4057 /* Apparently this is needed for Objective-C. */
4058 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4059 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4060 TYPE_ATTRIBUTES (base)));
4063 /* Return a version of the TYPE, qualified as indicated by the
4064 TYPE_QUALS, if one exists. If no qualified version exists yet,
4065 return NULL_TREE. */
4068 get_qualified_type (tree type, int type_quals)
4072 if (TYPE_QUALS (type) == type_quals)
4075 /* Search the chain of variants to see if there is already one there just
4076 like the one we need to have. If so, use that existing one. We must
4077 preserve the TYPE_NAME, since there is code that depends on this. */
4078 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4079 if (check_qualified_type (t, type, type_quals))
4085 /* Like get_qualified_type, but creates the type if it does not
4086 exist. This function never returns NULL_TREE. */
4089 build_qualified_type (tree type, int type_quals)
4093 /* See if we already have the appropriate qualified variant. */
4094 t = get_qualified_type (type, type_quals);
4096 /* If not, build it. */
4099 t = build_variant_type_copy (type);
4100 set_type_quals (t, type_quals);
4106 /* Create a new distinct copy of TYPE. The new type is made its own
4110 build_distinct_type_copy (tree type)
4112 tree t = copy_node (type);
4114 TYPE_POINTER_TO (t) = 0;
4115 TYPE_REFERENCE_TO (t) = 0;
4117 /* Make it its own variant. */
4118 TYPE_MAIN_VARIANT (t) = t;
4119 TYPE_NEXT_VARIANT (t) = 0;
4124 /* Create a new variant of TYPE, equivalent but distinct.
4125 This is so the caller can modify it. */
4128 build_variant_type_copy (tree type)
4130 tree t, m = TYPE_MAIN_VARIANT (type);
4132 t = build_distinct_type_copy (type);
4134 /* Add the new type to the chain of variants of TYPE. */
4135 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4136 TYPE_NEXT_VARIANT (m) = t;
4137 TYPE_MAIN_VARIANT (t) = m;
4142 /* Return true if the from tree in both tree maps are equal. */
4145 tree_map_eq (const void *va, const void *vb)
4147 const struct tree_map *a = va, *b = vb;
4148 return (a->from == b->from);
4151 /* Hash a from tree in a tree_map. */
4154 tree_map_hash (const void *item)
4156 return (((const struct tree_map *) item)->hash);
4159 /* Return true if this tree map structure is marked for garbage collection
4160 purposes. We simply return true if the from tree is marked, so that this
4161 structure goes away when the from tree goes away. */
4164 tree_map_marked_p (const void *p)
4166 tree from = ((struct tree_map *) p)->from;
4168 return ggc_marked_p (from);
4171 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
4174 tree_int_map_eq (const void *va, const void *vb)
4176 const struct tree_int_map *a = va, *b = vb;
4177 return (a->from == b->from);
4180 /* Hash a from tree in the tree_int_map * ITEM. */
4183 tree_int_map_hash (const void *item)
4185 return htab_hash_pointer (((const struct tree_int_map *)item)->from);
4188 /* Return true if this tree int map structure is marked for garbage collection
4189 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
4190 structure goes away when the from tree goes away. */
4193 tree_int_map_marked_p (const void *p)
4195 tree from = ((struct tree_int_map *) p)->from;
4197 return ggc_marked_p (from);
4199 /* Lookup an init priority for FROM, and return it if we find one. */
4202 decl_init_priority_lookup (tree from)
4204 struct tree_int_map *h, in;
4207 h = htab_find_with_hash (init_priority_for_decl,
4208 &in, htab_hash_pointer (from));
4214 /* Insert a mapping FROM->TO in the init priority hashtable. */
4217 decl_init_priority_insert (tree from, unsigned short to)
4219 struct tree_int_map *h;
4222 h = ggc_alloc (sizeof (struct tree_int_map));
4225 loc = htab_find_slot_with_hash (init_priority_for_decl, h,
4226 htab_hash_pointer (from), INSERT);
4227 *(struct tree_int_map **) loc = h;
4230 /* Look up a restrict qualified base decl for FROM. */
4233 decl_restrict_base_lookup (tree from)
4239 h = htab_find_with_hash (restrict_base_for_decl, &in,
4240 htab_hash_pointer (from));
4241 return h ? h->to : NULL_TREE;
4244 /* Record the restrict qualified base TO for FROM. */
4247 decl_restrict_base_insert (tree from, tree to)
4252 h = ggc_alloc (sizeof (struct tree_map));
4253 h->hash = htab_hash_pointer (from);
4256 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4257 *(struct tree_map **) loc = h;
4260 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4263 print_debug_expr_statistics (void)
4265 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4266 (long) htab_size (debug_expr_for_decl),
4267 (long) htab_elements (debug_expr_for_decl),
4268 htab_collisions (debug_expr_for_decl));
4271 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4274 print_value_expr_statistics (void)
4276 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4277 (long) htab_size (value_expr_for_decl),
4278 (long) htab_elements (value_expr_for_decl),
4279 htab_collisions (value_expr_for_decl));
4282 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4283 don't print anything if the table is empty. */
4286 print_restrict_base_statistics (void)
4288 if (htab_elements (restrict_base_for_decl) != 0)
4290 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4291 (long) htab_size (restrict_base_for_decl),
4292 (long) htab_elements (restrict_base_for_decl),
4293 htab_collisions (restrict_base_for_decl));
4296 /* Lookup a debug expression for FROM, and return it if we find one. */
4299 decl_debug_expr_lookup (tree from)
4301 struct tree_map *h, in;
4304 h = htab_find_with_hash (debug_expr_for_decl, &in, htab_hash_pointer (from));
4310 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4313 decl_debug_expr_insert (tree from, tree to)
4318 h = ggc_alloc (sizeof (struct tree_map));
4319 h->hash = htab_hash_pointer (from);
4322 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4323 *(struct tree_map **) loc = h;
4326 /* Lookup a value expression for FROM, and return it if we find one. */
4329 decl_value_expr_lookup (tree from)
4331 struct tree_map *h, in;
4334 h = htab_find_with_hash (value_expr_for_decl, &in, htab_hash_pointer (from));
4340 /* Insert a mapping FROM->TO in the value expression hashtable. */
4343 decl_value_expr_insert (tree from, tree to)
4348 h = ggc_alloc (sizeof (struct tree_map));
4349 h->hash = htab_hash_pointer (from);
4352 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4353 *(struct tree_map **) loc = h;
4356 /* Hashing of types so that we don't make duplicates.
4357 The entry point is `type_hash_canon'. */
4359 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4360 with types in the TREE_VALUE slots), by adding the hash codes
4361 of the individual types. */
4364 type_hash_list (tree list, hashval_t hashcode)
4368 for (tail = list; tail; tail = TREE_CHAIN (tail))
4369 if (TREE_VALUE (tail) != error_mark_node)
4370 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4376 /* These are the Hashtable callback functions. */
4378 /* Returns true iff the types are equivalent. */
4381 type_hash_eq (const void *va, const void *vb)
4383 const struct type_hash *a = va, *b = vb;
4385 /* First test the things that are the same for all types. */
4386 if (a->hash != b->hash
4387 || TREE_CODE (a->type) != TREE_CODE (b->type)
4388 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4389 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4390 TYPE_ATTRIBUTES (b->type))
4391 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4392 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4395 switch (TREE_CODE (a->type))
4400 case REFERENCE_TYPE:
4404 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4407 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4408 && !(TYPE_VALUES (a->type)
4409 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4410 && TYPE_VALUES (b->type)
4411 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4412 && type_list_equal (TYPE_VALUES (a->type),
4413 TYPE_VALUES (b->type))))
4416 /* ... fall through ... */
4421 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4422 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4423 TYPE_MAX_VALUE (b->type)))
4424 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4425 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4426 TYPE_MIN_VALUE (b->type))));
4429 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4432 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4433 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4434 || (TYPE_ARG_TYPES (a->type)
4435 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4436 && TYPE_ARG_TYPES (b->type)
4437 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4438 && type_list_equal (TYPE_ARG_TYPES (a->type),
4439 TYPE_ARG_TYPES (b->type)))));
4442 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4446 case QUAL_UNION_TYPE:
4447 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4448 || (TYPE_FIELDS (a->type)
4449 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4450 && TYPE_FIELDS (b->type)
4451 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4452 && type_list_equal (TYPE_FIELDS (a->type),
4453 TYPE_FIELDS (b->type))));
4456 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4457 || (TYPE_ARG_TYPES (a->type)
4458 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4459 && TYPE_ARG_TYPES (b->type)
4460 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4461 && type_list_equal (TYPE_ARG_TYPES (a->type),
4462 TYPE_ARG_TYPES (b->type))));
4469 /* Return the cached hash value. */
4472 type_hash_hash (const void *item)
4474 return ((const struct type_hash *) item)->hash;
4477 /* Look in the type hash table for a type isomorphic to TYPE.
4478 If one is found, return it. Otherwise return 0. */
4481 type_hash_lookup (hashval_t hashcode, tree type)
4483 struct type_hash *h, in;
4485 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4486 must call that routine before comparing TYPE_ALIGNs. */
4492 h = htab_find_with_hash (type_hash_table, &in, hashcode);
4498 /* Add an entry to the type-hash-table
4499 for a type TYPE whose hash code is HASHCODE. */
4502 type_hash_add (hashval_t hashcode, tree type)
4504 struct type_hash *h;
4507 h = ggc_alloc (sizeof (struct type_hash));
4510 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4511 *(struct type_hash **) loc = h;
4514 /* Given TYPE, and HASHCODE its hash code, return the canonical
4515 object for an identical type if one already exists.
4516 Otherwise, return TYPE, and record it as the canonical object.
4518 To use this function, first create a type of the sort you want.
4519 Then compute its hash code from the fields of the type that
4520 make it different from other similar types.
4521 Then call this function and use the value. */
4524 type_hash_canon (unsigned int hashcode, tree type)
4528 /* The hash table only contains main variants, so ensure that's what we're
4530 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4532 if (!lang_hooks.types.hash_types)
4535 /* See if the type is in the hash table already. If so, return it.
4536 Otherwise, add the type. */
4537 t1 = type_hash_lookup (hashcode, type);
4540 #ifdef GATHER_STATISTICS
4541 tree_node_counts[(int) t_kind]--;
4542 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4548 type_hash_add (hashcode, type);
4553 /* See if the data pointed to by the type hash table is marked. We consider
4554 it marked if the type is marked or if a debug type number or symbol
4555 table entry has been made for the type. This reduces the amount of
4556 debugging output and eliminates that dependency of the debug output on
4557 the number of garbage collections. */
4560 type_hash_marked_p (const void *p)
4562 tree type = ((struct type_hash *) p)->type;
4564 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4568 print_type_hash_statistics (void)
4570 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4571 (long) htab_size (type_hash_table),
4572 (long) htab_elements (type_hash_table),
4573 htab_collisions (type_hash_table));
4576 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4577 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4578 by adding the hash codes of the individual attributes. */
4581 attribute_hash_list (tree list, hashval_t hashcode)
4585 for (tail = list; tail; tail = TREE_CHAIN (tail))
4586 /* ??? Do we want to add in TREE_VALUE too? */
4587 hashcode = iterative_hash_object
4588 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4592 /* Given two lists of attributes, return true if list l2 is
4593 equivalent to l1. */
4596 attribute_list_equal (tree l1, tree l2)
4598 return attribute_list_contained (l1, l2)
4599 && attribute_list_contained (l2, l1);
4602 /* Given two lists of attributes, return true if list L2 is
4603 completely contained within L1. */
4604 /* ??? This would be faster if attribute names were stored in a canonicalized
4605 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4606 must be used to show these elements are equivalent (which they are). */
4607 /* ??? It's not clear that attributes with arguments will always be handled
4611 attribute_list_contained (tree l1, tree l2)
4615 /* First check the obvious, maybe the lists are identical. */
4619 /* Maybe the lists are similar. */
4620 for (t1 = l1, t2 = l2;
4622 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4623 && TREE_VALUE (t1) == TREE_VALUE (t2);
4624 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4626 /* Maybe the lists are equal. */
4627 if (t1 == 0 && t2 == 0)
4630 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4633 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
4635 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4638 if (TREE_VALUE (t2) != NULL
4639 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4640 && TREE_VALUE (attr) != NULL
4641 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4643 if (simple_cst_list_equal (TREE_VALUE (t2),
4644 TREE_VALUE (attr)) == 1)
4647 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4658 /* Given two lists of types
4659 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4660 return 1 if the lists contain the same types in the same order.
4661 Also, the TREE_PURPOSEs must match. */
4664 type_list_equal (tree l1, tree l2)
4668 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4669 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4670 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4671 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4672 && (TREE_TYPE (TREE_PURPOSE (t1))
4673 == TREE_TYPE (TREE_PURPOSE (t2))))))
4679 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4680 given by TYPE. If the argument list accepts variable arguments,
4681 then this function counts only the ordinary arguments. */
4684 type_num_arguments (tree type)
4689 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4690 /* If the function does not take a variable number of arguments,
4691 the last element in the list will have type `void'. */
4692 if (VOID_TYPE_P (TREE_VALUE (t)))
4700 /* Nonzero if integer constants T1 and T2
4701 represent the same constant value. */
4704 tree_int_cst_equal (tree t1, tree t2)
4709 if (t1 == 0 || t2 == 0)
4712 if (TREE_CODE (t1) == INTEGER_CST
4713 && TREE_CODE (t2) == INTEGER_CST
4714 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4715 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4721 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4722 The precise way of comparison depends on their data type. */
4725 tree_int_cst_lt (tree t1, tree t2)
4730 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4732 int t1_sgn = tree_int_cst_sgn (t1);
4733 int t2_sgn = tree_int_cst_sgn (t2);
4735 if (t1_sgn < t2_sgn)
4737 else if (t1_sgn > t2_sgn)
4739 /* Otherwise, both are non-negative, so we compare them as
4740 unsigned just in case one of them would overflow a signed
4743 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4744 return INT_CST_LT (t1, t2);
4746 return INT_CST_LT_UNSIGNED (t1, t2);
4749 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4752 tree_int_cst_compare (tree t1, tree t2)
4754 if (tree_int_cst_lt (t1, t2))
4756 else if (tree_int_cst_lt (t2, t1))
4762 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4763 the host. If POS is zero, the value can be represented in a single
4764 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4765 be represented in a single unsigned HOST_WIDE_INT. */
4768 host_integerp (tree t, int pos)
4770 return (TREE_CODE (t) == INTEGER_CST
4771 && ((TREE_INT_CST_HIGH (t) == 0
4772 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4773 || (! pos && TREE_INT_CST_HIGH (t) == -1
4774 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4775 && !TYPE_UNSIGNED (TREE_TYPE (t)))
4776 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4779 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4780 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4781 be non-negative. We must be able to satisfy the above conditions. */
4784 tree_low_cst (tree t, int pos)
4786 gcc_assert (host_integerp (t, pos));
4787 return TREE_INT_CST_LOW (t);
4790 /* Return the most significant bit of the integer constant T. */
4793 tree_int_cst_msb (tree t)
4797 unsigned HOST_WIDE_INT l;
4799 /* Note that using TYPE_PRECISION here is wrong. We care about the
4800 actual bits, not the (arbitrary) range of the type. */
4801 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4802 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4803 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4804 return (l & 1) == 1;
4807 /* Return an indication of the sign of the integer constant T.
4808 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4809 Note that -1 will never be returned if T's type is unsigned. */
4812 tree_int_cst_sgn (tree t)
4814 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4816 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4818 else if (TREE_INT_CST_HIGH (t) < 0)
4824 /* Compare two constructor-element-type constants. Return 1 if the lists
4825 are known to be equal; otherwise return 0. */
4828 simple_cst_list_equal (tree l1, tree l2)
4830 while (l1 != NULL_TREE && l2 != NULL_TREE)
4832 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4835 l1 = TREE_CHAIN (l1);
4836 l2 = TREE_CHAIN (l2);
4842 /* Return truthvalue of whether T1 is the same tree structure as T2.
4843 Return 1 if they are the same.
4844 Return 0 if they are understandably different.
4845 Return -1 if either contains tree structure not understood by
4849 simple_cst_equal (tree t1, tree t2)
4851 enum tree_code code1, code2;
4857 if (t1 == 0 || t2 == 0)
4860 code1 = TREE_CODE (t1);
4861 code2 = TREE_CODE (t2);
4863 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
4865 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4866 || code2 == NON_LVALUE_EXPR)
4867 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4869 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
4872 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
4873 || code2 == NON_LVALUE_EXPR)
4874 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
4882 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4883 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
4886 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
4889 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
4890 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
4891 TREE_STRING_LENGTH (t1)));
4895 unsigned HOST_WIDE_INT idx;
4896 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
4897 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
4899 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
4902 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
4903 /* ??? Should we handle also fields here? */
4904 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
4905 VEC_index (constructor_elt, v2, idx)->value))
4911 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4914 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4918 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4921 /* Special case: if either target is an unallocated VAR_DECL,
4922 it means that it's going to be unified with whatever the
4923 TARGET_EXPR is really supposed to initialize, so treat it
4924 as being equivalent to anything. */
4925 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
4926 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
4927 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
4928 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
4929 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
4930 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
4933 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4938 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
4940 case WITH_CLEANUP_EXPR:
4941 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4945 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
4948 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
4949 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
4963 /* This general rule works for most tree codes. All exceptions should be
4964 handled above. If this is a language-specific tree code, we can't
4965 trust what might be in the operand, so say we don't know
4967 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
4970 switch (TREE_CODE_CLASS (code1))
4974 case tcc_comparison:
4975 case tcc_expression:
4979 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
4981 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
4993 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4994 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4995 than U, respectively. */
4998 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
5000 if (tree_int_cst_sgn (t) < 0)
5002 else if (TREE_INT_CST_HIGH (t) != 0)
5004 else if (TREE_INT_CST_LOW (t) == u)
5006 else if (TREE_INT_CST_LOW (t) < u)
5012 /* Return true if CODE represents an associative tree code. Otherwise
5015 associative_tree_code (enum tree_code code)
5034 /* Return true if CODE represents a commutative tree code. Otherwise
5037 commutative_tree_code (enum tree_code code)
5050 case UNORDERED_EXPR:
5054 case TRUTH_AND_EXPR:
5055 case TRUTH_XOR_EXPR:
5065 /* Generate a hash value for an expression. This can be used iteratively
5066 by passing a previous result as the "val" argument.
5068 This function is intended to produce the same hash for expressions which
5069 would compare equal using operand_equal_p. */
5072 iterative_hash_expr (tree t, hashval_t val)
5075 enum tree_code code;
5079 return iterative_hash_pointer (t, val);
5081 code = TREE_CODE (t);
5085 /* Alas, constants aren't shared, so we can't rely on pointer
5088 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5089 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5092 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5094 return iterative_hash_hashval_t (val2, val);
5097 return iterative_hash (TREE_STRING_POINTER (t),
5098 TREE_STRING_LENGTH (t), val);
5100 val = iterative_hash_expr (TREE_REALPART (t), val);
5101 return iterative_hash_expr (TREE_IMAGPART (t), val);
5103 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5107 /* we can just compare by pointer. */
5108 return iterative_hash_pointer (t, val);
5111 /* A list of expressions, for a CALL_EXPR or as the elements of a
5113 for (; t; t = TREE_CHAIN (t))
5114 val = iterative_hash_expr (TREE_VALUE (t), val);
5118 unsigned HOST_WIDE_INT idx;
5120 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5122 val = iterative_hash_expr (field, val);
5123 val = iterative_hash_expr (value, val);
5128 /* When referring to a built-in FUNCTION_DECL, use the
5129 __builtin__ form. Otherwise nodes that compare equal
5130 according to operand_equal_p might get different
5132 if (DECL_BUILT_IN (t))
5134 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5138 /* else FALL THROUGH */
5140 class = TREE_CODE_CLASS (code);
5142 if (class == tcc_declaration)
5144 /* DECL's have a unique ID */
5145 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5149 gcc_assert (IS_EXPR_CODE_CLASS (class));
5151 val = iterative_hash_object (code, val);
5153 /* Don't hash the type, that can lead to having nodes which
5154 compare equal according to operand_equal_p, but which
5155 have different hash codes. */
5156 if (code == NOP_EXPR
5157 || code == CONVERT_EXPR
5158 || code == NON_LVALUE_EXPR)
5160 /* Make sure to include signness in the hash computation. */
5161 val += TYPE_UNSIGNED (TREE_TYPE (t));
5162 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5165 else if (commutative_tree_code (code))
5167 /* It's a commutative expression. We want to hash it the same
5168 however it appears. We do this by first hashing both operands
5169 and then rehashing based on the order of their independent
5171 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5172 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5176 t = one, one = two, two = t;
5178 val = iterative_hash_hashval_t (one, val);
5179 val = iterative_hash_hashval_t (two, val);
5182 for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i)
5183 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5190 /* Constructors for pointer, array and function types.
5191 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5192 constructed by language-dependent code, not here.) */
5194 /* Construct, lay out and return the type of pointers to TO_TYPE with
5195 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5196 reference all of memory. If such a type has already been
5197 constructed, reuse it. */
5200 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5205 if (to_type == error_mark_node)
5206 return error_mark_node;
5208 /* In some cases, languages will have things that aren't a POINTER_TYPE
5209 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5210 In that case, return that type without regard to the rest of our
5213 ??? This is a kludge, but consistent with the way this function has
5214 always operated and there doesn't seem to be a good way to avoid this
5216 if (TYPE_POINTER_TO (to_type) != 0
5217 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5218 return TYPE_POINTER_TO (to_type);
5220 /* First, if we already have a type for pointers to TO_TYPE and it's
5221 the proper mode, use it. */
5222 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5223 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5226 t = make_node (POINTER_TYPE);
5228 TREE_TYPE (t) = to_type;
5229 TYPE_MODE (t) = mode;
5230 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5231 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5232 TYPE_POINTER_TO (to_type) = t;
5234 /* Lay out the type. This function has many callers that are concerned
5235 with expression-construction, and this simplifies them all. */
5241 /* By default build pointers in ptr_mode. */
5244 build_pointer_type (tree to_type)
5246 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5249 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5252 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5257 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5258 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5259 In that case, return that type without regard to the rest of our
5262 ??? This is a kludge, but consistent with the way this function has
5263 always operated and there doesn't seem to be a good way to avoid this
5265 if (TYPE_REFERENCE_TO (to_type) != 0
5266 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5267 return TYPE_REFERENCE_TO (to_type);
5269 /* First, if we already have a type for pointers to TO_TYPE and it's
5270 the proper mode, use it. */
5271 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5272 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5275 t = make_node (REFERENCE_TYPE);
5277 TREE_TYPE (t) = to_type;
5278 TYPE_MODE (t) = mode;
5279 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5280 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5281 TYPE_REFERENCE_TO (to_type) = t;
5289 /* Build the node for the type of references-to-TO_TYPE by default
5293 build_reference_type (tree to_type)
5295 return build_reference_type_for_mode (to_type, ptr_mode, false);
5298 /* Build a type that is compatible with t but has no cv quals anywhere
5301 const char *const *const * -> char ***. */
5304 build_type_no_quals (tree t)
5306 switch (TREE_CODE (t))
5309 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5311 TYPE_REF_CAN_ALIAS_ALL (t));
5312 case REFERENCE_TYPE:
5314 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5316 TYPE_REF_CAN_ALIAS_ALL (t));
5318 return TYPE_MAIN_VARIANT (t);
5322 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5323 MAXVAL should be the maximum value in the domain
5324 (one less than the length of the array).
5326 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5327 We don't enforce this limit, that is up to caller (e.g. language front end).
5328 The limit exists because the result is a signed type and we don't handle
5329 sizes that use more than one HOST_WIDE_INT. */
5332 build_index_type (tree maxval)
5334 tree itype = make_node (INTEGER_TYPE);
5336 TREE_TYPE (itype) = sizetype;
5337 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5338 TYPE_MIN_VALUE (itype) = size_zero_node;
5339 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5340 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5341 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5342 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5343 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5344 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5346 if (host_integerp (maxval, 1))
5347 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5352 /* Builds a signed or unsigned integer type of precision PRECISION.
5353 Used for C bitfields whose precision does not match that of
5354 built-in target types. */
5356 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5359 tree itype = make_node (INTEGER_TYPE);
5361 TYPE_PRECISION (itype) = precision;
5364 fixup_unsigned_type (itype);
5366 fixup_signed_type (itype);
5368 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5369 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5374 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5375 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5376 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5379 build_range_type (tree type, tree lowval, tree highval)
5381 tree itype = make_node (INTEGER_TYPE);
5383 TREE_TYPE (itype) = type;
5384 if (type == NULL_TREE)
5387 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5388 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5390 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5391 TYPE_MODE (itype) = TYPE_MODE (type);
5392 TYPE_SIZE (itype) = TYPE_SIZE (type);
5393 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5394 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5395 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5397 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5398 return type_hash_canon (tree_low_cst (highval, 0)
5399 - tree_low_cst (lowval, 0),
5405 /* Just like build_index_type, but takes lowval and highval instead
5406 of just highval (maxval). */
5409 build_index_2_type (tree lowval, tree highval)
5411 return build_range_type (sizetype, lowval, highval);
5414 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5415 and number of elements specified by the range of values of INDEX_TYPE.
5416 If such a type has already been constructed, reuse it. */
5419 build_array_type (tree elt_type, tree index_type)
5422 hashval_t hashcode = 0;
5424 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5426 error ("arrays of functions are not meaningful");
5427 elt_type = integer_type_node;
5430 t = make_node (ARRAY_TYPE);
5431 TREE_TYPE (t) = elt_type;
5432 TYPE_DOMAIN (t) = index_type;
5434 if (index_type == 0)
5437 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5438 t = type_hash_canon (hashcode, t);
5444 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5445 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5446 t = type_hash_canon (hashcode, t);
5448 if (!COMPLETE_TYPE_P (t))
5453 /* Return the TYPE of the elements comprising
5454 the innermost dimension of ARRAY. */
5457 get_inner_array_type (tree array)
5459 tree type = TREE_TYPE (array);
5461 while (TREE_CODE (type) == ARRAY_TYPE)
5462 type = TREE_TYPE (type);
5467 /* Construct, lay out and return
5468 the type of functions returning type VALUE_TYPE
5469 given arguments of types ARG_TYPES.
5470 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5471 are data type nodes for the arguments of the function.
5472 If such a type has already been constructed, reuse it. */
5475 build_function_type (tree value_type, tree arg_types)
5478 hashval_t hashcode = 0;
5480 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5482 error ("function return type cannot be function");
5483 value_type = integer_type_node;
5486 /* Make a node of the sort we want. */
5487 t = make_node (FUNCTION_TYPE);
5488 TREE_TYPE (t) = value_type;
5489 TYPE_ARG_TYPES (t) = arg_types;
5491 /* If we already have such a type, use the old one. */
5492 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5493 hashcode = type_hash_list (arg_types, hashcode);
5494 t = type_hash_canon (hashcode, t);
5496 if (!COMPLETE_TYPE_P (t))
5501 /* Build a function type. The RETURN_TYPE is the type returned by the
5502 function. If additional arguments are provided, they are
5503 additional argument types. The list of argument types must always
5504 be terminated by NULL_TREE. */
5507 build_function_type_list (tree return_type, ...)
5512 va_start (p, return_type);
5514 t = va_arg (p, tree);
5515 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
5516 args = tree_cons (NULL_TREE, t, args);
5518 if (args == NULL_TREE)
5519 args = void_list_node;
5523 args = nreverse (args);
5524 TREE_CHAIN (last) = void_list_node;
5526 args = build_function_type (return_type, args);
5532 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5533 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5534 for the method. An implicit additional parameter (of type
5535 pointer-to-BASETYPE) is added to the ARGTYPES. */
5538 build_method_type_directly (tree basetype,
5546 /* Make a node of the sort we want. */
5547 t = make_node (METHOD_TYPE);
5549 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5550 TREE_TYPE (t) = rettype;
5551 ptype = build_pointer_type (basetype);
5553 /* The actual arglist for this function includes a "hidden" argument
5554 which is "this". Put it into the list of argument types. */
5555 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5556 TYPE_ARG_TYPES (t) = argtypes;
5558 /* If we already have such a type, use the old one. */
5559 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5560 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5561 hashcode = type_hash_list (argtypes, hashcode);
5562 t = type_hash_canon (hashcode, t);
5564 if (!COMPLETE_TYPE_P (t))
5570 /* Construct, lay out and return the type of methods belonging to class
5571 BASETYPE and whose arguments and values are described by TYPE.
5572 If that type exists already, reuse it.
5573 TYPE must be a FUNCTION_TYPE node. */
5576 build_method_type (tree basetype, tree type)
5578 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5580 return build_method_type_directly (basetype,
5582 TYPE_ARG_TYPES (type));
5585 /* Construct, lay out and return the type of offsets to a value
5586 of type TYPE, within an object of type BASETYPE.
5587 If a suitable offset type exists already, reuse it. */
5590 build_offset_type (tree basetype, tree type)
5593 hashval_t hashcode = 0;
5595 /* Make a node of the sort we want. */
5596 t = make_node (OFFSET_TYPE);
5598 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5599 TREE_TYPE (t) = type;
5601 /* If we already have such a type, use the old one. */
5602 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5603 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
5604 t = type_hash_canon (hashcode, t);
5606 if (!COMPLETE_TYPE_P (t))
5612 /* Create a complex type whose components are COMPONENT_TYPE. */
5615 build_complex_type (tree component_type)
5620 /* Make a node of the sort we want. */
5621 t = make_node (COMPLEX_TYPE);
5623 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
5625 /* If we already have such a type, use the old one. */
5626 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
5627 t = type_hash_canon (hashcode, t);
5629 if (!COMPLETE_TYPE_P (t))
5632 /* If we are writing Dwarf2 output we need to create a name,
5633 since complex is a fundamental type. */
5634 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
5638 if (component_type == char_type_node)
5639 name = "complex char";
5640 else if (component_type == signed_char_type_node)
5641 name = "complex signed char";
5642 else if (component_type == unsigned_char_type_node)
5643 name = "complex unsigned char";
5644 else if (component_type == short_integer_type_node)
5645 name = "complex short int";
5646 else if (component_type == short_unsigned_type_node)
5647 name = "complex short unsigned int";
5648 else if (component_type == integer_type_node)
5649 name = "complex int";
5650 else if (component_type == unsigned_type_node)
5651 name = "complex unsigned int";
5652 else if (component_type == long_integer_type_node)
5653 name = "complex long int";
5654 else if (component_type == long_unsigned_type_node)
5655 name = "complex long unsigned int";
5656 else if (component_type == long_long_integer_type_node)
5657 name = "complex long long int";
5658 else if (component_type == long_long_unsigned_type_node)
5659 name = "complex long long unsigned int";
5664 TYPE_NAME (t) = get_identifier (name);
5667 return build_qualified_type (t, TYPE_QUALS (component_type));
5670 /* Return OP, stripped of any conversions to wider types as much as is safe.
5671 Converting the value back to OP's type makes a value equivalent to OP.
5673 If FOR_TYPE is nonzero, we return a value which, if converted to
5674 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5676 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5677 narrowest type that can hold the value, even if they don't exactly fit.
5678 Otherwise, bit-field references are changed to a narrower type
5679 only if they can be fetched directly from memory in that type.
5681 OP must have integer, real or enumeral type. Pointers are not allowed!
5683 There are some cases where the obvious value we could return
5684 would regenerate to OP if converted to OP's type,
5685 but would not extend like OP to wider types.
5686 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5687 For example, if OP is (unsigned short)(signed char)-1,
5688 we avoid returning (signed char)-1 if FOR_TYPE is int,
5689 even though extending that to an unsigned short would regenerate OP,
5690 since the result of extending (signed char)-1 to (int)
5691 is different from (int) OP. */
5694 get_unwidened (tree op, tree for_type)
5696 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5697 tree type = TREE_TYPE (op);
5699 = TYPE_PRECISION (for_type != 0 ? for_type : type);
5701 = (for_type != 0 && for_type != type
5702 && final_prec > TYPE_PRECISION (type)
5703 && TYPE_UNSIGNED (type));
5706 while (TREE_CODE (op) == NOP_EXPR
5707 || TREE_CODE (op) == CONVERT_EXPR)
5711 /* TYPE_PRECISION on vector types has different meaning
5712 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5713 so avoid them here. */
5714 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
5717 bitschange = TYPE_PRECISION (TREE_TYPE (op))
5718 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
5720 /* Truncations are many-one so cannot be removed.
5721 Unless we are later going to truncate down even farther. */
5723 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
5726 /* See what's inside this conversion. If we decide to strip it,
5728 op = TREE_OPERAND (op, 0);
5730 /* If we have not stripped any zero-extensions (uns is 0),
5731 we can strip any kind of extension.
5732 If we have previously stripped a zero-extension,
5733 only zero-extensions can safely be stripped.
5734 Any extension can be stripped if the bits it would produce
5735 are all going to be discarded later by truncating to FOR_TYPE. */
5739 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
5741 /* TYPE_UNSIGNED says whether this is a zero-extension.
5742 Let's avoid computing it if it does not affect WIN
5743 and if UNS will not be needed again. */
5745 || TREE_CODE (op) == NOP_EXPR
5746 || TREE_CODE (op) == CONVERT_EXPR)
5747 && TYPE_UNSIGNED (TREE_TYPE (op)))
5755 if (TREE_CODE (op) == COMPONENT_REF
5756 /* Since type_for_size always gives an integer type. */
5757 && TREE_CODE (type) != REAL_TYPE
5758 /* Don't crash if field not laid out yet. */
5759 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5760 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5762 unsigned int innerprec
5763 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5764 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5765 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5766 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5768 /* We can get this structure field in the narrowest type it fits in.
5769 If FOR_TYPE is 0, do this only for a field that matches the
5770 narrower type exactly and is aligned for it
5771 The resulting extension to its nominal type (a fullword type)
5772 must fit the same conditions as for other extensions. */
5775 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
5776 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
5777 && (! uns || final_prec <= innerprec || unsignedp))
5779 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5780 TREE_OPERAND (op, 1), NULL_TREE);
5781 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5782 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5789 /* Return OP or a simpler expression for a narrower value
5790 which can be sign-extended or zero-extended to give back OP.
5791 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5792 or 0 if the value should be sign-extended. */
5795 get_narrower (tree op, int *unsignedp_ptr)
5800 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
5802 while (TREE_CODE (op) == NOP_EXPR)
5805 = (TYPE_PRECISION (TREE_TYPE (op))
5806 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
5808 /* Truncations are many-one so cannot be removed. */
5812 /* See what's inside this conversion. If we decide to strip it,
5817 op = TREE_OPERAND (op, 0);
5818 /* An extension: the outermost one can be stripped,
5819 but remember whether it is zero or sign extension. */
5821 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5822 /* Otherwise, if a sign extension has been stripped,
5823 only sign extensions can now be stripped;
5824 if a zero extension has been stripped, only zero-extensions. */
5825 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
5829 else /* bitschange == 0 */
5831 /* A change in nominal type can always be stripped, but we must
5832 preserve the unsignedness. */
5834 uns = TYPE_UNSIGNED (TREE_TYPE (op));
5836 op = TREE_OPERAND (op, 0);
5837 /* Keep trying to narrow, but don't assign op to win if it
5838 would turn an integral type into something else. */
5839 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
5846 if (TREE_CODE (op) == COMPONENT_REF
5847 /* Since type_for_size always gives an integer type. */
5848 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
5849 /* Ensure field is laid out already. */
5850 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
5851 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
5853 unsigned HOST_WIDE_INT innerprec
5854 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
5855 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
5856 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
5857 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
5859 /* We can get this structure field in a narrower type that fits it,
5860 but the resulting extension to its nominal type (a fullword type)
5861 must satisfy the same conditions as for other extensions.
5863 Do this only for fields that are aligned (not bit-fields),
5864 because when bit-field insns will be used there is no
5865 advantage in doing this. */
5867 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
5868 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
5869 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
5873 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
5874 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
5875 TREE_OPERAND (op, 1), NULL_TREE);
5876 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
5877 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
5880 *unsignedp_ptr = uns;
5884 /* Nonzero if integer constant C has a value that is permissible
5885 for type TYPE (an INTEGER_TYPE). */
5888 int_fits_type_p (tree c, tree type)
5890 tree type_low_bound = TYPE_MIN_VALUE (type);
5891 tree type_high_bound = TYPE_MAX_VALUE (type);
5892 bool ok_for_low_bound, ok_for_high_bound;
5895 /* If at least one bound of the type is a constant integer, we can check
5896 ourselves and maybe make a decision. If no such decision is possible, but
5897 this type is a subtype, try checking against that. Otherwise, use
5898 force_fit_type, which checks against the precision.
5900 Compute the status for each possibly constant bound, and return if we see
5901 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5902 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5903 for "constant known to fit". */
5905 /* Check if C >= type_low_bound. */
5906 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
5908 if (tree_int_cst_lt (c, type_low_bound))
5910 ok_for_low_bound = true;
5913 ok_for_low_bound = false;
5915 /* Check if c <= type_high_bound. */
5916 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
5918 if (tree_int_cst_lt (type_high_bound, c))
5920 ok_for_high_bound = true;
5923 ok_for_high_bound = false;
5925 /* If the constant fits both bounds, the result is known. */
5926 if (ok_for_low_bound && ok_for_high_bound)
5929 /* Perform some generic filtering which may allow making a decision
5930 even if the bounds are not constant. First, negative integers
5931 never fit in unsigned types, */
5932 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
5935 /* Second, narrower types always fit in wider ones. */
5936 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
5939 /* Third, unsigned integers with top bit set never fit signed types. */
5940 if (! TYPE_UNSIGNED (type)
5941 && TYPE_UNSIGNED (TREE_TYPE (c))
5942 && tree_int_cst_msb (c))
5945 /* If we haven't been able to decide at this point, there nothing more we
5946 can check ourselves here. Look at the base type if we have one and it
5947 has the same precision. */
5948 if (TREE_CODE (type) == INTEGER_TYPE
5949 && TREE_TYPE (type) != 0
5950 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
5951 return int_fits_type_p (c, TREE_TYPE (type));
5953 /* Or to force_fit_type, if nothing else. */
5954 tmp = copy_node (c);
5955 TREE_TYPE (tmp) = type;
5956 tmp = force_fit_type (tmp, -1, false, false);
5957 return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c)
5958 && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c);
5961 /* Subprogram of following function. Called by walk_tree.
5963 Return *TP if it is an automatic variable or parameter of the
5964 function passed in as DATA. */
5967 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
5969 tree fn = (tree) data;
5974 else if (DECL_P (*tp)
5975 && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
5981 /* Returns true if T is, contains, or refers to a type with variable
5982 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
5983 arguments, but not the return type. If FN is nonzero, only return
5984 true if a modifier of the type or position of FN is a variable or
5985 parameter inside FN.
5987 This concept is more general than that of C99 'variably modified types':
5988 in C99, a struct type is never variably modified because a VLA may not
5989 appear as a structure member. However, in GNU C code like:
5991 struct S { int i[f()]; };
5993 is valid, and other languages may define similar constructs. */
5996 variably_modified_type_p (tree type, tree fn)
6000 /* Test if T is either variable (if FN is zero) or an expression containing
6001 a variable in FN. */
6002 #define RETURN_TRUE_IF_VAR(T) \
6003 do { tree _t = (T); \
6004 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6005 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6006 return true; } while (0)
6008 if (type == error_mark_node)
6011 /* If TYPE itself has variable size, it is variably modified. */
6012 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6013 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6015 switch (TREE_CODE (type))
6018 case REFERENCE_TYPE:
6020 if (variably_modified_type_p (TREE_TYPE (type), fn))
6026 /* If TYPE is a function type, it is variably modified if the
6027 return type is variably modified. */
6028 if (variably_modified_type_p (TREE_TYPE (type), fn))
6036 /* Scalar types are variably modified if their end points
6038 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6039 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6044 case QUAL_UNION_TYPE:
6045 /* We can't see if any of the fields are variably-modified by the
6046 definition we normally use, since that would produce infinite
6047 recursion via pointers. */
6048 /* This is variably modified if some field's type is. */
6049 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6050 if (TREE_CODE (t) == FIELD_DECL)
6052 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6053 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6054 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6056 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6057 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6062 /* Do not call ourselves to avoid infinite recursion. This is
6063 variably modified if the element type is. */
6064 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6065 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6072 /* The current language may have other cases to check, but in general,
6073 all other types are not variably modified. */
6074 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6076 #undef RETURN_TRUE_IF_VAR
6079 /* Given a DECL or TYPE, return the scope in which it was declared, or
6080 NULL_TREE if there is no containing scope. */
6083 get_containing_scope (tree t)
6085 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6088 /* Return the innermost context enclosing DECL that is
6089 a FUNCTION_DECL, or zero if none. */
6092 decl_function_context (tree decl)
6096 if (TREE_CODE (decl) == ERROR_MARK)
6099 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6100 where we look up the function at runtime. Such functions always take
6101 a first argument of type 'pointer to real context'.
6103 C++ should really be fixed to use DECL_CONTEXT for the real context,
6104 and use something else for the "virtual context". */
6105 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6108 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6110 context = DECL_CONTEXT (decl);
6112 while (context && TREE_CODE (context) != FUNCTION_DECL)
6114 if (TREE_CODE (context) == BLOCK)
6115 context = BLOCK_SUPERCONTEXT (context);
6117 context = get_containing_scope (context);
6123 /* Return the innermost context enclosing DECL that is
6124 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6125 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6128 decl_type_context (tree decl)
6130 tree context = DECL_CONTEXT (decl);
6133 switch (TREE_CODE (context))
6135 case NAMESPACE_DECL:
6136 case TRANSLATION_UNIT_DECL:
6141 case QUAL_UNION_TYPE:
6146 context = DECL_CONTEXT (context);
6150 context = BLOCK_SUPERCONTEXT (context);
6160 /* CALL is a CALL_EXPR. Return the declaration for the function
6161 called, or NULL_TREE if the called function cannot be
6165 get_callee_fndecl (tree call)
6169 if (call == error_mark_node)
6172 /* It's invalid to call this function with anything but a
6174 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6176 /* The first operand to the CALL is the address of the function
6178 addr = TREE_OPERAND (call, 0);
6182 /* If this is a readonly function pointer, extract its initial value. */
6183 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6184 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6185 && DECL_INITIAL (addr))
6186 addr = DECL_INITIAL (addr);
6188 /* If the address is just `&f' for some function `f', then we know
6189 that `f' is being called. */
6190 if (TREE_CODE (addr) == ADDR_EXPR
6191 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6192 return TREE_OPERAND (addr, 0);
6194 /* We couldn't figure out what was being called. Maybe the front
6195 end has some idea. */
6196 return lang_hooks.lang_get_callee_fndecl (call);
6199 /* Print debugging information about tree nodes generated during the compile,
6200 and any language-specific information. */
6203 dump_tree_statistics (void)
6205 #ifdef GATHER_STATISTICS
6207 int total_nodes, total_bytes;
6210 fprintf (stderr, "\n??? tree nodes created\n\n");
6211 #ifdef GATHER_STATISTICS
6212 fprintf (stderr, "Kind Nodes Bytes\n");
6213 fprintf (stderr, "---------------------------------------\n");
6214 total_nodes = total_bytes = 0;
6215 for (i = 0; i < (int) all_kinds; i++)
6217 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6218 tree_node_counts[i], tree_node_sizes[i]);
6219 total_nodes += tree_node_counts[i];
6220 total_bytes += tree_node_sizes[i];
6222 fprintf (stderr, "---------------------------------------\n");
6223 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6224 fprintf (stderr, "---------------------------------------\n");
6225 ssanames_print_statistics ();
6226 phinodes_print_statistics ();
6228 fprintf (stderr, "(No per-node statistics)\n");
6230 print_type_hash_statistics ();
6231 print_debug_expr_statistics ();
6232 print_value_expr_statistics ();
6233 print_restrict_base_statistics ();
6234 lang_hooks.print_statistics ();
6237 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6239 /* Generate a crc32 of a string. */
6242 crc32_string (unsigned chksum, const char *string)
6246 unsigned value = *string << 24;
6249 for (ix = 8; ix--; value <<= 1)
6253 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6262 /* P is a string that will be used in a symbol. Mask out any characters
6263 that are not valid in that context. */
6266 clean_symbol_name (char *p)
6270 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6273 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6280 /* Generate a name for a special-purpose function function.
6281 The generated name may need to be unique across the whole link.
6282 TYPE is some string to identify the purpose of this function to the
6283 linker or collect2; it must start with an uppercase letter,
6285 I - for constructors
6287 N - for C++ anonymous namespaces
6288 F - for DWARF unwind frame information. */
6291 get_file_function_name (const char *type)
6297 /* If we already have a name we know to be unique, just use that. */
6298 if (first_global_object_name)
6299 p = first_global_object_name;
6300 /* If the target is handling the constructors/destructors, they
6301 will be local to this file and the name is only necessary for
6302 debugging purposes. */
6303 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6305 const char *file = main_input_filename;
6307 file = input_filename;
6308 /* Just use the file's basename, because the full pathname
6309 might be quite long. */
6310 p = strrchr (file, '/');
6315 p = q = ASTRDUP (p);
6316 clean_symbol_name (q);
6320 /* Otherwise, the name must be unique across the entire link.
6321 We don't have anything that we know to be unique to this translation
6322 unit, so use what we do have and throw in some randomness. */
6324 const char *name = weak_global_object_name;
6325 const char *file = main_input_filename;
6330 file = input_filename;
6332 len = strlen (file);
6333 q = alloca (9 * 2 + len + 1);
6334 memcpy (q, file, len + 1);
6335 clean_symbol_name (q);
6337 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6338 crc32_string (0, flag_random_seed));
6343 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
6345 /* Set up the name of the file-level functions we may need.
6346 Use a global object (which is already required to be unique over
6347 the program) rather than the file name (which imposes extra
6349 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6351 return get_identifier (buf);
6354 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6356 /* Complain that the tree code of NODE does not match the expected 0
6357 terminated list of trailing codes. The trailing code list can be
6358 empty, for a more vague error message. FILE, LINE, and FUNCTION
6359 are of the caller. */
6362 tree_check_failed (const tree node, const char *file,
6363 int line, const char *function, ...)
6367 unsigned length = 0;
6370 va_start (args, function);
6371 while ((code = va_arg (args, int)))
6372 length += 4 + strlen (tree_code_name[code]);
6376 va_start (args, function);
6377 length += strlen ("expected ");
6378 buffer = alloca (length);
6380 while ((code = va_arg (args, int)))
6382 const char *prefix = length ? " or " : "expected ";
6384 strcpy (buffer + length, prefix);
6385 length += strlen (prefix);
6386 strcpy (buffer + length, tree_code_name[code]);
6387 length += strlen (tree_code_name[code]);
6392 buffer = (char *)"unexpected node";
6394 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6395 buffer, tree_code_name[TREE_CODE (node)],
6396 function, trim_filename (file), line);
6399 /* Complain that the tree code of NODE does match the expected 0
6400 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6404 tree_not_check_failed (const tree node, const char *file,
6405 int line, const char *function, ...)
6409 unsigned length = 0;
6412 va_start (args, function);
6413 while ((code = va_arg (args, int)))
6414 length += 4 + strlen (tree_code_name[code]);
6416 va_start (args, function);
6417 buffer = alloca (length);
6419 while ((code = va_arg (args, int)))
6423 strcpy (buffer + length, " or ");
6426 strcpy (buffer + length, tree_code_name[code]);
6427 length += strlen (tree_code_name[code]);
6431 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6432 buffer, tree_code_name[TREE_CODE (node)],
6433 function, trim_filename (file), line);
6436 /* Similar to tree_check_failed, except that we check for a class of tree
6437 code, given in CL. */
6440 tree_class_check_failed (const tree node, const enum tree_code_class cl,
6441 const char *file, int line, const char *function)
6444 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6445 TREE_CODE_CLASS_STRING (cl),
6446 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6447 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6450 /* Similar to tree_check_failed, except that instead of specifying a
6451 dozen codes, use the knowledge that they're all sequential. */
6454 tree_range_check_failed (const tree node, const char *file, int line,
6455 const char *function, enum tree_code c1,
6459 unsigned length = 0;
6462 for (c = c1; c <= c2; ++c)
6463 length += 4 + strlen (tree_code_name[c]);
6465 length += strlen ("expected ");
6466 buffer = alloca (length);
6469 for (c = c1; c <= c2; ++c)
6471 const char *prefix = length ? " or " : "expected ";
6473 strcpy (buffer + length, prefix);
6474 length += strlen (prefix);
6475 strcpy (buffer + length, tree_code_name[c]);
6476 length += strlen (tree_code_name[c]);
6479 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6480 buffer, tree_code_name[TREE_CODE (node)],
6481 function, trim_filename (file), line);
6485 /* Similar to tree_check_failed, except that we check that a tree does
6486 not have the specified code, given in CL. */
6489 tree_not_class_check_failed (const tree node, const enum tree_code_class cl,
6490 const char *file, int line, const char *function)
6493 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6494 TREE_CODE_CLASS_STRING (cl),
6495 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6496 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6500 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6503 omp_clause_check_failed (const tree node, const char *file, int line,
6504 const char *function, enum omp_clause_code code)
6506 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6507 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6508 function, trim_filename (file), line);
6512 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6515 omp_clause_range_check_failed (const tree node, const char *file, int line,
6516 const char *function, enum omp_clause_code c1,
6517 enum omp_clause_code c2)
6520 unsigned length = 0;
6521 enum omp_clause_code c;
6523 for (c = c1; c <= c2; ++c)
6524 length += 4 + strlen (omp_clause_code_name[c]);
6526 length += strlen ("expected ");
6527 buffer = alloca (length);
6530 for (c = c1; c <= c2; ++c)
6532 const char *prefix = length ? " or " : "expected ";
6534 strcpy (buffer + length, prefix);
6535 length += strlen (prefix);
6536 strcpy (buffer + length, omp_clause_code_name[c]);
6537 length += strlen (omp_clause_code_name[c]);
6540 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6541 buffer, omp_clause_code_name[TREE_CODE (node)],
6542 function, trim_filename (file), line);
6546 #undef DEFTREESTRUCT
6547 #define DEFTREESTRUCT(VAL, NAME) NAME,
6549 static const char *ts_enum_names[] = {
6550 #include "treestruct.def"
6552 #undef DEFTREESTRUCT
6554 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6556 /* Similar to tree_class_check_failed, except that we check for
6557 whether CODE contains the tree structure identified by EN. */
6560 tree_contains_struct_check_failed (const tree node,
6561 const enum tree_node_structure_enum en,
6562 const char *file, int line,
6563 const char *function)
6566 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6568 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6572 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6573 (dynamically sized) vector. */
6576 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
6577 const char *function)
6580 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6581 idx + 1, len, function, trim_filename (file), line);
6584 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6585 (dynamically sized) vector. */
6588 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
6589 const char *function)
6592 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6593 idx + 1, len, function, trim_filename (file), line);
6596 /* Similar to above, except that the check is for the bounds of the operand
6597 vector of an expression node. */
6600 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
6601 int line, const char *function)
6604 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6605 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
6606 function, trim_filename (file), line);
6609 /* Similar to above, except that the check is for the number of
6610 operands of an OMP_CLAUSE node. */
6613 omp_clause_operand_check_failed (int idx, tree t, const char *file,
6614 int line, const char *function)
6617 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6618 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
6619 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
6620 trim_filename (file), line);
6622 #endif /* ENABLE_TREE_CHECKING */
6624 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6625 and mapped to the machine mode MODE. Initialize its fields and build
6626 the information necessary for debugging output. */
6629 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
6632 hashval_t hashcode = 0;
6634 /* Build a main variant, based on the main variant of the inner type, then
6635 use it to build the variant we return. */
6636 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
6637 && TYPE_MAIN_VARIANT (innertype) != innertype)
6638 return build_type_attribute_qual_variant (
6639 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
6640 TYPE_ATTRIBUTES (innertype),
6641 TYPE_QUALS (innertype));
6643 t = make_node (VECTOR_TYPE);
6644 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
6645 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
6646 TYPE_MODE (t) = mode;
6647 TYPE_READONLY (t) = TYPE_READONLY (innertype);
6648 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
6653 tree index = build_int_cst (NULL_TREE, nunits - 1);
6654 tree array = build_array_type (innertype, build_index_type (index));
6655 tree rt = make_node (RECORD_TYPE);
6657 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
6658 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
6660 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
6661 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6662 the representation type, and we want to find that die when looking up
6663 the vector type. This is most easily achieved by making the TYPE_UID
6665 TYPE_UID (rt) = TYPE_UID (t);
6668 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
6669 hashcode = iterative_hash_host_wide_int (mode, hashcode);
6670 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
6671 return type_hash_canon (hashcode, t);
6675 make_or_reuse_type (unsigned size, int unsignedp)
6677 if (size == INT_TYPE_SIZE)
6678 return unsignedp ? unsigned_type_node : integer_type_node;
6679 if (size == CHAR_TYPE_SIZE)
6680 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
6681 if (size == SHORT_TYPE_SIZE)
6682 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
6683 if (size == LONG_TYPE_SIZE)
6684 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
6685 if (size == LONG_LONG_TYPE_SIZE)
6686 return (unsignedp ? long_long_unsigned_type_node
6687 : long_long_integer_type_node);
6690 return make_unsigned_type (size);
6692 return make_signed_type (size);
6695 /* Create nodes for all integer types (and error_mark_node) using the sizes
6696 of C datatypes. The caller should call set_sizetype soon after calling
6697 this function to select one of the types as sizetype. */
6700 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
6702 error_mark_node = make_node (ERROR_MARK);
6703 TREE_TYPE (error_mark_node) = error_mark_node;
6705 initialize_sizetypes (signed_sizetype);
6707 /* Define both `signed char' and `unsigned char'. */
6708 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
6709 TYPE_STRING_FLAG (signed_char_type_node) = 1;
6710 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
6711 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
6713 /* Define `char', which is like either `signed char' or `unsigned char'
6714 but not the same as either. */
6717 ? make_signed_type (CHAR_TYPE_SIZE)
6718 : make_unsigned_type (CHAR_TYPE_SIZE));
6719 TYPE_STRING_FLAG (char_type_node) = 1;
6721 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
6722 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
6723 integer_type_node = make_signed_type (INT_TYPE_SIZE);
6724 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
6725 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
6726 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
6727 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
6728 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
6730 /* Define a boolean type. This type only represents boolean values but
6731 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6732 Front ends which want to override this size (i.e. Java) can redefine
6733 boolean_type_node before calling build_common_tree_nodes_2. */
6734 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
6735 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
6736 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
6737 TYPE_PRECISION (boolean_type_node) = 1;
6739 /* Fill in the rest of the sized types. Reuse existing type nodes
6741 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
6742 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
6743 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
6744 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
6745 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
6747 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
6748 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
6749 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
6750 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
6751 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
6753 access_public_node = get_identifier ("public");
6754 access_protected_node = get_identifier ("protected");
6755 access_private_node = get_identifier ("private");
6758 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6759 It will create several other common tree nodes. */
6762 build_common_tree_nodes_2 (int short_double)
6764 /* Define these next since types below may used them. */
6765 integer_zero_node = build_int_cst (NULL_TREE, 0);
6766 integer_one_node = build_int_cst (NULL_TREE, 1);
6767 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
6769 size_zero_node = size_int (0);
6770 size_one_node = size_int (1);
6771 bitsize_zero_node = bitsize_int (0);
6772 bitsize_one_node = bitsize_int (1);
6773 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
6775 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
6776 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
6778 void_type_node = make_node (VOID_TYPE);
6779 layout_type (void_type_node);
6781 /* We are not going to have real types in C with less than byte alignment,
6782 so we might as well not have any types that claim to have it. */
6783 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
6784 TYPE_USER_ALIGN (void_type_node) = 0;
6786 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
6787 layout_type (TREE_TYPE (null_pointer_node));
6789 ptr_type_node = build_pointer_type (void_type_node);
6791 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
6792 fileptr_type_node = ptr_type_node;
6794 float_type_node = make_node (REAL_TYPE);
6795 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
6796 layout_type (float_type_node);
6798 double_type_node = make_node (REAL_TYPE);
6800 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
6802 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
6803 layout_type (double_type_node);
6805 long_double_type_node = make_node (REAL_TYPE);
6806 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
6807 layout_type (long_double_type_node);
6809 float_ptr_type_node = build_pointer_type (float_type_node);
6810 double_ptr_type_node = build_pointer_type (double_type_node);
6811 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
6812 integer_ptr_type_node = build_pointer_type (integer_type_node);
6814 /* Fixed size integer types. */
6815 uint32_type_node = build_nonstandard_integer_type (32, true);
6816 uint64_type_node = build_nonstandard_integer_type (64, true);
6818 /* Decimal float types. */
6819 dfloat32_type_node = make_node (REAL_TYPE);
6820 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
6821 layout_type (dfloat32_type_node);
6822 TYPE_MODE (dfloat32_type_node) = SDmode;
6823 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
6825 dfloat64_type_node = make_node (REAL_TYPE);
6826 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
6827 layout_type (dfloat64_type_node);
6828 TYPE_MODE (dfloat64_type_node) = DDmode;
6829 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
6831 dfloat128_type_node = make_node (REAL_TYPE);
6832 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
6833 layout_type (dfloat128_type_node);
6834 TYPE_MODE (dfloat128_type_node) = TDmode;
6835 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
6837 complex_integer_type_node = make_node (COMPLEX_TYPE);
6838 TREE_TYPE (complex_integer_type_node) = integer_type_node;
6839 layout_type (complex_integer_type_node);
6841 complex_float_type_node = make_node (COMPLEX_TYPE);
6842 TREE_TYPE (complex_float_type_node) = float_type_node;
6843 layout_type (complex_float_type_node);
6845 complex_double_type_node = make_node (COMPLEX_TYPE);
6846 TREE_TYPE (complex_double_type_node) = double_type_node;
6847 layout_type (complex_double_type_node);
6849 complex_long_double_type_node = make_node (COMPLEX_TYPE);
6850 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
6851 layout_type (complex_long_double_type_node);
6854 tree t = targetm.build_builtin_va_list ();
6856 /* Many back-ends define record types without setting TYPE_NAME.
6857 If we copied the record type here, we'd keep the original
6858 record type without a name. This breaks name mangling. So,
6859 don't copy record types and let c_common_nodes_and_builtins()
6860 declare the type to be __builtin_va_list. */
6861 if (TREE_CODE (t) != RECORD_TYPE)
6862 t = build_variant_type_copy (t);
6864 va_list_type_node = t;
6868 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6871 local_define_builtin (const char *name, tree type, enum built_in_function code,
6872 const char *library_name, int ecf_flags)
6876 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
6877 library_name, NULL_TREE);
6878 if (ecf_flags & ECF_CONST)
6879 TREE_READONLY (decl) = 1;
6880 if (ecf_flags & ECF_PURE)
6881 DECL_IS_PURE (decl) = 1;
6882 if (ecf_flags & ECF_NORETURN)
6883 TREE_THIS_VOLATILE (decl) = 1;
6884 if (ecf_flags & ECF_NOTHROW)
6885 TREE_NOTHROW (decl) = 1;
6886 if (ecf_flags & ECF_MALLOC)
6887 DECL_IS_MALLOC (decl) = 1;
6889 built_in_decls[code] = decl;
6890 implicit_built_in_decls[code] = decl;
6893 /* Call this function after instantiating all builtins that the language
6894 front end cares about. This will build the rest of the builtins that
6895 are relied upon by the tree optimizers and the middle-end. */
6898 build_common_builtin_nodes (void)
6902 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
6903 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6905 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6906 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6907 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6908 ftype = build_function_type (ptr_type_node, tmp);
6910 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
6911 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
6912 "memcpy", ECF_NOTHROW);
6913 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
6914 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
6915 "memmove", ECF_NOTHROW);
6918 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
6920 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6921 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6922 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
6923 ftype = build_function_type (integer_type_node, tmp);
6924 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
6925 "memcmp", ECF_PURE | ECF_NOTHROW);
6928 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
6930 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6931 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
6932 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6933 ftype = build_function_type (ptr_type_node, tmp);
6934 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
6935 "memset", ECF_NOTHROW);
6938 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
6940 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
6941 ftype = build_function_type (ptr_type_node, tmp);
6942 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
6943 "alloca", ECF_NOTHROW | ECF_MALLOC);
6946 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6947 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6948 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6949 ftype = build_function_type (void_type_node, tmp);
6950 local_define_builtin ("__builtin_init_trampoline", ftype,
6951 BUILT_IN_INIT_TRAMPOLINE,
6952 "__builtin_init_trampoline", ECF_NOTHROW);
6954 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6955 ftype = build_function_type (ptr_type_node, tmp);
6956 local_define_builtin ("__builtin_adjust_trampoline", ftype,
6957 BUILT_IN_ADJUST_TRAMPOLINE,
6958 "__builtin_adjust_trampoline",
6959 ECF_CONST | ECF_NOTHROW);
6961 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6962 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6963 ftype = build_function_type (void_type_node, tmp);
6964 local_define_builtin ("__builtin_nonlocal_goto", ftype,
6965 BUILT_IN_NONLOCAL_GOTO,
6966 "__builtin_nonlocal_goto",
6967 ECF_NORETURN | ECF_NOTHROW);
6969 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6970 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
6971 ftype = build_function_type (void_type_node, tmp);
6972 local_define_builtin ("__builtin_setjmp_setup", ftype,
6973 BUILT_IN_SETJMP_SETUP,
6974 "__builtin_setjmp_setup", ECF_NOTHROW);
6976 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6977 ftype = build_function_type (ptr_type_node, tmp);
6978 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
6979 BUILT_IN_SETJMP_DISPATCHER,
6980 "__builtin_setjmp_dispatcher",
6981 ECF_PURE | ECF_NOTHROW);
6983 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6984 ftype = build_function_type (void_type_node, tmp);
6985 local_define_builtin ("__builtin_setjmp_receiver", ftype,
6986 BUILT_IN_SETJMP_RECEIVER,
6987 "__builtin_setjmp_receiver", ECF_NOTHROW);
6989 ftype = build_function_type (ptr_type_node, void_list_node);
6990 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
6991 "__builtin_stack_save", ECF_NOTHROW);
6993 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
6994 ftype = build_function_type (void_type_node, tmp);
6995 local_define_builtin ("__builtin_stack_restore", ftype,
6996 BUILT_IN_STACK_RESTORE,
6997 "__builtin_stack_restore", ECF_NOTHROW);
6999 ftype = build_function_type (void_type_node, void_list_node);
7000 local_define_builtin ("__builtin_profile_func_enter", ftype,
7001 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7002 local_define_builtin ("__builtin_profile_func_exit", ftype,
7003 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7005 /* Complex multiplication and division. These are handled as builtins
7006 rather than optabs because emit_library_call_value doesn't support
7007 complex. Further, we can do slightly better with folding these
7008 beasties if the real and complex parts of the arguments are separate. */
7010 enum machine_mode mode;
7012 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7014 char mode_name_buf[4], *q;
7016 enum built_in_function mcode, dcode;
7017 tree type, inner_type;
7019 type = lang_hooks.types.type_for_mode (mode, 0);
7022 inner_type = TREE_TYPE (type);
7024 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7025 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7026 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7027 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7028 ftype = build_function_type (type, tmp);
7030 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7031 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7033 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7037 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7038 local_define_builtin (built_in_names[mcode], ftype, mcode,
7039 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7041 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7042 local_define_builtin (built_in_names[dcode], ftype, dcode,
7043 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7048 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7051 If we requested a pointer to a vector, build up the pointers that
7052 we stripped off while looking for the inner type. Similarly for
7053 return values from functions.
7055 The argument TYPE is the top of the chain, and BOTTOM is the
7056 new type which we will point to. */
7059 reconstruct_complex_type (tree type, tree bottom)
7063 if (POINTER_TYPE_P (type))
7065 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7066 outer = build_pointer_type (inner);
7068 else if (TREE_CODE (type) == ARRAY_TYPE)
7070 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7071 outer = build_array_type (inner, TYPE_DOMAIN (type));
7073 else if (TREE_CODE (type) == FUNCTION_TYPE)
7075 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7076 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7078 else if (TREE_CODE (type) == METHOD_TYPE)
7081 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7082 /* The build_method_type_directly() routine prepends 'this' to argument list,
7083 so we must compensate by getting rid of it. */
7084 argtypes = TYPE_ARG_TYPES (type);
7085 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
7087 TYPE_ARG_TYPES (type));
7088 TYPE_ARG_TYPES (outer) = argtypes;
7093 TYPE_READONLY (outer) = TYPE_READONLY (type);
7094 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
7099 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7102 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7106 switch (GET_MODE_CLASS (mode))
7108 case MODE_VECTOR_INT:
7109 case MODE_VECTOR_FLOAT:
7110 nunits = GET_MODE_NUNITS (mode);
7114 /* Check that there are no leftover bits. */
7115 gcc_assert (GET_MODE_BITSIZE (mode)
7116 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7118 nunits = GET_MODE_BITSIZE (mode)
7119 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7126 return make_vector_type (innertype, nunits, mode);
7129 /* Similarly, but takes the inner type and number of units, which must be
7133 build_vector_type (tree innertype, int nunits)
7135 return make_vector_type (innertype, nunits, VOIDmode);
7139 /* Build RESX_EXPR with given REGION_NUMBER. */
7141 build_resx (int region_number)
7144 t = build1 (RESX_EXPR, void_type_node,
7145 build_int_cst (NULL_TREE, region_number));
7149 /* Given an initializer INIT, return TRUE if INIT is zero or some
7150 aggregate of zeros. Otherwise return FALSE. */
7152 initializer_zerop (tree init)
7158 switch (TREE_CODE (init))
7161 return integer_zerop (init);
7164 /* ??? Note that this is not correct for C4X float formats. There,
7165 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7166 negative exponent. */
7167 return real_zerop (init)
7168 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7171 return integer_zerop (init)
7172 || (real_zerop (init)
7173 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7174 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7177 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7178 if (!initializer_zerop (TREE_VALUE (elt)))
7184 unsigned HOST_WIDE_INT idx;
7186 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7187 if (!initializer_zerop (elt))
7197 /* Build an empty statement. */
7200 build_empty_stmt (void)
7202 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7206 /* Build an OpenMP clause with code CODE. */
7209 build_omp_clause (enum omp_clause_code code)
7214 length = omp_clause_num_ops[code];
7215 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7217 t = ggc_alloc (size);
7218 memset (t, 0, size);
7219 TREE_SET_CODE (t, OMP_CLAUSE);
7220 OMP_CLAUSE_SET_CODE (t, code);
7222 #ifdef GATHER_STATISTICS
7223 tree_node_counts[(int) omp_clause_kind]++;
7224 tree_node_sizes[(int) omp_clause_kind] += size;
7231 /* Returns true if it is possible to prove that the index of
7232 an array access REF (an ARRAY_REF expression) falls into the
7236 in_array_bounds_p (tree ref)
7238 tree idx = TREE_OPERAND (ref, 1);
7241 if (TREE_CODE (idx) != INTEGER_CST)
7244 min = array_ref_low_bound (ref);
7245 max = array_ref_up_bound (ref);
7248 || TREE_CODE (min) != INTEGER_CST
7249 || TREE_CODE (max) != INTEGER_CST)
7252 if (tree_int_cst_lt (idx, min)
7253 || tree_int_cst_lt (max, idx))
7259 /* Returns true if it is possible to prove that the range of
7260 an array access REF (an ARRAY_RANGE_REF expression) falls
7261 into the array bounds. */
7264 range_in_array_bounds_p (tree ref)
7266 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7267 tree range_min, range_max, min, max;
7269 range_min = TYPE_MIN_VALUE (domain_type);
7270 range_max = TYPE_MAX_VALUE (domain_type);
7273 || TREE_CODE (range_min) != INTEGER_CST
7274 || TREE_CODE (range_max) != INTEGER_CST)
7277 min = array_ref_low_bound (ref);
7278 max = array_ref_up_bound (ref);
7281 || TREE_CODE (min) != INTEGER_CST
7282 || TREE_CODE (max) != INTEGER_CST)
7285 if (tree_int_cst_lt (range_min, min)
7286 || tree_int_cst_lt (max, range_max))
7292 /* Return true if T (assumed to be a DECL) is a global variable. */
7295 is_global_var (tree t)
7298 return (TREE_STATIC (t) || MTAG_GLOBAL (t));
7300 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
7303 /* Return true if T (assumed to be a DECL) must be assigned a memory
7307 needs_to_live_in_memory (tree t)
7309 return (TREE_ADDRESSABLE (t)
7310 || is_global_var (t)
7311 || (TREE_CODE (t) == RESULT_DECL
7312 && aggregate_value_p (t, current_function_decl)));
7315 /* There are situations in which a language considers record types
7316 compatible which have different field lists. Decide if two fields
7317 are compatible. It is assumed that the parent records are compatible. */
7320 fields_compatible_p (tree f1, tree f2)
7322 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
7323 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
7326 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
7327 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
7330 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
7336 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7339 find_compatible_field (tree record, tree orig_field)
7343 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
7344 if (TREE_CODE (f) == FIELD_DECL
7345 && fields_compatible_p (f, orig_field))
7348 /* ??? Why isn't this on the main fields list? */
7349 f = TYPE_VFIELD (record);
7350 if (f && TREE_CODE (f) == FIELD_DECL
7351 && fields_compatible_p (f, orig_field))
7354 /* ??? We should abort here, but Java appears to do Bad Things
7355 with inherited fields. */
7359 /* Return value of a constant X. */
7362 int_cst_value (tree x)
7364 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
7365 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
7366 bool negative = ((val >> (bits - 1)) & 1) != 0;
7368 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
7371 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
7373 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
7378 /* Returns the greatest common divisor of A and B, which must be
7382 tree_fold_gcd (tree a, tree b)
7385 tree type = TREE_TYPE (a);
7387 gcc_assert (TREE_CODE (a) == INTEGER_CST);
7388 gcc_assert (TREE_CODE (b) == INTEGER_CST);
7390 if (integer_zerop (a))
7393 if (integer_zerop (b))
7396 if (tree_int_cst_sgn (a) == -1)
7397 a = fold_build2 (MULT_EXPR, type, a,
7398 build_int_cst (type, -1));
7400 if (tree_int_cst_sgn (b) == -1)
7401 b = fold_build2 (MULT_EXPR, type, b,
7402 build_int_cst (type, -1));
7406 a_mod_b = fold_build2 (FLOOR_MOD_EXPR, type, a, b);
7408 if (!TREE_INT_CST_LOW (a_mod_b)
7409 && !TREE_INT_CST_HIGH (a_mod_b))
7417 /* Returns unsigned variant of TYPE. */
7420 unsigned_type_for (tree type)
7422 if (POINTER_TYPE_P (type))
7423 return lang_hooks.types.unsigned_type (size_type_node);
7424 return lang_hooks.types.unsigned_type (type);
7427 /* Returns signed variant of TYPE. */
7430 signed_type_for (tree type)
7432 if (POINTER_TYPE_P (type))
7433 return lang_hooks.types.signed_type (size_type_node);
7434 return lang_hooks.types.signed_type (type);
7437 /* Returns the largest value obtainable by casting something in INNER type to
7441 upper_bound_in_type (tree outer, tree inner)
7443 unsigned HOST_WIDE_INT lo, hi;
7444 unsigned int det = 0;
7445 unsigned oprec = TYPE_PRECISION (outer);
7446 unsigned iprec = TYPE_PRECISION (inner);
7449 /* Compute a unique number for every combination. */
7450 det |= (oprec > iprec) ? 4 : 0;
7451 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
7452 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
7454 /* Determine the exponent to use. */
7459 /* oprec <= iprec, outer: signed, inner: don't care. */
7464 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7468 /* oprec > iprec, outer: signed, inner: signed. */
7472 /* oprec > iprec, outer: signed, inner: unsigned. */
7476 /* oprec > iprec, outer: unsigned, inner: signed. */
7480 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7487 /* Compute 2^^prec - 1. */
7488 if (prec <= HOST_BITS_PER_WIDE_INT)
7491 lo = ((~(unsigned HOST_WIDE_INT) 0)
7492 >> (HOST_BITS_PER_WIDE_INT - prec));
7496 hi = ((~(unsigned HOST_WIDE_INT) 0)
7497 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
7498 lo = ~(unsigned HOST_WIDE_INT) 0;
7501 return build_int_cst_wide (outer, lo, hi);
7504 /* Returns the smallest value obtainable by casting something in INNER type to
7508 lower_bound_in_type (tree outer, tree inner)
7510 unsigned HOST_WIDE_INT lo, hi;
7511 unsigned oprec = TYPE_PRECISION (outer);
7512 unsigned iprec = TYPE_PRECISION (inner);
7514 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7516 if (TYPE_UNSIGNED (outer)
7517 /* If we are widening something of an unsigned type, OUTER type
7518 contains all values of INNER type. In particular, both INNER
7519 and OUTER types have zero in common. */
7520 || (oprec > iprec && TYPE_UNSIGNED (inner)))
7524 /* If we are widening a signed type to another signed type, we
7525 want to obtain -2^^(iprec-1). If we are keeping the
7526 precision or narrowing to a signed type, we want to obtain
7528 unsigned prec = oprec > iprec ? iprec : oprec;
7530 if (prec <= HOST_BITS_PER_WIDE_INT)
7532 hi = ~(unsigned HOST_WIDE_INT) 0;
7533 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
7537 hi = ((~(unsigned HOST_WIDE_INT) 0)
7538 << (prec - HOST_BITS_PER_WIDE_INT - 1));
7543 return build_int_cst_wide (outer, lo, hi);
7546 /* Return nonzero if two operands that are suitable for PHI nodes are
7547 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7548 SSA_NAME or invariant. Note that this is strictly an optimization.
7549 That is, callers of this function can directly call operand_equal_p
7550 and get the same result, only slower. */
7553 operand_equal_for_phi_arg_p (tree arg0, tree arg1)
7557 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
7559 return operand_equal_p (arg0, arg1, 0);
7562 /* Returns number of zeros at the end of binary representation of X.
7564 ??? Use ffs if available? */
7567 num_ending_zeros (tree x)
7569 unsigned HOST_WIDE_INT fr, nfr;
7570 unsigned num, abits;
7571 tree type = TREE_TYPE (x);
7573 if (TREE_INT_CST_LOW (x) == 0)
7575 num = HOST_BITS_PER_WIDE_INT;
7576 fr = TREE_INT_CST_HIGH (x);
7581 fr = TREE_INT_CST_LOW (x);
7584 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
7587 if (nfr << abits == fr)
7594 if (num > TYPE_PRECISION (type))
7595 num = TYPE_PRECISION (type);
7597 return build_int_cst_type (type, num);
7601 #define WALK_SUBTREE(NODE) \
7604 result = walk_tree (&(NODE), func, data, pset); \
7610 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7611 be walked whenever a type is seen in the tree. Rest of operands and return
7612 value are as for walk_tree. */
7615 walk_type_fields (tree type, walk_tree_fn func, void *data,
7616 struct pointer_set_t *pset)
7618 tree result = NULL_TREE;
7620 switch (TREE_CODE (type))
7623 case REFERENCE_TYPE:
7624 /* We have to worry about mutually recursive pointers. These can't
7625 be written in C. They can in Ada. It's pathological, but
7626 there's an ACATS test (c38102a) that checks it. Deal with this
7627 by checking if we're pointing to another pointer, that one
7628 points to another pointer, that one does too, and we have no htab.
7629 If so, get a hash table. We check three levels deep to avoid
7630 the cost of the hash table if we don't need one. */
7631 if (POINTER_TYPE_P (TREE_TYPE (type))
7632 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
7633 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
7636 result = walk_tree_without_duplicates (&TREE_TYPE (type),
7644 /* ... fall through ... */
7647 WALK_SUBTREE (TREE_TYPE (type));
7651 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
7656 WALK_SUBTREE (TREE_TYPE (type));
7660 /* We never want to walk into default arguments. */
7661 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
7662 WALK_SUBTREE (TREE_VALUE (arg));
7667 /* Don't follow this nodes's type if a pointer for fear that we'll
7668 have infinite recursion. Those types are uninteresting anyway. */
7669 if (!POINTER_TYPE_P (TREE_TYPE (type))
7670 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE)
7671 WALK_SUBTREE (TREE_TYPE (type));
7672 WALK_SUBTREE (TYPE_DOMAIN (type));
7676 WALK_SUBTREE (TREE_TYPE (type));
7677 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
7687 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7688 called with the DATA and the address of each sub-tree. If FUNC returns a
7689 non-NULL value, the traversal is stopped, and the value returned by FUNC
7690 is returned. If PSET is non-NULL it is used to record the nodes visited,
7691 and to avoid visiting a node more than once. */
7694 walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset)
7696 enum tree_code code;
7700 #define WALK_SUBTREE_TAIL(NODE) \
7704 goto tail_recurse; \
7709 /* Skip empty subtrees. */
7713 /* Don't walk the same tree twice, if the user has requested
7714 that we avoid doing so. */
7715 if (pset && pointer_set_insert (pset, *tp))
7718 /* Call the function. */
7720 result = (*func) (tp, &walk_subtrees, data);
7722 /* If we found something, return it. */
7726 code = TREE_CODE (*tp);
7728 /* Even if we didn't, FUNC may have decided that there was nothing
7729 interesting below this point in the tree. */
7732 /* But we still need to check our siblings. */
7733 if (code == TREE_LIST)
7734 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7735 else if (code == OMP_CLAUSE)
7736 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7741 result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func,
7743 if (result || !walk_subtrees)
7749 case IDENTIFIER_NODE:
7755 case PLACEHOLDER_EXPR:
7759 /* None of these have subtrees other than those already walked
7764 WALK_SUBTREE (TREE_VALUE (*tp));
7765 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
7770 int len = TREE_VEC_LENGTH (*tp);
7775 /* Walk all elements but the first. */
7777 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
7779 /* Now walk the first one as a tail call. */
7780 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
7784 WALK_SUBTREE (TREE_REALPART (*tp));
7785 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
7789 unsigned HOST_WIDE_INT idx;
7790 constructor_elt *ce;
7793 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
7795 WALK_SUBTREE (ce->value);
7800 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
7805 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
7807 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7808 into declarations that are just mentioned, rather than
7809 declared; they don't really belong to this part of the tree.
7810 And, we can see cycles: the initializer for a declaration
7811 can refer to the declaration itself. */
7812 WALK_SUBTREE (DECL_INITIAL (decl));
7813 WALK_SUBTREE (DECL_SIZE (decl));
7814 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
7816 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
7819 case STATEMENT_LIST:
7821 tree_stmt_iterator i;
7822 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
7823 WALK_SUBTREE (*tsi_stmt_ptr (i));
7828 switch (OMP_CLAUSE_CODE (*tp))
7830 case OMP_CLAUSE_PRIVATE:
7831 case OMP_CLAUSE_SHARED:
7832 case OMP_CLAUSE_FIRSTPRIVATE:
7833 case OMP_CLAUSE_LASTPRIVATE:
7834 case OMP_CLAUSE_COPYIN:
7835 case OMP_CLAUSE_COPYPRIVATE:
7837 case OMP_CLAUSE_NUM_THREADS:
7838 case OMP_CLAUSE_SCHEDULE:
7839 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
7842 case OMP_CLAUSE_NOWAIT:
7843 case OMP_CLAUSE_ORDERED:
7844 case OMP_CLAUSE_DEFAULT:
7845 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7847 case OMP_CLAUSE_REDUCTION:
7850 for (i = 0; i < 4; i++)
7851 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
7852 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
7864 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7865 But, we only want to walk once. */
7866 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
7867 for (i = 0; i < len; ++i)
7868 WALK_SUBTREE (TREE_OPERAND (*tp, i));
7869 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
7873 /* If this is a TYPE_DECL, walk into the fields of the type that it's
7874 defining. We only want to walk into these fields of a type in this
7875 case and not in the general case of a mere reference to the type.
7877 The criterion is as follows: if the field can be an expression, it
7878 must be walked only here. This should be in keeping with the fields
7879 that are directly gimplified in gimplify_type_sizes in order for the
7880 mark/copy-if-shared/unmark machinery of the gimplifier to work with
7881 variable-sized types.
7883 Note that DECLs get walked as part of processing the BIND_EXPR. */
7884 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
7886 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
7887 if (TREE_CODE (*type_p) == ERROR_MARK)
7890 /* Call the function for the type. See if it returns anything or
7891 doesn't want us to continue. If we are to continue, walk both
7892 the normal fields and those for the declaration case. */
7893 result = (*func) (type_p, &walk_subtrees, data);
7894 if (result || !walk_subtrees)
7897 result = walk_type_fields (*type_p, func, data, pset);
7901 /* If this is a record type, also walk the fields. */
7902 if (TREE_CODE (*type_p) == RECORD_TYPE
7903 || TREE_CODE (*type_p) == UNION_TYPE
7904 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7908 for (field = TYPE_FIELDS (*type_p); field;
7909 field = TREE_CHAIN (field))
7911 /* We'd like to look at the type of the field, but we can
7912 easily get infinite recursion. So assume it's pointed
7913 to elsewhere in the tree. Also, ignore things that
7915 if (TREE_CODE (field) != FIELD_DECL)
7918 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
7919 WALK_SUBTREE (DECL_SIZE (field));
7920 WALK_SUBTREE (DECL_SIZE_UNIT (field));
7921 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
7922 WALK_SUBTREE (DECL_QUALIFIER (field));
7926 /* Same for scalar types. */
7927 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
7928 || TREE_CODE (*type_p) == ENUMERAL_TYPE
7929 || TREE_CODE (*type_p) == INTEGER_TYPE
7930 || TREE_CODE (*type_p) == REAL_TYPE)
7932 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
7933 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
7936 WALK_SUBTREE (TYPE_SIZE (*type_p));
7937 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
7942 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
7943 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
7947 /* Walk over all the sub-trees of this operand. */
7948 len = TREE_CODE_LENGTH (code);
7950 /* Go through the subtrees. We need to do this in forward order so
7951 that the scope of a FOR_EXPR is handled properly. */
7954 for (i = 0; i < len - 1; ++i)
7955 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
7956 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
7959 /* If this is a type, walk the needed fields in the type. */
7960 else if (TYPE_P (*tp))
7961 return walk_type_fields (*tp, func, data, pset);
7965 /* We didn't find what we were looking for. */
7968 #undef WALK_SUBTREE_TAIL
7972 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7975 walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data)
7978 struct pointer_set_t *pset;
7980 pset = pointer_set_create ();
7981 result = walk_tree (tp, func, data, pset);
7982 pointer_set_destroy (pset);
7987 /* Return true if STMT is an empty statement or contains nothing but
7988 empty statements. */
7991 empty_body_p (tree stmt)
7993 tree_stmt_iterator i;
7996 if (IS_EMPTY_STMT (stmt))
7998 else if (TREE_CODE (stmt) == BIND_EXPR)
7999 body = BIND_EXPR_BODY (stmt);
8000 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8005 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
8006 if (!empty_body_p (tsi_stmt (i)))
8015 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8017 if (IS_EXPR_CODE_CLASS (c))
8018 return &t->exp.block;
8019 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8020 return &GIMPLE_STMT_BLOCK (t);
8026 generic_tree_operand (tree node, int i)
8028 if (GIMPLE_STMT_P (node))
8029 return &GIMPLE_STMT_OPERAND (node, i);
8030 return &TREE_OPERAND (node, i);
8034 generic_tree_type (tree node)
8036 if (GIMPLE_STMT_P (node))
8037 return &void_type_node;
8038 return &TREE_TYPE (node);
8041 #include "gt-tree.h"