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[] =
112 /* obstack.[ch] explicitly declined to prototype this. */
113 extern int _obstack_allocated_p (struct obstack *h, void *obj);
115 #ifdef GATHER_STATISTICS
116 /* Statistics-gathering stuff. */
118 int tree_node_counts[(int) all_kinds];
119 int tree_node_sizes[(int) all_kinds];
121 /* Keep in sync with tree.h:enum tree_node_kind. */
122 static const char * const tree_node_kind_names[] = {
144 #endif /* GATHER_STATISTICS */
146 /* Unique id for next decl created. */
147 static GTY(()) int next_decl_uid;
148 /* Unique id for next type created. */
149 static GTY(()) int next_type_uid = 1;
151 /* Since we cannot rehash a type after it is in the table, we have to
152 keep the hash code. */
154 struct type_hash GTY(())
160 /* Initial size of the hash table (rounded to next prime). */
161 #define TYPE_HASH_INITIAL_SIZE 1000
163 /* Now here is the hash table. When recording a type, it is added to
164 the slot whose index is the hash code. Note that the hash table is
165 used for several kinds of types (function types, array types and
166 array index range types, for now). While all these live in the
167 same table, they are completely independent, and the hash code is
168 computed differently for each of these. */
170 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
171 htab_t type_hash_table;
173 /* Hash table and temporary node for larger integer const values. */
174 static GTY (()) tree int_cst_node;
175 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
176 htab_t int_cst_hash_table;
178 /* General tree->tree mapping structure for use in hash tables. */
181 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
182 htab_t debug_expr_for_decl;
184 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
185 htab_t value_expr_for_decl;
187 static GTY ((if_marked ("tree_priority_map_marked_p"),
188 param_is (struct tree_priority_map)))
189 htab_t init_priority_for_decl;
191 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
192 htab_t restrict_base_for_decl;
194 static void set_type_quals (tree, int);
195 static int type_hash_eq (const void *, const void *);
196 static hashval_t type_hash_hash (const void *);
197 static hashval_t int_cst_hash_hash (const void *);
198 static int int_cst_hash_eq (const void *, const void *);
199 static void print_type_hash_statistics (void);
200 static void print_debug_expr_statistics (void);
201 static void print_value_expr_statistics (void);
202 static int type_hash_marked_p (const void *);
203 static unsigned int type_hash_list (const_tree, hashval_t);
204 static unsigned int attribute_hash_list (const_tree, hashval_t);
206 tree global_trees[TI_MAX];
207 tree integer_types[itk_none];
209 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
211 /* Number of operands for each OpenMP clause. */
212 unsigned const char omp_clause_num_ops[] =
214 0, /* OMP_CLAUSE_ERROR */
215 1, /* OMP_CLAUSE_PRIVATE */
216 1, /* OMP_CLAUSE_SHARED */
217 1, /* OMP_CLAUSE_FIRSTPRIVATE */
218 2, /* OMP_CLAUSE_LASTPRIVATE */
219 4, /* OMP_CLAUSE_REDUCTION */
220 1, /* OMP_CLAUSE_COPYIN */
221 1, /* OMP_CLAUSE_COPYPRIVATE */
222 1, /* OMP_CLAUSE_IF */
223 1, /* OMP_CLAUSE_NUM_THREADS */
224 1, /* OMP_CLAUSE_SCHEDULE */
225 0, /* OMP_CLAUSE_NOWAIT */
226 0, /* OMP_CLAUSE_ORDERED */
227 0, /* OMP_CLAUSE_DEFAULT */
228 3, /* OMP_CLAUSE_COLLAPSE */
229 0 /* OMP_CLAUSE_UNTIED */
232 const char * const omp_clause_code_name[] =
257 /* Initialize the hash table of types. */
258 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
261 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
264 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
266 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
267 tree_priority_map_eq, 0);
268 restrict_base_for_decl = htab_create_ggc (256, tree_map_hash,
271 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
272 int_cst_hash_eq, NULL);
274 int_cst_node = make_node (INTEGER_CST);
276 tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON] = 1;
277 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON] = 1;
278 tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON] = 1;
281 tree_contains_struct[CONST_DECL][TS_DECL_COMMON] = 1;
282 tree_contains_struct[VAR_DECL][TS_DECL_COMMON] = 1;
283 tree_contains_struct[PARM_DECL][TS_DECL_COMMON] = 1;
284 tree_contains_struct[RESULT_DECL][TS_DECL_COMMON] = 1;
285 tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON] = 1;
286 tree_contains_struct[TYPE_DECL][TS_DECL_COMMON] = 1;
287 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON] = 1;
288 tree_contains_struct[LABEL_DECL][TS_DECL_COMMON] = 1;
289 tree_contains_struct[FIELD_DECL][TS_DECL_COMMON] = 1;
292 tree_contains_struct[CONST_DECL][TS_DECL_WRTL] = 1;
293 tree_contains_struct[VAR_DECL][TS_DECL_WRTL] = 1;
294 tree_contains_struct[PARM_DECL][TS_DECL_WRTL] = 1;
295 tree_contains_struct[RESULT_DECL][TS_DECL_WRTL] = 1;
296 tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL] = 1;
297 tree_contains_struct[LABEL_DECL][TS_DECL_WRTL] = 1;
299 tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL] = 1;
300 tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL] = 1;
301 tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL] = 1;
302 tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL] = 1;
303 tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL] = 1;
304 tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL] = 1;
305 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL] = 1;
306 tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL] = 1;
307 tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL] = 1;
308 tree_contains_struct[NAME_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
309 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_DECL_MINIMAL] = 1;
310 tree_contains_struct[MEMORY_PARTITION_TAG][TS_DECL_MINIMAL] = 1;
312 tree_contains_struct[NAME_MEMORY_TAG][TS_MEMORY_TAG] = 1;
313 tree_contains_struct[SYMBOL_MEMORY_TAG][TS_MEMORY_TAG] = 1;
314 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_TAG] = 1;
316 tree_contains_struct[MEMORY_PARTITION_TAG][TS_MEMORY_PARTITION_TAG] = 1;
318 tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS] = 1;
319 tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS] = 1;
320 tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS] = 1;
321 tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS] = 1;
323 tree_contains_struct[VAR_DECL][TS_VAR_DECL] = 1;
324 tree_contains_struct[FIELD_DECL][TS_FIELD_DECL] = 1;
325 tree_contains_struct[PARM_DECL][TS_PARM_DECL] = 1;
326 tree_contains_struct[LABEL_DECL][TS_LABEL_DECL] = 1;
327 tree_contains_struct[RESULT_DECL][TS_RESULT_DECL] = 1;
328 tree_contains_struct[CONST_DECL][TS_CONST_DECL] = 1;
329 tree_contains_struct[TYPE_DECL][TS_TYPE_DECL] = 1;
330 tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL] = 1;
332 lang_hooks.init_ts ();
336 /* The name of the object as the assembler will see it (but before any
337 translations made by ASM_OUTPUT_LABELREF). Often this is the same
338 as DECL_NAME. It is an IDENTIFIER_NODE. */
340 decl_assembler_name (tree decl)
342 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
343 lang_hooks.set_decl_assembler_name (decl);
344 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
347 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
350 decl_assembler_name_equal (tree decl, tree asmname)
352 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
354 if (decl_asmname == asmname)
357 /* If the target assembler name was set by the user, things are trickier.
358 We have a leading '*' to begin with. After that, it's arguable what
359 is the correct thing to do with -fleading-underscore. Arguably, we've
360 historically been doing the wrong thing in assemble_alias by always
361 printing the leading underscore. Since we're not changing that, make
362 sure user_label_prefix follows the '*' before matching. */
363 if (IDENTIFIER_POINTER (decl_asmname)[0] == '*')
365 const char *decl_str = IDENTIFIER_POINTER (decl_asmname) + 1;
366 size_t ulp_len = strlen (user_label_prefix);
370 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
375 return strcmp (decl_str, IDENTIFIER_POINTER (asmname)) == 0;
381 /* Compute the number of bytes occupied by a tree with code CODE.
382 This function cannot be used for nodes that have variable sizes,
383 including TREE_VEC, PHI_NODE, STRING_CST, and CALL_EXPR. */
385 tree_code_size (enum tree_code code)
387 switch (TREE_CODE_CLASS (code))
389 case tcc_declaration: /* A decl node */
394 return sizeof (struct tree_field_decl);
396 return sizeof (struct tree_parm_decl);
398 return sizeof (struct tree_var_decl);
400 return sizeof (struct tree_label_decl);
402 return sizeof (struct tree_result_decl);
404 return sizeof (struct tree_const_decl);
406 return sizeof (struct tree_type_decl);
408 return sizeof (struct tree_function_decl);
409 case NAME_MEMORY_TAG:
410 case SYMBOL_MEMORY_TAG:
411 return sizeof (struct tree_memory_tag);
412 case MEMORY_PARTITION_TAG:
413 return sizeof (struct tree_memory_partition_tag);
415 return sizeof (struct tree_decl_non_common);
419 case tcc_type: /* a type node */
420 return sizeof (struct tree_type);
422 case tcc_reference: /* a reference */
423 case tcc_expression: /* an expression */
424 case tcc_statement: /* an expression with side effects */
425 case tcc_comparison: /* a comparison expression */
426 case tcc_unary: /* a unary arithmetic expression */
427 case tcc_binary: /* a binary arithmetic expression */
428 return (sizeof (struct tree_exp)
429 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
431 case tcc_gimple_stmt:
432 return (sizeof (struct gimple_stmt)
433 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
435 case tcc_constant: /* a constant */
438 case INTEGER_CST: return sizeof (struct tree_int_cst);
439 case REAL_CST: return sizeof (struct tree_real_cst);
440 case FIXED_CST: return sizeof (struct tree_fixed_cst);
441 case COMPLEX_CST: return sizeof (struct tree_complex);
442 case VECTOR_CST: return sizeof (struct tree_vector);
443 case STRING_CST: gcc_unreachable ();
445 return lang_hooks.tree_size (code);
448 case tcc_exceptional: /* something random, like an identifier. */
451 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
452 case TREE_LIST: return sizeof (struct tree_list);
455 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
459 case PHI_NODE: gcc_unreachable ();
461 case SSA_NAME: return sizeof (struct tree_ssa_name);
463 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
464 case BLOCK: return sizeof (struct tree_block);
465 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
466 case CONSTRUCTOR: return sizeof (struct tree_constructor);
469 return lang_hooks.tree_size (code);
477 /* Compute the number of bytes occupied by NODE. This routine only
478 looks at TREE_CODE, except for those nodes that have variable sizes. */
480 tree_size (const_tree node)
482 const enum tree_code code = TREE_CODE (node);
486 return (sizeof (struct tree_phi_node)
487 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
490 return (offsetof (struct tree_binfo, base_binfos)
491 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
494 return (sizeof (struct tree_vec)
495 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
498 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
501 return (sizeof (struct tree_omp_clause)
502 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
506 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
507 return (sizeof (struct tree_exp)
508 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
510 return tree_code_size (code);
514 /* Return a newly allocated node of code CODE. For decl and type
515 nodes, some other fields are initialized. The rest of the node is
516 initialized to zero. This function cannot be used for PHI_NODE,
517 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
520 Achoo! I got a code in the node. */
523 make_node_stat (enum tree_code code MEM_STAT_DECL)
526 enum tree_code_class type = TREE_CODE_CLASS (code);
527 size_t length = tree_code_size (code);
528 #ifdef GATHER_STATISTICS
533 case tcc_declaration: /* A decl node */
537 case tcc_type: /* a type node */
541 case tcc_statement: /* an expression with side effects */
545 case tcc_reference: /* a reference */
549 case tcc_expression: /* an expression */
550 case tcc_comparison: /* a comparison expression */
551 case tcc_unary: /* a unary arithmetic expression */
552 case tcc_binary: /* a binary arithmetic expression */
556 case tcc_constant: /* a constant */
560 case tcc_gimple_stmt:
561 kind = gimple_stmt_kind;
564 case tcc_exceptional: /* something random, like an identifier. */
567 case IDENTIFIER_NODE:
584 kind = ssa_name_kind;
605 tree_node_counts[(int) kind]++;
606 tree_node_sizes[(int) kind] += length;
609 if (code == IDENTIFIER_NODE)
610 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
612 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
614 memset (t, 0, length);
616 TREE_SET_CODE (t, code);
621 TREE_SIDE_EFFECTS (t) = 1;
624 case tcc_declaration:
625 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
626 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
627 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
629 if (code == FUNCTION_DECL)
631 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
632 DECL_MODE (t) = FUNCTION_MODE;
636 /* We have not yet computed the alias set for this declaration. */
637 DECL_POINTER_ALIAS_SET (t) = -1;
639 DECL_SOURCE_LOCATION (t) = input_location;
640 DECL_UID (t) = next_decl_uid++;
645 TYPE_UID (t) = next_type_uid++;
646 TYPE_ALIGN (t) = BITS_PER_UNIT;
647 TYPE_USER_ALIGN (t) = 0;
648 TYPE_MAIN_VARIANT (t) = t;
649 TYPE_CANONICAL (t) = t;
651 /* Default to no attributes for type, but let target change that. */
652 TYPE_ATTRIBUTES (t) = NULL_TREE;
653 targetm.set_default_type_attributes (t);
655 /* We have not yet computed the alias set for this type. */
656 TYPE_ALIAS_SET (t) = -1;
660 TREE_CONSTANT (t) = 1;
669 case PREDECREMENT_EXPR:
670 case PREINCREMENT_EXPR:
671 case POSTDECREMENT_EXPR:
672 case POSTINCREMENT_EXPR:
673 /* All of these have side-effects, no matter what their
675 TREE_SIDE_EFFECTS (t) = 1;
683 case tcc_gimple_stmt:
686 case GIMPLE_MODIFY_STMT:
687 TREE_SIDE_EFFECTS (t) = 1;
695 /* Other classes need no special treatment. */
702 /* Return a new node with the same contents as NODE except that its
703 TREE_CHAIN is zero and it has a fresh uid. */
706 copy_node_stat (tree node MEM_STAT_DECL)
709 enum tree_code code = TREE_CODE (node);
712 gcc_assert (code != STATEMENT_LIST);
714 length = tree_size (node);
715 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
716 memcpy (t, node, length);
718 if (!GIMPLE_TUPLE_P (node))
720 TREE_ASM_WRITTEN (t) = 0;
721 TREE_VISITED (t) = 0;
724 if (TREE_CODE_CLASS (code) == tcc_declaration)
726 DECL_UID (t) = next_decl_uid++;
727 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
728 && DECL_HAS_VALUE_EXPR_P (node))
730 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
731 DECL_HAS_VALUE_EXPR_P (t) = 1;
733 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
735 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
736 DECL_HAS_INIT_PRIORITY_P (t) = 1;
738 if (TREE_CODE (node) == VAR_DECL && DECL_BASED_ON_RESTRICT_P (node))
740 SET_DECL_RESTRICT_BASE (t, DECL_GET_RESTRICT_BASE (node));
741 DECL_BASED_ON_RESTRICT_P (t) = 1;
744 else if (TREE_CODE_CLASS (code) == tcc_type)
746 TYPE_UID (t) = next_type_uid++;
747 /* The following is so that the debug code for
748 the copy is different from the original type.
749 The two statements usually duplicate each other
750 (because they clear fields of the same union),
751 but the optimizer should catch that. */
752 TYPE_SYMTAB_POINTER (t) = 0;
753 TYPE_SYMTAB_ADDRESS (t) = 0;
755 /* Do not copy the values cache. */
756 if (TYPE_CACHED_VALUES_P(t))
758 TYPE_CACHED_VALUES_P (t) = 0;
759 TYPE_CACHED_VALUES (t) = NULL_TREE;
766 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
767 For example, this can copy a list made of TREE_LIST nodes. */
770 copy_list (tree list)
778 head = prev = copy_node (list);
779 next = TREE_CHAIN (list);
782 TREE_CHAIN (prev) = copy_node (next);
783 prev = TREE_CHAIN (prev);
784 next = TREE_CHAIN (next);
790 /* Create an INT_CST node with a LOW value sign extended. */
793 build_int_cst (tree type, HOST_WIDE_INT low)
795 /* Support legacy code. */
797 type = integer_type_node;
799 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
802 /* Create an INT_CST node with a LOW value zero extended. */
805 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
807 return build_int_cst_wide (type, low, 0);
810 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
811 if it is negative. This function is similar to build_int_cst, but
812 the extra bits outside of the type precision are cleared. Constants
813 with these extra bits may confuse the fold so that it detects overflows
814 even in cases when they do not occur, and in general should be avoided.
815 We cannot however make this a default behavior of build_int_cst without
816 more intrusive changes, since there are parts of gcc that rely on the extra
817 precision of the integer constants. */
820 build_int_cst_type (tree type, HOST_WIDE_INT low)
822 unsigned HOST_WIDE_INT low1;
827 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
829 return build_int_cst_wide (type, low1, hi);
832 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
833 and sign extended according to the value range of TYPE. */
836 build_int_cst_wide_type (tree type,
837 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
839 fit_double_type (low, high, &low, &high, type);
840 return build_int_cst_wide (type, low, high);
843 /* These are the hash table functions for the hash table of INTEGER_CST
844 nodes of a sizetype. */
846 /* Return the hash code code X, an INTEGER_CST. */
849 int_cst_hash_hash (const void *x)
851 const_tree const t = (const_tree) x;
853 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
854 ^ htab_hash_pointer (TREE_TYPE (t)));
857 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
858 is the same as that given by *Y, which is the same. */
861 int_cst_hash_eq (const void *x, const void *y)
863 const_tree const xt = (const_tree) x;
864 const_tree const yt = (const_tree) y;
866 return (TREE_TYPE (xt) == TREE_TYPE (yt)
867 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
868 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
871 /* Create an INT_CST node of TYPE and value HI:LOW.
872 The returned node is always shared. For small integers we use a
873 per-type vector cache, for larger ones we use a single hash table. */
876 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
884 switch (TREE_CODE (type))
888 /* Cache NULL pointer. */
897 /* Cache false or true. */
905 if (TYPE_UNSIGNED (type))
908 limit = INTEGER_SHARE_LIMIT;
909 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
915 limit = INTEGER_SHARE_LIMIT + 1;
916 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
918 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
932 /* Look for it in the type's vector of small shared ints. */
933 if (!TYPE_CACHED_VALUES_P (type))
935 TYPE_CACHED_VALUES_P (type) = 1;
936 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
939 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
942 /* Make sure no one is clobbering the shared constant. */
943 gcc_assert (TREE_TYPE (t) == type);
944 gcc_assert (TREE_INT_CST_LOW (t) == low);
945 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
949 /* Create a new shared int. */
950 t = make_node (INTEGER_CST);
952 TREE_INT_CST_LOW (t) = low;
953 TREE_INT_CST_HIGH (t) = hi;
954 TREE_TYPE (t) = type;
956 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
961 /* Use the cache of larger shared ints. */
964 TREE_INT_CST_LOW (int_cst_node) = low;
965 TREE_INT_CST_HIGH (int_cst_node) = hi;
966 TREE_TYPE (int_cst_node) = type;
968 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
972 /* Insert this one into the hash table. */
975 /* Make a new node for next time round. */
976 int_cst_node = make_node (INTEGER_CST);
983 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
984 and the rest are zeros. */
987 build_low_bits_mask (tree type, unsigned bits)
989 unsigned HOST_WIDE_INT low;
991 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
993 gcc_assert (bits <= TYPE_PRECISION (type));
995 if (bits == TYPE_PRECISION (type)
996 && !TYPE_UNSIGNED (type))
998 /* Sign extended all-ones mask. */
1002 else if (bits <= HOST_BITS_PER_WIDE_INT)
1004 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1009 bits -= HOST_BITS_PER_WIDE_INT;
1011 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1014 return build_int_cst_wide (type, low, high);
1017 /* Checks that X is integer constant that can be expressed in (unsigned)
1018 HOST_WIDE_INT without loss of precision. */
1021 cst_and_fits_in_hwi (const_tree x)
1023 if (TREE_CODE (x) != INTEGER_CST)
1026 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1029 return (TREE_INT_CST_HIGH (x) == 0
1030 || TREE_INT_CST_HIGH (x) == -1);
1033 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1034 are in a list pointed to by VALS. */
1037 build_vector (tree type, tree vals)
1039 tree v = make_node (VECTOR_CST);
1043 TREE_VECTOR_CST_ELTS (v) = vals;
1044 TREE_TYPE (v) = type;
1046 /* Iterate through elements and check for overflow. */
1047 for (link = vals; link; link = TREE_CHAIN (link))
1049 tree value = TREE_VALUE (link);
1051 /* Don't crash if we get an address constant. */
1052 if (!CONSTANT_CLASS_P (value))
1055 over |= TREE_OVERFLOW (value);
1058 TREE_OVERFLOW (v) = over;
1062 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1063 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1066 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1068 tree list = NULL_TREE;
1069 unsigned HOST_WIDE_INT idx;
1072 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1073 list = tree_cons (NULL_TREE, value, list);
1074 return build_vector (type, nreverse (list));
1077 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1078 are in the VEC pointed to by VALS. */
1080 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1082 tree c = make_node (CONSTRUCTOR);
1083 TREE_TYPE (c) = type;
1084 CONSTRUCTOR_ELTS (c) = vals;
1088 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1091 build_constructor_single (tree type, tree index, tree value)
1093 VEC(constructor_elt,gc) *v;
1094 constructor_elt *elt;
1097 v = VEC_alloc (constructor_elt, gc, 1);
1098 elt = VEC_quick_push (constructor_elt, v, NULL);
1102 t = build_constructor (type, v);
1103 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1108 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1109 are in a list pointed to by VALS. */
1111 build_constructor_from_list (tree type, tree vals)
1114 VEC(constructor_elt,gc) *v = NULL;
1115 bool constant_p = true;
1119 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1120 for (t = vals; t; t = TREE_CHAIN (t))
1122 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1123 val = TREE_VALUE (t);
1124 elt->index = TREE_PURPOSE (t);
1126 if (!TREE_CONSTANT (val))
1131 t = build_constructor (type, v);
1132 TREE_CONSTANT (t) = constant_p;
1136 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1139 build_fixed (tree type, FIXED_VALUE_TYPE f)
1142 FIXED_VALUE_TYPE *fp;
1144 v = make_node (FIXED_CST);
1145 fp = GGC_NEW (FIXED_VALUE_TYPE);
1146 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1148 TREE_TYPE (v) = type;
1149 TREE_FIXED_CST_PTR (v) = fp;
1153 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1156 build_real (tree type, REAL_VALUE_TYPE d)
1159 REAL_VALUE_TYPE *dp;
1162 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1163 Consider doing it via real_convert now. */
1165 v = make_node (REAL_CST);
1166 dp = GGC_NEW (REAL_VALUE_TYPE);
1167 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1169 TREE_TYPE (v) = type;
1170 TREE_REAL_CST_PTR (v) = dp;
1171 TREE_OVERFLOW (v) = overflow;
1175 /* Return a new REAL_CST node whose type is TYPE
1176 and whose value is the integer value of the INTEGER_CST node I. */
1179 real_value_from_int_cst (const_tree type, const_tree i)
1183 /* Clear all bits of the real value type so that we can later do
1184 bitwise comparisons to see if two values are the same. */
1185 memset (&d, 0, sizeof d);
1187 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1188 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1189 TYPE_UNSIGNED (TREE_TYPE (i)));
1193 /* Given a tree representing an integer constant I, return a tree
1194 representing the same value as a floating-point constant of type TYPE. */
1197 build_real_from_int_cst (tree type, const_tree i)
1200 int overflow = TREE_OVERFLOW (i);
1202 v = build_real (type, real_value_from_int_cst (type, i));
1204 TREE_OVERFLOW (v) |= overflow;
1208 /* Return a newly constructed STRING_CST node whose value is
1209 the LEN characters at STR.
1210 The TREE_TYPE is not initialized. */
1213 build_string (int len, const char *str)
1218 /* Do not waste bytes provided by padding of struct tree_string. */
1219 length = len + offsetof (struct tree_string, str) + 1;
1221 #ifdef GATHER_STATISTICS
1222 tree_node_counts[(int) c_kind]++;
1223 tree_node_sizes[(int) c_kind] += length;
1226 s = ggc_alloc_tree (length);
1228 memset (s, 0, sizeof (struct tree_common));
1229 TREE_SET_CODE (s, STRING_CST);
1230 TREE_CONSTANT (s) = 1;
1231 TREE_STRING_LENGTH (s) = len;
1232 memcpy (s->string.str, str, len);
1233 s->string.str[len] = '\0';
1238 /* Return a newly constructed COMPLEX_CST node whose value is
1239 specified by the real and imaginary parts REAL and IMAG.
1240 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1241 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1244 build_complex (tree type, tree real, tree imag)
1246 tree t = make_node (COMPLEX_CST);
1248 TREE_REALPART (t) = real;
1249 TREE_IMAGPART (t) = imag;
1250 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1251 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1255 /* Return a constant of arithmetic type TYPE which is the
1256 multiplicative identity of the set TYPE. */
1259 build_one_cst (tree type)
1261 switch (TREE_CODE (type))
1263 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1264 case POINTER_TYPE: case REFERENCE_TYPE:
1266 return build_int_cst (type, 1);
1269 return build_real (type, dconst1);
1271 case FIXED_POINT_TYPE:
1272 /* We can only generate 1 for accum types. */
1273 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1274 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1281 scalar = build_one_cst (TREE_TYPE (type));
1283 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1285 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1286 cst = tree_cons (NULL_TREE, scalar, cst);
1288 return build_vector (type, cst);
1292 return build_complex (type,
1293 build_one_cst (TREE_TYPE (type)),
1294 fold_convert (TREE_TYPE (type), integer_zero_node));
1301 /* Build a BINFO with LEN language slots. */
1304 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1307 size_t length = (offsetof (struct tree_binfo, base_binfos)
1308 + VEC_embedded_size (tree, base_binfos));
1310 #ifdef GATHER_STATISTICS
1311 tree_node_counts[(int) binfo_kind]++;
1312 tree_node_sizes[(int) binfo_kind] += length;
1315 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1317 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1319 TREE_SET_CODE (t, TREE_BINFO);
1321 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1327 /* Build a newly constructed TREE_VEC node of length LEN. */
1330 make_tree_vec_stat (int len MEM_STAT_DECL)
1333 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1335 #ifdef GATHER_STATISTICS
1336 tree_node_counts[(int) vec_kind]++;
1337 tree_node_sizes[(int) vec_kind] += length;
1340 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1342 memset (t, 0, length);
1344 TREE_SET_CODE (t, TREE_VEC);
1345 TREE_VEC_LENGTH (t) = len;
1350 /* Return 1 if EXPR is the integer constant zero or a complex constant
1354 integer_zerop (const_tree expr)
1358 return ((TREE_CODE (expr) == INTEGER_CST
1359 && TREE_INT_CST_LOW (expr) == 0
1360 && TREE_INT_CST_HIGH (expr) == 0)
1361 || (TREE_CODE (expr) == COMPLEX_CST
1362 && integer_zerop (TREE_REALPART (expr))
1363 && integer_zerop (TREE_IMAGPART (expr))));
1366 /* Return 1 if EXPR is the integer constant one or the corresponding
1367 complex constant. */
1370 integer_onep (const_tree expr)
1374 return ((TREE_CODE (expr) == INTEGER_CST
1375 && TREE_INT_CST_LOW (expr) == 1
1376 && TREE_INT_CST_HIGH (expr) == 0)
1377 || (TREE_CODE (expr) == COMPLEX_CST
1378 && integer_onep (TREE_REALPART (expr))
1379 && integer_zerop (TREE_IMAGPART (expr))));
1382 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1383 it contains. Likewise for the corresponding complex constant. */
1386 integer_all_onesp (const_tree expr)
1393 if (TREE_CODE (expr) == COMPLEX_CST
1394 && integer_all_onesp (TREE_REALPART (expr))
1395 && integer_zerop (TREE_IMAGPART (expr)))
1398 else if (TREE_CODE (expr) != INTEGER_CST)
1401 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1402 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1403 && TREE_INT_CST_HIGH (expr) == -1)
1408 /* Note that using TYPE_PRECISION here is wrong. We care about the
1409 actual bits, not the (arbitrary) range of the type. */
1410 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1411 if (prec >= HOST_BITS_PER_WIDE_INT)
1413 HOST_WIDE_INT high_value;
1416 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1418 /* Can not handle precisions greater than twice the host int size. */
1419 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1420 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1421 /* Shifting by the host word size is undefined according to the ANSI
1422 standard, so we must handle this as a special case. */
1425 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1427 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1428 && TREE_INT_CST_HIGH (expr) == high_value);
1431 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1434 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1438 integer_pow2p (const_tree expr)
1441 HOST_WIDE_INT high, low;
1445 if (TREE_CODE (expr) == COMPLEX_CST
1446 && integer_pow2p (TREE_REALPART (expr))
1447 && integer_zerop (TREE_IMAGPART (expr)))
1450 if (TREE_CODE (expr) != INTEGER_CST)
1453 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1454 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1455 high = TREE_INT_CST_HIGH (expr);
1456 low = TREE_INT_CST_LOW (expr);
1458 /* First clear all bits that are beyond the type's precision in case
1459 we've been sign extended. */
1461 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1463 else if (prec > HOST_BITS_PER_WIDE_INT)
1464 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1468 if (prec < HOST_BITS_PER_WIDE_INT)
1469 low &= ~((HOST_WIDE_INT) (-1) << prec);
1472 if (high == 0 && low == 0)
1475 return ((high == 0 && (low & (low - 1)) == 0)
1476 || (low == 0 && (high & (high - 1)) == 0));
1479 /* Return 1 if EXPR is an integer constant other than zero or a
1480 complex constant other than zero. */
1483 integer_nonzerop (const_tree expr)
1487 return ((TREE_CODE (expr) == INTEGER_CST
1488 && (TREE_INT_CST_LOW (expr) != 0
1489 || TREE_INT_CST_HIGH (expr) != 0))
1490 || (TREE_CODE (expr) == COMPLEX_CST
1491 && (integer_nonzerop (TREE_REALPART (expr))
1492 || integer_nonzerop (TREE_IMAGPART (expr)))));
1495 /* Return 1 if EXPR is the fixed-point constant zero. */
1498 fixed_zerop (const_tree expr)
1500 return (TREE_CODE (expr) == FIXED_CST
1501 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1504 /* Return the power of two represented by a tree node known to be a
1508 tree_log2 (const_tree expr)
1511 HOST_WIDE_INT high, low;
1515 if (TREE_CODE (expr) == COMPLEX_CST)
1516 return tree_log2 (TREE_REALPART (expr));
1518 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1519 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1521 high = TREE_INT_CST_HIGH (expr);
1522 low = TREE_INT_CST_LOW (expr);
1524 /* First clear all bits that are beyond the type's precision in case
1525 we've been sign extended. */
1527 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1529 else if (prec > HOST_BITS_PER_WIDE_INT)
1530 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1534 if (prec < HOST_BITS_PER_WIDE_INT)
1535 low &= ~((HOST_WIDE_INT) (-1) << prec);
1538 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1539 : exact_log2 (low));
1542 /* Similar, but return the largest integer Y such that 2 ** Y is less
1543 than or equal to EXPR. */
1546 tree_floor_log2 (const_tree expr)
1549 HOST_WIDE_INT high, low;
1553 if (TREE_CODE (expr) == COMPLEX_CST)
1554 return tree_log2 (TREE_REALPART (expr));
1556 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1557 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1559 high = TREE_INT_CST_HIGH (expr);
1560 low = TREE_INT_CST_LOW (expr);
1562 /* First clear all bits that are beyond the type's precision in case
1563 we've been sign extended. Ignore if type's precision hasn't been set
1564 since what we are doing is setting it. */
1566 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1568 else if (prec > HOST_BITS_PER_WIDE_INT)
1569 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1573 if (prec < HOST_BITS_PER_WIDE_INT)
1574 low &= ~((HOST_WIDE_INT) (-1) << prec);
1577 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1578 : floor_log2 (low));
1581 /* Return 1 if EXPR is the real constant zero. */
1584 real_zerop (const_tree expr)
1588 return ((TREE_CODE (expr) == REAL_CST
1589 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1590 || (TREE_CODE (expr) == COMPLEX_CST
1591 && real_zerop (TREE_REALPART (expr))
1592 && real_zerop (TREE_IMAGPART (expr))));
1595 /* Return 1 if EXPR is the real constant one in real or complex form. */
1598 real_onep (const_tree expr)
1602 return ((TREE_CODE (expr) == REAL_CST
1603 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1604 || (TREE_CODE (expr) == COMPLEX_CST
1605 && real_onep (TREE_REALPART (expr))
1606 && real_zerop (TREE_IMAGPART (expr))));
1609 /* Return 1 if EXPR is the real constant two. */
1612 real_twop (const_tree expr)
1616 return ((TREE_CODE (expr) == REAL_CST
1617 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1618 || (TREE_CODE (expr) == COMPLEX_CST
1619 && real_twop (TREE_REALPART (expr))
1620 && real_zerop (TREE_IMAGPART (expr))));
1623 /* Return 1 if EXPR is the real constant minus one. */
1626 real_minus_onep (const_tree expr)
1630 return ((TREE_CODE (expr) == REAL_CST
1631 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1632 || (TREE_CODE (expr) == COMPLEX_CST
1633 && real_minus_onep (TREE_REALPART (expr))
1634 && real_zerop (TREE_IMAGPART (expr))));
1637 /* Nonzero if EXP is a constant or a cast of a constant. */
1640 really_constant_p (const_tree exp)
1642 /* This is not quite the same as STRIP_NOPS. It does more. */
1643 while (CONVERT_EXPR_P (exp)
1644 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1645 exp = TREE_OPERAND (exp, 0);
1646 return TREE_CONSTANT (exp);
1649 /* Return first list element whose TREE_VALUE is ELEM.
1650 Return 0 if ELEM is not in LIST. */
1653 value_member (tree elem, tree list)
1657 if (elem == TREE_VALUE (list))
1659 list = TREE_CHAIN (list);
1664 /* Return first list element whose TREE_PURPOSE is ELEM.
1665 Return 0 if ELEM is not in LIST. */
1668 purpose_member (const_tree elem, tree list)
1672 if (elem == TREE_PURPOSE (list))
1674 list = TREE_CHAIN (list);
1679 /* Return nonzero if ELEM is part of the chain CHAIN. */
1682 chain_member (const_tree elem, const_tree chain)
1688 chain = TREE_CHAIN (chain);
1694 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1695 We expect a null pointer to mark the end of the chain.
1696 This is the Lisp primitive `length'. */
1699 list_length (const_tree t)
1702 #ifdef ENABLE_TREE_CHECKING
1710 #ifdef ENABLE_TREE_CHECKING
1713 gcc_assert (p != q);
1721 /* Returns the number of FIELD_DECLs in TYPE. */
1724 fields_length (const_tree type)
1726 tree t = TYPE_FIELDS (type);
1729 for (; t; t = TREE_CHAIN (t))
1730 if (TREE_CODE (t) == FIELD_DECL)
1736 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1737 by modifying the last node in chain 1 to point to chain 2.
1738 This is the Lisp primitive `nconc'. */
1741 chainon (tree op1, tree op2)
1750 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1752 TREE_CHAIN (t1) = op2;
1754 #ifdef ENABLE_TREE_CHECKING
1757 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1758 gcc_assert (t2 != t1);
1765 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1768 tree_last (tree chain)
1772 while ((next = TREE_CHAIN (chain)))
1777 /* Reverse the order of elements in the chain T,
1778 and return the new head of the chain (old last element). */
1783 tree prev = 0, decl, next;
1784 for (decl = t; decl; decl = next)
1786 next = TREE_CHAIN (decl);
1787 TREE_CHAIN (decl) = prev;
1793 /* Return a newly created TREE_LIST node whose
1794 purpose and value fields are PARM and VALUE. */
1797 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1799 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1800 TREE_PURPOSE (t) = parm;
1801 TREE_VALUE (t) = value;
1805 /* Return a newly created TREE_LIST node whose
1806 purpose and value fields are PURPOSE and VALUE
1807 and whose TREE_CHAIN is CHAIN. */
1810 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1814 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
1816 memset (node, 0, sizeof (struct tree_common));
1818 #ifdef GATHER_STATISTICS
1819 tree_node_counts[(int) x_kind]++;
1820 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1823 TREE_SET_CODE (node, TREE_LIST);
1824 TREE_CHAIN (node) = chain;
1825 TREE_PURPOSE (node) = purpose;
1826 TREE_VALUE (node) = value;
1831 /* Return the size nominally occupied by an object of type TYPE
1832 when it resides in memory. The value is measured in units of bytes,
1833 and its data type is that normally used for type sizes
1834 (which is the first type created by make_signed_type or
1835 make_unsigned_type). */
1838 size_in_bytes (const_tree type)
1842 if (type == error_mark_node)
1843 return integer_zero_node;
1845 type = TYPE_MAIN_VARIANT (type);
1846 t = TYPE_SIZE_UNIT (type);
1850 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1851 return size_zero_node;
1857 /* Return the size of TYPE (in bytes) as a wide integer
1858 or return -1 if the size can vary or is larger than an integer. */
1861 int_size_in_bytes (const_tree type)
1865 if (type == error_mark_node)
1868 type = TYPE_MAIN_VARIANT (type);
1869 t = TYPE_SIZE_UNIT (type);
1871 || TREE_CODE (t) != INTEGER_CST
1872 || TREE_INT_CST_HIGH (t) != 0
1873 /* If the result would appear negative, it's too big to represent. */
1874 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1877 return TREE_INT_CST_LOW (t);
1880 /* Return the maximum size of TYPE (in bytes) as a wide integer
1881 or return -1 if the size can vary or is larger than an integer. */
1884 max_int_size_in_bytes (const_tree type)
1886 HOST_WIDE_INT size = -1;
1889 /* If this is an array type, check for a possible MAX_SIZE attached. */
1891 if (TREE_CODE (type) == ARRAY_TYPE)
1893 size_tree = TYPE_ARRAY_MAX_SIZE (type);
1895 if (size_tree && host_integerp (size_tree, 1))
1896 size = tree_low_cst (size_tree, 1);
1899 /* If we still haven't been able to get a size, see if the language
1900 can compute a maximum size. */
1904 size_tree = lang_hooks.types.max_size (type);
1906 if (size_tree && host_integerp (size_tree, 1))
1907 size = tree_low_cst (size_tree, 1);
1913 /* Return the bit position of FIELD, in bits from the start of the record.
1914 This is a tree of type bitsizetype. */
1917 bit_position (const_tree field)
1919 return bit_from_pos (DECL_FIELD_OFFSET (field),
1920 DECL_FIELD_BIT_OFFSET (field));
1923 /* Likewise, but return as an integer. It must be representable in
1924 that way (since it could be a signed value, we don't have the
1925 option of returning -1 like int_size_in_byte can. */
1928 int_bit_position (const_tree field)
1930 return tree_low_cst (bit_position (field), 0);
1933 /* Return the byte position of FIELD, in bytes from the start of the record.
1934 This is a tree of type sizetype. */
1937 byte_position (const_tree field)
1939 return byte_from_pos (DECL_FIELD_OFFSET (field),
1940 DECL_FIELD_BIT_OFFSET (field));
1943 /* Likewise, but return as an integer. It must be representable in
1944 that way (since it could be a signed value, we don't have the
1945 option of returning -1 like int_size_in_byte can. */
1948 int_byte_position (const_tree field)
1950 return tree_low_cst (byte_position (field), 0);
1953 /* Return the strictest alignment, in bits, that T is known to have. */
1956 expr_align (const_tree t)
1958 unsigned int align0, align1;
1960 switch (TREE_CODE (t))
1962 CASE_CONVERT: case NON_LVALUE_EXPR:
1963 /* If we have conversions, we know that the alignment of the
1964 object must meet each of the alignments of the types. */
1965 align0 = expr_align (TREE_OPERAND (t, 0));
1966 align1 = TYPE_ALIGN (TREE_TYPE (t));
1967 return MAX (align0, align1);
1969 case GIMPLE_MODIFY_STMT:
1970 /* We should never ask for the alignment of a gimple statement. */
1973 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1974 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1975 case CLEANUP_POINT_EXPR:
1976 /* These don't change the alignment of an object. */
1977 return expr_align (TREE_OPERAND (t, 0));
1980 /* The best we can do is say that the alignment is the least aligned
1982 align0 = expr_align (TREE_OPERAND (t, 1));
1983 align1 = expr_align (TREE_OPERAND (t, 2));
1984 return MIN (align0, align1);
1986 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
1987 meaningfully, it's always 1. */
1988 case LABEL_DECL: case CONST_DECL:
1989 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1991 gcc_assert (DECL_ALIGN (t) != 0);
1992 return DECL_ALIGN (t);
1998 /* Otherwise take the alignment from that of the type. */
1999 return TYPE_ALIGN (TREE_TYPE (t));
2002 /* Return, as a tree node, the number of elements for TYPE (which is an
2003 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2006 array_type_nelts (const_tree type)
2008 tree index_type, min, max;
2010 /* If they did it with unspecified bounds, then we should have already
2011 given an error about it before we got here. */
2012 if (! TYPE_DOMAIN (type))
2013 return error_mark_node;
2015 index_type = TYPE_DOMAIN (type);
2016 min = TYPE_MIN_VALUE (index_type);
2017 max = TYPE_MAX_VALUE (index_type);
2019 return (integer_zerop (min)
2021 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2024 /* If arg is static -- a reference to an object in static storage -- then
2025 return the object. This is not the same as the C meaning of `static'.
2026 If arg isn't static, return NULL. */
2031 switch (TREE_CODE (arg))
2034 /* Nested functions are static, even though taking their address will
2035 involve a trampoline as we unnest the nested function and create
2036 the trampoline on the tree level. */
2040 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2041 && ! DECL_THREAD_LOCAL_P (arg)
2042 && ! DECL_DLLIMPORT_P (arg)
2046 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2050 return TREE_STATIC (arg) ? arg : NULL;
2057 /* If the thing being referenced is not a field, then it is
2058 something language specific. */
2059 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
2060 return (*lang_hooks.staticp) (arg);
2062 /* If we are referencing a bitfield, we can't evaluate an
2063 ADDR_EXPR at compile time and so it isn't a constant. */
2064 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2067 return staticp (TREE_OPERAND (arg, 0));
2072 case MISALIGNED_INDIRECT_REF:
2073 case ALIGN_INDIRECT_REF:
2075 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2078 case ARRAY_RANGE_REF:
2079 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2080 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2081 return staticp (TREE_OPERAND (arg, 0));
2086 if ((unsigned int) TREE_CODE (arg)
2087 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
2088 return lang_hooks.staticp (arg);
2097 /* Return whether OP is a DECL whose address is function-invariant. */
2100 decl_address_invariant_p (const_tree op)
2102 /* The conditions below are slightly less strict than the one in
2105 switch (TREE_CODE (op))
2114 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2115 && !DECL_DLLIMPORT_P (op))
2116 || DECL_THREAD_LOCAL_P (op)
2117 || DECL_CONTEXT (op) == current_function_decl
2118 || decl_function_context (op) == current_function_decl)
2123 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2124 || decl_function_context (op) == current_function_decl)
2136 /* Return true if T is function-invariant (internal function, does
2137 not handle arithmetic; that's handled in skip_simple_arithmetic and
2138 tree_invariant_p). */
2140 static bool tree_invariant_p (tree t);
2143 tree_invariant_p_1 (tree t)
2147 if (TREE_CONSTANT (t)
2148 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2151 switch (TREE_CODE (t))
2157 op = TREE_OPERAND (t, 0);
2158 while (handled_component_p (op))
2160 switch (TREE_CODE (op))
2163 case ARRAY_RANGE_REF:
2164 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2165 || TREE_OPERAND (op, 2) != NULL_TREE
2166 || TREE_OPERAND (op, 3) != NULL_TREE)
2171 if (TREE_OPERAND (op, 2) != NULL_TREE)
2177 op = TREE_OPERAND (op, 0);
2180 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2189 /* Return true if T is function-invariant. */
2192 tree_invariant_p (tree t)
2194 tree inner = skip_simple_arithmetic (t);
2195 return tree_invariant_p_1 (inner);
2198 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2199 Do this to any expression which may be used in more than one place,
2200 but must be evaluated only once.
2202 Normally, expand_expr would reevaluate the expression each time.
2203 Calling save_expr produces something that is evaluated and recorded
2204 the first time expand_expr is called on it. Subsequent calls to
2205 expand_expr just reuse the recorded value.
2207 The call to expand_expr that generates code that actually computes
2208 the value is the first call *at compile time*. Subsequent calls
2209 *at compile time* generate code to use the saved value.
2210 This produces correct result provided that *at run time* control
2211 always flows through the insns made by the first expand_expr
2212 before reaching the other places where the save_expr was evaluated.
2213 You, the caller of save_expr, must make sure this is so.
2215 Constants, and certain read-only nodes, are returned with no
2216 SAVE_EXPR because that is safe. Expressions containing placeholders
2217 are not touched; see tree.def for an explanation of what these
2221 save_expr (tree expr)
2223 tree t = fold (expr);
2226 /* If the tree evaluates to a constant, then we don't want to hide that
2227 fact (i.e. this allows further folding, and direct checks for constants).
2228 However, a read-only object that has side effects cannot be bypassed.
2229 Since it is no problem to reevaluate literals, we just return the
2231 inner = skip_simple_arithmetic (t);
2232 if (TREE_CODE (inner) == ERROR_MARK)
2235 if (tree_invariant_p_1 (inner))
2238 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2239 it means that the size or offset of some field of an object depends on
2240 the value within another field.
2242 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2243 and some variable since it would then need to be both evaluated once and
2244 evaluated more than once. Front-ends must assure this case cannot
2245 happen by surrounding any such subexpressions in their own SAVE_EXPR
2246 and forcing evaluation at the proper time. */
2247 if (contains_placeholder_p (inner))
2250 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2252 /* This expression might be placed ahead of a jump to ensure that the
2253 value was computed on both sides of the jump. So make sure it isn't
2254 eliminated as dead. */
2255 TREE_SIDE_EFFECTS (t) = 1;
2259 /* Look inside EXPR and into any simple arithmetic operations. Return
2260 the innermost non-arithmetic node. */
2263 skip_simple_arithmetic (tree expr)
2267 /* We don't care about whether this can be used as an lvalue in this
2269 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2270 expr = TREE_OPERAND (expr, 0);
2272 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2273 a constant, it will be more efficient to not make another SAVE_EXPR since
2274 it will allow better simplification and GCSE will be able to merge the
2275 computations if they actually occur. */
2279 if (UNARY_CLASS_P (inner))
2280 inner = TREE_OPERAND (inner, 0);
2281 else if (BINARY_CLASS_P (inner))
2283 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2284 inner = TREE_OPERAND (inner, 0);
2285 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2286 inner = TREE_OPERAND (inner, 1);
2297 /* Return which tree structure is used by T. */
2299 enum tree_node_structure_enum
2300 tree_node_structure (const_tree t)
2302 const enum tree_code code = TREE_CODE (t);
2304 switch (TREE_CODE_CLASS (code))
2306 case tcc_declaration:
2311 return TS_FIELD_DECL;
2313 return TS_PARM_DECL;
2317 return TS_LABEL_DECL;
2319 return TS_RESULT_DECL;
2321 return TS_CONST_DECL;
2323 return TS_TYPE_DECL;
2325 return TS_FUNCTION_DECL;
2326 case SYMBOL_MEMORY_TAG:
2327 case NAME_MEMORY_TAG:
2328 case MEMORY_PARTITION_TAG:
2329 return TS_MEMORY_TAG;
2331 return TS_DECL_NON_COMMON;
2337 case tcc_comparison:
2340 case tcc_expression:
2344 case tcc_gimple_stmt:
2345 return TS_GIMPLE_STATEMENT;
2346 default: /* tcc_constant and tcc_exceptional */
2351 /* tcc_constant cases. */
2352 case INTEGER_CST: return TS_INT_CST;
2353 case REAL_CST: return TS_REAL_CST;
2354 case FIXED_CST: return TS_FIXED_CST;
2355 case COMPLEX_CST: return TS_COMPLEX;
2356 case VECTOR_CST: return TS_VECTOR;
2357 case STRING_CST: return TS_STRING;
2358 /* tcc_exceptional cases. */
2359 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2361 case ERROR_MARK: return TS_COMMON;
2362 case IDENTIFIER_NODE: return TS_IDENTIFIER;
2363 case TREE_LIST: return TS_LIST;
2364 case TREE_VEC: return TS_VEC;
2365 case PHI_NODE: return TS_PHI_NODE;
2366 case SSA_NAME: return TS_SSA_NAME;
2367 case PLACEHOLDER_EXPR: return TS_COMMON;
2368 case STATEMENT_LIST: return TS_STATEMENT_LIST;
2369 case BLOCK: return TS_BLOCK;
2370 case CONSTRUCTOR: return TS_CONSTRUCTOR;
2371 case TREE_BINFO: return TS_BINFO;
2372 case VALUE_HANDLE: return TS_VALUE_HANDLE;
2373 case OMP_CLAUSE: return TS_OMP_CLAUSE;
2380 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2381 or offset that depends on a field within a record. */
2384 contains_placeholder_p (const_tree exp)
2386 enum tree_code code;
2391 code = TREE_CODE (exp);
2392 if (code == PLACEHOLDER_EXPR)
2395 switch (TREE_CODE_CLASS (code))
2398 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2399 position computations since they will be converted into a
2400 WITH_RECORD_EXPR involving the reference, which will assume
2401 here will be valid. */
2402 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2404 case tcc_exceptional:
2405 if (code == TREE_LIST)
2406 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2407 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2412 case tcc_comparison:
2413 case tcc_expression:
2417 /* Ignoring the first operand isn't quite right, but works best. */
2418 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2421 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2422 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2423 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2429 switch (TREE_CODE_LENGTH (code))
2432 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2434 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2435 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2446 const_call_expr_arg_iterator iter;
2447 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2448 if (CONTAINS_PLACEHOLDER_P (arg))
2462 /* Return true if any part of the computation of TYPE involves a
2463 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2464 (for QUAL_UNION_TYPE) and field positions. */
2467 type_contains_placeholder_1 (const_tree type)
2469 /* If the size contains a placeholder or the parent type (component type in
2470 the case of arrays) type involves a placeholder, this type does. */
2471 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2472 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2473 || (TREE_TYPE (type) != 0
2474 && type_contains_placeholder_p (TREE_TYPE (type))))
2477 /* Now do type-specific checks. Note that the last part of the check above
2478 greatly limits what we have to do below. */
2479 switch (TREE_CODE (type))
2487 case REFERENCE_TYPE:
2495 case FIXED_POINT_TYPE:
2496 /* Here we just check the bounds. */
2497 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2498 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2501 /* We're already checked the component type (TREE_TYPE), so just check
2503 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2507 case QUAL_UNION_TYPE:
2511 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2512 if (TREE_CODE (field) == FIELD_DECL
2513 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2514 || (TREE_CODE (type) == QUAL_UNION_TYPE
2515 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2516 || type_contains_placeholder_p (TREE_TYPE (field))))
2528 type_contains_placeholder_p (tree type)
2532 /* If the contains_placeholder_bits field has been initialized,
2533 then we know the answer. */
2534 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2535 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2537 /* Indicate that we've seen this type node, and the answer is false.
2538 This is what we want to return if we run into recursion via fields. */
2539 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2541 /* Compute the real value. */
2542 result = type_contains_placeholder_1 (type);
2544 /* Store the real value. */
2545 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2550 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2551 return a tree with all occurrences of references to F in a
2552 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2553 contains only arithmetic expressions or a CALL_EXPR with a
2554 PLACEHOLDER_EXPR occurring only in its arglist. */
2557 substitute_in_expr (tree exp, tree f, tree r)
2559 enum tree_code code = TREE_CODE (exp);
2560 tree op0, op1, op2, op3;
2563 /* We handle TREE_LIST and COMPONENT_REF separately. */
2564 if (code == TREE_LIST)
2566 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2567 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2568 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2571 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2573 else if (code == COMPONENT_REF)
2575 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2576 and it is the right field, replace it with R. */
2577 for (inner = TREE_OPERAND (exp, 0);
2578 REFERENCE_CLASS_P (inner);
2579 inner = TREE_OPERAND (inner, 0))
2581 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2582 && TREE_OPERAND (exp, 1) == f)
2585 /* If this expression hasn't been completed let, leave it alone. */
2586 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
2589 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2590 if (op0 == TREE_OPERAND (exp, 0))
2593 new = fold_build3 (COMPONENT_REF, TREE_TYPE (exp),
2594 op0, TREE_OPERAND (exp, 1), NULL_TREE);
2597 switch (TREE_CODE_CLASS (code))
2600 case tcc_declaration:
2603 case tcc_exceptional:
2606 case tcc_comparison:
2607 case tcc_expression:
2609 switch (TREE_CODE_LENGTH (code))
2615 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2616 if (op0 == TREE_OPERAND (exp, 0))
2619 new = fold_build1 (code, TREE_TYPE (exp), op0);
2623 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2624 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2626 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2629 new = fold_build2 (code, TREE_TYPE (exp), op0, op1);
2633 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2634 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2635 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2637 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2638 && op2 == TREE_OPERAND (exp, 2))
2641 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2645 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2646 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
2647 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
2648 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
2650 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2651 && op2 == TREE_OPERAND (exp, 2)
2652 && op3 == TREE_OPERAND (exp, 3))
2655 new = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2665 tree copy = NULL_TREE;
2668 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2670 tree op = TREE_OPERAND (exp, i);
2671 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
2675 copy = copy_node (exp);
2676 TREE_OPERAND (copy, i) = new_op;
2691 TREE_READONLY (new) = TREE_READONLY (exp);
2695 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2696 for it within OBJ, a tree that is an object or a chain of references. */
2699 substitute_placeholder_in_expr (tree exp, tree obj)
2701 enum tree_code code = TREE_CODE (exp);
2702 tree op0, op1, op2, op3;
2704 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2705 in the chain of OBJ. */
2706 if (code == PLACEHOLDER_EXPR)
2708 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2711 for (elt = obj; elt != 0;
2712 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2713 || TREE_CODE (elt) == COND_EXPR)
2714 ? TREE_OPERAND (elt, 1)
2715 : (REFERENCE_CLASS_P (elt)
2716 || UNARY_CLASS_P (elt)
2717 || BINARY_CLASS_P (elt)
2718 || VL_EXP_CLASS_P (elt)
2719 || EXPRESSION_CLASS_P (elt))
2720 ? TREE_OPERAND (elt, 0) : 0))
2721 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2724 for (elt = obj; elt != 0;
2725 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2726 || TREE_CODE (elt) == COND_EXPR)
2727 ? TREE_OPERAND (elt, 1)
2728 : (REFERENCE_CLASS_P (elt)
2729 || UNARY_CLASS_P (elt)
2730 || BINARY_CLASS_P (elt)
2731 || VL_EXP_CLASS_P (elt)
2732 || EXPRESSION_CLASS_P (elt))
2733 ? TREE_OPERAND (elt, 0) : 0))
2734 if (POINTER_TYPE_P (TREE_TYPE (elt))
2735 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2737 return fold_build1 (INDIRECT_REF, need_type, elt);
2739 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2740 survives until RTL generation, there will be an error. */
2744 /* TREE_LIST is special because we need to look at TREE_VALUE
2745 and TREE_CHAIN, not TREE_OPERANDS. */
2746 else if (code == TREE_LIST)
2748 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2749 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2750 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2753 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2756 switch (TREE_CODE_CLASS (code))
2759 case tcc_declaration:
2762 case tcc_exceptional:
2765 case tcc_comparison:
2766 case tcc_expression:
2769 switch (TREE_CODE_LENGTH (code))
2775 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2776 if (op0 == TREE_OPERAND (exp, 0))
2779 return fold_build1 (code, TREE_TYPE (exp), op0);
2782 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2783 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2785 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2788 return fold_build2 (code, TREE_TYPE (exp), op0, op1);
2791 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2792 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2793 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2795 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2796 && op2 == TREE_OPERAND (exp, 2))
2799 return fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
2802 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2803 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2804 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2805 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2807 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2808 && op2 == TREE_OPERAND (exp, 2)
2809 && op3 == TREE_OPERAND (exp, 3))
2812 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2821 tree copy = NULL_TREE;
2824 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2826 tree op = TREE_OPERAND (exp, i);
2827 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
2831 copy = copy_node (exp);
2832 TREE_OPERAND (copy, i) = new_op;
2847 /* Stabilize a reference so that we can use it any number of times
2848 without causing its operands to be evaluated more than once.
2849 Returns the stabilized reference. This works by means of save_expr,
2850 so see the caveats in the comments about save_expr.
2852 Also allows conversion expressions whose operands are references.
2853 Any other kind of expression is returned unchanged. */
2856 stabilize_reference (tree ref)
2859 enum tree_code code = TREE_CODE (ref);
2866 /* No action is needed in this case. */
2871 case FIX_TRUNC_EXPR:
2872 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2876 result = build_nt (INDIRECT_REF,
2877 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2881 result = build_nt (COMPONENT_REF,
2882 stabilize_reference (TREE_OPERAND (ref, 0)),
2883 TREE_OPERAND (ref, 1), NULL_TREE);
2887 result = build_nt (BIT_FIELD_REF,
2888 stabilize_reference (TREE_OPERAND (ref, 0)),
2889 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2890 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2894 result = build_nt (ARRAY_REF,
2895 stabilize_reference (TREE_OPERAND (ref, 0)),
2896 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2897 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2900 case ARRAY_RANGE_REF:
2901 result = build_nt (ARRAY_RANGE_REF,
2902 stabilize_reference (TREE_OPERAND (ref, 0)),
2903 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2904 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2908 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2909 it wouldn't be ignored. This matters when dealing with
2911 return stabilize_reference_1 (ref);
2913 /* If arg isn't a kind of lvalue we recognize, make no change.
2914 Caller should recognize the error for an invalid lvalue. */
2919 return error_mark_node;
2922 TREE_TYPE (result) = TREE_TYPE (ref);
2923 TREE_READONLY (result) = TREE_READONLY (ref);
2924 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2925 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2930 /* Subroutine of stabilize_reference; this is called for subtrees of
2931 references. Any expression with side-effects must be put in a SAVE_EXPR
2932 to ensure that it is only evaluated once.
2934 We don't put SAVE_EXPR nodes around everything, because assigning very
2935 simple expressions to temporaries causes us to miss good opportunities
2936 for optimizations. Among other things, the opportunity to fold in the
2937 addition of a constant into an addressing mode often gets lost, e.g.
2938 "y[i+1] += x;". In general, we take the approach that we should not make
2939 an assignment unless we are forced into it - i.e., that any non-side effect
2940 operator should be allowed, and that cse should take care of coalescing
2941 multiple utterances of the same expression should that prove fruitful. */
2944 stabilize_reference_1 (tree e)
2947 enum tree_code code = TREE_CODE (e);
2949 /* We cannot ignore const expressions because it might be a reference
2950 to a const array but whose index contains side-effects. But we can
2951 ignore things that are actual constant or that already have been
2952 handled by this function. */
2954 if (tree_invariant_p (e))
2957 switch (TREE_CODE_CLASS (code))
2959 case tcc_exceptional:
2961 case tcc_declaration:
2962 case tcc_comparison:
2964 case tcc_expression:
2967 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2968 so that it will only be evaluated once. */
2969 /* The reference (r) and comparison (<) classes could be handled as
2970 below, but it is generally faster to only evaluate them once. */
2971 if (TREE_SIDE_EFFECTS (e))
2972 return save_expr (e);
2976 /* Constants need no processing. In fact, we should never reach
2981 /* Division is slow and tends to be compiled with jumps,
2982 especially the division by powers of 2 that is often
2983 found inside of an array reference. So do it just once. */
2984 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2985 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2986 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2987 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2988 return save_expr (e);
2989 /* Recursively stabilize each operand. */
2990 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2991 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2995 /* Recursively stabilize each operand. */
2996 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3003 TREE_TYPE (result) = TREE_TYPE (e);
3004 TREE_READONLY (result) = TREE_READONLY (e);
3005 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3006 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3011 /* Low-level constructors for expressions. */
3013 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3014 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3017 recompute_tree_invariant_for_addr_expr (tree t)
3020 bool tc = true, se = false;
3022 /* We started out assuming this address is both invariant and constant, but
3023 does not have side effects. Now go down any handled components and see if
3024 any of them involve offsets that are either non-constant or non-invariant.
3025 Also check for side-effects.
3027 ??? Note that this code makes no attempt to deal with the case where
3028 taking the address of something causes a copy due to misalignment. */
3030 #define UPDATE_FLAGS(NODE) \
3031 do { tree _node = (NODE); \
3032 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3033 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3035 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3036 node = TREE_OPERAND (node, 0))
3038 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3039 array reference (probably made temporarily by the G++ front end),
3040 so ignore all the operands. */
3041 if ((TREE_CODE (node) == ARRAY_REF
3042 || TREE_CODE (node) == ARRAY_RANGE_REF)
3043 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3045 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3046 if (TREE_OPERAND (node, 2))
3047 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3048 if (TREE_OPERAND (node, 3))
3049 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3051 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3052 FIELD_DECL, apparently. The G++ front end can put something else
3053 there, at least temporarily. */
3054 else if (TREE_CODE (node) == COMPONENT_REF
3055 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3057 if (TREE_OPERAND (node, 2))
3058 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3060 else if (TREE_CODE (node) == BIT_FIELD_REF)
3061 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3064 node = lang_hooks.expr_to_decl (node, &tc, &se);
3066 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3067 the address, since &(*a)->b is a form of addition. If it's a constant, the
3068 address is constant too. If it's a decl, its address is constant if the
3069 decl is static. Everything else is not constant and, furthermore,
3070 taking the address of a volatile variable is not volatile. */
3071 if (TREE_CODE (node) == INDIRECT_REF)
3072 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3073 else if (CONSTANT_CLASS_P (node))
3075 else if (DECL_P (node))
3076 tc &= (staticp (node) != NULL_TREE);
3080 se |= TREE_SIDE_EFFECTS (node);
3084 TREE_CONSTANT (t) = tc;
3085 TREE_SIDE_EFFECTS (t) = se;
3089 /* Build an expression of code CODE, data type TYPE, and operands as
3090 specified. Expressions and reference nodes can be created this way.
3091 Constants, decls, types and misc nodes cannot be.
3093 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3094 enough for all extant tree codes. */
3097 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3101 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3103 t = make_node_stat (code PASS_MEM_STAT);
3110 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3112 int length = sizeof (struct tree_exp);
3113 #ifdef GATHER_STATISTICS
3114 tree_node_kind kind;
3118 #ifdef GATHER_STATISTICS
3119 switch (TREE_CODE_CLASS (code))
3121 case tcc_statement: /* an expression with side effects */
3124 case tcc_reference: /* a reference */
3132 tree_node_counts[(int) kind]++;
3133 tree_node_sizes[(int) kind] += length;
3136 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3138 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3140 memset (t, 0, sizeof (struct tree_common));
3142 TREE_SET_CODE (t, code);
3144 TREE_TYPE (t) = type;
3145 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3146 TREE_OPERAND (t, 0) = node;
3147 TREE_BLOCK (t) = NULL_TREE;
3148 if (node && !TYPE_P (node))
3150 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3151 TREE_READONLY (t) = TREE_READONLY (node);
3154 if (TREE_CODE_CLASS (code) == tcc_statement)
3155 TREE_SIDE_EFFECTS (t) = 1;
3159 /* All of these have side-effects, no matter what their
3161 TREE_SIDE_EFFECTS (t) = 1;
3162 TREE_READONLY (t) = 0;
3165 case MISALIGNED_INDIRECT_REF:
3166 case ALIGN_INDIRECT_REF:
3168 /* Whether a dereference is readonly has nothing to do with whether
3169 its operand is readonly. */
3170 TREE_READONLY (t) = 0;
3175 recompute_tree_invariant_for_addr_expr (t);
3179 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3180 && node && !TYPE_P (node)
3181 && TREE_CONSTANT (node))
3182 TREE_CONSTANT (t) = 1;
3183 if (TREE_CODE_CLASS (code) == tcc_reference
3184 && node && TREE_THIS_VOLATILE (node))
3185 TREE_THIS_VOLATILE (t) = 1;
3192 #define PROCESS_ARG(N) \
3194 TREE_OPERAND (t, N) = arg##N; \
3195 if (arg##N &&!TYPE_P (arg##N)) \
3197 if (TREE_SIDE_EFFECTS (arg##N)) \
3199 if (!TREE_READONLY (arg##N)) \
3201 if (!TREE_CONSTANT (arg##N)) \
3207 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3209 bool constant, read_only, side_effects;
3212 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3215 /* FIXME tuples: Statement's aren't expressions! */
3216 if (code == GIMPLE_MODIFY_STMT)
3217 return build_gimple_modify_stmt_stat (arg0, arg1 PASS_MEM_STAT);
3219 /* Must use build_gimple_modify_stmt to construct GIMPLE_MODIFY_STMTs. */
3220 gcc_assert (code != GIMPLE_MODIFY_STMT);
3223 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3224 && arg0 && arg1 && tt && POINTER_TYPE_P (tt))
3225 gcc_assert (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST);
3227 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3228 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3229 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3230 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3232 t = make_node_stat (code PASS_MEM_STAT);
3235 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3236 result based on those same flags for the arguments. But if the
3237 arguments aren't really even `tree' expressions, we shouldn't be trying
3240 /* Expressions without side effects may be constant if their
3241 arguments are as well. */
3242 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3243 || TREE_CODE_CLASS (code) == tcc_binary);
3245 side_effects = TREE_SIDE_EFFECTS (t);
3250 TREE_READONLY (t) = read_only;
3251 TREE_CONSTANT (t) = constant;
3252 TREE_SIDE_EFFECTS (t) = side_effects;
3253 TREE_THIS_VOLATILE (t)
3254 = (TREE_CODE_CLASS (code) == tcc_reference
3255 && arg0 && TREE_THIS_VOLATILE (arg0));
3261 /* Build a GIMPLE_MODIFY_STMT node. This tree code doesn't have a
3262 type, so we can't use build2 (a.k.a. build2_stat). */
3265 build_gimple_modify_stmt_stat (tree arg0, tree arg1 MEM_STAT_DECL)
3269 t = make_node_stat (GIMPLE_MODIFY_STMT PASS_MEM_STAT);
3270 /* ?? We don't care about setting flags for tuples... */
3271 GIMPLE_STMT_OPERAND (t, 0) = arg0;
3272 GIMPLE_STMT_OPERAND (t, 1) = arg1;
3277 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3278 tree arg2 MEM_STAT_DECL)
3280 bool constant, read_only, side_effects;
3283 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3284 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3286 t = make_node_stat (code PASS_MEM_STAT);
3289 /* As a special exception, if COND_EXPR has NULL branches, we
3290 assume that it is a gimple statement and always consider
3291 it to have side effects. */
3292 if (code == COND_EXPR
3293 && tt == void_type_node
3294 && arg1 == NULL_TREE
3295 && arg2 == NULL_TREE)
3296 side_effects = true;
3298 side_effects = TREE_SIDE_EFFECTS (t);
3304 TREE_SIDE_EFFECTS (t) = side_effects;
3305 TREE_THIS_VOLATILE (t)
3306 = (TREE_CODE_CLASS (code) == tcc_reference
3307 && arg0 && TREE_THIS_VOLATILE (arg0));
3313 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3314 tree arg2, tree arg3 MEM_STAT_DECL)
3316 bool constant, read_only, side_effects;
3319 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3321 t = make_node_stat (code PASS_MEM_STAT);
3324 side_effects = TREE_SIDE_EFFECTS (t);
3331 TREE_SIDE_EFFECTS (t) = side_effects;
3332 TREE_THIS_VOLATILE (t)
3333 = (TREE_CODE_CLASS (code) == tcc_reference
3334 && arg0 && TREE_THIS_VOLATILE (arg0));
3340 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3341 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3343 bool constant, read_only, side_effects;
3346 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3348 t = make_node_stat (code PASS_MEM_STAT);
3351 side_effects = TREE_SIDE_EFFECTS (t);
3359 TREE_SIDE_EFFECTS (t) = side_effects;
3360 TREE_THIS_VOLATILE (t)
3361 = (TREE_CODE_CLASS (code) == tcc_reference
3362 && arg0 && TREE_THIS_VOLATILE (arg0));
3368 build7_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3369 tree arg2, tree arg3, tree arg4, tree arg5,
3370 tree arg6 MEM_STAT_DECL)
3372 bool constant, read_only, side_effects;
3375 gcc_assert (code == TARGET_MEM_REF);
3377 t = make_node_stat (code PASS_MEM_STAT);
3380 side_effects = TREE_SIDE_EFFECTS (t);
3390 TREE_SIDE_EFFECTS (t) = side_effects;
3391 TREE_THIS_VOLATILE (t) = 0;
3396 /* Similar except don't specify the TREE_TYPE
3397 and leave the TREE_SIDE_EFFECTS as 0.
3398 It is permissible for arguments to be null,
3399 or even garbage if their values do not matter. */
3402 build_nt (enum tree_code code, ...)
3409 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3413 t = make_node (code);
3414 length = TREE_CODE_LENGTH (code);
3416 for (i = 0; i < length; i++)
3417 TREE_OPERAND (t, i) = va_arg (p, tree);
3423 /* Similar to build_nt, but for creating a CALL_EXPR object with
3424 ARGLIST passed as a list. */
3427 build_nt_call_list (tree fn, tree arglist)
3432 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3433 CALL_EXPR_FN (t) = fn;
3434 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3435 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3436 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3440 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3441 We do NOT enter this node in any sort of symbol table.
3443 layout_decl is used to set up the decl's storage layout.
3444 Other slots are initialized to 0 or null pointers. */
3447 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
3451 t = make_node_stat (code PASS_MEM_STAT);
3453 /* if (type == error_mark_node)
3454 type = integer_type_node; */
3455 /* That is not done, deliberately, so that having error_mark_node
3456 as the type can suppress useless errors in the use of this variable. */
3458 DECL_NAME (t) = name;
3459 TREE_TYPE (t) = type;
3461 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3467 /* Builds and returns function declaration with NAME and TYPE. */
3470 build_fn_decl (const char *name, tree type)
3472 tree id = get_identifier (name);
3473 tree decl = build_decl (FUNCTION_DECL, id, type);
3475 DECL_EXTERNAL (decl) = 1;
3476 TREE_PUBLIC (decl) = 1;
3477 DECL_ARTIFICIAL (decl) = 1;
3478 TREE_NOTHROW (decl) = 1;
3484 /* BLOCK nodes are used to represent the structure of binding contours
3485 and declarations, once those contours have been exited and their contents
3486 compiled. This information is used for outputting debugging info. */
3489 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3491 tree block = make_node (BLOCK);
3493 BLOCK_VARS (block) = vars;
3494 BLOCK_SUBBLOCKS (block) = subblocks;
3495 BLOCK_SUPERCONTEXT (block) = supercontext;
3496 BLOCK_CHAIN (block) = chain;
3501 expand_location (source_location loc)
3503 expanded_location xloc;
3512 const struct line_map *map = linemap_lookup (line_table, loc);
3513 xloc.file = map->to_file;
3514 xloc.line = SOURCE_LINE (map, loc);
3515 xloc.column = SOURCE_COLUMN (map, loc);
3521 /* Source location accessor functions. */
3524 /* The source location of this expression. Non-tree_exp nodes such as
3525 decls and constants can be shared among multiple locations, so
3528 expr_location (const_tree node)
3530 if (GIMPLE_STMT_P (node))
3531 return GIMPLE_STMT_LOCUS (node);
3532 return EXPR_P (node) ? node->exp.locus : UNKNOWN_LOCATION;
3536 set_expr_location (tree node, location_t locus)
3538 if (GIMPLE_STMT_P (node))
3539 GIMPLE_STMT_LOCUS (node) = locus;
3541 EXPR_CHECK (node)->exp.locus = locus;
3545 expr_has_location (const_tree node)
3547 return expr_location (node) != UNKNOWN_LOCATION;
3551 expr_locus (const_tree node)
3553 if (GIMPLE_STMT_P (node))
3554 return CONST_CAST (source_location *, &GIMPLE_STMT_LOCUS (node));
3555 return (EXPR_P (node)
3556 ? CONST_CAST (source_location *, &node->exp.locus)
3557 : (source_location *) NULL);
3561 set_expr_locus (tree node, source_location *loc)
3565 if (GIMPLE_STMT_P (node))
3566 GIMPLE_STMT_LOCUS (node) = UNKNOWN_LOCATION;
3568 EXPR_CHECK (node)->exp.locus = UNKNOWN_LOCATION;
3572 if (GIMPLE_STMT_P (node))
3573 GIMPLE_STMT_LOCUS (node) = *loc;
3575 EXPR_CHECK (node)->exp.locus = *loc;
3579 /* Return the file name of the location of NODE. */
3581 expr_filename (const_tree node)
3583 if (GIMPLE_STMT_P (node))
3584 return LOCATION_FILE (GIMPLE_STMT_LOCUS (node));
3585 return LOCATION_FILE (EXPR_CHECK (node)->exp.locus);
3588 /* Return the line number of the location of NODE. */
3590 expr_lineno (const_tree node)
3592 if (GIMPLE_STMT_P (node))
3593 return LOCATION_LINE (GIMPLE_STMT_LOCUS (node));
3594 return LOCATION_LINE (EXPR_CHECK (node)->exp.locus);
3598 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3602 build_decl_attribute_variant (tree ddecl, tree attribute)
3604 DECL_ATTRIBUTES (ddecl) = attribute;
3608 /* Borrowed from hashtab.c iterative_hash implementation. */
3609 #define mix(a,b,c) \
3611 a -= b; a -= c; a ^= (c>>13); \
3612 b -= c; b -= a; b ^= (a<< 8); \
3613 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3614 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3615 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3616 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3617 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3618 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3619 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3623 /* Produce good hash value combining VAL and VAL2. */
3624 static inline hashval_t
3625 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3627 /* the golden ratio; an arbitrary value. */
3628 hashval_t a = 0x9e3779b9;
3634 /* Produce good hash value combining PTR and VAL2. */
3635 static inline hashval_t
3636 iterative_hash_pointer (const void *ptr, hashval_t val2)
3638 if (sizeof (ptr) == sizeof (hashval_t))
3639 return iterative_hash_hashval_t ((size_t) ptr, val2);
3642 hashval_t a = (hashval_t) (size_t) ptr;
3643 /* Avoid warnings about shifting of more than the width of the type on
3644 hosts that won't execute this path. */
3646 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
3652 /* Produce good hash value combining VAL and VAL2. */
3653 static inline hashval_t
3654 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
3656 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
3657 return iterative_hash_hashval_t (val, val2);
3660 hashval_t a = (hashval_t) val;
3661 /* Avoid warnings about shifting of more than the width of the type on
3662 hosts that won't execute this path. */
3664 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
3666 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
3668 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
3669 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
3676 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3677 is ATTRIBUTE and its qualifiers are QUALS.
3679 Record such modified types already made so we don't make duplicates. */
3682 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
3684 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
3686 hashval_t hashcode = 0;
3688 enum tree_code code = TREE_CODE (ttype);
3690 /* Building a distinct copy of a tagged type is inappropriate; it
3691 causes breakage in code that expects there to be a one-to-one
3692 relationship between a struct and its fields.
3693 build_duplicate_type is another solution (as used in
3694 handle_transparent_union_attribute), but that doesn't play well
3695 with the stronger C++ type identity model. */
3696 if (TREE_CODE (ttype) == RECORD_TYPE
3697 || TREE_CODE (ttype) == UNION_TYPE
3698 || TREE_CODE (ttype) == QUAL_UNION_TYPE
3699 || TREE_CODE (ttype) == ENUMERAL_TYPE)
3701 warning (OPT_Wattributes,
3702 "ignoring attributes applied to %qT after definition",
3703 TYPE_MAIN_VARIANT (ttype));
3704 return build_qualified_type (ttype, quals);
3707 ntype = build_distinct_type_copy (ttype);
3709 TYPE_ATTRIBUTES (ntype) = attribute;
3710 set_type_quals (ntype, TYPE_UNQUALIFIED);
3712 hashcode = iterative_hash_object (code, hashcode);
3713 if (TREE_TYPE (ntype))
3714 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3716 hashcode = attribute_hash_list (attribute, hashcode);
3718 switch (TREE_CODE (ntype))
3721 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3724 if (TYPE_DOMAIN (ntype))
3725 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
3729 hashcode = iterative_hash_object
3730 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
3731 hashcode = iterative_hash_object
3732 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
3735 case FIXED_POINT_TYPE:
3737 unsigned int precision = TYPE_PRECISION (ntype);
3738 hashcode = iterative_hash_object (precision, hashcode);
3745 ntype = type_hash_canon (hashcode, ntype);
3747 /* If the target-dependent attributes make NTYPE different from
3748 its canonical type, we will need to use structural equality
3749 checks for this qualified type. */
3750 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
3751 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
3752 || !targetm.comp_type_attributes (ntype, ttype))
3753 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
3755 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
3757 ttype = build_qualified_type (ntype, quals);
3759 else if (TYPE_QUALS (ttype) != quals)
3760 ttype = build_qualified_type (ttype, quals);
3766 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3769 Record such modified types already made so we don't make duplicates. */
3772 build_type_attribute_variant (tree ttype, tree attribute)
3774 return build_type_attribute_qual_variant (ttype, attribute,
3775 TYPE_QUALS (ttype));
3778 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3781 We try both `text' and `__text__', ATTR may be either one. */
3782 /* ??? It might be a reasonable simplification to require ATTR to be only
3783 `text'. One might then also require attribute lists to be stored in
3784 their canonicalized form. */
3787 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
3792 if (TREE_CODE (ident) != IDENTIFIER_NODE)
3795 p = IDENTIFIER_POINTER (ident);
3796 ident_len = IDENTIFIER_LENGTH (ident);
3798 if (ident_len == attr_len
3799 && strcmp (attr, p) == 0)
3802 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3805 gcc_assert (attr[1] == '_');
3806 gcc_assert (attr[attr_len - 2] == '_');
3807 gcc_assert (attr[attr_len - 1] == '_');
3808 if (ident_len == attr_len - 4
3809 && strncmp (attr + 2, p, attr_len - 4) == 0)
3814 if (ident_len == attr_len + 4
3815 && p[0] == '_' && p[1] == '_'
3816 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
3817 && strncmp (attr, p + 2, attr_len) == 0)
3824 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3827 We try both `text' and `__text__', ATTR may be either one. */
3830 is_attribute_p (const char *attr, const_tree ident)
3832 return is_attribute_with_length_p (attr, strlen (attr), ident);
3835 /* Given an attribute name and a list of attributes, return a pointer to the
3836 attribute's list element if the attribute is part of the list, or NULL_TREE
3837 if not found. If the attribute appears more than once, this only
3838 returns the first occurrence; the TREE_CHAIN of the return value should
3839 be passed back in if further occurrences are wanted. */
3842 lookup_attribute (const char *attr_name, tree list)
3845 size_t attr_len = strlen (attr_name);
3847 for (l = list; l; l = TREE_CHAIN (l))
3849 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3850 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3856 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3860 remove_attribute (const char *attr_name, tree list)
3863 size_t attr_len = strlen (attr_name);
3865 for (p = &list; *p; )
3868 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
3869 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
3870 *p = TREE_CHAIN (l);
3872 p = &TREE_CHAIN (l);
3878 /* Return an attribute list that is the union of a1 and a2. */
3881 merge_attributes (tree a1, tree a2)
3885 /* Either one unset? Take the set one. */
3887 if ((attributes = a1) == 0)
3890 /* One that completely contains the other? Take it. */
3892 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3894 if (attribute_list_contained (a2, a1))
3898 /* Pick the longest list, and hang on the other list. */
3900 if (list_length (a1) < list_length (a2))
3901 attributes = a2, a2 = a1;
3903 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3906 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3909 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3912 if (TREE_VALUE (a) != NULL
3913 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
3914 && TREE_VALUE (a2) != NULL
3915 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
3917 if (simple_cst_list_equal (TREE_VALUE (a),
3918 TREE_VALUE (a2)) == 1)
3921 else if (simple_cst_equal (TREE_VALUE (a),
3922 TREE_VALUE (a2)) == 1)
3927 a1 = copy_node (a2);
3928 TREE_CHAIN (a1) = attributes;
3937 /* Given types T1 and T2, merge their attributes and return
3941 merge_type_attributes (tree t1, tree t2)
3943 return merge_attributes (TYPE_ATTRIBUTES (t1),
3944 TYPE_ATTRIBUTES (t2));
3947 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3951 merge_decl_attributes (tree olddecl, tree newdecl)
3953 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3954 DECL_ATTRIBUTES (newdecl));
3957 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3959 /* Specialization of merge_decl_attributes for various Windows targets.
3961 This handles the following situation:
3963 __declspec (dllimport) int foo;
3966 The second instance of `foo' nullifies the dllimport. */
3969 merge_dllimport_decl_attributes (tree old, tree new)
3972 int delete_dllimport_p = 1;
3974 /* What we need to do here is remove from `old' dllimport if it doesn't
3975 appear in `new'. dllimport behaves like extern: if a declaration is
3976 marked dllimport and a definition appears later, then the object
3977 is not dllimport'd. We also remove a `new' dllimport if the old list
3978 contains dllexport: dllexport always overrides dllimport, regardless
3979 of the order of declaration. */
3980 if (!VAR_OR_FUNCTION_DECL_P (new))
3981 delete_dllimport_p = 0;
3982 else if (DECL_DLLIMPORT_P (new)
3983 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
3985 DECL_DLLIMPORT_P (new) = 0;
3986 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
3987 "dllimport ignored", new);
3989 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new))
3991 /* Warn about overriding a symbol that has already been used, e.g.:
3992 extern int __attribute__ ((dllimport)) foo;
3993 int* bar () {return &foo;}
3996 if (TREE_USED (old))
3998 warning (0, "%q+D redeclared without dllimport attribute "
3999 "after being referenced with dll linkage", new);
4000 /* If we have used a variable's address with dllimport linkage,
4001 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
4002 decl may already have had TREE_CONSTANT computed.
4003 We still remove the attribute so that assembler code refers
4004 to '&foo rather than '_imp__foo'. */
4005 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
4006 DECL_DLLIMPORT_P (new) = 1;
4009 /* Let an inline definition silently override the external reference,
4010 but otherwise warn about attribute inconsistency. */
4011 else if (TREE_CODE (new) == VAR_DECL
4012 || !DECL_DECLARED_INLINE_P (new))
4013 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
4014 "previous dllimport ignored", new);
4017 delete_dllimport_p = 0;
4019 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new));
4021 if (delete_dllimport_p)
4024 const size_t attr_len = strlen ("dllimport");
4026 /* Scan the list for dllimport and delete it. */
4027 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
4029 if (is_attribute_with_length_p ("dllimport", attr_len,
4032 if (prev == NULL_TREE)
4035 TREE_CHAIN (prev) = TREE_CHAIN (t);
4044 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4045 struct attribute_spec.handler. */
4048 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
4053 /* These attributes may apply to structure and union types being created,
4054 but otherwise should pass to the declaration involved. */
4057 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
4058 | (int) ATTR_FLAG_ARRAY_NEXT))
4060 *no_add_attrs = true;
4061 return tree_cons (name, args, NULL_TREE);
4063 if (TREE_CODE (node) == RECORD_TYPE
4064 || TREE_CODE (node) == UNION_TYPE)
4066 node = TYPE_NAME (node);
4072 warning (OPT_Wattributes, "%qs attribute ignored",
4073 IDENTIFIER_POINTER (name));
4074 *no_add_attrs = true;
4079 if (TREE_CODE (node) != FUNCTION_DECL
4080 && TREE_CODE (node) != VAR_DECL
4081 && TREE_CODE (node) != TYPE_DECL)
4083 *no_add_attrs = true;
4084 warning (OPT_Wattributes, "%qs attribute ignored",
4085 IDENTIFIER_POINTER (name));
4089 if (TREE_CODE (node) == TYPE_DECL
4090 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
4091 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
4093 *no_add_attrs = true;
4094 warning (OPT_Wattributes, "%qs attribute ignored",
4095 IDENTIFIER_POINTER (name));
4099 /* Report error on dllimport ambiguities seen now before they cause
4101 else if (is_attribute_p ("dllimport", name))
4103 /* Honor any target-specific overrides. */
4104 if (!targetm.valid_dllimport_attribute_p (node))
4105 *no_add_attrs = true;
4107 else if (TREE_CODE (node) == FUNCTION_DECL
4108 && DECL_DECLARED_INLINE_P (node))
4110 warning (OPT_Wattributes, "inline function %q+D declared as "
4111 " dllimport: attribute ignored", node);
4112 *no_add_attrs = true;
4114 /* Like MS, treat definition of dllimported variables and
4115 non-inlined functions on declaration as syntax errors. */
4116 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
4118 error ("function %q+D definition is marked dllimport", node);
4119 *no_add_attrs = true;
4122 else if (TREE_CODE (node) == VAR_DECL)
4124 if (DECL_INITIAL (node))
4126 error ("variable %q+D definition is marked dllimport",
4128 *no_add_attrs = true;
4131 /* `extern' needn't be specified with dllimport.
4132 Specify `extern' now and hope for the best. Sigh. */
4133 DECL_EXTERNAL (node) = 1;
4134 /* Also, implicitly give dllimport'd variables declared within
4135 a function global scope, unless declared static. */
4136 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
4137 TREE_PUBLIC (node) = 1;
4140 if (*no_add_attrs == false)
4141 DECL_DLLIMPORT_P (node) = 1;
4144 /* Report error if symbol is not accessible at global scope. */
4145 if (!TREE_PUBLIC (node)
4146 && (TREE_CODE (node) == VAR_DECL
4147 || TREE_CODE (node) == FUNCTION_DECL))
4149 error ("external linkage required for symbol %q+D because of "
4150 "%qs attribute", node, IDENTIFIER_POINTER (name));
4151 *no_add_attrs = true;
4154 /* A dllexport'd entity must have default visibility so that other
4155 program units (shared libraries or the main executable) can see
4156 it. A dllimport'd entity must have default visibility so that
4157 the linker knows that undefined references within this program
4158 unit can be resolved by the dynamic linker. */
4161 if (DECL_VISIBILITY_SPECIFIED (node)
4162 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
4163 error ("%qs implies default visibility, but %qD has already "
4164 "been declared with a different visibility",
4165 IDENTIFIER_POINTER (name), node);
4166 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
4167 DECL_VISIBILITY_SPECIFIED (node) = 1;
4173 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4175 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4176 of the various TYPE_QUAL values. */
4179 set_type_quals (tree type, int type_quals)
4181 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
4182 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
4183 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
4186 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4189 check_qualified_type (const_tree cand, const_tree base, int type_quals)
4191 return (TYPE_QUALS (cand) == type_quals
4192 && TYPE_NAME (cand) == TYPE_NAME (base)
4193 /* Apparently this is needed for Objective-C. */
4194 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
4195 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
4196 TYPE_ATTRIBUTES (base)));
4199 /* Return a version of the TYPE, qualified as indicated by the
4200 TYPE_QUALS, if one exists. If no qualified version exists yet,
4201 return NULL_TREE. */
4204 get_qualified_type (tree type, int type_quals)
4208 if (TYPE_QUALS (type) == type_quals)
4211 /* Search the chain of variants to see if there is already one there just
4212 like the one we need to have. If so, use that existing one. We must
4213 preserve the TYPE_NAME, since there is code that depends on this. */
4214 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
4215 if (check_qualified_type (t, type, type_quals))
4221 /* Like get_qualified_type, but creates the type if it does not
4222 exist. This function never returns NULL_TREE. */
4225 build_qualified_type (tree type, int type_quals)
4229 /* See if we already have the appropriate qualified variant. */
4230 t = get_qualified_type (type, type_quals);
4232 /* If not, build it. */
4235 t = build_variant_type_copy (type);
4236 set_type_quals (t, type_quals);
4238 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4239 /* Propagate structural equality. */
4240 SET_TYPE_STRUCTURAL_EQUALITY (t);
4241 else if (TYPE_CANONICAL (type) != type)
4242 /* Build the underlying canonical type, since it is different
4244 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
4247 /* T is its own canonical type. */
4248 TYPE_CANONICAL (t) = t;
4255 /* Create a new distinct copy of TYPE. The new type is made its own
4256 MAIN_VARIANT. If TYPE requires structural equality checks, the
4257 resulting type requires structural equality checks; otherwise, its
4258 TYPE_CANONICAL points to itself. */
4261 build_distinct_type_copy (tree type)
4263 tree t = copy_node (type);
4265 TYPE_POINTER_TO (t) = 0;
4266 TYPE_REFERENCE_TO (t) = 0;
4268 /* Set the canonical type either to a new equivalence class, or
4269 propagate the need for structural equality checks. */
4270 if (TYPE_STRUCTURAL_EQUALITY_P (type))
4271 SET_TYPE_STRUCTURAL_EQUALITY (t);
4273 TYPE_CANONICAL (t) = t;
4275 /* Make it its own variant. */
4276 TYPE_MAIN_VARIANT (t) = t;
4277 TYPE_NEXT_VARIANT (t) = 0;
4279 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4280 whose TREE_TYPE is not t. This can also happen in the Ada
4281 frontend when using subtypes. */
4286 /* Create a new variant of TYPE, equivalent but distinct. This is so
4287 the caller can modify it. TYPE_CANONICAL for the return type will
4288 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4289 are considered equal by the language itself (or that both types
4290 require structural equality checks). */
4293 build_variant_type_copy (tree type)
4295 tree t, m = TYPE_MAIN_VARIANT (type);
4297 t = build_distinct_type_copy (type);
4299 /* Since we're building a variant, assume that it is a non-semantic
4300 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4301 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
4303 /* Add the new type to the chain of variants of TYPE. */
4304 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
4305 TYPE_NEXT_VARIANT (m) = t;
4306 TYPE_MAIN_VARIANT (t) = m;
4311 /* Return true if the from tree in both tree maps are equal. */
4314 tree_map_base_eq (const void *va, const void *vb)
4316 const struct tree_map_base *const a = (const struct tree_map_base *) va,
4317 *const b = (const struct tree_map_base *) vb;
4318 return (a->from == b->from);
4321 /* Hash a from tree in a tree_map. */
4324 tree_map_base_hash (const void *item)
4326 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
4329 /* Return true if this tree map structure is marked for garbage collection
4330 purposes. We simply return true if the from tree is marked, so that this
4331 structure goes away when the from tree goes away. */
4334 tree_map_base_marked_p (const void *p)
4336 return ggc_marked_p (((const struct tree_map_base *) p)->from);
4340 tree_map_hash (const void *item)
4342 return (((const struct tree_map *) item)->hash);
4345 /* Return the initialization priority for DECL. */
4348 decl_init_priority_lookup (tree decl)
4350 struct tree_priority_map *h;
4351 struct tree_map_base in;
4353 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4355 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4356 return h ? h->init : DEFAULT_INIT_PRIORITY;
4359 /* Return the finalization priority for DECL. */
4362 decl_fini_priority_lookup (tree decl)
4364 struct tree_priority_map *h;
4365 struct tree_map_base in;
4367 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4369 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
4370 return h ? h->fini : DEFAULT_INIT_PRIORITY;
4373 /* Return the initialization and finalization priority information for
4374 DECL. If there is no previous priority information, a freshly
4375 allocated structure is returned. */
4377 static struct tree_priority_map *
4378 decl_priority_info (tree decl)
4380 struct tree_priority_map in;
4381 struct tree_priority_map *h;
4384 in.base.from = decl;
4385 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
4386 h = (struct tree_priority_map *) *loc;
4389 h = GGC_CNEW (struct tree_priority_map);
4391 h->base.from = decl;
4392 h->init = DEFAULT_INIT_PRIORITY;
4393 h->fini = DEFAULT_INIT_PRIORITY;
4399 /* Set the initialization priority for DECL to PRIORITY. */
4402 decl_init_priority_insert (tree decl, priority_type priority)
4404 struct tree_priority_map *h;
4406 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
4407 h = decl_priority_info (decl);
4411 /* Set the finalization priority for DECL to PRIORITY. */
4414 decl_fini_priority_insert (tree decl, priority_type priority)
4416 struct tree_priority_map *h;
4418 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
4419 h = decl_priority_info (decl);
4423 /* Look up a restrict qualified base decl for FROM. */
4426 decl_restrict_base_lookup (tree from)
4431 in.base.from = from;
4432 h = (struct tree_map *) htab_find_with_hash (restrict_base_for_decl, &in,
4433 htab_hash_pointer (from));
4434 return h ? h->to : NULL_TREE;
4437 /* Record the restrict qualified base TO for FROM. */
4440 decl_restrict_base_insert (tree from, tree to)
4445 h = GGC_NEW (struct tree_map);
4446 h->hash = htab_hash_pointer (from);
4447 h->base.from = from;
4449 loc = htab_find_slot_with_hash (restrict_base_for_decl, h, h->hash, INSERT);
4450 *(struct tree_map **) loc = h;
4453 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4456 print_debug_expr_statistics (void)
4458 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4459 (long) htab_size (debug_expr_for_decl),
4460 (long) htab_elements (debug_expr_for_decl),
4461 htab_collisions (debug_expr_for_decl));
4464 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4467 print_value_expr_statistics (void)
4469 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4470 (long) htab_size (value_expr_for_decl),
4471 (long) htab_elements (value_expr_for_decl),
4472 htab_collisions (value_expr_for_decl));
4475 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4476 don't print anything if the table is empty. */
4479 print_restrict_base_statistics (void)
4481 if (htab_elements (restrict_base_for_decl) != 0)
4483 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4484 (long) htab_size (restrict_base_for_decl),
4485 (long) htab_elements (restrict_base_for_decl),
4486 htab_collisions (restrict_base_for_decl));
4489 /* Lookup a debug expression for FROM, and return it if we find one. */
4492 decl_debug_expr_lookup (tree from)
4494 struct tree_map *h, in;
4495 in.base.from = from;
4497 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
4498 htab_hash_pointer (from));
4504 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4507 decl_debug_expr_insert (tree from, tree to)
4512 h = GGC_NEW (struct tree_map);
4513 h->hash = htab_hash_pointer (from);
4514 h->base.from = from;
4516 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
4517 *(struct tree_map **) loc = h;
4520 /* Lookup a value expression for FROM, and return it if we find one. */
4523 decl_value_expr_lookup (tree from)
4525 struct tree_map *h, in;
4526 in.base.from = from;
4528 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
4529 htab_hash_pointer (from));
4535 /* Insert a mapping FROM->TO in the value expression hashtable. */
4538 decl_value_expr_insert (tree from, tree to)
4543 h = GGC_NEW (struct tree_map);
4544 h->hash = htab_hash_pointer (from);
4545 h->base.from = from;
4547 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
4548 *(struct tree_map **) loc = h;
4551 /* Hashing of types so that we don't make duplicates.
4552 The entry point is `type_hash_canon'. */
4554 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4555 with types in the TREE_VALUE slots), by adding the hash codes
4556 of the individual types. */
4559 type_hash_list (const_tree list, hashval_t hashcode)
4563 for (tail = list; tail; tail = TREE_CHAIN (tail))
4564 if (TREE_VALUE (tail) != error_mark_node)
4565 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
4571 /* These are the Hashtable callback functions. */
4573 /* Returns true iff the types are equivalent. */
4576 type_hash_eq (const void *va, const void *vb)
4578 const struct type_hash *const a = (const struct type_hash *) va,
4579 *const b = (const struct type_hash *) vb;
4581 /* First test the things that are the same for all types. */
4582 if (a->hash != b->hash
4583 || TREE_CODE (a->type) != TREE_CODE (b->type)
4584 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
4585 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
4586 TYPE_ATTRIBUTES (b->type))
4587 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
4588 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
4591 switch (TREE_CODE (a->type))
4596 case REFERENCE_TYPE:
4600 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
4603 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
4604 && !(TYPE_VALUES (a->type)
4605 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
4606 && TYPE_VALUES (b->type)
4607 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
4608 && type_list_equal (TYPE_VALUES (a->type),
4609 TYPE_VALUES (b->type))))
4612 /* ... fall through ... */
4617 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
4618 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
4619 TYPE_MAX_VALUE (b->type)))
4620 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
4621 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
4622 TYPE_MIN_VALUE (b->type))));
4624 case FIXED_POINT_TYPE:
4625 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
4628 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
4631 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
4632 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4633 || (TYPE_ARG_TYPES (a->type)
4634 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4635 && TYPE_ARG_TYPES (b->type)
4636 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4637 && type_list_equal (TYPE_ARG_TYPES (a->type),
4638 TYPE_ARG_TYPES (b->type)))));
4641 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
4645 case QUAL_UNION_TYPE:
4646 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
4647 || (TYPE_FIELDS (a->type)
4648 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
4649 && TYPE_FIELDS (b->type)
4650 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
4651 && type_list_equal (TYPE_FIELDS (a->type),
4652 TYPE_FIELDS (b->type))));
4655 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
4656 || (TYPE_ARG_TYPES (a->type)
4657 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
4658 && TYPE_ARG_TYPES (b->type)
4659 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
4660 && type_list_equal (TYPE_ARG_TYPES (a->type),
4661 TYPE_ARG_TYPES (b->type))))
4669 if (lang_hooks.types.type_hash_eq != NULL)
4670 return lang_hooks.types.type_hash_eq (a->type, b->type);
4675 /* Return the cached hash value. */
4678 type_hash_hash (const void *item)
4680 return ((const struct type_hash *) item)->hash;
4683 /* Look in the type hash table for a type isomorphic to TYPE.
4684 If one is found, return it. Otherwise return 0. */
4687 type_hash_lookup (hashval_t hashcode, tree type)
4689 struct type_hash *h, in;
4691 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4692 must call that routine before comparing TYPE_ALIGNs. */
4698 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
4705 /* Add an entry to the type-hash-table
4706 for a type TYPE whose hash code is HASHCODE. */
4709 type_hash_add (hashval_t hashcode, tree type)
4711 struct type_hash *h;
4714 h = GGC_NEW (struct type_hash);
4717 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
4721 /* Given TYPE, and HASHCODE its hash code, return the canonical
4722 object for an identical type if one already exists.
4723 Otherwise, return TYPE, and record it as the canonical object.
4725 To use this function, first create a type of the sort you want.
4726 Then compute its hash code from the fields of the type that
4727 make it different from other similar types.
4728 Then call this function and use the value. */
4731 type_hash_canon (unsigned int hashcode, tree type)
4735 /* The hash table only contains main variants, so ensure that's what we're
4737 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
4739 if (!lang_hooks.types.hash_types)
4742 /* See if the type is in the hash table already. If so, return it.
4743 Otherwise, add the type. */
4744 t1 = type_hash_lookup (hashcode, type);
4747 #ifdef GATHER_STATISTICS
4748 tree_node_counts[(int) t_kind]--;
4749 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
4755 type_hash_add (hashcode, type);
4760 /* See if the data pointed to by the type hash table is marked. We consider
4761 it marked if the type is marked or if a debug type number or symbol
4762 table entry has been made for the type. This reduces the amount of
4763 debugging output and eliminates that dependency of the debug output on
4764 the number of garbage collections. */
4767 type_hash_marked_p (const void *p)
4769 const_tree const type = ((const struct type_hash *) p)->type;
4771 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
4775 print_type_hash_statistics (void)
4777 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
4778 (long) htab_size (type_hash_table),
4779 (long) htab_elements (type_hash_table),
4780 htab_collisions (type_hash_table));
4783 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4784 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4785 by adding the hash codes of the individual attributes. */
4788 attribute_hash_list (const_tree list, hashval_t hashcode)
4792 for (tail = list; tail; tail = TREE_CHAIN (tail))
4793 /* ??? Do we want to add in TREE_VALUE too? */
4794 hashcode = iterative_hash_object
4795 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
4799 /* Given two lists of attributes, return true if list l2 is
4800 equivalent to l1. */
4803 attribute_list_equal (const_tree l1, const_tree l2)
4805 return attribute_list_contained (l1, l2)
4806 && attribute_list_contained (l2, l1);
4809 /* Given two lists of attributes, return true if list L2 is
4810 completely contained within L1. */
4811 /* ??? This would be faster if attribute names were stored in a canonicalized
4812 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4813 must be used to show these elements are equivalent (which they are). */
4814 /* ??? It's not clear that attributes with arguments will always be handled
4818 attribute_list_contained (const_tree l1, const_tree l2)
4822 /* First check the obvious, maybe the lists are identical. */
4826 /* Maybe the lists are similar. */
4827 for (t1 = l1, t2 = l2;
4829 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
4830 && TREE_VALUE (t1) == TREE_VALUE (t2);
4831 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
4833 /* Maybe the lists are equal. */
4834 if (t1 == 0 && t2 == 0)
4837 for (; t2 != 0; t2 = TREE_CHAIN (t2))
4840 /* This CONST_CAST is okay because lookup_attribute does not
4841 modify its argument and the return value is assigned to a
4843 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4844 CONST_CAST_TREE(l1));
4846 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
4849 if (TREE_VALUE (t2) != NULL
4850 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
4851 && TREE_VALUE (attr) != NULL
4852 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
4854 if (simple_cst_list_equal (TREE_VALUE (t2),
4855 TREE_VALUE (attr)) == 1)
4858 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
4869 /* Given two lists of types
4870 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4871 return 1 if the lists contain the same types in the same order.
4872 Also, the TREE_PURPOSEs must match. */
4875 type_list_equal (const_tree l1, const_tree l2)
4879 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
4880 if (TREE_VALUE (t1) != TREE_VALUE (t2)
4881 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
4882 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
4883 && (TREE_TYPE (TREE_PURPOSE (t1))
4884 == TREE_TYPE (TREE_PURPOSE (t2))))))
4890 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4891 given by TYPE. If the argument list accepts variable arguments,
4892 then this function counts only the ordinary arguments. */
4895 type_num_arguments (const_tree type)
4900 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
4901 /* If the function does not take a variable number of arguments,
4902 the last element in the list will have type `void'. */
4903 if (VOID_TYPE_P (TREE_VALUE (t)))
4911 /* Nonzero if integer constants T1 and T2
4912 represent the same constant value. */
4915 tree_int_cst_equal (const_tree t1, const_tree t2)
4920 if (t1 == 0 || t2 == 0)
4923 if (TREE_CODE (t1) == INTEGER_CST
4924 && TREE_CODE (t2) == INTEGER_CST
4925 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
4926 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
4932 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4933 The precise way of comparison depends on their data type. */
4936 tree_int_cst_lt (const_tree t1, const_tree t2)
4941 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
4943 int t1_sgn = tree_int_cst_sgn (t1);
4944 int t2_sgn = tree_int_cst_sgn (t2);
4946 if (t1_sgn < t2_sgn)
4948 else if (t1_sgn > t2_sgn)
4950 /* Otherwise, both are non-negative, so we compare them as
4951 unsigned just in case one of them would overflow a signed
4954 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
4955 return INT_CST_LT (t1, t2);
4957 return INT_CST_LT_UNSIGNED (t1, t2);
4960 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4963 tree_int_cst_compare (const_tree t1, const_tree t2)
4965 if (tree_int_cst_lt (t1, t2))
4967 else if (tree_int_cst_lt (t2, t1))
4973 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4974 the host. If POS is zero, the value can be represented in a single
4975 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4976 be represented in a single unsigned HOST_WIDE_INT. */
4979 host_integerp (const_tree t, int pos)
4981 return (TREE_CODE (t) == INTEGER_CST
4982 && ((TREE_INT_CST_HIGH (t) == 0
4983 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
4984 || (! pos && TREE_INT_CST_HIGH (t) == -1
4985 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
4986 && (!TYPE_UNSIGNED (TREE_TYPE (t))
4987 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
4988 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
4989 || (pos && TREE_INT_CST_HIGH (t) == 0)));
4992 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4993 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4994 be non-negative. We must be able to satisfy the above conditions. */
4997 tree_low_cst (const_tree t, int pos)
4999 gcc_assert (host_integerp (t, pos));
5000 return TREE_INT_CST_LOW (t);
5003 /* Return the most significant bit of the integer constant T. */
5006 tree_int_cst_msb (const_tree t)
5010 unsigned HOST_WIDE_INT l;
5012 /* Note that using TYPE_PRECISION here is wrong. We care about the
5013 actual bits, not the (arbitrary) range of the type. */
5014 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
5015 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
5016 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
5017 return (l & 1) == 1;
5020 /* Return an indication of the sign of the integer constant T.
5021 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
5022 Note that -1 will never be returned if T's type is unsigned. */
5025 tree_int_cst_sgn (const_tree t)
5027 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
5029 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
5031 else if (TREE_INT_CST_HIGH (t) < 0)
5037 /* Compare two constructor-element-type constants. Return 1 if the lists
5038 are known to be equal; otherwise return 0. */
5041 simple_cst_list_equal (const_tree l1, const_tree l2)
5043 while (l1 != NULL_TREE && l2 != NULL_TREE)
5045 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
5048 l1 = TREE_CHAIN (l1);
5049 l2 = TREE_CHAIN (l2);
5055 /* Return truthvalue of whether T1 is the same tree structure as T2.
5056 Return 1 if they are the same.
5057 Return 0 if they are understandably different.
5058 Return -1 if either contains tree structure not understood by
5062 simple_cst_equal (const_tree t1, const_tree t2)
5064 enum tree_code code1, code2;
5070 if (t1 == 0 || t2 == 0)
5073 code1 = TREE_CODE (t1);
5074 code2 = TREE_CODE (t2);
5076 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
5078 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5079 || code2 == NON_LVALUE_EXPR)
5080 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5082 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
5085 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
5086 || code2 == NON_LVALUE_EXPR)
5087 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
5095 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
5096 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
5099 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
5102 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
5105 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
5106 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
5107 TREE_STRING_LENGTH (t1)));
5111 unsigned HOST_WIDE_INT idx;
5112 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
5113 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
5115 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
5118 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
5119 /* ??? Should we handle also fields here? */
5120 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
5121 VEC_index (constructor_elt, v2, idx)->value))
5127 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5130 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
5133 if (call_expr_nargs (t1) != call_expr_nargs (t2))
5136 const_tree arg1, arg2;
5137 const_call_expr_arg_iterator iter1, iter2;
5138 for (arg1 = first_const_call_expr_arg (t1, &iter1),
5139 arg2 = first_const_call_expr_arg (t2, &iter2);
5141 arg1 = next_const_call_expr_arg (&iter1),
5142 arg2 = next_const_call_expr_arg (&iter2))
5144 cmp = simple_cst_equal (arg1, arg2);
5148 return arg1 == arg2;
5152 /* Special case: if either target is an unallocated VAR_DECL,
5153 it means that it's going to be unified with whatever the
5154 TARGET_EXPR is really supposed to initialize, so treat it
5155 as being equivalent to anything. */
5156 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
5157 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
5158 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
5159 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
5160 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
5161 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
5164 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5169 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
5171 case WITH_CLEANUP_EXPR:
5172 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5176 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
5179 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
5180 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
5194 /* This general rule works for most tree codes. All exceptions should be
5195 handled above. If this is a language-specific tree code, we can't
5196 trust what might be in the operand, so say we don't know
5198 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
5201 switch (TREE_CODE_CLASS (code1))
5205 case tcc_comparison:
5206 case tcc_expression:
5210 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
5212 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
5224 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5225 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5226 than U, respectively. */
5229 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
5231 if (tree_int_cst_sgn (t) < 0)
5233 else if (TREE_INT_CST_HIGH (t) != 0)
5235 else if (TREE_INT_CST_LOW (t) == u)
5237 else if (TREE_INT_CST_LOW (t) < u)
5243 /* Return true if CODE represents an associative tree code. Otherwise
5246 associative_tree_code (enum tree_code code)
5265 /* Return true if CODE represents a commutative tree code. Otherwise
5268 commutative_tree_code (enum tree_code code)
5281 case UNORDERED_EXPR:
5285 case TRUTH_AND_EXPR:
5286 case TRUTH_XOR_EXPR:
5296 /* Generate a hash value for an expression. This can be used iteratively
5297 by passing a previous result as the "val" argument.
5299 This function is intended to produce the same hash for expressions which
5300 would compare equal using operand_equal_p. */
5303 iterative_hash_expr (const_tree t, hashval_t val)
5306 enum tree_code code;
5310 return iterative_hash_pointer (t, val);
5312 code = TREE_CODE (t);
5316 /* Alas, constants aren't shared, so we can't rely on pointer
5319 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
5320 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
5323 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
5325 return iterative_hash_hashval_t (val2, val);
5329 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
5331 return iterative_hash_hashval_t (val2, val);
5334 return iterative_hash (TREE_STRING_POINTER (t),
5335 TREE_STRING_LENGTH (t), val);
5337 val = iterative_hash_expr (TREE_REALPART (t), val);
5338 return iterative_hash_expr (TREE_IMAGPART (t), val);
5340 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
5344 /* we can just compare by pointer. */
5345 return iterative_hash_pointer (t, val);
5348 /* A list of expressions, for a CALL_EXPR or as the elements of a
5350 for (; t; t = TREE_CHAIN (t))
5351 val = iterative_hash_expr (TREE_VALUE (t), val);
5355 unsigned HOST_WIDE_INT idx;
5357 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
5359 val = iterative_hash_expr (field, val);
5360 val = iterative_hash_expr (value, val);
5365 /* When referring to a built-in FUNCTION_DECL, use the
5366 __builtin__ form. Otherwise nodes that compare equal
5367 according to operand_equal_p might get different
5369 if (DECL_BUILT_IN (t))
5371 val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)],
5375 /* else FALL THROUGH */
5377 class = TREE_CODE_CLASS (code);
5379 if (class == tcc_declaration)
5381 /* DECL's have a unique ID */
5382 val = iterative_hash_host_wide_int (DECL_UID (t), val);
5386 gcc_assert (IS_EXPR_CODE_CLASS (class));
5388 val = iterative_hash_object (code, val);
5390 /* Don't hash the type, that can lead to having nodes which
5391 compare equal according to operand_equal_p, but which
5392 have different hash codes. */
5393 if (code == NOP_EXPR
5394 || code == CONVERT_EXPR
5395 || code == NON_LVALUE_EXPR)
5397 /* Make sure to include signness in the hash computation. */
5398 val += TYPE_UNSIGNED (TREE_TYPE (t));
5399 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
5402 else if (commutative_tree_code (code))
5404 /* It's a commutative expression. We want to hash it the same
5405 however it appears. We do this by first hashing both operands
5406 and then rehashing based on the order of their independent
5408 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
5409 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
5413 t = one, one = two, two = t;
5415 val = iterative_hash_hashval_t (one, val);
5416 val = iterative_hash_hashval_t (two, val);
5419 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
5420 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
5427 /* Constructors for pointer, array and function types.
5428 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5429 constructed by language-dependent code, not here.) */
5431 /* Construct, lay out and return the type of pointers to TO_TYPE with
5432 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5433 reference all of memory. If such a type has already been
5434 constructed, reuse it. */
5437 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
5442 if (to_type == error_mark_node)
5443 return error_mark_node;
5445 /* In some cases, languages will have things that aren't a POINTER_TYPE
5446 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5447 In that case, return that type without regard to the rest of our
5450 ??? This is a kludge, but consistent with the way this function has
5451 always operated and there doesn't seem to be a good way to avoid this
5453 if (TYPE_POINTER_TO (to_type) != 0
5454 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
5455 return TYPE_POINTER_TO (to_type);
5457 /* First, if we already have a type for pointers to TO_TYPE and it's
5458 the proper mode, use it. */
5459 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
5460 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5463 t = make_node (POINTER_TYPE);
5465 TREE_TYPE (t) = to_type;
5466 TYPE_MODE (t) = mode;
5467 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5468 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
5469 TYPE_POINTER_TO (to_type) = t;
5471 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5472 SET_TYPE_STRUCTURAL_EQUALITY (t);
5473 else if (TYPE_CANONICAL (to_type) != to_type)
5475 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
5476 mode, can_alias_all);
5478 /* Lay out the type. This function has many callers that are concerned
5479 with expression-construction, and this simplifies them all. */
5485 /* By default build pointers in ptr_mode. */
5488 build_pointer_type (tree to_type)
5490 return build_pointer_type_for_mode (to_type, ptr_mode, false);
5493 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5496 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
5501 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5502 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5503 In that case, return that type without regard to the rest of our
5506 ??? This is a kludge, but consistent with the way this function has
5507 always operated and there doesn't seem to be a good way to avoid this
5509 if (TYPE_REFERENCE_TO (to_type) != 0
5510 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
5511 return TYPE_REFERENCE_TO (to_type);
5513 /* First, if we already have a type for pointers to TO_TYPE and it's
5514 the proper mode, use it. */
5515 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
5516 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
5519 t = make_node (REFERENCE_TYPE);
5521 TREE_TYPE (t) = to_type;
5522 TYPE_MODE (t) = mode;
5523 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
5524 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
5525 TYPE_REFERENCE_TO (to_type) = t;
5527 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
5528 SET_TYPE_STRUCTURAL_EQUALITY (t);
5529 else if (TYPE_CANONICAL (to_type) != to_type)
5531 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
5532 mode, can_alias_all);
5540 /* Build the node for the type of references-to-TO_TYPE by default
5544 build_reference_type (tree to_type)
5546 return build_reference_type_for_mode (to_type, ptr_mode, false);
5549 /* Build a type that is compatible with t but has no cv quals anywhere
5552 const char *const *const * -> char ***. */
5555 build_type_no_quals (tree t)
5557 switch (TREE_CODE (t))
5560 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5562 TYPE_REF_CAN_ALIAS_ALL (t));
5563 case REFERENCE_TYPE:
5565 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
5567 TYPE_REF_CAN_ALIAS_ALL (t));
5569 return TYPE_MAIN_VARIANT (t);
5573 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5574 MAXVAL should be the maximum value in the domain
5575 (one less than the length of the array).
5577 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5578 We don't enforce this limit, that is up to caller (e.g. language front end).
5579 The limit exists because the result is a signed type and we don't handle
5580 sizes that use more than one HOST_WIDE_INT. */
5583 build_index_type (tree maxval)
5585 tree itype = make_node (INTEGER_TYPE);
5587 TREE_TYPE (itype) = sizetype;
5588 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
5589 TYPE_MIN_VALUE (itype) = size_zero_node;
5590 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
5591 TYPE_MODE (itype) = TYPE_MODE (sizetype);
5592 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
5593 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
5594 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
5595 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
5597 if (host_integerp (maxval, 1))
5598 return type_hash_canon (tree_low_cst (maxval, 1), itype);
5601 /* Since we cannot hash this type, we need to compare it using
5602 structural equality checks. */
5603 SET_TYPE_STRUCTURAL_EQUALITY (itype);
5608 /* Builds a signed or unsigned integer type of precision PRECISION.
5609 Used for C bitfields whose precision does not match that of
5610 built-in target types. */
5612 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
5615 tree itype = make_node (INTEGER_TYPE);
5617 TYPE_PRECISION (itype) = precision;
5620 fixup_unsigned_type (itype);
5622 fixup_signed_type (itype);
5624 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
5625 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
5630 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5631 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5632 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5635 build_range_type (tree type, tree lowval, tree highval)
5637 tree itype = make_node (INTEGER_TYPE);
5639 TREE_TYPE (itype) = type;
5640 if (type == NULL_TREE)
5643 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
5644 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
5646 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
5647 TYPE_MODE (itype) = TYPE_MODE (type);
5648 TYPE_SIZE (itype) = TYPE_SIZE (type);
5649 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
5650 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
5651 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
5653 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
5654 return type_hash_canon (tree_low_cst (highval, 0)
5655 - tree_low_cst (lowval, 0),
5661 /* Just like build_index_type, but takes lowval and highval instead
5662 of just highval (maxval). */
5665 build_index_2_type (tree lowval, tree highval)
5667 return build_range_type (sizetype, lowval, highval);
5670 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5671 and number of elements specified by the range of values of INDEX_TYPE.
5672 If such a type has already been constructed, reuse it. */
5675 build_array_type (tree elt_type, tree index_type)
5678 hashval_t hashcode = 0;
5680 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
5682 error ("arrays of functions are not meaningful");
5683 elt_type = integer_type_node;
5686 t = make_node (ARRAY_TYPE);
5687 TREE_TYPE (t) = elt_type;
5688 TYPE_DOMAIN (t) = index_type;
5690 if (index_type == 0)
5693 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5694 t = type_hash_canon (hashcode, t);
5698 if (TYPE_CANONICAL (t) == t)
5700 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type))
5701 SET_TYPE_STRUCTURAL_EQUALITY (t);
5702 else if (TYPE_CANONICAL (elt_type) != elt_type)
5704 = build_array_type (TYPE_CANONICAL (elt_type), index_type);
5710 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
5711 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
5712 t = type_hash_canon (hashcode, t);
5714 if (!COMPLETE_TYPE_P (t))
5717 if (TYPE_CANONICAL (t) == t)
5719 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
5720 || TYPE_STRUCTURAL_EQUALITY_P (index_type))
5721 SET_TYPE_STRUCTURAL_EQUALITY (t);
5722 else if (TYPE_CANONICAL (elt_type) != elt_type
5723 || TYPE_CANONICAL (index_type) != index_type)
5725 = build_array_type (TYPE_CANONICAL (elt_type),
5726 TYPE_CANONICAL (index_type));
5732 /* Recursively examines the array elements of TYPE, until a non-array
5733 element type is found. */
5736 strip_array_types (tree type)
5738 while (TREE_CODE (type) == ARRAY_TYPE)
5739 type = TREE_TYPE (type);
5744 /* Computes the canonical argument types from the argument type list
5747 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5748 on entry to this function, or if any of the ARGTYPES are
5751 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5752 true on entry to this function, or if any of the ARGTYPES are
5755 Returns a canonical argument list, which may be ARGTYPES when the
5756 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5757 true) or would not differ from ARGTYPES. */
5760 maybe_canonicalize_argtypes(tree argtypes,
5761 bool *any_structural_p,
5762 bool *any_noncanonical_p)
5765 bool any_noncanonical_argtypes_p = false;
5767 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
5769 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
5770 /* Fail gracefully by stating that the type is structural. */
5771 *any_structural_p = true;
5772 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
5773 *any_structural_p = true;
5774 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
5775 || TREE_PURPOSE (arg))
5776 /* If the argument has a default argument, we consider it
5777 non-canonical even though the type itself is canonical.
5778 That way, different variants of function and method types
5779 with default arguments will all point to the variant with
5780 no defaults as their canonical type. */
5781 any_noncanonical_argtypes_p = true;
5784 if (*any_structural_p)
5787 if (any_noncanonical_argtypes_p)
5789 /* Build the canonical list of argument types. */
5790 tree canon_argtypes = NULL_TREE;
5791 bool is_void = false;
5793 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
5795 if (arg == void_list_node)
5798 canon_argtypes = tree_cons (NULL_TREE,
5799 TYPE_CANONICAL (TREE_VALUE (arg)),
5803 canon_argtypes = nreverse (canon_argtypes);
5805 canon_argtypes = chainon (canon_argtypes, void_list_node);
5807 /* There is a non-canonical type. */
5808 *any_noncanonical_p = true;
5809 return canon_argtypes;
5812 /* The canonical argument types are the same as ARGTYPES. */
5816 /* Construct, lay out and return
5817 the type of functions returning type VALUE_TYPE
5818 given arguments of types ARG_TYPES.
5819 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5820 are data type nodes for the arguments of the function.
5821 If such a type has already been constructed, reuse it. */
5824 build_function_type (tree value_type, tree arg_types)
5827 hashval_t hashcode = 0;
5828 bool any_structural_p, any_noncanonical_p;
5829 tree canon_argtypes;
5831 if (TREE_CODE (value_type) == FUNCTION_TYPE)
5833 error ("function return type cannot be function");
5834 value_type = integer_type_node;
5837 /* Make a node of the sort we want. */
5838 t = make_node (FUNCTION_TYPE);
5839 TREE_TYPE (t) = value_type;
5840 TYPE_ARG_TYPES (t) = arg_types;
5842 /* If we already have such a type, use the old one. */
5843 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
5844 hashcode = type_hash_list (arg_types, hashcode);
5845 t = type_hash_canon (hashcode, t);
5847 /* Set up the canonical type. */
5848 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
5849 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
5850 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
5852 &any_noncanonical_p);
5853 if (any_structural_p)
5854 SET_TYPE_STRUCTURAL_EQUALITY (t);
5855 else if (any_noncanonical_p)
5856 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
5859 if (!COMPLETE_TYPE_P (t))
5864 /* Build a function type. The RETURN_TYPE is the type returned by the
5865 function. If VAARGS is set, no void_type_node is appended to the
5866 the list. ARGP muse be alway be terminated be a NULL_TREE. */
5869 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
5873 t = va_arg (argp, tree);
5874 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
5875 args = tree_cons (NULL_TREE, t, args);
5880 if (args != NULL_TREE)
5881 args = nreverse (args);
5882 gcc_assert (args != NULL_TREE && last != void_list_node);
5884 else if (args == NULL_TREE)
5885 args = void_list_node;
5889 args = nreverse (args);
5890 TREE_CHAIN (last) = void_list_node;
5892 args = build_function_type (return_type, args);
5897 /* Build a function type. The RETURN_TYPE is the type returned by the
5898 function. If additional arguments are provided, they are
5899 additional argument types. The list of argument types must always
5900 be terminated by NULL_TREE. */
5903 build_function_type_list (tree return_type, ...)
5908 va_start (p, return_type);
5909 args = build_function_type_list_1 (false, return_type, p);
5914 /* Build a variable argument function type. The RETURN_TYPE is the
5915 type returned by the function. If additional arguments are provided,
5916 they are additional argument types. The list of argument types must
5917 always be terminated by NULL_TREE. */
5920 build_varargs_function_type_list (tree return_type, ...)
5925 va_start (p, return_type);
5926 args = build_function_type_list_1 (true, return_type, p);
5932 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5933 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5934 for the method. An implicit additional parameter (of type
5935 pointer-to-BASETYPE) is added to the ARGTYPES. */
5938 build_method_type_directly (tree basetype,
5945 bool any_structural_p, any_noncanonical_p;
5946 tree canon_argtypes;
5948 /* Make a node of the sort we want. */
5949 t = make_node (METHOD_TYPE);
5951 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
5952 TREE_TYPE (t) = rettype;
5953 ptype = build_pointer_type (basetype);
5955 /* The actual arglist for this function includes a "hidden" argument
5956 which is "this". Put it into the list of argument types. */
5957 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
5958 TYPE_ARG_TYPES (t) = argtypes;
5960 /* If we already have such a type, use the old one. */
5961 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
5962 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
5963 hashcode = type_hash_list (argtypes, hashcode);
5964 t = type_hash_canon (hashcode, t);
5966 /* Set up the canonical type. */
5968 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
5969 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
5971 = (TYPE_CANONICAL (basetype) != basetype
5972 || TYPE_CANONICAL (rettype) != rettype);
5973 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
5975 &any_noncanonical_p);
5976 if (any_structural_p)
5977 SET_TYPE_STRUCTURAL_EQUALITY (t);
5978 else if (any_noncanonical_p)
5980 = build_method_type_directly (TYPE_CANONICAL (basetype),
5981 TYPE_CANONICAL (rettype),
5983 if (!COMPLETE_TYPE_P (t))
5989 /* Construct, lay out and return the type of methods belonging to class
5990 BASETYPE and whose arguments and values are described by TYPE.
5991 If that type exists already, reuse it.
5992 TYPE must be a FUNCTION_TYPE node. */
5995 build_method_type (tree basetype, tree type)
5997 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
5999 return build_method_type_directly (basetype,
6001 TYPE_ARG_TYPES (type));
6004 /* Construct, lay out and return the type of offsets to a value
6005 of type TYPE, within an object of type BASETYPE.
6006 If a suitable offset type exists already, reuse it. */
6009 build_offset_type (tree basetype, tree type)
6012 hashval_t hashcode = 0;
6014 /* Make a node of the sort we want. */
6015 t = make_node (OFFSET_TYPE);
6017 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
6018 TREE_TYPE (t) = type;
6020 /* If we already have such a type, use the old one. */
6021 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
6022 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
6023 t = type_hash_canon (hashcode, t);
6025 if (!COMPLETE_TYPE_P (t))
6028 if (TYPE_CANONICAL (t) == t)
6030 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
6031 || TYPE_STRUCTURAL_EQUALITY_P (type))
6032 SET_TYPE_STRUCTURAL_EQUALITY (t);
6033 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
6034 || TYPE_CANONICAL (type) != type)
6036 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
6037 TYPE_CANONICAL (type));
6043 /* Create a complex type whose components are COMPONENT_TYPE. */
6046 build_complex_type (tree component_type)
6051 /* Make a node of the sort we want. */
6052 t = make_node (COMPLEX_TYPE);
6054 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
6056 /* If we already have such a type, use the old one. */
6057 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
6058 t = type_hash_canon (hashcode, t);
6060 if (!COMPLETE_TYPE_P (t))
6063 if (TYPE_CANONICAL (t) == t)
6065 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
6066 SET_TYPE_STRUCTURAL_EQUALITY (t);
6067 else if (TYPE_CANONICAL (component_type) != component_type)
6069 = build_complex_type (TYPE_CANONICAL (component_type));
6072 /* We need to create a name, since complex is a fundamental type. */
6073 if (! TYPE_NAME (t))
6076 if (component_type == char_type_node)
6077 name = "complex char";
6078 else if (component_type == signed_char_type_node)
6079 name = "complex signed char";
6080 else if (component_type == unsigned_char_type_node)
6081 name = "complex unsigned char";
6082 else if (component_type == short_integer_type_node)
6083 name = "complex short int";
6084 else if (component_type == short_unsigned_type_node)
6085 name = "complex short unsigned int";
6086 else if (component_type == integer_type_node)
6087 name = "complex int";
6088 else if (component_type == unsigned_type_node)
6089 name = "complex unsigned int";
6090 else if (component_type == long_integer_type_node)
6091 name = "complex long int";
6092 else if (component_type == long_unsigned_type_node)
6093 name = "complex long unsigned int";
6094 else if (component_type == long_long_integer_type_node)
6095 name = "complex long long int";
6096 else if (component_type == long_long_unsigned_type_node)
6097 name = "complex long long unsigned int";
6102 TYPE_NAME (t) = build_decl (TYPE_DECL, get_identifier (name), t);
6105 return build_qualified_type (t, TYPE_QUALS (component_type));
6108 /* Return OP, stripped of any conversions to wider types as much as is safe.
6109 Converting the value back to OP's type makes a value equivalent to OP.
6111 If FOR_TYPE is nonzero, we return a value which, if converted to
6112 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6114 OP must have integer, real or enumeral type. Pointers are not allowed!
6116 There are some cases where the obvious value we could return
6117 would regenerate to OP if converted to OP's type,
6118 but would not extend like OP to wider types.
6119 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6120 For example, if OP is (unsigned short)(signed char)-1,
6121 we avoid returning (signed char)-1 if FOR_TYPE is int,
6122 even though extending that to an unsigned short would regenerate OP,
6123 since the result of extending (signed char)-1 to (int)
6124 is different from (int) OP. */
6127 get_unwidened (tree op, tree for_type)
6129 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6130 tree type = TREE_TYPE (op);
6132 = TYPE_PRECISION (for_type != 0 ? for_type : type);
6134 = (for_type != 0 && for_type != type
6135 && final_prec > TYPE_PRECISION (type)
6136 && TYPE_UNSIGNED (type));
6139 while (CONVERT_EXPR_P (op))
6143 /* TYPE_PRECISION on vector types has different meaning
6144 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6145 so avoid them here. */
6146 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
6149 bitschange = TYPE_PRECISION (TREE_TYPE (op))
6150 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
6152 /* Truncations are many-one so cannot be removed.
6153 Unless we are later going to truncate down even farther. */
6155 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
6158 /* See what's inside this conversion. If we decide to strip it,
6160 op = TREE_OPERAND (op, 0);
6162 /* If we have not stripped any zero-extensions (uns is 0),
6163 we can strip any kind of extension.
6164 If we have previously stripped a zero-extension,
6165 only zero-extensions can safely be stripped.
6166 Any extension can be stripped if the bits it would produce
6167 are all going to be discarded later by truncating to FOR_TYPE. */
6171 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
6173 /* TYPE_UNSIGNED says whether this is a zero-extension.
6174 Let's avoid computing it if it does not affect WIN
6175 and if UNS will not be needed again. */
6177 || CONVERT_EXPR_P (op))
6178 && TYPE_UNSIGNED (TREE_TYPE (op)))
6189 /* Return OP or a simpler expression for a narrower value
6190 which can be sign-extended or zero-extended to give back OP.
6191 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6192 or 0 if the value should be sign-extended. */
6195 get_narrower (tree op, int *unsignedp_ptr)
6200 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
6202 while (TREE_CODE (op) == NOP_EXPR)
6205 = (TYPE_PRECISION (TREE_TYPE (op))
6206 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
6208 /* Truncations are many-one so cannot be removed. */
6212 /* See what's inside this conversion. If we decide to strip it,
6217 op = TREE_OPERAND (op, 0);
6218 /* An extension: the outermost one can be stripped,
6219 but remember whether it is zero or sign extension. */
6221 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6222 /* Otherwise, if a sign extension has been stripped,
6223 only sign extensions can now be stripped;
6224 if a zero extension has been stripped, only zero-extensions. */
6225 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
6229 else /* bitschange == 0 */
6231 /* A change in nominal type can always be stripped, but we must
6232 preserve the unsignedness. */
6234 uns = TYPE_UNSIGNED (TREE_TYPE (op));
6236 op = TREE_OPERAND (op, 0);
6237 /* Keep trying to narrow, but don't assign op to win if it
6238 would turn an integral type into something else. */
6239 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
6246 if (TREE_CODE (op) == COMPONENT_REF
6247 /* Since type_for_size always gives an integer type. */
6248 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
6249 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
6250 /* Ensure field is laid out already. */
6251 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
6252 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
6254 unsigned HOST_WIDE_INT innerprec
6255 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
6256 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
6257 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
6258 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
6260 /* We can get this structure field in a narrower type that fits it,
6261 but the resulting extension to its nominal type (a fullword type)
6262 must satisfy the same conditions as for other extensions.
6264 Do this only for fields that are aligned (not bit-fields),
6265 because when bit-field insns will be used there is no
6266 advantage in doing this. */
6268 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
6269 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
6270 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
6274 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
6275 win = fold_convert (type, op);
6279 *unsignedp_ptr = uns;
6283 /* Nonzero if integer constant C has a value that is permissible
6284 for type TYPE (an INTEGER_TYPE). */
6287 int_fits_type_p (const_tree c, const_tree type)
6289 tree type_low_bound = TYPE_MIN_VALUE (type);
6290 tree type_high_bound = TYPE_MAX_VALUE (type);
6291 bool ok_for_low_bound, ok_for_high_bound;
6292 unsigned HOST_WIDE_INT low;
6295 /* If at least one bound of the type is a constant integer, we can check
6296 ourselves and maybe make a decision. If no such decision is possible, but
6297 this type is a subtype, try checking against that. Otherwise, use
6298 fit_double_type, which checks against the precision.
6300 Compute the status for each possibly constant bound, and return if we see
6301 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6302 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6303 for "constant known to fit". */
6305 /* Check if C >= type_low_bound. */
6306 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
6308 if (tree_int_cst_lt (c, type_low_bound))
6310 ok_for_low_bound = true;
6313 ok_for_low_bound = false;
6315 /* Check if c <= type_high_bound. */
6316 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
6318 if (tree_int_cst_lt (type_high_bound, c))
6320 ok_for_high_bound = true;
6323 ok_for_high_bound = false;
6325 /* If the constant fits both bounds, the result is known. */
6326 if (ok_for_low_bound && ok_for_high_bound)
6329 /* Perform some generic filtering which may allow making a decision
6330 even if the bounds are not constant. First, negative integers
6331 never fit in unsigned types, */
6332 if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
6335 /* Second, narrower types always fit in wider ones. */
6336 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
6339 /* Third, unsigned integers with top bit set never fit signed types. */
6340 if (! TYPE_UNSIGNED (type)
6341 && TYPE_UNSIGNED (TREE_TYPE (c))
6342 && tree_int_cst_msb (c))
6345 /* If we haven't been able to decide at this point, there nothing more we
6346 can check ourselves here. Look at the base type if we have one and it
6347 has the same precision. */
6348 if (TREE_CODE (type) == INTEGER_TYPE
6349 && TREE_TYPE (type) != 0
6350 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
6351 return int_fits_type_p (c, TREE_TYPE (type));
6353 /* Or to fit_double_type, if nothing else. */
6354 low = TREE_INT_CST_LOW (c);
6355 high = TREE_INT_CST_HIGH (c);
6356 return !fit_double_type (low, high, &low, &high, type);
6359 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6360 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6361 represented (assuming two's-complement arithmetic) within the bit
6362 precision of the type are returned instead. */
6365 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
6367 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
6368 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
6369 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
6370 TYPE_UNSIGNED (type));
6373 if (TYPE_UNSIGNED (type))
6374 mpz_set_ui (min, 0);
6378 mn = double_int_mask (TYPE_PRECISION (type) - 1);
6379 mn = double_int_sext (double_int_add (mn, double_int_one),
6380 TYPE_PRECISION (type));
6381 mpz_set_double_int (min, mn, false);
6385 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
6386 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
6387 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
6388 TYPE_UNSIGNED (type));
6391 if (TYPE_UNSIGNED (type))
6392 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
6395 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
6400 /* auto_var_in_fn_p is called to determine whether VAR is an automatic
6401 variable defined in function FN. */
6404 auto_var_in_fn_p (const_tree var, const_tree fn)
6406 return (DECL_P (var) && DECL_CONTEXT (var) == fn
6407 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
6408 && ! TREE_STATIC (var))
6409 || TREE_CODE (var) == LABEL_DECL
6410 || TREE_CODE (var) == RESULT_DECL));
6413 /* Subprogram of following function. Called by walk_tree.
6415 Return *TP if it is an automatic variable or parameter of the
6416 function passed in as DATA. */
6419 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
6421 tree fn = (tree) data;
6426 else if (DECL_P (*tp)
6427 && auto_var_in_fn_p (*tp, fn))
6433 /* Returns true if T is, contains, or refers to a type with variable
6434 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6435 arguments, but not the return type. If FN is nonzero, only return
6436 true if a modifier of the type or position of FN is a variable or
6437 parameter inside FN.
6439 This concept is more general than that of C99 'variably modified types':
6440 in C99, a struct type is never variably modified because a VLA may not
6441 appear as a structure member. However, in GNU C code like:
6443 struct S { int i[f()]; };
6445 is valid, and other languages may define similar constructs. */
6448 variably_modified_type_p (tree type, tree fn)
6452 /* Test if T is either variable (if FN is zero) or an expression containing
6453 a variable in FN. */
6454 #define RETURN_TRUE_IF_VAR(T) \
6455 do { tree _t = (T); \
6456 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6457 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6458 return true; } while (0)
6460 if (type == error_mark_node)
6463 /* If TYPE itself has variable size, it is variably modified. */
6464 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
6465 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
6467 switch (TREE_CODE (type))
6470 case REFERENCE_TYPE:
6472 if (variably_modified_type_p (TREE_TYPE (type), fn))
6478 /* If TYPE is a function type, it is variably modified if the
6479 return type is variably modified. */
6480 if (variably_modified_type_p (TREE_TYPE (type), fn))
6486 case FIXED_POINT_TYPE:
6489 /* Scalar types are variably modified if their end points
6491 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
6492 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
6497 case QUAL_UNION_TYPE:
6498 /* We can't see if any of the fields are variably-modified by the
6499 definition we normally use, since that would produce infinite
6500 recursion via pointers. */
6501 /* This is variably modified if some field's type is. */
6502 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
6503 if (TREE_CODE (t) == FIELD_DECL)
6505 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
6506 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
6507 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
6509 if (TREE_CODE (type) == QUAL_UNION_TYPE)
6510 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
6515 /* Do not call ourselves to avoid infinite recursion. This is
6516 variably modified if the element type is. */
6517 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
6518 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
6525 /* The current language may have other cases to check, but in general,
6526 all other types are not variably modified. */
6527 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
6529 #undef RETURN_TRUE_IF_VAR
6532 /* Given a DECL or TYPE, return the scope in which it was declared, or
6533 NULL_TREE if there is no containing scope. */
6536 get_containing_scope (const_tree t)
6538 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
6541 /* Return the innermost context enclosing DECL that is
6542 a FUNCTION_DECL, or zero if none. */
6545 decl_function_context (const_tree decl)
6549 if (TREE_CODE (decl) == ERROR_MARK)
6552 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6553 where we look up the function at runtime. Such functions always take
6554 a first argument of type 'pointer to real context'.
6556 C++ should really be fixed to use DECL_CONTEXT for the real context,
6557 and use something else for the "virtual context". */
6558 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
6561 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
6563 context = DECL_CONTEXT (decl);
6565 while (context && TREE_CODE (context) != FUNCTION_DECL)
6567 if (TREE_CODE (context) == BLOCK)
6568 context = BLOCK_SUPERCONTEXT (context);
6570 context = get_containing_scope (context);
6576 /* Return the innermost context enclosing DECL that is
6577 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6578 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6581 decl_type_context (const_tree decl)
6583 tree context = DECL_CONTEXT (decl);
6586 switch (TREE_CODE (context))
6588 case NAMESPACE_DECL:
6589 case TRANSLATION_UNIT_DECL:
6594 case QUAL_UNION_TYPE:
6599 context = DECL_CONTEXT (context);
6603 context = BLOCK_SUPERCONTEXT (context);
6613 /* CALL is a CALL_EXPR. Return the declaration for the function
6614 called, or NULL_TREE if the called function cannot be
6618 get_callee_fndecl (const_tree call)
6622 if (call == error_mark_node)
6623 return error_mark_node;
6625 /* It's invalid to call this function with anything but a
6627 gcc_assert (TREE_CODE (call) == CALL_EXPR);
6629 /* The first operand to the CALL is the address of the function
6631 addr = CALL_EXPR_FN (call);
6635 /* If this is a readonly function pointer, extract its initial value. */
6636 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
6637 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
6638 && DECL_INITIAL (addr))
6639 addr = DECL_INITIAL (addr);
6641 /* If the address is just `&f' for some function `f', then we know
6642 that `f' is being called. */
6643 if (TREE_CODE (addr) == ADDR_EXPR
6644 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
6645 return TREE_OPERAND (addr, 0);
6647 /* We couldn't figure out what was being called. Maybe the front
6648 end has some idea. */
6649 return lang_hooks.lang_get_callee_fndecl (call);
6652 /* Print debugging information about tree nodes generated during the compile,
6653 and any language-specific information. */
6656 dump_tree_statistics (void)
6658 #ifdef GATHER_STATISTICS
6660 int total_nodes, total_bytes;
6663 fprintf (stderr, "\n??? tree nodes created\n\n");
6664 #ifdef GATHER_STATISTICS
6665 fprintf (stderr, "Kind Nodes Bytes\n");
6666 fprintf (stderr, "---------------------------------------\n");
6667 total_nodes = total_bytes = 0;
6668 for (i = 0; i < (int) all_kinds; i++)
6670 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
6671 tree_node_counts[i], tree_node_sizes[i]);
6672 total_nodes += tree_node_counts[i];
6673 total_bytes += tree_node_sizes[i];
6675 fprintf (stderr, "---------------------------------------\n");
6676 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
6677 fprintf (stderr, "---------------------------------------\n");
6678 ssanames_print_statistics ();
6679 phinodes_print_statistics ();
6681 fprintf (stderr, "(No per-node statistics)\n");
6683 print_type_hash_statistics ();
6684 print_debug_expr_statistics ();
6685 print_value_expr_statistics ();
6686 print_restrict_base_statistics ();
6687 lang_hooks.print_statistics ();
6690 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6692 /* Generate a crc32 of a string. */
6695 crc32_string (unsigned chksum, const char *string)
6699 unsigned value = *string << 24;
6702 for (ix = 8; ix--; value <<= 1)
6706 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
6715 /* P is a string that will be used in a symbol. Mask out any characters
6716 that are not valid in that context. */
6719 clean_symbol_name (char *p)
6723 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6726 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6733 /* Generate a name for a special-purpose function function.
6734 The generated name may need to be unique across the whole link.
6735 TYPE is some string to identify the purpose of this function to the
6736 linker or collect2; it must start with an uppercase letter,
6738 I - for constructors
6740 N - for C++ anonymous namespaces
6741 F - for DWARF unwind frame information. */
6744 get_file_function_name (const char *type)
6750 /* If we already have a name we know to be unique, just use that. */
6751 if (first_global_object_name)
6752 p = first_global_object_name;
6753 /* If the target is handling the constructors/destructors, they
6754 will be local to this file and the name is only necessary for
6755 debugging purposes. */
6756 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
6758 const char *file = main_input_filename;
6760 file = input_filename;
6761 /* Just use the file's basename, because the full pathname
6762 might be quite long. */
6763 p = strrchr (file, '/');
6768 p = q = ASTRDUP (p);
6769 clean_symbol_name (q);
6773 /* Otherwise, the name must be unique across the entire link.
6774 We don't have anything that we know to be unique to this translation
6775 unit, so use what we do have and throw in some randomness. */
6777 const char *name = weak_global_object_name;
6778 const char *file = main_input_filename;
6783 file = input_filename;
6785 len = strlen (file);
6786 q = (char *) alloca (9 * 2 + len + 1);
6787 memcpy (q, file, len + 1);
6788 clean_symbol_name (q);
6790 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
6791 crc32_string (0, get_random_seed (false)));
6796 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
6799 /* Set up the name of the file-level functions we may need.
6800 Use a global object (which is already required to be unique over
6801 the program) rather than the file name (which imposes extra
6803 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
6805 return get_identifier (buf);
6808 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6810 /* Complain that the tree code of NODE does not match the expected 0
6811 terminated list of trailing codes. The trailing code list can be
6812 empty, for a more vague error message. FILE, LINE, and FUNCTION
6813 are of the caller. */
6816 tree_check_failed (const_tree node, const char *file,
6817 int line, const char *function, ...)
6821 unsigned length = 0;
6824 va_start (args, function);
6825 while ((code = va_arg (args, int)))
6826 length += 4 + strlen (tree_code_name[code]);
6831 va_start (args, function);
6832 length += strlen ("expected ");
6833 buffer = tmp = (char *) alloca (length);
6835 while ((code = va_arg (args, int)))
6837 const char *prefix = length ? " or " : "expected ";
6839 strcpy (tmp + length, prefix);
6840 length += strlen (prefix);
6841 strcpy (tmp + length, tree_code_name[code]);
6842 length += strlen (tree_code_name[code]);
6847 buffer = "unexpected node";
6849 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6850 buffer, tree_code_name[TREE_CODE (node)],
6851 function, trim_filename (file), line);
6854 /* Complain that the tree code of NODE does match the expected 0
6855 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6859 tree_not_check_failed (const_tree node, const char *file,
6860 int line, const char *function, ...)
6864 unsigned length = 0;
6867 va_start (args, function);
6868 while ((code = va_arg (args, int)))
6869 length += 4 + strlen (tree_code_name[code]);
6871 va_start (args, function);
6872 buffer = (char *) alloca (length);
6874 while ((code = va_arg (args, int)))
6878 strcpy (buffer + length, " or ");
6881 strcpy (buffer + length, tree_code_name[code]);
6882 length += strlen (tree_code_name[code]);
6886 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6887 buffer, tree_code_name[TREE_CODE (node)],
6888 function, trim_filename (file), line);
6891 /* Similar to tree_check_failed, except that we check for a class of tree
6892 code, given in CL. */
6895 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
6896 const char *file, int line, const char *function)
6899 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6900 TREE_CODE_CLASS_STRING (cl),
6901 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6902 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6905 /* Similar to tree_check_failed, except that instead of specifying a
6906 dozen codes, use the knowledge that they're all sequential. */
6909 tree_range_check_failed (const_tree node, const char *file, int line,
6910 const char *function, enum tree_code c1,
6914 unsigned length = 0;
6917 for (c = c1; c <= c2; ++c)
6918 length += 4 + strlen (tree_code_name[c]);
6920 length += strlen ("expected ");
6921 buffer = (char *) alloca (length);
6924 for (c = c1; c <= c2; ++c)
6926 const char *prefix = length ? " or " : "expected ";
6928 strcpy (buffer + length, prefix);
6929 length += strlen (prefix);
6930 strcpy (buffer + length, tree_code_name[c]);
6931 length += strlen (tree_code_name[c]);
6934 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6935 buffer, tree_code_name[TREE_CODE (node)],
6936 function, trim_filename (file), line);
6940 /* Similar to tree_check_failed, except that we check that a tree does
6941 not have the specified code, given in CL. */
6944 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
6945 const char *file, int line, const char *function)
6948 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6949 TREE_CODE_CLASS_STRING (cl),
6950 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
6951 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
6955 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6958 omp_clause_check_failed (const_tree node, const char *file, int line,
6959 const char *function, enum omp_clause_code code)
6961 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6962 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
6963 function, trim_filename (file), line);
6967 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6970 omp_clause_range_check_failed (const_tree node, const char *file, int line,
6971 const char *function, enum omp_clause_code c1,
6972 enum omp_clause_code c2)
6975 unsigned length = 0;
6976 enum omp_clause_code c;
6978 for (c = c1; c <= c2; ++c)
6979 length += 4 + strlen (omp_clause_code_name[c]);
6981 length += strlen ("expected ");
6982 buffer = (char *) alloca (length);
6985 for (c = c1; c <= c2; ++c)
6987 const char *prefix = length ? " or " : "expected ";
6989 strcpy (buffer + length, prefix);
6990 length += strlen (prefix);
6991 strcpy (buffer + length, omp_clause_code_name[c]);
6992 length += strlen (omp_clause_code_name[c]);
6995 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6996 buffer, omp_clause_code_name[TREE_CODE (node)],
6997 function, trim_filename (file), line);
7001 #undef DEFTREESTRUCT
7002 #define DEFTREESTRUCT(VAL, NAME) NAME,
7004 static const char *ts_enum_names[] = {
7005 #include "treestruct.def"
7007 #undef DEFTREESTRUCT
7009 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
7011 /* Similar to tree_class_check_failed, except that we check for
7012 whether CODE contains the tree structure identified by EN. */
7015 tree_contains_struct_check_failed (const_tree node,
7016 const enum tree_node_structure_enum en,
7017 const char *file, int line,
7018 const char *function)
7021 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7023 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
7027 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7028 (dynamically sized) vector. */
7031 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
7032 const char *function)
7035 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7036 idx + 1, len, function, trim_filename (file), line);
7039 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
7040 (dynamically sized) vector. */
7043 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
7044 const char *function)
7047 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
7048 idx + 1, len, function, trim_filename (file), line);
7051 /* Similar to above, except that the check is for the bounds of the operand
7052 vector of an expression node EXP. */
7055 tree_operand_check_failed (int idx, const_tree exp, const char *file,
7056 int line, const char *function)
7058 int code = TREE_CODE (exp);
7060 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7061 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
7062 function, trim_filename (file), line);
7065 /* Similar to above, except that the check is for the number of
7066 operands of an OMP_CLAUSE node. */
7069 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
7070 int line, const char *function)
7073 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7074 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
7075 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
7076 trim_filename (file), line);
7078 #endif /* ENABLE_TREE_CHECKING */
7080 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7081 and mapped to the machine mode MODE. Initialize its fields and build
7082 the information necessary for debugging output. */
7085 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
7088 hashval_t hashcode = 0;
7090 /* Build a main variant, based on the main variant of the inner type, then
7091 use it to build the variant we return. */
7092 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
7093 && TYPE_MAIN_VARIANT (innertype) != innertype)
7094 return build_type_attribute_qual_variant (
7095 make_vector_type (TYPE_MAIN_VARIANT (innertype), nunits, mode),
7096 TYPE_ATTRIBUTES (innertype),
7097 TYPE_QUALS (innertype));
7099 t = make_node (VECTOR_TYPE);
7100 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
7101 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
7102 TYPE_MODE (t) = mode;
7103 TYPE_READONLY (t) = TYPE_READONLY (innertype);
7104 TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype);
7106 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
7107 SET_TYPE_STRUCTURAL_EQUALITY (t);
7108 else if (TYPE_CANONICAL (innertype) != innertype
7109 || mode != VOIDmode)
7111 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
7116 tree index = build_int_cst (NULL_TREE, nunits - 1);
7117 tree array = build_array_type (innertype, build_index_type (index));
7118 tree rt = make_node (RECORD_TYPE);
7120 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
7121 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
7123 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
7124 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7125 the representation type, and we want to find that die when looking up
7126 the vector type. This is most easily achieved by making the TYPE_UID
7128 TYPE_UID (rt) = TYPE_UID (t);
7131 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
7132 hashcode = iterative_hash_host_wide_int (mode, hashcode);
7133 hashcode = iterative_hash_object (TYPE_HASH (innertype), hashcode);
7134 return type_hash_canon (hashcode, t);
7138 make_or_reuse_type (unsigned size, int unsignedp)
7140 if (size == INT_TYPE_SIZE)
7141 return unsignedp ? unsigned_type_node : integer_type_node;
7142 if (size == CHAR_TYPE_SIZE)
7143 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
7144 if (size == SHORT_TYPE_SIZE)
7145 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
7146 if (size == LONG_TYPE_SIZE)
7147 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
7148 if (size == LONG_LONG_TYPE_SIZE)
7149 return (unsignedp ? long_long_unsigned_type_node
7150 : long_long_integer_type_node);
7153 return make_unsigned_type (size);
7155 return make_signed_type (size);
7158 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7161 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
7165 if (size == SHORT_FRACT_TYPE_SIZE)
7166 return unsignedp ? sat_unsigned_short_fract_type_node
7167 : sat_short_fract_type_node;
7168 if (size == FRACT_TYPE_SIZE)
7169 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
7170 if (size == LONG_FRACT_TYPE_SIZE)
7171 return unsignedp ? sat_unsigned_long_fract_type_node
7172 : sat_long_fract_type_node;
7173 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7174 return unsignedp ? sat_unsigned_long_long_fract_type_node
7175 : sat_long_long_fract_type_node;
7179 if (size == SHORT_FRACT_TYPE_SIZE)
7180 return unsignedp ? unsigned_short_fract_type_node
7181 : short_fract_type_node;
7182 if (size == FRACT_TYPE_SIZE)
7183 return unsignedp ? unsigned_fract_type_node : fract_type_node;
7184 if (size == LONG_FRACT_TYPE_SIZE)
7185 return unsignedp ? unsigned_long_fract_type_node
7186 : long_fract_type_node;
7187 if (size == LONG_LONG_FRACT_TYPE_SIZE)
7188 return unsignedp ? unsigned_long_long_fract_type_node
7189 : long_long_fract_type_node;
7192 return make_fract_type (size, unsignedp, satp);
7195 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7198 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
7202 if (size == SHORT_ACCUM_TYPE_SIZE)
7203 return unsignedp ? sat_unsigned_short_accum_type_node
7204 : sat_short_accum_type_node;
7205 if (size == ACCUM_TYPE_SIZE)
7206 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
7207 if (size == LONG_ACCUM_TYPE_SIZE)
7208 return unsignedp ? sat_unsigned_long_accum_type_node
7209 : sat_long_accum_type_node;
7210 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7211 return unsignedp ? sat_unsigned_long_long_accum_type_node
7212 : sat_long_long_accum_type_node;
7216 if (size == SHORT_ACCUM_TYPE_SIZE)
7217 return unsignedp ? unsigned_short_accum_type_node
7218 : short_accum_type_node;
7219 if (size == ACCUM_TYPE_SIZE)
7220 return unsignedp ? unsigned_accum_type_node : accum_type_node;
7221 if (size == LONG_ACCUM_TYPE_SIZE)
7222 return unsignedp ? unsigned_long_accum_type_node
7223 : long_accum_type_node;
7224 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
7225 return unsignedp ? unsigned_long_long_accum_type_node
7226 : long_long_accum_type_node;
7229 return make_accum_type (size, unsignedp, satp);
7232 /* Create nodes for all integer types (and error_mark_node) using the sizes
7233 of C datatypes. The caller should call set_sizetype soon after calling
7234 this function to select one of the types as sizetype. */
7237 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
7239 error_mark_node = make_node (ERROR_MARK);
7240 TREE_TYPE (error_mark_node) = error_mark_node;
7242 initialize_sizetypes (signed_sizetype);
7244 /* Define both `signed char' and `unsigned char'. */
7245 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
7246 TYPE_STRING_FLAG (signed_char_type_node) = 1;
7247 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
7248 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
7250 /* Define `char', which is like either `signed char' or `unsigned char'
7251 but not the same as either. */
7254 ? make_signed_type (CHAR_TYPE_SIZE)
7255 : make_unsigned_type (CHAR_TYPE_SIZE));
7256 TYPE_STRING_FLAG (char_type_node) = 1;
7258 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
7259 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
7260 integer_type_node = make_signed_type (INT_TYPE_SIZE);
7261 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
7262 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
7263 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
7264 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
7265 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
7267 /* Define a boolean type. This type only represents boolean values but
7268 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7269 Front ends which want to override this size (i.e. Java) can redefine
7270 boolean_type_node before calling build_common_tree_nodes_2. */
7271 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
7272 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
7273 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
7274 TYPE_PRECISION (boolean_type_node) = 1;
7276 /* Fill in the rest of the sized types. Reuse existing type nodes
7278 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
7279 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
7280 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
7281 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
7282 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
7284 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
7285 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
7286 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
7287 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
7288 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
7290 access_public_node = get_identifier ("public");
7291 access_protected_node = get_identifier ("protected");
7292 access_private_node = get_identifier ("private");
7295 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7296 It will create several other common tree nodes. */
7299 build_common_tree_nodes_2 (int short_double)
7301 /* Define these next since types below may used them. */
7302 integer_zero_node = build_int_cst (NULL_TREE, 0);
7303 integer_one_node = build_int_cst (NULL_TREE, 1);
7304 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
7306 size_zero_node = size_int (0);
7307 size_one_node = size_int (1);
7308 bitsize_zero_node = bitsize_int (0);
7309 bitsize_one_node = bitsize_int (1);
7310 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
7312 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
7313 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
7315 void_type_node = make_node (VOID_TYPE);
7316 layout_type (void_type_node);
7318 /* We are not going to have real types in C with less than byte alignment,
7319 so we might as well not have any types that claim to have it. */
7320 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
7321 TYPE_USER_ALIGN (void_type_node) = 0;
7323 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
7324 layout_type (TREE_TYPE (null_pointer_node));
7326 ptr_type_node = build_pointer_type (void_type_node);
7328 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
7329 fileptr_type_node = ptr_type_node;
7331 float_type_node = make_node (REAL_TYPE);
7332 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
7333 layout_type (float_type_node);
7335 double_type_node = make_node (REAL_TYPE);
7337 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
7339 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
7340 layout_type (double_type_node);
7342 long_double_type_node = make_node (REAL_TYPE);
7343 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
7344 layout_type (long_double_type_node);
7346 float_ptr_type_node = build_pointer_type (float_type_node);
7347 double_ptr_type_node = build_pointer_type (double_type_node);
7348 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
7349 integer_ptr_type_node = build_pointer_type (integer_type_node);
7351 /* Fixed size integer types. */
7352 uint32_type_node = build_nonstandard_integer_type (32, true);
7353 uint64_type_node = build_nonstandard_integer_type (64, true);
7355 /* Decimal float types. */
7356 dfloat32_type_node = make_node (REAL_TYPE);
7357 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
7358 layout_type (dfloat32_type_node);
7359 TYPE_MODE (dfloat32_type_node) = SDmode;
7360 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
7362 dfloat64_type_node = make_node (REAL_TYPE);
7363 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
7364 layout_type (dfloat64_type_node);
7365 TYPE_MODE (dfloat64_type_node) = DDmode;
7366 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
7368 dfloat128_type_node = make_node (REAL_TYPE);
7369 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
7370 layout_type (dfloat128_type_node);
7371 TYPE_MODE (dfloat128_type_node) = TDmode;
7372 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
7374 complex_integer_type_node = build_complex_type (integer_type_node);
7375 complex_float_type_node = build_complex_type (float_type_node);
7376 complex_double_type_node = build_complex_type (double_type_node);
7377 complex_long_double_type_node = build_complex_type (long_double_type_node);
7379 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7380 #define MAKE_FIXED_TYPE_NODE(KIND,WIDTH,SIZE) \
7381 sat_ ## WIDTH ## KIND ## _type_node = \
7382 make_sat_signed_ ## KIND ## _type (SIZE); \
7383 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7384 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7385 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7386 unsigned_ ## WIDTH ## KIND ## _type_node = \
7387 make_unsigned_ ## KIND ## _type (SIZE);
7389 /* Make fixed-point type nodes based on four different widths. */
7390 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7391 MAKE_FIXED_TYPE_NODE (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7392 MAKE_FIXED_TYPE_NODE (N1, , N2 ## _TYPE_SIZE) \
7393 MAKE_FIXED_TYPE_NODE (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7394 MAKE_FIXED_TYPE_NODE (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7396 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7397 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7398 NAME ## _type_node = \
7399 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7400 u ## NAME ## _type_node = \
7401 make_or_reuse_unsigned_ ## KIND ## _type \
7402 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7403 sat_ ## NAME ## _type_node = \
7404 make_or_reuse_sat_signed_ ## KIND ## _type \
7405 (GET_MODE_BITSIZE (MODE ## mode)); \
7406 sat_u ## NAME ## _type_node = \
7407 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7408 (GET_MODE_BITSIZE (U ## MODE ## mode));
7410 /* Fixed-point type and mode nodes. */
7411 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
7412 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
7413 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
7414 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
7415 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
7416 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
7417 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
7418 MAKE_FIXED_MODE_NODE (accum, ha, HA)
7419 MAKE_FIXED_MODE_NODE (accum, sa, SA)
7420 MAKE_FIXED_MODE_NODE (accum, da, DA)
7421 MAKE_FIXED_MODE_NODE (accum, ta, TA)
7424 tree t = targetm.build_builtin_va_list ();
7426 /* Many back-ends define record types without setting TYPE_NAME.
7427 If we copied the record type here, we'd keep the original
7428 record type without a name. This breaks name mangling. So,
7429 don't copy record types and let c_common_nodes_and_builtins()
7430 declare the type to be __builtin_va_list. */
7431 if (TREE_CODE (t) != RECORD_TYPE)
7432 t = build_variant_type_copy (t);
7434 va_list_type_node = t;
7438 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7441 local_define_builtin (const char *name, tree type, enum built_in_function code,
7442 const char *library_name, int ecf_flags)
7446 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
7447 library_name, NULL_TREE);
7448 if (ecf_flags & ECF_CONST)
7449 TREE_READONLY (decl) = 1;
7450 if (ecf_flags & ECF_PURE)
7451 DECL_PURE_P (decl) = 1;
7452 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
7453 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
7454 if (ecf_flags & ECF_NORETURN)
7455 TREE_THIS_VOLATILE (decl) = 1;
7456 if (ecf_flags & ECF_NOTHROW)
7457 TREE_NOTHROW (decl) = 1;
7458 if (ecf_flags & ECF_MALLOC)
7459 DECL_IS_MALLOC (decl) = 1;
7461 built_in_decls[code] = decl;
7462 implicit_built_in_decls[code] = decl;
7465 /* Call this function after instantiating all builtins that the language
7466 front end cares about. This will build the rest of the builtins that
7467 are relied upon by the tree optimizers and the middle-end. */
7470 build_common_builtin_nodes (void)
7474 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
7475 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7477 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7478 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7479 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7480 ftype = build_function_type (ptr_type_node, tmp);
7482 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
7483 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
7484 "memcpy", ECF_NOTHROW);
7485 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
7486 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
7487 "memmove", ECF_NOTHROW);
7490 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
7492 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7493 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7494 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
7495 ftype = build_function_type (integer_type_node, tmp);
7496 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
7497 "memcmp", ECF_PURE | ECF_NOTHROW);
7500 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
7502 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7503 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
7504 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7505 ftype = build_function_type (ptr_type_node, tmp);
7506 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
7507 "memset", ECF_NOTHROW);
7510 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
7512 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
7513 ftype = build_function_type (ptr_type_node, tmp);
7514 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
7515 "alloca", ECF_NOTHROW | ECF_MALLOC);
7518 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7519 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7520 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7521 ftype = build_function_type (void_type_node, tmp);
7522 local_define_builtin ("__builtin_init_trampoline", ftype,
7523 BUILT_IN_INIT_TRAMPOLINE,
7524 "__builtin_init_trampoline", ECF_NOTHROW);
7526 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7527 ftype = build_function_type (ptr_type_node, tmp);
7528 local_define_builtin ("__builtin_adjust_trampoline", ftype,
7529 BUILT_IN_ADJUST_TRAMPOLINE,
7530 "__builtin_adjust_trampoline",
7531 ECF_CONST | ECF_NOTHROW);
7533 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7534 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7535 ftype = build_function_type (void_type_node, tmp);
7536 local_define_builtin ("__builtin_nonlocal_goto", ftype,
7537 BUILT_IN_NONLOCAL_GOTO,
7538 "__builtin_nonlocal_goto",
7539 ECF_NORETURN | ECF_NOTHROW);
7541 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7542 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
7543 ftype = build_function_type (void_type_node, tmp);
7544 local_define_builtin ("__builtin_setjmp_setup", ftype,
7545 BUILT_IN_SETJMP_SETUP,
7546 "__builtin_setjmp_setup", ECF_NOTHROW);
7548 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7549 ftype = build_function_type (ptr_type_node, tmp);
7550 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
7551 BUILT_IN_SETJMP_DISPATCHER,
7552 "__builtin_setjmp_dispatcher",
7553 ECF_PURE | ECF_NOTHROW);
7555 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7556 ftype = build_function_type (void_type_node, tmp);
7557 local_define_builtin ("__builtin_setjmp_receiver", ftype,
7558 BUILT_IN_SETJMP_RECEIVER,
7559 "__builtin_setjmp_receiver", ECF_NOTHROW);
7561 ftype = build_function_type (ptr_type_node, void_list_node);
7562 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
7563 "__builtin_stack_save", ECF_NOTHROW);
7565 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
7566 ftype = build_function_type (void_type_node, tmp);
7567 local_define_builtin ("__builtin_stack_restore", ftype,
7568 BUILT_IN_STACK_RESTORE,
7569 "__builtin_stack_restore", ECF_NOTHROW);
7571 ftype = build_function_type (void_type_node, void_list_node);
7572 local_define_builtin ("__builtin_profile_func_enter", ftype,
7573 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
7574 local_define_builtin ("__builtin_profile_func_exit", ftype,
7575 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
7577 /* Complex multiplication and division. These are handled as builtins
7578 rather than optabs because emit_library_call_value doesn't support
7579 complex. Further, we can do slightly better with folding these
7580 beasties if the real and complex parts of the arguments are separate. */
7582 enum machine_mode mode;
7584 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
7586 char mode_name_buf[4], *q;
7588 enum built_in_function mcode, dcode;
7589 tree type, inner_type;
7591 type = lang_hooks.types.type_for_mode (mode, 0);
7594 inner_type = TREE_TYPE (type);
7596 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
7597 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7598 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7599 tmp = tree_cons (NULL_TREE, inner_type, tmp);
7600 ftype = build_function_type (type, tmp);
7602 mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7603 dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
7605 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
7609 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
7610 local_define_builtin (built_in_names[mcode], ftype, mcode,
7611 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
7613 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
7614 local_define_builtin (built_in_names[dcode], ftype, dcode,
7615 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
7620 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7623 If we requested a pointer to a vector, build up the pointers that
7624 we stripped off while looking for the inner type. Similarly for
7625 return values from functions.
7627 The argument TYPE is the top of the chain, and BOTTOM is the
7628 new type which we will point to. */
7631 reconstruct_complex_type (tree type, tree bottom)
7635 if (TREE_CODE (type) == POINTER_TYPE)
7637 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7638 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
7639 TYPE_REF_CAN_ALIAS_ALL (type));
7641 else if (TREE_CODE (type) == REFERENCE_TYPE)
7643 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7644 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
7645 TYPE_REF_CAN_ALIAS_ALL (type));
7647 else if (TREE_CODE (type) == ARRAY_TYPE)
7649 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7650 outer = build_array_type (inner, TYPE_DOMAIN (type));
7652 else if (TREE_CODE (type) == FUNCTION_TYPE)
7654 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7655 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
7657 else if (TREE_CODE (type) == METHOD_TYPE)
7659 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7660 /* The build_method_type_directly() routine prepends 'this' to argument list,
7661 so we must compensate by getting rid of it. */
7663 = build_method_type_directly
7664 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
7666 TREE_CHAIN (TYPE_ARG_TYPES (type)));
7668 else if (TREE_CODE (type) == OFFSET_TYPE)
7670 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
7671 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
7676 return build_qualified_type (outer, TYPE_QUALS (type));
7679 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7682 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
7686 switch (GET_MODE_CLASS (mode))
7688 case MODE_VECTOR_INT:
7689 case MODE_VECTOR_FLOAT:
7690 case MODE_VECTOR_FRACT:
7691 case MODE_VECTOR_UFRACT:
7692 case MODE_VECTOR_ACCUM:
7693 case MODE_VECTOR_UACCUM:
7694 nunits = GET_MODE_NUNITS (mode);
7698 /* Check that there are no leftover bits. */
7699 gcc_assert (GET_MODE_BITSIZE (mode)
7700 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
7702 nunits = GET_MODE_BITSIZE (mode)
7703 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
7710 return make_vector_type (innertype, nunits, mode);
7713 /* Similarly, but takes the inner type and number of units, which must be
7717 build_vector_type (tree innertype, int nunits)
7719 return make_vector_type (innertype, nunits, VOIDmode);
7723 /* Build RESX_EXPR with given REGION_NUMBER. */
7725 build_resx (int region_number)
7728 t = build1 (RESX_EXPR, void_type_node,
7729 build_int_cst (NULL_TREE, region_number));
7733 /* Given an initializer INIT, return TRUE if INIT is zero or some
7734 aggregate of zeros. Otherwise return FALSE. */
7736 initializer_zerop (const_tree init)
7742 switch (TREE_CODE (init))
7745 return integer_zerop (init);
7748 /* ??? Note that this is not correct for C4X float formats. There,
7749 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7750 negative exponent. */
7751 return real_zerop (init)
7752 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
7755 return fixed_zerop (init);
7758 return integer_zerop (init)
7759 || (real_zerop (init)
7760 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
7761 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
7764 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
7765 if (!initializer_zerop (TREE_VALUE (elt)))
7771 unsigned HOST_WIDE_INT idx;
7773 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
7774 if (!initializer_zerop (elt))
7784 /* Build an empty statement. */
7787 build_empty_stmt (void)
7789 return build1 (NOP_EXPR, void_type_node, size_zero_node);
7793 /* Build an OpenMP clause with code CODE. */
7796 build_omp_clause (enum omp_clause_code code)
7801 length = omp_clause_num_ops[code];
7802 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
7804 t = GGC_NEWVAR (union tree_node, size);
7805 memset (t, 0, size);
7806 TREE_SET_CODE (t, OMP_CLAUSE);
7807 OMP_CLAUSE_SET_CODE (t, code);
7809 #ifdef GATHER_STATISTICS
7810 tree_node_counts[(int) omp_clause_kind]++;
7811 tree_node_sizes[(int) omp_clause_kind] += size;
7817 /* Set various status flags when building a CALL_EXPR object T. */
7820 process_call_operands (tree t)
7824 side_effects = TREE_SIDE_EFFECTS (t);
7828 n = TREE_OPERAND_LENGTH (t);
7829 for (i = 1; i < n; i++)
7831 tree op = TREE_OPERAND (t, i);
7832 if (op && TREE_SIDE_EFFECTS (op))
7843 /* Calls have side-effects, except those to const or
7845 i = call_expr_flags (t);
7846 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
7849 TREE_SIDE_EFFECTS (t) = side_effects;
7852 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7853 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7854 Except for the CODE and operand count field, other storage for the
7855 object is initialized to zeros. */
7858 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
7861 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
7863 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
7864 gcc_assert (len >= 1);
7866 #ifdef GATHER_STATISTICS
7867 tree_node_counts[(int) e_kind]++;
7868 tree_node_sizes[(int) e_kind] += length;
7871 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
7873 memset (t, 0, length);
7875 TREE_SET_CODE (t, code);
7877 /* Can't use TREE_OPERAND to store the length because if checking is
7878 enabled, it will try to check the length before we store it. :-P */
7879 t->exp.operands[0] = build_int_cst (sizetype, len);
7885 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7886 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7890 build_call_list (tree return_type, tree fn, tree arglist)
7895 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
7896 TREE_TYPE (t) = return_type;
7897 CALL_EXPR_FN (t) = fn;
7898 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7899 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
7900 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
7901 process_call_operands (t);
7905 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7906 FN and a null static chain slot. NARGS is the number of call arguments
7907 which are specified as "..." arguments. */
7910 build_call_nary (tree return_type, tree fn, int nargs, ...)
7914 va_start (args, nargs);
7915 ret = build_call_valist (return_type, fn, nargs, args);
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 va_list ARGS. */
7925 build_call_valist (tree return_type, tree fn, int nargs, va_list 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) = va_arg (args, tree);
7936 process_call_operands (t);
7940 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7941 FN and a null static chain slot. NARGS is the number of call arguments
7942 which are specified as a tree array ARGS. */
7945 build_call_array (tree return_type, tree fn, int nargs, tree *args)
7950 t = build_vl_exp (CALL_EXPR, nargs + 3);
7951 TREE_TYPE (t) = return_type;
7952 CALL_EXPR_FN (t) = fn;
7953 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
7954 for (i = 0; i < nargs; i++)
7955 CALL_EXPR_ARG (t, i) = args[i];
7956 process_call_operands (t);
7961 /* Returns true if it is possible to prove that the index of
7962 an array access REF (an ARRAY_REF expression) falls into the
7966 in_array_bounds_p (tree ref)
7968 tree idx = TREE_OPERAND (ref, 1);
7971 if (TREE_CODE (idx) != INTEGER_CST)
7974 min = array_ref_low_bound (ref);
7975 max = array_ref_up_bound (ref);
7978 || TREE_CODE (min) != INTEGER_CST
7979 || TREE_CODE (max) != INTEGER_CST)
7982 if (tree_int_cst_lt (idx, min)
7983 || tree_int_cst_lt (max, idx))
7989 /* Returns true if it is possible to prove that the range of
7990 an array access REF (an ARRAY_RANGE_REF expression) falls
7991 into the array bounds. */
7994 range_in_array_bounds_p (tree ref)
7996 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
7997 tree range_min, range_max, min, max;
7999 range_min = TYPE_MIN_VALUE (domain_type);
8000 range_max = TYPE_MAX_VALUE (domain_type);
8003 || TREE_CODE (range_min) != INTEGER_CST
8004 || TREE_CODE (range_max) != INTEGER_CST)
8007 min = array_ref_low_bound (ref);
8008 max = array_ref_up_bound (ref);
8011 || TREE_CODE (min) != INTEGER_CST
8012 || TREE_CODE (max) != INTEGER_CST)
8015 if (tree_int_cst_lt (range_min, min)
8016 || tree_int_cst_lt (max, range_max))
8022 /* Return true if T (assumed to be a DECL) must be assigned a memory
8026 needs_to_live_in_memory (const_tree t)
8028 if (TREE_CODE (t) == SSA_NAME)
8029 t = SSA_NAME_VAR (t);
8031 return (TREE_ADDRESSABLE (t)
8032 || is_global_var (t)
8033 || (TREE_CODE (t) == RESULT_DECL
8034 && aggregate_value_p (t, current_function_decl)));
8037 /* There are situations in which a language considers record types
8038 compatible which have different field lists. Decide if two fields
8039 are compatible. It is assumed that the parent records are compatible. */
8042 fields_compatible_p (const_tree f1, const_tree f2)
8044 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
8045 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
8048 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
8049 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
8052 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
8058 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8061 find_compatible_field (tree record, tree orig_field)
8065 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
8066 if (TREE_CODE (f) == FIELD_DECL
8067 && fields_compatible_p (f, orig_field))
8070 /* ??? Why isn't this on the main fields list? */
8071 f = TYPE_VFIELD (record);
8072 if (f && TREE_CODE (f) == FIELD_DECL
8073 && fields_compatible_p (f, orig_field))
8076 /* ??? We should abort here, but Java appears to do Bad Things
8077 with inherited fields. */
8081 /* Return value of a constant X and sign-extend it. */
8084 int_cst_value (const_tree x)
8086 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
8087 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
8089 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8090 gcc_assert (TREE_INT_CST_HIGH (x) == 0
8091 || TREE_INT_CST_HIGH (x) == -1);
8093 if (bits < HOST_BITS_PER_WIDE_INT)
8095 bool negative = ((val >> (bits - 1)) & 1) != 0;
8097 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
8099 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
8105 /* If TYPE is an integral type, return an equivalent type which is
8106 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8107 return TYPE itself. */
8110 signed_or_unsigned_type_for (int unsignedp, tree type)
8113 if (POINTER_TYPE_P (type))
8116 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
8119 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
8122 /* Returns unsigned variant of TYPE. */
8125 unsigned_type_for (tree type)
8127 return signed_or_unsigned_type_for (1, type);
8130 /* Returns signed variant of TYPE. */
8133 signed_type_for (tree type)
8135 return signed_or_unsigned_type_for (0, type);
8138 /* Returns the largest value obtainable by casting something in INNER type to
8142 upper_bound_in_type (tree outer, tree inner)
8144 unsigned HOST_WIDE_INT lo, hi;
8145 unsigned int det = 0;
8146 unsigned oprec = TYPE_PRECISION (outer);
8147 unsigned iprec = TYPE_PRECISION (inner);
8150 /* Compute a unique number for every combination. */
8151 det |= (oprec > iprec) ? 4 : 0;
8152 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
8153 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
8155 /* Determine the exponent to use. */
8160 /* oprec <= iprec, outer: signed, inner: don't care. */
8165 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8169 /* oprec > iprec, outer: signed, inner: signed. */
8173 /* oprec > iprec, outer: signed, inner: unsigned. */
8177 /* oprec > iprec, outer: unsigned, inner: signed. */
8181 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8188 /* Compute 2^^prec - 1. */
8189 if (prec <= HOST_BITS_PER_WIDE_INT)
8192 lo = ((~(unsigned HOST_WIDE_INT) 0)
8193 >> (HOST_BITS_PER_WIDE_INT - prec));
8197 hi = ((~(unsigned HOST_WIDE_INT) 0)
8198 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
8199 lo = ~(unsigned HOST_WIDE_INT) 0;
8202 return build_int_cst_wide (outer, lo, hi);
8205 /* Returns the smallest value obtainable by casting something in INNER type to
8209 lower_bound_in_type (tree outer, tree inner)
8211 unsigned HOST_WIDE_INT lo, hi;
8212 unsigned oprec = TYPE_PRECISION (outer);
8213 unsigned iprec = TYPE_PRECISION (inner);
8215 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8217 if (TYPE_UNSIGNED (outer)
8218 /* If we are widening something of an unsigned type, OUTER type
8219 contains all values of INNER type. In particular, both INNER
8220 and OUTER types have zero in common. */
8221 || (oprec > iprec && TYPE_UNSIGNED (inner)))
8225 /* If we are widening a signed type to another signed type, we
8226 want to obtain -2^^(iprec-1). If we are keeping the
8227 precision or narrowing to a signed type, we want to obtain
8229 unsigned prec = oprec > iprec ? iprec : oprec;
8231 if (prec <= HOST_BITS_PER_WIDE_INT)
8233 hi = ~(unsigned HOST_WIDE_INT) 0;
8234 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
8238 hi = ((~(unsigned HOST_WIDE_INT) 0)
8239 << (prec - HOST_BITS_PER_WIDE_INT - 1));
8244 return build_int_cst_wide (outer, lo, hi);
8247 /* Return nonzero if two operands that are suitable for PHI nodes are
8248 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8249 SSA_NAME or invariant. Note that this is strictly an optimization.
8250 That is, callers of this function can directly call operand_equal_p
8251 and get the same result, only slower. */
8254 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
8258 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
8260 return operand_equal_p (arg0, arg1, 0);
8263 /* Returns number of zeros at the end of binary representation of X.
8265 ??? Use ffs if available? */
8268 num_ending_zeros (const_tree x)
8270 unsigned HOST_WIDE_INT fr, nfr;
8271 unsigned num, abits;
8272 tree type = TREE_TYPE (x);
8274 if (TREE_INT_CST_LOW (x) == 0)
8276 num = HOST_BITS_PER_WIDE_INT;
8277 fr = TREE_INT_CST_HIGH (x);
8282 fr = TREE_INT_CST_LOW (x);
8285 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
8288 if (nfr << abits == fr)
8295 if (num > TYPE_PRECISION (type))
8296 num = TYPE_PRECISION (type);
8298 return build_int_cst_type (type, num);
8302 #define WALK_SUBTREE(NODE) \
8305 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8311 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8312 be walked whenever a type is seen in the tree. Rest of operands and return
8313 value are as for walk_tree. */
8316 walk_type_fields (tree type, walk_tree_fn func, void *data,
8317 struct pointer_set_t *pset, walk_tree_lh lh)
8319 tree result = NULL_TREE;
8321 switch (TREE_CODE (type))
8324 case REFERENCE_TYPE:
8325 /* We have to worry about mutually recursive pointers. These can't
8326 be written in C. They can in Ada. It's pathological, but
8327 there's an ACATS test (c38102a) that checks it. Deal with this
8328 by checking if we're pointing to another pointer, that one
8329 points to another pointer, that one does too, and we have no htab.
8330 If so, get a hash table. We check three levels deep to avoid
8331 the cost of the hash table if we don't need one. */
8332 if (POINTER_TYPE_P (TREE_TYPE (type))
8333 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
8334 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
8337 result = walk_tree_without_duplicates (&TREE_TYPE (type),
8345 /* ... fall through ... */
8348 WALK_SUBTREE (TREE_TYPE (type));
8352 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
8357 WALK_SUBTREE (TREE_TYPE (type));
8361 /* We never want to walk into default arguments. */
8362 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
8363 WALK_SUBTREE (TREE_VALUE (arg));
8368 /* Don't follow this nodes's type if a pointer for fear that
8369 we'll have infinite recursion. If we have a PSET, then we
8372 || (!POINTER_TYPE_P (TREE_TYPE (type))
8373 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
8374 WALK_SUBTREE (TREE_TYPE (type));
8375 WALK_SUBTREE (TYPE_DOMAIN (type));
8379 WALK_SUBTREE (TREE_TYPE (type));
8380 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
8390 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8391 called with the DATA and the address of each sub-tree. If FUNC returns a
8392 non-NULL value, the traversal is stopped, and the value returned by FUNC
8393 is returned. If PSET is non-NULL it is used to record the nodes visited,
8394 and to avoid visiting a node more than once. */
8397 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
8398 struct pointer_set_t *pset, walk_tree_lh lh)
8400 enum tree_code code;
8404 #define WALK_SUBTREE_TAIL(NODE) \
8408 goto tail_recurse; \
8413 /* Skip empty subtrees. */
8417 /* Don't walk the same tree twice, if the user has requested
8418 that we avoid doing so. */
8419 if (pset && pointer_set_insert (pset, *tp))
8422 /* Call the function. */
8424 result = (*func) (tp, &walk_subtrees, data);
8426 /* If we found something, return it. */
8430 code = TREE_CODE (*tp);
8432 /* Even if we didn't, FUNC may have decided that there was nothing
8433 interesting below this point in the tree. */
8436 /* But we still need to check our siblings. */
8437 if (code == TREE_LIST)
8438 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8439 else if (code == OMP_CLAUSE)
8440 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8447 result = (*lh) (tp, &walk_subtrees, func, data, pset);
8448 if (result || !walk_subtrees)
8455 case IDENTIFIER_NODE:
8462 case PLACEHOLDER_EXPR:
8466 /* None of these have subtrees other than those already walked
8471 WALK_SUBTREE (TREE_VALUE (*tp));
8472 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
8477 int len = TREE_VEC_LENGTH (*tp);
8482 /* Walk all elements but the first. */
8484 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
8486 /* Now walk the first one as a tail call. */
8487 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
8491 WALK_SUBTREE (TREE_REALPART (*tp));
8492 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
8496 unsigned HOST_WIDE_INT idx;
8497 constructor_elt *ce;
8500 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
8502 WALK_SUBTREE (ce->value);
8507 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
8512 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
8514 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8515 into declarations that are just mentioned, rather than
8516 declared; they don't really belong to this part of the tree.
8517 And, we can see cycles: the initializer for a declaration
8518 can refer to the declaration itself. */
8519 WALK_SUBTREE (DECL_INITIAL (decl));
8520 WALK_SUBTREE (DECL_SIZE (decl));
8521 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
8523 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
8526 case STATEMENT_LIST:
8528 tree_stmt_iterator i;
8529 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
8530 WALK_SUBTREE (*tsi_stmt_ptr (i));
8535 switch (OMP_CLAUSE_CODE (*tp))
8537 case OMP_CLAUSE_PRIVATE:
8538 case OMP_CLAUSE_SHARED:
8539 case OMP_CLAUSE_FIRSTPRIVATE:
8540 case OMP_CLAUSE_COPYIN:
8541 case OMP_CLAUSE_COPYPRIVATE:
8543 case OMP_CLAUSE_NUM_THREADS:
8544 case OMP_CLAUSE_SCHEDULE:
8545 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
8548 case OMP_CLAUSE_NOWAIT:
8549 case OMP_CLAUSE_ORDERED:
8550 case OMP_CLAUSE_DEFAULT:
8551 case OMP_CLAUSE_UNTIED:
8552 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8554 case OMP_CLAUSE_LASTPRIVATE:
8555 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
8556 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
8557 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8559 case OMP_CLAUSE_COLLAPSE:
8562 for (i = 0; i < 3; i++)
8563 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8564 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8567 case OMP_CLAUSE_REDUCTION:
8570 for (i = 0; i < 4; i++)
8571 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
8572 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
8584 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8585 But, we only want to walk once. */
8586 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
8587 for (i = 0; i < len; ++i)
8588 WALK_SUBTREE (TREE_OPERAND (*tp, i));
8589 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
8593 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8594 defining. We only want to walk into these fields of a type in this
8595 case and not in the general case of a mere reference to the type.
8597 The criterion is as follows: if the field can be an expression, it
8598 must be walked only here. This should be in keeping with the fields
8599 that are directly gimplified in gimplify_type_sizes in order for the
8600 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8601 variable-sized types.
8603 Note that DECLs get walked as part of processing the BIND_EXPR. */
8604 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
8606 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
8607 if (TREE_CODE (*type_p) == ERROR_MARK)
8610 /* Call the function for the type. See if it returns anything or
8611 doesn't want us to continue. If we are to continue, walk both
8612 the normal fields and those for the declaration case. */
8613 result = (*func) (type_p, &walk_subtrees, data);
8614 if (result || !walk_subtrees)
8617 result = walk_type_fields (*type_p, func, data, pset, lh);
8621 /* If this is a record type, also walk the fields. */
8622 if (TREE_CODE (*type_p) == RECORD_TYPE
8623 || TREE_CODE (*type_p) == UNION_TYPE
8624 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8628 for (field = TYPE_FIELDS (*type_p); field;
8629 field = TREE_CHAIN (field))
8631 /* We'd like to look at the type of the field, but we can
8632 easily get infinite recursion. So assume it's pointed
8633 to elsewhere in the tree. Also, ignore things that
8635 if (TREE_CODE (field) != FIELD_DECL)
8638 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
8639 WALK_SUBTREE (DECL_SIZE (field));
8640 WALK_SUBTREE (DECL_SIZE_UNIT (field));
8641 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
8642 WALK_SUBTREE (DECL_QUALIFIER (field));
8646 /* Same for scalar types. */
8647 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
8648 || TREE_CODE (*type_p) == ENUMERAL_TYPE
8649 || TREE_CODE (*type_p) == INTEGER_TYPE
8650 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
8651 || TREE_CODE (*type_p) == REAL_TYPE)
8653 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
8654 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
8657 WALK_SUBTREE (TYPE_SIZE (*type_p));
8658 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
8663 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))
8664 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code)))
8668 /* Walk over all the sub-trees of this operand. */
8669 len = TREE_OPERAND_LENGTH (*tp);
8671 /* Go through the subtrees. We need to do this in forward order so
8672 that the scope of a FOR_EXPR is handled properly. */
8675 for (i = 0; i < len - 1; ++i)
8676 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp, i));
8677 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp, len - 1));
8680 /* If this is a type, walk the needed fields in the type. */
8681 else if (TYPE_P (*tp))
8682 return walk_type_fields (*tp, func, data, pset, lh);
8686 /* We didn't find what we were looking for. */
8689 #undef WALK_SUBTREE_TAIL
8693 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8696 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
8700 struct pointer_set_t *pset;
8702 pset = pointer_set_create ();
8703 result = walk_tree_1 (tp, func, data, pset, lh);
8704 pointer_set_destroy (pset);
8709 /* Return true if STMT is an empty statement or contains nothing but
8710 empty statements. */
8713 empty_body_p (tree stmt)
8715 tree_stmt_iterator i;
8718 if (IS_EMPTY_STMT (stmt))
8720 else if (TREE_CODE (stmt) == BIND_EXPR)
8721 body = BIND_EXPR_BODY (stmt);
8722 else if (TREE_CODE (stmt) == STATEMENT_LIST)
8727 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
8728 if (!empty_body_p (tsi_stmt (i)))
8737 char const c = TREE_CODE_CLASS (TREE_CODE (t));
8739 if (IS_EXPR_CODE_CLASS (c))
8740 return &t->exp.block;
8741 else if (IS_GIMPLE_STMT_CODE_CLASS (c))
8742 return &GIMPLE_STMT_BLOCK (t);
8748 generic_tree_operand (tree node, int i)
8750 if (GIMPLE_STMT_P (node))
8751 return &GIMPLE_STMT_OPERAND (node, i);
8752 return &TREE_OPERAND (node, i);
8756 generic_tree_type (tree node)
8758 if (GIMPLE_STMT_P (node))
8759 return &void_type_node;
8760 return &TREE_TYPE (node);
8763 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8764 FIXME: don't use this function. It exists for compatibility with
8765 the old representation of CALL_EXPRs where a list was used to hold the
8766 arguments. Places that currently extract the arglist from a CALL_EXPR
8767 ought to be rewritten to use the CALL_EXPR itself. */
8769 call_expr_arglist (tree exp)
8771 tree arglist = NULL_TREE;
8773 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
8774 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
8778 /* Return true if TYPE has a variable argument list. */
8781 stdarg_p (tree fntype)
8783 function_args_iterator args_iter;
8784 tree n = NULL_TREE, t;
8789 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8794 return n != NULL_TREE && n != void_type_node;
8797 /* Return true if TYPE has a prototype. */
8800 prototype_p (tree fntype)
8804 gcc_assert (fntype != NULL_TREE);
8806 t = TYPE_ARG_TYPES (fntype);
8807 return (t != NULL_TREE);
8810 /* Return the number of arguments that a function has. */
8813 function_args_count (tree fntype)
8815 function_args_iterator args_iter;
8821 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
8830 /* If BLOCK is inlined from an __attribute__((__artificial__))
8831 routine, return pointer to location from where it has been
8834 block_nonartificial_location (tree block)
8836 location_t *ret = NULL;
8838 while (block && TREE_CODE (block) == BLOCK
8839 && BLOCK_ABSTRACT_ORIGIN (block))
8841 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
8843 while (TREE_CODE (ao) == BLOCK && BLOCK_ABSTRACT_ORIGIN (ao))
8844 ao = BLOCK_ABSTRACT_ORIGIN (ao);
8846 if (TREE_CODE (ao) == FUNCTION_DECL)
8848 /* If AO is an artificial inline, point RET to the
8849 call site locus at which it has been inlined and continue
8850 the loop, in case AO's caller is also an artificial
8852 if (DECL_DECLARED_INLINE_P (ao)
8853 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
8854 ret = &BLOCK_SOURCE_LOCATION (block);
8858 else if (TREE_CODE (ao) != BLOCK)
8861 block = BLOCK_SUPERCONTEXT (block);
8866 #include "gt-tree.h"