1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
63 /* Tree code classes. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 #define END_OF_BASE_TREE_CODES tcc_exceptional,
68 const enum tree_code_class tree_code_type[] = {
69 #include "all-tree.def"
73 #undef END_OF_BASE_TREE_CODES
75 /* Table indexed by tree code giving number of expression
76 operands beyond the fixed part of the node structure.
77 Not used for types or decls. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
80 #define END_OF_BASE_TREE_CODES 0,
82 const unsigned char tree_code_length[] = {
83 #include "all-tree.def"
87 #undef END_OF_BASE_TREE_CODES
89 /* Names of tree components.
90 Used for printing out the tree and error messages. */
91 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
92 #define END_OF_BASE_TREE_CODES "@dummy",
94 const char *const tree_code_name[] = {
95 #include "all-tree.def"
99 #undef END_OF_BASE_TREE_CODES
101 /* Each tree code class has an associated string representation.
102 These must correspond to the tree_code_class entries. */
104 const char *const tree_code_class_strings[] =
119 /* obstack.[ch] explicitly declined to prototype this. */
120 extern int _obstack_allocated_p (struct obstack *h, void *obj);
122 #ifdef GATHER_STATISTICS
123 /* Statistics-gathering stuff. */
125 int tree_node_counts[(int) all_kinds];
126 int tree_node_sizes[(int) all_kinds];
128 /* Keep in sync with tree.h:enum tree_node_kind. */
129 static const char * const tree_node_kind_names[] = {
149 #endif /* GATHER_STATISTICS */
151 /* Unique id for next decl created. */
152 static GTY(()) int next_decl_uid;
153 /* Unique id for next type created. */
154 static GTY(()) int next_type_uid = 1;
156 /* Since we cannot rehash a type after it is in the table, we have to
157 keep the hash code. */
159 struct GTY(()) type_hash {
164 /* Initial size of the hash table (rounded to next prime). */
165 #define TYPE_HASH_INITIAL_SIZE 1000
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
174 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
175 htab_t type_hash_table;
177 /* Hash table and temporary node for larger integer const values. */
178 static GTY (()) tree int_cst_node;
179 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
180 htab_t int_cst_hash_table;
182 /* Hash table for optimization flags and target option flags. Use the same
183 hash table for both sets of options. Nodes for building the current
184 optimization and target option nodes. The assumption is most of the time
185 the options created will already be in the hash table, so we avoid
186 allocating and freeing up a node repeatably. */
187 static GTY (()) tree cl_optimization_node;
188 static GTY (()) tree cl_target_option_node;
189 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node)))
190 htab_t cl_option_hash_table;
192 /* General tree->tree mapping structure for use in hash tables. */
195 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
196 htab_t debug_expr_for_decl;
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
199 htab_t value_expr_for_decl;
201 static GTY ((if_marked ("tree_priority_map_marked_p"),
202 param_is (struct tree_priority_map)))
203 htab_t init_priority_for_decl;
205 static void set_type_quals (tree, int);
206 static int type_hash_eq (const void *, const void *);
207 static hashval_t type_hash_hash (const void *);
208 static hashval_t int_cst_hash_hash (const void *);
209 static int int_cst_hash_eq (const void *, const void *);
210 static hashval_t cl_option_hash_hash (const void *);
211 static int cl_option_hash_eq (const void *, const void *);
212 static void print_type_hash_statistics (void);
213 static void print_debug_expr_statistics (void);
214 static void print_value_expr_statistics (void);
215 static int type_hash_marked_p (const void *);
216 static unsigned int type_hash_list (const_tree, hashval_t);
217 static unsigned int attribute_hash_list (const_tree, hashval_t);
219 tree global_trees[TI_MAX];
220 tree integer_types[itk_none];
222 unsigned char tree_contains_struct[MAX_TREE_CODES][64];
224 /* Number of operands for each OpenMP clause. */
225 unsigned const char omp_clause_num_ops[] =
227 0, /* OMP_CLAUSE_ERROR */
228 1, /* OMP_CLAUSE_PRIVATE */
229 1, /* OMP_CLAUSE_SHARED */
230 1, /* OMP_CLAUSE_FIRSTPRIVATE */
231 2, /* OMP_CLAUSE_LASTPRIVATE */
232 4, /* OMP_CLAUSE_REDUCTION */
233 1, /* OMP_CLAUSE_COPYIN */
234 1, /* OMP_CLAUSE_COPYPRIVATE */
235 1, /* OMP_CLAUSE_IF */
236 1, /* OMP_CLAUSE_NUM_THREADS */
237 1, /* OMP_CLAUSE_SCHEDULE */
238 0, /* OMP_CLAUSE_NOWAIT */
239 0, /* OMP_CLAUSE_ORDERED */
240 0, /* OMP_CLAUSE_DEFAULT */
241 3, /* OMP_CLAUSE_COLLAPSE */
242 0 /* OMP_CLAUSE_UNTIED */
245 const char * const omp_clause_code_name[] =
266 /* Return the tree node structure used by tree code CODE. */
268 static inline enum tree_node_structure_enum
269 tree_node_structure_for_code (enum tree_code code)
271 switch (TREE_CODE_CLASS (code))
273 case tcc_declaration:
278 return TS_FIELD_DECL;
284 return TS_LABEL_DECL;
286 return TS_RESULT_DECL;
288 return TS_CONST_DECL;
292 return TS_FUNCTION_DECL;
294 return TS_DECL_NON_COMMON;
307 default: /* tcc_constant and tcc_exceptional */
312 /* tcc_constant cases. */
313 case INTEGER_CST: return TS_INT_CST;
314 case REAL_CST: return TS_REAL_CST;
315 case FIXED_CST: return TS_FIXED_CST;
316 case COMPLEX_CST: return TS_COMPLEX;
317 case VECTOR_CST: return TS_VECTOR;
318 case STRING_CST: return TS_STRING;
319 /* tcc_exceptional cases. */
320 case ERROR_MARK: return TS_COMMON;
321 case IDENTIFIER_NODE: return TS_IDENTIFIER;
322 case TREE_LIST: return TS_LIST;
323 case TREE_VEC: return TS_VEC;
324 case SSA_NAME: return TS_SSA_NAME;
325 case PLACEHOLDER_EXPR: return TS_COMMON;
326 case STATEMENT_LIST: return TS_STATEMENT_LIST;
327 case BLOCK: return TS_BLOCK;
328 case CONSTRUCTOR: return TS_CONSTRUCTOR;
329 case TREE_BINFO: return TS_BINFO;
330 case OMP_CLAUSE: return TS_OMP_CLAUSE;
331 case OPTIMIZATION_NODE: return TS_OPTIMIZATION;
332 case TARGET_OPTION_NODE: return TS_TARGET_OPTION;
340 /* Initialize tree_contains_struct to describe the hierarchy of tree
344 initialize_tree_contains_struct (void)
348 #define MARK_TS_BASE(C) \
350 tree_contains_struct[C][TS_BASE] = 1; \
353 #define MARK_TS_COMMON(C) \
356 tree_contains_struct[C][TS_COMMON] = 1; \
359 #define MARK_TS_DECL_MINIMAL(C) \
361 MARK_TS_COMMON (C); \
362 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
365 #define MARK_TS_DECL_COMMON(C) \
367 MARK_TS_DECL_MINIMAL (C); \
368 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
371 #define MARK_TS_DECL_WRTL(C) \
373 MARK_TS_DECL_COMMON (C); \
374 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
377 #define MARK_TS_DECL_WITH_VIS(C) \
379 MARK_TS_DECL_WRTL (C); \
380 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
383 #define MARK_TS_DECL_NON_COMMON(C) \
385 MARK_TS_DECL_WITH_VIS (C); \
386 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
389 for (i = ERROR_MARK; i < LAST_AND_UNUSED_TREE_CODE; i++)
392 enum tree_node_structure_enum ts_code;
394 code = (enum tree_code) i;
395 ts_code = tree_node_structure_for_code (code);
397 /* Mark the TS structure itself. */
398 tree_contains_struct[code][ts_code] = 1;
400 /* Mark all the structures that TS is derived from. */
414 case TS_DECL_MINIMAL:
422 case TS_STATEMENT_LIST:
425 case TS_OPTIMIZATION:
426 case TS_TARGET_OPTION:
427 MARK_TS_COMMON (code);
431 MARK_TS_DECL_MINIMAL (code);
435 MARK_TS_DECL_COMMON (code);
438 case TS_DECL_NON_COMMON:
439 MARK_TS_DECL_WITH_VIS (code);
442 case TS_DECL_WITH_VIS:
447 MARK_TS_DECL_WRTL (code);
451 MARK_TS_DECL_COMMON (code);
455 MARK_TS_DECL_WITH_VIS (code);
459 case TS_FUNCTION_DECL:
460 MARK_TS_DECL_NON_COMMON (code);
468 /* Basic consistency checks for attributes used in fold. */
469 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_NON_COMMON]);
470 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_NON_COMMON]);
471 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_NON_COMMON]);
472 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_COMMON]);
473 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_COMMON]);
474 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_COMMON]);
475 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_COMMON]);
476 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_COMMON]);
477 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_COMMON]);
478 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_COMMON]);
479 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_COMMON]);
480 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_COMMON]);
481 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_WRTL]);
482 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WRTL]);
483 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_WRTL]);
484 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_WRTL]);
485 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WRTL]);
486 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_WRTL]);
487 gcc_assert (tree_contains_struct[CONST_DECL][TS_DECL_MINIMAL]);
488 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_MINIMAL]);
489 gcc_assert (tree_contains_struct[PARM_DECL][TS_DECL_MINIMAL]);
490 gcc_assert (tree_contains_struct[RESULT_DECL][TS_DECL_MINIMAL]);
491 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_MINIMAL]);
492 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_MINIMAL]);
493 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_MINIMAL]);
494 gcc_assert (tree_contains_struct[LABEL_DECL][TS_DECL_MINIMAL]);
495 gcc_assert (tree_contains_struct[FIELD_DECL][TS_DECL_MINIMAL]);
496 gcc_assert (tree_contains_struct[VAR_DECL][TS_DECL_WITH_VIS]);
497 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_DECL_WITH_VIS]);
498 gcc_assert (tree_contains_struct[TYPE_DECL][TS_DECL_WITH_VIS]);
499 gcc_assert (tree_contains_struct[TRANSLATION_UNIT_DECL][TS_DECL_WITH_VIS]);
500 gcc_assert (tree_contains_struct[VAR_DECL][TS_VAR_DECL]);
501 gcc_assert (tree_contains_struct[FIELD_DECL][TS_FIELD_DECL]);
502 gcc_assert (tree_contains_struct[PARM_DECL][TS_PARM_DECL]);
503 gcc_assert (tree_contains_struct[LABEL_DECL][TS_LABEL_DECL]);
504 gcc_assert (tree_contains_struct[RESULT_DECL][TS_RESULT_DECL]);
505 gcc_assert (tree_contains_struct[CONST_DECL][TS_CONST_DECL]);
506 gcc_assert (tree_contains_struct[TYPE_DECL][TS_TYPE_DECL]);
507 gcc_assert (tree_contains_struct[FUNCTION_DECL][TS_FUNCTION_DECL]);
508 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_MINIMAL]);
509 gcc_assert (tree_contains_struct[IMPORTED_DECL][TS_DECL_COMMON]);
512 #undef MARK_TS_COMMON
513 #undef MARK_TS_DECL_MINIMAL
514 #undef MARK_TS_DECL_COMMON
515 #undef MARK_TS_DECL_WRTL
516 #undef MARK_TS_DECL_WITH_VIS
517 #undef MARK_TS_DECL_NON_COMMON
526 /* Initialize the hash table of types. */
527 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
530 debug_expr_for_decl = htab_create_ggc (512, tree_map_hash,
533 value_expr_for_decl = htab_create_ggc (512, tree_map_hash,
535 init_priority_for_decl = htab_create_ggc (512, tree_priority_map_hash,
536 tree_priority_map_eq, 0);
538 int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash,
539 int_cst_hash_eq, NULL);
541 int_cst_node = make_node (INTEGER_CST);
543 cl_option_hash_table = htab_create_ggc (64, cl_option_hash_hash,
544 cl_option_hash_eq, NULL);
546 cl_optimization_node = make_node (OPTIMIZATION_NODE);
547 cl_target_option_node = make_node (TARGET_OPTION_NODE);
549 /* Initialize the tree_contains_struct array. */
550 initialize_tree_contains_struct ();
551 lang_hooks.init_ts ();
555 /* The name of the object as the assembler will see it (but before any
556 translations made by ASM_OUTPUT_LABELREF). Often this is the same
557 as DECL_NAME. It is an IDENTIFIER_NODE. */
559 decl_assembler_name (tree decl)
561 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
562 lang_hooks.set_decl_assembler_name (decl);
563 return DECL_WITH_VIS_CHECK (decl)->decl_with_vis.assembler_name;
566 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
569 decl_assembler_name_equal (tree decl, const_tree asmname)
571 tree decl_asmname = DECL_ASSEMBLER_NAME (decl);
572 const char *decl_str;
573 const char *asmname_str;
576 if (decl_asmname == asmname)
579 decl_str = IDENTIFIER_POINTER (decl_asmname);
580 asmname_str = IDENTIFIER_POINTER (asmname);
583 /* If the target assembler name was set by the user, things are trickier.
584 We have a leading '*' to begin with. After that, it's arguable what
585 is the correct thing to do with -fleading-underscore. Arguably, we've
586 historically been doing the wrong thing in assemble_alias by always
587 printing the leading underscore. Since we're not changing that, make
588 sure user_label_prefix follows the '*' before matching. */
589 if (decl_str[0] == '*')
591 size_t ulp_len = strlen (user_label_prefix);
597 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
598 decl_str += ulp_len, test=true;
602 if (asmname_str[0] == '*')
604 size_t ulp_len = strlen (user_label_prefix);
610 else if (strncmp (asmname_str, user_label_prefix, ulp_len) == 0)
611 asmname_str += ulp_len, test=true;
618 return strcmp (decl_str, asmname_str) == 0;
621 /* Hash asmnames ignoring the user specified marks. */
624 decl_assembler_name_hash (const_tree asmname)
626 if (IDENTIFIER_POINTER (asmname)[0] == '*')
628 const char *decl_str = IDENTIFIER_POINTER (asmname) + 1;
629 size_t ulp_len = strlen (user_label_prefix);
633 else if (strncmp (decl_str, user_label_prefix, ulp_len) == 0)
636 return htab_hash_string (decl_str);
639 return htab_hash_string (IDENTIFIER_POINTER (asmname));
642 /* Compute the number of bytes occupied by a tree with code CODE.
643 This function cannot be used for nodes that have variable sizes,
644 including TREE_VEC, STRING_CST, and CALL_EXPR. */
646 tree_code_size (enum tree_code code)
648 switch (TREE_CODE_CLASS (code))
650 case tcc_declaration: /* A decl node */
655 return sizeof (struct tree_field_decl);
657 return sizeof (struct tree_parm_decl);
659 return sizeof (struct tree_var_decl);
661 return sizeof (struct tree_label_decl);
663 return sizeof (struct tree_result_decl);
665 return sizeof (struct tree_const_decl);
667 return sizeof (struct tree_type_decl);
669 return sizeof (struct tree_function_decl);
671 return sizeof (struct tree_decl_non_common);
675 case tcc_type: /* a type node */
676 return sizeof (struct tree_type);
678 case tcc_reference: /* a reference */
679 case tcc_expression: /* an expression */
680 case tcc_statement: /* an expression with side effects */
681 case tcc_comparison: /* a comparison expression */
682 case tcc_unary: /* a unary arithmetic expression */
683 case tcc_binary: /* a binary arithmetic expression */
684 return (sizeof (struct tree_exp)
685 + (TREE_CODE_LENGTH (code) - 1) * sizeof (tree));
687 case tcc_constant: /* a constant */
690 case INTEGER_CST: return sizeof (struct tree_int_cst);
691 case REAL_CST: return sizeof (struct tree_real_cst);
692 case FIXED_CST: return sizeof (struct tree_fixed_cst);
693 case COMPLEX_CST: return sizeof (struct tree_complex);
694 case VECTOR_CST: return sizeof (struct tree_vector);
695 case STRING_CST: gcc_unreachable ();
697 return lang_hooks.tree_size (code);
700 case tcc_exceptional: /* something random, like an identifier. */
703 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
704 case TREE_LIST: return sizeof (struct tree_list);
707 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
710 case OMP_CLAUSE: gcc_unreachable ();
712 case SSA_NAME: return sizeof (struct tree_ssa_name);
714 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
715 case BLOCK: return sizeof (struct tree_block);
716 case CONSTRUCTOR: return sizeof (struct tree_constructor);
717 case OPTIMIZATION_NODE: return sizeof (struct tree_optimization_option);
718 case TARGET_OPTION_NODE: return sizeof (struct tree_target_option);
721 return lang_hooks.tree_size (code);
729 /* Compute the number of bytes occupied by NODE. This routine only
730 looks at TREE_CODE, except for those nodes that have variable sizes. */
732 tree_size (const_tree node)
734 const enum tree_code code = TREE_CODE (node);
738 return (offsetof (struct tree_binfo, base_binfos)
739 + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node)));
742 return (sizeof (struct tree_vec)
743 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree));
746 return TREE_STRING_LENGTH (node) + offsetof (struct tree_string, str) + 1;
749 return (sizeof (struct tree_omp_clause)
750 + (omp_clause_num_ops[OMP_CLAUSE_CODE (node)] - 1)
754 if (TREE_CODE_CLASS (code) == tcc_vl_exp)
755 return (sizeof (struct tree_exp)
756 + (VL_EXP_OPERAND_LENGTH (node) - 1) * sizeof (tree));
758 return tree_code_size (code);
762 /* Return a newly allocated node of code CODE. For decl and type
763 nodes, some other fields are initialized. The rest of the node is
764 initialized to zero. This function cannot be used for TREE_VEC or
765 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
767 Achoo! I got a code in the node. */
770 make_node_stat (enum tree_code code MEM_STAT_DECL)
773 enum tree_code_class type = TREE_CODE_CLASS (code);
774 size_t length = tree_code_size (code);
775 #ifdef GATHER_STATISTICS
780 case tcc_declaration: /* A decl node */
784 case tcc_type: /* a type node */
788 case tcc_statement: /* an expression with side effects */
792 case tcc_reference: /* a reference */
796 case tcc_expression: /* an expression */
797 case tcc_comparison: /* a comparison expression */
798 case tcc_unary: /* a unary arithmetic expression */
799 case tcc_binary: /* a binary arithmetic expression */
803 case tcc_constant: /* a constant */
807 case tcc_exceptional: /* something random, like an identifier. */
810 case IDENTIFIER_NODE:
823 kind = ssa_name_kind;
844 tree_node_counts[(int) kind]++;
845 tree_node_sizes[(int) kind] += length;
848 if (code == IDENTIFIER_NODE)
849 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_id_zone);
851 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
853 memset (t, 0, length);
855 TREE_SET_CODE (t, code);
860 TREE_SIDE_EFFECTS (t) = 1;
863 case tcc_declaration:
864 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
866 if (code == FUNCTION_DECL)
868 DECL_ALIGN (t) = FUNCTION_BOUNDARY;
869 DECL_MODE (t) = FUNCTION_MODE;
874 DECL_SOURCE_LOCATION (t) = input_location;
875 DECL_UID (t) = next_decl_uid++;
876 if (TREE_CODE (t) == LABEL_DECL)
877 LABEL_DECL_UID (t) = -1;
882 TYPE_UID (t) = next_type_uid++;
883 TYPE_ALIGN (t) = BITS_PER_UNIT;
884 TYPE_USER_ALIGN (t) = 0;
885 TYPE_MAIN_VARIANT (t) = t;
886 TYPE_CANONICAL (t) = t;
888 /* Default to no attributes for type, but let target change that. */
889 TYPE_ATTRIBUTES (t) = NULL_TREE;
890 targetm.set_default_type_attributes (t);
892 /* We have not yet computed the alias set for this type. */
893 TYPE_ALIAS_SET (t) = -1;
897 TREE_CONSTANT (t) = 1;
906 case PREDECREMENT_EXPR:
907 case PREINCREMENT_EXPR:
908 case POSTDECREMENT_EXPR:
909 case POSTINCREMENT_EXPR:
910 /* All of these have side-effects, no matter what their
912 TREE_SIDE_EFFECTS (t) = 1;
921 /* Other classes need no special treatment. */
928 /* Return a new node with the same contents as NODE except that its
929 TREE_CHAIN is zero and it has a fresh uid. */
932 copy_node_stat (tree node MEM_STAT_DECL)
935 enum tree_code code = TREE_CODE (node);
938 gcc_assert (code != STATEMENT_LIST);
940 length = tree_size (node);
941 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
942 memcpy (t, node, length);
945 TREE_ASM_WRITTEN (t) = 0;
946 TREE_VISITED (t) = 0;
949 if (TREE_CODE_CLASS (code) == tcc_declaration)
951 DECL_UID (t) = next_decl_uid++;
952 if ((TREE_CODE (node) == PARM_DECL || TREE_CODE (node) == VAR_DECL)
953 && DECL_HAS_VALUE_EXPR_P (node))
955 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (node));
956 DECL_HAS_VALUE_EXPR_P (t) = 1;
958 if (TREE_CODE (node) == VAR_DECL && DECL_HAS_INIT_PRIORITY_P (node))
960 SET_DECL_INIT_PRIORITY (t, DECL_INIT_PRIORITY (node));
961 DECL_HAS_INIT_PRIORITY_P (t) = 1;
964 else if (TREE_CODE_CLASS (code) == tcc_type)
966 TYPE_UID (t) = next_type_uid++;
967 /* The following is so that the debug code for
968 the copy is different from the original type.
969 The two statements usually duplicate each other
970 (because they clear fields of the same union),
971 but the optimizer should catch that. */
972 TYPE_SYMTAB_POINTER (t) = 0;
973 TYPE_SYMTAB_ADDRESS (t) = 0;
975 /* Do not copy the values cache. */
976 if (TYPE_CACHED_VALUES_P(t))
978 TYPE_CACHED_VALUES_P (t) = 0;
979 TYPE_CACHED_VALUES (t) = NULL_TREE;
986 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
987 For example, this can copy a list made of TREE_LIST nodes. */
990 copy_list (tree list)
998 head = prev = copy_node (list);
999 next = TREE_CHAIN (list);
1002 TREE_CHAIN (prev) = copy_node (next);
1003 prev = TREE_CHAIN (prev);
1004 next = TREE_CHAIN (next);
1010 /* Create an INT_CST node with a LOW value sign extended. */
1013 build_int_cst (tree type, HOST_WIDE_INT low)
1015 /* Support legacy code. */
1017 type = integer_type_node;
1019 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
1022 /* Create an INT_CST node with a LOW value zero extended. */
1025 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
1027 return build_int_cst_wide (type, low, 0);
1030 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1031 if it is negative. This function is similar to build_int_cst, but
1032 the extra bits outside of the type precision are cleared. Constants
1033 with these extra bits may confuse the fold so that it detects overflows
1034 even in cases when they do not occur, and in general should be avoided.
1035 We cannot however make this a default behavior of build_int_cst without
1036 more intrusive changes, since there are parts of gcc that rely on the extra
1037 precision of the integer constants. */
1040 build_int_cst_type (tree type, HOST_WIDE_INT low)
1042 unsigned HOST_WIDE_INT low1;
1047 fit_double_type (low, low < 0 ? -1 : 0, &low1, &hi, type);
1049 return build_int_cst_wide (type, low1, hi);
1052 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1053 and sign extended according to the value range of TYPE. */
1056 build_int_cst_wide_type (tree type,
1057 unsigned HOST_WIDE_INT low, HOST_WIDE_INT high)
1059 fit_double_type (low, high, &low, &high, type);
1060 return build_int_cst_wide (type, low, high);
1063 /* These are the hash table functions for the hash table of INTEGER_CST
1064 nodes of a sizetype. */
1066 /* Return the hash code code X, an INTEGER_CST. */
1069 int_cst_hash_hash (const void *x)
1071 const_tree const t = (const_tree) x;
1073 return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t)
1074 ^ htab_hash_pointer (TREE_TYPE (t)));
1077 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1078 is the same as that given by *Y, which is the same. */
1081 int_cst_hash_eq (const void *x, const void *y)
1083 const_tree const xt = (const_tree) x;
1084 const_tree const yt = (const_tree) y;
1086 return (TREE_TYPE (xt) == TREE_TYPE (yt)
1087 && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt)
1088 && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt));
1091 /* Create an INT_CST node of TYPE and value HI:LOW.
1092 The returned node is always shared. For small integers we use a
1093 per-type vector cache, for larger ones we use a single hash table. */
1096 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
1104 switch (TREE_CODE (type))
1107 case REFERENCE_TYPE:
1108 /* Cache NULL pointer. */
1117 /* Cache false or true. */
1125 if (TYPE_UNSIGNED (type))
1128 limit = INTEGER_SHARE_LIMIT;
1129 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1135 limit = INTEGER_SHARE_LIMIT + 1;
1136 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
1138 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
1152 /* Look for it in the type's vector of small shared ints. */
1153 if (!TYPE_CACHED_VALUES_P (type))
1155 TYPE_CACHED_VALUES_P (type) = 1;
1156 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
1159 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
1162 /* Make sure no one is clobbering the shared constant. */
1163 gcc_assert (TREE_TYPE (t) == type);
1164 gcc_assert (TREE_INT_CST_LOW (t) == low);
1165 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
1169 /* Create a new shared int. */
1170 t = make_node (INTEGER_CST);
1172 TREE_INT_CST_LOW (t) = low;
1173 TREE_INT_CST_HIGH (t) = hi;
1174 TREE_TYPE (t) = type;
1176 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
1181 /* Use the cache of larger shared ints. */
1184 TREE_INT_CST_LOW (int_cst_node) = low;
1185 TREE_INT_CST_HIGH (int_cst_node) = hi;
1186 TREE_TYPE (int_cst_node) = type;
1188 slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT);
1192 /* Insert this one into the hash table. */
1195 /* Make a new node for next time round. */
1196 int_cst_node = make_node (INTEGER_CST);
1203 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1204 and the rest are zeros. */
1207 build_low_bits_mask (tree type, unsigned bits)
1209 unsigned HOST_WIDE_INT low;
1211 unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0;
1213 gcc_assert (bits <= TYPE_PRECISION (type));
1215 if (bits == TYPE_PRECISION (type)
1216 && !TYPE_UNSIGNED (type))
1218 /* Sign extended all-ones mask. */
1222 else if (bits <= HOST_BITS_PER_WIDE_INT)
1224 low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1229 bits -= HOST_BITS_PER_WIDE_INT;
1231 high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits);
1234 return build_int_cst_wide (type, low, high);
1237 /* Checks that X is integer constant that can be expressed in (unsigned)
1238 HOST_WIDE_INT without loss of precision. */
1241 cst_and_fits_in_hwi (const_tree x)
1243 if (TREE_CODE (x) != INTEGER_CST)
1246 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
1249 return (TREE_INT_CST_HIGH (x) == 0
1250 || TREE_INT_CST_HIGH (x) == -1);
1253 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1254 are in a list pointed to by VALS. */
1257 build_vector (tree type, tree vals)
1259 tree v = make_node (VECTOR_CST);
1263 TREE_VECTOR_CST_ELTS (v) = vals;
1264 TREE_TYPE (v) = type;
1266 /* Iterate through elements and check for overflow. */
1267 for (link = vals; link; link = TREE_CHAIN (link))
1269 tree value = TREE_VALUE (link);
1271 /* Don't crash if we get an address constant. */
1272 if (!CONSTANT_CLASS_P (value))
1275 over |= TREE_OVERFLOW (value);
1278 TREE_OVERFLOW (v) = over;
1282 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1283 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1286 build_vector_from_ctor (tree type, VEC(constructor_elt,gc) *v)
1288 tree list = NULL_TREE;
1289 unsigned HOST_WIDE_INT idx;
1292 FOR_EACH_CONSTRUCTOR_VALUE (v, idx, value)
1293 list = tree_cons (NULL_TREE, value, list);
1294 return build_vector (type, nreverse (list));
1297 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1298 are in the VEC pointed to by VALS. */
1300 build_constructor (tree type, VEC(constructor_elt,gc) *vals)
1302 tree c = make_node (CONSTRUCTOR);
1303 TREE_TYPE (c) = type;
1304 CONSTRUCTOR_ELTS (c) = vals;
1308 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1311 build_constructor_single (tree type, tree index, tree value)
1313 VEC(constructor_elt,gc) *v;
1314 constructor_elt *elt;
1317 v = VEC_alloc (constructor_elt, gc, 1);
1318 elt = VEC_quick_push (constructor_elt, v, NULL);
1322 t = build_constructor (type, v);
1323 TREE_CONSTANT (t) = TREE_CONSTANT (value);
1328 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1329 are in a list pointed to by VALS. */
1331 build_constructor_from_list (tree type, tree vals)
1334 VEC(constructor_elt,gc) *v = NULL;
1335 bool constant_p = true;
1339 v = VEC_alloc (constructor_elt, gc, list_length (vals));
1340 for (t = vals; t; t = TREE_CHAIN (t))
1342 constructor_elt *elt = VEC_quick_push (constructor_elt, v, NULL);
1343 val = TREE_VALUE (t);
1344 elt->index = TREE_PURPOSE (t);
1346 if (!TREE_CONSTANT (val))
1351 t = build_constructor (type, v);
1352 TREE_CONSTANT (t) = constant_p;
1356 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1359 build_fixed (tree type, FIXED_VALUE_TYPE f)
1362 FIXED_VALUE_TYPE *fp;
1364 v = make_node (FIXED_CST);
1365 fp = GGC_NEW (FIXED_VALUE_TYPE);
1366 memcpy (fp, &f, sizeof (FIXED_VALUE_TYPE));
1368 TREE_TYPE (v) = type;
1369 TREE_FIXED_CST_PTR (v) = fp;
1373 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1376 build_real (tree type, REAL_VALUE_TYPE d)
1379 REAL_VALUE_TYPE *dp;
1382 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1383 Consider doing it via real_convert now. */
1385 v = make_node (REAL_CST);
1386 dp = GGC_NEW (REAL_VALUE_TYPE);
1387 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
1389 TREE_TYPE (v) = type;
1390 TREE_REAL_CST_PTR (v) = dp;
1391 TREE_OVERFLOW (v) = overflow;
1395 /* Return a new REAL_CST node whose type is TYPE
1396 and whose value is the integer value of the INTEGER_CST node I. */
1399 real_value_from_int_cst (const_tree type, const_tree i)
1403 /* Clear all bits of the real value type so that we can later do
1404 bitwise comparisons to see if two values are the same. */
1405 memset (&d, 0, sizeof d);
1407 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
1408 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
1409 TYPE_UNSIGNED (TREE_TYPE (i)));
1413 /* Given a tree representing an integer constant I, return a tree
1414 representing the same value as a floating-point constant of type TYPE. */
1417 build_real_from_int_cst (tree type, const_tree i)
1420 int overflow = TREE_OVERFLOW (i);
1422 v = build_real (type, real_value_from_int_cst (type, i));
1424 TREE_OVERFLOW (v) |= overflow;
1428 /* Return a newly constructed STRING_CST node whose value is
1429 the LEN characters at STR.
1430 The TREE_TYPE is not initialized. */
1433 build_string (int len, const char *str)
1438 /* Do not waste bytes provided by padding of struct tree_string. */
1439 length = len + offsetof (struct tree_string, str) + 1;
1441 #ifdef GATHER_STATISTICS
1442 tree_node_counts[(int) c_kind]++;
1443 tree_node_sizes[(int) c_kind] += length;
1446 s = ggc_alloc_tree (length);
1448 memset (s, 0, sizeof (struct tree_common));
1449 TREE_SET_CODE (s, STRING_CST);
1450 TREE_CONSTANT (s) = 1;
1451 TREE_STRING_LENGTH (s) = len;
1452 memcpy (s->string.str, str, len);
1453 s->string.str[len] = '\0';
1458 /* Return a newly constructed COMPLEX_CST node whose value is
1459 specified by the real and imaginary parts REAL and IMAG.
1460 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1461 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1464 build_complex (tree type, tree real, tree imag)
1466 tree t = make_node (COMPLEX_CST);
1468 TREE_REALPART (t) = real;
1469 TREE_IMAGPART (t) = imag;
1470 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
1471 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
1475 /* Return a constant of arithmetic type TYPE which is the
1476 multiplicative identity of the set TYPE. */
1479 build_one_cst (tree type)
1481 switch (TREE_CODE (type))
1483 case INTEGER_TYPE: case ENUMERAL_TYPE: case BOOLEAN_TYPE:
1484 case POINTER_TYPE: case REFERENCE_TYPE:
1486 return build_int_cst (type, 1);
1489 return build_real (type, dconst1);
1491 case FIXED_POINT_TYPE:
1492 /* We can only generate 1 for accum types. */
1493 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type)));
1494 return build_fixed (type, FCONST1(TYPE_MODE (type)));
1501 scalar = build_one_cst (TREE_TYPE (type));
1503 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1505 for (i = TYPE_VECTOR_SUBPARTS (type); --i >= 0; )
1506 cst = tree_cons (NULL_TREE, scalar, cst);
1508 return build_vector (type, cst);
1512 return build_complex (type,
1513 build_one_cst (TREE_TYPE (type)),
1514 fold_convert (TREE_TYPE (type), integer_zero_node));
1521 /* Build a BINFO with LEN language slots. */
1524 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
1527 size_t length = (offsetof (struct tree_binfo, base_binfos)
1528 + VEC_embedded_size (tree, base_binfos));
1530 #ifdef GATHER_STATISTICS
1531 tree_node_counts[(int) binfo_kind]++;
1532 tree_node_sizes[(int) binfo_kind] += length;
1535 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1537 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
1539 TREE_SET_CODE (t, TREE_BINFO);
1541 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
1547 /* Build a newly constructed TREE_VEC node of length LEN. */
1550 make_tree_vec_stat (int len MEM_STAT_DECL)
1553 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
1555 #ifdef GATHER_STATISTICS
1556 tree_node_counts[(int) vec_kind]++;
1557 tree_node_sizes[(int) vec_kind] += length;
1560 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
1562 memset (t, 0, length);
1564 TREE_SET_CODE (t, TREE_VEC);
1565 TREE_VEC_LENGTH (t) = len;
1570 /* Return 1 if EXPR is the integer constant zero or a complex constant
1574 integer_zerop (const_tree expr)
1578 return ((TREE_CODE (expr) == INTEGER_CST
1579 && TREE_INT_CST_LOW (expr) == 0
1580 && TREE_INT_CST_HIGH (expr) == 0)
1581 || (TREE_CODE (expr) == COMPLEX_CST
1582 && integer_zerop (TREE_REALPART (expr))
1583 && integer_zerop (TREE_IMAGPART (expr))));
1586 /* Return 1 if EXPR is the integer constant one or the corresponding
1587 complex constant. */
1590 integer_onep (const_tree expr)
1594 return ((TREE_CODE (expr) == INTEGER_CST
1595 && TREE_INT_CST_LOW (expr) == 1
1596 && TREE_INT_CST_HIGH (expr) == 0)
1597 || (TREE_CODE (expr) == COMPLEX_CST
1598 && integer_onep (TREE_REALPART (expr))
1599 && integer_zerop (TREE_IMAGPART (expr))));
1602 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1603 it contains. Likewise for the corresponding complex constant. */
1606 integer_all_onesp (const_tree expr)
1613 if (TREE_CODE (expr) == COMPLEX_CST
1614 && integer_all_onesp (TREE_REALPART (expr))
1615 && integer_zerop (TREE_IMAGPART (expr)))
1618 else if (TREE_CODE (expr) != INTEGER_CST)
1621 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
1622 if (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1623 && TREE_INT_CST_HIGH (expr) == -1)
1628 /* Note that using TYPE_PRECISION here is wrong. We care about the
1629 actual bits, not the (arbitrary) range of the type. */
1630 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
1631 if (prec >= HOST_BITS_PER_WIDE_INT)
1633 HOST_WIDE_INT high_value;
1636 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
1638 /* Can not handle precisions greater than twice the host int size. */
1639 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
1640 if (shift_amount == HOST_BITS_PER_WIDE_INT)
1641 /* Shifting by the host word size is undefined according to the ANSI
1642 standard, so we must handle this as a special case. */
1645 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
1647 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
1648 && TREE_INT_CST_HIGH (expr) == high_value);
1651 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
1654 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1658 integer_pow2p (const_tree expr)
1661 HOST_WIDE_INT high, low;
1665 if (TREE_CODE (expr) == COMPLEX_CST
1666 && integer_pow2p (TREE_REALPART (expr))
1667 && integer_zerop (TREE_IMAGPART (expr)))
1670 if (TREE_CODE (expr) != INTEGER_CST)
1673 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1674 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1675 high = TREE_INT_CST_HIGH (expr);
1676 low = TREE_INT_CST_LOW (expr);
1678 /* First clear all bits that are beyond the type's precision in case
1679 we've been sign extended. */
1681 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1683 else if (prec > HOST_BITS_PER_WIDE_INT)
1684 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1688 if (prec < HOST_BITS_PER_WIDE_INT)
1689 low &= ~((HOST_WIDE_INT) (-1) << prec);
1692 if (high == 0 && low == 0)
1695 return ((high == 0 && (low & (low - 1)) == 0)
1696 || (low == 0 && (high & (high - 1)) == 0));
1699 /* Return 1 if EXPR is an integer constant other than zero or a
1700 complex constant other than zero. */
1703 integer_nonzerop (const_tree expr)
1707 return ((TREE_CODE (expr) == INTEGER_CST
1708 && (TREE_INT_CST_LOW (expr) != 0
1709 || TREE_INT_CST_HIGH (expr) != 0))
1710 || (TREE_CODE (expr) == COMPLEX_CST
1711 && (integer_nonzerop (TREE_REALPART (expr))
1712 || integer_nonzerop (TREE_IMAGPART (expr)))));
1715 /* Return 1 if EXPR is the fixed-point constant zero. */
1718 fixed_zerop (const_tree expr)
1720 return (TREE_CODE (expr) == FIXED_CST
1721 && double_int_zero_p (TREE_FIXED_CST (expr).data));
1724 /* Return the power of two represented by a tree node known to be a
1728 tree_log2 (const_tree expr)
1731 HOST_WIDE_INT high, low;
1735 if (TREE_CODE (expr) == COMPLEX_CST)
1736 return tree_log2 (TREE_REALPART (expr));
1738 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1739 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1741 high = TREE_INT_CST_HIGH (expr);
1742 low = TREE_INT_CST_LOW (expr);
1744 /* First clear all bits that are beyond the type's precision in case
1745 we've been sign extended. */
1747 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
1749 else if (prec > HOST_BITS_PER_WIDE_INT)
1750 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1754 if (prec < HOST_BITS_PER_WIDE_INT)
1755 low &= ~((HOST_WIDE_INT) (-1) << prec);
1758 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
1759 : exact_log2 (low));
1762 /* Similar, but return the largest integer Y such that 2 ** Y is less
1763 than or equal to EXPR. */
1766 tree_floor_log2 (const_tree expr)
1769 HOST_WIDE_INT high, low;
1773 if (TREE_CODE (expr) == COMPLEX_CST)
1774 return tree_log2 (TREE_REALPART (expr));
1776 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
1777 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
1779 high = TREE_INT_CST_HIGH (expr);
1780 low = TREE_INT_CST_LOW (expr);
1782 /* First clear all bits that are beyond the type's precision in case
1783 we've been sign extended. Ignore if type's precision hasn't been set
1784 since what we are doing is setting it. */
1786 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
1788 else if (prec > HOST_BITS_PER_WIDE_INT)
1789 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
1793 if (prec < HOST_BITS_PER_WIDE_INT)
1794 low &= ~((HOST_WIDE_INT) (-1) << prec);
1797 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1798 : floor_log2 (low));
1801 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1802 decimal float constants, so don't return 1 for them. */
1805 real_zerop (const_tree expr)
1809 return ((TREE_CODE (expr) == REAL_CST
1810 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)
1811 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1812 || (TREE_CODE (expr) == COMPLEX_CST
1813 && real_zerop (TREE_REALPART (expr))
1814 && real_zerop (TREE_IMAGPART (expr))));
1817 /* Return 1 if EXPR is the real constant one in real or complex form.
1818 Trailing zeroes matter for decimal float constants, so don't return
1822 real_onep (const_tree expr)
1826 return ((TREE_CODE (expr) == REAL_CST
1827 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)
1828 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1829 || (TREE_CODE (expr) == COMPLEX_CST
1830 && real_onep (TREE_REALPART (expr))
1831 && real_zerop (TREE_IMAGPART (expr))));
1834 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1835 for decimal float constants, so don't return 1 for them. */
1838 real_twop (const_tree expr)
1842 return ((TREE_CODE (expr) == REAL_CST
1843 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)
1844 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1845 || (TREE_CODE (expr) == COMPLEX_CST
1846 && real_twop (TREE_REALPART (expr))
1847 && real_zerop (TREE_IMAGPART (expr))));
1850 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1851 matter for decimal float constants, so don't return 1 for them. */
1854 real_minus_onep (const_tree expr)
1858 return ((TREE_CODE (expr) == REAL_CST
1859 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)
1860 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr)))))
1861 || (TREE_CODE (expr) == COMPLEX_CST
1862 && real_minus_onep (TREE_REALPART (expr))
1863 && real_zerop (TREE_IMAGPART (expr))));
1866 /* Nonzero if EXP is a constant or a cast of a constant. */
1869 really_constant_p (const_tree exp)
1871 /* This is not quite the same as STRIP_NOPS. It does more. */
1872 while (CONVERT_EXPR_P (exp)
1873 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1874 exp = TREE_OPERAND (exp, 0);
1875 return TREE_CONSTANT (exp);
1878 /* Return first list element whose TREE_VALUE is ELEM.
1879 Return 0 if ELEM is not in LIST. */
1882 value_member (tree elem, tree list)
1886 if (elem == TREE_VALUE (list))
1888 list = TREE_CHAIN (list);
1893 /* Return first list element whose TREE_PURPOSE is ELEM.
1894 Return 0 if ELEM is not in LIST. */
1897 purpose_member (const_tree elem, tree list)
1901 if (elem == TREE_PURPOSE (list))
1903 list = TREE_CHAIN (list);
1908 /* Return nonzero if ELEM is part of the chain CHAIN. */
1911 chain_member (const_tree elem, const_tree chain)
1917 chain = TREE_CHAIN (chain);
1923 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1924 We expect a null pointer to mark the end of the chain.
1925 This is the Lisp primitive `length'. */
1928 list_length (const_tree t)
1931 #ifdef ENABLE_TREE_CHECKING
1939 #ifdef ENABLE_TREE_CHECKING
1942 gcc_assert (p != q);
1950 /* Returns the number of FIELD_DECLs in TYPE. */
1953 fields_length (const_tree type)
1955 tree t = TYPE_FIELDS (type);
1958 for (; t; t = TREE_CHAIN (t))
1959 if (TREE_CODE (t) == FIELD_DECL)
1965 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1966 by modifying the last node in chain 1 to point to chain 2.
1967 This is the Lisp primitive `nconc'. */
1970 chainon (tree op1, tree op2)
1979 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1981 TREE_CHAIN (t1) = op2;
1983 #ifdef ENABLE_TREE_CHECKING
1986 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1987 gcc_assert (t2 != t1);
1994 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1997 tree_last (tree chain)
2001 while ((next = TREE_CHAIN (chain)))
2006 /* Reverse the order of elements in the chain T,
2007 and return the new head of the chain (old last element). */
2012 tree prev = 0, decl, next;
2013 for (decl = t; decl; decl = next)
2015 next = TREE_CHAIN (decl);
2016 TREE_CHAIN (decl) = prev;
2022 /* Return a newly created TREE_LIST node whose
2023 purpose and value fields are PARM and VALUE. */
2026 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
2028 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
2029 TREE_PURPOSE (t) = parm;
2030 TREE_VALUE (t) = value;
2034 /* Build a chain of TREE_LIST nodes from a vector. */
2037 build_tree_list_vec_stat (const VEC(tree,gc) *vec MEM_STAT_DECL)
2039 tree ret = NULL_TREE;
2043 for (i = 0; VEC_iterate (tree, vec, i, t); ++i)
2045 *pp = build_tree_list_stat (NULL, t PASS_MEM_STAT);
2046 pp = &TREE_CHAIN (*pp);
2051 /* Return a newly created TREE_LIST node whose
2052 purpose and value fields are PURPOSE and VALUE
2053 and whose TREE_CHAIN is CHAIN. */
2056 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
2060 node = (tree) ggc_alloc_zone_pass_stat (sizeof (struct tree_list), &tree_zone);
2062 memset (node, 0, sizeof (struct tree_common));
2064 #ifdef GATHER_STATISTICS
2065 tree_node_counts[(int) x_kind]++;
2066 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
2069 TREE_SET_CODE (node, TREE_LIST);
2070 TREE_CHAIN (node) = chain;
2071 TREE_PURPOSE (node) = purpose;
2072 TREE_VALUE (node) = value;
2076 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2079 ctor_to_list (tree ctor)
2081 tree list = NULL_TREE;
2086 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), ix, purpose, val)
2088 *p = build_tree_list (purpose, val);
2089 p = &TREE_CHAIN (*p);
2095 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2099 ctor_to_vec (tree ctor)
2101 VEC(tree, gc) *vec = VEC_alloc (tree, gc, CONSTRUCTOR_NELTS (ctor));
2105 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor), ix, val)
2106 VEC_quick_push (tree, vec, val);
2111 /* Return the size nominally occupied by an object of type TYPE
2112 when it resides in memory. The value is measured in units of bytes,
2113 and its data type is that normally used for type sizes
2114 (which is the first type created by make_signed_type or
2115 make_unsigned_type). */
2118 size_in_bytes (const_tree type)
2122 if (type == error_mark_node)
2123 return integer_zero_node;
2125 type = TYPE_MAIN_VARIANT (type);
2126 t = TYPE_SIZE_UNIT (type);
2130 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
2131 return size_zero_node;
2137 /* Return the size of TYPE (in bytes) as a wide integer
2138 or return -1 if the size can vary or is larger than an integer. */
2141 int_size_in_bytes (const_tree type)
2145 if (type == error_mark_node)
2148 type = TYPE_MAIN_VARIANT (type);
2149 t = TYPE_SIZE_UNIT (type);
2151 || TREE_CODE (t) != INTEGER_CST
2152 || TREE_INT_CST_HIGH (t) != 0
2153 /* If the result would appear negative, it's too big to represent. */
2154 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
2157 return TREE_INT_CST_LOW (t);
2160 /* Return the maximum size of TYPE (in bytes) as a wide integer
2161 or return -1 if the size can vary or is larger than an integer. */
2164 max_int_size_in_bytes (const_tree type)
2166 HOST_WIDE_INT size = -1;
2169 /* If this is an array type, check for a possible MAX_SIZE attached. */
2171 if (TREE_CODE (type) == ARRAY_TYPE)
2173 size_tree = TYPE_ARRAY_MAX_SIZE (type);
2175 if (size_tree && host_integerp (size_tree, 1))
2176 size = tree_low_cst (size_tree, 1);
2179 /* If we still haven't been able to get a size, see if the language
2180 can compute a maximum size. */
2184 size_tree = lang_hooks.types.max_size (type);
2186 if (size_tree && host_integerp (size_tree, 1))
2187 size = tree_low_cst (size_tree, 1);
2193 /* Returns a tree for the size of EXP in bytes. */
2196 tree_expr_size (const_tree exp)
2199 && DECL_SIZE_UNIT (exp) != 0)
2200 return DECL_SIZE_UNIT (exp);
2202 return size_in_bytes (TREE_TYPE (exp));
2205 /* Return the bit position of FIELD, in bits from the start of the record.
2206 This is a tree of type bitsizetype. */
2209 bit_position (const_tree field)
2211 return bit_from_pos (DECL_FIELD_OFFSET (field),
2212 DECL_FIELD_BIT_OFFSET (field));
2215 /* Likewise, but return as an integer. It must be representable in
2216 that way (since it could be a signed value, we don't have the
2217 option of returning -1 like int_size_in_byte can. */
2220 int_bit_position (const_tree field)
2222 return tree_low_cst (bit_position (field), 0);
2225 /* Return the byte position of FIELD, in bytes from the start of the record.
2226 This is a tree of type sizetype. */
2229 byte_position (const_tree field)
2231 return byte_from_pos (DECL_FIELD_OFFSET (field),
2232 DECL_FIELD_BIT_OFFSET (field));
2235 /* Likewise, but return as an integer. It must be representable in
2236 that way (since it could be a signed value, we don't have the
2237 option of returning -1 like int_size_in_byte can. */
2240 int_byte_position (const_tree field)
2242 return tree_low_cst (byte_position (field), 0);
2245 /* Return the strictest alignment, in bits, that T is known to have. */
2248 expr_align (const_tree t)
2250 unsigned int align0, align1;
2252 switch (TREE_CODE (t))
2254 CASE_CONVERT: case NON_LVALUE_EXPR:
2255 /* If we have conversions, we know that the alignment of the
2256 object must meet each of the alignments of the types. */
2257 align0 = expr_align (TREE_OPERAND (t, 0));
2258 align1 = TYPE_ALIGN (TREE_TYPE (t));
2259 return MAX (align0, align1);
2261 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
2262 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
2263 case CLEANUP_POINT_EXPR:
2264 /* These don't change the alignment of an object. */
2265 return expr_align (TREE_OPERAND (t, 0));
2268 /* The best we can do is say that the alignment is the least aligned
2270 align0 = expr_align (TREE_OPERAND (t, 1));
2271 align1 = expr_align (TREE_OPERAND (t, 2));
2272 return MIN (align0, align1);
2274 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2275 meaningfully, it's always 1. */
2276 case LABEL_DECL: case CONST_DECL:
2277 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
2279 gcc_assert (DECL_ALIGN (t) != 0);
2280 return DECL_ALIGN (t);
2286 /* Otherwise take the alignment from that of the type. */
2287 return TYPE_ALIGN (TREE_TYPE (t));
2290 /* Return, as a tree node, the number of elements for TYPE (which is an
2291 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2294 array_type_nelts (const_tree type)
2296 tree index_type, min, max;
2298 /* If they did it with unspecified bounds, then we should have already
2299 given an error about it before we got here. */
2300 if (! TYPE_DOMAIN (type))
2301 return error_mark_node;
2303 index_type = TYPE_DOMAIN (type);
2304 min = TYPE_MIN_VALUE (index_type);
2305 max = TYPE_MAX_VALUE (index_type);
2307 return (integer_zerop (min)
2309 : fold_build2 (MINUS_EXPR, TREE_TYPE (max), max, min));
2312 /* If arg is static -- a reference to an object in static storage -- then
2313 return the object. This is not the same as the C meaning of `static'.
2314 If arg isn't static, return NULL. */
2319 switch (TREE_CODE (arg))
2322 /* Nested functions are static, even though taking their address will
2323 involve a trampoline as we unnest the nested function and create
2324 the trampoline on the tree level. */
2328 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2329 && ! DECL_THREAD_LOCAL_P (arg)
2330 && ! DECL_DLLIMPORT_P (arg)
2334 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
2338 return TREE_STATIC (arg) ? arg : NULL;
2345 /* If the thing being referenced is not a field, then it is
2346 something language specific. */
2347 gcc_assert (TREE_CODE (TREE_OPERAND (arg, 1)) == FIELD_DECL);
2349 /* If we are referencing a bitfield, we can't evaluate an
2350 ADDR_EXPR at compile time and so it isn't a constant. */
2351 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
2354 return staticp (TREE_OPERAND (arg, 0));
2359 case MISALIGNED_INDIRECT_REF:
2360 case ALIGN_INDIRECT_REF:
2362 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
2365 case ARRAY_RANGE_REF:
2366 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
2367 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
2368 return staticp (TREE_OPERAND (arg, 0));
2372 case COMPOUND_LITERAL_EXPR:
2373 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg)) ? arg : NULL;
2383 /* Return whether OP is a DECL whose address is function-invariant. */
2386 decl_address_invariant_p (const_tree op)
2388 /* The conditions below are slightly less strict than the one in
2391 switch (TREE_CODE (op))
2400 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2401 && !DECL_DLLIMPORT_P (op))
2402 || DECL_THREAD_LOCAL_P (op)
2403 || DECL_CONTEXT (op) == current_function_decl
2404 || decl_function_context (op) == current_function_decl)
2409 if ((TREE_STATIC (op) || DECL_EXTERNAL (op))
2410 || decl_function_context (op) == current_function_decl)
2421 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2424 decl_address_ip_invariant_p (const_tree op)
2426 /* The conditions below are slightly less strict than the one in
2429 switch (TREE_CODE (op))
2437 if (((TREE_STATIC (op) || DECL_EXTERNAL (op))
2438 && !DECL_DLLIMPORT_P (op))
2439 || DECL_THREAD_LOCAL_P (op))
2444 if ((TREE_STATIC (op) || DECL_EXTERNAL (op)))
2456 /* Return true if T is function-invariant (internal function, does
2457 not handle arithmetic; that's handled in skip_simple_arithmetic and
2458 tree_invariant_p). */
2460 static bool tree_invariant_p (tree t);
2463 tree_invariant_p_1 (tree t)
2467 if (TREE_CONSTANT (t)
2468 || (TREE_READONLY (t) && !TREE_SIDE_EFFECTS (t)))
2471 switch (TREE_CODE (t))
2477 op = TREE_OPERAND (t, 0);
2478 while (handled_component_p (op))
2480 switch (TREE_CODE (op))
2483 case ARRAY_RANGE_REF:
2484 if (!tree_invariant_p (TREE_OPERAND (op, 1))
2485 || TREE_OPERAND (op, 2) != NULL_TREE
2486 || TREE_OPERAND (op, 3) != NULL_TREE)
2491 if (TREE_OPERAND (op, 2) != NULL_TREE)
2497 op = TREE_OPERAND (op, 0);
2500 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2509 /* Return true if T is function-invariant. */
2512 tree_invariant_p (tree t)
2514 tree inner = skip_simple_arithmetic (t);
2515 return tree_invariant_p_1 (inner);
2518 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2519 Do this to any expression which may be used in more than one place,
2520 but must be evaluated only once.
2522 Normally, expand_expr would reevaluate the expression each time.
2523 Calling save_expr produces something that is evaluated and recorded
2524 the first time expand_expr is called on it. Subsequent calls to
2525 expand_expr just reuse the recorded value.
2527 The call to expand_expr that generates code that actually computes
2528 the value is the first call *at compile time*. Subsequent calls
2529 *at compile time* generate code to use the saved value.
2530 This produces correct result provided that *at run time* control
2531 always flows through the insns made by the first expand_expr
2532 before reaching the other places where the save_expr was evaluated.
2533 You, the caller of save_expr, must make sure this is so.
2535 Constants, and certain read-only nodes, are returned with no
2536 SAVE_EXPR because that is safe. Expressions containing placeholders
2537 are not touched; see tree.def for an explanation of what these
2541 save_expr (tree expr)
2543 tree t = fold (expr);
2546 /* If the tree evaluates to a constant, then we don't want to hide that
2547 fact (i.e. this allows further folding, and direct checks for constants).
2548 However, a read-only object that has side effects cannot be bypassed.
2549 Since it is no problem to reevaluate literals, we just return the
2551 inner = skip_simple_arithmetic (t);
2552 if (TREE_CODE (inner) == ERROR_MARK)
2555 if (tree_invariant_p_1 (inner))
2558 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2559 it means that the size or offset of some field of an object depends on
2560 the value within another field.
2562 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2563 and some variable since it would then need to be both evaluated once and
2564 evaluated more than once. Front-ends must assure this case cannot
2565 happen by surrounding any such subexpressions in their own SAVE_EXPR
2566 and forcing evaluation at the proper time. */
2567 if (contains_placeholder_p (inner))
2570 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
2571 SET_EXPR_LOCATION (t, EXPR_LOCATION (expr));
2573 /* This expression might be placed ahead of a jump to ensure that the
2574 value was computed on both sides of the jump. So make sure it isn't
2575 eliminated as dead. */
2576 TREE_SIDE_EFFECTS (t) = 1;
2580 /* Look inside EXPR and into any simple arithmetic operations. Return
2581 the innermost non-arithmetic node. */
2584 skip_simple_arithmetic (tree expr)
2588 /* We don't care about whether this can be used as an lvalue in this
2590 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
2591 expr = TREE_OPERAND (expr, 0);
2593 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2594 a constant, it will be more efficient to not make another SAVE_EXPR since
2595 it will allow better simplification and GCSE will be able to merge the
2596 computations if they actually occur. */
2600 if (UNARY_CLASS_P (inner))
2601 inner = TREE_OPERAND (inner, 0);
2602 else if (BINARY_CLASS_P (inner))
2604 if (tree_invariant_p (TREE_OPERAND (inner, 1)))
2605 inner = TREE_OPERAND (inner, 0);
2606 else if (tree_invariant_p (TREE_OPERAND (inner, 0)))
2607 inner = TREE_OPERAND (inner, 1);
2619 /* Return which tree structure is used by T. */
2621 enum tree_node_structure_enum
2622 tree_node_structure (const_tree t)
2624 const enum tree_code code = TREE_CODE (t);
2625 return tree_node_structure_for_code (code);
2628 /* Set various status flags when building a CALL_EXPR object T. */
2631 process_call_operands (tree t)
2633 bool side_effects = TREE_SIDE_EFFECTS (t);
2634 bool read_only = false;
2635 int i = call_expr_flags (t);
2637 /* Calls have side-effects, except those to const or pure functions. */
2638 if ((i & ECF_LOOPING_CONST_OR_PURE) || !(i & (ECF_CONST | ECF_PURE)))
2639 side_effects = true;
2640 /* Propagate TREE_READONLY of arguments for const functions. */
2644 if (!side_effects || read_only)
2645 for (i = 1; i < TREE_OPERAND_LENGTH (t); i++)
2647 tree op = TREE_OPERAND (t, i);
2648 if (op && TREE_SIDE_EFFECTS (op))
2649 side_effects = true;
2650 if (op && !TREE_READONLY (op) && !CONSTANT_CLASS_P (op))
2654 TREE_SIDE_EFFECTS (t) = side_effects;
2655 TREE_READONLY (t) = read_only;
2658 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2659 or offset that depends on a field within a record. */
2662 contains_placeholder_p (const_tree exp)
2664 enum tree_code code;
2669 code = TREE_CODE (exp);
2670 if (code == PLACEHOLDER_EXPR)
2673 switch (TREE_CODE_CLASS (code))
2676 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2677 position computations since they will be converted into a
2678 WITH_RECORD_EXPR involving the reference, which will assume
2679 here will be valid. */
2680 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2682 case tcc_exceptional:
2683 if (code == TREE_LIST)
2684 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
2685 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
2690 case tcc_comparison:
2691 case tcc_expression:
2695 /* Ignoring the first operand isn't quite right, but works best. */
2696 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
2699 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2700 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
2701 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
2704 /* The save_expr function never wraps anything containing
2705 a PLACEHOLDER_EXPR. */
2712 switch (TREE_CODE_LENGTH (code))
2715 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
2717 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
2718 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
2729 const_call_expr_arg_iterator iter;
2730 FOR_EACH_CONST_CALL_EXPR_ARG (arg, iter, exp)
2731 if (CONTAINS_PLACEHOLDER_P (arg))
2745 /* Return true if any part of the computation of TYPE involves a
2746 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2747 (for QUAL_UNION_TYPE) and field positions. */
2750 type_contains_placeholder_1 (const_tree type)
2752 /* If the size contains a placeholder or the parent type (component type in
2753 the case of arrays) type involves a placeholder, this type does. */
2754 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
2755 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
2756 || (TREE_TYPE (type) != 0
2757 && type_contains_placeholder_p (TREE_TYPE (type))))
2760 /* Now do type-specific checks. Note that the last part of the check above
2761 greatly limits what we have to do below. */
2762 switch (TREE_CODE (type))
2770 case REFERENCE_TYPE:
2778 case FIXED_POINT_TYPE:
2779 /* Here we just check the bounds. */
2780 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
2781 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
2784 /* We're already checked the component type (TREE_TYPE), so just check
2786 return type_contains_placeholder_p (TYPE_DOMAIN (type));
2790 case QUAL_UNION_TYPE:
2794 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
2795 if (TREE_CODE (field) == FIELD_DECL
2796 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
2797 || (TREE_CODE (type) == QUAL_UNION_TYPE
2798 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
2799 || type_contains_placeholder_p (TREE_TYPE (field))))
2811 type_contains_placeholder_p (tree type)
2815 /* If the contains_placeholder_bits field has been initialized,
2816 then we know the answer. */
2817 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0)
2818 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1;
2820 /* Indicate that we've seen this type node, and the answer is false.
2821 This is what we want to return if we run into recursion via fields. */
2822 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1;
2824 /* Compute the real value. */
2825 result = type_contains_placeholder_1 (type);
2827 /* Store the real value. */
2828 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1;
2833 /* Push tree EXP onto vector QUEUE if it is not already present. */
2836 push_without_duplicates (tree exp, VEC (tree, heap) **queue)
2841 for (i = 0; VEC_iterate (tree, *queue, i, iter); i++)
2842 if (simple_cst_equal (iter, exp) == 1)
2846 VEC_safe_push (tree, heap, *queue, exp);
2849 /* Given a tree EXP, find all occurences of references to fields
2850 in a PLACEHOLDER_EXPR and place them in vector REFS without
2851 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2852 we assume here that EXP contains only arithmetic expressions
2853 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2857 find_placeholder_in_expr (tree exp, VEC (tree, heap) **refs)
2859 enum tree_code code = TREE_CODE (exp);
2863 /* We handle TREE_LIST and COMPONENT_REF separately. */
2864 if (code == TREE_LIST)
2866 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), refs);
2867 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), refs);
2869 else if (code == COMPONENT_REF)
2871 for (inner = TREE_OPERAND (exp, 0);
2872 REFERENCE_CLASS_P (inner);
2873 inner = TREE_OPERAND (inner, 0))
2876 if (TREE_CODE (inner) == PLACEHOLDER_EXPR)
2877 push_without_duplicates (exp, refs);
2879 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), refs);
2882 switch (TREE_CODE_CLASS (code))
2887 case tcc_declaration:
2888 /* Variables allocated to static storage can stay. */
2889 if (!TREE_STATIC (exp))
2890 push_without_duplicates (exp, refs);
2893 case tcc_expression:
2894 /* This is the pattern built in ada/make_aligning_type. */
2895 if (code == ADDR_EXPR
2896 && TREE_CODE (TREE_OPERAND (exp, 0)) == PLACEHOLDER_EXPR)
2898 push_without_duplicates (exp, refs);
2902 /* Fall through... */
2904 case tcc_exceptional:
2907 case tcc_comparison:
2909 for (i = 0; i < TREE_CODE_LENGTH (code); i++)
2910 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2914 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
2915 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, i), refs);
2923 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2924 return a tree with all occurrences of references to F in a
2925 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2926 CONST_DECLs. Note that we assume here that EXP contains only
2927 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2928 occurring only in their argument list. */
2931 substitute_in_expr (tree exp, tree f, tree r)
2933 enum tree_code code = TREE_CODE (exp);
2934 tree op0, op1, op2, op3;
2937 /* We handle TREE_LIST and COMPONENT_REF separately. */
2938 if (code == TREE_LIST)
2940 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
2941 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
2942 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2945 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2947 else if (code == COMPONENT_REF)
2951 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2952 and it is the right field, replace it with R. */
2953 for (inner = TREE_OPERAND (exp, 0);
2954 REFERENCE_CLASS_P (inner);
2955 inner = TREE_OPERAND (inner, 0))
2959 op1 = TREE_OPERAND (exp, 1);
2961 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && op1 == f)
2964 /* If this expression hasn't been completed let, leave it alone. */
2965 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && !TREE_TYPE (inner))
2968 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
2969 if (op0 == TREE_OPERAND (exp, 0))
2973 = fold_build3 (COMPONENT_REF, TREE_TYPE (exp), op0, op1, NULL_TREE);
2976 switch (TREE_CODE_CLASS (code))
2981 case tcc_declaration:
2987 case tcc_expression:
2991 /* Fall through... */
2993 case tcc_exceptional:
2996 case tcc_comparison:
2998 switch (TREE_CODE_LENGTH (code))
3004 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3005 if (op0 == TREE_OPERAND (exp, 0))
3008 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3012 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3013 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3015 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3018 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3022 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3023 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3024 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3026 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3027 && op2 == TREE_OPERAND (exp, 2))
3030 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3034 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
3035 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
3036 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
3037 op3 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 3), f, r);
3039 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3040 && op2 == TREE_OPERAND (exp, 2)
3041 && op3 == TREE_OPERAND (exp, 3))
3045 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3057 new_tree = NULL_TREE;
3059 /* If we are trying to replace F with a constant, inline back
3060 functions which do nothing else than computing a value from
3061 the arguments they are passed. This makes it possible to
3062 fold partially or entirely the replacement expression. */
3063 if (CONSTANT_CLASS_P (r) && code == CALL_EXPR)
3065 tree t = maybe_inline_call_in_expr (exp);
3067 return SUBSTITUTE_IN_EXPR (t, f, r);
3070 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3072 tree op = TREE_OPERAND (exp, i);
3073 tree new_op = SUBSTITUTE_IN_EXPR (op, f, r);
3077 new_tree = copy_node (exp);
3078 TREE_OPERAND (new_tree, i) = new_op;
3084 new_tree = fold (new_tree);
3085 if (TREE_CODE (new_tree) == CALL_EXPR)
3086 process_call_operands (new_tree);
3097 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3101 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3102 for it within OBJ, a tree that is an object or a chain of references. */
3105 substitute_placeholder_in_expr (tree exp, tree obj)
3107 enum tree_code code = TREE_CODE (exp);
3108 tree op0, op1, op2, op3;
3111 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3112 in the chain of OBJ. */
3113 if (code == PLACEHOLDER_EXPR)
3115 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
3118 for (elt = obj; elt != 0;
3119 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3120 || TREE_CODE (elt) == COND_EXPR)
3121 ? TREE_OPERAND (elt, 1)
3122 : (REFERENCE_CLASS_P (elt)
3123 || UNARY_CLASS_P (elt)
3124 || BINARY_CLASS_P (elt)
3125 || VL_EXP_CLASS_P (elt)
3126 || EXPRESSION_CLASS_P (elt))
3127 ? TREE_OPERAND (elt, 0) : 0))
3128 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
3131 for (elt = obj; elt != 0;
3132 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
3133 || TREE_CODE (elt) == COND_EXPR)
3134 ? TREE_OPERAND (elt, 1)
3135 : (REFERENCE_CLASS_P (elt)
3136 || UNARY_CLASS_P (elt)
3137 || BINARY_CLASS_P (elt)
3138 || VL_EXP_CLASS_P (elt)
3139 || EXPRESSION_CLASS_P (elt))
3140 ? TREE_OPERAND (elt, 0) : 0))
3141 if (POINTER_TYPE_P (TREE_TYPE (elt))
3142 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
3144 return fold_build1 (INDIRECT_REF, need_type, elt);
3146 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3147 survives until RTL generation, there will be an error. */
3151 /* TREE_LIST is special because we need to look at TREE_VALUE
3152 and TREE_CHAIN, not TREE_OPERANDS. */
3153 else if (code == TREE_LIST)
3155 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
3156 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
3157 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
3160 return tree_cons (TREE_PURPOSE (exp), op1, op0);
3163 switch (TREE_CODE_CLASS (code))
3166 case tcc_declaration:
3169 case tcc_exceptional:
3172 case tcc_comparison:
3173 case tcc_expression:
3176 switch (TREE_CODE_LENGTH (code))
3182 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3183 if (op0 == TREE_OPERAND (exp, 0))
3186 new_tree = fold_build1 (code, TREE_TYPE (exp), op0);
3190 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3191 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3193 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
3196 new_tree = fold_build2 (code, TREE_TYPE (exp), op0, op1);
3200 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3201 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3202 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3204 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3205 && op2 == TREE_OPERAND (exp, 2))
3208 new_tree = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2);
3212 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
3213 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
3214 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
3215 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
3217 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
3218 && op2 == TREE_OPERAND (exp, 2)
3219 && op3 == TREE_OPERAND (exp, 3))
3223 = fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
3235 new_tree = NULL_TREE;
3237 for (i = 1; i < TREE_OPERAND_LENGTH (exp); i++)
3239 tree op = TREE_OPERAND (exp, i);
3240 tree new_op = SUBSTITUTE_PLACEHOLDER_IN_EXPR (op, obj);
3244 new_tree = copy_node (exp);
3245 TREE_OPERAND (new_tree, i) = new_op;
3251 new_tree = fold (new_tree);
3252 if (TREE_CODE (new_tree) == CALL_EXPR)
3253 process_call_operands (new_tree);
3264 TREE_READONLY (new_tree) |= TREE_READONLY (exp);
3268 /* Stabilize a reference so that we can use it any number of times
3269 without causing its operands to be evaluated more than once.
3270 Returns the stabilized reference. This works by means of save_expr,
3271 so see the caveats in the comments about save_expr.
3273 Also allows conversion expressions whose operands are references.
3274 Any other kind of expression is returned unchanged. */
3277 stabilize_reference (tree ref)
3280 enum tree_code code = TREE_CODE (ref);
3287 /* No action is needed in this case. */
3292 case FIX_TRUNC_EXPR:
3293 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
3297 result = build_nt (INDIRECT_REF,
3298 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
3302 result = build_nt (COMPONENT_REF,
3303 stabilize_reference (TREE_OPERAND (ref, 0)),
3304 TREE_OPERAND (ref, 1), NULL_TREE);
3308 result = build_nt (BIT_FIELD_REF,
3309 stabilize_reference (TREE_OPERAND (ref, 0)),
3310 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3311 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
3315 result = build_nt (ARRAY_REF,
3316 stabilize_reference (TREE_OPERAND (ref, 0)),
3317 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3318 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3321 case ARRAY_RANGE_REF:
3322 result = build_nt (ARRAY_RANGE_REF,
3323 stabilize_reference (TREE_OPERAND (ref, 0)),
3324 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
3325 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
3329 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3330 it wouldn't be ignored. This matters when dealing with
3332 return stabilize_reference_1 (ref);
3334 /* If arg isn't a kind of lvalue we recognize, make no change.
3335 Caller should recognize the error for an invalid lvalue. */
3340 return error_mark_node;
3343 TREE_TYPE (result) = TREE_TYPE (ref);
3344 TREE_READONLY (result) = TREE_READONLY (ref);
3345 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
3346 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
3351 /* Subroutine of stabilize_reference; this is called for subtrees of
3352 references. Any expression with side-effects must be put in a SAVE_EXPR
3353 to ensure that it is only evaluated once.
3355 We don't put SAVE_EXPR nodes around everything, because assigning very
3356 simple expressions to temporaries causes us to miss good opportunities
3357 for optimizations. Among other things, the opportunity to fold in the
3358 addition of a constant into an addressing mode often gets lost, e.g.
3359 "y[i+1] += x;". In general, we take the approach that we should not make
3360 an assignment unless we are forced into it - i.e., that any non-side effect
3361 operator should be allowed, and that cse should take care of coalescing
3362 multiple utterances of the same expression should that prove fruitful. */
3365 stabilize_reference_1 (tree e)
3368 enum tree_code code = TREE_CODE (e);
3370 /* We cannot ignore const expressions because it might be a reference
3371 to a const array but whose index contains side-effects. But we can
3372 ignore things that are actual constant or that already have been
3373 handled by this function. */
3375 if (tree_invariant_p (e))
3378 switch (TREE_CODE_CLASS (code))
3380 case tcc_exceptional:
3382 case tcc_declaration:
3383 case tcc_comparison:
3385 case tcc_expression:
3388 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3389 so that it will only be evaluated once. */
3390 /* The reference (r) and comparison (<) classes could be handled as
3391 below, but it is generally faster to only evaluate them once. */
3392 if (TREE_SIDE_EFFECTS (e))
3393 return save_expr (e);
3397 /* Constants need no processing. In fact, we should never reach
3402 /* Division is slow and tends to be compiled with jumps,
3403 especially the division by powers of 2 that is often
3404 found inside of an array reference. So do it just once. */
3405 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
3406 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
3407 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
3408 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
3409 return save_expr (e);
3410 /* Recursively stabilize each operand. */
3411 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
3412 stabilize_reference_1 (TREE_OPERAND (e, 1)));
3416 /* Recursively stabilize each operand. */
3417 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
3424 TREE_TYPE (result) = TREE_TYPE (e);
3425 TREE_READONLY (result) = TREE_READONLY (e);
3426 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
3427 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
3432 /* Low-level constructors for expressions. */
3434 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3435 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3438 recompute_tree_invariant_for_addr_expr (tree t)
3441 bool tc = true, se = false;
3443 /* We started out assuming this address is both invariant and constant, but
3444 does not have side effects. Now go down any handled components and see if
3445 any of them involve offsets that are either non-constant or non-invariant.
3446 Also check for side-effects.
3448 ??? Note that this code makes no attempt to deal with the case where
3449 taking the address of something causes a copy due to misalignment. */
3451 #define UPDATE_FLAGS(NODE) \
3452 do { tree _node = (NODE); \
3453 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3454 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3456 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
3457 node = TREE_OPERAND (node, 0))
3459 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3460 array reference (probably made temporarily by the G++ front end),
3461 so ignore all the operands. */
3462 if ((TREE_CODE (node) == ARRAY_REF
3463 || TREE_CODE (node) == ARRAY_RANGE_REF)
3464 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
3466 UPDATE_FLAGS (TREE_OPERAND (node, 1));
3467 if (TREE_OPERAND (node, 2))
3468 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3469 if (TREE_OPERAND (node, 3))
3470 UPDATE_FLAGS (TREE_OPERAND (node, 3));
3472 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3473 FIELD_DECL, apparently. The G++ front end can put something else
3474 there, at least temporarily. */
3475 else if (TREE_CODE (node) == COMPONENT_REF
3476 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
3478 if (TREE_OPERAND (node, 2))
3479 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3481 else if (TREE_CODE (node) == BIT_FIELD_REF)
3482 UPDATE_FLAGS (TREE_OPERAND (node, 2));
3485 node = lang_hooks.expr_to_decl (node, &tc, &se);
3487 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3488 the address, since &(*a)->b is a form of addition. If it's a constant, the
3489 address is constant too. If it's a decl, its address is constant if the
3490 decl is static. Everything else is not constant and, furthermore,
3491 taking the address of a volatile variable is not volatile. */
3492 if (TREE_CODE (node) == INDIRECT_REF)
3493 UPDATE_FLAGS (TREE_OPERAND (node, 0));
3494 else if (CONSTANT_CLASS_P (node))
3496 else if (DECL_P (node))
3497 tc &= (staticp (node) != NULL_TREE);
3501 se |= TREE_SIDE_EFFECTS (node);
3505 TREE_CONSTANT (t) = tc;
3506 TREE_SIDE_EFFECTS (t) = se;
3510 /* Build an expression of code CODE, data type TYPE, and operands as
3511 specified. Expressions and reference nodes can be created this way.
3512 Constants, decls, types and misc nodes cannot be.
3514 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3515 enough for all extant tree codes. */
3518 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
3522 gcc_assert (TREE_CODE_LENGTH (code) == 0);
3524 t = make_node_stat (code PASS_MEM_STAT);
3531 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
3533 int length = sizeof (struct tree_exp);
3534 #ifdef GATHER_STATISTICS
3535 tree_node_kind kind;
3539 #ifdef GATHER_STATISTICS
3540 switch (TREE_CODE_CLASS (code))
3542 case tcc_statement: /* an expression with side effects */
3545 case tcc_reference: /* a reference */
3553 tree_node_counts[(int) kind]++;
3554 tree_node_sizes[(int) kind] += length;
3557 gcc_assert (TREE_CODE_LENGTH (code) == 1);
3559 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
3561 memset (t, 0, sizeof (struct tree_common));
3563 TREE_SET_CODE (t, code);
3565 TREE_TYPE (t) = type;
3566 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
3567 TREE_OPERAND (t, 0) = node;
3568 TREE_BLOCK (t) = NULL_TREE;
3569 if (node && !TYPE_P (node))
3571 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
3572 TREE_READONLY (t) = TREE_READONLY (node);
3575 if (TREE_CODE_CLASS (code) == tcc_statement)
3576 TREE_SIDE_EFFECTS (t) = 1;
3580 /* All of these have side-effects, no matter what their
3582 TREE_SIDE_EFFECTS (t) = 1;
3583 TREE_READONLY (t) = 0;
3586 case MISALIGNED_INDIRECT_REF:
3587 case ALIGN_INDIRECT_REF:
3589 /* Whether a dereference is readonly has nothing to do with whether
3590 its operand is readonly. */
3591 TREE_READONLY (t) = 0;
3596 recompute_tree_invariant_for_addr_expr (t);
3600 if ((TREE_CODE_CLASS (code) == tcc_unary || code == VIEW_CONVERT_EXPR)
3601 && node && !TYPE_P (node)
3602 && TREE_CONSTANT (node))
3603 TREE_CONSTANT (t) = 1;
3604 if (TREE_CODE_CLASS (code) == tcc_reference
3605 && node && TREE_THIS_VOLATILE (node))
3606 TREE_THIS_VOLATILE (t) = 1;
3613 #define PROCESS_ARG(N) \
3615 TREE_OPERAND (t, N) = arg##N; \
3616 if (arg##N &&!TYPE_P (arg##N)) \
3618 if (TREE_SIDE_EFFECTS (arg##N)) \
3620 if (!TREE_READONLY (arg##N) \
3621 && !CONSTANT_CLASS_P (arg##N)) \
3623 if (!TREE_CONSTANT (arg##N)) \
3629 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
3631 bool constant, read_only, side_effects;
3634 gcc_assert (TREE_CODE_LENGTH (code) == 2);
3636 if ((code == MINUS_EXPR || code == PLUS_EXPR || code == MULT_EXPR)
3637 && arg0 && arg1 && tt && POINTER_TYPE_P (tt)
3638 /* When sizetype precision doesn't match that of pointers
3639 we need to be able to build explicit extensions or truncations
3640 of the offset argument. */
3641 && TYPE_PRECISION (sizetype) == TYPE_PRECISION (tt))
3642 gcc_assert (TREE_CODE (arg0) == INTEGER_CST
3643 && TREE_CODE (arg1) == INTEGER_CST);
3645 if (code == POINTER_PLUS_EXPR && arg0 && arg1 && tt)
3646 gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
3647 && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
3648 && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)));
3650 t = make_node_stat (code PASS_MEM_STAT);
3653 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3654 result based on those same flags for the arguments. But if the
3655 arguments aren't really even `tree' expressions, we shouldn't be trying
3658 /* Expressions without side effects may be constant if their
3659 arguments are as well. */
3660 constant = (TREE_CODE_CLASS (code) == tcc_comparison
3661 || TREE_CODE_CLASS (code) == tcc_binary);
3663 side_effects = TREE_SIDE_EFFECTS (t);
3668 TREE_READONLY (t) = read_only;
3669 TREE_CONSTANT (t) = constant;
3670 TREE_SIDE_EFFECTS (t) = side_effects;
3671 TREE_THIS_VOLATILE (t)
3672 = (TREE_CODE_CLASS (code) == tcc_reference
3673 && arg0 && TREE_THIS_VOLATILE (arg0));
3680 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3681 tree arg2 MEM_STAT_DECL)
3683 bool constant, read_only, side_effects;
3686 gcc_assert (TREE_CODE_LENGTH (code) == 3);
3687 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3689 t = make_node_stat (code PASS_MEM_STAT);
3694 /* As a special exception, if COND_EXPR has NULL branches, we
3695 assume that it is a gimple statement and always consider
3696 it to have side effects. */
3697 if (code == COND_EXPR
3698 && tt == void_type_node
3699 && arg1 == NULL_TREE
3700 && arg2 == NULL_TREE)
3701 side_effects = true;
3703 side_effects = TREE_SIDE_EFFECTS (t);
3709 if (code == COND_EXPR)
3710 TREE_READONLY (t) = read_only;
3712 TREE_SIDE_EFFECTS (t) = side_effects;
3713 TREE_THIS_VOLATILE (t)
3714 = (TREE_CODE_CLASS (code) == tcc_reference
3715 && arg0 && TREE_THIS_VOLATILE (arg0));
3721 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3722 tree arg2, tree arg3 MEM_STAT_DECL)
3724 bool constant, read_only, side_effects;
3727 gcc_assert (TREE_CODE_LENGTH (code) == 4);
3729 t = make_node_stat (code PASS_MEM_STAT);
3732 side_effects = TREE_SIDE_EFFECTS (t);
3739 TREE_SIDE_EFFECTS (t) = side_effects;
3740 TREE_THIS_VOLATILE (t)
3741 = (TREE_CODE_CLASS (code) == tcc_reference
3742 && arg0 && TREE_THIS_VOLATILE (arg0));
3748 build5_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3749 tree arg2, tree arg3, tree arg4 MEM_STAT_DECL)
3751 bool constant, read_only, side_effects;
3754 gcc_assert (TREE_CODE_LENGTH (code) == 5);
3756 t = make_node_stat (code PASS_MEM_STAT);
3759 side_effects = TREE_SIDE_EFFECTS (t);
3767 TREE_SIDE_EFFECTS (t) = side_effects;
3768 TREE_THIS_VOLATILE (t)
3769 = (TREE_CODE_CLASS (code) == tcc_reference
3770 && arg0 && TREE_THIS_VOLATILE (arg0));
3776 build6_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
3777 tree arg2, tree arg3, tree arg4, tree arg5 MEM_STAT_DECL)
3779 bool constant, read_only, side_effects;
3782 gcc_assert (code == TARGET_MEM_REF);
3784 t = make_node_stat (code PASS_MEM_STAT);
3787 side_effects = TREE_SIDE_EFFECTS (t);
3796 TREE_SIDE_EFFECTS (t) = side_effects;
3797 TREE_THIS_VOLATILE (t) = 0;
3802 /* Similar except don't specify the TREE_TYPE
3803 and leave the TREE_SIDE_EFFECTS as 0.
3804 It is permissible for arguments to be null,
3805 or even garbage if their values do not matter. */
3808 build_nt (enum tree_code code, ...)
3815 gcc_assert (TREE_CODE_CLASS (code) != tcc_vl_exp);
3819 t = make_node (code);
3820 length = TREE_CODE_LENGTH (code);
3822 for (i = 0; i < length; i++)
3823 TREE_OPERAND (t, i) = va_arg (p, tree);
3829 /* Similar to build_nt, but for creating a CALL_EXPR object with
3830 ARGLIST passed as a list. */
3833 build_nt_call_list (tree fn, tree arglist)
3838 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
3839 CALL_EXPR_FN (t) = fn;
3840 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
3841 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
3842 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
3846 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3850 build_nt_call_vec (tree fn, VEC(tree,gc) *args)
3855 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
3856 CALL_EXPR_FN (ret) = fn;
3857 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
3858 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
3859 CALL_EXPR_ARG (ret, ix) = t;
3863 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3864 We do NOT enter this node in any sort of symbol table.
3866 LOC is the location of the decl.
3868 layout_decl is used to set up the decl's storage layout.
3869 Other slots are initialized to 0 or null pointers. */
3872 build_decl_stat (location_t loc, enum tree_code code, tree name,
3873 tree type MEM_STAT_DECL)
3877 t = make_node_stat (code PASS_MEM_STAT);
3878 DECL_SOURCE_LOCATION (t) = loc;
3880 /* if (type == error_mark_node)
3881 type = integer_type_node; */
3882 /* That is not done, deliberately, so that having error_mark_node
3883 as the type can suppress useless errors in the use of this variable. */
3885 DECL_NAME (t) = name;
3886 TREE_TYPE (t) = type;
3888 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
3894 /* Builds and returns function declaration with NAME and TYPE. */
3897 build_fn_decl (const char *name, tree type)
3899 tree id = get_identifier (name);
3900 tree decl = build_decl (input_location, FUNCTION_DECL, id, type);
3902 DECL_EXTERNAL (decl) = 1;
3903 TREE_PUBLIC (decl) = 1;
3904 DECL_ARTIFICIAL (decl) = 1;
3905 TREE_NOTHROW (decl) = 1;
3911 /* BLOCK nodes are used to represent the structure of binding contours
3912 and declarations, once those contours have been exited and their contents
3913 compiled. This information is used for outputting debugging info. */
3916 build_block (tree vars, tree subblocks, tree supercontext, tree chain)
3918 tree block = make_node (BLOCK);
3920 BLOCK_VARS (block) = vars;
3921 BLOCK_SUBBLOCKS (block) = subblocks;
3922 BLOCK_SUPERCONTEXT (block) = supercontext;
3923 BLOCK_CHAIN (block) = chain;
3928 expand_location (source_location loc)
3930 expanded_location xloc;
3940 const struct line_map *map = linemap_lookup (line_table, loc);
3941 xloc.file = map->to_file;
3942 xloc.line = SOURCE_LINE (map, loc);
3943 xloc.column = SOURCE_COLUMN (map, loc);
3944 xloc.sysp = map->sysp != 0;
3950 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3952 LOC is the location to use in tree T. */
3955 protected_set_expr_location (tree t, location_t loc)
3957 if (t && CAN_HAVE_LOCATION_P (t))
3958 SET_EXPR_LOCATION (t, loc);
3961 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3965 build_decl_attribute_variant (tree ddecl, tree attribute)
3967 DECL_ATTRIBUTES (ddecl) = attribute;
3971 /* Borrowed from hashtab.c iterative_hash implementation. */
3972 #define mix(a,b,c) \
3974 a -= b; a -= c; a ^= (c>>13); \
3975 b -= c; b -= a; b ^= (a<< 8); \
3976 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3977 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3978 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3979 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3980 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3981 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3982 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3986 /* Produce good hash value combining VAL and VAL2. */
3988 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
3990 /* the golden ratio; an arbitrary value. */
3991 hashval_t a = 0x9e3779b9;
3997 /* Produce good hash value combining VAL and VAL2. */
3999 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
4001 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
4002 return iterative_hash_hashval_t (val, val2);
4005 hashval_t a = (hashval_t) val;
4006 /* Avoid warnings about shifting of more than the width of the type on
4007 hosts that won't execute this path. */
4009 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
4011 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
4013 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
4014 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
4021 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4022 is ATTRIBUTE and its qualifiers are QUALS.
4024 Record such modified types already made so we don't make duplicates. */
4027 build_type_attribute_qual_variant (tree ttype, tree attribute, int quals)
4029 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
4031 hashval_t hashcode = 0;
4033 enum tree_code code = TREE_CODE (ttype);
4035 /* Building a distinct copy of a tagged type is inappropriate; it
4036 causes breakage in code that expects there to be a one-to-one
4037 relationship between a struct and its fields.
4038 build_duplicate_type is another solution (as used in
4039 handle_transparent_union_attribute), but that doesn't play well
4040 with the stronger C++ type identity model. */
4041 if (TREE_CODE (ttype) == RECORD_TYPE
4042 || TREE_CODE (ttype) == UNION_TYPE
4043 || TREE_CODE (ttype) == QUAL_UNION_TYPE
4044 || TREE_CODE (ttype) == ENUMERAL_TYPE)
4046 warning (OPT_Wattributes,
4047 "ignoring attributes applied to %qT after definition",
4048 TYPE_MAIN_VARIANT (ttype));
4049 return build_qualified_type (ttype, quals);
4052 ttype = build_qualified_type (ttype, TYPE_UNQUALIFIED);
4053 ntype = build_distinct_type_copy (ttype);
4055 TYPE_ATTRIBUTES (ntype) = attribute;
4057 hashcode = iterative_hash_object (code, hashcode);
4058 if (TREE_TYPE (ntype))
4059 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
4061 hashcode = attribute_hash_list (attribute, hashcode);
4063 switch (TREE_CODE (ntype))
4066 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
4069 if (TYPE_DOMAIN (ntype))
4070 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
4074 hashcode = iterative_hash_object
4075 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
4076 hashcode = iterative_hash_object
4077 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
4080 case FIXED_POINT_TYPE:
4082 unsigned int precision = TYPE_PRECISION (ntype);
4083 hashcode = iterative_hash_object (precision, hashcode);
4090 ntype = type_hash_canon (hashcode, ntype);
4092 /* If the target-dependent attributes make NTYPE different from
4093 its canonical type, we will need to use structural equality
4094 checks for this type. */
4095 if (TYPE_STRUCTURAL_EQUALITY_P (ttype)
4096 || !targetm.comp_type_attributes (ntype, ttype))
4097 SET_TYPE_STRUCTURAL_EQUALITY (ntype);
4098 else if (TYPE_CANONICAL (ntype) == ntype)
4099 TYPE_CANONICAL (ntype) = TYPE_CANONICAL (ttype);
4101 ttype = build_qualified_type (ntype, quals);
4103 else if (TYPE_QUALS (ttype) != quals)
4104 ttype = build_qualified_type (ttype, quals);
4110 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4113 Record such modified types already made so we don't make duplicates. */
4116 build_type_attribute_variant (tree ttype, tree attribute)
4118 return build_type_attribute_qual_variant (ttype, attribute,
4119 TYPE_QUALS (ttype));
4122 /* Reset all language specific information still present in TYPE. */
4125 free_lang_data_in_type (tree type)
4127 gcc_assert (TYPE_P (type));
4129 /* Fill in the alias-set. We need to at least track zeroness here
4131 if (lang_hooks.get_alias_set (type) == 0)
4132 TYPE_ALIAS_SET (type) = 0;
4134 /* Give the FE a chance to remove its own data first. */
4135 lang_hooks.free_lang_data (type);
4137 TREE_LANG_FLAG_0 (type) = 0;
4138 TREE_LANG_FLAG_1 (type) = 0;
4139 TREE_LANG_FLAG_2 (type) = 0;
4140 TREE_LANG_FLAG_3 (type) = 0;
4141 TREE_LANG_FLAG_4 (type) = 0;
4142 TREE_LANG_FLAG_5 (type) = 0;
4143 TREE_LANG_FLAG_6 (type) = 0;
4145 if (TREE_CODE (type) == FUNCTION_TYPE)
4147 /* Remove the const and volatile qualifiers from arguments. The
4148 C++ front end removes them, but the C front end does not,
4149 leading to false ODR violation errors when merging two
4150 instances of the same function signature compiled by
4151 different front ends. */
4154 for (p = TYPE_ARG_TYPES (type); p; p = TREE_CHAIN (p))
4156 tree arg_type = TREE_VALUE (p);
4158 if (TYPE_READONLY (arg_type) || TYPE_VOLATILE (arg_type))
4160 int quals = TYPE_QUALS (arg_type)
4162 & ~TYPE_QUAL_VOLATILE;
4163 TREE_VALUE (p) = build_qualified_type (arg_type, quals);
4164 free_lang_data_in_type (TREE_VALUE (p));
4169 /* Remove members that are not actually FIELD_DECLs from the field
4170 list of an aggregate. These occur in C++. */
4171 if (TREE_CODE (type) == RECORD_TYPE
4172 || TREE_CODE (type) == UNION_TYPE
4173 || TREE_CODE (type) == QUAL_UNION_TYPE)
4177 /* Note that TYPE_FIELDS can be shared across distinct
4178 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4179 to be removed, we cannot set its TREE_CHAIN to NULL.
4180 Otherwise, we would not be able to find all the other fields
4181 in the other instances of this TREE_TYPE.
4183 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4185 member = TYPE_FIELDS (type);
4188 if (TREE_CODE (member) == FIELD_DECL)
4191 TREE_CHAIN (prev) = member;
4193 TYPE_FIELDS (type) = member;
4197 member = TREE_CHAIN (member);
4201 TREE_CHAIN (prev) = NULL_TREE;
4203 TYPE_FIELDS (type) = NULL_TREE;
4205 TYPE_METHODS (type) = NULL_TREE;
4206 if (TYPE_BINFO (type))
4208 tree binfo = TYPE_BINFO (type);
4210 if (BINFO_VIRTUALS (binfo))
4212 /* If the virtual function table for BINFO contains
4213 entries, these may be useful for folding OBJ_TYPE_REF
4214 expressions (see gimple_fold_obj_type_ref). In that
4215 case, we only clear the unused fields in the BINFO
4217 BINFO_OFFSET (binfo) = NULL_TREE;
4218 BINFO_VTABLE (binfo) = NULL_TREE;
4219 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4220 BINFO_BASE_ACCESSES (binfo) = NULL;
4221 BINFO_INHERITANCE_CHAIN (binfo) = NULL_TREE;
4222 BINFO_SUBVTT_INDEX (binfo) = NULL_TREE;
4223 BINFO_VPTR_FIELD (binfo) = NULL_TREE;
4227 /* Otherwise, get rid of the whole binfo data. */
4228 TYPE_BINFO (type) = NULL_TREE;
4234 /* For non-aggregate types, clear out the language slot (which
4235 overloads TYPE_BINFO). */
4236 TYPE_LANG_SLOT_1 (type) = NULL_TREE;
4239 TYPE_CONTEXT (type) = NULL_TREE;
4240 TYPE_STUB_DECL (type) = NULL_TREE;
4244 /* Return true if DECL may need an assembler name to be set. */
4247 need_assembler_name_p (tree decl)
4249 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4250 if (TREE_CODE (decl) != FUNCTION_DECL
4251 && TREE_CODE (decl) != VAR_DECL)
4254 /* If DECL already has its assembler name set, it does not need a
4256 if (!HAS_DECL_ASSEMBLER_NAME_P (decl)
4257 || DECL_ASSEMBLER_NAME_SET_P (decl))
4260 /* For VAR_DECLs, only static, public and external symbols need an
4262 if (TREE_CODE (decl) == VAR_DECL
4263 && !TREE_STATIC (decl)
4264 && !TREE_PUBLIC (decl)
4265 && !DECL_EXTERNAL (decl))
4268 /* Do not set assembler name on builtins. Allow RTL expansion to
4269 decide whether to expand inline or via a regular call. */
4270 if (TREE_CODE (decl) == FUNCTION_DECL
4271 && DECL_BUILT_IN (decl)
4272 && DECL_BUILT_IN_CLASS (decl) != BUILT_IN_FRONTEND)
4275 /* For FUNCTION_DECLs, only used functions and functions
4276 represented in the callgraph need an assembler name. */
4277 if (TREE_CODE (decl) == FUNCTION_DECL
4278 && cgraph_node_for_decl (decl) == NULL
4279 && !TREE_USED (decl))
4286 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4287 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4288 in BLOCK that is not in LOCALS is removed. */
4291 free_lang_data_in_block (tree fn, tree block, struct pointer_set_t *locals)
4295 tp = &BLOCK_VARS (block);
4298 if (!pointer_set_contains (locals, *tp))
4299 *tp = TREE_CHAIN (*tp);
4301 tp = &TREE_CHAIN (*tp);
4304 for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t))
4305 free_lang_data_in_block (fn, t, locals);
4309 /* Reset all language specific information still present in symbol
4313 free_lang_data_in_decl (tree decl)
4315 gcc_assert (DECL_P (decl));
4317 /* Give the FE a chance to remove its own data first. */
4318 lang_hooks.free_lang_data (decl);
4320 TREE_LANG_FLAG_0 (decl) = 0;
4321 TREE_LANG_FLAG_1 (decl) = 0;
4322 TREE_LANG_FLAG_2 (decl) = 0;
4323 TREE_LANG_FLAG_3 (decl) = 0;
4324 TREE_LANG_FLAG_4 (decl) = 0;
4325 TREE_LANG_FLAG_5 (decl) = 0;
4326 TREE_LANG_FLAG_6 (decl) = 0;
4328 /* Identifiers need not have a type. */
4329 if (DECL_NAME (decl))
4330 TREE_TYPE (DECL_NAME (decl)) = NULL_TREE;
4332 if (TREE_CODE (decl) == CONST_DECL)
4333 DECL_CONTEXT (decl) = NULL_TREE;
4335 /* Ignore any intervening types, because we are going to clear their
4336 TYPE_CONTEXT fields. */
4337 if (TREE_CODE (decl) != FIELD_DECL)
4338 DECL_CONTEXT (decl) = decl_function_context (decl);
4340 if (DECL_CONTEXT (decl)
4341 && TREE_CODE (DECL_CONTEXT (decl)) == NAMESPACE_DECL)
4342 DECL_CONTEXT (decl) = NULL_TREE;
4344 if (TREE_CODE (decl) == VAR_DECL)
4346 tree context = DECL_CONTEXT (decl);
4350 enum tree_code code = TREE_CODE (context);
4351 if (code == FUNCTION_DECL && DECL_ABSTRACT (context))
4353 /* Do not clear the decl context here, that will promote
4354 all vars to global ones. */
4355 DECL_INITIAL (decl) = NULL_TREE;
4358 if (TREE_STATIC (decl))
4359 DECL_CONTEXT (decl) = NULL_TREE;
4363 if (TREE_CODE (decl) == PARM_DECL
4364 || TREE_CODE (decl) == FIELD_DECL
4365 || TREE_CODE (decl) == RESULT_DECL)
4367 tree unit_size = DECL_SIZE_UNIT (decl);
4368 tree size = DECL_SIZE (decl);
4369 if ((unit_size && TREE_CODE (unit_size) != INTEGER_CST)
4370 || (size && TREE_CODE (size) != INTEGER_CST))
4372 DECL_SIZE_UNIT (decl) = NULL_TREE;
4373 DECL_SIZE (decl) = NULL_TREE;
4376 if (TREE_CODE (decl) == FIELD_DECL
4377 && DECL_FIELD_OFFSET (decl)
4378 && TREE_CODE (DECL_FIELD_OFFSET (decl)) != INTEGER_CST)
4379 DECL_FIELD_OFFSET (decl) = NULL_TREE;
4381 else if (TREE_CODE (decl) == FUNCTION_DECL)
4383 if (gimple_has_body_p (decl))
4386 struct pointer_set_t *locals;
4388 /* If DECL has a gimple body, then the context for its
4389 arguments must be DECL. Otherwise, it doesn't really
4390 matter, as we will not be emitting any code for DECL. In
4391 general, there may be other instances of DECL created by
4392 the front end and since PARM_DECLs are generally shared,
4393 their DECL_CONTEXT changes as the replicas of DECL are
4394 created. The only time where DECL_CONTEXT is important
4395 is for the FUNCTION_DECLs that have a gimple body (since
4396 the PARM_DECL will be used in the function's body). */
4397 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
4398 DECL_CONTEXT (t) = decl;
4400 /* Collect all the symbols declared in DECL. */
4401 locals = pointer_set_create ();
4402 t = DECL_STRUCT_FUNCTION (decl)->local_decls;
4403 for (; t; t = TREE_CHAIN (t))
4405 pointer_set_insert (locals, TREE_VALUE (t));
4407 /* All the local symbols should have DECL as their
4409 DECL_CONTEXT (TREE_VALUE (t)) = decl;
4412 /* Get rid of any decl not in local_decls. */
4413 free_lang_data_in_block (decl, DECL_INITIAL (decl), locals);
4415 pointer_set_destroy (locals);
4418 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4419 At this point, it is not needed anymore. */
4420 DECL_SAVED_TREE (decl) = NULL_TREE;
4422 else if (TREE_CODE (decl) == VAR_DECL)
4424 tree expr = DECL_DEBUG_EXPR (decl);
4426 && TREE_CODE (expr) == VAR_DECL
4427 && !TREE_STATIC (expr) && !DECL_EXTERNAL (expr))
4428 SET_DECL_DEBUG_EXPR (decl, NULL_TREE);
4430 if (DECL_EXTERNAL (decl))
4431 DECL_INITIAL (decl) = NULL_TREE;
4433 else if (TREE_CODE (decl) == TYPE_DECL)
4435 DECL_INITIAL (decl) = NULL_TREE;
4437 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4438 FIELD_DECLs, which should be preserved. Otherwise,
4439 we shouldn't be concerned with source-level lexical
4440 nesting beyond this point. */
4441 DECL_CONTEXT (decl) = NULL_TREE;
4446 /* Data used when collecting DECLs and TYPEs for language data removal. */
4448 struct free_lang_data_d
4450 /* Set of traversed objects. Used to avoid duplicate visits. */
4451 struct pointer_set_t *pset;
4453 /* Array of symbols to process with free_lang_data_in_decl. */
4454 VEC(tree,heap) *decls;
4456 /* Array of types to process with free_lang_data_in_type. */
4457 VEC(tree,heap) *types;
4461 /* Save all language fields needed to generate proper debug information
4462 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4465 save_debug_info_for_decl (tree t)
4467 /*struct saved_debug_info_d *sdi;*/
4469 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && DECL_P (t));
4471 /* FIXME. Partial implementation for saving debug info removed. */
4475 /* Save all language fields needed to generate proper debug information
4476 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4479 save_debug_info_for_type (tree t)
4481 /*struct saved_debug_info_d *sdi;*/
4483 gcc_assert (debug_info_level > DINFO_LEVEL_TERSE && t && TYPE_P (t));
4485 /* FIXME. Partial implementation for saving debug info removed. */
4489 /* Add type or decl T to one of the list of tree nodes that need their
4490 language data removed. The lists are held inside FLD. */
4493 add_tree_to_fld_list (tree t, struct free_lang_data_d *fld)
4497 VEC_safe_push (tree, heap, fld->decls, t);
4498 if (debug_info_level > DINFO_LEVEL_TERSE)
4499 save_debug_info_for_decl (t);
4501 else if (TYPE_P (t))
4503 VEC_safe_push (tree, heap, fld->types, t);
4504 if (debug_info_level > DINFO_LEVEL_TERSE)
4505 save_debug_info_for_type (t);
4512 /* Operand callback helper for free_lang_data_in_node. *TP is the
4513 subtree operand being considered. */
4516 find_decls_types_r (tree *tp, int *ws ATTRIBUTE_UNUSED, void *data)
4519 struct free_lang_data_d *fld = (struct free_lang_data_d *) data;
4523 /* Note that walk_tree does not traverse every possible field in
4524 decls, so we have to do our own traversals here. */
4525 add_tree_to_fld_list (t, fld);
4527 walk_tree (&DECL_NAME (t), find_decls_types_r, fld, fld->pset);
4528 walk_tree (&DECL_CONTEXT (t), find_decls_types_r, fld, fld->pset);
4529 walk_tree (&DECL_SIZE (t), find_decls_types_r, fld, fld->pset);
4530 walk_tree (&DECL_SIZE_UNIT (t), find_decls_types_r, fld, fld->pset);
4531 walk_tree (&DECL_INITIAL (t), find_decls_types_r, fld, fld->pset);
4532 walk_tree (&DECL_ATTRIBUTES (t), find_decls_types_r, fld, fld->pset);
4533 walk_tree (&DECL_ABSTRACT_ORIGIN (t), find_decls_types_r, fld, fld->pset);
4535 if (TREE_CODE (t) == FUNCTION_DECL)
4537 walk_tree (&DECL_ARGUMENTS (t), find_decls_types_r, fld, fld->pset);
4538 walk_tree (&DECL_RESULT (t), find_decls_types_r, fld, fld->pset);
4540 else if (TREE_CODE (t) == TYPE_DECL)
4542 walk_tree (&DECL_ARGUMENT_FLD (t), find_decls_types_r, fld,
4544 walk_tree (&DECL_VINDEX (t), find_decls_types_r, fld, fld->pset);
4546 else if (TREE_CODE (t) == FIELD_DECL)
4548 walk_tree (&DECL_FIELD_OFFSET (t), find_decls_types_r, fld,
4550 walk_tree (&DECL_BIT_FIELD_TYPE (t), find_decls_types_r, fld,
4552 walk_tree (&DECL_QUALIFIER (t), find_decls_types_r, fld, fld->pset);
4553 walk_tree (&DECL_FIELD_BIT_OFFSET (t), find_decls_types_r, fld,
4555 walk_tree (&DECL_FCONTEXT (t), find_decls_types_r, fld, fld->pset);
4557 else if (TREE_CODE (t) == VAR_DECL)
4559 walk_tree (&DECL_SECTION_NAME (t), find_decls_types_r, fld,
4561 walk_tree (&DECL_COMDAT_GROUP (t), find_decls_types_r, fld,
4565 else if (TYPE_P (t))
4567 /* Note that walk_tree does not traverse every possible field in
4568 types, so we have to do our own traversals here. */
4569 add_tree_to_fld_list (t, fld);
4571 walk_tree (&TYPE_CACHED_VALUES (t), find_decls_types_r, fld, fld->pset);
4572 walk_tree (&TYPE_SIZE (t), find_decls_types_r, fld, fld->pset);
4573 walk_tree (&TYPE_SIZE_UNIT (t), find_decls_types_r, fld, fld->pset);
4574 walk_tree (&TYPE_ATTRIBUTES (t), find_decls_types_r, fld, fld->pset);
4575 walk_tree (&TYPE_POINTER_TO (t), find_decls_types_r, fld, fld->pset);
4576 walk_tree (&TYPE_REFERENCE_TO (t), find_decls_types_r, fld, fld->pset);
4577 walk_tree (&TYPE_NAME (t), find_decls_types_r, fld, fld->pset);
4578 walk_tree (&TYPE_MINVAL (t), find_decls_types_r, fld, fld->pset);
4579 walk_tree (&TYPE_MAXVAL (t), find_decls_types_r, fld, fld->pset);
4580 walk_tree (&TYPE_NEXT_VARIANT (t), find_decls_types_r, fld, fld->pset);
4581 walk_tree (&TYPE_MAIN_VARIANT (t), find_decls_types_r, fld, fld->pset);
4582 walk_tree (&TYPE_CONTEXT (t), find_decls_types_r, fld, fld->pset);
4583 walk_tree (&TYPE_CANONICAL (t), find_decls_types_r, fld, fld->pset);
4587 walk_tree (&TREE_TYPE (t), find_decls_types_r, fld, fld->pset);
4589 /* Do not recurse into TREE_CHAIN to avoid blowing up the stack. */
4590 for (tp = &TREE_CHAIN (t); *tp; tp = &TREE_CHAIN (*tp))
4592 tree saved_chain = TREE_CHAIN (*tp);
4593 TREE_CHAIN (*tp) = NULL_TREE;
4594 walk_tree (tp, find_decls_types_r, fld, fld->pset);
4595 TREE_CHAIN (*tp) = saved_chain;
4602 /* Translate all the types in LIST with the corresponding runtime
4606 get_eh_types_for_runtime (tree list)
4610 if (list == NULL_TREE)
4613 head = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4615 list = TREE_CHAIN (list);
4618 tree n = build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list)));
4619 TREE_CHAIN (prev) = n;
4620 prev = TREE_CHAIN (prev);
4621 list = TREE_CHAIN (list);
4628 /* Find decls and types referenced in EH region R and store them in
4629 FLD->DECLS and FLD->TYPES. */
4632 find_decls_types_in_eh_region (eh_region r, struct free_lang_data_d *fld)
4637 /* The types referenced in R must first be changed to the EH types
4638 used at runtime. This removes references to FE types in the
4640 if (r->type == ERT_CATCH)
4642 tree list = r->u.eh_catch.type_list;
4643 r->u.eh_catch.type_list = get_eh_types_for_runtime (list);
4644 walk_tree (&r->u.eh_catch.type_list, find_decls_types_r, fld, fld->pset);
4646 else if (r->type == ERT_ALLOWED_EXCEPTIONS)
4648 tree list = r->u.allowed.type_list;
4649 r->u.allowed.type_list = get_eh_types_for_runtime (list);
4650 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
4655 /* Find decls and types referenced in cgraph node N and store them in
4656 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4657 look for *every* kind of DECL and TYPE node reachable from N,
4658 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4659 NAMESPACE_DECLs, etc). */
4662 find_decls_types_in_node (struct cgraph_node *n, struct free_lang_data_d *fld)
4665 struct function *fn;
4668 walk_tree (&n->decl, find_decls_types_r, fld, fld->pset);
4670 if (!gimple_has_body_p (n->decl))
4673 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
4675 fn = DECL_STRUCT_FUNCTION (n->decl);
4677 /* Traverse locals. */
4678 for (t = fn->local_decls; t; t = TREE_CHAIN (t))
4680 tree *tp = &TREE_VALUE (t);
4681 tree saved_chain = TREE_CHAIN (*tp);
4682 TREE_CHAIN (*tp) = NULL_TREE;
4683 walk_tree (tp, find_decls_types_r, fld, fld->pset);
4684 TREE_CHAIN (*tp) = saved_chain;
4687 /* Traverse EH regions in FN. */
4688 if (fn->eh->region_array)
4693 for (i = 0; VEC_iterate (eh_region, fn->eh->region_array, i, r); i++)
4694 find_decls_types_in_eh_region (r, fld);
4697 /* Traverse every statement in FN. */
4698 FOR_EACH_BB_FN (bb, fn)
4700 gimple_stmt_iterator si;
4703 for (si = gsi_start_phis (bb); !gsi_end_p (si); gsi_next (&si))
4705 gimple phi = gsi_stmt (si);
4707 for (i = 0; i < gimple_phi_num_args (phi); i++)
4709 tree *arg_p = gimple_phi_arg_def_ptr (phi, i);
4710 walk_tree (arg_p, find_decls_types_r, fld, fld->pset);
4714 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
4716 gimple stmt = gsi_stmt (si);
4718 for (i = 0; i < gimple_num_ops (stmt); i++)
4720 tree *arg_p = gimple_op_ptr (stmt, i);
4721 walk_tree (arg_p, find_decls_types_r, fld, fld->pset);
4728 /* Find decls and types referenced in varpool node N and store them in
4729 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4730 look for *every* kind of DECL and TYPE node reachable from N,
4731 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4732 NAMESPACE_DECLs, etc). */
4735 find_decls_types_in_var (struct varpool_node *v, struct free_lang_data_d *fld)
4737 walk_tree (&v->decl, find_decls_types_r, fld, fld->pset);
4741 /* Free language specific information for every operand and expression
4742 in every node of the call graph. This process operates in three stages:
4744 1- Every callgraph node and varpool node is traversed looking for
4745 decls and types embedded in them. This is a more exhaustive
4746 search than that done by find_referenced_vars, because it will
4747 also collect individual fields, decls embedded in types, etc.
4749 2- All the decls found are sent to free_lang_data_in_decl.
4751 3- All the types found are sent to free_lang_data_in_type.
4753 The ordering between decls and types is important because
4754 free_lang_data_in_decl sets assembler names, which includes
4755 mangling. So types cannot be freed up until assembler names have
4759 free_lang_data_in_cgraph (void)
4761 struct cgraph_node *n;
4762 struct varpool_node *v;
4763 struct free_lang_data_d fld;
4768 /* Initialize sets and arrays to store referenced decls and types. */
4769 fld.pset = pointer_set_create ();
4770 fld.decls = VEC_alloc (tree, heap, 100);
4771 fld.types = VEC_alloc (tree, heap, 100);
4773 /* Find decls and types in the body of every function in the callgraph. */
4774 for (n = cgraph_nodes; n; n = n->next)
4775 find_decls_types_in_node (n, &fld);
4777 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
4778 walk_tree (&p->decl, find_decls_types_r, &fld, fld.pset);
4780 /* Find decls and types in every varpool symbol. */
4781 for (v = varpool_nodes_queue; v; v = v->next_needed)
4782 find_decls_types_in_var (v, &fld);
4784 /* Set the assembler name on every decl found. We need to do this
4785 now because free_lang_data_in_decl will invalidate data needed
4786 for mangling. This breaks mangling on interdependent decls. */
4787 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4788 if (need_assembler_name_p (t))
4790 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4791 diagnostics that use input_location to show locus
4792 information. The problem here is that, at this point,
4793 input_location is generally anchored to the end of the file
4794 (since the parser is long gone), so we don't have a good
4795 position to pin it to.
4797 To alleviate this problem, this uses the location of T's
4798 declaration. Examples of this are
4799 testsuite/g++.dg/template/cond2.C and
4800 testsuite/g++.dg/template/pr35240.C. */
4801 location_t saved_location = input_location;
4802 input_location = DECL_SOURCE_LOCATION (t);
4804 decl_assembler_name (t);
4806 input_location = saved_location;
4809 /* Traverse every decl found freeing its language data. */
4810 for (i = 0; VEC_iterate (tree, fld.decls, i, t); i++)
4811 free_lang_data_in_decl (t);
4813 /* Traverse every type found freeing its language data. */
4814 for (i = 0; VEC_iterate (tree, fld.types, i, t); i++)
4815 free_lang_data_in_type (t);
4817 pointer_set_destroy (fld.pset);
4818 VEC_free (tree, heap, fld.decls);
4819 VEC_free (tree, heap, fld.types);
4823 /* Free resources that are used by FE but are not needed once they are done. */
4826 free_lang_data (void)
4828 /* Traverse the IL resetting language specific information for
4829 operands, expressions, etc. */
4830 free_lang_data_in_cgraph ();
4832 /* Create gimple variants for common types. */
4833 ptrdiff_type_node = integer_type_node;
4834 fileptr_type_node = ptr_type_node;
4835 if (TREE_CODE (boolean_type_node) != BOOLEAN_TYPE
4836 || (TYPE_MODE (boolean_type_node)
4837 != mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0))
4838 || TYPE_PRECISION (boolean_type_node) != 1
4839 || !TYPE_UNSIGNED (boolean_type_node))
4841 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4842 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4843 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
4844 TYPE_PRECISION (boolean_type_node) = 1;
4845 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4846 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4849 /* Unify char_type_node with its properly signed variant. */
4850 if (TYPE_UNSIGNED (char_type_node))
4851 unsigned_char_type_node = char_type_node;
4853 signed_char_type_node = char_type_node;
4855 /* Reset some langhooks. */
4856 lang_hooks.callgraph.analyze_expr = NULL;
4857 lang_hooks.types_compatible_p = NULL;
4858 lang_hooks.dwarf_name = lhd_dwarf_name;
4859 lang_hooks.decl_printable_name = gimple_decl_printable_name;
4860 lang_hooks.set_decl_assembler_name = lhd_set_decl_assembler_name;
4861 lang_hooks.fold_obj_type_ref = gimple_fold_obj_type_ref;
4863 /* Reset diagnostic machinery. */
4864 diagnostic_starter (global_dc) = default_diagnostic_starter;
4865 diagnostic_finalizer (global_dc) = default_diagnostic_finalizer;
4866 diagnostic_format_decoder (global_dc) = default_tree_printer;
4872 /* Gate function for free_lang_data. */
4875 gate_free_lang_data (void)
4877 /* FIXME. Remove after save_debug_info is working. */
4878 return !flag_gtoggle && debug_info_level <= DINFO_LEVEL_TERSE;
4882 struct simple_ipa_opt_pass pass_ipa_free_lang_data =
4887 gate_free_lang_data, /* gate */
4888 free_lang_data, /* execute */
4891 0, /* static_pass_number */
4892 TV_IPA_FREE_LANG_DATA, /* tv_id */
4893 0, /* properties_required */
4894 0, /* properties_provided */
4895 0, /* properties_destroyed */
4896 0, /* todo_flags_start */
4897 TODO_ggc_collect /* todo_flags_finish */
4901 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4904 We try both `text' and `__text__', ATTR may be either one. */
4905 /* ??? It might be a reasonable simplification to require ATTR to be only
4906 `text'. One might then also require attribute lists to be stored in
4907 their canonicalized form. */
4910 is_attribute_with_length_p (const char *attr, int attr_len, const_tree ident)
4915 if (TREE_CODE (ident) != IDENTIFIER_NODE)
4918 p = IDENTIFIER_POINTER (ident);
4919 ident_len = IDENTIFIER_LENGTH (ident);
4921 if (ident_len == attr_len
4922 && strcmp (attr, p) == 0)
4925 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
4928 gcc_assert (attr[1] == '_');
4929 gcc_assert (attr[attr_len - 2] == '_');
4930 gcc_assert (attr[attr_len - 1] == '_');
4931 if (ident_len == attr_len - 4
4932 && strncmp (attr + 2, p, attr_len - 4) == 0)
4937 if (ident_len == attr_len + 4
4938 && p[0] == '_' && p[1] == '_'
4939 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
4940 && strncmp (attr, p + 2, attr_len) == 0)
4947 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4950 We try both `text' and `__text__', ATTR may be either one. */
4953 is_attribute_p (const char *attr, const_tree ident)
4955 return is_attribute_with_length_p (attr, strlen (attr), ident);
4958 /* Given an attribute name and a list of attributes, return a pointer to the
4959 attribute's list element if the attribute is part of the list, or NULL_TREE
4960 if not found. If the attribute appears more than once, this only
4961 returns the first occurrence; the TREE_CHAIN of the return value should
4962 be passed back in if further occurrences are wanted. */
4965 lookup_attribute (const char *attr_name, tree list)
4968 size_t attr_len = strlen (attr_name);
4970 for (l = list; l; l = TREE_CHAIN (l))
4972 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
4973 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
4979 /* Remove any instances of attribute ATTR_NAME in LIST and return the
4983 remove_attribute (const char *attr_name, tree list)
4986 size_t attr_len = strlen (attr_name);
4988 for (p = &list; *p; )
4991 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
4992 if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l)))
4993 *p = TREE_CHAIN (l);
4995 p = &TREE_CHAIN (l);
5001 /* Return an attribute list that is the union of a1 and a2. */
5004 merge_attributes (tree a1, tree a2)
5008 /* Either one unset? Take the set one. */
5010 if ((attributes = a1) == 0)
5013 /* One that completely contains the other? Take it. */
5015 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
5017 if (attribute_list_contained (a2, a1))
5021 /* Pick the longest list, and hang on the other list. */
5023 if (list_length (a1) < list_length (a2))
5024 attributes = a2, a2 = a1;
5026 for (; a2 != 0; a2 = TREE_CHAIN (a2))
5029 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5032 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
5035 if (TREE_VALUE (a) != NULL
5036 && TREE_CODE (TREE_VALUE (a)) == TREE_LIST
5037 && TREE_VALUE (a2) != NULL
5038 && TREE_CODE (TREE_VALUE (a2)) == TREE_LIST)
5040 if (simple_cst_list_equal (TREE_VALUE (a),
5041 TREE_VALUE (a2)) == 1)
5044 else if (simple_cst_equal (TREE_VALUE (a),
5045 TREE_VALUE (a2)) == 1)
5050 a1 = copy_node (a2);
5051 TREE_CHAIN (a1) = attributes;
5060 /* Given types T1 and T2, merge their attributes and return
5064 merge_type_attributes (tree t1, tree t2)
5066 return merge_attributes (TYPE_ATTRIBUTES (t1),
5067 TYPE_ATTRIBUTES (t2));
5070 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5074 merge_decl_attributes (tree olddecl, tree newdecl)
5076 return merge_attributes (DECL_ATTRIBUTES (olddecl),
5077 DECL_ATTRIBUTES (newdecl));
5080 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5082 /* Specialization of merge_decl_attributes for various Windows targets.
5084 This handles the following situation:
5086 __declspec (dllimport) int foo;
5089 The second instance of `foo' nullifies the dllimport. */
5092 merge_dllimport_decl_attributes (tree old, tree new_tree)
5095 int delete_dllimport_p = 1;
5097 /* What we need to do here is remove from `old' dllimport if it doesn't
5098 appear in `new'. dllimport behaves like extern: if a declaration is
5099 marked dllimport and a definition appears later, then the object
5100 is not dllimport'd. We also remove a `new' dllimport if the old list
5101 contains dllexport: dllexport always overrides dllimport, regardless
5102 of the order of declaration. */
5103 if (!VAR_OR_FUNCTION_DECL_P (new_tree))
5104 delete_dllimport_p = 0;
5105 else if (DECL_DLLIMPORT_P (new_tree)
5106 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old)))
5108 DECL_DLLIMPORT_P (new_tree) = 0;
5109 warning (OPT_Wattributes, "%q+D already declared with dllexport attribute: "
5110 "dllimport ignored", new_tree);
5112 else if (DECL_DLLIMPORT_P (old) && !DECL_DLLIMPORT_P (new_tree))
5114 /* Warn about overriding a symbol that has already been used, e.g.:
5115 extern int __attribute__ ((dllimport)) foo;
5116 int* bar () {return &foo;}
5119 if (TREE_USED (old))
5121 warning (0, "%q+D redeclared without dllimport attribute "
5122 "after being referenced with dll linkage", new_tree);
5123 /* If we have used a variable's address with dllimport linkage,
5124 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5125 decl may already have had TREE_CONSTANT computed.
5126 We still remove the attribute so that assembler code refers
5127 to '&foo rather than '_imp__foo'. */
5128 if (TREE_CODE (old) == VAR_DECL && TREE_ADDRESSABLE (old))
5129 DECL_DLLIMPORT_P (new_tree) = 1;
5132 /* Let an inline definition silently override the external reference,
5133 but otherwise warn about attribute inconsistency. */
5134 else if (TREE_CODE (new_tree) == VAR_DECL
5135 || !DECL_DECLARED_INLINE_P (new_tree))
5136 warning (OPT_Wattributes, "%q+D redeclared without dllimport attribute: "
5137 "previous dllimport ignored", new_tree);
5140 delete_dllimport_p = 0;
5142 a = merge_attributes (DECL_ATTRIBUTES (old), DECL_ATTRIBUTES (new_tree));
5144 if (delete_dllimport_p)
5147 const size_t attr_len = strlen ("dllimport");
5149 /* Scan the list for dllimport and delete it. */
5150 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
5152 if (is_attribute_with_length_p ("dllimport", attr_len,
5155 if (prev == NULL_TREE)
5158 TREE_CHAIN (prev) = TREE_CHAIN (t);
5167 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5168 struct attribute_spec.handler. */
5171 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
5177 /* These attributes may apply to structure and union types being created,
5178 but otherwise should pass to the declaration involved. */
5181 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
5182 | (int) ATTR_FLAG_ARRAY_NEXT))
5184 *no_add_attrs = true;
5185 return tree_cons (name, args, NULL_TREE);
5187 if (TREE_CODE (node) == RECORD_TYPE
5188 || TREE_CODE (node) == UNION_TYPE)
5190 node = TYPE_NAME (node);
5196 warning (OPT_Wattributes, "%qE attribute ignored",
5198 *no_add_attrs = true;
5203 if (TREE_CODE (node) != FUNCTION_DECL
5204 && TREE_CODE (node) != VAR_DECL
5205 && TREE_CODE (node) != TYPE_DECL)
5207 *no_add_attrs = true;
5208 warning (OPT_Wattributes, "%qE attribute ignored",
5213 if (TREE_CODE (node) == TYPE_DECL
5214 && TREE_CODE (TREE_TYPE (node)) != RECORD_TYPE
5215 && TREE_CODE (TREE_TYPE (node)) != UNION_TYPE)
5217 *no_add_attrs = true;
5218 warning (OPT_Wattributes, "%qE attribute ignored",
5223 is_dllimport = is_attribute_p ("dllimport", name);
5225 /* Report error on dllimport ambiguities seen now before they cause
5229 /* Honor any target-specific overrides. */
5230 if (!targetm.valid_dllimport_attribute_p (node))
5231 *no_add_attrs = true;
5233 else if (TREE_CODE (node) == FUNCTION_DECL
5234 && DECL_DECLARED_INLINE_P (node))
5236 warning (OPT_Wattributes, "inline function %q+D declared as "
5237 " dllimport: attribute ignored", node);
5238 *no_add_attrs = true;
5240 /* Like MS, treat definition of dllimported variables and
5241 non-inlined functions on declaration as syntax errors. */
5242 else if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node))
5244 error ("function %q+D definition is marked dllimport", node);
5245 *no_add_attrs = true;
5248 else if (TREE_CODE (node) == VAR_DECL)
5250 if (DECL_INITIAL (node))
5252 error ("variable %q+D definition is marked dllimport",
5254 *no_add_attrs = true;
5257 /* `extern' needn't be specified with dllimport.
5258 Specify `extern' now and hope for the best. Sigh. */
5259 DECL_EXTERNAL (node) = 1;
5260 /* Also, implicitly give dllimport'd variables declared within
5261 a function global scope, unless declared static. */
5262 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
5263 TREE_PUBLIC (node) = 1;
5266 if (*no_add_attrs == false)
5267 DECL_DLLIMPORT_P (node) = 1;
5269 else if (TREE_CODE (node) == FUNCTION_DECL
5270 && DECL_DECLARED_INLINE_P (node))
5271 /* An exported function, even if inline, must be emitted. */
5272 DECL_EXTERNAL (node) = 0;
5274 /* Report error if symbol is not accessible at global scope. */
5275 if (!TREE_PUBLIC (node)
5276 && (TREE_CODE (node) == VAR_DECL
5277 || TREE_CODE (node) == FUNCTION_DECL))
5279 error ("external linkage required for symbol %q+D because of "
5280 "%qE attribute", node, name);
5281 *no_add_attrs = true;
5284 /* A dllexport'd entity must have default visibility so that other
5285 program units (shared libraries or the main executable) can see
5286 it. A dllimport'd entity must have default visibility so that
5287 the linker knows that undefined references within this program
5288 unit can be resolved by the dynamic linker. */
5291 if (DECL_VISIBILITY_SPECIFIED (node)
5292 && DECL_VISIBILITY (node) != VISIBILITY_DEFAULT)
5293 error ("%qE implies default visibility, but %qD has already "
5294 "been declared with a different visibility",
5296 DECL_VISIBILITY (node) = VISIBILITY_DEFAULT;
5297 DECL_VISIBILITY_SPECIFIED (node) = 1;
5303 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5305 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5306 of the various TYPE_QUAL values. */
5309 set_type_quals (tree type, int type_quals)
5311 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
5312 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
5313 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
5316 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5319 check_qualified_type (const_tree cand, const_tree base, int type_quals)
5321 return (TYPE_QUALS (cand) == type_quals
5322 && TYPE_NAME (cand) == TYPE_NAME (base)
5323 /* Apparently this is needed for Objective-C. */
5324 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
5325 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
5326 TYPE_ATTRIBUTES (base)));
5329 /* Return a version of the TYPE, qualified as indicated by the
5330 TYPE_QUALS, if one exists. If no qualified version exists yet,
5331 return NULL_TREE. */
5334 get_qualified_type (tree type, int type_quals)
5338 if (TYPE_QUALS (type) == type_quals)
5341 /* Search the chain of variants to see if there is already one there just
5342 like the one we need to have. If so, use that existing one. We must
5343 preserve the TYPE_NAME, since there is code that depends on this. */
5344 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
5345 if (check_qualified_type (t, type, type_quals))
5351 /* Like get_qualified_type, but creates the type if it does not
5352 exist. This function never returns NULL_TREE. */
5355 build_qualified_type (tree type, int type_quals)
5359 /* See if we already have the appropriate qualified variant. */
5360 t = get_qualified_type (type, type_quals);
5362 /* If not, build it. */
5365 t = build_variant_type_copy (type);
5366 set_type_quals (t, type_quals);
5368 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5369 /* Propagate structural equality. */
5370 SET_TYPE_STRUCTURAL_EQUALITY (t);
5371 else if (TYPE_CANONICAL (type) != type)
5372 /* Build the underlying canonical type, since it is different
5374 TYPE_CANONICAL (t) = build_qualified_type (TYPE_CANONICAL (type),
5377 /* T is its own canonical type. */
5378 TYPE_CANONICAL (t) = t;
5385 /* Create a new distinct copy of TYPE. The new type is made its own
5386 MAIN_VARIANT. If TYPE requires structural equality checks, the
5387 resulting type requires structural equality checks; otherwise, its
5388 TYPE_CANONICAL points to itself. */
5391 build_distinct_type_copy (tree type)
5393 tree t = copy_node (type);
5395 TYPE_POINTER_TO (t) = 0;
5396 TYPE_REFERENCE_TO (t) = 0;
5398 /* Set the canonical type either to a new equivalence class, or
5399 propagate the need for structural equality checks. */
5400 if (TYPE_STRUCTURAL_EQUALITY_P (type))
5401 SET_TYPE_STRUCTURAL_EQUALITY (t);
5403 TYPE_CANONICAL (t) = t;
5405 /* Make it its own variant. */
5406 TYPE_MAIN_VARIANT (t) = t;
5407 TYPE_NEXT_VARIANT (t) = 0;
5409 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5410 whose TREE_TYPE is not t. This can also happen in the Ada
5411 frontend when using subtypes. */
5416 /* Create a new variant of TYPE, equivalent but distinct. This is so
5417 the caller can modify it. TYPE_CANONICAL for the return type will
5418 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5419 are considered equal by the language itself (or that both types
5420 require structural equality checks). */
5423 build_variant_type_copy (tree type)
5425 tree t, m = TYPE_MAIN_VARIANT (type);
5427 t = build_distinct_type_copy (type);
5429 /* Since we're building a variant, assume that it is a non-semantic
5430 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5431 TYPE_CANONICAL (t) = TYPE_CANONICAL (type);
5433 /* Add the new type to the chain of variants of TYPE. */
5434 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
5435 TYPE_NEXT_VARIANT (m) = t;
5436 TYPE_MAIN_VARIANT (t) = m;
5441 /* Return true if the from tree in both tree maps are equal. */
5444 tree_map_base_eq (const void *va, const void *vb)
5446 const struct tree_map_base *const a = (const struct tree_map_base *) va,
5447 *const b = (const struct tree_map_base *) vb;
5448 return (a->from == b->from);
5451 /* Hash a from tree in a tree_map. */
5454 tree_map_base_hash (const void *item)
5456 return htab_hash_pointer (((const struct tree_map_base *)item)->from);
5459 /* Return true if this tree map structure is marked for garbage collection
5460 purposes. We simply return true if the from tree is marked, so that this
5461 structure goes away when the from tree goes away. */
5464 tree_map_base_marked_p (const void *p)
5466 return ggc_marked_p (((const struct tree_map_base *) p)->from);
5470 tree_map_hash (const void *item)
5472 return (((const struct tree_map *) item)->hash);
5475 /* Return the initialization priority for DECL. */
5478 decl_init_priority_lookup (tree decl)
5480 struct tree_priority_map *h;
5481 struct tree_map_base in;
5483 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5485 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5486 return h ? h->init : DEFAULT_INIT_PRIORITY;
5489 /* Return the finalization priority for DECL. */
5492 decl_fini_priority_lookup (tree decl)
5494 struct tree_priority_map *h;
5495 struct tree_map_base in;
5497 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5499 h = (struct tree_priority_map *) htab_find (init_priority_for_decl, &in);
5500 return h ? h->fini : DEFAULT_INIT_PRIORITY;
5503 /* Return the initialization and finalization priority information for
5504 DECL. If there is no previous priority information, a freshly
5505 allocated structure is returned. */
5507 static struct tree_priority_map *
5508 decl_priority_info (tree decl)
5510 struct tree_priority_map in;
5511 struct tree_priority_map *h;
5514 in.base.from = decl;
5515 loc = htab_find_slot (init_priority_for_decl, &in, INSERT);
5516 h = (struct tree_priority_map *) *loc;
5519 h = GGC_CNEW (struct tree_priority_map);
5521 h->base.from = decl;
5522 h->init = DEFAULT_INIT_PRIORITY;
5523 h->fini = DEFAULT_INIT_PRIORITY;
5529 /* Set the initialization priority for DECL to PRIORITY. */
5532 decl_init_priority_insert (tree decl, priority_type priority)
5534 struct tree_priority_map *h;
5536 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl));
5537 h = decl_priority_info (decl);
5541 /* Set the finalization priority for DECL to PRIORITY. */
5544 decl_fini_priority_insert (tree decl, priority_type priority)
5546 struct tree_priority_map *h;
5548 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
5549 h = decl_priority_info (decl);
5553 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5556 print_debug_expr_statistics (void)
5558 fprintf (stderr, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5559 (long) htab_size (debug_expr_for_decl),
5560 (long) htab_elements (debug_expr_for_decl),
5561 htab_collisions (debug_expr_for_decl));
5564 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5567 print_value_expr_statistics (void)
5569 fprintf (stderr, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5570 (long) htab_size (value_expr_for_decl),
5571 (long) htab_elements (value_expr_for_decl),
5572 htab_collisions (value_expr_for_decl));
5575 /* Lookup a debug expression for FROM, and return it if we find one. */
5578 decl_debug_expr_lookup (tree from)
5580 struct tree_map *h, in;
5581 in.base.from = from;
5583 h = (struct tree_map *) htab_find_with_hash (debug_expr_for_decl, &in,
5584 htab_hash_pointer (from));
5590 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5593 decl_debug_expr_insert (tree from, tree to)
5598 h = GGC_NEW (struct tree_map);
5599 h->hash = htab_hash_pointer (from);
5600 h->base.from = from;
5602 loc = htab_find_slot_with_hash (debug_expr_for_decl, h, h->hash, INSERT);
5603 *(struct tree_map **) loc = h;
5606 /* Lookup a value expression for FROM, and return it if we find one. */
5609 decl_value_expr_lookup (tree from)
5611 struct tree_map *h, in;
5612 in.base.from = from;
5614 h = (struct tree_map *) htab_find_with_hash (value_expr_for_decl, &in,
5615 htab_hash_pointer (from));
5621 /* Insert a mapping FROM->TO in the value expression hashtable. */
5624 decl_value_expr_insert (tree from, tree to)
5629 h = GGC_NEW (struct tree_map);
5630 h->hash = htab_hash_pointer (from);
5631 h->base.from = from;
5633 loc = htab_find_slot_with_hash (value_expr_for_decl, h, h->hash, INSERT);
5634 *(struct tree_map **) loc = h;
5637 /* Hashing of types so that we don't make duplicates.
5638 The entry point is `type_hash_canon'. */
5640 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5641 with types in the TREE_VALUE slots), by adding the hash codes
5642 of the individual types. */
5645 type_hash_list (const_tree list, hashval_t hashcode)
5649 for (tail = list; tail; tail = TREE_CHAIN (tail))
5650 if (TREE_VALUE (tail) != error_mark_node)
5651 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
5657 /* These are the Hashtable callback functions. */
5659 /* Returns true iff the types are equivalent. */
5662 type_hash_eq (const void *va, const void *vb)
5664 const struct type_hash *const a = (const struct type_hash *) va,
5665 *const b = (const struct type_hash *) vb;
5667 /* First test the things that are the same for all types. */
5668 if (a->hash != b->hash
5669 || TREE_CODE (a->type) != TREE_CODE (b->type)
5670 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
5671 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
5672 TYPE_ATTRIBUTES (b->type))
5673 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
5674 || TYPE_MODE (a->type) != TYPE_MODE (b->type)
5675 || (TREE_CODE (a->type) != COMPLEX_TYPE
5676 && TYPE_NAME (a->type) != TYPE_NAME (b->type)))
5679 switch (TREE_CODE (a->type))
5684 case REFERENCE_TYPE:
5688 return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type);
5691 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
5692 && !(TYPE_VALUES (a->type)
5693 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
5694 && TYPE_VALUES (b->type)
5695 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
5696 && type_list_equal (TYPE_VALUES (a->type),
5697 TYPE_VALUES (b->type))))
5700 /* ... fall through ... */
5705 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
5706 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
5707 TYPE_MAX_VALUE (b->type)))
5708 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
5709 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
5710 TYPE_MIN_VALUE (b->type))));
5712 case FIXED_POINT_TYPE:
5713 return TYPE_SATURATING (a->type) == TYPE_SATURATING (b->type);
5716 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
5719 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
5720 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5721 || (TYPE_ARG_TYPES (a->type)
5722 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5723 && TYPE_ARG_TYPES (b->type)
5724 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5725 && type_list_equal (TYPE_ARG_TYPES (a->type),
5726 TYPE_ARG_TYPES (b->type)))));
5729 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
5733 case QUAL_UNION_TYPE:
5734 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
5735 || (TYPE_FIELDS (a->type)
5736 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
5737 && TYPE_FIELDS (b->type)
5738 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
5739 && type_list_equal (TYPE_FIELDS (a->type),
5740 TYPE_FIELDS (b->type))));
5743 if (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
5744 || (TYPE_ARG_TYPES (a->type)
5745 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
5746 && TYPE_ARG_TYPES (b->type)
5747 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
5748 && type_list_equal (TYPE_ARG_TYPES (a->type),
5749 TYPE_ARG_TYPES (b->type))))
5757 if (lang_hooks.types.type_hash_eq != NULL)
5758 return lang_hooks.types.type_hash_eq (a->type, b->type);
5763 /* Return the cached hash value. */
5766 type_hash_hash (const void *item)
5768 return ((const struct type_hash *) item)->hash;
5771 /* Look in the type hash table for a type isomorphic to TYPE.
5772 If one is found, return it. Otherwise return 0. */
5775 type_hash_lookup (hashval_t hashcode, tree type)
5777 struct type_hash *h, in;
5779 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5780 must call that routine before comparing TYPE_ALIGNs. */
5786 h = (struct type_hash *) htab_find_with_hash (type_hash_table, &in,
5793 /* Add an entry to the type-hash-table
5794 for a type TYPE whose hash code is HASHCODE. */
5797 type_hash_add (hashval_t hashcode, tree type)
5799 struct type_hash *h;
5802 h = GGC_NEW (struct type_hash);
5805 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
5809 /* Given TYPE, and HASHCODE its hash code, return the canonical
5810 object for an identical type if one already exists.
5811 Otherwise, return TYPE, and record it as the canonical object.
5813 To use this function, first create a type of the sort you want.
5814 Then compute its hash code from the fields of the type that
5815 make it different from other similar types.
5816 Then call this function and use the value. */
5819 type_hash_canon (unsigned int hashcode, tree type)
5823 /* The hash table only contains main variants, so ensure that's what we're
5825 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
5827 if (!lang_hooks.types.hash_types)
5830 /* See if the type is in the hash table already. If so, return it.
5831 Otherwise, add the type. */
5832 t1 = type_hash_lookup (hashcode, type);
5835 #ifdef GATHER_STATISTICS
5836 tree_node_counts[(int) t_kind]--;
5837 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
5843 type_hash_add (hashcode, type);
5848 /* See if the data pointed to by the type hash table is marked. We consider
5849 it marked if the type is marked or if a debug type number or symbol
5850 table entry has been made for the type. This reduces the amount of
5851 debugging output and eliminates that dependency of the debug output on
5852 the number of garbage collections. */
5855 type_hash_marked_p (const void *p)
5857 const_tree const type = ((const struct type_hash *) p)->type;
5859 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
5863 print_type_hash_statistics (void)
5865 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
5866 (long) htab_size (type_hash_table),
5867 (long) htab_elements (type_hash_table),
5868 htab_collisions (type_hash_table));
5871 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5872 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5873 by adding the hash codes of the individual attributes. */
5876 attribute_hash_list (const_tree list, hashval_t hashcode)
5880 for (tail = list; tail; tail = TREE_CHAIN (tail))
5881 /* ??? Do we want to add in TREE_VALUE too? */
5882 hashcode = iterative_hash_object
5883 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
5887 /* Given two lists of attributes, return true if list l2 is
5888 equivalent to l1. */
5891 attribute_list_equal (const_tree l1, const_tree l2)
5893 return attribute_list_contained (l1, l2)
5894 && attribute_list_contained (l2, l1);
5897 /* Given two lists of attributes, return true if list L2 is
5898 completely contained within L1. */
5899 /* ??? This would be faster if attribute names were stored in a canonicalized
5900 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
5901 must be used to show these elements are equivalent (which they are). */
5902 /* ??? It's not clear that attributes with arguments will always be handled
5906 attribute_list_contained (const_tree l1, const_tree l2)
5910 /* First check the obvious, maybe the lists are identical. */
5914 /* Maybe the lists are similar. */
5915 for (t1 = l1, t2 = l2;
5917 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
5918 && TREE_VALUE (t1) == TREE_VALUE (t2);
5919 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
5921 /* Maybe the lists are equal. */
5922 if (t1 == 0 && t2 == 0)
5925 for (; t2 != 0; t2 = TREE_CHAIN (t2))
5928 /* This CONST_CAST is okay because lookup_attribute does not
5929 modify its argument and the return value is assigned to a
5931 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
5932 CONST_CAST_TREE(l1));
5934 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
5937 if (TREE_VALUE (t2) != NULL
5938 && TREE_CODE (TREE_VALUE (t2)) == TREE_LIST
5939 && TREE_VALUE (attr) != NULL
5940 && TREE_CODE (TREE_VALUE (attr)) == TREE_LIST)
5942 if (simple_cst_list_equal (TREE_VALUE (t2),
5943 TREE_VALUE (attr)) == 1)
5946 else if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
5957 /* Given two lists of types
5958 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
5959 return 1 if the lists contain the same types in the same order.
5960 Also, the TREE_PURPOSEs must match. */
5963 type_list_equal (const_tree l1, const_tree l2)
5967 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
5968 if (TREE_VALUE (t1) != TREE_VALUE (t2)
5969 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
5970 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
5971 && (TREE_TYPE (TREE_PURPOSE (t1))
5972 == TREE_TYPE (TREE_PURPOSE (t2))))))
5978 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
5979 given by TYPE. If the argument list accepts variable arguments,
5980 then this function counts only the ordinary arguments. */
5983 type_num_arguments (const_tree type)
5988 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
5989 /* If the function does not take a variable number of arguments,
5990 the last element in the list will have type `void'. */
5991 if (VOID_TYPE_P (TREE_VALUE (t)))
5999 /* Nonzero if integer constants T1 and T2
6000 represent the same constant value. */
6003 tree_int_cst_equal (const_tree t1, const_tree t2)
6008 if (t1 == 0 || t2 == 0)
6011 if (TREE_CODE (t1) == INTEGER_CST
6012 && TREE_CODE (t2) == INTEGER_CST
6013 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6014 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
6020 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6021 The precise way of comparison depends on their data type. */
6024 tree_int_cst_lt (const_tree t1, const_tree t2)
6029 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
6031 int t1_sgn = tree_int_cst_sgn (t1);
6032 int t2_sgn = tree_int_cst_sgn (t2);
6034 if (t1_sgn < t2_sgn)
6036 else if (t1_sgn > t2_sgn)
6038 /* Otherwise, both are non-negative, so we compare them as
6039 unsigned just in case one of them would overflow a signed
6042 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
6043 return INT_CST_LT (t1, t2);
6045 return INT_CST_LT_UNSIGNED (t1, t2);
6048 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6051 tree_int_cst_compare (const_tree t1, const_tree t2)
6053 if (tree_int_cst_lt (t1, t2))
6055 else if (tree_int_cst_lt (t2, t1))
6061 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6062 the host. If POS is zero, the value can be represented in a single
6063 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6064 be represented in a single unsigned HOST_WIDE_INT. */
6067 host_integerp (const_tree t, int pos)
6072 return (TREE_CODE (t) == INTEGER_CST
6073 && ((TREE_INT_CST_HIGH (t) == 0
6074 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
6075 || (! pos && TREE_INT_CST_HIGH (t) == -1
6076 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
6077 && (!TYPE_UNSIGNED (TREE_TYPE (t))
6078 || (TREE_CODE (TREE_TYPE (t)) == INTEGER_TYPE
6079 && TYPE_IS_SIZETYPE (TREE_TYPE (t)))))
6080 || (pos && TREE_INT_CST_HIGH (t) == 0)));
6083 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6084 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6085 be non-negative. We must be able to satisfy the above conditions. */
6088 tree_low_cst (const_tree t, int pos)
6090 gcc_assert (host_integerp (t, pos));
6091 return TREE_INT_CST_LOW (t);
6094 /* Return the most significant bit of the integer constant T. */
6097 tree_int_cst_msb (const_tree t)
6101 unsigned HOST_WIDE_INT l;
6103 /* Note that using TYPE_PRECISION here is wrong. We care about the
6104 actual bits, not the (arbitrary) range of the type. */
6105 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
6106 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
6107 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
6108 return (l & 1) == 1;
6111 /* Return an indication of the sign of the integer constant T.
6112 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6113 Note that -1 will never be returned if T's type is unsigned. */
6116 tree_int_cst_sgn (const_tree t)
6118 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
6120 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
6122 else if (TREE_INT_CST_HIGH (t) < 0)
6128 /* Return the minimum number of bits needed to represent VALUE in a
6129 signed or unsigned type, UNSIGNEDP says which. */
6132 tree_int_cst_min_precision (tree value, bool unsignedp)
6136 /* If the value is negative, compute its negative minus 1. The latter
6137 adjustment is because the absolute value of the largest negative value
6138 is one larger than the largest positive value. This is equivalent to
6139 a bit-wise negation, so use that operation instead. */
6141 if (tree_int_cst_sgn (value) < 0)
6142 value = fold_build1 (BIT_NOT_EXPR, TREE_TYPE (value), value);
6144 /* Return the number of bits needed, taking into account the fact
6145 that we need one more bit for a signed than unsigned type. */
6147 if (integer_zerop (value))
6150 log = tree_floor_log2 (value);
6152 return log + 1 + !unsignedp;
6155 /* Compare two constructor-element-type constants. Return 1 if the lists
6156 are known to be equal; otherwise return 0. */
6159 simple_cst_list_equal (const_tree l1, const_tree l2)
6161 while (l1 != NULL_TREE && l2 != NULL_TREE)
6163 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
6166 l1 = TREE_CHAIN (l1);
6167 l2 = TREE_CHAIN (l2);
6173 /* Return truthvalue of whether T1 is the same tree structure as T2.
6174 Return 1 if they are the same.
6175 Return 0 if they are understandably different.
6176 Return -1 if either contains tree structure not understood by
6180 simple_cst_equal (const_tree t1, const_tree t2)
6182 enum tree_code code1, code2;
6188 if (t1 == 0 || t2 == 0)
6191 code1 = TREE_CODE (t1);
6192 code2 = TREE_CODE (t2);
6194 if (CONVERT_EXPR_CODE_P (code1) || code1 == NON_LVALUE_EXPR)
6196 if (CONVERT_EXPR_CODE_P (code2)
6197 || code2 == NON_LVALUE_EXPR)
6198 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6200 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
6203 else if (CONVERT_EXPR_CODE_P (code2)
6204 || code2 == NON_LVALUE_EXPR)
6205 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
6213 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
6214 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
6217 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
6220 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1), TREE_FIXED_CST (t2));
6223 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
6224 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
6225 TREE_STRING_LENGTH (t1)));
6229 unsigned HOST_WIDE_INT idx;
6230 VEC(constructor_elt, gc) *v1 = CONSTRUCTOR_ELTS (t1);
6231 VEC(constructor_elt, gc) *v2 = CONSTRUCTOR_ELTS (t2);
6233 if (VEC_length (constructor_elt, v1) != VEC_length (constructor_elt, v2))
6236 for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
6237 /* ??? Should we handle also fields here? */
6238 if (!simple_cst_equal (VEC_index (constructor_elt, v1, idx)->value,
6239 VEC_index (constructor_elt, v2, idx)->value))
6245 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6248 cmp = simple_cst_equal (CALL_EXPR_FN (t1), CALL_EXPR_FN (t2));
6251 if (call_expr_nargs (t1) != call_expr_nargs (t2))
6254 const_tree arg1, arg2;
6255 const_call_expr_arg_iterator iter1, iter2;
6256 for (arg1 = first_const_call_expr_arg (t1, &iter1),
6257 arg2 = first_const_call_expr_arg (t2, &iter2);
6259 arg1 = next_const_call_expr_arg (&iter1),
6260 arg2 = next_const_call_expr_arg (&iter2))
6262 cmp = simple_cst_equal (arg1, arg2);
6266 return arg1 == arg2;
6270 /* Special case: if either target is an unallocated VAR_DECL,
6271 it means that it's going to be unified with whatever the
6272 TARGET_EXPR is really supposed to initialize, so treat it
6273 as being equivalent to anything. */
6274 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
6275 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
6276 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
6277 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
6278 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
6279 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
6282 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6287 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
6289 case WITH_CLEANUP_EXPR:
6290 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6294 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
6297 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
6298 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
6312 /* This general rule works for most tree codes. All exceptions should be
6313 handled above. If this is a language-specific tree code, we can't
6314 trust what might be in the operand, so say we don't know
6316 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
6319 switch (TREE_CODE_CLASS (code1))
6323 case tcc_comparison:
6324 case tcc_expression:
6328 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
6330 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
6342 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6343 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6344 than U, respectively. */
6347 compare_tree_int (const_tree t, unsigned HOST_WIDE_INT u)
6349 if (tree_int_cst_sgn (t) < 0)
6351 else if (TREE_INT_CST_HIGH (t) != 0)
6353 else if (TREE_INT_CST_LOW (t) == u)
6355 else if (TREE_INT_CST_LOW (t) < u)
6361 /* Return true if CODE represents an associative tree code. Otherwise
6364 associative_tree_code (enum tree_code code)
6383 /* Return true if CODE represents a commutative tree code. Otherwise
6386 commutative_tree_code (enum tree_code code)
6399 case UNORDERED_EXPR:
6403 case TRUTH_AND_EXPR:
6404 case TRUTH_XOR_EXPR:
6414 /* Generate a hash value for an expression. This can be used iteratively
6415 by passing a previous result as the VAL argument.
6417 This function is intended to produce the same hash for expressions which
6418 would compare equal using operand_equal_p. */
6421 iterative_hash_expr (const_tree t, hashval_t val)
6424 enum tree_code code;
6428 return iterative_hash_hashval_t (0, val);
6430 code = TREE_CODE (t);
6434 /* Alas, constants aren't shared, so we can't rely on pointer
6437 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
6438 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
6441 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
6443 return iterative_hash_hashval_t (val2, val);
6447 unsigned int val2 = fixed_hash (TREE_FIXED_CST_PTR (t));
6449 return iterative_hash_hashval_t (val2, val);
6452 return iterative_hash (TREE_STRING_POINTER (t),
6453 TREE_STRING_LENGTH (t), val);
6455 val = iterative_hash_expr (TREE_REALPART (t), val);
6456 return iterative_hash_expr (TREE_IMAGPART (t), val);
6458 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
6461 /* we can just compare by pointer. */
6462 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t), val);
6465 /* A list of expressions, for a CALL_EXPR or as the elements of a
6467 for (; t; t = TREE_CHAIN (t))
6468 val = iterative_hash_expr (TREE_VALUE (t), val);
6472 unsigned HOST_WIDE_INT idx;
6474 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), idx, field, value)
6476 val = iterative_hash_expr (field, val);
6477 val = iterative_hash_expr (value, val);
6482 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6483 Otherwise nodes that compare equal according to operand_equal_p might
6484 get different hash codes. However, don't do this for machine specific
6485 or front end builtins, since the function code is overloaded in those
6487 if (DECL_BUILT_IN_CLASS (t) == BUILT_IN_NORMAL
6488 && built_in_decls[DECL_FUNCTION_CODE (t)])
6490 t = built_in_decls[DECL_FUNCTION_CODE (t)];
6491 code = TREE_CODE (t);
6495 tclass = TREE_CODE_CLASS (code);
6497 if (tclass == tcc_declaration)
6499 /* DECL's have a unique ID */
6500 val = iterative_hash_host_wide_int (DECL_UID (t), val);
6504 gcc_assert (IS_EXPR_CODE_CLASS (tclass));
6506 val = iterative_hash_object (code, val);
6508 /* Don't hash the type, that can lead to having nodes which
6509 compare equal according to operand_equal_p, but which
6510 have different hash codes. */
6511 if (CONVERT_EXPR_CODE_P (code)
6512 || code == NON_LVALUE_EXPR)
6514 /* Make sure to include signness in the hash computation. */
6515 val += TYPE_UNSIGNED (TREE_TYPE (t));
6516 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
6519 else if (commutative_tree_code (code))
6521 /* It's a commutative expression. We want to hash it the same
6522 however it appears. We do this by first hashing both operands
6523 and then rehashing based on the order of their independent
6525 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
6526 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
6530 t = one, one = two, two = t;
6532 val = iterative_hash_hashval_t (one, val);
6533 val = iterative_hash_hashval_t (two, val);
6536 for (i = TREE_OPERAND_LENGTH (t) - 1; i >= 0; --i)
6537 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
6544 /* Generate a hash value for a pair of expressions. This can be used
6545 iteratively by passing a previous result as the VAL argument.
6547 The same hash value is always returned for a given pair of expressions,
6548 regardless of the order in which they are presented. This is useful in
6549 hashing the operands of commutative functions. */
6552 iterative_hash_exprs_commutative (const_tree t1,
6553 const_tree t2, hashval_t val)
6555 hashval_t one = iterative_hash_expr (t1, 0);
6556 hashval_t two = iterative_hash_expr (t2, 0);
6560 t = one, one = two, two = t;
6561 val = iterative_hash_hashval_t (one, val);
6562 val = iterative_hash_hashval_t (two, val);
6567 /* Constructors for pointer, array and function types.
6568 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6569 constructed by language-dependent code, not here.) */
6571 /* Construct, lay out and return the type of pointers to TO_TYPE with
6572 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6573 reference all of memory. If such a type has already been
6574 constructed, reuse it. */
6577 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
6582 if (to_type == error_mark_node)
6583 return error_mark_node;
6585 /* If the pointed-to type has the may_alias attribute set, force
6586 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6587 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6588 can_alias_all = true;
6590 /* In some cases, languages will have things that aren't a POINTER_TYPE
6591 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6592 In that case, return that type without regard to the rest of our
6595 ??? This is a kludge, but consistent with the way this function has
6596 always operated and there doesn't seem to be a good way to avoid this
6598 if (TYPE_POINTER_TO (to_type) != 0
6599 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
6600 return TYPE_POINTER_TO (to_type);
6602 /* First, if we already have a type for pointers to TO_TYPE and it's
6603 the proper mode, use it. */
6604 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
6605 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6608 t = make_node (POINTER_TYPE);
6610 TREE_TYPE (t) = to_type;
6611 SET_TYPE_MODE (t, mode);
6612 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6613 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
6614 TYPE_POINTER_TO (to_type) = t;
6616 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6617 SET_TYPE_STRUCTURAL_EQUALITY (t);
6618 else if (TYPE_CANONICAL (to_type) != to_type)
6620 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type),
6621 mode, can_alias_all);
6623 /* Lay out the type. This function has many callers that are concerned
6624 with expression-construction, and this simplifies them all. */
6630 /* By default build pointers in ptr_mode. */
6633 build_pointer_type (tree to_type)
6635 return build_pointer_type_for_mode (to_type, ptr_mode, false);
6638 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6641 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
6646 if (to_type == error_mark_node)
6647 return error_mark_node;
6649 /* If the pointed-to type has the may_alias attribute set, force
6650 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6651 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type)))
6652 can_alias_all = true;
6654 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6655 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6656 In that case, return that type without regard to the rest of our
6659 ??? This is a kludge, but consistent with the way this function has
6660 always operated and there doesn't seem to be a good way to avoid this
6662 if (TYPE_REFERENCE_TO (to_type) != 0
6663 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
6664 return TYPE_REFERENCE_TO (to_type);
6666 /* First, if we already have a type for pointers to TO_TYPE and it's
6667 the proper mode, use it. */
6668 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
6669 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
6672 t = make_node (REFERENCE_TYPE);
6674 TREE_TYPE (t) = to_type;
6675 SET_TYPE_MODE (t, mode);
6676 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
6677 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
6678 TYPE_REFERENCE_TO (to_type) = t;
6680 if (TYPE_STRUCTURAL_EQUALITY_P (to_type))
6681 SET_TYPE_STRUCTURAL_EQUALITY (t);
6682 else if (TYPE_CANONICAL (to_type) != to_type)
6684 = build_reference_type_for_mode (TYPE_CANONICAL (to_type),
6685 mode, can_alias_all);
6693 /* Build the node for the type of references-to-TO_TYPE by default
6697 build_reference_type (tree to_type)
6699 return build_reference_type_for_mode (to_type, ptr_mode, false);
6702 /* Build a type that is compatible with t but has no cv quals anywhere
6705 const char *const *const * -> char ***. */
6708 build_type_no_quals (tree t)
6710 switch (TREE_CODE (t))
6713 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6715 TYPE_REF_CAN_ALIAS_ALL (t));
6716 case REFERENCE_TYPE:
6718 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
6720 TYPE_REF_CAN_ALIAS_ALL (t));
6722 return TYPE_MAIN_VARIANT (t);
6726 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6727 MAXVAL should be the maximum value in the domain
6728 (one less than the length of the array).
6730 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6731 We don't enforce this limit, that is up to caller (e.g. language front end).
6732 The limit exists because the result is a signed type and we don't handle
6733 sizes that use more than one HOST_WIDE_INT. */
6736 build_index_type (tree maxval)
6738 tree itype = make_node (INTEGER_TYPE);
6740 TREE_TYPE (itype) = sizetype;
6741 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
6742 TYPE_MIN_VALUE (itype) = size_zero_node;
6743 TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval);
6744 SET_TYPE_MODE (itype, TYPE_MODE (sizetype));
6745 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
6746 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
6747 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
6748 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
6750 if (host_integerp (maxval, 1))
6751 return type_hash_canon (tree_low_cst (maxval, 1), itype);
6754 /* Since we cannot hash this type, we need to compare it using
6755 structural equality checks. */
6756 SET_TYPE_STRUCTURAL_EQUALITY (itype);
6761 /* Builds a signed or unsigned integer type of precision PRECISION.
6762 Used for C bitfields whose precision does not match that of
6763 built-in target types. */
6765 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
6768 tree itype = make_node (INTEGER_TYPE);
6770 TYPE_PRECISION (itype) = precision;
6773 fixup_unsigned_type (itype);
6775 fixup_signed_type (itype);
6777 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
6778 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
6783 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6784 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6785 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6788 build_range_type (tree type, tree lowval, tree highval)
6790 tree itype = make_node (INTEGER_TYPE);
6792 TREE_TYPE (itype) = type;
6793 if (type == NULL_TREE)
6796 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval);
6797 TYPE_MAX_VALUE (itype) = highval ? fold_convert (type, highval) : NULL;
6799 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
6800 SET_TYPE_MODE (itype, TYPE_MODE (type));
6801 TYPE_SIZE (itype) = TYPE_SIZE (type);
6802 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
6803 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
6804 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
6806 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
6807 return type_hash_canon (tree_low_cst (highval, 0)
6808 - tree_low_cst (lowval, 0),
6814 /* Return true if the debug information for TYPE, a subtype, should be emitted
6815 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6816 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6817 debug info and doesn't reflect the source code. */
6820 subrange_type_for_debug_p (const_tree type, tree *lowval, tree *highval)
6822 tree base_type = TREE_TYPE (type), low, high;
6824 /* Subrange types have a base type which is an integral type. */
6825 if (!INTEGRAL_TYPE_P (base_type))
6828 /* Get the real bounds of the subtype. */
6829 if (lang_hooks.types.get_subrange_bounds)
6830 lang_hooks.types.get_subrange_bounds (type, &low, &high);
6833 low = TYPE_MIN_VALUE (type);
6834 high = TYPE_MAX_VALUE (type);
6837 /* If the type and its base type have the same representation and the same
6838 name, then the type is not a subrange but a copy of the base type. */
6839 if ((TREE_CODE (base_type) == INTEGER_TYPE
6840 || TREE_CODE (base_type) == BOOLEAN_TYPE)
6841 && int_size_in_bytes (type) == int_size_in_bytes (base_type)
6842 && tree_int_cst_equal (low, TYPE_MIN_VALUE (base_type))
6843 && tree_int_cst_equal (high, TYPE_MAX_VALUE (base_type)))
6845 tree type_name = TYPE_NAME (type);
6846 tree base_type_name = TYPE_NAME (base_type);
6848 if (type_name && TREE_CODE (type_name) == TYPE_DECL)
6849 type_name = DECL_NAME (type_name);
6851 if (base_type_name && TREE_CODE (base_type_name) == TYPE_DECL)
6852 base_type_name = DECL_NAME (base_type_name);
6854 if (type_name == base_type_name)
6865 /* Just like build_index_type, but takes lowval and highval instead
6866 of just highval (maxval). */
6869 build_index_2_type (tree lowval, tree highval)
6871 return build_range_type (sizetype, lowval, highval);
6874 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6875 and number of elements specified by the range of values of INDEX_TYPE.
6876 If such a type has already been constructed, reuse it. */
6879 build_array_type (tree elt_type, tree index_type)
6882 hashval_t hashcode = 0;
6884 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
6886 error ("arrays of functions are not meaningful");
6887 elt_type = integer_type_node;
6890 t = make_node (ARRAY_TYPE);
6891 TREE_TYPE (t) = elt_type;
6892 TYPE_DOMAIN (t) = index_type;
6895 /* If the element type is incomplete at this point we get marked for
6896 structural equality. Do not record these types in the canonical
6898 if (TYPE_STRUCTURAL_EQUALITY_P (t))
6901 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
6903 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
6904 t = type_hash_canon (hashcode, t);
6906 if (TYPE_CANONICAL (t) == t)
6908 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type)
6909 || (index_type && TYPE_STRUCTURAL_EQUALITY_P (index_type)))
6910 SET_TYPE_STRUCTURAL_EQUALITY (t);
6911 else if (TYPE_CANONICAL (elt_type) != elt_type
6912 || (index_type && TYPE_CANONICAL (index_type) != index_type))
6914 = build_array_type (TYPE_CANONICAL (elt_type),
6915 index_type ? TYPE_CANONICAL (index_type) : NULL);
6921 /* Recursively examines the array elements of TYPE, until a non-array
6922 element type is found. */
6925 strip_array_types (tree type)
6927 while (TREE_CODE (type) == ARRAY_TYPE)
6928 type = TREE_TYPE (type);
6933 /* Computes the canonical argument types from the argument type list
6936 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
6937 on entry to this function, or if any of the ARGTYPES are
6940 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
6941 true on entry to this function, or if any of the ARGTYPES are
6944 Returns a canonical argument list, which may be ARGTYPES when the
6945 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
6946 true) or would not differ from ARGTYPES. */
6949 maybe_canonicalize_argtypes(tree argtypes,
6950 bool *any_structural_p,
6951 bool *any_noncanonical_p)
6954 bool any_noncanonical_argtypes_p = false;
6956 for (arg = argtypes; arg && !(*any_structural_p); arg = TREE_CHAIN (arg))
6958 if (!TREE_VALUE (arg) || TREE_VALUE (arg) == error_mark_node)
6959 /* Fail gracefully by stating that the type is structural. */
6960 *any_structural_p = true;
6961 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg)))
6962 *any_structural_p = true;
6963 else if (TYPE_CANONICAL (TREE_VALUE (arg)) != TREE_VALUE (arg)
6964 || TREE_PURPOSE (arg))
6965 /* If the argument has a default argument, we consider it
6966 non-canonical even though the type itself is canonical.
6967 That way, different variants of function and method types
6968 with default arguments will all point to the variant with
6969 no defaults as their canonical type. */
6970 any_noncanonical_argtypes_p = true;
6973 if (*any_structural_p)
6976 if (any_noncanonical_argtypes_p)
6978 /* Build the canonical list of argument types. */
6979 tree canon_argtypes = NULL_TREE;
6980 bool is_void = false;
6982 for (arg = argtypes; arg; arg = TREE_CHAIN (arg))
6984 if (arg == void_list_node)
6987 canon_argtypes = tree_cons (NULL_TREE,
6988 TYPE_CANONICAL (TREE_VALUE (arg)),
6992 canon_argtypes = nreverse (canon_argtypes);
6994 canon_argtypes = chainon (canon_argtypes, void_list_node);
6996 /* There is a non-canonical type. */
6997 *any_noncanonical_p = true;
6998 return canon_argtypes;
7001 /* The canonical argument types are the same as ARGTYPES. */
7005 /* Construct, lay out and return
7006 the type of functions returning type VALUE_TYPE
7007 given arguments of types ARG_TYPES.
7008 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7009 are data type nodes for the arguments of the function.
7010 If such a type has already been constructed, reuse it. */
7013 build_function_type (tree value_type, tree arg_types)
7016 hashval_t hashcode = 0;
7017 bool any_structural_p, any_noncanonical_p;
7018 tree canon_argtypes;
7020 if (TREE_CODE (value_type) == FUNCTION_TYPE)
7022 error ("function return type cannot be function");
7023 value_type = integer_type_node;
7026 /* Make a node of the sort we want. */
7027 t = make_node (FUNCTION_TYPE);
7028 TREE_TYPE (t) = value_type;
7029 TYPE_ARG_TYPES (t) = arg_types;
7031 /* If we already have such a type, use the old one. */
7032 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
7033 hashcode = type_hash_list (arg_types, hashcode);
7034 t = type_hash_canon (hashcode, t);
7036 /* Set up the canonical type. */
7037 any_structural_p = TYPE_STRUCTURAL_EQUALITY_P (value_type);
7038 any_noncanonical_p = TYPE_CANONICAL (value_type) != value_type;
7039 canon_argtypes = maybe_canonicalize_argtypes (arg_types,
7041 &any_noncanonical_p);
7042 if (any_structural_p)
7043 SET_TYPE_STRUCTURAL_EQUALITY (t);
7044 else if (any_noncanonical_p)
7045 TYPE_CANONICAL (t) = build_function_type (TYPE_CANONICAL (value_type),
7048 if (!COMPLETE_TYPE_P (t))
7053 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7056 build_function_type_skip_args (tree orig_type, bitmap args_to_skip)
7058 tree new_type = NULL;
7059 tree args, new_args = NULL, t;
7063 for (args = TYPE_ARG_TYPES (orig_type); args && args != void_list_node;
7064 args = TREE_CHAIN (args), i++)
7065 if (!bitmap_bit_p (args_to_skip, i))
7066 new_args = tree_cons (NULL_TREE, TREE_VALUE (args), new_args);
7068 new_reversed = nreverse (new_args);
7072 TREE_CHAIN (new_args) = void_list_node;
7074 new_reversed = void_list_node;
7077 /* Use copy_node to preserve as much as possible from original type
7078 (debug info, attribute lists etc.)
7079 Exception is METHOD_TYPEs must have THIS argument.
7080 When we are asked to remove it, we need to build new FUNCTION_TYPE
7082 if (TREE_CODE (orig_type) != METHOD_TYPE
7083 || !bitmap_bit_p (args_to_skip, 0))
7085 new_type = copy_node (orig_type);
7086 TYPE_ARG_TYPES (new_type) = new_reversed;
7091 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
7093 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
7096 /* This is a new type, not a copy of an old type. Need to reassociate
7097 variants. We can handle everything except the main variant lazily. */
7098 t = TYPE_MAIN_VARIANT (orig_type);
7101 TYPE_MAIN_VARIANT (new_type) = t;
7102 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
7103 TYPE_NEXT_VARIANT (t) = new_type;
7107 TYPE_MAIN_VARIANT (new_type) = new_type;
7108 TYPE_NEXT_VARIANT (new_type) = NULL;
7113 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7115 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7116 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7117 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7120 build_function_decl_skip_args (tree orig_decl, bitmap args_to_skip)
7122 tree new_decl = copy_node (orig_decl);
7125 new_type = TREE_TYPE (orig_decl);
7126 if (prototype_p (new_type))
7127 new_type = build_function_type_skip_args (new_type, args_to_skip);
7128 TREE_TYPE (new_decl) = new_type;
7130 /* For declarations setting DECL_VINDEX (i.e. methods)
7131 we expect first argument to be THIS pointer. */
7132 if (bitmap_bit_p (args_to_skip, 0))
7133 DECL_VINDEX (new_decl) = NULL_TREE;
7137 /* Build a function type. The RETURN_TYPE is the type returned by the
7138 function. If VAARGS is set, no void_type_node is appended to the
7139 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7142 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
7146 t = va_arg (argp, tree);
7147 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (argp, tree))
7148 args = tree_cons (NULL_TREE, t, args);
7153 if (args != NULL_TREE)
7154 args = nreverse (args);
7155 gcc_assert (args != NULL_TREE && last != void_list_node);
7157 else if (args == NULL_TREE)
7158 args = void_list_node;
7162 args = nreverse (args);
7163 TREE_CHAIN (last) = void_list_node;
7165 args = build_function_type (return_type, args);
7170 /* Build a function type. The RETURN_TYPE is the type returned by the
7171 function. If additional arguments are provided, they are
7172 additional argument types. The list of argument types must always
7173 be terminated by NULL_TREE. */
7176 build_function_type_list (tree return_type, ...)
7181 va_start (p, return_type);
7182 args = build_function_type_list_1 (false, return_type, p);
7187 /* Build a variable argument function type. The RETURN_TYPE is the
7188 type returned by the function. If additional arguments are provided,
7189 they are additional argument types. The list of argument types must
7190 always be terminated by NULL_TREE. */
7193 build_varargs_function_type_list (tree return_type, ...)
7198 va_start (p, return_type);
7199 args = build_function_type_list_1 (true, return_type, p);
7205 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7206 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7207 for the method. An implicit additional parameter (of type
7208 pointer-to-BASETYPE) is added to the ARGTYPES. */
7211 build_method_type_directly (tree basetype,
7218 bool any_structural_p, any_noncanonical_p;
7219 tree canon_argtypes;
7221 /* Make a node of the sort we want. */
7222 t = make_node (METHOD_TYPE);
7224 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7225 TREE_TYPE (t) = rettype;
7226 ptype = build_pointer_type (basetype);
7228 /* The actual arglist for this function includes a "hidden" argument
7229 which is "this". Put it into the list of argument types. */
7230 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
7231 TYPE_ARG_TYPES (t) = argtypes;
7233 /* If we already have such a type, use the old one. */
7234 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7235 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
7236 hashcode = type_hash_list (argtypes, hashcode);
7237 t = type_hash_canon (hashcode, t);
7239 /* Set up the canonical type. */
7241 = (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7242 || TYPE_STRUCTURAL_EQUALITY_P (rettype));
7244 = (TYPE_CANONICAL (basetype) != basetype
7245 || TYPE_CANONICAL (rettype) != rettype);
7246 canon_argtypes = maybe_canonicalize_argtypes (TREE_CHAIN (argtypes),
7248 &any_noncanonical_p);
7249 if (any_structural_p)
7250 SET_TYPE_STRUCTURAL_EQUALITY (t);
7251 else if (any_noncanonical_p)
7253 = build_method_type_directly (TYPE_CANONICAL (basetype),
7254 TYPE_CANONICAL (rettype),
7256 if (!COMPLETE_TYPE_P (t))
7262 /* Construct, lay out and return the type of methods belonging to class
7263 BASETYPE and whose arguments and values are described by TYPE.
7264 If that type exists already, reuse it.
7265 TYPE must be a FUNCTION_TYPE node. */
7268 build_method_type (tree basetype, tree type)
7270 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
7272 return build_method_type_directly (basetype,
7274 TYPE_ARG_TYPES (type));
7277 /* Construct, lay out and return the type of offsets to a value
7278 of type TYPE, within an object of type BASETYPE.
7279 If a suitable offset type exists already, reuse it. */
7282 build_offset_type (tree basetype, tree type)
7285 hashval_t hashcode = 0;
7287 /* Make a node of the sort we want. */
7288 t = make_node (OFFSET_TYPE);
7290 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
7291 TREE_TYPE (t) = type;
7293 /* If we already have such a type, use the old one. */
7294 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
7295 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
7296 t = type_hash_canon (hashcode, t);
7298 if (!COMPLETE_TYPE_P (t))
7301 if (TYPE_CANONICAL (t) == t)
7303 if (TYPE_STRUCTURAL_EQUALITY_P (basetype)
7304 || TYPE_STRUCTURAL_EQUALITY_P (type))
7305 SET_TYPE_STRUCTURAL_EQUALITY (t);
7306 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)) != basetype
7307 || TYPE_CANONICAL (type) != type)
7309 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype)),
7310 TYPE_CANONICAL (type));
7316 /* Create a complex type whose components are COMPONENT_TYPE. */
7319 build_complex_type (tree component_type)
7324 gcc_assert (INTEGRAL_TYPE_P (component_type)
7325 || SCALAR_FLOAT_TYPE_P (component_type)
7326 || FIXED_POINT_TYPE_P (component_type));
7328 /* Make a node of the sort we want. */
7329 t = make_node (COMPLEX_TYPE);
7331 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
7333 /* If we already have such a type, use the old one. */
7334 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
7335 t = type_hash_canon (hashcode, t);
7337 if (!COMPLETE_TYPE_P (t))
7340 if (TYPE_CANONICAL (t) == t)
7342 if (TYPE_STRUCTURAL_EQUALITY_P (component_type))
7343 SET_TYPE_STRUCTURAL_EQUALITY (t);
7344 else if (TYPE_CANONICAL (component_type) != component_type)
7346 = build_complex_type (TYPE_CANONICAL (component_type));
7349 /* We need to create a name, since complex is a fundamental type. */
7350 if (! TYPE_NAME (t))
7353 if (component_type == char_type_node)
7354 name = "complex char";
7355 else if (component_type == signed_char_type_node)
7356 name = "complex signed char";
7357 else if (component_type == unsigned_char_type_node)
7358 name = "complex unsigned char";
7359 else if (component_type == short_integer_type_node)
7360 name = "complex short int";
7361 else if (component_type == short_unsigned_type_node)
7362 name = "complex short unsigned int";
7363 else if (component_type == integer_type_node)
7364 name = "complex int";
7365 else if (component_type == unsigned_type_node)
7366 name = "complex unsigned int";
7367 else if (component_type == long_integer_type_node)
7368 name = "complex long int";
7369 else if (component_type == long_unsigned_type_node)
7370 name = "complex long unsigned int";
7371 else if (component_type == long_long_integer_type_node)
7372 name = "complex long long int";
7373 else if (component_type == long_long_unsigned_type_node)
7374 name = "complex long long unsigned int";
7379 TYPE_NAME (t) = build_decl (UNKNOWN_LOCATION, TYPE_DECL,
7380 get_identifier (name), t);
7383 return build_qualified_type (t, TYPE_QUALS (component_type));
7386 /* If TYPE is a real or complex floating-point type and the target
7387 does not directly support arithmetic on TYPE then return the wider
7388 type to be used for arithmetic on TYPE. Otherwise, return
7392 excess_precision_type (tree type)
7394 if (flag_excess_precision != EXCESS_PRECISION_FAST)
7396 int flt_eval_method = TARGET_FLT_EVAL_METHOD;
7397 switch (TREE_CODE (type))
7400 switch (flt_eval_method)
7403 if (TYPE_MODE (type) == TYPE_MODE (float_type_node))
7404 return double_type_node;
7407 if (TYPE_MODE (type) == TYPE_MODE (float_type_node)
7408 || TYPE_MODE (type) == TYPE_MODE (double_type_node))
7409 return long_double_type_node;
7416 if (TREE_CODE (TREE_TYPE (type)) != REAL_TYPE)
7418 switch (flt_eval_method)
7421 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node))
7422 return complex_double_type_node;
7425 if (TYPE_MODE (TREE_TYPE (type)) == TYPE_MODE (float_type_node)
7426 || (TYPE_MODE (TREE_TYPE (type))
7427 == TYPE_MODE (double_type_node)))
7428 return complex_long_double_type_node;
7441 /* Return OP, stripped of any conversions to wider types as much as is safe.
7442 Converting the value back to OP's type makes a value equivalent to OP.
7444 If FOR_TYPE is nonzero, we return a value which, if converted to
7445 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7447 OP must have integer, real or enumeral type. Pointers are not allowed!
7449 There are some cases where the obvious value we could return
7450 would regenerate to OP if converted to OP's type,
7451 but would not extend like OP to wider types.
7452 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7453 For example, if OP is (unsigned short)(signed char)-1,
7454 we avoid returning (signed char)-1 if FOR_TYPE is int,
7455 even though extending that to an unsigned short would regenerate OP,
7456 since the result of extending (signed char)-1 to (int)
7457 is different from (int) OP. */
7460 get_unwidened (tree op, tree for_type)
7462 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7463 tree type = TREE_TYPE (op);
7465 = TYPE_PRECISION (for_type != 0 ? for_type : type);
7467 = (for_type != 0 && for_type != type
7468 && final_prec > TYPE_PRECISION (type)
7469 && TYPE_UNSIGNED (type));
7472 while (CONVERT_EXPR_P (op))
7476 /* TYPE_PRECISION on vector types has different meaning
7477 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7478 so avoid them here. */
7479 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == VECTOR_TYPE)
7482 bitschange = TYPE_PRECISION (TREE_TYPE (op))
7483 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
7485 /* Truncations are many-one so cannot be removed.
7486 Unless we are later going to truncate down even farther. */
7488 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
7491 /* See what's inside this conversion. If we decide to strip it,
7493 op = TREE_OPERAND (op, 0);
7495 /* If we have not stripped any zero-extensions (uns is 0),
7496 we can strip any kind of extension.
7497 If we have previously stripped a zero-extension,
7498 only zero-extensions can safely be stripped.
7499 Any extension can be stripped if the bits it would produce
7500 are all going to be discarded later by truncating to FOR_TYPE. */
7504 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
7506 /* TYPE_UNSIGNED says whether this is a zero-extension.
7507 Let's avoid computing it if it does not affect WIN
7508 and if UNS will not be needed again. */
7510 || CONVERT_EXPR_P (op))
7511 && TYPE_UNSIGNED (TREE_TYPE (op)))
7522 /* Return OP or a simpler expression for a narrower value
7523 which can be sign-extended or zero-extended to give back OP.
7524 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7525 or 0 if the value should be sign-extended. */
7528 get_narrower (tree op, int *unsignedp_ptr)
7533 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
7535 while (TREE_CODE (op) == NOP_EXPR)
7538 = (TYPE_PRECISION (TREE_TYPE (op))
7539 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
7541 /* Truncations are many-one so cannot be removed. */
7545 /* See what's inside this conversion. If we decide to strip it,
7550 op = TREE_OPERAND (op, 0);
7551 /* An extension: the outermost one can be stripped,
7552 but remember whether it is zero or sign extension. */
7554 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7555 /* Otherwise, if a sign extension has been stripped,
7556 only sign extensions can now be stripped;
7557 if a zero extension has been stripped, only zero-extensions. */
7558 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
7562 else /* bitschange == 0 */
7564 /* A change in nominal type can always be stripped, but we must
7565 preserve the unsignedness. */
7567 uns = TYPE_UNSIGNED (TREE_TYPE (op));
7569 op = TREE_OPERAND (op, 0);
7570 /* Keep trying to narrow, but don't assign op to win if it
7571 would turn an integral type into something else. */
7572 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
7579 if (TREE_CODE (op) == COMPONENT_REF
7580 /* Since type_for_size always gives an integer type. */
7581 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
7582 && TREE_CODE (TREE_TYPE (op)) != FIXED_POINT_TYPE
7583 /* Ensure field is laid out already. */
7584 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
7585 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
7587 unsigned HOST_WIDE_INT innerprec
7588 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
7589 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
7590 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
7591 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
7593 /* We can get this structure field in a narrower type that fits it,
7594 but the resulting extension to its nominal type (a fullword type)
7595 must satisfy the same conditions as for other extensions.
7597 Do this only for fields that are aligned (not bit-fields),
7598 because when bit-field insns will be used there is no
7599 advantage in doing this. */
7601 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
7602 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
7603 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
7607 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
7608 win = fold_convert (type, op);
7612 *unsignedp_ptr = uns;
7616 /* Nonzero if integer constant C has a value that is permissible
7617 for type TYPE (an INTEGER_TYPE). */
7620 int_fits_type_p (const_tree c, const_tree type)
7622 tree type_low_bound, type_high_bound;
7623 bool ok_for_low_bound, ok_for_high_bound, unsc;
7626 dc = tree_to_double_int (c);
7627 unsc = TYPE_UNSIGNED (TREE_TYPE (c));
7629 if (TREE_CODE (TREE_TYPE (c)) == INTEGER_TYPE
7630 && TYPE_IS_SIZETYPE (TREE_TYPE (c))
7632 /* So c is an unsigned integer whose type is sizetype and type is not.
7633 sizetype'd integers are sign extended even though they are
7634 unsigned. If the integer value fits in the lower end word of c,
7635 and if the higher end word has all its bits set to 1, that
7636 means the higher end bits are set to 1 only for sign extension.
7637 So let's convert c into an equivalent zero extended unsigned
7639 dc = double_int_zext (dc, TYPE_PRECISION (TREE_TYPE (c)));
7642 type_low_bound = TYPE_MIN_VALUE (type);
7643 type_high_bound = TYPE_MAX_VALUE (type);
7645 /* If at least one bound of the type is a constant integer, we can check
7646 ourselves and maybe make a decision. If no such decision is possible, but
7647 this type is a subtype, try checking against that. Otherwise, use
7648 fit_double_type, which checks against the precision.
7650 Compute the status for each possibly constant bound, and return if we see
7651 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7652 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7653 for "constant known to fit". */
7655 /* Check if c >= type_low_bound. */
7656 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
7658 dd = tree_to_double_int (type_low_bound);
7659 if (TREE_CODE (type) == INTEGER_TYPE
7660 && TYPE_IS_SIZETYPE (type)
7661 && TYPE_UNSIGNED (type))
7662 dd = double_int_zext (dd, TYPE_PRECISION (type));
7663 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_low_bound)))
7665 int c_neg = (!unsc && double_int_negative_p (dc));
7666 int t_neg = (unsc && double_int_negative_p (dd));
7668 if (c_neg && !t_neg)
7670 if ((c_neg || !t_neg) && double_int_ucmp (dc, dd) < 0)
7673 else if (double_int_cmp (dc, dd, unsc) < 0)
7675 ok_for_low_bound = true;
7678 ok_for_low_bound = false;
7680 /* Check if c <= type_high_bound. */
7681 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
7683 dd = tree_to_double_int (type_high_bound);
7684 if (TREE_CODE (type) == INTEGER_TYPE
7685 && TYPE_IS_SIZETYPE (type)
7686 && TYPE_UNSIGNED (type))
7687 dd = double_int_zext (dd, TYPE_PRECISION (type));
7688 if (unsc != TYPE_UNSIGNED (TREE_TYPE (type_high_bound)))
7690 int c_neg = (!unsc && double_int_negative_p (dc));
7691 int t_neg = (unsc && double_int_negative_p (dd));
7693 if (t_neg && !c_neg)
7695 if ((t_neg || !c_neg) && double_int_ucmp (dc, dd) > 0)
7698 else if (double_int_cmp (dc, dd, unsc) > 0)
7700 ok_for_high_bound = true;
7703 ok_for_high_bound = false;
7705 /* If the constant fits both bounds, the result is known. */
7706 if (ok_for_low_bound && ok_for_high_bound)
7709 /* Perform some generic filtering which may allow making a decision
7710 even if the bounds are not constant. First, negative integers
7711 never fit in unsigned types, */
7712 if (TYPE_UNSIGNED (type) && !unsc && double_int_negative_p (dc))
7715 /* Second, narrower types always fit in wider ones. */
7716 if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c)))
7719 /* Third, unsigned integers with top bit set never fit signed types. */
7720 if (! TYPE_UNSIGNED (type) && unsc)
7722 int prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c))) - 1;
7723 if (prec < HOST_BITS_PER_WIDE_INT)
7725 if (((((unsigned HOST_WIDE_INT) 1) << prec) & dc.low) != 0)
7728 else if (((((unsigned HOST_WIDE_INT) 1)
7729 << (prec - HOST_BITS_PER_WIDE_INT)) & dc.high) != 0)
7733 /* If we haven't been able to decide at this point, there nothing more we
7734 can check ourselves here. Look at the base type if we have one and it
7735 has the same precision. */
7736 if (TREE_CODE (type) == INTEGER_TYPE
7737 && TREE_TYPE (type) != 0
7738 && TYPE_PRECISION (type) == TYPE_PRECISION (TREE_TYPE (type)))
7740 type = TREE_TYPE (type);
7744 /* Or to fit_double_type, if nothing else. */
7745 return !fit_double_type (dc.low, dc.high, &dc.low, &dc.high, type);
7748 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7749 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7750 represented (assuming two's-complement arithmetic) within the bit
7751 precision of the type are returned instead. */
7754 get_type_static_bounds (const_tree type, mpz_t min, mpz_t max)
7756 if (!POINTER_TYPE_P (type) && TYPE_MIN_VALUE (type)
7757 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
7758 mpz_set_double_int (min, tree_to_double_int (TYPE_MIN_VALUE (type)),
7759 TYPE_UNSIGNED (type));
7762 if (TYPE_UNSIGNED (type))
7763 mpz_set_ui (min, 0);
7767 mn = double_int_mask (TYPE_PRECISION (type) - 1);
7768 mn = double_int_sext (double_int_add (mn, double_int_one),
7769 TYPE_PRECISION (type));
7770 mpz_set_double_int (min, mn, false);
7774 if (!POINTER_TYPE_P (type) && TYPE_MAX_VALUE (type)
7775 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST)
7776 mpz_set_double_int (max, tree_to_double_int (TYPE_MAX_VALUE (type)),
7777 TYPE_UNSIGNED (type));
7780 if (TYPE_UNSIGNED (type))
7781 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type)),
7784 mpz_set_double_int (max, double_int_mask (TYPE_PRECISION (type) - 1),
7789 /* Return true if VAR is an automatic variable defined in function FN. */
7792 auto_var_in_fn_p (const_tree var, const_tree fn)
7794 return (DECL_P (var) && DECL_CONTEXT (var) == fn
7795 && (((TREE_CODE (var) == VAR_DECL || TREE_CODE (var) == PARM_DECL)
7796 && ! TREE_STATIC (var))
7797 || TREE_CODE (var) == LABEL_DECL
7798 || TREE_CODE (var) == RESULT_DECL));
7801 /* Subprogram of following function. Called by walk_tree.
7803 Return *TP if it is an automatic variable or parameter of the
7804 function passed in as DATA. */
7807 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
7809 tree fn = (tree) data;
7814 else if (DECL_P (*tp)
7815 && auto_var_in_fn_p (*tp, fn))
7821 /* Returns true if T is, contains, or refers to a type with variable
7822 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7823 arguments, but not the return type. If FN is nonzero, only return
7824 true if a modifier of the type or position of FN is a variable or
7825 parameter inside FN.
7827 This concept is more general than that of C99 'variably modified types':
7828 in C99, a struct type is never variably modified because a VLA may not
7829 appear as a structure member. However, in GNU C code like:
7831 struct S { int i[f()]; };
7833 is valid, and other languages may define similar constructs. */
7836 variably_modified_type_p (tree type, tree fn)
7840 /* Test if T is either variable (if FN is zero) or an expression containing
7841 a variable in FN. */
7842 #define RETURN_TRUE_IF_VAR(T) \
7843 do { tree _t = (T); \
7844 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7845 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7846 return true; } while (0)
7848 if (type == error_mark_node)
7851 /* If TYPE itself has variable size, it is variably modified. */
7852 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
7853 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type));
7855 switch (TREE_CODE (type))
7858 case REFERENCE_TYPE:
7860 if (variably_modified_type_p (TREE_TYPE (type), fn))
7866 /* If TYPE is a function type, it is variably modified if the
7867 return type is variably modified. */
7868 if (variably_modified_type_p (TREE_TYPE (type), fn))
7874 case FIXED_POINT_TYPE:
7877 /* Scalar types are variably modified if their end points
7879 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
7880 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
7885 case QUAL_UNION_TYPE:
7886 /* We can't see if any of the fields are variably-modified by the
7887 definition we normally use, since that would produce infinite
7888 recursion via pointers. */
7889 /* This is variably modified if some field's type is. */
7890 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
7891 if (TREE_CODE (t) == FIELD_DECL)
7893 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
7894 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
7895 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
7897 if (TREE_CODE (type) == QUAL_UNION_TYPE)
7898 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
7903 /* Do not call ourselves to avoid infinite recursion. This is
7904 variably modified if the element type is. */
7905 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type)));
7906 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type)));
7913 /* The current language may have other cases to check, but in general,
7914 all other types are not variably modified. */
7915 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
7917 #undef RETURN_TRUE_IF_VAR
7920 /* Given a DECL or TYPE, return the scope in which it was declared, or
7921 NULL_TREE if there is no containing scope. */
7924 get_containing_scope (const_tree t)
7926 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
7929 /* Return the innermost context enclosing DECL that is
7930 a FUNCTION_DECL, or zero if none. */
7933 decl_function_context (const_tree decl)
7937 if (TREE_CODE (decl) == ERROR_MARK)
7940 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
7941 where we look up the function at runtime. Such functions always take
7942 a first argument of type 'pointer to real context'.
7944 C++ should really be fixed to use DECL_CONTEXT for the real context,
7945 and use something else for the "virtual context". */
7946 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
7949 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
7951 context = DECL_CONTEXT (decl);
7953 while (context && TREE_CODE (context) != FUNCTION_DECL)
7955 if (TREE_CODE (context) == BLOCK)
7956 context = BLOCK_SUPERCONTEXT (context);
7958 context = get_containing_scope (context);
7964 /* Return the innermost context enclosing DECL that is
7965 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
7966 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
7969 decl_type_context (const_tree decl)
7971 tree context = DECL_CONTEXT (decl);
7974 switch (TREE_CODE (context))
7976 case NAMESPACE_DECL:
7977 case TRANSLATION_UNIT_DECL:
7982 case QUAL_UNION_TYPE:
7987 context = DECL_CONTEXT (context);
7991 context = BLOCK_SUPERCONTEXT (context);
8001 /* CALL is a CALL_EXPR. Return the declaration for the function
8002 called, or NULL_TREE if the called function cannot be
8006 get_callee_fndecl (const_tree call)
8010 if (call == error_mark_node)
8011 return error_mark_node;
8013 /* It's invalid to call this function with anything but a
8015 gcc_assert (TREE_CODE (call) == CALL_EXPR);
8017 /* The first operand to the CALL is the address of the function
8019 addr = CALL_EXPR_FN (call);
8023 /* If this is a readonly function pointer, extract its initial value. */
8024 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
8025 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
8026 && DECL_INITIAL (addr))
8027 addr = DECL_INITIAL (addr);
8029 /* If the address is just `&f' for some function `f', then we know
8030 that `f' is being called. */
8031 if (TREE_CODE (addr) == ADDR_EXPR
8032 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
8033 return TREE_OPERAND (addr, 0);
8035 /* We couldn't figure out what was being called. */
8039 /* Print debugging information about tree nodes generated during the compile,
8040 and any language-specific information. */
8043 dump_tree_statistics (void)
8045 #ifdef GATHER_STATISTICS
8047 int total_nodes, total_bytes;
8050 fprintf (stderr, "\n??? tree nodes created\n\n");
8051 #ifdef GATHER_STATISTICS
8052 fprintf (stderr, "Kind Nodes Bytes\n");
8053 fprintf (stderr, "---------------------------------------\n");
8054 total_nodes = total_bytes = 0;
8055 for (i = 0; i < (int) all_kinds; i++)
8057 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
8058 tree_node_counts[i], tree_node_sizes[i]);
8059 total_nodes += tree_node_counts[i];
8060 total_bytes += tree_node_sizes[i];
8062 fprintf (stderr, "---------------------------------------\n");
8063 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
8064 fprintf (stderr, "---------------------------------------\n");
8065 ssanames_print_statistics ();
8066 phinodes_print_statistics ();
8068 fprintf (stderr, "(No per-node statistics)\n");
8070 print_type_hash_statistics ();
8071 print_debug_expr_statistics ();
8072 print_value_expr_statistics ();
8073 lang_hooks.print_statistics ();
8076 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8078 /* Generate a crc32 of a string. */
8081 crc32_string (unsigned chksum, const char *string)
8085 unsigned value = *string << 24;
8088 for (ix = 8; ix--; value <<= 1)
8092 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
8101 /* P is a string that will be used in a symbol. Mask out any characters
8102 that are not valid in that context. */
8105 clean_symbol_name (char *p)
8109 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8112 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8119 /* Generate a name for a special-purpose function function.
8120 The generated name may need to be unique across the whole link.
8121 TYPE is some string to identify the purpose of this function to the
8122 linker or collect2; it must start with an uppercase letter,
8124 I - for constructors
8126 N - for C++ anonymous namespaces
8127 F - for DWARF unwind frame information. */
8130 get_file_function_name (const char *type)
8136 /* If we already have a name we know to be unique, just use that. */
8137 if (first_global_object_name)
8138 p = q = ASTRDUP (first_global_object_name);
8139 /* If the target is handling the constructors/destructors, they
8140 will be local to this file and the name is only necessary for
8141 debugging purposes. */
8142 else if ((type[0] == 'I' || type[0] == 'D') && targetm.have_ctors_dtors)
8144 const char *file = main_input_filename;
8146 file = input_filename;
8147 /* Just use the file's basename, because the full pathname
8148 might be quite long. */
8149 p = strrchr (file, '/');
8154 p = q = ASTRDUP (p);
8158 /* Otherwise, the name must be unique across the entire link.
8159 We don't have anything that we know to be unique to this translation
8160 unit, so use what we do have and throw in some randomness. */
8162 const char *name = weak_global_object_name;
8163 const char *file = main_input_filename;
8168 file = input_filename;
8170 len = strlen (file);
8171 q = (char *) alloca (9 * 2 + len + 1);
8172 memcpy (q, file, len + 1);
8174 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
8175 crc32_string (0, get_random_seed (false)));
8180 clean_symbol_name (q);
8181 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
8184 /* Set up the name of the file-level functions we may need.
8185 Use a global object (which is already required to be unique over
8186 the program) rather than the file name (which imposes extra
8188 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
8190 return get_identifier (buf);
8193 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8195 /* Complain that the tree code of NODE does not match the expected 0
8196 terminated list of trailing codes. The trailing code list can be
8197 empty, for a more vague error message. FILE, LINE, and FUNCTION
8198 are of the caller. */
8201 tree_check_failed (const_tree node, const char *file,
8202 int line, const char *function, ...)
8206 unsigned length = 0;
8209 va_start (args, function);
8210 while ((code = va_arg (args, int)))
8211 length += 4 + strlen (tree_code_name[code]);
8216 va_start (args, function);
8217 length += strlen ("expected ");
8218 buffer = tmp = (char *) alloca (length);
8220 while ((code = va_arg (args, int)))
8222 const char *prefix = length ? " or " : "expected ";
8224 strcpy (tmp + length, prefix);
8225 length += strlen (prefix);
8226 strcpy (tmp + length, tree_code_name[code]);
8227 length += strlen (tree_code_name[code]);
8232 buffer = "unexpected node";
8234 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8235 buffer, tree_code_name[TREE_CODE (node)],
8236 function, trim_filename (file), line);
8239 /* Complain that the tree code of NODE does match the expected 0
8240 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8244 tree_not_check_failed (const_tree node, const char *file,
8245 int line, const char *function, ...)
8249 unsigned length = 0;
8252 va_start (args, function);
8253 while ((code = va_arg (args, int)))
8254 length += 4 + strlen (tree_code_name[code]);
8256 va_start (args, function);
8257 buffer = (char *) alloca (length);
8259 while ((code = va_arg (args, int)))
8263 strcpy (buffer + length, " or ");
8266 strcpy (buffer + length, tree_code_name[code]);
8267 length += strlen (tree_code_name[code]);
8271 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8272 buffer, tree_code_name[TREE_CODE (node)],
8273 function, trim_filename (file), line);
8276 /* Similar to tree_check_failed, except that we check for a class of tree
8277 code, given in CL. */
8280 tree_class_check_failed (const_tree node, const enum tree_code_class cl,
8281 const char *file, int line, const char *function)
8284 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8285 TREE_CODE_CLASS_STRING (cl),
8286 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8287 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8290 /* Similar to tree_check_failed, except that instead of specifying a
8291 dozen codes, use the knowledge that they're all sequential. */
8294 tree_range_check_failed (const_tree node, const char *file, int line,
8295 const char *function, enum tree_code c1,
8299 unsigned length = 0;
8302 for (c = c1; c <= c2; ++c)
8303 length += 4 + strlen (tree_code_name[c]);
8305 length += strlen ("expected ");
8306 buffer = (char *) alloca (length);
8309 for (c = c1; c <= c2; ++c)
8311 const char *prefix = length ? " or " : "expected ";
8313 strcpy (buffer + length, prefix);
8314 length += strlen (prefix);
8315 strcpy (buffer + length, tree_code_name[c]);
8316 length += strlen (tree_code_name[c]);
8319 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8320 buffer, tree_code_name[TREE_CODE (node)],
8321 function, trim_filename (file), line);
8325 /* Similar to tree_check_failed, except that we check that a tree does
8326 not have the specified code, given in CL. */
8329 tree_not_class_check_failed (const_tree node, const enum tree_code_class cl,
8330 const char *file, int line, const char *function)
8333 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8334 TREE_CODE_CLASS_STRING (cl),
8335 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))),
8336 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8340 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8343 omp_clause_check_failed (const_tree node, const char *file, int line,
8344 const char *function, enum omp_clause_code code)
8346 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8347 omp_clause_code_name[code], tree_code_name[TREE_CODE (node)],
8348 function, trim_filename (file), line);
8352 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8355 omp_clause_range_check_failed (const_tree node, const char *file, int line,
8356 const char *function, enum omp_clause_code c1,
8357 enum omp_clause_code c2)
8360 unsigned length = 0;
8363 for (c = c1; c <= c2; ++c)
8364 length += 4 + strlen (omp_clause_code_name[c]);
8366 length += strlen ("expected ");
8367 buffer = (char *) alloca (length);
8370 for (c = c1; c <= c2; ++c)
8372 const char *prefix = length ? " or " : "expected ";
8374 strcpy (buffer + length, prefix);
8375 length += strlen (prefix);
8376 strcpy (buffer + length, omp_clause_code_name[c]);
8377 length += strlen (omp_clause_code_name[c]);
8380 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8381 buffer, omp_clause_code_name[TREE_CODE (node)],
8382 function, trim_filename (file), line);
8386 #undef DEFTREESTRUCT
8387 #define DEFTREESTRUCT(VAL, NAME) NAME,
8389 static const char *ts_enum_names[] = {
8390 #include "treestruct.def"
8392 #undef DEFTREESTRUCT
8394 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8396 /* Similar to tree_class_check_failed, except that we check for
8397 whether CODE contains the tree structure identified by EN. */
8400 tree_contains_struct_check_failed (const_tree node,
8401 const enum tree_node_structure_enum en,
8402 const char *file, int line,
8403 const char *function)
8406 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8408 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
8412 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8413 (dynamically sized) vector. */
8416 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
8417 const char *function)
8420 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8421 idx + 1, len, function, trim_filename (file), line);
8424 /* Similar to above, except that the check is for the bounds of the operand
8425 vector of an expression node EXP. */
8428 tree_operand_check_failed (int idx, const_tree exp, const char *file,
8429 int line, const char *function)
8431 int code = TREE_CODE (exp);
8433 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8434 idx + 1, tree_code_name[code], TREE_OPERAND_LENGTH (exp),
8435 function, trim_filename (file), line);
8438 /* Similar to above, except that the check is for the number of
8439 operands of an OMP_CLAUSE node. */
8442 omp_clause_operand_check_failed (int idx, const_tree t, const char *file,
8443 int line, const char *function)
8446 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8447 "in %s, at %s:%d", idx + 1, omp_clause_code_name[OMP_CLAUSE_CODE (t)],
8448 omp_clause_num_ops [OMP_CLAUSE_CODE (t)], function,
8449 trim_filename (file), line);
8451 #endif /* ENABLE_TREE_CHECKING */
8453 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8454 and mapped to the machine mode MODE. Initialize its fields and build
8455 the information necessary for debugging output. */
8458 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
8461 hashval_t hashcode = 0;
8463 t = make_node (VECTOR_TYPE);
8464 TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype);
8465 SET_TYPE_VECTOR_SUBPARTS (t, nunits);
8466 SET_TYPE_MODE (t, mode);
8468 if (TYPE_STRUCTURAL_EQUALITY_P (innertype))
8469 SET_TYPE_STRUCTURAL_EQUALITY (t);
8470 else if (TYPE_CANONICAL (innertype) != innertype
8471 || mode != VOIDmode)
8473 = make_vector_type (TYPE_CANONICAL (innertype), nunits, VOIDmode);
8478 tree index = build_int_cst (NULL_TREE, nunits - 1);
8479 tree array = build_array_type (TYPE_MAIN_VARIANT (innertype),
8480 build_index_type (index));
8481 tree rt = make_node (RECORD_TYPE);
8483 TYPE_FIELDS (rt) = build_decl (UNKNOWN_LOCATION, FIELD_DECL,
8484 get_identifier ("f"), array);
8485 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
8487 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
8488 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8489 the representation type, and we want to find that die when looking up
8490 the vector type. This is most easily achieved by making the TYPE_UID
8492 TYPE_UID (rt) = TYPE_UID (t);
8495 hashcode = iterative_hash_host_wide_int (VECTOR_TYPE, hashcode);
8496 hashcode = iterative_hash_host_wide_int (nunits, hashcode);
8497 hashcode = iterative_hash_host_wide_int (mode, hashcode);
8498 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (t)), hashcode);
8499 t = type_hash_canon (hashcode, t);
8501 /* We have built a main variant, based on the main variant of the
8502 inner type. Use it to build the variant we return. */
8503 if ((TYPE_ATTRIBUTES (innertype) || TYPE_QUALS (innertype))
8504 && TREE_TYPE (t) != innertype)
8505 return build_type_attribute_qual_variant (t,
8506 TYPE_ATTRIBUTES (innertype),
8507 TYPE_QUALS (innertype));
8513 make_or_reuse_type (unsigned size, int unsignedp)
8515 if (size == INT_TYPE_SIZE)
8516 return unsignedp ? unsigned_type_node : integer_type_node;
8517 if (size == CHAR_TYPE_SIZE)
8518 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
8519 if (size == SHORT_TYPE_SIZE)
8520 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
8521 if (size == LONG_TYPE_SIZE)
8522 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
8523 if (size == LONG_LONG_TYPE_SIZE)
8524 return (unsignedp ? long_long_unsigned_type_node
8525 : long_long_integer_type_node);
8528 return make_unsigned_type (size);
8530 return make_signed_type (size);
8533 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8536 make_or_reuse_fract_type (unsigned size, int unsignedp, int satp)
8540 if (size == SHORT_FRACT_TYPE_SIZE)
8541 return unsignedp ? sat_unsigned_short_fract_type_node
8542 : sat_short_fract_type_node;
8543 if (size == FRACT_TYPE_SIZE)
8544 return unsignedp ? sat_unsigned_fract_type_node : sat_fract_type_node;
8545 if (size == LONG_FRACT_TYPE_SIZE)
8546 return unsignedp ? sat_unsigned_long_fract_type_node
8547 : sat_long_fract_type_node;
8548 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8549 return unsignedp ? sat_unsigned_long_long_fract_type_node
8550 : sat_long_long_fract_type_node;
8554 if (size == SHORT_FRACT_TYPE_SIZE)
8555 return unsignedp ? unsigned_short_fract_type_node
8556 : short_fract_type_node;
8557 if (size == FRACT_TYPE_SIZE)
8558 return unsignedp ? unsigned_fract_type_node : fract_type_node;
8559 if (size == LONG_FRACT_TYPE_SIZE)
8560 return unsignedp ? unsigned_long_fract_type_node
8561 : long_fract_type_node;
8562 if (size == LONG_LONG_FRACT_TYPE_SIZE)
8563 return unsignedp ? unsigned_long_long_fract_type_node
8564 : long_long_fract_type_node;
8567 return make_fract_type (size, unsignedp, satp);
8570 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8573 make_or_reuse_accum_type (unsigned size, int unsignedp, int satp)
8577 if (size == SHORT_ACCUM_TYPE_SIZE)
8578 return unsignedp ? sat_unsigned_short_accum_type_node
8579 : sat_short_accum_type_node;
8580 if (size == ACCUM_TYPE_SIZE)
8581 return unsignedp ? sat_unsigned_accum_type_node : sat_accum_type_node;
8582 if (size == LONG_ACCUM_TYPE_SIZE)
8583 return unsignedp ? sat_unsigned_long_accum_type_node
8584 : sat_long_accum_type_node;
8585 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8586 return unsignedp ? sat_unsigned_long_long_accum_type_node
8587 : sat_long_long_accum_type_node;
8591 if (size == SHORT_ACCUM_TYPE_SIZE)
8592 return unsignedp ? unsigned_short_accum_type_node
8593 : short_accum_type_node;
8594 if (size == ACCUM_TYPE_SIZE)
8595 return unsignedp ? unsigned_accum_type_node : accum_type_node;
8596 if (size == LONG_ACCUM_TYPE_SIZE)
8597 return unsignedp ? unsigned_long_accum_type_node
8598 : long_accum_type_node;
8599 if (size == LONG_LONG_ACCUM_TYPE_SIZE)
8600 return unsignedp ? unsigned_long_long_accum_type_node
8601 : long_long_accum_type_node;
8604 return make_accum_type (size, unsignedp, satp);
8607 /* Create nodes for all integer types (and error_mark_node) using the sizes
8608 of C datatypes. The caller should call set_sizetype soon after calling
8609 this function to select one of the types as sizetype. */
8612 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
8614 error_mark_node = make_node (ERROR_MARK);
8615 TREE_TYPE (error_mark_node) = error_mark_node;
8617 initialize_sizetypes (signed_sizetype);
8619 /* Define both `signed char' and `unsigned char'. */
8620 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
8621 TYPE_STRING_FLAG (signed_char_type_node) = 1;
8622 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
8623 TYPE_STRING_FLAG (unsigned_char_type_node) = 1;
8625 /* Define `char', which is like either `signed char' or `unsigned char'
8626 but not the same as either. */
8629 ? make_signed_type (CHAR_TYPE_SIZE)
8630 : make_unsigned_type (CHAR_TYPE_SIZE));
8631 TYPE_STRING_FLAG (char_type_node) = 1;
8633 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
8634 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
8635 integer_type_node = make_signed_type (INT_TYPE_SIZE);
8636 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
8637 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
8638 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
8639 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
8640 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
8642 /* Define a boolean type. This type only represents boolean values but
8643 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8644 Front ends which want to override this size (i.e. Java) can redefine
8645 boolean_type_node before calling build_common_tree_nodes_2. */
8646 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
8647 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
8648 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
8649 TYPE_PRECISION (boolean_type_node) = 1;
8651 /* Fill in the rest of the sized types. Reuse existing type nodes
8653 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
8654 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
8655 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
8656 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
8657 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
8659 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
8660 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
8661 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
8662 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
8663 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
8665 access_public_node = get_identifier ("public");
8666 access_protected_node = get_identifier ("protected");
8667 access_private_node = get_identifier ("private");
8670 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8671 It will create several other common tree nodes. */
8674 build_common_tree_nodes_2 (int short_double)
8676 /* Define these next since types below may used them. */
8677 integer_zero_node = build_int_cst (NULL_TREE, 0);
8678 integer_one_node = build_int_cst (NULL_TREE, 1);
8679 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
8681 size_zero_node = size_int (0);
8682 size_one_node = size_int (1);
8683 bitsize_zero_node = bitsize_int (0);
8684 bitsize_one_node = bitsize_int (1);
8685 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
8687 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
8688 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
8690 void_type_node = make_node (VOID_TYPE);
8691 layout_type (void_type_node);
8693 /* We are not going to have real types in C with less than byte alignment,
8694 so we might as well not have any types that claim to have it. */
8695 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
8696 TYPE_USER_ALIGN (void_type_node) = 0;
8698 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
8699 layout_type (TREE_TYPE (null_pointer_node));
8701 ptr_type_node = build_pointer_type (void_type_node);
8703 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
8704 fileptr_type_node = ptr_type_node;
8706 float_type_node = make_node (REAL_TYPE);
8707 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
8708 layout_type (float_type_node);
8710 double_type_node = make_node (REAL_TYPE);
8712 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
8714 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
8715 layout_type (double_type_node);
8717 long_double_type_node = make_node (REAL_TYPE);
8718 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
8719 layout_type (long_double_type_node);
8721 float_ptr_type_node = build_pointer_type (float_type_node);
8722 double_ptr_type_node = build_pointer_type (double_type_node);
8723 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
8724 integer_ptr_type_node = build_pointer_type (integer_type_node);
8726 /* Fixed size integer types. */
8727 uint32_type_node = build_nonstandard_integer_type (32, true);
8728 uint64_type_node = build_nonstandard_integer_type (64, true);
8730 /* Decimal float types. */
8731 dfloat32_type_node = make_node (REAL_TYPE);
8732 TYPE_PRECISION (dfloat32_type_node) = DECIMAL32_TYPE_SIZE;
8733 layout_type (dfloat32_type_node);
8734 SET_TYPE_MODE (dfloat32_type_node, SDmode);
8735 dfloat32_ptr_type_node = build_pointer_type (dfloat32_type_node);
8737 dfloat64_type_node = make_node (REAL_TYPE);
8738 TYPE_PRECISION (dfloat64_type_node) = DECIMAL64_TYPE_SIZE;
8739 layout_type (dfloat64_type_node);
8740 SET_TYPE_MODE (dfloat64_type_node, DDmode);
8741 dfloat64_ptr_type_node = build_pointer_type (dfloat64_type_node);
8743 dfloat128_type_node = make_node (REAL_TYPE);
8744 TYPE_PRECISION (dfloat128_type_node) = DECIMAL128_TYPE_SIZE;
8745 layout_type (dfloat128_type_node);
8746 SET_TYPE_MODE (dfloat128_type_node, TDmode);
8747 dfloat128_ptr_type_node = build_pointer_type (dfloat128_type_node);
8749 complex_integer_type_node = build_complex_type (integer_type_node);
8750 complex_float_type_node = build_complex_type (float_type_node);
8751 complex_double_type_node = build_complex_type (double_type_node);
8752 complex_long_double_type_node = build_complex_type (long_double_type_node);
8754 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8755 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8756 sat_ ## KIND ## _type_node = \
8757 make_sat_signed_ ## KIND ## _type (SIZE); \
8758 sat_unsigned_ ## KIND ## _type_node = \
8759 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8760 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8761 unsigned_ ## KIND ## _type_node = \
8762 make_unsigned_ ## KIND ## _type (SIZE);
8764 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8765 sat_ ## WIDTH ## KIND ## _type_node = \
8766 make_sat_signed_ ## KIND ## _type (SIZE); \
8767 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8768 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8769 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8770 unsigned_ ## WIDTH ## KIND ## _type_node = \
8771 make_unsigned_ ## KIND ## _type (SIZE);
8773 /* Make fixed-point type nodes based on four different widths. */
8774 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8775 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8776 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8777 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8778 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8780 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8781 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8782 NAME ## _type_node = \
8783 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8784 u ## NAME ## _type_node = \
8785 make_or_reuse_unsigned_ ## KIND ## _type \
8786 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8787 sat_ ## NAME ## _type_node = \
8788 make_or_reuse_sat_signed_ ## KIND ## _type \
8789 (GET_MODE_BITSIZE (MODE ## mode)); \
8790 sat_u ## NAME ## _type_node = \
8791 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8792 (GET_MODE_BITSIZE (U ## MODE ## mode));
8794 /* Fixed-point type and mode nodes. */
8795 MAKE_FIXED_TYPE_NODE_FAMILY (fract, FRACT)
8796 MAKE_FIXED_TYPE_NODE_FAMILY (accum, ACCUM)
8797 MAKE_FIXED_MODE_NODE (fract, qq, QQ)
8798 MAKE_FIXED_MODE_NODE (fract, hq, HQ)
8799 MAKE_FIXED_MODE_NODE (fract, sq, SQ)
8800 MAKE_FIXED_MODE_NODE (fract, dq, DQ)
8801 MAKE_FIXED_MODE_NODE (fract, tq, TQ)
8802 MAKE_FIXED_MODE_NODE (accum, ha, HA)
8803 MAKE_FIXED_MODE_NODE (accum, sa, SA)
8804 MAKE_FIXED_MODE_NODE (accum, da, DA)
8805 MAKE_FIXED_MODE_NODE (accum, ta, TA)
8808 tree t = targetm.build_builtin_va_list ();
8810 /* Many back-ends define record types without setting TYPE_NAME.
8811 If we copied the record type here, we'd keep the original
8812 record type without a name. This breaks name mangling. So,
8813 don't copy record types and let c_common_nodes_and_builtins()
8814 declare the type to be __builtin_va_list. */
8815 if (TREE_CODE (t) != RECORD_TYPE)
8816 t = build_variant_type_copy (t);
8818 va_list_type_node = t;
8822 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8825 local_define_builtin (const char *name, tree type, enum built_in_function code,
8826 const char *library_name, int ecf_flags)
8830 decl = add_builtin_function (name, type, code, BUILT_IN_NORMAL,
8831 library_name, NULL_TREE);
8832 if (ecf_flags & ECF_CONST)
8833 TREE_READONLY (decl) = 1;
8834 if (ecf_flags & ECF_PURE)
8835 DECL_PURE_P (decl) = 1;
8836 if (ecf_flags & ECF_LOOPING_CONST_OR_PURE)
8837 DECL_LOOPING_CONST_OR_PURE_P (decl) = 1;
8838 if (ecf_flags & ECF_NORETURN)
8839 TREE_THIS_VOLATILE (decl) = 1;
8840 if (ecf_flags & ECF_NOTHROW)
8841 TREE_NOTHROW (decl) = 1;
8842 if (ecf_flags & ECF_MALLOC)
8843 DECL_IS_MALLOC (decl) = 1;
8845 built_in_decls[code] = decl;
8846 implicit_built_in_decls[code] = decl;
8849 /* Call this function after instantiating all builtins that the language
8850 front end cares about. This will build the rest of the builtins that
8851 are relied upon by the tree optimizers and the middle-end. */
8854 build_common_builtin_nodes (void)
8858 if (built_in_decls[BUILT_IN_MEMCPY] == NULL
8859 || built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8861 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8862 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8863 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8864 ftype = build_function_type (ptr_type_node, tmp);
8866 if (built_in_decls[BUILT_IN_MEMCPY] == NULL)
8867 local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY,
8868 "memcpy", ECF_NOTHROW);
8869 if (built_in_decls[BUILT_IN_MEMMOVE] == NULL)
8870 local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE,
8871 "memmove", ECF_NOTHROW);
8874 if (built_in_decls[BUILT_IN_MEMCMP] == NULL)
8876 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8877 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8878 tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp);
8879 ftype = build_function_type (integer_type_node, tmp);
8880 local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP,
8881 "memcmp", ECF_PURE | ECF_NOTHROW);
8884 if (built_in_decls[BUILT_IN_MEMSET] == NULL)
8886 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8887 tmp = tree_cons (NULL_TREE, integer_type_node, tmp);
8888 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8889 ftype = build_function_type (ptr_type_node, tmp);
8890 local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET,
8891 "memset", ECF_NOTHROW);
8894 if (built_in_decls[BUILT_IN_ALLOCA] == NULL)
8896 tmp = tree_cons (NULL_TREE, size_type_node, void_list_node);
8897 ftype = build_function_type (ptr_type_node, tmp);
8898 local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA,
8899 "alloca", ECF_NOTHROW | ECF_MALLOC);
8902 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8903 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8904 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8905 ftype = build_function_type (void_type_node, tmp);
8906 local_define_builtin ("__builtin_init_trampoline", ftype,
8907 BUILT_IN_INIT_TRAMPOLINE,
8908 "__builtin_init_trampoline", ECF_NOTHROW);
8910 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8911 ftype = build_function_type (ptr_type_node, tmp);
8912 local_define_builtin ("__builtin_adjust_trampoline", ftype,
8913 BUILT_IN_ADJUST_TRAMPOLINE,
8914 "__builtin_adjust_trampoline",
8915 ECF_CONST | ECF_NOTHROW);
8917 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8918 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8919 ftype = build_function_type (void_type_node, tmp);
8920 local_define_builtin ("__builtin_nonlocal_goto", ftype,
8921 BUILT_IN_NONLOCAL_GOTO,
8922 "__builtin_nonlocal_goto",
8923 ECF_NORETURN | ECF_NOTHROW);
8925 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8926 tmp = tree_cons (NULL_TREE, ptr_type_node, tmp);
8927 ftype = build_function_type (void_type_node, tmp);
8928 local_define_builtin ("__builtin_setjmp_setup", ftype,
8929 BUILT_IN_SETJMP_SETUP,
8930 "__builtin_setjmp_setup", ECF_NOTHROW);
8932 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8933 ftype = build_function_type (ptr_type_node, tmp);
8934 local_define_builtin ("__builtin_setjmp_dispatcher", ftype,
8935 BUILT_IN_SETJMP_DISPATCHER,
8936 "__builtin_setjmp_dispatcher",
8937 ECF_PURE | ECF_NOTHROW);
8939 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8940 ftype = build_function_type (void_type_node, tmp);
8941 local_define_builtin ("__builtin_setjmp_receiver", ftype,
8942 BUILT_IN_SETJMP_RECEIVER,
8943 "__builtin_setjmp_receiver", ECF_NOTHROW);
8945 ftype = build_function_type (ptr_type_node, void_list_node);
8946 local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE,
8947 "__builtin_stack_save", ECF_NOTHROW);
8949 tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
8950 ftype = build_function_type (void_type_node, tmp);
8951 local_define_builtin ("__builtin_stack_restore", ftype,
8952 BUILT_IN_STACK_RESTORE,
8953 "__builtin_stack_restore", ECF_NOTHROW);
8955 ftype = build_function_type (void_type_node, void_list_node);
8956 local_define_builtin ("__builtin_profile_func_enter", ftype,
8957 BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0);
8958 local_define_builtin ("__builtin_profile_func_exit", ftype,
8959 BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0);
8961 /* Complex multiplication and division. These are handled as builtins
8962 rather than optabs because emit_library_call_value doesn't support
8963 complex. Further, we can do slightly better with folding these
8964 beasties if the real and complex parts of the arguments are separate. */
8968 for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode)
8970 char mode_name_buf[4], *q;
8972 enum built_in_function mcode, dcode;
8973 tree type, inner_type;
8975 type = lang_hooks.types.type_for_mode ((enum machine_mode) mode, 0);
8978 inner_type = TREE_TYPE (type);
8980 tmp = tree_cons (NULL_TREE, inner_type, void_list_node);
8981 tmp = tree_cons (NULL_TREE, inner_type, tmp);
8982 tmp = tree_cons (NULL_TREE, inner_type, tmp);
8983 tmp = tree_cons (NULL_TREE, inner_type, tmp);
8984 ftype = build_function_type (type, tmp);
8986 mcode = ((enum built_in_function)
8987 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
8988 dcode = ((enum built_in_function)
8989 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
8991 for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++)
8995 built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL);
8996 local_define_builtin (built_in_names[mcode], ftype, mcode,
8997 built_in_names[mcode], ECF_CONST | ECF_NOTHROW);
8999 built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL);
9000 local_define_builtin (built_in_names[dcode], ftype, dcode,
9001 built_in_names[dcode], ECF_CONST | ECF_NOTHROW);
9006 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9009 If we requested a pointer to a vector, build up the pointers that
9010 we stripped off while looking for the inner type. Similarly for
9011 return values from functions.
9013 The argument TYPE is the top of the chain, and BOTTOM is the
9014 new type which we will point to. */
9017 reconstruct_complex_type (tree type, tree bottom)
9021 if (TREE_CODE (type) == POINTER_TYPE)
9023 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9024 outer = build_pointer_type_for_mode (inner, TYPE_MODE (type),
9025 TYPE_REF_CAN_ALIAS_ALL (type));
9027 else if (TREE_CODE (type) == REFERENCE_TYPE)
9029 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9030 outer = build_reference_type_for_mode (inner, TYPE_MODE (type),
9031 TYPE_REF_CAN_ALIAS_ALL (type));
9033 else if (TREE_CODE (type) == ARRAY_TYPE)
9035 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9036 outer = build_array_type (inner, TYPE_DOMAIN (type));
9038 else if (TREE_CODE (type) == FUNCTION_TYPE)
9040 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9041 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
9043 else if (TREE_CODE (type) == METHOD_TYPE)
9045 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9046 /* The build_method_type_directly() routine prepends 'this' to argument list,
9047 so we must compensate by getting rid of it. */
9049 = build_method_type_directly
9050 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))),
9052 TREE_CHAIN (TYPE_ARG_TYPES (type)));
9054 else if (TREE_CODE (type) == OFFSET_TYPE)
9056 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
9057 outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner);
9062 return build_qualified_type (outer, TYPE_QUALS (type));
9065 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9068 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
9072 switch (GET_MODE_CLASS (mode))
9074 case MODE_VECTOR_INT:
9075 case MODE_VECTOR_FLOAT:
9076 case MODE_VECTOR_FRACT:
9077 case MODE_VECTOR_UFRACT:
9078 case MODE_VECTOR_ACCUM:
9079 case MODE_VECTOR_UACCUM:
9080 nunits = GET_MODE_NUNITS (mode);
9084 /* Check that there are no leftover bits. */
9085 gcc_assert (GET_MODE_BITSIZE (mode)
9086 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
9088 nunits = GET_MODE_BITSIZE (mode)
9089 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
9096 return make_vector_type (innertype, nunits, mode);
9099 /* Similarly, but takes the inner type and number of units, which must be
9103 build_vector_type (tree innertype, int nunits)
9105 return make_vector_type (innertype, nunits, VOIDmode);
9108 /* Similarly, but takes the inner type and number of units, which must be
9112 build_opaque_vector_type (tree innertype, int nunits)
9115 innertype = build_distinct_type_copy (innertype);
9116 t = make_vector_type (innertype, nunits, VOIDmode);
9117 TYPE_VECTOR_OPAQUE (t) = true;
9122 /* Build RESX_EXPR with given REGION_NUMBER. */
9124 build_resx (int region_number)
9127 t = build1 (RESX_EXPR, void_type_node,
9128 build_int_cst (NULL_TREE, region_number));
9132 /* Given an initializer INIT, return TRUE if INIT is zero or some
9133 aggregate of zeros. Otherwise return FALSE. */
9135 initializer_zerop (const_tree init)
9141 switch (TREE_CODE (init))
9144 return integer_zerop (init);
9147 /* ??? Note that this is not correct for C4X float formats. There,
9148 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9149 negative exponent. */
9150 return real_zerop (init)
9151 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
9154 return fixed_zerop (init);
9157 return integer_zerop (init)
9158 || (real_zerop (init)
9159 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
9160 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
9163 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
9164 if (!initializer_zerop (TREE_VALUE (elt)))
9170 unsigned HOST_WIDE_INT idx;
9172 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init), idx, elt)
9173 if (!initializer_zerop (elt))
9183 /* Build an empty statement at location LOC. */
9186 build_empty_stmt (location_t loc)
9188 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
9189 SET_EXPR_LOCATION (t, loc);
9194 /* Build an OpenMP clause with code CODE. LOC is the location of the
9198 build_omp_clause (location_t loc, enum omp_clause_code code)
9203 length = omp_clause_num_ops[code];
9204 size = (sizeof (struct tree_omp_clause) + (length - 1) * sizeof (tree));
9206 t = GGC_NEWVAR (union tree_node, size);
9207 memset (t, 0, size);
9208 TREE_SET_CODE (t, OMP_CLAUSE);
9209 OMP_CLAUSE_SET_CODE (t, code);
9210 OMP_CLAUSE_LOCATION (t) = loc;
9212 #ifdef GATHER_STATISTICS
9213 tree_node_counts[(int) omp_clause_kind]++;
9214 tree_node_sizes[(int) omp_clause_kind] += size;
9220 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9221 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9222 Except for the CODE and operand count field, other storage for the
9223 object is initialized to zeros. */
9226 build_vl_exp_stat (enum tree_code code, int len MEM_STAT_DECL)
9229 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_exp);
9231 gcc_assert (TREE_CODE_CLASS (code) == tcc_vl_exp);
9232 gcc_assert (len >= 1);
9234 #ifdef GATHER_STATISTICS
9235 tree_node_counts[(int) e_kind]++;
9236 tree_node_sizes[(int) e_kind] += length;
9239 t = (tree) ggc_alloc_zone_pass_stat (length, &tree_zone);
9241 memset (t, 0, length);
9243 TREE_SET_CODE (t, code);
9245 /* Can't use TREE_OPERAND to store the length because if checking is
9246 enabled, it will try to check the length before we store it. :-P */
9247 t->exp.operands[0] = build_int_cst (sizetype, len);
9253 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9254 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9258 build_call_list (tree return_type, tree fn, tree arglist)
9263 t = build_vl_exp (CALL_EXPR, list_length (arglist) + 3);
9264 TREE_TYPE (t) = return_type;
9265 CALL_EXPR_FN (t) = fn;
9266 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9267 for (i = 0; arglist; arglist = TREE_CHAIN (arglist), i++)
9268 CALL_EXPR_ARG (t, i) = TREE_VALUE (arglist);
9269 process_call_operands (t);
9273 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9274 FN and a null static chain slot. NARGS is the number of call arguments
9275 which are specified as "..." arguments. */
9278 build_call_nary (tree return_type, tree fn, int nargs, ...)
9282 va_start (args, nargs);
9283 ret = build_call_valist (return_type, fn, nargs, args);
9288 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9289 FN and a null static chain slot. NARGS is the number of call arguments
9290 which are specified as a va_list ARGS. */
9293 build_call_valist (tree return_type, tree fn, int nargs, va_list args)
9298 t = build_vl_exp (CALL_EXPR, nargs + 3);
9299 TREE_TYPE (t) = return_type;
9300 CALL_EXPR_FN (t) = fn;
9301 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9302 for (i = 0; i < nargs; i++)
9303 CALL_EXPR_ARG (t, i) = va_arg (args, tree);
9304 process_call_operands (t);
9308 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9309 FN and a null static chain slot. NARGS is the number of call arguments
9310 which are specified as a tree array ARGS. */
9313 build_call_array_loc (location_t loc, tree return_type, tree fn,
9314 int nargs, const tree *args)
9319 t = build_vl_exp (CALL_EXPR, nargs + 3);
9320 TREE_TYPE (t) = return_type;
9321 CALL_EXPR_FN (t) = fn;
9322 CALL_EXPR_STATIC_CHAIN (t) = NULL_TREE;
9323 for (i = 0; i < nargs; i++)
9324 CALL_EXPR_ARG (t, i) = args[i];
9325 process_call_operands (t);
9326 SET_EXPR_LOCATION (t, loc);
9330 /* Like build_call_array, but takes a VEC. */
9333 build_call_vec (tree return_type, tree fn, VEC(tree,gc) *args)
9338 ret = build_vl_exp (CALL_EXPR, VEC_length (tree, args) + 3);
9339 TREE_TYPE (ret) = return_type;
9340 CALL_EXPR_FN (ret) = fn;
9341 CALL_EXPR_STATIC_CHAIN (ret) = NULL_TREE;
9342 for (ix = 0; VEC_iterate (tree, args, ix, t); ++ix)
9343 CALL_EXPR_ARG (ret, ix) = t;
9344 process_call_operands (ret);
9349 /* Returns true if it is possible to prove that the index of
9350 an array access REF (an ARRAY_REF expression) falls into the
9354 in_array_bounds_p (tree ref)
9356 tree idx = TREE_OPERAND (ref, 1);
9359 if (TREE_CODE (idx) != INTEGER_CST)
9362 min = array_ref_low_bound (ref);
9363 max = array_ref_up_bound (ref);
9366 || TREE_CODE (min) != INTEGER_CST
9367 || TREE_CODE (max) != INTEGER_CST)
9370 if (tree_int_cst_lt (idx, min)
9371 || tree_int_cst_lt (max, idx))
9377 /* Returns true if it is possible to prove that the range of
9378 an array access REF (an ARRAY_RANGE_REF expression) falls
9379 into the array bounds. */
9382 range_in_array_bounds_p (tree ref)
9384 tree domain_type = TYPE_DOMAIN (TREE_TYPE (ref));
9385 tree range_min, range_max, min, max;
9387 range_min = TYPE_MIN_VALUE (domain_type);
9388 range_max = TYPE_MAX_VALUE (domain_type);
9391 || TREE_CODE (range_min) != INTEGER_CST
9392 || TREE_CODE (range_max) != INTEGER_CST)
9395 min = array_ref_low_bound (ref);
9396 max = array_ref_up_bound (ref);
9399 || TREE_CODE (min) != INTEGER_CST
9400 || TREE_CODE (max) != INTEGER_CST)
9403 if (tree_int_cst_lt (range_min, min)
9404 || tree_int_cst_lt (max, range_max))
9410 /* Return true if T (assumed to be a DECL) must be assigned a memory
9414 needs_to_live_in_memory (const_tree t)
9416 if (TREE_CODE (t) == SSA_NAME)
9417 t = SSA_NAME_VAR (t);
9419 return (TREE_ADDRESSABLE (t)
9420 || is_global_var (t)
9421 || (TREE_CODE (t) == RESULT_DECL
9422 && aggregate_value_p (t, current_function_decl)));
9425 /* There are situations in which a language considers record types
9426 compatible which have different field lists. Decide if two fields
9427 are compatible. It is assumed that the parent records are compatible. */
9430 fields_compatible_p (const_tree f1, const_tree f2)
9432 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
9433 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
9436 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
9437 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
9440 if (!types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
9446 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9449 find_compatible_field (tree record, tree orig_field)
9453 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
9454 if (TREE_CODE (f) == FIELD_DECL
9455 && fields_compatible_p (f, orig_field))
9458 /* ??? Why isn't this on the main fields list? */
9459 f = TYPE_VFIELD (record);
9460 if (f && TREE_CODE (f) == FIELD_DECL
9461 && fields_compatible_p (f, orig_field))
9464 /* ??? We should abort here, but Java appears to do Bad Things
9465 with inherited fields. */
9469 /* Return value of a constant X and sign-extend it. */
9472 int_cst_value (const_tree x)
9474 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9475 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
9477 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9478 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9479 || TREE_INT_CST_HIGH (x) == -1);
9481 if (bits < HOST_BITS_PER_WIDE_INT)
9483 bool negative = ((val >> (bits - 1)) & 1) != 0;
9485 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
9487 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
9493 /* Return value of a constant X and sign-extend it. */
9496 widest_int_cst_value (const_tree x)
9498 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
9499 unsigned HOST_WIDEST_INT val = TREE_INT_CST_LOW (x);
9501 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9502 gcc_assert (HOST_BITS_PER_WIDEST_INT >= 2 * HOST_BITS_PER_WIDE_INT);
9503 val |= (((unsigned HOST_WIDEST_INT) TREE_INT_CST_HIGH (x))
9504 << HOST_BITS_PER_WIDE_INT);
9506 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9507 gcc_assert (TREE_INT_CST_HIGH (x) == 0
9508 || TREE_INT_CST_HIGH (x) == -1);
9511 if (bits < HOST_BITS_PER_WIDEST_INT)
9513 bool negative = ((val >> (bits - 1)) & 1) != 0;
9515 val |= (~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1;
9517 val &= ~((~(unsigned HOST_WIDEST_INT) 0) << (bits - 1) << 1);
9523 /* If TYPE is an integral type, return an equivalent type which is
9524 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9525 return TYPE itself. */
9528 signed_or_unsigned_type_for (int unsignedp, tree type)
9531 if (POINTER_TYPE_P (type))
9534 if (!INTEGRAL_TYPE_P (t) || TYPE_UNSIGNED (t) == unsignedp)
9537 return lang_hooks.types.type_for_size (TYPE_PRECISION (t), unsignedp);
9540 /* Returns unsigned variant of TYPE. */
9543 unsigned_type_for (tree type)
9545 return signed_or_unsigned_type_for (1, type);
9548 /* Returns signed variant of TYPE. */
9551 signed_type_for (tree type)
9553 return signed_or_unsigned_type_for (0, type);
9556 /* Returns the largest value obtainable by casting something in INNER type to
9560 upper_bound_in_type (tree outer, tree inner)
9562 unsigned HOST_WIDE_INT lo, hi;
9563 unsigned int det = 0;
9564 unsigned oprec = TYPE_PRECISION (outer);
9565 unsigned iprec = TYPE_PRECISION (inner);
9568 /* Compute a unique number for every combination. */
9569 det |= (oprec > iprec) ? 4 : 0;
9570 det |= TYPE_UNSIGNED (outer) ? 2 : 0;
9571 det |= TYPE_UNSIGNED (inner) ? 1 : 0;
9573 /* Determine the exponent to use. */
9578 /* oprec <= iprec, outer: signed, inner: don't care. */
9583 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9587 /* oprec > iprec, outer: signed, inner: signed. */
9591 /* oprec > iprec, outer: signed, inner: unsigned. */
9595 /* oprec > iprec, outer: unsigned, inner: signed. */
9599 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9606 /* Compute 2^^prec - 1. */
9607 if (prec <= HOST_BITS_PER_WIDE_INT)
9610 lo = ((~(unsigned HOST_WIDE_INT) 0)
9611 >> (HOST_BITS_PER_WIDE_INT - prec));
9615 hi = ((~(unsigned HOST_WIDE_INT) 0)
9616 >> (2 * HOST_BITS_PER_WIDE_INT - prec));
9617 lo = ~(unsigned HOST_WIDE_INT) 0;
9620 return build_int_cst_wide (outer, lo, hi);
9623 /* Returns the smallest value obtainable by casting something in INNER type to
9627 lower_bound_in_type (tree outer, tree inner)
9629 unsigned HOST_WIDE_INT lo, hi;
9630 unsigned oprec = TYPE_PRECISION (outer);
9631 unsigned iprec = TYPE_PRECISION (inner);
9633 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9635 if (TYPE_UNSIGNED (outer)
9636 /* If we are widening something of an unsigned type, OUTER type
9637 contains all values of INNER type. In particular, both INNER
9638 and OUTER types have zero in common. */
9639 || (oprec > iprec && TYPE_UNSIGNED (inner)))
9643 /* If we are widening a signed type to another signed type, we
9644 want to obtain -2^^(iprec-1). If we are keeping the
9645 precision or narrowing to a signed type, we want to obtain
9647 unsigned prec = oprec > iprec ? iprec : oprec;
9649 if (prec <= HOST_BITS_PER_WIDE_INT)
9651 hi = ~(unsigned HOST_WIDE_INT) 0;
9652 lo = (~(unsigned HOST_WIDE_INT) 0) << (prec - 1);
9656 hi = ((~(unsigned HOST_WIDE_INT) 0)
9657 << (prec - HOST_BITS_PER_WIDE_INT - 1));
9662 return build_int_cst_wide (outer, lo, hi);
9665 /* Return nonzero if two operands that are suitable for PHI nodes are
9666 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9667 SSA_NAME or invariant. Note that this is strictly an optimization.
9668 That is, callers of this function can directly call operand_equal_p
9669 and get the same result, only slower. */
9672 operand_equal_for_phi_arg_p (const_tree arg0, const_tree arg1)
9676 if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME)
9678 return operand_equal_p (arg0, arg1, 0);
9681 /* Returns number of zeros at the end of binary representation of X.
9683 ??? Use ffs if available? */
9686 num_ending_zeros (const_tree x)
9688 unsigned HOST_WIDE_INT fr, nfr;
9689 unsigned num, abits;
9690 tree type = TREE_TYPE (x);
9692 if (TREE_INT_CST_LOW (x) == 0)
9694 num = HOST_BITS_PER_WIDE_INT;
9695 fr = TREE_INT_CST_HIGH (x);
9700 fr = TREE_INT_CST_LOW (x);
9703 for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2)
9706 if (nfr << abits == fr)
9713 if (num > TYPE_PRECISION (type))
9714 num = TYPE_PRECISION (type);
9716 return build_int_cst_type (type, num);
9720 #define WALK_SUBTREE(NODE) \
9723 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9729 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9730 be walked whenever a type is seen in the tree. Rest of operands and return
9731 value are as for walk_tree. */
9734 walk_type_fields (tree type, walk_tree_fn func, void *data,
9735 struct pointer_set_t *pset, walk_tree_lh lh)
9737 tree result = NULL_TREE;
9739 switch (TREE_CODE (type))
9742 case REFERENCE_TYPE:
9743 /* We have to worry about mutually recursive pointers. These can't
9744 be written in C. They can in Ada. It's pathological, but
9745 there's an ACATS test (c38102a) that checks it. Deal with this
9746 by checking if we're pointing to another pointer, that one
9747 points to another pointer, that one does too, and we have no htab.
9748 If so, get a hash table. We check three levels deep to avoid
9749 the cost of the hash table if we don't need one. */
9750 if (POINTER_TYPE_P (TREE_TYPE (type))
9751 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type)))
9752 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type))))
9755 result = walk_tree_without_duplicates (&TREE_TYPE (type),
9763 /* ... fall through ... */
9766 WALK_SUBTREE (TREE_TYPE (type));
9770 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type));
9775 WALK_SUBTREE (TREE_TYPE (type));
9779 /* We never want to walk into default arguments. */
9780 for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg))
9781 WALK_SUBTREE (TREE_VALUE (arg));
9786 /* Don't follow this nodes's type if a pointer for fear that
9787 we'll have infinite recursion. If we have a PSET, then we
9790 || (!POINTER_TYPE_P (TREE_TYPE (type))
9791 && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE))
9792 WALK_SUBTREE (TREE_TYPE (type));
9793 WALK_SUBTREE (TYPE_DOMAIN (type));
9797 WALK_SUBTREE (TREE_TYPE (type));
9798 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type));
9808 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9809 called with the DATA and the address of each sub-tree. If FUNC returns a
9810 non-NULL value, the traversal is stopped, and the value returned by FUNC
9811 is returned. If PSET is non-NULL it is used to record the nodes visited,
9812 and to avoid visiting a node more than once. */
9815 walk_tree_1 (tree *tp, walk_tree_fn func, void *data,
9816 struct pointer_set_t *pset, walk_tree_lh lh)
9818 enum tree_code code;
9822 #define WALK_SUBTREE_TAIL(NODE) \
9826 goto tail_recurse; \
9831 /* Skip empty subtrees. */
9835 /* Don't walk the same tree twice, if the user has requested
9836 that we avoid doing so. */
9837 if (pset && pointer_set_insert (pset, *tp))
9840 /* Call the function. */
9842 result = (*func) (tp, &walk_subtrees, data);
9844 /* If we found something, return it. */
9848 code = TREE_CODE (*tp);
9850 /* Even if we didn't, FUNC may have decided that there was nothing
9851 interesting below this point in the tree. */
9854 /* But we still need to check our siblings. */
9855 if (code == TREE_LIST)
9856 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
9857 else if (code == OMP_CLAUSE)
9858 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9865 result = (*lh) (tp, &walk_subtrees, func, data, pset);
9866 if (result || !walk_subtrees)
9873 case IDENTIFIER_NODE:
9880 case PLACEHOLDER_EXPR:
9884 /* None of these have subtrees other than those already walked
9889 WALK_SUBTREE (TREE_VALUE (*tp));
9890 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp));
9895 int len = TREE_VEC_LENGTH (*tp);
9900 /* Walk all elements but the first. */
9902 WALK_SUBTREE (TREE_VEC_ELT (*tp, len));
9904 /* Now walk the first one as a tail call. */
9905 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0));
9909 WALK_SUBTREE (TREE_REALPART (*tp));
9910 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp));
9914 unsigned HOST_WIDE_INT idx;
9915 constructor_elt *ce;
9918 VEC_iterate(constructor_elt, CONSTRUCTOR_ELTS (*tp), idx, ce);
9920 WALK_SUBTREE (ce->value);
9925 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0));
9930 for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl))
9932 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
9933 into declarations that are just mentioned, rather than
9934 declared; they don't really belong to this part of the tree.
9935 And, we can see cycles: the initializer for a declaration
9936 can refer to the declaration itself. */
9937 WALK_SUBTREE (DECL_INITIAL (decl));
9938 WALK_SUBTREE (DECL_SIZE (decl));
9939 WALK_SUBTREE (DECL_SIZE_UNIT (decl));
9941 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp));
9944 case STATEMENT_LIST:
9946 tree_stmt_iterator i;
9947 for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i))
9948 WALK_SUBTREE (*tsi_stmt_ptr (i));
9953 switch (OMP_CLAUSE_CODE (*tp))
9955 case OMP_CLAUSE_PRIVATE:
9956 case OMP_CLAUSE_SHARED:
9957 case OMP_CLAUSE_FIRSTPRIVATE:
9958 case OMP_CLAUSE_COPYIN:
9959 case OMP_CLAUSE_COPYPRIVATE:
9961 case OMP_CLAUSE_NUM_THREADS:
9962 case OMP_CLAUSE_SCHEDULE:
9963 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, 0));
9966 case OMP_CLAUSE_NOWAIT:
9967 case OMP_CLAUSE_ORDERED:
9968 case OMP_CLAUSE_DEFAULT:
9969 case OMP_CLAUSE_UNTIED:
9970 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9972 case OMP_CLAUSE_LASTPRIVATE:
9973 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp));
9974 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp));
9975 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9977 case OMP_CLAUSE_COLLAPSE:
9980 for (i = 0; i < 3; i++)
9981 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
9982 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
9985 case OMP_CLAUSE_REDUCTION:
9988 for (i = 0; i < 4; i++)
9989 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp, i));
9990 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp));
10002 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10003 But, we only want to walk once. */
10004 len = (TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) ? 2 : 3;
10005 for (i = 0; i < len; ++i)
10006 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10007 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len));
10011 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10012 defining. We only want to walk into these fields of a type in this
10013 case and not in the general case of a mere reference to the type.
10015 The criterion is as follows: if the field can be an expression, it
10016 must be walked only here. This should be in keeping with the fields
10017 that are directly gimplified in gimplify_type_sizes in order for the
10018 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10019 variable-sized types.
10021 Note that DECLs get walked as part of processing the BIND_EXPR. */
10022 if (TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL)
10024 tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp));
10025 if (TREE_CODE (*type_p) == ERROR_MARK)
10028 /* Call the function for the type. See if it returns anything or
10029 doesn't want us to continue. If we are to continue, walk both
10030 the normal fields and those for the declaration case. */
10031 result = (*func) (type_p, &walk_subtrees, data);
10032 if (result || !walk_subtrees)
10035 result = walk_type_fields (*type_p, func, data, pset, lh);
10039 /* If this is a record type, also walk the fields. */
10040 if (TREE_CODE (*type_p) == RECORD_TYPE
10041 || TREE_CODE (*type_p) == UNION_TYPE
10042 || TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10046 for (field = TYPE_FIELDS (*type_p); field;
10047 field = TREE_CHAIN (field))
10049 /* We'd like to look at the type of the field, but we can
10050 easily get infinite recursion. So assume it's pointed
10051 to elsewhere in the tree. Also, ignore things that
10053 if (TREE_CODE (field) != FIELD_DECL)
10056 WALK_SUBTREE (DECL_FIELD_OFFSET (field));
10057 WALK_SUBTREE (DECL_SIZE (field));
10058 WALK_SUBTREE (DECL_SIZE_UNIT (field));
10059 if (TREE_CODE (*type_p) == QUAL_UNION_TYPE)
10060 WALK_SUBTREE (DECL_QUALIFIER (field));
10064 /* Same for scalar types. */
10065 else if (TREE_CODE (*type_p) == BOOLEAN_TYPE
10066 || TREE_CODE (*type_p) == ENUMERAL_TYPE
10067 || TREE_CODE (*type_p) == INTEGER_TYPE
10068 || TREE_CODE (*type_p) == FIXED_POINT_TYPE
10069 || TREE_CODE (*type_p) == REAL_TYPE)
10071 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p));
10072 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p));
10075 WALK_SUBTREE (TYPE_SIZE (*type_p));
10076 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p));
10081 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)))
10085 /* Walk over all the sub-trees of this operand. */
10086 len = TREE_OPERAND_LENGTH (*tp);
10088 /* Go through the subtrees. We need to do this in forward order so
10089 that the scope of a FOR_EXPR is handled properly. */
10092 for (i = 0; i < len - 1; ++i)
10093 WALK_SUBTREE (TREE_OPERAND (*tp, i));
10094 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1));
10097 /* If this is a type, walk the needed fields in the type. */
10098 else if (TYPE_P (*tp))
10099 return walk_type_fields (*tp, func, data, pset, lh);
10103 /* We didn't find what we were looking for. */
10106 #undef WALK_SUBTREE_TAIL
10108 #undef WALK_SUBTREE
10110 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10113 walk_tree_without_duplicates_1 (tree *tp, walk_tree_fn func, void *data,
10117 struct pointer_set_t *pset;
10119 pset = pointer_set_create ();
10120 result = walk_tree_1 (tp, func, data, pset, lh);
10121 pointer_set_destroy (pset);
10127 tree_block (tree t)
10129 char const c = TREE_CODE_CLASS (TREE_CODE (t));
10131 if (IS_EXPR_CODE_CLASS (c))
10132 return &t->exp.block;
10133 gcc_unreachable ();
10137 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10138 FIXME: don't use this function. It exists for compatibility with
10139 the old representation of CALL_EXPRs where a list was used to hold the
10140 arguments. Places that currently extract the arglist from a CALL_EXPR
10141 ought to be rewritten to use the CALL_EXPR itself. */
10143 call_expr_arglist (tree exp)
10145 tree arglist = NULL_TREE;
10147 for (i = call_expr_nargs (exp) - 1; i >= 0; i--)
10148 arglist = tree_cons (NULL_TREE, CALL_EXPR_ARG (exp, i), arglist);
10153 /* Create a nameless artificial label and put it in the current
10154 function context. The label has a location of LOC. Returns the
10155 newly created label. */
10158 create_artificial_label (location_t loc)
10160 tree lab = build_decl (loc,
10161 LABEL_DECL, NULL_TREE, void_type_node);
10163 DECL_ARTIFICIAL (lab) = 1;
10164 DECL_IGNORED_P (lab) = 1;
10165 DECL_CONTEXT (lab) = current_function_decl;
10169 /* Given a tree, try to return a useful variable name that we can use
10170 to prefix a temporary that is being assigned the value of the tree.
10171 I.E. given <temp> = &A, return A. */
10176 tree stripped_decl;
10179 STRIP_NOPS (stripped_decl);
10180 if (DECL_P (stripped_decl) && DECL_NAME (stripped_decl))
10181 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl));
10184 switch (TREE_CODE (stripped_decl))
10187 return get_name (TREE_OPERAND (stripped_decl, 0));
10194 /* Return true if TYPE has a variable argument list. */
10197 stdarg_p (tree fntype)
10199 function_args_iterator args_iter;
10200 tree n = NULL_TREE, t;
10205 FOREACH_FUNCTION_ARGS(fntype, t, args_iter)
10210 return n != NULL_TREE && n != void_type_node;
10213 /* Return true if TYPE has a prototype. */
10216 prototype_p (tree fntype)
10220 gcc_assert (fntype != NULL_TREE);
10222 t = TYPE_ARG_TYPES (fntype);
10223 return (t != NULL_TREE);
10226 /* If BLOCK is inlined from an __attribute__((__artificial__))
10227 routine, return pointer to location from where it has been
10230 block_nonartificial_location (tree block)
10232 location_t *ret = NULL;
10234 while (block && TREE_CODE (block) == BLOCK
10235 && BLOCK_ABSTRACT_ORIGIN (block))
10237 tree ao = BLOCK_ABSTRACT_ORIGIN (block);
10239 while (TREE_CODE (ao) == BLOCK
10240 && BLOCK_ABSTRACT_ORIGIN (ao)
10241 && BLOCK_ABSTRACT_ORIGIN (ao) != ao)
10242 ao = BLOCK_ABSTRACT_ORIGIN (ao);
10244 if (TREE_CODE (ao) == FUNCTION_DECL)
10246 /* If AO is an artificial inline, point RET to the
10247 call site locus at which it has been inlined and continue
10248 the loop, in case AO's caller is also an artificial
10250 if (DECL_DECLARED_INLINE_P (ao)
10251 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao)))
10252 ret = &BLOCK_SOURCE_LOCATION (block);
10256 else if (TREE_CODE (ao) != BLOCK)
10259 block = BLOCK_SUPERCONTEXT (block);
10265 /* If EXP is inlined from an __attribute__((__artificial__))
10266 function, return the location of the original call expression. */
10269 tree_nonartificial_location (tree exp)
10271 location_t *loc = block_nonartificial_location (TREE_BLOCK (exp));
10276 return EXPR_LOCATION (exp);
10280 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10283 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10286 cl_option_hash_hash (const void *x)
10288 const_tree const t = (const_tree) x;
10292 hashval_t hash = 0;
10294 if (TREE_CODE (t) == OPTIMIZATION_NODE)
10296 p = (const char *)TREE_OPTIMIZATION (t);
10297 len = sizeof (struct cl_optimization);
10300 else if (TREE_CODE (t) == TARGET_OPTION_NODE)
10302 p = (const char *)TREE_TARGET_OPTION (t);
10303 len = sizeof (struct cl_target_option);
10307 gcc_unreachable ();
10309 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10311 for (i = 0; i < len; i++)
10313 hash = (hash << 4) ^ ((i << 2) | p[i]);
10318 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10319 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10323 cl_option_hash_eq (const void *x, const void *y)
10325 const_tree const xt = (const_tree) x;
10326 const_tree const yt = (const_tree) y;
10331 if (TREE_CODE (xt) != TREE_CODE (yt))
10334 if (TREE_CODE (xt) == OPTIMIZATION_NODE)
10336 xp = (const char *)TREE_OPTIMIZATION (xt);
10337 yp = (const char *)TREE_OPTIMIZATION (yt);
10338 len = sizeof (struct cl_optimization);
10341 else if (TREE_CODE (xt) == TARGET_OPTION_NODE)
10343 xp = (const char *)TREE_TARGET_OPTION (xt);
10344 yp = (const char *)TREE_TARGET_OPTION (yt);
10345 len = sizeof (struct cl_target_option);
10349 gcc_unreachable ();
10351 return (memcmp (xp, yp, len) == 0);
10354 /* Build an OPTIMIZATION_NODE based on the current options. */
10357 build_optimization_node (void)
10362 /* Use the cache of optimization nodes. */
10364 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node));
10366 slot = htab_find_slot (cl_option_hash_table, cl_optimization_node, INSERT);
10370 /* Insert this one into the hash table. */
10371 t = cl_optimization_node;
10374 /* Make a new node for next time round. */
10375 cl_optimization_node = make_node (OPTIMIZATION_NODE);
10381 /* Build a TARGET_OPTION_NODE based on the current options. */
10384 build_target_option_node (void)
10389 /* Use the cache of optimization nodes. */
10391 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node));
10393 slot = htab_find_slot (cl_option_hash_table, cl_target_option_node, INSERT);
10397 /* Insert this one into the hash table. */
10398 t = cl_target_option_node;
10401 /* Make a new node for next time round. */
10402 cl_target_option_node = make_node (TARGET_OPTION_NODE);
10408 /* Determine the "ultimate origin" of a block. The block may be an inlined
10409 instance of an inlined instance of a block which is local to an inline
10410 function, so we have to trace all of the way back through the origin chain
10411 to find out what sort of node actually served as the original seed for the
10415 block_ultimate_origin (const_tree block)
10417 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
10419 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10420 nodes in the function to point to themselves; ignore that if
10421 we're trying to output the abstract instance of this function. */
10422 if (BLOCK_ABSTRACT (block) && immediate_origin == block)
10425 if (immediate_origin == NULL_TREE)
10430 tree lookahead = immediate_origin;
10434 ret_val = lookahead;
10435 lookahead = (TREE_CODE (ret_val) == BLOCK
10436 ? BLOCK_ABSTRACT_ORIGIN (ret_val) : NULL);
10438 while (lookahead != NULL && lookahead != ret_val);
10440 /* The block's abstract origin chain may not be the *ultimate* origin of
10441 the block. It could lead to a DECL that has an abstract origin set.
10442 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10443 will give us if it has one). Note that DECL's abstract origins are
10444 supposed to be the most distant ancestor (or so decl_ultimate_origin
10445 claims), so we don't need to loop following the DECL origins. */
10446 if (DECL_P (ret_val))
10447 return DECL_ORIGIN (ret_val);
10453 /* Return true if T1 and T2 are equivalent lists. */
10456 list_equal_p (const_tree t1, const_tree t2)
10458 for (; t1 && t2; t1 = TREE_CHAIN (t1) , t2 = TREE_CHAIN (t2))
10459 if (TREE_VALUE (t1) != TREE_VALUE (t2))
10464 /* Return true iff conversion in EXP generates no instruction. Mark
10465 it inline so that we fully inline into the stripping functions even
10466 though we have two uses of this function. */
10469 tree_nop_conversion (const_tree exp)
10471 tree outer_type, inner_type;
10473 if (!CONVERT_EXPR_P (exp)
10474 && TREE_CODE (exp) != NON_LVALUE_EXPR)
10476 if (TREE_OPERAND (exp, 0) == error_mark_node)
10479 outer_type = TREE_TYPE (exp);
10480 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10482 /* Use precision rather then machine mode when we can, which gives
10483 the correct answer even for submode (bit-field) types. */
10484 if ((INTEGRAL_TYPE_P (outer_type)
10485 || POINTER_TYPE_P (outer_type)
10486 || TREE_CODE (outer_type) == OFFSET_TYPE)
10487 && (INTEGRAL_TYPE_P (inner_type)
10488 || POINTER_TYPE_P (inner_type)
10489 || TREE_CODE (inner_type) == OFFSET_TYPE))
10490 return TYPE_PRECISION (outer_type) == TYPE_PRECISION (inner_type);
10492 /* Otherwise fall back on comparing machine modes (e.g. for
10493 aggregate types, floats). */
10494 return TYPE_MODE (outer_type) == TYPE_MODE (inner_type);
10497 /* Return true iff conversion in EXP generates no instruction. Don't
10498 consider conversions changing the signedness. */
10501 tree_sign_nop_conversion (const_tree exp)
10503 tree outer_type, inner_type;
10505 if (!tree_nop_conversion (exp))
10508 outer_type = TREE_TYPE (exp);
10509 inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
10511 return (TYPE_UNSIGNED (outer_type) == TYPE_UNSIGNED (inner_type)
10512 && POINTER_TYPE_P (outer_type) == POINTER_TYPE_P (inner_type));
10515 /* Strip conversions from EXP according to tree_nop_conversion and
10516 return the resulting expression. */
10519 tree_strip_nop_conversions (tree exp)
10521 while (tree_nop_conversion (exp))
10522 exp = TREE_OPERAND (exp, 0);
10526 /* Strip conversions from EXP according to tree_sign_nop_conversion
10527 and return the resulting expression. */
10530 tree_strip_sign_nop_conversions (tree exp)
10532 while (tree_sign_nop_conversion (exp))
10533 exp = TREE_OPERAND (exp, 0);
10538 #include "gt-tree.h"