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, 2010
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"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack *h, void *obj);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts[(int) all_kinds];
127 int tree_node_sizes[(int) all_kinds];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid = 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash {
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
179 htab_t type_hash_table;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
184 htab_t int_cst_hash_table;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node;
192 static GTY (()) tree cl_target_option_node;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
194 htab_t cl_option_hash_table;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
200 htab_t debug_expr_for_decl;
202 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map)))
203 htab_t value_expr_for_decl;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map)))
207 htab_t init_priority_for_decl;
209 static void set_type_quals (tree, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t type_hash_hash (const void *);
212 static hashval_t int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree, hashval_t);
221 static unsigned int attribute_hash_list (const_tree, hashval_t);
223 tree global_trees[TI_MAX];
224 tree integer_types[itk_none];
226 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0 /* OMP_CLAUSE_UNTIED */
249 const char * const omp_clause_code_name[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code)
275 switch (TREE_CODE_CLASS (code))
277 case tcc_declaration:
282 return TS_FIELD_DECL;
288 return TS_LABEL_DECL;
290 return TS_RESULT_DECL;
291 case DEBUG_EXPR_DECL:
294 return TS_CONST_DECL;
298 return TS_FUNCTION_DECL;
300 return TS_DECL_NON_COMMON;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST: return TS_INT_CST;
320 case REAL_CST: return TS_REAL_CST;
321 case FIXED_CST: return TS_FIXED_CST;
322 case COMPLEX_CST: return TS_COMPLEX;
323 case VECTOR_CST: return TS_VECTOR;
324 case STRING_CST: return TS_STRING;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK: return TS_COMMON;
327 case IDENTIFIER_NODE: return TS_IDENTIFIER;
328 case TREE_LIST: return TS_LIST;
329 case TREE_VEC: return TS_VEC;
330 case SSA_NAME: return TS_SSA_NAME;
331 case PLACEHOLDER_EXPR: return TS_COMMON;
332 case STATEMENT_LIST: return TS_STATEMENT_LIST;
333 case BLOCK: return TS_BLOCK;
334 case CONSTRUCTOR: return TS_CONSTRUCTOR;
335 case TREE_BINFO: return TS_BINFO;
336 case OMP_CLAUSE: return TS_OMP_CLAUSE;
337 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
338 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
398 enum tree_node_structure_enum ts_code;
400 code = (enum tree_code) i;
401 ts_code = tree_node_structure_for_code (code);
403 /* Mark the TS structure itself. */
404 tree_contains_struct[code][ts_code] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL:
428 case TS_STATEMENT_LIST:
431 case TS_OPTIMIZATION:
432 case TS_TARGET_OPTION:
433 MARK_TS_COMMON (code);
437 MARK_TS_DECL_MINIMAL (code);
441 MARK_TS_DECL_COMMON (code);
444 case TS_DECL_NON_COMMON:
445 MARK_TS_DECL_WITH_VIS (code);
448 case TS_DECL_WITH_VIS:
453 MARK_TS_DECL_WRTL (code);
457 MARK_TS_DECL_COMMON (code);
461 MARK_TS_DECL_WITH_VIS (code);
465 case TS_FUNCTION_DECL:
466 MARK_TS_DECL_NON_COMMON (code);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
476 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
478 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
482 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
483 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
484 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
485 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
486 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
492 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
493 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
500 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
502 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
503 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
504 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
505 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
506 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
507 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
508 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
509 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
510 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
511 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
512 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
513 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
514 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
515 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
536 debug_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
537 tree_decl_map_eq, 0);
539 value_expr_for_decl = htab_create_ggc (512, tree_decl_map_hash,
540 tree_decl_map_eq, 0);
541 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
542 tree_priority_map_eq, 0);
544 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
545 int_cst_hash_eq, NULL);
547 int_cst_node = make_node (INTEGER_CST);
549 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
550 cl_option_hash_eq, NULL);
552 cl_optimization_node = make_node (OPTIMIZATION_NODE);
553 cl_target_option_node = make_node (TARGET_OPTION_NODE);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
568 lang_hooks.set_decl_assembler_name (decl);
569 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl, const_tree asmname)
577 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
578 const char *decl_str;
579 const char *asmname_str;
582 if (decl_asmname == asmname)
585 decl_str = IDENTIFIER_POINTER (decl_asmname);
586 asmname_str = IDENTIFIER_POINTER (asmname);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str[0] == '*')
597 size_t ulp_len = strlen (user_label_prefix);
603 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
604 decl_str += ulp_len, test=true;
608 if (asmname_str[0] == '*')
610 size_t ulp_len = strlen (user_label_prefix);
616 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
617 asmname_str += ulp_len, test=true;
624 return strcmp (decl_str, asmname_str) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname)
632 if (IDENTIFIER_POINTER (asmname)[0] == '*')
634 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
635 size_t ulp_len = strlen (user_label_prefix);
639 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
642 return htab_hash_string (decl_str);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code)
654 switch (TREE_CODE_CLASS (code))
656 case tcc_declaration: /* A decl node */
661 return sizeof (struct tree_field_decl);
663 return sizeof (struct tree_parm_decl);
665 return sizeof (struct tree_var_decl);
667 return sizeof (struct tree_label_decl);
669 return sizeof (struct tree_result_decl);
671 return sizeof (struct tree_const_decl);
673 return sizeof (struct tree_type_decl);
675 return sizeof (struct tree_function_decl);
676 case DEBUG_EXPR_DECL:
677 return sizeof (struct tree_decl_with_rtl);
679 return sizeof (struct tree_decl_non_common);
683 case tcc_type: /* a type node */
684 return sizeof (struct tree_type);
686 case tcc_reference: /* a reference */
687 case tcc_expression: /* an expression */
688 case tcc_statement: /* an expression with side effects */
689 case tcc_comparison: /* a comparison expression */
690 case tcc_unary: /* a unary arithmetic expression */
691 case tcc_binary: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp)
693 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
695 case tcc_constant: /* a constant */
698 case INTEGER_CST: return sizeof (struct tree_int_cst);
699 case REAL_CST: return sizeof (struct tree_real_cst);
700 case FIXED_CST: return sizeof (struct tree_fixed_cst);
701 case COMPLEX_CST: return sizeof (struct tree_complex);
702 case VECTOR_CST: return sizeof (struct tree_vector);
703 case STRING_CST: gcc_unreachable ();
705 return lang_hooks.tree_size (code);
708 case tcc_exceptional: /* something random, like an identifier. */
711 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
712 case TREE_LIST: return sizeof (struct tree_list);
715 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
718 case OMP_CLAUSE: gcc_unreachable ();
720 case SSA_NAME: return sizeof (struct tree_ssa_name);
722 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
723 case BLOCK: return sizeof (struct tree_block);
724 case CONSTRUCTOR: return sizeof (struct tree_constructor);
725 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
726 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
729 return lang_hooks.tree_size (code);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node)
742 const enum tree_code code = TREE_CODE (node);
746 return (offsetof (struct tree_binfo, base_binfos)
747 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
750 return (sizeof (struct tree_vec)
751 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
754 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
757 return (sizeof (struct tree_omp_clause)
758 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
762 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
763 return (sizeof (struct tree_exp)
764 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
766 return tree_code_size (code);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL)
781 enum tree_code_class type = TREE_CODE_CLASS (code);
782 size_t length = tree_code_size (code);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration: /* A decl node */
792 case tcc_type: /* a type node */
796 case tcc_statement: /* an expression with side effects */
800 case tcc_reference: /* a reference */
804 case tcc_expression: /* an expression */
805 case tcc_comparison: /* a comparison expression */
806 case tcc_unary: /* a unary arithmetic expression */
807 case tcc_binary: /* a binary arithmetic expression */
811 case tcc_constant: /* a constant */
815 case tcc_exceptional: /* something random, like an identifier. */
818 case IDENTIFIER_NODE:
831 kind = ssa_name_kind;
852 tree_node_counts[(int) kind]++;
853 tree_node_sizes[(int) kind] += length;
856 t = ggc_alloc_zone_cleared_tree_node_stat (
857 (code == IDENTIFIER_NODE) ? &tree_id_zone : &tree_zone,
858 length PASS_MEM_STAT);
859 TREE_SET_CODE (t, code);
864 TREE_SIDE_EFFECTS (t) = 1;
867 case tcc_declaration:
868 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
870 if (code == FUNCTION_DECL)
872 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
873 DECL_MODE (t) = FUNCTION_MODE;
878 DECL_SOURCE_LOCATION (t) = input_location;
879 if (TREE_CODE (t) == DEBUG_EXPR_DECL)
880 DECL_UID (t) = --next_debug_decl_uid;
883 DECL_UID (t) = next_decl_uid++;
884 SET_DECL_PT_UID (t, -1);
886 if (TREE_CODE (t) == LABEL_DECL)
887 LABEL_DECL_UID (t) = -1;
892 TYPE_UID (t) = next_type_uid++;
893 TYPE_ALIGN (t) = BITS_PER_UNIT;
894 TYPE_USER_ALIGN (t) = 0;
895 TYPE_MAIN_VARIANT (t) = t;
896 TYPE_CANONICAL (t) = t;
898 /* Default to no attributes for type, but let target change that. */
899 TYPE_ATTRIBUTES (t) = NULL_TREE;
900 targetm.set_default_type_attributes (t);
902 /* We have not yet computed the alias set for this type. */
903 TYPE_ALIAS_SET (t) = -1;
907 TREE_CONSTANT (t) = 1;
916 case PREDECREMENT_EXPR:
917 case PREINCREMENT_EXPR:
918 case POSTDECREMENT_EXPR:
919 case POSTINCREMENT_EXPR:
920 /* All of these have side-effects, no matter what their
922 TREE_SIDE_EFFECTS (t) = 1;
931 /* Other classes need no special treatment. */
938 /* Return a new node with the same contents as NODE except that its
939 TREE_CHAIN is zero and it has a fresh uid. */
942 copy_node_stat (tree node MEM_STAT_DECL)
945 enum tree_code code = TREE_CODE (node);
948 gcc_assert (code != STATEMENT_LIST);
950 length = tree_size (node);
951 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
952 memcpy (t, node, length);
955 TREE_ASM_WRITTEN (t) = 0;
956 TREE_VISITED (t) = 0;
957 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
958 *DECL_VAR_ANN_PTR (t) = 0;
960 if (TREE_CODE_CLASS (code) == tcc_declaration)
962 if (code == DEBUG_EXPR_DECL)
963 DECL_UID (t) = --next_debug_decl_uid;
966 DECL_UID (t) = next_decl_uid++;
967 if (DECL_PT_UID_SET_P (node))
968 SET_DECL_PT_UID (t, DECL_PT_UID (node));
970 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
971 && DECL_HAS_VALUE_EXPR_P (node))
973 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
974 DECL_HAS_VALUE_EXPR_P (t) = 1;
976 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
978 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
979 DECL_HAS_INIT_PRIORITY_P (t) = 1;
982 else if (TREE_CODE_CLASS (code) == tcc_type)
984 TYPE_UID (t) = next_type_uid++;
985 /* The following is so that the debug code for
986 the copy is different from the original type.
987 The two statements usually duplicate each other
988 (because they clear fields of the same union),
989 but the optimizer should catch that. */
990 TYPE_SYMTAB_POINTER (t) = 0;
991 TYPE_SYMTAB_ADDRESS (t) = 0;
993 /* Do not copy the values cache. */
994 if (TYPE_CACHED_VALUES_P(t))
996 TYPE_CACHED_VALUES_P (t) = 0;
997 TYPE_CACHED_VALUES (t) = NULL_TREE;
1004 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1005 For example, this can copy a list made of TREE_LIST nodes. */
1008 copy_list (tree list)
1016 head = prev = copy_node (list);
1017 next = TREE_CHAIN (list);
1020 TREE_CHAIN (prev) = copy_node (next);
1021 prev = TREE_CHAIN (prev);
1022 next = TREE_CHAIN (next);
1028 /* Create an INT_CST node with a LOW value sign extended. */
1031 build_int_cst (tree type, HOST_WIDE_INT low)
1033 /* Support legacy code. */
1035 type = integer_type_node;
1037 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1040 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1041 if it is negative. This function is similar to build_int_cst, but
1042 the extra bits outside of the type precision are cleared. Constants
1043 with these extra bits may confuse the fold so that it detects overflows
1044 even in cases when they do not occur, and in general should be avoided.
1045 We cannot however make this a default behavior of build_int_cst without
1046 more intrusive changes, since there are parts of gcc that rely on the extra
1047 precision of the integer constants. */
1050 build_int_cst_type (tree type, HOST_WIDE_INT low)
1054 return double_int_to_tree (type, shwi_to_double_int (low));
1057 /* Constructs tree in type TYPE from with value given by CST. Signedness
1058 of CST is assumed to be the same as the signedness of TYPE. */
1061 double_int_to_tree (tree type, double_int cst)
1063 /* Size types *are* sign extended. */
1064 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1065 || (TREE_CODE (type) == INTEGER_TYPE
1066 && TYPE_IS_SIZETYPE (type)));
1068 cst = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1070 return build_int_cst_wide (type, cst.low, cst.high);
1073 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1074 to be the same as the signedness of TYPE. */
1077 double_int_fits_to_tree_p (const_tree type, double_int cst)
1079 /* Size types *are* sign extended. */
1080 bool sign_extended_type = (!TYPE_UNSIGNED (type)
1081 || (TREE_CODE (type) == INTEGER_TYPE
1082 && TYPE_IS_SIZETYPE (type)));
1085 = double_int_ext (cst, TYPE_PRECISION (type), !sign_extended_type);
1087 return double_int_equal_p (cst, ext);
1090 /* We force the double_int CST to the range of the type TYPE by sign or
1091 zero extending it. OVERFLOWABLE indicates if we are interested in
1092 overflow of the value, when >0 we are only interested in signed
1093 overflow, for <0 we are interested in any overflow. OVERFLOWED
1094 indicates whether overflow has already occurred. CONST_OVERFLOWED
1095 indicates whether constant overflow has already occurred. We force
1096 T's value to be within range of T's type (by setting to 0 or 1 all
1097 the bits outside the type's range). We set TREE_OVERFLOWED if,
1098 OVERFLOWED is nonzero,
1099 or OVERFLOWABLE is >0 and signed overflow occurs
1100 or OVERFLOWABLE is <0 and any overflow occurs
1101 We return a new tree node for the extended double_int. The node
1102 is shared if no overflow flags are set. */
1106 force_fit_type_double (tree type, double_int cst, int overflowable,
1109 bool sign_extended_type;
1111 /* Size types *are* sign extended. */
1112 sign_extended_type = (!TYPE_UNSIGNED (type)
1113 || (TREE_CODE (type) == INTEGER_TYPE
1114 && TYPE_IS_SIZETYPE (type)));
1116 /* If we need to set overflow flags, return a new unshared node. */
1117 if (overflowed || !double_int_fits_to_tree_p(type, cst))
1121 || (overflowable > 0 && sign_extended_type))
1123 tree t = make_node (INTEGER_CST);
1124 TREE_INT_CST (t) = double_int_ext (cst, TYPE_PRECISION (type),
1125 !sign_extended_type);
1126 TREE_TYPE (t) = type;
1127 TREE_OVERFLOW (t) = 1;
1132 /* Else build a shared node. */
1133 return double_int_to_tree (type, cst);
1136 /* These are the hash table functions for the hash table of INTEGER_CST
1137 nodes of a sizetype. */
1139 /* Return the hash code code X, an INTEGER_CST. */
1142 int_cst_hash_hash (const void *x)
1144 const_tree const t = (const_tree) x;
1146 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1147 ^ htab_hash_pointer (TREE_TYPE (t)));
1150 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1151 is the same as that given by *Y, which is the same. */
1154 int_cst_hash_eq (const void *x, const void *y)
1156 const_tree const xt = (const_tree) x;
1157 const_tree const yt = (const_tree) y;
1159 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1160 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1161 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1164 /* Create an INT_CST node of TYPE and value HI:LOW.
1165 The returned node is always shared. For small integers we use a
1166 per-type vector cache, for larger ones we use a single hash table. */
1169 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1177 switch (TREE_CODE (type))
1180 case REFERENCE_TYPE:
1181 /* Cache NULL pointer. */
1190 /* Cache false or true. */
1198 if (TYPE_UNSIGNED (type))
1201 limit = INTEGER_SHARE_LIMIT;
1202 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1208 limit = INTEGER_SHARE_LIMIT + 1;
1209 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1211 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1225 /* Look for it in the type's vector of small shared ints. */
1226 if (!TYPE_CACHED_VALUES_P (type))
1228 TYPE_CACHED_VALUES_P (type) = 1;
1229 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1232 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1235 /* Make sure no one is clobbering the shared constant. */
1236 gcc_assert (TREE_TYPE (t) == type);
1237 gcc_assert (TREE_INT_CST_LOW (t) == low);
1238 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1242 /* Create a new shared int. */
1243 t = make_node (INTEGER_CST);
1245 TREE_INT_CST_LOW (t) = low;
1246 TREE_INT_CST_HIGH (t) = hi;
1247 TREE_TYPE (t) = type;
1249 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1254 /* Use the cache of larger shared ints. */
1257 TREE_INT_CST_LOW (int_cst_node) = low;
1258 TREE_INT_CST_HIGH (int_cst_node) = hi;
1259 TREE_TYPE (int_cst_node) = type;
1261 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1265 /* Insert this one into the hash table. */
1268 /* Make a new node for next time round. */
1269 int_cst_node = make_node (INTEGER_CST);
1276 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1277 and the rest are zeros. */
1280 build_low_bits_mask (tree type, unsigned bits)
1284 gcc_assert (bits <= TYPE_PRECISION (type));
1286 if (bits == TYPE_PRECISION (type)
1287 && !TYPE_UNSIGNED (type))
1288 /* Sign extended all-ones mask. */
1289 mask = double_int_minus_one;
1291 mask = double_int_mask (bits);
1293 return build_int_cst_wide (type, mask.low, mask.high);
1296 /* Checks that X is integer constant that can be expressed in (unsigned)
1297 HOST_WIDE_INT without loss of precision. */
1300 cst_and_fits_in_hwi (const_tree x)
1302 if (TREE_CODE (x) != INTEGER_CST)
1305 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1308 return (TREE_INT_CST_HIGH (x) == 0
1309 || TREE_INT_CST_HIGH (x) == -1);
1312 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1313 are in a list pointed to by VALS. */
1316 build_vector (tree type, tree vals)
1318 tree v = make_node (VECTOR_CST);
1323 TREE_VECTOR_CST_ELTS (v) = vals;
1324 TREE_TYPE (v) = type;
1326 /* Iterate through elements and check for overflow. */
1327 for (link = vals; link; link = TREE_CHAIN (link))
1329 tree value = TREE_VALUE (link);
1332 /* Don't crash if we get an address constant. */
1333 if (!CONSTANT_CLASS_P (value))
1336 over |= TREE_OVERFLOW (value);
1339 gcc_assert (cnt == TYPE_VECTOR_SUBPARTS (type));
1341 TREE_OVERFLOW (v) = over;
1345 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1346 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1349 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1351 tree list = NULL_TREE;
1352 unsigned HOST_WIDE_INT idx;
1355 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1356 list = tree_cons (NULL_TREE, value, list);
1357 for (; idx < TYPE_VECTOR_SUBPARTS (type); ++idx)
1358 list = tree_cons (NULL_TREE,
1359 fold_convert (TREE_TYPE (type), integer_zero_node), list);
1360 return build_vector (type, nreverse (list));
1363 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1364 are in the VEC pointed to by VALS. */
1366 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1368 tree c = make_node (CONSTRUCTOR);
1370 constructor_elt *elt;
1371 bool constant_p = true;
1373 TREE_TYPE (c) = type;
1374 CONSTRUCTOR_ELTS (c) = vals;
1376 for (i = 0; VEC_iterate (constructor_elt, vals, i, elt); i++)
1377 if (!TREE_CONSTANT (elt->value))
1383 TREE_CONSTANT (c) = constant_p;
1388 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1391 build_constructor_single (tree type, tree index, tree value)
1393 VEC(constructor_elt,gc) *v;
1394 constructor_elt *elt;
1396 v = VEC_alloc (constructor_elt, gc, 1);
1397 elt = VEC_quick_push (constructor_elt, v, NULL);
1401 return build_constructor (type, v);
1405 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1406 are in a list pointed to by VALS. */
1408 build_constructor_from_list (tree type, tree vals)
1411 VEC(constructor_elt,gc) *v = NULL;
1415 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1416 for (t = vals; t; t = TREE_CHAIN (t))
1417 CONSTRUCTOR_APPEND_ELT (v, TREE_PURPOSE (t), TREE_VALUE (t));
1420 return build_constructor (type, v);
1423 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1426 build_fixed (tree type, FIXED_VALUE_TYPE f)
1429 FIXED_VALUE_TYPE *fp;
1431 v = make_node (FIXED_CST);
1432 fp = ggc_alloc_fixed_value ();
1433 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1435 TREE_TYPE (v) = type;
1436 TREE_FIXED_CST_PTR (v) = fp;
1440 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1443 build_real (tree type, REAL_VALUE_TYPE d)
1446 REAL_VALUE_TYPE *dp;
1449 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1450 Consider doing it via real_convert now. */
1452 v = make_node (REAL_CST);
1453 dp = ggc_alloc_real_value ();
1454 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1456 TREE_TYPE (v) = type;
1457 TREE_REAL_CST_PTR (v) = dp;
1458 TREE_OVERFLOW (v) = overflow;
1462 /* Return a new REAL_CST node whose type is TYPE
1463 and whose value is the integer value of the INTEGER_CST node I. */
1466 real_value_from_int_cst (const_tree type, const_tree i)
1470 /* Clear all bits of the real value type so that we can later do
1471 bitwise comparisons to see if two values are the same. */
1472 memset (&d, 0, sizeof d);
1474 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1475 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1476 TYPE_UNSIGNED (TREE_TYPE (i)));
1480 /* Given a tree representing an integer constant I, return a tree
1481 representing the same value as a floating-point constant of type TYPE. */
1484 build_real_from_int_cst (tree type, const_tree i)
1487 int overflow = TREE_OVERFLOW (i);
1489 v = build_real (type, real_value_from_int_cst (type, i));
1491 TREE_OVERFLOW (v) |= overflow;
1495 /* Return a newly constructed STRING_CST node whose value is
1496 the LEN characters at STR.
1497 The TREE_TYPE is not initialized. */
1500 build_string (int len, const char *str)
1505 /* Do not waste bytes provided by padding of struct tree_string. */
1506 length = len + offsetof (struct tree_string, str) + 1;
1508 #ifdef GATHER_STATISTICS
1509 tree_node_counts[(int) c_kind]++;
1510 tree_node_sizes[(int) c_kind] += length;
1513 s = ggc_alloc_tree_node (length);
1515 memset (s, 0, sizeof (struct tree_common));
1516 TREE_SET_CODE (s, STRING_CST);
1517 TREE_CONSTANT (s) = 1;
1518 TREE_STRING_LENGTH (s) = len;
1519 memcpy (s->string.str, str, len);
1520 s->string.str[len] = '\0';
1525 /* Return a newly constructed COMPLEX_CST node whose value is
1526 specified by the real and imaginary parts REAL and IMAG.
1527 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1528 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1531 build_complex (tree type, tree real, tree imag)
1533 tree t = make_node (COMPLEX_CST);
1535 TREE_REALPART (t) = real;
1536 TREE_IMAGPART (t) = imag;
1537 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1538 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1542 /* Return a constant of arithmetic type TYPE which is the
1543 multiplicative identity of the set TYPE. */
1546 build_one_cst (tree type)
1548 switch (TREE_CODE (type))
1550 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1551 case POINTER_TYPE: case REFERENCE_TYPE:
1553 return build_int_cst (type, 1);
1556 return build_real (type, dconst1);
1558 case FIXED_POINT_TYPE:
1559 /* We can only generate 1 for accum types. */
1560 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1561 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1568 scalar = build_one_cst (TREE_TYPE (type));
1570 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1572 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1573 cst = tree_cons (NULL_TREE, scalar, cst);
1575 return build_vector (type, cst);
1579 return build_complex (type,
1580 build_one_cst (TREE_TYPE (type)),
1581 fold_convert (TREE_TYPE (type), integer_zero_node));
1588 /* Build a BINFO with LEN language slots. */
1591 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1594 size_t length = (offsetof (struct tree_binfo, base_binfos)
1595 + VEC_embedded_size (tree, base_binfos));
1597 #ifdef GATHER_STATISTICS
1598 tree_node_counts[(int) binfo_kind]++;
1599 tree_node_sizes[(int) binfo_kind] += length;
1602 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1604 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1606 TREE_SET_CODE (t, TREE_BINFO);
1608 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1614 /* Build a newly constructed TREE_VEC node of length LEN. */
1617 make_tree_vec_stat (int len MEM_STAT_DECL)
1620 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1622 #ifdef GATHER_STATISTICS
1623 tree_node_counts[(int) vec_kind]++;
1624 tree_node_sizes[(int) vec_kind] += length;
1627 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
1629 TREE_SET_CODE (t, TREE_VEC);
1630 TREE_VEC_LENGTH (t) = len;
1635 /* Return 1 if EXPR is the integer constant zero or a complex constant
1639 integer_zerop (const_tree expr)
1643 return ((TREE_CODE (expr) == INTEGER_CST
1644 && TREE_INT_CST_LOW (expr) == 0
1645 && TREE_INT_CST_HIGH (expr) == 0)
1646 || (TREE_CODE (expr) == COMPLEX_CST
1647 && integer_zerop (TREE_REALPART (expr))
1648 && integer_zerop (TREE_IMAGPART (expr))));
1651 /* Return 1 if EXPR is the integer constant one or the corresponding
1652 complex constant. */
1655 integer_onep (const_tree expr)
1659 return ((TREE_CODE (expr) == INTEGER_CST
1660 && TREE_INT_CST_LOW (expr) == 1
1661 && TREE_INT_CST_HIGH (expr) == 0)
1662 || (TREE_CODE (expr) == COMPLEX_CST
1663 && integer_onep (TREE_REALPART (expr))
1664 && integer_zerop (TREE_IMAGPART (expr))));
1667 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1668 it contains. Likewise for the corresponding complex constant. */
1671 integer_all_onesp (const_tree expr)
1678 if (TREE_CODE (expr) == COMPLEX_CST
1679 && integer_all_onesp (TREE_REALPART (expr))
1680 && integer_zerop (TREE_IMAGPART (expr)))
1683 else if (TREE_CODE (expr) != INTEGER_CST)
1686 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1687 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1688 && TREE_INT_CST_HIGH (expr) == -1)
1693 /* Note that using TYPE_PRECISION here is wrong. We care about the
1694 actual bits, not the (arbitrary) range of the type. */
1695 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1696 if (prec >= HOST_BITS_PER_WIDE_INT)
1698 HOST_WIDE_INT high_value;
1701 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1703 /* Can not handle precisions greater than twice the host int size. */
1704 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1705 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1706 /* Shifting by the host word size is undefined according to the ANSI
1707 standard, so we must handle this as a special case. */
1710 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1712 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1713 && TREE_INT_CST_HIGH (expr) == high_value);
1716 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1719 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1723 integer_pow2p (const_tree expr)
1726 HOST_WIDE_INT high, low;
1730 if (TREE_CODE (expr) == COMPLEX_CST
1731 && integer_pow2p (TREE_REALPART (expr))
1732 && integer_zerop (TREE_IMAGPART (expr)))
1735 if (TREE_CODE (expr) != INTEGER_CST)
1738 prec = TYPE_PRECISION (TREE_TYPE (expr));
1739 high = TREE_INT_CST_HIGH (expr);
1740 low = TREE_INT_CST_LOW (expr);
1742 /* First clear all bits that are beyond the type's precision in case
1743 we've been sign extended. */
1745 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1747 else if (prec > HOST_BITS_PER_WIDE_INT)
1748 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1752 if (prec < HOST_BITS_PER_WIDE_INT)
1753 low &= ~((HOST_WIDE_INT) (-1) << prec);
1756 if (high == 0 && low == 0)
1759 return ((high == 0 && (low & (low - 1)) == 0)
1760 || (low == 0 && (high & (high - 1)) == 0));
1763 /* Return 1 if EXPR is an integer constant other than zero or a
1764 complex constant other than zero. */
1767 integer_nonzerop (const_tree expr)
1771 return ((TREE_CODE (expr) == INTEGER_CST
1772 && (TREE_INT_CST_LOW (expr) != 0
1773 || TREE_INT_CST_HIGH (expr) != 0))
1774 || (TREE_CODE (expr) == COMPLEX_CST
1775 && (integer_nonzerop (TREE_REALPART (expr))
1776 || integer_nonzerop (TREE_IMAGPART (expr)))));
1779 /* Return 1 if EXPR is the fixed-point constant zero. */
1782 fixed_zerop (const_tree expr)
1784 return (TREE_CODE (expr) == FIXED_CST
1785 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1788 /* Return the power of two represented by a tree node known to be a
1792 tree_log2 (const_tree expr)
1795 HOST_WIDE_INT high, low;
1799 if (TREE_CODE (expr) == COMPLEX_CST)
1800 return tree_log2 (TREE_REALPART (expr));
1802 prec = TYPE_PRECISION (TREE_TYPE (expr));
1803 high = TREE_INT_CST_HIGH (expr);
1804 low = TREE_INT_CST_LOW (expr);
1806 /* First clear all bits that are beyond the type's precision in case
1807 we've been sign extended. */
1809 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1811 else if (prec > HOST_BITS_PER_WIDE_INT)
1812 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1816 if (prec < HOST_BITS_PER_WIDE_INT)
1817 low &= ~((HOST_WIDE_INT) (-1) << prec);
1820 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1821 : exact_log2 (low));
1824 /* Similar, but return the largest integer Y such that 2 ** Y is less
1825 than or equal to EXPR. */
1828 tree_floor_log2 (const_tree expr)
1831 HOST_WIDE_INT high, low;
1835 if (TREE_CODE (expr) == COMPLEX_CST)
1836 return tree_log2 (TREE_REALPART (expr));
1838 prec = TYPE_PRECISION (TREE_TYPE (expr));
1839 high = TREE_INT_CST_HIGH (expr);
1840 low = TREE_INT_CST_LOW (expr);
1842 /* First clear all bits that are beyond the type's precision in case
1843 we've been sign extended. Ignore if type's precision hasn't been set
1844 since what we are doing is setting it. */
1846 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1848 else if (prec > HOST_BITS_PER_WIDE_INT)
1849 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1853 if (prec < HOST_BITS_PER_WIDE_INT)
1854 low &= ~((HOST_WIDE_INT) (-1) << prec);
1857 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1858 : floor_log2 (low));
1861 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1862 decimal float constants, so don't return 1 for them. */
1865 real_zerop (const_tree expr)
1869 return ((TREE_CODE (expr) == REAL_CST
1870 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1871 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1872 || (TREE_CODE (expr) == COMPLEX_CST
1873 && real_zerop (TREE_REALPART (expr))
1874 && real_zerop (TREE_IMAGPART (expr))));
1877 /* Return 1 if EXPR is the real constant one in real or complex form.
1878 Trailing zeroes matter for decimal float constants, so don't return
1882 real_onep (const_tree expr)
1886 return ((TREE_CODE (expr) == REAL_CST
1887 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1888 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1889 || (TREE_CODE (expr) == COMPLEX_CST
1890 && real_onep (TREE_REALPART (expr))
1891 && real_zerop (TREE_IMAGPART (expr))));
1894 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1895 for decimal float constants, so don't return 1 for them. */
1898 real_twop (const_tree expr)
1902 return ((TREE_CODE (expr) == REAL_CST
1903 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1904 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1905 || (TREE_CODE (expr) == COMPLEX_CST
1906 && real_twop (TREE_REALPART (expr))
1907 && real_zerop (TREE_IMAGPART (expr))));
1910 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1911 matter for decimal float constants, so don't return 1 for them. */
1914 real_minus_onep (const_tree expr)
1918 return ((TREE_CODE (expr) == REAL_CST
1919 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1920 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1921 || (TREE_CODE (expr) == COMPLEX_CST
1922 && real_minus_onep (TREE_REALPART (expr))
1923 && real_zerop (TREE_IMAGPART (expr))));
1926 /* Nonzero if EXP is a constant or a cast of a constant. */
1929 really_constant_p (const_tree exp)
1931 /* This is not quite the same as STRIP_NOPS. It does more. */
1932 while (CONVERT_EXPR_P (exp)
1933 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1934 exp = TREE_OPERAND (exp, 0);
1935 return TREE_CONSTANT (exp);
1938 /* Return first list element whose TREE_VALUE is ELEM.
1939 Return 0 if ELEM is not in LIST. */
1942 value_member (tree elem, tree list)
1946 if (elem == TREE_VALUE (list))
1948 list = TREE_CHAIN (list);
1953 /* Return first list element whose TREE_PURPOSE is ELEM.
1954 Return 0 if ELEM is not in LIST. */
1957 purpose_member (const_tree elem, tree list)
1961 if (elem == TREE_PURPOSE (list))
1963 list = TREE_CHAIN (list);
1968 /* Return true if ELEM is in V. */
1971 vec_member (const_tree elem, VEC(tree,gc) *v)
1975 for (ix = 0; VEC_iterate (tree, v, ix, t); ix++)
1981 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1985 chain_index (int idx, tree chain)
1987 for (; chain && idx > 0; --idx)
1988 chain = TREE_CHAIN (chain);
1992 /* Return nonzero if ELEM is part of the chain CHAIN. */
1995 chain_member (const_tree elem, const_tree chain)
2001 chain = DECL_CHAIN (chain);
2007 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2008 We expect a null pointer to mark the end of the chain.
2009 This is the Lisp primitive `length'. */
2012 list_length (const_tree t)
2015 #ifdef ENABLE_TREE_CHECKING
2023 #ifdef ENABLE_TREE_CHECKING
2026 gcc_assert (p != q);
2034 /* Returns the number of FIELD_DECLs in TYPE. */
2037 fields_length (const_tree type)
2039 tree t = TYPE_FIELDS (type);
2042 for (; t; t = DECL_CHAIN (t))
2043 if (TREE_CODE (t) == FIELD_DECL)
2049 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2050 UNION_TYPE TYPE, or NULL_TREE if none. */
2053 first_field (const_tree type)
2055 tree t = TYPE_FIELDS (type);
2056 while (t && TREE_CODE (t) != FIELD_DECL)
2061 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2062 by modifying the last node in chain 1 to point to chain 2.
2063 This is the Lisp primitive `nconc'. */
2066 chainon (tree op1, tree op2)
2075 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
2077 TREE_CHAIN (t1) = op2;
2079 #ifdef ENABLE_TREE_CHECKING
2082 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
2083 gcc_assert (t2 != t1);
2090 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2093 tree_last (tree chain)
2097 while ((next = TREE_CHAIN (chain)))
2102 /* Reverse the order of elements in the chain T,
2103 and return the new head of the chain (old last element). */
2108 tree prev = 0, decl, next;
2109 for (decl = t; decl; decl = next)
2111 next = TREE_CHAIN (decl);
2112 TREE_CHAIN (decl) = prev;
2118 /* Return a newly created TREE_LIST node whose
2119 purpose and value fields are PARM and VALUE. */
2122 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2124 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2125 TREE_PURPOSE (t) = parm;
2126 TREE_VALUE (t) = value;
2130 /* Build a chain of TREE_LIST nodes from a vector. */
2133 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2135 tree ret = NULL_TREE;
2139 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2141 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2142 pp = &TREE_CHAIN (*pp);
2147 /* Return a newly created TREE_LIST node whose
2148 purpose and value fields are PURPOSE and VALUE
2149 and whose TREE_CHAIN is CHAIN. */
2152 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2156 node = ggc_alloc_zone_tree_node_stat (&tree_zone, sizeof (struct tree_list)
2158 memset (node, 0, sizeof (struct tree_common));
2160 #ifdef GATHER_STATISTICS
2161 tree_node_counts[(int) x_kind]++;
2162 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2165 TREE_SET_CODE (node, TREE_LIST);
2166 TREE_CHAIN (node) = chain;
2167 TREE_PURPOSE (node) = purpose;
2168 TREE_VALUE (node) = value;
2172 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2176 ctor_to_vec (tree ctor)
2178 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2182 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2183 VEC_quick_push (tree, vec, val);
2188 /* Return the size nominally occupied by an object of type TYPE
2189 when it resides in memory. The value is measured in units of bytes,
2190 and its data type is that normally used for type sizes
2191 (which is the first type created by make_signed_type or
2192 make_unsigned_type). */
2195 size_in_bytes (const_tree type)
2199 if (type == error_mark_node)
2200 return integer_zero_node;
2202 type = TYPE_MAIN_VARIANT (type);
2203 t = TYPE_SIZE_UNIT (type);
2207 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2208 return size_zero_node;
2214 /* Return the size of TYPE (in bytes) as a wide integer
2215 or return -1 if the size can vary or is larger than an integer. */
2218 int_size_in_bytes (const_tree type)
2222 if (type == error_mark_node)
2225 type = TYPE_MAIN_VARIANT (type);
2226 t = TYPE_SIZE_UNIT (type);
2228 || TREE_CODE (t) != INTEGER_CST
2229 || TREE_INT_CST_HIGH (t) != 0
2230 /* If the result would appear negative, it's too big to represent. */
2231 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2234 return TREE_INT_CST_LOW (t);
2237 /* Return the maximum size of TYPE (in bytes) as a wide integer
2238 or return -1 if the size can vary or is larger than an integer. */
2241 max_int_size_in_bytes (const_tree type)
2243 HOST_WIDE_INT size = -1;
2246 /* If this is an array type, check for a possible MAX_SIZE attached. */
2248 if (TREE_CODE (type) == ARRAY_TYPE)
2250 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2252 if (size_tree && host_integerp (size_tree, 1))
2253 size = tree_low_cst (size_tree, 1);
2256 /* If we still haven't been able to get a size, see if the language
2257 can compute a maximum size. */
2261 size_tree = lang_hooks.types.max_size (type);
2263 if (size_tree && host_integerp (size_tree, 1))
2264 size = tree_low_cst (size_tree, 1);
2270 /* Returns a tree for the size of EXP in bytes. */
2273 tree_expr_size (const_tree exp)
2276 && DECL_SIZE_UNIT (exp) != 0)
2277 return DECL_SIZE_UNIT (exp);
2279 return size_in_bytes (TREE_TYPE (exp));
2282 /* Return the bit position of FIELD, in bits from the start of the record.
2283 This is a tree of type bitsizetype. */
2286 bit_position (const_tree field)
2288 return bit_from_pos (DECL_FIELD_OFFSET (field),
2289 DECL_FIELD_BIT_OFFSET (field));
2292 /* Likewise, but return as an integer. It must be representable in
2293 that way (since it could be a signed value, we don't have the
2294 option of returning -1 like int_size_in_byte can. */
2297 int_bit_position (const_tree field)
2299 return tree_low_cst (bit_position (field), 0);
2302 /* Return the byte position of FIELD, in bytes from the start of the record.
2303 This is a tree of type sizetype. */
2306 byte_position (const_tree field)
2308 return byte_from_pos (DECL_FIELD_OFFSET (field),
2309 DECL_FIELD_BIT_OFFSET (field));
2312 /* Likewise, but return as an integer. It must be representable in
2313 that way (since it could be a signed value, we don't have the
2314 option of returning -1 like int_size_in_byte can. */
2317 int_byte_position (const_tree field)
2319 return tree_low_cst (byte_position (field), 0);
2322 /* Return the strictest alignment, in bits, that T is known to have. */
2325 expr_align (const_tree t)
2327 unsigned int align0, align1;
2329 switch (TREE_CODE (t))
2331 CASE_CONVERT: case NON_LVALUE_EXPR:
2332 /* If we have conversions, we know that the alignment of the
2333 object must meet each of the alignments of the types. */
2334 align0 = expr_align (TREE_OPERAND (t, 0));
2335 align1 = TYPE_ALIGN (TREE_TYPE (t));
2336 return MAX (align0, align1);
2338 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2339 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2340 case CLEANUP_POINT_EXPR:
2341 /* These don't change the alignment of an object. */
2342 return expr_align (TREE_OPERAND (t, 0));
2345 /* The best we can do is say that the alignment is the least aligned
2347 align0 = expr_align (TREE_OPERAND (t, 1));
2348 align1 = expr_align (TREE_OPERAND (t, 2));
2349 return MIN (align0, align1);
2351 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2352 meaningfully, it's always 1. */
2353 case LABEL_DECL: case CONST_DECL:
2354 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2356 gcc_assert (DECL_ALIGN (t) != 0);
2357 return DECL_ALIGN (t);
2363 /* Otherwise take the alignment from that of the type. */
2364 return TYPE_ALIGN (TREE_TYPE (t));
2367 /* Return, as a tree node, the number of elements for TYPE (which is an
2368 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2371 array_type_nelts (const_tree type)
2373 tree index_type, min, max;
2375 /* If they did it with unspecified bounds, then we should have already
2376 given an error about it before we got here. */
2377 if (! TYPE_DOMAIN (type))
2378 return error_mark_node;
2380 index_type = TYPE_DOMAIN (type);
2381 min = TYPE_MIN_VALUE (index_type);
2382 max = TYPE_MAX_VALUE (index_type);
2384 return (integer_zerop (min)
2386 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2389 /* If arg is static -- a reference to an object in static storage -- then
2390 return the object. This is not the same as the C meaning of `static'.
2391 If arg isn't static, return NULL. */
2396 switch (TREE_CODE (arg))
2399 /* Nested functions are static, even though taking their address will
2400 involve a trampoline as we unnest the nested function and create
2401 the trampoline on the tree level. */
2405 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2406 && ! DECL_THREAD_LOCAL_P (arg)
2407 && ! DECL_DLLIMPORT_P (arg)
2411 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2415 return TREE_STATIC (arg) ? arg : NULL;
2422 /* If the thing being referenced is not a field, then it is
2423 something language specific. */
2424 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2426 /* If we are referencing a bitfield, we can't evaluate an
2427 ADDR_EXPR at compile time and so it isn't a constant. */
2428 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2431 return staticp (TREE_OPERAND (arg, 0));
2436 case MISALIGNED_INDIRECT_REF:
2438 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2441 case ARRAY_RANGE_REF:
2442 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2443 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2444 return staticp (TREE_OPERAND (arg, 0));
2448 case COMPOUND_LITERAL_EXPR:
2449 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2459 /* Return whether OP is a DECL whose address is function-invariant. */
2462 decl_address_invariant_p (const_tree op)
2464 /* The conditions below are slightly less strict than the one in
2467 switch (TREE_CODE (op))
2476 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2477 && !DECL_DLLIMPORT_P (op))
2478 || DECL_THREAD_LOCAL_P (op)
2479 || DECL_CONTEXT (op) == current_function_decl
2480 || decl_function_context (op) == current_function_decl)
2485 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2486 || decl_function_context (op) == current_function_decl)
2497 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2500 decl_address_ip_invariant_p (const_tree op)
2502 /* The conditions below are slightly less strict than the one in
2505 switch (TREE_CODE (op))
2513 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2514 && !DECL_DLLIMPORT_P (op))
2515 || DECL_THREAD_LOCAL_P (op))
2520 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2532 /* Return true if T is function-invariant (internal function, does
2533 not handle arithmetic; that's handled in skip_simple_arithmetic and
2534 tree_invariant_p). */
2536 static bool tree_invariant_p (tree t);
2539 tree_invariant_p_1 (tree t)
2543 if (TREE_CONSTANT (t)
2544 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2547 switch (TREE_CODE (t))
2553 op = TREE_OPERAND (t, 0);
2554 while (handled_component_p (op))
2556 switch (TREE_CODE (op))
2559 case ARRAY_RANGE_REF:
2560 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2561 || TREE_OPERAND (op, 2) != NULL_TREE
2562 || TREE_OPERAND (op, 3) != NULL_TREE)
2567 if (TREE_OPERAND (op, 2) != NULL_TREE)
2573 op = TREE_OPERAND (op, 0);
2576 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2585 /* Return true if T is function-invariant. */
2588 tree_invariant_p (tree t)
2590 tree inner = skip_simple_arithmetic (t);
2591 return tree_invariant_p_1 (inner);
2594 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2595 Do this to any expression which may be used in more than one place,
2596 but must be evaluated only once.
2598 Normally, expand_expr would reevaluate the expression each time.
2599 Calling save_expr produces something that is evaluated and recorded
2600 the first time expand_expr is called on it. Subsequent calls to
2601 expand_expr just reuse the recorded value.
2603 The call to expand_expr that generates code that actually computes
2604 the value is the first call *at compile time*. Subsequent calls
2605 *at compile time* generate code to use the saved value.
2606 This produces correct result provided that *at run time* control
2607 always flows through the insns made by the first expand_expr
2608 before reaching the other places where the save_expr was evaluated.
2609 You, the caller of save_expr, must make sure this is so.
2611 Constants, and certain read-only nodes, are returned with no
2612 SAVE_EXPR because that is safe. Expressions containing placeholders
2613 are not touched; see tree.def for an explanation of what these
2617 save_expr (tree expr)
2619 tree t = fold (expr);
2622 /* If the tree evaluates to a constant, then we don't want to hide that
2623 fact (i.e. this allows further folding, and direct checks for constants).
2624 However, a read-only object that has side effects cannot be bypassed.
2625 Since it is no problem to reevaluate literals, we just return the
2627 inner = skip_simple_arithmetic (t);
2628 if (TREE_CODE (inner) == ERROR_MARK)
2631 if (tree_invariant_p_1 (inner))
2634 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2635 it means that the size or offset of some field of an object depends on
2636 the value within another field.
2638 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2639 and some variable since it would then need to be both evaluated once and
2640 evaluated more than once. Front-ends must assure this case cannot
2641 happen by surrounding any such subexpressions in their own SAVE_EXPR
2642 and forcing evaluation at the proper time. */
2643 if (contains_placeholder_p (inner))
2646 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2647 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2649 /* This expression might be placed ahead of a jump to ensure that the
2650 value was computed on both sides of the jump. So make sure it isn't
2651 eliminated as dead. */
2652 TREE_SIDE_EFFECTS (t) = 1;
2656 /* Look inside EXPR and into any simple arithmetic operations. Return
2657 the innermost non-arithmetic node. */
2660 skip_simple_arithmetic (tree expr)
2664 /* We don't care about whether this can be used as an lvalue in this
2666 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2667 expr = TREE_OPERAND (expr, 0);
2669 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2670 a constant, it will be more efficient to not make another SAVE_EXPR since
2671 it will allow better simplification and GCSE will be able to merge the
2672 computations if they actually occur. */
2676 if (UNARY_CLASS_P (inner))
2677 inner = TREE_OPERAND (inner, 0);
2678 else if (BINARY_CLASS_P (inner))
2680 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2681 inner = TREE_OPERAND (inner, 0);
2682 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2683 inner = TREE_OPERAND (inner, 1);
2695 /* Return which tree structure is used by T. */
2697 enum tree_node_structure_enum
2698 tree_node_structure (const_tree t)
2700 const enum tree_code code = TREE_CODE (t);
2701 return tree_node_structure_for_code (code);
2704 /* Set various status flags when building a CALL_EXPR object T. */
2707 process_call_operands (tree t)
2709 bool side_effects = TREE_SIDE_EFFECTS (t);
2710 bool read_only = false;
2711 int i = call_expr_flags (t);
2713 /* Calls have side-effects, except those to const or pure functions. */
2714 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2715 side_effects = true;
2716 /* Propagate TREE_READONLY of arguments for const functions. */
2720 if (!side_effects || read_only)
2721 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2723 tree op = TREE_OPERAND (t, i);
2724 if (op && TREE_SIDE_EFFECTS (op))
2725 side_effects = true;
2726 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2730 TREE_SIDE_EFFECTS (t) = side_effects;
2731 TREE_READONLY (t) = read_only;
2734 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2735 or offset that depends on a field within a record. */
2738 contains_placeholder_p (const_tree exp)
2740 enum tree_code code;
2745 code = TREE_CODE (exp);
2746 if (code == PLACEHOLDER_EXPR)
2749 switch (TREE_CODE_CLASS (code))
2752 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2753 position computations since they will be converted into a
2754 WITH_RECORD_EXPR involving the reference, which will assume
2755 here will be valid. */
2756 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2758 case tcc_exceptional:
2759 if (code == TREE_LIST)
2760 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2761 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2766 case tcc_comparison:
2767 case tcc_expression:
2771 /* Ignoring the first operand isn't quite right, but works best. */
2772 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2775 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2776 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2777 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2780 /* The save_expr function never wraps anything containing
2781 a PLACEHOLDER_EXPR. */
2788 switch (TREE_CODE_LENGTH (code))
2791 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2793 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2794 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2805 const_call_expr_arg_iterator iter;
2806 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2807 if (CONTAINS_PLACEHOLDER_P (arg))
2821 /* Return true if any part of the computation of TYPE involves a
2822 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2823 (for QUAL_UNION_TYPE) and field positions. */
2826 type_contains_placeholder_1 (const_tree type)
2828 /* If the size contains a placeholder or the parent type (component type in
2829 the case of arrays) type involves a placeholder, this type does. */
2830 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2831 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2832 || (TREE_TYPE (type) != 0
2833 && type_contains_placeholder_p (TREE_TYPE (type))))
2836 /* Now do type-specific checks. Note that the last part of the check above
2837 greatly limits what we have to do below. */
2838 switch (TREE_CODE (type))
2846 case REFERENCE_TYPE:
2854 case FIXED_POINT_TYPE:
2855 /* Here we just check the bounds. */
2856 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2857 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2860 /* We're already checked the component type (TREE_TYPE), so just check
2862 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2866 case QUAL_UNION_TYPE:
2870 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
2871 if (TREE_CODE (field) == FIELD_DECL
2872 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2873 || (TREE_CODE (type) == QUAL_UNION_TYPE
2874 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2875 || type_contains_placeholder_p (TREE_TYPE (field))))
2887 type_contains_placeholder_p (tree type)
2891 /* If the contains_placeholder_bits field has been initialized,
2892 then we know the answer. */
2893 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2894 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2896 /* Indicate that we've seen this type node, and the answer is false.
2897 This is what we want to return if we run into recursion via fields. */
2898 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2900 /* Compute the real value. */
2901 result = type_contains_placeholder_1 (type);
2903 /* Store the real value. */
2904 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2909 /* Push tree EXP onto vector QUEUE if it is not already present. */
2912 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2917 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2918 if (simple_cst_equal (iter, exp) == 1)
2922 VEC_safe_push (tree, heap, *queue, exp);
2925 /* Given a tree EXP, find all occurences of references to fields
2926 in a PLACEHOLDER_EXPR and place them in vector REFS without
2927 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2928 we assume here that EXP contains only arithmetic expressions
2929 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2933 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2935 enum tree_code code = TREE_CODE (exp);
2939 /* We handle TREE_LIST and COMPONENT_REF separately. */
2940 if (code == TREE_LIST)
2942 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2943 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2945 else if (code == COMPONENT_REF)
2947 for (inner = TREE_OPERAND (exp, 0);
2948 REFERENCE_CLASS_P (inner);
2949 inner = TREE_OPERAND (inner, 0))
2952 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2953 push_without_duplicates (exp, refs);
2955 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2958 switch (TREE_CODE_CLASS (code))
2963 case tcc_declaration:
2964 /* Variables allocated to static storage can stay. */
2965 if (!TREE_STATIC (exp))
2966 push_without_duplicates (exp, refs);
2969 case tcc_expression:
2970 /* This is the pattern built in ada/make_aligning_type. */
2971 if (code == ADDR_EXPR
2972 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2974 push_without_duplicates (exp, refs);
2978 /* Fall through... */
2980 case tcc_exceptional:
2983 case tcc_comparison:
2985 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2986 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2990 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2991 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2999 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3000 return a tree with all occurrences of references to F in a
3001 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3002 CONST_DECLs. Note that we assume here that EXP contains only
3003 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3004 occurring only in their argument list. */
3007 substitute_in_expr (tree exp, tree f, tree r)
3009 enum tree_code code = TREE_CODE (exp);
3010 tree op0, op1, op2, op3;
3013 /* We handle TREE_LIST and COMPONENT_REF separately. */
3014 if (code == TREE_LIST)
3016 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
3017 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
3018 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3021 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3023 else if (code == COMPONENT_REF)
3027 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3028 and it is the right field, replace it with R. */
3029 for (inner = TREE_OPERAND (exp, 0);
3030 REFERENCE_CLASS_P (inner);
3031 inner = TREE_OPERAND (inner, 0))
3035 op1 = TREE_OPERAND (exp, 1);
3037 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
3040 /* If this expression hasn't been completed let, leave it alone. */
3041 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
3044 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3045 if (op0 == TREE_OPERAND (exp, 0))
3049 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
3052 switch (TREE_CODE_CLASS (code))
3057 case tcc_declaration:
3063 case tcc_expression:
3067 /* Fall through... */
3069 case tcc_exceptional:
3072 case tcc_comparison:
3074 switch (TREE_CODE_LENGTH (code))
3080 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3081 if (op0 == TREE_OPERAND (exp, 0))
3084 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3088 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3089 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3091 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3094 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3098 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3099 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3100 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3102 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3103 && op2 == TREE_OPERAND (exp, 2))
3106 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3110 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3111 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3112 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3113 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3115 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3116 && op2 == TREE_OPERAND (exp, 2)
3117 && op3 == TREE_OPERAND (exp, 3))
3121 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3133 new_tree = NULL_TREE;
3135 /* If we are trying to replace F with a constant, inline back
3136 functions which do nothing else than computing a value from
3137 the arguments they are passed. This makes it possible to
3138 fold partially or entirely the replacement expression. */
3139 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3141 tree t = maybe_inline_call_in_expr (exp);
3143 return SUBSTITUTE_IN_EXPR (t, f, r);
3146 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3148 tree op = TREE_OPERAND (exp, i);
3149 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3153 new_tree = copy_node (exp);
3154 TREE_OPERAND (new_tree, i) = new_op;
3160 new_tree = fold (new_tree);
3161 if (TREE_CODE (new_tree) == CALL_EXPR)
3162 process_call_operands (new_tree);
3173 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3177 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3178 for it within OBJ, a tree that is an object or a chain of references. */
3181 substitute_placeholder_in_expr (tree exp, tree obj)
3183 enum tree_code code = TREE_CODE (exp);
3184 tree op0, op1, op2, op3;
3187 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3188 in the chain of OBJ. */
3189 if (code == PLACEHOLDER_EXPR)
3191 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3194 for (elt = obj; elt != 0;
3195 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3196 || TREE_CODE (elt) == COND_EXPR)
3197 ? TREE_OPERAND (elt, 1)
3198 : (REFERENCE_CLASS_P (elt)
3199 || UNARY_CLASS_P (elt)
3200 || BINARY_CLASS_P (elt)
3201 || VL_EXP_CLASS_P (elt)
3202 || EXPRESSION_CLASS_P (elt))
3203 ? TREE_OPERAND (elt, 0) : 0))
3204 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3207 for (elt = obj; elt != 0;
3208 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3209 || TREE_CODE (elt) == COND_EXPR)
3210 ? TREE_OPERAND (elt, 1)
3211 : (REFERENCE_CLASS_P (elt)
3212 || UNARY_CLASS_P (elt)
3213 || BINARY_CLASS_P (elt)
3214 || VL_EXP_CLASS_P (elt)
3215 || EXPRESSION_CLASS_P (elt))
3216 ? TREE_OPERAND (elt, 0) : 0))
3217 if (POINTER_TYPE_P (TREE_TYPE (elt))
3218 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3220 return fold_build1 (INDIRECT_REF, need_type, elt);
3222 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3223 survives until RTL generation, there will be an error. */
3227 /* TREE_LIST is special because we need to look at TREE_VALUE
3228 and TREE_CHAIN, not TREE_OPERANDS. */
3229 else if (code == TREE_LIST)
3231 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3232 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3233 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3236 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3239 switch (TREE_CODE_CLASS (code))
3242 case tcc_declaration:
3245 case tcc_exceptional:
3248 case tcc_comparison:
3249 case tcc_expression:
3252 switch (TREE_CODE_LENGTH (code))
3258 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3259 if (op0 == TREE_OPERAND (exp, 0))
3262 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3266 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3267 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3269 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3272 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3276 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3277 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3278 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3280 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3281 && op2 == TREE_OPERAND (exp, 2))
3284 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3288 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3289 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3290 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3291 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3293 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3294 && op2 == TREE_OPERAND (exp, 2)
3295 && op3 == TREE_OPERAND (exp, 3))
3299 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3311 new_tree = NULL_TREE;
3313 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3315 tree op = TREE_OPERAND (exp, i);
3316 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3320 new_tree = copy_node (exp);
3321 TREE_OPERAND (new_tree, i) = new_op;
3327 new_tree = fold (new_tree);
3328 if (TREE_CODE (new_tree) == CALL_EXPR)
3329 process_call_operands (new_tree);
3340 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3344 /* Stabilize a reference so that we can use it any number of times
3345 without causing its operands to be evaluated more than once.
3346 Returns the stabilized reference. This works by means of save_expr,
3347 so see the caveats in the comments about save_expr.
3349 Also allows conversion expressions whose operands are references.
3350 Any other kind of expression is returned unchanged. */
3353 stabilize_reference (tree ref)
3356 enum tree_code code = TREE_CODE (ref);
3363 /* No action is needed in this case. */
3368 case FIX_TRUNC_EXPR:
3369 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3373 result = build_nt (INDIRECT_REF,
3374 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3378 result = build_nt (COMPONENT_REF,
3379 stabilize_reference (TREE_OPERAND (ref, 0)),
3380 TREE_OPERAND (ref, 1), NULL_TREE);
3384 result = build_nt (BIT_FIELD_REF,
3385 stabilize_reference (TREE_OPERAND (ref, 0)),
3386 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3387 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3391 result = build_nt (ARRAY_REF,
3392 stabilize_reference (TREE_OPERAND (ref, 0)),
3393 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3394 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3397 case ARRAY_RANGE_REF:
3398 result = build_nt (ARRAY_RANGE_REF,
3399 stabilize_reference (TREE_OPERAND (ref, 0)),
3400 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3401 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3405 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3406 it wouldn't be ignored. This matters when dealing with
3408 return stabilize_reference_1 (ref);
3410 /* If arg isn't a kind of lvalue we recognize, make no change.
3411 Caller should recognize the error for an invalid lvalue. */
3416 return error_mark_node;
3419 TREE_TYPE (result) = TREE_TYPE (ref);
3420 TREE_READONLY (result) = TREE_READONLY (ref);
3421 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3422 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3427 /* Subroutine of stabilize_reference; this is called for subtrees of
3428 references. Any expression with side-effects must be put in a SAVE_EXPR
3429 to ensure that it is only evaluated once.
3431 We don't put SAVE_EXPR nodes around everything, because assigning very
3432 simple expressions to temporaries causes us to miss good opportunities
3433 for optimizations. Among other things, the opportunity to fold in the
3434 addition of a constant into an addressing mode often gets lost, e.g.
3435 "y[i+1] += x;". In general, we take the approach that we should not make
3436 an assignment unless we are forced into it - i.e., that any non-side effect
3437 operator should be allowed, and that cse should take care of coalescing
3438 multiple utterances of the same expression should that prove fruitful. */
3441 stabilize_reference_1 (tree e)
3444 enum tree_code code = TREE_CODE (e);
3446 /* We cannot ignore const expressions because it might be a reference
3447 to a const array but whose index contains side-effects. But we can
3448 ignore things that are actual constant or that already have been
3449 handled by this function. */
3451 if (tree_invariant_p (e))
3454 switch (TREE_CODE_CLASS (code))
3456 case tcc_exceptional:
3458 case tcc_declaration:
3459 case tcc_comparison:
3461 case tcc_expression:
3464 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3465 so that it will only be evaluated once. */
3466 /* The reference (r) and comparison (<) classes could be handled as
3467 below, but it is generally faster to only evaluate them once. */
3468 if (TREE_SIDE_EFFECTS (e))
3469 return save_expr (e);
3473 /* Constants need no processing. In fact, we should never reach
3478 /* Division is slow and tends to be compiled with jumps,
3479 especially the division by powers of 2 that is often
3480 found inside of an array reference. So do it just once. */
3481 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3482 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3483 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3484 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3485 return save_expr (e);
3486 /* Recursively stabilize each operand. */
3487 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3488 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3492 /* Recursively stabilize each operand. */
3493 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3500 TREE_TYPE (result) = TREE_TYPE (e);
3501 TREE_READONLY (result) = TREE_READONLY (e);
3502 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3503 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3508 /* Low-level constructors for expressions. */
3510 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3511 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3514 recompute_tree_invariant_for_addr_expr (tree t)
3517 bool tc = true, se = false;
3519 /* We started out assuming this address is both invariant and constant, but
3520 does not have side effects. Now go down any handled components and see if
3521 any of them involve offsets that are either non-constant or non-invariant.
3522 Also check for side-effects.
3524 ??? Note that this code makes no attempt to deal with the case where
3525 taking the address of something causes a copy due to misalignment. */
3527 #define UPDATE_FLAGS(NODE) \
3528 do { tree _node = (NODE); \
3529 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3530 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3532 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3533 node = TREE_OPERAND (node, 0))
3535 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3536 array reference (probably made temporarily by the G++ front end),
3537 so ignore all the operands. */
3538 if ((TREE_CODE (node) == ARRAY_REF
3539 || TREE_CODE (node) == ARRAY_RANGE_REF)
3540 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3542 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3543 if (TREE_OPERAND (node, 2))
3544 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3545 if (TREE_OPERAND (node, 3))
3546 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3548 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3549 FIELD_DECL, apparently. The G++ front end can put something else
3550 there, at least temporarily. */
3551 else if (TREE_CODE (node) == COMPONENT_REF
3552 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3554 if (TREE_OPERAND (node, 2))
3555 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3557 else if (TREE_CODE (node) == BIT_FIELD_REF)
3558 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3561 node = lang_hooks.expr_to_decl (node, &tc, &se);
3563 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3564 the address, since &(*a)->b is a form of addition. If it's a constant, the
3565 address is constant too. If it's a decl, its address is constant if the
3566 decl is static. Everything else is not constant and, furthermore,
3567 taking the address of a volatile variable is not volatile. */
3568 if (TREE_CODE (node) == INDIRECT_REF
3569 || TREE_CODE (node) == MEM_REF)
3570 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3571 else if (CONSTANT_CLASS_P (node))
3573 else if (DECL_P (node))
3574 tc &= (staticp (node) != NULL_TREE);
3578 se |= TREE_SIDE_EFFECTS (node);
3582 TREE_CONSTANT (t) = tc;
3583 TREE_SIDE_EFFECTS (t) = se;
3587 /* Build an expression of code CODE, data type TYPE, and operands as
3588 specified. Expressions and reference nodes can be created this way.
3589 Constants, decls, types and misc nodes cannot be.
3591 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3592 enough for all extant tree codes. */
3595 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3599 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3601 t = make_node_stat (code PASS_MEM_STAT);
3608 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3610 int length = sizeof (struct tree_exp);
3611 #ifdef GATHER_STATISTICS
3612 tree_node_kind kind;
3616 #ifdef GATHER_STATISTICS
3617 switch (TREE_CODE_CLASS (code))
3619 case tcc_statement: /* an expression with side effects */
3622 case tcc_reference: /* a reference */
3630 tree_node_counts[(int) kind]++;
3631 tree_node_sizes[(int) kind] += length;
3634 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3636 t = ggc_alloc_zone_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
3638 memset (t, 0, sizeof (struct tree_common));
3640 TREE_SET_CODE (t, code);
3642 TREE_TYPE (t) = type;
3643 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3644 TREE_OPERAND (t, 0) = node;
3645 TREE_BLOCK (t) = NULL_TREE;
3646 if (node && !TYPE_P (node))
3648 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3649 TREE_READONLY (t) = TREE_READONLY (node);
3652 if (TREE_CODE_CLASS (code) == tcc_statement)
3653 TREE_SIDE_EFFECTS (t) = 1;
3657 /* All of these have side-effects, no matter what their
3659 TREE_SIDE_EFFECTS (t) = 1;
3660 TREE_READONLY (t) = 0;
3663 case MISALIGNED_INDIRECT_REF:
3665 /* Whether a dereference is readonly has nothing to do with whether
3666 its operand is readonly. */
3667 TREE_READONLY (t) = 0;
3672 recompute_tree_invariant_for_addr_expr (t);
3676 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3677 && node && !TYPE_P (node)
3678 && TREE_CONSTANT (node))
3679 TREE_CONSTANT (t) = 1;
3680 if (TREE_CODE_CLASS (code) == tcc_reference
3681 && node && TREE_THIS_VOLATILE (node))
3682 TREE_THIS_VOLATILE (t) = 1;
3689 #define PROCESS_ARG(N) \
3691 TREE_OPERAND (t, N) = arg##N; \
3692 if (arg##N &&!TYPE_P (arg##N)) \
3694 if (TREE_SIDE_EFFECTS (arg##N)) \
3696 if (!TREE_READONLY (arg##N) \
3697 && !CONSTANT_CLASS_P (arg##N)) \
3698 (void) (read_only = 0); \
3699 if (!TREE_CONSTANT (arg##N)) \
3700 (void) (constant = 0); \
3705 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3707 bool constant, read_only, side_effects;
3710 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3712 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3713 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3714 /* When sizetype precision doesn't match that of pointers
3715 we need to be able to build explicit extensions or truncations
3716 of the offset argument. */
3717 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3718 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3719 && TREE_CODE (arg1) == INTEGER_CST);
3721 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3722 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3723 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3724 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3726 t = make_node_stat (code PASS_MEM_STAT);
3729 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3730 result based on those same flags for the arguments. But if the
3731 arguments aren't really even `tree' expressions, we shouldn't be trying
3734 /* Expressions without side effects may be constant if their
3735 arguments are as well. */
3736 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3737 || TREE_CODE_CLASS (code) == tcc_binary);
3739 side_effects = TREE_SIDE_EFFECTS (t);
3744 TREE_READONLY (t) = read_only;
3745 TREE_CONSTANT (t) = constant;
3746 TREE_SIDE_EFFECTS (t) = side_effects;
3747 TREE_THIS_VOLATILE (t)
3748 = (TREE_CODE_CLASS (code) == tcc_reference
3749 && arg0 && TREE_THIS_VOLATILE (arg0));
3756 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3757 tree arg2 MEM_STAT_DECL)
3759 bool constant, read_only, side_effects;
3762 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3763 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3765 t = make_node_stat (code PASS_MEM_STAT);
3770 /* As a special exception, if COND_EXPR has NULL branches, we
3771 assume that it is a gimple statement and always consider
3772 it to have side effects. */
3773 if (code == COND_EXPR
3774 && tt == void_type_node
3775 && arg1 == NULL_TREE
3776 && arg2 == NULL_TREE)
3777 side_effects = true;
3779 side_effects = TREE_SIDE_EFFECTS (t);
3785 if (code == COND_EXPR)
3786 TREE_READONLY (t) = read_only;
3788 TREE_SIDE_EFFECTS (t) = side_effects;
3789 TREE_THIS_VOLATILE (t)
3790 = (TREE_CODE_CLASS (code) == tcc_reference
3791 && arg0 && TREE_THIS_VOLATILE (arg0));
3797 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3798 tree arg2, tree arg3 MEM_STAT_DECL)
3800 bool constant, read_only, side_effects;
3803 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3805 t = make_node_stat (code PASS_MEM_STAT);
3808 side_effects = TREE_SIDE_EFFECTS (t);
3815 TREE_SIDE_EFFECTS (t) = side_effects;
3816 TREE_THIS_VOLATILE (t)
3817 = (TREE_CODE_CLASS (code) == tcc_reference
3818 && arg0 && TREE_THIS_VOLATILE (arg0));
3824 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3825 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3827 bool constant, read_only, side_effects;
3830 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3832 t = make_node_stat (code PASS_MEM_STAT);
3835 side_effects = TREE_SIDE_EFFECTS (t);
3843 TREE_SIDE_EFFECTS (t) = side_effects;
3844 TREE_THIS_VOLATILE (t)
3845 = (TREE_CODE_CLASS (code) == tcc_reference
3846 && arg0 && TREE_THIS_VOLATILE (arg0));
3852 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3853 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3855 bool constant, read_only, side_effects;
3858 gcc_assert (code == TARGET_MEM_REF);
3860 t = make_node_stat (code PASS_MEM_STAT);
3863 side_effects = TREE_SIDE_EFFECTS (t);
3870 if (code == TARGET_MEM_REF)
3874 TREE_SIDE_EFFECTS (t) = side_effects;
3875 TREE_THIS_VOLATILE (t)
3876 = (code == TARGET_MEM_REF
3877 && arg5 && TREE_THIS_VOLATILE (arg5));
3882 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3883 on the pointer PTR. */
3886 build_simple_mem_ref_loc (location_t loc, tree ptr)
3888 HOST_WIDE_INT offset = 0;
3889 tree ptype = TREE_TYPE (ptr);
3891 /* For convenience allow addresses that collapse to a simple base
3893 if (TREE_CODE (ptr) == ADDR_EXPR
3894 && (handled_component_p (TREE_OPERAND (ptr, 0))
3895 || TREE_CODE (TREE_OPERAND (ptr, 0)) == MEM_REF))
3897 ptr = get_addr_base_and_unit_offset (TREE_OPERAND (ptr, 0), &offset);
3899 ptr = build_fold_addr_expr (ptr);
3900 gcc_assert (is_gimple_reg (ptr) || is_gimple_min_invariant (ptr));
3902 tem = build2 (MEM_REF, TREE_TYPE (ptype),
3903 ptr, build_int_cst (ptype, offset));
3904 SET_EXPR_LOCATION (tem, loc);
3908 /* Return the constant offset of a MEM_REF tree T. */
3911 mem_ref_offset (const_tree t)
3913 tree toff = TREE_OPERAND (t, 1);
3914 return double_int_sext (tree_to_double_int (toff),
3915 TYPE_PRECISION (TREE_TYPE (toff)));
3918 /* Return the pointer-type relevant for TBAA purposes from the
3919 gimple memory reference tree T. This is the type to be used for
3920 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3923 reference_alias_ptr_type (const_tree t)
3925 const_tree base = t;
3926 while (handled_component_p (base))
3927 base = TREE_OPERAND (base, 0);
3928 if (TREE_CODE (base) == MEM_REF)
3929 return TREE_TYPE (TREE_OPERAND (base, 1));
3930 else if (TREE_CODE (base) == TARGET_MEM_REF
3931 || TREE_CODE (base) == MISALIGNED_INDIRECT_REF)
3934 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base)));
3937 /* Similar except don't specify the TREE_TYPE
3938 and leave the TREE_SIDE_EFFECTS as 0.
3939 It is permissible for arguments to be null,
3940 or even garbage if their values do not matter. */
3943 build_nt (enum tree_code code, ...)
3950 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3954 t = make_node (code);
3955 length = TREE_CODE_LENGTH (code);
3957 for (i = 0; i < length; i++)
3958 TREE_OPERAND (t, i) = va_arg (p, tree);
3964 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3968 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3973 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3974 CALL_EXPR_FN (ret) = fn;
3975 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3976 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3977 CALL_EXPR_ARG (ret, ix) = t;
3981 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3982 We do NOT enter this node in any sort of symbol table.
3984 LOC is the location of the decl.
3986 layout_decl is used to set up the decl's storage layout.
3987 Other slots are initialized to 0 or null pointers. */
3990 build_decl_stat (location_t loc, enum tree_code code, tree name,
3991 tree type MEM_STAT_DECL)
3995 t = make_node_stat (code PASS_MEM_STAT);
3996 DECL_SOURCE_LOCATION (t) = loc;
3998 /* if (type == error_mark_node)
3999 type = integer_type_node; */
4000 /* That is not done, deliberately, so that having error_mark_node
4001 as the type can suppress useless errors in the use of this variable. */
4003 DECL_NAME (t) = name;
4004 TREE_TYPE (t) = type;
4006 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
4012 /* Builds and returns function declaration with NAME and TYPE. */
4015 build_fn_decl (const char *name, tree type)
4017 tree id = get_identifier (name);
4018 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
4020 DECL_EXTERNAL (decl) = 1;
4021 TREE_PUBLIC (decl) = 1;
4022 DECL_ARTIFICIAL (decl) = 1;
4023 TREE_NOTHROW (decl) = 1;
4029 /* BLOCK nodes are used to represent the structure of binding contours
4030 and declarations, once those contours have been exited and their contents
4031 compiled. This information is used for outputting debugging info. */
4034 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
4036 tree block = make_node (BLOCK);
4038 BLOCK_VARS (block) = vars;
4039 BLOCK_SUBBLOCKS (block) = subblocks;
4040 BLOCK_SUPERCONTEXT (block) = supercontext;
4041 BLOCK_CHAIN (block) = chain;
4046 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4048 LOC is the location to use in tree T. */
4051 protected_set_expr_location (tree t, location_t loc)
4053 if (t && CAN_HAVE_LOCATION_P (t))
4054 SET_EXPR_LOCATION (t, loc);
4057 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4061 build_decl_attribute_variant (tree ddecl, tree attribute)
4063 DECL_ATTRIBUTES (ddecl) = attribute;
4067 /* Borrowed from hashtab.c iterative_hash implementation. */
4068 #define mix(a,b,c) \
4070 a -= b; a -= c; a ^= (c>>13); \
4071 b -= c; b -= a; b ^= (a<< 8); \
4072 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4073 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4074 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4075 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4076 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4077 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4078 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4082 /* Produce good hash value combining VAL and VAL2. */
4084 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
4086 /* the golden ratio; an arbitrary value. */
4087 hashval_t a = 0x9e3779b9;
4093 /* Produce good hash value combining VAL and VAL2. */
4095 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4097 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4098 return iterative_hash_hashval_t (val, val2);
4101 hashval_t a = (hashval_t) val;
4102 /* Avoid warnings about shifting of more than the width of the type on
4103 hosts that won't execute this path. */
4105 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4107 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4109 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4110 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4117 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4118 is ATTRIBUTE and its qualifiers are QUALS.
4120 Record such modified types already made so we don't make duplicates. */
4123 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4125 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4127 hashval_t hashcode = 0;
4129 enum tree_code code = TREE_CODE (ttype);
4131 /* Building a distinct copy of a tagged type is inappropriate; it
4132 causes breakage in code that expects there to be a one-to-one
4133 relationship between a struct and its fields.
4134 build_duplicate_type is another solution (as used in
4135 handle_transparent_union_attribute), but that doesn't play well
4136 with the stronger C++ type identity model. */
4137 if (TREE_CODE (ttype) == RECORD_TYPE
4138 || TREE_CODE (ttype) == UNION_TYPE
4139 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4140 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4142 warning (OPT_Wattributes,
4143 "ignoring attributes applied to %qT after definition",
4144 TYPE_MAIN_VARIANT (ttype));
4145 return build_qualified_type (ttype, quals);
4148 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4149 ntype = build_distinct_type_copy (ttype);
4151 TYPE_ATTRIBUTES (ntype) = attribute;
4153 hashcode = iterative_hash_object (code, hashcode);
4154 if (TREE_TYPE (ntype))
4155 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4157 hashcode = attribute_hash_list (attribute, hashcode);
4159 switch (TREE_CODE (ntype))
4162 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4165 if (TYPE_DOMAIN (ntype))
4166 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4170 hashcode = iterative_hash_object
4171 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4172 hashcode = iterative_hash_object
4173 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4176 case FIXED_POINT_TYPE:
4178 unsigned int precision = TYPE_PRECISION (ntype);
4179 hashcode = iterative_hash_object (precision, hashcode);
4186 ntype = type_hash_canon (hashcode, ntype);
4188 /* If the target-dependent attributes make NTYPE different from
4189 its canonical type, we will need to use structural equality
4190 checks for this type. */
4191 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4192 || !targetm.comp_type_attributes (ntype, ttype))
4193 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4194 else if (TYPE_CANONICAL (ntype) == ntype)
4195 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4197 ttype = build_qualified_type (ntype, quals);
4199 else if (TYPE_QUALS (ttype) != quals)
4200 ttype = build_qualified_type (ttype, quals);
4206 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4209 Record such modified types already made so we don't make duplicates. */
4212 build_type_attribute_variant (tree ttype, tree attribute)
4214 return build_type_attribute_qual_variant (ttype, attribute,
4215 TYPE_QUALS (ttype));
4219 /* Reset the expression *EXPR_P, a size or position.
4221 ??? We could reset all non-constant sizes or positions. But it's cheap
4222 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4224 We need to reset self-referential sizes or positions because they cannot
4225 be gimplified and thus can contain a CALL_EXPR after the gimplification
4226 is finished, which will run afoul of LTO streaming. And they need to be
4227 reset to something essentially dummy but not constant, so as to preserve
4228 the properties of the object they are attached to. */
4231 free_lang_data_in_one_sizepos (tree *expr_p)
4233 tree expr = *expr_p;
4234 if (CONTAINS_PLACEHOLDER_P (expr))
4235 *expr_p = build0 (PLACEHOLDER_EXPR, TREE_TYPE (expr));
4239 /* Reset all the fields in a binfo node BINFO. We only keep
4240 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4243 free_lang_data_in_binfo (tree binfo)
4248 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
4250 BINFO_VTABLE (binfo) = NULL_TREE;
4251 BINFO_BASE_ACCESSES (binfo) = NULL;
4252 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4253 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4255 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (binfo), i, t); i++)
4256 free_lang_data_in_binfo (t);
4260 /* Reset all language specific information still present in TYPE. */
4263 free_lang_data_in_type (tree type)
4265 gcc_assert (TYPE_P (type));
4267 /* Give the FE a chance to remove its own data first. */
4268 lang_hooks.free_lang_data (type);
4270 TREE_LANG_FLAG_0 (type) = 0;
4271 TREE_LANG_FLAG_1 (type) = 0;
4272 TREE_LANG_FLAG_2 (type) = 0;
4273 TREE_LANG_FLAG_3 (type) = 0;
4274 TREE_LANG_FLAG_4 (type) = 0;
4275 TREE_LANG_FLAG_5 (type) = 0;
4276 TREE_LANG_FLAG_6 (type) = 0;
4278 if (TREE_CODE (type) == FUNCTION_TYPE)
4280 /* Remove the const and volatile qualifiers from arguments. The
4281 C++ front end removes them, but the C front end does not,
4282 leading to false ODR violation errors when merging two
4283 instances of the same function signature compiled by
4284 different front ends. */
4287 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4289 tree arg_type = TREE_VALUE (p);
4291 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4293 int quals = TYPE_QUALS (arg_type)
4295 & ~TYPE_QUAL_VOLATILE;
4296 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4297 free_lang_data_in_type (TREE_VALUE (p));
4302 /* Remove members that are not actually FIELD_DECLs from the field
4303 list of an aggregate. These occur in C++. */
4304 if (RECORD_OR_UNION_TYPE_P (type))
4308 /* Note that TYPE_FIELDS can be shared across distinct
4309 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4310 to be removed, we cannot set its TREE_CHAIN to NULL.
4311 Otherwise, we would not be able to find all the other fields
4312 in the other instances of this TREE_TYPE.
4314 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4316 member = TYPE_FIELDS (type);
4319 if (TREE_CODE (member) == FIELD_DECL)
4322 TREE_CHAIN (prev) = member;
4324 TYPE_FIELDS (type) = member;
4328 member = TREE_CHAIN (member);
4332 TREE_CHAIN (prev) = NULL_TREE;
4334 TYPE_FIELDS (type) = NULL_TREE;
4336 TYPE_METHODS (type) = NULL_TREE;
4337 if (TYPE_BINFO (type))
4338 free_lang_data_in_binfo (TYPE_BINFO (type));
4342 /* For non-aggregate types, clear out the language slot (which
4343 overloads TYPE_BINFO). */
4344 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4346 if (INTEGRAL_TYPE_P (type)
4347 || SCALAR_FLOAT_TYPE_P (type)
4348 || FIXED_POINT_TYPE_P (type))
4350 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type));
4351 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type));
4355 free_lang_data_in_one_sizepos (&TYPE_SIZE (type));
4356 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type));
4358 if (debug_info_level < DINFO_LEVEL_TERSE
4359 || (TYPE_CONTEXT (type)
4360 && TREE_CODE (TYPE_CONTEXT (type)) != FUNCTION_DECL
4361 && TREE_CODE (TYPE_CONTEXT (type)) != NAMESPACE_DECL))
4362 TYPE_CONTEXT (type) = NULL_TREE;
4364 if (debug_info_level < DINFO_LEVEL_TERSE)
4365 TYPE_STUB_DECL (type) = NULL_TREE;
4369 /* Return true if DECL may need an assembler name to be set. */
4372 need_assembler_name_p (tree decl)
4374 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4375 if (TREE_CODE (decl) != FUNCTION_DECL
4376 && TREE_CODE (decl) != VAR_DECL)
4379 /* If DECL already has its assembler name set, it does not need a
4381 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4382 || DECL_ASSEMBLER_NAME_SET_P (decl))
4385 /* Abstract decls do not need an assembler name. */
4386 if (DECL_ABSTRACT (decl))
4389 /* For VAR_DECLs, only static, public and external symbols need an
4391 if (TREE_CODE (decl) == VAR_DECL
4392 && !TREE_STATIC (decl)
4393 && !TREE_PUBLIC (decl)
4394 && !DECL_EXTERNAL (decl))
4397 if (TREE_CODE (decl) == FUNCTION_DECL)
4399 /* Do not set assembler name on builtins. Allow RTL expansion to
4400 decide whether to expand inline or via a regular call. */
4401 if (DECL_BUILT_IN (decl)
4402 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4405 /* Functions represented in the callgraph need an assembler name. */
4406 if (cgraph_get_node (decl) != NULL)
4409 /* Unused and not public functions don't need an assembler name. */
4410 if (!TREE_USED (decl) && !TREE_PUBLIC (decl))
4418 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4419 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4420 in BLOCK that is not in LOCALS is removed. */
4423 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4427 tp = &BLOCK_VARS (block);
4430 if (!pointer_set_contains (locals, *tp))
4431 *tp = TREE_CHAIN (*tp);
4433 tp = &TREE_CHAIN (*tp);
4436 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4437 free_lang_data_in_block (fn, t, locals);
4441 /* Reset all language specific information still present in symbol
4445 free_lang_data_in_decl (tree decl)
4447 gcc_assert (DECL_P (decl));
4449 /* Give the FE a chance to remove its own data first. */
4450 lang_hooks.free_lang_data (decl);
4452 TREE_LANG_FLAG_0 (decl) = 0;
4453 TREE_LANG_FLAG_1 (decl) = 0;
4454 TREE_LANG_FLAG_2 (decl) = 0;
4455 TREE_LANG_FLAG_3 (decl) = 0;
4456 TREE_LANG_FLAG_4 (decl) = 0;
4457 TREE_LANG_FLAG_5 (decl) = 0;
4458 TREE_LANG_FLAG_6 (decl) = 0;
4460 /* Identifiers need not have a type. */
4461 if (DECL_NAME (decl))
4462 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4464 /* Ignore any intervening types, because we are going to clear their
4465 TYPE_CONTEXT fields. */
4466 if (TREE_CODE (decl) != FIELD_DECL
4467 && TREE_CODE (decl) != FUNCTION_DECL)
4468 DECL_CONTEXT (decl) = decl_function_context (decl);
4470 if (DECL_CONTEXT (decl)
4471 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4472 DECL_CONTEXT (decl) = NULL_TREE;
4474 if (TREE_CODE (decl) == VAR_DECL)
4476 tree context = DECL_CONTEXT (decl);
4480 enum tree_code code = TREE_CODE (context);
4481 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4483 /* Do not clear the decl context here, that will promote
4484 all vars to global ones. */
4485 DECL_INITIAL (decl) = NULL_TREE;
4488 if (TREE_STATIC (decl))
4489 DECL_CONTEXT (decl) = NULL_TREE;
4493 free_lang_data_in_one_sizepos (&DECL_SIZE (decl));
4494 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl));
4495 if (TREE_CODE (decl) == FIELD_DECL)
4496 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl));
4498 /* DECL_FCONTEXT is only used for debug info generation. */
4499 if (TREE_CODE (decl) == FIELD_DECL
4500 && debug_info_level < DINFO_LEVEL_TERSE)
4501 DECL_FCONTEXT (decl) = NULL_TREE;
4503 if (TREE_CODE (decl) == FUNCTION_DECL)
4505 if (gimple_has_body_p (decl))
4509 struct pointer_set_t *locals;
4511 /* If DECL has a gimple body, then the context for its
4512 arguments must be DECL. Otherwise, it doesn't really
4513 matter, as we will not be emitting any code for DECL. In
4514 general, there may be other instances of DECL created by
4515 the front end and since PARM_DECLs are generally shared,
4516 their DECL_CONTEXT changes as the replicas of DECL are
4517 created. The only time where DECL_CONTEXT is important
4518 is for the FUNCTION_DECLs that have a gimple body (since
4519 the PARM_DECL will be used in the function's body). */
4520 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4521 DECL_CONTEXT (t) = decl;
4523 /* Collect all the symbols declared in DECL. */
4524 locals = pointer_set_create ();
4525 FOR_EACH_LOCAL_DECL (DECL_STRUCT_FUNCTION (decl), ix, t)
4527 pointer_set_insert (locals, t);
4529 /* All the local symbols should have DECL as their
4531 DECL_CONTEXT (t) = decl;
4534 /* Get rid of any decl not in local_decls. */
4535 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4537 pointer_set_destroy (locals);
4540 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4541 At this point, it is not needed anymore. */
4542 DECL_SAVED_TREE (decl) = NULL_TREE;
4544 else if (TREE_CODE (decl) == VAR_DECL)
4546 tree expr = DECL_DEBUG_EXPR (decl);
4548 && TREE_CODE (expr) == VAR_DECL
4549 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4550 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4552 if (DECL_EXTERNAL (decl)
4553 && (!TREE_STATIC (decl) || !TREE_READONLY (decl)))
4554 DECL_INITIAL (decl) = NULL_TREE;
4556 else if (TREE_CODE (decl) == TYPE_DECL)
4558 DECL_INITIAL (decl) = NULL_TREE;
4560 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4561 FIELD_DECLs, which should be preserved. Otherwise,
4562 we shouldn't be concerned with source-level lexical
4563 nesting beyond this point. */
4564 DECL_CONTEXT (decl) = NULL_TREE;
4569 /* Data used when collecting DECLs and TYPEs for language data removal. */
4571 struct free_lang_data_d
4573 /* Worklist to avoid excessive recursion. */
4574 VEC(tree,heap) *worklist;
4576 /* Set of traversed objects. Used to avoid duplicate visits. */
4577 struct pointer_set_t *pset;
4579 /* Array of symbols to process with free_lang_data_in_decl. */
4580 VEC(tree,heap) *decls;
4582 /* Array of types to process with free_lang_data_in_type. */
4583 VEC(tree,heap) *types;
4587 /* Save all language fields needed to generate proper debug information
4588 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4591 save_debug_info_for_decl (tree t)
4593 /*struct saved_debug_info_d *sdi;*/
4595 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4597 /* FIXME. Partial implementation for saving debug info removed. */
4601 /* Save all language fields needed to generate proper debug information
4602 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4605 save_debug_info_for_type (tree t)
4607 /*struct saved_debug_info_d *sdi;*/
4609 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4611 /* FIXME. Partial implementation for saving debug info removed. */
4615 /* Add type or decl T to one of the list of tree nodes that need their
4616 language data removed. The lists are held inside FLD. */
4619 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4623 VEC_safe_push (tree, heap, fld->decls, t);
4624 if (debug_info_level > DINFO_LEVEL_TERSE)
4625 save_debug_info_for_decl (t);
4627 else if (TYPE_P (t))
4629 VEC_safe_push (tree, heap, fld->types, t);
4630 if (debug_info_level > DINFO_LEVEL_TERSE)
4631 save_debug_info_for_type (t);
4637 /* Push tree node T into FLD->WORKLIST. */
4640 fld_worklist_push (tree t, struct free_lang_data_d *fld)
4642 if (t && !is_lang_specific (t) && !pointer_set_contains (fld->pset, t))
4643 VEC_safe_push (tree, heap, fld->worklist, (t));
4647 /* Operand callback helper for free_lang_data_in_node. *TP is the
4648 subtree operand being considered. */
4651 find_decls_types_r (tree *tp, int *ws, void *data)
4654 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4656 if (TREE_CODE (t) == TREE_LIST)
4659 /* Language specific nodes will be removed, so there is no need
4660 to gather anything under them. */
4661 if (is_lang_specific (t))
4669 /* Note that walk_tree does not traverse every possible field in
4670 decls, so we have to do our own traversals here. */
4671 add_tree_to_fld_list (t, fld);
4673 fld_worklist_push (DECL_NAME (t), fld);
4674 fld_worklist_push (DECL_CONTEXT (t), fld);
4675 fld_worklist_push (DECL_SIZE (t), fld);
4676 fld_worklist_push (DECL_SIZE_UNIT (t), fld);
4678 /* We are going to remove everything under DECL_INITIAL for
4679 TYPE_DECLs. No point walking them. */
4680 if (TREE_CODE (t) != TYPE_DECL)
4681 fld_worklist_push (DECL_INITIAL (t), fld);
4683 fld_worklist_push (DECL_ATTRIBUTES (t), fld);
4684 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t), fld);
4686 if (TREE_CODE (t) == FUNCTION_DECL)
4688 fld_worklist_push (DECL_ARGUMENTS (t), fld);
4689 fld_worklist_push (DECL_RESULT (t), fld);
4691 else if (TREE_CODE (t) == TYPE_DECL)
4693 fld_worklist_push (DECL_ARGUMENT_FLD (t), fld);
4694 fld_worklist_push (DECL_VINDEX (t), fld);
4696 else if (TREE_CODE (t) == FIELD_DECL)
4698 fld_worklist_push (DECL_FIELD_OFFSET (t), fld);
4699 fld_worklist_push (DECL_BIT_FIELD_TYPE (t), fld);
4700 fld_worklist_push (DECL_QUALIFIER (t), fld);
4701 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t), fld);
4702 fld_worklist_push (DECL_FCONTEXT (t), fld);
4704 else if (TREE_CODE (t) == VAR_DECL)
4706 fld_worklist_push (DECL_SECTION_NAME (t), fld);
4707 fld_worklist_push (DECL_COMDAT_GROUP (t), fld);
4710 if ((TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == PARM_DECL)
4711 && DECL_HAS_VALUE_EXPR_P (t))
4712 fld_worklist_push (DECL_VALUE_EXPR (t), fld);
4714 if (TREE_CODE (t) != FIELD_DECL
4715 && TREE_CODE (t) != TYPE_DECL)
4716 fld_worklist_push (TREE_CHAIN (t), fld);
4719 else if (TYPE_P (t))
4721 /* Note that walk_tree does not traverse every possible field in
4722 types, so we have to do our own traversals here. */
4723 add_tree_to_fld_list (t, fld);
4725 if (!RECORD_OR_UNION_TYPE_P (t))
4726 fld_worklist_push (TYPE_CACHED_VALUES (t), fld);
4727 fld_worklist_push (TYPE_SIZE (t), fld);
4728 fld_worklist_push (TYPE_SIZE_UNIT (t), fld);
4729 fld_worklist_push (TYPE_ATTRIBUTES (t), fld);
4730 fld_worklist_push (TYPE_POINTER_TO (t), fld);
4731 fld_worklist_push (TYPE_REFERENCE_TO (t), fld);
4732 fld_worklist_push (TYPE_NAME (t), fld);
4733 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4734 them and thus do not and want not to reach unused pointer types
4736 if (!POINTER_TYPE_P (t))
4737 fld_worklist_push (TYPE_MINVAL (t), fld);
4738 if (!RECORD_OR_UNION_TYPE_P (t))
4739 fld_worklist_push (TYPE_MAXVAL (t), fld);
4740 fld_worklist_push (TYPE_MAIN_VARIANT (t), fld);
4741 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4742 do not and want not to reach unused variants this way. */
4743 fld_worklist_push (TYPE_CONTEXT (t), fld);
4744 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4745 and want not to reach unused types this way. */
4747 if (RECORD_OR_UNION_TYPE_P (t) && TYPE_BINFO (t))
4751 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (TYPE_BINFO (t)),
4753 fld_worklist_push (TREE_TYPE (tem), fld);
4754 tem = BINFO_VIRTUALS (TYPE_BINFO (t));
4756 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4757 && TREE_CODE (tem) == TREE_LIST)
4760 fld_worklist_push (TREE_VALUE (tem), fld);
4761 tem = TREE_CHAIN (tem);
4765 if (RECORD_OR_UNION_TYPE_P (t))
4768 /* Push all TYPE_FIELDS - there can be interleaving interesting
4769 and non-interesting things. */
4770 tem = TYPE_FIELDS (t);
4773 if (TREE_CODE (tem) == FIELD_DECL)
4774 fld_worklist_push (tem, fld);
4775 tem = TREE_CHAIN (tem);
4779 fld_worklist_push (TREE_CHAIN (t), fld);
4782 else if (TREE_CODE (t) == BLOCK)
4785 for (tem = BLOCK_VARS (t); tem; tem = TREE_CHAIN (tem))
4786 fld_worklist_push (tem, fld);
4787 for (tem = BLOCK_SUBBLOCKS (t); tem; tem = BLOCK_CHAIN (tem))
4788 fld_worklist_push (tem, fld);
4789 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t), fld);
4792 fld_worklist_push (TREE_TYPE (t), fld);
4798 /* Find decls and types in T. */
4801 find_decls_types (tree t, struct free_lang_data_d *fld)
4805 if (!pointer_set_contains (fld->pset, t))
4806 walk_tree (&t, find_decls_types_r, fld, fld->pset);
4807 if (VEC_empty (tree, fld->worklist))
4809 t = VEC_pop (tree, fld->worklist);
4813 /* Translate all the types in LIST with the corresponding runtime
4817 get_eh_types_for_runtime (tree list)
4821 if (list == NULL_TREE)
4824 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4826 list = TREE_CHAIN (list);
4829 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4830 TREE_CHAIN (prev) = n;
4831 prev = TREE_CHAIN (prev);
4832 list = TREE_CHAIN (list);
4839 /* Find decls and types referenced in EH region R and store them in
4840 FLD->DECLS and FLD->TYPES. */
4843 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4854 /* The types referenced in each catch must first be changed to the
4855 EH types used at runtime. This removes references to FE types
4857 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
4859 c->type_list = get_eh_types_for_runtime (c->type_list);
4860 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
4865 case ERT_ALLOWED_EXCEPTIONS:
4866 r->u.allowed.type_list
4867 = get_eh_types_for_runtime (r->u.allowed.type_list);
4868 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4871 case ERT_MUST_NOT_THROW:
4872 walk_tree (&r->u.must_not_throw.failure_decl,
4873 find_decls_types_r, fld, fld->pset);
4879 /* Find decls and types referenced in cgraph node N and store them in
4880 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4881 look for *every* kind of DECL and TYPE node reachable from N,
4882 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4883 NAMESPACE_DECLs, etc). */
4886 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4889 struct function *fn;
4893 find_decls_types (n->decl, fld);
4895 if (!gimple_has_body_p (n->decl))
4898 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4900 fn = DECL_STRUCT_FUNCTION (n->decl);
4902 /* Traverse locals. */
4903 FOR_EACH_LOCAL_DECL (fn, ix, t)
4904 find_decls_types (t, fld);
4906 /* Traverse EH regions in FN. */
4909 FOR_ALL_EH_REGION_FN (r, fn)
4910 find_decls_types_in_eh_region (r, fld);
4913 /* Traverse every statement in FN. */
4914 FOR_EACH_BB_FN (bb, fn)
4916 gimple_stmt_iterator si;
4919 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4921 gimple phi = gsi_stmt (si);
4923 for (i = 0; i < gimple_phi_num_args (phi); i++)
4925 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4926 find_decls_types (*arg_p, fld);
4930 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4932 gimple stmt = gsi_stmt (si);
4934 for (i = 0; i < gimple_num_ops (stmt); i++)
4936 tree arg = gimple_op (stmt, i);
4937 find_decls_types (arg, fld);
4944 /* Find decls and types referenced in varpool node N and store them in
4945 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4946 look for *every* kind of DECL and TYPE node reachable from N,
4947 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4948 NAMESPACE_DECLs, etc). */
4951 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4953 find_decls_types (v->decl, fld);
4956 /* If T needs an assembler name, have one created for it. */
4959 assign_assembler_name_if_neeeded (tree t)
4961 if (need_assembler_name_p (t))
4963 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4964 diagnostics that use input_location to show locus
4965 information. The problem here is that, at this point,
4966 input_location is generally anchored to the end of the file
4967 (since the parser is long gone), so we don't have a good
4968 position to pin it to.
4970 To alleviate this problem, this uses the location of T's
4971 declaration. Examples of this are
4972 testsuite/g++.dg/template/cond2.C and
4973 testsuite/g++.dg/template/pr35240.C. */
4974 location_t saved_location = input_location;
4975 input_location = DECL_SOURCE_LOCATION (t);
4977 decl_assembler_name (t);
4979 input_location = saved_location;
4984 /* Free language specific information for every operand and expression
4985 in every node of the call graph. This process operates in three stages:
4987 1- Every callgraph node and varpool node is traversed looking for
4988 decls and types embedded in them. This is a more exhaustive
4989 search than that done by find_referenced_vars, because it will
4990 also collect individual fields, decls embedded in types, etc.
4992 2- All the decls found are sent to free_lang_data_in_decl.
4994 3- All the types found are sent to free_lang_data_in_type.
4996 The ordering between decls and types is important because
4997 free_lang_data_in_decl sets assembler names, which includes
4998 mangling. So types cannot be freed up until assembler names have
5002 free_lang_data_in_cgraph (void)
5004 struct cgraph_node *n;
5005 struct varpool_node *v;
5006 struct free_lang_data_d fld;
5011 /* Initialize sets and arrays to store referenced decls and types. */
5012 fld.pset = pointer_set_create ();
5013 fld.worklist = NULL;
5014 fld.decls = VEC_alloc (tree, heap, 100);
5015 fld.types = VEC_alloc (tree, heap, 100);
5017 /* Find decls and types in the body of every function in the callgraph. */
5018 for (n = cgraph_nodes; n; n = n->next)
5019 find_decls_types_in_node (n, &fld);
5021 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
5022 find_decls_types (p->decl, &fld);
5024 /* Find decls and types in every varpool symbol. */
5025 for (v = varpool_nodes_queue; v; v = v->next_needed)
5026 find_decls_types_in_var (v, &fld);
5028 /* Set the assembler name on every decl found. We need to do this
5029 now because free_lang_data_in_decl will invalidate data needed
5030 for mangling. This breaks mangling on interdependent decls. */
5031 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
5032 assign_assembler_name_if_neeeded (t);
5034 /* Traverse every decl found freeing its language data. */
5035 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
5036 free_lang_data_in_decl (t);
5038 /* Traverse every type found freeing its language data. */
5039 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
5040 free_lang_data_in_type (t);
5042 pointer_set_destroy (fld.pset);
5043 VEC_free (tree, heap, fld.worklist);
5044 VEC_free (tree, heap, fld.decls);
5045 VEC_free (tree, heap, fld.types);
5049 /* Free resources that are used by FE but are not needed once they are done. */
5052 free_lang_data (void)
5056 /* If we are the LTO frontend we have freed lang-specific data already. */
5058 || !flag_generate_lto)
5061 /* Allocate and assign alias sets to the standard integer types
5062 while the slots are still in the way the frontends generated them. */
5063 for (i = 0; i < itk_none; ++i)
5064 if (integer_types[i])
5065 TYPE_ALIAS_SET (integer_types[i]) = get_alias_set (integer_types[i]);
5067 /* Traverse the IL resetting language specific information for
5068 operands, expressions, etc. */
5069 free_lang_data_in_cgraph ();
5071 /* Create gimple variants for common types. */
5072 ptrdiff_type_node = integer_type_node;
5073 fileptr_type_node = ptr_type_node;
5074 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
5075 || (TYPE_MODE (boolean_type_node)
5076 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
5077 || TYPE_PRECISION (boolean_type_node) != 1
5078 || !TYPE_UNSIGNED (boolean_type_node))
5080 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5081 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5082 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5083 TYPE_PRECISION (boolean_type_node) = 1;
5084 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5085 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5088 /* Unify char_type_node with its properly signed variant. */
5089 if (TYPE_UNSIGNED (char_type_node))
5090 unsigned_char_type_node = char_type_node;
5092 signed_char_type_node = char_type_node;
5094 /* Reset some langhooks. Do not reset types_compatible_p, it may
5095 still be used indirectly via the get_alias_set langhook. */
5096 lang_hooks.callgraph.analyze_expr = NULL;
5097 lang_hooks.dwarf_name = lhd_dwarf_name;
5098 lang_hooks.decl_printable_name = gimple_decl_printable_name;
5099 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
5101 /* Reset diagnostic machinery. */
5102 diagnostic_starter (global_dc) = default_tree_diagnostic_starter;
5103 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
5104 diagnostic_format_decoder (global_dc) = default_tree_printer;
5110 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
5114 "*free_lang_data", /* name */
5116 free_lang_data, /* execute */
5119 0, /* static_pass_number */
5120 TV_IPA_FREE_LANG_DATA, /* tv_id */
5121 0, /* properties_required */
5122 0, /* properties_provided */
5123 0, /* properties_destroyed */
5124 0, /* todo_flags_start */
5125 TODO_ggc_collect /* todo_flags_finish */
5129 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5132 We try both `text' and `__text__', ATTR may be either one. */
5133 /* ??? It might be a reasonable simplification to require ATTR to be only
5134 `text'. One might then also require attribute lists to be stored in
5135 their canonicalized form. */
5138 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
5143 if (TREE_CODE (ident) != IDENTIFIER_NODE)
5146 p = IDENTIFIER_POINTER (ident);
5147 ident_len = IDENTIFIER_LENGTH (ident);
5149 if (ident_len == attr_len
5150 && strcmp (attr, p) == 0)
5153 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5156 gcc_assert (attr[1] == '_');
5157 gcc_assert (attr[attr_len - 2] == '_');
5158 gcc_assert (attr[attr_len - 1] == '_');
5159 if (ident_len == attr_len - 4
5160 && strncmp (attr + 2, p, attr_len - 4) == 0)
5165 if (ident_len == attr_len + 4
5166 && p[0] == '_' && p[1] == '_'
5167 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
5168 && strncmp (attr, p + 2, attr_len) == 0)
5175 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5178 We try both `text' and `__text__', ATTR may be either one. */
5181 is_attribute_p (const char *attr, const_tree ident)
5183 return is_attribute_with_length_p (attr, strlen (attr), ident);
5186 /* Given an attribute name and a list of attributes, return a pointer to the
5187 attribute's list element if the attribute is part of the list, or NULL_TREE
5188 if not found. If the attribute appears more than once, this only
5189 returns the first occurrence; the TREE_CHAIN of the return value should
5190 be passed back in if further occurrences are wanted. */
5193 lookup_attribute (const char *attr_name, tree list)
5196 size_t attr_len = strlen (attr_name);
5198 for (l = list; l; l = TREE_CHAIN (l))
5200 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5201 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5207 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5211 remove_attribute (const char *attr_name, tree list)
5214 size_t attr_len = strlen (attr_name);
5216 for (p = &list; *p; )
5219 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
5220 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
5221 *p = TREE_CHAIN (l);
5223 p = &TREE_CHAIN (l);
5229 /* Return an attribute list that is the union of a1 and a2. */
5232 merge_attributes (tree a1, tree a2)
5236 /* Either one unset? Take the set one. */
5238 if ((attributes = a1) == 0)
5241 /* One that completely contains the other? Take it. */
5243 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5245 if (attribute_list_contained (a2, a1))
5249 /* Pick the longest list, and hang on the other list. */
5251 if (list_length (a1) < list_length (a2))
5252 attributes = a2, a2 = a1;
5254 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5257 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5260 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5263 if (TREE_VALUE (a) != NULL
5264 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5265 && TREE_VALUE (a2) != NULL
5266 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5268 if (simple_cst_list_equal (TREE_VALUE (a),
5269 TREE_VALUE (a2)) == 1)
5272 else if (simple_cst_equal (TREE_VALUE (a),
5273 TREE_VALUE (a2)) == 1)
5278 a1 = copy_node (a2);
5279 TREE_CHAIN (a1) = attributes;
5288 /* Given types T1 and T2, merge their attributes and return
5292 merge_type_attributes (tree t1, tree t2)
5294 return merge_attributes (TYPE_ATTRIBUTES (t1),
5295 TYPE_ATTRIBUTES (t2));
5298 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5302 merge_decl_attributes (tree olddecl, tree newdecl)
5304 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5305 DECL_ATTRIBUTES (newdecl));
5308 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5310 /* Specialization of merge_decl_attributes for various Windows targets.
5312 This handles the following situation:
5314 __declspec (dllimport) int foo;
5317 The second instance of `foo' nullifies the dllimport. */
5320 merge_dllimport_decl_attributes (tree old, tree new_tree)
5323 int delete_dllimport_p = 1;
5325 /* What we need to do here is remove from `old' dllimport if it doesn't
5326 appear in `new'. dllimport behaves like extern: if a declaration is
5327 marked dllimport and a definition appears later, then the object
5328 is not dllimport'd. We also remove a `new' dllimport if the old list
5329 contains dllexport: dllexport always overrides dllimport, regardless
5330 of the order of declaration. */
5331 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5332 delete_dllimport_p = 0;
5333 else if (DECL_DLLIMPORT_P (new_tree)
5334 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5336 DECL_DLLIMPORT_P (new_tree) = 0;
5337 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5338 "dllimport ignored", new_tree);
5340 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5342 /* Warn about overriding a symbol that has already been used, e.g.:
5343 extern int __attribute__ ((dllimport)) foo;
5344 int* bar () {return &foo;}
5347 if (TREE_USED (old))
5349 warning (0, "%q+D redeclared without dllimport attribute "
5350 "after being referenced with dll linkage", new_tree);
5351 /* If we have used a variable's address with dllimport linkage,
5352 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5353 decl may already have had TREE_CONSTANT computed.
5354 We still remove the attribute so that assembler code refers
5355 to '&foo rather than '_imp__foo'. */
5356 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5357 DECL_DLLIMPORT_P (new_tree) = 1;
5360 /* Let an inline definition silently override the external reference,
5361 but otherwise warn about attribute inconsistency. */
5362 else if (TREE_CODE (new_tree) == VAR_DECL
5363 || !DECL_DECLARED_INLINE_P (new_tree))
5364 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5365 "previous dllimport ignored", new_tree);
5368 delete_dllimport_p = 0;
5370 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5372 if (delete_dllimport_p)
5375 const size_t attr_len = strlen ("dllimport");
5377 /* Scan the list for dllimport and delete it. */
5378 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5380 if (is_attribute_with_length_p ("dllimport", attr_len,
5383 if (prev == NULL_TREE)
5386 TREE_CHAIN (prev) = TREE_CHAIN (t);
5395 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5396 struct attribute_spec.handler. */
5399 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5405 /* These attributes may apply to structure and union types being created,
5406 but otherwise should pass to the declaration involved. */
5409 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5410 | (int) ATTR_FLAG_ARRAY_NEXT))
5412 *no_add_attrs = true;
5413 return tree_cons (name, args, NULL_TREE);
5415 if (TREE_CODE (node) == RECORD_TYPE
5416 || TREE_CODE (node) == UNION_TYPE)
5418 node = TYPE_NAME (node);
5424 warning (OPT_Wattributes, "%qE attribute ignored",
5426 *no_add_attrs = true;
5431 if (TREE_CODE (node) != FUNCTION_DECL
5432 && TREE_CODE (node) != VAR_DECL
5433 && TREE_CODE (node) != TYPE_DECL)
5435 *no_add_attrs = true;
5436 warning (OPT_Wattributes, "%qE attribute ignored",
5441 if (TREE_CODE (node) == TYPE_DECL
5442 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5443 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5445 *no_add_attrs = true;
5446 warning (OPT_Wattributes, "%qE attribute ignored",
5451 is_dllimport = is_attribute_p ("dllimport", name);
5453 /* Report error on dllimport ambiguities seen now before they cause
5457 /* Honor any target-specific overrides. */
5458 if (!targetm.valid_dllimport_attribute_p (node))
5459 *no_add_attrs = true;
5461 else if (TREE_CODE (node) == FUNCTION_DECL
5462 && DECL_DECLARED_INLINE_P (node))
5464 warning (OPT_Wattributes, "inline function %q+D declared as "
5465 " dllimport: attribute ignored", node);
5466 *no_add_attrs = true;
5468 /* Like MS, treat definition of dllimported variables and
5469 non-inlined functions on declaration as syntax errors. */
5470 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5472 error ("function %q+D definition is marked dllimport", node);
5473 *no_add_attrs = true;
5476 else if (TREE_CODE (node) == VAR_DECL)
5478 if (DECL_INITIAL (node))
5480 error ("variable %q+D definition is marked dllimport",
5482 *no_add_attrs = true;
5485 /* `extern' needn't be specified with dllimport.
5486 Specify `extern' now and hope for the best. Sigh. */
5487 DECL_EXTERNAL (node) = 1;
5488 /* Also, implicitly give dllimport'd variables declared within
5489 a function global scope, unless declared static. */
5490 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5491 TREE_PUBLIC (node) = 1;
5494 if (*no_add_attrs == false)
5495 DECL_DLLIMPORT_P (node) = 1;
5497 else if (TREE_CODE (node) == FUNCTION_DECL
5498 && DECL_DECLARED_INLINE_P (node))
5499 /* An exported function, even if inline, must be emitted. */
5500 DECL_EXTERNAL (node) = 0;
5502 /* Report error if symbol is not accessible at global scope. */
5503 if (!TREE_PUBLIC (node)
5504 && (TREE_CODE (node) == VAR_DECL
5505 || TREE_CODE (node) == FUNCTION_DECL))
5507 error ("external linkage required for symbol %q+D because of "
5508 "%qE attribute", node, name);
5509 *no_add_attrs = true;
5512 /* A dllexport'd entity must have default visibility so that other
5513 program units (shared libraries or the main executable) can see
5514 it. A dllimport'd entity must have default visibility so that
5515 the linker knows that undefined references within this program
5516 unit can be resolved by the dynamic linker. */
5519 if (DECL_VISIBILITY_SPECIFIED (node)
5520 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5521 error ("%qE implies default visibility, but %qD has already "
5522 "been declared with a different visibility",
5524 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5525 DECL_VISIBILITY_SPECIFIED (node) = 1;
5531 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5533 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5534 of the various TYPE_QUAL values. */
5537 set_type_quals (tree type, int type_quals)
5539 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5540 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5541 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5542 TYPE_ADDR_SPACE (type) = DECODE_QUAL_ADDR_SPACE (type_quals);
5545 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5548 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5550 return (TYPE_QUALS (cand) == type_quals
5551 && TYPE_NAME (cand) == TYPE_NAME (base)
5552 /* Apparently this is needed for Objective-C. */
5553 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5554 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5555 TYPE_ATTRIBUTES (base)));
5558 /* Return a version of the TYPE, qualified as indicated by the
5559 TYPE_QUALS, if one exists. If no qualified version exists yet,
5560 return NULL_TREE. */
5563 get_qualified_type (tree type, int type_quals)
5567 if (TYPE_QUALS (type) == type_quals)
5570 /* Search the chain of variants to see if there is already one there just
5571 like the one we need to have. If so, use that existing one. We must
5572 preserve the TYPE_NAME, since there is code that depends on this. */
5573 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5574 if (check_qualified_type (t, type, type_quals))
5580 /* Like get_qualified_type, but creates the type if it does not
5581 exist. This function never returns NULL_TREE. */
5584 build_qualified_type (tree type, int type_quals)
5588 /* See if we already have the appropriate qualified variant. */
5589 t = get_qualified_type (type, type_quals);
5591 /* If not, build it. */
5594 t = build_variant_type_copy (type);
5595 set_type_quals (t, type_quals);
5597 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5598 /* Propagate structural equality. */
5599 SET_TYPE_STRUCTURAL_EQUALITY (t);
5600 else if (TYPE_CANONICAL (type) != type)
5601 /* Build the underlying canonical type, since it is different
5603 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5606 /* T is its own canonical type. */
5607 TYPE_CANONICAL (t) = t;
5614 /* Create a new distinct copy of TYPE. The new type is made its own
5615 MAIN_VARIANT. If TYPE requires structural equality checks, the
5616 resulting type requires structural equality checks; otherwise, its
5617 TYPE_CANONICAL points to itself. */
5620 build_distinct_type_copy (tree type)
5622 tree t = copy_node (type);
5624 TYPE_POINTER_TO (t) = 0;
5625 TYPE_REFERENCE_TO (t) = 0;
5627 /* Set the canonical type either to a new equivalence class, or
5628 propagate the need for structural equality checks. */
5629 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5630 SET_TYPE_STRUCTURAL_EQUALITY (t);
5632 TYPE_CANONICAL (t) = t;
5634 /* Make it its own variant. */
5635 TYPE_MAIN_VARIANT (t) = t;
5636 TYPE_NEXT_VARIANT (t) = 0;
5638 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5639 whose TREE_TYPE is not t. This can also happen in the Ada
5640 frontend when using subtypes. */
5645 /* Create a new variant of TYPE, equivalent but distinct. This is so
5646 the caller can modify it. TYPE_CANONICAL for the return type will
5647 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5648 are considered equal by the language itself (or that both types
5649 require structural equality checks). */
5652 build_variant_type_copy (tree type)
5654 tree t, m = TYPE_MAIN_VARIANT (type);
5656 t = build_distinct_type_copy (type);
5658 /* Since we're building a variant, assume that it is a non-semantic
5659 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5660 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5662 /* Add the new type to the chain of variants of TYPE. */
5663 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5664 TYPE_NEXT_VARIANT (m) = t;
5665 TYPE_MAIN_VARIANT (t) = m;
5670 /* Return true if the from tree in both tree maps are equal. */
5673 tree_map_base_eq (const void *va, const void *vb)
5675 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5676 *const b = (const struct tree_map_base *) vb;
5677 return (a->from == b->from);
5680 /* Hash a from tree in a tree_base_map. */
5683 tree_map_base_hash (const void *item)
5685 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5688 /* Return true if this tree map structure is marked for garbage collection
5689 purposes. We simply return true if the from tree is marked, so that this
5690 structure goes away when the from tree goes away. */
5693 tree_map_base_marked_p (const void *p)
5695 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5698 /* Hash a from tree in a tree_map. */
5701 tree_map_hash (const void *item)
5703 return (((const struct tree_map *) item)->hash);
5706 /* Hash a from tree in a tree_decl_map. */
5709 tree_decl_map_hash (const void *item)
5711 return DECL_UID (((const struct tree_decl_map *) item)->base.from);
5714 /* Return the initialization priority for DECL. */
5717 decl_init_priority_lookup (tree decl)
5719 struct tree_priority_map *h;
5720 struct tree_map_base in;
5722 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5724 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5725 return h ? h->init : DEFAULT_INIT_PRIORITY;
5728 /* Return the finalization priority for DECL. */
5731 decl_fini_priority_lookup (tree decl)
5733 struct tree_priority_map *h;
5734 struct tree_map_base in;
5736 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5738 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5739 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5742 /* Return the initialization and finalization priority information for
5743 DECL. If there is no previous priority information, a freshly
5744 allocated structure is returned. */
5746 static struct tree_priority_map *
5747 decl_priority_info (tree decl)
5749 struct tree_priority_map in;
5750 struct tree_priority_map *h;
5753 in.base.from = decl;
5754 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5755 h = (struct tree_priority_map *) *loc;
5758 h = ggc_alloc_cleared_tree_priority_map ();
5760 h->base.from = decl;
5761 h->init = DEFAULT_INIT_PRIORITY;
5762 h->fini = DEFAULT_INIT_PRIORITY;
5768 /* Set the initialization priority for DECL to PRIORITY. */
5771 decl_init_priority_insert (tree decl, priority_type priority)
5773 struct tree_priority_map *h;
5775 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5776 h = decl_priority_info (decl);
5780 /* Set the finalization priority for DECL to PRIORITY. */
5783 decl_fini_priority_insert (tree decl, priority_type priority)
5785 struct tree_priority_map *h;
5787 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5788 h = decl_priority_info (decl);
5792 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5795 print_debug_expr_statistics (void)
5797 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5798 (long) htab_size (debug_expr_for_decl),
5799 (long) htab_elements (debug_expr_for_decl),
5800 htab_collisions (debug_expr_for_decl));
5803 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5806 print_value_expr_statistics (void)
5808 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5809 (long) htab_size (value_expr_for_decl),
5810 (long) htab_elements (value_expr_for_decl),
5811 htab_collisions (value_expr_for_decl));
5814 /* Lookup a debug expression for FROM, and return it if we find one. */
5817 decl_debug_expr_lookup (tree from)
5819 struct tree_decl_map *h, in;
5820 in.base.from = from;
5822 h = (struct tree_decl_map *)
5823 htab_find_with_hash (debug_expr_for_decl, &in, DECL_UID (from));
5829 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5832 decl_debug_expr_insert (tree from, tree to)
5834 struct tree_decl_map *h;
5837 h = ggc_alloc_tree_decl_map ();
5838 h->base.from = from;
5840 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, DECL_UID (from),
5842 *(struct tree_decl_map **) loc = h;
5845 /* Lookup a value expression for FROM, and return it if we find one. */
5848 decl_value_expr_lookup (tree from)
5850 struct tree_decl_map *h, in;
5851 in.base.from = from;
5853 h = (struct tree_decl_map *)
5854 htab_find_with_hash (value_expr_for_decl, &in, DECL_UID (from));
5860 /* Insert a mapping FROM->TO in the value expression hashtable. */
5863 decl_value_expr_insert (tree from, tree to)
5865 struct tree_decl_map *h;
5868 h = ggc_alloc_tree_decl_map ();
5869 h->base.from = from;
5871 loc = htab_find_slot_with_hash (value_expr_for_decl, h, DECL_UID (from),
5873 *(struct tree_decl_map **) loc = h;
5876 /* Hashing of types so that we don't make duplicates.
5877 The entry point is `type_hash_canon'. */
5879 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5880 with types in the TREE_VALUE slots), by adding the hash codes
5881 of the individual types. */
5884 type_hash_list (const_tree list, hashval_t hashcode)
5888 for (tail = list; tail; tail = TREE_CHAIN (tail))
5889 if (TREE_VALUE (tail) != error_mark_node)
5890 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5896 /* These are the Hashtable callback functions. */
5898 /* Returns true iff the types are equivalent. */
5901 type_hash_eq (const void *va, const void *vb)
5903 const struct type_hash *const a = (const struct type_hash *) va,
5904 *const b = (const struct type_hash *) vb;
5906 /* First test the things that are the same for all types. */
5907 if (a->hash != b->hash
5908 || TREE_CODE (a->type) != TREE_CODE (b->type)
5909 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5910 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5911 TYPE_ATTRIBUTES (b->type))
5912 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5913 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5914 || (TREE_CODE (a->type) != COMPLEX_TYPE
5915 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5918 switch (TREE_CODE (a->type))
5923 case REFERENCE_TYPE:
5927 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5930 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5931 && !(TYPE_VALUES (a->type)
5932 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5933 && TYPE_VALUES (b->type)
5934 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5935 && type_list_equal (TYPE_VALUES (a->type),
5936 TYPE_VALUES (b->type))))
5939 /* ... fall through ... */
5944 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5945 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5946 TYPE_MAX_VALUE (b->type)))
5947 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5948 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5949 TYPE_MIN_VALUE (b->type))));
5951 case FIXED_POINT_TYPE:
5952 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5955 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5958 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5959 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5960 || (TYPE_ARG_TYPES (a->type)
5961 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5962 && TYPE_ARG_TYPES (b->type)
5963 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5964 && type_list_equal (TYPE_ARG_TYPES (a->type),
5965 TYPE_ARG_TYPES (b->type)))));
5968 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5972 case QUAL_UNION_TYPE:
5973 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5974 || (TYPE_FIELDS (a->type)
5975 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5976 && TYPE_FIELDS (b->type)
5977 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5978 && type_list_equal (TYPE_FIELDS (a->type),
5979 TYPE_FIELDS (b->type))));
5982 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5983 || (TYPE_ARG_TYPES (a->type)
5984 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5985 && TYPE_ARG_TYPES (b->type)
5986 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5987 && type_list_equal (TYPE_ARG_TYPES (a->type),
5988 TYPE_ARG_TYPES (b->type))))
5996 if (lang_hooks.types.type_hash_eq != NULL)
5997 return lang_hooks.types.type_hash_eq (a->type, b->type);
6002 /* Return the cached hash value. */
6005 type_hash_hash (const void *item)
6007 return ((const struct type_hash *) item)->hash;
6010 /* Look in the type hash table for a type isomorphic to TYPE.
6011 If one is found, return it. Otherwise return 0. */
6014 type_hash_lookup (hashval_t hashcode, tree type)
6016 struct type_hash *h, in;
6018 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6019 must call that routine before comparing TYPE_ALIGNs. */
6025 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
6032 /* Add an entry to the type-hash-table
6033 for a type TYPE whose hash code is HASHCODE. */
6036 type_hash_add (hashval_t hashcode, tree type)
6038 struct type_hash *h;
6041 h = ggc_alloc_type_hash ();
6044 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
6048 /* Given TYPE, and HASHCODE its hash code, return the canonical
6049 object for an identical type if one already exists.
6050 Otherwise, return TYPE, and record it as the canonical object.
6052 To use this function, first create a type of the sort you want.
6053 Then compute its hash code from the fields of the type that
6054 make it different from other similar types.
6055 Then call this function and use the value. */
6058 type_hash_canon (unsigned int hashcode, tree type)
6062 /* The hash table only contains main variants, so ensure that's what we're
6064 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
6066 if (!lang_hooks.types.hash_types)
6069 /* See if the type is in the hash table already. If so, return it.
6070 Otherwise, add the type. */
6071 t1 = type_hash_lookup (hashcode, type);
6074 #ifdef GATHER_STATISTICS
6075 tree_node_counts[(int) t_kind]--;
6076 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
6082 type_hash_add (hashcode, type);
6087 /* See if the data pointed to by the type hash table is marked. We consider
6088 it marked if the type is marked or if a debug type number or symbol
6089 table entry has been made for the type. */
6092 type_hash_marked_p (const void *p)
6094 const_tree const type = ((const struct type_hash *) p)->type;
6096 return ggc_marked_p (type);
6100 print_type_hash_statistics (void)
6102 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
6103 (long) htab_size (type_hash_table),
6104 (long) htab_elements (type_hash_table),
6105 htab_collisions (type_hash_table));
6108 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6109 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6110 by adding the hash codes of the individual attributes. */
6113 attribute_hash_list (const_tree list, hashval_t hashcode)
6117 for (tail = list; tail; tail = TREE_CHAIN (tail))
6118 /* ??? Do we want to add in TREE_VALUE too? */
6119 hashcode = iterative_hash_object
6120 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
6124 /* Given two lists of attributes, return true if list l2 is
6125 equivalent to l1. */
6128 attribute_list_equal (const_tree l1, const_tree l2)
6130 return attribute_list_contained (l1, l2)
6131 && attribute_list_contained (l2, l1);
6134 /* Given two lists of attributes, return true if list L2 is
6135 completely contained within L1. */
6136 /* ??? This would be faster if attribute names were stored in a canonicalized
6137 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6138 must be used to show these elements are equivalent (which they are). */
6139 /* ??? It's not clear that attributes with arguments will always be handled
6143 attribute_list_contained (const_tree l1, const_tree l2)
6147 /* First check the obvious, maybe the lists are identical. */
6151 /* Maybe the lists are similar. */
6152 for (t1 = l1, t2 = l2;
6154 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
6155 && TREE_VALUE (t1) == TREE_VALUE (t2);
6156 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
6158 /* Maybe the lists are equal. */
6159 if (t1 == 0 && t2 == 0)
6162 for (; t2 != 0; t2 = TREE_CHAIN (t2))
6165 /* This CONST_CAST is okay because lookup_attribute does not
6166 modify its argument and the return value is assigned to a
6168 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6169 CONST_CAST_TREE(l1));
6171 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
6174 if (TREE_VALUE (t2) != NULL
6175 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
6176 && TREE_VALUE (attr) != NULL
6177 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
6179 if (simple_cst_list_equal (TREE_VALUE (t2),
6180 TREE_VALUE (attr)) == 1)
6183 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
6194 /* Given two lists of types
6195 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6196 return 1 if the lists contain the same types in the same order.
6197 Also, the TREE_PURPOSEs must match. */
6200 type_list_equal (const_tree l1, const_tree l2)
6204 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
6205 if (TREE_VALUE (t1) != TREE_VALUE (t2)
6206 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
6207 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
6208 && (TREE_TYPE (TREE_PURPOSE (t1))
6209 == TREE_TYPE (TREE_PURPOSE (t2))))))
6215 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6216 given by TYPE. If the argument list accepts variable arguments,
6217 then this function counts only the ordinary arguments. */
6220 type_num_arguments (const_tree type)
6225 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
6226 /* If the function does not take a variable number of arguments,
6227 the last element in the list will have type `void'. */
6228 if (VOID_TYPE_P (TREE_VALUE (t)))
6236 /* Nonzero if integer constants T1 and T2
6237 represent the same constant value. */
6240 tree_int_cst_equal (const_tree t1, const_tree t2)
6245 if (t1 == 0 || t2 == 0)
6248 if (TREE_CODE (t1) == INTEGER_CST
6249 && TREE_CODE (t2) == INTEGER_CST
6250 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6251 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6257 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6258 The precise way of comparison depends on their data type. */
6261 tree_int_cst_lt (const_tree t1, const_tree t2)
6266 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6268 int t1_sgn = tree_int_cst_sgn (t1);
6269 int t2_sgn = tree_int_cst_sgn (t2);
6271 if (t1_sgn < t2_sgn)
6273 else if (t1_sgn > t2_sgn)
6275 /* Otherwise, both are non-negative, so we compare them as
6276 unsigned just in case one of them would overflow a signed
6279 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6280 return INT_CST_LT (t1, t2);
6282 return INT_CST_LT_UNSIGNED (t1, t2);
6285 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6288 tree_int_cst_compare (const_tree t1, const_tree t2)
6290 if (tree_int_cst_lt (t1, t2))
6292 else if (tree_int_cst_lt (t2, t1))
6298 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6299 the host. If POS is zero, the value can be represented in a single
6300 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6301 be represented in a single unsigned HOST_WIDE_INT. */
6304 host_integerp (const_tree t, int pos)
6309 return (TREE_CODE (t) == INTEGER_CST
6310 && ((TREE_INT_CST_HIGH (t) == 0
6311 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6312 || (! pos && TREE_INT_CST_HIGH (t) == -1
6313 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6314 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6315 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6316 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6317 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6320 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6321 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6322 be non-negative. We must be able to satisfy the above conditions. */
6325 tree_low_cst (const_tree t, int pos)
6327 gcc_assert (host_integerp (t, pos));
6328 return TREE_INT_CST_LOW (t);
6331 /* Return the most significant bit of the integer constant T. */
6334 tree_int_cst_msb (const_tree t)
6338 unsigned HOST_WIDE_INT l;
6340 /* Note that using TYPE_PRECISION here is wrong. We care about the
6341 actual bits, not the (arbitrary) range of the type. */
6342 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6343 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6344 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6345 return (l & 1) == 1;
6348 /* Return an indication of the sign of the integer constant T.
6349 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6350 Note that -1 will never be returned if T's type is unsigned. */
6353 tree_int_cst_sgn (const_tree t)
6355 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6357 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6359 else if (TREE_INT_CST_HIGH (t) < 0)
6365 /* Return the minimum number of bits needed to represent VALUE in a
6366 signed or unsigned type, UNSIGNEDP says which. */
6369 tree_int_cst_min_precision (tree value, bool unsignedp)
6373 /* If the value is negative, compute its negative minus 1. The latter
6374 adjustment is because the absolute value of the largest negative value
6375 is one larger than the largest positive value. This is equivalent to
6376 a bit-wise negation, so use that operation instead. */
6378 if (tree_int_cst_sgn (value) < 0)
6379 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6381 /* Return the number of bits needed, taking into account the fact
6382 that we need one more bit for a signed than unsigned type. */
6384 if (integer_zerop (value))
6387 log = tree_floor_log2 (value);
6389 return log + 1 + !unsignedp;
6392 /* Compare two constructor-element-type constants. Return 1 if the lists
6393 are known to be equal; otherwise return 0. */
6396 simple_cst_list_equal (const_tree l1, const_tree l2)
6398 while (l1 != NULL_TREE && l2 != NULL_TREE)
6400 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6403 l1 = TREE_CHAIN (l1);
6404 l2 = TREE_CHAIN (l2);
6410 /* Return truthvalue of whether T1 is the same tree structure as T2.
6411 Return 1 if they are the same.
6412 Return 0 if they are understandably different.
6413 Return -1 if either contains tree structure not understood by
6417 simple_cst_equal (const_tree t1, const_tree t2)
6419 enum tree_code code1, code2;
6425 if (t1 == 0 || t2 == 0)
6428 code1 = TREE_CODE (t1);
6429 code2 = TREE_CODE (t2);
6431 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6433 if (CONVERT_EXPR_CODE_P (code2)
6434 || code2 == NON_LVALUE_EXPR)
6435 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6437 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6440 else if (CONVERT_EXPR_CODE_P (code2)
6441 || code2 == NON_LVALUE_EXPR)
6442 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6450 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6451 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6454 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6457 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6460 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6461 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6462 TREE_STRING_LENGTH (t1)));
6466 unsigned HOST_WIDE_INT idx;
6467 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6468 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6470 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6473 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6474 /* ??? Should we handle also fields here? */
6475 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6476 VEC_index (constructor_elt, v2, idx)->value))
6482 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6485 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6488 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6491 const_tree arg1, arg2;
6492 const_call_expr_arg_iterator iter1, iter2;
6493 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6494 arg2 = first_const_call_expr_arg (t2, &iter2);
6496 arg1 = next_const_call_expr_arg (&iter1),
6497 arg2 = next_const_call_expr_arg (&iter2))
6499 cmp = simple_cst_equal (arg1, arg2);
6503 return arg1 == arg2;
6507 /* Special case: if either target is an unallocated VAR_DECL,
6508 it means that it's going to be unified with whatever the
6509 TARGET_EXPR is really supposed to initialize, so treat it
6510 as being equivalent to anything. */
6511 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6512 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6513 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6514 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6515 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6516 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6519 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6524 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6526 case WITH_CLEANUP_EXPR:
6527 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6531 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6534 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6535 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6549 /* This general rule works for most tree codes. All exceptions should be
6550 handled above. If this is a language-specific tree code, we can't
6551 trust what might be in the operand, so say we don't know
6553 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6556 switch (TREE_CODE_CLASS (code1))
6560 case tcc_comparison:
6561 case tcc_expression:
6565 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6567 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6579 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6580 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6581 than U, respectively. */
6584 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6586 if (tree_int_cst_sgn (t) < 0)
6588 else if (TREE_INT_CST_HIGH (t) != 0)
6590 else if (TREE_INT_CST_LOW (t) == u)
6592 else if (TREE_INT_CST_LOW (t) < u)
6598 /* Return true if CODE represents an associative tree code. Otherwise
6601 associative_tree_code (enum tree_code code)
6620 /* Return true if CODE represents a commutative tree code. Otherwise
6623 commutative_tree_code (enum tree_code code)
6636 case UNORDERED_EXPR:
6640 case TRUTH_AND_EXPR:
6641 case TRUTH_XOR_EXPR:
6651 /* Return true if CODE represents a ternary tree code for which the
6652 first two operands are commutative. Otherwise return false. */
6654 commutative_ternary_tree_code (enum tree_code code)
6658 case WIDEN_MULT_PLUS_EXPR:
6659 case WIDEN_MULT_MINUS_EXPR:
6668 /* Generate a hash value for an expression. This can be used iteratively
6669 by passing a previous result as the VAL argument.
6671 This function is intended to produce the same hash for expressions which
6672 would compare equal using operand_equal_p. */
6675 iterative_hash_expr (const_tree t, hashval_t val)
6678 enum tree_code code;
6682 return iterative_hash_hashval_t (0, val);
6684 code = TREE_CODE (t);
6688 /* Alas, constants aren't shared, so we can't rely on pointer
6691 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6692 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6695 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6697 return iterative_hash_hashval_t (val2, val);
6701 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6703 return iterative_hash_hashval_t (val2, val);
6706 return iterative_hash (TREE_STRING_POINTER (t),
6707 TREE_STRING_LENGTH (t), val);
6709 val = iterative_hash_expr (TREE_REALPART (t), val);
6710 return iterative_hash_expr (TREE_IMAGPART (t), val);
6712 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6714 /* We can just compare by pointer. */
6715 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6716 case PLACEHOLDER_EXPR:
6717 /* The node itself doesn't matter. */
6720 /* A list of expressions, for a CALL_EXPR or as the elements of a
6722 for (; t; t = TREE_CHAIN (t))
6723 val = iterative_hash_expr (TREE_VALUE (t), val);
6727 unsigned HOST_WIDE_INT idx;
6729 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6731 val = iterative_hash_expr (field, val);
6732 val = iterative_hash_expr (value, val);
6737 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6738 Otherwise nodes that compare equal according to operand_equal_p might
6739 get different hash codes. However, don't do this for machine specific
6740 or front end builtins, since the function code is overloaded in those
6742 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6743 && built_in_decls[DECL_FUNCTION_CODE (t)])
6745 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6746 code = TREE_CODE (t);
6750 tclass = TREE_CODE_CLASS (code);
6752 if (tclass == tcc_declaration)
6754 /* DECL's have a unique ID */
6755 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6759 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6761 val = iterative_hash_object (code, val);
6763 /* Don't hash the type, that can lead to having nodes which
6764 compare equal according to operand_equal_p, but which
6765 have different hash codes. */
6766 if (CONVERT_EXPR_CODE_P (code)
6767 || code == NON_LVALUE_EXPR)
6769 /* Make sure to include signness in the hash computation. */
6770 val += TYPE_UNSIGNED (TREE_TYPE (t));
6771 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6774 else if (commutative_tree_code (code))
6776 /* It's a commutative expression. We want to hash it the same
6777 however it appears. We do this by first hashing both operands
6778 and then rehashing based on the order of their independent
6780 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6781 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6785 t = one, one = two, two = t;
6787 val = iterative_hash_hashval_t (one, val);
6788 val = iterative_hash_hashval_t (two, val);
6791 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6792 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6799 /* Generate a hash value for a pair of expressions. This can be used
6800 iteratively by passing a previous result as the VAL argument.
6802 The same hash value is always returned for a given pair of expressions,
6803 regardless of the order in which they are presented. This is useful in
6804 hashing the operands of commutative functions. */
6807 iterative_hash_exprs_commutative (const_tree t1,
6808 const_tree t2, hashval_t val)
6810 hashval_t one = iterative_hash_expr (t1, 0);
6811 hashval_t two = iterative_hash_expr (t2, 0);
6815 t = one, one = two, two = t;
6816 val = iterative_hash_hashval_t (one, val);
6817 val = iterative_hash_hashval_t (two, val);
6822 /* Constructors for pointer, array and function types.
6823 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6824 constructed by language-dependent code, not here.) */
6826 /* Construct, lay out and return the type of pointers to TO_TYPE with
6827 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6828 reference all of memory. If such a type has already been
6829 constructed, reuse it. */
6832 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6837 if (to_type == error_mark_node)
6838 return error_mark_node;
6840 /* If the pointed-to type has the may_alias attribute set, force
6841 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6842 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6843 can_alias_all = true;
6845 /* In some cases, languages will have things that aren't a POINTER_TYPE
6846 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6847 In that case, return that type without regard to the rest of our
6850 ??? This is a kludge, but consistent with the way this function has
6851 always operated and there doesn't seem to be a good way to avoid this
6853 if (TYPE_POINTER_TO (to_type) != 0
6854 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6855 return TYPE_POINTER_TO (to_type);
6857 /* First, if we already have a type for pointers to TO_TYPE and it's
6858 the proper mode, use it. */
6859 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6860 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6863 t = make_node (POINTER_TYPE);
6865 TREE_TYPE (t) = to_type;
6866 SET_TYPE_MODE (t, mode);
6867 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6868 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6869 TYPE_POINTER_TO (to_type) = t;
6871 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6872 SET_TYPE_STRUCTURAL_EQUALITY (t);
6873 else if (TYPE_CANONICAL (to_type) != to_type)
6875 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6876 mode, can_alias_all);
6878 /* Lay out the type. This function has many callers that are concerned
6879 with expression-construction, and this simplifies them all. */
6885 /* By default build pointers in ptr_mode. */
6888 build_pointer_type (tree to_type)
6890 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6891 : TYPE_ADDR_SPACE (to_type);
6892 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6893 return build_pointer_type_for_mode (to_type, pointer_mode, false);
6896 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6899 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6904 if (to_type == error_mark_node)
6905 return error_mark_node;
6907 /* If the pointed-to type has the may_alias attribute set, force
6908 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6909 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6910 can_alias_all = true;
6912 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6913 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6914 In that case, return that type without regard to the rest of our
6917 ??? This is a kludge, but consistent with the way this function has
6918 always operated and there doesn't seem to be a good way to avoid this
6920 if (TYPE_REFERENCE_TO (to_type) != 0
6921 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6922 return TYPE_REFERENCE_TO (to_type);
6924 /* First, if we already have a type for pointers to TO_TYPE and it's
6925 the proper mode, use it. */
6926 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6927 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6930 t = make_node (REFERENCE_TYPE);
6932 TREE_TYPE (t) = to_type;
6933 SET_TYPE_MODE (t, mode);
6934 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6935 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6936 TYPE_REFERENCE_TO (to_type) = t;
6938 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6939 SET_TYPE_STRUCTURAL_EQUALITY (t);
6940 else if (TYPE_CANONICAL (to_type) != to_type)
6942 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6943 mode, can_alias_all);
6951 /* Build the node for the type of references-to-TO_TYPE by default
6955 build_reference_type (tree to_type)
6957 addr_space_t as = to_type == error_mark_node? ADDR_SPACE_GENERIC
6958 : TYPE_ADDR_SPACE (to_type);
6959 enum machine_mode pointer_mode = targetm.addr_space.pointer_mode (as);
6960 return build_reference_type_for_mode (to_type, pointer_mode, false);
6963 /* Build a type that is compatible with t but has no cv quals anywhere
6966 const char *const *const * -> char ***. */
6969 build_type_no_quals (tree t)
6971 switch (TREE_CODE (t))
6974 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6976 TYPE_REF_CAN_ALIAS_ALL (t));
6977 case REFERENCE_TYPE:
6979 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6981 TYPE_REF_CAN_ALIAS_ALL (t));
6983 return TYPE_MAIN_VARIANT (t);
6987 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6988 MAXVAL should be the maximum value in the domain
6989 (one less than the length of the array).
6991 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6992 We don't enforce this limit, that is up to caller (e.g. language front end).
6993 The limit exists because the result is a signed type and we don't handle
6994 sizes that use more than one HOST_WIDE_INT. */
6997 build_index_type (tree maxval)
6999 tree itype = make_node (INTEGER_TYPE);
7001 TREE_TYPE (itype) = sizetype;
7002 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
7003 TYPE_MIN_VALUE (itype) = size_zero_node;
7004 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
7005 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
7006 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
7007 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
7008 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
7009 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
7011 if (host_integerp (maxval, 1))
7012 return type_hash_canon (tree_low_cst (maxval, 1), itype);
7015 /* Since we cannot hash this type, we need to compare it using
7016 structural equality checks. */
7017 SET_TYPE_STRUCTURAL_EQUALITY (itype);
7022 #define MAX_INT_CACHED_PREC \
7023 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7024 static GTY(()) tree nonstandard_integer_type_cache[2 * MAX_INT_CACHED_PREC + 2];
7026 /* Builds a signed or unsigned integer type of precision PRECISION.
7027 Used for C bitfields whose precision does not match that of
7028 built-in target types. */
7030 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
7036 unsignedp = MAX_INT_CACHED_PREC + 1;
7038 if (precision <= MAX_INT_CACHED_PREC)
7040 itype = nonstandard_integer_type_cache[precision + unsignedp];
7045 itype = make_node (INTEGER_TYPE);
7046 TYPE_PRECISION (itype) = precision;
7049 fixup_unsigned_type (itype);
7051 fixup_signed_type (itype);
7054 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
7055 ret = type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
7056 if (precision <= MAX_INT_CACHED_PREC && lang_hooks.types.hash_types)
7057 nonstandard_integer_type_cache[precision + unsignedp] = ret;
7062 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
7063 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
7064 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
7067 build_range_type (tree type, tree lowval, tree highval)
7069 tree itype = make_node (INTEGER_TYPE);
7071 TREE_TYPE (itype) = type;
7072 if (type == NULL_TREE)
7075 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
7076 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
7078 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
7079 SET_TYPE_MODE (itype, TYPE_MODE (type));
7080 TYPE_SIZE (itype) = TYPE_SIZE (type);
7081 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
7082 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
7083 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
7085 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
7086 return type_hash_canon (tree_low_cst (highval, 0)
7087 - tree_low_cst (lowval, 0),
7093 /* Return true if the debug information for TYPE, a subtype, should be emitted
7094 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7095 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7096 debug info and doesn't reflect the source code. */
7099 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
7101 tree base_type = TREE_TYPE (type), low, high;
7103 /* Subrange types have a base type which is an integral type. */
7104 if (!INTEGRAL_TYPE_P (base_type))
7107 /* Get the real bounds of the subtype. */
7108 if (lang_hooks.types.get_subrange_bounds)
7109 lang_hooks.types.get_subrange_bounds (type, &low, &high);
7112 low = TYPE_MIN_VALUE (type);
7113 high = TYPE_MAX_VALUE (type);
7116 /* If the type and its base type have the same representation and the same
7117 name, then the type is not a subrange but a copy of the base type. */
7118 if ((TREE_CODE (base_type) == INTEGER_TYPE
7119 || TREE_CODE (base_type) == BOOLEAN_TYPE)
7120 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
7121 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
7122 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
7124 tree type_name = TYPE_NAME (type);
7125 tree base_type_name = TYPE_NAME (base_type);
7127 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
7128 type_name = DECL_NAME (type_name);
7130 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
7131 base_type_name = DECL_NAME (base_type_name);
7133 if (type_name == base_type_name)
7144 /* Just like build_index_type, but takes lowval and highval instead
7145 of just highval (maxval). */
7148 build_index_2_type (tree lowval, tree highval)
7150 return build_range_type (sizetype, lowval, highval);
7153 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7154 and number of elements specified by the range of values of INDEX_TYPE.
7155 If such a type has already been constructed, reuse it. */
7158 build_array_type (tree elt_type, tree index_type)
7161 hashval_t hashcode = 0;
7163 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
7165 error ("arrays of functions are not meaningful");
7166 elt_type = integer_type_node;
7169 t = make_node (ARRAY_TYPE);
7170 TREE_TYPE (t) = elt_type;
7171 TYPE_DOMAIN (t) = index_type;
7172 TYPE_ADDR_SPACE (t) = TYPE_ADDR_SPACE (elt_type);
7175 /* If the element type is incomplete at this point we get marked for
7176 structural equality. Do not record these types in the canonical
7178 if (TYPE_STRUCTURAL_EQUALITY_P (t))
7181 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
7183 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
7184 t = type_hash_canon (hashcode, t);
7186 if (TYPE_CANONICAL (t) == t)
7188 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
7189 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
7190 SET_TYPE_STRUCTURAL_EQUALITY (t);
7191 else if (TYPE_CANONICAL (elt_type) != elt_type
7192 || (index_type && TYPE_CANONICAL (index_type) != index_type))
7194 = build_array_type (TYPE_CANONICAL (elt_type),
7195 index_type ? TYPE_CANONICAL (index_type) : NULL);
7201 /* Recursively examines the array elements of TYPE, until a non-array
7202 element type is found. */
7205 strip_array_types (tree type)
7207 while (TREE_CODE (type) == ARRAY_TYPE)
7208 type = TREE_TYPE (type);
7213 /* Computes the canonical argument types from the argument type list
7216 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7217 on entry to this function, or if any of the ARGTYPES are
7220 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7221 true on entry to this function, or if any of the ARGTYPES are
7224 Returns a canonical argument list, which may be ARGTYPES when the
7225 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7226 true) or would not differ from ARGTYPES. */
7229 maybe_canonicalize_argtypes(tree argtypes,
7230 bool *any_structural_p,
7231 bool *any_noncanonical_p)
7234 bool any_noncanonical_argtypes_p = false;
7236 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
7238 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
7239 /* Fail gracefully by stating that the type is structural. */
7240 *any_structural_p = true;
7241 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
7242 *any_structural_p = true;
7243 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
7244 || TREE_PURPOSE (arg))
7245 /* If the argument has a default argument, we consider it
7246 non-canonical even though the type itself is canonical.
7247 That way, different variants of function and method types
7248 with default arguments will all point to the variant with
7249 no defaults as their canonical type. */
7250 any_noncanonical_argtypes_p = true;
7253 if (*any_structural_p)
7256 if (any_noncanonical_argtypes_p)
7258 /* Build the canonical list of argument types. */
7259 tree canon_argtypes = NULL_TREE;
7260 bool is_void = false;
7262 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
7264 if (arg == void_list_node)
7267 canon_argtypes = tree_cons (NULL_TREE,
7268 TYPE_CANONICAL (TREE_VALUE (arg)),
7272 canon_argtypes = nreverse (canon_argtypes);
7274 canon_argtypes = chainon (canon_argtypes, void_list_node);
7276 /* There is a non-canonical type. */
7277 *any_noncanonical_p = true;
7278 return canon_argtypes;
7281 /* The canonical argument types are the same as ARGTYPES. */
7285 /* Construct, lay out and return
7286 the type of functions returning type VALUE_TYPE
7287 given arguments of types ARG_TYPES.
7288 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7289 are data type nodes for the arguments of the function.
7290 If such a type has already been constructed, reuse it. */
7293 build_function_type (tree value_type, tree arg_types)
7296 hashval_t hashcode = 0;
7297 bool any_structural_p, any_noncanonical_p;
7298 tree canon_argtypes;
7300 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7302 error ("function return type cannot be function");
7303 value_type = integer_type_node;
7306 /* Make a node of the sort we want. */
7307 t = make_node (FUNCTION_TYPE);
7308 TREE_TYPE (t) = value_type;
7309 TYPE_ARG_TYPES (t) = arg_types;
7311 /* If we already have such a type, use the old one. */
7312 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7313 hashcode = type_hash_list (arg_types, hashcode);
7314 t = type_hash_canon (hashcode, t);
7316 /* Set up the canonical type. */
7317 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7318 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7319 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7321 &any_noncanonical_p);
7322 if (any_structural_p)
7323 SET_TYPE_STRUCTURAL_EQUALITY (t);
7324 else if (any_noncanonical_p)
7325 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7328 if (!COMPLETE_TYPE_P (t))
7333 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7336 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7338 tree new_type = NULL;
7339 tree args, new_args = NULL, t;
7343 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7344 args = TREE_CHAIN (args), i++)
7345 if (!bitmap_bit_p (args_to_skip, i))
7346 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7348 new_reversed = nreverse (new_args);
7352 TREE_CHAIN (new_args) = void_list_node;
7354 new_reversed = void_list_node;
7357 /* Use copy_node to preserve as much as possible from original type
7358 (debug info, attribute lists etc.)
7359 Exception is METHOD_TYPEs must have THIS argument.
7360 When we are asked to remove it, we need to build new FUNCTION_TYPE
7362 if (TREE_CODE (orig_type) != METHOD_TYPE
7363 || !bitmap_bit_p (args_to_skip, 0))
7365 new_type = build_distinct_type_copy (orig_type);
7366 TYPE_ARG_TYPES (new_type) = new_reversed;
7371 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7373 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7376 /* This is a new type, not a copy of an old type. Need to reassociate
7377 variants. We can handle everything except the main variant lazily. */
7378 t = TYPE_MAIN_VARIANT (orig_type);
7381 TYPE_MAIN_VARIANT (new_type) = t;
7382 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7383 TYPE_NEXT_VARIANT (t) = new_type;
7387 TYPE_MAIN_VARIANT (new_type) = new_type;
7388 TYPE_NEXT_VARIANT (new_type) = NULL;
7393 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7395 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7396 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7397 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7400 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7402 tree new_decl = copy_node (orig_decl);
7405 new_type = TREE_TYPE (orig_decl);
7406 if (prototype_p (new_type))
7407 new_type = build_function_type_skip_args (new_type, args_to_skip);
7408 TREE_TYPE (new_decl) = new_type;
7410 /* For declarations setting DECL_VINDEX (i.e. methods)
7411 we expect first argument to be THIS pointer. */
7412 if (bitmap_bit_p (args_to_skip, 0))
7413 DECL_VINDEX (new_decl) = NULL_TREE;
7415 /* When signature changes, we need to clear builtin info. */
7416 if (DECL_BUILT_IN (new_decl) && !bitmap_empty_p (args_to_skip))
7418 DECL_BUILT_IN_CLASS (new_decl) = NOT_BUILT_IN;
7419 DECL_FUNCTION_CODE (new_decl) = (enum built_in_function) 0;
7424 /* Build a function type. The RETURN_TYPE is the type returned by the
7425 function. If VAARGS is set, no void_type_node is appended to the
7426 the list. ARGP must be always be terminated be a NULL_TREE. */
7429 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7433 t = va_arg (argp, tree);
7434 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7435 args = tree_cons (NULL_TREE, t, args);
7440 if (args != NULL_TREE)
7441 args = nreverse (args);
7442 gcc_assert (last != void_list_node);
7444 else if (args == NULL_TREE)
7445 args = void_list_node;
7449 args = nreverse (args);
7450 TREE_CHAIN (last) = void_list_node;
7452 args = build_function_type (return_type, args);
7457 /* Build a function type. The RETURN_TYPE is the type returned by the
7458 function. If additional arguments are provided, they are
7459 additional argument types. The list of argument types must always
7460 be terminated by NULL_TREE. */
7463 build_function_type_list (tree return_type, ...)
7468 va_start (p, return_type);
7469 args = build_function_type_list_1 (false, return_type, p);
7474 /* Build a variable argument function type. The RETURN_TYPE is the
7475 type returned by the function. If additional arguments are provided,
7476 they are additional argument types. The list of argument types must
7477 always be terminated by NULL_TREE. */
7480 build_varargs_function_type_list (tree return_type, ...)
7485 va_start (p, return_type);
7486 args = build_function_type_list_1 (true, return_type, p);
7492 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7493 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7494 for the method. An implicit additional parameter (of type
7495 pointer-to-BASETYPE) is added to the ARGTYPES. */
7498 build_method_type_directly (tree basetype,
7505 bool any_structural_p, any_noncanonical_p;
7506 tree canon_argtypes;
7508 /* Make a node of the sort we want. */
7509 t = make_node (METHOD_TYPE);
7511 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7512 TREE_TYPE (t) = rettype;
7513 ptype = build_pointer_type (basetype);
7515 /* The actual arglist for this function includes a "hidden" argument
7516 which is "this". Put it into the list of argument types. */
7517 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7518 TYPE_ARG_TYPES (t) = argtypes;
7520 /* If we already have such a type, use the old one. */
7521 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7522 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7523 hashcode = type_hash_list (argtypes, hashcode);
7524 t = type_hash_canon (hashcode, t);
7526 /* Set up the canonical type. */
7528 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7529 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7531 = (TYPE_CANONICAL (basetype) != basetype
7532 || TYPE_CANONICAL (rettype) != rettype);
7533 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7535 &any_noncanonical_p);
7536 if (any_structural_p)
7537 SET_TYPE_STRUCTURAL_EQUALITY (t);
7538 else if (any_noncanonical_p)
7540 = build_method_type_directly (TYPE_CANONICAL (basetype),
7541 TYPE_CANONICAL (rettype),
7543 if (!COMPLETE_TYPE_P (t))
7549 /* Construct, lay out and return the type of methods belonging to class
7550 BASETYPE and whose arguments and values are described by TYPE.
7551 If that type exists already, reuse it.
7552 TYPE must be a FUNCTION_TYPE node. */
7555 build_method_type (tree basetype, tree type)
7557 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7559 return build_method_type_directly (basetype,
7561 TYPE_ARG_TYPES (type));
7564 /* Construct, lay out and return the type of offsets to a value
7565 of type TYPE, within an object of type BASETYPE.
7566 If a suitable offset type exists already, reuse it. */
7569 build_offset_type (tree basetype, tree type)
7572 hashval_t hashcode = 0;
7574 /* Make a node of the sort we want. */
7575 t = make_node (OFFSET_TYPE);
7577 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7578 TREE_TYPE (t) = type;
7580 /* If we already have such a type, use the old one. */
7581 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7582 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7583 t = type_hash_canon (hashcode, t);
7585 if (!COMPLETE_TYPE_P (t))
7588 if (TYPE_CANONICAL (t) == t)
7590 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7591 || TYPE_STRUCTURAL_EQUALITY_P (type))
7592 SET_TYPE_STRUCTURAL_EQUALITY (t);
7593 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7594 || TYPE_CANONICAL (type) != type)
7596 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7597 TYPE_CANONICAL (type));
7603 /* Create a complex type whose components are COMPONENT_TYPE. */
7606 build_complex_type (tree component_type)
7611 gcc_assert (INTEGRAL_TYPE_P (component_type)
7612 || SCALAR_FLOAT_TYPE_P (component_type)
7613 || FIXED_POINT_TYPE_P (component_type));
7615 /* Make a node of the sort we want. */
7616 t = make_node (COMPLEX_TYPE);
7618 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7620 /* If we already have such a type, use the old one. */
7621 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7622 t = type_hash_canon (hashcode, t);
7624 if (!COMPLETE_TYPE_P (t))
7627 if (TYPE_CANONICAL (t) == t)
7629 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7630 SET_TYPE_STRUCTURAL_EQUALITY (t);
7631 else if (TYPE_CANONICAL (component_type) != component_type)
7633 = build_complex_type (TYPE_CANONICAL (component_type));
7636 /* We need to create a name, since complex is a fundamental type. */
7637 if (! TYPE_NAME (t))
7640 if (component_type == char_type_node)
7641 name = "complex char";
7642 else if (component_type == signed_char_type_node)
7643 name = "complex signed char";
7644 else if (component_type == unsigned_char_type_node)
7645 name = "complex unsigned char";
7646 else if (component_type == short_integer_type_node)
7647 name = "complex short int";
7648 else if (component_type == short_unsigned_type_node)
7649 name = "complex short unsigned int";
7650 else if (component_type == integer_type_node)
7651 name = "complex int";
7652 else if (component_type == unsigned_type_node)
7653 name = "complex unsigned int";
7654 else if (component_type == long_integer_type_node)
7655 name = "complex long int";
7656 else if (component_type == long_unsigned_type_node)
7657 name = "complex long unsigned int";
7658 else if (component_type == long_long_integer_type_node)
7659 name = "complex long long int";
7660 else if (component_type == long_long_unsigned_type_node)
7661 name = "complex long long unsigned int";
7666 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7667 get_identifier (name), t);
7670 return build_qualified_type (t, TYPE_QUALS (component_type));
7673 /* If TYPE is a real or complex floating-point type and the target
7674 does not directly support arithmetic on TYPE then return the wider
7675 type to be used for arithmetic on TYPE. Otherwise, return
7679 excess_precision_type (tree type)
7681 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7683 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7684 switch (TREE_CODE (type))
7687 switch (flt_eval_method)
7690 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7691 return double_type_node;
7694 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7695 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7696 return long_double_type_node;
7703 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7705 switch (flt_eval_method)
7708 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7709 return complex_double_type_node;
7712 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7713 || (TYPE_MODE (TREE_TYPE (type))
7714 == TYPE_MODE (double_type_node)))
7715 return complex_long_double_type_node;
7728 /* Return OP, stripped of any conversions to wider types as much as is safe.
7729 Converting the value back to OP's type makes a value equivalent to OP.
7731 If FOR_TYPE is nonzero, we return a value which, if converted to
7732 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7734 OP must have integer, real or enumeral type. Pointers are not allowed!
7736 There are some cases where the obvious value we could return
7737 would regenerate to OP if converted to OP's type,
7738 but would not extend like OP to wider types.
7739 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7740 For example, if OP is (unsigned short)(signed char)-1,
7741 we avoid returning (signed char)-1 if FOR_TYPE is int,
7742 even though extending that to an unsigned short would regenerate OP,
7743 since the result of extending (signed char)-1 to (int)
7744 is different from (int) OP. */
7747 get_unwidened (tree op, tree for_type)
7749 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7750 tree type = TREE_TYPE (op);
7752 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7754 = (for_type != 0 && for_type != type
7755 && final_prec > TYPE_PRECISION (type)
7756 && TYPE_UNSIGNED (type));
7759 while (CONVERT_EXPR_P (op))
7763 /* TYPE_PRECISION on vector types has different meaning
7764 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7765 so avoid them here. */
7766 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7769 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7770 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7772 /* Truncations are many-one so cannot be removed.
7773 Unless we are later going to truncate down even farther. */
7775 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7778 /* See what's inside this conversion. If we decide to strip it,
7780 op = TREE_OPERAND (op, 0);
7782 /* If we have not stripped any zero-extensions (uns is 0),
7783 we can strip any kind of extension.
7784 If we have previously stripped a zero-extension,
7785 only zero-extensions can safely be stripped.
7786 Any extension can be stripped if the bits it would produce
7787 are all going to be discarded later by truncating to FOR_TYPE. */
7791 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7793 /* TYPE_UNSIGNED says whether this is a zero-extension.
7794 Let's avoid computing it if it does not affect WIN
7795 and if UNS will not be needed again. */
7797 || CONVERT_EXPR_P (op))
7798 && TYPE_UNSIGNED (TREE_TYPE (op)))
7806 /* If we finally reach a constant see if it fits in for_type and
7807 in that case convert it. */
7809 && TREE_CODE (win) == INTEGER_CST
7810 && TREE_TYPE (win) != for_type
7811 && int_fits_type_p (win, for_type))
7812 win = fold_convert (for_type, win);
7817 /* Return OP or a simpler expression for a narrower value
7818 which can be sign-extended or zero-extended to give back OP.
7819 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7820 or 0 if the value should be sign-extended. */
7823 get_narrower (tree op, int *unsignedp_ptr)
7828 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7830 while (TREE_CODE (op) == NOP_EXPR)
7833 = (TYPE_PRECISION (TREE_TYPE (op))
7834 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7836 /* Truncations are many-one so cannot be removed. */
7840 /* See what's inside this conversion. If we decide to strip it,
7845 op = TREE_OPERAND (op, 0);
7846 /* An extension: the outermost one can be stripped,
7847 but remember whether it is zero or sign extension. */
7849 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7850 /* Otherwise, if a sign extension has been stripped,
7851 only sign extensions can now be stripped;
7852 if a zero extension has been stripped, only zero-extensions. */
7853 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7857 else /* bitschange == 0 */
7859 /* A change in nominal type can always be stripped, but we must
7860 preserve the unsignedness. */
7862 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7864 op = TREE_OPERAND (op, 0);
7865 /* Keep trying to narrow, but don't assign op to win if it
7866 would turn an integral type into something else. */
7867 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7874 if (TREE_CODE (op) == COMPONENT_REF
7875 /* Since type_for_size always gives an integer type. */
7876 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7877 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7878 /* Ensure field is laid out already. */
7879 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7880 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7882 unsigned HOST_WIDE_INT innerprec
7883 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7884 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7885 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7886 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7888 /* We can get this structure field in a narrower type that fits it,
7889 but the resulting extension to its nominal type (a fullword type)
7890 must satisfy the same conditions as for other extensions.
7892 Do this only for fields that are aligned (not bit-fields),
7893 because when bit-field insns will be used there is no
7894 advantage in doing this. */
7896 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7897 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7898 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7902 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7903 win = fold_convert (type, op);
7907 *unsignedp_ptr = uns;
7911 /* Returns true if integer constant C has a value that is permissible
7912 for type TYPE (an INTEGER_TYPE). */
7915 int_fits_type_p (const_tree c, const_tree type)
7917 tree type_low_bound, type_high_bound;
7918 bool ok_for_low_bound, ok_for_high_bound, unsc;
7921 dc = tree_to_double_int (c);
7922 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7924 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7925 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7927 /* So c is an unsigned integer whose type is sizetype and type is not.
7928 sizetype'd integers are sign extended even though they are
7929 unsigned. If the integer value fits in the lower end word of c,
7930 and if the higher end word has all its bits set to 1, that
7931 means the higher end bits are set to 1 only for sign extension.
7932 So let's convert c into an equivalent zero extended unsigned
7934 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7937 type_low_bound = TYPE_MIN_VALUE (type);
7938 type_high_bound = TYPE_MAX_VALUE (type);
7940 /* If at least one bound of the type is a constant integer, we can check
7941 ourselves and maybe make a decision. If no such decision is possible, but
7942 this type is a subtype, try checking against that. Otherwise, use
7943 double_int_fits_to_tree_p, which checks against the precision.
7945 Compute the status for each possibly constant bound, and return if we see
7946 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7947 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7948 for "constant known to fit". */
7950 /* Check if c >= type_low_bound. */
7951 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7953 dd = tree_to_double_int (type_low_bound);
7954 if (TREE_CODE (type) == INTEGER_TYPE
7955 && TYPE_IS_SIZETYPE (type)
7956 && TYPE_UNSIGNED (type))
7957 dd = double_int_zext (dd, TYPE_PRECISION (type));
7958 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7960 int c_neg = (!unsc && double_int_negative_p (dc));
7961 int t_neg = (unsc && double_int_negative_p (dd));
7963 if (c_neg && !t_neg)
7965 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7968 else if (double_int_cmp (dc, dd, unsc) < 0)
7970 ok_for_low_bound = true;
7973 ok_for_low_bound = false;
7975 /* Check if c <= type_high_bound. */
7976 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7978 dd = tree_to_double_int (type_high_bound);
7979 if (TREE_CODE (type) == INTEGER_TYPE
7980 && TYPE_IS_SIZETYPE (type)
7981 && TYPE_UNSIGNED (type))
7982 dd = double_int_zext (dd, TYPE_PRECISION (type));
7983 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7985 int c_neg = (!unsc && double_int_negative_p (dc));
7986 int t_neg = (unsc && double_int_negative_p (dd));
7988 if (t_neg && !c_neg)
7990 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7993 else if (double_int_cmp (dc, dd, unsc) > 0)
7995 ok_for_high_bound = true;
7998 ok_for_high_bound = false;
8000 /* If the constant fits both bounds, the result is known. */
8001 if (ok_for_low_bound && ok_for_high_bound)
8004 /* Perform some generic filtering which may allow making a decision
8005 even if the bounds are not constant. First, negative integers
8006 never fit in unsigned types, */
8007 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
8010 /* Second, narrower types always fit in wider ones. */
8011 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
8014 /* Third, unsigned integers with top bit set never fit signed types. */
8015 if (! TYPE_UNSIGNED (type) && unsc)
8017 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
8018 if (prec < HOST_BITS_PER_WIDE_INT)
8020 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
8023 else if (((((unsigned HOST_WIDE_INT) 1)
8024 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
8028 /* If we haven't been able to decide at this point, there nothing more we
8029 can check ourselves here. Look at the base type if we have one and it
8030 has the same precision. */
8031 if (TREE_CODE (type) == INTEGER_TYPE
8032 && TREE_TYPE (type) != 0
8033 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
8035 type = TREE_TYPE (type);
8039 /* Or to double_int_fits_to_tree_p, if nothing else. */
8040 return double_int_fits_to_tree_p (type, dc);
8043 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8044 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8045 represented (assuming two's-complement arithmetic) within the bit
8046 precision of the type are returned instead. */
8049 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
8051 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
8052 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
8053 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
8054 TYPE_UNSIGNED (type));
8057 if (TYPE_UNSIGNED (type))
8058 mpz_set_ui (min, 0);
8062 mn = double_int_mask (TYPE_PRECISION (type) - 1);
8063 mn = double_int_sext (double_int_add (mn, double_int_one),
8064 TYPE_PRECISION (type));
8065 mpz_set_double_int (min, mn, false);
8069 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
8070 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
8071 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
8072 TYPE_UNSIGNED (type));
8075 if (TYPE_UNSIGNED (type))
8076 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
8079 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
8084 /* Return true if VAR is an automatic variable defined in function FN. */
8087 auto_var_in_fn_p (const_tree var, const_tree fn)
8089 return (DECL_P (var) && DECL_CONTEXT (var) == fn
8090 && ((((TREE_CODE (var) == VAR_DECL && ! DECL_EXTERNAL (var))
8091 || TREE_CODE (var) == PARM_DECL)
8092 && ! TREE_STATIC (var))
8093 || TREE_CODE (var) == LABEL_DECL
8094 || TREE_CODE (var) == RESULT_DECL));
8097 /* Subprogram of following function. Called by walk_tree.
8099 Return *TP if it is an automatic variable or parameter of the
8100 function passed in as DATA. */
8103 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
8105 tree fn = (tree) data;
8110 else if (DECL_P (*tp)
8111 && auto_var_in_fn_p (*tp, fn))
8117 /* Returns true if T is, contains, or refers to a type with variable
8118 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8119 arguments, but not the return type. If FN is nonzero, only return
8120 true if a modifier of the type or position of FN is a variable or
8121 parameter inside FN.
8123 This concept is more general than that of C99 'variably modified types':
8124 in C99, a struct type is never variably modified because a VLA may not
8125 appear as a structure member. However, in GNU C code like:
8127 struct S { int i[f()]; };
8129 is valid, and other languages may define similar constructs. */
8132 variably_modified_type_p (tree type, tree fn)
8136 /* Test if T is either variable (if FN is zero) or an expression containing
8137 a variable in FN. */
8138 #define RETURN_TRUE_IF_VAR(T) \
8139 do { tree _t = (T); \
8140 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8141 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8142 return true; } while (0)
8144 if (type == error_mark_node)
8147 /* If TYPE itself has variable size, it is variably modified. */
8148 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
8149 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
8151 switch (TREE_CODE (type))
8154 case REFERENCE_TYPE:
8156 if (variably_modified_type_p (TREE_TYPE (type), fn))
8162 /* If TYPE is a function type, it is variably modified if the
8163 return type is variably modified. */
8164 if (variably_modified_type_p (TREE_TYPE (type), fn))
8170 case FIXED_POINT_TYPE:
8173 /* Scalar types are variably modified if their end points
8175 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
8176 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
8181 case QUAL_UNION_TYPE:
8182 /* We can't see if any of the fields are variably-modified by the
8183 definition we normally use, since that would produce infinite
8184 recursion via pointers. */
8185 /* This is variably modified if some field's type is. */
8186 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
8187 if (TREE_CODE (t) == FIELD_DECL)
8189 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
8190 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
8191 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
8193 if (TREE_CODE (type) == QUAL_UNION_TYPE)
8194 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
8199 /* Do not call ourselves to avoid infinite recursion. This is
8200 variably modified if the element type is. */
8201 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
8202 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
8209 /* The current language may have other cases to check, but in general,
8210 all other types are not variably modified. */
8211 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
8213 #undef RETURN_TRUE_IF_VAR
8216 /* Given a DECL or TYPE, return the scope in which it was declared, or
8217 NULL_TREE if there is no containing scope. */
8220 get_containing_scope (const_tree t)
8222 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
8225 /* Return the innermost context enclosing DECL that is
8226 a FUNCTION_DECL, or zero if none. */
8229 decl_function_context (const_tree decl)
8233 if (TREE_CODE (decl) == ERROR_MARK)
8236 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8237 where we look up the function at runtime. Such functions always take
8238 a first argument of type 'pointer to real context'.
8240 C++ should really be fixed to use DECL_CONTEXT for the real context,
8241 and use something else for the "virtual context". */
8242 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
8245 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
8247 context = DECL_CONTEXT (decl);
8249 while (context && TREE_CODE (context) != FUNCTION_DECL)
8251 if (TREE_CODE (context) == BLOCK)
8252 context = BLOCK_SUPERCONTEXT (context);
8254 context = get_containing_scope (context);
8260 /* Return the innermost context enclosing DECL that is
8261 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8262 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8265 decl_type_context (const_tree decl)
8267 tree context = DECL_CONTEXT (decl);
8270 switch (TREE_CODE (context))
8272 case NAMESPACE_DECL:
8273 case TRANSLATION_UNIT_DECL:
8278 case QUAL_UNION_TYPE:
8283 context = DECL_CONTEXT (context);
8287 context = BLOCK_SUPERCONTEXT (context);
8297 /* CALL is a CALL_EXPR. Return the declaration for the function
8298 called, or NULL_TREE if the called function cannot be
8302 get_callee_fndecl (const_tree call)
8306 if (call == error_mark_node)
8307 return error_mark_node;
8309 /* It's invalid to call this function with anything but a
8311 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8313 /* The first operand to the CALL is the address of the function
8315 addr = CALL_EXPR_FN (call);
8319 /* If this is a readonly function pointer, extract its initial value. */
8320 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8321 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8322 && DECL_INITIAL (addr))
8323 addr = DECL_INITIAL (addr);
8325 /* If the address is just `&f' for some function `f', then we know
8326 that `f' is being called. */
8327 if (TREE_CODE (addr) == ADDR_EXPR
8328 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8329 return TREE_OPERAND (addr, 0);
8331 /* We couldn't figure out what was being called. */
8335 /* Print debugging information about tree nodes generated during the compile,
8336 and any language-specific information. */
8339 dump_tree_statistics (void)
8341 #ifdef GATHER_STATISTICS
8343 int total_nodes, total_bytes;
8346 fprintf (stderr, "\n??? tree nodes created\n\n");
8347 #ifdef GATHER_STATISTICS
8348 fprintf (stderr, "Kind Nodes Bytes\n");
8349 fprintf (stderr, "---------------------------------------\n");
8350 total_nodes = total_bytes = 0;
8351 for (i = 0; i < (int) all_kinds; i++)
8353 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8354 tree_node_counts[i], tree_node_sizes[i]);
8355 total_nodes += tree_node_counts[i];
8356 total_bytes += tree_node_sizes[i];
8358 fprintf (stderr, "---------------------------------------\n");
8359 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8360 fprintf (stderr, "---------------------------------------\n");
8361 ssanames_print_statistics ();
8362 phinodes_print_statistics ();
8364 fprintf (stderr, "(No per-node statistics)\n");
8366 print_type_hash_statistics ();
8367 print_debug_expr_statistics ();
8368 print_value_expr_statistics ();
8369 lang_hooks.print_statistics ();
8372 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8374 /* Generate a crc32 of a string. */
8377 crc32_string (unsigned chksum, const char *string)
8381 unsigned value = *string << 24;
8384 for (ix = 8; ix--; value <<= 1)
8388 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8397 /* P is a string that will be used in a symbol. Mask out any characters
8398 that are not valid in that context. */
8401 clean_symbol_name (char *p)
8405 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8408 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8415 /* Generate a name for a special-purpose function function.
8416 The generated name may need to be unique across the whole link.
8417 TYPE is some string to identify the purpose of this function to the
8418 linker or collect2; it must start with an uppercase letter,
8420 I - for constructors
8422 N - for C++ anonymous namespaces
8423 F - for DWARF unwind frame information. */
8426 get_file_function_name (const char *type)
8432 /* If we already have a name we know to be unique, just use that. */
8433 if (first_global_object_name)
8434 p = q = ASTRDUP (first_global_object_name);
8435 /* If the target is handling the constructors/destructors, they
8436 will be local to this file and the name is only necessary for
8437 debugging purposes. */
8438 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8440 const char *file = main_input_filename;
8442 file = input_filename;
8443 /* Just use the file's basename, because the full pathname
8444 might be quite long. */
8445 p = strrchr (file, '/');
8450 p = q = ASTRDUP (p);
8454 /* Otherwise, the name must be unique across the entire link.
8455 We don't have anything that we know to be unique to this translation
8456 unit, so use what we do have and throw in some randomness. */
8458 const char *name = weak_global_object_name;
8459 const char *file = main_input_filename;
8464 file = input_filename;
8466 len = strlen (file);
8467 q = (char *) alloca (9 * 2 + len + 1);
8468 memcpy (q, file, len + 1);
8470 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8471 crc32_string (0, get_random_seed (false)));
8476 clean_symbol_name (q);
8477 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8480 /* Set up the name of the file-level functions we may need.
8481 Use a global object (which is already required to be unique over
8482 the program) rather than the file name (which imposes extra
8484 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8486 return get_identifier (buf);
8489 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8491 /* Complain that the tree code of NODE does not match the expected 0
8492 terminated list of trailing codes. The trailing code list can be
8493 empty, for a more vague error message. FILE, LINE, and FUNCTION
8494 are of the caller. */
8497 tree_check_failed (const_tree node, const char *file,
8498 int line, const char *function, ...)
8502 unsigned length = 0;
8505 va_start (args, function);
8506 while ((code = va_arg (args, int)))
8507 length += 4 + strlen (tree_code_name[code]);
8512 va_start (args, function);
8513 length += strlen ("expected ");
8514 buffer = tmp = (char *) alloca (length);
8516 while ((code = va_arg (args, int)))
8518 const char *prefix = length ? " or " : "expected ";
8520 strcpy (tmp + length, prefix);
8521 length += strlen (prefix);
8522 strcpy (tmp + length, tree_code_name[code]);
8523 length += strlen (tree_code_name[code]);
8528 buffer = "unexpected node";
8530 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8531 buffer, tree_code_name[TREE_CODE (node)],
8532 function, trim_filename (file), line);
8535 /* Complain that the tree code of NODE does match the expected 0
8536 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8540 tree_not_check_failed (const_tree node, const char *file,
8541 int line, const char *function, ...)
8545 unsigned length = 0;
8548 va_start (args, function);
8549 while ((code = va_arg (args, int)))
8550 length += 4 + strlen (tree_code_name[code]);
8552 va_start (args, function);
8553 buffer = (char *) alloca (length);
8555 while ((code = va_arg (args, int)))
8559 strcpy (buffer + length, " or ");
8562 strcpy (buffer + length, tree_code_name[code]);
8563 length += strlen (tree_code_name[code]);
8567 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8568 buffer, tree_code_name[TREE_CODE (node)],
8569 function, trim_filename (file), line);
8572 /* Similar to tree_check_failed, except that we check for a class of tree
8573 code, given in CL. */
8576 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8577 const char *file, int line, const char *function)
8580 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8581 TREE_CODE_CLASS_STRING (cl),
8582 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8583 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8586 /* Similar to tree_check_failed, except that instead of specifying a
8587 dozen codes, use the knowledge that they're all sequential. */
8590 tree_range_check_failed (const_tree node, const char *file, int line,
8591 const char *function, enum tree_code c1,
8595 unsigned length = 0;
8598 for (c = c1; c <= c2; ++c)
8599 length += 4 + strlen (tree_code_name[c]);
8601 length += strlen ("expected ");
8602 buffer = (char *) alloca (length);
8605 for (c = c1; c <= c2; ++c)
8607 const char *prefix = length ? " or " : "expected ";
8609 strcpy (buffer + length, prefix);
8610 length += strlen (prefix);
8611 strcpy (buffer + length, tree_code_name[c]);
8612 length += strlen (tree_code_name[c]);
8615 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8616 buffer, tree_code_name[TREE_CODE (node)],
8617 function, trim_filename (file), line);
8621 /* Similar to tree_check_failed, except that we check that a tree does
8622 not have the specified code, given in CL. */
8625 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8626 const char *file, int line, const char *function)
8629 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8630 TREE_CODE_CLASS_STRING (cl),
8631 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8632 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8636 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8639 omp_clause_check_failed (const_tree node, const char *file, int line,
8640 const char *function, enum omp_clause_code code)
8642 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8643 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8644 function, trim_filename (file), line);
8648 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8651 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8652 const char *function, enum omp_clause_code c1,
8653 enum omp_clause_code c2)
8656 unsigned length = 0;
8659 for (c = c1; c <= c2; ++c)
8660 length += 4 + strlen (omp_clause_code_name[c]);
8662 length += strlen ("expected ");
8663 buffer = (char *) alloca (length);
8666 for (c = c1; c <= c2; ++c)
8668 const char *prefix = length ? " or " : "expected ";
8670 strcpy (buffer + length, prefix);
8671 length += strlen (prefix);
8672 strcpy (buffer + length, omp_clause_code_name[c]);
8673 length += strlen (omp_clause_code_name[c]);
8676 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8677 buffer, omp_clause_code_name[TREE_CODE (node)],
8678 function, trim_filename (file), line);
8682 #undef DEFTREESTRUCT
8683 #define DEFTREESTRUCT(VAL, NAME) NAME,
8685 static const char *ts_enum_names[] = {
8686 #include "treestruct.def"
8688 #undef DEFTREESTRUCT
8690 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8692 /* Similar to tree_class_check_failed, except that we check for
8693 whether CODE contains the tree structure identified by EN. */
8696 tree_contains_struct_check_failed (const_tree node,
8697 const enum tree_node_structure_enum en,
8698 const char *file, int line,
8699 const char *function)
8702 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8704 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8708 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8709 (dynamically sized) vector. */
8712 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8713 const char *function)
8716 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8717 idx + 1, len, function, trim_filename (file), line);
8720 /* Similar to above, except that the check is for the bounds of the operand
8721 vector of an expression node EXP. */
8724 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8725 int line, const char *function)
8727 int code = TREE_CODE (exp);
8729 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8730 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8731 function, trim_filename (file), line);
8734 /* Similar to above, except that the check is for the number of
8735 operands of an OMP_CLAUSE node. */
8738 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8739 int line, const char *function)
8742 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8743 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8744 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8745 trim_filename (file), line);
8747 #endif /* ENABLE_TREE_CHECKING */
8749 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8750 and mapped to the machine mode MODE. Initialize its fields and build
8751 the information necessary for debugging output. */
8754 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8757 hashval_t hashcode = 0;
8759 t = make_node (VECTOR_TYPE);
8760 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8761 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8762 SET_TYPE_MODE (t, mode);
8764 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8765 SET_TYPE_STRUCTURAL_EQUALITY (t);
8766 else if (TYPE_CANONICAL (innertype) != innertype
8767 || mode != VOIDmode)
8769 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8774 tree index = build_int_cst (NULL_TREE, nunits - 1);
8775 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8776 build_index_type (index));
8777 tree rt = make_node (RECORD_TYPE);
8779 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8780 get_identifier ("f"), array);
8781 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8783 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8784 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8785 the representation type, and we want to find that die when looking up
8786 the vector type. This is most easily achieved by making the TYPE_UID
8788 TYPE_UID (rt) = TYPE_UID (t);
8791 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8792 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8793 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8794 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8795 t = type_hash_canon (hashcode, t);
8797 /* We have built a main variant, based on the main variant of the
8798 inner type. Use it to build the variant we return. */
8799 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8800 && TREE_TYPE (t) != innertype)
8801 return build_type_attribute_qual_variant (t,
8802 TYPE_ATTRIBUTES (innertype),
8803 TYPE_QUALS (innertype));
8809 make_or_reuse_type (unsigned size, int unsignedp)
8811 if (size == INT_TYPE_SIZE)
8812 return unsignedp ? unsigned_type_node : integer_type_node;
8813 if (size == CHAR_TYPE_SIZE)
8814 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8815 if (size == SHORT_TYPE_SIZE)
8816 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8817 if (size == LONG_TYPE_SIZE)
8818 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8819 if (size == LONG_LONG_TYPE_SIZE)
8820 return (unsignedp ? long_long_unsigned_type_node
8821 : long_long_integer_type_node);
8822 if (size == 128 && int128_integer_type_node)
8823 return (unsignedp ? int128_unsigned_type_node
8824 : int128_integer_type_node);
8827 return make_unsigned_type (size);
8829 return make_signed_type (size);
8832 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8835 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8839 if (size == SHORT_FRACT_TYPE_SIZE)
8840 return unsignedp ? sat_unsigned_short_fract_type_node
8841 : sat_short_fract_type_node;
8842 if (size == FRACT_TYPE_SIZE)
8843 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8844 if (size == LONG_FRACT_TYPE_SIZE)
8845 return unsignedp ? sat_unsigned_long_fract_type_node
8846 : sat_long_fract_type_node;
8847 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8848 return unsignedp ? sat_unsigned_long_long_fract_type_node
8849 : sat_long_long_fract_type_node;
8853 if (size == SHORT_FRACT_TYPE_SIZE)
8854 return unsignedp ? unsigned_short_fract_type_node
8855 : short_fract_type_node;
8856 if (size == FRACT_TYPE_SIZE)
8857 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8858 if (size == LONG_FRACT_TYPE_SIZE)
8859 return unsignedp ? unsigned_long_fract_type_node
8860 : long_fract_type_node;
8861 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8862 return unsignedp ? unsigned_long_long_fract_type_node
8863 : long_long_fract_type_node;
8866 return make_fract_type (size, unsignedp, satp);
8869 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8872 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8876 if (size == SHORT_ACCUM_TYPE_SIZE)
8877 return unsignedp ? sat_unsigned_short_accum_type_node
8878 : sat_short_accum_type_node;
8879 if (size == ACCUM_TYPE_SIZE)
8880 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8881 if (size == LONG_ACCUM_TYPE_SIZE)
8882 return unsignedp ? sat_unsigned_long_accum_type_node
8883 : sat_long_accum_type_node;
8884 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8885 return unsignedp ? sat_unsigned_long_long_accum_type_node
8886 : sat_long_long_accum_type_node;
8890 if (size == SHORT_ACCUM_TYPE_SIZE)
8891 return unsignedp ? unsigned_short_accum_type_node
8892 : short_accum_type_node;
8893 if (size == ACCUM_TYPE_SIZE)
8894 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8895 if (size == LONG_ACCUM_TYPE_SIZE)
8896 return unsignedp ? unsigned_long_accum_type_node
8897 : long_accum_type_node;
8898 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8899 return unsignedp ? unsigned_long_long_accum_type_node
8900 : long_long_accum_type_node;
8903 return make_accum_type (size, unsignedp, satp);
8906 /* Create nodes for all integer types (and error_mark_node) using the sizes
8907 of C datatypes. The caller should call set_sizetype soon after calling
8908 this function to select one of the types as sizetype. */
8911 build_common_tree_nodes (bool signed_char)
8913 error_mark_node = make_node (ERROR_MARK);
8914 TREE_TYPE (error_mark_node) = error_mark_node;
8916 initialize_sizetypes ();
8918 /* Define both `signed char' and `unsigned char'. */
8919 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8920 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8921 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8922 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8924 /* Define `char', which is like either `signed char' or `unsigned char'
8925 but not the same as either. */
8928 ? make_signed_type (CHAR_TYPE_SIZE)
8929 : make_unsigned_type (CHAR_TYPE_SIZE));
8930 TYPE_STRING_FLAG (char_type_node) = 1;
8932 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8933 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8934 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8935 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8936 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8937 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8938 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8939 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8940 #if HOST_BITS_PER_WIDE_INT >= 64
8941 /* TODO: This isn't correct, but as logic depends at the moment on
8942 host's instead of target's wide-integer.
8943 If there is a target not supporting TImode, but has an 128-bit
8944 integer-scalar register, this target check needs to be adjusted. */
8945 if (targetm.scalar_mode_supported_p (TImode))
8947 int128_integer_type_node = make_signed_type (128);
8948 int128_unsigned_type_node = make_unsigned_type (128);
8951 /* Define a boolean type. This type only represents boolean values but
8952 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8953 Front ends which want to override this size (i.e. Java) can redefine
8954 boolean_type_node before calling build_common_tree_nodes_2. */
8955 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8956 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8957 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8958 TYPE_PRECISION (boolean_type_node) = 1;
8960 /* Fill in the rest of the sized types. Reuse existing type nodes
8962 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8963 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8964 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8965 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8966 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8968 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8969 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8970 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8971 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8972 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8974 access_public_node = get_identifier ("public");
8975 access_protected_node = get_identifier ("protected");
8976 access_private_node = get_identifier ("private");
8979 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8980 It will create several other common tree nodes. */
8983 build_common_tree_nodes_2 (int short_double)
8985 /* Define these next since types below may used them. */
8986 integer_zero_node = build_int_cst (integer_type_node, 0);
8987 integer_one_node = build_int_cst (integer_type_node, 1);
8988 integer_three_node = build_int_cst (integer_type_node, 3);
8989 integer_minus_one_node = build_int_cst (integer_type_node, -1);
8991 size_zero_node = size_int (0);
8992 size_one_node = size_int (1);
8993 bitsize_zero_node = bitsize_int (0);
8994 bitsize_one_node = bitsize_int (1);
8995 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8997 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8998 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
9000 void_type_node = make_node (VOID_TYPE);
9001 layout_type (void_type_node);
9003 /* We are not going to have real types in C with less than byte alignment,
9004 so we might as well not have any types that claim to have it. */
9005 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
9006 TYPE_USER_ALIGN (void_type_node) = 0;
9008 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
9009 layout_type (TREE_TYPE (null_pointer_node));
9011 ptr_type_node = build_pointer_type (void_type_node);
9013 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
9014 fileptr_type_node = ptr_type_node;
9016 float_type_node = make_node (REAL_TYPE);
9017 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
9018 layout_type (float_type_node);
9020 double_type_node = make_node (REAL_TYPE);
9022 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
9024 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
9025 layout_type (double_type_node);
9027 long_double_type_node = make_node (REAL_TYPE);
9028 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
9029 layout_type (long_double_type_node);
9031 float_ptr_type_node = build_pointer_type (float_type_node);
9032 double_ptr_type_node = build_pointer_type (double_type_node);
9033 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
9034 integer_ptr_type_node = build_pointer_type (integer_type_node);
9036 /* Fixed size integer types. */
9037 uint32_type_node = build_nonstandard_integer_type (32, true);
9038 uint64_type_node = build_nonstandard_integer_type (64, true);
9040 /* Decimal float types. */
9041 dfloat32_type_node = make_node (REAL_TYPE);
9042 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
9043 layout_type (dfloat32_type_node);
9044 SET_TYPE_MODE (dfloat32_type_node, SDmode);
9045 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
9047 dfloat64_type_node = make_node (REAL_TYPE);
9048 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
9049 layout_type (dfloat64_type_node);
9050 SET_TYPE_MODE (dfloat64_type_node, DDmode);
9051 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
9053 dfloat128_type_node = make_node (REAL_TYPE);
9054 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
9055 layout_type (dfloat128_type_node);
9056 SET_TYPE_MODE (dfloat128_type_node, TDmode);
9057 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
9059 complex_integer_type_node = build_complex_type (integer_type_node);
9060 complex_float_type_node = build_complex_type (float_type_node);
9061 complex_double_type_node = build_complex_type (double_type_node);
9062 complex_long_double_type_node = build_complex_type (long_double_type_node);
9064 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9065 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9066 sat_ ## KIND ## _type_node = \
9067 make_sat_signed_ ## KIND ## _type (SIZE); \
9068 sat_unsigned_ ## KIND ## _type_node = \
9069 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9070 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9071 unsigned_ ## KIND ## _type_node = \
9072 make_unsigned_ ## KIND ## _type (SIZE);
9074 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9075 sat_ ## WIDTH ## KIND ## _type_node = \
9076 make_sat_signed_ ## KIND ## _type (SIZE); \
9077 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9078 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9079 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9080 unsigned_ ## WIDTH ## KIND ## _type_node = \
9081 make_unsigned_ ## KIND ## _type (SIZE);
9083 /* Make fixed-point type nodes based on four different widths. */
9084 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9085 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9086 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9087 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9088 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9090 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9091 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9092 NAME ## _type_node = \
9093 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9094 u ## NAME ## _type_node = \
9095 make_or_reuse_unsigned_ ## KIND ## _type \
9096 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9097 sat_ ## NAME ## _type_node = \
9098 make_or_reuse_sat_signed_ ## KIND ## _type \
9099 (GET_MODE_BITSIZE (MODE ## mode)); \
9100 sat_u ## NAME ## _type_node = \
9101 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9102 (GET_MODE_BITSIZE (U ## MODE ## mode));
9104 /* Fixed-point type and mode nodes. */
9105 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
9106 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
9107 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
9108 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
9109 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
9110 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
9111 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
9112 MAKE_FIXED_MODE_NODE (accum, ha, HA)
9113 MAKE_FIXED_MODE_NODE (accum, sa, SA)
9114 MAKE_FIXED_MODE_NODE (accum, da, DA)
9115 MAKE_FIXED_MODE_NODE (accum, ta, TA)
9118 tree t = targetm.build_builtin_va_list ();
9120 /* Many back-ends define record types without setting TYPE_NAME.
9121 If we copied the record type here, we'd keep the original
9122 record type without a name. This breaks name mangling. So,
9123 don't copy record types and let c_common_nodes_and_builtins()
9124 declare the type to be __builtin_va_list. */
9125 if (TREE_CODE (t) != RECORD_TYPE)
9126 t = build_variant_type_copy (t);
9128 va_list_type_node = t;
9132 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9135 local_define_builtin (const char *name, tree type, enum built_in_function code,
9136 const char *library_name, int ecf_flags)
9140 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
9141 library_name, NULL_TREE);
9142 if (ecf_flags & ECF_CONST)
9143 TREE_READONLY (decl) = 1;
9144 if (ecf_flags & ECF_PURE)
9145 DECL_PURE_P (decl) = 1;
9146 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
9147 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
9148 if (ecf_flags & ECF_NORETURN)
9149 TREE_THIS_VOLATILE (decl) = 1;
9150 if (ecf_flags & ECF_NOTHROW)
9151 TREE_NOTHROW (decl) = 1;
9152 if (ecf_flags & ECF_MALLOC)
9153 DECL_IS_MALLOC (decl) = 1;
9155 built_in_decls[code] = decl;
9156 implicit_built_in_decls[code] = decl;
9159 /* Call this function after instantiating all builtins that the language
9160 front end cares about. This will build the rest of the builtins that
9161 are relied upon by the tree optimizers and the middle-end. */
9164 build_common_builtin_nodes (void)
9168 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
9169 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9171 ftype = build_function_type_list (ptr_type_node,
9172 ptr_type_node, const_ptr_type_node,
9173 size_type_node, NULL_TREE);
9175 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
9176 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
9177 "memcpy", ECF_NOTHROW);
9178 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
9179 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
9180 "memmove", ECF_NOTHROW);
9183 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
9185 ftype = build_function_type_list (integer_type_node, const_ptr_type_node,
9186 const_ptr_type_node, size_type_node,
9188 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
9189 "memcmp", ECF_PURE | ECF_NOTHROW);
9192 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
9194 ftype = build_function_type_list (ptr_type_node,
9195 ptr_type_node, integer_type_node,
9196 size_type_node, NULL_TREE);
9197 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
9198 "memset", ECF_NOTHROW);
9201 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
9203 ftype = build_function_type_list (ptr_type_node,
9204 size_type_node, NULL_TREE);
9205 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
9206 "alloca", ECF_MALLOC | ECF_NOTHROW);
9209 /* If we're checking the stack, `alloca' can throw. */
9210 if (flag_stack_check)
9211 TREE_NOTHROW (built_in_decls[BUILT_IN_ALLOCA]) = 0;
9213 ftype = build_function_type_list (void_type_node,
9214 ptr_type_node, ptr_type_node,
9215 ptr_type_node, NULL_TREE);
9216 local_define_builtin ("__builtin_init_trampoline", ftype,
9217 BUILT_IN_INIT_TRAMPOLINE,
9218 "__builtin_init_trampoline", ECF_NOTHROW);
9220 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9221 local_define_builtin ("__builtin_adjust_trampoline", ftype,
9222 BUILT_IN_ADJUST_TRAMPOLINE,
9223 "__builtin_adjust_trampoline",
9224 ECF_CONST | ECF_NOTHROW);
9226 ftype = build_function_type_list (void_type_node,
9227 ptr_type_node, ptr_type_node, NULL_TREE);
9228 local_define_builtin ("__builtin_nonlocal_goto", ftype,
9229 BUILT_IN_NONLOCAL_GOTO,
9230 "__builtin_nonlocal_goto",
9231 ECF_NORETURN | ECF_NOTHROW);
9233 ftype = build_function_type_list (void_type_node,
9234 ptr_type_node, ptr_type_node, NULL_TREE);
9235 local_define_builtin ("__builtin_setjmp_setup", ftype,
9236 BUILT_IN_SETJMP_SETUP,
9237 "__builtin_setjmp_setup", ECF_NOTHROW);
9239 ftype = build_function_type_list (ptr_type_node, ptr_type_node, NULL_TREE);
9240 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
9241 BUILT_IN_SETJMP_DISPATCHER,
9242 "__builtin_setjmp_dispatcher",
9243 ECF_PURE | ECF_NOTHROW);
9245 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9246 local_define_builtin ("__builtin_setjmp_receiver", ftype,
9247 BUILT_IN_SETJMP_RECEIVER,
9248 "__builtin_setjmp_receiver", ECF_NOTHROW);
9250 ftype = build_function_type_list (ptr_type_node, NULL_TREE);
9251 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
9252 "__builtin_stack_save", ECF_NOTHROW);
9254 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9255 local_define_builtin ("__builtin_stack_restore", ftype,
9256 BUILT_IN_STACK_RESTORE,
9257 "__builtin_stack_restore", ECF_NOTHROW);
9259 ftype = build_function_type_list (void_type_node, NULL_TREE);
9260 local_define_builtin ("__builtin_profile_func_enter", ftype,
9261 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
9262 local_define_builtin ("__builtin_profile_func_exit", ftype,
9263 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
9265 /* If there's a possibility that we might use the ARM EABI, build the
9266 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9267 if (targetm.arm_eabi_unwinder)
9269 ftype = build_function_type_list (void_type_node, NULL_TREE);
9270 local_define_builtin ("__builtin_cxa_end_cleanup", ftype,
9271 BUILT_IN_CXA_END_CLEANUP,
9272 "__cxa_end_cleanup", ECF_NORETURN);
9275 ftype = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
9276 local_define_builtin ("__builtin_unwind_resume", ftype,
9277 BUILT_IN_UNWIND_RESUME,
9278 (USING_SJLJ_EXCEPTIONS
9279 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9282 /* The exception object and filter values from the runtime. The argument
9283 must be zero before exception lowering, i.e. from the front end. After
9284 exception lowering, it will be the region number for the exception
9285 landing pad. These functions are PURE instead of CONST to prevent
9286 them from being hoisted past the exception edge that will initialize
9287 its value in the landing pad. */
9288 ftype = build_function_type_list (ptr_type_node,
9289 integer_type_node, NULL_TREE);
9290 local_define_builtin ("__builtin_eh_pointer", ftype, BUILT_IN_EH_POINTER,
9291 "__builtin_eh_pointer", ECF_PURE | ECF_NOTHROW);
9293 tmp = lang_hooks.types.type_for_mode (targetm.eh_return_filter_mode (), 0);
9294 ftype = build_function_type_list (tmp, integer_type_node, NULL_TREE);
9295 local_define_builtin ("__builtin_eh_filter", ftype, BUILT_IN_EH_FILTER,
9296 "__builtin_eh_filter", ECF_PURE | ECF_NOTHROW);
9298 ftype = build_function_type_list (void_type_node,
9299 integer_type_node, integer_type_node,
9301 local_define_builtin ("__builtin_eh_copy_values", ftype,
9302 BUILT_IN_EH_COPY_VALUES,
9303 "__builtin_eh_copy_values", ECF_NOTHROW);
9305 /* Complex multiplication and division. These are handled as builtins
9306 rather than optabs because emit_library_call_value doesn't support
9307 complex. Further, we can do slightly better with folding these
9308 beasties if the real and complex parts of the arguments are separate. */
9312 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
9314 char mode_name_buf[4], *q;
9316 enum built_in_function mcode, dcode;
9317 tree type, inner_type;
9319 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
9322 inner_type = TREE_TYPE (type);
9324 ftype = build_function_type_list (type, inner_type, inner_type,
9325 inner_type, inner_type, NULL_TREE);
9327 mcode = ((enum built_in_function)
9328 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9329 dcode = ((enum built_in_function)
9330 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
9332 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
9336 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
9337 local_define_builtin (built_in_names[mcode], ftype, mcode,
9338 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
9340 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9341 local_define_builtin (built_in_names[dcode], ftype, dcode,
9342 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9347 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9350 If we requested a pointer to a vector, build up the pointers that
9351 we stripped off while looking for the inner type. Similarly for
9352 return values from functions.
9354 The argument TYPE is the top of the chain, and BOTTOM is the
9355 new type which we will point to. */
9358 reconstruct_complex_type (tree type, tree bottom)
9362 if (TREE_CODE (type) == POINTER_TYPE)
9364 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9365 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9366 TYPE_REF_CAN_ALIAS_ALL (type));
9368 else if (TREE_CODE (type) == REFERENCE_TYPE)
9370 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9371 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9372 TYPE_REF_CAN_ALIAS_ALL (type));
9374 else if (TREE_CODE (type) == ARRAY_TYPE)
9376 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9377 outer = build_array_type (inner, TYPE_DOMAIN (type));
9379 else if (TREE_CODE (type) == FUNCTION_TYPE)
9381 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9382 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9384 else if (TREE_CODE (type) == METHOD_TYPE)
9386 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9387 /* The build_method_type_directly() routine prepends 'this' to argument list,
9388 so we must compensate by getting rid of it. */
9390 = build_method_type_directly
9391 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9393 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9395 else if (TREE_CODE (type) == OFFSET_TYPE)
9397 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9398 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9403 return build_type_attribute_qual_variant (outer, TYPE_ATTRIBUTES (type),
9407 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9410 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9414 switch (GET_MODE_CLASS (mode))
9416 case MODE_VECTOR_INT:
9417 case MODE_VECTOR_FLOAT:
9418 case MODE_VECTOR_FRACT:
9419 case MODE_VECTOR_UFRACT:
9420 case MODE_VECTOR_ACCUM:
9421 case MODE_VECTOR_UACCUM:
9422 nunits = GET_MODE_NUNITS (mode);
9426 /* Check that there are no leftover bits. */
9427 gcc_assert (GET_MODE_BITSIZE (mode)
9428 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9430 nunits = GET_MODE_BITSIZE (mode)
9431 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9438 return make_vector_type (innertype, nunits, mode);
9441 /* Similarly, but takes the inner type and number of units, which must be
9445 build_vector_type (tree innertype, int nunits)
9447 return make_vector_type (innertype, nunits, VOIDmode);
9450 /* Similarly, but takes the inner type and number of units, which must be
9454 build_opaque_vector_type (tree innertype, int nunits)
9457 innertype = build_distinct_type_copy (innertype);
9458 t = make_vector_type (innertype, nunits, VOIDmode);
9459 TYPE_VECTOR_OPAQUE (t) = true;
9464 /* Given an initializer INIT, return TRUE if INIT is zero or some
9465 aggregate of zeros. Otherwise return FALSE. */
9467 initializer_zerop (const_tree init)
9473 switch (TREE_CODE (init))
9476 return integer_zerop (init);
9479 /* ??? Note that this is not correct for C4X float formats. There,
9480 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9481 negative exponent. */
9482 return real_zerop (init)
9483 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9486 return fixed_zerop (init);
9489 return integer_zerop (init)
9490 || (real_zerop (init)
9491 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9492 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9495 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9496 if (!initializer_zerop (TREE_VALUE (elt)))
9502 unsigned HOST_WIDE_INT idx;
9504 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9505 if (!initializer_zerop (elt))
9514 /* We need to loop through all elements to handle cases like
9515 "\0" and "\0foobar". */
9516 for (i = 0; i < TREE_STRING_LENGTH (init); ++i)
9517 if (TREE_STRING_POINTER (init)[i] != '\0')
9528 /* Build an empty statement at location LOC. */
9531 build_empty_stmt (location_t loc)
9533 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9534 SET_EXPR_LOCATION (t, loc);
9539 /* Build an OpenMP clause with code CODE. LOC is the location of the
9543 build_omp_clause (location_t loc, enum omp_clause_code code)
9548 length = omp_clause_num_ops[code];
9549 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9551 t = ggc_alloc_tree_node (size);
9552 memset (t, 0, size);
9553 TREE_SET_CODE (t, OMP_CLAUSE);
9554 OMP_CLAUSE_SET_CODE (t, code);
9555 OMP_CLAUSE_LOCATION (t) = loc;
9557 #ifdef GATHER_STATISTICS
9558 tree_node_counts[(int) omp_clause_kind]++;
9559 tree_node_sizes[(int) omp_clause_kind] += size;
9565 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9566 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9567 Except for the CODE and operand count field, other storage for the
9568 object is initialized to zeros. */
9571 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9574 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9576 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9577 gcc_assert (len >= 1);
9579 #ifdef GATHER_STATISTICS
9580 tree_node_counts[(int) e_kind]++;
9581 tree_node_sizes[(int) e_kind] += length;
9584 t = ggc_alloc_zone_cleared_tree_node_stat (&tree_zone, length PASS_MEM_STAT);
9586 TREE_SET_CODE (t, code);
9588 /* Can't use TREE_OPERAND to store the length because if checking is
9589 enabled, it will try to check the length before we store it. :-P */
9590 t->exp.operands[0] = build_int_cst (sizetype, len);
9595 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9596 FN and a null static chain slot. NARGS is the number of call arguments
9597 which are specified as "..." arguments. */
9600 build_call_nary (tree return_type, tree fn, int nargs, ...)
9604 va_start (args, nargs);
9605 ret = build_call_valist (return_type, fn, nargs, args);
9610 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9611 FN and a null static chain slot. NARGS is the number of call arguments
9612 which are specified as a va_list ARGS. */
9615 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9620 t = build_vl_exp (CALL_EXPR, nargs + 3);
9621 TREE_TYPE (t) = return_type;
9622 CALL_EXPR_FN (t) = fn;
9623 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9624 for (i = 0; i < nargs; i++)
9625 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9626 process_call_operands (t);
9630 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9631 FN and a null static chain slot. NARGS is the number of call arguments
9632 which are specified as a tree array ARGS. */
9635 build_call_array_loc (location_t loc, tree return_type, tree fn,
9636 int nargs, const tree *args)
9641 t = build_vl_exp (CALL_EXPR, nargs + 3);
9642 TREE_TYPE (t) = return_type;
9643 CALL_EXPR_FN (t) = fn;
9644 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9645 for (i = 0; i < nargs; i++)
9646 CALL_EXPR_ARG (t, i) = args[i];
9647 process_call_operands (t);
9648 SET_EXPR_LOCATION (t, loc);
9652 /* Like build_call_array, but takes a VEC. */
9655 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9660 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9661 TREE_TYPE (ret) = return_type;
9662 CALL_EXPR_FN (ret) = fn;
9663 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9664 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9665 CALL_EXPR_ARG (ret, ix) = t;
9666 process_call_operands (ret);
9671 /* Returns true if it is possible to prove that the index of
9672 an array access REF (an ARRAY_REF expression) falls into the
9676 in_array_bounds_p (tree ref)
9678 tree idx = TREE_OPERAND (ref, 1);
9681 if (TREE_CODE (idx) != INTEGER_CST)
9684 min = array_ref_low_bound (ref);
9685 max = array_ref_up_bound (ref);
9688 || TREE_CODE (min) != INTEGER_CST
9689 || TREE_CODE (max) != INTEGER_CST)
9692 if (tree_int_cst_lt (idx, min)
9693 || tree_int_cst_lt (max, idx))
9699 /* Returns true if it is possible to prove that the range of
9700 an array access REF (an ARRAY_RANGE_REF expression) falls
9701 into the array bounds. */
9704 range_in_array_bounds_p (tree ref)
9706 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9707 tree range_min, range_max, min, max;
9709 range_min = TYPE_MIN_VALUE (domain_type);
9710 range_max = TYPE_MAX_VALUE (domain_type);
9713 || TREE_CODE (range_min) != INTEGER_CST
9714 || TREE_CODE (range_max) != INTEGER_CST)
9717 min = array_ref_low_bound (ref);
9718 max = array_ref_up_bound (ref);
9721 || TREE_CODE (min) != INTEGER_CST
9722 || TREE_CODE (max) != INTEGER_CST)
9725 if (tree_int_cst_lt (range_min, min)
9726 || tree_int_cst_lt (max, range_max))
9732 /* Return true if T (assumed to be a DECL) must be assigned a memory
9736 needs_to_live_in_memory (const_tree t)
9738 if (TREE_CODE (t) == SSA_NAME)
9739 t = SSA_NAME_VAR (t);
9741 return (TREE_ADDRESSABLE (t)
9742 || is_global_var (t)
9743 || (TREE_CODE (t) == RESULT_DECL
9744 && !DECL_BY_REFERENCE (t)
9745 && aggregate_value_p (t, current_function_decl)));
9748 /* There are situations in which a language considers record types
9749 compatible which have different field lists. Decide if two fields
9750 are compatible. It is assumed that the parent records are compatible. */
9753 fields_compatible_p (const_tree f1, const_tree f2)
9755 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9756 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9759 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9760 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9763 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9769 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9772 find_compatible_field (tree record, tree orig_field)
9776 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9777 if (TREE_CODE (f) == FIELD_DECL
9778 && fields_compatible_p (f, orig_field))
9781 /* ??? Why isn't this on the main fields list? */
9782 f = TYPE_VFIELD (record);
9783 if (f && TREE_CODE (f) == FIELD_DECL
9784 && fields_compatible_p (f, orig_field))
9787 /* ??? We should abort here, but Java appears to do Bad Things
9788 with inherited fields. */
9792 /* Return value of a constant X and sign-extend it. */
9795 int_cst_value (const_tree x)
9797 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9798 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9800 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9801 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9802 || TREE_INT_CST_HIGH (x) == -1);
9804 if (bits < HOST_BITS_PER_WIDE_INT)
9806 bool negative = ((val >> (bits - 1)) & 1) != 0;
9808 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9810 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9816 /* Return value of a constant X and sign-extend it. */
9819 widest_int_cst_value (const_tree x)
9821 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9822 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9824 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9825 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9826 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9827 << HOST_BITS_PER_WIDE_INT);
9829 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9830 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9831 || TREE_INT_CST_HIGH (x) == -1);
9834 if (bits < HOST_BITS_PER_WIDEST_INT)
9836 bool negative = ((val >> (bits - 1)) & 1) != 0;
9838 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9840 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9846 /* If TYPE is an integral type, return an equivalent type which is
9847 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9848 return TYPE itself. */
9851 signed_or_unsigned_type_for (int unsignedp, tree type)
9854 if (POINTER_TYPE_P (type))
9856 /* If the pointer points to the normal address space, use the
9857 size_type_node. Otherwise use an appropriate size for the pointer
9858 based on the named address space it points to. */
9859 if (!TYPE_ADDR_SPACE (TREE_TYPE (t)))
9862 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9865 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9868 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9871 /* Returns unsigned variant of TYPE. */
9874 unsigned_type_for (tree type)
9876 return signed_or_unsigned_type_for (1, type);
9879 /* Returns signed variant of TYPE. */
9882 signed_type_for (tree type)
9884 return signed_or_unsigned_type_for (0, type);
9887 /* Returns the largest value obtainable by casting something in INNER type to
9891 upper_bound_in_type (tree outer, tree inner)
9893 unsigned HOST_WIDE_INT lo, hi;
9894 unsigned int det = 0;
9895 unsigned oprec = TYPE_PRECISION (outer);
9896 unsigned iprec = TYPE_PRECISION (inner);
9899 /* Compute a unique number for every combination. */
9900 det |= (oprec > iprec) ? 4 : 0;
9901 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9902 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9904 /* Determine the exponent to use. */
9909 /* oprec <= iprec, outer: signed, inner: don't care. */
9914 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9918 /* oprec > iprec, outer: signed, inner: signed. */
9922 /* oprec > iprec, outer: signed, inner: unsigned. */
9926 /* oprec > iprec, outer: unsigned, inner: signed. */
9930 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9937 /* Compute 2^^prec - 1. */
9938 if (prec <= HOST_BITS_PER_WIDE_INT)
9941 lo = ((~(unsigned HOST_WIDE_INT) 0)
9942 >> (HOST_BITS_PER_WIDE_INT - prec));
9946 hi = ((~(unsigned HOST_WIDE_INT) 0)
9947 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9948 lo = ~(unsigned HOST_WIDE_INT) 0;
9951 return build_int_cst_wide (outer, lo, hi);
9954 /* Returns the smallest value obtainable by casting something in INNER type to
9958 lower_bound_in_type (tree outer, tree inner)
9960 unsigned HOST_WIDE_INT lo, hi;
9961 unsigned oprec = TYPE_PRECISION (outer);
9962 unsigned iprec = TYPE_PRECISION (inner);
9964 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9966 if (TYPE_UNSIGNED (outer)
9967 /* If we are widening something of an unsigned type, OUTER type
9968 contains all values of INNER type. In particular, both INNER
9969 and OUTER types have zero in common. */
9970 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9974 /* If we are widening a signed type to another signed type, we
9975 want to obtain -2^^(iprec-1). If we are keeping the
9976 precision or narrowing to a signed type, we want to obtain
9978 unsigned prec = oprec > iprec ? iprec : oprec;
9980 if (prec <= HOST_BITS_PER_WIDE_INT)
9982 hi = ~(unsigned HOST_WIDE_INT) 0;
9983 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9987 hi = ((~(unsigned HOST_WIDE_INT) 0)
9988 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9993 return build_int_cst_wide (outer, lo, hi);
9996 /* Return nonzero if two operands that are suitable for PHI nodes are
9997 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9998 SSA_NAME or invariant. Note that this is strictly an optimization.
9999 That is, callers of this function can directly call operand_equal_p
10000 and get the same result, only slower. */
10003 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
10007 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
10009 return operand_equal_p (arg0, arg1, 0);
10012 /* Returns number of zeros at the end of binary representation of X.
10014 ??? Use ffs if available? */
10017 num_ending_zeros (const_tree x)
10019 unsigned HOST_WIDE_INT fr, nfr;
10020 unsigned num, abits;
10021 tree type = TREE_TYPE (x);
10023 if (TREE_INT_CST_LOW (x) == 0)
10025 num = HOST_BITS_PER_WIDE_INT;
10026 fr = TREE_INT_CST_HIGH (x);
10031 fr = TREE_INT_CST_LOW (x);
10034 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
10037 if (nfr << abits == fr)
10044 if (num > TYPE_PRECISION (type))
10045 num = TYPE_PRECISION (type);
10047 return build_int_cst_type (type, num);
10051 #define WALK_SUBTREE(NODE) \
10054 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10060 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10061 be walked whenever a type is seen in the tree. Rest of operands and return
10062 value are as for walk_tree. */
10065 walk_type_fields (tree type, walk_tree_fn func, void *data,
10066 struct pointer_set_t *pset, walk_tree_lh lh)
10068 tree result = NULL_TREE;
10070 switch (TREE_CODE (type))
10073 case REFERENCE_TYPE:
10074 /* We have to worry about mutually recursive pointers. These can't
10075 be written in C. They can in Ada. It's pathological, but
10076 there's an ACATS test (c38102a) that checks it. Deal with this
10077 by checking if we're pointing to another pointer, that one
10078 points to another pointer, that one does too, and we have no htab.
10079 If so, get a hash table. We check three levels deep to avoid
10080 the cost of the hash table if we don't need one. */
10081 if (POINTER_TYPE_P (TREE_TYPE (type))
10082 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
10083 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
10086 result = walk_tree_without_duplicates (&TREE_TYPE (type),
10094 /* ... fall through ... */
10097 WALK_SUBTREE (TREE_TYPE (type));
10101 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
10103 /* Fall through. */
10105 case FUNCTION_TYPE:
10106 WALK_SUBTREE (TREE_TYPE (type));
10110 /* We never want to walk into default arguments. */
10111 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
10112 WALK_SUBTREE (TREE_VALUE (arg));
10117 /* Don't follow this nodes's type if a pointer for fear that
10118 we'll have infinite recursion. If we have a PSET, then we
10121 || (!POINTER_TYPE_P (TREE_TYPE (type))
10122 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
10123 WALK_SUBTREE (TREE_TYPE (type));
10124 WALK_SUBTREE (TYPE_DOMAIN (type));
10128 WALK_SUBTREE (TREE_TYPE (type));
10129 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
10139 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10140 called with the DATA and the address of each sub-tree. If FUNC returns a
10141 non-NULL value, the traversal is stopped, and the value returned by FUNC
10142 is returned. If PSET is non-NULL it is used to record the nodes visited,
10143 and to avoid visiting a node more than once. */
10146 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
10147 struct pointer_set_t *pset, walk_tree_lh lh)
10149 enum tree_code code;
10153 #define WALK_SUBTREE_TAIL(NODE) \
10157 goto tail_recurse; \
10162 /* Skip empty subtrees. */
10166 /* Don't walk the same tree twice, if the user has requested
10167 that we avoid doing so. */
10168 if (pset && pointer_set_insert (pset, *tp))
10171 /* Call the function. */
10173 result = (*func) (tp, &walk_subtrees, data);
10175 /* If we found something, return it. */
10179 code = TREE_CODE (*tp);
10181 /* Even if we didn't, FUNC may have decided that there was nothing
10182 interesting below this point in the tree. */
10183 if (!walk_subtrees)
10185 /* But we still need to check our siblings. */
10186 if (code == TREE_LIST)
10187 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10188 else if (code == OMP_CLAUSE)
10189 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10196 result = (*lh) (tp, &walk_subtrees, func, data, pset);
10197 if (result || !walk_subtrees)
10204 case IDENTIFIER_NODE:
10211 case PLACEHOLDER_EXPR:
10215 /* None of these have subtrees other than those already walked
10220 WALK_SUBTREE (TREE_VALUE (*tp));
10221 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
10226 int len = TREE_VEC_LENGTH (*tp);
10231 /* Walk all elements but the first. */
10233 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
10235 /* Now walk the first one as a tail call. */
10236 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
10240 WALK_SUBTREE (TREE_REALPART (*tp));
10241 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
10245 unsigned HOST_WIDE_INT idx;
10246 constructor_elt *ce;
10249 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
10251 WALK_SUBTREE (ce->value);
10256 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
10261 for (decl = BIND_EXPR_VARS (*tp); decl; decl = DECL_CHAIN (decl))
10263 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10264 into declarations that are just mentioned, rather than
10265 declared; they don't really belong to this part of the tree.
10266 And, we can see cycles: the initializer for a declaration
10267 can refer to the declaration itself. */
10268 WALK_SUBTREE (DECL_INITIAL (decl));
10269 WALK_SUBTREE (DECL_SIZE (decl));
10270 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
10272 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
10275 case STATEMENT_LIST:
10277 tree_stmt_iterator i;
10278 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
10279 WALK_SUBTREE (*tsi_stmt_ptr (i));
10284 switch (OMP_CLAUSE_CODE (*tp))
10286 case OMP_CLAUSE_PRIVATE:
10287 case OMP_CLAUSE_SHARED:
10288 case OMP_CLAUSE_FIRSTPRIVATE:
10289 case OMP_CLAUSE_COPYIN:
10290 case OMP_CLAUSE_COPYPRIVATE:
10291 case OMP_CLAUSE_IF:
10292 case OMP_CLAUSE_NUM_THREADS:
10293 case OMP_CLAUSE_SCHEDULE:
10294 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
10297 case OMP_CLAUSE_NOWAIT:
10298 case OMP_CLAUSE_ORDERED:
10299 case OMP_CLAUSE_DEFAULT:
10300 case OMP_CLAUSE_UNTIED:
10301 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10303 case OMP_CLAUSE_LASTPRIVATE:
10304 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
10305 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
10306 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10308 case OMP_CLAUSE_COLLAPSE:
10311 for (i = 0; i < 3; i++)
10312 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10313 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10316 case OMP_CLAUSE_REDUCTION:
10319 for (i = 0; i < 4; i++)
10320 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
10321 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10325 gcc_unreachable ();
10333 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10334 But, we only want to walk once. */
10335 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10336 for (i = 0; i < len; ++i)
10337 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10338 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10342 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10343 defining. We only want to walk into these fields of a type in this
10344 case and not in the general case of a mere reference to the type.
10346 The criterion is as follows: if the field can be an expression, it
10347 must be walked only here. This should be in keeping with the fields
10348 that are directly gimplified in gimplify_type_sizes in order for the
10349 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10350 variable-sized types.
10352 Note that DECLs get walked as part of processing the BIND_EXPR. */
10353 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10355 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10356 if (TREE_CODE (*type_p) == ERROR_MARK)
10359 /* Call the function for the type. See if it returns anything or
10360 doesn't want us to continue. If we are to continue, walk both
10361 the normal fields and those for the declaration case. */
10362 result = (*func) (type_p, &walk_subtrees, data);
10363 if (result || !walk_subtrees)
10366 result = walk_type_fields (*type_p, func, data, pset, lh);
10370 /* If this is a record type, also walk the fields. */
10371 if (RECORD_OR_UNION_TYPE_P (*type_p))
10375 for (field = TYPE_FIELDS (*type_p); field;
10376 field = DECL_CHAIN (field))
10378 /* We'd like to look at the type of the field, but we can
10379 easily get infinite recursion. So assume it's pointed
10380 to elsewhere in the tree. Also, ignore things that
10382 if (TREE_CODE (field) != FIELD_DECL)
10385 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10386 WALK_SUBTREE (DECL_SIZE (field));
10387 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10388 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10389 WALK_SUBTREE (DECL_QUALIFIER (field));
10393 /* Same for scalar types. */
10394 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10395 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10396 || TREE_CODE (*type_p) == INTEGER_TYPE
10397 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10398 || TREE_CODE (*type_p) == REAL_TYPE)
10400 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10401 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10404 WALK_SUBTREE (TYPE_SIZE (*type_p));
10405 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10410 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10414 /* Walk over all the sub-trees of this operand. */
10415 len = TREE_OPERAND_LENGTH (*tp);
10417 /* Go through the subtrees. We need to do this in forward order so
10418 that the scope of a FOR_EXPR is handled properly. */
10421 for (i = 0; i < len - 1; ++i)
10422 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10423 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10426 /* If this is a type, walk the needed fields in the type. */
10427 else if (TYPE_P (*tp))
10428 return walk_type_fields (*tp, func, data, pset, lh);
10432 /* We didn't find what we were looking for. */
10435 #undef WALK_SUBTREE_TAIL
10437 #undef WALK_SUBTREE
10439 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10442 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10446 struct pointer_set_t *pset;
10448 pset = pointer_set_create ();
10449 result = walk_tree_1 (tp, func, data, pset, lh);
10450 pointer_set_destroy (pset);
10456 tree_block (tree t)
10458 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10460 if (IS_EXPR_CODE_CLASS (c))
10461 return &t->exp.block;
10462 gcc_unreachable ();
10466 /* Create a nameless artificial label and put it in the current
10467 function context. The label has a location of LOC. Returns the
10468 newly created label. */
10471 create_artificial_label (location_t loc)
10473 tree lab = build_decl (loc,
10474 LABEL_DECL, NULL_TREE, void_type_node);
10476 DECL_ARTIFICIAL (lab) = 1;
10477 DECL_IGNORED_P (lab) = 1;
10478 DECL_CONTEXT (lab) = current_function_decl;
10482 /* Given a tree, try to return a useful variable name that we can use
10483 to prefix a temporary that is being assigned the value of the tree.
10484 I.E. given <temp> = &A, return A. */
10489 tree stripped_decl;
10492 STRIP_NOPS (stripped_decl);
10493 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10494 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10497 switch (TREE_CODE (stripped_decl))
10500 return get_name (TREE_OPERAND (stripped_decl, 0));
10507 /* Return true if TYPE has a variable argument list. */
10510 stdarg_p (tree fntype)
10512 function_args_iterator args_iter;
10513 tree n = NULL_TREE, t;
10518 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10523 return n != NULL_TREE && n != void_type_node;
10526 /* Return true if TYPE has a prototype. */
10529 prototype_p (tree fntype)
10533 gcc_assert (fntype != NULL_TREE);
10535 t = TYPE_ARG_TYPES (fntype);
10536 return (t != NULL_TREE);
10539 /* If BLOCK is inlined from an __attribute__((__artificial__))
10540 routine, return pointer to location from where it has been
10543 block_nonartificial_location (tree block)
10545 location_t *ret = NULL;
10547 while (block && TREE_CODE (block) == BLOCK
10548 && BLOCK_ABSTRACT_ORIGIN (block))
10550 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10552 while (TREE_CODE (ao) == BLOCK
10553 && BLOCK_ABSTRACT_ORIGIN (ao)
10554 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10555 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10557 if (TREE_CODE (ao) == FUNCTION_DECL)
10559 /* If AO is an artificial inline, point RET to the
10560 call site locus at which it has been inlined and continue
10561 the loop, in case AO's caller is also an artificial
10563 if (DECL_DECLARED_INLINE_P (ao)
10564 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10565 ret = &BLOCK_SOURCE_LOCATION (block);
10569 else if (TREE_CODE (ao) != BLOCK)
10572 block = BLOCK_SUPERCONTEXT (block);
10578 /* If EXP is inlined from an __attribute__((__artificial__))
10579 function, return the location of the original call expression. */
10582 tree_nonartificial_location (tree exp)
10584 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10589 return EXPR_LOCATION (exp);
10593 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10596 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10599 cl_option_hash_hash (const void *x)
10601 const_tree const t = (const_tree) x;
10605 hashval_t hash = 0;
10607 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10609 p = (const char *)TREE_OPTIMIZATION (t);
10610 len = sizeof (struct cl_optimization);
10613 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10615 p = (const char *)TREE_TARGET_OPTION (t);
10616 len = sizeof (struct cl_target_option);
10620 gcc_unreachable ();
10622 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10624 for (i = 0; i < len; i++)
10626 hash = (hash << 4) ^ ((i << 2) | p[i]);
10631 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10632 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10636 cl_option_hash_eq (const void *x, const void *y)
10638 const_tree const xt = (const_tree) x;
10639 const_tree const yt = (const_tree) y;
10644 if (TREE_CODE (xt) != TREE_CODE (yt))
10647 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10649 xp = (const char *)TREE_OPTIMIZATION (xt);
10650 yp = (const char *)TREE_OPTIMIZATION (yt);
10651 len = sizeof (struct cl_optimization);
10654 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10656 xp = (const char *)TREE_TARGET_OPTION (xt);
10657 yp = (const char *)TREE_TARGET_OPTION (yt);
10658 len = sizeof (struct cl_target_option);
10662 gcc_unreachable ();
10664 return (memcmp (xp, yp, len) == 0);
10667 /* Build an OPTIMIZATION_NODE based on the current options. */
10670 build_optimization_node (void)
10675 /* Use the cache of optimization nodes. */
10677 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10679 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10683 /* Insert this one into the hash table. */
10684 t = cl_optimization_node;
10687 /* Make a new node for next time round. */
10688 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10694 /* Build a TARGET_OPTION_NODE based on the current options. */
10697 build_target_option_node (void)
10702 /* Use the cache of optimization nodes. */
10704 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10706 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10710 /* Insert this one into the hash table. */
10711 t = cl_target_option_node;
10714 /* Make a new node for next time round. */
10715 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10721 /* Determine the "ultimate origin" of a block. The block may be an inlined
10722 instance of an inlined instance of a block which is local to an inline
10723 function, so we have to trace all of the way back through the origin chain
10724 to find out what sort of node actually served as the original seed for the
10728 block_ultimate_origin (const_tree block)
10730 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10732 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10733 nodes in the function to point to themselves; ignore that if
10734 we're trying to output the abstract instance of this function. */
10735 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10738 if (immediate_origin == NULL_TREE)
10743 tree lookahead = immediate_origin;
10747 ret_val = lookahead;
10748 lookahead = (TREE_CODE (ret_val) == BLOCK
10749 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10751 while (lookahead != NULL && lookahead != ret_val);
10753 /* The block's abstract origin chain may not be the *ultimate* origin of
10754 the block. It could lead to a DECL that has an abstract origin set.
10755 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10756 will give us if it has one). Note that DECL's abstract origins are
10757 supposed to be the most distant ancestor (or so decl_ultimate_origin
10758 claims), so we don't need to loop following the DECL origins. */
10759 if (DECL_P (ret_val))
10760 return DECL_ORIGIN (ret_val);
10766 /* Return true if T1 and T2 are equivalent lists. */
10769 list_equal_p (const_tree t1, const_tree t2)
10771 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10772 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10777 /* Return true iff conversion in EXP generates no instruction. Mark
10778 it inline so that we fully inline into the stripping functions even
10779 though we have two uses of this function. */
10782 tree_nop_conversion (const_tree exp)
10784 tree outer_type, inner_type;
10786 if (!CONVERT_EXPR_P (exp)
10787 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10789 if (TREE_OPERAND (exp, 0) == error_mark_node)
10792 outer_type = TREE_TYPE (exp);
10793 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10798 /* Use precision rather then machine mode when we can, which gives
10799 the correct answer even for submode (bit-field) types. */
10800 if ((INTEGRAL_TYPE_P (outer_type)
10801 || POINTER_TYPE_P (outer_type)
10802 || TREE_CODE (outer_type) == OFFSET_TYPE)
10803 && (INTEGRAL_TYPE_P (inner_type)
10804 || POINTER_TYPE_P (inner_type)
10805 || TREE_CODE (inner_type) == OFFSET_TYPE))
10806 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10808 /* Otherwise fall back on comparing machine modes (e.g. for
10809 aggregate types, floats). */
10810 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10813 /* Return true iff conversion in EXP generates no instruction. Don't
10814 consider conversions changing the signedness. */
10817 tree_sign_nop_conversion (const_tree exp)
10819 tree outer_type, inner_type;
10821 if (!tree_nop_conversion (exp))
10824 outer_type = TREE_TYPE (exp);
10825 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10827 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10828 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10831 /* Strip conversions from EXP according to tree_nop_conversion and
10832 return the resulting expression. */
10835 tree_strip_nop_conversions (tree exp)
10837 while (tree_nop_conversion (exp))
10838 exp = TREE_OPERAND (exp, 0);
10842 /* Strip conversions from EXP according to tree_sign_nop_conversion
10843 and return the resulting expression. */
10846 tree_strip_sign_nop_conversions (tree exp)
10848 while (tree_sign_nop_conversion (exp))
10849 exp = TREE_OPERAND (exp, 0);
10853 static GTY(()) tree gcc_eh_personality_decl;
10855 /* Return the GCC personality function decl. */
10858 lhd_gcc_personality (void)
10860 if (!gcc_eh_personality_decl)
10861 gcc_eh_personality_decl
10862 = build_personality_function (USING_SJLJ_EXCEPTIONS
10863 ? "__gcc_personality_sj0"
10864 : "__gcc_personality_v0");
10866 return gcc_eh_personality_decl;
10869 /* Try to find a base info of BINFO that would have its field decl at offset
10870 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10871 found, return, otherwise return NULL_TREE. */
10874 get_binfo_at_offset (tree binfo, HOST_WIDE_INT offset, tree expected_type)
10881 type = TREE_TYPE (binfo);
10884 tree base_binfo, found_binfo;
10885 HOST_WIDE_INT pos, size;
10889 if (TREE_CODE (type) != RECORD_TYPE)
10892 for (fld = TYPE_FIELDS (type); fld; fld = DECL_CHAIN (fld))
10894 if (TREE_CODE (fld) != FIELD_DECL)
10897 pos = int_bit_position (fld);
10898 size = tree_low_cst (DECL_SIZE (fld), 1);
10899 if (pos <= offset && (pos + size) > offset)
10905 found_binfo = NULL_TREE;
10906 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
10907 if (TREE_TYPE (base_binfo) == TREE_TYPE (fld))
10909 found_binfo = base_binfo;
10916 type = TREE_TYPE (fld);
10917 binfo = found_binfo;
10920 if (type != expected_type)
10925 /* Returns true if X is a typedef decl. */
10928 is_typedef_decl (tree x)
10930 return (x && TREE_CODE (x) == TYPE_DECL
10931 && DECL_ORIGINAL_TYPE (x) != NULL_TREE);
10934 /* Returns true iff TYPE is a type variant created for a typedef. */
10937 typedef_variant_p (tree type)
10939 return is_typedef_decl (TYPE_NAME (type));
10942 #include "gt-tree.h"