1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
63 /* Tree code classes. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 #define END_OF_BASE_TREE_CODES tcc_exceptional,
68 const enum tree_code_class tree_code_type[] = {
69 #include "all-tree.def"
73 #undef END_OF_BASE_TREE_CODES
75 /* Table indexed by tree code giving number of expression
76 operands beyond the fixed part of the node structure.
77 Not used for types or decls. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
80 #define END_OF_BASE_TREE_CODES 0,
82 const unsigned char tree_code_length[] = {
83 #include "all-tree.def"
87 #undef END_OF_BASE_TREE_CODES
89 /* Names of tree components.
90 Used for printing out the tree and error messages. */
91 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
92 #define END_OF_BASE_TREE_CODES "@dummy",
94 const char *const tree_code_name[] = {
95 #include "all-tree.def"
99 #undef END_OF_BASE_TREE_CODES
101 /* Each tree code class has an associated string representation.
102 These must correspond to the tree_code_class entries. */
104 const char *const tree_code_class_strings[] =
119 /* obstack.[ch] explicitly declined to prototype this. */
120 extern int _obstack_allocated_p (struct obstack *h, void *obj);
122 #ifdef GATHER_STATISTICS
123 /* Statistics-gathering stuff. */
125 int tree_node_counts[(int) all_kinds];
126 int tree_node_sizes[(int) all_kinds];
128 /* Keep in sync with tree.h:enum tree_node_kind. */
129 static const char * const tree_node_kind_names[] = {
149 #endif /* GATHER_STATISTICS */
151 /* Unique id for next decl created. */
152 static GTY(()) int next_decl_uid;
153 /* Unique id for next type created. */
154 static GTY(()) int next_type_uid = 1;
156 /* Since we cannot rehash a type after it is in the table, we have to
157 keep the hash code. */
159 struct GTY(()) type_hash {
164 /* Initial size of the hash table (rounded to next prime). */
165 #define TYPE_HASH_INITIAL_SIZE 1000
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
174 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
175 htab_t type_hash_table;
177 /* Hash table and temporary node for larger integer const values. */
178 static GTY (()) tree int_cst_node;
179 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
180 htab_t int_cst_hash_table;
182 /* Hash table for optimization flags and target option flags. Use the same
183 hash table for both sets of options. Nodes for building the current
184 optimization and target option nodes. The assumption is most of the time
185 the options created will already be in the hash table, so we avoid
186 allocating and freeing up a node repeatably. */
187 static GTY (()) tree cl_optimization_node;
188 static GTY (()) tree cl_target_option_node;
189 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
190 htab_t cl_option_hash_table;
192 /* General tree->tree mapping structure for use in hash tables. */
195 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
196 htab_t debug_expr_for_decl;
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
199 htab_t value_expr_for_decl;
201 static GTY ((if_marked ("tree_priority_map_marked_p"),
202 param_is (struct tree_priority_map)))
203 htab_t init_priority_for_decl;
205 static void set_type_quals (tree, int);
206 static int type_hash_eq (const void *, const void *);
207 static hashval_t type_hash_hash (const void *);
208 static hashval_t int_cst_hash_hash (const void *);
209 static int int_cst_hash_eq (const void *, const void *);
210 static hashval_t cl_option_hash_hash (const void *);
211 static int cl_option_hash_eq (const void *, const void *);
212 static void print_type_hash_statistics (void);
213 static void print_debug_expr_statistics (void);
214 static void print_value_expr_statistics (void);
215 static int type_hash_marked_p (const void *);
216 static unsigned int type_hash_list (const_tree, hashval_t);
217 static unsigned int attribute_hash_list (const_tree, hashval_t);
219 tree global_trees[TI_MAX];
220 tree integer_types[itk_none];
222 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
224 /* Number of operands for each OpenMP clause. */
225 unsigned const char omp_clause_num_ops[] =
227 0, /* OMP_CLAUSE_ERROR */
228 1, /* OMP_CLAUSE_PRIVATE */
229 1, /* OMP_CLAUSE_SHARED */
230 1, /* OMP_CLAUSE_FIRSTPRIVATE */
231 2, /* OMP_CLAUSE_LASTPRIVATE */
232 4, /* OMP_CLAUSE_REDUCTION */
233 1, /* OMP_CLAUSE_COPYIN */
234 1, /* OMP_CLAUSE_COPYPRIVATE */
235 1, /* OMP_CLAUSE_IF */
236 1, /* OMP_CLAUSE_NUM_THREADS */
237 1, /* OMP_CLAUSE_SCHEDULE */
238 0, /* OMP_CLAUSE_NOWAIT */
239 0, /* OMP_CLAUSE_ORDERED */
240 0, /* OMP_CLAUSE_DEFAULT */
241 3, /* OMP_CLAUSE_COLLAPSE */
242 0 /* OMP_CLAUSE_UNTIED */
245 const char * const omp_clause_code_name[] =
266 /* Return the tree node structure used by tree code CODE. */
268 static inline enum tree_node_structure_enum
269 tree_node_structure_for_code (enum tree_code code)
271 switch (TREE_CODE_CLASS (code))
273 case tcc_declaration:
278 return TS_FIELD_DECL;
284 return TS_LABEL_DECL;
286 return TS_RESULT_DECL;
288 return TS_CONST_DECL;
292 return TS_FUNCTION_DECL;
294 return TS_DECL_NON_COMMON;
307 default: /* tcc_constant and tcc_exceptional */
312 /* tcc_constant cases. */
313 case INTEGER_CST: return TS_INT_CST;
314 case REAL_CST: return TS_REAL_CST;
315 case FIXED_CST: return TS_FIXED_CST;
316 case COMPLEX_CST: return TS_COMPLEX;
317 case VECTOR_CST: return TS_VECTOR;
318 case STRING_CST: return TS_STRING;
319 /* tcc_exceptional cases. */
320 case ERROR_MARK: return TS_COMMON;
321 case IDENTIFIER_NODE: return TS_IDENTIFIER;
322 case TREE_LIST: return TS_LIST;
323 case TREE_VEC: return TS_VEC;
324 case SSA_NAME: return TS_SSA_NAME;
325 case PLACEHOLDER_EXPR: return TS_COMMON;
326 case STATEMENT_LIST: return TS_STATEMENT_LIST;
327 case BLOCK: return TS_BLOCK;
328 case CONSTRUCTOR: return TS_CONSTRUCTOR;
329 case TREE_BINFO: return TS_BINFO;
330 case OMP_CLAUSE: return TS_OMP_CLAUSE;
331 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
332 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
340 /* Initialize tree_contains_struct to describe the hierarchy of tree
344 initialize_tree_contains_struct (void)
348 #define MARK_TS_BASE(C) \
350 tree_contains_struct[C][TS_BASE] = 1; \
353 #define MARK_TS_COMMON(C) \
356 tree_contains_struct[C][TS_COMMON] = 1; \
359 #define MARK_TS_DECL_MINIMAL(C) \
361 MARK_TS_COMMON (C); \
362 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
365 #define MARK_TS_DECL_COMMON(C) \
367 MARK_TS_DECL_MINIMAL (C); \
368 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
371 #define MARK_TS_DECL_WRTL(C) \
373 MARK_TS_DECL_COMMON (C); \
374 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
377 #define MARK_TS_DECL_WITH_VIS(C) \
379 MARK_TS_DECL_WRTL (C); \
380 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
383 #define MARK_TS_DECL_NON_COMMON(C) \
385 MARK_TS_DECL_WITH_VIS (C); \
386 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
389 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
392 enum tree_node_structure_enum ts_code;
394 code = (enum tree_code) i;
395 ts_code = tree_node_structure_for_code (code);
397 /* Mark the TS structure itself. */
398 tree_contains_struct[code][ts_code] = 1;
400 /* Mark all the structures that TS is derived from. */
414 case TS_DECL_MINIMAL:
422 case TS_STATEMENT_LIST:
425 case TS_OPTIMIZATION:
426 case TS_TARGET_OPTION:
427 MARK_TS_COMMON (code);
431 MARK_TS_DECL_MINIMAL (code);
435 MARK_TS_DECL_COMMON (code);
438 case TS_DECL_NON_COMMON:
439 MARK_TS_DECL_WITH_VIS (code);
442 case TS_DECL_WITH_VIS:
447 MARK_TS_DECL_WRTL (code);
451 MARK_TS_DECL_COMMON (code);
455 MARK_TS_DECL_WITH_VIS (code);
459 case TS_FUNCTION_DECL:
460 MARK_TS_DECL_NON_COMMON (code);
468 /* Basic consistency checks for attributes used in fold. */
469 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
470 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
471 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
472 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
473 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
474 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
475 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
476 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
478 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
482 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
483 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
484 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
485 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
486 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
492 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
493 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
500 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
502 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
503 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
504 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
505 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
506 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
507 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
508 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
509 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
512 #undef MARK_TS_COMMON
513 #undef MARK_TS_DECL_MINIMAL
514 #undef MARK_TS_DECL_COMMON
515 #undef MARK_TS_DECL_WRTL
516 #undef MARK_TS_DECL_WITH_VIS
517 #undef MARK_TS_DECL_NON_COMMON
526 /* Initialize the hash table of types. */
527 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
530 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
533 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
535 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
536 tree_priority_map_eq, 0);
538 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
539 int_cst_hash_eq, NULL);
541 int_cst_node = make_node (INTEGER_CST);
543 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
544 cl_option_hash_eq, NULL);
546 cl_optimization_node = make_node (OPTIMIZATION_NODE);
547 cl_target_option_node = make_node (TARGET_OPTION_NODE);
549 /* Initialize the tree_contains_struct array. */
550 initialize_tree_contains_struct ();
551 lang_hooks.init_ts ();
555 /* The name of the object as the assembler will see it (but before any
556 translations made by ASM_OUTPUT_LABELREF). Often this is the same
557 as DECL_NAME. It is an IDENTIFIER_NODE. */
559 decl_assembler_name (tree decl)
561 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
562 lang_hooks.set_decl_assembler_name (decl);
563 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
566 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
569 decl_assembler_name_equal (tree decl, const_tree asmname)
571 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
572 const char *decl_str;
573 const char *asmname_str;
576 if (decl_asmname == asmname)
579 decl_str = IDENTIFIER_POINTER (decl_asmname);
580 asmname_str = IDENTIFIER_POINTER (asmname);
583 /* If the target assembler name was set by the user, things are trickier.
584 We have a leading '*' to begin with. After that, it's arguable what
585 is the correct thing to do with -fleading-underscore. Arguably, we've
586 historically been doing the wrong thing in assemble_alias by always
587 printing the leading underscore. Since we're not changing that, make
588 sure user_label_prefix follows the '*' before matching. */
589 if (decl_str[0] == '*')
591 size_t ulp_len = strlen (user_label_prefix);
597 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
598 decl_str += ulp_len, test=true;
602 if (asmname_str[0] == '*')
604 size_t ulp_len = strlen (user_label_prefix);
610 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
611 asmname_str += ulp_len, test=true;
618 return strcmp (decl_str, asmname_str) == 0;
621 /* Hash asmnames ignoring the user specified marks. */
624 decl_assembler_name_hash (const_tree asmname)
626 if (IDENTIFIER_POINTER (asmname)[0] == '*')
628 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
629 size_t ulp_len = strlen (user_label_prefix);
633 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
636 return htab_hash_string (decl_str);
639 return htab_hash_string (IDENTIFIER_POINTER (asmname));
642 /* Compute the number of bytes occupied by a tree with code CODE.
643 This function cannot be used for nodes that have variable sizes,
644 including TREE_VEC, STRING_CST, and CALL_EXPR. */
646 tree_code_size (enum tree_code code)
648 switch (TREE_CODE_CLASS (code))
650 case tcc_declaration: /* A decl node */
655 return sizeof (struct tree_field_decl);
657 return sizeof (struct tree_parm_decl);
659 return sizeof (struct tree_var_decl);
661 return sizeof (struct tree_label_decl);
663 return sizeof (struct tree_result_decl);
665 return sizeof (struct tree_const_decl);
667 return sizeof (struct tree_type_decl);
669 return sizeof (struct tree_function_decl);
671 return sizeof (struct tree_decl_non_common);
675 case tcc_type: /* a type node */
676 return sizeof (struct tree_type);
678 case tcc_reference: /* a reference */
679 case tcc_expression: /* an expression */
680 case tcc_statement: /* an expression with side effects */
681 case tcc_comparison: /* a comparison expression */
682 case tcc_unary: /* a unary arithmetic expression */
683 case tcc_binary: /* a binary arithmetic expression */
684 return (sizeof (struct tree_exp)
685 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
687 case tcc_constant: /* a constant */
690 case INTEGER_CST: return sizeof (struct tree_int_cst);
691 case REAL_CST: return sizeof (struct tree_real_cst);
692 case FIXED_CST: return sizeof (struct tree_fixed_cst);
693 case COMPLEX_CST: return sizeof (struct tree_complex);
694 case VECTOR_CST: return sizeof (struct tree_vector);
695 case STRING_CST: gcc_unreachable ();
697 return lang_hooks.tree_size (code);
700 case tcc_exceptional: /* something random, like an identifier. */
703 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
704 case TREE_LIST: return sizeof (struct tree_list);
707 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
710 case OMP_CLAUSE: gcc_unreachable ();
712 case SSA_NAME: return sizeof (struct tree_ssa_name);
714 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
715 case BLOCK: return sizeof (struct tree_block);
716 case CONSTRUCTOR: return sizeof (struct tree_constructor);
717 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
718 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
721 return lang_hooks.tree_size (code);
729 /* Compute the number of bytes occupied by NODE. This routine only
730 looks at TREE_CODE, except for those nodes that have variable sizes. */
732 tree_size (const_tree node)
734 const enum tree_code code = TREE_CODE (node);
738 return (offsetof (struct tree_binfo, base_binfos)
739 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
742 return (sizeof (struct tree_vec)
743 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
746 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
749 return (sizeof (struct tree_omp_clause)
750 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
754 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
755 return (sizeof (struct tree_exp)
756 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
758 return tree_code_size (code);
762 /* Return a newly allocated node of code CODE. For decl and type
763 nodes, some other fields are initialized. The rest of the node is
764 initialized to zero. This function cannot be used for TREE_VEC or
765 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
767 Achoo! I got a code in the node. */
770 make_node_stat (enum tree_code code MEM_STAT_DECL)
773 enum tree_code_class type = TREE_CODE_CLASS (code);
774 size_t length = tree_code_size (code);
775 #ifdef GATHER_STATISTICS
780 case tcc_declaration: /* A decl node */
784 case tcc_type: /* a type node */
788 case tcc_statement: /* an expression with side effects */
792 case tcc_reference: /* a reference */
796 case tcc_expression: /* an expression */
797 case tcc_comparison: /* a comparison expression */
798 case tcc_unary: /* a unary arithmetic expression */
799 case tcc_binary: /* a binary arithmetic expression */
803 case tcc_constant: /* a constant */
807 case tcc_exceptional: /* something random, like an identifier. */
810 case IDENTIFIER_NODE:
823 kind = ssa_name_kind;
844 tree_node_counts[(int) kind]++;
845 tree_node_sizes[(int) kind] += length;
848 if (code == IDENTIFIER_NODE)
849 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
851 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
853 memset (t, 0, length);
855 TREE_SET_CODE (t, code);
860 TREE_SIDE_EFFECTS (t) = 1;
863 case tcc_declaration:
864 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
866 if (code == FUNCTION_DECL)
868 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
869 DECL_MODE (t) = FUNCTION_MODE;
874 DECL_SOURCE_LOCATION (t) = input_location;
875 DECL_UID (t) = next_decl_uid++;
876 if (TREE_CODE (t) == LABEL_DECL)
877 LABEL_DECL_UID (t) = -1;
882 TYPE_UID (t) = next_type_uid++;
883 TYPE_ALIGN (t) = BITS_PER_UNIT;
884 TYPE_USER_ALIGN (t) = 0;
885 TYPE_MAIN_VARIANT (t) = t;
886 TYPE_CANONICAL (t) = t;
888 /* Default to no attributes for type, but let target change that. */
889 TYPE_ATTRIBUTES (t) = NULL_TREE;
890 targetm.set_default_type_attributes (t);
892 /* We have not yet computed the alias set for this type. */
893 TYPE_ALIAS_SET (t) = -1;
897 TREE_CONSTANT (t) = 1;
906 case PREDECREMENT_EXPR:
907 case PREINCREMENT_EXPR:
908 case POSTDECREMENT_EXPR:
909 case POSTINCREMENT_EXPR:
910 /* All of these have side-effects, no matter what their
912 TREE_SIDE_EFFECTS (t) = 1;
921 /* Other classes need no special treatment. */
928 /* Return a new node with the same contents as NODE except that its
929 TREE_CHAIN is zero and it has a fresh uid. */
932 copy_node_stat (tree node MEM_STAT_DECL)
935 enum tree_code code = TREE_CODE (node);
938 gcc_assert (code != STATEMENT_LIST);
940 length = tree_size (node);
941 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
942 memcpy (t, node, length);
945 TREE_ASM_WRITTEN (t) = 0;
946 TREE_VISITED (t) = 0;
949 if (TREE_CODE_CLASS (code) == tcc_declaration)
951 DECL_UID (t) = next_decl_uid++;
952 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
953 && DECL_HAS_VALUE_EXPR_P (node))
955 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
956 DECL_HAS_VALUE_EXPR_P (t) = 1;
958 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
960 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
961 DECL_HAS_INIT_PRIORITY_P (t) = 1;
964 else if (TREE_CODE_CLASS (code) == tcc_type)
966 TYPE_UID (t) = next_type_uid++;
967 /* The following is so that the debug code for
968 the copy is different from the original type.
969 The two statements usually duplicate each other
970 (because they clear fields of the same union),
971 but the optimizer should catch that. */
972 TYPE_SYMTAB_POINTER (t) = 0;
973 TYPE_SYMTAB_ADDRESS (t) = 0;
975 /* Do not copy the values cache. */
976 if (TYPE_CACHED_VALUES_P(t))
978 TYPE_CACHED_VALUES_P (t) = 0;
979 TYPE_CACHED_VALUES (t) = NULL_TREE;
986 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
987 For example, this can copy a list made of TREE_LIST nodes. */
990 copy_list (tree list)
998 head = prev = copy_node (list);
999 next = TREE_CHAIN (list);
1002 TREE_CHAIN (prev) = copy_node (next);
1003 prev = TREE_CHAIN (prev);
1004 next = TREE_CHAIN (next);
1010 /* Create an INT_CST node with a LOW value sign extended. */
1013 build_int_cst (tree type, HOST_WIDE_INT low)
1015 /* Support legacy code. */
1017 type = integer_type_node;
1019 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1022 /* Create an INT_CST node with a LOW value zero extended. */
1025 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1027 return build_int_cst_wide (type, low, 0);
1030 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1031 if it is negative. This function is similar to build_int_cst, but
1032 the extra bits outside of the type precision are cleared. Constants
1033 with these extra bits may confuse the fold so that it detects overflows
1034 even in cases when they do not occur, and in general should be avoided.
1035 We cannot however make this a default behavior of build_int_cst without
1036 more intrusive changes, since there are parts of gcc that rely on the extra
1037 precision of the integer constants. */
1040 build_int_cst_type (tree type, HOST_WIDE_INT low)
1042 unsigned HOST_WIDE_INT low1;
1047 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1049 return build_int_cst_wide (type, low1, hi);
1052 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1053 and sign extended according to the value range of TYPE. */
1056 build_int_cst_wide_type (tree type,
1057 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1059 fit_double_type (low, high, &low, &high, type);
1060 return build_int_cst_wide (type, low, high);
1063 /* These are the hash table functions for the hash table of INTEGER_CST
1064 nodes of a sizetype. */
1066 /* Return the hash code code X, an INTEGER_CST. */
1069 int_cst_hash_hash (const void *x)
1071 const_tree const t = (const_tree) x;
1073 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1074 ^ htab_hash_pointer (TREE_TYPE (t)));
1077 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1078 is the same as that given by *Y, which is the same. */
1081 int_cst_hash_eq (const void *x, const void *y)
1083 const_tree const xt = (const_tree) x;
1084 const_tree const yt = (const_tree) y;
1086 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1087 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1088 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1091 /* Create an INT_CST node of TYPE and value HI:LOW.
1092 The returned node is always shared. For small integers we use a
1093 per-type vector cache, for larger ones we use a single hash table. */
1096 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1104 switch (TREE_CODE (type))
1107 case REFERENCE_TYPE:
1108 /* Cache NULL pointer. */
1117 /* Cache false or true. */
1125 if (TYPE_UNSIGNED (type))
1128 limit = INTEGER_SHARE_LIMIT;
1129 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1135 limit = INTEGER_SHARE_LIMIT + 1;
1136 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1138 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1152 /* Look for it in the type's vector of small shared ints. */
1153 if (!TYPE_CACHED_VALUES_P (type))
1155 TYPE_CACHED_VALUES_P (type) = 1;
1156 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1159 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1162 /* Make sure no one is clobbering the shared constant. */
1163 gcc_assert (TREE_TYPE (t) == type);
1164 gcc_assert (TREE_INT_CST_LOW (t) == low);
1165 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1169 /* Create a new shared int. */
1170 t = make_node (INTEGER_CST);
1172 TREE_INT_CST_LOW (t) = low;
1173 TREE_INT_CST_HIGH (t) = hi;
1174 TREE_TYPE (t) = type;
1176 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1181 /* Use the cache of larger shared ints. */
1184 TREE_INT_CST_LOW (int_cst_node) = low;
1185 TREE_INT_CST_HIGH (int_cst_node) = hi;
1186 TREE_TYPE (int_cst_node) = type;
1188 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1192 /* Insert this one into the hash table. */
1195 /* Make a new node for next time round. */
1196 int_cst_node = make_node (INTEGER_CST);
1203 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1204 and the rest are zeros. */
1207 build_low_bits_mask (tree type, unsigned bits)
1209 unsigned HOST_WIDE_INT low;
1211 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1213 gcc_assert (bits <= TYPE_PRECISION (type));
1215 if (bits == TYPE_PRECISION (type)
1216 && !TYPE_UNSIGNED (type))
1218 /* Sign extended all-ones mask. */
1222 else if (bits <= HOST_BITS_PER_WIDE_INT)
1224 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1229 bits -= HOST_BITS_PER_WIDE_INT;
1231 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1234 return build_int_cst_wide (type, low, high);
1237 /* Checks that X is integer constant that can be expressed in (unsigned)
1238 HOST_WIDE_INT without loss of precision. */
1241 cst_and_fits_in_hwi (const_tree x)
1243 if (TREE_CODE (x) != INTEGER_CST)
1246 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1249 return (TREE_INT_CST_HIGH (x) == 0
1250 || TREE_INT_CST_HIGH (x) == -1);
1253 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1254 are in a list pointed to by VALS. */
1257 build_vector (tree type, tree vals)
1259 tree v = make_node (VECTOR_CST);
1263 TREE_VECTOR_CST_ELTS (v) = vals;
1264 TREE_TYPE (v) = type;
1266 /* Iterate through elements and check for overflow. */
1267 for (link = vals; link; link = TREE_CHAIN (link))
1269 tree value = TREE_VALUE (link);
1271 /* Don't crash if we get an address constant. */
1272 if (!CONSTANT_CLASS_P (value))
1275 over |= TREE_OVERFLOW (value);
1278 TREE_OVERFLOW (v) = over;
1282 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1283 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1286 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1288 tree list = NULL_TREE;
1289 unsigned HOST_WIDE_INT idx;
1292 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1293 list = tree_cons (NULL_TREE, value, list);
1294 return build_vector (type, nreverse (list));
1297 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1298 are in the VEC pointed to by VALS. */
1300 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1302 tree c = make_node (CONSTRUCTOR);
1303 TREE_TYPE (c) = type;
1304 CONSTRUCTOR_ELTS (c) = vals;
1308 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1311 build_constructor_single (tree type, tree index, tree value)
1313 VEC(constructor_elt,gc) *v;
1314 constructor_elt *elt;
1317 v = VEC_alloc (constructor_elt, gc, 1);
1318 elt = VEC_quick_push (constructor_elt, v, NULL);
1322 t = build_constructor (type, v);
1323 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1328 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1329 are in a list pointed to by VALS. */
1331 build_constructor_from_list (tree type, tree vals)
1334 VEC(constructor_elt,gc) *v = NULL;
1335 bool constant_p = true;
1339 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1340 for (t = vals; t; t = TREE_CHAIN (t))
1342 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1343 val = TREE_VALUE (t);
1344 elt->index = TREE_PURPOSE (t);
1346 if (!TREE_CONSTANT (val))
1351 t = build_constructor (type, v);
1352 TREE_CONSTANT (t) = constant_p;
1356 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1359 build_fixed (tree type, FIXED_VALUE_TYPE f)
1362 FIXED_VALUE_TYPE *fp;
1364 v = make_node (FIXED_CST);
1365 fp = GGC_NEW (FIXED_VALUE_TYPE);
1366 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1368 TREE_TYPE (v) = type;
1369 TREE_FIXED_CST_PTR (v) = fp;
1373 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1376 build_real (tree type, REAL_VALUE_TYPE d)
1379 REAL_VALUE_TYPE *dp;
1382 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1383 Consider doing it via real_convert now. */
1385 v = make_node (REAL_CST);
1386 dp = GGC_NEW (REAL_VALUE_TYPE);
1387 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1389 TREE_TYPE (v) = type;
1390 TREE_REAL_CST_PTR (v) = dp;
1391 TREE_OVERFLOW (v) = overflow;
1395 /* Return a new REAL_CST node whose type is TYPE
1396 and whose value is the integer value of the INTEGER_CST node I. */
1399 real_value_from_int_cst (const_tree type, const_tree i)
1403 /* Clear all bits of the real value type so that we can later do
1404 bitwise comparisons to see if two values are the same. */
1405 memset (&d, 0, sizeof d);
1407 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1408 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1409 TYPE_UNSIGNED (TREE_TYPE (i)));
1413 /* Given a tree representing an integer constant I, return a tree
1414 representing the same value as a floating-point constant of type TYPE. */
1417 build_real_from_int_cst (tree type, const_tree i)
1420 int overflow = TREE_OVERFLOW (i);
1422 v = build_real (type, real_value_from_int_cst (type, i));
1424 TREE_OVERFLOW (v) |= overflow;
1428 /* Return a newly constructed STRING_CST node whose value is
1429 the LEN characters at STR.
1430 The TREE_TYPE is not initialized. */
1433 build_string (int len, const char *str)
1438 /* Do not waste bytes provided by padding of struct tree_string. */
1439 length = len + offsetof (struct tree_string, str) + 1;
1441 #ifdef GATHER_STATISTICS
1442 tree_node_counts[(int) c_kind]++;
1443 tree_node_sizes[(int) c_kind] += length;
1446 s = ggc_alloc_tree (length);
1448 memset (s, 0, sizeof (struct tree_common));
1449 TREE_SET_CODE (s, STRING_CST);
1450 TREE_CONSTANT (s) = 1;
1451 TREE_STRING_LENGTH (s) = len;
1452 memcpy (s->string.str, str, len);
1453 s->string.str[len] = '\0';
1458 /* Return a newly constructed COMPLEX_CST node whose value is
1459 specified by the real and imaginary parts REAL and IMAG.
1460 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1461 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1464 build_complex (tree type, tree real, tree imag)
1466 tree t = make_node (COMPLEX_CST);
1468 TREE_REALPART (t) = real;
1469 TREE_IMAGPART (t) = imag;
1470 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1471 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1475 /* Return a constant of arithmetic type TYPE which is the
1476 multiplicative identity of the set TYPE. */
1479 build_one_cst (tree type)
1481 switch (TREE_CODE (type))
1483 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1484 case POINTER_TYPE: case REFERENCE_TYPE:
1486 return build_int_cst (type, 1);
1489 return build_real (type, dconst1);
1491 case FIXED_POINT_TYPE:
1492 /* We can only generate 1 for accum types. */
1493 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1494 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1501 scalar = build_one_cst (TREE_TYPE (type));
1503 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1505 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1506 cst = tree_cons (NULL_TREE, scalar, cst);
1508 return build_vector (type, cst);
1512 return build_complex (type,
1513 build_one_cst (TREE_TYPE (type)),
1514 fold_convert (TREE_TYPE (type), integer_zero_node));
1521 /* Build a BINFO with LEN language slots. */
1524 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1527 size_t length = (offsetof (struct tree_binfo, base_binfos)
1528 + VEC_embedded_size (tree, base_binfos));
1530 #ifdef GATHER_STATISTICS
1531 tree_node_counts[(int) binfo_kind]++;
1532 tree_node_sizes[(int) binfo_kind] += length;
1535 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1537 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1539 TREE_SET_CODE (t, TREE_BINFO);
1541 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1547 /* Build a newly constructed TREE_VEC node of length LEN. */
1550 make_tree_vec_stat (int len MEM_STAT_DECL)
1553 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1555 #ifdef GATHER_STATISTICS
1556 tree_node_counts[(int) vec_kind]++;
1557 tree_node_sizes[(int) vec_kind] += length;
1560 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1562 memset (t, 0, length);
1564 TREE_SET_CODE (t, TREE_VEC);
1565 TREE_VEC_LENGTH (t) = len;
1570 /* Return 1 if EXPR is the integer constant zero or a complex constant
1574 integer_zerop (const_tree expr)
1578 return ((TREE_CODE (expr) == INTEGER_CST
1579 && TREE_INT_CST_LOW (expr) == 0
1580 && TREE_INT_CST_HIGH (expr) == 0)
1581 || (TREE_CODE (expr) == COMPLEX_CST
1582 && integer_zerop (TREE_REALPART (expr))
1583 && integer_zerop (TREE_IMAGPART (expr))));
1586 /* Return 1 if EXPR is the integer constant one or the corresponding
1587 complex constant. */
1590 integer_onep (const_tree expr)
1594 return ((TREE_CODE (expr) == INTEGER_CST
1595 && TREE_INT_CST_LOW (expr) == 1
1596 && TREE_INT_CST_HIGH (expr) == 0)
1597 || (TREE_CODE (expr) == COMPLEX_CST
1598 && integer_onep (TREE_REALPART (expr))
1599 && integer_zerop (TREE_IMAGPART (expr))));
1602 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1603 it contains. Likewise for the corresponding complex constant. */
1606 integer_all_onesp (const_tree expr)
1613 if (TREE_CODE (expr) == COMPLEX_CST
1614 && integer_all_onesp (TREE_REALPART (expr))
1615 && integer_zerop (TREE_IMAGPART (expr)))
1618 else if (TREE_CODE (expr) != INTEGER_CST)
1621 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1622 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1623 && TREE_INT_CST_HIGH (expr) == -1)
1628 /* Note that using TYPE_PRECISION here is wrong. We care about the
1629 actual bits, not the (arbitrary) range of the type. */
1630 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1631 if (prec >= HOST_BITS_PER_WIDE_INT)
1633 HOST_WIDE_INT high_value;
1636 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1638 /* Can not handle precisions greater than twice the host int size. */
1639 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1640 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1641 /* Shifting by the host word size is undefined according to the ANSI
1642 standard, so we must handle this as a special case. */
1645 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1647 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1648 && TREE_INT_CST_HIGH (expr) == high_value);
1651 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1654 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1658 integer_pow2p (const_tree expr)
1661 HOST_WIDE_INT high, low;
1665 if (TREE_CODE (expr) == COMPLEX_CST
1666 && integer_pow2p (TREE_REALPART (expr))
1667 && integer_zerop (TREE_IMAGPART (expr)))
1670 if (TREE_CODE (expr) != INTEGER_CST)
1673 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1674 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1675 high = TREE_INT_CST_HIGH (expr);
1676 low = TREE_INT_CST_LOW (expr);
1678 /* First clear all bits that are beyond the type's precision in case
1679 we've been sign extended. */
1681 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1683 else if (prec > HOST_BITS_PER_WIDE_INT)
1684 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1688 if (prec < HOST_BITS_PER_WIDE_INT)
1689 low &= ~((HOST_WIDE_INT) (-1) << prec);
1692 if (high == 0 && low == 0)
1695 return ((high == 0 && (low & (low - 1)) == 0)
1696 || (low == 0 && (high & (high - 1)) == 0));
1699 /* Return 1 if EXPR is an integer constant other than zero or a
1700 complex constant other than zero. */
1703 integer_nonzerop (const_tree expr)
1707 return ((TREE_CODE (expr) == INTEGER_CST
1708 && (TREE_INT_CST_LOW (expr) != 0
1709 || TREE_INT_CST_HIGH (expr) != 0))
1710 || (TREE_CODE (expr) == COMPLEX_CST
1711 && (integer_nonzerop (TREE_REALPART (expr))
1712 || integer_nonzerop (TREE_IMAGPART (expr)))));
1715 /* Return 1 if EXPR is the fixed-point constant zero. */
1718 fixed_zerop (const_tree expr)
1720 return (TREE_CODE (expr) == FIXED_CST
1721 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1724 /* Return the power of two represented by a tree node known to be a
1728 tree_log2 (const_tree expr)
1731 HOST_WIDE_INT high, low;
1735 if (TREE_CODE (expr) == COMPLEX_CST)
1736 return tree_log2 (TREE_REALPART (expr));
1738 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1739 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1741 high = TREE_INT_CST_HIGH (expr);
1742 low = TREE_INT_CST_LOW (expr);
1744 /* First clear all bits that are beyond the type's precision in case
1745 we've been sign extended. */
1747 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1749 else if (prec > HOST_BITS_PER_WIDE_INT)
1750 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1754 if (prec < HOST_BITS_PER_WIDE_INT)
1755 low &= ~((HOST_WIDE_INT) (-1) << prec);
1758 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1759 : exact_log2 (low));
1762 /* Similar, but return the largest integer Y such that 2 ** Y is less
1763 than or equal to EXPR. */
1766 tree_floor_log2 (const_tree expr)
1769 HOST_WIDE_INT high, low;
1773 if (TREE_CODE (expr) == COMPLEX_CST)
1774 return tree_log2 (TREE_REALPART (expr));
1776 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1777 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1779 high = TREE_INT_CST_HIGH (expr);
1780 low = TREE_INT_CST_LOW (expr);
1782 /* First clear all bits that are beyond the type's precision in case
1783 we've been sign extended. Ignore if type's precision hasn't been set
1784 since what we are doing is setting it. */
1786 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1788 else if (prec > HOST_BITS_PER_WIDE_INT)
1789 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1793 if (prec < HOST_BITS_PER_WIDE_INT)
1794 low &= ~((HOST_WIDE_INT) (-1) << prec);
1797 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1798 : floor_log2 (low));
1801 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1802 decimal float constants, so don't return 1 for them. */
1805 real_zerop (const_tree expr)
1809 return ((TREE_CODE (expr) == REAL_CST
1810 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1811 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1812 || (TREE_CODE (expr) == COMPLEX_CST
1813 && real_zerop (TREE_REALPART (expr))
1814 && real_zerop (TREE_IMAGPART (expr))));
1817 /* Return 1 if EXPR is the real constant one in real or complex form.
1818 Trailing zeroes matter for decimal float constants, so don't return
1822 real_onep (const_tree expr)
1826 return ((TREE_CODE (expr) == REAL_CST
1827 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1828 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1829 || (TREE_CODE (expr) == COMPLEX_CST
1830 && real_onep (TREE_REALPART (expr))
1831 && real_zerop (TREE_IMAGPART (expr))));
1834 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1835 for decimal float constants, so don't return 1 for them. */
1838 real_twop (const_tree expr)
1842 return ((TREE_CODE (expr) == REAL_CST
1843 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1844 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1845 || (TREE_CODE (expr) == COMPLEX_CST
1846 && real_twop (TREE_REALPART (expr))
1847 && real_zerop (TREE_IMAGPART (expr))));
1850 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1851 matter for decimal float constants, so don't return 1 for them. */
1854 real_minus_onep (const_tree expr)
1858 return ((TREE_CODE (expr) == REAL_CST
1859 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1860 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1861 || (TREE_CODE (expr) == COMPLEX_CST
1862 && real_minus_onep (TREE_REALPART (expr))
1863 && real_zerop (TREE_IMAGPART (expr))));
1866 /* Nonzero if EXP is a constant or a cast of a constant. */
1869 really_constant_p (const_tree exp)
1871 /* This is not quite the same as STRIP_NOPS. It does more. */
1872 while (CONVERT_EXPR_P (exp)
1873 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1874 exp = TREE_OPERAND (exp, 0);
1875 return TREE_CONSTANT (exp);
1878 /* Return first list element whose TREE_VALUE is ELEM.
1879 Return 0 if ELEM is not in LIST. */
1882 value_member (tree elem, tree list)
1886 if (elem == TREE_VALUE (list))
1888 list = TREE_CHAIN (list);
1893 /* Return first list element whose TREE_PURPOSE is ELEM.
1894 Return 0 if ELEM is not in LIST. */
1897 purpose_member (const_tree elem, tree list)
1901 if (elem == TREE_PURPOSE (list))
1903 list = TREE_CHAIN (list);
1908 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1912 chain_index (int idx, tree chain)
1914 for (; chain && idx > 0; --idx)
1915 chain = TREE_CHAIN (chain);
1919 /* Return nonzero if ELEM is part of the chain CHAIN. */
1922 chain_member (const_tree elem, const_tree chain)
1928 chain = TREE_CHAIN (chain);
1934 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1935 We expect a null pointer to mark the end of the chain.
1936 This is the Lisp primitive `length'. */
1939 list_length (const_tree t)
1942 #ifdef ENABLE_TREE_CHECKING
1950 #ifdef ENABLE_TREE_CHECKING
1953 gcc_assert (p != q);
1961 /* Returns the number of FIELD_DECLs in TYPE. */
1964 fields_length (const_tree type)
1966 tree t = TYPE_FIELDS (type);
1969 for (; t; t = TREE_CHAIN (t))
1970 if (TREE_CODE (t) == FIELD_DECL)
1976 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1977 by modifying the last node in chain 1 to point to chain 2.
1978 This is the Lisp primitive `nconc'. */
1981 chainon (tree op1, tree op2)
1990 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1992 TREE_CHAIN (t1) = op2;
1994 #ifdef ENABLE_TREE_CHECKING
1997 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1998 gcc_assert (t2 != t1);
2005 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2008 tree_last (tree chain)
2012 while ((next = TREE_CHAIN (chain)))
2017 /* Reverse the order of elements in the chain T,
2018 and return the new head of the chain (old last element). */
2023 tree prev = 0, decl, next;
2024 for (decl = t; decl; decl = next)
2026 next = TREE_CHAIN (decl);
2027 TREE_CHAIN (decl) = prev;
2033 /* Return a newly created TREE_LIST node whose
2034 purpose and value fields are PARM and VALUE. */
2037 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2039 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2040 TREE_PURPOSE (t) = parm;
2041 TREE_VALUE (t) = value;
2045 /* Build a chain of TREE_LIST nodes from a vector. */
2048 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2050 tree ret = NULL_TREE;
2054 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2056 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2057 pp = &TREE_CHAIN (*pp);
2062 /* Return a newly created TREE_LIST node whose
2063 purpose and value fields are PURPOSE and VALUE
2064 and whose TREE_CHAIN is CHAIN. */
2067 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2071 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2073 memset (node, 0, sizeof (struct tree_common));
2075 #ifdef GATHER_STATISTICS
2076 tree_node_counts[(int) x_kind]++;
2077 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2080 TREE_SET_CODE (node, TREE_LIST);
2081 TREE_CHAIN (node) = chain;
2082 TREE_PURPOSE (node) = purpose;
2083 TREE_VALUE (node) = value;
2087 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2090 ctor_to_list (tree ctor)
2092 tree list = NULL_TREE;
2097 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2099 *p = build_tree_list (purpose, val);
2100 p = &TREE_CHAIN (*p);
2106 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2110 ctor_to_vec (tree ctor)
2112 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2116 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2117 VEC_quick_push (tree, vec, val);
2122 /* Return the size nominally occupied by an object of type TYPE
2123 when it resides in memory. The value is measured in units of bytes,
2124 and its data type is that normally used for type sizes
2125 (which is the first type created by make_signed_type or
2126 make_unsigned_type). */
2129 size_in_bytes (const_tree type)
2133 if (type == error_mark_node)
2134 return integer_zero_node;
2136 type = TYPE_MAIN_VARIANT (type);
2137 t = TYPE_SIZE_UNIT (type);
2141 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2142 return size_zero_node;
2148 /* Return the size of TYPE (in bytes) as a wide integer
2149 or return -1 if the size can vary or is larger than an integer. */
2152 int_size_in_bytes (const_tree type)
2156 if (type == error_mark_node)
2159 type = TYPE_MAIN_VARIANT (type);
2160 t = TYPE_SIZE_UNIT (type);
2162 || TREE_CODE (t) != INTEGER_CST
2163 || TREE_INT_CST_HIGH (t) != 0
2164 /* If the result would appear negative, it's too big to represent. */
2165 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2168 return TREE_INT_CST_LOW (t);
2171 /* Return the maximum size of TYPE (in bytes) as a wide integer
2172 or return -1 if the size can vary or is larger than an integer. */
2175 max_int_size_in_bytes (const_tree type)
2177 HOST_WIDE_INT size = -1;
2180 /* If this is an array type, check for a possible MAX_SIZE attached. */
2182 if (TREE_CODE (type) == ARRAY_TYPE)
2184 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2186 if (size_tree && host_integerp (size_tree, 1))
2187 size = tree_low_cst (size_tree, 1);
2190 /* If we still haven't been able to get a size, see if the language
2191 can compute a maximum size. */
2195 size_tree = lang_hooks.types.max_size (type);
2197 if (size_tree && host_integerp (size_tree, 1))
2198 size = tree_low_cst (size_tree, 1);
2204 /* Returns a tree for the size of EXP in bytes. */
2207 tree_expr_size (const_tree exp)
2210 && DECL_SIZE_UNIT (exp) != 0)
2211 return DECL_SIZE_UNIT (exp);
2213 return size_in_bytes (TREE_TYPE (exp));
2216 /* Return the bit position of FIELD, in bits from the start of the record.
2217 This is a tree of type bitsizetype. */
2220 bit_position (const_tree field)
2222 return bit_from_pos (DECL_FIELD_OFFSET (field),
2223 DECL_FIELD_BIT_OFFSET (field));
2226 /* Likewise, but return as an integer. It must be representable in
2227 that way (since it could be a signed value, we don't have the
2228 option of returning -1 like int_size_in_byte can. */
2231 int_bit_position (const_tree field)
2233 return tree_low_cst (bit_position (field), 0);
2236 /* Return the byte position of FIELD, in bytes from the start of the record.
2237 This is a tree of type sizetype. */
2240 byte_position (const_tree field)
2242 return byte_from_pos (DECL_FIELD_OFFSET (field),
2243 DECL_FIELD_BIT_OFFSET (field));
2246 /* Likewise, but return as an integer. It must be representable in
2247 that way (since it could be a signed value, we don't have the
2248 option of returning -1 like int_size_in_byte can. */
2251 int_byte_position (const_tree field)
2253 return tree_low_cst (byte_position (field), 0);
2256 /* Return the strictest alignment, in bits, that T is known to have. */
2259 expr_align (const_tree t)
2261 unsigned int align0, align1;
2263 switch (TREE_CODE (t))
2265 CASE_CONVERT: case NON_LVALUE_EXPR:
2266 /* If we have conversions, we know that the alignment of the
2267 object must meet each of the alignments of the types. */
2268 align0 = expr_align (TREE_OPERAND (t, 0));
2269 align1 = TYPE_ALIGN (TREE_TYPE (t));
2270 return MAX (align0, align1);
2272 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2273 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2274 case CLEANUP_POINT_EXPR:
2275 /* These don't change the alignment of an object. */
2276 return expr_align (TREE_OPERAND (t, 0));
2279 /* The best we can do is say that the alignment is the least aligned
2281 align0 = expr_align (TREE_OPERAND (t, 1));
2282 align1 = expr_align (TREE_OPERAND (t, 2));
2283 return MIN (align0, align1);
2285 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2286 meaningfully, it's always 1. */
2287 case LABEL_DECL: case CONST_DECL:
2288 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2290 gcc_assert (DECL_ALIGN (t) != 0);
2291 return DECL_ALIGN (t);
2297 /* Otherwise take the alignment from that of the type. */
2298 return TYPE_ALIGN (TREE_TYPE (t));
2301 /* Return, as a tree node, the number of elements for TYPE (which is an
2302 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2305 array_type_nelts (const_tree type)
2307 tree index_type, min, max;
2309 /* If they did it with unspecified bounds, then we should have already
2310 given an error about it before we got here. */
2311 if (! TYPE_DOMAIN (type))
2312 return error_mark_node;
2314 index_type = TYPE_DOMAIN (type);
2315 min = TYPE_MIN_VALUE (index_type);
2316 max = TYPE_MAX_VALUE (index_type);
2318 return (integer_zerop (min)
2320 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2323 /* If arg is static -- a reference to an object in static storage -- then
2324 return the object. This is not the same as the C meaning of `static'.
2325 If arg isn't static, return NULL. */
2330 switch (TREE_CODE (arg))
2333 /* Nested functions are static, even though taking their address will
2334 involve a trampoline as we unnest the nested function and create
2335 the trampoline on the tree level. */
2339 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2340 && ! DECL_THREAD_LOCAL_P (arg)
2341 && ! DECL_DLLIMPORT_P (arg)
2345 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2349 return TREE_STATIC (arg) ? arg : NULL;
2356 /* If the thing being referenced is not a field, then it is
2357 something language specific. */
2358 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2360 /* If we are referencing a bitfield, we can't evaluate an
2361 ADDR_EXPR at compile time and so it isn't a constant. */
2362 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2365 return staticp (TREE_OPERAND (arg, 0));
2370 case MISALIGNED_INDIRECT_REF:
2371 case ALIGN_INDIRECT_REF:
2373 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2376 case ARRAY_RANGE_REF:
2377 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2378 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2379 return staticp (TREE_OPERAND (arg, 0));
2383 case COMPOUND_LITERAL_EXPR:
2384 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2394 /* Return whether OP is a DECL whose address is function-invariant. */
2397 decl_address_invariant_p (const_tree op)
2399 /* The conditions below are slightly less strict than the one in
2402 switch (TREE_CODE (op))
2411 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2412 && !DECL_DLLIMPORT_P (op))
2413 || DECL_THREAD_LOCAL_P (op)
2414 || DECL_CONTEXT (op) == current_function_decl
2415 || decl_function_context (op) == current_function_decl)
2420 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2421 || decl_function_context (op) == current_function_decl)
2432 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2435 decl_address_ip_invariant_p (const_tree op)
2437 /* The conditions below are slightly less strict than the one in
2440 switch (TREE_CODE (op))
2448 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2449 && !DECL_DLLIMPORT_P (op))
2450 || DECL_THREAD_LOCAL_P (op))
2455 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2467 /* Return true if T is function-invariant (internal function, does
2468 not handle arithmetic; that's handled in skip_simple_arithmetic and
2469 tree_invariant_p). */
2471 static bool tree_invariant_p (tree t);
2474 tree_invariant_p_1 (tree t)
2478 if (TREE_CONSTANT (t)
2479 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2482 switch (TREE_CODE (t))
2488 op = TREE_OPERAND (t, 0);
2489 while (handled_component_p (op))
2491 switch (TREE_CODE (op))
2494 case ARRAY_RANGE_REF:
2495 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2496 || TREE_OPERAND (op, 2) != NULL_TREE
2497 || TREE_OPERAND (op, 3) != NULL_TREE)
2502 if (TREE_OPERAND (op, 2) != NULL_TREE)
2508 op = TREE_OPERAND (op, 0);
2511 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2520 /* Return true if T is function-invariant. */
2523 tree_invariant_p (tree t)
2525 tree inner = skip_simple_arithmetic (t);
2526 return tree_invariant_p_1 (inner);
2529 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2530 Do this to any expression which may be used in more than one place,
2531 but must be evaluated only once.
2533 Normally, expand_expr would reevaluate the expression each time.
2534 Calling save_expr produces something that is evaluated and recorded
2535 the first time expand_expr is called on it. Subsequent calls to
2536 expand_expr just reuse the recorded value.
2538 The call to expand_expr that generates code that actually computes
2539 the value is the first call *at compile time*. Subsequent calls
2540 *at compile time* generate code to use the saved value.
2541 This produces correct result provided that *at run time* control
2542 always flows through the insns made by the first expand_expr
2543 before reaching the other places where the save_expr was evaluated.
2544 You, the caller of save_expr, must make sure this is so.
2546 Constants, and certain read-only nodes, are returned with no
2547 SAVE_EXPR because that is safe. Expressions containing placeholders
2548 are not touched; see tree.def for an explanation of what these
2552 save_expr (tree expr)
2554 tree t = fold (expr);
2557 /* If the tree evaluates to a constant, then we don't want to hide that
2558 fact (i.e. this allows further folding, and direct checks for constants).
2559 However, a read-only object that has side effects cannot be bypassed.
2560 Since it is no problem to reevaluate literals, we just return the
2562 inner = skip_simple_arithmetic (t);
2563 if (TREE_CODE (inner) == ERROR_MARK)
2566 if (tree_invariant_p_1 (inner))
2569 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2570 it means that the size or offset of some field of an object depends on
2571 the value within another field.
2573 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2574 and some variable since it would then need to be both evaluated once and
2575 evaluated more than once. Front-ends must assure this case cannot
2576 happen by surrounding any such subexpressions in their own SAVE_EXPR
2577 and forcing evaluation at the proper time. */
2578 if (contains_placeholder_p (inner))
2581 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2582 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2584 /* This expression might be placed ahead of a jump to ensure that the
2585 value was computed on both sides of the jump. So make sure it isn't
2586 eliminated as dead. */
2587 TREE_SIDE_EFFECTS (t) = 1;
2591 /* Look inside EXPR and into any simple arithmetic operations. Return
2592 the innermost non-arithmetic node. */
2595 skip_simple_arithmetic (tree expr)
2599 /* We don't care about whether this can be used as an lvalue in this
2601 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2602 expr = TREE_OPERAND (expr, 0);
2604 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2605 a constant, it will be more efficient to not make another SAVE_EXPR since
2606 it will allow better simplification and GCSE will be able to merge the
2607 computations if they actually occur. */
2611 if (UNARY_CLASS_P (inner))
2612 inner = TREE_OPERAND (inner, 0);
2613 else if (BINARY_CLASS_P (inner))
2615 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2616 inner = TREE_OPERAND (inner, 0);
2617 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2618 inner = TREE_OPERAND (inner, 1);
2630 /* Return which tree structure is used by T. */
2632 enum tree_node_structure_enum
2633 tree_node_structure (const_tree t)
2635 const enum tree_code code = TREE_CODE (t);
2636 return tree_node_structure_for_code (code);
2639 /* Set various status flags when building a CALL_EXPR object T. */
2642 process_call_operands (tree t)
2644 bool side_effects = TREE_SIDE_EFFECTS (t);
2645 bool read_only = false;
2646 int i = call_expr_flags (t);
2648 /* Calls have side-effects, except those to const or pure functions. */
2649 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2650 side_effects = true;
2651 /* Propagate TREE_READONLY of arguments for const functions. */
2655 if (!side_effects || read_only)
2656 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2658 tree op = TREE_OPERAND (t, i);
2659 if (op && TREE_SIDE_EFFECTS (op))
2660 side_effects = true;
2661 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2665 TREE_SIDE_EFFECTS (t) = side_effects;
2666 TREE_READONLY (t) = read_only;
2669 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2670 or offset that depends on a field within a record. */
2673 contains_placeholder_p (const_tree exp)
2675 enum tree_code code;
2680 code = TREE_CODE (exp);
2681 if (code == PLACEHOLDER_EXPR)
2684 switch (TREE_CODE_CLASS (code))
2687 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2688 position computations since they will be converted into a
2689 WITH_RECORD_EXPR involving the reference, which will assume
2690 here will be valid. */
2691 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2693 case tcc_exceptional:
2694 if (code == TREE_LIST)
2695 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2696 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2701 case tcc_comparison:
2702 case tcc_expression:
2706 /* Ignoring the first operand isn't quite right, but works best. */
2707 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2710 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2711 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2712 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2715 /* The save_expr function never wraps anything containing
2716 a PLACEHOLDER_EXPR. */
2723 switch (TREE_CODE_LENGTH (code))
2726 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2728 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2729 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2740 const_call_expr_arg_iterator iter;
2741 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2742 if (CONTAINS_PLACEHOLDER_P (arg))
2756 /* Return true if any part of the computation of TYPE involves a
2757 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2758 (for QUAL_UNION_TYPE) and field positions. */
2761 type_contains_placeholder_1 (const_tree type)
2763 /* If the size contains a placeholder or the parent type (component type in
2764 the case of arrays) type involves a placeholder, this type does. */
2765 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2766 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2767 || (TREE_TYPE (type) != 0
2768 && type_contains_placeholder_p (TREE_TYPE (type))))
2771 /* Now do type-specific checks. Note that the last part of the check above
2772 greatly limits what we have to do below. */
2773 switch (TREE_CODE (type))
2781 case REFERENCE_TYPE:
2789 case FIXED_POINT_TYPE:
2790 /* Here we just check the bounds. */
2791 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2792 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2795 /* We're already checked the component type (TREE_TYPE), so just check
2797 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2801 case QUAL_UNION_TYPE:
2805 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2806 if (TREE_CODE (field) == FIELD_DECL
2807 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2808 || (TREE_CODE (type) == QUAL_UNION_TYPE
2809 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2810 || type_contains_placeholder_p (TREE_TYPE (field))))
2822 type_contains_placeholder_p (tree type)
2826 /* If the contains_placeholder_bits field has been initialized,
2827 then we know the answer. */
2828 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2829 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2831 /* Indicate that we've seen this type node, and the answer is false.
2832 This is what we want to return if we run into recursion via fields. */
2833 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2835 /* Compute the real value. */
2836 result = type_contains_placeholder_1 (type);
2838 /* Store the real value. */
2839 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2844 /* Push tree EXP onto vector QUEUE if it is not already present. */
2847 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2852 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2853 if (simple_cst_equal (iter, exp) == 1)
2857 VEC_safe_push (tree, heap, *queue, exp);
2860 /* Given a tree EXP, find all occurences of references to fields
2861 in a PLACEHOLDER_EXPR and place them in vector REFS without
2862 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2863 we assume here that EXP contains only arithmetic expressions
2864 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2868 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2870 enum tree_code code = TREE_CODE (exp);
2874 /* We handle TREE_LIST and COMPONENT_REF separately. */
2875 if (code == TREE_LIST)
2877 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2878 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2880 else if (code == COMPONENT_REF)
2882 for (inner = TREE_OPERAND (exp, 0);
2883 REFERENCE_CLASS_P (inner);
2884 inner = TREE_OPERAND (inner, 0))
2887 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2888 push_without_duplicates (exp, refs);
2890 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2893 switch (TREE_CODE_CLASS (code))
2898 case tcc_declaration:
2899 /* Variables allocated to static storage can stay. */
2900 if (!TREE_STATIC (exp))
2901 push_without_duplicates (exp, refs);
2904 case tcc_expression:
2905 /* This is the pattern built in ada/make_aligning_type. */
2906 if (code == ADDR_EXPR
2907 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2909 push_without_duplicates (exp, refs);
2913 /* Fall through... */
2915 case tcc_exceptional:
2918 case tcc_comparison:
2920 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2921 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2925 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2926 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2934 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2935 return a tree with all occurrences of references to F in a
2936 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2937 CONST_DECLs. Note that we assume here that EXP contains only
2938 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2939 occurring only in their argument list. */
2942 substitute_in_expr (tree exp, tree f, tree r)
2944 enum tree_code code = TREE_CODE (exp);
2945 tree op0, op1, op2, op3;
2948 /* We handle TREE_LIST and COMPONENT_REF separately. */
2949 if (code == TREE_LIST)
2951 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2952 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2953 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2956 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2958 else if (code == COMPONENT_REF)
2962 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2963 and it is the right field, replace it with R. */
2964 for (inner = TREE_OPERAND (exp, 0);
2965 REFERENCE_CLASS_P (inner);
2966 inner = TREE_OPERAND (inner, 0))
2970 op1 = TREE_OPERAND (exp, 1);
2972 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2975 /* If this expression hasn't been completed let, leave it alone. */
2976 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2979 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2980 if (op0 == TREE_OPERAND (exp, 0))
2984 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
2987 switch (TREE_CODE_CLASS (code))
2992 case tcc_declaration:
2998 case tcc_expression:
3002 /* Fall through... */
3004 case tcc_exceptional:
3007 case tcc_comparison:
3009 switch (TREE_CODE_LENGTH (code))
3015 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3016 if (op0 == TREE_OPERAND (exp, 0))
3019 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3023 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3024 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3026 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3029 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3033 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3034 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3035 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3037 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3038 && op2 == TREE_OPERAND (exp, 2))
3041 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3045 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3046 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3047 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3048 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3050 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3051 && op2 == TREE_OPERAND (exp, 2)
3052 && op3 == TREE_OPERAND (exp, 3))
3056 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3068 new_tree = NULL_TREE;
3070 /* If we are trying to replace F with a constant, inline back
3071 functions which do nothing else than computing a value from
3072 the arguments they are passed. This makes it possible to
3073 fold partially or entirely the replacement expression. */
3074 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3076 tree t = maybe_inline_call_in_expr (exp);
3078 return SUBSTITUTE_IN_EXPR (t, f, r);
3081 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3083 tree op = TREE_OPERAND (exp, i);
3084 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3088 new_tree = copy_node (exp);
3089 TREE_OPERAND (new_tree, i) = new_op;
3095 new_tree = fold (new_tree);
3096 if (TREE_CODE (new_tree) == CALL_EXPR)
3097 process_call_operands (new_tree);
3108 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3112 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3113 for it within OBJ, a tree that is an object or a chain of references. */
3116 substitute_placeholder_in_expr (tree exp, tree obj)
3118 enum tree_code code = TREE_CODE (exp);
3119 tree op0, op1, op2, op3;
3122 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3123 in the chain of OBJ. */
3124 if (code == PLACEHOLDER_EXPR)
3126 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3129 for (elt = obj; elt != 0;
3130 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3131 || TREE_CODE (elt) == COND_EXPR)
3132 ? TREE_OPERAND (elt, 1)
3133 : (REFERENCE_CLASS_P (elt)
3134 || UNARY_CLASS_P (elt)
3135 || BINARY_CLASS_P (elt)
3136 || VL_EXP_CLASS_P (elt)
3137 || EXPRESSION_CLASS_P (elt))
3138 ? TREE_OPERAND (elt, 0) : 0))
3139 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3142 for (elt = obj; elt != 0;
3143 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3144 || TREE_CODE (elt) == COND_EXPR)
3145 ? TREE_OPERAND (elt, 1)
3146 : (REFERENCE_CLASS_P (elt)
3147 || UNARY_CLASS_P (elt)
3148 || BINARY_CLASS_P (elt)
3149 || VL_EXP_CLASS_P (elt)
3150 || EXPRESSION_CLASS_P (elt))
3151 ? TREE_OPERAND (elt, 0) : 0))
3152 if (POINTER_TYPE_P (TREE_TYPE (elt))
3153 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3155 return fold_build1 (INDIRECT_REF, need_type, elt);
3157 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3158 survives until RTL generation, there will be an error. */
3162 /* TREE_LIST is special because we need to look at TREE_VALUE
3163 and TREE_CHAIN, not TREE_OPERANDS. */
3164 else if (code == TREE_LIST)
3166 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3167 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3168 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3171 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3174 switch (TREE_CODE_CLASS (code))
3177 case tcc_declaration:
3180 case tcc_exceptional:
3183 case tcc_comparison:
3184 case tcc_expression:
3187 switch (TREE_CODE_LENGTH (code))
3193 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3194 if (op0 == TREE_OPERAND (exp, 0))
3197 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3201 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3202 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3204 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3207 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3211 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3212 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3213 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3215 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3216 && op2 == TREE_OPERAND (exp, 2))
3219 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3223 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3224 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3225 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3226 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3228 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3229 && op2 == TREE_OPERAND (exp, 2)
3230 && op3 == TREE_OPERAND (exp, 3))
3234 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3246 new_tree = NULL_TREE;
3248 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3250 tree op = TREE_OPERAND (exp, i);
3251 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3255 new_tree = copy_node (exp);
3256 TREE_OPERAND (new_tree, i) = new_op;
3262 new_tree = fold (new_tree);
3263 if (TREE_CODE (new_tree) == CALL_EXPR)
3264 process_call_operands (new_tree);
3275 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3279 /* Stabilize a reference so that we can use it any number of times
3280 without causing its operands to be evaluated more than once.
3281 Returns the stabilized reference. This works by means of save_expr,
3282 so see the caveats in the comments about save_expr.
3284 Also allows conversion expressions whose operands are references.
3285 Any other kind of expression is returned unchanged. */
3288 stabilize_reference (tree ref)
3291 enum tree_code code = TREE_CODE (ref);
3298 /* No action is needed in this case. */
3303 case FIX_TRUNC_EXPR:
3304 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3308 result = build_nt (INDIRECT_REF,
3309 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3313 result = build_nt (COMPONENT_REF,
3314 stabilize_reference (TREE_OPERAND (ref, 0)),
3315 TREE_OPERAND (ref, 1), NULL_TREE);
3319 result = build_nt (BIT_FIELD_REF,
3320 stabilize_reference (TREE_OPERAND (ref, 0)),
3321 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3322 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3326 result = build_nt (ARRAY_REF,
3327 stabilize_reference (TREE_OPERAND (ref, 0)),
3328 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3329 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3332 case ARRAY_RANGE_REF:
3333 result = build_nt (ARRAY_RANGE_REF,
3334 stabilize_reference (TREE_OPERAND (ref, 0)),
3335 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3336 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3340 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3341 it wouldn't be ignored. This matters when dealing with
3343 return stabilize_reference_1 (ref);
3345 /* If arg isn't a kind of lvalue we recognize, make no change.
3346 Caller should recognize the error for an invalid lvalue. */
3351 return error_mark_node;
3354 TREE_TYPE (result) = TREE_TYPE (ref);
3355 TREE_READONLY (result) = TREE_READONLY (ref);
3356 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3357 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3362 /* Subroutine of stabilize_reference; this is called for subtrees of
3363 references. Any expression with side-effects must be put in a SAVE_EXPR
3364 to ensure that it is only evaluated once.
3366 We don't put SAVE_EXPR nodes around everything, because assigning very
3367 simple expressions to temporaries causes us to miss good opportunities
3368 for optimizations. Among other things, the opportunity to fold in the
3369 addition of a constant into an addressing mode often gets lost, e.g.
3370 "y[i+1] += x;". In general, we take the approach that we should not make
3371 an assignment unless we are forced into it - i.e., that any non-side effect
3372 operator should be allowed, and that cse should take care of coalescing
3373 multiple utterances of the same expression should that prove fruitful. */
3376 stabilize_reference_1 (tree e)
3379 enum tree_code code = TREE_CODE (e);
3381 /* We cannot ignore const expressions because it might be a reference
3382 to a const array but whose index contains side-effects. But we can
3383 ignore things that are actual constant or that already have been
3384 handled by this function. */
3386 if (tree_invariant_p (e))
3389 switch (TREE_CODE_CLASS (code))
3391 case tcc_exceptional:
3393 case tcc_declaration:
3394 case tcc_comparison:
3396 case tcc_expression:
3399 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3400 so that it will only be evaluated once. */
3401 /* The reference (r) and comparison (<) classes could be handled as
3402 below, but it is generally faster to only evaluate them once. */
3403 if (TREE_SIDE_EFFECTS (e))
3404 return save_expr (e);
3408 /* Constants need no processing. In fact, we should never reach
3413 /* Division is slow and tends to be compiled with jumps,
3414 especially the division by powers of 2 that is often
3415 found inside of an array reference. So do it just once. */
3416 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3417 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3418 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3419 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3420 return save_expr (e);
3421 /* Recursively stabilize each operand. */
3422 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3423 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3427 /* Recursively stabilize each operand. */
3428 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3435 TREE_TYPE (result) = TREE_TYPE (e);
3436 TREE_READONLY (result) = TREE_READONLY (e);
3437 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3438 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3443 /* Low-level constructors for expressions. */
3445 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3446 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3449 recompute_tree_invariant_for_addr_expr (tree t)
3452 bool tc = true, se = false;
3454 /* We started out assuming this address is both invariant and constant, but
3455 does not have side effects. Now go down any handled components and see if
3456 any of them involve offsets that are either non-constant or non-invariant.
3457 Also check for side-effects.
3459 ??? Note that this code makes no attempt to deal with the case where
3460 taking the address of something causes a copy due to misalignment. */
3462 #define UPDATE_FLAGS(NODE) \
3463 do { tree _node = (NODE); \
3464 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3465 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3467 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3468 node = TREE_OPERAND (node, 0))
3470 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3471 array reference (probably made temporarily by the G++ front end),
3472 so ignore all the operands. */
3473 if ((TREE_CODE (node) == ARRAY_REF
3474 || TREE_CODE (node) == ARRAY_RANGE_REF)
3475 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3477 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3478 if (TREE_OPERAND (node, 2))
3479 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3480 if (TREE_OPERAND (node, 3))
3481 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3483 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3484 FIELD_DECL, apparently. The G++ front end can put something else
3485 there, at least temporarily. */
3486 else if (TREE_CODE (node) == COMPONENT_REF
3487 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3489 if (TREE_OPERAND (node, 2))
3490 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3492 else if (TREE_CODE (node) == BIT_FIELD_REF)
3493 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3496 node = lang_hooks.expr_to_decl (node, &tc, &se);
3498 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3499 the address, since &(*a)->b is a form of addition. If it's a constant, the
3500 address is constant too. If it's a decl, its address is constant if the
3501 decl is static. Everything else is not constant and, furthermore,
3502 taking the address of a volatile variable is not volatile. */
3503 if (TREE_CODE (node) == INDIRECT_REF)
3504 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3505 else if (CONSTANT_CLASS_P (node))
3507 else if (DECL_P (node))
3508 tc &= (staticp (node) != NULL_TREE);
3512 se |= TREE_SIDE_EFFECTS (node);
3516 TREE_CONSTANT (t) = tc;
3517 TREE_SIDE_EFFECTS (t) = se;
3521 /* Build an expression of code CODE, data type TYPE, and operands as
3522 specified. Expressions and reference nodes can be created this way.
3523 Constants, decls, types and misc nodes cannot be.
3525 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3526 enough for all extant tree codes. */
3529 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3533 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3535 t = make_node_stat (code PASS_MEM_STAT);
3542 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3544 int length = sizeof (struct tree_exp);
3545 #ifdef GATHER_STATISTICS
3546 tree_node_kind kind;
3550 #ifdef GATHER_STATISTICS
3551 switch (TREE_CODE_CLASS (code))
3553 case tcc_statement: /* an expression with side effects */
3556 case tcc_reference: /* a reference */
3564 tree_node_counts[(int) kind]++;
3565 tree_node_sizes[(int) kind] += length;
3568 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3570 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3572 memset (t, 0, sizeof (struct tree_common));
3574 TREE_SET_CODE (t, code);
3576 TREE_TYPE (t) = type;
3577 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3578 TREE_OPERAND (t, 0) = node;
3579 TREE_BLOCK (t) = NULL_TREE;
3580 if (node && !TYPE_P (node))
3582 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3583 TREE_READONLY (t) = TREE_READONLY (node);
3586 if (TREE_CODE_CLASS (code) == tcc_statement)
3587 TREE_SIDE_EFFECTS (t) = 1;
3591 /* All of these have side-effects, no matter what their
3593 TREE_SIDE_EFFECTS (t) = 1;
3594 TREE_READONLY (t) = 0;
3597 case MISALIGNED_INDIRECT_REF:
3598 case ALIGN_INDIRECT_REF:
3600 /* Whether a dereference is readonly has nothing to do with whether
3601 its operand is readonly. */
3602 TREE_READONLY (t) = 0;
3607 recompute_tree_invariant_for_addr_expr (t);
3611 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3612 && node && !TYPE_P (node)
3613 && TREE_CONSTANT (node))
3614 TREE_CONSTANT (t) = 1;
3615 if (TREE_CODE_CLASS (code) == tcc_reference
3616 && node && TREE_THIS_VOLATILE (node))
3617 TREE_THIS_VOLATILE (t) = 1;
3624 #define PROCESS_ARG(N) \
3626 TREE_OPERAND (t, N) = arg##N; \
3627 if (arg##N &&!TYPE_P (arg##N)) \
3629 if (TREE_SIDE_EFFECTS (arg##N)) \
3631 if (!TREE_READONLY (arg##N) \
3632 && !CONSTANT_CLASS_P (arg##N)) \
3634 if (!TREE_CONSTANT (arg##N)) \
3640 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3642 bool constant, read_only, side_effects;
3645 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3647 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3648 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3649 /* When sizetype precision doesn't match that of pointers
3650 we need to be able to build explicit extensions or truncations
3651 of the offset argument. */
3652 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3653 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3654 && TREE_CODE (arg1) == INTEGER_CST);
3656 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3657 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3658 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3659 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3661 t = make_node_stat (code PASS_MEM_STAT);
3664 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3665 result based on those same flags for the arguments. But if the
3666 arguments aren't really even `tree' expressions, we shouldn't be trying
3669 /* Expressions without side effects may be constant if their
3670 arguments are as well. */
3671 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3672 || TREE_CODE_CLASS (code) == tcc_binary);
3674 side_effects = TREE_SIDE_EFFECTS (t);
3679 TREE_READONLY (t) = read_only;
3680 TREE_CONSTANT (t) = constant;
3681 TREE_SIDE_EFFECTS (t) = side_effects;
3682 TREE_THIS_VOLATILE (t)
3683 = (TREE_CODE_CLASS (code) == tcc_reference
3684 && arg0 && TREE_THIS_VOLATILE (arg0));
3691 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3692 tree arg2 MEM_STAT_DECL)
3694 bool constant, read_only, side_effects;
3697 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3698 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3700 t = make_node_stat (code PASS_MEM_STAT);
3705 /* As a special exception, if COND_EXPR has NULL branches, we
3706 assume that it is a gimple statement and always consider
3707 it to have side effects. */
3708 if (code == COND_EXPR
3709 && tt == void_type_node
3710 && arg1 == NULL_TREE
3711 && arg2 == NULL_TREE)
3712 side_effects = true;
3714 side_effects = TREE_SIDE_EFFECTS (t);
3720 if (code == COND_EXPR)
3721 TREE_READONLY (t) = read_only;
3723 TREE_SIDE_EFFECTS (t) = side_effects;
3724 TREE_THIS_VOLATILE (t)
3725 = (TREE_CODE_CLASS (code) == tcc_reference
3726 && arg0 && TREE_THIS_VOLATILE (arg0));
3732 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3733 tree arg2, tree arg3 MEM_STAT_DECL)
3735 bool constant, read_only, side_effects;
3738 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3740 t = make_node_stat (code PASS_MEM_STAT);
3743 side_effects = TREE_SIDE_EFFECTS (t);
3750 TREE_SIDE_EFFECTS (t) = side_effects;
3751 TREE_THIS_VOLATILE (t)
3752 = (TREE_CODE_CLASS (code) == tcc_reference
3753 && arg0 && TREE_THIS_VOLATILE (arg0));
3759 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3760 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3762 bool constant, read_only, side_effects;
3765 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3767 t = make_node_stat (code PASS_MEM_STAT);
3770 side_effects = TREE_SIDE_EFFECTS (t);
3778 TREE_SIDE_EFFECTS (t) = side_effects;
3779 TREE_THIS_VOLATILE (t)
3780 = (TREE_CODE_CLASS (code) == tcc_reference
3781 && arg0 && TREE_THIS_VOLATILE (arg0));
3787 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3788 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3790 bool constant, read_only, side_effects;
3793 gcc_assert (code == TARGET_MEM_REF);
3795 t = make_node_stat (code PASS_MEM_STAT);
3798 side_effects = TREE_SIDE_EFFECTS (t);
3807 TREE_SIDE_EFFECTS (t) = side_effects;
3808 TREE_THIS_VOLATILE (t) = 0;
3813 /* Similar except don't specify the TREE_TYPE
3814 and leave the TREE_SIDE_EFFECTS as 0.
3815 It is permissible for arguments to be null,
3816 or even garbage if their values do not matter. */
3819 build_nt (enum tree_code code, ...)
3826 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3830 t = make_node (code);
3831 length = TREE_CODE_LENGTH (code);
3833 for (i = 0; i < length; i++)
3834 TREE_OPERAND (t, i) = va_arg (p, tree);
3840 /* Similar to build_nt, but for creating a CALL_EXPR object with
3841 ARGLIST passed as a list. */
3844 build_nt_call_list (tree fn, tree arglist)
3849 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3850 CALL_EXPR_FN (t) = fn;
3851 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3852 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3853 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3857 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3861 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3866 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3867 CALL_EXPR_FN (ret) = fn;
3868 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3869 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3870 CALL_EXPR_ARG (ret, ix) = t;
3874 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3875 We do NOT enter this node in any sort of symbol table.
3877 LOC is the location of the decl.
3879 layout_decl is used to set up the decl's storage layout.
3880 Other slots are initialized to 0 or null pointers. */
3883 build_decl_stat (location_t loc, enum tree_code code, tree name,
3884 tree type MEM_STAT_DECL)
3888 t = make_node_stat (code PASS_MEM_STAT);
3889 DECL_SOURCE_LOCATION (t) = loc;
3891 /* if (type == error_mark_node)
3892 type = integer_type_node; */
3893 /* That is not done, deliberately, so that having error_mark_node
3894 as the type can suppress useless errors in the use of this variable. */
3896 DECL_NAME (t) = name;
3897 TREE_TYPE (t) = type;
3899 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3905 /* Builds and returns function declaration with NAME and TYPE. */
3908 build_fn_decl (const char *name, tree type)
3910 tree id = get_identifier (name);
3911 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3913 DECL_EXTERNAL (decl) = 1;
3914 TREE_PUBLIC (decl) = 1;
3915 DECL_ARTIFICIAL (decl) = 1;
3916 TREE_NOTHROW (decl) = 1;
3922 /* BLOCK nodes are used to represent the structure of binding contours
3923 and declarations, once those contours have been exited and their contents
3924 compiled. This information is used for outputting debugging info. */
3927 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3929 tree block = make_node (BLOCK);
3931 BLOCK_VARS (block) = vars;
3932 BLOCK_SUBBLOCKS (block) = subblocks;
3933 BLOCK_SUPERCONTEXT (block) = supercontext;
3934 BLOCK_CHAIN (block) = chain;
3939 expand_location (source_location loc)
3941 expanded_location xloc;
3951 const struct line_map *map = linemap_lookup (line_table, loc);
3952 xloc.file = map->to_file;
3953 xloc.line = SOURCE_LINE (map, loc);
3954 xloc.column = SOURCE_COLUMN (map, loc);
3955 xloc.sysp = map->sysp != 0;
3961 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3963 LOC is the location to use in tree T. */
3966 protected_set_expr_location (tree t, location_t loc)
3968 if (t && CAN_HAVE_LOCATION_P (t))
3969 SET_EXPR_LOCATION (t, loc);
3972 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3976 build_decl_attribute_variant (tree ddecl, tree attribute)
3978 DECL_ATTRIBUTES (ddecl) = attribute;
3982 /* Borrowed from hashtab.c iterative_hash implementation. */
3983 #define mix(a,b,c) \
3985 a -= b; a -= c; a ^= (c>>13); \
3986 b -= c; b -= a; b ^= (a<< 8); \
3987 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3988 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3989 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3990 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3991 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3992 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3993 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3997 /* Produce good hash value combining VAL and VAL2. */
3999 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4001 /* the golden ratio; an arbitrary value. */
4002 hashval_t a = 0x9e3779b9;
4008 /* Produce good hash value combining VAL and VAL2. */
4010 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4012 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4013 return iterative_hash_hashval_t (val, val2);
4016 hashval_t a = (hashval_t) val;
4017 /* Avoid warnings about shifting of more than the width of the type on
4018 hosts that won't execute this path. */
4020 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4022 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4024 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4025 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4032 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4033 is ATTRIBUTE and its qualifiers are QUALS.
4035 Record such modified types already made so we don't make duplicates. */
4038 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4040 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4042 hashval_t hashcode = 0;
4044 enum tree_code code = TREE_CODE (ttype);
4046 /* Building a distinct copy of a tagged type is inappropriate; it
4047 causes breakage in code that expects there to be a one-to-one
4048 relationship between a struct and its fields.
4049 build_duplicate_type is another solution (as used in
4050 handle_transparent_union_attribute), but that doesn't play well
4051 with the stronger C++ type identity model. */
4052 if (TREE_CODE (ttype) == RECORD_TYPE
4053 || TREE_CODE (ttype) == UNION_TYPE
4054 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4055 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4057 warning (OPT_Wattributes,
4058 "ignoring attributes applied to %qT after definition",
4059 TYPE_MAIN_VARIANT (ttype));
4060 return build_qualified_type (ttype, quals);
4063 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4064 ntype = build_distinct_type_copy (ttype);
4066 TYPE_ATTRIBUTES (ntype) = attribute;
4068 hashcode = iterative_hash_object (code, hashcode);
4069 if (TREE_TYPE (ntype))
4070 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4072 hashcode = attribute_hash_list (attribute, hashcode);
4074 switch (TREE_CODE (ntype))
4077 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4080 if (TYPE_DOMAIN (ntype))
4081 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4085 hashcode = iterative_hash_object
4086 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4087 hashcode = iterative_hash_object
4088 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4091 case FIXED_POINT_TYPE:
4093 unsigned int precision = TYPE_PRECISION (ntype);
4094 hashcode = iterative_hash_object (precision, hashcode);
4101 ntype = type_hash_canon (hashcode, ntype);
4103 /* If the target-dependent attributes make NTYPE different from
4104 its canonical type, we will need to use structural equality
4105 checks for this type. */
4106 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4107 || !targetm.comp_type_attributes (ntype, ttype))
4108 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4109 else if (TYPE_CANONICAL (ntype) == ntype)
4110 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4112 ttype = build_qualified_type (ntype, quals);
4114 else if (TYPE_QUALS (ttype) != quals)
4115 ttype = build_qualified_type (ttype, quals);
4121 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4124 Record such modified types already made so we don't make duplicates. */
4127 build_type_attribute_variant (tree ttype, tree attribute)
4129 return build_type_attribute_qual_variant (ttype, attribute,
4130 TYPE_QUALS (ttype));
4134 /* Reset all the fields in a binfo node BINFO. We only keep
4135 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4138 free_lang_data_in_binfo (tree binfo)
4143 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4145 BINFO_OFFSET (binfo) = NULL_TREE;
4146 BINFO_VTABLE (binfo) = NULL_TREE;
4147 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4148 BINFO_BASE_ACCESSES (binfo) = NULL;
4149 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4150 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4151 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4153 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4154 free_lang_data_in_binfo (t);
4158 /* Reset all language specific information still present in TYPE. */
4161 free_lang_data_in_type (tree type)
4163 gcc_assert (TYPE_P (type));
4165 /* Fill in the alias-set. We need to at least track zeroness here
4167 if (lang_hooks.get_alias_set (type) == 0)
4168 TYPE_ALIAS_SET (type) = 0;
4170 /* Give the FE a chance to remove its own data first. */
4171 lang_hooks.free_lang_data (type);
4173 TREE_LANG_FLAG_0 (type) = 0;
4174 TREE_LANG_FLAG_1 (type) = 0;
4175 TREE_LANG_FLAG_2 (type) = 0;
4176 TREE_LANG_FLAG_3 (type) = 0;
4177 TREE_LANG_FLAG_4 (type) = 0;
4178 TREE_LANG_FLAG_5 (type) = 0;
4179 TREE_LANG_FLAG_6 (type) = 0;
4181 if (TREE_CODE (type) == FUNCTION_TYPE)
4183 /* Remove the const and volatile qualifiers from arguments. The
4184 C++ front end removes them, but the C front end does not,
4185 leading to false ODR violation errors when merging two
4186 instances of the same function signature compiled by
4187 different front ends. */
4190 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4192 tree arg_type = TREE_VALUE (p);
4194 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4196 int quals = TYPE_QUALS (arg_type)
4198 & ~TYPE_QUAL_VOLATILE;
4199 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4200 free_lang_data_in_type (TREE_VALUE (p));
4205 /* Remove members that are not actually FIELD_DECLs from the field
4206 list of an aggregate. These occur in C++. */
4207 if (RECORD_OR_UNION_TYPE_P (type))
4211 /* Note that TYPE_FIELDS can be shared across distinct
4212 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4213 to be removed, we cannot set its TREE_CHAIN to NULL.
4214 Otherwise, we would not be able to find all the other fields
4215 in the other instances of this TREE_TYPE.
4217 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4219 member = TYPE_FIELDS (type);
4222 if (TREE_CODE (member) == FIELD_DECL)
4225 TREE_CHAIN (prev) = member;
4227 TYPE_FIELDS (type) = member;
4231 member = TREE_CHAIN (member);
4235 TREE_CHAIN (prev) = NULL_TREE;
4237 TYPE_FIELDS (type) = NULL_TREE;
4239 TYPE_METHODS (type) = NULL_TREE;
4240 if (TYPE_BINFO (type))
4241 free_lang_data_in_binfo (TYPE_BINFO (type));
4245 /* For non-aggregate types, clear out the language slot (which
4246 overloads TYPE_BINFO). */
4247 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4250 TYPE_CONTEXT (type) = NULL_TREE;
4251 TYPE_STUB_DECL (type) = NULL_TREE;
4255 /* Return true if DECL may need an assembler name to be set. */
4258 need_assembler_name_p (tree decl)
4260 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4261 if (TREE_CODE (decl) != FUNCTION_DECL
4262 && TREE_CODE (decl) != VAR_DECL)
4265 /* If DECL already has its assembler name set, it does not need a
4267 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4268 || DECL_ASSEMBLER_NAME_SET_P (decl))
4271 /* For VAR_DECLs, only static, public and external symbols need an
4273 if (TREE_CODE (decl) == VAR_DECL
4274 && !TREE_STATIC (decl)
4275 && !TREE_PUBLIC (decl)
4276 && !DECL_EXTERNAL (decl))
4279 if (TREE_CODE (decl) == FUNCTION_DECL)
4281 /* Do not set assembler name on builtins. Allow RTL expansion to
4282 decide whether to expand inline or via a regular call. */
4283 if (DECL_BUILT_IN (decl)
4284 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4287 /* Functions represented in the callgraph need an assembler name. */
4288 if (cgraph_node_for_decl (decl) != NULL)
4291 /* Unused and not public functions don't need an assembler name. */
4292 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4300 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4301 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4302 in BLOCK that is not in LOCALS is removed. */
4305 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4309 tp = &BLOCK_VARS (block);
4312 if (!pointer_set_contains (locals, *tp))
4313 *tp = TREE_CHAIN (*tp);
4315 tp = &TREE_CHAIN (*tp);
4318 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4319 free_lang_data_in_block (fn, t, locals);
4323 /* Reset all language specific information still present in symbol
4327 free_lang_data_in_decl (tree decl)
4329 gcc_assert (DECL_P (decl));
4331 /* Give the FE a chance to remove its own data first. */
4332 lang_hooks.free_lang_data (decl);
4334 TREE_LANG_FLAG_0 (decl) = 0;
4335 TREE_LANG_FLAG_1 (decl) = 0;
4336 TREE_LANG_FLAG_2 (decl) = 0;
4337 TREE_LANG_FLAG_3 (decl) = 0;
4338 TREE_LANG_FLAG_4 (decl) = 0;
4339 TREE_LANG_FLAG_5 (decl) = 0;
4340 TREE_LANG_FLAG_6 (decl) = 0;
4342 /* Identifiers need not have a type. */
4343 if (DECL_NAME (decl))
4344 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4346 /* Ignore any intervening types, because we are going to clear their
4347 TYPE_CONTEXT fields. */
4348 if (TREE_CODE (decl) != FIELD_DECL)
4349 DECL_CONTEXT (decl) = decl_function_context (decl);
4351 if (DECL_CONTEXT (decl)
4352 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4353 DECL_CONTEXT (decl) = NULL_TREE;
4355 if (TREE_CODE (decl) == VAR_DECL)
4357 tree context = DECL_CONTEXT (decl);
4361 enum tree_code code = TREE_CODE (context);
4362 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4364 /* Do not clear the decl context here, that will promote
4365 all vars to global ones. */
4366 DECL_INITIAL (decl) = NULL_TREE;
4369 if (TREE_STATIC (decl))
4370 DECL_CONTEXT (decl) = NULL_TREE;
4374 if (TREE_CODE (decl) == PARM_DECL
4375 || TREE_CODE (decl) == FIELD_DECL
4376 || TREE_CODE (decl) == RESULT_DECL)
4378 tree unit_size = DECL_SIZE_UNIT (decl);
4379 tree size = DECL_SIZE (decl);
4380 if ((unit_size && TREE_CODE (unit_size) != INTEGER_CST)
4381 || (size && TREE_CODE (size) != INTEGER_CST))
4383 DECL_SIZE_UNIT (decl) = NULL_TREE;
4384 DECL_SIZE (decl) = NULL_TREE;
4387 if (TREE_CODE (decl) == FIELD_DECL
4388 && DECL_FIELD_OFFSET (decl)
4389 && TREE_CODE (DECL_FIELD_OFFSET (decl)) != INTEGER_CST)
4390 DECL_FIELD_OFFSET (decl) = NULL_TREE;
4392 else if (TREE_CODE (decl) == FUNCTION_DECL)
4394 if (gimple_has_body_p (decl))
4397 struct pointer_set_t *locals;
4399 /* If DECL has a gimple body, then the context for its
4400 arguments must be DECL. Otherwise, it doesn't really
4401 matter, as we will not be emitting any code for DECL. In
4402 general, there may be other instances of DECL created by
4403 the front end and since PARM_DECLs are generally shared,
4404 their DECL_CONTEXT changes as the replicas of DECL are
4405 created. The only time where DECL_CONTEXT is important
4406 is for the FUNCTION_DECLs that have a gimple body (since
4407 the PARM_DECL will be used in the function's body). */
4408 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4409 DECL_CONTEXT (t) = decl;
4411 /* Collect all the symbols declared in DECL. */
4412 locals = pointer_set_create ();
4413 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4414 for (; t; t = TREE_CHAIN (t))
4416 pointer_set_insert (locals, TREE_VALUE (t));
4418 /* All the local symbols should have DECL as their
4420 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4423 /* Get rid of any decl not in local_decls. */
4424 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4426 pointer_set_destroy (locals);
4429 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4430 At this point, it is not needed anymore. */
4431 DECL_SAVED_TREE (decl) = NULL_TREE;
4433 else if (TREE_CODE (decl) == VAR_DECL)
4435 tree expr = DECL_DEBUG_EXPR (decl);
4437 && TREE_CODE (expr) == VAR_DECL
4438 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4439 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4441 if (DECL_EXTERNAL (decl)
4442 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4443 DECL_INITIAL (decl) = NULL_TREE;
4445 else if (TREE_CODE (decl) == TYPE_DECL)
4447 DECL_INITIAL (decl) = NULL_TREE;
4449 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4450 FIELD_DECLs, which should be preserved. Otherwise,
4451 we shouldn't be concerned with source-level lexical
4452 nesting beyond this point. */
4453 DECL_CONTEXT (decl) = NULL_TREE;
4458 /* Data used when collecting DECLs and TYPEs for language data removal. */
4460 struct free_lang_data_d
4462 /* Worklist to avoid excessive recursion. */
4463 VEC(tree,heap) *worklist;
4465 /* Set of traversed objects. Used to avoid duplicate visits. */
4466 struct pointer_set_t *pset;
4468 /* Array of symbols to process with free_lang_data_in_decl. */
4469 VEC(tree,heap) *decls;
4471 /* Array of types to process with free_lang_data_in_type. */
4472 VEC(tree,heap) *types;
4476 /* Save all language fields needed to generate proper debug information
4477 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4480 save_debug_info_for_decl (tree t)
4482 /*struct saved_debug_info_d *sdi;*/
4484 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4486 /* FIXME. Partial implementation for saving debug info removed. */
4490 /* Save all language fields needed to generate proper debug information
4491 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4494 save_debug_info_for_type (tree t)
4496 /*struct saved_debug_info_d *sdi;*/
4498 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4500 /* FIXME. Partial implementation for saving debug info removed. */
4504 /* Add type or decl T to one of the list of tree nodes that need their
4505 language data removed. The lists are held inside FLD. */
4508 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4512 VEC_safe_push (tree, heap, fld->decls, t);
4513 if (debug_info_level > DINFO_LEVEL_TERSE)
4514 save_debug_info_for_decl (t);
4516 else if (TYPE_P (t))
4518 VEC_safe_push (tree, heap, fld->types, t);
4519 if (debug_info_level > DINFO_LEVEL_TERSE)
4520 save_debug_info_for_type (t);
4526 /* Push tree node T into FLD->WORKLIST. */
4529 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4531 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4532 VEC_safe_push (tree, heap, fld->worklist, (t));
4536 /* Operand callback helper for free_lang_data_in_node. *TP is the
4537 subtree operand being considered. */
4540 find_decls_types_r (tree *tp, int *ws, void *data)
4543 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4545 if (TREE_CODE (t) == TREE_LIST)
4548 /* Language specific nodes will be removed, so there is no need
4549 to gather anything under them. */
4550 if (is_lang_specific (t))
4558 /* Note that walk_tree does not traverse every possible field in
4559 decls, so we have to do our own traversals here. */
4560 add_tree_to_fld_list (t, fld);
4562 fld_worklist_push (DECL_NAME (t), fld);
4563 fld_worklist_push (DECL_CONTEXT (t), fld);
4564 fld_worklist_push (DECL_SIZE (t), fld);
4565 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4567 /* We are going to remove everything under DECL_INITIAL for
4568 TYPE_DECLs. No point walking them. */
4569 if (TREE_CODE (t) != TYPE_DECL)
4570 fld_worklist_push (DECL_INITIAL (t), fld);
4572 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4573 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4575 if (TREE_CODE (t) == FUNCTION_DECL)
4577 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4578 fld_worklist_push (DECL_RESULT (t), fld);
4580 else if (TREE_CODE (t) == TYPE_DECL)
4582 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4583 fld_worklist_push (DECL_VINDEX (t), fld);
4585 else if (TREE_CODE (t) == FIELD_DECL)
4587 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4588 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4589 fld_worklist_push (DECL_QUALIFIER (t), fld);
4590 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4591 fld_worklist_push (DECL_FCONTEXT (t), fld);
4593 else if (TREE_CODE (t) == VAR_DECL)
4595 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4596 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4599 if (TREE_CODE (t) != FIELD_DECL)
4600 fld_worklist_push (TREE_CHAIN (t), fld);
4603 else if (TYPE_P (t))
4605 /* Note that walk_tree does not traverse every possible field in
4606 types, so we have to do our own traversals here. */
4607 add_tree_to_fld_list (t, fld);
4609 if (!RECORD_OR_UNION_TYPE_P (t))
4610 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4611 fld_worklist_push (TYPE_SIZE (t), fld);
4612 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4613 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4614 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4615 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4616 fld_worklist_push (TYPE_NAME (t), fld);
4617 fld_worklist_push (TYPE_MINVAL (t), fld);
4618 if (!RECORD_OR_UNION_TYPE_P (t))
4619 fld_worklist_push (TYPE_MAXVAL (t), fld);
4620 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4621 fld_worklist_push (TYPE_NEXT_VARIANT (t), fld);
4622 fld_worklist_push (TYPE_CONTEXT (t), fld);
4623 fld_worklist_push (TYPE_CANONICAL (t), fld);
4625 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4629 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4631 fld_worklist_push (TREE_TYPE (tem), fld);
4632 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4635 fld_worklist_push (TREE_VALUE (tem), fld);
4636 tem = TREE_CHAIN (tem);
4639 if (RECORD_OR_UNION_TYPE_P (t))
4642 /* Push all TYPE_FIELDS - there can be interleaving interesting
4643 and non-interesting things. */
4644 tem = TYPE_FIELDS (t);
4647 if (TREE_CODE (tem) == FIELD_DECL)
4648 fld_worklist_push (tem, fld);
4649 tem = TREE_CHAIN (tem);
4653 fld_worklist_push (TREE_CHAIN (t), fld);
4657 fld_worklist_push (TREE_TYPE (t), fld);
4663 /* Find decls and types in T. */
4666 find_decls_types (tree t, struct free_lang_data_d *fld)
4670 if (!pointer_set_contains (fld->pset, t))
4671 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4672 if (VEC_empty (tree, fld->worklist))
4674 t = VEC_pop (tree, fld->worklist);
4678 /* Translate all the types in LIST with the corresponding runtime
4682 get_eh_types_for_runtime (tree list)
4686 if (list == NULL_TREE)
4689 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4691 list = TREE_CHAIN (list);
4694 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4695 TREE_CHAIN (prev) = n;
4696 prev = TREE_CHAIN (prev);
4697 list = TREE_CHAIN (list);
4704 /* Find decls and types referenced in EH region R and store them in
4705 FLD->DECLS and FLD->TYPES. */
4708 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4719 /* The types referenced in each catch must first be changed to the
4720 EH types used at runtime. This removes references to FE types
4722 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4724 c->type_list = get_eh_types_for_runtime (c->type_list);
4725 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4730 case ERT_ALLOWED_EXCEPTIONS:
4731 r->u.allowed.type_list
4732 = get_eh_types_for_runtime (r->u.allowed.type_list);
4733 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4736 case ERT_MUST_NOT_THROW:
4737 walk_tree (&r->u.must_not_throw.failure_decl,
4738 find_decls_types_r, fld, fld->pset);
4744 /* Find decls and types referenced in cgraph node N and store them in
4745 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4746 look for *every* kind of DECL and TYPE node reachable from N,
4747 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4748 NAMESPACE_DECLs, etc). */
4751 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4754 struct function *fn;
4757 find_decls_types (n->decl, fld);
4759 if (!gimple_has_body_p (n->decl))
4762 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4764 fn = DECL_STRUCT_FUNCTION (n->decl);
4766 /* Traverse locals. */
4767 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4768 find_decls_types (TREE_VALUE (t), fld);
4770 /* Traverse EH regions in FN. */
4773 FOR_ALL_EH_REGION_FN (r, fn)
4774 find_decls_types_in_eh_region (r, fld);
4777 /* Traverse every statement in FN. */
4778 FOR_EACH_BB_FN (bb, fn)
4780 gimple_stmt_iterator si;
4783 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4785 gimple phi = gsi_stmt (si);
4787 for (i = 0; i < gimple_phi_num_args (phi); i++)
4789 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4790 find_decls_types (*arg_p, fld);
4794 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4796 gimple stmt = gsi_stmt (si);
4798 for (i = 0; i < gimple_num_ops (stmt); i++)
4800 tree arg = gimple_op (stmt, i);
4801 find_decls_types (arg, fld);
4808 /* Find decls and types referenced in varpool node N and store them in
4809 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4810 look for *every* kind of DECL and TYPE node reachable from N,
4811 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4812 NAMESPACE_DECLs, etc). */
4815 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4817 find_decls_types (v->decl, fld);
4821 /* Free language specific information for every operand and expression
4822 in every node of the call graph. This process operates in three stages:
4824 1- Every callgraph node and varpool node is traversed looking for
4825 decls and types embedded in them. This is a more exhaustive
4826 search than that done by find_referenced_vars, because it will
4827 also collect individual fields, decls embedded in types, etc.
4829 2- All the decls found are sent to free_lang_data_in_decl.
4831 3- All the types found are sent to free_lang_data_in_type.
4833 The ordering between decls and types is important because
4834 free_lang_data_in_decl sets assembler names, which includes
4835 mangling. So types cannot be freed up until assembler names have
4839 free_lang_data_in_cgraph (void)
4841 struct cgraph_node *n;
4842 struct varpool_node *v;
4843 struct free_lang_data_d fld;
4848 /* Initialize sets and arrays to store referenced decls and types. */
4849 fld.pset = pointer_set_create ();
4850 fld.worklist = NULL;
4851 fld.decls = VEC_alloc (tree, heap, 100);
4852 fld.types = VEC_alloc (tree, heap, 100);
4854 /* Find decls and types in the body of every function in the callgraph. */
4855 for (n = cgraph_nodes; n; n = n->next)
4856 find_decls_types_in_node (n, &fld);
4858 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4859 find_decls_types (p->decl, &fld);
4861 /* Find decls and types in every varpool symbol. */
4862 for (v = varpool_nodes_queue; v; v = v->next_needed)
4863 find_decls_types_in_var (v, &fld);
4865 /* Set the assembler name on every decl found. We need to do this
4866 now because free_lang_data_in_decl will invalidate data needed
4867 for mangling. This breaks mangling on interdependent decls. */
4868 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4869 if (need_assembler_name_p (t))
4871 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4872 diagnostics that use input_location to show locus
4873 information. The problem here is that, at this point,
4874 input_location is generally anchored to the end of the file
4875 (since the parser is long gone), so we don't have a good
4876 position to pin it to.
4878 To alleviate this problem, this uses the location of T's
4879 declaration. Examples of this are
4880 testsuite/g++.dg/template/cond2.C and
4881 testsuite/g++.dg/template/pr35240.C. */
4882 location_t saved_location = input_location;
4883 input_location = DECL_SOURCE_LOCATION (t);
4885 decl_assembler_name (t);
4887 input_location = saved_location;
4890 /* Traverse every decl found freeing its language data. */
4891 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4892 free_lang_data_in_decl (t);
4894 /* Traverse every type found freeing its language data. */
4895 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4896 free_lang_data_in_type (t);
4898 pointer_set_destroy (fld.pset);
4899 VEC_free (tree, heap, fld.worklist);
4900 VEC_free (tree, heap, fld.decls);
4901 VEC_free (tree, heap, fld.types);
4905 /* Free resources that are used by FE but are not needed once they are done. */
4908 free_lang_data (void)
4910 /* Traverse the IL resetting language specific information for
4911 operands, expressions, etc. */
4912 free_lang_data_in_cgraph ();
4914 /* Create gimple variants for common types. */
4915 ptrdiff_type_node = integer_type_node;
4916 fileptr_type_node = ptr_type_node;
4917 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4918 || (TYPE_MODE (boolean_type_node)
4919 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4920 || TYPE_PRECISION (boolean_type_node) != 1
4921 || !TYPE_UNSIGNED (boolean_type_node))
4923 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4924 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4925 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4926 TYPE_PRECISION (boolean_type_node) = 1;
4927 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4928 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4931 /* Unify char_type_node with its properly signed variant. */
4932 if (TYPE_UNSIGNED (char_type_node))
4933 unsigned_char_type_node = char_type_node;
4935 signed_char_type_node = char_type_node;
4937 /* Reset some langhooks. */
4938 lang_hooks.callgraph.analyze_expr = NULL;
4939 lang_hooks.types_compatible_p = NULL;
4940 lang_hooks.dwarf_name = lhd_dwarf_name;
4941 lang_hooks.decl_printable_name = gimple_decl_printable_name;
4942 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
4943 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
4945 /* Reset diagnostic machinery. */
4946 diagnostic_starter (global_dc) = default_diagnostic_starter;
4947 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
4948 diagnostic_format_decoder (global_dc) = default_tree_printer;
4950 /* FIXME. We remove sufficient language data that the debug
4951 info writer gets completely confused. Disable debug information
4953 debug_info_level = DINFO_LEVEL_NONE;
4954 write_symbols = NO_DEBUG;
4955 debug_hooks = &do_nothing_debug_hooks;
4961 /* Gate function for free_lang_data. */
4964 gate_free_lang_data (void)
4966 /* FIXME. Remove after save_debug_info is working. */
4967 return (flag_generate_lto
4969 && !flag_gtoggle && debug_info_level <= DINFO_LEVEL_TERSE));
4973 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
4978 gate_free_lang_data, /* gate */
4979 free_lang_data, /* execute */
4982 0, /* static_pass_number */
4983 TV_IPA_FREE_LANG_DATA, /* tv_id */
4984 0, /* properties_required */
4985 0, /* properties_provided */
4986 0, /* properties_destroyed */
4987 0, /* todo_flags_start */
4988 TODO_ggc_collect /* todo_flags_finish */
4992 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4995 We try both `text' and `__text__', ATTR may be either one. */
4996 /* ??? It might be a reasonable simplification to require ATTR to be only
4997 `text'. One might then also require attribute lists to be stored in
4998 their canonicalized form. */
5001 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5006 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5009 p = IDENTIFIER_POINTER (ident);
5010 ident_len = IDENTIFIER_LENGTH (ident);
5012 if (ident_len == attr_len
5013 && strcmp (attr, p) == 0)
5016 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5019 gcc_assert (attr[1] == '_');
5020 gcc_assert (attr[attr_len - 2] == '_');
5021 gcc_assert (attr[attr_len - 1] == '_');
5022 if (ident_len == attr_len - 4
5023 && strncmp (attr + 2, p, attr_len - 4) == 0)
5028 if (ident_len == attr_len + 4
5029 && p[0] == '_' && p[1] == '_'
5030 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5031 && strncmp (attr, p + 2, attr_len) == 0)
5038 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5041 We try both `text' and `__text__', ATTR may be either one. */
5044 is_attribute_p (const char *attr, const_tree ident)
5046 return is_attribute_with_length_p (attr, strlen (attr), ident);
5049 /* Given an attribute name and a list of attributes, return a pointer to the
5050 attribute's list element if the attribute is part of the list, or NULL_TREE
5051 if not found. If the attribute appears more than once, this only
5052 returns the first occurrence; the TREE_CHAIN of the return value should
5053 be passed back in if further occurrences are wanted. */
5056 lookup_attribute (const char *attr_name, tree list)
5059 size_t attr_len = strlen (attr_name);
5061 for (l = list; l; l = TREE_CHAIN (l))
5063 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5064 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5070 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5074 remove_attribute (const char *attr_name, tree list)
5077 size_t attr_len = strlen (attr_name);
5079 for (p = &list; *p; )
5082 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5083 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5084 *p = TREE_CHAIN (l);
5086 p = &TREE_CHAIN (l);
5092 /* Return an attribute list that is the union of a1 and a2. */
5095 merge_attributes (tree a1, tree a2)
5099 /* Either one unset? Take the set one. */
5101 if ((attributes = a1) == 0)
5104 /* One that completely contains the other? Take it. */
5106 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5108 if (attribute_list_contained (a2, a1))
5112 /* Pick the longest list, and hang on the other list. */
5114 if (list_length (a1) < list_length (a2))
5115 attributes = a2, a2 = a1;
5117 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5120 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5123 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5126 if (TREE_VALUE (a) != NULL
5127 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5128 && TREE_VALUE (a2) != NULL
5129 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5131 if (simple_cst_list_equal (TREE_VALUE (a),
5132 TREE_VALUE (a2)) == 1)
5135 else if (simple_cst_equal (TREE_VALUE (a),
5136 TREE_VALUE (a2)) == 1)
5141 a1 = copy_node (a2);
5142 TREE_CHAIN (a1) = attributes;
5151 /* Given types T1 and T2, merge their attributes and return
5155 merge_type_attributes (tree t1, tree t2)
5157 return merge_attributes (TYPE_ATTRIBUTES (t1),
5158 TYPE_ATTRIBUTES (t2));
5161 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5165 merge_decl_attributes (tree olddecl, tree newdecl)
5167 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5168 DECL_ATTRIBUTES (newdecl));
5171 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5173 /* Specialization of merge_decl_attributes for various Windows targets.
5175 This handles the following situation:
5177 __declspec (dllimport) int foo;
5180 The second instance of `foo' nullifies the dllimport. */
5183 merge_dllimport_decl_attributes (tree old, tree new_tree)
5186 int delete_dllimport_p = 1;
5188 /* What we need to do here is remove from `old' dllimport if it doesn't
5189 appear in `new'. dllimport behaves like extern: if a declaration is
5190 marked dllimport and a definition appears later, then the object
5191 is not dllimport'd. We also remove a `new' dllimport if the old list
5192 contains dllexport: dllexport always overrides dllimport, regardless
5193 of the order of declaration. */
5194 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5195 delete_dllimport_p = 0;
5196 else if (DECL_DLLIMPORT_P (new_tree)
5197 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5199 DECL_DLLIMPORT_P (new_tree) = 0;
5200 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5201 "dllimport ignored", new_tree);
5203 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5205 /* Warn about overriding a symbol that has already been used, e.g.:
5206 extern int __attribute__ ((dllimport)) foo;
5207 int* bar () {return &foo;}
5210 if (TREE_USED (old))
5212 warning (0, "%q+D redeclared without dllimport attribute "
5213 "after being referenced with dll linkage", new_tree);
5214 /* If we have used a variable's address with dllimport linkage,
5215 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5216 decl may already have had TREE_CONSTANT computed.
5217 We still remove the attribute so that assembler code refers
5218 to '&foo rather than '_imp__foo'. */
5219 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5220 DECL_DLLIMPORT_P (new_tree) = 1;
5223 /* Let an inline definition silently override the external reference,
5224 but otherwise warn about attribute inconsistency. */
5225 else if (TREE_CODE (new_tree) == VAR_DECL
5226 || !DECL_DECLARED_INLINE_P (new_tree))
5227 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5228 "previous dllimport ignored", new_tree);
5231 delete_dllimport_p = 0;
5233 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5235 if (delete_dllimport_p)
5238 const size_t attr_len = strlen ("dllimport");
5240 /* Scan the list for dllimport and delete it. */
5241 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5243 if (is_attribute_with_length_p ("dllimport", attr_len,
5246 if (prev == NULL_TREE)
5249 TREE_CHAIN (prev) = TREE_CHAIN (t);
5258 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5259 struct attribute_spec.handler. */
5262 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5268 /* These attributes may apply to structure and union types being created,
5269 but otherwise should pass to the declaration involved. */
5272 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5273 | (int) ATTR_FLAG_ARRAY_NEXT))
5275 *no_add_attrs = true;
5276 return tree_cons (name, args, NULL_TREE);
5278 if (TREE_CODE (node) == RECORD_TYPE
5279 || TREE_CODE (node) == UNION_TYPE)
5281 node = TYPE_NAME (node);
5287 warning (OPT_Wattributes, "%qE attribute ignored",
5289 *no_add_attrs = true;
5294 if (TREE_CODE (node) != FUNCTION_DECL
5295 && TREE_CODE (node) != VAR_DECL
5296 && TREE_CODE (node) != TYPE_DECL)
5298 *no_add_attrs = true;
5299 warning (OPT_Wattributes, "%qE attribute ignored",
5304 if (TREE_CODE (node) == TYPE_DECL
5305 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5306 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5308 *no_add_attrs = true;
5309 warning (OPT_Wattributes, "%qE attribute ignored",
5314 is_dllimport = is_attribute_p ("dllimport", name);
5316 /* Report error on dllimport ambiguities seen now before they cause
5320 /* Honor any target-specific overrides. */
5321 if (!targetm.valid_dllimport_attribute_p (node))
5322 *no_add_attrs = true;
5324 else if (TREE_CODE (node) == FUNCTION_DECL
5325 && DECL_DECLARED_INLINE_P (node))
5327 warning (OPT_Wattributes, "inline function %q+D declared as "
5328 " dllimport: attribute ignored", node);
5329 *no_add_attrs = true;
5331 /* Like MS, treat definition of dllimported variables and
5332 non-inlined functions on declaration as syntax errors. */
5333 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5335 error ("function %q+D definition is marked dllimport", node);
5336 *no_add_attrs = true;
5339 else if (TREE_CODE (node) == VAR_DECL)
5341 if (DECL_INITIAL (node))
5343 error ("variable %q+D definition is marked dllimport",
5345 *no_add_attrs = true;
5348 /* `extern' needn't be specified with dllimport.
5349 Specify `extern' now and hope for the best. Sigh. */
5350 DECL_EXTERNAL (node) = 1;
5351 /* Also, implicitly give dllimport'd variables declared within
5352 a function global scope, unless declared static. */
5353 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5354 TREE_PUBLIC (node) = 1;
5357 if (*no_add_attrs == false)
5358 DECL_DLLIMPORT_P (node) = 1;
5360 else if (TREE_CODE (node) == FUNCTION_DECL
5361 && DECL_DECLARED_INLINE_P (node))
5362 /* An exported function, even if inline, must be emitted. */
5363 DECL_EXTERNAL (node) = 0;
5365 /* Report error if symbol is not accessible at global scope. */
5366 if (!TREE_PUBLIC (node)
5367 && (TREE_CODE (node) == VAR_DECL
5368 || TREE_CODE (node) == FUNCTION_DECL))
5370 error ("external linkage required for symbol %q+D because of "
5371 "%qE attribute", node, name);
5372 *no_add_attrs = true;
5375 /* A dllexport'd entity must have default visibility so that other
5376 program units (shared libraries or the main executable) can see
5377 it. A dllimport'd entity must have default visibility so that
5378 the linker knows that undefined references within this program
5379 unit can be resolved by the dynamic linker. */
5382 if (DECL_VISIBILITY_SPECIFIED (node)
5383 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5384 error ("%qE implies default visibility, but %qD has already "
5385 "been declared with a different visibility",
5387 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5388 DECL_VISIBILITY_SPECIFIED (node) = 1;
5394 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5396 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5397 of the various TYPE_QUAL values. */
5400 set_type_quals (tree type, int type_quals)
5402 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5403 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5404 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5407 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5410 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5412 return (TYPE_QUALS (cand) == type_quals
5413 && TYPE_NAME (cand) == TYPE_NAME (base)
5414 /* Apparently this is needed for Objective-C. */
5415 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5416 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5417 TYPE_ATTRIBUTES (base)));
5420 /* Return a version of the TYPE, qualified as indicated by the
5421 TYPE_QUALS, if one exists. If no qualified version exists yet,
5422 return NULL_TREE. */
5425 get_qualified_type (tree type, int type_quals)
5429 if (TYPE_QUALS (type) == type_quals)
5432 /* Search the chain of variants to see if there is already one there just
5433 like the one we need to have. If so, use that existing one. We must
5434 preserve the TYPE_NAME, since there is code that depends on this. */
5435 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5436 if (check_qualified_type (t, type, type_quals))
5442 /* Like get_qualified_type, but creates the type if it does not
5443 exist. This function never returns NULL_TREE. */
5446 build_qualified_type (tree type, int type_quals)
5450 /* See if we already have the appropriate qualified variant. */
5451 t = get_qualified_type (type, type_quals);
5453 /* If not, build it. */
5456 t = build_variant_type_copy (type);
5457 set_type_quals (t, type_quals);
5459 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5460 /* Propagate structural equality. */
5461 SET_TYPE_STRUCTURAL_EQUALITY (t);
5462 else if (TYPE_CANONICAL (type) != type)
5463 /* Build the underlying canonical type, since it is different
5465 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5468 /* T is its own canonical type. */
5469 TYPE_CANONICAL (t) = t;
5476 /* Create a new distinct copy of TYPE. The new type is made its own
5477 MAIN_VARIANT. If TYPE requires structural equality checks, the
5478 resulting type requires structural equality checks; otherwise, its
5479 TYPE_CANONICAL points to itself. */
5482 build_distinct_type_copy (tree type)
5484 tree t = copy_node (type);
5486 TYPE_POINTER_TO (t) = 0;
5487 TYPE_REFERENCE_TO (t) = 0;
5489 /* Set the canonical type either to a new equivalence class, or
5490 propagate the need for structural equality checks. */
5491 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5492 SET_TYPE_STRUCTURAL_EQUALITY (t);
5494 TYPE_CANONICAL (t) = t;
5496 /* Make it its own variant. */
5497 TYPE_MAIN_VARIANT (t) = t;
5498 TYPE_NEXT_VARIANT (t) = 0;
5500 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5501 whose TREE_TYPE is not t. This can also happen in the Ada
5502 frontend when using subtypes. */
5507 /* Create a new variant of TYPE, equivalent but distinct. This is so
5508 the caller can modify it. TYPE_CANONICAL for the return type will
5509 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5510 are considered equal by the language itself (or that both types
5511 require structural equality checks). */
5514 build_variant_type_copy (tree type)
5516 tree t, m = TYPE_MAIN_VARIANT (type);
5518 t = build_distinct_type_copy (type);
5520 /* Since we're building a variant, assume that it is a non-semantic
5521 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5522 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5524 /* Add the new type to the chain of variants of TYPE. */
5525 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5526 TYPE_NEXT_VARIANT (m) = t;
5527 TYPE_MAIN_VARIANT (t) = m;
5532 /* Return true if the from tree in both tree maps are equal. */
5535 tree_map_base_eq (const void *va, const void *vb)
5537 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5538 *const b = (const struct tree_map_base *) vb;
5539 return (a->from == b->from);
5542 /* Hash a from tree in a tree_map. */
5545 tree_map_base_hash (const void *item)
5547 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5550 /* Return true if this tree map structure is marked for garbage collection
5551 purposes. We simply return true if the from tree is marked, so that this
5552 structure goes away when the from tree goes away. */
5555 tree_map_base_marked_p (const void *p)
5557 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5561 tree_map_hash (const void *item)
5563 return (((const struct tree_map *) item)->hash);
5566 /* Return the initialization priority for DECL. */
5569 decl_init_priority_lookup (tree decl)
5571 struct tree_priority_map *h;
5572 struct tree_map_base in;
5574 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5576 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5577 return h ? h->init : DEFAULT_INIT_PRIORITY;
5580 /* Return the finalization priority for DECL. */
5583 decl_fini_priority_lookup (tree decl)
5585 struct tree_priority_map *h;
5586 struct tree_map_base in;
5588 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5590 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5591 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5594 /* Return the initialization and finalization priority information for
5595 DECL. If there is no previous priority information, a freshly
5596 allocated structure is returned. */
5598 static struct tree_priority_map *
5599 decl_priority_info (tree decl)
5601 struct tree_priority_map in;
5602 struct tree_priority_map *h;
5605 in.base.from = decl;
5606 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5607 h = (struct tree_priority_map *) *loc;
5610 h = GGC_CNEW (struct tree_priority_map);
5612 h->base.from = decl;
5613 h->init = DEFAULT_INIT_PRIORITY;
5614 h->fini = DEFAULT_INIT_PRIORITY;
5620 /* Set the initialization priority for DECL to PRIORITY. */
5623 decl_init_priority_insert (tree decl, priority_type priority)
5625 struct tree_priority_map *h;
5627 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5628 h = decl_priority_info (decl);
5632 /* Set the finalization priority for DECL to PRIORITY. */
5635 decl_fini_priority_insert (tree decl, priority_type priority)
5637 struct tree_priority_map *h;
5639 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5640 h = decl_priority_info (decl);
5644 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5647 print_debug_expr_statistics (void)
5649 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5650 (long) htab_size (debug_expr_for_decl),
5651 (long) htab_elements (debug_expr_for_decl),
5652 htab_collisions (debug_expr_for_decl));
5655 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5658 print_value_expr_statistics (void)
5660 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5661 (long) htab_size (value_expr_for_decl),
5662 (long) htab_elements (value_expr_for_decl),
5663 htab_collisions (value_expr_for_decl));
5666 /* Lookup a debug expression for FROM, and return it if we find one. */
5669 decl_debug_expr_lookup (tree from)
5671 struct tree_map *h, in;
5672 in.base.from = from;
5674 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5675 htab_hash_pointer (from));
5681 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5684 decl_debug_expr_insert (tree from, tree to)
5689 h = GGC_NEW (struct tree_map);
5690 h->hash = htab_hash_pointer (from);
5691 h->base.from = from;
5693 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5694 *(struct tree_map **) loc = h;
5697 /* Lookup a value expression for FROM, and return it if we find one. */
5700 decl_value_expr_lookup (tree from)
5702 struct tree_map *h, in;
5703 in.base.from = from;
5705 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5706 htab_hash_pointer (from));
5712 /* Insert a mapping FROM->TO in the value expression hashtable. */
5715 decl_value_expr_insert (tree from, tree to)
5720 h = GGC_NEW (struct tree_map);
5721 h->hash = htab_hash_pointer (from);
5722 h->base.from = from;
5724 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5725 *(struct tree_map **) loc = h;
5728 /* Hashing of types so that we don't make duplicates.
5729 The entry point is `type_hash_canon'. */
5731 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5732 with types in the TREE_VALUE slots), by adding the hash codes
5733 of the individual types. */
5736 type_hash_list (const_tree list, hashval_t hashcode)
5740 for (tail = list; tail; tail = TREE_CHAIN (tail))
5741 if (TREE_VALUE (tail) != error_mark_node)
5742 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5748 /* These are the Hashtable callback functions. */
5750 /* Returns true iff the types are equivalent. */
5753 type_hash_eq (const void *va, const void *vb)
5755 const struct type_hash *const a = (const struct type_hash *) va,
5756 *const b = (const struct type_hash *) vb;
5758 /* First test the things that are the same for all types. */
5759 if (a->hash != b->hash
5760 || TREE_CODE (a->type) != TREE_CODE (b->type)
5761 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5762 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5763 TYPE_ATTRIBUTES (b->type))
5764 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5765 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5766 || (TREE_CODE (a->type) != COMPLEX_TYPE
5767 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5770 switch (TREE_CODE (a->type))
5775 case REFERENCE_TYPE:
5779 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5782 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5783 && !(TYPE_VALUES (a->type)
5784 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5785 && TYPE_VALUES (b->type)
5786 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5787 && type_list_equal (TYPE_VALUES (a->type),
5788 TYPE_VALUES (b->type))))
5791 /* ... fall through ... */
5796 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5797 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5798 TYPE_MAX_VALUE (b->type)))
5799 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5800 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5801 TYPE_MIN_VALUE (b->type))));
5803 case FIXED_POINT_TYPE:
5804 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5807 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5810 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5811 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5812 || (TYPE_ARG_TYPES (a->type)
5813 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5814 && TYPE_ARG_TYPES (b->type)
5815 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5816 && type_list_equal (TYPE_ARG_TYPES (a->type),
5817 TYPE_ARG_TYPES (b->type)))));
5820 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5824 case QUAL_UNION_TYPE:
5825 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5826 || (TYPE_FIELDS (a->type)
5827 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5828 && TYPE_FIELDS (b->type)
5829 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5830 && type_list_equal (TYPE_FIELDS (a->type),
5831 TYPE_FIELDS (b->type))));
5834 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5835 || (TYPE_ARG_TYPES (a->type)
5836 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5837 && TYPE_ARG_TYPES (b->type)
5838 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5839 && type_list_equal (TYPE_ARG_TYPES (a->type),
5840 TYPE_ARG_TYPES (b->type))))
5848 if (lang_hooks.types.type_hash_eq != NULL)
5849 return lang_hooks.types.type_hash_eq (a->type, b->type);
5854 /* Return the cached hash value. */
5857 type_hash_hash (const void *item)
5859 return ((const struct type_hash *) item)->hash;
5862 /* Look in the type hash table for a type isomorphic to TYPE.
5863 If one is found, return it. Otherwise return 0. */
5866 type_hash_lookup (hashval_t hashcode, tree type)
5868 struct type_hash *h, in;
5870 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5871 must call that routine before comparing TYPE_ALIGNs. */
5877 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5884 /* Add an entry to the type-hash-table
5885 for a type TYPE whose hash code is HASHCODE. */
5888 type_hash_add (hashval_t hashcode, tree type)
5890 struct type_hash *h;
5893 h = GGC_NEW (struct type_hash);
5896 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5900 /* Given TYPE, and HASHCODE its hash code, return the canonical
5901 object for an identical type if one already exists.
5902 Otherwise, return TYPE, and record it as the canonical object.
5904 To use this function, first create a type of the sort you want.
5905 Then compute its hash code from the fields of the type that
5906 make it different from other similar types.
5907 Then call this function and use the value. */
5910 type_hash_canon (unsigned int hashcode, tree type)
5914 /* The hash table only contains main variants, so ensure that's what we're
5916 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5918 if (!lang_hooks.types.hash_types)
5921 /* See if the type is in the hash table already. If so, return it.
5922 Otherwise, add the type. */
5923 t1 = type_hash_lookup (hashcode, type);
5926 #ifdef GATHER_STATISTICS
5927 tree_node_counts[(int) t_kind]--;
5928 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5934 type_hash_add (hashcode, type);
5939 /* See if the data pointed to by the type hash table is marked. We consider
5940 it marked if the type is marked or if a debug type number or symbol
5941 table entry has been made for the type. This reduces the amount of
5942 debugging output and eliminates that dependency of the debug output on
5943 the number of garbage collections. */
5946 type_hash_marked_p (const void *p)
5948 const_tree const type = ((const struct type_hash *) p)->type;
5950 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5954 print_type_hash_statistics (void)
5956 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5957 (long) htab_size (type_hash_table),
5958 (long) htab_elements (type_hash_table),
5959 htab_collisions (type_hash_table));
5962 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5963 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5964 by adding the hash codes of the individual attributes. */
5967 attribute_hash_list (const_tree list, hashval_t hashcode)
5971 for (tail = list; tail; tail = TREE_CHAIN (tail))
5972 /* ??? Do we want to add in TREE_VALUE too? */
5973 hashcode = iterative_hash_object
5974 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
5978 /* Given two lists of attributes, return true if list l2 is
5979 equivalent to l1. */
5982 attribute_list_equal (const_tree l1, const_tree l2)
5984 return attribute_list_contained (l1, l2)
5985 && attribute_list_contained (l2, l1);
5988 /* Given two lists of attributes, return true if list L2 is
5989 completely contained within L1. */
5990 /* ??? This would be faster if attribute names were stored in a canonicalized
5991 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
5992 must be used to show these elements are equivalent (which they are). */
5993 /* ??? It's not clear that attributes with arguments will always be handled
5997 attribute_list_contained (const_tree l1, const_tree l2)
6001 /* First check the obvious, maybe the lists are identical. */
6005 /* Maybe the lists are similar. */
6006 for (t1 = l1, t2 = l2;
6008 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6009 && TREE_VALUE (t1) == TREE_VALUE (t2);
6010 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6012 /* Maybe the lists are equal. */
6013 if (t1 == 0 && t2 == 0)
6016 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6019 /* This CONST_CAST is okay because lookup_attribute does not
6020 modify its argument and the return value is assigned to a
6022 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6023 CONST_CAST_TREE(l1));
6025 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6028 if (TREE_VALUE (t2) != NULL
6029 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6030 && TREE_VALUE (attr) != NULL
6031 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6033 if (simple_cst_list_equal (TREE_VALUE (t2),
6034 TREE_VALUE (attr)) == 1)
6037 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6048 /* Given two lists of types
6049 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6050 return 1 if the lists contain the same types in the same order.
6051 Also, the TREE_PURPOSEs must match. */
6054 type_list_equal (const_tree l1, const_tree l2)
6058 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6059 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6060 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6061 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6062 && (TREE_TYPE (TREE_PURPOSE (t1))
6063 == TREE_TYPE (TREE_PURPOSE (t2))))))
6069 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6070 given by TYPE. If the argument list accepts variable arguments,
6071 then this function counts only the ordinary arguments. */
6074 type_num_arguments (const_tree type)
6079 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6080 /* If the function does not take a variable number of arguments,
6081 the last element in the list will have type `void'. */
6082 if (VOID_TYPE_P (TREE_VALUE (t)))
6090 /* Nonzero if integer constants T1 and T2
6091 represent the same constant value. */
6094 tree_int_cst_equal (const_tree t1, const_tree t2)
6099 if (t1 == 0 || t2 == 0)
6102 if (TREE_CODE (t1) == INTEGER_CST
6103 && TREE_CODE (t2) == INTEGER_CST
6104 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6105 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6111 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6112 The precise way of comparison depends on their data type. */
6115 tree_int_cst_lt (const_tree t1, const_tree t2)
6120 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6122 int t1_sgn = tree_int_cst_sgn (t1);
6123 int t2_sgn = tree_int_cst_sgn (t2);
6125 if (t1_sgn < t2_sgn)
6127 else if (t1_sgn > t2_sgn)
6129 /* Otherwise, both are non-negative, so we compare them as
6130 unsigned just in case one of them would overflow a signed
6133 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6134 return INT_CST_LT (t1, t2);
6136 return INT_CST_LT_UNSIGNED (t1, t2);
6139 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6142 tree_int_cst_compare (const_tree t1, const_tree t2)
6144 if (tree_int_cst_lt (t1, t2))
6146 else if (tree_int_cst_lt (t2, t1))
6152 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6153 the host. If POS is zero, the value can be represented in a single
6154 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6155 be represented in a single unsigned HOST_WIDE_INT. */
6158 host_integerp (const_tree t, int pos)
6163 return (TREE_CODE (t) == INTEGER_CST
6164 && ((TREE_INT_CST_HIGH (t) == 0
6165 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6166 || (! pos && TREE_INT_CST_HIGH (t) == -1
6167 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6168 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6169 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6170 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6171 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6174 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6175 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6176 be non-negative. We must be able to satisfy the above conditions. */
6179 tree_low_cst (const_tree t, int pos)
6181 gcc_assert (host_integerp (t, pos));
6182 return TREE_INT_CST_LOW (t);
6185 /* Return the most significant bit of the integer constant T. */
6188 tree_int_cst_msb (const_tree t)
6192 unsigned HOST_WIDE_INT l;
6194 /* Note that using TYPE_PRECISION here is wrong. We care about the
6195 actual bits, not the (arbitrary) range of the type. */
6196 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6197 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6198 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6199 return (l & 1) == 1;
6202 /* Return an indication of the sign of the integer constant T.
6203 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6204 Note that -1 will never be returned if T's type is unsigned. */
6207 tree_int_cst_sgn (const_tree t)
6209 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6211 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6213 else if (TREE_INT_CST_HIGH (t) < 0)
6219 /* Return the minimum number of bits needed to represent VALUE in a
6220 signed or unsigned type, UNSIGNEDP says which. */
6223 tree_int_cst_min_precision (tree value, bool unsignedp)
6227 /* If the value is negative, compute its negative minus 1. The latter
6228 adjustment is because the absolute value of the largest negative value
6229 is one larger than the largest positive value. This is equivalent to
6230 a bit-wise negation, so use that operation instead. */
6232 if (tree_int_cst_sgn (value) < 0)
6233 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6235 /* Return the number of bits needed, taking into account the fact
6236 that we need one more bit for a signed than unsigned type. */
6238 if (integer_zerop (value))
6241 log = tree_floor_log2 (value);
6243 return log + 1 + !unsignedp;
6246 /* Compare two constructor-element-type constants. Return 1 if the lists
6247 are known to be equal; otherwise return 0. */
6250 simple_cst_list_equal (const_tree l1, const_tree l2)
6252 while (l1 != NULL_TREE && l2 != NULL_TREE)
6254 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6257 l1 = TREE_CHAIN (l1);
6258 l2 = TREE_CHAIN (l2);
6264 /* Return truthvalue of whether T1 is the same tree structure as T2.
6265 Return 1 if they are the same.
6266 Return 0 if they are understandably different.
6267 Return -1 if either contains tree structure not understood by
6271 simple_cst_equal (const_tree t1, const_tree t2)
6273 enum tree_code code1, code2;
6279 if (t1 == 0 || t2 == 0)
6282 code1 = TREE_CODE (t1);
6283 code2 = TREE_CODE (t2);
6285 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6287 if (CONVERT_EXPR_CODE_P (code2)
6288 || code2 == NON_LVALUE_EXPR)
6289 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6291 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6294 else if (CONVERT_EXPR_CODE_P (code2)
6295 || code2 == NON_LVALUE_EXPR)
6296 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6304 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6305 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6308 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6311 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6314 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6315 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6316 TREE_STRING_LENGTH (t1)));
6320 unsigned HOST_WIDE_INT idx;
6321 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6322 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6324 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6327 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6328 /* ??? Should we handle also fields here? */
6329 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6330 VEC_index (constructor_elt, v2, idx)->value))
6336 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6339 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6342 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6345 const_tree arg1, arg2;
6346 const_call_expr_arg_iterator iter1, iter2;
6347 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6348 arg2 = first_const_call_expr_arg (t2, &iter2);
6350 arg1 = next_const_call_expr_arg (&iter1),
6351 arg2 = next_const_call_expr_arg (&iter2))
6353 cmp = simple_cst_equal (arg1, arg2);
6357 return arg1 == arg2;
6361 /* Special case: if either target is an unallocated VAR_DECL,
6362 it means that it's going to be unified with whatever the
6363 TARGET_EXPR is really supposed to initialize, so treat it
6364 as being equivalent to anything. */
6365 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6366 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6367 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6368 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6369 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6370 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6373 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6378 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6380 case WITH_CLEANUP_EXPR:
6381 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6385 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6388 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6389 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6403 /* This general rule works for most tree codes. All exceptions should be
6404 handled above. If this is a language-specific tree code, we can't
6405 trust what might be in the operand, so say we don't know
6407 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6410 switch (TREE_CODE_CLASS (code1))
6414 case tcc_comparison:
6415 case tcc_expression:
6419 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6421 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6433 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6434 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6435 than U, respectively. */
6438 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6440 if (tree_int_cst_sgn (t) < 0)
6442 else if (TREE_INT_CST_HIGH (t) != 0)
6444 else if (TREE_INT_CST_LOW (t) == u)
6446 else if (TREE_INT_CST_LOW (t) < u)
6452 /* Return true if CODE represents an associative tree code. Otherwise
6455 associative_tree_code (enum tree_code code)
6474 /* Return true if CODE represents a commutative tree code. Otherwise
6477 commutative_tree_code (enum tree_code code)
6490 case UNORDERED_EXPR:
6494 case TRUTH_AND_EXPR:
6495 case TRUTH_XOR_EXPR:
6505 /* Generate a hash value for an expression. This can be used iteratively
6506 by passing a previous result as the VAL argument.
6508 This function is intended to produce the same hash for expressions which
6509 would compare equal using operand_equal_p. */
6512 iterative_hash_expr (const_tree t, hashval_t val)
6515 enum tree_code code;
6519 return iterative_hash_hashval_t (0, val);
6521 code = TREE_CODE (t);
6525 /* Alas, constants aren't shared, so we can't rely on pointer
6528 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6529 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6532 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6534 return iterative_hash_hashval_t (val2, val);
6538 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6540 return iterative_hash_hashval_t (val2, val);
6543 return iterative_hash (TREE_STRING_POINTER (t),
6544 TREE_STRING_LENGTH (t), val);
6546 val = iterative_hash_expr (TREE_REALPART (t), val);
6547 return iterative_hash_expr (TREE_IMAGPART (t), val);
6549 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6552 /* we can just compare by pointer. */
6553 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6556 /* A list of expressions, for a CALL_EXPR or as the elements of a
6558 for (; t; t = TREE_CHAIN (t))
6559 val = iterative_hash_expr (TREE_VALUE (t), val);
6563 unsigned HOST_WIDE_INT idx;
6565 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6567 val = iterative_hash_expr (field, val);
6568 val = iterative_hash_expr (value, val);
6573 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6574 Otherwise nodes that compare equal according to operand_equal_p might
6575 get different hash codes. However, don't do this for machine specific
6576 or front end builtins, since the function code is overloaded in those
6578 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6579 && built_in_decls[DECL_FUNCTION_CODE (t)])
6581 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6582 code = TREE_CODE (t);
6586 tclass = TREE_CODE_CLASS (code);
6588 if (tclass == tcc_declaration)
6590 /* DECL's have a unique ID */
6591 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6595 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6597 val = iterative_hash_object (code, val);
6599 /* Don't hash the type, that can lead to having nodes which
6600 compare equal according to operand_equal_p, but which
6601 have different hash codes. */
6602 if (CONVERT_EXPR_CODE_P (code)
6603 || code == NON_LVALUE_EXPR)
6605 /* Make sure to include signness in the hash computation. */
6606 val += TYPE_UNSIGNED (TREE_TYPE (t));
6607 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6610 else if (commutative_tree_code (code))
6612 /* It's a commutative expression. We want to hash it the same
6613 however it appears. We do this by first hashing both operands
6614 and then rehashing based on the order of their independent
6616 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6617 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6621 t = one, one = two, two = t;
6623 val = iterative_hash_hashval_t (one, val);
6624 val = iterative_hash_hashval_t (two, val);
6627 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6628 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6635 /* Generate a hash value for a pair of expressions. This can be used
6636 iteratively by passing a previous result as the VAL argument.
6638 The same hash value is always returned for a given pair of expressions,
6639 regardless of the order in which they are presented. This is useful in
6640 hashing the operands of commutative functions. */
6643 iterative_hash_exprs_commutative (const_tree t1,
6644 const_tree t2, hashval_t val)
6646 hashval_t one = iterative_hash_expr (t1, 0);
6647 hashval_t two = iterative_hash_expr (t2, 0);
6651 t = one, one = two, two = t;
6652 val = iterative_hash_hashval_t (one, val);
6653 val = iterative_hash_hashval_t (two, val);
6658 /* Constructors for pointer, array and function types.
6659 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6660 constructed by language-dependent code, not here.) */
6662 /* Construct, lay out and return the type of pointers to TO_TYPE with
6663 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6664 reference all of memory. If such a type has already been
6665 constructed, reuse it. */
6668 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6673 if (to_type == error_mark_node)
6674 return error_mark_node;
6676 /* If the pointed-to type has the may_alias attribute set, force
6677 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6678 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6679 can_alias_all = true;
6681 /* In some cases, languages will have things that aren't a POINTER_TYPE
6682 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6683 In that case, return that type without regard to the rest of our
6686 ??? This is a kludge, but consistent with the way this function has
6687 always operated and there doesn't seem to be a good way to avoid this
6689 if (TYPE_POINTER_TO (to_type) != 0
6690 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6691 return TYPE_POINTER_TO (to_type);
6693 /* First, if we already have a type for pointers to TO_TYPE and it's
6694 the proper mode, use it. */
6695 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6696 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6699 t = make_node (POINTER_TYPE);
6701 TREE_TYPE (t) = to_type;
6702 SET_TYPE_MODE (t, mode);
6703 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6704 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6705 TYPE_POINTER_TO (to_type) = t;
6707 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6708 SET_TYPE_STRUCTURAL_EQUALITY (t);
6709 else if (TYPE_CANONICAL (to_type) != to_type)
6711 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6712 mode, can_alias_all);
6714 /* Lay out the type. This function has many callers that are concerned
6715 with expression-construction, and this simplifies them all. */
6721 /* By default build pointers in ptr_mode. */
6724 build_pointer_type (tree to_type)
6726 return build_pointer_type_for_mode (to_type, ptr_mode, false);
6729 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6732 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6737 if (to_type == error_mark_node)
6738 return error_mark_node;
6740 /* If the pointed-to type has the may_alias attribute set, force
6741 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6742 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6743 can_alias_all = true;
6745 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6746 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6747 In that case, return that type without regard to the rest of our
6750 ??? This is a kludge, but consistent with the way this function has
6751 always operated and there doesn't seem to be a good way to avoid this
6753 if (TYPE_REFERENCE_TO (to_type) != 0
6754 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6755 return TYPE_REFERENCE_TO (to_type);
6757 /* First, if we already have a type for pointers to TO_TYPE and it's
6758 the proper mode, use it. */
6759 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6760 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6763 t = make_node (REFERENCE_TYPE);
6765 TREE_TYPE (t) = to_type;
6766 SET_TYPE_MODE (t, mode);
6767 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6768 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6769 TYPE_REFERENCE_TO (to_type) = t;
6771 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6772 SET_TYPE_STRUCTURAL_EQUALITY (t);
6773 else if (TYPE_CANONICAL (to_type) != to_type)
6775 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6776 mode, can_alias_all);
6784 /* Build the node for the type of references-to-TO_TYPE by default
6788 build_reference_type (tree to_type)
6790 return build_reference_type_for_mode (to_type, ptr_mode, false);
6793 /* Build a type that is compatible with t but has no cv quals anywhere
6796 const char *const *const * -> char ***. */
6799 build_type_no_quals (tree t)
6801 switch (TREE_CODE (t))
6804 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6806 TYPE_REF_CAN_ALIAS_ALL (t));
6807 case REFERENCE_TYPE:
6809 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6811 TYPE_REF_CAN_ALIAS_ALL (t));
6813 return TYPE_MAIN_VARIANT (t);
6817 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6818 MAXVAL should be the maximum value in the domain
6819 (one less than the length of the array).
6821 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6822 We don't enforce this limit, that is up to caller (e.g. language front end).
6823 The limit exists because the result is a signed type and we don't handle
6824 sizes that use more than one HOST_WIDE_INT. */
6827 build_index_type (tree maxval)
6829 tree itype = make_node (INTEGER_TYPE);
6831 TREE_TYPE (itype) = sizetype;
6832 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6833 TYPE_MIN_VALUE (itype) = size_zero_node;
6834 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6835 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6836 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6837 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6838 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6839 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6841 if (host_integerp (maxval, 1))
6842 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6845 /* Since we cannot hash this type, we need to compare it using
6846 structural equality checks. */
6847 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6852 /* Builds a signed or unsigned integer type of precision PRECISION.
6853 Used for C bitfields whose precision does not match that of
6854 built-in target types. */
6856 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6859 tree itype = make_node (INTEGER_TYPE);
6861 TYPE_PRECISION (itype) = precision;
6864 fixup_unsigned_type (itype);
6866 fixup_signed_type (itype);
6868 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6869 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6874 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6875 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6876 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6879 build_range_type (tree type, tree lowval, tree highval)
6881 tree itype = make_node (INTEGER_TYPE);
6883 TREE_TYPE (itype) = type;
6884 if (type == NULL_TREE)
6887 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6888 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6890 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6891 SET_TYPE_MODE (itype, TYPE_MODE (type));
6892 TYPE_SIZE (itype) = TYPE_SIZE (type);
6893 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6894 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6895 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6897 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6898 return type_hash_canon (tree_low_cst (highval, 0)
6899 - tree_low_cst (lowval, 0),
6905 /* Return true if the debug information for TYPE, a subtype, should be emitted
6906 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6907 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6908 debug info and doesn't reflect the source code. */
6911 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6913 tree base_type = TREE_TYPE (type), low, high;
6915 /* Subrange types have a base type which is an integral type. */
6916 if (!INTEGRAL_TYPE_P (base_type))
6919 /* Get the real bounds of the subtype. */
6920 if (lang_hooks.types.get_subrange_bounds)
6921 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6924 low = TYPE_MIN_VALUE (type);
6925 high = TYPE_MAX_VALUE (type);
6928 /* If the type and its base type have the same representation and the same
6929 name, then the type is not a subrange but a copy of the base type. */
6930 if ((TREE_CODE (base_type) == INTEGER_TYPE
6931 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6932 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6933 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6934 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6936 tree type_name = TYPE_NAME (type);
6937 tree base_type_name = TYPE_NAME (base_type);
6939 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6940 type_name = DECL_NAME (type_name);
6942 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6943 base_type_name = DECL_NAME (base_type_name);
6945 if (type_name == base_type_name)
6956 /* Just like build_index_type, but takes lowval and highval instead
6957 of just highval (maxval). */
6960 build_index_2_type (tree lowval, tree highval)
6962 return build_range_type (sizetype, lowval, highval);
6965 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6966 and number of elements specified by the range of values of INDEX_TYPE.
6967 If such a type has already been constructed, reuse it. */
6970 build_array_type (tree elt_type, tree index_type)
6973 hashval_t hashcode = 0;
6975 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
6977 error ("arrays of functions are not meaningful");
6978 elt_type = integer_type_node;
6981 t = make_node (ARRAY_TYPE);
6982 TREE_TYPE (t) = elt_type;
6983 TYPE_DOMAIN (t) = index_type;
6986 /* If the element type is incomplete at this point we get marked for
6987 structural equality. Do not record these types in the canonical
6989 if (TYPE_STRUCTURAL_EQUALITY_P (t))
6992 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
6994 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
6995 t = type_hash_canon (hashcode, t);
6997 if (TYPE_CANONICAL (t) == t)
6999 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7000 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7001 SET_TYPE_STRUCTURAL_EQUALITY (t);
7002 else if (TYPE_CANONICAL (elt_type) != elt_type
7003 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7005 = build_array_type (TYPE_CANONICAL (elt_type),
7006 index_type ? TYPE_CANONICAL (index_type) : NULL);
7012 /* Recursively examines the array elements of TYPE, until a non-array
7013 element type is found. */
7016 strip_array_types (tree type)
7018 while (TREE_CODE (type) == ARRAY_TYPE)
7019 type = TREE_TYPE (type);
7024 /* Computes the canonical argument types from the argument type list
7027 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7028 on entry to this function, or if any of the ARGTYPES are
7031 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7032 true on entry to this function, or if any of the ARGTYPES are
7035 Returns a canonical argument list, which may be ARGTYPES when the
7036 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7037 true) or would not differ from ARGTYPES. */
7040 maybe_canonicalize_argtypes(tree argtypes,
7041 bool *any_structural_p,
7042 bool *any_noncanonical_p)
7045 bool any_noncanonical_argtypes_p = false;
7047 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7049 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7050 /* Fail gracefully by stating that the type is structural. */
7051 *any_structural_p = true;
7052 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7053 *any_structural_p = true;
7054 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7055 || TREE_PURPOSE (arg))
7056 /* If the argument has a default argument, we consider it
7057 non-canonical even though the type itself is canonical.
7058 That way, different variants of function and method types
7059 with default arguments will all point to the variant with
7060 no defaults as their canonical type. */
7061 any_noncanonical_argtypes_p = true;
7064 if (*any_structural_p)
7067 if (any_noncanonical_argtypes_p)
7069 /* Build the canonical list of argument types. */
7070 tree canon_argtypes = NULL_TREE;
7071 bool is_void = false;
7073 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7075 if (arg == void_list_node)
7078 canon_argtypes = tree_cons (NULL_TREE,
7079 TYPE_CANONICAL (TREE_VALUE (arg)),
7083 canon_argtypes = nreverse (canon_argtypes);
7085 canon_argtypes = chainon (canon_argtypes, void_list_node);
7087 /* There is a non-canonical type. */
7088 *any_noncanonical_p = true;
7089 return canon_argtypes;
7092 /* The canonical argument types are the same as ARGTYPES. */
7096 /* Construct, lay out and return
7097 the type of functions returning type VALUE_TYPE
7098 given arguments of types ARG_TYPES.
7099 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7100 are data type nodes for the arguments of the function.
7101 If such a type has already been constructed, reuse it. */
7104 build_function_type (tree value_type, tree arg_types)
7107 hashval_t hashcode = 0;
7108 bool any_structural_p, any_noncanonical_p;
7109 tree canon_argtypes;
7111 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7113 error ("function return type cannot be function");
7114 value_type = integer_type_node;
7117 /* Make a node of the sort we want. */
7118 t = make_node (FUNCTION_TYPE);
7119 TREE_TYPE (t) = value_type;
7120 TYPE_ARG_TYPES (t) = arg_types;
7122 /* If we already have such a type, use the old one. */
7123 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7124 hashcode = type_hash_list (arg_types, hashcode);
7125 t = type_hash_canon (hashcode, t);
7127 /* Set up the canonical type. */
7128 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7129 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7130 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7132 &any_noncanonical_p);
7133 if (any_structural_p)
7134 SET_TYPE_STRUCTURAL_EQUALITY (t);
7135 else if (any_noncanonical_p)
7136 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7139 if (!COMPLETE_TYPE_P (t))
7144 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7147 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7149 tree new_type = NULL;
7150 tree args, new_args = NULL, t;
7154 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7155 args = TREE_CHAIN (args), i++)
7156 if (!bitmap_bit_p (args_to_skip, i))
7157 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7159 new_reversed = nreverse (new_args);
7163 TREE_CHAIN (new_args) = void_list_node;
7165 new_reversed = void_list_node;
7168 /* Use copy_node to preserve as much as possible from original type
7169 (debug info, attribute lists etc.)
7170 Exception is METHOD_TYPEs must have THIS argument.
7171 When we are asked to remove it, we need to build new FUNCTION_TYPE
7173 if (TREE_CODE (orig_type) != METHOD_TYPE
7174 || !bitmap_bit_p (args_to_skip, 0))
7176 new_type = copy_node (orig_type);
7177 TYPE_ARG_TYPES (new_type) = new_reversed;
7182 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7184 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7187 /* This is a new type, not a copy of an old type. Need to reassociate
7188 variants. We can handle everything except the main variant lazily. */
7189 t = TYPE_MAIN_VARIANT (orig_type);
7192 TYPE_MAIN_VARIANT (new_type) = t;
7193 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7194 TYPE_NEXT_VARIANT (t) = new_type;
7198 TYPE_MAIN_VARIANT (new_type) = new_type;
7199 TYPE_NEXT_VARIANT (new_type) = NULL;
7204 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7206 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7207 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7208 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7211 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7213 tree new_decl = copy_node (orig_decl);
7216 new_type = TREE_TYPE (orig_decl);
7217 if (prototype_p (new_type))
7218 new_type = build_function_type_skip_args (new_type, args_to_skip);
7219 TREE_TYPE (new_decl) = new_type;
7221 /* For declarations setting DECL_VINDEX (i.e. methods)
7222 we expect first argument to be THIS pointer. */
7223 if (bitmap_bit_p (args_to_skip, 0))
7224 DECL_VINDEX (new_decl) = NULL_TREE;
7228 /* Build a function type. The RETURN_TYPE is the type returned by the
7229 function. If VAARGS is set, no void_type_node is appended to the
7230 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7233 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7237 t = va_arg (argp, tree);
7238 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7239 args = tree_cons (NULL_TREE, t, args);
7244 if (args != NULL_TREE)
7245 args = nreverse (args);
7246 gcc_assert (args != NULL_TREE && last != void_list_node);
7248 else if (args == NULL_TREE)
7249 args = void_list_node;
7253 args = nreverse (args);
7254 TREE_CHAIN (last) = void_list_node;
7256 args = build_function_type (return_type, args);
7261 /* Build a function type. The RETURN_TYPE is the type returned by the
7262 function. If additional arguments are provided, they are
7263 additional argument types. The list of argument types must always
7264 be terminated by NULL_TREE. */
7267 build_function_type_list (tree return_type, ...)
7272 va_start (p, return_type);
7273 args = build_function_type_list_1 (false, return_type, p);
7278 /* Build a variable argument function type. The RETURN_TYPE is the
7279 type returned by the function. If additional arguments are provided,
7280 they are additional argument types. The list of argument types must
7281 always be terminated by NULL_TREE. */
7284 build_varargs_function_type_list (tree return_type, ...)
7289 va_start (p, return_type);
7290 args = build_function_type_list_1 (true, return_type, p);
7296 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7297 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7298 for the method. An implicit additional parameter (of type
7299 pointer-to-BASETYPE) is added to the ARGTYPES. */
7302 build_method_type_directly (tree basetype,
7309 bool any_structural_p, any_noncanonical_p;
7310 tree canon_argtypes;
7312 /* Make a node of the sort we want. */
7313 t = make_node (METHOD_TYPE);
7315 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7316 TREE_TYPE (t) = rettype;
7317 ptype = build_pointer_type (basetype);
7319 /* The actual arglist for this function includes a "hidden" argument
7320 which is "this". Put it into the list of argument types. */
7321 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7322 TYPE_ARG_TYPES (t) = argtypes;
7324 /* If we already have such a type, use the old one. */
7325 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7326 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7327 hashcode = type_hash_list (argtypes, hashcode);
7328 t = type_hash_canon (hashcode, t);
7330 /* Set up the canonical type. */
7332 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7333 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7335 = (TYPE_CANONICAL (basetype) != basetype
7336 || TYPE_CANONICAL (rettype) != rettype);
7337 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7339 &any_noncanonical_p);
7340 if (any_structural_p)
7341 SET_TYPE_STRUCTURAL_EQUALITY (t);
7342 else if (any_noncanonical_p)
7344 = build_method_type_directly (TYPE_CANONICAL (basetype),
7345 TYPE_CANONICAL (rettype),
7347 if (!COMPLETE_TYPE_P (t))
7353 /* Construct, lay out and return the type of methods belonging to class
7354 BASETYPE and whose arguments and values are described by TYPE.
7355 If that type exists already, reuse it.
7356 TYPE must be a FUNCTION_TYPE node. */
7359 build_method_type (tree basetype, tree type)
7361 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7363 return build_method_type_directly (basetype,
7365 TYPE_ARG_TYPES (type));
7368 /* Construct, lay out and return the type of offsets to a value
7369 of type TYPE, within an object of type BASETYPE.
7370 If a suitable offset type exists already, reuse it. */
7373 build_offset_type (tree basetype, tree type)
7376 hashval_t hashcode = 0;
7378 /* Make a node of the sort we want. */
7379 t = make_node (OFFSET_TYPE);
7381 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7382 TREE_TYPE (t) = type;
7384 /* If we already have such a type, use the old one. */
7385 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7386 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7387 t = type_hash_canon (hashcode, t);
7389 if (!COMPLETE_TYPE_P (t))
7392 if (TYPE_CANONICAL (t) == t)
7394 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7395 || TYPE_STRUCTURAL_EQUALITY_P (type))
7396 SET_TYPE_STRUCTURAL_EQUALITY (t);
7397 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7398 || TYPE_CANONICAL (type) != type)
7400 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7401 TYPE_CANONICAL (type));
7407 /* Create a complex type whose components are COMPONENT_TYPE. */
7410 build_complex_type (tree component_type)
7415 gcc_assert (INTEGRAL_TYPE_P (component_type)
7416 || SCALAR_FLOAT_TYPE_P (component_type)
7417 || FIXED_POINT_TYPE_P (component_type));
7419 /* Make a node of the sort we want. */
7420 t = make_node (COMPLEX_TYPE);
7422 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7424 /* If we already have such a type, use the old one. */
7425 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7426 t = type_hash_canon (hashcode, t);
7428 if (!COMPLETE_TYPE_P (t))
7431 if (TYPE_CANONICAL (t) == t)
7433 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7434 SET_TYPE_STRUCTURAL_EQUALITY (t);
7435 else if (TYPE_CANONICAL (component_type) != component_type)
7437 = build_complex_type (TYPE_CANONICAL (component_type));
7440 /* We need to create a name, since complex is a fundamental type. */
7441 if (! TYPE_NAME (t))
7444 if (component_type == char_type_node)
7445 name = "complex char";
7446 else if (component_type == signed_char_type_node)
7447 name = "complex signed char";
7448 else if (component_type == unsigned_char_type_node)
7449 name = "complex unsigned char";
7450 else if (component_type == short_integer_type_node)
7451 name = "complex short int";
7452 else if (component_type == short_unsigned_type_node)
7453 name = "complex short unsigned int";
7454 else if (component_type == integer_type_node)
7455 name = "complex int";
7456 else if (component_type == unsigned_type_node)
7457 name = "complex unsigned int";
7458 else if (component_type == long_integer_type_node)
7459 name = "complex long int";
7460 else if (component_type == long_unsigned_type_node)
7461 name = "complex long unsigned int";
7462 else if (component_type == long_long_integer_type_node)
7463 name = "complex long long int";
7464 else if (component_type == long_long_unsigned_type_node)
7465 name = "complex long long unsigned int";
7470 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7471 get_identifier (name), t);
7474 return build_qualified_type (t, TYPE_QUALS (component_type));
7477 /* If TYPE is a real or complex floating-point type and the target
7478 does not directly support arithmetic on TYPE then return the wider
7479 type to be used for arithmetic on TYPE. Otherwise, return
7483 excess_precision_type (tree type)
7485 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7487 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7488 switch (TREE_CODE (type))
7491 switch (flt_eval_method)
7494 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7495 return double_type_node;
7498 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7499 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7500 return long_double_type_node;
7507 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7509 switch (flt_eval_method)
7512 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7513 return complex_double_type_node;
7516 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7517 || (TYPE_MODE (TREE_TYPE (type))
7518 == TYPE_MODE (double_type_node)))
7519 return complex_long_double_type_node;
7532 /* Return OP, stripped of any conversions to wider types as much as is safe.
7533 Converting the value back to OP's type makes a value equivalent to OP.
7535 If FOR_TYPE is nonzero, we return a value which, if converted to
7536 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7538 OP must have integer, real or enumeral type. Pointers are not allowed!
7540 There are some cases where the obvious value we could return
7541 would regenerate to OP if converted to OP's type,
7542 but would not extend like OP to wider types.
7543 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7544 For example, if OP is (unsigned short)(signed char)-1,
7545 we avoid returning (signed char)-1 if FOR_TYPE is int,
7546 even though extending that to an unsigned short would regenerate OP,
7547 since the result of extending (signed char)-1 to (int)
7548 is different from (int) OP. */
7551 get_unwidened (tree op, tree for_type)
7553 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7554 tree type = TREE_TYPE (op);
7556 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7558 = (for_type != 0 && for_type != type
7559 && final_prec > TYPE_PRECISION (type)
7560 && TYPE_UNSIGNED (type));
7563 while (CONVERT_EXPR_P (op))
7567 /* TYPE_PRECISION on vector types has different meaning
7568 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7569 so avoid them here. */
7570 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7573 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7574 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7576 /* Truncations are many-one so cannot be removed.
7577 Unless we are later going to truncate down even farther. */
7579 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7582 /* See what's inside this conversion. If we decide to strip it,
7584 op = TREE_OPERAND (op, 0);
7586 /* If we have not stripped any zero-extensions (uns is 0),
7587 we can strip any kind of extension.
7588 If we have previously stripped a zero-extension,
7589 only zero-extensions can safely be stripped.
7590 Any extension can be stripped if the bits it would produce
7591 are all going to be discarded later by truncating to FOR_TYPE. */
7595 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7597 /* TYPE_UNSIGNED says whether this is a zero-extension.
7598 Let's avoid computing it if it does not affect WIN
7599 and if UNS will not be needed again. */
7601 || CONVERT_EXPR_P (op))
7602 && TYPE_UNSIGNED (TREE_TYPE (op)))
7613 /* Return OP or a simpler expression for a narrower value
7614 which can be sign-extended or zero-extended to give back OP.
7615 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7616 or 0 if the value should be sign-extended. */
7619 get_narrower (tree op, int *unsignedp_ptr)
7624 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7626 while (TREE_CODE (op) == NOP_EXPR)
7629 = (TYPE_PRECISION (TREE_TYPE (op))
7630 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7632 /* Truncations are many-one so cannot be removed. */
7636 /* See what's inside this conversion. If we decide to strip it,
7641 op = TREE_OPERAND (op, 0);
7642 /* An extension: the outermost one can be stripped,
7643 but remember whether it is zero or sign extension. */
7645 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7646 /* Otherwise, if a sign extension has been stripped,
7647 only sign extensions can now be stripped;
7648 if a zero extension has been stripped, only zero-extensions. */
7649 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7653 else /* bitschange == 0 */
7655 /* A change in nominal type can always be stripped, but we must
7656 preserve the unsignedness. */
7658 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7660 op = TREE_OPERAND (op, 0);
7661 /* Keep trying to narrow, but don't assign op to win if it
7662 would turn an integral type into something else. */
7663 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7670 if (TREE_CODE (op) == COMPONENT_REF
7671 /* Since type_for_size always gives an integer type. */
7672 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7673 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7674 /* Ensure field is laid out already. */
7675 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7676 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7678 unsigned HOST_WIDE_INT innerprec
7679 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7680 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7681 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7682 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7684 /* We can get this structure field in a narrower type that fits it,
7685 but the resulting extension to its nominal type (a fullword type)
7686 must satisfy the same conditions as for other extensions.
7688 Do this only for fields that are aligned (not bit-fields),
7689 because when bit-field insns will be used there is no
7690 advantage in doing this. */
7692 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7693 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7694 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7698 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7699 win = fold_convert (type, op);
7703 *unsignedp_ptr = uns;
7707 /* Nonzero if integer constant C has a value that is permissible
7708 for type TYPE (an INTEGER_TYPE). */
7711 int_fits_type_p (const_tree c, const_tree type)
7713 tree type_low_bound, type_high_bound;
7714 bool ok_for_low_bound, ok_for_high_bound, unsc;
7717 dc = tree_to_double_int (c);
7718 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7720 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7721 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7723 /* So c is an unsigned integer whose type is sizetype and type is not.
7724 sizetype'd integers are sign extended even though they are
7725 unsigned. If the integer value fits in the lower end word of c,
7726 and if the higher end word has all its bits set to 1, that
7727 means the higher end bits are set to 1 only for sign extension.
7728 So let's convert c into an equivalent zero extended unsigned
7730 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7733 type_low_bound = TYPE_MIN_VALUE (type);
7734 type_high_bound = TYPE_MAX_VALUE (type);
7736 /* If at least one bound of the type is a constant integer, we can check
7737 ourselves and maybe make a decision. If no such decision is possible, but
7738 this type is a subtype, try checking against that. Otherwise, use
7739 fit_double_type, which checks against the precision.
7741 Compute the status for each possibly constant bound, and return if we see
7742 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7743 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7744 for "constant known to fit". */
7746 /* Check if c >= type_low_bound. */
7747 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7749 dd = tree_to_double_int (type_low_bound);
7750 if (TREE_CODE (type) == INTEGER_TYPE
7751 && TYPE_IS_SIZETYPE (type)
7752 && TYPE_UNSIGNED (type))
7753 dd = double_int_zext (dd, TYPE_PRECISION (type));
7754 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7756 int c_neg = (!unsc && double_int_negative_p (dc));
7757 int t_neg = (unsc && double_int_negative_p (dd));
7759 if (c_neg && !t_neg)
7761 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7764 else if (double_int_cmp (dc, dd, unsc) < 0)
7766 ok_for_low_bound = true;
7769 ok_for_low_bound = false;
7771 /* Check if c <= type_high_bound. */
7772 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7774 dd = tree_to_double_int (type_high_bound);
7775 if (TREE_CODE (type) == INTEGER_TYPE
7776 && TYPE_IS_SIZETYPE (type)
7777 && TYPE_UNSIGNED (type))
7778 dd = double_int_zext (dd, TYPE_PRECISION (type));
7779 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7781 int c_neg = (!unsc && double_int_negative_p (dc));
7782 int t_neg = (unsc && double_int_negative_p (dd));
7784 if (t_neg && !c_neg)
7786 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7789 else if (double_int_cmp (dc, dd, unsc) > 0)
7791 ok_for_high_bound = true;
7794 ok_for_high_bound = false;
7796 /* If the constant fits both bounds, the result is known. */
7797 if (ok_for_low_bound && ok_for_high_bound)
7800 /* Perform some generic filtering which may allow making a decision
7801 even if the bounds are not constant. First, negative integers
7802 never fit in unsigned types, */
7803 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7806 /* Second, narrower types always fit in wider ones. */
7807 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7810 /* Third, unsigned integers with top bit set never fit signed types. */
7811 if (! TYPE_UNSIGNED (type) && unsc)
7813 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7814 if (prec < HOST_BITS_PER_WIDE_INT)
7816 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7819 else if (((((unsigned HOST_WIDE_INT) 1)
7820 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7824 /* If we haven't been able to decide at this point, there nothing more we
7825 can check ourselves here. Look at the base type if we have one and it
7826 has the same precision. */
7827 if (TREE_CODE (type) == INTEGER_TYPE
7828 && TREE_TYPE (type) != 0
7829 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7831 type = TREE_TYPE (type);
7835 /* Or to fit_double_type, if nothing else. */
7836 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7839 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7840 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7841 represented (assuming two's-complement arithmetic) within the bit
7842 precision of the type are returned instead. */
7845 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7847 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7848 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7849 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7850 TYPE_UNSIGNED (type));
7853 if (TYPE_UNSIGNED (type))
7854 mpz_set_ui (min, 0);
7858 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7859 mn = double_int_sext (double_int_add (mn, double_int_one),
7860 TYPE_PRECISION (type));
7861 mpz_set_double_int (min, mn, false);
7865 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7866 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7867 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7868 TYPE_UNSIGNED (type));
7871 if (TYPE_UNSIGNED (type))
7872 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7875 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7880 /* Return true if VAR is an automatic variable defined in function FN. */
7883 auto_var_in_fn_p (const_tree var, const_tree fn)
7885 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7886 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
7887 && ! TREE_STATIC (var))
7888 || TREE_CODE (var) == LABEL_DECL
7889 || TREE_CODE (var) == RESULT_DECL));
7892 /* Subprogram of following function. Called by walk_tree.
7894 Return *TP if it is an automatic variable or parameter of the
7895 function passed in as DATA. */
7898 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7900 tree fn = (tree) data;
7905 else if (DECL_P (*tp)
7906 && auto_var_in_fn_p (*tp, fn))
7912 /* Returns true if T is, contains, or refers to a type with variable
7913 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7914 arguments, but not the return type. If FN is nonzero, only return
7915 true if a modifier of the type or position of FN is a variable or
7916 parameter inside FN.
7918 This concept is more general than that of C99 'variably modified types':
7919 in C99, a struct type is never variably modified because a VLA may not
7920 appear as a structure member. However, in GNU C code like:
7922 struct S { int i[f()]; };
7924 is valid, and other languages may define similar constructs. */
7927 variably_modified_type_p (tree type, tree fn)
7931 /* Test if T is either variable (if FN is zero) or an expression containing
7932 a variable in FN. */
7933 #define RETURN_TRUE_IF_VAR(T) \
7934 do { tree _t = (T); \
7935 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7936 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7937 return true; } while (0)
7939 if (type == error_mark_node)
7942 /* If TYPE itself has variable size, it is variably modified. */
7943 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7944 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
7946 switch (TREE_CODE (type))
7949 case REFERENCE_TYPE:
7951 if (variably_modified_type_p (TREE_TYPE (type), fn))
7957 /* If TYPE is a function type, it is variably modified if the
7958 return type is variably modified. */
7959 if (variably_modified_type_p (TREE_TYPE (type), fn))
7965 case FIXED_POINT_TYPE:
7968 /* Scalar types are variably modified if their end points
7970 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
7971 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
7976 case QUAL_UNION_TYPE:
7977 /* We can't see if any of the fields are variably-modified by the
7978 definition we normally use, since that would produce infinite
7979 recursion via pointers. */
7980 /* This is variably modified if some field's type is. */
7981 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
7982 if (TREE_CODE (t) == FIELD_DECL)
7984 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
7985 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
7986 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
7988 if (TREE_CODE (type) == QUAL_UNION_TYPE)
7989 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
7994 /* Do not call ourselves to avoid infinite recursion. This is
7995 variably modified if the element type is. */
7996 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
7997 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8004 /* The current language may have other cases to check, but in general,
8005 all other types are not variably modified. */
8006 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8008 #undef RETURN_TRUE_IF_VAR
8011 /* Given a DECL or TYPE, return the scope in which it was declared, or
8012 NULL_TREE if there is no containing scope. */
8015 get_containing_scope (const_tree t)
8017 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8020 /* Return the innermost context enclosing DECL that is
8021 a FUNCTION_DECL, or zero if none. */
8024 decl_function_context (const_tree decl)
8028 if (TREE_CODE (decl) == ERROR_MARK)
8031 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8032 where we look up the function at runtime. Such functions always take
8033 a first argument of type 'pointer to real context'.
8035 C++ should really be fixed to use DECL_CONTEXT for the real context,
8036 and use something else for the "virtual context". */
8037 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8040 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8042 context = DECL_CONTEXT (decl);
8044 while (context && TREE_CODE (context) != FUNCTION_DECL)
8046 if (TREE_CODE (context) == BLOCK)
8047 context = BLOCK_SUPERCONTEXT (context);
8049 context = get_containing_scope (context);
8055 /* Return the innermost context enclosing DECL that is
8056 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8057 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8060 decl_type_context (const_tree decl)
8062 tree context = DECL_CONTEXT (decl);
8065 switch (TREE_CODE (context))
8067 case NAMESPACE_DECL:
8068 case TRANSLATION_UNIT_DECL:
8073 case QUAL_UNION_TYPE:
8078 context = DECL_CONTEXT (context);
8082 context = BLOCK_SUPERCONTEXT (context);
8092 /* CALL is a CALL_EXPR. Return the declaration for the function
8093 called, or NULL_TREE if the called function cannot be
8097 get_callee_fndecl (const_tree call)
8101 if (call == error_mark_node)
8102 return error_mark_node;
8104 /* It's invalid to call this function with anything but a
8106 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8108 /* The first operand to the CALL is the address of the function
8110 addr = CALL_EXPR_FN (call);
8114 /* If this is a readonly function pointer, extract its initial value. */
8115 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8116 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8117 && DECL_INITIAL (addr))
8118 addr = DECL_INITIAL (addr);
8120 /* If the address is just `&f' for some function `f', then we know
8121 that `f' is being called. */
8122 if (TREE_CODE (addr) == ADDR_EXPR
8123 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8124 return TREE_OPERAND (addr, 0);
8126 /* We couldn't figure out what was being called. */
8130 /* Print debugging information about tree nodes generated during the compile,
8131 and any language-specific information. */
8134 dump_tree_statistics (void)
8136 #ifdef GATHER_STATISTICS
8138 int total_nodes, total_bytes;
8141 fprintf (stderr, "\n??? tree nodes created\n\n");
8142 #ifdef GATHER_STATISTICS
8143 fprintf (stderr, "Kind Nodes Bytes\n");
8144 fprintf (stderr, "---------------------------------------\n");
8145 total_nodes = total_bytes = 0;
8146 for (i = 0; i < (int) all_kinds; i++)
8148 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8149 tree_node_counts[i], tree_node_sizes[i]);
8150 total_nodes += tree_node_counts[i];
8151 total_bytes += tree_node_sizes[i];
8153 fprintf (stderr, "---------------------------------------\n");
8154 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8155 fprintf (stderr, "---------------------------------------\n");
8156 ssanames_print_statistics ();
8157 phinodes_print_statistics ();
8159 fprintf (stderr, "(No per-node statistics)\n");
8161 print_type_hash_statistics ();
8162 print_debug_expr_statistics ();
8163 print_value_expr_statistics ();
8164 lang_hooks.print_statistics ();
8167 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8169 /* Generate a crc32 of a string. */
8172 crc32_string (unsigned chksum, const char *string)
8176 unsigned value = *string << 24;
8179 for (ix = 8; ix--; value <<= 1)
8183 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8192 /* P is a string that will be used in a symbol. Mask out any characters
8193 that are not valid in that context. */
8196 clean_symbol_name (char *p)
8200 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8203 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8210 /* Generate a name for a special-purpose function function.
8211 The generated name may need to be unique across the whole link.
8212 TYPE is some string to identify the purpose of this function to the
8213 linker or collect2; it must start with an uppercase letter,
8215 I - for constructors
8217 N - for C++ anonymous namespaces
8218 F - for DWARF unwind frame information. */
8221 get_file_function_name (const char *type)
8227 /* If we already have a name we know to be unique, just use that. */
8228 if (first_global_object_name)
8229 p = q = ASTRDUP (first_global_object_name);
8230 /* If the target is handling the constructors/destructors, they
8231 will be local to this file and the name is only necessary for
8232 debugging purposes. */
8233 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8235 const char *file = main_input_filename;
8237 file = input_filename;
8238 /* Just use the file's basename, because the full pathname
8239 might be quite long. */
8240 p = strrchr (file, '/');
8245 p = q = ASTRDUP (p);
8249 /* Otherwise, the name must be unique across the entire link.
8250 We don't have anything that we know to be unique to this translation
8251 unit, so use what we do have and throw in some randomness. */
8253 const char *name = weak_global_object_name;
8254 const char *file = main_input_filename;
8259 file = input_filename;
8261 len = strlen (file);
8262 q = (char *) alloca (9 * 2 + len + 1);
8263 memcpy (q, file, len + 1);
8265 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8266 crc32_string (0, get_random_seed (false)));
8271 clean_symbol_name (q);
8272 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8275 /* Set up the name of the file-level functions we may need.
8276 Use a global object (which is already required to be unique over
8277 the program) rather than the file name (which imposes extra
8279 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8281 return get_identifier (buf);
8284 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8286 /* Complain that the tree code of NODE does not match the expected 0
8287 terminated list of trailing codes. The trailing code list can be
8288 empty, for a more vague error message. FILE, LINE, and FUNCTION
8289 are of the caller. */
8292 tree_check_failed (const_tree node, const char *file,
8293 int line, const char *function, ...)
8297 unsigned length = 0;
8300 va_start (args, function);
8301 while ((code = va_arg (args, int)))
8302 length += 4 + strlen (tree_code_name[code]);
8307 va_start (args, function);
8308 length += strlen ("expected ");
8309 buffer = tmp = (char *) alloca (length);
8311 while ((code = va_arg (args, int)))
8313 const char *prefix = length ? " or " : "expected ";
8315 strcpy (tmp + length, prefix);
8316 length += strlen (prefix);
8317 strcpy (tmp + length, tree_code_name[code]);
8318 length += strlen (tree_code_name[code]);
8323 buffer = "unexpected node";
8325 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8326 buffer, tree_code_name[TREE_CODE (node)],
8327 function, trim_filename (file), line);
8330 /* Complain that the tree code of NODE does match the expected 0
8331 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8335 tree_not_check_failed (const_tree node, const char *file,
8336 int line, const char *function, ...)
8340 unsigned length = 0;
8343 va_start (args, function);
8344 while ((code = va_arg (args, int)))
8345 length += 4 + strlen (tree_code_name[code]);
8347 va_start (args, function);
8348 buffer = (char *) alloca (length);
8350 while ((code = va_arg (args, int)))
8354 strcpy (buffer + length, " or ");
8357 strcpy (buffer + length, tree_code_name[code]);
8358 length += strlen (tree_code_name[code]);
8362 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8363 buffer, tree_code_name[TREE_CODE (node)],
8364 function, trim_filename (file), line);
8367 /* Similar to tree_check_failed, except that we check for a class of tree
8368 code, given in CL. */
8371 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8372 const char *file, int line, const char *function)
8375 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8376 TREE_CODE_CLASS_STRING (cl),
8377 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8378 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8381 /* Similar to tree_check_failed, except that instead of specifying a
8382 dozen codes, use the knowledge that they're all sequential. */
8385 tree_range_check_failed (const_tree node, const char *file, int line,
8386 const char *function, enum tree_code c1,
8390 unsigned length = 0;
8393 for (c = c1; c <= c2; ++c)
8394 length += 4 + strlen (tree_code_name[c]);
8396 length += strlen ("expected ");
8397 buffer = (char *) alloca (length);
8400 for (c = c1; c <= c2; ++c)
8402 const char *prefix = length ? " or " : "expected ";
8404 strcpy (buffer + length, prefix);
8405 length += strlen (prefix);
8406 strcpy (buffer + length, tree_code_name[c]);
8407 length += strlen (tree_code_name[c]);
8410 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8411 buffer, tree_code_name[TREE_CODE (node)],
8412 function, trim_filename (file), line);
8416 /* Similar to tree_check_failed, except that we check that a tree does
8417 not have the specified code, given in CL. */
8420 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8421 const char *file, int line, const char *function)
8424 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8425 TREE_CODE_CLASS_STRING (cl),
8426 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8427 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8431 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8434 omp_clause_check_failed (const_tree node, const char *file, int line,
8435 const char *function, enum omp_clause_code code)
8437 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8438 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8439 function, trim_filename (file), line);
8443 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8446 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8447 const char *function, enum omp_clause_code c1,
8448 enum omp_clause_code c2)
8451 unsigned length = 0;
8454 for (c = c1; c <= c2; ++c)
8455 length += 4 + strlen (omp_clause_code_name[c]);
8457 length += strlen ("expected ");
8458 buffer = (char *) alloca (length);
8461 for (c = c1; c <= c2; ++c)
8463 const char *prefix = length ? " or " : "expected ";
8465 strcpy (buffer + length, prefix);
8466 length += strlen (prefix);
8467 strcpy (buffer + length, omp_clause_code_name[c]);
8468 length += strlen (omp_clause_code_name[c]);
8471 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8472 buffer, omp_clause_code_name[TREE_CODE (node)],
8473 function, trim_filename (file), line);
8477 #undef DEFTREESTRUCT
8478 #define DEFTREESTRUCT(VAL, NAME) NAME,
8480 static const char *ts_enum_names[] = {
8481 #include "treestruct.def"
8483 #undef DEFTREESTRUCT
8485 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8487 /* Similar to tree_class_check_failed, except that we check for
8488 whether CODE contains the tree structure identified by EN. */
8491 tree_contains_struct_check_failed (const_tree node,
8492 const enum tree_node_structure_enum en,
8493 const char *file, int line,
8494 const char *function)
8497 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8499 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8503 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8504 (dynamically sized) vector. */
8507 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8508 const char *function)
8511 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8512 idx + 1, len, function, trim_filename (file), line);
8515 /* Similar to above, except that the check is for the bounds of the operand
8516 vector of an expression node EXP. */
8519 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8520 int line, const char *function)
8522 int code = TREE_CODE (exp);
8524 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8525 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8526 function, trim_filename (file), line);
8529 /* Similar to above, except that the check is for the number of
8530 operands of an OMP_CLAUSE node. */
8533 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8534 int line, const char *function)
8537 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8538 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8539 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8540 trim_filename (file), line);
8542 #endif /* ENABLE_TREE_CHECKING */
8544 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8545 and mapped to the machine mode MODE. Initialize its fields and build
8546 the information necessary for debugging output. */
8549 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8552 hashval_t hashcode = 0;
8554 t = make_node (VECTOR_TYPE);
8555 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8556 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8557 SET_TYPE_MODE (t, mode);
8559 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8560 SET_TYPE_STRUCTURAL_EQUALITY (t);
8561 else if (TYPE_CANONICAL (innertype) != innertype
8562 || mode != VOIDmode)
8564 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8569 tree index = build_int_cst (NULL_TREE, nunits - 1);
8570 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8571 build_index_type (index));
8572 tree rt = make_node (RECORD_TYPE);
8574 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8575 get_identifier ("f"), array);
8576 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8578 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8579 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8580 the representation type, and we want to find that die when looking up
8581 the vector type. This is most easily achieved by making the TYPE_UID
8583 TYPE_UID (rt) = TYPE_UID (t);
8586 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8587 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8588 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8589 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8590 t = type_hash_canon (hashcode, t);
8592 /* We have built a main variant, based on the main variant of the
8593 inner type. Use it to build the variant we return. */
8594 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8595 && TREE_TYPE (t) != innertype)
8596 return build_type_attribute_qual_variant (t,
8597 TYPE_ATTRIBUTES (innertype),
8598 TYPE_QUALS (innertype));
8604 make_or_reuse_type (unsigned size, int unsignedp)
8606 if (size == INT_TYPE_SIZE)
8607 return unsignedp ? unsigned_type_node : integer_type_node;
8608 if (size == CHAR_TYPE_SIZE)
8609 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8610 if (size == SHORT_TYPE_SIZE)
8611 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8612 if (size == LONG_TYPE_SIZE)
8613 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8614 if (size == LONG_LONG_TYPE_SIZE)
8615 return (unsignedp ? long_long_unsigned_type_node
8616 : long_long_integer_type_node);
8619 return make_unsigned_type (size);
8621 return make_signed_type (size);
8624 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8627 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8631 if (size == SHORT_FRACT_TYPE_SIZE)
8632 return unsignedp ? sat_unsigned_short_fract_type_node
8633 : sat_short_fract_type_node;
8634 if (size == FRACT_TYPE_SIZE)
8635 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8636 if (size == LONG_FRACT_TYPE_SIZE)
8637 return unsignedp ? sat_unsigned_long_fract_type_node
8638 : sat_long_fract_type_node;
8639 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8640 return unsignedp ? sat_unsigned_long_long_fract_type_node
8641 : sat_long_long_fract_type_node;
8645 if (size == SHORT_FRACT_TYPE_SIZE)
8646 return unsignedp ? unsigned_short_fract_type_node
8647 : short_fract_type_node;
8648 if (size == FRACT_TYPE_SIZE)
8649 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8650 if (size == LONG_FRACT_TYPE_SIZE)
8651 return unsignedp ? unsigned_long_fract_type_node
8652 : long_fract_type_node;
8653 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8654 return unsignedp ? unsigned_long_long_fract_type_node
8655 : long_long_fract_type_node;
8658 return make_fract_type (size, unsignedp, satp);
8661 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8664 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8668 if (size == SHORT_ACCUM_TYPE_SIZE)
8669 return unsignedp ? sat_unsigned_short_accum_type_node
8670 : sat_short_accum_type_node;
8671 if (size == ACCUM_TYPE_SIZE)
8672 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8673 if (size == LONG_ACCUM_TYPE_SIZE)
8674 return unsignedp ? sat_unsigned_long_accum_type_node
8675 : sat_long_accum_type_node;
8676 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8677 return unsignedp ? sat_unsigned_long_long_accum_type_node
8678 : sat_long_long_accum_type_node;
8682 if (size == SHORT_ACCUM_TYPE_SIZE)
8683 return unsignedp ? unsigned_short_accum_type_node
8684 : short_accum_type_node;
8685 if (size == ACCUM_TYPE_SIZE)
8686 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8687 if (size == LONG_ACCUM_TYPE_SIZE)
8688 return unsignedp ? unsigned_long_accum_type_node
8689 : long_accum_type_node;
8690 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8691 return unsignedp ? unsigned_long_long_accum_type_node
8692 : long_long_accum_type_node;
8695 return make_accum_type (size, unsignedp, satp);
8698 /* Create nodes for all integer types (and error_mark_node) using the sizes
8699 of C datatypes. The caller should call set_sizetype soon after calling
8700 this function to select one of the types as sizetype. */
8703 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
8705 error_mark_node = make_node (ERROR_MARK);
8706 TREE_TYPE (error_mark_node) = error_mark_node;
8708 initialize_sizetypes (signed_sizetype);
8710 /* Define both `signed char' and `unsigned char'. */
8711 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8712 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8713 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8714 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8716 /* Define `char', which is like either `signed char' or `unsigned char'
8717 but not the same as either. */
8720 ? make_signed_type (CHAR_TYPE_SIZE)
8721 : make_unsigned_type (CHAR_TYPE_SIZE));
8722 TYPE_STRING_FLAG (char_type_node) = 1;
8724 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8725 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8726 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8727 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8728 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8729 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8730 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8731 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8733 /* Define a boolean type. This type only represents boolean values but
8734 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8735 Front ends which want to override this size (i.e. Java) can redefine
8736 boolean_type_node before calling build_common_tree_nodes_2. */
8737 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8738 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8739 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8740 TYPE_PRECISION (boolean_type_node) = 1;
8742 /* Fill in the rest of the sized types. Reuse existing type nodes
8744 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8745 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8746 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8747 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8748 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8750 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8751 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8752 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8753 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8754 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8756 access_public_node = get_identifier ("public");
8757 access_protected_node = get_identifier ("protected");
8758 access_private_node = get_identifier ("private");
8761 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8762 It will create several other common tree nodes. */
8765 build_common_tree_nodes_2 (int short_double)
8767 /* Define these next since types below may used them. */
8768 integer_zero_node = build_int_cst (NULL_TREE, 0);
8769 integer_one_node = build_int_cst (NULL_TREE, 1);
8770 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8772 size_zero_node = size_int (0);
8773 size_one_node = size_int (1);
8774 bitsize_zero_node = bitsize_int (0);
8775 bitsize_one_node = bitsize_int (1);
8776 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8778 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8779 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8781 void_type_node = make_node (VOID_TYPE);
8782 layout_type (void_type_node);
8784 /* We are not going to have real types in C with less than byte alignment,
8785 so we might as well not have any types that claim to have it. */
8786 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8787 TYPE_USER_ALIGN (void_type_node) = 0;
8789 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8790 layout_type (TREE_TYPE (null_pointer_node));
8792 ptr_type_node = build_pointer_type (void_type_node);
8794 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8795 fileptr_type_node = ptr_type_node;
8797 float_type_node = make_node (REAL_TYPE);
8798 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8799 layout_type (float_type_node);
8801 double_type_node = make_node (REAL_TYPE);
8803 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8805 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8806 layout_type (double_type_node);
8808 long_double_type_node = make_node (REAL_TYPE);
8809 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8810 layout_type (long_double_type_node);
8812 float_ptr_type_node = build_pointer_type (float_type_node);
8813 double_ptr_type_node = build_pointer_type (double_type_node);
8814 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8815 integer_ptr_type_node = build_pointer_type (integer_type_node);
8817 /* Fixed size integer types. */
8818 uint32_type_node = build_nonstandard_integer_type (32, true);
8819 uint64_type_node = build_nonstandard_integer_type (64, true);
8821 /* Decimal float types. */
8822 dfloat32_type_node = make_node (REAL_TYPE);
8823 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8824 layout_type (dfloat32_type_node);
8825 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8826 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8828 dfloat64_type_node = make_node (REAL_TYPE);
8829 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8830 layout_type (dfloat64_type_node);
8831 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8832 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8834 dfloat128_type_node = make_node (REAL_TYPE);
8835 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8836 layout_type (dfloat128_type_node);
8837 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8838 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8840 complex_integer_type_node = build_complex_type (integer_type_node);
8841 complex_float_type_node = build_complex_type (float_type_node);
8842 complex_double_type_node = build_complex_type (double_type_node);
8843 complex_long_double_type_node = build_complex_type (long_double_type_node);
8845 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8846 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8847 sat_ ## KIND ## _type_node = \
8848 make_sat_signed_ ## KIND ## _type (SIZE); \
8849 sat_unsigned_ ## KIND ## _type_node = \
8850 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8851 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8852 unsigned_ ## KIND ## _type_node = \
8853 make_unsigned_ ## KIND ## _type (SIZE);
8855 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8856 sat_ ## WIDTH ## KIND ## _type_node = \
8857 make_sat_signed_ ## KIND ## _type (SIZE); \
8858 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8859 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8860 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8861 unsigned_ ## WIDTH ## KIND ## _type_node = \
8862 make_unsigned_ ## KIND ## _type (SIZE);
8864 /* Make fixed-point type nodes based on four different widths. */
8865 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8866 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8867 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8868 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8869 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8871 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8872 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8873 NAME ## _type_node = \
8874 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8875 u ## NAME ## _type_node = \
8876 make_or_reuse_unsigned_ ## KIND ## _type \
8877 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8878 sat_ ## NAME ## _type_node = \
8879 make_or_reuse_sat_signed_ ## KIND ## _type \
8880 (GET_MODE_BITSIZE (MODE ## mode)); \
8881 sat_u ## NAME ## _type_node = \
8882 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8883 (GET_MODE_BITSIZE (U ## MODE ## mode));
8885 /* Fixed-point type and mode nodes. */
8886 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8887 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8888 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8889 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8890 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8891 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8892 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8893 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8894 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8895 MAKE_FIXED_MODE_NODE (accum, da, DA)
8896 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8899 tree t = targetm.build_builtin_va_list ();
8901 /* Many back-ends define record types without setting TYPE_NAME.
8902 If we copied the record type here, we'd keep the original
8903 record type without a name. This breaks name mangling. So,
8904 don't copy record types and let c_common_nodes_and_builtins()
8905 declare the type to be __builtin_va_list. */
8906 if (TREE_CODE (t) != RECORD_TYPE)
8907 t = build_variant_type_copy (t);
8909 va_list_type_node = t;
8913 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8916 local_define_builtin (const char *name, tree type, enum built_in_function code,
8917 const char *library_name, int ecf_flags)
8921 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8922 library_name, NULL_TREE);
8923 if (ecf_flags & ECF_CONST)
8924 TREE_READONLY (decl) = 1;
8925 if (ecf_flags & ECF_PURE)
8926 DECL_PURE_P (decl) = 1;
8927 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8928 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8929 if (ecf_flags & ECF_NORETURN)
8930 TREE_THIS_VOLATILE (decl) = 1;
8931 if (ecf_flags & ECF_NOTHROW)
8932 TREE_NOTHROW (decl) = 1;
8933 if (ecf_flags & ECF_MALLOC)
8934 DECL_IS_MALLOC (decl) = 1;
8936 built_in_decls[code] = decl;
8937 implicit_built_in_decls[code] = decl;
8940 /* Call this function after instantiating all builtins that the language
8941 front end cares about. This will build the rest of the builtins that
8942 are relied upon by the tree optimizers and the middle-end. */
8945 build_common_builtin_nodes (void)
8947 tree tmp, tmp2, ftype;
8949 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
8950 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8952 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8953 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8954 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8955 ftype = build_function_type (ptr_type_node, tmp);
8957 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
8958 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
8959 "memcpy", ECF_NOTHROW);
8960 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8961 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
8962 "memmove", ECF_NOTHROW);
8965 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
8967 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8968 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8969 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8970 ftype = build_function_type (integer_type_node, tmp);
8971 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
8972 "memcmp", ECF_PURE | ECF_NOTHROW);
8975 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
8977 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8978 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
8979 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8980 ftype = build_function_type (ptr_type_node, tmp);
8981 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
8982 "memset", ECF_NOTHROW);
8985 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
8987 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8988 ftype = build_function_type (ptr_type_node, tmp);
8989 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
8990 "alloca", ECF_NOTHROW | ECF_MALLOC);
8993 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8994 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8995 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8996 ftype = build_function_type (void_type_node, tmp);
8997 local_define_builtin ("__builtin_init_trampoline", ftype,
8998 BUILT_IN_INIT_TRAMPOLINE,
8999 "__builtin_init_trampoline", ECF_NOTHROW);
9001 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9002 ftype = build_function_type (ptr_type_node, tmp);
9003 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9004 BUILT_IN_ADJUST_TRAMPOLINE,
9005 "__builtin_adjust_trampoline",
9006 ECF_CONST | ECF_NOTHROW);
9008 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9009 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9010 ftype = build_function_type (void_type_node, tmp);
9011 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9012 BUILT_IN_NONLOCAL_GOTO,
9013 "__builtin_nonlocal_goto",
9014 ECF_NORETURN | ECF_NOTHROW);
9016 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9017 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
9018 ftype = build_function_type (void_type_node, tmp);
9019 local_define_builtin ("__builtin_setjmp_setup", ftype,
9020 BUILT_IN_SETJMP_SETUP,
9021 "__builtin_setjmp_setup", ECF_NOTHROW);
9023 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9024 ftype = build_function_type (ptr_type_node, tmp);
9025 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9026 BUILT_IN_SETJMP_DISPATCHER,
9027 "__builtin_setjmp_dispatcher",
9028 ECF_PURE | ECF_NOTHROW);
9030 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9031 ftype = build_function_type (void_type_node, tmp);
9032 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9033 BUILT_IN_SETJMP_RECEIVER,
9034 "__builtin_setjmp_receiver", ECF_NOTHROW);
9036 ftype = build_function_type (ptr_type_node, void_list_node);
9037 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9038 "__builtin_stack_save", ECF_NOTHROW);
9040 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9041 ftype = build_function_type (void_type_node, tmp);
9042 local_define_builtin ("__builtin_stack_restore", ftype,
9043 BUILT_IN_STACK_RESTORE,
9044 "__builtin_stack_restore", ECF_NOTHROW);
9046 ftype = build_function_type (void_type_node, void_list_node);
9047 local_define_builtin ("__builtin_profile_func_enter", ftype,
9048 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9049 local_define_builtin ("__builtin_profile_func_exit", ftype,
9050 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9052 /* If there's a possibility that we might use the ARM EABI, build the
9053 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9054 if (targetm.arm_eabi_unwinder)
9056 ftype = build_function_type (void_type_node, void_list_node);
9057 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9058 BUILT_IN_CXA_END_CLEANUP,
9059 "__cxa_end_cleanup", ECF_NORETURN);
9062 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
9063 ftype = build_function_type (void_type_node, tmp);
9064 local_define_builtin ("__builtin_unwind_resume", ftype,
9065 BUILT_IN_UNWIND_RESUME,
9066 (USING_SJLJ_EXCEPTIONS
9067 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9070 /* The exception object and filter values from the runtime. The argument
9071 must be zero before exception lowering, i.e. from the front end. After
9072 exception lowering, it will be the region number for the exception
9073 landing pad. These functions are PURE instead of CONST to prevent
9074 them from being hoisted past the exception edge that will initialize
9075 its value in the landing pad. */
9076 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9077 ftype = build_function_type (ptr_type_node, tmp);
9078 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9079 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9081 tmp2 = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9082 ftype = build_function_type (tmp2, tmp);
9083 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9084 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9086 tmp = tree_cons (NULL_TREE, integer_type_node, void_list_node);
9087 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
9088 ftype = build_function_type (void_type_node, tmp);
9089 local_define_builtin ("__builtin_eh_copy_values", ftype,
9090 BUILT_IN_EH_COPY_VALUES,
9091 "__builtin_eh_copy_values", ECF_NOTHROW);
9093 /* Complex multiplication and division. These are handled as builtins
9094 rather than optabs because emit_library_call_value doesn't support
9095 complex. Further, we can do slightly better with folding these
9096 beasties if the real and complex parts of the arguments are separate. */
9100 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9102 char mode_name_buf[4], *q;
9104 enum built_in_function mcode, dcode;
9105 tree type, inner_type;
9107 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9110 inner_type = TREE_TYPE (type);
9112 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
9113 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9114 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9115 tmp = tree_cons (NULL_TREE, inner_type, tmp);
9116 ftype = build_function_type (type, tmp);
9118 mcode = ((enum built_in_function)
9119 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9120 dcode = ((enum built_in_function)
9121 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9123 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9127 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9128 local_define_builtin (built_in_names[mcode], ftype, mcode,
9129 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9131 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9132 local_define_builtin (built_in_names[dcode], ftype, dcode,
9133 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9138 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9141 If we requested a pointer to a vector, build up the pointers that
9142 we stripped off while looking for the inner type. Similarly for
9143 return values from functions.
9145 The argument TYPE is the top of the chain, and BOTTOM is the
9146 new type which we will point to. */
9149 reconstruct_complex_type (tree type, tree bottom)
9153 if (TREE_CODE (type) == POINTER_TYPE)
9155 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9156 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9157 TYPE_REF_CAN_ALIAS_ALL (type));
9159 else if (TREE_CODE (type) == REFERENCE_TYPE)
9161 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9162 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9163 TYPE_REF_CAN_ALIAS_ALL (type));
9165 else if (TREE_CODE (type) == ARRAY_TYPE)
9167 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9168 outer = build_array_type (inner, TYPE_DOMAIN (type));
9170 else if (TREE_CODE (type) == FUNCTION_TYPE)
9172 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9173 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9175 else if (TREE_CODE (type) == METHOD_TYPE)
9177 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9178 /* The build_method_type_directly() routine prepends 'this' to argument list,
9179 so we must compensate by getting rid of it. */
9181 = build_method_type_directly
9182 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9184 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9186 else if (TREE_CODE (type) == OFFSET_TYPE)
9188 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9189 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9194 return build_qualified_type (outer, TYPE_QUALS (type));
9197 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9200 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9204 switch (GET_MODE_CLASS (mode))
9206 case MODE_VECTOR_INT:
9207 case MODE_VECTOR_FLOAT:
9208 case MODE_VECTOR_FRACT:
9209 case MODE_VECTOR_UFRACT:
9210 case MODE_VECTOR_ACCUM:
9211 case MODE_VECTOR_UACCUM:
9212 nunits = GET_MODE_NUNITS (mode);
9216 /* Check that there are no leftover bits. */
9217 gcc_assert (GET_MODE_BITSIZE (mode)
9218 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9220 nunits = GET_MODE_BITSIZE (mode)
9221 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9228 return make_vector_type (innertype, nunits, mode);
9231 /* Similarly, but takes the inner type and number of units, which must be
9235 build_vector_type (tree innertype, int nunits)
9237 return make_vector_type (innertype, nunits, VOIDmode);
9240 /* Similarly, but takes the inner type and number of units, which must be
9244 build_opaque_vector_type (tree innertype, int nunits)
9247 innertype = build_distinct_type_copy (innertype);
9248 t = make_vector_type (innertype, nunits, VOIDmode);
9249 TYPE_VECTOR_OPAQUE (t) = true;
9254 /* Given an initializer INIT, return TRUE if INIT is zero or some
9255 aggregate of zeros. Otherwise return FALSE. */
9257 initializer_zerop (const_tree init)
9263 switch (TREE_CODE (init))
9266 return integer_zerop (init);
9269 /* ??? Note that this is not correct for C4X float formats. There,
9270 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9271 negative exponent. */
9272 return real_zerop (init)
9273 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9276 return fixed_zerop (init);
9279 return integer_zerop (init)
9280 || (real_zerop (init)
9281 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9282 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9285 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9286 if (!initializer_zerop (TREE_VALUE (elt)))
9292 unsigned HOST_WIDE_INT idx;
9294 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9295 if (!initializer_zerop (elt))
9305 /* Build an empty statement at location LOC. */
9308 build_empty_stmt (location_t loc)
9310 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9311 SET_EXPR_LOCATION (t, loc);
9316 /* Build an OpenMP clause with code CODE. LOC is the location of the
9320 build_omp_clause (location_t loc, enum omp_clause_code code)
9325 length = omp_clause_num_ops[code];
9326 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9328 t = GGC_NEWVAR (union tree_node, size);
9329 memset (t, 0, size);
9330 TREE_SET_CODE (t, OMP_CLAUSE);
9331 OMP_CLAUSE_SET_CODE (t, code);
9332 OMP_CLAUSE_LOCATION (t) = loc;
9334 #ifdef GATHER_STATISTICS
9335 tree_node_counts[(int) omp_clause_kind]++;
9336 tree_node_sizes[(int) omp_clause_kind] += size;
9342 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9343 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9344 Except for the CODE and operand count field, other storage for the
9345 object is initialized to zeros. */
9348 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9351 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9353 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9354 gcc_assert (len >= 1);
9356 #ifdef GATHER_STATISTICS
9357 tree_node_counts[(int) e_kind]++;
9358 tree_node_sizes[(int) e_kind] += length;
9361 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9363 memset (t, 0, length);
9365 TREE_SET_CODE (t, code);
9367 /* Can't use TREE_OPERAND to store the length because if checking is
9368 enabled, it will try to check the length before we store it. :-P */
9369 t->exp.operands[0] = build_int_cst (sizetype, len);
9375 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9376 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9380 build_call_list (tree return_type, tree fn, tree arglist)
9385 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9386 TREE_TYPE (t) = return_type;
9387 CALL_EXPR_FN (t) = fn;
9388 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9389 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9390 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9391 process_call_operands (t);
9395 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9396 FN and a null static chain slot. NARGS is the number of call arguments
9397 which are specified as "..." arguments. */
9400 build_call_nary (tree return_type, tree fn, int nargs, ...)
9404 va_start (args, nargs);
9405 ret = build_call_valist (return_type, fn, nargs, args);
9410 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9411 FN and a null static chain slot. NARGS is the number of call arguments
9412 which are specified as a va_list ARGS. */
9415 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9420 t = build_vl_exp (CALL_EXPR, nargs + 3);
9421 TREE_TYPE (t) = return_type;
9422 CALL_EXPR_FN (t) = fn;
9423 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9424 for (i = 0; i < nargs; i++)
9425 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9426 process_call_operands (t);
9430 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9431 FN and a null static chain slot. NARGS is the number of call arguments
9432 which are specified as a tree array ARGS. */
9435 build_call_array_loc (location_t loc, tree return_type, tree fn,
9436 int nargs, const tree *args)
9441 t = build_vl_exp (CALL_EXPR, nargs + 3);
9442 TREE_TYPE (t) = return_type;
9443 CALL_EXPR_FN (t) = fn;
9444 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9445 for (i = 0; i < nargs; i++)
9446 CALL_EXPR_ARG (t, i) = args[i];
9447 process_call_operands (t);
9448 SET_EXPR_LOCATION (t, loc);
9452 /* Like build_call_array, but takes a VEC. */
9455 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9460 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9461 TREE_TYPE (ret) = return_type;
9462 CALL_EXPR_FN (ret) = fn;
9463 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9464 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9465 CALL_EXPR_ARG (ret, ix) = t;
9466 process_call_operands (ret);
9471 /* Returns true if it is possible to prove that the index of
9472 an array access REF (an ARRAY_REF expression) falls into the
9476 in_array_bounds_p (tree ref)
9478 tree idx = TREE_OPERAND (ref, 1);
9481 if (TREE_CODE (idx) != INTEGER_CST)
9484 min = array_ref_low_bound (ref);
9485 max = array_ref_up_bound (ref);
9488 || TREE_CODE (min) != INTEGER_CST
9489 || TREE_CODE (max) != INTEGER_CST)
9492 if (tree_int_cst_lt (idx, min)
9493 || tree_int_cst_lt (max, idx))
9499 /* Returns true if it is possible to prove that the range of
9500 an array access REF (an ARRAY_RANGE_REF expression) falls
9501 into the array bounds. */
9504 range_in_array_bounds_p (tree ref)
9506 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9507 tree range_min, range_max, min, max;
9509 range_min = TYPE_MIN_VALUE (domain_type);
9510 range_max = TYPE_MAX_VALUE (domain_type);
9513 || TREE_CODE (range_min) != INTEGER_CST
9514 || TREE_CODE (range_max) != INTEGER_CST)
9517 min = array_ref_low_bound (ref);
9518 max = array_ref_up_bound (ref);
9521 || TREE_CODE (min) != INTEGER_CST
9522 || TREE_CODE (max) != INTEGER_CST)
9525 if (tree_int_cst_lt (range_min, min)
9526 || tree_int_cst_lt (max, range_max))
9532 /* Return true if T (assumed to be a DECL) must be assigned a memory
9536 needs_to_live_in_memory (const_tree t)
9538 if (TREE_CODE (t) == SSA_NAME)
9539 t = SSA_NAME_VAR (t);
9541 return (TREE_ADDRESSABLE (t)
9542 || is_global_var (t)
9543 || (TREE_CODE (t) == RESULT_DECL
9544 && aggregate_value_p (t, current_function_decl)));
9547 /* There are situations in which a language considers record types
9548 compatible which have different field lists. Decide if two fields
9549 are compatible. It is assumed that the parent records are compatible. */
9552 fields_compatible_p (const_tree f1, const_tree f2)
9554 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9555 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9558 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9559 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9562 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9568 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9571 find_compatible_field (tree record, tree orig_field)
9575 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9576 if (TREE_CODE (f) == FIELD_DECL
9577 && fields_compatible_p (f, orig_field))
9580 /* ??? Why isn't this on the main fields list? */
9581 f = TYPE_VFIELD (record);
9582 if (f && TREE_CODE (f) == FIELD_DECL
9583 && fields_compatible_p (f, orig_field))
9586 /* ??? We should abort here, but Java appears to do Bad Things
9587 with inherited fields. */
9591 /* Return value of a constant X and sign-extend it. */
9594 int_cst_value (const_tree x)
9596 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9597 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9599 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9600 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9601 || TREE_INT_CST_HIGH (x) == -1);
9603 if (bits < HOST_BITS_PER_WIDE_INT)
9605 bool negative = ((val >> (bits - 1)) & 1) != 0;
9607 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9609 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9615 /* Return value of a constant X and sign-extend it. */
9618 widest_int_cst_value (const_tree x)
9620 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9621 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9623 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9624 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9625 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9626 << HOST_BITS_PER_WIDE_INT);
9628 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9629 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9630 || TREE_INT_CST_HIGH (x) == -1);
9633 if (bits < HOST_BITS_PER_WIDEST_INT)
9635 bool negative = ((val >> (bits - 1)) & 1) != 0;
9637 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9639 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9645 /* If TYPE is an integral type, return an equivalent type which is
9646 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9647 return TYPE itself. */
9650 signed_or_unsigned_type_for (int unsignedp, tree type)
9653 if (POINTER_TYPE_P (type))
9656 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9659 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9662 /* Returns unsigned variant of TYPE. */
9665 unsigned_type_for (tree type)
9667 return signed_or_unsigned_type_for (1, type);
9670 /* Returns signed variant of TYPE. */
9673 signed_type_for (tree type)
9675 return signed_or_unsigned_type_for (0, type);
9678 /* Returns the largest value obtainable by casting something in INNER type to
9682 upper_bound_in_type (tree outer, tree inner)
9684 unsigned HOST_WIDE_INT lo, hi;
9685 unsigned int det = 0;
9686 unsigned oprec = TYPE_PRECISION (outer);
9687 unsigned iprec = TYPE_PRECISION (inner);
9690 /* Compute a unique number for every combination. */
9691 det |= (oprec > iprec) ? 4 : 0;
9692 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9693 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9695 /* Determine the exponent to use. */
9700 /* oprec <= iprec, outer: signed, inner: don't care. */
9705 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9709 /* oprec > iprec, outer: signed, inner: signed. */
9713 /* oprec > iprec, outer: signed, inner: unsigned. */
9717 /* oprec > iprec, outer: unsigned, inner: signed. */
9721 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9728 /* Compute 2^^prec - 1. */
9729 if (prec <= HOST_BITS_PER_WIDE_INT)
9732 lo = ((~(unsigned HOST_WIDE_INT) 0)
9733 >> (HOST_BITS_PER_WIDE_INT - prec));
9737 hi = ((~(unsigned HOST_WIDE_INT) 0)
9738 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9739 lo = ~(unsigned HOST_WIDE_INT) 0;
9742 return build_int_cst_wide (outer, lo, hi);
9745 /* Returns the smallest value obtainable by casting something in INNER type to
9749 lower_bound_in_type (tree outer, tree inner)
9751 unsigned HOST_WIDE_INT lo, hi;
9752 unsigned oprec = TYPE_PRECISION (outer);
9753 unsigned iprec = TYPE_PRECISION (inner);
9755 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9757 if (TYPE_UNSIGNED (outer)
9758 /* If we are widening something of an unsigned type, OUTER type
9759 contains all values of INNER type. In particular, both INNER
9760 and OUTER types have zero in common. */
9761 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9765 /* If we are widening a signed type to another signed type, we
9766 want to obtain -2^^(iprec-1). If we are keeping the
9767 precision or narrowing to a signed type, we want to obtain
9769 unsigned prec = oprec > iprec ? iprec : oprec;
9771 if (prec <= HOST_BITS_PER_WIDE_INT)
9773 hi = ~(unsigned HOST_WIDE_INT) 0;
9774 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9778 hi = ((~(unsigned HOST_WIDE_INT) 0)
9779 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9784 return build_int_cst_wide (outer, lo, hi);
9787 /* Return nonzero if two operands that are suitable for PHI nodes are
9788 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9789 SSA_NAME or invariant. Note that this is strictly an optimization.
9790 That is, callers of this function can directly call operand_equal_p
9791 and get the same result, only slower. */
9794 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9798 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9800 return operand_equal_p (arg0, arg1, 0);
9803 /* Returns number of zeros at the end of binary representation of X.
9805 ??? Use ffs if available? */
9808 num_ending_zeros (const_tree x)
9810 unsigned HOST_WIDE_INT fr, nfr;
9811 unsigned num, abits;
9812 tree type = TREE_TYPE (x);
9814 if (TREE_INT_CST_LOW (x) == 0)
9816 num = HOST_BITS_PER_WIDE_INT;
9817 fr = TREE_INT_CST_HIGH (x);
9822 fr = TREE_INT_CST_LOW (x);
9825 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9828 if (nfr << abits == fr)
9835 if (num > TYPE_PRECISION (type))
9836 num = TYPE_PRECISION (type);
9838 return build_int_cst_type (type, num);
9842 #define WALK_SUBTREE(NODE) \
9845 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9851 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9852 be walked whenever a type is seen in the tree. Rest of operands and return
9853 value are as for walk_tree. */
9856 walk_type_fields (tree type, walk_tree_fn func, void *data,
9857 struct pointer_set_t *pset, walk_tree_lh lh)
9859 tree result = NULL_TREE;
9861 switch (TREE_CODE (type))
9864 case REFERENCE_TYPE:
9865 /* We have to worry about mutually recursive pointers. These can't
9866 be written in C. They can in Ada. It's pathological, but
9867 there's an ACATS test (c38102a) that checks it. Deal with this
9868 by checking if we're pointing to another pointer, that one
9869 points to another pointer, that one does too, and we have no htab.
9870 If so, get a hash table. We check three levels deep to avoid
9871 the cost of the hash table if we don't need one. */
9872 if (POINTER_TYPE_P (TREE_TYPE (type))
9873 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9874 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9877 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9885 /* ... fall through ... */
9888 WALK_SUBTREE (TREE_TYPE (type));
9892 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9897 WALK_SUBTREE (TREE_TYPE (type));
9901 /* We never want to walk into default arguments. */
9902 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9903 WALK_SUBTREE (TREE_VALUE (arg));
9908 /* Don't follow this nodes's type if a pointer for fear that
9909 we'll have infinite recursion. If we have a PSET, then we
9912 || (!POINTER_TYPE_P (TREE_TYPE (type))
9913 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9914 WALK_SUBTREE (TREE_TYPE (type));
9915 WALK_SUBTREE (TYPE_DOMAIN (type));
9919 WALK_SUBTREE (TREE_TYPE (type));
9920 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9930 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9931 called with the DATA and the address of each sub-tree. If FUNC returns a
9932 non-NULL value, the traversal is stopped, and the value returned by FUNC
9933 is returned. If PSET is non-NULL it is used to record the nodes visited,
9934 and to avoid visiting a node more than once. */
9937 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
9938 struct pointer_set_t *pset, walk_tree_lh lh)
9940 enum tree_code code;
9944 #define WALK_SUBTREE_TAIL(NODE) \
9948 goto tail_recurse; \
9953 /* Skip empty subtrees. */
9957 /* Don't walk the same tree twice, if the user has requested
9958 that we avoid doing so. */
9959 if (pset && pointer_set_insert (pset, *tp))
9962 /* Call the function. */
9964 result = (*func) (tp, &walk_subtrees, data);
9966 /* If we found something, return it. */
9970 code = TREE_CODE (*tp);
9972 /* Even if we didn't, FUNC may have decided that there was nothing
9973 interesting below this point in the tree. */
9976 /* But we still need to check our siblings. */
9977 if (code == TREE_LIST)
9978 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
9979 else if (code == OMP_CLAUSE)
9980 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9987 result = (*lh) (tp, &walk_subtrees, func, data, pset);
9988 if (result || !walk_subtrees)
9995 case IDENTIFIER_NODE:
10002 case PLACEHOLDER_EXPR:
10006 /* None of these have subtrees other than those already walked
10011 WALK_SUBTREE (TREE_VALUE (*tp));
10012 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10017 int len = TREE_VEC_LENGTH (*tp);
10022 /* Walk all elements but the first. */
10024 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10026 /* Now walk the first one as a tail call. */
10027 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10031 WALK_SUBTREE (TREE_REALPART (*tp));
10032 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10036 unsigned HOST_WIDE_INT idx;
10037 constructor_elt *ce;
10040 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10042 WALK_SUBTREE (ce->value);
10047 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10052 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
10054 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10055 into declarations that are just mentioned, rather than
10056 declared; they don't really belong to this part of the tree.
10057 And, we can see cycles: the initializer for a declaration
10058 can refer to the declaration itself. */
10059 WALK_SUBTREE (DECL_INITIAL (decl));
10060 WALK_SUBTREE (DECL_SIZE (decl));
10061 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10063 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10066 case STATEMENT_LIST:
10068 tree_stmt_iterator i;
10069 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10070 WALK_SUBTREE (*tsi_stmt_ptr (i));
10075 switch (OMP_CLAUSE_CODE (*tp))
10077 case OMP_CLAUSE_PRIVATE:
10078 case OMP_CLAUSE_SHARED:
10079 case OMP_CLAUSE_FIRSTPRIVATE:
10080 case OMP_CLAUSE_COPYIN:
10081 case OMP_CLAUSE_COPYPRIVATE:
10082 case OMP_CLAUSE_IF:
10083 case OMP_CLAUSE_NUM_THREADS:
10084 case OMP_CLAUSE_SCHEDULE:
10085 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10088 case OMP_CLAUSE_NOWAIT:
10089 case OMP_CLAUSE_ORDERED:
10090 case OMP_CLAUSE_DEFAULT:
10091 case OMP_CLAUSE_UNTIED:
10092 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10094 case OMP_CLAUSE_LASTPRIVATE:
10095 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10096 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10097 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10099 case OMP_CLAUSE_COLLAPSE:
10102 for (i = 0; i < 3; i++)
10103 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10104 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10107 case OMP_CLAUSE_REDUCTION:
10110 for (i = 0; i < 4; i++)
10111 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10112 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10116 gcc_unreachable ();
10124 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10125 But, we only want to walk once. */
10126 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10127 for (i = 0; i < len; ++i)
10128 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10129 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10133 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10134 defining. We only want to walk into these fields of a type in this
10135 case and not in the general case of a mere reference to the type.
10137 The criterion is as follows: if the field can be an expression, it
10138 must be walked only here. This should be in keeping with the fields
10139 that are directly gimplified in gimplify_type_sizes in order for the
10140 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10141 variable-sized types.
10143 Note that DECLs get walked as part of processing the BIND_EXPR. */
10144 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10146 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10147 if (TREE_CODE (*type_p) == ERROR_MARK)
10150 /* Call the function for the type. See if it returns anything or
10151 doesn't want us to continue. If we are to continue, walk both
10152 the normal fields and those for the declaration case. */
10153 result = (*func) (type_p, &walk_subtrees, data);
10154 if (result || !walk_subtrees)
10157 result = walk_type_fields (*type_p, func, data, pset, lh);
10161 /* If this is a record type, also walk the fields. */
10162 if (RECORD_OR_UNION_TYPE_P (*type_p))
10166 for (field = TYPE_FIELDS (*type_p); field;
10167 field = TREE_CHAIN (field))
10169 /* We'd like to look at the type of the field, but we can
10170 easily get infinite recursion. So assume it's pointed
10171 to elsewhere in the tree. Also, ignore things that
10173 if (TREE_CODE (field) != FIELD_DECL)
10176 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10177 WALK_SUBTREE (DECL_SIZE (field));
10178 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10179 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10180 WALK_SUBTREE (DECL_QUALIFIER (field));
10184 /* Same for scalar types. */
10185 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10186 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10187 || TREE_CODE (*type_p) == INTEGER_TYPE
10188 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10189 || TREE_CODE (*type_p) == REAL_TYPE)
10191 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10192 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10195 WALK_SUBTREE (TYPE_SIZE (*type_p));
10196 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10201 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10205 /* Walk over all the sub-trees of this operand. */
10206 len = TREE_OPERAND_LENGTH (*tp);
10208 /* Go through the subtrees. We need to do this in forward order so
10209 that the scope of a FOR_EXPR is handled properly. */
10212 for (i = 0; i < len - 1; ++i)
10213 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10214 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10217 /* If this is a type, walk the needed fields in the type. */
10218 else if (TYPE_P (*tp))
10219 return walk_type_fields (*tp, func, data, pset, lh);
10223 /* We didn't find what we were looking for. */
10226 #undef WALK_SUBTREE_TAIL
10228 #undef WALK_SUBTREE
10230 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10233 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10237 struct pointer_set_t *pset;
10239 pset = pointer_set_create ();
10240 result = walk_tree_1 (tp, func, data, pset, lh);
10241 pointer_set_destroy (pset);
10247 tree_block (tree t)
10249 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10251 if (IS_EXPR_CODE_CLASS (c))
10252 return &t->exp.block;
10253 gcc_unreachable ();
10257 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10258 FIXME: don't use this function. It exists for compatibility with
10259 the old representation of CALL_EXPRs where a list was used to hold the
10260 arguments. Places that currently extract the arglist from a CALL_EXPR
10261 ought to be rewritten to use the CALL_EXPR itself. */
10263 call_expr_arglist (tree exp)
10265 tree arglist = NULL_TREE;
10267 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10268 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10273 /* Create a nameless artificial label and put it in the current
10274 function context. The label has a location of LOC. Returns the
10275 newly created label. */
10278 create_artificial_label (location_t loc)
10280 tree lab = build_decl (loc,
10281 LABEL_DECL, NULL_TREE, void_type_node);
10283 DECL_ARTIFICIAL (lab) = 1;
10284 DECL_IGNORED_P (lab) = 1;
10285 DECL_CONTEXT (lab) = current_function_decl;
10289 /* Given a tree, try to return a useful variable name that we can use
10290 to prefix a temporary that is being assigned the value of the tree.
10291 I.E. given <temp> = &A, return A. */
10296 tree stripped_decl;
10299 STRIP_NOPS (stripped_decl);
10300 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10301 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10304 switch (TREE_CODE (stripped_decl))
10307 return get_name (TREE_OPERAND (stripped_decl, 0));
10314 /* Return true if TYPE has a variable argument list. */
10317 stdarg_p (tree fntype)
10319 function_args_iterator args_iter;
10320 tree n = NULL_TREE, t;
10325 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10330 return n != NULL_TREE && n != void_type_node;
10333 /* Return true if TYPE has a prototype. */
10336 prototype_p (tree fntype)
10340 gcc_assert (fntype != NULL_TREE);
10342 t = TYPE_ARG_TYPES (fntype);
10343 return (t != NULL_TREE);
10346 /* If BLOCK is inlined from an __attribute__((__artificial__))
10347 routine, return pointer to location from where it has been
10350 block_nonartificial_location (tree block)
10352 location_t *ret = NULL;
10354 while (block && TREE_CODE (block) == BLOCK
10355 && BLOCK_ABSTRACT_ORIGIN (block))
10357 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10359 while (TREE_CODE (ao) == BLOCK
10360 && BLOCK_ABSTRACT_ORIGIN (ao)
10361 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10362 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10364 if (TREE_CODE (ao) == FUNCTION_DECL)
10366 /* If AO is an artificial inline, point RET to the
10367 call site locus at which it has been inlined and continue
10368 the loop, in case AO's caller is also an artificial
10370 if (DECL_DECLARED_INLINE_P (ao)
10371 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10372 ret = &BLOCK_SOURCE_LOCATION (block);
10376 else if (TREE_CODE (ao) != BLOCK)
10379 block = BLOCK_SUPERCONTEXT (block);
10385 /* If EXP is inlined from an __attribute__((__artificial__))
10386 function, return the location of the original call expression. */
10389 tree_nonartificial_location (tree exp)
10391 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10396 return EXPR_LOCATION (exp);
10400 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10403 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10406 cl_option_hash_hash (const void *x)
10408 const_tree const t = (const_tree) x;
10412 hashval_t hash = 0;
10414 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10416 p = (const char *)TREE_OPTIMIZATION (t);
10417 len = sizeof (struct cl_optimization);
10420 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10422 p = (const char *)TREE_TARGET_OPTION (t);
10423 len = sizeof (struct cl_target_option);
10427 gcc_unreachable ();
10429 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10431 for (i = 0; i < len; i++)
10433 hash = (hash << 4) ^ ((i << 2) | p[i]);
10438 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10439 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10443 cl_option_hash_eq (const void *x, const void *y)
10445 const_tree const xt = (const_tree) x;
10446 const_tree const yt = (const_tree) y;
10451 if (TREE_CODE (xt) != TREE_CODE (yt))
10454 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10456 xp = (const char *)TREE_OPTIMIZATION (xt);
10457 yp = (const char *)TREE_OPTIMIZATION (yt);
10458 len = sizeof (struct cl_optimization);
10461 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10463 xp = (const char *)TREE_TARGET_OPTION (xt);
10464 yp = (const char *)TREE_TARGET_OPTION (yt);
10465 len = sizeof (struct cl_target_option);
10469 gcc_unreachable ();
10471 return (memcmp (xp, yp, len) == 0);
10474 /* Build an OPTIMIZATION_NODE based on the current options. */
10477 build_optimization_node (void)
10482 /* Use the cache of optimization nodes. */
10484 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10486 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10490 /* Insert this one into the hash table. */
10491 t = cl_optimization_node;
10494 /* Make a new node for next time round. */
10495 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10501 /* Build a TARGET_OPTION_NODE based on the current options. */
10504 build_target_option_node (void)
10509 /* Use the cache of optimization nodes. */
10511 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10513 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10517 /* Insert this one into the hash table. */
10518 t = cl_target_option_node;
10521 /* Make a new node for next time round. */
10522 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10528 /* Determine the "ultimate origin" of a block. The block may be an inlined
10529 instance of an inlined instance of a block which is local to an inline
10530 function, so we have to trace all of the way back through the origin chain
10531 to find out what sort of node actually served as the original seed for the
10535 block_ultimate_origin (const_tree block)
10537 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10539 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10540 nodes in the function to point to themselves; ignore that if
10541 we're trying to output the abstract instance of this function. */
10542 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10545 if (immediate_origin == NULL_TREE)
10550 tree lookahead = immediate_origin;
10554 ret_val = lookahead;
10555 lookahead = (TREE_CODE (ret_val) == BLOCK
10556 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10558 while (lookahead != NULL && lookahead != ret_val);
10560 /* The block's abstract origin chain may not be the *ultimate* origin of
10561 the block. It could lead to a DECL that has an abstract origin set.
10562 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10563 will give us if it has one). Note that DECL's abstract origins are
10564 supposed to be the most distant ancestor (or so decl_ultimate_origin
10565 claims), so we don't need to loop following the DECL origins. */
10566 if (DECL_P (ret_val))
10567 return DECL_ORIGIN (ret_val);
10573 /* Return true if T1 and T2 are equivalent lists. */
10576 list_equal_p (const_tree t1, const_tree t2)
10578 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10579 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10584 /* Return true iff conversion in EXP generates no instruction. Mark
10585 it inline so that we fully inline into the stripping functions even
10586 though we have two uses of this function. */
10589 tree_nop_conversion (const_tree exp)
10591 tree outer_type, inner_type;
10593 if (!CONVERT_EXPR_P (exp)
10594 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10596 if (TREE_OPERAND (exp, 0) == error_mark_node)
10599 outer_type = TREE_TYPE (exp);
10600 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10602 /* Use precision rather then machine mode when we can, which gives
10603 the correct answer even for submode (bit-field) types. */
10604 if ((INTEGRAL_TYPE_P (outer_type)
10605 || POINTER_TYPE_P (outer_type)
10606 || TREE_CODE (outer_type) == OFFSET_TYPE)
10607 && (INTEGRAL_TYPE_P (inner_type)
10608 || POINTER_TYPE_P (inner_type)
10609 || TREE_CODE (inner_type) == OFFSET_TYPE))
10610 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10612 /* Otherwise fall back on comparing machine modes (e.g. for
10613 aggregate types, floats). */
10614 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10617 /* Return true iff conversion in EXP generates no instruction. Don't
10618 consider conversions changing the signedness. */
10621 tree_sign_nop_conversion (const_tree exp)
10623 tree outer_type, inner_type;
10625 if (!tree_nop_conversion (exp))
10628 outer_type = TREE_TYPE (exp);
10629 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10631 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10632 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10635 /* Strip conversions from EXP according to tree_nop_conversion and
10636 return the resulting expression. */
10639 tree_strip_nop_conversions (tree exp)
10641 while (tree_nop_conversion (exp))
10642 exp = TREE_OPERAND (exp, 0);
10646 /* Strip conversions from EXP according to tree_sign_nop_conversion
10647 and return the resulting expression. */
10650 tree_strip_sign_nop_conversions (tree exp)
10652 while (tree_sign_nop_conversion (exp))
10653 exp = TREE_OPERAND (exp, 0);
10657 static GTY(()) tree gcc_eh_personality_decl;
10659 /* Return the GCC personality function decl. */
10662 lhd_gcc_personality (void)
10664 if (!gcc_eh_personality_decl)
10665 gcc_eh_personality_decl
10666 = build_personality_function (USING_SJLJ_EXCEPTIONS
10667 ? "__gcc_personality_sj0"
10668 : "__gcc_personality_v0");
10670 return gcc_eh_personality_decl;
10673 #include "gt-tree.h"