1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "fixed-value.h"
55 /* Tree code classes. */
57 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
58 #define END_OF_BASE_TREE_CODES tcc_exceptional,
60 const enum tree_code_class tree_code_type[] = {
61 #include "all-tree.def"
65 #undef END_OF_BASE_TREE_CODES
67 /* Table indexed by tree code giving number of expression
68 operands beyond the fixed part of the node structure.
69 Not used for types or decls. */
71 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
72 #define END_OF_BASE_TREE_CODES 0,
74 const unsigned char tree_code_length[] = {
75 #include "all-tree.def"
79 #undef END_OF_BASE_TREE_CODES
81 /* Names of tree components.
82 Used for printing out the tree and error messages. */
83 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 #define END_OF_BASE_TREE_CODES "@dummy",
86 const char *const tree_code_name[] = {
87 #include "all-tree.def"
91 #undef END_OF_BASE_TREE_CODES
93 /* Each tree code class has an associated string representation.
94 These must correspond to the tree_code_class entries. */
96 const char *const tree_code_class_strings[] =
111 /* obstack.[ch] explicitly declined to prototype this. */
112 extern int _obstack_allocated_p (struct obstack *h, void *obj);
114 #ifdef GATHER_STATISTICS
115 /* Statistics-gathering stuff. */
117 int tree_node_counts[(int) all_kinds];
118 int tree_node_sizes[(int) all_kinds];
120 /* Keep in sync with tree.h:enum tree_node_kind. */
121 static const char * const tree_node_kind_names[] = {
141 #endif /* GATHER_STATISTICS */
143 /* Unique id for next decl created. */
144 static GTY(()) int next_decl_uid;
145 /* Unique id for next type created. */
146 static GTY(()) int next_type_uid = 1;
148 /* Since we cannot rehash a type after it is in the table, we have to
149 keep the hash code. */
151 struct type_hash GTY(())
157 /* Initial size of the hash table (rounded to next prime). */
158 #define TYPE_HASH_INITIAL_SIZE 1000
160 /* Now here is the hash table. When recording a type, it is added to
161 the slot whose index is the hash code. Note that the hash table is
162 used for several kinds of types (function types, array types and
163 array index range types, for now). While all these live in the
164 same table, they are completely independent, and the hash code is
165 computed differently for each of these. */
167 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
168 htab_t type_hash_table;
170 /* Hash table and temporary node for larger integer const values. */
171 static GTY (()) tree int_cst_node;
172 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
173 htab_t int_cst_hash_table;
175 /* Hash table for optimization flags and target option flags. Use the same
176 hash table for both sets of options. Nodes for building the current
177 optimization and target option nodes. The assumption is most of the time
178 the options created will already be in the hash table, so we avoid
179 allocating and freeing up a node repeatably. */
180 static GTY (()) tree cl_optimization_node;
181 static GTY (()) tree cl_target_option_node;
182 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
183 htab_t cl_option_hash_table;
185 /* General tree->tree mapping structure for use in hash tables. */
188 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
189 htab_t debug_expr_for_decl;
191 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
192 htab_t value_expr_for_decl;
194 static GTY ((if_marked ("tree_priority_map_marked_p"),
195 param_is (struct tree_priority_map)))
196 htab_t init_priority_for_decl;
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
199 htab_t restrict_base_for_decl;
201 static void set_type_quals (tree, int);
202 static int type_hash_eq (const void *, const void *);
203 static hashval_t type_hash_hash (const void *);
204 static hashval_t int_cst_hash_hash (const void *);
205 static int int_cst_hash_eq (const void *, const void *);
206 static hashval_t cl_option_hash_hash (const void *);
207 static int cl_option_hash_eq (const void *, const void *);
208 static void print_type_hash_statistics (void);
209 static void print_debug_expr_statistics (void);
210 static void print_value_expr_statistics (void);
211 static int type_hash_marked_p (const void *);
212 static unsigned int type_hash_list (const_tree, hashval_t);
213 static unsigned int attribute_hash_list (const_tree, hashval_t);
215 tree global_trees[TI_MAX];
216 tree integer_types[itk_none];
218 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
220 /* Number of operands for each OpenMP clause. */
221 unsigned const char omp_clause_num_ops[] =
223 0, /* OMP_CLAUSE_ERROR */
224 1, /* OMP_CLAUSE_PRIVATE */
225 1, /* OMP_CLAUSE_SHARED */
226 1, /* OMP_CLAUSE_FIRSTPRIVATE */
227 2, /* OMP_CLAUSE_LASTPRIVATE */
228 4, /* OMP_CLAUSE_REDUCTION */
229 1, /* OMP_CLAUSE_COPYIN */
230 1, /* OMP_CLAUSE_COPYPRIVATE */
231 1, /* OMP_CLAUSE_IF */
232 1, /* OMP_CLAUSE_NUM_THREADS */
233 1, /* OMP_CLAUSE_SCHEDULE */
234 0, /* OMP_CLAUSE_NOWAIT */
235 0, /* OMP_CLAUSE_ORDERED */
236 0, /* OMP_CLAUSE_DEFAULT */
237 3, /* OMP_CLAUSE_COLLAPSE */
238 0 /* OMP_CLAUSE_UNTIED */
241 const char * const omp_clause_code_name[] =
266 /* Initialize the hash table of types. */
267 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
270 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
273 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
275 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
276 tree_priority_map_eq, 0);
277 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
280 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
281 int_cst_hash_eq, NULL);
283 int_cst_node = make_node (INTEGER_CST);
285 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
286 cl_option_hash_eq, NULL);
288 cl_optimization_node = make_node (OPTIMIZATION_NODE);
289 cl_target_option_node = make_node (TARGET_OPTION_NODE);
291 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
292 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
293 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
296 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
297 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
298 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
299 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
300 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
301 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
302 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
303 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
304 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
307 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
308 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
309 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
310 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
311 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
312 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
314 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
315 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
316 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
317 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
318 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
319 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
320 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
321 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
322 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
323 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
324 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
325 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
327 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
328 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
329 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
331 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
333 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
334 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
335 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
336 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
338 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
339 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
340 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
341 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
342 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
343 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
344 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
345 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
347 lang_hooks.init_ts ();
351 /* The name of the object as the assembler will see it (but before any
352 translations made by ASM_OUTPUT_LABELREF). Often this is the same
353 as DECL_NAME. It is an IDENTIFIER_NODE. */
355 decl_assembler_name (tree decl)
357 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
358 lang_hooks.set_decl_assembler_name (decl);
359 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
362 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
365 decl_assembler_name_equal (tree decl, const_tree asmname)
367 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
368 const char *decl_str;
369 const char *asmname_str;
372 if (decl_asmname == asmname)
375 decl_str = IDENTIFIER_POINTER (decl_asmname);
376 asmname_str = IDENTIFIER_POINTER (asmname);
379 /* If the target assembler name was set by the user, things are trickier.
380 We have a leading '*' to begin with. After that, it's arguable what
381 is the correct thing to do with -fleading-underscore. Arguably, we've
382 historically been doing the wrong thing in assemble_alias by always
383 printing the leading underscore. Since we're not changing that, make
384 sure user_label_prefix follows the '*' before matching. */
385 if (decl_str[0] == '*')
387 size_t ulp_len = strlen (user_label_prefix);
393 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
394 decl_str += ulp_len, test=true;
398 if (asmname_str[0] == '*')
400 size_t ulp_len = strlen (user_label_prefix);
406 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
407 asmname_str += ulp_len, test=true;
414 return strcmp (decl_str, asmname_str) == 0;
417 /* Hash asmnames ignoring the user specified marks. */
420 decl_assembler_name_hash (const_tree asmname)
422 if (IDENTIFIER_POINTER (asmname)[0] == '*')
424 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
425 size_t ulp_len = strlen (user_label_prefix);
429 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
432 return htab_hash_string (decl_str);
435 return htab_hash_string (IDENTIFIER_POINTER (asmname));
438 /* Compute the number of bytes occupied by a tree with code CODE.
439 This function cannot be used for nodes that have variable sizes,
440 including TREE_VEC, STRING_CST, and CALL_EXPR. */
442 tree_code_size (enum tree_code code)
444 switch (TREE_CODE_CLASS (code))
446 case tcc_declaration: /* A decl node */
451 return sizeof (struct tree_field_decl);
453 return sizeof (struct tree_parm_decl);
455 return sizeof (struct tree_var_decl);
457 return sizeof (struct tree_label_decl);
459 return sizeof (struct tree_result_decl);
461 return sizeof (struct tree_const_decl);
463 return sizeof (struct tree_type_decl);
465 return sizeof (struct tree_function_decl);
466 case NAME_MEMORY_TAG:
467 case SYMBOL_MEMORY_TAG:
468 return sizeof (struct tree_memory_tag);
469 case MEMORY_PARTITION_TAG:
470 return sizeof (struct tree_memory_partition_tag);
472 return sizeof (struct tree_decl_non_common);
476 case tcc_type: /* a type node */
477 return sizeof (struct tree_type);
479 case tcc_reference: /* a reference */
480 case tcc_expression: /* an expression */
481 case tcc_statement: /* an expression with side effects */
482 case tcc_comparison: /* a comparison expression */
483 case tcc_unary: /* a unary arithmetic expression */
484 case tcc_binary: /* a binary arithmetic expression */
485 return (sizeof (struct tree_exp)
486 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
488 case tcc_constant: /* a constant */
491 case INTEGER_CST: return sizeof (struct tree_int_cst);
492 case REAL_CST: return sizeof (struct tree_real_cst);
493 case FIXED_CST: return sizeof (struct tree_fixed_cst);
494 case COMPLEX_CST: return sizeof (struct tree_complex);
495 case VECTOR_CST: return sizeof (struct tree_vector);
496 case STRING_CST: gcc_unreachable ();
498 return lang_hooks.tree_size (code);
501 case tcc_exceptional: /* something random, like an identifier. */
504 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
505 case TREE_LIST: return sizeof (struct tree_list);
508 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
511 case OMP_CLAUSE: gcc_unreachable ();
513 case SSA_NAME: return sizeof (struct tree_ssa_name);
515 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
516 case BLOCK: return sizeof (struct tree_block);
517 case CONSTRUCTOR: return sizeof (struct tree_constructor);
518 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
519 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
522 return lang_hooks.tree_size (code);
530 /* Compute the number of bytes occupied by NODE. This routine only
531 looks at TREE_CODE, except for those nodes that have variable sizes. */
533 tree_size (const_tree node)
535 const enum tree_code code = TREE_CODE (node);
539 return (offsetof (struct tree_binfo, base_binfos)
540 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
543 return (sizeof (struct tree_vec)
544 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
547 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
550 return (sizeof (struct tree_omp_clause)
551 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
555 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
556 return (sizeof (struct tree_exp)
557 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
559 return tree_code_size (code);
563 /* Return a newly allocated node of code CODE. For decl and type
564 nodes, some other fields are initialized. The rest of the node is
565 initialized to zero. This function cannot be used for TREE_VEC or
566 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
568 Achoo! I got a code in the node. */
571 make_node_stat (enum tree_code code MEM_STAT_DECL)
574 enum tree_code_class type = TREE_CODE_CLASS (code);
575 size_t length = tree_code_size (code);
576 #ifdef GATHER_STATISTICS
581 case tcc_declaration: /* A decl node */
585 case tcc_type: /* a type node */
589 case tcc_statement: /* an expression with side effects */
593 case tcc_reference: /* a reference */
597 case tcc_expression: /* an expression */
598 case tcc_comparison: /* a comparison expression */
599 case tcc_unary: /* a unary arithmetic expression */
600 case tcc_binary: /* a binary arithmetic expression */
604 case tcc_constant: /* a constant */
608 case tcc_exceptional: /* something random, like an identifier. */
611 case IDENTIFIER_NODE:
624 kind = ssa_name_kind;
645 tree_node_counts[(int) kind]++;
646 tree_node_sizes[(int) kind] += length;
649 if (code == IDENTIFIER_NODE)
650 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
652 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
654 memset (t, 0, length);
656 TREE_SET_CODE (t, code);
661 TREE_SIDE_EFFECTS (t) = 1;
664 case tcc_declaration:
665 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
667 if (code == FUNCTION_DECL)
669 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
670 DECL_MODE (t) = FUNCTION_MODE;
674 /* We have not yet computed the alias set for this declaration. */
675 DECL_POINTER_ALIAS_SET (t) = -1;
677 DECL_SOURCE_LOCATION (t) = input_location;
678 DECL_UID (t) = next_decl_uid++;
683 TYPE_UID (t) = next_type_uid++;
684 TYPE_ALIGN (t) = BITS_PER_UNIT;
685 TYPE_USER_ALIGN (t) = 0;
686 TYPE_MAIN_VARIANT (t) = t;
687 TYPE_CANONICAL (t) = t;
689 /* Default to no attributes for type, but let target change that. */
690 TYPE_ATTRIBUTES (t) = NULL_TREE;
691 targetm.set_default_type_attributes (t);
693 /* We have not yet computed the alias set for this type. */
694 TYPE_ALIAS_SET (t) = -1;
698 TREE_CONSTANT (t) = 1;
707 case PREDECREMENT_EXPR:
708 case PREINCREMENT_EXPR:
709 case POSTDECREMENT_EXPR:
710 case POSTINCREMENT_EXPR:
711 /* All of these have side-effects, no matter what their
713 TREE_SIDE_EFFECTS (t) = 1;
722 /* Other classes need no special treatment. */
729 /* Return a new node with the same contents as NODE except that its
730 TREE_CHAIN is zero and it has a fresh uid. */
733 copy_node_stat (tree node MEM_STAT_DECL)
736 enum tree_code code = TREE_CODE (node);
739 gcc_assert (code != STATEMENT_LIST);
741 length = tree_size (node);
742 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
743 memcpy (t, node, length);
746 TREE_ASM_WRITTEN (t) = 0;
747 TREE_VISITED (t) = 0;
750 if (TREE_CODE_CLASS (code) == tcc_declaration)
752 DECL_UID (t) = next_decl_uid++;
753 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
754 && DECL_HAS_VALUE_EXPR_P (node))
756 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
757 DECL_HAS_VALUE_EXPR_P (t) = 1;
759 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
761 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
762 DECL_HAS_INIT_PRIORITY_P (t) = 1;
764 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
766 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
767 DECL_BASED_ON_RESTRICT_P (t) = 1;
770 else if (TREE_CODE_CLASS (code) == tcc_type)
772 TYPE_UID (t) = next_type_uid++;
773 /* The following is so that the debug code for
774 the copy is different from the original type.
775 The two statements usually duplicate each other
776 (because they clear fields of the same union),
777 but the optimizer should catch that. */
778 TYPE_SYMTAB_POINTER (t) = 0;
779 TYPE_SYMTAB_ADDRESS (t) = 0;
781 /* Do not copy the values cache. */
782 if (TYPE_CACHED_VALUES_P(t))
784 TYPE_CACHED_VALUES_P (t) = 0;
785 TYPE_CACHED_VALUES (t) = NULL_TREE;
792 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
793 For example, this can copy a list made of TREE_LIST nodes. */
796 copy_list (tree list)
804 head = prev = copy_node (list);
805 next = TREE_CHAIN (list);
808 TREE_CHAIN (prev) = copy_node (next);
809 prev = TREE_CHAIN (prev);
810 next = TREE_CHAIN (next);
816 /* Create an INT_CST node with a LOW value sign extended. */
819 build_int_cst (tree type, HOST_WIDE_INT low)
821 /* Support legacy code. */
823 type = integer_type_node;
825 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
828 /* Create an INT_CST node with a LOW value zero extended. */
831 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
833 return build_int_cst_wide (type, low, 0);
836 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
837 if it is negative. This function is similar to build_int_cst, but
838 the extra bits outside of the type precision are cleared. Constants
839 with these extra bits may confuse the fold so that it detects overflows
840 even in cases when they do not occur, and in general should be avoided.
841 We cannot however make this a default behavior of build_int_cst without
842 more intrusive changes, since there are parts of gcc that rely on the extra
843 precision of the integer constants. */
846 build_int_cst_type (tree type, HOST_WIDE_INT low)
848 unsigned HOST_WIDE_INT low1;
853 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
855 return build_int_cst_wide (type, low1, hi);
858 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
859 and sign extended according to the value range of TYPE. */
862 build_int_cst_wide_type (tree type,
863 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
865 fit_double_type (low, high, &low, &high, type);
866 return build_int_cst_wide (type, low, high);
869 /* These are the hash table functions for the hash table of INTEGER_CST
870 nodes of a sizetype. */
872 /* Return the hash code code X, an INTEGER_CST. */
875 int_cst_hash_hash (const void *x)
877 const_tree const t = (const_tree) x;
879 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
880 ^ htab_hash_pointer (TREE_TYPE (t)));
883 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
884 is the same as that given by *Y, which is the same. */
887 int_cst_hash_eq (const void *x, const void *y)
889 const_tree const xt = (const_tree) x;
890 const_tree const yt = (const_tree) y;
892 return (TREE_TYPE (xt) == TREE_TYPE (yt)
893 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
894 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
897 /* Create an INT_CST node of TYPE and value HI:LOW.
898 The returned node is always shared. For small integers we use a
899 per-type vector cache, for larger ones we use a single hash table. */
902 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
910 switch (TREE_CODE (type))
914 /* Cache NULL pointer. */
923 /* Cache false or true. */
931 if (TYPE_UNSIGNED (type))
934 limit = INTEGER_SHARE_LIMIT;
935 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
941 limit = INTEGER_SHARE_LIMIT + 1;
942 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
944 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
958 /* Look for it in the type's vector of small shared ints. */
959 if (!TYPE_CACHED_VALUES_P (type))
961 TYPE_CACHED_VALUES_P (type) = 1;
962 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
965 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
968 /* Make sure no one is clobbering the shared constant. */
969 gcc_assert (TREE_TYPE (t) == type);
970 gcc_assert (TREE_INT_CST_LOW (t) == low);
971 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
975 /* Create a new shared int. */
976 t = make_node (INTEGER_CST);
978 TREE_INT_CST_LOW (t) = low;
979 TREE_INT_CST_HIGH (t) = hi;
980 TREE_TYPE (t) = type;
982 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
987 /* Use the cache of larger shared ints. */
990 TREE_INT_CST_LOW (int_cst_node) = low;
991 TREE_INT_CST_HIGH (int_cst_node) = hi;
992 TREE_TYPE (int_cst_node) = type;
994 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
998 /* Insert this one into the hash table. */
1001 /* Make a new node for next time round. */
1002 int_cst_node = make_node (INTEGER_CST);
1009 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1010 and the rest are zeros. */
1013 build_low_bits_mask (tree type, unsigned bits)
1015 unsigned HOST_WIDE_INT low;
1017 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1019 gcc_assert (bits <= TYPE_PRECISION (type));
1021 if (bits == TYPE_PRECISION (type)
1022 && !TYPE_UNSIGNED (type))
1024 /* Sign extended all-ones mask. */
1028 else if (bits <= HOST_BITS_PER_WIDE_INT)
1030 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1035 bits -= HOST_BITS_PER_WIDE_INT;
1037 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1040 return build_int_cst_wide (type, low, high);
1043 /* Checks that X is integer constant that can be expressed in (unsigned)
1044 HOST_WIDE_INT without loss of precision. */
1047 cst_and_fits_in_hwi (const_tree x)
1049 if (TREE_CODE (x) != INTEGER_CST)
1052 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1055 return (TREE_INT_CST_HIGH (x) == 0
1056 || TREE_INT_CST_HIGH (x) == -1);
1059 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1060 are in a list pointed to by VALS. */
1063 build_vector (tree type, tree vals)
1065 tree v = make_node (VECTOR_CST);
1069 TREE_VECTOR_CST_ELTS (v) = vals;
1070 TREE_TYPE (v) = type;
1072 /* Iterate through elements and check for overflow. */
1073 for (link = vals; link; link = TREE_CHAIN (link))
1075 tree value = TREE_VALUE (link);
1077 /* Don't crash if we get an address constant. */
1078 if (!CONSTANT_CLASS_P (value))
1081 over |= TREE_OVERFLOW (value);
1084 TREE_OVERFLOW (v) = over;
1088 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1089 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1092 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1094 tree list = NULL_TREE;
1095 unsigned HOST_WIDE_INT idx;
1098 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1099 list = tree_cons (NULL_TREE, value, list);
1100 return build_vector (type, nreverse (list));
1103 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1104 are in the VEC pointed to by VALS. */
1106 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1108 tree c = make_node (CONSTRUCTOR);
1109 TREE_TYPE (c) = type;
1110 CONSTRUCTOR_ELTS (c) = vals;
1114 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1117 build_constructor_single (tree type, tree index, tree value)
1119 VEC(constructor_elt,gc) *v;
1120 constructor_elt *elt;
1123 v = VEC_alloc (constructor_elt, gc, 1);
1124 elt = VEC_quick_push (constructor_elt, v, NULL);
1128 t = build_constructor (type, v);
1129 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1134 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1135 are in a list pointed to by VALS. */
1137 build_constructor_from_list (tree type, tree vals)
1140 VEC(constructor_elt,gc) *v = NULL;
1141 bool constant_p = true;
1145 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1146 for (t = vals; t; t = TREE_CHAIN (t))
1148 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1149 val = TREE_VALUE (t);
1150 elt->index = TREE_PURPOSE (t);
1152 if (!TREE_CONSTANT (val))
1157 t = build_constructor (type, v);
1158 TREE_CONSTANT (t) = constant_p;
1162 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1165 build_fixed (tree type, FIXED_VALUE_TYPE f)
1168 FIXED_VALUE_TYPE *fp;
1170 v = make_node (FIXED_CST);
1171 fp = GGC_NEW (FIXED_VALUE_TYPE);
1172 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1174 TREE_TYPE (v) = type;
1175 TREE_FIXED_CST_PTR (v) = fp;
1179 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1182 build_real (tree type, REAL_VALUE_TYPE d)
1185 REAL_VALUE_TYPE *dp;
1188 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1189 Consider doing it via real_convert now. */
1191 v = make_node (REAL_CST);
1192 dp = GGC_NEW (REAL_VALUE_TYPE);
1193 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1195 TREE_TYPE (v) = type;
1196 TREE_REAL_CST_PTR (v) = dp;
1197 TREE_OVERFLOW (v) = overflow;
1201 /* Return a new REAL_CST node whose type is TYPE
1202 and whose value is the integer value of the INTEGER_CST node I. */
1205 real_value_from_int_cst (const_tree type, const_tree i)
1209 /* Clear all bits of the real value type so that we can later do
1210 bitwise comparisons to see if two values are the same. */
1211 memset (&d, 0, sizeof d);
1213 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1214 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1215 TYPE_UNSIGNED (TREE_TYPE (i)));
1219 /* Given a tree representing an integer constant I, return a tree
1220 representing the same value as a floating-point constant of type TYPE. */
1223 build_real_from_int_cst (tree type, const_tree i)
1226 int overflow = TREE_OVERFLOW (i);
1228 v = build_real (type, real_value_from_int_cst (type, i));
1230 TREE_OVERFLOW (v) |= overflow;
1234 /* Return a newly constructed STRING_CST node whose value is
1235 the LEN characters at STR.
1236 The TREE_TYPE is not initialized. */
1239 build_string (int len, const char *str)
1244 /* Do not waste bytes provided by padding of struct tree_string. */
1245 length = len + offsetof (struct tree_string, str) + 1;
1247 #ifdef GATHER_STATISTICS
1248 tree_node_counts[(int) c_kind]++;
1249 tree_node_sizes[(int) c_kind] += length;
1252 s = ggc_alloc_tree (length);
1254 memset (s, 0, sizeof (struct tree_common));
1255 TREE_SET_CODE (s, STRING_CST);
1256 TREE_CONSTANT (s) = 1;
1257 TREE_STRING_LENGTH (s) = len;
1258 memcpy (s->string.str, str, len);
1259 s->string.str[len] = '\0';
1264 /* Return a newly constructed COMPLEX_CST node whose value is
1265 specified by the real and imaginary parts REAL and IMAG.
1266 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1267 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1270 build_complex (tree type, tree real, tree imag)
1272 tree t = make_node (COMPLEX_CST);
1274 TREE_REALPART (t) = real;
1275 TREE_IMAGPART (t) = imag;
1276 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1277 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1281 /* Return a constant of arithmetic type TYPE which is the
1282 multiplicative identity of the set TYPE. */
1285 build_one_cst (tree type)
1287 switch (TREE_CODE (type))
1289 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1290 case POINTER_TYPE: case REFERENCE_TYPE:
1292 return build_int_cst (type, 1);
1295 return build_real (type, dconst1);
1297 case FIXED_POINT_TYPE:
1298 /* We can only generate 1 for accum types. */
1299 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1300 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1307 scalar = build_one_cst (TREE_TYPE (type));
1309 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1311 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1312 cst = tree_cons (NULL_TREE, scalar, cst);
1314 return build_vector (type, cst);
1318 return build_complex (type,
1319 build_one_cst (TREE_TYPE (type)),
1320 fold_convert (TREE_TYPE (type), integer_zero_node));
1327 /* Build a BINFO with LEN language slots. */
1330 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1333 size_t length = (offsetof (struct tree_binfo, base_binfos)
1334 + VEC_embedded_size (tree, base_binfos));
1336 #ifdef GATHER_STATISTICS
1337 tree_node_counts[(int) binfo_kind]++;
1338 tree_node_sizes[(int) binfo_kind] += length;
1341 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1343 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1345 TREE_SET_CODE (t, TREE_BINFO);
1347 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1353 /* Build a newly constructed TREE_VEC node of length LEN. */
1356 make_tree_vec_stat (int len MEM_STAT_DECL)
1359 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1361 #ifdef GATHER_STATISTICS
1362 tree_node_counts[(int) vec_kind]++;
1363 tree_node_sizes[(int) vec_kind] += length;
1366 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1368 memset (t, 0, length);
1370 TREE_SET_CODE (t, TREE_VEC);
1371 TREE_VEC_LENGTH (t) = len;
1376 /* Return 1 if EXPR is the integer constant zero or a complex constant
1380 integer_zerop (const_tree expr)
1384 return ((TREE_CODE (expr) == INTEGER_CST
1385 && TREE_INT_CST_LOW (expr) == 0
1386 && TREE_INT_CST_HIGH (expr) == 0)
1387 || (TREE_CODE (expr) == COMPLEX_CST
1388 && integer_zerop (TREE_REALPART (expr))
1389 && integer_zerop (TREE_IMAGPART (expr))));
1392 /* Return 1 if EXPR is the integer constant one or the corresponding
1393 complex constant. */
1396 integer_onep (const_tree expr)
1400 return ((TREE_CODE (expr) == INTEGER_CST
1401 && TREE_INT_CST_LOW (expr) == 1
1402 && TREE_INT_CST_HIGH (expr) == 0)
1403 || (TREE_CODE (expr) == COMPLEX_CST
1404 && integer_onep (TREE_REALPART (expr))
1405 && integer_zerop (TREE_IMAGPART (expr))));
1408 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1409 it contains. Likewise for the corresponding complex constant. */
1412 integer_all_onesp (const_tree expr)
1419 if (TREE_CODE (expr) == COMPLEX_CST
1420 && integer_all_onesp (TREE_REALPART (expr))
1421 && integer_zerop (TREE_IMAGPART (expr)))
1424 else if (TREE_CODE (expr) != INTEGER_CST)
1427 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1428 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1429 && TREE_INT_CST_HIGH (expr) == -1)
1434 /* Note that using TYPE_PRECISION here is wrong. We care about the
1435 actual bits, not the (arbitrary) range of the type. */
1436 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1437 if (prec >= HOST_BITS_PER_WIDE_INT)
1439 HOST_WIDE_INT high_value;
1442 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1444 /* Can not handle precisions greater than twice the host int size. */
1445 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1446 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1447 /* Shifting by the host word size is undefined according to the ANSI
1448 standard, so we must handle this as a special case. */
1451 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1453 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1454 && TREE_INT_CST_HIGH (expr) == high_value);
1457 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1460 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1464 integer_pow2p (const_tree expr)
1467 HOST_WIDE_INT high, low;
1471 if (TREE_CODE (expr) == COMPLEX_CST
1472 && integer_pow2p (TREE_REALPART (expr))
1473 && integer_zerop (TREE_IMAGPART (expr)))
1476 if (TREE_CODE (expr) != INTEGER_CST)
1479 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1480 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1481 high = TREE_INT_CST_HIGH (expr);
1482 low = TREE_INT_CST_LOW (expr);
1484 /* First clear all bits that are beyond the type's precision in case
1485 we've been sign extended. */
1487 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1489 else if (prec > HOST_BITS_PER_WIDE_INT)
1490 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1494 if (prec < HOST_BITS_PER_WIDE_INT)
1495 low &= ~((HOST_WIDE_INT) (-1) << prec);
1498 if (high == 0 && low == 0)
1501 return ((high == 0 && (low & (low - 1)) == 0)
1502 || (low == 0 && (high & (high - 1)) == 0));
1505 /* Return 1 if EXPR is an integer constant other than zero or a
1506 complex constant other than zero. */
1509 integer_nonzerop (const_tree expr)
1513 return ((TREE_CODE (expr) == INTEGER_CST
1514 && (TREE_INT_CST_LOW (expr) != 0
1515 || TREE_INT_CST_HIGH (expr) != 0))
1516 || (TREE_CODE (expr) == COMPLEX_CST
1517 && (integer_nonzerop (TREE_REALPART (expr))
1518 || integer_nonzerop (TREE_IMAGPART (expr)))));
1521 /* Return 1 if EXPR is the fixed-point constant zero. */
1524 fixed_zerop (const_tree expr)
1526 return (TREE_CODE (expr) == FIXED_CST
1527 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1530 /* Return the power of two represented by a tree node known to be a
1534 tree_log2 (const_tree expr)
1537 HOST_WIDE_INT high, low;
1541 if (TREE_CODE (expr) == COMPLEX_CST)
1542 return tree_log2 (TREE_REALPART (expr));
1544 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1545 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1547 high = TREE_INT_CST_HIGH (expr);
1548 low = TREE_INT_CST_LOW (expr);
1550 /* First clear all bits that are beyond the type's precision in case
1551 we've been sign extended. */
1553 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1555 else if (prec > HOST_BITS_PER_WIDE_INT)
1556 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1560 if (prec < HOST_BITS_PER_WIDE_INT)
1561 low &= ~((HOST_WIDE_INT) (-1) << prec);
1564 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1565 : exact_log2 (low));
1568 /* Similar, but return the largest integer Y such that 2 ** Y is less
1569 than or equal to EXPR. */
1572 tree_floor_log2 (const_tree expr)
1575 HOST_WIDE_INT high, low;
1579 if (TREE_CODE (expr) == COMPLEX_CST)
1580 return tree_log2 (TREE_REALPART (expr));
1582 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1583 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1585 high = TREE_INT_CST_HIGH (expr);
1586 low = TREE_INT_CST_LOW (expr);
1588 /* First clear all bits that are beyond the type's precision in case
1589 we've been sign extended. Ignore if type's precision hasn't been set
1590 since what we are doing is setting it. */
1592 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1594 else if (prec > HOST_BITS_PER_WIDE_INT)
1595 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1599 if (prec < HOST_BITS_PER_WIDE_INT)
1600 low &= ~((HOST_WIDE_INT) (-1) << prec);
1603 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1604 : floor_log2 (low));
1607 /* Return 1 if EXPR is the real constant zero. */
1610 real_zerop (const_tree expr)
1614 return ((TREE_CODE (expr) == REAL_CST
1615 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1616 || (TREE_CODE (expr) == COMPLEX_CST
1617 && real_zerop (TREE_REALPART (expr))
1618 && real_zerop (TREE_IMAGPART (expr))));
1621 /* Return 1 if EXPR is the real constant one in real or complex form. */
1624 real_onep (const_tree expr)
1628 return ((TREE_CODE (expr) == REAL_CST
1629 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1630 || (TREE_CODE (expr) == COMPLEX_CST
1631 && real_onep (TREE_REALPART (expr))
1632 && real_zerop (TREE_IMAGPART (expr))));
1635 /* Return 1 if EXPR is the real constant two. */
1638 real_twop (const_tree expr)
1642 return ((TREE_CODE (expr) == REAL_CST
1643 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1644 || (TREE_CODE (expr) == COMPLEX_CST
1645 && real_twop (TREE_REALPART (expr))
1646 && real_zerop (TREE_IMAGPART (expr))));
1649 /* Return 1 if EXPR is the real constant minus one. */
1652 real_minus_onep (const_tree expr)
1656 return ((TREE_CODE (expr) == REAL_CST
1657 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1658 || (TREE_CODE (expr) == COMPLEX_CST
1659 && real_minus_onep (TREE_REALPART (expr))
1660 && real_zerop (TREE_IMAGPART (expr))));
1663 /* Nonzero if EXP is a constant or a cast of a constant. */
1666 really_constant_p (const_tree exp)
1668 /* This is not quite the same as STRIP_NOPS. It does more. */
1669 while (CONVERT_EXPR_P (exp)
1670 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1671 exp = TREE_OPERAND (exp, 0);
1672 return TREE_CONSTANT (exp);
1675 /* Return first list element whose TREE_VALUE is ELEM.
1676 Return 0 if ELEM is not in LIST. */
1679 value_member (tree elem, tree list)
1683 if (elem == TREE_VALUE (list))
1685 list = TREE_CHAIN (list);
1690 /* Return first list element whose TREE_PURPOSE is ELEM.
1691 Return 0 if ELEM is not in LIST. */
1694 purpose_member (const_tree elem, tree list)
1698 if (elem == TREE_PURPOSE (list))
1700 list = TREE_CHAIN (list);
1705 /* Return nonzero if ELEM is part of the chain CHAIN. */
1708 chain_member (const_tree elem, const_tree chain)
1714 chain = TREE_CHAIN (chain);
1720 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1721 We expect a null pointer to mark the end of the chain.
1722 This is the Lisp primitive `length'. */
1725 list_length (const_tree t)
1728 #ifdef ENABLE_TREE_CHECKING
1736 #ifdef ENABLE_TREE_CHECKING
1739 gcc_assert (p != q);
1747 /* Returns the number of FIELD_DECLs in TYPE. */
1750 fields_length (const_tree type)
1752 tree t = TYPE_FIELDS (type);
1755 for (; t; t = TREE_CHAIN (t))
1756 if (TREE_CODE (t) == FIELD_DECL)
1762 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1763 by modifying the last node in chain 1 to point to chain 2.
1764 This is the Lisp primitive `nconc'. */
1767 chainon (tree op1, tree op2)
1776 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1778 TREE_CHAIN (t1) = op2;
1780 #ifdef ENABLE_TREE_CHECKING
1783 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1784 gcc_assert (t2 != t1);
1791 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1794 tree_last (tree chain)
1798 while ((next = TREE_CHAIN (chain)))
1803 /* Reverse the order of elements in the chain T,
1804 and return the new head of the chain (old last element). */
1809 tree prev = 0, decl, next;
1810 for (decl = t; decl; decl = next)
1812 next = TREE_CHAIN (decl);
1813 TREE_CHAIN (decl) = prev;
1819 /* Return a newly created TREE_LIST node whose
1820 purpose and value fields are PARM and VALUE. */
1823 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1825 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1826 TREE_PURPOSE (t) = parm;
1827 TREE_VALUE (t) = value;
1831 /* Return a newly created TREE_LIST node whose
1832 purpose and value fields are PURPOSE and VALUE
1833 and whose TREE_CHAIN is CHAIN. */
1836 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1840 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1842 memset (node, 0, sizeof (struct tree_common));
1844 #ifdef GATHER_STATISTICS
1845 tree_node_counts[(int) x_kind]++;
1846 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1849 TREE_SET_CODE (node, TREE_LIST);
1850 TREE_CHAIN (node) = chain;
1851 TREE_PURPOSE (node) = purpose;
1852 TREE_VALUE (node) = value;
1856 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
1859 ctor_to_list (tree ctor)
1861 tree list = NULL_TREE;
1866 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
1868 *p = build_tree_list (purpose, val);
1869 p = &TREE_CHAIN (*p);
1875 /* Return the size nominally occupied by an object of type TYPE
1876 when it resides in memory. The value is measured in units of bytes,
1877 and its data type is that normally used for type sizes
1878 (which is the first type created by make_signed_type or
1879 make_unsigned_type). */
1882 size_in_bytes (const_tree type)
1886 if (type == error_mark_node)
1887 return integer_zero_node;
1889 type = TYPE_MAIN_VARIANT (type);
1890 t = TYPE_SIZE_UNIT (type);
1894 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1895 return size_zero_node;
1901 /* Return the size of TYPE (in bytes) as a wide integer
1902 or return -1 if the size can vary or is larger than an integer. */
1905 int_size_in_bytes (const_tree type)
1909 if (type == error_mark_node)
1912 type = TYPE_MAIN_VARIANT (type);
1913 t = TYPE_SIZE_UNIT (type);
1915 || TREE_CODE (t) != INTEGER_CST
1916 || TREE_INT_CST_HIGH (t) != 0
1917 /* If the result would appear negative, it's too big to represent. */
1918 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1921 return TREE_INT_CST_LOW (t);
1924 /* Return the maximum size of TYPE (in bytes) as a wide integer
1925 or return -1 if the size can vary or is larger than an integer. */
1928 max_int_size_in_bytes (const_tree type)
1930 HOST_WIDE_INT size = -1;
1933 /* If this is an array type, check for a possible MAX_SIZE attached. */
1935 if (TREE_CODE (type) == ARRAY_TYPE)
1937 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1939 if (size_tree && host_integerp (size_tree, 1))
1940 size = tree_low_cst (size_tree, 1);
1943 /* If we still haven't been able to get a size, see if the language
1944 can compute a maximum size. */
1948 size_tree = lang_hooks.types.max_size (type);
1950 if (size_tree && host_integerp (size_tree, 1))
1951 size = tree_low_cst (size_tree, 1);
1957 /* Return the bit position of FIELD, in bits from the start of the record.
1958 This is a tree of type bitsizetype. */
1961 bit_position (const_tree field)
1963 return bit_from_pos (DECL_FIELD_OFFSET (field),
1964 DECL_FIELD_BIT_OFFSET (field));
1967 /* Likewise, but return as an integer. It must be representable in
1968 that way (since it could be a signed value, we don't have the
1969 option of returning -1 like int_size_in_byte can. */
1972 int_bit_position (const_tree field)
1974 return tree_low_cst (bit_position (field), 0);
1977 /* Return the byte position of FIELD, in bytes from the start of the record.
1978 This is a tree of type sizetype. */
1981 byte_position (const_tree field)
1983 return byte_from_pos (DECL_FIELD_OFFSET (field),
1984 DECL_FIELD_BIT_OFFSET (field));
1987 /* Likewise, but return as an integer. It must be representable in
1988 that way (since it could be a signed value, we don't have the
1989 option of returning -1 like int_size_in_byte can. */
1992 int_byte_position (const_tree field)
1994 return tree_low_cst (byte_position (field), 0);
1997 /* Return the strictest alignment, in bits, that T is known to have. */
2000 expr_align (const_tree t)
2002 unsigned int align0, align1;
2004 switch (TREE_CODE (t))
2006 CASE_CONVERT: case NON_LVALUE_EXPR:
2007 /* If we have conversions, we know that the alignment of the
2008 object must meet each of the alignments of the types. */
2009 align0 = expr_align (TREE_OPERAND (t, 0));
2010 align1 = TYPE_ALIGN (TREE_TYPE (t));
2011 return MAX (align0, align1);
2013 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2014 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2015 case CLEANUP_POINT_EXPR:
2016 /* These don't change the alignment of an object. */
2017 return expr_align (TREE_OPERAND (t, 0));
2020 /* The best we can do is say that the alignment is the least aligned
2022 align0 = expr_align (TREE_OPERAND (t, 1));
2023 align1 = expr_align (TREE_OPERAND (t, 2));
2024 return MIN (align0, align1);
2026 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2027 meaningfully, it's always 1. */
2028 case LABEL_DECL: case CONST_DECL:
2029 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2031 gcc_assert (DECL_ALIGN (t) != 0);
2032 return DECL_ALIGN (t);
2038 /* Otherwise take the alignment from that of the type. */
2039 return TYPE_ALIGN (TREE_TYPE (t));
2042 /* Return, as a tree node, the number of elements for TYPE (which is an
2043 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2046 array_type_nelts (const_tree type)
2048 tree index_type, min, max;
2050 /* If they did it with unspecified bounds, then we should have already
2051 given an error about it before we got here. */
2052 if (! TYPE_DOMAIN (type))
2053 return error_mark_node;
2055 index_type = TYPE_DOMAIN (type);
2056 min = TYPE_MIN_VALUE (index_type);
2057 max = TYPE_MAX_VALUE (index_type);
2059 return (integer_zerop (min)
2061 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2064 /* If arg is static -- a reference to an object in static storage -- then
2065 return the object. This is not the same as the C meaning of `static'.
2066 If arg isn't static, return NULL. */
2071 switch (TREE_CODE (arg))
2074 /* Nested functions are static, even though taking their address will
2075 involve a trampoline as we unnest the nested function and create
2076 the trampoline on the tree level. */
2080 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2081 && ! DECL_THREAD_LOCAL_P (arg)
2082 && ! DECL_DLLIMPORT_P (arg)
2086 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2090 return TREE_STATIC (arg) ? arg : NULL;
2097 /* If the thing being referenced is not a field, then it is
2098 something language specific. */
2099 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2100 return (*lang_hooks.staticp) (arg);
2102 /* If we are referencing a bitfield, we can't evaluate an
2103 ADDR_EXPR at compile time and so it isn't a constant. */
2104 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2107 return staticp (TREE_OPERAND (arg, 0));
2112 case MISALIGNED_INDIRECT_REF:
2113 case ALIGN_INDIRECT_REF:
2115 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2118 case ARRAY_RANGE_REF:
2119 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2120 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2121 return staticp (TREE_OPERAND (arg, 0));
2126 if ((unsigned int) TREE_CODE (arg)
2127 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2128 return lang_hooks.staticp (arg);
2137 /* Return whether OP is a DECL whose address is function-invariant. */
2140 decl_address_invariant_p (const_tree op)
2142 /* The conditions below are slightly less strict than the one in
2145 switch (TREE_CODE (op))
2154 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2155 && !DECL_DLLIMPORT_P (op))
2156 || DECL_THREAD_LOCAL_P (op)
2157 || DECL_CONTEXT (op) == current_function_decl
2158 || decl_function_context (op) == current_function_decl)
2163 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2164 || decl_function_context (op) == current_function_decl)
2176 /* Return true if T is function-invariant (internal function, does
2177 not handle arithmetic; that's handled in skip_simple_arithmetic and
2178 tree_invariant_p). */
2180 static bool tree_invariant_p (tree t);
2183 tree_invariant_p_1 (tree t)
2187 if (TREE_CONSTANT (t)
2188 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2191 switch (TREE_CODE (t))
2197 op = TREE_OPERAND (t, 0);
2198 while (handled_component_p (op))
2200 switch (TREE_CODE (op))
2203 case ARRAY_RANGE_REF:
2204 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2205 || TREE_OPERAND (op, 2) != NULL_TREE
2206 || TREE_OPERAND (op, 3) != NULL_TREE)
2211 if (TREE_OPERAND (op, 2) != NULL_TREE)
2217 op = TREE_OPERAND (op, 0);
2220 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2229 /* Return true if T is function-invariant. */
2232 tree_invariant_p (tree t)
2234 tree inner = skip_simple_arithmetic (t);
2235 return tree_invariant_p_1 (inner);
2238 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2239 Do this to any expression which may be used in more than one place,
2240 but must be evaluated only once.
2242 Normally, expand_expr would reevaluate the expression each time.
2243 Calling save_expr produces something that is evaluated and recorded
2244 the first time expand_expr is called on it. Subsequent calls to
2245 expand_expr just reuse the recorded value.
2247 The call to expand_expr that generates code that actually computes
2248 the value is the first call *at compile time*. Subsequent calls
2249 *at compile time* generate code to use the saved value.
2250 This produces correct result provided that *at run time* control
2251 always flows through the insns made by the first expand_expr
2252 before reaching the other places where the save_expr was evaluated.
2253 You, the caller of save_expr, must make sure this is so.
2255 Constants, and certain read-only nodes, are returned with no
2256 SAVE_EXPR because that is safe. Expressions containing placeholders
2257 are not touched; see tree.def for an explanation of what these
2261 save_expr (tree expr)
2263 tree t = fold (expr);
2266 /* If the tree evaluates to a constant, then we don't want to hide that
2267 fact (i.e. this allows further folding, and direct checks for constants).
2268 However, a read-only object that has side effects cannot be bypassed.
2269 Since it is no problem to reevaluate literals, we just return the
2271 inner = skip_simple_arithmetic (t);
2272 if (TREE_CODE (inner) == ERROR_MARK)
2275 if (tree_invariant_p_1 (inner))
2278 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2279 it means that the size or offset of some field of an object depends on
2280 the value within another field.
2282 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2283 and some variable since it would then need to be both evaluated once and
2284 evaluated more than once. Front-ends must assure this case cannot
2285 happen by surrounding any such subexpressions in their own SAVE_EXPR
2286 and forcing evaluation at the proper time. */
2287 if (contains_placeholder_p (inner))
2290 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2292 /* This expression might be placed ahead of a jump to ensure that the
2293 value was computed on both sides of the jump. So make sure it isn't
2294 eliminated as dead. */
2295 TREE_SIDE_EFFECTS (t) = 1;
2299 /* Look inside EXPR and into any simple arithmetic operations. Return
2300 the innermost non-arithmetic node. */
2303 skip_simple_arithmetic (tree expr)
2307 /* We don't care about whether this can be used as an lvalue in this
2309 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2310 expr = TREE_OPERAND (expr, 0);
2312 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2313 a constant, it will be more efficient to not make another SAVE_EXPR since
2314 it will allow better simplification and GCSE will be able to merge the
2315 computations if they actually occur. */
2319 if (UNARY_CLASS_P (inner))
2320 inner = TREE_OPERAND (inner, 0);
2321 else if (BINARY_CLASS_P (inner))
2323 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2324 inner = TREE_OPERAND (inner, 0);
2325 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2326 inner = TREE_OPERAND (inner, 1);
2337 /* Return which tree structure is used by T. */
2339 enum tree_node_structure_enum
2340 tree_node_structure (const_tree t)
2342 const enum tree_code code = TREE_CODE (t);
2344 switch (TREE_CODE_CLASS (code))
2346 case tcc_declaration:
2351 return TS_FIELD_DECL;
2353 return TS_PARM_DECL;
2357 return TS_LABEL_DECL;
2359 return TS_RESULT_DECL;
2361 return TS_CONST_DECL;
2363 return TS_TYPE_DECL;
2365 return TS_FUNCTION_DECL;
2366 case SYMBOL_MEMORY_TAG:
2367 case NAME_MEMORY_TAG:
2368 case MEMORY_PARTITION_TAG:
2369 return TS_MEMORY_TAG;
2371 return TS_DECL_NON_COMMON;
2377 case tcc_comparison:
2380 case tcc_expression:
2384 default: /* tcc_constant and tcc_exceptional */
2389 /* tcc_constant cases. */
2390 case INTEGER_CST: return TS_INT_CST;
2391 case REAL_CST: return TS_REAL_CST;
2392 case FIXED_CST: return TS_FIXED_CST;
2393 case COMPLEX_CST: return TS_COMPLEX;
2394 case VECTOR_CST: return TS_VECTOR;
2395 case STRING_CST: return TS_STRING;
2396 /* tcc_exceptional cases. */
2397 case ERROR_MARK: return TS_COMMON;
2398 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2399 case TREE_LIST: return TS_LIST;
2400 case TREE_VEC: return TS_VEC;
2401 case SSA_NAME: return TS_SSA_NAME;
2402 case PLACEHOLDER_EXPR: return TS_COMMON;
2403 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2404 case BLOCK: return TS_BLOCK;
2405 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2406 case TREE_BINFO: return TS_BINFO;
2407 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2408 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
2409 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
2416 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2417 or offset that depends on a field within a record. */
2420 contains_placeholder_p (const_tree exp)
2422 enum tree_code code;
2427 code = TREE_CODE (exp);
2428 if (code == PLACEHOLDER_EXPR)
2431 switch (TREE_CODE_CLASS (code))
2434 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2435 position computations since they will be converted into a
2436 WITH_RECORD_EXPR involving the reference, which will assume
2437 here will be valid. */
2438 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2440 case tcc_exceptional:
2441 if (code == TREE_LIST)
2442 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2443 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2448 case tcc_comparison:
2449 case tcc_expression:
2453 /* Ignoring the first operand isn't quite right, but works best. */
2454 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2457 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2458 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2459 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2465 switch (TREE_CODE_LENGTH (code))
2468 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2470 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2471 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2482 const_call_expr_arg_iterator iter;
2483 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2484 if (CONTAINS_PLACEHOLDER_P (arg))
2498 /* Return true if any part of the computation of TYPE involves a
2499 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2500 (for QUAL_UNION_TYPE) and field positions. */
2503 type_contains_placeholder_1 (const_tree type)
2505 /* If the size contains a placeholder or the parent type (component type in
2506 the case of arrays) type involves a placeholder, this type does. */
2507 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2508 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2509 || (TREE_TYPE (type) != 0
2510 && type_contains_placeholder_p (TREE_TYPE (type))))
2513 /* Now do type-specific checks. Note that the last part of the check above
2514 greatly limits what we have to do below. */
2515 switch (TREE_CODE (type))
2523 case REFERENCE_TYPE:
2531 case FIXED_POINT_TYPE:
2532 /* Here we just check the bounds. */
2533 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2534 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2537 /* We're already checked the component type (TREE_TYPE), so just check
2539 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2543 case QUAL_UNION_TYPE:
2547 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2548 if (TREE_CODE (field) == FIELD_DECL
2549 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2550 || (TREE_CODE (type) == QUAL_UNION_TYPE
2551 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2552 || type_contains_placeholder_p (TREE_TYPE (field))))
2564 type_contains_placeholder_p (tree type)
2568 /* If the contains_placeholder_bits field has been initialized,
2569 then we know the answer. */
2570 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2571 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2573 /* Indicate that we've seen this type node, and the answer is false.
2574 This is what we want to return if we run into recursion via fields. */
2575 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2577 /* Compute the real value. */
2578 result = type_contains_placeholder_1 (type);
2580 /* Store the real value. */
2581 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2586 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2587 return a tree with all occurrences of references to F in a
2588 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2589 contains only arithmetic expressions or a CALL_EXPR with a
2590 PLACEHOLDER_EXPR occurring only in its arglist. */
2593 substitute_in_expr (tree exp, tree f, tree r)
2595 enum tree_code code = TREE_CODE (exp);
2596 tree op0, op1, op2, op3;
2597 tree new_tree, inner;
2599 /* We handle TREE_LIST and COMPONENT_REF separately. */
2600 if (code == TREE_LIST)
2602 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2603 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2604 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2607 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2609 else if (code == COMPONENT_REF)
2611 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2612 and it is the right field, replace it with R. */
2613 for (inner = TREE_OPERAND (exp, 0);
2614 REFERENCE_CLASS_P (inner);
2615 inner = TREE_OPERAND (inner, 0))
2617 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2618 && TREE_OPERAND (exp, 1) == f)
2621 /* If this expression hasn't been completed let, leave it alone. */
2622 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2625 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2626 if (op0 == TREE_OPERAND (exp, 0))
2629 new_tree = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2630 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2633 switch (TREE_CODE_CLASS (code))
2636 case tcc_declaration:
2639 case tcc_exceptional:
2642 case tcc_comparison:
2643 case tcc_expression:
2645 switch (TREE_CODE_LENGTH (code))
2651 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2652 if (op0 == TREE_OPERAND (exp, 0))
2655 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
2659 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2660 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2662 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2665 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2669 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2670 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2671 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2673 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2674 && op2 == TREE_OPERAND (exp, 2))
2677 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2681 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2682 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2683 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2684 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2686 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2687 && op2 == TREE_OPERAND (exp, 2)
2688 && op3 == TREE_OPERAND (exp, 3))
2691 new_tree = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2701 tree copy = NULL_TREE;
2704 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2706 tree op = TREE_OPERAND (exp, i);
2707 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
2711 copy = copy_node (exp);
2712 TREE_OPERAND (copy, i) = new_op;
2717 new_tree = fold (copy);
2727 TREE_READONLY (new_tree) = TREE_READONLY (exp);
2731 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2732 for it within OBJ, a tree that is an object or a chain of references. */
2735 substitute_placeholder_in_expr (tree exp, tree obj)
2737 enum tree_code code = TREE_CODE (exp);
2738 tree op0, op1, op2, op3;
2740 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2741 in the chain of OBJ. */
2742 if (code == PLACEHOLDER_EXPR)
2744 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2747 for (elt = obj; elt != 0;
2748 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2749 || TREE_CODE (elt) == COND_EXPR)
2750 ? TREE_OPERAND (elt, 1)
2751 : (REFERENCE_CLASS_P (elt)
2752 || UNARY_CLASS_P (elt)
2753 || BINARY_CLASS_P (elt)
2754 || VL_EXP_CLASS_P (elt)
2755 || EXPRESSION_CLASS_P (elt))
2756 ? TREE_OPERAND (elt, 0) : 0))
2757 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2760 for (elt = obj; elt != 0;
2761 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2762 || TREE_CODE (elt) == COND_EXPR)
2763 ? TREE_OPERAND (elt, 1)
2764 : (REFERENCE_CLASS_P (elt)
2765 || UNARY_CLASS_P (elt)
2766 || BINARY_CLASS_P (elt)
2767 || VL_EXP_CLASS_P (elt)
2768 || EXPRESSION_CLASS_P (elt))
2769 ? TREE_OPERAND (elt, 0) : 0))
2770 if (POINTER_TYPE_P (TREE_TYPE (elt))
2771 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2773 return fold_build1 (INDIRECT_REF, need_type, elt);
2775 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2776 survives until RTL generation, there will be an error. */
2780 /* TREE_LIST is special because we need to look at TREE_VALUE
2781 and TREE_CHAIN, not TREE_OPERANDS. */
2782 else if (code == TREE_LIST)
2784 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2785 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2786 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2789 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2792 switch (TREE_CODE_CLASS (code))
2795 case tcc_declaration:
2798 case tcc_exceptional:
2801 case tcc_comparison:
2802 case tcc_expression:
2805 switch (TREE_CODE_LENGTH (code))
2811 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2812 if (op0 == TREE_OPERAND (exp, 0))
2815 return fold_build1 (code, TREE_TYPE (exp), op0);
2818 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2819 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2821 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2824 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2827 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2828 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2829 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2831 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2832 && op2 == TREE_OPERAND (exp, 2))
2835 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2838 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2839 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2840 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2841 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2843 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2844 && op2 == TREE_OPERAND (exp, 2)
2845 && op3 == TREE_OPERAND (exp, 3))
2848 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2857 tree copy = NULL_TREE;
2860 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2862 tree op = TREE_OPERAND (exp, i);
2863 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2867 copy = copy_node (exp);
2868 TREE_OPERAND (copy, i) = new_op;
2883 /* Stabilize a reference so that we can use it any number of times
2884 without causing its operands to be evaluated more than once.
2885 Returns the stabilized reference. This works by means of save_expr,
2886 so see the caveats in the comments about save_expr.
2888 Also allows conversion expressions whose operands are references.
2889 Any other kind of expression is returned unchanged. */
2892 stabilize_reference (tree ref)
2895 enum tree_code code = TREE_CODE (ref);
2902 /* No action is needed in this case. */
2907 case FIX_TRUNC_EXPR:
2908 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2912 result = build_nt (INDIRECT_REF,
2913 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2917 result = build_nt (COMPONENT_REF,
2918 stabilize_reference (TREE_OPERAND (ref, 0)),
2919 TREE_OPERAND (ref, 1), NULL_TREE);
2923 result = build_nt (BIT_FIELD_REF,
2924 stabilize_reference (TREE_OPERAND (ref, 0)),
2925 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2926 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2930 result = build_nt (ARRAY_REF,
2931 stabilize_reference (TREE_OPERAND (ref, 0)),
2932 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2933 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2936 case ARRAY_RANGE_REF:
2937 result = build_nt (ARRAY_RANGE_REF,
2938 stabilize_reference (TREE_OPERAND (ref, 0)),
2939 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2940 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2944 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2945 it wouldn't be ignored. This matters when dealing with
2947 return stabilize_reference_1 (ref);
2949 /* If arg isn't a kind of lvalue we recognize, make no change.
2950 Caller should recognize the error for an invalid lvalue. */
2955 return error_mark_node;
2958 TREE_TYPE (result) = TREE_TYPE (ref);
2959 TREE_READONLY (result) = TREE_READONLY (ref);
2960 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2961 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2966 /* Subroutine of stabilize_reference; this is called for subtrees of
2967 references. Any expression with side-effects must be put in a SAVE_EXPR
2968 to ensure that it is only evaluated once.
2970 We don't put SAVE_EXPR nodes around everything, because assigning very
2971 simple expressions to temporaries causes us to miss good opportunities
2972 for optimizations. Among other things, the opportunity to fold in the
2973 addition of a constant into an addressing mode often gets lost, e.g.
2974 "y[i+1] += x;". In general, we take the approach that we should not make
2975 an assignment unless we are forced into it - i.e., that any non-side effect
2976 operator should be allowed, and that cse should take care of coalescing
2977 multiple utterances of the same expression should that prove fruitful. */
2980 stabilize_reference_1 (tree e)
2983 enum tree_code code = TREE_CODE (e);
2985 /* We cannot ignore const expressions because it might be a reference
2986 to a const array but whose index contains side-effects. But we can
2987 ignore things that are actual constant or that already have been
2988 handled by this function. */
2990 if (tree_invariant_p (e))
2993 switch (TREE_CODE_CLASS (code))
2995 case tcc_exceptional:
2997 case tcc_declaration:
2998 case tcc_comparison:
3000 case tcc_expression:
3003 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3004 so that it will only be evaluated once. */
3005 /* The reference (r) and comparison (<) classes could be handled as
3006 below, but it is generally faster to only evaluate them once. */
3007 if (TREE_SIDE_EFFECTS (e))
3008 return save_expr (e);
3012 /* Constants need no processing. In fact, we should never reach
3017 /* Division is slow and tends to be compiled with jumps,
3018 especially the division by powers of 2 that is often
3019 found inside of an array reference. So do it just once. */
3020 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3021 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3022 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3023 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3024 return save_expr (e);
3025 /* Recursively stabilize each operand. */
3026 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3027 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3031 /* Recursively stabilize each operand. */
3032 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3039 TREE_TYPE (result) = TREE_TYPE (e);
3040 TREE_READONLY (result) = TREE_READONLY (e);
3041 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3042 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3047 /* Low-level constructors for expressions. */
3049 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3050 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3053 recompute_tree_invariant_for_addr_expr (tree t)
3056 bool tc = true, se = false;
3058 /* We started out assuming this address is both invariant and constant, but
3059 does not have side effects. Now go down any handled components and see if
3060 any of them involve offsets that are either non-constant or non-invariant.
3061 Also check for side-effects.
3063 ??? Note that this code makes no attempt to deal with the case where
3064 taking the address of something causes a copy due to misalignment. */
3066 #define UPDATE_FLAGS(NODE) \
3067 do { tree _node = (NODE); \
3068 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3069 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3071 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3072 node = TREE_OPERAND (node, 0))
3074 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3075 array reference (probably made temporarily by the G++ front end),
3076 so ignore all the operands. */
3077 if ((TREE_CODE (node) == ARRAY_REF
3078 || TREE_CODE (node) == ARRAY_RANGE_REF)
3079 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3081 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3082 if (TREE_OPERAND (node, 2))
3083 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3084 if (TREE_OPERAND (node, 3))
3085 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3087 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3088 FIELD_DECL, apparently. The G++ front end can put something else
3089 there, at least temporarily. */
3090 else if (TREE_CODE (node) == COMPONENT_REF
3091 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3093 if (TREE_OPERAND (node, 2))
3094 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3096 else if (TREE_CODE (node) == BIT_FIELD_REF)
3097 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3100 node = lang_hooks.expr_to_decl (node, &tc, &se);
3102 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3103 the address, since &(*a)->b is a form of addition. If it's a constant, the
3104 address is constant too. If it's a decl, its address is constant if the
3105 decl is static. Everything else is not constant and, furthermore,
3106 taking the address of a volatile variable is not volatile. */
3107 if (TREE_CODE (node) == INDIRECT_REF)
3108 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3109 else if (CONSTANT_CLASS_P (node))
3111 else if (DECL_P (node))
3112 tc &= (staticp (node) != NULL_TREE);
3116 se |= TREE_SIDE_EFFECTS (node);
3120 TREE_CONSTANT (t) = tc;
3121 TREE_SIDE_EFFECTS (t) = se;
3125 /* Build an expression of code CODE, data type TYPE, and operands as
3126 specified. Expressions and reference nodes can be created this way.
3127 Constants, decls, types and misc nodes cannot be.
3129 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3130 enough for all extant tree codes. */
3133 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3137 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3139 t = make_node_stat (code PASS_MEM_STAT);
3146 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3148 int length = sizeof (struct tree_exp);
3149 #ifdef GATHER_STATISTICS
3150 tree_node_kind kind;
3154 #ifdef GATHER_STATISTICS
3155 switch (TREE_CODE_CLASS (code))
3157 case tcc_statement: /* an expression with side effects */
3160 case tcc_reference: /* a reference */
3168 tree_node_counts[(int) kind]++;
3169 tree_node_sizes[(int) kind] += length;
3172 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3174 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3176 memset (t, 0, sizeof (struct tree_common));
3178 TREE_SET_CODE (t, code);
3180 TREE_TYPE (t) = type;
3181 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3182 TREE_OPERAND (t, 0) = node;
3183 TREE_BLOCK (t) = NULL_TREE;
3184 if (node && !TYPE_P (node))
3186 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3187 TREE_READONLY (t) = TREE_READONLY (node);
3190 if (TREE_CODE_CLASS (code) == tcc_statement)
3191 TREE_SIDE_EFFECTS (t) = 1;
3195 /* All of these have side-effects, no matter what their
3197 TREE_SIDE_EFFECTS (t) = 1;
3198 TREE_READONLY (t) = 0;
3201 case MISALIGNED_INDIRECT_REF:
3202 case ALIGN_INDIRECT_REF:
3204 /* Whether a dereference is readonly has nothing to do with whether
3205 its operand is readonly. */
3206 TREE_READONLY (t) = 0;
3211 recompute_tree_invariant_for_addr_expr (t);
3215 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3216 && node && !TYPE_P (node)
3217 && TREE_CONSTANT (node))
3218 TREE_CONSTANT (t) = 1;
3219 if (TREE_CODE_CLASS (code) == tcc_reference
3220 && node && TREE_THIS_VOLATILE (node))
3221 TREE_THIS_VOLATILE (t) = 1;
3228 #define PROCESS_ARG(N) \
3230 TREE_OPERAND (t, N) = arg##N; \
3231 if (arg##N &&!TYPE_P (arg##N)) \
3233 if (TREE_SIDE_EFFECTS (arg##N)) \
3235 if (!TREE_READONLY (arg##N)) \
3237 if (!TREE_CONSTANT (arg##N)) \
3243 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3245 bool constant, read_only, side_effects;
3248 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3250 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3251 && arg0 && arg1 && tt && POINTER_TYPE_P (tt))
3252 gcc_assert (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST);
3254 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3255 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3256 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3257 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3259 t = make_node_stat (code PASS_MEM_STAT);
3262 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3263 result based on those same flags for the arguments. But if the
3264 arguments aren't really even `tree' expressions, we shouldn't be trying
3267 /* Expressions without side effects may be constant if their
3268 arguments are as well. */
3269 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3270 || TREE_CODE_CLASS (code) == tcc_binary);
3272 side_effects = TREE_SIDE_EFFECTS (t);
3277 TREE_READONLY (t) = read_only;
3278 TREE_CONSTANT (t) = constant;
3279 TREE_SIDE_EFFECTS (t) = side_effects;
3280 TREE_THIS_VOLATILE (t)
3281 = (TREE_CODE_CLASS (code) == tcc_reference
3282 && arg0 && TREE_THIS_VOLATILE (arg0));
3289 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3290 tree arg2 MEM_STAT_DECL)
3292 bool constant, read_only, side_effects;
3295 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3296 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3298 t = make_node_stat (code PASS_MEM_STAT);
3301 /* As a special exception, if COND_EXPR has NULL branches, we
3302 assume that it is a gimple statement and always consider
3303 it to have side effects. */
3304 if (code == COND_EXPR
3305 && tt == void_type_node
3306 && arg1 == NULL_TREE
3307 && arg2 == NULL_TREE)
3308 side_effects = true;
3310 side_effects = TREE_SIDE_EFFECTS (t);
3316 TREE_SIDE_EFFECTS (t) = side_effects;
3317 TREE_THIS_VOLATILE (t)
3318 = (TREE_CODE_CLASS (code) == tcc_reference
3319 && arg0 && TREE_THIS_VOLATILE (arg0));
3325 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3326 tree arg2, tree arg3 MEM_STAT_DECL)
3328 bool constant, read_only, side_effects;
3331 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3333 t = make_node_stat (code PASS_MEM_STAT);
3336 side_effects = TREE_SIDE_EFFECTS (t);
3343 TREE_SIDE_EFFECTS (t) = side_effects;
3344 TREE_THIS_VOLATILE (t)
3345 = (TREE_CODE_CLASS (code) == tcc_reference
3346 && arg0 && TREE_THIS_VOLATILE (arg0));
3352 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3353 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3355 bool constant, read_only, side_effects;
3358 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3360 t = make_node_stat (code PASS_MEM_STAT);
3363 side_effects = TREE_SIDE_EFFECTS (t);
3371 TREE_SIDE_EFFECTS (t) = side_effects;
3372 TREE_THIS_VOLATILE (t)
3373 = (TREE_CODE_CLASS (code) == tcc_reference
3374 && arg0 && TREE_THIS_VOLATILE (arg0));
3380 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3381 tree arg2, tree arg3, tree arg4, tree arg5,
3382 tree arg6 MEM_STAT_DECL)
3384 bool constant, read_only, side_effects;
3387 gcc_assert (code == TARGET_MEM_REF);
3389 t = make_node_stat (code PASS_MEM_STAT);
3392 side_effects = TREE_SIDE_EFFECTS (t);
3402 TREE_SIDE_EFFECTS (t) = side_effects;
3403 TREE_THIS_VOLATILE (t) = 0;
3408 /* Similar except don't specify the TREE_TYPE
3409 and leave the TREE_SIDE_EFFECTS as 0.
3410 It is permissible for arguments to be null,
3411 or even garbage if their values do not matter. */
3414 build_nt (enum tree_code code, ...)
3421 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3425 t = make_node (code);
3426 length = TREE_CODE_LENGTH (code);
3428 for (i = 0; i < length; i++)
3429 TREE_OPERAND (t, i) = va_arg (p, tree);
3435 /* Similar to build_nt, but for creating a CALL_EXPR object with
3436 ARGLIST passed as a list. */
3439 build_nt_call_list (tree fn, tree arglist)
3444 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3445 CALL_EXPR_FN (t) = fn;
3446 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3447 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3448 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3452 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3453 We do NOT enter this node in any sort of symbol table.
3455 layout_decl is used to set up the decl's storage layout.
3456 Other slots are initialized to 0 or null pointers. */
3459 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3463 t = make_node_stat (code PASS_MEM_STAT);
3465 /* if (type == error_mark_node)
3466 type = integer_type_node; */
3467 /* That is not done, deliberately, so that having error_mark_node
3468 as the type can suppress useless errors in the use of this variable. */
3470 DECL_NAME (t) = name;
3471 TREE_TYPE (t) = type;
3473 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3479 /* Builds and returns function declaration with NAME and TYPE. */
3482 build_fn_decl (const char *name, tree type)
3484 tree id = get_identifier (name);
3485 tree decl = build_decl (FUNCTION_DECL, id, type);
3487 DECL_EXTERNAL (decl) = 1;
3488 TREE_PUBLIC (decl) = 1;
3489 DECL_ARTIFICIAL (decl) = 1;
3490 TREE_NOTHROW (decl) = 1;
3496 /* BLOCK nodes are used to represent the structure of binding contours
3497 and declarations, once those contours have been exited and their contents
3498 compiled. This information is used for outputting debugging info. */
3501 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3503 tree block = make_node (BLOCK);
3505 BLOCK_VARS (block) = vars;
3506 BLOCK_SUBBLOCKS (block) = subblocks;
3507 BLOCK_SUPERCONTEXT (block) = supercontext;
3508 BLOCK_CHAIN (block) = chain;
3513 expand_location (source_location loc)
3515 expanded_location xloc;
3525 const struct line_map *map = linemap_lookup (line_table, loc);
3526 xloc.file = map->to_file;
3527 xloc.line = SOURCE_LINE (map, loc);
3528 xloc.column = SOURCE_COLUMN (map, loc);
3529 xloc.sysp = map->sysp != 0;
3535 /* Source location accessor functions. */
3539 set_expr_locus (tree node, source_location *loc)
3542 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3544 EXPR_CHECK (node)->exp.locus = *loc;
3547 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3551 build_decl_attribute_variant (tree ddecl, tree attribute)
3553 DECL_ATTRIBUTES (ddecl) = attribute;
3557 /* Borrowed from hashtab.c iterative_hash implementation. */
3558 #define mix(a,b,c) \
3560 a -= b; a -= c; a ^= (c>>13); \
3561 b -= c; b -= a; b ^= (a<< 8); \
3562 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3563 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3564 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3565 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3566 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3567 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3568 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3572 /* Produce good hash value combining VAL and VAL2. */
3574 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3576 /* the golden ratio; an arbitrary value. */
3577 hashval_t a = 0x9e3779b9;
3583 /* Produce good hash value combining PTR and VAL2. */
3584 static inline hashval_t
3585 iterative_hash_pointer (const void *ptr, hashval_t val2)
3587 if (sizeof (ptr) == sizeof (hashval_t))
3588 return iterative_hash_hashval_t ((size_t) ptr, val2);
3591 hashval_t a = (hashval_t) (size_t) ptr;
3592 /* Avoid warnings about shifting of more than the width of the type on
3593 hosts that won't execute this path. */
3595 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3601 /* Produce good hash value combining VAL and VAL2. */
3602 static inline hashval_t
3603 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3605 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3606 return iterative_hash_hashval_t (val, val2);
3609 hashval_t a = (hashval_t) val;
3610 /* Avoid warnings about shifting of more than the width of the type on
3611 hosts that won't execute this path. */
3613 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3615 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3617 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3618 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3625 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3626 is ATTRIBUTE and its qualifiers are QUALS.
3628 Record such modified types already made so we don't make duplicates. */
3631 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3633 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3635 hashval_t hashcode = 0;
3637 enum tree_code code = TREE_CODE (ttype);
3639 /* Building a distinct copy of a tagged type is inappropriate; it
3640 causes breakage in code that expects there to be a one-to-one
3641 relationship between a struct and its fields.
3642 build_duplicate_type is another solution (as used in
3643 handle_transparent_union_attribute), but that doesn't play well
3644 with the stronger C++ type identity model. */
3645 if (TREE_CODE (ttype) == RECORD_TYPE
3646 || TREE_CODE (ttype) == UNION_TYPE
3647 || TREE_CODE (ttype) == QUAL_UNION_TYPE
3648 || TREE_CODE (ttype) == ENUMERAL_TYPE)
3650 warning (OPT_Wattributes,
3651 "ignoring attributes applied to %qT after definition",
3652 TYPE_MAIN_VARIANT (ttype));
3653 return build_qualified_type (ttype, quals);
3656 ntype = build_distinct_type_copy (ttype);
3658 TYPE_ATTRIBUTES (ntype) = attribute;
3659 set_type_quals (ntype, TYPE_UNQUALIFIED);
3661 hashcode = iterative_hash_object (code, hashcode);
3662 if (TREE_TYPE (ntype))
3663 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3665 hashcode = attribute_hash_list (attribute, hashcode);
3667 switch (TREE_CODE (ntype))
3670 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3673 if (TYPE_DOMAIN (ntype))
3674 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3678 hashcode = iterative_hash_object
3679 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3680 hashcode = iterative_hash_object
3681 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3684 case FIXED_POINT_TYPE:
3686 unsigned int precision = TYPE_PRECISION (ntype);
3687 hashcode = iterative_hash_object (precision, hashcode);
3694 ntype = type_hash_canon (hashcode, ntype);
3696 /* If the target-dependent attributes make NTYPE different from
3697 its canonical type, we will need to use structural equality
3698 checks for this qualified type. */
3699 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
3700 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
3701 || !targetm.comp_type_attributes (ntype, ttype))
3702 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3704 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
3706 ttype = build_qualified_type (ntype, quals);
3708 else if (TYPE_QUALS (ttype) != quals)
3709 ttype = build_qualified_type (ttype, quals);
3715 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3718 Record such modified types already made so we don't make duplicates. */
3721 build_type_attribute_variant (tree ttype, tree attribute)
3723 return build_type_attribute_qual_variant (ttype, attribute,
3724 TYPE_QUALS (ttype));
3727 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3730 We try both `text' and `__text__', ATTR may be either one. */
3731 /* ??? It might be a reasonable simplification to require ATTR to be only
3732 `text'. One might then also require attribute lists to be stored in
3733 their canonicalized form. */
3736 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
3741 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3744 p = IDENTIFIER_POINTER (ident);
3745 ident_len = IDENTIFIER_LENGTH (ident);
3747 if (ident_len == attr_len
3748 && strcmp (attr, p) == 0)
3751 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3754 gcc_assert (attr[1] == '_');
3755 gcc_assert (attr[attr_len - 2] == '_');
3756 gcc_assert (attr[attr_len - 1] == '_');
3757 if (ident_len == attr_len - 4
3758 && strncmp (attr + 2, p, attr_len - 4) == 0)
3763 if (ident_len == attr_len + 4
3764 && p[0] == '_' && p[1] == '_'
3765 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3766 && strncmp (attr, p + 2, attr_len) == 0)
3773 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3776 We try both `text' and `__text__', ATTR may be either one. */
3779 is_attribute_p (const char *attr, const_tree ident)
3781 return is_attribute_with_length_p (attr, strlen (attr), ident);
3784 /* Given an attribute name and a list of attributes, return a pointer to the
3785 attribute's list element if the attribute is part of the list, or NULL_TREE
3786 if not found. If the attribute appears more than once, this only
3787 returns the first occurrence; the TREE_CHAIN of the return value should
3788 be passed back in if further occurrences are wanted. */
3791 lookup_attribute (const char *attr_name, tree list)
3794 size_t attr_len = strlen (attr_name);
3796 for (l = list; l; l = TREE_CHAIN (l))
3798 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3799 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3805 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3809 remove_attribute (const char *attr_name, tree list)
3812 size_t attr_len = strlen (attr_name);
3814 for (p = &list; *p; )
3817 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3818 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3819 *p = TREE_CHAIN (l);
3821 p = &TREE_CHAIN (l);
3827 /* Return an attribute list that is the union of a1 and a2. */
3830 merge_attributes (tree a1, tree a2)
3834 /* Either one unset? Take the set one. */
3836 if ((attributes = a1) == 0)
3839 /* One that completely contains the other? Take it. */
3841 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3843 if (attribute_list_contained (a2, a1))
3847 /* Pick the longest list, and hang on the other list. */
3849 if (list_length (a1) < list_length (a2))
3850 attributes = a2, a2 = a1;
3852 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3855 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3858 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3861 if (TREE_VALUE (a) != NULL
3862 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3863 && TREE_VALUE (a2) != NULL
3864 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3866 if (simple_cst_list_equal (TREE_VALUE (a),
3867 TREE_VALUE (a2)) == 1)
3870 else if (simple_cst_equal (TREE_VALUE (a),
3871 TREE_VALUE (a2)) == 1)
3876 a1 = copy_node (a2);
3877 TREE_CHAIN (a1) = attributes;
3886 /* Given types T1 and T2, merge their attributes and return
3890 merge_type_attributes (tree t1, tree t2)
3892 return merge_attributes (TYPE_ATTRIBUTES (t1),
3893 TYPE_ATTRIBUTES (t2));
3896 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3900 merge_decl_attributes (tree olddecl, tree newdecl)
3902 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3903 DECL_ATTRIBUTES (newdecl));
3906 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3908 /* Specialization of merge_decl_attributes for various Windows targets.
3910 This handles the following situation:
3912 __declspec (dllimport) int foo;
3915 The second instance of `foo' nullifies the dllimport. */
3918 merge_dllimport_decl_attributes (tree old, tree new)
3921 int delete_dllimport_p = 1;
3923 /* What we need to do here is remove from `old' dllimport if it doesn't
3924 appear in `new'. dllimport behaves like extern: if a declaration is
3925 marked dllimport and a definition appears later, then the object
3926 is not dllimport'd. We also remove a `new' dllimport if the old list
3927 contains dllexport: dllexport always overrides dllimport, regardless
3928 of the order of declaration. */
3929 if (!VAR_OR_FUNCTION_DECL_P (new))
3930 delete_dllimport_p = 0;
3931 else if (DECL_DLLIMPORT_P (new)
3932 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3934 DECL_DLLIMPORT_P (new) = 0;
3935 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3936 "dllimport ignored", new);
3938 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3940 /* Warn about overriding a symbol that has already been used, e.g.:
3941 extern int __attribute__ ((dllimport)) foo;
3942 int* bar () {return &foo;}
3945 if (TREE_USED (old))
3947 warning (0, "%q+D redeclared without dllimport attribute "
3948 "after being referenced with dll linkage", new);
3949 /* If we have used a variable's address with dllimport linkage,
3950 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3951 decl may already have had TREE_CONSTANT computed.
3952 We still remove the attribute so that assembler code refers
3953 to '&foo rather than '_imp__foo'. */
3954 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
3955 DECL_DLLIMPORT_P (new) = 1;
3958 /* Let an inline definition silently override the external reference,
3959 but otherwise warn about attribute inconsistency. */
3960 else if (TREE_CODE (new) == VAR_DECL
3961 || !DECL_DECLARED_INLINE_P (new))
3962 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
3963 "previous dllimport ignored", new);
3966 delete_dllimport_p = 0;
3968 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
3970 if (delete_dllimport_p)
3973 const size_t attr_len = strlen ("dllimport");
3975 /* Scan the list for dllimport and delete it. */
3976 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3978 if (is_attribute_with_length_p ("dllimport", attr_len,
3981 if (prev == NULL_TREE)
3984 TREE_CHAIN (prev) = TREE_CHAIN (t);
3993 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3994 struct attribute_spec.handler. */
3997 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4002 /* These attributes may apply to structure and union types being created,
4003 but otherwise should pass to the declaration involved. */
4006 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4007 | (int) ATTR_FLAG_ARRAY_NEXT))
4009 *no_add_attrs = true;
4010 return tree_cons (name, args, NULL_TREE);
4012 if (TREE_CODE (node) == RECORD_TYPE
4013 || TREE_CODE (node) == UNION_TYPE)
4015 node = TYPE_NAME (node);
4021 warning (OPT_Wattributes, "%qs attribute ignored",
4022 IDENTIFIER_POINTER (name));
4023 *no_add_attrs = true;
4028 if (TREE_CODE (node) != FUNCTION_DECL
4029 && TREE_CODE (node) != VAR_DECL
4030 && TREE_CODE (node) != TYPE_DECL)
4032 *no_add_attrs = true;
4033 warning (OPT_Wattributes, "%qs attribute ignored",
4034 IDENTIFIER_POINTER (name));
4038 if (TREE_CODE (node) == TYPE_DECL
4039 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
4040 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
4042 *no_add_attrs = true;
4043 warning (OPT_Wattributes, "%qs attribute ignored",
4044 IDENTIFIER_POINTER (name));
4048 /* Report error on dllimport ambiguities seen now before they cause
4050 else if (is_attribute_p ("dllimport", name))
4052 /* Honor any target-specific overrides. */
4053 if (!targetm.valid_dllimport_attribute_p (node))
4054 *no_add_attrs = true;
4056 else if (TREE_CODE (node) == FUNCTION_DECL
4057 && DECL_DECLARED_INLINE_P (node))
4059 warning (OPT_Wattributes, "inline function %q+D declared as "
4060 " dllimport: attribute ignored", node);
4061 *no_add_attrs = true;
4063 /* Like MS, treat definition of dllimported variables and
4064 non-inlined functions on declaration as syntax errors. */
4065 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4067 error ("function %q+D definition is marked dllimport", node);
4068 *no_add_attrs = true;
4071 else if (TREE_CODE (node) == VAR_DECL)
4073 if (DECL_INITIAL (node))
4075 error ("variable %q+D definition is marked dllimport",
4077 *no_add_attrs = true;
4080 /* `extern' needn't be specified with dllimport.
4081 Specify `extern' now and hope for the best. Sigh. */
4082 DECL_EXTERNAL (node) = 1;
4083 /* Also, implicitly give dllimport'd variables declared within
4084 a function global scope, unless declared static. */
4085 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4086 TREE_PUBLIC (node) = 1;
4089 if (*no_add_attrs == false)
4090 DECL_DLLIMPORT_P (node) = 1;
4093 /* Report error if symbol is not accessible at global scope. */
4094 if (!TREE_PUBLIC (node)
4095 && (TREE_CODE (node) == VAR_DECL
4096 || TREE_CODE (node) == FUNCTION_DECL))
4098 error ("external linkage required for symbol %q+D because of "
4099 "%qs attribute", node, IDENTIFIER_POINTER (name));
4100 *no_add_attrs = true;
4103 /* A dllexport'd entity must have default visibility so that other
4104 program units (shared libraries or the main executable) can see
4105 it. A dllimport'd entity must have default visibility so that
4106 the linker knows that undefined references within this program
4107 unit can be resolved by the dynamic linker. */
4110 if (DECL_VISIBILITY_SPECIFIED (node)
4111 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4112 error ("%qs implies default visibility, but %qD has already "
4113 "been declared with a different visibility",
4114 IDENTIFIER_POINTER (name), node);
4115 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4116 DECL_VISIBILITY_SPECIFIED (node) = 1;
4122 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4124 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4125 of the various TYPE_QUAL values. */
4128 set_type_quals (tree type, int type_quals)
4130 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4131 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4132 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4135 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4138 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4140 return (TYPE_QUALS (cand) == type_quals
4141 && TYPE_NAME (cand) == TYPE_NAME (base)
4142 /* Apparently this is needed for Objective-C. */
4143 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4144 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4145 TYPE_ATTRIBUTES (base)));
4148 /* Return a version of the TYPE, qualified as indicated by the
4149 TYPE_QUALS, if one exists. If no qualified version exists yet,
4150 return NULL_TREE. */
4153 get_qualified_type (tree type, int type_quals)
4157 if (TYPE_QUALS (type) == type_quals)
4160 /* Search the chain of variants to see if there is already one there just
4161 like the one we need to have. If so, use that existing one. We must
4162 preserve the TYPE_NAME, since there is code that depends on this. */
4163 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4164 if (check_qualified_type (t, type, type_quals))
4170 /* Like get_qualified_type, but creates the type if it does not
4171 exist. This function never returns NULL_TREE. */
4174 build_qualified_type (tree type, int type_quals)
4178 /* See if we already have the appropriate qualified variant. */
4179 t = get_qualified_type (type, type_quals);
4181 /* If not, build it. */
4184 t = build_variant_type_copy (type);
4185 set_type_quals (t, type_quals);
4187 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4188 /* Propagate structural equality. */
4189 SET_TYPE_STRUCTURAL_EQUALITY (t);
4190 else if (TYPE_CANONICAL (type) != type)
4191 /* Build the underlying canonical type, since it is different
4193 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4196 /* T is its own canonical type. */
4197 TYPE_CANONICAL (t) = t;
4204 /* Create a new distinct copy of TYPE. The new type is made its own
4205 MAIN_VARIANT. If TYPE requires structural equality checks, the
4206 resulting type requires structural equality checks; otherwise, its
4207 TYPE_CANONICAL points to itself. */
4210 build_distinct_type_copy (tree type)
4212 tree t = copy_node (type);
4214 TYPE_POINTER_TO (t) = 0;
4215 TYPE_REFERENCE_TO (t) = 0;
4217 /* Set the canonical type either to a new equivalence class, or
4218 propagate the need for structural equality checks. */
4219 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4220 SET_TYPE_STRUCTURAL_EQUALITY (t);
4222 TYPE_CANONICAL (t) = t;
4224 /* Make it its own variant. */
4225 TYPE_MAIN_VARIANT (t) = t;
4226 TYPE_NEXT_VARIANT (t) = 0;
4228 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4229 whose TREE_TYPE is not t. This can also happen in the Ada
4230 frontend when using subtypes. */
4235 /* Create a new variant of TYPE, equivalent but distinct. This is so
4236 the caller can modify it. TYPE_CANONICAL for the return type will
4237 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4238 are considered equal by the language itself (or that both types
4239 require structural equality checks). */
4242 build_variant_type_copy (tree type)
4244 tree t, m = TYPE_MAIN_VARIANT (type);
4246 t = build_distinct_type_copy (type);
4248 /* Since we're building a variant, assume that it is a non-semantic
4249 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4250 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4252 /* Add the new type to the chain of variants of TYPE. */
4253 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4254 TYPE_NEXT_VARIANT (m) = t;
4255 TYPE_MAIN_VARIANT (t) = m;
4260 /* Return true if the from tree in both tree maps are equal. */
4263 tree_map_base_eq (const void *va, const void *vb)
4265 const struct tree_map_base *const a = (const struct tree_map_base *) va,
4266 *const b = (const struct tree_map_base *) vb;
4267 return (a->from == b->from);
4270 /* Hash a from tree in a tree_map. */
4273 tree_map_base_hash (const void *item)
4275 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4278 /* Return true if this tree map structure is marked for garbage collection
4279 purposes. We simply return true if the from tree is marked, so that this
4280 structure goes away when the from tree goes away. */
4283 tree_map_base_marked_p (const void *p)
4285 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4289 tree_map_hash (const void *item)
4291 return (((const struct tree_map *) item)->hash);
4294 /* Return the initialization priority for DECL. */
4297 decl_init_priority_lookup (tree decl)
4299 struct tree_priority_map *h;
4300 struct tree_map_base in;
4302 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4304 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4305 return h ? h->init : DEFAULT_INIT_PRIORITY;
4308 /* Return the finalization priority for DECL. */
4311 decl_fini_priority_lookup (tree decl)
4313 struct tree_priority_map *h;
4314 struct tree_map_base in;
4316 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4318 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4319 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4322 /* Return the initialization and finalization priority information for
4323 DECL. If there is no previous priority information, a freshly
4324 allocated structure is returned. */
4326 static struct tree_priority_map *
4327 decl_priority_info (tree decl)
4329 struct tree_priority_map in;
4330 struct tree_priority_map *h;
4333 in.base.from = decl;
4334 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4335 h = (struct tree_priority_map *) *loc;
4338 h = GGC_CNEW (struct tree_priority_map);
4340 h->base.from = decl;
4341 h->init = DEFAULT_INIT_PRIORITY;
4342 h->fini = DEFAULT_INIT_PRIORITY;
4348 /* Set the initialization priority for DECL to PRIORITY. */
4351 decl_init_priority_insert (tree decl, priority_type priority)
4353 struct tree_priority_map *h;
4355 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4356 h = decl_priority_info (decl);
4360 /* Set the finalization priority for DECL to PRIORITY. */
4363 decl_fini_priority_insert (tree decl, priority_type priority)
4365 struct tree_priority_map *h;
4367 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4368 h = decl_priority_info (decl);
4372 /* Look up a restrict qualified base decl for FROM. */
4375 decl_restrict_base_lookup (tree from)
4380 in.base.from = from;
4381 h = (struct tree_map *) htab_find_with_hash (restrict_base_for_decl, &in,
4382 htab_hash_pointer (from));
4383 return h ? h->to : NULL_TREE;
4386 /* Record the restrict qualified base TO for FROM. */
4389 decl_restrict_base_insert (tree from, tree to)
4394 h = GGC_NEW (struct tree_map);
4395 h->hash = htab_hash_pointer (from);
4396 h->base.from = from;
4398 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4399 *(struct tree_map **) loc = h;
4402 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4405 print_debug_expr_statistics (void)
4407 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4408 (long) htab_size (debug_expr_for_decl),
4409 (long) htab_elements (debug_expr_for_decl),
4410 htab_collisions (debug_expr_for_decl));
4413 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4416 print_value_expr_statistics (void)
4418 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4419 (long) htab_size (value_expr_for_decl),
4420 (long) htab_elements (value_expr_for_decl),
4421 htab_collisions (value_expr_for_decl));
4424 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4425 don't print anything if the table is empty. */
4428 print_restrict_base_statistics (void)
4430 if (htab_elements (restrict_base_for_decl) != 0)
4432 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4433 (long) htab_size (restrict_base_for_decl),
4434 (long) htab_elements (restrict_base_for_decl),
4435 htab_collisions (restrict_base_for_decl));
4438 /* Lookup a debug expression for FROM, and return it if we find one. */
4441 decl_debug_expr_lookup (tree from)
4443 struct tree_map *h, in;
4444 in.base.from = from;
4446 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
4447 htab_hash_pointer (from));
4453 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4456 decl_debug_expr_insert (tree from, tree to)
4461 h = GGC_NEW (struct tree_map);
4462 h->hash = htab_hash_pointer (from);
4463 h->base.from = from;
4465 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4466 *(struct tree_map **) loc = h;
4469 /* Lookup a value expression for FROM, and return it if we find one. */
4472 decl_value_expr_lookup (tree from)
4474 struct tree_map *h, in;
4475 in.base.from = from;
4477 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
4478 htab_hash_pointer (from));
4484 /* Insert a mapping FROM->TO in the value expression hashtable. */
4487 decl_value_expr_insert (tree from, tree to)
4492 h = GGC_NEW (struct tree_map);
4493 h->hash = htab_hash_pointer (from);
4494 h->base.from = from;
4496 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4497 *(struct tree_map **) loc = h;
4500 /* Hashing of types so that we don't make duplicates.
4501 The entry point is `type_hash_canon'. */
4503 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4504 with types in the TREE_VALUE slots), by adding the hash codes
4505 of the individual types. */
4508 type_hash_list (const_tree list, hashval_t hashcode)
4512 for (tail = list; tail; tail = TREE_CHAIN (tail))
4513 if (TREE_VALUE (tail) != error_mark_node)
4514 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4520 /* These are the Hashtable callback functions. */
4522 /* Returns true iff the types are equivalent. */
4525 type_hash_eq (const void *va, const void *vb)
4527 const struct type_hash *const a = (const struct type_hash *) va,
4528 *const b = (const struct type_hash *) vb;
4530 /* First test the things that are the same for all types. */
4531 if (a->hash != b->hash
4532 || TREE_CODE (a->type) != TREE_CODE (b->type)
4533 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4534 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4535 TYPE_ATTRIBUTES (b->type))
4536 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4537 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4540 switch (TREE_CODE (a->type))
4545 case REFERENCE_TYPE:
4549 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4552 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4553 && !(TYPE_VALUES (a->type)
4554 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4555 && TYPE_VALUES (b->type)
4556 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4557 && type_list_equal (TYPE_VALUES (a->type),
4558 TYPE_VALUES (b->type))))
4561 /* ... fall through ... */
4566 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4567 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4568 TYPE_MAX_VALUE (b->type)))
4569 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4570 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4571 TYPE_MIN_VALUE (b->type))));
4573 case FIXED_POINT_TYPE:
4574 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4577 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4580 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4581 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4582 || (TYPE_ARG_TYPES (a->type)
4583 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4584 && TYPE_ARG_TYPES (b->type)
4585 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4586 && type_list_equal (TYPE_ARG_TYPES (a->type),
4587 TYPE_ARG_TYPES (b->type)))));
4590 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4594 case QUAL_UNION_TYPE:
4595 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4596 || (TYPE_FIELDS (a->type)
4597 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4598 && TYPE_FIELDS (b->type)
4599 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4600 && type_list_equal (TYPE_FIELDS (a->type),
4601 TYPE_FIELDS (b->type))));
4604 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4605 || (TYPE_ARG_TYPES (a->type)
4606 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4607 && TYPE_ARG_TYPES (b->type)
4608 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4609 && type_list_equal (TYPE_ARG_TYPES (a->type),
4610 TYPE_ARG_TYPES (b->type))))
4618 if (lang_hooks.types.type_hash_eq != NULL)
4619 return lang_hooks.types.type_hash_eq (a->type, b->type);
4624 /* Return the cached hash value. */
4627 type_hash_hash (const void *item)
4629 return ((const struct type_hash *) item)->hash;
4632 /* Look in the type hash table for a type isomorphic to TYPE.
4633 If one is found, return it. Otherwise return 0. */
4636 type_hash_lookup (hashval_t hashcode, tree type)
4638 struct type_hash *h, in;
4640 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4641 must call that routine before comparing TYPE_ALIGNs. */
4647 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
4654 /* Add an entry to the type-hash-table
4655 for a type TYPE whose hash code is HASHCODE. */
4658 type_hash_add (hashval_t hashcode, tree type)
4660 struct type_hash *h;
4663 h = GGC_NEW (struct type_hash);
4666 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4670 /* Given TYPE, and HASHCODE its hash code, return the canonical
4671 object for an identical type if one already exists.
4672 Otherwise, return TYPE, and record it as the canonical object.
4674 To use this function, first create a type of the sort you want.
4675 Then compute its hash code from the fields of the type that
4676 make it different from other similar types.
4677 Then call this function and use the value. */
4680 type_hash_canon (unsigned int hashcode, tree type)
4684 /* The hash table only contains main variants, so ensure that's what we're
4686 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4688 if (!lang_hooks.types.hash_types)
4691 /* See if the type is in the hash table already. If so, return it.
4692 Otherwise, add the type. */
4693 t1 = type_hash_lookup (hashcode, type);
4696 #ifdef GATHER_STATISTICS
4697 tree_node_counts[(int) t_kind]--;
4698 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4704 type_hash_add (hashcode, type);
4709 /* See if the data pointed to by the type hash table is marked. We consider
4710 it marked if the type is marked or if a debug type number or symbol
4711 table entry has been made for the type. This reduces the amount of
4712 debugging output and eliminates that dependency of the debug output on
4713 the number of garbage collections. */
4716 type_hash_marked_p (const void *p)
4718 const_tree const type = ((const struct type_hash *) p)->type;
4720 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4724 print_type_hash_statistics (void)
4726 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4727 (long) htab_size (type_hash_table),
4728 (long) htab_elements (type_hash_table),
4729 htab_collisions (type_hash_table));
4732 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4733 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4734 by adding the hash codes of the individual attributes. */
4737 attribute_hash_list (const_tree list, hashval_t hashcode)
4741 for (tail = list; tail; tail = TREE_CHAIN (tail))
4742 /* ??? Do we want to add in TREE_VALUE too? */
4743 hashcode = iterative_hash_object
4744 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4748 /* Given two lists of attributes, return true if list l2 is
4749 equivalent to l1. */
4752 attribute_list_equal (const_tree l1, const_tree l2)
4754 return attribute_list_contained (l1, l2)
4755 && attribute_list_contained (l2, l1);
4758 /* Given two lists of attributes, return true if list L2 is
4759 completely contained within L1. */
4760 /* ??? This would be faster if attribute names were stored in a canonicalized
4761 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4762 must be used to show these elements are equivalent (which they are). */
4763 /* ??? It's not clear that attributes with arguments will always be handled
4767 attribute_list_contained (const_tree l1, const_tree l2)
4771 /* First check the obvious, maybe the lists are identical. */
4775 /* Maybe the lists are similar. */
4776 for (t1 = l1, t2 = l2;
4778 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4779 && TREE_VALUE (t1) == TREE_VALUE (t2);
4780 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4782 /* Maybe the lists are equal. */
4783 if (t1 == 0 && t2 == 0)
4786 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4789 /* This CONST_CAST is okay because lookup_attribute does not
4790 modify its argument and the return value is assigned to a
4792 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4793 CONST_CAST_TREE(l1));
4795 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4798 if (TREE_VALUE (t2) != NULL
4799 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4800 && TREE_VALUE (attr) != NULL
4801 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4803 if (simple_cst_list_equal (TREE_VALUE (t2),
4804 TREE_VALUE (attr)) == 1)
4807 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4818 /* Given two lists of types
4819 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4820 return 1 if the lists contain the same types in the same order.
4821 Also, the TREE_PURPOSEs must match. */
4824 type_list_equal (const_tree l1, const_tree l2)
4828 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4829 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4830 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4831 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4832 && (TREE_TYPE (TREE_PURPOSE (t1))
4833 == TREE_TYPE (TREE_PURPOSE (t2))))))
4839 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4840 given by TYPE. If the argument list accepts variable arguments,
4841 then this function counts only the ordinary arguments. */
4844 type_num_arguments (const_tree type)
4849 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4850 /* If the function does not take a variable number of arguments,
4851 the last element in the list will have type `void'. */
4852 if (VOID_TYPE_P (TREE_VALUE (t)))
4860 /* Nonzero if integer constants T1 and T2
4861 represent the same constant value. */
4864 tree_int_cst_equal (const_tree t1, const_tree t2)
4869 if (t1 == 0 || t2 == 0)
4872 if (TREE_CODE (t1) == INTEGER_CST
4873 && TREE_CODE (t2) == INTEGER_CST
4874 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4875 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4881 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4882 The precise way of comparison depends on their data type. */
4885 tree_int_cst_lt (const_tree t1, const_tree t2)
4890 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4892 int t1_sgn = tree_int_cst_sgn (t1);
4893 int t2_sgn = tree_int_cst_sgn (t2);
4895 if (t1_sgn < t2_sgn)
4897 else if (t1_sgn > t2_sgn)
4899 /* Otherwise, both are non-negative, so we compare them as
4900 unsigned just in case one of them would overflow a signed
4903 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4904 return INT_CST_LT (t1, t2);
4906 return INT_CST_LT_UNSIGNED (t1, t2);
4909 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4912 tree_int_cst_compare (const_tree t1, const_tree t2)
4914 if (tree_int_cst_lt (t1, t2))
4916 else if (tree_int_cst_lt (t2, t1))
4922 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4923 the host. If POS is zero, the value can be represented in a single
4924 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4925 be represented in a single unsigned HOST_WIDE_INT. */
4928 host_integerp (const_tree t, int pos)
4930 return (TREE_CODE (t) == INTEGER_CST
4931 && ((TREE_INT_CST_HIGH (t) == 0
4932 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4933 || (! pos && TREE_INT_CST_HIGH (t) == -1
4934 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4935 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4936 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
4937 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
4938 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4941 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4942 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4943 be non-negative. We must be able to satisfy the above conditions. */
4946 tree_low_cst (const_tree t, int pos)
4948 gcc_assert (host_integerp (t, pos));
4949 return TREE_INT_CST_LOW (t);
4952 /* Return the most significant bit of the integer constant T. */
4955 tree_int_cst_msb (const_tree t)
4959 unsigned HOST_WIDE_INT l;
4961 /* Note that using TYPE_PRECISION here is wrong. We care about the
4962 actual bits, not the (arbitrary) range of the type. */
4963 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
4964 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
4965 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
4966 return (l & 1) == 1;
4969 /* Return an indication of the sign of the integer constant T.
4970 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4971 Note that -1 will never be returned if T's type is unsigned. */
4974 tree_int_cst_sgn (const_tree t)
4976 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
4978 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
4980 else if (TREE_INT_CST_HIGH (t) < 0)
4986 /* Compare two constructor-element-type constants. Return 1 if the lists
4987 are known to be equal; otherwise return 0. */
4990 simple_cst_list_equal (const_tree l1, const_tree l2)
4992 while (l1 != NULL_TREE && l2 != NULL_TREE)
4994 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
4997 l1 = TREE_CHAIN (l1);
4998 l2 = TREE_CHAIN (l2);
5004 /* Return truthvalue of whether T1 is the same tree structure as T2.
5005 Return 1 if they are the same.
5006 Return 0 if they are understandably different.
5007 Return -1 if either contains tree structure not understood by
5011 simple_cst_equal (const_tree t1, const_tree t2)
5013 enum tree_code code1, code2;
5019 if (t1 == 0 || t2 == 0)
5022 code1 = TREE_CODE (t1);
5023 code2 = TREE_CODE (t2);
5025 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
5027 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5028 || code2 == NON_LVALUE_EXPR)
5029 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5031 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5034 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5035 || code2 == NON_LVALUE_EXPR)
5036 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5044 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5045 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5048 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5051 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5054 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5055 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5056 TREE_STRING_LENGTH (t1)));
5060 unsigned HOST_WIDE_INT idx;
5061 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5062 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5064 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5067 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5068 /* ??? Should we handle also fields here? */
5069 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5070 VEC_index (constructor_elt, v2, idx)->value))
5076 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5079 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5082 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5085 const_tree arg1, arg2;
5086 const_call_expr_arg_iterator iter1, iter2;
5087 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5088 arg2 = first_const_call_expr_arg (t2, &iter2);
5090 arg1 = next_const_call_expr_arg (&iter1),
5091 arg2 = next_const_call_expr_arg (&iter2))
5093 cmp = simple_cst_equal (arg1, arg2);
5097 return arg1 == arg2;
5101 /* Special case: if either target is an unallocated VAR_DECL,
5102 it means that it's going to be unified with whatever the
5103 TARGET_EXPR is really supposed to initialize, so treat it
5104 as being equivalent to anything. */
5105 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5106 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5107 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5108 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5109 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5110 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5113 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5118 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5120 case WITH_CLEANUP_EXPR:
5121 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5125 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5128 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5129 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5143 /* This general rule works for most tree codes. All exceptions should be
5144 handled above. If this is a language-specific tree code, we can't
5145 trust what might be in the operand, so say we don't know
5147 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5150 switch (TREE_CODE_CLASS (code1))
5154 case tcc_comparison:
5155 case tcc_expression:
5159 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5161 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5173 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5174 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5175 than U, respectively. */
5178 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5180 if (tree_int_cst_sgn (t) < 0)
5182 else if (TREE_INT_CST_HIGH (t) != 0)
5184 else if (TREE_INT_CST_LOW (t) == u)
5186 else if (TREE_INT_CST_LOW (t) < u)
5192 /* Return true if CODE represents an associative tree code. Otherwise
5195 associative_tree_code (enum tree_code code)
5214 /* Return true if CODE represents a commutative tree code. Otherwise
5217 commutative_tree_code (enum tree_code code)
5230 case UNORDERED_EXPR:
5234 case TRUTH_AND_EXPR:
5235 case TRUTH_XOR_EXPR:
5245 /* Generate a hash value for an expression. This can be used iteratively
5246 by passing a previous result as the VAL argument.
5248 This function is intended to produce the same hash for expressions which
5249 would compare equal using operand_equal_p. */
5252 iterative_hash_expr (const_tree t, hashval_t val)
5255 enum tree_code code;
5259 return iterative_hash_pointer (t, val);
5261 code = TREE_CODE (t);
5265 /* Alas, constants aren't shared, so we can't rely on pointer
5268 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5269 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5272 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5274 return iterative_hash_hashval_t (val2, val);
5278 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5280 return iterative_hash_hashval_t (val2, val);
5283 return iterative_hash (TREE_STRING_POINTER (t),
5284 TREE_STRING_LENGTH (t), val);
5286 val = iterative_hash_expr (TREE_REALPART (t), val);
5287 return iterative_hash_expr (TREE_IMAGPART (t), val);
5289 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5292 /* we can just compare by pointer. */
5293 return iterative_hash_pointer (t, val);
5296 /* A list of expressions, for a CALL_EXPR or as the elements of a
5298 for (; t; t = TREE_CHAIN (t))
5299 val = iterative_hash_expr (TREE_VALUE (t), val);
5303 unsigned HOST_WIDE_INT idx;
5305 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5307 val = iterative_hash_expr (field, val);
5308 val = iterative_hash_expr (value, val);
5313 /* When referring to a built-in FUNCTION_DECL, use the
5314 __builtin__ form. Otherwise nodes that compare equal
5315 according to operand_equal_p might get different
5317 if (DECL_BUILT_IN (t))
5319 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5323 /* else FALL THROUGH */
5325 tclass = TREE_CODE_CLASS (code);
5327 if (tclass == tcc_declaration)
5329 /* DECL's have a unique ID */
5330 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5334 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
5336 val = iterative_hash_object (code, val);
5338 /* Don't hash the type, that can lead to having nodes which
5339 compare equal according to operand_equal_p, but which
5340 have different hash codes. */
5341 if (code == NOP_EXPR
5342 || code == CONVERT_EXPR
5343 || code == NON_LVALUE_EXPR)
5345 /* Make sure to include signness in the hash computation. */
5346 val += TYPE_UNSIGNED (TREE_TYPE (t));
5347 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5350 else if (commutative_tree_code (code))
5352 /* It's a commutative expression. We want to hash it the same
5353 however it appears. We do this by first hashing both operands
5354 and then rehashing based on the order of their independent
5356 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5357 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5361 t = one, one = two, two = t;
5363 val = iterative_hash_hashval_t (one, val);
5364 val = iterative_hash_hashval_t (two, val);
5367 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5368 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5375 /* Generate a hash value for a pair of expressions. This can be used
5376 iteratively by passing a previous result as the VAL argument.
5378 The same hash value is always returned for a given pair of expressions,
5379 regardless of the order in which they are presented. This is useful in
5380 hashing the operands of commutative functions. */
5383 iterative_hash_exprs_commutative (const_tree t1,
5384 const_tree t2, hashval_t val)
5386 hashval_t one = iterative_hash_expr (t1, 0);
5387 hashval_t two = iterative_hash_expr (t2, 0);
5391 t = one, one = two, two = t;
5392 val = iterative_hash_hashval_t (one, val);
5393 val = iterative_hash_hashval_t (two, val);
5398 /* Constructors for pointer, array and function types.
5399 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5400 constructed by language-dependent code, not here.) */
5402 /* Construct, lay out and return the type of pointers to TO_TYPE with
5403 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5404 reference all of memory. If such a type has already been
5405 constructed, reuse it. */
5408 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5413 if (to_type == error_mark_node)
5414 return error_mark_node;
5416 /* If the pointed-to type has the may_alias attribute set, force
5417 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5418 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5419 can_alias_all = true;
5421 /* In some cases, languages will have things that aren't a POINTER_TYPE
5422 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5423 In that case, return that type without regard to the rest of our
5426 ??? This is a kludge, but consistent with the way this function has
5427 always operated and there doesn't seem to be a good way to avoid this
5429 if (TYPE_POINTER_TO (to_type) != 0
5430 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5431 return TYPE_POINTER_TO (to_type);
5433 /* First, if we already have a type for pointers to TO_TYPE and it's
5434 the proper mode, use it. */
5435 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5436 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5439 t = make_node (POINTER_TYPE);
5441 TREE_TYPE (t) = to_type;
5442 TYPE_MODE (t) = mode;
5443 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5444 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5445 TYPE_POINTER_TO (to_type) = t;
5447 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5448 SET_TYPE_STRUCTURAL_EQUALITY (t);
5449 else if (TYPE_CANONICAL (to_type) != to_type)
5451 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5452 mode, can_alias_all);
5454 /* Lay out the type. This function has many callers that are concerned
5455 with expression-construction, and this simplifies them all. */
5461 /* By default build pointers in ptr_mode. */
5464 build_pointer_type (tree to_type)
5466 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5469 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5472 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5477 if (to_type == error_mark_node)
5478 return error_mark_node;
5480 /* If the pointed-to type has the may_alias attribute set, force
5481 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5482 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
5483 can_alias_all = true;
5485 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5486 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5487 In that case, return that type without regard to the rest of our
5490 ??? This is a kludge, but consistent with the way this function has
5491 always operated and there doesn't seem to be a good way to avoid this
5493 if (TYPE_REFERENCE_TO (to_type) != 0
5494 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5495 return TYPE_REFERENCE_TO (to_type);
5497 /* First, if we already have a type for pointers to TO_TYPE and it's
5498 the proper mode, use it. */
5499 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5500 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5503 t = make_node (REFERENCE_TYPE);
5505 TREE_TYPE (t) = to_type;
5506 TYPE_MODE (t) = mode;
5507 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5508 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5509 TYPE_REFERENCE_TO (to_type) = t;
5511 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5512 SET_TYPE_STRUCTURAL_EQUALITY (t);
5513 else if (TYPE_CANONICAL (to_type) != to_type)
5515 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5516 mode, can_alias_all);
5524 /* Build the node for the type of references-to-TO_TYPE by default
5528 build_reference_type (tree to_type)
5530 return build_reference_type_for_mode (to_type, ptr_mode, false);
5533 /* Build a type that is compatible with t but has no cv quals anywhere
5536 const char *const *const * -> char ***. */
5539 build_type_no_quals (tree t)
5541 switch (TREE_CODE (t))
5544 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5546 TYPE_REF_CAN_ALIAS_ALL (t));
5547 case REFERENCE_TYPE:
5549 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5551 TYPE_REF_CAN_ALIAS_ALL (t));
5553 return TYPE_MAIN_VARIANT (t);
5557 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5558 MAXVAL should be the maximum value in the domain
5559 (one less than the length of the array).
5561 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5562 We don't enforce this limit, that is up to caller (e.g. language front end).
5563 The limit exists because the result is a signed type and we don't handle
5564 sizes that use more than one HOST_WIDE_INT. */
5567 build_index_type (tree maxval)
5569 tree itype = make_node (INTEGER_TYPE);
5571 TREE_TYPE (itype) = sizetype;
5572 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5573 TYPE_MIN_VALUE (itype) = size_zero_node;
5574 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5575 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5576 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5577 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5578 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5579 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5581 if (host_integerp (maxval, 1))
5582 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5585 /* Since we cannot hash this type, we need to compare it using
5586 structural equality checks. */
5587 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5592 /* Builds a signed or unsigned integer type of precision PRECISION.
5593 Used for C bitfields whose precision does not match that of
5594 built-in target types. */
5596 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5599 tree itype = make_node (INTEGER_TYPE);
5601 TYPE_PRECISION (itype) = precision;
5604 fixup_unsigned_type (itype);
5606 fixup_signed_type (itype);
5608 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5609 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5614 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5615 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5616 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5619 build_range_type (tree type, tree lowval, tree highval)
5621 tree itype = make_node (INTEGER_TYPE);
5623 TREE_TYPE (itype) = type;
5624 if (type == NULL_TREE)
5627 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5628 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5630 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5631 TYPE_MODE (itype) = TYPE_MODE (type);
5632 TYPE_SIZE (itype) = TYPE_SIZE (type);
5633 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5634 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5635 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5637 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5638 return type_hash_canon (tree_low_cst (highval, 0)
5639 - tree_low_cst (lowval, 0),
5645 /* Just like build_index_type, but takes lowval and highval instead
5646 of just highval (maxval). */
5649 build_index_2_type (tree lowval, tree highval)
5651 return build_range_type (sizetype, lowval, highval);
5654 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5655 and number of elements specified by the range of values of INDEX_TYPE.
5656 If such a type has already been constructed, reuse it. */
5659 build_array_type (tree elt_type, tree index_type)
5662 hashval_t hashcode = 0;
5664 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5666 error ("arrays of functions are not meaningful");
5667 elt_type = integer_type_node;
5670 t = make_node (ARRAY_TYPE);
5671 TREE_TYPE (t) = elt_type;
5672 TYPE_DOMAIN (t) = index_type;
5674 if (index_type == 0)
5677 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5678 t = type_hash_canon (hashcode, t);
5682 if (TYPE_CANONICAL (t) == t)
5684 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5685 SET_TYPE_STRUCTURAL_EQUALITY (t);
5686 else if (TYPE_CANONICAL (elt_type) != elt_type)
5688 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5694 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5695 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5696 t = type_hash_canon (hashcode, t);
5698 if (!COMPLETE_TYPE_P (t))
5701 if (TYPE_CANONICAL (t) == t)
5703 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5704 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5705 SET_TYPE_STRUCTURAL_EQUALITY (t);
5706 else if (TYPE_CANONICAL (elt_type) != elt_type
5707 || TYPE_CANONICAL (index_type) != index_type)
5709 = build_array_type (TYPE_CANONICAL (elt_type),
5710 TYPE_CANONICAL (index_type));
5716 /* Recursively examines the array elements of TYPE, until a non-array
5717 element type is found. */
5720 strip_array_types (tree type)
5722 while (TREE_CODE (type) == ARRAY_TYPE)
5723 type = TREE_TYPE (type);
5728 /* Computes the canonical argument types from the argument type list
5731 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5732 on entry to this function, or if any of the ARGTYPES are
5735 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5736 true on entry to this function, or if any of the ARGTYPES are
5739 Returns a canonical argument list, which may be ARGTYPES when the
5740 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5741 true) or would not differ from ARGTYPES. */
5744 maybe_canonicalize_argtypes(tree argtypes,
5745 bool *any_structural_p,
5746 bool *any_noncanonical_p)
5749 bool any_noncanonical_argtypes_p = false;
5751 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
5753 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
5754 /* Fail gracefully by stating that the type is structural. */
5755 *any_structural_p = true;
5756 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
5757 *any_structural_p = true;
5758 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
5759 || TREE_PURPOSE (arg))
5760 /* If the argument has a default argument, we consider it
5761 non-canonical even though the type itself is canonical.
5762 That way, different variants of function and method types
5763 with default arguments will all point to the variant with
5764 no defaults as their canonical type. */
5765 any_noncanonical_argtypes_p = true;
5768 if (*any_structural_p)
5771 if (any_noncanonical_argtypes_p)
5773 /* Build the canonical list of argument types. */
5774 tree canon_argtypes = NULL_TREE;
5775 bool is_void = false;
5777 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
5779 if (arg == void_list_node)
5782 canon_argtypes = tree_cons (NULL_TREE,
5783 TYPE_CANONICAL (TREE_VALUE (arg)),
5787 canon_argtypes = nreverse (canon_argtypes);
5789 canon_argtypes = chainon (canon_argtypes, void_list_node);
5791 /* There is a non-canonical type. */
5792 *any_noncanonical_p = true;
5793 return canon_argtypes;
5796 /* The canonical argument types are the same as ARGTYPES. */
5800 /* Construct, lay out and return
5801 the type of functions returning type VALUE_TYPE
5802 given arguments of types ARG_TYPES.
5803 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5804 are data type nodes for the arguments of the function.
5805 If such a type has already been constructed, reuse it. */
5808 build_function_type (tree value_type, tree arg_types)
5811 hashval_t hashcode = 0;
5812 bool any_structural_p, any_noncanonical_p;
5813 tree canon_argtypes;
5815 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5817 error ("function return type cannot be function");
5818 value_type = integer_type_node;
5821 /* Make a node of the sort we want. */
5822 t = make_node (FUNCTION_TYPE);
5823 TREE_TYPE (t) = value_type;
5824 TYPE_ARG_TYPES (t) = arg_types;
5826 /* If we already have such a type, use the old one. */
5827 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5828 hashcode = type_hash_list (arg_types, hashcode);
5829 t = type_hash_canon (hashcode, t);
5831 /* Set up the canonical type. */
5832 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
5833 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
5834 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
5836 &any_noncanonical_p);
5837 if (any_structural_p)
5838 SET_TYPE_STRUCTURAL_EQUALITY (t);
5839 else if (any_noncanonical_p)
5840 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
5843 if (!COMPLETE_TYPE_P (t))
5848 /* Build a function type. The RETURN_TYPE is the type returned by the
5849 function. If VAARGS is set, no void_type_node is appended to the
5850 the list. ARGP muse be alway be terminated be a NULL_TREE. */
5853 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
5857 t = va_arg (argp, tree);
5858 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
5859 args = tree_cons (NULL_TREE, t, args);
5864 if (args != NULL_TREE)
5865 args = nreverse (args);
5866 gcc_assert (args != NULL_TREE && last != void_list_node);
5868 else if (args == NULL_TREE)
5869 args = void_list_node;
5873 args = nreverse (args);
5874 TREE_CHAIN (last) = void_list_node;
5876 args = build_function_type (return_type, args);
5881 /* Build a function type. The RETURN_TYPE is the type returned by the
5882 function. If additional arguments are provided, they are
5883 additional argument types. The list of argument types must always
5884 be terminated by NULL_TREE. */
5887 build_function_type_list (tree return_type, ...)
5892 va_start (p, return_type);
5893 args = build_function_type_list_1 (false, return_type, p);
5898 /* Build a variable argument function type. The RETURN_TYPE is the
5899 type returned by the function. If additional arguments are provided,
5900 they are additional argument types. The list of argument types must
5901 always be terminated by NULL_TREE. */
5904 build_varargs_function_type_list (tree return_type, ...)
5909 va_start (p, return_type);
5910 args = build_function_type_list_1 (true, return_type, p);
5916 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5917 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5918 for the method. An implicit additional parameter (of type
5919 pointer-to-BASETYPE) is added to the ARGTYPES. */
5922 build_method_type_directly (tree basetype,
5929 bool any_structural_p, any_noncanonical_p;
5930 tree canon_argtypes;
5932 /* Make a node of the sort we want. */
5933 t = make_node (METHOD_TYPE);
5935 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5936 TREE_TYPE (t) = rettype;
5937 ptype = build_pointer_type (basetype);
5939 /* The actual arglist for this function includes a "hidden" argument
5940 which is "this". Put it into the list of argument types. */
5941 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5942 TYPE_ARG_TYPES (t) = argtypes;
5944 /* If we already have such a type, use the old one. */
5945 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5946 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5947 hashcode = type_hash_list (argtypes, hashcode);
5948 t = type_hash_canon (hashcode, t);
5950 /* Set up the canonical type. */
5952 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5953 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
5955 = (TYPE_CANONICAL (basetype) != basetype
5956 || TYPE_CANONICAL (rettype) != rettype);
5957 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
5959 &any_noncanonical_p);
5960 if (any_structural_p)
5961 SET_TYPE_STRUCTURAL_EQUALITY (t);
5962 else if (any_noncanonical_p)
5964 = build_method_type_directly (TYPE_CANONICAL (basetype),
5965 TYPE_CANONICAL (rettype),
5967 if (!COMPLETE_TYPE_P (t))
5973 /* Construct, lay out and return the type of methods belonging to class
5974 BASETYPE and whose arguments and values are described by TYPE.
5975 If that type exists already, reuse it.
5976 TYPE must be a FUNCTION_TYPE node. */
5979 build_method_type (tree basetype, tree type)
5981 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5983 return build_method_type_directly (basetype,
5985 TYPE_ARG_TYPES (type));
5988 /* Construct, lay out and return the type of offsets to a value
5989 of type TYPE, within an object of type BASETYPE.
5990 If a suitable offset type exists already, reuse it. */
5993 build_offset_type (tree basetype, tree type)
5996 hashval_t hashcode = 0;
5998 /* Make a node of the sort we want. */
5999 t = make_node (OFFSET_TYPE);
6001 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6002 TREE_TYPE (t) = type;
6004 /* If we already have such a type, use the old one. */
6005 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6006 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
6007 t = type_hash_canon (hashcode, t);
6009 if (!COMPLETE_TYPE_P (t))
6012 if (TYPE_CANONICAL (t) == t)
6014 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6015 || TYPE_STRUCTURAL_EQUALITY_P (type))
6016 SET_TYPE_STRUCTURAL_EQUALITY (t);
6017 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
6018 || TYPE_CANONICAL (type) != type)
6020 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
6021 TYPE_CANONICAL (type));
6027 /* Create a complex type whose components are COMPONENT_TYPE. */
6030 build_complex_type (tree component_type)
6035 /* Make a node of the sort we want. */
6036 t = make_node (COMPLEX_TYPE);
6038 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
6040 /* If we already have such a type, use the old one. */
6041 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
6042 t = type_hash_canon (hashcode, t);
6044 if (!COMPLETE_TYPE_P (t))
6047 if (TYPE_CANONICAL (t) == t)
6049 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
6050 SET_TYPE_STRUCTURAL_EQUALITY (t);
6051 else if (TYPE_CANONICAL (component_type) != component_type)
6053 = build_complex_type (TYPE_CANONICAL (component_type));
6056 /* We need to create a name, since complex is a fundamental type. */
6057 if (! TYPE_NAME (t))
6060 if (component_type == char_type_node)
6061 name = "complex char";
6062 else if (component_type == signed_char_type_node)
6063 name = "complex signed char";
6064 else if (component_type == unsigned_char_type_node)
6065 name = "complex unsigned char";
6066 else if (component_type == short_integer_type_node)
6067 name = "complex short int";
6068 else if (component_type == short_unsigned_type_node)
6069 name = "complex short unsigned int";
6070 else if (component_type == integer_type_node)
6071 name = "complex int";
6072 else if (component_type == unsigned_type_node)
6073 name = "complex unsigned int";
6074 else if (component_type == long_integer_type_node)
6075 name = "complex long int";
6076 else if (component_type == long_unsigned_type_node)
6077 name = "complex long unsigned int";
6078 else if (component_type == long_long_integer_type_node)
6079 name = "complex long long int";
6080 else if (component_type == long_long_unsigned_type_node)
6081 name = "complex long long unsigned int";
6086 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
6089 return build_qualified_type (t, TYPE_QUALS (component_type));
6092 /* Return OP, stripped of any conversions to wider types as much as is safe.
6093 Converting the value back to OP's type makes a value equivalent to OP.
6095 If FOR_TYPE is nonzero, we return a value which, if converted to
6096 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6098 OP must have integer, real or enumeral type. Pointers are not allowed!
6100 There are some cases where the obvious value we could return
6101 would regenerate to OP if converted to OP's type,
6102 but would not extend like OP to wider types.
6103 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6104 For example, if OP is (unsigned short)(signed char)-1,
6105 we avoid returning (signed char)-1 if FOR_TYPE is int,
6106 even though extending that to an unsigned short would regenerate OP,
6107 since the result of extending (signed char)-1 to (int)
6108 is different from (int) OP. */
6111 get_unwidened (tree op, tree for_type)
6113 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6114 tree type = TREE_TYPE (op);
6116 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6118 = (for_type != 0 && for_type != type
6119 && final_prec > TYPE_PRECISION (type)
6120 && TYPE_UNSIGNED (type));
6123 while (CONVERT_EXPR_P (op))
6127 /* TYPE_PRECISION on vector types has different meaning
6128 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6129 so avoid them here. */
6130 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6133 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6134 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6136 /* Truncations are many-one so cannot be removed.
6137 Unless we are later going to truncate down even farther. */
6139 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6142 /* See what's inside this conversion. If we decide to strip it,
6144 op = TREE_OPERAND (op, 0);
6146 /* If we have not stripped any zero-extensions (uns is 0),
6147 we can strip any kind of extension.
6148 If we have previously stripped a zero-extension,
6149 only zero-extensions can safely be stripped.
6150 Any extension can be stripped if the bits it would produce
6151 are all going to be discarded later by truncating to FOR_TYPE. */
6155 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6157 /* TYPE_UNSIGNED says whether this is a zero-extension.
6158 Let's avoid computing it if it does not affect WIN
6159 and if UNS will not be needed again. */
6161 || CONVERT_EXPR_P (op))
6162 && TYPE_UNSIGNED (TREE_TYPE (op)))
6173 /* Return OP or a simpler expression for a narrower value
6174 which can be sign-extended or zero-extended to give back OP.
6175 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6176 or 0 if the value should be sign-extended. */
6179 get_narrower (tree op, int *unsignedp_ptr)
6184 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6186 while (TREE_CODE (op) == NOP_EXPR)
6189 = (TYPE_PRECISION (TREE_TYPE (op))
6190 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6192 /* Truncations are many-one so cannot be removed. */
6196 /* See what's inside this conversion. If we decide to strip it,
6201 op = TREE_OPERAND (op, 0);
6202 /* An extension: the outermost one can be stripped,
6203 but remember whether it is zero or sign extension. */
6205 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6206 /* Otherwise, if a sign extension has been stripped,
6207 only sign extensions can now be stripped;
6208 if a zero extension has been stripped, only zero-extensions. */
6209 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6213 else /* bitschange == 0 */
6215 /* A change in nominal type can always be stripped, but we must
6216 preserve the unsignedness. */
6218 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6220 op = TREE_OPERAND (op, 0);
6221 /* Keep trying to narrow, but don't assign op to win if it
6222 would turn an integral type into something else. */
6223 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6230 if (TREE_CODE (op) == COMPONENT_REF
6231 /* Since type_for_size always gives an integer type. */
6232 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6233 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6234 /* Ensure field is laid out already. */
6235 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6236 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6238 unsigned HOST_WIDE_INT innerprec
6239 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6240 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6241 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6242 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6244 /* We can get this structure field in a narrower type that fits it,
6245 but the resulting extension to its nominal type (a fullword type)
6246 must satisfy the same conditions as for other extensions.
6248 Do this only for fields that are aligned (not bit-fields),
6249 because when bit-field insns will be used there is no
6250 advantage in doing this. */
6252 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6253 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6254 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6258 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6259 win = fold_convert (type, op);
6263 *unsignedp_ptr = uns;
6267 /* Nonzero if integer constant C has a value that is permissible
6268 for type TYPE (an INTEGER_TYPE). */
6271 int_fits_type_p (const_tree c, const_tree type)
6273 tree type_low_bound = TYPE_MIN_VALUE (type);
6274 tree type_high_bound = TYPE_MAX_VALUE (type);
6275 bool ok_for_low_bound, ok_for_high_bound;
6276 unsigned HOST_WIDE_INT low;
6279 /* If at least one bound of the type is a constant integer, we can check
6280 ourselves and maybe make a decision. If no such decision is possible, but
6281 this type is a subtype, try checking against that. Otherwise, use
6282 fit_double_type, which checks against the precision.
6284 Compute the status for each possibly constant bound, and return if we see
6285 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6286 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6287 for "constant known to fit". */
6289 /* Check if C >= type_low_bound. */
6290 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6292 if (tree_int_cst_lt (c, type_low_bound))
6294 ok_for_low_bound = true;
6297 ok_for_low_bound = false;
6299 /* Check if c <= type_high_bound. */
6300 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6302 if (tree_int_cst_lt (type_high_bound, c))
6304 ok_for_high_bound = true;
6307 ok_for_high_bound = false;
6309 /* If the constant fits both bounds, the result is known. */
6310 if (ok_for_low_bound && ok_for_high_bound)
6313 /* Perform some generic filtering which may allow making a decision
6314 even if the bounds are not constant. First, negative integers
6315 never fit in unsigned types, */
6316 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6319 /* Second, narrower types always fit in wider ones. */
6320 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6323 /* Third, unsigned integers with top bit set never fit signed types. */
6324 if (! TYPE_UNSIGNED (type)
6325 && TYPE_UNSIGNED (TREE_TYPE (c))
6326 && tree_int_cst_msb (c))
6329 /* If we haven't been able to decide at this point, there nothing more we
6330 can check ourselves here. Look at the base type if we have one and it
6331 has the same precision. */
6332 if (TREE_CODE (type) == INTEGER_TYPE
6333 && TREE_TYPE (type) != 0
6334 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6335 return int_fits_type_p (c, TREE_TYPE (type));
6337 /* Or to fit_double_type, if nothing else. */
6338 low = TREE_INT_CST_LOW (c);
6339 high = TREE_INT_CST_HIGH (c);
6340 return !fit_double_type (low, high, &low, &high, type);
6343 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6344 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6345 represented (assuming two's-complement arithmetic) within the bit
6346 precision of the type are returned instead. */
6349 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6351 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6352 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6353 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6354 TYPE_UNSIGNED (type));
6357 if (TYPE_UNSIGNED (type))
6358 mpz_set_ui (min, 0);
6362 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6363 mn = double_int_sext (double_int_add (mn, double_int_one),
6364 TYPE_PRECISION (type));
6365 mpz_set_double_int (min, mn, false);
6369 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
6370 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
6371 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
6372 TYPE_UNSIGNED (type));
6375 if (TYPE_UNSIGNED (type))
6376 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
6379 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
6384 /* Return true if VAR is an automatic variable defined in function FN. */
6387 auto_var_in_fn_p (const_tree var, const_tree fn)
6389 return (DECL_P (var) && DECL_CONTEXT (var) == fn
6390 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
6391 && ! TREE_STATIC (var))
6392 || TREE_CODE (var) == LABEL_DECL
6393 || TREE_CODE (var) == RESULT_DECL));
6396 /* Subprogram of following function. Called by walk_tree.
6398 Return *TP if it is an automatic variable or parameter of the
6399 function passed in as DATA. */
6402 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6404 tree fn = (tree) data;
6409 else if (DECL_P (*tp)
6410 && auto_var_in_fn_p (*tp, fn))
6416 /* Returns true if T is, contains, or refers to a type with variable
6417 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6418 arguments, but not the return type. If FN is nonzero, only return
6419 true if a modifier of the type or position of FN is a variable or
6420 parameter inside FN.
6422 This concept is more general than that of C99 'variably modified types':
6423 in C99, a struct type is never variably modified because a VLA may not
6424 appear as a structure member. However, in GNU C code like:
6426 struct S { int i[f()]; };
6428 is valid, and other languages may define similar constructs. */
6431 variably_modified_type_p (tree type, tree fn)
6435 /* Test if T is either variable (if FN is zero) or an expression containing
6436 a variable in FN. */
6437 #define RETURN_TRUE_IF_VAR(T) \
6438 do { tree _t = (T); \
6439 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6440 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6441 return true; } while (0)
6443 if (type == error_mark_node)
6446 /* If TYPE itself has variable size, it is variably modified. */
6447 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6448 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6450 switch (TREE_CODE (type))
6453 case REFERENCE_TYPE:
6455 if (variably_modified_type_p (TREE_TYPE (type), fn))
6461 /* If TYPE is a function type, it is variably modified if the
6462 return type is variably modified. */
6463 if (variably_modified_type_p (TREE_TYPE (type), fn))
6469 case FIXED_POINT_TYPE:
6472 /* Scalar types are variably modified if their end points
6474 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6475 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6480 case QUAL_UNION_TYPE:
6481 /* We can't see if any of the fields are variably-modified by the
6482 definition we normally use, since that would produce infinite
6483 recursion via pointers. */
6484 /* This is variably modified if some field's type is. */
6485 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6486 if (TREE_CODE (t) == FIELD_DECL)
6488 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6489 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6490 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6492 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6493 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6498 /* Do not call ourselves to avoid infinite recursion. This is
6499 variably modified if the element type is. */
6500 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6501 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6508 /* The current language may have other cases to check, but in general,
6509 all other types are not variably modified. */
6510 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6512 #undef RETURN_TRUE_IF_VAR
6515 /* Given a DECL or TYPE, return the scope in which it was declared, or
6516 NULL_TREE if there is no containing scope. */
6519 get_containing_scope (const_tree t)
6521 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6524 /* Return the innermost context enclosing DECL that is
6525 a FUNCTION_DECL, or zero if none. */
6528 decl_function_context (const_tree decl)
6532 if (TREE_CODE (decl) == ERROR_MARK)
6535 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6536 where we look up the function at runtime. Such functions always take
6537 a first argument of type 'pointer to real context'.
6539 C++ should really be fixed to use DECL_CONTEXT for the real context,
6540 and use something else for the "virtual context". */
6541 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6544 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6546 context = DECL_CONTEXT (decl);
6548 while (context && TREE_CODE (context) != FUNCTION_DECL)
6550 if (TREE_CODE (context) == BLOCK)
6551 context = BLOCK_SUPERCONTEXT (context);
6553 context = get_containing_scope (context);
6559 /* Return the innermost context enclosing DECL that is
6560 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6561 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6564 decl_type_context (const_tree decl)
6566 tree context = DECL_CONTEXT (decl);
6569 switch (TREE_CODE (context))
6571 case NAMESPACE_DECL:
6572 case TRANSLATION_UNIT_DECL:
6577 case QUAL_UNION_TYPE:
6582 context = DECL_CONTEXT (context);
6586 context = BLOCK_SUPERCONTEXT (context);
6596 /* CALL is a CALL_EXPR. Return the declaration for the function
6597 called, or NULL_TREE if the called function cannot be
6601 get_callee_fndecl (const_tree call)
6605 if (call == error_mark_node)
6606 return error_mark_node;
6608 /* It's invalid to call this function with anything but a
6610 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6612 /* The first operand to the CALL is the address of the function
6614 addr = CALL_EXPR_FN (call);
6618 /* If this is a readonly function pointer, extract its initial value. */
6619 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6620 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6621 && DECL_INITIAL (addr))
6622 addr = DECL_INITIAL (addr);
6624 /* If the address is just `&f' for some function `f', then we know
6625 that `f' is being called. */
6626 if (TREE_CODE (addr) == ADDR_EXPR
6627 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6628 return TREE_OPERAND (addr, 0);
6630 /* We couldn't figure out what was being called. Maybe the front
6631 end has some idea. */
6632 return lang_hooks.lang_get_callee_fndecl (call);
6635 /* Print debugging information about tree nodes generated during the compile,
6636 and any language-specific information. */
6639 dump_tree_statistics (void)
6641 #ifdef GATHER_STATISTICS
6643 int total_nodes, total_bytes;
6646 fprintf (stderr, "\n??? tree nodes created\n\n");
6647 #ifdef GATHER_STATISTICS
6648 fprintf (stderr, "Kind Nodes Bytes\n");
6649 fprintf (stderr, "---------------------------------------\n");
6650 total_nodes = total_bytes = 0;
6651 for (i = 0; i < (int) all_kinds; i++)
6653 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6654 tree_node_counts[i], tree_node_sizes[i]);
6655 total_nodes += tree_node_counts[i];
6656 total_bytes += tree_node_sizes[i];
6658 fprintf (stderr, "---------------------------------------\n");
6659 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6660 fprintf (stderr, "---------------------------------------\n");
6661 ssanames_print_statistics ();
6662 phinodes_print_statistics ();
6664 fprintf (stderr, "(No per-node statistics)\n");
6666 print_type_hash_statistics ();
6667 print_debug_expr_statistics ();
6668 print_value_expr_statistics ();
6669 print_restrict_base_statistics ();
6670 lang_hooks.print_statistics ();
6673 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6675 /* Generate a crc32 of a string. */
6678 crc32_string (unsigned chksum, const char *string)
6682 unsigned value = *string << 24;
6685 for (ix = 8; ix--; value <<= 1)
6689 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6698 /* P is a string that will be used in a symbol. Mask out any characters
6699 that are not valid in that context. */
6702 clean_symbol_name (char *p)
6706 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6709 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6716 /* Generate a name for a special-purpose function function.
6717 The generated name may need to be unique across the whole link.
6718 TYPE is some string to identify the purpose of this function to the
6719 linker or collect2; it must start with an uppercase letter,
6721 I - for constructors
6723 N - for C++ anonymous namespaces
6724 F - for DWARF unwind frame information. */
6727 get_file_function_name (const char *type)
6733 /* If we already have a name we know to be unique, just use that. */
6734 if (first_global_object_name)
6735 p = first_global_object_name;
6736 /* If the target is handling the constructors/destructors, they
6737 will be local to this file and the name is only necessary for
6738 debugging purposes. */
6739 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6741 const char *file = main_input_filename;
6743 file = input_filename;
6744 /* Just use the file's basename, because the full pathname
6745 might be quite long. */
6746 p = strrchr (file, '/');
6751 p = q = ASTRDUP (p);
6752 clean_symbol_name (q);
6756 /* Otherwise, the name must be unique across the entire link.
6757 We don't have anything that we know to be unique to this translation
6758 unit, so use what we do have and throw in some randomness. */
6760 const char *name = weak_global_object_name;
6761 const char *file = main_input_filename;
6766 file = input_filename;
6768 len = strlen (file);
6769 q = (char *) alloca (9 * 2 + len + 1);
6770 memcpy (q, file, len + 1);
6771 clean_symbol_name (q);
6773 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6774 crc32_string (0, get_random_seed (false)));
6779 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
6782 /* Set up the name of the file-level functions we may need.
6783 Use a global object (which is already required to be unique over
6784 the program) rather than the file name (which imposes extra
6786 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6788 return get_identifier (buf);
6791 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6793 /* Complain that the tree code of NODE does not match the expected 0
6794 terminated list of trailing codes. The trailing code list can be
6795 empty, for a more vague error message. FILE, LINE, and FUNCTION
6796 are of the caller. */
6799 tree_check_failed (const_tree node, const char *file,
6800 int line, const char *function, ...)
6804 unsigned length = 0;
6807 va_start (args, function);
6808 while ((code = va_arg (args, int)))
6809 length += 4 + strlen (tree_code_name[code]);
6814 va_start (args, function);
6815 length += strlen ("expected ");
6816 buffer = tmp = (char *) alloca (length);
6818 while ((code = va_arg (args, int)))
6820 const char *prefix = length ? " or " : "expected ";
6822 strcpy (tmp + length, prefix);
6823 length += strlen (prefix);
6824 strcpy (tmp + length, tree_code_name[code]);
6825 length += strlen (tree_code_name[code]);
6830 buffer = "unexpected node";
6832 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6833 buffer, tree_code_name[TREE_CODE (node)],
6834 function, trim_filename (file), line);
6837 /* Complain that the tree code of NODE does match the expected 0
6838 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6842 tree_not_check_failed (const_tree node, const char *file,
6843 int line, const char *function, ...)
6847 unsigned length = 0;
6850 va_start (args, function);
6851 while ((code = va_arg (args, int)))
6852 length += 4 + strlen (tree_code_name[code]);
6854 va_start (args, function);
6855 buffer = (char *) alloca (length);
6857 while ((code = va_arg (args, int)))
6861 strcpy (buffer + length, " or ");
6864 strcpy (buffer + length, tree_code_name[code]);
6865 length += strlen (tree_code_name[code]);
6869 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6870 buffer, tree_code_name[TREE_CODE (node)],
6871 function, trim_filename (file), line);
6874 /* Similar to tree_check_failed, except that we check for a class of tree
6875 code, given in CL. */
6878 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
6879 const char *file, int line, const char *function)
6882 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6883 TREE_CODE_CLASS_STRING (cl),
6884 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6885 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6888 /* Similar to tree_check_failed, except that instead of specifying a
6889 dozen codes, use the knowledge that they're all sequential. */
6892 tree_range_check_failed (const_tree node, const char *file, int line,
6893 const char *function, enum tree_code c1,
6897 unsigned length = 0;
6900 for (c = c1; c <= c2; ++c)
6901 length += 4 + strlen (tree_code_name[c]);
6903 length += strlen ("expected ");
6904 buffer = (char *) alloca (length);
6907 for (c = c1; c <= c2; ++c)
6909 const char *prefix = length ? " or " : "expected ";
6911 strcpy (buffer + length, prefix);
6912 length += strlen (prefix);
6913 strcpy (buffer + length, tree_code_name[c]);
6914 length += strlen (tree_code_name[c]);
6917 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6918 buffer, tree_code_name[TREE_CODE (node)],
6919 function, trim_filename (file), line);
6923 /* Similar to tree_check_failed, except that we check that a tree does
6924 not have the specified code, given in CL. */
6927 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
6928 const char *file, int line, const char *function)
6931 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6932 TREE_CODE_CLASS_STRING (cl),
6933 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6934 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6938 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6941 omp_clause_check_failed (const_tree node, const char *file, int line,
6942 const char *function, enum omp_clause_code code)
6944 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6945 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6946 function, trim_filename (file), line);
6950 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6953 omp_clause_range_check_failed (const_tree node, const char *file, int line,
6954 const char *function, enum omp_clause_code c1,
6955 enum omp_clause_code c2)
6958 unsigned length = 0;
6959 enum omp_clause_code c;
6961 for (c = c1; c <= c2; ++c)
6962 length += 4 + strlen (omp_clause_code_name[c]);
6964 length += strlen ("expected ");
6965 buffer = (char *) alloca (length);
6968 for (c = c1; c <= c2; ++c)
6970 const char *prefix = length ? " or " : "expected ";
6972 strcpy (buffer + length, prefix);
6973 length += strlen (prefix);
6974 strcpy (buffer + length, omp_clause_code_name[c]);
6975 length += strlen (omp_clause_code_name[c]);
6978 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6979 buffer, omp_clause_code_name[TREE_CODE (node)],
6980 function, trim_filename (file), line);
6984 #undef DEFTREESTRUCT
6985 #define DEFTREESTRUCT(VAL, NAME) NAME,
6987 static const char *ts_enum_names[] = {
6988 #include "treestruct.def"
6990 #undef DEFTREESTRUCT
6992 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6994 /* Similar to tree_class_check_failed, except that we check for
6995 whether CODE contains the tree structure identified by EN. */
6998 tree_contains_struct_check_failed (const_tree node,
6999 const enum tree_node_structure_enum en,
7000 const char *file, int line,
7001 const char *function)
7004 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7006 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7010 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7011 (dynamically sized) vector. */
7014 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
7015 const char *function)
7018 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7019 idx + 1, len, function, trim_filename (file), line);
7022 /* Similar to above, except that the check is for the bounds of the operand
7023 vector of an expression node EXP. */
7026 tree_operand_check_failed (int idx, const_tree exp, const char *file,
7027 int line, const char *function)
7029 int code = TREE_CODE (exp);
7031 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7032 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
7033 function, trim_filename (file), line);
7036 /* Similar to above, except that the check is for the number of
7037 operands of an OMP_CLAUSE node. */
7040 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
7041 int line, const char *function)
7044 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7045 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
7046 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
7047 trim_filename (file), line);
7049 #endif /* ENABLE_TREE_CHECKING */
7051 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7052 and mapped to the machine mode MODE. Initialize its fields and build
7053 the information necessary for debugging output. */
7056 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7059 hashval_t hashcode = 0;
7061 /* Build a main variant, based on the main variant of the inner type, then
7062 use it to build the variant we return. */
7063 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7064 && TYPE_MAIN_VARIANT (innertype) != innertype)
7065 return build_type_attribute_qual_variant (
7066 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7067 TYPE_ATTRIBUTES (innertype),
7068 TYPE_QUALS (innertype));
7070 t = make_node (VECTOR_TYPE);
7071 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7072 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7073 TYPE_MODE (t) = mode;
7074 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7075 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7077 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7078 SET_TYPE_STRUCTURAL_EQUALITY (t);
7079 else if (TYPE_CANONICAL (innertype) != innertype
7080 || mode != VOIDmode)
7082 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7087 tree index = build_int_cst (NULL_TREE, nunits - 1);
7088 tree array = build_array_type (innertype, build_index_type (index));
7089 tree rt = make_node (RECORD_TYPE);
7091 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
7092 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7094 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7095 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7096 the representation type, and we want to find that die when looking up
7097 the vector type. This is most easily achieved by making the TYPE_UID
7099 TYPE_UID (rt) = TYPE_UID (t);
7102 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7103 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7104 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7105 return type_hash_canon (hashcode, t);
7109 make_or_reuse_type (unsigned size, int unsignedp)
7111 if (size == INT_TYPE_SIZE)
7112 return unsignedp ? unsigned_type_node : integer_type_node;
7113 if (size == CHAR_TYPE_SIZE)
7114 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7115 if (size == SHORT_TYPE_SIZE)
7116 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7117 if (size == LONG_TYPE_SIZE)
7118 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7119 if (size == LONG_LONG_TYPE_SIZE)
7120 return (unsignedp ? long_long_unsigned_type_node
7121 : long_long_integer_type_node);
7124 return make_unsigned_type (size);
7126 return make_signed_type (size);
7129 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7132 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7136 if (size == SHORT_FRACT_TYPE_SIZE)
7137 return unsignedp ? sat_unsigned_short_fract_type_node
7138 : sat_short_fract_type_node;
7139 if (size == FRACT_TYPE_SIZE)
7140 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7141 if (size == LONG_FRACT_TYPE_SIZE)
7142 return unsignedp ? sat_unsigned_long_fract_type_node
7143 : sat_long_fract_type_node;
7144 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7145 return unsignedp ? sat_unsigned_long_long_fract_type_node
7146 : sat_long_long_fract_type_node;
7150 if (size == SHORT_FRACT_TYPE_SIZE)
7151 return unsignedp ? unsigned_short_fract_type_node
7152 : short_fract_type_node;
7153 if (size == FRACT_TYPE_SIZE)
7154 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7155 if (size == LONG_FRACT_TYPE_SIZE)
7156 return unsignedp ? unsigned_long_fract_type_node
7157 : long_fract_type_node;
7158 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7159 return unsignedp ? unsigned_long_long_fract_type_node
7160 : long_long_fract_type_node;
7163 return make_fract_type (size, unsignedp, satp);
7166 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7169 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7173 if (size == SHORT_ACCUM_TYPE_SIZE)
7174 return unsignedp ? sat_unsigned_short_accum_type_node
7175 : sat_short_accum_type_node;
7176 if (size == ACCUM_TYPE_SIZE)
7177 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7178 if (size == LONG_ACCUM_TYPE_SIZE)
7179 return unsignedp ? sat_unsigned_long_accum_type_node
7180 : sat_long_accum_type_node;
7181 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7182 return unsignedp ? sat_unsigned_long_long_accum_type_node
7183 : sat_long_long_accum_type_node;
7187 if (size == SHORT_ACCUM_TYPE_SIZE)
7188 return unsignedp ? unsigned_short_accum_type_node
7189 : short_accum_type_node;
7190 if (size == ACCUM_TYPE_SIZE)
7191 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7192 if (size == LONG_ACCUM_TYPE_SIZE)
7193 return unsignedp ? unsigned_long_accum_type_node
7194 : long_accum_type_node;
7195 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7196 return unsignedp ? unsigned_long_long_accum_type_node
7197 : long_long_accum_type_node;
7200 return make_accum_type (size, unsignedp, satp);
7203 /* Create nodes for all integer types (and error_mark_node) using the sizes
7204 of C datatypes. The caller should call set_sizetype soon after calling
7205 this function to select one of the types as sizetype. */
7208 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7210 error_mark_node = make_node (ERROR_MARK);
7211 TREE_TYPE (error_mark_node) = error_mark_node;
7213 initialize_sizetypes (signed_sizetype);
7215 /* Define both `signed char' and `unsigned char'. */
7216 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7217 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7218 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7219 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7221 /* Define `char', which is like either `signed char' or `unsigned char'
7222 but not the same as either. */
7225 ? make_signed_type (CHAR_TYPE_SIZE)
7226 : make_unsigned_type (CHAR_TYPE_SIZE));
7227 TYPE_STRING_FLAG (char_type_node) = 1;
7229 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7230 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7231 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7232 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7233 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7234 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7235 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7236 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7238 /* Define a boolean type. This type only represents boolean values but
7239 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7240 Front ends which want to override this size (i.e. Java) can redefine
7241 boolean_type_node before calling build_common_tree_nodes_2. */
7242 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7243 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7244 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7245 TYPE_PRECISION (boolean_type_node) = 1;
7247 /* Fill in the rest of the sized types. Reuse existing type nodes
7249 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7250 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7251 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7252 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7253 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7255 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7256 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7257 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7258 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7259 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7261 access_public_node = get_identifier ("public");
7262 access_protected_node = get_identifier ("protected");
7263 access_private_node = get_identifier ("private");
7266 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7267 It will create several other common tree nodes. */
7270 build_common_tree_nodes_2 (int short_double)
7272 /* Define these next since types below may used them. */
7273 integer_zero_node = build_int_cst (NULL_TREE, 0);
7274 integer_one_node = build_int_cst (NULL_TREE, 1);
7275 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7277 size_zero_node = size_int (0);
7278 size_one_node = size_int (1);
7279 bitsize_zero_node = bitsize_int (0);
7280 bitsize_one_node = bitsize_int (1);
7281 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7283 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7284 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7286 void_type_node = make_node (VOID_TYPE);
7287 layout_type (void_type_node);
7289 /* We are not going to have real types in C with less than byte alignment,
7290 so we might as well not have any types that claim to have it. */
7291 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7292 TYPE_USER_ALIGN (void_type_node) = 0;
7294 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7295 layout_type (TREE_TYPE (null_pointer_node));
7297 ptr_type_node = build_pointer_type (void_type_node);
7299 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7300 fileptr_type_node = ptr_type_node;
7302 float_type_node = make_node (REAL_TYPE);
7303 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7304 layout_type (float_type_node);
7306 double_type_node = make_node (REAL_TYPE);
7308 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7310 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7311 layout_type (double_type_node);
7313 long_double_type_node = make_node (REAL_TYPE);
7314 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7315 layout_type (long_double_type_node);
7317 float_ptr_type_node = build_pointer_type (float_type_node);
7318 double_ptr_type_node = build_pointer_type (double_type_node);
7319 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7320 integer_ptr_type_node = build_pointer_type (integer_type_node);
7322 /* Fixed size integer types. */
7323 uint32_type_node = build_nonstandard_integer_type (32, true);
7324 uint64_type_node = build_nonstandard_integer_type (64, true);
7326 /* Decimal float types. */
7327 dfloat32_type_node = make_node (REAL_TYPE);
7328 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7329 layout_type (dfloat32_type_node);
7330 TYPE_MODE (dfloat32_type_node) = SDmode;
7331 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7333 dfloat64_type_node = make_node (REAL_TYPE);
7334 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7335 layout_type (dfloat64_type_node);
7336 TYPE_MODE (dfloat64_type_node) = DDmode;
7337 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7339 dfloat128_type_node = make_node (REAL_TYPE);
7340 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7341 layout_type (dfloat128_type_node);
7342 TYPE_MODE (dfloat128_type_node) = TDmode;
7343 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7345 complex_integer_type_node = build_complex_type (integer_type_node);
7346 complex_float_type_node = build_complex_type (float_type_node);
7347 complex_double_type_node = build_complex_type (double_type_node);
7348 complex_long_double_type_node = build_complex_type (long_double_type_node);
7350 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7351 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
7352 sat_ ## KIND ## _type_node = \
7353 make_sat_signed_ ## KIND ## _type (SIZE); \
7354 sat_unsigned_ ## KIND ## _type_node = \
7355 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7356 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7357 unsigned_ ## KIND ## _type_node = \
7358 make_unsigned_ ## KIND ## _type (SIZE);
7360 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
7361 sat_ ## WIDTH ## KIND ## _type_node = \
7362 make_sat_signed_ ## KIND ## _type (SIZE); \
7363 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7364 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7365 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7366 unsigned_ ## WIDTH ## KIND ## _type_node = \
7367 make_unsigned_ ## KIND ## _type (SIZE);
7369 /* Make fixed-point type nodes based on four different widths. */
7370 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7371 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7372 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
7373 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7374 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7376 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7377 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7378 NAME ## _type_node = \
7379 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7380 u ## NAME ## _type_node = \
7381 make_or_reuse_unsigned_ ## KIND ## _type \
7382 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7383 sat_ ## NAME ## _type_node = \
7384 make_or_reuse_sat_signed_ ## KIND ## _type \
7385 (GET_MODE_BITSIZE (MODE ## mode)); \
7386 sat_u ## NAME ## _type_node = \
7387 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7388 (GET_MODE_BITSIZE (U ## MODE ## mode));
7390 /* Fixed-point type and mode nodes. */
7391 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
7392 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
7393 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
7394 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
7395 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
7396 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
7397 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
7398 MAKE_FIXED_MODE_NODE (accum, ha, HA)
7399 MAKE_FIXED_MODE_NODE (accum, sa, SA)
7400 MAKE_FIXED_MODE_NODE (accum, da, DA)
7401 MAKE_FIXED_MODE_NODE (accum, ta, TA)
7404 tree t = targetm.build_builtin_va_list ();
7406 /* Many back-ends define record types without setting TYPE_NAME.
7407 If we copied the record type here, we'd keep the original
7408 record type without a name. This breaks name mangling. So,
7409 don't copy record types and let c_common_nodes_and_builtins()
7410 declare the type to be __builtin_va_list. */
7411 if (TREE_CODE (t) != RECORD_TYPE)
7412 t = build_variant_type_copy (t);
7414 va_list_type_node = t;
7418 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7421 local_define_builtin (const char *name, tree type, enum built_in_function code,
7422 const char *library_name, int ecf_flags)
7426 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7427 library_name, NULL_TREE);
7428 if (ecf_flags & ECF_CONST)
7429 TREE_READONLY (decl) = 1;
7430 if (ecf_flags & ECF_PURE)
7431 DECL_PURE_P (decl) = 1;
7432 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
7433 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
7434 if (ecf_flags & ECF_NORETURN)
7435 TREE_THIS_VOLATILE (decl) = 1;
7436 if (ecf_flags & ECF_NOTHROW)
7437 TREE_NOTHROW (decl) = 1;
7438 if (ecf_flags & ECF_MALLOC)
7439 DECL_IS_MALLOC (decl) = 1;
7441 built_in_decls[code] = decl;
7442 implicit_built_in_decls[code] = decl;
7445 /* Call this function after instantiating all builtins that the language
7446 front end cares about. This will build the rest of the builtins that
7447 are relied upon by the tree optimizers and the middle-end. */
7450 build_common_builtin_nodes (void)
7454 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7455 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7457 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7458 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7459 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7460 ftype = build_function_type (ptr_type_node, tmp);
7462 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7463 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7464 "memcpy", ECF_NOTHROW);
7465 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7466 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7467 "memmove", ECF_NOTHROW);
7470 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7472 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7473 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7474 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7475 ftype = build_function_type (integer_type_node, tmp);
7476 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7477 "memcmp", ECF_PURE | ECF_NOTHROW);
7480 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7482 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7483 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7484 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7485 ftype = build_function_type (ptr_type_node, tmp);
7486 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7487 "memset", ECF_NOTHROW);
7490 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7492 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7493 ftype = build_function_type (ptr_type_node, tmp);
7494 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7495 "alloca", ECF_NOTHROW | ECF_MALLOC);
7498 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7499 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7500 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7501 ftype = build_function_type (void_type_node, tmp);
7502 local_define_builtin ("__builtin_init_trampoline", ftype,
7503 BUILT_IN_INIT_TRAMPOLINE,
7504 "__builtin_init_trampoline", ECF_NOTHROW);
7506 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7507 ftype = build_function_type (ptr_type_node, tmp);
7508 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7509 BUILT_IN_ADJUST_TRAMPOLINE,
7510 "__builtin_adjust_trampoline",
7511 ECF_CONST | ECF_NOTHROW);
7513 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7514 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7515 ftype = build_function_type (void_type_node, tmp);
7516 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7517 BUILT_IN_NONLOCAL_GOTO,
7518 "__builtin_nonlocal_goto",
7519 ECF_NORETURN | ECF_NOTHROW);
7521 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7522 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7523 ftype = build_function_type (void_type_node, tmp);
7524 local_define_builtin ("__builtin_setjmp_setup", ftype,
7525 BUILT_IN_SETJMP_SETUP,
7526 "__builtin_setjmp_setup", ECF_NOTHROW);
7528 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7529 ftype = build_function_type (ptr_type_node, tmp);
7530 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7531 BUILT_IN_SETJMP_DISPATCHER,
7532 "__builtin_setjmp_dispatcher",
7533 ECF_PURE | ECF_NOTHROW);
7535 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7536 ftype = build_function_type (void_type_node, tmp);
7537 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7538 BUILT_IN_SETJMP_RECEIVER,
7539 "__builtin_setjmp_receiver", ECF_NOTHROW);
7541 ftype = build_function_type (ptr_type_node, void_list_node);
7542 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7543 "__builtin_stack_save", ECF_NOTHROW);
7545 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7546 ftype = build_function_type (void_type_node, tmp);
7547 local_define_builtin ("__builtin_stack_restore", ftype,
7548 BUILT_IN_STACK_RESTORE,
7549 "__builtin_stack_restore", ECF_NOTHROW);
7551 ftype = build_function_type (void_type_node, void_list_node);
7552 local_define_builtin ("__builtin_profile_func_enter", ftype,
7553 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7554 local_define_builtin ("__builtin_profile_func_exit", ftype,
7555 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7557 /* Complex multiplication and division. These are handled as builtins
7558 rather than optabs because emit_library_call_value doesn't support
7559 complex. Further, we can do slightly better with folding these
7560 beasties if the real and complex parts of the arguments are separate. */
7562 enum machine_mode mode;
7564 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7566 char mode_name_buf[4], *q;
7568 enum built_in_function mcode, dcode;
7569 tree type, inner_type;
7571 type = lang_hooks.types.type_for_mode (mode, 0);
7574 inner_type = TREE_TYPE (type);
7576 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7577 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7578 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7579 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7580 ftype = build_function_type (type, tmp);
7582 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7583 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7585 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7589 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7590 local_define_builtin (built_in_names[mcode], ftype, mcode,
7591 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7593 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7594 local_define_builtin (built_in_names[dcode], ftype, dcode,
7595 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7600 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7603 If we requested a pointer to a vector, build up the pointers that
7604 we stripped off while looking for the inner type. Similarly for
7605 return values from functions.
7607 The argument TYPE is the top of the chain, and BOTTOM is the
7608 new type which we will point to. */
7611 reconstruct_complex_type (tree type, tree bottom)
7615 if (TREE_CODE (type) == POINTER_TYPE)
7617 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7618 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7619 TYPE_REF_CAN_ALIAS_ALL (type));
7621 else if (TREE_CODE (type) == REFERENCE_TYPE)
7623 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7624 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7625 TYPE_REF_CAN_ALIAS_ALL (type));
7627 else if (TREE_CODE (type) == ARRAY_TYPE)
7629 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7630 outer = build_array_type (inner, TYPE_DOMAIN (type));
7632 else if (TREE_CODE (type) == FUNCTION_TYPE)
7634 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7635 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7637 else if (TREE_CODE (type) == METHOD_TYPE)
7639 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7640 /* The build_method_type_directly() routine prepends 'this' to argument list,
7641 so we must compensate by getting rid of it. */
7643 = build_method_type_directly
7644 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
7646 TREE_CHAIN (TYPE_ARG_TYPES (type)));
7648 else if (TREE_CODE (type) == OFFSET_TYPE)
7650 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7651 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
7656 return build_qualified_type (outer, TYPE_QUALS (type));
7659 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7662 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7666 switch (GET_MODE_CLASS (mode))
7668 case MODE_VECTOR_INT:
7669 case MODE_VECTOR_FLOAT:
7670 case MODE_VECTOR_FRACT:
7671 case MODE_VECTOR_UFRACT:
7672 case MODE_VECTOR_ACCUM:
7673 case MODE_VECTOR_UACCUM:
7674 nunits = GET_MODE_NUNITS (mode);
7678 /* Check that there are no leftover bits. */
7679 gcc_assert (GET_MODE_BITSIZE (mode)
7680 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7682 nunits = GET_MODE_BITSIZE (mode)
7683 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7690 return make_vector_type (innertype, nunits, mode);
7693 /* Similarly, but takes the inner type and number of units, which must be
7697 build_vector_type (tree innertype, int nunits)
7699 return make_vector_type (innertype, nunits, VOIDmode);
7703 /* Build RESX_EXPR with given REGION_NUMBER. */
7705 build_resx (int region_number)
7708 t = build1 (RESX_EXPR, void_type_node,
7709 build_int_cst (NULL_TREE, region_number));
7713 /* Given an initializer INIT, return TRUE if INIT is zero or some
7714 aggregate of zeros. Otherwise return FALSE. */
7716 initializer_zerop (const_tree init)
7722 switch (TREE_CODE (init))
7725 return integer_zerop (init);
7728 /* ??? Note that this is not correct for C4X float formats. There,
7729 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7730 negative exponent. */
7731 return real_zerop (init)
7732 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7735 return fixed_zerop (init);
7738 return integer_zerop (init)
7739 || (real_zerop (init)
7740 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7741 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7744 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7745 if (!initializer_zerop (TREE_VALUE (elt)))
7751 unsigned HOST_WIDE_INT idx;
7753 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7754 if (!initializer_zerop (elt))
7764 /* Build an empty statement. */
7767 build_empty_stmt (void)
7769 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7773 /* Build an OpenMP clause with code CODE. */
7776 build_omp_clause (enum omp_clause_code code)
7781 length = omp_clause_num_ops[code];
7782 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7784 t = GGC_NEWVAR (union tree_node, size);
7785 memset (t, 0, size);
7786 TREE_SET_CODE (t, OMP_CLAUSE);
7787 OMP_CLAUSE_SET_CODE (t, code);
7789 #ifdef GATHER_STATISTICS
7790 tree_node_counts[(int) omp_clause_kind]++;
7791 tree_node_sizes[(int) omp_clause_kind] += size;
7797 /* Set various status flags when building a CALL_EXPR object T. */
7800 process_call_operands (tree t)
7804 side_effects = TREE_SIDE_EFFECTS (t);
7808 n = TREE_OPERAND_LENGTH (t);
7809 for (i = 1; i < n; i++)
7811 tree op = TREE_OPERAND (t, i);
7812 if (op && TREE_SIDE_EFFECTS (op))
7823 /* Calls have side-effects, except those to const or
7825 i = call_expr_flags (t);
7826 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
7829 TREE_SIDE_EFFECTS (t) = side_effects;
7832 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7833 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7834 Except for the CODE and operand count field, other storage for the
7835 object is initialized to zeros. */
7838 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7841 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7843 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7844 gcc_assert (len >= 1);
7846 #ifdef GATHER_STATISTICS
7847 tree_node_counts[(int) e_kind]++;
7848 tree_node_sizes[(int) e_kind] += length;
7851 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
7853 memset (t, 0, length);
7855 TREE_SET_CODE (t, code);
7857 /* Can't use TREE_OPERAND to store the length because if checking is
7858 enabled, it will try to check the length before we store it. :-P */
7859 t->exp.operands[0] = build_int_cst (sizetype, len);
7865 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7866 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7870 build_call_list (tree return_type, tree fn, tree arglist)
7875 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
7876 TREE_TYPE (t) = return_type;
7877 CALL_EXPR_FN (t) = fn;
7878 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7879 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
7880 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
7881 process_call_operands (t);
7885 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7886 FN and a null static chain slot. NARGS is the number of call arguments
7887 which are specified as "..." arguments. */
7890 build_call_nary (tree return_type, tree fn, int nargs, ...)
7894 va_start (args, nargs);
7895 ret = build_call_valist (return_type, fn, nargs, args);
7900 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7901 FN and a null static chain slot. NARGS is the number of call arguments
7902 which are specified as a va_list ARGS. */
7905 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
7910 t = build_vl_exp (CALL_EXPR, nargs + 3);
7911 TREE_TYPE (t) = return_type;
7912 CALL_EXPR_FN (t) = fn;
7913 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7914 for (i = 0; i < nargs; i++)
7915 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
7916 process_call_operands (t);
7920 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7921 FN and a null static chain slot. NARGS is the number of call arguments
7922 which are specified as a tree array ARGS. */
7925 build_call_array (tree return_type, tree fn, int nargs, tree *args)
7930 t = build_vl_exp (CALL_EXPR, nargs + 3);
7931 TREE_TYPE (t) = return_type;
7932 CALL_EXPR_FN (t) = fn;
7933 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7934 for (i = 0; i < nargs; i++)
7935 CALL_EXPR_ARG (t, i) = args[i];
7936 process_call_operands (t);
7941 /* Returns true if it is possible to prove that the index of
7942 an array access REF (an ARRAY_REF expression) falls into the
7946 in_array_bounds_p (tree ref)
7948 tree idx = TREE_OPERAND (ref, 1);
7951 if (TREE_CODE (idx) != INTEGER_CST)
7954 min = array_ref_low_bound (ref);
7955 max = array_ref_up_bound (ref);
7958 || TREE_CODE (min) != INTEGER_CST
7959 || TREE_CODE (max) != INTEGER_CST)
7962 if (tree_int_cst_lt (idx, min)
7963 || tree_int_cst_lt (max, idx))
7969 /* Returns true if it is possible to prove that the range of
7970 an array access REF (an ARRAY_RANGE_REF expression) falls
7971 into the array bounds. */
7974 range_in_array_bounds_p (tree ref)
7976 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7977 tree range_min, range_max, min, max;
7979 range_min = TYPE_MIN_VALUE (domain_type);
7980 range_max = TYPE_MAX_VALUE (domain_type);
7983 || TREE_CODE (range_min) != INTEGER_CST
7984 || TREE_CODE (range_max) != INTEGER_CST)
7987 min = array_ref_low_bound (ref);
7988 max = array_ref_up_bound (ref);
7991 || TREE_CODE (min) != INTEGER_CST
7992 || TREE_CODE (max) != INTEGER_CST)
7995 if (tree_int_cst_lt (range_min, min)
7996 || tree_int_cst_lt (max, range_max))
8002 /* Return true if T (assumed to be a DECL) must be assigned a memory
8006 needs_to_live_in_memory (const_tree t)
8008 if (TREE_CODE (t) == SSA_NAME)
8009 t = SSA_NAME_VAR (t);
8011 return (TREE_ADDRESSABLE (t)
8012 || is_global_var (t)
8013 || (TREE_CODE (t) == RESULT_DECL
8014 && aggregate_value_p (t, current_function_decl)));
8017 /* There are situations in which a language considers record types
8018 compatible which have different field lists. Decide if two fields
8019 are compatible. It is assumed that the parent records are compatible. */
8022 fields_compatible_p (const_tree f1, const_tree f2)
8024 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
8025 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
8028 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
8029 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
8032 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
8038 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8041 find_compatible_field (tree record, tree orig_field)
8045 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
8046 if (TREE_CODE (f) == FIELD_DECL
8047 && fields_compatible_p (f, orig_field))
8050 /* ??? Why isn't this on the main fields list? */
8051 f = TYPE_VFIELD (record);
8052 if (f && TREE_CODE (f) == FIELD_DECL
8053 && fields_compatible_p (f, orig_field))
8056 /* ??? We should abort here, but Java appears to do Bad Things
8057 with inherited fields. */
8061 /* Return value of a constant X and sign-extend it. */
8064 int_cst_value (const_tree x)
8066 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8067 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8069 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8070 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8071 || TREE_INT_CST_HIGH (x) == -1);
8073 if (bits < HOST_BITS_PER_WIDE_INT)
8075 bool negative = ((val >> (bits - 1)) & 1) != 0;
8077 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8079 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8085 /* If TYPE is an integral type, return an equivalent type which is
8086 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8087 return TYPE itself. */
8090 signed_or_unsigned_type_for (int unsignedp, tree type)
8093 if (POINTER_TYPE_P (type))
8096 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8099 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8102 /* Returns unsigned variant of TYPE. */
8105 unsigned_type_for (tree type)
8107 return signed_or_unsigned_type_for (1, type);
8110 /* Returns signed variant of TYPE. */
8113 signed_type_for (tree type)
8115 return signed_or_unsigned_type_for (0, type);
8118 /* Returns the largest value obtainable by casting something in INNER type to
8122 upper_bound_in_type (tree outer, tree inner)
8124 unsigned HOST_WIDE_INT lo, hi;
8125 unsigned int det = 0;
8126 unsigned oprec = TYPE_PRECISION (outer);
8127 unsigned iprec = TYPE_PRECISION (inner);
8130 /* Compute a unique number for every combination. */
8131 det |= (oprec > iprec) ? 4 : 0;
8132 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8133 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8135 /* Determine the exponent to use. */
8140 /* oprec <= iprec, outer: signed, inner: don't care. */
8145 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8149 /* oprec > iprec, outer: signed, inner: signed. */
8153 /* oprec > iprec, outer: signed, inner: unsigned. */
8157 /* oprec > iprec, outer: unsigned, inner: signed. */
8161 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8168 /* Compute 2^^prec - 1. */
8169 if (prec <= HOST_BITS_PER_WIDE_INT)
8172 lo = ((~(unsigned HOST_WIDE_INT) 0)
8173 >> (HOST_BITS_PER_WIDE_INT - prec));
8177 hi = ((~(unsigned HOST_WIDE_INT) 0)
8178 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8179 lo = ~(unsigned HOST_WIDE_INT) 0;
8182 return build_int_cst_wide (outer, lo, hi);
8185 /* Returns the smallest value obtainable by casting something in INNER type to
8189 lower_bound_in_type (tree outer, tree inner)
8191 unsigned HOST_WIDE_INT lo, hi;
8192 unsigned oprec = TYPE_PRECISION (outer);
8193 unsigned iprec = TYPE_PRECISION (inner);
8195 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8197 if (TYPE_UNSIGNED (outer)
8198 /* If we are widening something of an unsigned type, OUTER type
8199 contains all values of INNER type. In particular, both INNER
8200 and OUTER types have zero in common. */
8201 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8205 /* If we are widening a signed type to another signed type, we
8206 want to obtain -2^^(iprec-1). If we are keeping the
8207 precision or narrowing to a signed type, we want to obtain
8209 unsigned prec = oprec > iprec ? iprec : oprec;
8211 if (prec <= HOST_BITS_PER_WIDE_INT)
8213 hi = ~(unsigned HOST_WIDE_INT) 0;
8214 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8218 hi = ((~(unsigned HOST_WIDE_INT) 0)
8219 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8224 return build_int_cst_wide (outer, lo, hi);
8227 /* Return nonzero if two operands that are suitable for PHI nodes are
8228 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8229 SSA_NAME or invariant. Note that this is strictly an optimization.
8230 That is, callers of this function can directly call operand_equal_p
8231 and get the same result, only slower. */
8234 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8238 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8240 return operand_equal_p (arg0, arg1, 0);
8243 /* Returns number of zeros at the end of binary representation of X.
8245 ??? Use ffs if available? */
8248 num_ending_zeros (const_tree x)
8250 unsigned HOST_WIDE_INT fr, nfr;
8251 unsigned num, abits;
8252 tree type = TREE_TYPE (x);
8254 if (TREE_INT_CST_LOW (x) == 0)
8256 num = HOST_BITS_PER_WIDE_INT;
8257 fr = TREE_INT_CST_HIGH (x);
8262 fr = TREE_INT_CST_LOW (x);
8265 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8268 if (nfr << abits == fr)
8275 if (num > TYPE_PRECISION (type))
8276 num = TYPE_PRECISION (type);
8278 return build_int_cst_type (type, num);
8282 #define WALK_SUBTREE(NODE) \
8285 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8291 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8292 be walked whenever a type is seen in the tree. Rest of operands and return
8293 value are as for walk_tree. */
8296 walk_type_fields (tree type, walk_tree_fn func, void *data,
8297 struct pointer_set_t *pset, walk_tree_lh lh)
8299 tree result = NULL_TREE;
8301 switch (TREE_CODE (type))
8304 case REFERENCE_TYPE:
8305 /* We have to worry about mutually recursive pointers. These can't
8306 be written in C. They can in Ada. It's pathological, but
8307 there's an ACATS test (c38102a) that checks it. Deal with this
8308 by checking if we're pointing to another pointer, that one
8309 points to another pointer, that one does too, and we have no htab.
8310 If so, get a hash table. We check three levels deep to avoid
8311 the cost of the hash table if we don't need one. */
8312 if (POINTER_TYPE_P (TREE_TYPE (type))
8313 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8314 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8317 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8325 /* ... fall through ... */
8328 WALK_SUBTREE (TREE_TYPE (type));
8332 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
8337 WALK_SUBTREE (TREE_TYPE (type));
8341 /* We never want to walk into default arguments. */
8342 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
8343 WALK_SUBTREE (TREE_VALUE (arg));
8348 /* Don't follow this nodes's type if a pointer for fear that
8349 we'll have infinite recursion. If we have a PSET, then we
8352 || (!POINTER_TYPE_P (TREE_TYPE (type))
8353 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
8354 WALK_SUBTREE (TREE_TYPE (type));
8355 WALK_SUBTREE (TYPE_DOMAIN (type));
8359 WALK_SUBTREE (TREE_TYPE (type));
8360 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
8370 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8371 called with the DATA and the address of each sub-tree. If FUNC returns a
8372 non-NULL value, the traversal is stopped, and the value returned by FUNC
8373 is returned. If PSET is non-NULL it is used to record the nodes visited,
8374 and to avoid visiting a node more than once. */
8377 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
8378 struct pointer_set_t *pset, walk_tree_lh lh)
8380 enum tree_code code;
8384 #define WALK_SUBTREE_TAIL(NODE) \
8388 goto tail_recurse; \
8393 /* Skip empty subtrees. */
8397 /* Don't walk the same tree twice, if the user has requested
8398 that we avoid doing so. */
8399 if (pset && pointer_set_insert (pset, *tp))
8402 /* Call the function. */
8404 result = (*func) (tp, &walk_subtrees, data);
8406 /* If we found something, return it. */
8410 code = TREE_CODE (*tp);
8412 /* Even if we didn't, FUNC may have decided that there was nothing
8413 interesting below this point in the tree. */
8416 /* But we still need to check our siblings. */
8417 if (code == TREE_LIST)
8418 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8419 else if (code == OMP_CLAUSE)
8420 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8427 result = (*lh) (tp, &walk_subtrees, func, data, pset);
8428 if (result || !walk_subtrees)
8435 case IDENTIFIER_NODE:
8442 case PLACEHOLDER_EXPR:
8446 /* None of these have subtrees other than those already walked
8451 WALK_SUBTREE (TREE_VALUE (*tp));
8452 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8457 int len = TREE_VEC_LENGTH (*tp);
8462 /* Walk all elements but the first. */
8464 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8466 /* Now walk the first one as a tail call. */
8467 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8471 WALK_SUBTREE (TREE_REALPART (*tp));
8472 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8476 unsigned HOST_WIDE_INT idx;
8477 constructor_elt *ce;
8480 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8482 WALK_SUBTREE (ce->value);
8487 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8492 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8494 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8495 into declarations that are just mentioned, rather than
8496 declared; they don't really belong to this part of the tree.
8497 And, we can see cycles: the initializer for a declaration
8498 can refer to the declaration itself. */
8499 WALK_SUBTREE (DECL_INITIAL (decl));
8500 WALK_SUBTREE (DECL_SIZE (decl));
8501 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8503 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8506 case STATEMENT_LIST:
8508 tree_stmt_iterator i;
8509 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8510 WALK_SUBTREE (*tsi_stmt_ptr (i));
8515 switch (OMP_CLAUSE_CODE (*tp))
8517 case OMP_CLAUSE_PRIVATE:
8518 case OMP_CLAUSE_SHARED:
8519 case OMP_CLAUSE_FIRSTPRIVATE:
8520 case OMP_CLAUSE_COPYIN:
8521 case OMP_CLAUSE_COPYPRIVATE:
8523 case OMP_CLAUSE_NUM_THREADS:
8524 case OMP_CLAUSE_SCHEDULE:
8525 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8528 case OMP_CLAUSE_NOWAIT:
8529 case OMP_CLAUSE_ORDERED:
8530 case OMP_CLAUSE_DEFAULT:
8531 case OMP_CLAUSE_UNTIED:
8532 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8534 case OMP_CLAUSE_LASTPRIVATE:
8535 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
8536 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
8537 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8539 case OMP_CLAUSE_COLLAPSE:
8542 for (i = 0; i < 3; i++)
8543 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8544 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8547 case OMP_CLAUSE_REDUCTION:
8550 for (i = 0; i < 4; i++)
8551 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8552 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8564 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8565 But, we only want to walk once. */
8566 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8567 for (i = 0; i < len; ++i)
8568 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8569 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8572 case CHANGE_DYNAMIC_TYPE_EXPR:
8573 WALK_SUBTREE (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*tp));
8574 WALK_SUBTREE_TAIL (CHANGE_DYNAMIC_TYPE_LOCATION (*tp));
8577 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8578 defining. We only want to walk into these fields of a type in this
8579 case and not in the general case of a mere reference to the type.
8581 The criterion is as follows: if the field can be an expression, it
8582 must be walked only here. This should be in keeping with the fields
8583 that are directly gimplified in gimplify_type_sizes in order for the
8584 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8585 variable-sized types.
8587 Note that DECLs get walked as part of processing the BIND_EXPR. */
8588 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8590 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8591 if (TREE_CODE (*type_p) == ERROR_MARK)
8594 /* Call the function for the type. See if it returns anything or
8595 doesn't want us to continue. If we are to continue, walk both
8596 the normal fields and those for the declaration case. */
8597 result = (*func) (type_p, &walk_subtrees, data);
8598 if (result || !walk_subtrees)
8601 result = walk_type_fields (*type_p, func, data, pset, lh);
8605 /* If this is a record type, also walk the fields. */
8606 if (TREE_CODE (*type_p) == RECORD_TYPE
8607 || TREE_CODE (*type_p) == UNION_TYPE
8608 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8612 for (field = TYPE_FIELDS (*type_p); field;
8613 field = TREE_CHAIN (field))
8615 /* We'd like to look at the type of the field, but we can
8616 easily get infinite recursion. So assume it's pointed
8617 to elsewhere in the tree. Also, ignore things that
8619 if (TREE_CODE (field) != FIELD_DECL)
8622 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8623 WALK_SUBTREE (DECL_SIZE (field));
8624 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8625 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8626 WALK_SUBTREE (DECL_QUALIFIER (field));
8630 /* Same for scalar types. */
8631 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8632 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8633 || TREE_CODE (*type_p) == INTEGER_TYPE
8634 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
8635 || TREE_CODE (*type_p) == REAL_TYPE)
8637 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8638 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8641 WALK_SUBTREE (TYPE_SIZE (*type_p));
8642 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8647 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
8651 /* Walk over all the sub-trees of this operand. */
8652 len = TREE_OPERAND_LENGTH (*tp);
8654 /* Go through the subtrees. We need to do this in forward order so
8655 that the scope of a FOR_EXPR is handled properly. */
8658 for (i = 0; i < len - 1; ++i)
8659 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8660 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
8663 /* If this is a type, walk the needed fields in the type. */
8664 else if (TYPE_P (*tp))
8665 return walk_type_fields (*tp, func, data, pset, lh);
8669 /* We didn't find what we were looking for. */
8672 #undef WALK_SUBTREE_TAIL
8676 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8679 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
8683 struct pointer_set_t *pset;
8685 pset = pointer_set_create ();
8686 result = walk_tree_1 (tp, func, data, pset, lh);
8687 pointer_set_destroy (pset);
8695 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8697 if (IS_EXPR_CODE_CLASS (c))
8698 return &t->exp.block;
8703 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8704 FIXME: don't use this function. It exists for compatibility with
8705 the old representation of CALL_EXPRs where a list was used to hold the
8706 arguments. Places that currently extract the arglist from a CALL_EXPR
8707 ought to be rewritten to use the CALL_EXPR itself. */
8709 call_expr_arglist (tree exp)
8711 tree arglist = NULL_TREE;
8713 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8714 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8719 /* Create a nameless artificial label and put it in the current function
8720 context. Returns the newly created label. */
8723 create_artificial_label (void)
8725 tree lab = build_decl (LABEL_DECL, NULL_TREE, void_type_node);
8727 DECL_ARTIFICIAL (lab) = 1;
8728 DECL_IGNORED_P (lab) = 1;
8729 DECL_CONTEXT (lab) = current_function_decl;
8733 /* Given a tree, try to return a useful variable name that we can use
8734 to prefix a temporary that is being assigned the value of the tree.
8735 I.E. given <temp> = &A, return A. */
8743 STRIP_NOPS (stripped_decl);
8744 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
8745 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
8748 switch (TREE_CODE (stripped_decl))
8751 return get_name (TREE_OPERAND (stripped_decl, 0));
8758 /* Return true if TYPE has a variable argument list. */
8761 stdarg_p (tree fntype)
8763 function_args_iterator args_iter;
8764 tree n = NULL_TREE, t;
8769 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8774 return n != NULL_TREE && n != void_type_node;
8777 /* Return true if TYPE has a prototype. */
8780 prototype_p (tree fntype)
8784 gcc_assert (fntype != NULL_TREE);
8786 t = TYPE_ARG_TYPES (fntype);
8787 return (t != NULL_TREE);
8790 /* Return the number of arguments that a function has. */
8793 function_args_count (tree fntype)
8795 function_args_iterator args_iter;
8801 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8810 /* If BLOCK is inlined from an __attribute__((__artificial__))
8811 routine, return pointer to location from where it has been
8814 block_nonartificial_location (tree block)
8816 location_t *ret = NULL;
8818 while (block && TREE_CODE (block) == BLOCK
8819 && BLOCK_ABSTRACT_ORIGIN (block))
8821 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
8823 while (TREE_CODE (ao) == BLOCK && BLOCK_ABSTRACT_ORIGIN (ao))
8824 ao = BLOCK_ABSTRACT_ORIGIN (ao);
8826 if (TREE_CODE (ao) == FUNCTION_DECL)
8828 /* If AO is an artificial inline, point RET to the
8829 call site locus at which it has been inlined and continue
8830 the loop, in case AO's caller is also an artificial
8832 if (DECL_DECLARED_INLINE_P (ao)
8833 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
8834 ret = &BLOCK_SOURCE_LOCATION (block);
8838 else if (TREE_CODE (ao) != BLOCK)
8841 block = BLOCK_SUPERCONTEXT (block);
8846 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
8849 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
8852 cl_option_hash_hash (const void *x)
8854 const_tree const t = (const_tree) x;
8860 if (TREE_CODE (t) == OPTIMIZATION_NODE)
8862 p = (const char *)TREE_OPTIMIZATION (t);
8863 len = sizeof (struct cl_optimization);
8866 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
8868 p = (const char *)TREE_TARGET_OPTION (t);
8869 len = sizeof (struct cl_target_option);
8875 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
8877 for (i = 0; i < len; i++)
8879 hash = (hash << 4) ^ ((i << 2) | p[i]);
8884 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
8885 TARGET_OPTION tree node) is the same as that given by *Y, which is the
8889 cl_option_hash_eq (const void *x, const void *y)
8891 const_tree const xt = (const_tree) x;
8892 const_tree const yt = (const_tree) y;
8897 if (TREE_CODE (xt) != TREE_CODE (yt))
8900 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
8902 xp = (const char *)TREE_OPTIMIZATION (xt);
8903 yp = (const char *)TREE_OPTIMIZATION (yt);
8904 len = sizeof (struct cl_optimization);
8907 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
8909 xp = (const char *)TREE_TARGET_OPTION (xt);
8910 yp = (const char *)TREE_TARGET_OPTION (yt);
8911 len = sizeof (struct cl_target_option);
8917 return (memcmp (xp, yp, len) == 0);
8920 /* Build an OPTIMIZATION_NODE based on the current options. */
8923 build_optimization_node (void)
8928 /* Use the cache of optimization nodes. */
8930 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
8932 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
8936 /* Insert this one into the hash table. */
8937 t = cl_optimization_node;
8940 /* Make a new node for next time round. */
8941 cl_optimization_node = make_node (OPTIMIZATION_NODE);
8947 /* Build a TARGET_OPTION_NODE based on the current options. */
8950 build_target_option_node (void)
8955 /* Use the cache of optimization nodes. */
8957 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
8959 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
8963 /* Insert this one into the hash table. */
8964 t = cl_target_option_node;
8967 /* Make a new node for next time round. */
8968 cl_target_option_node = make_node (TARGET_OPTION_NODE);
8974 #include "gt-tree.h"