1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type
[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length
[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name
[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings
[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts
[(int) all_kinds
];
127 int tree_node_sizes
[(int) all_kinds
];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names
[] = {
148 #endif /* GATHER_STATISTICS */
150 /* Unique id for next decl created. */
151 static GTY(()) int next_decl_uid
;
152 /* Unique id for next type created. */
153 static GTY(()) int next_type_uid
= 1;
154 /* Unique id for next debug decl created. Use negative numbers,
155 to catch erroneous uses. */
156 static GTY(()) int next_debug_decl_uid
;
158 /* Since we cannot rehash a type after it is in the table, we have to
159 keep the hash code. */
161 struct GTY(()) type_hash
{
166 /* Initial size of the hash table (rounded to next prime). */
167 #define TYPE_HASH_INITIAL_SIZE 1000
169 /* Now here is the hash table. When recording a type, it is added to
170 the slot whose index is the hash code. Note that the hash table is
171 used for several kinds of types (function types, array types and
172 array index range types, for now). While all these live in the
173 same table, they are completely independent, and the hash code is
174 computed differently for each of these. */
176 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
177 htab_t type_hash_table
;
179 /* Hash table and temporary node for larger integer const values. */
180 static GTY (()) tree int_cst_node
;
181 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
182 htab_t int_cst_hash_table
;
184 /* Hash table for optimization flags and target option flags. Use the same
185 hash table for both sets of options. Nodes for building the current
186 optimization and target option nodes. The assumption is most of the time
187 the options created will already be in the hash table, so we avoid
188 allocating and freeing up a node repeatably. */
189 static GTY (()) tree cl_optimization_node
;
190 static GTY (()) tree cl_target_option_node
;
191 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
192 htab_t cl_option_hash_table
;
194 /* General tree->tree mapping structure for use in hash tables. */
197 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
198 htab_t debug_expr_for_decl
;
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
201 htab_t value_expr_for_decl
;
203 static GTY ((if_marked ("tree_priority_map_marked_p"),
204 param_is (struct tree_priority_map
)))
205 htab_t init_priority_for_decl
;
207 static void set_type_quals (tree
, int);
208 static int type_hash_eq (const void *, const void *);
209 static hashval_t
type_hash_hash (const void *);
210 static hashval_t
int_cst_hash_hash (const void *);
211 static int int_cst_hash_eq (const void *, const void *);
212 static hashval_t
cl_option_hash_hash (const void *);
213 static int cl_option_hash_eq (const void *, const void *);
214 static void print_type_hash_statistics (void);
215 static void print_debug_expr_statistics (void);
216 static void print_value_expr_statistics (void);
217 static int type_hash_marked_p (const void *);
218 static unsigned int type_hash_list (const_tree
, hashval_t
);
219 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
221 tree global_trees
[TI_MAX
];
222 tree integer_types
[itk_none
];
224 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
226 /* Number of operands for each OpenMP clause. */
227 unsigned const char omp_clause_num_ops
[] =
229 0, /* OMP_CLAUSE_ERROR */
230 1, /* OMP_CLAUSE_PRIVATE */
231 1, /* OMP_CLAUSE_SHARED */
232 1, /* OMP_CLAUSE_FIRSTPRIVATE */
233 2, /* OMP_CLAUSE_LASTPRIVATE */
234 4, /* OMP_CLAUSE_REDUCTION */
235 1, /* OMP_CLAUSE_COPYIN */
236 1, /* OMP_CLAUSE_COPYPRIVATE */
237 1, /* OMP_CLAUSE_IF */
238 1, /* OMP_CLAUSE_NUM_THREADS */
239 1, /* OMP_CLAUSE_SCHEDULE */
240 0, /* OMP_CLAUSE_NOWAIT */
241 0, /* OMP_CLAUSE_ORDERED */
242 0, /* OMP_CLAUSE_DEFAULT */
243 3, /* OMP_CLAUSE_COLLAPSE */
244 0 /* OMP_CLAUSE_UNTIED */
247 const char * const omp_clause_code_name
[] =
268 /* Return the tree node structure used by tree code CODE. */
270 static inline enum tree_node_structure_enum
271 tree_node_structure_for_code (enum tree_code code
)
273 switch (TREE_CODE_CLASS (code
))
275 case tcc_declaration
:
280 return TS_FIELD_DECL
;
286 return TS_LABEL_DECL
;
288 return TS_RESULT_DECL
;
289 case DEBUG_EXPR_DECL
:
292 return TS_CONST_DECL
;
296 return TS_FUNCTION_DECL
;
297 case TRANSLATION_UNIT_DECL
:
298 return TS_TRANSLATION_UNIT_DECL
;
300 return TS_DECL_NON_COMMON
;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST
: return TS_INT_CST
;
320 case REAL_CST
: return TS_REAL_CST
;
321 case FIXED_CST
: return TS_FIXED_CST
;
322 case COMPLEX_CST
: return TS_COMPLEX
;
323 case VECTOR_CST
: return TS_VECTOR
;
324 case STRING_CST
: return TS_STRING
;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK
: return TS_COMMON
;
327 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
328 case TREE_LIST
: return TS_LIST
;
329 case TREE_VEC
: return TS_VEC
;
330 case SSA_NAME
: return TS_SSA_NAME
;
331 case PLACEHOLDER_EXPR
: return TS_COMMON
;
332 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
333 case BLOCK
: return TS_BLOCK
;
334 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
335 case TREE_BINFO
: return TS_BINFO
;
336 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
337 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
338 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
398 enum tree_node_structure_enum ts_code
;
400 code
= (enum tree_code
) i
;
401 ts_code
= tree_node_structure_for_code (code
);
403 /* Mark the TS structure itself. */
404 tree_contains_struct
[code
][ts_code
] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL
:
428 case TS_STATEMENT_LIST
:
431 case TS_OPTIMIZATION
:
432 case TS_TARGET_OPTION
:
433 MARK_TS_COMMON (code
);
437 MARK_TS_DECL_MINIMAL (code
);
441 MARK_TS_DECL_COMMON (code
);
444 case TS_DECL_NON_COMMON
:
445 MARK_TS_DECL_WITH_VIS (code
);
448 case TS_DECL_WITH_VIS
:
453 MARK_TS_DECL_WRTL (code
);
457 MARK_TS_DECL_COMMON (code
);
461 MARK_TS_DECL_WITH_VIS (code
);
465 case TS_FUNCTION_DECL
:
466 MARK_TS_DECL_NON_COMMON (code
);
469 case TS_TRANSLATION_UNIT_DECL
:
470 MARK_TS_DECL_COMMON (code
);
478 /* Basic consistency checks for attributes used in fold. */
479 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
480 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
481 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
482 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
483 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
484 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
485 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
486 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
487 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
488 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
489 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
490 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
]);
491 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
492 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
493 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
494 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
495 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
496 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
498 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
499 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
500 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
502 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
503 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
504 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
505 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
506 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
507 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
508 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
509 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
510 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
511 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
512 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
513 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
514 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
515 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
516 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
517 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
520 #undef MARK_TS_COMMON
521 #undef MARK_TS_DECL_MINIMAL
522 #undef MARK_TS_DECL_COMMON
523 #undef MARK_TS_DECL_WRTL
524 #undef MARK_TS_DECL_WITH_VIS
525 #undef MARK_TS_DECL_NON_COMMON
534 /* Initialize the hash table of types. */
535 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
538 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
539 tree_decl_map_eq
, 0);
541 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
542 tree_decl_map_eq
, 0);
543 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
544 tree_priority_map_eq
, 0);
546 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
547 int_cst_hash_eq
, NULL
);
549 int_cst_node
= make_node (INTEGER_CST
);
551 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
552 cl_option_hash_eq
, NULL
);
554 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
555 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
557 /* Initialize the tree_contains_struct array. */
558 initialize_tree_contains_struct ();
559 lang_hooks
.init_ts ();
563 /* The name of the object as the assembler will see it (but before any
564 translations made by ASM_OUTPUT_LABELREF). Often this is the same
565 as DECL_NAME. It is an IDENTIFIER_NODE. */
567 decl_assembler_name (tree decl
)
569 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
570 lang_hooks
.set_decl_assembler_name (decl
);
571 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
574 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
577 decl_assembler_name_equal (tree decl
, const_tree asmname
)
579 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
580 const char *decl_str
;
581 const char *asmname_str
;
584 if (decl_asmname
== asmname
)
587 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
588 asmname_str
= IDENTIFIER_POINTER (asmname
);
591 /* If the target assembler name was set by the user, things are trickier.
592 We have a leading '*' to begin with. After that, it's arguable what
593 is the correct thing to do with -fleading-underscore. Arguably, we've
594 historically been doing the wrong thing in assemble_alias by always
595 printing the leading underscore. Since we're not changing that, make
596 sure user_label_prefix follows the '*' before matching. */
597 if (decl_str
[0] == '*')
599 size_t ulp_len
= strlen (user_label_prefix
);
605 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
606 decl_str
+= ulp_len
, test
=true;
610 if (asmname_str
[0] == '*')
612 size_t ulp_len
= strlen (user_label_prefix
);
618 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
619 asmname_str
+= ulp_len
, test
=true;
626 return strcmp (decl_str
, asmname_str
) == 0;
629 /* Hash asmnames ignoring the user specified marks. */
632 decl_assembler_name_hash (const_tree asmname
)
634 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
636 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
637 size_t ulp_len
= strlen (user_label_prefix
);
641 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
644 return htab_hash_string (decl_str
);
647 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
650 /* Compute the number of bytes occupied by a tree with code CODE.
651 This function cannot be used for nodes that have variable sizes,
652 including TREE_VEC, STRING_CST, and CALL_EXPR. */
654 tree_code_size (enum tree_code code
)
656 switch (TREE_CODE_CLASS (code
))
658 case tcc_declaration
: /* A decl node */
663 return sizeof (struct tree_field_decl
);
665 return sizeof (struct tree_parm_decl
);
667 return sizeof (struct tree_var_decl
);
669 return sizeof (struct tree_label_decl
);
671 return sizeof (struct tree_result_decl
);
673 return sizeof (struct tree_const_decl
);
675 return sizeof (struct tree_type_decl
);
677 return sizeof (struct tree_function_decl
);
678 case DEBUG_EXPR_DECL
:
679 return sizeof (struct tree_decl_with_rtl
);
681 return sizeof (struct tree_decl_non_common
);
685 case tcc_type
: /* a type node */
686 return sizeof (struct tree_type
);
688 case tcc_reference
: /* a reference */
689 case tcc_expression
: /* an expression */
690 case tcc_statement
: /* an expression with side effects */
691 case tcc_comparison
: /* a comparison expression */
692 case tcc_unary
: /* a unary arithmetic expression */
693 case tcc_binary
: /* a binary arithmetic expression */
694 return (sizeof (struct tree_exp
)
695 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
697 case tcc_constant
: /* a constant */
700 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
701 case REAL_CST
: return sizeof (struct tree_real_cst
);
702 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
703 case COMPLEX_CST
: return sizeof (struct tree_complex
);
704 case VECTOR_CST
: return sizeof (struct tree_vector
);
705 case STRING_CST
: gcc_unreachable ();
707 return lang_hooks
.tree_size (code
);
710 case tcc_exceptional
: /* something random, like an identifier. */
713 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
714 case TREE_LIST
: return sizeof (struct tree_list
);
717 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
720 case OMP_CLAUSE
: gcc_unreachable ();
722 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
724 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
725 case BLOCK
: return sizeof (struct tree_block
);
726 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
727 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
728 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
731 return lang_hooks
.tree_size (code
);
739 /* Compute the number of bytes occupied by NODE. This routine only
740 looks at TREE_CODE, except for those nodes that have variable sizes. */
742 tree_size (const_tree node
)
744 const enum tree_code code
= TREE_CODE (node
);
748 return (offsetof (struct tree_binfo
, base_binfos
)
749 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
752 return (sizeof (struct tree_vec
)
753 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
756 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
759 return (sizeof (struct tree_omp_clause
)
760 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
764 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
765 return (sizeof (struct tree_exp
)
766 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
768 return tree_code_size (code
);
772 /* Return a newly allocated node of code CODE. For decl and type
773 nodes, some other fields are initialized. The rest of the node is
774 initialized to zero. This function cannot be used for TREE_VEC or
775 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
777 Achoo! I got a code in the node. */
780 make_node_stat (enum tree_code code MEM_STAT_DECL
)
783 enum tree_code_class type
= TREE_CODE_CLASS (code
);
784 size_t length
= tree_code_size (code
);
785 #ifdef GATHER_STATISTICS
790 case tcc_declaration
: /* A decl node */
794 case tcc_type
: /* a type node */
798 case tcc_statement
: /* an expression with side effects */
802 case tcc_reference
: /* a reference */
806 case tcc_expression
: /* an expression */
807 case tcc_comparison
: /* a comparison expression */
808 case tcc_unary
: /* a unary arithmetic expression */
809 case tcc_binary
: /* a binary arithmetic expression */
813 case tcc_constant
: /* a constant */
817 case tcc_exceptional
: /* something random, like an identifier. */
820 case IDENTIFIER_NODE
:
833 kind
= ssa_name_kind
;
854 tree_node_counts
[(int) kind
]++;
855 tree_node_sizes
[(int) kind
] += length
;
858 t
= ggc_alloc_zone_cleared_tree_node_stat (
859 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
860 length PASS_MEM_STAT
);
861 TREE_SET_CODE (t
, code
);
866 TREE_SIDE_EFFECTS (t
) = 1;
869 case tcc_declaration
:
870 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
872 if (code
== FUNCTION_DECL
)
874 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
875 DECL_MODE (t
) = FUNCTION_MODE
;
880 DECL_SOURCE_LOCATION (t
) = input_location
;
881 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
882 DECL_UID (t
) = --next_debug_decl_uid
;
885 DECL_UID (t
) = next_decl_uid
++;
886 SET_DECL_PT_UID (t
, -1);
888 if (TREE_CODE (t
) == LABEL_DECL
)
889 LABEL_DECL_UID (t
) = -1;
894 TYPE_UID (t
) = next_type_uid
++;
895 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
896 TYPE_USER_ALIGN (t
) = 0;
897 TYPE_MAIN_VARIANT (t
) = t
;
898 TYPE_CANONICAL (t
) = t
;
900 /* Default to no attributes for type, but let target change that. */
901 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
902 targetm
.set_default_type_attributes (t
);
904 /* We have not yet computed the alias set for this type. */
905 TYPE_ALIAS_SET (t
) = -1;
909 TREE_CONSTANT (t
) = 1;
918 case PREDECREMENT_EXPR
:
919 case PREINCREMENT_EXPR
:
920 case POSTDECREMENT_EXPR
:
921 case POSTINCREMENT_EXPR
:
922 /* All of these have side-effects, no matter what their
924 TREE_SIDE_EFFECTS (t
) = 1;
933 /* Other classes need no special treatment. */
940 /* Return a new node with the same contents as NODE except that its
941 TREE_CHAIN is zero and it has a fresh uid. */
944 copy_node_stat (tree node MEM_STAT_DECL
)
947 enum tree_code code
= TREE_CODE (node
);
950 gcc_assert (code
!= STATEMENT_LIST
);
952 length
= tree_size (node
);
953 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
954 memcpy (t
, node
, length
);
957 TREE_ASM_WRITTEN (t
) = 0;
958 TREE_VISITED (t
) = 0;
959 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
960 *DECL_VAR_ANN_PTR (t
) = 0;
962 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
964 if (code
== DEBUG_EXPR_DECL
)
965 DECL_UID (t
) = --next_debug_decl_uid
;
968 DECL_UID (t
) = next_decl_uid
++;
969 if (DECL_PT_UID_SET_P (node
))
970 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
972 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
973 && DECL_HAS_VALUE_EXPR_P (node
))
975 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
976 DECL_HAS_VALUE_EXPR_P (t
) = 1;
978 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
980 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
981 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
984 else if (TREE_CODE_CLASS (code
) == tcc_type
)
986 TYPE_UID (t
) = next_type_uid
++;
987 /* The following is so that the debug code for
988 the copy is different from the original type.
989 The two statements usually duplicate each other
990 (because they clear fields of the same union),
991 but the optimizer should catch that. */
992 TYPE_SYMTAB_POINTER (t
) = 0;
993 TYPE_SYMTAB_ADDRESS (t
) = 0;
995 /* Do not copy the values cache. */
996 if (TYPE_CACHED_VALUES_P(t
))
998 TYPE_CACHED_VALUES_P (t
) = 0;
999 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1006 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1007 For example, this can copy a list made of TREE_LIST nodes. */
1010 copy_list (tree list
)
1018 head
= prev
= copy_node (list
);
1019 next
= TREE_CHAIN (list
);
1022 TREE_CHAIN (prev
) = copy_node (next
);
1023 prev
= TREE_CHAIN (prev
);
1024 next
= TREE_CHAIN (next
);
1030 /* Create an INT_CST node with a LOW value sign extended. */
1033 build_int_cst (tree type
, HOST_WIDE_INT low
)
1035 /* Support legacy code. */
1037 type
= integer_type_node
;
1039 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1042 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1043 if it is negative. This function is similar to build_int_cst, but
1044 the extra bits outside of the type precision are cleared. Constants
1045 with these extra bits may confuse the fold so that it detects overflows
1046 even in cases when they do not occur, and in general should be avoided.
1047 We cannot however make this a default behavior of build_int_cst without
1048 more intrusive changes, since there are parts of gcc that rely on the extra
1049 precision of the integer constants. */
1052 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1056 return double_int_to_tree (type
, shwi_to_double_int (low
));
1059 /* Constructs tree in type TYPE from with value given by CST. Signedness
1060 of CST is assumed to be the same as the signedness of TYPE. */
1063 double_int_to_tree (tree type
, double_int cst
)
1065 /* Size types *are* sign extended. */
1066 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1067 || (TREE_CODE (type
) == INTEGER_TYPE
1068 && TYPE_IS_SIZETYPE (type
)));
1070 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1072 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1075 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1076 to be the same as the signedness of TYPE. */
1079 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1081 /* Size types *are* sign extended. */
1082 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1083 || (TREE_CODE (type
) == INTEGER_TYPE
1084 && TYPE_IS_SIZETYPE (type
)));
1087 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1089 return double_int_equal_p (cst
, ext
);
1092 /* We force the double_int CST to the range of the type TYPE by sign or
1093 zero extending it. OVERFLOWABLE indicates if we are interested in
1094 overflow of the value, when >0 we are only interested in signed
1095 overflow, for <0 we are interested in any overflow. OVERFLOWED
1096 indicates whether overflow has already occurred. CONST_OVERFLOWED
1097 indicates whether constant overflow has already occurred. We force
1098 T's value to be within range of T's type (by setting to 0 or 1 all
1099 the bits outside the type's range). We set TREE_OVERFLOWED if,
1100 OVERFLOWED is nonzero,
1101 or OVERFLOWABLE is >0 and signed overflow occurs
1102 or OVERFLOWABLE is <0 and any overflow occurs
1103 We return a new tree node for the extended double_int. The node
1104 is shared if no overflow flags are set. */
1108 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1111 bool sign_extended_type
;
1113 /* Size types *are* sign extended. */
1114 sign_extended_type
= (!TYPE_UNSIGNED (type
)
1115 || (TREE_CODE (type
) == INTEGER_TYPE
1116 && TYPE_IS_SIZETYPE (type
)));
1118 /* If we need to set overflow flags, return a new unshared node. */
1119 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1123 || (overflowable
> 0 && sign_extended_type
))
1125 tree t
= make_node (INTEGER_CST
);
1126 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1127 !sign_extended_type
);
1128 TREE_TYPE (t
) = type
;
1129 TREE_OVERFLOW (t
) = 1;
1134 /* Else build a shared node. */
1135 return double_int_to_tree (type
, cst
);
1138 /* These are the hash table functions for the hash table of INTEGER_CST
1139 nodes of a sizetype. */
1141 /* Return the hash code code X, an INTEGER_CST. */
1144 int_cst_hash_hash (const void *x
)
1146 const_tree
const t
= (const_tree
) x
;
1148 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1149 ^ htab_hash_pointer (TREE_TYPE (t
)));
1152 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1153 is the same as that given by *Y, which is the same. */
1156 int_cst_hash_eq (const void *x
, const void *y
)
1158 const_tree
const xt
= (const_tree
) x
;
1159 const_tree
const yt
= (const_tree
) y
;
1161 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1162 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1163 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1166 /* Create an INT_CST node of TYPE and value HI:LOW.
1167 The returned node is always shared. For small integers we use a
1168 per-type vector cache, for larger ones we use a single hash table. */
1171 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1179 switch (TREE_CODE (type
))
1182 gcc_assert (hi
== 0 && low
== 0);
1186 case REFERENCE_TYPE
:
1187 /* Cache NULL pointer. */
1196 /* Cache false or true. */
1204 if (TYPE_UNSIGNED (type
))
1207 limit
= INTEGER_SHARE_LIMIT
;
1208 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1214 limit
= INTEGER_SHARE_LIMIT
+ 1;
1215 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1217 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1231 /* Look for it in the type's vector of small shared ints. */
1232 if (!TYPE_CACHED_VALUES_P (type
))
1234 TYPE_CACHED_VALUES_P (type
) = 1;
1235 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1238 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1241 /* Make sure no one is clobbering the shared constant. */
1242 gcc_assert (TREE_TYPE (t
) == type
);
1243 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1244 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1248 /* Create a new shared int. */
1249 t
= make_node (INTEGER_CST
);
1251 TREE_INT_CST_LOW (t
) = low
;
1252 TREE_INT_CST_HIGH (t
) = hi
;
1253 TREE_TYPE (t
) = type
;
1255 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1260 /* Use the cache of larger shared ints. */
1263 TREE_INT_CST_LOW (int_cst_node
) = low
;
1264 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1265 TREE_TYPE (int_cst_node
) = type
;
1267 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1271 /* Insert this one into the hash table. */
1274 /* Make a new node for next time round. */
1275 int_cst_node
= make_node (INTEGER_CST
);
1282 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1283 and the rest are zeros. */
1286 build_low_bits_mask (tree type
, unsigned bits
)
1290 gcc_assert (bits
<= TYPE_PRECISION (type
));
1292 if (bits
== TYPE_PRECISION (type
)
1293 && !TYPE_UNSIGNED (type
))
1294 /* Sign extended all-ones mask. */
1295 mask
= double_int_minus_one
;
1297 mask
= double_int_mask (bits
);
1299 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1302 /* Checks that X is integer constant that can be expressed in (unsigned)
1303 HOST_WIDE_INT without loss of precision. */
1306 cst_and_fits_in_hwi (const_tree x
)
1308 if (TREE_CODE (x
) != INTEGER_CST
)
1311 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1314 return (TREE_INT_CST_HIGH (x
) == 0
1315 || TREE_INT_CST_HIGH (x
) == -1);
1318 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1319 are in a list pointed to by VALS. */
1322 build_vector (tree type
, tree vals
)
1324 tree v
= make_node (VECTOR_CST
);
1329 TREE_VECTOR_CST_ELTS (v
) = vals
;
1330 TREE_TYPE (v
) = type
;
1332 /* Iterate through elements and check for overflow. */
1333 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1335 tree value
= TREE_VALUE (link
);
1338 /* Don't crash if we get an address constant. */
1339 if (!CONSTANT_CLASS_P (value
))
1342 over
|= TREE_OVERFLOW (value
);
1345 gcc_assert (cnt
== TYPE_VECTOR_SUBPARTS (type
));
1347 TREE_OVERFLOW (v
) = over
;
1351 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1352 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1355 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1357 tree list
= NULL_TREE
;
1358 unsigned HOST_WIDE_INT idx
;
1361 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1362 list
= tree_cons (NULL_TREE
, value
, list
);
1363 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1364 list
= tree_cons (NULL_TREE
,
1365 build_zero_cst (TREE_TYPE (type
)), list
);
1366 return build_vector (type
, nreverse (list
));
1369 /* Build a vector of type VECTYPE where all the elements are SCs. */
1371 build_vector_from_val (tree vectype
, tree sc
)
1373 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1374 VEC(constructor_elt
, gc
) *v
= NULL
;
1376 if (sc
== error_mark_node
)
1379 gcc_assert (useless_type_conversion_p (TREE_TYPE (sc
),
1380 TREE_TYPE (vectype
)));
1382 v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1383 for (i
= 0; i
< nunits
; ++i
)
1384 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1386 if (CONSTANT_CLASS_P (sc
))
1387 return build_vector_from_ctor (vectype
, v
);
1389 return build_constructor (vectype
, v
);
1392 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1393 are in the VEC pointed to by VALS. */
1395 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1397 tree c
= make_node (CONSTRUCTOR
);
1399 constructor_elt
*elt
;
1400 bool constant_p
= true;
1402 TREE_TYPE (c
) = type
;
1403 CONSTRUCTOR_ELTS (c
) = vals
;
1405 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1406 if (!TREE_CONSTANT (elt
->value
))
1412 TREE_CONSTANT (c
) = constant_p
;
1417 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1420 build_constructor_single (tree type
, tree index
, tree value
)
1422 VEC(constructor_elt
,gc
) *v
;
1423 constructor_elt
*elt
;
1425 v
= VEC_alloc (constructor_elt
, gc
, 1);
1426 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1430 return build_constructor (type
, v
);
1434 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1435 are in a list pointed to by VALS. */
1437 build_constructor_from_list (tree type
, tree vals
)
1440 VEC(constructor_elt
,gc
) *v
= NULL
;
1444 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1445 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1446 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1449 return build_constructor (type
, v
);
1452 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1455 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1458 FIXED_VALUE_TYPE
*fp
;
1460 v
= make_node (FIXED_CST
);
1461 fp
= ggc_alloc_fixed_value ();
1462 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1464 TREE_TYPE (v
) = type
;
1465 TREE_FIXED_CST_PTR (v
) = fp
;
1469 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1472 build_real (tree type
, REAL_VALUE_TYPE d
)
1475 REAL_VALUE_TYPE
*dp
;
1478 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1479 Consider doing it via real_convert now. */
1481 v
= make_node (REAL_CST
);
1482 dp
= ggc_alloc_real_value ();
1483 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1485 TREE_TYPE (v
) = type
;
1486 TREE_REAL_CST_PTR (v
) = dp
;
1487 TREE_OVERFLOW (v
) = overflow
;
1491 /* Return a new REAL_CST node whose type is TYPE
1492 and whose value is the integer value of the INTEGER_CST node I. */
1495 real_value_from_int_cst (const_tree type
, const_tree i
)
1499 /* Clear all bits of the real value type so that we can later do
1500 bitwise comparisons to see if two values are the same. */
1501 memset (&d
, 0, sizeof d
);
1503 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1504 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1505 TYPE_UNSIGNED (TREE_TYPE (i
)));
1509 /* Given a tree representing an integer constant I, return a tree
1510 representing the same value as a floating-point constant of type TYPE. */
1513 build_real_from_int_cst (tree type
, const_tree i
)
1516 int overflow
= TREE_OVERFLOW (i
);
1518 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1520 TREE_OVERFLOW (v
) |= overflow
;
1524 /* Return a newly constructed STRING_CST node whose value is
1525 the LEN characters at STR.
1526 The TREE_TYPE is not initialized. */
1529 build_string (int len
, const char *str
)
1534 /* Do not waste bytes provided by padding of struct tree_string. */
1535 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1537 #ifdef GATHER_STATISTICS
1538 tree_node_counts
[(int) c_kind
]++;
1539 tree_node_sizes
[(int) c_kind
] += length
;
1542 s
= ggc_alloc_tree_node (length
);
1544 memset (s
, 0, sizeof (struct tree_common
));
1545 TREE_SET_CODE (s
, STRING_CST
);
1546 TREE_CONSTANT (s
) = 1;
1547 TREE_STRING_LENGTH (s
) = len
;
1548 memcpy (s
->string
.str
, str
, len
);
1549 s
->string
.str
[len
] = '\0';
1554 /* Return a newly constructed COMPLEX_CST node whose value is
1555 specified by the real and imaginary parts REAL and IMAG.
1556 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1557 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1560 build_complex (tree type
, tree real
, tree imag
)
1562 tree t
= make_node (COMPLEX_CST
);
1564 TREE_REALPART (t
) = real
;
1565 TREE_IMAGPART (t
) = imag
;
1566 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1567 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1571 /* Return a constant of arithmetic type TYPE which is the
1572 multiplicative identity of the set TYPE. */
1575 build_one_cst (tree type
)
1577 switch (TREE_CODE (type
))
1579 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1580 case POINTER_TYPE
: case REFERENCE_TYPE
:
1582 return build_int_cst (type
, 1);
1585 return build_real (type
, dconst1
);
1587 case FIXED_POINT_TYPE
:
1588 /* We can only generate 1 for accum types. */
1589 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1590 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1594 tree scalar
= build_one_cst (TREE_TYPE (type
));
1596 return build_vector_from_val (type
, scalar
);
1600 return build_complex (type
,
1601 build_one_cst (TREE_TYPE (type
)),
1602 build_zero_cst (TREE_TYPE (type
)));
1609 /* Build 0 constant of type TYPE. This is used by constructor folding
1610 and thus the constant should be represented in memory by
1614 build_zero_cst (tree type
)
1616 switch (TREE_CODE (type
))
1618 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1619 case POINTER_TYPE
: case REFERENCE_TYPE
:
1621 return build_int_cst (type
, 0);
1624 return build_real (type
, dconst0
);
1626 case FIXED_POINT_TYPE
:
1627 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1631 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1633 return build_vector_from_val (type
, scalar
);
1638 tree zero
= build_zero_cst (TREE_TYPE (type
));
1640 return build_complex (type
, zero
, zero
);
1644 if (!AGGREGATE_TYPE_P (type
))
1645 return fold_convert (type
, integer_zero_node
);
1646 return build_constructor (type
, NULL
);
1651 /* Build a BINFO with LEN language slots. */
1654 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1657 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1658 + VEC_embedded_size (tree
, base_binfos
));
1660 #ifdef GATHER_STATISTICS
1661 tree_node_counts
[(int) binfo_kind
]++;
1662 tree_node_sizes
[(int) binfo_kind
] += length
;
1665 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1667 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1669 TREE_SET_CODE (t
, TREE_BINFO
);
1671 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1677 /* Build a newly constructed TREE_VEC node of length LEN. */
1680 make_tree_vec_stat (int len MEM_STAT_DECL
)
1683 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1685 #ifdef GATHER_STATISTICS
1686 tree_node_counts
[(int) vec_kind
]++;
1687 tree_node_sizes
[(int) vec_kind
] += length
;
1690 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1692 TREE_SET_CODE (t
, TREE_VEC
);
1693 TREE_VEC_LENGTH (t
) = len
;
1698 /* Return 1 if EXPR is the integer constant zero or a complex constant
1702 integer_zerop (const_tree expr
)
1706 return ((TREE_CODE (expr
) == INTEGER_CST
1707 && TREE_INT_CST_LOW (expr
) == 0
1708 && TREE_INT_CST_HIGH (expr
) == 0)
1709 || (TREE_CODE (expr
) == COMPLEX_CST
1710 && integer_zerop (TREE_REALPART (expr
))
1711 && integer_zerop (TREE_IMAGPART (expr
))));
1714 /* Return 1 if EXPR is the integer constant one or the corresponding
1715 complex constant. */
1718 integer_onep (const_tree expr
)
1722 return ((TREE_CODE (expr
) == INTEGER_CST
1723 && TREE_INT_CST_LOW (expr
) == 1
1724 && TREE_INT_CST_HIGH (expr
) == 0)
1725 || (TREE_CODE (expr
) == COMPLEX_CST
1726 && integer_onep (TREE_REALPART (expr
))
1727 && integer_zerop (TREE_IMAGPART (expr
))));
1730 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1731 it contains. Likewise for the corresponding complex constant. */
1734 integer_all_onesp (const_tree expr
)
1741 if (TREE_CODE (expr
) == COMPLEX_CST
1742 && integer_all_onesp (TREE_REALPART (expr
))
1743 && integer_zerop (TREE_IMAGPART (expr
)))
1746 else if (TREE_CODE (expr
) != INTEGER_CST
)
1749 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1750 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1751 && TREE_INT_CST_HIGH (expr
) == -1)
1756 /* Note that using TYPE_PRECISION here is wrong. We care about the
1757 actual bits, not the (arbitrary) range of the type. */
1758 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1759 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1761 HOST_WIDE_INT high_value
;
1764 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1766 /* Can not handle precisions greater than twice the host int size. */
1767 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1768 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1769 /* Shifting by the host word size is undefined according to the ANSI
1770 standard, so we must handle this as a special case. */
1773 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1775 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1776 && TREE_INT_CST_HIGH (expr
) == high_value
);
1779 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1782 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1786 integer_pow2p (const_tree expr
)
1789 HOST_WIDE_INT high
, low
;
1793 if (TREE_CODE (expr
) == COMPLEX_CST
1794 && integer_pow2p (TREE_REALPART (expr
))
1795 && integer_zerop (TREE_IMAGPART (expr
)))
1798 if (TREE_CODE (expr
) != INTEGER_CST
)
1801 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1802 high
= TREE_INT_CST_HIGH (expr
);
1803 low
= TREE_INT_CST_LOW (expr
);
1805 /* First clear all bits that are beyond the type's precision in case
1806 we've been sign extended. */
1808 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1810 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1811 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1815 if (prec
< HOST_BITS_PER_WIDE_INT
)
1816 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1819 if (high
== 0 && low
== 0)
1822 return ((high
== 0 && (low
& (low
- 1)) == 0)
1823 || (low
== 0 && (high
& (high
- 1)) == 0));
1826 /* Return 1 if EXPR is an integer constant other than zero or a
1827 complex constant other than zero. */
1830 integer_nonzerop (const_tree expr
)
1834 return ((TREE_CODE (expr
) == INTEGER_CST
1835 && (TREE_INT_CST_LOW (expr
) != 0
1836 || TREE_INT_CST_HIGH (expr
) != 0))
1837 || (TREE_CODE (expr
) == COMPLEX_CST
1838 && (integer_nonzerop (TREE_REALPART (expr
))
1839 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1842 /* Return 1 if EXPR is the fixed-point constant zero. */
1845 fixed_zerop (const_tree expr
)
1847 return (TREE_CODE (expr
) == FIXED_CST
1848 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1851 /* Return the power of two represented by a tree node known to be a
1855 tree_log2 (const_tree expr
)
1858 HOST_WIDE_INT high
, low
;
1862 if (TREE_CODE (expr
) == COMPLEX_CST
)
1863 return tree_log2 (TREE_REALPART (expr
));
1865 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1866 high
= TREE_INT_CST_HIGH (expr
);
1867 low
= TREE_INT_CST_LOW (expr
);
1869 /* First clear all bits that are beyond the type's precision in case
1870 we've been sign extended. */
1872 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1874 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1875 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1879 if (prec
< HOST_BITS_PER_WIDE_INT
)
1880 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1883 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1884 : exact_log2 (low
));
1887 /* Similar, but return the largest integer Y such that 2 ** Y is less
1888 than or equal to EXPR. */
1891 tree_floor_log2 (const_tree expr
)
1894 HOST_WIDE_INT high
, low
;
1898 if (TREE_CODE (expr
) == COMPLEX_CST
)
1899 return tree_log2 (TREE_REALPART (expr
));
1901 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1902 high
= TREE_INT_CST_HIGH (expr
);
1903 low
= TREE_INT_CST_LOW (expr
);
1905 /* First clear all bits that are beyond the type's precision in case
1906 we've been sign extended. Ignore if type's precision hasn't been set
1907 since what we are doing is setting it. */
1909 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1911 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1912 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1916 if (prec
< HOST_BITS_PER_WIDE_INT
)
1917 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1920 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1921 : floor_log2 (low
));
1924 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1925 decimal float constants, so don't return 1 for them. */
1928 real_zerop (const_tree expr
)
1932 return ((TREE_CODE (expr
) == REAL_CST
1933 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1934 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1935 || (TREE_CODE (expr
) == COMPLEX_CST
1936 && real_zerop (TREE_REALPART (expr
))
1937 && real_zerop (TREE_IMAGPART (expr
))));
1940 /* Return 1 if EXPR is the real constant one in real or complex form.
1941 Trailing zeroes matter for decimal float constants, so don't return
1945 real_onep (const_tree expr
)
1949 return ((TREE_CODE (expr
) == REAL_CST
1950 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1951 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1952 || (TREE_CODE (expr
) == COMPLEX_CST
1953 && real_onep (TREE_REALPART (expr
))
1954 && real_zerop (TREE_IMAGPART (expr
))));
1957 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1958 for decimal float constants, so don't return 1 for them. */
1961 real_twop (const_tree expr
)
1965 return ((TREE_CODE (expr
) == REAL_CST
1966 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1967 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1968 || (TREE_CODE (expr
) == COMPLEX_CST
1969 && real_twop (TREE_REALPART (expr
))
1970 && real_zerop (TREE_IMAGPART (expr
))));
1973 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1974 matter for decimal float constants, so don't return 1 for them. */
1977 real_minus_onep (const_tree expr
)
1981 return ((TREE_CODE (expr
) == REAL_CST
1982 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
1983 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1984 || (TREE_CODE (expr
) == COMPLEX_CST
1985 && real_minus_onep (TREE_REALPART (expr
))
1986 && real_zerop (TREE_IMAGPART (expr
))));
1989 /* Nonzero if EXP is a constant or a cast of a constant. */
1992 really_constant_p (const_tree exp
)
1994 /* This is not quite the same as STRIP_NOPS. It does more. */
1995 while (CONVERT_EXPR_P (exp
)
1996 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1997 exp
= TREE_OPERAND (exp
, 0);
1998 return TREE_CONSTANT (exp
);
2001 /* Return first list element whose TREE_VALUE is ELEM.
2002 Return 0 if ELEM is not in LIST. */
2005 value_member (tree elem
, tree list
)
2009 if (elem
== TREE_VALUE (list
))
2011 list
= TREE_CHAIN (list
);
2016 /* Return first list element whose TREE_PURPOSE is ELEM.
2017 Return 0 if ELEM is not in LIST. */
2020 purpose_member (const_tree elem
, tree list
)
2024 if (elem
== TREE_PURPOSE (list
))
2026 list
= TREE_CHAIN (list
);
2031 /* Return true if ELEM is in V. */
2034 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2038 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2044 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2048 chain_index (int idx
, tree chain
)
2050 for (; chain
&& idx
> 0; --idx
)
2051 chain
= TREE_CHAIN (chain
);
2055 /* Return nonzero if ELEM is part of the chain CHAIN. */
2058 chain_member (const_tree elem
, const_tree chain
)
2064 chain
= DECL_CHAIN (chain
);
2070 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2071 We expect a null pointer to mark the end of the chain.
2072 This is the Lisp primitive `length'. */
2075 list_length (const_tree t
)
2078 #ifdef ENABLE_TREE_CHECKING
2086 #ifdef ENABLE_TREE_CHECKING
2089 gcc_assert (p
!= q
);
2097 /* Returns the number of FIELD_DECLs in TYPE. */
2100 fields_length (const_tree type
)
2102 tree t
= TYPE_FIELDS (type
);
2105 for (; t
; t
= DECL_CHAIN (t
))
2106 if (TREE_CODE (t
) == FIELD_DECL
)
2112 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2113 UNION_TYPE TYPE, or NULL_TREE if none. */
2116 first_field (const_tree type
)
2118 tree t
= TYPE_FIELDS (type
);
2119 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2124 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2125 by modifying the last node in chain 1 to point to chain 2.
2126 This is the Lisp primitive `nconc'. */
2129 chainon (tree op1
, tree op2
)
2138 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2140 TREE_CHAIN (t1
) = op2
;
2142 #ifdef ENABLE_TREE_CHECKING
2145 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2146 gcc_assert (t2
!= t1
);
2153 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2156 tree_last (tree chain
)
2160 while ((next
= TREE_CHAIN (chain
)))
2165 /* Reverse the order of elements in the chain T,
2166 and return the new head of the chain (old last element). */
2171 tree prev
= 0, decl
, next
;
2172 for (decl
= t
; decl
; decl
= next
)
2174 /* We shouldn't be using this function to reverse BLOCK chains; we
2175 have blocks_nreverse for that. */
2176 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2177 next
= TREE_CHAIN (decl
);
2178 TREE_CHAIN (decl
) = prev
;
2184 /* Return a newly created TREE_LIST node whose
2185 purpose and value fields are PARM and VALUE. */
2188 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2190 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2191 TREE_PURPOSE (t
) = parm
;
2192 TREE_VALUE (t
) = value
;
2196 /* Build a chain of TREE_LIST nodes from a vector. */
2199 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2201 tree ret
= NULL_TREE
;
2205 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2207 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2208 pp
= &TREE_CHAIN (*pp
);
2213 /* Return a newly created TREE_LIST node whose
2214 purpose and value fields are PURPOSE and VALUE
2215 and whose TREE_CHAIN is CHAIN. */
2218 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2222 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2224 memset (node
, 0, sizeof (struct tree_common
));
2226 #ifdef GATHER_STATISTICS
2227 tree_node_counts
[(int) x_kind
]++;
2228 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
2231 TREE_SET_CODE (node
, TREE_LIST
);
2232 TREE_CHAIN (node
) = chain
;
2233 TREE_PURPOSE (node
) = purpose
;
2234 TREE_VALUE (node
) = value
;
2238 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2242 ctor_to_vec (tree ctor
)
2244 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2248 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2249 VEC_quick_push (tree
, vec
, val
);
2254 /* Return the size nominally occupied by an object of type TYPE
2255 when it resides in memory. The value is measured in units of bytes,
2256 and its data type is that normally used for type sizes
2257 (which is the first type created by make_signed_type or
2258 make_unsigned_type). */
2261 size_in_bytes (const_tree type
)
2265 if (type
== error_mark_node
)
2266 return integer_zero_node
;
2268 type
= TYPE_MAIN_VARIANT (type
);
2269 t
= TYPE_SIZE_UNIT (type
);
2273 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2274 return size_zero_node
;
2280 /* Return the size of TYPE (in bytes) as a wide integer
2281 or return -1 if the size can vary or is larger than an integer. */
2284 int_size_in_bytes (const_tree type
)
2288 if (type
== error_mark_node
)
2291 type
= TYPE_MAIN_VARIANT (type
);
2292 t
= TYPE_SIZE_UNIT (type
);
2294 || TREE_CODE (t
) != INTEGER_CST
2295 || TREE_INT_CST_HIGH (t
) != 0
2296 /* If the result would appear negative, it's too big to represent. */
2297 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2300 return TREE_INT_CST_LOW (t
);
2303 /* Return the maximum size of TYPE (in bytes) as a wide integer
2304 or return -1 if the size can vary or is larger than an integer. */
2307 max_int_size_in_bytes (const_tree type
)
2309 HOST_WIDE_INT size
= -1;
2312 /* If this is an array type, check for a possible MAX_SIZE attached. */
2314 if (TREE_CODE (type
) == ARRAY_TYPE
)
2316 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2318 if (size_tree
&& host_integerp (size_tree
, 1))
2319 size
= tree_low_cst (size_tree
, 1);
2322 /* If we still haven't been able to get a size, see if the language
2323 can compute a maximum size. */
2327 size_tree
= lang_hooks
.types
.max_size (type
);
2329 if (size_tree
&& host_integerp (size_tree
, 1))
2330 size
= tree_low_cst (size_tree
, 1);
2336 /* Returns a tree for the size of EXP in bytes. */
2339 tree_expr_size (const_tree exp
)
2342 && DECL_SIZE_UNIT (exp
) != 0)
2343 return DECL_SIZE_UNIT (exp
);
2345 return size_in_bytes (TREE_TYPE (exp
));
2348 /* Return the bit position of FIELD, in bits from the start of the record.
2349 This is a tree of type bitsizetype. */
2352 bit_position (const_tree field
)
2354 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2355 DECL_FIELD_BIT_OFFSET (field
));
2358 /* Likewise, but return as an integer. It must be representable in
2359 that way (since it could be a signed value, we don't have the
2360 option of returning -1 like int_size_in_byte can. */
2363 int_bit_position (const_tree field
)
2365 return tree_low_cst (bit_position (field
), 0);
2368 /* Return the byte position of FIELD, in bytes from the start of the record.
2369 This is a tree of type sizetype. */
2372 byte_position (const_tree field
)
2374 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2375 DECL_FIELD_BIT_OFFSET (field
));
2378 /* Likewise, but return as an integer. It must be representable in
2379 that way (since it could be a signed value, we don't have the
2380 option of returning -1 like int_size_in_byte can. */
2383 int_byte_position (const_tree field
)
2385 return tree_low_cst (byte_position (field
), 0);
2388 /* Return the strictest alignment, in bits, that T is known to have. */
2391 expr_align (const_tree t
)
2393 unsigned int align0
, align1
;
2395 switch (TREE_CODE (t
))
2397 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2398 /* If we have conversions, we know that the alignment of the
2399 object must meet each of the alignments of the types. */
2400 align0
= expr_align (TREE_OPERAND (t
, 0));
2401 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2402 return MAX (align0
, align1
);
2404 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2405 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2406 case CLEANUP_POINT_EXPR
:
2407 /* These don't change the alignment of an object. */
2408 return expr_align (TREE_OPERAND (t
, 0));
2411 /* The best we can do is say that the alignment is the least aligned
2413 align0
= expr_align (TREE_OPERAND (t
, 1));
2414 align1
= expr_align (TREE_OPERAND (t
, 2));
2415 return MIN (align0
, align1
);
2417 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2418 meaningfully, it's always 1. */
2419 case LABEL_DECL
: case CONST_DECL
:
2420 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2422 gcc_assert (DECL_ALIGN (t
) != 0);
2423 return DECL_ALIGN (t
);
2429 /* Otherwise take the alignment from that of the type. */
2430 return TYPE_ALIGN (TREE_TYPE (t
));
2433 /* Return, as a tree node, the number of elements for TYPE (which is an
2434 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2437 array_type_nelts (const_tree type
)
2439 tree index_type
, min
, max
;
2441 /* If they did it with unspecified bounds, then we should have already
2442 given an error about it before we got here. */
2443 if (! TYPE_DOMAIN (type
))
2444 return error_mark_node
;
2446 index_type
= TYPE_DOMAIN (type
);
2447 min
= TYPE_MIN_VALUE (index_type
);
2448 max
= TYPE_MAX_VALUE (index_type
);
2450 return (integer_zerop (min
)
2452 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2455 /* If arg is static -- a reference to an object in static storage -- then
2456 return the object. This is not the same as the C meaning of `static'.
2457 If arg isn't static, return NULL. */
2462 switch (TREE_CODE (arg
))
2465 /* Nested functions are static, even though taking their address will
2466 involve a trampoline as we unnest the nested function and create
2467 the trampoline on the tree level. */
2471 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2472 && ! DECL_THREAD_LOCAL_P (arg
)
2473 && ! DECL_DLLIMPORT_P (arg
)
2477 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2481 return TREE_STATIC (arg
) ? arg
: NULL
;
2488 /* If the thing being referenced is not a field, then it is
2489 something language specific. */
2490 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2492 /* If we are referencing a bitfield, we can't evaluate an
2493 ADDR_EXPR at compile time and so it isn't a constant. */
2494 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2497 return staticp (TREE_OPERAND (arg
, 0));
2503 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2506 case ARRAY_RANGE_REF
:
2507 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2508 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2509 return staticp (TREE_OPERAND (arg
, 0));
2513 case COMPOUND_LITERAL_EXPR
:
2514 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2524 /* Return whether OP is a DECL whose address is function-invariant. */
2527 decl_address_invariant_p (const_tree op
)
2529 /* The conditions below are slightly less strict than the one in
2532 switch (TREE_CODE (op
))
2541 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2542 || DECL_THREAD_LOCAL_P (op
)
2543 || DECL_CONTEXT (op
) == current_function_decl
2544 || decl_function_context (op
) == current_function_decl
)
2549 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2550 || decl_function_context (op
) == current_function_decl
)
2561 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2564 decl_address_ip_invariant_p (const_tree op
)
2566 /* The conditions below are slightly less strict than the one in
2569 switch (TREE_CODE (op
))
2577 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2578 && !DECL_DLLIMPORT_P (op
))
2579 || DECL_THREAD_LOCAL_P (op
))
2584 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2596 /* Return true if T is function-invariant (internal function, does
2597 not handle arithmetic; that's handled in skip_simple_arithmetic and
2598 tree_invariant_p). */
2600 static bool tree_invariant_p (tree t
);
2603 tree_invariant_p_1 (tree t
)
2607 if (TREE_CONSTANT (t
)
2608 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2611 switch (TREE_CODE (t
))
2617 op
= TREE_OPERAND (t
, 0);
2618 while (handled_component_p (op
))
2620 switch (TREE_CODE (op
))
2623 case ARRAY_RANGE_REF
:
2624 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2625 || TREE_OPERAND (op
, 2) != NULL_TREE
2626 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2631 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2637 op
= TREE_OPERAND (op
, 0);
2640 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2649 /* Return true if T is function-invariant. */
2652 tree_invariant_p (tree t
)
2654 tree inner
= skip_simple_arithmetic (t
);
2655 return tree_invariant_p_1 (inner
);
2658 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2659 Do this to any expression which may be used in more than one place,
2660 but must be evaluated only once.
2662 Normally, expand_expr would reevaluate the expression each time.
2663 Calling save_expr produces something that is evaluated and recorded
2664 the first time expand_expr is called on it. Subsequent calls to
2665 expand_expr just reuse the recorded value.
2667 The call to expand_expr that generates code that actually computes
2668 the value is the first call *at compile time*. Subsequent calls
2669 *at compile time* generate code to use the saved value.
2670 This produces correct result provided that *at run time* control
2671 always flows through the insns made by the first expand_expr
2672 before reaching the other places where the save_expr was evaluated.
2673 You, the caller of save_expr, must make sure this is so.
2675 Constants, and certain read-only nodes, are returned with no
2676 SAVE_EXPR because that is safe. Expressions containing placeholders
2677 are not touched; see tree.def for an explanation of what these
2681 save_expr (tree expr
)
2683 tree t
= fold (expr
);
2686 /* If the tree evaluates to a constant, then we don't want to hide that
2687 fact (i.e. this allows further folding, and direct checks for constants).
2688 However, a read-only object that has side effects cannot be bypassed.
2689 Since it is no problem to reevaluate literals, we just return the
2691 inner
= skip_simple_arithmetic (t
);
2692 if (TREE_CODE (inner
) == ERROR_MARK
)
2695 if (tree_invariant_p_1 (inner
))
2698 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2699 it means that the size or offset of some field of an object depends on
2700 the value within another field.
2702 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2703 and some variable since it would then need to be both evaluated once and
2704 evaluated more than once. Front-ends must assure this case cannot
2705 happen by surrounding any such subexpressions in their own SAVE_EXPR
2706 and forcing evaluation at the proper time. */
2707 if (contains_placeholder_p (inner
))
2710 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2711 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2713 /* This expression might be placed ahead of a jump to ensure that the
2714 value was computed on both sides of the jump. So make sure it isn't
2715 eliminated as dead. */
2716 TREE_SIDE_EFFECTS (t
) = 1;
2720 /* Look inside EXPR and into any simple arithmetic operations. Return
2721 the innermost non-arithmetic node. */
2724 skip_simple_arithmetic (tree expr
)
2728 /* We don't care about whether this can be used as an lvalue in this
2730 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2731 expr
= TREE_OPERAND (expr
, 0);
2733 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2734 a constant, it will be more efficient to not make another SAVE_EXPR since
2735 it will allow better simplification and GCSE will be able to merge the
2736 computations if they actually occur. */
2740 if (UNARY_CLASS_P (inner
))
2741 inner
= TREE_OPERAND (inner
, 0);
2742 else if (BINARY_CLASS_P (inner
))
2744 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2745 inner
= TREE_OPERAND (inner
, 0);
2746 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2747 inner
= TREE_OPERAND (inner
, 1);
2759 /* Return which tree structure is used by T. */
2761 enum tree_node_structure_enum
2762 tree_node_structure (const_tree t
)
2764 const enum tree_code code
= TREE_CODE (t
);
2765 return tree_node_structure_for_code (code
);
2768 /* Set various status flags when building a CALL_EXPR object T. */
2771 process_call_operands (tree t
)
2773 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2774 bool read_only
= false;
2775 int i
= call_expr_flags (t
);
2777 /* Calls have side-effects, except those to const or pure functions. */
2778 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2779 side_effects
= true;
2780 /* Propagate TREE_READONLY of arguments for const functions. */
2784 if (!side_effects
|| read_only
)
2785 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2787 tree op
= TREE_OPERAND (t
, i
);
2788 if (op
&& TREE_SIDE_EFFECTS (op
))
2789 side_effects
= true;
2790 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2794 TREE_SIDE_EFFECTS (t
) = side_effects
;
2795 TREE_READONLY (t
) = read_only
;
2798 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2799 or offset that depends on a field within a record. */
2802 contains_placeholder_p (const_tree exp
)
2804 enum tree_code code
;
2809 code
= TREE_CODE (exp
);
2810 if (code
== PLACEHOLDER_EXPR
)
2813 switch (TREE_CODE_CLASS (code
))
2816 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2817 position computations since they will be converted into a
2818 WITH_RECORD_EXPR involving the reference, which will assume
2819 here will be valid. */
2820 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2822 case tcc_exceptional
:
2823 if (code
== TREE_LIST
)
2824 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2825 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2830 case tcc_comparison
:
2831 case tcc_expression
:
2835 /* Ignoring the first operand isn't quite right, but works best. */
2836 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2839 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2840 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2841 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2844 /* The save_expr function never wraps anything containing
2845 a PLACEHOLDER_EXPR. */
2852 switch (TREE_CODE_LENGTH (code
))
2855 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2857 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2858 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2869 const_call_expr_arg_iterator iter
;
2870 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2871 if (CONTAINS_PLACEHOLDER_P (arg
))
2885 /* Return true if any part of the computation of TYPE involves a
2886 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2887 (for QUAL_UNION_TYPE) and field positions. */
2890 type_contains_placeholder_1 (const_tree type
)
2892 /* If the size contains a placeholder or the parent type (component type in
2893 the case of arrays) type involves a placeholder, this type does. */
2894 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2895 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2896 || (TREE_TYPE (type
) != 0
2897 && type_contains_placeholder_p (TREE_TYPE (type
))))
2900 /* Now do type-specific checks. Note that the last part of the check above
2901 greatly limits what we have to do below. */
2902 switch (TREE_CODE (type
))
2910 case REFERENCE_TYPE
:
2918 case FIXED_POINT_TYPE
:
2919 /* Here we just check the bounds. */
2920 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2921 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2924 /* We're already checked the component type (TREE_TYPE), so just check
2926 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2930 case QUAL_UNION_TYPE
:
2934 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2935 if (TREE_CODE (field
) == FIELD_DECL
2936 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2937 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2938 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2939 || type_contains_placeholder_p (TREE_TYPE (field
))))
2951 type_contains_placeholder_p (tree type
)
2955 /* If the contains_placeholder_bits field has been initialized,
2956 then we know the answer. */
2957 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2958 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2960 /* Indicate that we've seen this type node, and the answer is false.
2961 This is what we want to return if we run into recursion via fields. */
2962 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2964 /* Compute the real value. */
2965 result
= type_contains_placeholder_1 (type
);
2967 /* Store the real value. */
2968 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2973 /* Push tree EXP onto vector QUEUE if it is not already present. */
2976 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2981 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
2982 if (simple_cst_equal (iter
, exp
) == 1)
2986 VEC_safe_push (tree
, heap
, *queue
, exp
);
2989 /* Given a tree EXP, find all occurences of references to fields
2990 in a PLACEHOLDER_EXPR and place them in vector REFS without
2991 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2992 we assume here that EXP contains only arithmetic expressions
2993 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2997 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
2999 enum tree_code code
= TREE_CODE (exp
);
3003 /* We handle TREE_LIST and COMPONENT_REF separately. */
3004 if (code
== TREE_LIST
)
3006 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3007 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3009 else if (code
== COMPONENT_REF
)
3011 for (inner
= TREE_OPERAND (exp
, 0);
3012 REFERENCE_CLASS_P (inner
);
3013 inner
= TREE_OPERAND (inner
, 0))
3016 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3017 push_without_duplicates (exp
, refs
);
3019 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3022 switch (TREE_CODE_CLASS (code
))
3027 case tcc_declaration
:
3028 /* Variables allocated to static storage can stay. */
3029 if (!TREE_STATIC (exp
))
3030 push_without_duplicates (exp
, refs
);
3033 case tcc_expression
:
3034 /* This is the pattern built in ada/make_aligning_type. */
3035 if (code
== ADDR_EXPR
3036 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3038 push_without_duplicates (exp
, refs
);
3042 /* Fall through... */
3044 case tcc_exceptional
:
3047 case tcc_comparison
:
3049 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3050 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3054 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3055 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3063 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3064 return a tree with all occurrences of references to F in a
3065 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3066 CONST_DECLs. Note that we assume here that EXP contains only
3067 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3068 occurring only in their argument list. */
3071 substitute_in_expr (tree exp
, tree f
, tree r
)
3073 enum tree_code code
= TREE_CODE (exp
);
3074 tree op0
, op1
, op2
, op3
;
3077 /* We handle TREE_LIST and COMPONENT_REF separately. */
3078 if (code
== TREE_LIST
)
3080 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3081 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3082 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3085 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3087 else if (code
== COMPONENT_REF
)
3091 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3092 and it is the right field, replace it with R. */
3093 for (inner
= TREE_OPERAND (exp
, 0);
3094 REFERENCE_CLASS_P (inner
);
3095 inner
= TREE_OPERAND (inner
, 0))
3099 op1
= TREE_OPERAND (exp
, 1);
3101 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3104 /* If this expression hasn't been completed let, leave it alone. */
3105 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3108 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3109 if (op0
== TREE_OPERAND (exp
, 0))
3113 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3116 switch (TREE_CODE_CLASS (code
))
3121 case tcc_declaration
:
3127 case tcc_expression
:
3131 /* Fall through... */
3133 case tcc_exceptional
:
3136 case tcc_comparison
:
3138 switch (TREE_CODE_LENGTH (code
))
3144 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3145 if (op0
== TREE_OPERAND (exp
, 0))
3148 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3152 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3153 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3155 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3158 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3162 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3163 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3164 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3166 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3167 && op2
== TREE_OPERAND (exp
, 2))
3170 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3174 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3175 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3176 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3177 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3179 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3180 && op2
== TREE_OPERAND (exp
, 2)
3181 && op3
== TREE_OPERAND (exp
, 3))
3185 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3197 new_tree
= NULL_TREE
;
3199 /* If we are trying to replace F with a constant, inline back
3200 functions which do nothing else than computing a value from
3201 the arguments they are passed. This makes it possible to
3202 fold partially or entirely the replacement expression. */
3203 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3205 tree t
= maybe_inline_call_in_expr (exp
);
3207 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3210 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3212 tree op
= TREE_OPERAND (exp
, i
);
3213 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3217 new_tree
= copy_node (exp
);
3218 TREE_OPERAND (new_tree
, i
) = new_op
;
3224 new_tree
= fold (new_tree
);
3225 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3226 process_call_operands (new_tree
);
3237 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3239 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3240 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3245 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3246 for it within OBJ, a tree that is an object or a chain of references. */
3249 substitute_placeholder_in_expr (tree exp
, tree obj
)
3251 enum tree_code code
= TREE_CODE (exp
);
3252 tree op0
, op1
, op2
, op3
;
3255 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3256 in the chain of OBJ. */
3257 if (code
== PLACEHOLDER_EXPR
)
3259 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3262 for (elt
= obj
; elt
!= 0;
3263 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3264 || TREE_CODE (elt
) == COND_EXPR
)
3265 ? TREE_OPERAND (elt
, 1)
3266 : (REFERENCE_CLASS_P (elt
)
3267 || UNARY_CLASS_P (elt
)
3268 || BINARY_CLASS_P (elt
)
3269 || VL_EXP_CLASS_P (elt
)
3270 || EXPRESSION_CLASS_P (elt
))
3271 ? TREE_OPERAND (elt
, 0) : 0))
3272 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3275 for (elt
= obj
; elt
!= 0;
3276 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3277 || TREE_CODE (elt
) == COND_EXPR
)
3278 ? TREE_OPERAND (elt
, 1)
3279 : (REFERENCE_CLASS_P (elt
)
3280 || UNARY_CLASS_P (elt
)
3281 || BINARY_CLASS_P (elt
)
3282 || VL_EXP_CLASS_P (elt
)
3283 || EXPRESSION_CLASS_P (elt
))
3284 ? TREE_OPERAND (elt
, 0) : 0))
3285 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3286 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3288 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3290 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3291 survives until RTL generation, there will be an error. */
3295 /* TREE_LIST is special because we need to look at TREE_VALUE
3296 and TREE_CHAIN, not TREE_OPERANDS. */
3297 else if (code
== TREE_LIST
)
3299 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3300 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3301 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3304 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3307 switch (TREE_CODE_CLASS (code
))
3310 case tcc_declaration
:
3313 case tcc_exceptional
:
3316 case tcc_comparison
:
3317 case tcc_expression
:
3320 switch (TREE_CODE_LENGTH (code
))
3326 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3327 if (op0
== TREE_OPERAND (exp
, 0))
3330 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3334 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3335 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3337 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3340 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3344 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3345 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3346 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3348 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3349 && op2
== TREE_OPERAND (exp
, 2))
3352 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3356 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3357 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3358 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3359 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3361 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3362 && op2
== TREE_OPERAND (exp
, 2)
3363 && op3
== TREE_OPERAND (exp
, 3))
3367 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3379 new_tree
= NULL_TREE
;
3381 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3383 tree op
= TREE_OPERAND (exp
, i
);
3384 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3388 new_tree
= copy_node (exp
);
3389 TREE_OPERAND (new_tree
, i
) = new_op
;
3395 new_tree
= fold (new_tree
);
3396 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3397 process_call_operands (new_tree
);
3408 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3410 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3411 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3416 /* Stabilize a reference so that we can use it any number of times
3417 without causing its operands to be evaluated more than once.
3418 Returns the stabilized reference. This works by means of save_expr,
3419 so see the caveats in the comments about save_expr.
3421 Also allows conversion expressions whose operands are references.
3422 Any other kind of expression is returned unchanged. */
3425 stabilize_reference (tree ref
)
3428 enum tree_code code
= TREE_CODE (ref
);
3435 /* No action is needed in this case. */
3440 case FIX_TRUNC_EXPR
:
3441 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3445 result
= build_nt (INDIRECT_REF
,
3446 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3450 result
= build_nt (COMPONENT_REF
,
3451 stabilize_reference (TREE_OPERAND (ref
, 0)),
3452 TREE_OPERAND (ref
, 1), NULL_TREE
);
3456 result
= build_nt (BIT_FIELD_REF
,
3457 stabilize_reference (TREE_OPERAND (ref
, 0)),
3458 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3459 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3463 result
= build_nt (ARRAY_REF
,
3464 stabilize_reference (TREE_OPERAND (ref
, 0)),
3465 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3466 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3469 case ARRAY_RANGE_REF
:
3470 result
= build_nt (ARRAY_RANGE_REF
,
3471 stabilize_reference (TREE_OPERAND (ref
, 0)),
3472 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3473 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3477 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3478 it wouldn't be ignored. This matters when dealing with
3480 return stabilize_reference_1 (ref
);
3482 /* If arg isn't a kind of lvalue we recognize, make no change.
3483 Caller should recognize the error for an invalid lvalue. */
3488 return error_mark_node
;
3491 TREE_TYPE (result
) = TREE_TYPE (ref
);
3492 TREE_READONLY (result
) = TREE_READONLY (ref
);
3493 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3494 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3499 /* Subroutine of stabilize_reference; this is called for subtrees of
3500 references. Any expression with side-effects must be put in a SAVE_EXPR
3501 to ensure that it is only evaluated once.
3503 We don't put SAVE_EXPR nodes around everything, because assigning very
3504 simple expressions to temporaries causes us to miss good opportunities
3505 for optimizations. Among other things, the opportunity to fold in the
3506 addition of a constant into an addressing mode often gets lost, e.g.
3507 "y[i+1] += x;". In general, we take the approach that we should not make
3508 an assignment unless we are forced into it - i.e., that any non-side effect
3509 operator should be allowed, and that cse should take care of coalescing
3510 multiple utterances of the same expression should that prove fruitful. */
3513 stabilize_reference_1 (tree e
)
3516 enum tree_code code
= TREE_CODE (e
);
3518 /* We cannot ignore const expressions because it might be a reference
3519 to a const array but whose index contains side-effects. But we can
3520 ignore things that are actual constant or that already have been
3521 handled by this function. */
3523 if (tree_invariant_p (e
))
3526 switch (TREE_CODE_CLASS (code
))
3528 case tcc_exceptional
:
3530 case tcc_declaration
:
3531 case tcc_comparison
:
3533 case tcc_expression
:
3536 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3537 so that it will only be evaluated once. */
3538 /* The reference (r) and comparison (<) classes could be handled as
3539 below, but it is generally faster to only evaluate them once. */
3540 if (TREE_SIDE_EFFECTS (e
))
3541 return save_expr (e
);
3545 /* Constants need no processing. In fact, we should never reach
3550 /* Division is slow and tends to be compiled with jumps,
3551 especially the division by powers of 2 that is often
3552 found inside of an array reference. So do it just once. */
3553 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3554 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3555 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3556 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3557 return save_expr (e
);
3558 /* Recursively stabilize each operand. */
3559 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3560 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3564 /* Recursively stabilize each operand. */
3565 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3572 TREE_TYPE (result
) = TREE_TYPE (e
);
3573 TREE_READONLY (result
) = TREE_READONLY (e
);
3574 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3575 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3580 /* Low-level constructors for expressions. */
3582 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3583 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3586 recompute_tree_invariant_for_addr_expr (tree t
)
3589 bool tc
= true, se
= false;
3591 /* We started out assuming this address is both invariant and constant, but
3592 does not have side effects. Now go down any handled components and see if
3593 any of them involve offsets that are either non-constant or non-invariant.
3594 Also check for side-effects.
3596 ??? Note that this code makes no attempt to deal with the case where
3597 taking the address of something causes a copy due to misalignment. */
3599 #define UPDATE_FLAGS(NODE) \
3600 do { tree _node = (NODE); \
3601 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3602 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3604 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3605 node
= TREE_OPERAND (node
, 0))
3607 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3608 array reference (probably made temporarily by the G++ front end),
3609 so ignore all the operands. */
3610 if ((TREE_CODE (node
) == ARRAY_REF
3611 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3612 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3614 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3615 if (TREE_OPERAND (node
, 2))
3616 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3617 if (TREE_OPERAND (node
, 3))
3618 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3620 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3621 FIELD_DECL, apparently. The G++ front end can put something else
3622 there, at least temporarily. */
3623 else if (TREE_CODE (node
) == COMPONENT_REF
3624 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3626 if (TREE_OPERAND (node
, 2))
3627 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3629 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3630 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3633 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3635 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3636 the address, since &(*a)->b is a form of addition. If it's a constant, the
3637 address is constant too. If it's a decl, its address is constant if the
3638 decl is static. Everything else is not constant and, furthermore,
3639 taking the address of a volatile variable is not volatile. */
3640 if (TREE_CODE (node
) == INDIRECT_REF
3641 || TREE_CODE (node
) == MEM_REF
)
3642 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3643 else if (CONSTANT_CLASS_P (node
))
3645 else if (DECL_P (node
))
3646 tc
&= (staticp (node
) != NULL_TREE
);
3650 se
|= TREE_SIDE_EFFECTS (node
);
3654 TREE_CONSTANT (t
) = tc
;
3655 TREE_SIDE_EFFECTS (t
) = se
;
3659 /* Build an expression of code CODE, data type TYPE, and operands as
3660 specified. Expressions and reference nodes can be created this way.
3661 Constants, decls, types and misc nodes cannot be.
3663 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3664 enough for all extant tree codes. */
3667 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3671 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3673 t
= make_node_stat (code PASS_MEM_STAT
);
3680 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3682 int length
= sizeof (struct tree_exp
);
3683 #ifdef GATHER_STATISTICS
3684 tree_node_kind kind
;
3688 #ifdef GATHER_STATISTICS
3689 switch (TREE_CODE_CLASS (code
))
3691 case tcc_statement
: /* an expression with side effects */
3694 case tcc_reference
: /* a reference */
3702 tree_node_counts
[(int) kind
]++;
3703 tree_node_sizes
[(int) kind
] += length
;
3706 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3708 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3710 memset (t
, 0, sizeof (struct tree_common
));
3712 TREE_SET_CODE (t
, code
);
3714 TREE_TYPE (t
) = type
;
3715 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3716 TREE_OPERAND (t
, 0) = node
;
3717 TREE_BLOCK (t
) = NULL_TREE
;
3718 if (node
&& !TYPE_P (node
))
3720 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3721 TREE_READONLY (t
) = TREE_READONLY (node
);
3724 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3725 TREE_SIDE_EFFECTS (t
) = 1;
3729 /* All of these have side-effects, no matter what their
3731 TREE_SIDE_EFFECTS (t
) = 1;
3732 TREE_READONLY (t
) = 0;
3736 /* Whether a dereference is readonly has nothing to do with whether
3737 its operand is readonly. */
3738 TREE_READONLY (t
) = 0;
3743 recompute_tree_invariant_for_addr_expr (t
);
3747 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3748 && node
&& !TYPE_P (node
)
3749 && TREE_CONSTANT (node
))
3750 TREE_CONSTANT (t
) = 1;
3751 if (TREE_CODE_CLASS (code
) == tcc_reference
3752 && node
&& TREE_THIS_VOLATILE (node
))
3753 TREE_THIS_VOLATILE (t
) = 1;
3760 #define PROCESS_ARG(N) \
3762 TREE_OPERAND (t, N) = arg##N; \
3763 if (arg##N &&!TYPE_P (arg##N)) \
3765 if (TREE_SIDE_EFFECTS (arg##N)) \
3767 if (!TREE_READONLY (arg##N) \
3768 && !CONSTANT_CLASS_P (arg##N)) \
3769 (void) (read_only = 0); \
3770 if (!TREE_CONSTANT (arg##N)) \
3771 (void) (constant = 0); \
3776 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3778 bool constant
, read_only
, side_effects
;
3781 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3783 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3784 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3785 /* When sizetype precision doesn't match that of pointers
3786 we need to be able to build explicit extensions or truncations
3787 of the offset argument. */
3788 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3789 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3790 && TREE_CODE (arg1
) == INTEGER_CST
);
3792 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3793 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3794 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3795 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3797 t
= make_node_stat (code PASS_MEM_STAT
);
3800 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3801 result based on those same flags for the arguments. But if the
3802 arguments aren't really even `tree' expressions, we shouldn't be trying
3805 /* Expressions without side effects may be constant if their
3806 arguments are as well. */
3807 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3808 || TREE_CODE_CLASS (code
) == tcc_binary
);
3810 side_effects
= TREE_SIDE_EFFECTS (t
);
3815 TREE_READONLY (t
) = read_only
;
3816 TREE_CONSTANT (t
) = constant
;
3817 TREE_SIDE_EFFECTS (t
) = side_effects
;
3818 TREE_THIS_VOLATILE (t
)
3819 = (TREE_CODE_CLASS (code
) == tcc_reference
3820 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3827 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3828 tree arg2 MEM_STAT_DECL
)
3830 bool constant
, read_only
, side_effects
;
3833 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3834 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3836 t
= make_node_stat (code PASS_MEM_STAT
);
3841 /* As a special exception, if COND_EXPR has NULL branches, we
3842 assume that it is a gimple statement and always consider
3843 it to have side effects. */
3844 if (code
== COND_EXPR
3845 && tt
== void_type_node
3846 && arg1
== NULL_TREE
3847 && arg2
== NULL_TREE
)
3848 side_effects
= true;
3850 side_effects
= TREE_SIDE_EFFECTS (t
);
3856 if (code
== COND_EXPR
)
3857 TREE_READONLY (t
) = read_only
;
3859 TREE_SIDE_EFFECTS (t
) = side_effects
;
3860 TREE_THIS_VOLATILE (t
)
3861 = (TREE_CODE_CLASS (code
) == tcc_reference
3862 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3868 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3869 tree arg2
, tree arg3 MEM_STAT_DECL
)
3871 bool constant
, read_only
, side_effects
;
3874 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3876 t
= make_node_stat (code PASS_MEM_STAT
);
3879 side_effects
= TREE_SIDE_EFFECTS (t
);
3886 TREE_SIDE_EFFECTS (t
) = side_effects
;
3887 TREE_THIS_VOLATILE (t
)
3888 = (TREE_CODE_CLASS (code
) == tcc_reference
3889 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3895 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3896 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3898 bool constant
, read_only
, side_effects
;
3901 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3903 t
= make_node_stat (code PASS_MEM_STAT
);
3906 side_effects
= TREE_SIDE_EFFECTS (t
);
3914 TREE_SIDE_EFFECTS (t
) = side_effects
;
3915 TREE_THIS_VOLATILE (t
)
3916 = (TREE_CODE_CLASS (code
) == tcc_reference
3917 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3923 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3924 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3926 bool constant
, read_only
, side_effects
;
3929 gcc_assert (code
== TARGET_MEM_REF
);
3931 t
= make_node_stat (code PASS_MEM_STAT
);
3934 side_effects
= TREE_SIDE_EFFECTS (t
);
3941 if (code
== TARGET_MEM_REF
)
3945 TREE_SIDE_EFFECTS (t
) = side_effects
;
3946 TREE_THIS_VOLATILE (t
)
3947 = (code
== TARGET_MEM_REF
3948 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3953 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3954 on the pointer PTR. */
3957 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3959 HOST_WIDE_INT offset
= 0;
3960 tree ptype
= TREE_TYPE (ptr
);
3962 /* For convenience allow addresses that collapse to a simple base
3964 if (TREE_CODE (ptr
) == ADDR_EXPR
3965 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3966 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3968 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3970 ptr
= build_fold_addr_expr (ptr
);
3971 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3973 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3974 ptr
, build_int_cst (ptype
, offset
));
3975 SET_EXPR_LOCATION (tem
, loc
);
3979 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3982 mem_ref_offset (const_tree t
)
3984 tree toff
= TREE_OPERAND (t
, 1);
3985 return double_int_sext (tree_to_double_int (toff
),
3986 TYPE_PRECISION (TREE_TYPE (toff
)));
3989 /* Return the pointer-type relevant for TBAA purposes from the
3990 gimple memory reference tree T. This is the type to be used for
3991 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3994 reference_alias_ptr_type (const_tree t
)
3996 const_tree base
= t
;
3997 while (handled_component_p (base
))
3998 base
= TREE_OPERAND (base
, 0);
3999 if (TREE_CODE (base
) == MEM_REF
)
4000 return TREE_TYPE (TREE_OPERAND (base
, 1));
4001 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4002 return TREE_TYPE (TMR_OFFSET (base
));
4004 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4007 /* Similar except don't specify the TREE_TYPE
4008 and leave the TREE_SIDE_EFFECTS as 0.
4009 It is permissible for arguments to be null,
4010 or even garbage if their values do not matter. */
4013 build_nt (enum tree_code code
, ...)
4020 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4024 t
= make_node (code
);
4025 length
= TREE_CODE_LENGTH (code
);
4027 for (i
= 0; i
< length
; i
++)
4028 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4034 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4038 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4043 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4044 CALL_EXPR_FN (ret
) = fn
;
4045 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4046 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4047 CALL_EXPR_ARG (ret
, ix
) = t
;
4051 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4052 We do NOT enter this node in any sort of symbol table.
4054 LOC is the location of the decl.
4056 layout_decl is used to set up the decl's storage layout.
4057 Other slots are initialized to 0 or null pointers. */
4060 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4061 tree type MEM_STAT_DECL
)
4065 t
= make_node_stat (code PASS_MEM_STAT
);
4066 DECL_SOURCE_LOCATION (t
) = loc
;
4068 /* if (type == error_mark_node)
4069 type = integer_type_node; */
4070 /* That is not done, deliberately, so that having error_mark_node
4071 as the type can suppress useless errors in the use of this variable. */
4073 DECL_NAME (t
) = name
;
4074 TREE_TYPE (t
) = type
;
4076 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4082 /* Builds and returns function declaration with NAME and TYPE. */
4085 build_fn_decl (const char *name
, tree type
)
4087 tree id
= get_identifier (name
);
4088 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4090 DECL_EXTERNAL (decl
) = 1;
4091 TREE_PUBLIC (decl
) = 1;
4092 DECL_ARTIFICIAL (decl
) = 1;
4093 TREE_NOTHROW (decl
) = 1;
4098 VEC(tree
,gc
) *all_translation_units
;
4100 /* Builds a new translation-unit decl with name NAME, queues it in the
4101 global list of translation-unit decls and returns it. */
4104 build_translation_unit_decl (tree name
)
4106 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4108 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4109 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4114 /* BLOCK nodes are used to represent the structure of binding contours
4115 and declarations, once those contours have been exited and their contents
4116 compiled. This information is used for outputting debugging info. */
4119 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4121 tree block
= make_node (BLOCK
);
4123 BLOCK_VARS (block
) = vars
;
4124 BLOCK_SUBBLOCKS (block
) = subblocks
;
4125 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4126 BLOCK_CHAIN (block
) = chain
;
4131 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4133 LOC is the location to use in tree T. */
4136 protected_set_expr_location (tree t
, location_t loc
)
4138 if (t
&& CAN_HAVE_LOCATION_P (t
))
4139 SET_EXPR_LOCATION (t
, loc
);
4142 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4146 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4148 DECL_ATTRIBUTES (ddecl
) = attribute
;
4152 /* Borrowed from hashtab.c iterative_hash implementation. */
4153 #define mix(a,b,c) \
4155 a -= b; a -= c; a ^= (c>>13); \
4156 b -= c; b -= a; b ^= (a<< 8); \
4157 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4158 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4159 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4160 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4161 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4162 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4163 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4167 /* Produce good hash value combining VAL and VAL2. */
4169 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4171 /* the golden ratio; an arbitrary value. */
4172 hashval_t a
= 0x9e3779b9;
4178 /* Produce good hash value combining VAL and VAL2. */
4180 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4182 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4183 return iterative_hash_hashval_t (val
, val2
);
4186 hashval_t a
= (hashval_t
) val
;
4187 /* Avoid warnings about shifting of more than the width of the type on
4188 hosts that won't execute this path. */
4190 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4192 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4194 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4195 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4202 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4203 is ATTRIBUTE and its qualifiers are QUALS.
4205 Record such modified types already made so we don't make duplicates. */
4208 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4210 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4212 hashval_t hashcode
= 0;
4214 enum tree_code code
= TREE_CODE (ttype
);
4216 /* Building a distinct copy of a tagged type is inappropriate; it
4217 causes breakage in code that expects there to be a one-to-one
4218 relationship between a struct and its fields.
4219 build_duplicate_type is another solution (as used in
4220 handle_transparent_union_attribute), but that doesn't play well
4221 with the stronger C++ type identity model. */
4222 if (TREE_CODE (ttype
) == RECORD_TYPE
4223 || TREE_CODE (ttype
) == UNION_TYPE
4224 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4225 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4227 warning (OPT_Wattributes
,
4228 "ignoring attributes applied to %qT after definition",
4229 TYPE_MAIN_VARIANT (ttype
));
4230 return build_qualified_type (ttype
, quals
);
4233 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4234 ntype
= build_distinct_type_copy (ttype
);
4236 TYPE_ATTRIBUTES (ntype
) = attribute
;
4238 hashcode
= iterative_hash_object (code
, hashcode
);
4239 if (TREE_TYPE (ntype
))
4240 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4242 hashcode
= attribute_hash_list (attribute
, hashcode
);
4244 switch (TREE_CODE (ntype
))
4247 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4250 if (TYPE_DOMAIN (ntype
))
4251 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4255 hashcode
= iterative_hash_object
4256 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4257 hashcode
= iterative_hash_object
4258 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4261 case FIXED_POINT_TYPE
:
4263 unsigned int precision
= TYPE_PRECISION (ntype
);
4264 hashcode
= iterative_hash_object (precision
, hashcode
);
4271 ntype
= type_hash_canon (hashcode
, ntype
);
4273 /* If the target-dependent attributes make NTYPE different from
4274 its canonical type, we will need to use structural equality
4275 checks for this type. */
4276 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4277 || !targetm
.comp_type_attributes (ntype
, ttype
))
4278 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4279 else if (TYPE_CANONICAL (ntype
) == ntype
)
4280 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4282 ttype
= build_qualified_type (ntype
, quals
);
4284 else if (TYPE_QUALS (ttype
) != quals
)
4285 ttype
= build_qualified_type (ttype
, quals
);
4291 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4294 Record such modified types already made so we don't make duplicates. */
4297 build_type_attribute_variant (tree ttype
, tree attribute
)
4299 return build_type_attribute_qual_variant (ttype
, attribute
,
4300 TYPE_QUALS (ttype
));
4304 /* Reset the expression *EXPR_P, a size or position.
4306 ??? We could reset all non-constant sizes or positions. But it's cheap
4307 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4309 We need to reset self-referential sizes or positions because they cannot
4310 be gimplified and thus can contain a CALL_EXPR after the gimplification
4311 is finished, which will run afoul of LTO streaming. And they need to be
4312 reset to something essentially dummy but not constant, so as to preserve
4313 the properties of the object they are attached to. */
4316 free_lang_data_in_one_sizepos (tree
*expr_p
)
4318 tree expr
= *expr_p
;
4319 if (CONTAINS_PLACEHOLDER_P (expr
))
4320 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4324 /* Reset all the fields in a binfo node BINFO. We only keep
4325 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4328 free_lang_data_in_binfo (tree binfo
)
4333 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4335 BINFO_VTABLE (binfo
) = NULL_TREE
;
4336 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4337 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4338 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4340 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4341 free_lang_data_in_binfo (t
);
4345 /* Reset all language specific information still present in TYPE. */
4348 free_lang_data_in_type (tree type
)
4350 gcc_assert (TYPE_P (type
));
4352 /* Give the FE a chance to remove its own data first. */
4353 lang_hooks
.free_lang_data (type
);
4355 TREE_LANG_FLAG_0 (type
) = 0;
4356 TREE_LANG_FLAG_1 (type
) = 0;
4357 TREE_LANG_FLAG_2 (type
) = 0;
4358 TREE_LANG_FLAG_3 (type
) = 0;
4359 TREE_LANG_FLAG_4 (type
) = 0;
4360 TREE_LANG_FLAG_5 (type
) = 0;
4361 TREE_LANG_FLAG_6 (type
) = 0;
4363 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4365 /* Remove the const and volatile qualifiers from arguments. The
4366 C++ front end removes them, but the C front end does not,
4367 leading to false ODR violation errors when merging two
4368 instances of the same function signature compiled by
4369 different front ends. */
4372 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4374 tree arg_type
= TREE_VALUE (p
);
4376 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4378 int quals
= TYPE_QUALS (arg_type
)
4380 & ~TYPE_QUAL_VOLATILE
;
4381 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4382 free_lang_data_in_type (TREE_VALUE (p
));
4387 /* Remove members that are not actually FIELD_DECLs from the field
4388 list of an aggregate. These occur in C++. */
4389 if (RECORD_OR_UNION_TYPE_P (type
))
4393 /* Note that TYPE_FIELDS can be shared across distinct
4394 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4395 to be removed, we cannot set its TREE_CHAIN to NULL.
4396 Otherwise, we would not be able to find all the other fields
4397 in the other instances of this TREE_TYPE.
4399 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4401 member
= TYPE_FIELDS (type
);
4404 if (TREE_CODE (member
) == FIELD_DECL
)
4407 TREE_CHAIN (prev
) = member
;
4409 TYPE_FIELDS (type
) = member
;
4413 member
= TREE_CHAIN (member
);
4417 TREE_CHAIN (prev
) = NULL_TREE
;
4419 TYPE_FIELDS (type
) = NULL_TREE
;
4421 TYPE_METHODS (type
) = NULL_TREE
;
4422 if (TYPE_BINFO (type
))
4423 free_lang_data_in_binfo (TYPE_BINFO (type
));
4427 /* For non-aggregate types, clear out the language slot (which
4428 overloads TYPE_BINFO). */
4429 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4431 if (INTEGRAL_TYPE_P (type
)
4432 || SCALAR_FLOAT_TYPE_P (type
)
4433 || FIXED_POINT_TYPE_P (type
))
4435 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4436 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4440 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4441 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4443 if (debug_info_level
< DINFO_LEVEL_TERSE
4444 || (TYPE_CONTEXT (type
)
4445 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4446 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4447 TYPE_CONTEXT (type
) = NULL_TREE
;
4449 if (debug_info_level
< DINFO_LEVEL_TERSE
)
4450 TYPE_STUB_DECL (type
) = NULL_TREE
;
4454 /* Return true if DECL may need an assembler name to be set. */
4457 need_assembler_name_p (tree decl
)
4459 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4460 if (TREE_CODE (decl
) != FUNCTION_DECL
4461 && TREE_CODE (decl
) != VAR_DECL
)
4464 /* If DECL already has its assembler name set, it does not need a
4466 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4467 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4470 /* Abstract decls do not need an assembler name. */
4471 if (DECL_ABSTRACT (decl
))
4474 /* For VAR_DECLs, only static, public and external symbols need an
4476 if (TREE_CODE (decl
) == VAR_DECL
4477 && !TREE_STATIC (decl
)
4478 && !TREE_PUBLIC (decl
)
4479 && !DECL_EXTERNAL (decl
))
4482 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4484 /* Do not set assembler name on builtins. Allow RTL expansion to
4485 decide whether to expand inline or via a regular call. */
4486 if (DECL_BUILT_IN (decl
)
4487 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4490 /* Functions represented in the callgraph need an assembler name. */
4491 if (cgraph_get_node (decl
) != NULL
)
4494 /* Unused and not public functions don't need an assembler name. */
4495 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4503 /* Reset all language specific information still present in symbol
4507 free_lang_data_in_decl (tree decl
)
4509 gcc_assert (DECL_P (decl
));
4511 /* Give the FE a chance to remove its own data first. */
4512 lang_hooks
.free_lang_data (decl
);
4514 TREE_LANG_FLAG_0 (decl
) = 0;
4515 TREE_LANG_FLAG_1 (decl
) = 0;
4516 TREE_LANG_FLAG_2 (decl
) = 0;
4517 TREE_LANG_FLAG_3 (decl
) = 0;
4518 TREE_LANG_FLAG_4 (decl
) = 0;
4519 TREE_LANG_FLAG_5 (decl
) = 0;
4520 TREE_LANG_FLAG_6 (decl
) = 0;
4522 /* Identifiers need not have a type. */
4523 if (DECL_NAME (decl
))
4524 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4526 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4527 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4528 if (TREE_CODE (decl
) == FIELD_DECL
)
4529 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4531 /* DECL_FCONTEXT is only used for debug info generation. */
4532 if (TREE_CODE (decl
) == FIELD_DECL
4533 && debug_info_level
< DINFO_LEVEL_TERSE
)
4534 DECL_FCONTEXT (decl
) = NULL_TREE
;
4536 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4538 if (gimple_has_body_p (decl
))
4542 /* If DECL has a gimple body, then the context for its
4543 arguments must be DECL. Otherwise, it doesn't really
4544 matter, as we will not be emitting any code for DECL. In
4545 general, there may be other instances of DECL created by
4546 the front end and since PARM_DECLs are generally shared,
4547 their DECL_CONTEXT changes as the replicas of DECL are
4548 created. The only time where DECL_CONTEXT is important
4549 is for the FUNCTION_DECLs that have a gimple body (since
4550 the PARM_DECL will be used in the function's body). */
4551 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4552 DECL_CONTEXT (t
) = decl
;
4555 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4556 At this point, it is not needed anymore. */
4557 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4559 /* Clear the abstract origin if it refers to a method. Otherwise
4560 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4561 origin will not be output correctly. */
4562 if (DECL_ABSTRACT_ORIGIN (decl
)
4563 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4564 && RECORD_OR_UNION_TYPE_P
4565 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4566 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4568 else if (TREE_CODE (decl
) == VAR_DECL
)
4570 if ((DECL_EXTERNAL (decl
)
4571 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4572 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4573 DECL_INITIAL (decl
) = NULL_TREE
;
4575 else if (TREE_CODE (decl
) == TYPE_DECL
)
4576 DECL_INITIAL (decl
) = NULL_TREE
;
4580 /* Data used when collecting DECLs and TYPEs for language data removal. */
4582 struct free_lang_data_d
4584 /* Worklist to avoid excessive recursion. */
4585 VEC(tree
,heap
) *worklist
;
4587 /* Set of traversed objects. Used to avoid duplicate visits. */
4588 struct pointer_set_t
*pset
;
4590 /* Array of symbols to process with free_lang_data_in_decl. */
4591 VEC(tree
,heap
) *decls
;
4593 /* Array of types to process with free_lang_data_in_type. */
4594 VEC(tree
,heap
) *types
;
4598 /* Save all language fields needed to generate proper debug information
4599 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4602 save_debug_info_for_decl (tree t
)
4604 /*struct saved_debug_info_d *sdi;*/
4606 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4608 /* FIXME. Partial implementation for saving debug info removed. */
4612 /* Save all language fields needed to generate proper debug information
4613 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4616 save_debug_info_for_type (tree t
)
4618 /*struct saved_debug_info_d *sdi;*/
4620 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4622 /* FIXME. Partial implementation for saving debug info removed. */
4626 /* Add type or decl T to one of the list of tree nodes that need their
4627 language data removed. The lists are held inside FLD. */
4630 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4634 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4635 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4636 save_debug_info_for_decl (t
);
4638 else if (TYPE_P (t
))
4640 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4641 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4642 save_debug_info_for_type (t
);
4648 /* Push tree node T into FLD->WORKLIST. */
4651 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4653 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4654 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4658 /* Operand callback helper for free_lang_data_in_node. *TP is the
4659 subtree operand being considered. */
4662 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4665 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4667 if (TREE_CODE (t
) == TREE_LIST
)
4670 /* Language specific nodes will be removed, so there is no need
4671 to gather anything under them. */
4672 if (is_lang_specific (t
))
4680 /* Note that walk_tree does not traverse every possible field in
4681 decls, so we have to do our own traversals here. */
4682 add_tree_to_fld_list (t
, fld
);
4684 fld_worklist_push (DECL_NAME (t
), fld
);
4685 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4686 fld_worklist_push (DECL_SIZE (t
), fld
);
4687 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4689 /* We are going to remove everything under DECL_INITIAL for
4690 TYPE_DECLs. No point walking them. */
4691 if (TREE_CODE (t
) != TYPE_DECL
)
4692 fld_worklist_push (DECL_INITIAL (t
), fld
);
4694 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4695 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4697 if (TREE_CODE (t
) == FUNCTION_DECL
)
4699 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4700 fld_worklist_push (DECL_RESULT (t
), fld
);
4702 else if (TREE_CODE (t
) == TYPE_DECL
)
4704 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4705 fld_worklist_push (DECL_VINDEX (t
), fld
);
4707 else if (TREE_CODE (t
) == FIELD_DECL
)
4709 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4710 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4711 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4712 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4713 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4715 else if (TREE_CODE (t
) == VAR_DECL
)
4717 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4718 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4721 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4722 && DECL_HAS_VALUE_EXPR_P (t
))
4723 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4725 if (TREE_CODE (t
) != FIELD_DECL
4726 && TREE_CODE (t
) != TYPE_DECL
)
4727 fld_worklist_push (TREE_CHAIN (t
), fld
);
4730 else if (TYPE_P (t
))
4732 /* Note that walk_tree does not traverse every possible field in
4733 types, so we have to do our own traversals here. */
4734 add_tree_to_fld_list (t
, fld
);
4736 if (!RECORD_OR_UNION_TYPE_P (t
))
4737 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4738 fld_worklist_push (TYPE_SIZE (t
), fld
);
4739 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4740 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4741 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4742 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4743 fld_worklist_push (TYPE_NAME (t
), fld
);
4744 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4745 them and thus do not and want not to reach unused pointer types
4747 if (!POINTER_TYPE_P (t
))
4748 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4749 if (!RECORD_OR_UNION_TYPE_P (t
))
4750 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4751 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4752 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4753 do not and want not to reach unused variants this way. */
4754 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4755 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4756 and want not to reach unused types this way. */
4758 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4762 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4764 fld_worklist_push (TREE_TYPE (tem
), fld
);
4765 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4767 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4768 && TREE_CODE (tem
) == TREE_LIST
)
4771 fld_worklist_push (TREE_VALUE (tem
), fld
);
4772 tem
= TREE_CHAIN (tem
);
4776 if (RECORD_OR_UNION_TYPE_P (t
))
4779 /* Push all TYPE_FIELDS - there can be interleaving interesting
4780 and non-interesting things. */
4781 tem
= TYPE_FIELDS (t
);
4784 if (TREE_CODE (tem
) == FIELD_DECL
)
4785 fld_worklist_push (tem
, fld
);
4786 tem
= TREE_CHAIN (tem
);
4790 fld_worklist_push (TREE_CHAIN (t
), fld
);
4793 else if (TREE_CODE (t
) == BLOCK
)
4796 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4797 fld_worklist_push (tem
, fld
);
4798 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4799 fld_worklist_push (tem
, fld
);
4800 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4803 fld_worklist_push (TREE_TYPE (t
), fld
);
4809 /* Find decls and types in T. */
4812 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4816 if (!pointer_set_contains (fld
->pset
, t
))
4817 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4818 if (VEC_empty (tree
, fld
->worklist
))
4820 t
= VEC_pop (tree
, fld
->worklist
);
4824 /* Translate all the types in LIST with the corresponding runtime
4828 get_eh_types_for_runtime (tree list
)
4832 if (list
== NULL_TREE
)
4835 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4837 list
= TREE_CHAIN (list
);
4840 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4841 TREE_CHAIN (prev
) = n
;
4842 prev
= TREE_CHAIN (prev
);
4843 list
= TREE_CHAIN (list
);
4850 /* Find decls and types referenced in EH region R and store them in
4851 FLD->DECLS and FLD->TYPES. */
4854 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4865 /* The types referenced in each catch must first be changed to the
4866 EH types used at runtime. This removes references to FE types
4868 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4870 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4871 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4876 case ERT_ALLOWED_EXCEPTIONS
:
4877 r
->u
.allowed
.type_list
4878 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4879 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4882 case ERT_MUST_NOT_THROW
:
4883 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4884 find_decls_types_r
, fld
, fld
->pset
);
4890 /* Find decls and types referenced in cgraph node N and store them in
4891 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4892 look for *every* kind of DECL and TYPE node reachable from N,
4893 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4894 NAMESPACE_DECLs, etc). */
4897 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4900 struct function
*fn
;
4904 find_decls_types (n
->decl
, fld
);
4906 if (!gimple_has_body_p (n
->decl
))
4909 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
4911 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
4913 /* Traverse locals. */
4914 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
4915 find_decls_types (t
, fld
);
4917 /* Traverse EH regions in FN. */
4920 FOR_ALL_EH_REGION_FN (r
, fn
)
4921 find_decls_types_in_eh_region (r
, fld
);
4924 /* Traverse every statement in FN. */
4925 FOR_EACH_BB_FN (bb
, fn
)
4927 gimple_stmt_iterator si
;
4930 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
4932 gimple phi
= gsi_stmt (si
);
4934 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4936 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
4937 find_decls_types (*arg_p
, fld
);
4941 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
4943 gimple stmt
= gsi_stmt (si
);
4945 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
4947 tree arg
= gimple_op (stmt
, i
);
4948 find_decls_types (arg
, fld
);
4955 /* Find decls and types referenced in varpool node N and store them in
4956 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4957 look for *every* kind of DECL and TYPE node reachable from N,
4958 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4959 NAMESPACE_DECLs, etc). */
4962 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
4964 find_decls_types (v
->decl
, fld
);
4967 /* If T needs an assembler name, have one created for it. */
4970 assign_assembler_name_if_neeeded (tree t
)
4972 if (need_assembler_name_p (t
))
4974 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4975 diagnostics that use input_location to show locus
4976 information. The problem here is that, at this point,
4977 input_location is generally anchored to the end of the file
4978 (since the parser is long gone), so we don't have a good
4979 position to pin it to.
4981 To alleviate this problem, this uses the location of T's
4982 declaration. Examples of this are
4983 testsuite/g++.dg/template/cond2.C and
4984 testsuite/g++.dg/template/pr35240.C. */
4985 location_t saved_location
= input_location
;
4986 input_location
= DECL_SOURCE_LOCATION (t
);
4988 decl_assembler_name (t
);
4990 input_location
= saved_location
;
4995 /* Free language specific information for every operand and expression
4996 in every node of the call graph. This process operates in three stages:
4998 1- Every callgraph node and varpool node is traversed looking for
4999 decls and types embedded in them. This is a more exhaustive
5000 search than that done by find_referenced_vars, because it will
5001 also collect individual fields, decls embedded in types, etc.
5003 2- All the decls found are sent to free_lang_data_in_decl.
5005 3- All the types found are sent to free_lang_data_in_type.
5007 The ordering between decls and types is important because
5008 free_lang_data_in_decl sets assembler names, which includes
5009 mangling. So types cannot be freed up until assembler names have
5013 free_lang_data_in_cgraph (void)
5015 struct cgraph_node
*n
;
5016 struct varpool_node
*v
;
5017 struct free_lang_data_d fld
;
5022 /* Initialize sets and arrays to store referenced decls and types. */
5023 fld
.pset
= pointer_set_create ();
5024 fld
.worklist
= NULL
;
5025 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5026 fld
.types
= VEC_alloc (tree
, heap
, 100);
5028 /* Find decls and types in the body of every function in the callgraph. */
5029 for (n
= cgraph_nodes
; n
; n
= n
->next
)
5030 find_decls_types_in_node (n
, &fld
);
5032 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5033 find_decls_types (p
->decl
, &fld
);
5035 /* Find decls and types in every varpool symbol. */
5036 for (v
= varpool_nodes
; v
; v
= v
->next
)
5037 find_decls_types_in_var (v
, &fld
);
5039 /* Set the assembler name on every decl found. We need to do this
5040 now because free_lang_data_in_decl will invalidate data needed
5041 for mangling. This breaks mangling on interdependent decls. */
5042 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5043 assign_assembler_name_if_neeeded (t
);
5045 /* Traverse every decl found freeing its language data. */
5046 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5047 free_lang_data_in_decl (t
);
5049 /* Traverse every type found freeing its language data. */
5050 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5051 free_lang_data_in_type (t
);
5053 pointer_set_destroy (fld
.pset
);
5054 VEC_free (tree
, heap
, fld
.worklist
);
5055 VEC_free (tree
, heap
, fld
.decls
);
5056 VEC_free (tree
, heap
, fld
.types
);
5060 /* Free resources that are used by FE but are not needed once they are done. */
5063 free_lang_data (void)
5067 /* If we are the LTO frontend we have freed lang-specific data already. */
5069 || !flag_generate_lto
)
5072 /* Allocate and assign alias sets to the standard integer types
5073 while the slots are still in the way the frontends generated them. */
5074 for (i
= 0; i
< itk_none
; ++i
)
5075 if (integer_types
[i
])
5076 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5078 /* Traverse the IL resetting language specific information for
5079 operands, expressions, etc. */
5080 free_lang_data_in_cgraph ();
5082 /* Create gimple variants for common types. */
5083 ptrdiff_type_node
= integer_type_node
;
5084 fileptr_type_node
= ptr_type_node
;
5085 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
5086 || (TYPE_MODE (boolean_type_node
)
5087 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
5088 || TYPE_PRECISION (boolean_type_node
) != 1
5089 || !TYPE_UNSIGNED (boolean_type_node
))
5091 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5092 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5093 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5094 TYPE_PRECISION (boolean_type_node
) = 1;
5095 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5096 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5099 /* Unify char_type_node with its properly signed variant. */
5100 if (TYPE_UNSIGNED (char_type_node
))
5101 unsigned_char_type_node
= char_type_node
;
5103 signed_char_type_node
= char_type_node
;
5105 /* Reset some langhooks. Do not reset types_compatible_p, it may
5106 still be used indirectly via the get_alias_set langhook. */
5107 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5108 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5109 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5110 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
5112 /* Reset diagnostic machinery. */
5113 diagnostic_starter (global_dc
) = default_tree_diagnostic_starter
;
5114 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5115 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5121 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5125 "*free_lang_data", /* name */
5127 free_lang_data
, /* execute */
5130 0, /* static_pass_number */
5131 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5132 0, /* properties_required */
5133 0, /* properties_provided */
5134 0, /* properties_destroyed */
5135 0, /* todo_flags_start */
5136 TODO_ggc_collect
/* todo_flags_finish */
5140 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5143 We try both `text' and `__text__', ATTR may be either one. */
5144 /* ??? It might be a reasonable simplification to require ATTR to be only
5145 `text'. One might then also require attribute lists to be stored in
5146 their canonicalized form. */
5149 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5154 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5157 p
= IDENTIFIER_POINTER (ident
);
5158 ident_len
= IDENTIFIER_LENGTH (ident
);
5160 if (ident_len
== attr_len
5161 && strcmp (attr
, p
) == 0)
5164 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5167 gcc_assert (attr
[1] == '_');
5168 gcc_assert (attr
[attr_len
- 2] == '_');
5169 gcc_assert (attr
[attr_len
- 1] == '_');
5170 if (ident_len
== attr_len
- 4
5171 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5176 if (ident_len
== attr_len
+ 4
5177 && p
[0] == '_' && p
[1] == '_'
5178 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5179 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5186 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5189 We try both `text' and `__text__', ATTR may be either one. */
5192 is_attribute_p (const char *attr
, const_tree ident
)
5194 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5197 /* Given an attribute name and a list of attributes, return a pointer to the
5198 attribute's list element if the attribute is part of the list, or NULL_TREE
5199 if not found. If the attribute appears more than once, this only
5200 returns the first occurrence; the TREE_CHAIN of the return value should
5201 be passed back in if further occurrences are wanted. */
5204 lookup_attribute (const char *attr_name
, tree list
)
5207 size_t attr_len
= strlen (attr_name
);
5209 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5211 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5212 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5218 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5222 remove_attribute (const char *attr_name
, tree list
)
5225 size_t attr_len
= strlen (attr_name
);
5227 for (p
= &list
; *p
; )
5230 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5231 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5232 *p
= TREE_CHAIN (l
);
5234 p
= &TREE_CHAIN (l
);
5240 /* Return an attribute list that is the union of a1 and a2. */
5243 merge_attributes (tree a1
, tree a2
)
5247 /* Either one unset? Take the set one. */
5249 if ((attributes
= a1
) == 0)
5252 /* One that completely contains the other? Take it. */
5254 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5256 if (attribute_list_contained (a2
, a1
))
5260 /* Pick the longest list, and hang on the other list. */
5262 if (list_length (a1
) < list_length (a2
))
5263 attributes
= a2
, a2
= a1
;
5265 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5268 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5271 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5274 if (TREE_VALUE (a
) != NULL
5275 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
5276 && TREE_VALUE (a2
) != NULL
5277 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
5279 if (simple_cst_list_equal (TREE_VALUE (a
),
5280 TREE_VALUE (a2
)) == 1)
5283 else if (simple_cst_equal (TREE_VALUE (a
),
5284 TREE_VALUE (a2
)) == 1)
5289 a1
= copy_node (a2
);
5290 TREE_CHAIN (a1
) = attributes
;
5299 /* Given types T1 and T2, merge their attributes and return
5303 merge_type_attributes (tree t1
, tree t2
)
5305 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5306 TYPE_ATTRIBUTES (t2
));
5309 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5313 merge_decl_attributes (tree olddecl
, tree newdecl
)
5315 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5316 DECL_ATTRIBUTES (newdecl
));
5319 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5321 /* Specialization of merge_decl_attributes for various Windows targets.
5323 This handles the following situation:
5325 __declspec (dllimport) int foo;
5328 The second instance of `foo' nullifies the dllimport. */
5331 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5334 int delete_dllimport_p
= 1;
5336 /* What we need to do here is remove from `old' dllimport if it doesn't
5337 appear in `new'. dllimport behaves like extern: if a declaration is
5338 marked dllimport and a definition appears later, then the object
5339 is not dllimport'd. We also remove a `new' dllimport if the old list
5340 contains dllexport: dllexport always overrides dllimport, regardless
5341 of the order of declaration. */
5342 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5343 delete_dllimport_p
= 0;
5344 else if (DECL_DLLIMPORT_P (new_tree
)
5345 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5347 DECL_DLLIMPORT_P (new_tree
) = 0;
5348 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5349 "dllimport ignored", new_tree
);
5351 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5353 /* Warn about overriding a symbol that has already been used, e.g.:
5354 extern int __attribute__ ((dllimport)) foo;
5355 int* bar () {return &foo;}
5358 if (TREE_USED (old
))
5360 warning (0, "%q+D redeclared without dllimport attribute "
5361 "after being referenced with dll linkage", new_tree
);
5362 /* If we have used a variable's address with dllimport linkage,
5363 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5364 decl may already have had TREE_CONSTANT computed.
5365 We still remove the attribute so that assembler code refers
5366 to '&foo rather than '_imp__foo'. */
5367 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5368 DECL_DLLIMPORT_P (new_tree
) = 1;
5371 /* Let an inline definition silently override the external reference,
5372 but otherwise warn about attribute inconsistency. */
5373 else if (TREE_CODE (new_tree
) == VAR_DECL
5374 || !DECL_DECLARED_INLINE_P (new_tree
))
5375 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5376 "previous dllimport ignored", new_tree
);
5379 delete_dllimport_p
= 0;
5381 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5383 if (delete_dllimport_p
)
5386 const size_t attr_len
= strlen ("dllimport");
5388 /* Scan the list for dllimport and delete it. */
5389 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5391 if (is_attribute_with_length_p ("dllimport", attr_len
,
5394 if (prev
== NULL_TREE
)
5397 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5406 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5407 struct attribute_spec.handler. */
5410 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5416 /* These attributes may apply to structure and union types being created,
5417 but otherwise should pass to the declaration involved. */
5420 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5421 | (int) ATTR_FLAG_ARRAY_NEXT
))
5423 *no_add_attrs
= true;
5424 return tree_cons (name
, args
, NULL_TREE
);
5426 if (TREE_CODE (node
) == RECORD_TYPE
5427 || TREE_CODE (node
) == UNION_TYPE
)
5429 node
= TYPE_NAME (node
);
5435 warning (OPT_Wattributes
, "%qE attribute ignored",
5437 *no_add_attrs
= true;
5442 if (TREE_CODE (node
) != FUNCTION_DECL
5443 && TREE_CODE (node
) != VAR_DECL
5444 && TREE_CODE (node
) != TYPE_DECL
)
5446 *no_add_attrs
= true;
5447 warning (OPT_Wattributes
, "%qE attribute ignored",
5452 if (TREE_CODE (node
) == TYPE_DECL
5453 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5454 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5456 *no_add_attrs
= true;
5457 warning (OPT_Wattributes
, "%qE attribute ignored",
5462 is_dllimport
= is_attribute_p ("dllimport", name
);
5464 /* Report error on dllimport ambiguities seen now before they cause
5468 /* Honor any target-specific overrides. */
5469 if (!targetm
.valid_dllimport_attribute_p (node
))
5470 *no_add_attrs
= true;
5472 else if (TREE_CODE (node
) == FUNCTION_DECL
5473 && DECL_DECLARED_INLINE_P (node
))
5475 warning (OPT_Wattributes
, "inline function %q+D declared as "
5476 " dllimport: attribute ignored", node
);
5477 *no_add_attrs
= true;
5479 /* Like MS, treat definition of dllimported variables and
5480 non-inlined functions on declaration as syntax errors. */
5481 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5483 error ("function %q+D definition is marked dllimport", node
);
5484 *no_add_attrs
= true;
5487 else if (TREE_CODE (node
) == VAR_DECL
)
5489 if (DECL_INITIAL (node
))
5491 error ("variable %q+D definition is marked dllimport",
5493 *no_add_attrs
= true;
5496 /* `extern' needn't be specified with dllimport.
5497 Specify `extern' now and hope for the best. Sigh. */
5498 DECL_EXTERNAL (node
) = 1;
5499 /* Also, implicitly give dllimport'd variables declared within
5500 a function global scope, unless declared static. */
5501 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5502 TREE_PUBLIC (node
) = 1;
5505 if (*no_add_attrs
== false)
5506 DECL_DLLIMPORT_P (node
) = 1;
5508 else if (TREE_CODE (node
) == FUNCTION_DECL
5509 && DECL_DECLARED_INLINE_P (node
))
5510 /* An exported function, even if inline, must be emitted. */
5511 DECL_EXTERNAL (node
) = 0;
5513 /* Report error if symbol is not accessible at global scope. */
5514 if (!TREE_PUBLIC (node
)
5515 && (TREE_CODE (node
) == VAR_DECL
5516 || TREE_CODE (node
) == FUNCTION_DECL
))
5518 error ("external linkage required for symbol %q+D because of "
5519 "%qE attribute", node
, name
);
5520 *no_add_attrs
= true;
5523 /* A dllexport'd entity must have default visibility so that other
5524 program units (shared libraries or the main executable) can see
5525 it. A dllimport'd entity must have default visibility so that
5526 the linker knows that undefined references within this program
5527 unit can be resolved by the dynamic linker. */
5530 if (DECL_VISIBILITY_SPECIFIED (node
)
5531 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5532 error ("%qE implies default visibility, but %qD has already "
5533 "been declared with a different visibility",
5535 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5536 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5542 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5544 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5545 of the various TYPE_QUAL values. */
5548 set_type_quals (tree type
, int type_quals
)
5550 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5551 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5552 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5553 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5556 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5559 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5561 return (TYPE_QUALS (cand
) == type_quals
5562 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5563 /* Apparently this is needed for Objective-C. */
5564 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5565 /* Check alignment. */
5566 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5567 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5568 TYPE_ATTRIBUTES (base
)));
5571 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5574 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5576 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5577 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5578 /* Apparently this is needed for Objective-C. */
5579 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5580 /* Check alignment. */
5581 && TYPE_ALIGN (cand
) == align
5582 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5583 TYPE_ATTRIBUTES (base
)));
5586 /* Return a version of the TYPE, qualified as indicated by the
5587 TYPE_QUALS, if one exists. If no qualified version exists yet,
5588 return NULL_TREE. */
5591 get_qualified_type (tree type
, int type_quals
)
5595 if (TYPE_QUALS (type
) == type_quals
)
5598 /* Search the chain of variants to see if there is already one there just
5599 like the one we need to have. If so, use that existing one. We must
5600 preserve the TYPE_NAME, since there is code that depends on this. */
5601 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5602 if (check_qualified_type (t
, type
, type_quals
))
5608 /* Like get_qualified_type, but creates the type if it does not
5609 exist. This function never returns NULL_TREE. */
5612 build_qualified_type (tree type
, int type_quals
)
5616 /* See if we already have the appropriate qualified variant. */
5617 t
= get_qualified_type (type
, type_quals
);
5619 /* If not, build it. */
5622 t
= build_variant_type_copy (type
);
5623 set_type_quals (t
, type_quals
);
5625 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5626 /* Propagate structural equality. */
5627 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5628 else if (TYPE_CANONICAL (type
) != type
)
5629 /* Build the underlying canonical type, since it is different
5631 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5634 /* T is its own canonical type. */
5635 TYPE_CANONICAL (t
) = t
;
5642 /* Create a variant of type T with alignment ALIGN. */
5645 build_aligned_type (tree type
, unsigned int align
)
5649 if (TYPE_PACKED (type
)
5650 || TYPE_ALIGN (type
) == align
)
5653 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5654 if (check_aligned_type (t
, type
, align
))
5657 t
= build_variant_type_copy (type
);
5658 TYPE_ALIGN (t
) = align
;
5663 /* Create a new distinct copy of TYPE. The new type is made its own
5664 MAIN_VARIANT. If TYPE requires structural equality checks, the
5665 resulting type requires structural equality checks; otherwise, its
5666 TYPE_CANONICAL points to itself. */
5669 build_distinct_type_copy (tree type
)
5671 tree t
= copy_node (type
);
5673 TYPE_POINTER_TO (t
) = 0;
5674 TYPE_REFERENCE_TO (t
) = 0;
5676 /* Set the canonical type either to a new equivalence class, or
5677 propagate the need for structural equality checks. */
5678 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5679 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5681 TYPE_CANONICAL (t
) = t
;
5683 /* Make it its own variant. */
5684 TYPE_MAIN_VARIANT (t
) = t
;
5685 TYPE_NEXT_VARIANT (t
) = 0;
5687 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5688 whose TREE_TYPE is not t. This can also happen in the Ada
5689 frontend when using subtypes. */
5694 /* Create a new variant of TYPE, equivalent but distinct. This is so
5695 the caller can modify it. TYPE_CANONICAL for the return type will
5696 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5697 are considered equal by the language itself (or that both types
5698 require structural equality checks). */
5701 build_variant_type_copy (tree type
)
5703 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5705 t
= build_distinct_type_copy (type
);
5707 /* Since we're building a variant, assume that it is a non-semantic
5708 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5709 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5711 /* Add the new type to the chain of variants of TYPE. */
5712 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5713 TYPE_NEXT_VARIANT (m
) = t
;
5714 TYPE_MAIN_VARIANT (t
) = m
;
5719 /* Return true if the from tree in both tree maps are equal. */
5722 tree_map_base_eq (const void *va
, const void *vb
)
5724 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5725 *const b
= (const struct tree_map_base
*) vb
;
5726 return (a
->from
== b
->from
);
5729 /* Hash a from tree in a tree_base_map. */
5732 tree_map_base_hash (const void *item
)
5734 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5737 /* Return true if this tree map structure is marked for garbage collection
5738 purposes. We simply return true if the from tree is marked, so that this
5739 structure goes away when the from tree goes away. */
5742 tree_map_base_marked_p (const void *p
)
5744 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5747 /* Hash a from tree in a tree_map. */
5750 tree_map_hash (const void *item
)
5752 return (((const struct tree_map
*) item
)->hash
);
5755 /* Hash a from tree in a tree_decl_map. */
5758 tree_decl_map_hash (const void *item
)
5760 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5763 /* Return the initialization priority for DECL. */
5766 decl_init_priority_lookup (tree decl
)
5768 struct tree_priority_map
*h
;
5769 struct tree_map_base in
;
5771 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5773 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5774 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5777 /* Return the finalization priority for DECL. */
5780 decl_fini_priority_lookup (tree decl
)
5782 struct tree_priority_map
*h
;
5783 struct tree_map_base in
;
5785 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5787 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5788 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5791 /* Return the initialization and finalization priority information for
5792 DECL. If there is no previous priority information, a freshly
5793 allocated structure is returned. */
5795 static struct tree_priority_map
*
5796 decl_priority_info (tree decl
)
5798 struct tree_priority_map in
;
5799 struct tree_priority_map
*h
;
5802 in
.base
.from
= decl
;
5803 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5804 h
= (struct tree_priority_map
*) *loc
;
5807 h
= ggc_alloc_cleared_tree_priority_map ();
5809 h
->base
.from
= decl
;
5810 h
->init
= DEFAULT_INIT_PRIORITY
;
5811 h
->fini
= DEFAULT_INIT_PRIORITY
;
5817 /* Set the initialization priority for DECL to PRIORITY. */
5820 decl_init_priority_insert (tree decl
, priority_type priority
)
5822 struct tree_priority_map
*h
;
5824 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5825 h
= decl_priority_info (decl
);
5829 /* Set the finalization priority for DECL to PRIORITY. */
5832 decl_fini_priority_insert (tree decl
, priority_type priority
)
5834 struct tree_priority_map
*h
;
5836 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5837 h
= decl_priority_info (decl
);
5841 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5844 print_debug_expr_statistics (void)
5846 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5847 (long) htab_size (debug_expr_for_decl
),
5848 (long) htab_elements (debug_expr_for_decl
),
5849 htab_collisions (debug_expr_for_decl
));
5852 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5855 print_value_expr_statistics (void)
5857 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5858 (long) htab_size (value_expr_for_decl
),
5859 (long) htab_elements (value_expr_for_decl
),
5860 htab_collisions (value_expr_for_decl
));
5863 /* Lookup a debug expression for FROM, and return it if we find one. */
5866 decl_debug_expr_lookup (tree from
)
5868 struct tree_decl_map
*h
, in
;
5869 in
.base
.from
= from
;
5871 h
= (struct tree_decl_map
*)
5872 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
5878 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5881 decl_debug_expr_insert (tree from
, tree to
)
5883 struct tree_decl_map
*h
;
5886 h
= ggc_alloc_tree_decl_map ();
5887 h
->base
.from
= from
;
5889 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
5891 *(struct tree_decl_map
**) loc
= h
;
5894 /* Lookup a value expression for FROM, and return it if we find one. */
5897 decl_value_expr_lookup (tree from
)
5899 struct tree_decl_map
*h
, in
;
5900 in
.base
.from
= from
;
5902 h
= (struct tree_decl_map
*)
5903 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
5909 /* Insert a mapping FROM->TO in the value expression hashtable. */
5912 decl_value_expr_insert (tree from
, tree to
)
5914 struct tree_decl_map
*h
;
5917 h
= ggc_alloc_tree_decl_map ();
5918 h
->base
.from
= from
;
5920 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
5922 *(struct tree_decl_map
**) loc
= h
;
5925 /* Hashing of types so that we don't make duplicates.
5926 The entry point is `type_hash_canon'. */
5928 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5929 with types in the TREE_VALUE slots), by adding the hash codes
5930 of the individual types. */
5933 type_hash_list (const_tree list
, hashval_t hashcode
)
5937 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5938 if (TREE_VALUE (tail
) != error_mark_node
)
5939 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
5945 /* These are the Hashtable callback functions. */
5947 /* Returns true iff the types are equivalent. */
5950 type_hash_eq (const void *va
, const void *vb
)
5952 const struct type_hash
*const a
= (const struct type_hash
*) va
,
5953 *const b
= (const struct type_hash
*) vb
;
5955 /* First test the things that are the same for all types. */
5956 if (a
->hash
!= b
->hash
5957 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
5958 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
5959 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
5960 TYPE_ATTRIBUTES (b
->type
))
5961 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
5962 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)
5963 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
5964 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
5967 switch (TREE_CODE (a
->type
))
5972 case REFERENCE_TYPE
:
5976 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
5979 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
5980 && !(TYPE_VALUES (a
->type
)
5981 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
5982 && TYPE_VALUES (b
->type
)
5983 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
5984 && type_list_equal (TYPE_VALUES (a
->type
),
5985 TYPE_VALUES (b
->type
))))
5988 /* ... fall through ... */
5993 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
5994 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
5995 TYPE_MAX_VALUE (b
->type
)))
5996 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
5997 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
5998 TYPE_MIN_VALUE (b
->type
))));
6000 case FIXED_POINT_TYPE
:
6001 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6004 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6007 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6008 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6009 || (TYPE_ARG_TYPES (a
->type
)
6010 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6011 && TYPE_ARG_TYPES (b
->type
)
6012 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6013 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6014 TYPE_ARG_TYPES (b
->type
)))));
6017 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6021 case QUAL_UNION_TYPE
:
6022 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6023 || (TYPE_FIELDS (a
->type
)
6024 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6025 && TYPE_FIELDS (b
->type
)
6026 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6027 && type_list_equal (TYPE_FIELDS (a
->type
),
6028 TYPE_FIELDS (b
->type
))));
6031 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6032 || (TYPE_ARG_TYPES (a
->type
)
6033 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6034 && TYPE_ARG_TYPES (b
->type
)
6035 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6036 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6037 TYPE_ARG_TYPES (b
->type
))))
6045 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6046 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6051 /* Return the cached hash value. */
6054 type_hash_hash (const void *item
)
6056 return ((const struct type_hash
*) item
)->hash
;
6059 /* Look in the type hash table for a type isomorphic to TYPE.
6060 If one is found, return it. Otherwise return 0. */
6063 type_hash_lookup (hashval_t hashcode
, tree type
)
6065 struct type_hash
*h
, in
;
6067 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6068 must call that routine before comparing TYPE_ALIGNs. */
6074 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6081 /* Add an entry to the type-hash-table
6082 for a type TYPE whose hash code is HASHCODE. */
6085 type_hash_add (hashval_t hashcode
, tree type
)
6087 struct type_hash
*h
;
6090 h
= ggc_alloc_type_hash ();
6093 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6097 /* Given TYPE, and HASHCODE its hash code, return the canonical
6098 object for an identical type if one already exists.
6099 Otherwise, return TYPE, and record it as the canonical object.
6101 To use this function, first create a type of the sort you want.
6102 Then compute its hash code from the fields of the type that
6103 make it different from other similar types.
6104 Then call this function and use the value. */
6107 type_hash_canon (unsigned int hashcode
, tree type
)
6111 /* The hash table only contains main variants, so ensure that's what we're
6113 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6115 /* See if the type is in the hash table already. If so, return it.
6116 Otherwise, add the type. */
6117 t1
= type_hash_lookup (hashcode
, type
);
6120 #ifdef GATHER_STATISTICS
6121 tree_node_counts
[(int) t_kind
]--;
6122 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
6128 type_hash_add (hashcode
, type
);
6133 /* See if the data pointed to by the type hash table is marked. We consider
6134 it marked if the type is marked or if a debug type number or symbol
6135 table entry has been made for the type. */
6138 type_hash_marked_p (const void *p
)
6140 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6142 return ggc_marked_p (type
);
6146 print_type_hash_statistics (void)
6148 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6149 (long) htab_size (type_hash_table
),
6150 (long) htab_elements (type_hash_table
),
6151 htab_collisions (type_hash_table
));
6154 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6155 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6156 by adding the hash codes of the individual attributes. */
6159 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6163 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6164 /* ??? Do we want to add in TREE_VALUE too? */
6165 hashcode
= iterative_hash_object
6166 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6170 /* Given two lists of attributes, return true if list l2 is
6171 equivalent to l1. */
6174 attribute_list_equal (const_tree l1
, const_tree l2
)
6176 return attribute_list_contained (l1
, l2
)
6177 && attribute_list_contained (l2
, l1
);
6180 /* Given two lists of attributes, return true if list L2 is
6181 completely contained within L1. */
6182 /* ??? This would be faster if attribute names were stored in a canonicalized
6183 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6184 must be used to show these elements are equivalent (which they are). */
6185 /* ??? It's not clear that attributes with arguments will always be handled
6189 attribute_list_contained (const_tree l1
, const_tree l2
)
6193 /* First check the obvious, maybe the lists are identical. */
6197 /* Maybe the lists are similar. */
6198 for (t1
= l1
, t2
= l2
;
6200 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6201 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6202 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6204 /* Maybe the lists are equal. */
6205 if (t1
== 0 && t2
== 0)
6208 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6211 /* This CONST_CAST is okay because lookup_attribute does not
6212 modify its argument and the return value is assigned to a
6214 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6215 CONST_CAST_TREE(l1
));
6217 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6220 if (TREE_VALUE (t2
) != NULL
6221 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
6222 && TREE_VALUE (attr
) != NULL
6223 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
6225 if (simple_cst_list_equal (TREE_VALUE (t2
),
6226 TREE_VALUE (attr
)) == 1)
6229 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
6240 /* Given two lists of types
6241 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6242 return 1 if the lists contain the same types in the same order.
6243 Also, the TREE_PURPOSEs must match. */
6246 type_list_equal (const_tree l1
, const_tree l2
)
6250 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6251 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6252 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6253 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6254 && (TREE_TYPE (TREE_PURPOSE (t1
))
6255 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6261 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6262 given by TYPE. If the argument list accepts variable arguments,
6263 then this function counts only the ordinary arguments. */
6266 type_num_arguments (const_tree type
)
6271 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6272 /* If the function does not take a variable number of arguments,
6273 the last element in the list will have type `void'. */
6274 if (VOID_TYPE_P (TREE_VALUE (t
)))
6282 /* Nonzero if integer constants T1 and T2
6283 represent the same constant value. */
6286 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6291 if (t1
== 0 || t2
== 0)
6294 if (TREE_CODE (t1
) == INTEGER_CST
6295 && TREE_CODE (t2
) == INTEGER_CST
6296 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6297 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6303 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6304 The precise way of comparison depends on their data type. */
6307 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6312 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6314 int t1_sgn
= tree_int_cst_sgn (t1
);
6315 int t2_sgn
= tree_int_cst_sgn (t2
);
6317 if (t1_sgn
< t2_sgn
)
6319 else if (t1_sgn
> t2_sgn
)
6321 /* Otherwise, both are non-negative, so we compare them as
6322 unsigned just in case one of them would overflow a signed
6325 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6326 return INT_CST_LT (t1
, t2
);
6328 return INT_CST_LT_UNSIGNED (t1
, t2
);
6331 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6334 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6336 if (tree_int_cst_lt (t1
, t2
))
6338 else if (tree_int_cst_lt (t2
, t1
))
6344 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6345 the host. If POS is zero, the value can be represented in a single
6346 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6347 be represented in a single unsigned HOST_WIDE_INT. */
6350 host_integerp (const_tree t
, int pos
)
6355 return (TREE_CODE (t
) == INTEGER_CST
6356 && ((TREE_INT_CST_HIGH (t
) == 0
6357 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6358 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6359 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6360 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6361 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6362 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6363 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6366 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6367 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6368 be non-negative. We must be able to satisfy the above conditions. */
6371 tree_low_cst (const_tree t
, int pos
)
6373 gcc_assert (host_integerp (t
, pos
));
6374 return TREE_INT_CST_LOW (t
);
6377 /* Return the most significant bit of the integer constant T. */
6380 tree_int_cst_msb (const_tree t
)
6384 unsigned HOST_WIDE_INT l
;
6386 /* Note that using TYPE_PRECISION here is wrong. We care about the
6387 actual bits, not the (arbitrary) range of the type. */
6388 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6389 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6390 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6391 return (l
& 1) == 1;
6394 /* Return an indication of the sign of the integer constant T.
6395 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6396 Note that -1 will never be returned if T's type is unsigned. */
6399 tree_int_cst_sgn (const_tree t
)
6401 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6403 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6405 else if (TREE_INT_CST_HIGH (t
) < 0)
6411 /* Return the minimum number of bits needed to represent VALUE in a
6412 signed or unsigned type, UNSIGNEDP says which. */
6415 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6419 /* If the value is negative, compute its negative minus 1. The latter
6420 adjustment is because the absolute value of the largest negative value
6421 is one larger than the largest positive value. This is equivalent to
6422 a bit-wise negation, so use that operation instead. */
6424 if (tree_int_cst_sgn (value
) < 0)
6425 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6427 /* Return the number of bits needed, taking into account the fact
6428 that we need one more bit for a signed than unsigned type. */
6430 if (integer_zerop (value
))
6433 log
= tree_floor_log2 (value
);
6435 return log
+ 1 + !unsignedp
;
6438 /* Compare two constructor-element-type constants. Return 1 if the lists
6439 are known to be equal; otherwise return 0. */
6442 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6444 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6446 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6449 l1
= TREE_CHAIN (l1
);
6450 l2
= TREE_CHAIN (l2
);
6456 /* Return truthvalue of whether T1 is the same tree structure as T2.
6457 Return 1 if they are the same.
6458 Return 0 if they are understandably different.
6459 Return -1 if either contains tree structure not understood by
6463 simple_cst_equal (const_tree t1
, const_tree t2
)
6465 enum tree_code code1
, code2
;
6471 if (t1
== 0 || t2
== 0)
6474 code1
= TREE_CODE (t1
);
6475 code2
= TREE_CODE (t2
);
6477 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6479 if (CONVERT_EXPR_CODE_P (code2
)
6480 || code2
== NON_LVALUE_EXPR
)
6481 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6483 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6486 else if (CONVERT_EXPR_CODE_P (code2
)
6487 || code2
== NON_LVALUE_EXPR
)
6488 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6496 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6497 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6500 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6503 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6506 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6507 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6508 TREE_STRING_LENGTH (t1
)));
6512 unsigned HOST_WIDE_INT idx
;
6513 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6514 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6516 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6519 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6520 /* ??? Should we handle also fields here? */
6521 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6522 VEC_index (constructor_elt
, v2
, idx
)->value
))
6528 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6531 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6534 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6537 const_tree arg1
, arg2
;
6538 const_call_expr_arg_iterator iter1
, iter2
;
6539 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6540 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6542 arg1
= next_const_call_expr_arg (&iter1
),
6543 arg2
= next_const_call_expr_arg (&iter2
))
6545 cmp
= simple_cst_equal (arg1
, arg2
);
6549 return arg1
== arg2
;
6553 /* Special case: if either target is an unallocated VAR_DECL,
6554 it means that it's going to be unified with whatever the
6555 TARGET_EXPR is really supposed to initialize, so treat it
6556 as being equivalent to anything. */
6557 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6558 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6559 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6560 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6561 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6562 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6565 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6570 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6572 case WITH_CLEANUP_EXPR
:
6573 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6577 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6580 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6581 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6595 /* This general rule works for most tree codes. All exceptions should be
6596 handled above. If this is a language-specific tree code, we can't
6597 trust what might be in the operand, so say we don't know
6599 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6602 switch (TREE_CODE_CLASS (code1
))
6606 case tcc_comparison
:
6607 case tcc_expression
:
6611 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6613 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6625 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6626 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6627 than U, respectively. */
6630 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6632 if (tree_int_cst_sgn (t
) < 0)
6634 else if (TREE_INT_CST_HIGH (t
) != 0)
6636 else if (TREE_INT_CST_LOW (t
) == u
)
6638 else if (TREE_INT_CST_LOW (t
) < u
)
6644 /* Return true if CODE represents an associative tree code. Otherwise
6647 associative_tree_code (enum tree_code code
)
6666 /* Return true if CODE represents a commutative tree code. Otherwise
6669 commutative_tree_code (enum tree_code code
)
6682 case UNORDERED_EXPR
:
6686 case TRUTH_AND_EXPR
:
6687 case TRUTH_XOR_EXPR
:
6697 /* Return true if CODE represents a ternary tree code for which the
6698 first two operands are commutative. Otherwise return false. */
6700 commutative_ternary_tree_code (enum tree_code code
)
6704 case WIDEN_MULT_PLUS_EXPR
:
6705 case WIDEN_MULT_MINUS_EXPR
:
6714 /* Generate a hash value for an expression. This can be used iteratively
6715 by passing a previous result as the VAL argument.
6717 This function is intended to produce the same hash for expressions which
6718 would compare equal using operand_equal_p. */
6721 iterative_hash_expr (const_tree t
, hashval_t val
)
6724 enum tree_code code
;
6728 return iterative_hash_hashval_t (0, val
);
6730 code
= TREE_CODE (t
);
6734 /* Alas, constants aren't shared, so we can't rely on pointer
6737 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6738 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6741 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6743 return iterative_hash_hashval_t (val2
, val
);
6747 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6749 return iterative_hash_hashval_t (val2
, val
);
6752 return iterative_hash (TREE_STRING_POINTER (t
),
6753 TREE_STRING_LENGTH (t
), val
);
6755 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6756 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6758 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6760 /* We can just compare by pointer. */
6761 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6762 case PLACEHOLDER_EXPR
:
6763 /* The node itself doesn't matter. */
6766 /* A list of expressions, for a CALL_EXPR or as the elements of a
6768 for (; t
; t
= TREE_CHAIN (t
))
6769 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6773 unsigned HOST_WIDE_INT idx
;
6775 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6777 val
= iterative_hash_expr (field
, val
);
6778 val
= iterative_hash_expr (value
, val
);
6784 /* The type of the second operand is relevant, except for
6785 its top-level qualifiers. */
6786 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
6788 val
= iterative_hash_object (TYPE_HASH (type
), val
);
6790 /* We could use the standard hash computation from this point
6792 val
= iterative_hash_object (code
, val
);
6793 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
6794 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6798 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6799 Otherwise nodes that compare equal according to operand_equal_p might
6800 get different hash codes. However, don't do this for machine specific
6801 or front end builtins, since the function code is overloaded in those
6803 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6804 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6806 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6807 code
= TREE_CODE (t
);
6811 tclass
= TREE_CODE_CLASS (code
);
6813 if (tclass
== tcc_declaration
)
6815 /* DECL's have a unique ID */
6816 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6820 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6822 val
= iterative_hash_object (code
, val
);
6824 /* Don't hash the type, that can lead to having nodes which
6825 compare equal according to operand_equal_p, but which
6826 have different hash codes. */
6827 if (CONVERT_EXPR_CODE_P (code
)
6828 || code
== NON_LVALUE_EXPR
)
6830 /* Make sure to include signness in the hash computation. */
6831 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6832 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6835 else if (commutative_tree_code (code
))
6837 /* It's a commutative expression. We want to hash it the same
6838 however it appears. We do this by first hashing both operands
6839 and then rehashing based on the order of their independent
6841 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6842 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6846 t
= one
, one
= two
, two
= t
;
6848 val
= iterative_hash_hashval_t (one
, val
);
6849 val
= iterative_hash_hashval_t (two
, val
);
6852 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6853 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6860 /* Generate a hash value for a pair of expressions. This can be used
6861 iteratively by passing a previous result as the VAL argument.
6863 The same hash value is always returned for a given pair of expressions,
6864 regardless of the order in which they are presented. This is useful in
6865 hashing the operands of commutative functions. */
6868 iterative_hash_exprs_commutative (const_tree t1
,
6869 const_tree t2
, hashval_t val
)
6871 hashval_t one
= iterative_hash_expr (t1
, 0);
6872 hashval_t two
= iterative_hash_expr (t2
, 0);
6876 t
= one
, one
= two
, two
= t
;
6877 val
= iterative_hash_hashval_t (one
, val
);
6878 val
= iterative_hash_hashval_t (two
, val
);
6883 /* Constructors for pointer, array and function types.
6884 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6885 constructed by language-dependent code, not here.) */
6887 /* Construct, lay out and return the type of pointers to TO_TYPE with
6888 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6889 reference all of memory. If such a type has already been
6890 constructed, reuse it. */
6893 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6898 if (to_type
== error_mark_node
)
6899 return error_mark_node
;
6901 /* If the pointed-to type has the may_alias attribute set, force
6902 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6903 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6904 can_alias_all
= true;
6906 /* In some cases, languages will have things that aren't a POINTER_TYPE
6907 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6908 In that case, return that type without regard to the rest of our
6911 ??? This is a kludge, but consistent with the way this function has
6912 always operated and there doesn't seem to be a good way to avoid this
6914 if (TYPE_POINTER_TO (to_type
) != 0
6915 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6916 return TYPE_POINTER_TO (to_type
);
6918 /* First, if we already have a type for pointers to TO_TYPE and it's
6919 the proper mode, use it. */
6920 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6921 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6924 t
= make_node (POINTER_TYPE
);
6926 TREE_TYPE (t
) = to_type
;
6927 SET_TYPE_MODE (t
, mode
);
6928 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6929 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6930 TYPE_POINTER_TO (to_type
) = t
;
6932 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6933 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6934 else if (TYPE_CANONICAL (to_type
) != to_type
)
6936 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
6937 mode
, can_alias_all
);
6939 /* Lay out the type. This function has many callers that are concerned
6940 with expression-construction, and this simplifies them all. */
6946 /* By default build pointers in ptr_mode. */
6949 build_pointer_type (tree to_type
)
6951 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
6952 : TYPE_ADDR_SPACE (to_type
);
6953 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
6954 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
6957 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6960 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
6965 if (to_type
== error_mark_node
)
6966 return error_mark_node
;
6968 /* If the pointed-to type has the may_alias attribute set, force
6969 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6970 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6971 can_alias_all
= true;
6973 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6974 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6975 In that case, return that type without regard to the rest of our
6978 ??? This is a kludge, but consistent with the way this function has
6979 always operated and there doesn't seem to be a good way to avoid this
6981 if (TYPE_REFERENCE_TO (to_type
) != 0
6982 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
6983 return TYPE_REFERENCE_TO (to_type
);
6985 /* First, if we already have a type for pointers to TO_TYPE and it's
6986 the proper mode, use it. */
6987 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
6988 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6991 t
= make_node (REFERENCE_TYPE
);
6993 TREE_TYPE (t
) = to_type
;
6994 SET_TYPE_MODE (t
, mode
);
6995 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6996 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
6997 TYPE_REFERENCE_TO (to_type
) = t
;
6999 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7000 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7001 else if (TYPE_CANONICAL (to_type
) != to_type
)
7003 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7004 mode
, can_alias_all
);
7012 /* Build the node for the type of references-to-TO_TYPE by default
7016 build_reference_type (tree to_type
)
7018 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7019 : TYPE_ADDR_SPACE (to_type
);
7020 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7021 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7024 /* Build a type that is compatible with t but has no cv quals anywhere
7027 const char *const *const * -> char ***. */
7030 build_type_no_quals (tree t
)
7032 switch (TREE_CODE (t
))
7035 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7037 TYPE_REF_CAN_ALIAS_ALL (t
));
7038 case REFERENCE_TYPE
:
7040 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7042 TYPE_REF_CAN_ALIAS_ALL (t
));
7044 return TYPE_MAIN_VARIANT (t
);
7048 #define MAX_INT_CACHED_PREC \
7049 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7050 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7052 /* Builds a signed or unsigned integer type of precision PRECISION.
7053 Used for C bitfields whose precision does not match that of
7054 built-in target types. */
7056 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7062 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7064 if (precision
<= MAX_INT_CACHED_PREC
)
7066 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7071 itype
= make_node (INTEGER_TYPE
);
7072 TYPE_PRECISION (itype
) = precision
;
7075 fixup_unsigned_type (itype
);
7077 fixup_signed_type (itype
);
7080 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7081 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7082 if (precision
<= MAX_INT_CACHED_PREC
)
7083 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7088 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7089 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7090 is true, reuse such a type that has already been constructed. */
7093 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7095 tree itype
= make_node (INTEGER_TYPE
);
7097 TREE_TYPE (itype
) = type
;
7099 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7100 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7102 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7103 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7104 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7105 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7106 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7107 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7109 if ((TYPE_MIN_VALUE (itype
)
7110 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7111 || (TYPE_MAX_VALUE (itype
)
7112 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7114 /* Since we cannot reliably merge this type, we need to compare it using
7115 structural equality checks. */
7116 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7122 hashval_t hash
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), 0);
7123 hash
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hash
);
7124 hash
= iterative_hash_hashval_t (TYPE_HASH (type
), hash
);
7125 itype
= type_hash_canon (hash
, itype
);
7131 /* Wrapper around build_range_type_1 with SHARED set to true. */
7134 build_range_type (tree type
, tree lowval
, tree highval
)
7136 return build_range_type_1 (type
, lowval
, highval
, true);
7139 /* Wrapper around build_range_type_1 with SHARED set to false. */
7142 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7144 return build_range_type_1 (type
, lowval
, highval
, false);
7147 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7148 MAXVAL should be the maximum value in the domain
7149 (one less than the length of the array).
7151 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7152 We don't enforce this limit, that is up to caller (e.g. language front end).
7153 The limit exists because the result is a signed type and we don't handle
7154 sizes that use more than one HOST_WIDE_INT. */
7157 build_index_type (tree maxval
)
7159 return build_range_type (sizetype
, size_zero_node
, maxval
);
7162 /* Return true if the debug information for TYPE, a subtype, should be emitted
7163 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7164 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7165 debug info and doesn't reflect the source code. */
7168 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7170 tree base_type
= TREE_TYPE (type
), low
, high
;
7172 /* Subrange types have a base type which is an integral type. */
7173 if (!INTEGRAL_TYPE_P (base_type
))
7176 /* Get the real bounds of the subtype. */
7177 if (lang_hooks
.types
.get_subrange_bounds
)
7178 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7181 low
= TYPE_MIN_VALUE (type
);
7182 high
= TYPE_MAX_VALUE (type
);
7185 /* If the type and its base type have the same representation and the same
7186 name, then the type is not a subrange but a copy of the base type. */
7187 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7188 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7189 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7190 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7191 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7193 tree type_name
= TYPE_NAME (type
);
7194 tree base_type_name
= TYPE_NAME (base_type
);
7196 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7197 type_name
= DECL_NAME (type_name
);
7199 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7200 base_type_name
= DECL_NAME (base_type_name
);
7202 if (type_name
== base_type_name
)
7213 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7214 and number of elements specified by the range of values of INDEX_TYPE.
7215 If SHARED is true, reuse such a type that has already been constructed. */
7218 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7222 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7224 error ("arrays of functions are not meaningful");
7225 elt_type
= integer_type_node
;
7228 t
= make_node (ARRAY_TYPE
);
7229 TREE_TYPE (t
) = elt_type
;
7230 TYPE_DOMAIN (t
) = index_type
;
7231 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7234 /* If the element type is incomplete at this point we get marked for
7235 structural equality. Do not record these types in the canonical
7237 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7242 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7244 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7245 t
= type_hash_canon (hashcode
, t
);
7248 if (TYPE_CANONICAL (t
) == t
)
7250 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7251 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7252 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7253 else if (TYPE_CANONICAL (elt_type
) != elt_type
7254 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7256 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7258 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7265 /* Wrapper around build_array_type_1 with SHARED set to true. */
7268 build_array_type (tree elt_type
, tree index_type
)
7270 return build_array_type_1 (elt_type
, index_type
, true);
7273 /* Wrapper around build_array_type_1 with SHARED set to false. */
7276 build_nonshared_array_type (tree elt_type
, tree index_type
)
7278 return build_array_type_1 (elt_type
, index_type
, false);
7281 /* Recursively examines the array elements of TYPE, until a non-array
7282 element type is found. */
7285 strip_array_types (tree type
)
7287 while (TREE_CODE (type
) == ARRAY_TYPE
)
7288 type
= TREE_TYPE (type
);
7293 /* Computes the canonical argument types from the argument type list
7296 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7297 on entry to this function, or if any of the ARGTYPES are
7300 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7301 true on entry to this function, or if any of the ARGTYPES are
7304 Returns a canonical argument list, which may be ARGTYPES when the
7305 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7306 true) or would not differ from ARGTYPES. */
7309 maybe_canonicalize_argtypes(tree argtypes
,
7310 bool *any_structural_p
,
7311 bool *any_noncanonical_p
)
7314 bool any_noncanonical_argtypes_p
= false;
7316 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7318 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7319 /* Fail gracefully by stating that the type is structural. */
7320 *any_structural_p
= true;
7321 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7322 *any_structural_p
= true;
7323 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7324 || TREE_PURPOSE (arg
))
7325 /* If the argument has a default argument, we consider it
7326 non-canonical even though the type itself is canonical.
7327 That way, different variants of function and method types
7328 with default arguments will all point to the variant with
7329 no defaults as their canonical type. */
7330 any_noncanonical_argtypes_p
= true;
7333 if (*any_structural_p
)
7336 if (any_noncanonical_argtypes_p
)
7338 /* Build the canonical list of argument types. */
7339 tree canon_argtypes
= NULL_TREE
;
7340 bool is_void
= false;
7342 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7344 if (arg
== void_list_node
)
7347 canon_argtypes
= tree_cons (NULL_TREE
,
7348 TYPE_CANONICAL (TREE_VALUE (arg
)),
7352 canon_argtypes
= nreverse (canon_argtypes
);
7354 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7356 /* There is a non-canonical type. */
7357 *any_noncanonical_p
= true;
7358 return canon_argtypes
;
7361 /* The canonical argument types are the same as ARGTYPES. */
7365 /* Construct, lay out and return
7366 the type of functions returning type VALUE_TYPE
7367 given arguments of types ARG_TYPES.
7368 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7369 are data type nodes for the arguments of the function.
7370 If such a type has already been constructed, reuse it. */
7373 build_function_type (tree value_type
, tree arg_types
)
7376 hashval_t hashcode
= 0;
7377 bool any_structural_p
, any_noncanonical_p
;
7378 tree canon_argtypes
;
7380 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7382 error ("function return type cannot be function");
7383 value_type
= integer_type_node
;
7386 /* Make a node of the sort we want. */
7387 t
= make_node (FUNCTION_TYPE
);
7388 TREE_TYPE (t
) = value_type
;
7389 TYPE_ARG_TYPES (t
) = arg_types
;
7391 /* If we already have such a type, use the old one. */
7392 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7393 hashcode
= type_hash_list (arg_types
, hashcode
);
7394 t
= type_hash_canon (hashcode
, t
);
7396 /* Set up the canonical type. */
7397 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7398 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7399 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7401 &any_noncanonical_p
);
7402 if (any_structural_p
)
7403 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7404 else if (any_noncanonical_p
)
7405 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7408 if (!COMPLETE_TYPE_P (t
))
7413 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7416 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7418 tree new_type
= NULL
;
7419 tree args
, new_args
= NULL
, t
;
7423 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7424 args
= TREE_CHAIN (args
), i
++)
7425 if (!bitmap_bit_p (args_to_skip
, i
))
7426 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7428 new_reversed
= nreverse (new_args
);
7432 TREE_CHAIN (new_args
) = void_list_node
;
7434 new_reversed
= void_list_node
;
7437 /* Use copy_node to preserve as much as possible from original type
7438 (debug info, attribute lists etc.)
7439 Exception is METHOD_TYPEs must have THIS argument.
7440 When we are asked to remove it, we need to build new FUNCTION_TYPE
7442 if (TREE_CODE (orig_type
) != METHOD_TYPE
7443 || !bitmap_bit_p (args_to_skip
, 0))
7445 new_type
= build_distinct_type_copy (orig_type
);
7446 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7451 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7453 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7456 /* This is a new type, not a copy of an old type. Need to reassociate
7457 variants. We can handle everything except the main variant lazily. */
7458 t
= TYPE_MAIN_VARIANT (orig_type
);
7461 TYPE_MAIN_VARIANT (new_type
) = t
;
7462 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7463 TYPE_NEXT_VARIANT (t
) = new_type
;
7467 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7468 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7473 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7475 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7476 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7477 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7480 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7482 tree new_decl
= copy_node (orig_decl
);
7485 new_type
= TREE_TYPE (orig_decl
);
7486 if (prototype_p (new_type
))
7487 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7488 TREE_TYPE (new_decl
) = new_type
;
7490 /* For declarations setting DECL_VINDEX (i.e. methods)
7491 we expect first argument to be THIS pointer. */
7492 if (bitmap_bit_p (args_to_skip
, 0))
7493 DECL_VINDEX (new_decl
) = NULL_TREE
;
7495 /* When signature changes, we need to clear builtin info. */
7496 if (DECL_BUILT_IN (new_decl
) && !bitmap_empty_p (args_to_skip
))
7498 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7499 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7504 /* Build a function type. The RETURN_TYPE is the type returned by the
7505 function. If VAARGS is set, no void_type_node is appended to the
7506 the list. ARGP must be always be terminated be a NULL_TREE. */
7509 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7513 t
= va_arg (argp
, tree
);
7514 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7515 args
= tree_cons (NULL_TREE
, t
, args
);
7520 if (args
!= NULL_TREE
)
7521 args
= nreverse (args
);
7522 gcc_assert (last
!= void_list_node
);
7524 else if (args
== NULL_TREE
)
7525 args
= void_list_node
;
7529 args
= nreverse (args
);
7530 TREE_CHAIN (last
) = void_list_node
;
7532 args
= build_function_type (return_type
, args
);
7537 /* Build a function type. The RETURN_TYPE is the type returned by the
7538 function. If additional arguments are provided, they are
7539 additional argument types. The list of argument types must always
7540 be terminated by NULL_TREE. */
7543 build_function_type_list (tree return_type
, ...)
7548 va_start (p
, return_type
);
7549 args
= build_function_type_list_1 (false, return_type
, p
);
7554 /* Build a variable argument function type. The RETURN_TYPE is the
7555 type returned by the function. If additional arguments are provided,
7556 they are additional argument types. The list of argument types must
7557 always be terminated by NULL_TREE. */
7560 build_varargs_function_type_list (tree return_type
, ...)
7565 va_start (p
, return_type
);
7566 args
= build_function_type_list_1 (true, return_type
, p
);
7572 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7573 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7574 for the method. An implicit additional parameter (of type
7575 pointer-to-BASETYPE) is added to the ARGTYPES. */
7578 build_method_type_directly (tree basetype
,
7585 bool any_structural_p
, any_noncanonical_p
;
7586 tree canon_argtypes
;
7588 /* Make a node of the sort we want. */
7589 t
= make_node (METHOD_TYPE
);
7591 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7592 TREE_TYPE (t
) = rettype
;
7593 ptype
= build_pointer_type (basetype
);
7595 /* The actual arglist for this function includes a "hidden" argument
7596 which is "this". Put it into the list of argument types. */
7597 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7598 TYPE_ARG_TYPES (t
) = argtypes
;
7600 /* If we already have such a type, use the old one. */
7601 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7602 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7603 hashcode
= type_hash_list (argtypes
, hashcode
);
7604 t
= type_hash_canon (hashcode
, t
);
7606 /* Set up the canonical type. */
7608 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7609 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7611 = (TYPE_CANONICAL (basetype
) != basetype
7612 || TYPE_CANONICAL (rettype
) != rettype
);
7613 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7615 &any_noncanonical_p
);
7616 if (any_structural_p
)
7617 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7618 else if (any_noncanonical_p
)
7620 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7621 TYPE_CANONICAL (rettype
),
7623 if (!COMPLETE_TYPE_P (t
))
7629 /* Construct, lay out and return the type of methods belonging to class
7630 BASETYPE and whose arguments and values are described by TYPE.
7631 If that type exists already, reuse it.
7632 TYPE must be a FUNCTION_TYPE node. */
7635 build_method_type (tree basetype
, tree type
)
7637 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7639 return build_method_type_directly (basetype
,
7641 TYPE_ARG_TYPES (type
));
7644 /* Construct, lay out and return the type of offsets to a value
7645 of type TYPE, within an object of type BASETYPE.
7646 If a suitable offset type exists already, reuse it. */
7649 build_offset_type (tree basetype
, tree type
)
7652 hashval_t hashcode
= 0;
7654 /* Make a node of the sort we want. */
7655 t
= make_node (OFFSET_TYPE
);
7657 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7658 TREE_TYPE (t
) = type
;
7660 /* If we already have such a type, use the old one. */
7661 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7662 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7663 t
= type_hash_canon (hashcode
, t
);
7665 if (!COMPLETE_TYPE_P (t
))
7668 if (TYPE_CANONICAL (t
) == t
)
7670 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7671 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7672 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7673 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7674 || TYPE_CANONICAL (type
) != type
)
7676 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7677 TYPE_CANONICAL (type
));
7683 /* Create a complex type whose components are COMPONENT_TYPE. */
7686 build_complex_type (tree component_type
)
7691 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7692 || SCALAR_FLOAT_TYPE_P (component_type
)
7693 || FIXED_POINT_TYPE_P (component_type
));
7695 /* Make a node of the sort we want. */
7696 t
= make_node (COMPLEX_TYPE
);
7698 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7700 /* If we already have such a type, use the old one. */
7701 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7702 t
= type_hash_canon (hashcode
, t
);
7704 if (!COMPLETE_TYPE_P (t
))
7707 if (TYPE_CANONICAL (t
) == t
)
7709 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7710 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7711 else if (TYPE_CANONICAL (component_type
) != component_type
)
7713 = build_complex_type (TYPE_CANONICAL (component_type
));
7716 /* We need to create a name, since complex is a fundamental type. */
7717 if (! TYPE_NAME (t
))
7720 if (component_type
== char_type_node
)
7721 name
= "complex char";
7722 else if (component_type
== signed_char_type_node
)
7723 name
= "complex signed char";
7724 else if (component_type
== unsigned_char_type_node
)
7725 name
= "complex unsigned char";
7726 else if (component_type
== short_integer_type_node
)
7727 name
= "complex short int";
7728 else if (component_type
== short_unsigned_type_node
)
7729 name
= "complex short unsigned int";
7730 else if (component_type
== integer_type_node
)
7731 name
= "complex int";
7732 else if (component_type
== unsigned_type_node
)
7733 name
= "complex unsigned int";
7734 else if (component_type
== long_integer_type_node
)
7735 name
= "complex long int";
7736 else if (component_type
== long_unsigned_type_node
)
7737 name
= "complex long unsigned int";
7738 else if (component_type
== long_long_integer_type_node
)
7739 name
= "complex long long int";
7740 else if (component_type
== long_long_unsigned_type_node
)
7741 name
= "complex long long unsigned int";
7746 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7747 get_identifier (name
), t
);
7750 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7753 /* If TYPE is a real or complex floating-point type and the target
7754 does not directly support arithmetic on TYPE then return the wider
7755 type to be used for arithmetic on TYPE. Otherwise, return
7759 excess_precision_type (tree type
)
7761 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7763 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7764 switch (TREE_CODE (type
))
7767 switch (flt_eval_method
)
7770 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7771 return double_type_node
;
7774 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7775 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7776 return long_double_type_node
;
7783 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7785 switch (flt_eval_method
)
7788 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7789 return complex_double_type_node
;
7792 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7793 || (TYPE_MODE (TREE_TYPE (type
))
7794 == TYPE_MODE (double_type_node
)))
7795 return complex_long_double_type_node
;
7808 /* Return OP, stripped of any conversions to wider types as much as is safe.
7809 Converting the value back to OP's type makes a value equivalent to OP.
7811 If FOR_TYPE is nonzero, we return a value which, if converted to
7812 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7814 OP must have integer, real or enumeral type. Pointers are not allowed!
7816 There are some cases where the obvious value we could return
7817 would regenerate to OP if converted to OP's type,
7818 but would not extend like OP to wider types.
7819 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7820 For example, if OP is (unsigned short)(signed char)-1,
7821 we avoid returning (signed char)-1 if FOR_TYPE is int,
7822 even though extending that to an unsigned short would regenerate OP,
7823 since the result of extending (signed char)-1 to (int)
7824 is different from (int) OP. */
7827 get_unwidened (tree op
, tree for_type
)
7829 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7830 tree type
= TREE_TYPE (op
);
7832 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7834 = (for_type
!= 0 && for_type
!= type
7835 && final_prec
> TYPE_PRECISION (type
)
7836 && TYPE_UNSIGNED (type
));
7839 while (CONVERT_EXPR_P (op
))
7843 /* TYPE_PRECISION on vector types has different meaning
7844 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7845 so avoid them here. */
7846 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7849 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7850 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7852 /* Truncations are many-one so cannot be removed.
7853 Unless we are later going to truncate down even farther. */
7855 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7858 /* See what's inside this conversion. If we decide to strip it,
7860 op
= TREE_OPERAND (op
, 0);
7862 /* If we have not stripped any zero-extensions (uns is 0),
7863 we can strip any kind of extension.
7864 If we have previously stripped a zero-extension,
7865 only zero-extensions can safely be stripped.
7866 Any extension can be stripped if the bits it would produce
7867 are all going to be discarded later by truncating to FOR_TYPE. */
7871 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7873 /* TYPE_UNSIGNED says whether this is a zero-extension.
7874 Let's avoid computing it if it does not affect WIN
7875 and if UNS will not be needed again. */
7877 || CONVERT_EXPR_P (op
))
7878 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7886 /* If we finally reach a constant see if it fits in for_type and
7887 in that case convert it. */
7889 && TREE_CODE (win
) == INTEGER_CST
7890 && TREE_TYPE (win
) != for_type
7891 && int_fits_type_p (win
, for_type
))
7892 win
= fold_convert (for_type
, win
);
7897 /* Return OP or a simpler expression for a narrower value
7898 which can be sign-extended or zero-extended to give back OP.
7899 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7900 or 0 if the value should be sign-extended. */
7903 get_narrower (tree op
, int *unsignedp_ptr
)
7908 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7910 while (TREE_CODE (op
) == NOP_EXPR
)
7913 = (TYPE_PRECISION (TREE_TYPE (op
))
7914 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
7916 /* Truncations are many-one so cannot be removed. */
7920 /* See what's inside this conversion. If we decide to strip it,
7925 op
= TREE_OPERAND (op
, 0);
7926 /* An extension: the outermost one can be stripped,
7927 but remember whether it is zero or sign extension. */
7929 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7930 /* Otherwise, if a sign extension has been stripped,
7931 only sign extensions can now be stripped;
7932 if a zero extension has been stripped, only zero-extensions. */
7933 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
7937 else /* bitschange == 0 */
7939 /* A change in nominal type can always be stripped, but we must
7940 preserve the unsignedness. */
7942 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7944 op
= TREE_OPERAND (op
, 0);
7945 /* Keep trying to narrow, but don't assign op to win if it
7946 would turn an integral type into something else. */
7947 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
7954 if (TREE_CODE (op
) == COMPONENT_REF
7955 /* Since type_for_size always gives an integer type. */
7956 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
7957 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
7958 /* Ensure field is laid out already. */
7959 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
7960 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
7962 unsigned HOST_WIDE_INT innerprec
7963 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
7964 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
7965 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
7966 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
7968 /* We can get this structure field in a narrower type that fits it,
7969 but the resulting extension to its nominal type (a fullword type)
7970 must satisfy the same conditions as for other extensions.
7972 Do this only for fields that are aligned (not bit-fields),
7973 because when bit-field insns will be used there is no
7974 advantage in doing this. */
7976 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
7977 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
7978 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
7982 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
7983 win
= fold_convert (type
, op
);
7987 *unsignedp_ptr
= uns
;
7991 /* Returns true if integer constant C has a value that is permissible
7992 for type TYPE (an INTEGER_TYPE). */
7995 int_fits_type_p (const_tree c
, const_tree type
)
7997 tree type_low_bound
, type_high_bound
;
7998 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8001 dc
= tree_to_double_int (c
);
8002 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8004 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
8005 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
8007 /* So c is an unsigned integer whose type is sizetype and type is not.
8008 sizetype'd integers are sign extended even though they are
8009 unsigned. If the integer value fits in the lower end word of c,
8010 and if the higher end word has all its bits set to 1, that
8011 means the higher end bits are set to 1 only for sign extension.
8012 So let's convert c into an equivalent zero extended unsigned
8014 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
8017 type_low_bound
= TYPE_MIN_VALUE (type
);
8018 type_high_bound
= TYPE_MAX_VALUE (type
);
8020 /* If at least one bound of the type is a constant integer, we can check
8021 ourselves and maybe make a decision. If no such decision is possible, but
8022 this type is a subtype, try checking against that. Otherwise, use
8023 double_int_fits_to_tree_p, which checks against the precision.
8025 Compute the status for each possibly constant bound, and return if we see
8026 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8027 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8028 for "constant known to fit". */
8030 /* Check if c >= type_low_bound. */
8031 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8033 dd
= tree_to_double_int (type_low_bound
);
8034 if (TREE_CODE (type
) == INTEGER_TYPE
8035 && TYPE_IS_SIZETYPE (type
)
8036 && TYPE_UNSIGNED (type
))
8037 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8038 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8040 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8041 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8043 if (c_neg
&& !t_neg
)
8045 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8048 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8050 ok_for_low_bound
= true;
8053 ok_for_low_bound
= false;
8055 /* Check if c <= type_high_bound. */
8056 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8058 dd
= tree_to_double_int (type_high_bound
);
8059 if (TREE_CODE (type
) == INTEGER_TYPE
8060 && TYPE_IS_SIZETYPE (type
)
8061 && TYPE_UNSIGNED (type
))
8062 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8063 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8065 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8066 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8068 if (t_neg
&& !c_neg
)
8070 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8073 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8075 ok_for_high_bound
= true;
8078 ok_for_high_bound
= false;
8080 /* If the constant fits both bounds, the result is known. */
8081 if (ok_for_low_bound
&& ok_for_high_bound
)
8084 /* Perform some generic filtering which may allow making a decision
8085 even if the bounds are not constant. First, negative integers
8086 never fit in unsigned types, */
8087 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8090 /* Second, narrower types always fit in wider ones. */
8091 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8094 /* Third, unsigned integers with top bit set never fit signed types. */
8095 if (! TYPE_UNSIGNED (type
) && unsc
)
8097 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8098 if (prec
< HOST_BITS_PER_WIDE_INT
)
8100 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8103 else if (((((unsigned HOST_WIDE_INT
) 1)
8104 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8108 /* If we haven't been able to decide at this point, there nothing more we
8109 can check ourselves here. Look at the base type if we have one and it
8110 has the same precision. */
8111 if (TREE_CODE (type
) == INTEGER_TYPE
8112 && TREE_TYPE (type
) != 0
8113 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8115 type
= TREE_TYPE (type
);
8119 /* Or to double_int_fits_to_tree_p, if nothing else. */
8120 return double_int_fits_to_tree_p (type
, dc
);
8123 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8124 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8125 represented (assuming two's-complement arithmetic) within the bit
8126 precision of the type are returned instead. */
8129 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8131 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8132 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8133 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8134 TYPE_UNSIGNED (type
));
8137 if (TYPE_UNSIGNED (type
))
8138 mpz_set_ui (min
, 0);
8142 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8143 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8144 TYPE_PRECISION (type
));
8145 mpz_set_double_int (min
, mn
, false);
8149 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8150 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8151 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8152 TYPE_UNSIGNED (type
));
8155 if (TYPE_UNSIGNED (type
))
8156 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8159 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8164 /* Return true if VAR is an automatic variable defined in function FN. */
8167 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8169 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8170 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8171 || TREE_CODE (var
) == PARM_DECL
)
8172 && ! TREE_STATIC (var
))
8173 || TREE_CODE (var
) == LABEL_DECL
8174 || TREE_CODE (var
) == RESULT_DECL
));
8177 /* Subprogram of following function. Called by walk_tree.
8179 Return *TP if it is an automatic variable or parameter of the
8180 function passed in as DATA. */
8183 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8185 tree fn
= (tree
) data
;
8190 else if (DECL_P (*tp
)
8191 && auto_var_in_fn_p (*tp
, fn
))
8197 /* Returns true if T is, contains, or refers to a type with variable
8198 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8199 arguments, but not the return type. If FN is nonzero, only return
8200 true if a modifier of the type or position of FN is a variable or
8201 parameter inside FN.
8203 This concept is more general than that of C99 'variably modified types':
8204 in C99, a struct type is never variably modified because a VLA may not
8205 appear as a structure member. However, in GNU C code like:
8207 struct S { int i[f()]; };
8209 is valid, and other languages may define similar constructs. */
8212 variably_modified_type_p (tree type
, tree fn
)
8216 /* Test if T is either variable (if FN is zero) or an expression containing
8217 a variable in FN. */
8218 #define RETURN_TRUE_IF_VAR(T) \
8219 do { tree _t = (T); \
8220 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8221 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8222 return true; } while (0)
8224 if (type
== error_mark_node
)
8227 /* If TYPE itself has variable size, it is variably modified. */
8228 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8229 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8231 switch (TREE_CODE (type
))
8234 case REFERENCE_TYPE
:
8236 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8242 /* If TYPE is a function type, it is variably modified if the
8243 return type is variably modified. */
8244 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8250 case FIXED_POINT_TYPE
:
8253 /* Scalar types are variably modified if their end points
8255 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8256 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8261 case QUAL_UNION_TYPE
:
8262 /* We can't see if any of the fields are variably-modified by the
8263 definition we normally use, since that would produce infinite
8264 recursion via pointers. */
8265 /* This is variably modified if some field's type is. */
8266 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8267 if (TREE_CODE (t
) == FIELD_DECL
)
8269 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8270 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8271 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8273 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8274 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8279 /* Do not call ourselves to avoid infinite recursion. This is
8280 variably modified if the element type is. */
8281 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8282 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8289 /* The current language may have other cases to check, but in general,
8290 all other types are not variably modified. */
8291 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8293 #undef RETURN_TRUE_IF_VAR
8296 /* Given a DECL or TYPE, return the scope in which it was declared, or
8297 NULL_TREE if there is no containing scope. */
8300 get_containing_scope (const_tree t
)
8302 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8305 /* Return the innermost context enclosing DECL that is
8306 a FUNCTION_DECL, or zero if none. */
8309 decl_function_context (const_tree decl
)
8313 if (TREE_CODE (decl
) == ERROR_MARK
)
8316 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8317 where we look up the function at runtime. Such functions always take
8318 a first argument of type 'pointer to real context'.
8320 C++ should really be fixed to use DECL_CONTEXT for the real context,
8321 and use something else for the "virtual context". */
8322 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8325 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8327 context
= DECL_CONTEXT (decl
);
8329 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8331 if (TREE_CODE (context
) == BLOCK
)
8332 context
= BLOCK_SUPERCONTEXT (context
);
8334 context
= get_containing_scope (context
);
8340 /* Return the innermost context enclosing DECL that is
8341 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8342 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8345 decl_type_context (const_tree decl
)
8347 tree context
= DECL_CONTEXT (decl
);
8350 switch (TREE_CODE (context
))
8352 case NAMESPACE_DECL
:
8353 case TRANSLATION_UNIT_DECL
:
8358 case QUAL_UNION_TYPE
:
8363 context
= DECL_CONTEXT (context
);
8367 context
= BLOCK_SUPERCONTEXT (context
);
8377 /* CALL is a CALL_EXPR. Return the declaration for the function
8378 called, or NULL_TREE if the called function cannot be
8382 get_callee_fndecl (const_tree call
)
8386 if (call
== error_mark_node
)
8387 return error_mark_node
;
8389 /* It's invalid to call this function with anything but a
8391 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8393 /* The first operand to the CALL is the address of the function
8395 addr
= CALL_EXPR_FN (call
);
8399 /* If this is a readonly function pointer, extract its initial value. */
8400 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8401 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8402 && DECL_INITIAL (addr
))
8403 addr
= DECL_INITIAL (addr
);
8405 /* If the address is just `&f' for some function `f', then we know
8406 that `f' is being called. */
8407 if (TREE_CODE (addr
) == ADDR_EXPR
8408 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8409 return TREE_OPERAND (addr
, 0);
8411 /* We couldn't figure out what was being called. */
8415 /* Print debugging information about tree nodes generated during the compile,
8416 and any language-specific information. */
8419 dump_tree_statistics (void)
8421 #ifdef GATHER_STATISTICS
8423 int total_nodes
, total_bytes
;
8426 fprintf (stderr
, "\n??? tree nodes created\n\n");
8427 #ifdef GATHER_STATISTICS
8428 fprintf (stderr
, "Kind Nodes Bytes\n");
8429 fprintf (stderr
, "---------------------------------------\n");
8430 total_nodes
= total_bytes
= 0;
8431 for (i
= 0; i
< (int) all_kinds
; i
++)
8433 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8434 tree_node_counts
[i
], tree_node_sizes
[i
]);
8435 total_nodes
+= tree_node_counts
[i
];
8436 total_bytes
+= tree_node_sizes
[i
];
8438 fprintf (stderr
, "---------------------------------------\n");
8439 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8440 fprintf (stderr
, "---------------------------------------\n");
8441 ssanames_print_statistics ();
8442 phinodes_print_statistics ();
8444 fprintf (stderr
, "(No per-node statistics)\n");
8446 print_type_hash_statistics ();
8447 print_debug_expr_statistics ();
8448 print_value_expr_statistics ();
8449 lang_hooks
.print_statistics ();
8452 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8454 /* Generate a crc32 of a string. */
8457 crc32_string (unsigned chksum
, const char *string
)
8461 unsigned value
= *string
<< 24;
8464 for (ix
= 8; ix
--; value
<<= 1)
8468 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8477 /* P is a string that will be used in a symbol. Mask out any characters
8478 that are not valid in that context. */
8481 clean_symbol_name (char *p
)
8485 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8488 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8495 /* Generate a name for a special-purpose function function.
8496 The generated name may need to be unique across the whole link.
8497 TYPE is some string to identify the purpose of this function to the
8498 linker or collect2; it must start with an uppercase letter,
8500 I - for constructors
8502 N - for C++ anonymous namespaces
8503 F - for DWARF unwind frame information. */
8506 get_file_function_name (const char *type
)
8512 /* If we already have a name we know to be unique, just use that. */
8513 if (first_global_object_name
)
8514 p
= q
= ASTRDUP (first_global_object_name
);
8515 /* If the target is handling the constructors/destructors, they
8516 will be local to this file and the name is only necessary for
8517 debugging purposes. */
8518 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8520 const char *file
= main_input_filename
;
8522 file
= input_filename
;
8523 /* Just use the file's basename, because the full pathname
8524 might be quite long. */
8525 p
= strrchr (file
, '/');
8530 p
= q
= ASTRDUP (p
);
8534 /* Otherwise, the name must be unique across the entire link.
8535 We don't have anything that we know to be unique to this translation
8536 unit, so use what we do have and throw in some randomness. */
8538 const char *name
= weak_global_object_name
;
8539 const char *file
= main_input_filename
;
8544 file
= input_filename
;
8546 len
= strlen (file
);
8547 q
= (char *) alloca (9 * 2 + len
+ 1);
8548 memcpy (q
, file
, len
+ 1);
8550 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8551 crc32_string (0, get_random_seed (false)));
8556 clean_symbol_name (q
);
8557 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8560 /* Set up the name of the file-level functions we may need.
8561 Use a global object (which is already required to be unique over
8562 the program) rather than the file name (which imposes extra
8564 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8566 return get_identifier (buf
);
8569 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8571 /* Complain that the tree code of NODE does not match the expected 0
8572 terminated list of trailing codes. The trailing code list can be
8573 empty, for a more vague error message. FILE, LINE, and FUNCTION
8574 are of the caller. */
8577 tree_check_failed (const_tree node
, const char *file
,
8578 int line
, const char *function
, ...)
8582 unsigned length
= 0;
8585 va_start (args
, function
);
8586 while ((code
= va_arg (args
, int)))
8587 length
+= 4 + strlen (tree_code_name
[code
]);
8592 va_start (args
, function
);
8593 length
+= strlen ("expected ");
8594 buffer
= tmp
= (char *) alloca (length
);
8596 while ((code
= va_arg (args
, int)))
8598 const char *prefix
= length
? " or " : "expected ";
8600 strcpy (tmp
+ length
, prefix
);
8601 length
+= strlen (prefix
);
8602 strcpy (tmp
+ length
, tree_code_name
[code
]);
8603 length
+= strlen (tree_code_name
[code
]);
8608 buffer
= "unexpected node";
8610 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8611 buffer
, tree_code_name
[TREE_CODE (node
)],
8612 function
, trim_filename (file
), line
);
8615 /* Complain that the tree code of NODE does match the expected 0
8616 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8620 tree_not_check_failed (const_tree node
, const char *file
,
8621 int line
, const char *function
, ...)
8625 unsigned length
= 0;
8628 va_start (args
, function
);
8629 while ((code
= va_arg (args
, int)))
8630 length
+= 4 + strlen (tree_code_name
[code
]);
8632 va_start (args
, function
);
8633 buffer
= (char *) alloca (length
);
8635 while ((code
= va_arg (args
, int)))
8639 strcpy (buffer
+ length
, " or ");
8642 strcpy (buffer
+ length
, tree_code_name
[code
]);
8643 length
+= strlen (tree_code_name
[code
]);
8647 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8648 buffer
, tree_code_name
[TREE_CODE (node
)],
8649 function
, trim_filename (file
), line
);
8652 /* Similar to tree_check_failed, except that we check for a class of tree
8653 code, given in CL. */
8656 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8657 const char *file
, int line
, const char *function
)
8660 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8661 TREE_CODE_CLASS_STRING (cl
),
8662 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8663 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8666 /* Similar to tree_check_failed, except that instead of specifying a
8667 dozen codes, use the knowledge that they're all sequential. */
8670 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8671 const char *function
, enum tree_code c1
,
8675 unsigned length
= 0;
8678 for (c
= c1
; c
<= c2
; ++c
)
8679 length
+= 4 + strlen (tree_code_name
[c
]);
8681 length
+= strlen ("expected ");
8682 buffer
= (char *) alloca (length
);
8685 for (c
= c1
; c
<= c2
; ++c
)
8687 const char *prefix
= length
? " or " : "expected ";
8689 strcpy (buffer
+ length
, prefix
);
8690 length
+= strlen (prefix
);
8691 strcpy (buffer
+ length
, tree_code_name
[c
]);
8692 length
+= strlen (tree_code_name
[c
]);
8695 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8696 buffer
, tree_code_name
[TREE_CODE (node
)],
8697 function
, trim_filename (file
), line
);
8701 /* Similar to tree_check_failed, except that we check that a tree does
8702 not have the specified code, given in CL. */
8705 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8706 const char *file
, int line
, const char *function
)
8709 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8710 TREE_CODE_CLASS_STRING (cl
),
8711 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8712 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8716 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8719 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8720 const char *function
, enum omp_clause_code code
)
8722 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8723 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8724 function
, trim_filename (file
), line
);
8728 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8731 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8732 const char *function
, enum omp_clause_code c1
,
8733 enum omp_clause_code c2
)
8736 unsigned length
= 0;
8739 for (c
= c1
; c
<= c2
; ++c
)
8740 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8742 length
+= strlen ("expected ");
8743 buffer
= (char *) alloca (length
);
8746 for (c
= c1
; c
<= c2
; ++c
)
8748 const char *prefix
= length
? " or " : "expected ";
8750 strcpy (buffer
+ length
, prefix
);
8751 length
+= strlen (prefix
);
8752 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8753 length
+= strlen (omp_clause_code_name
[c
]);
8756 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8757 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8758 function
, trim_filename (file
), line
);
8762 #undef DEFTREESTRUCT
8763 #define DEFTREESTRUCT(VAL, NAME) NAME,
8765 static const char *ts_enum_names
[] = {
8766 #include "treestruct.def"
8768 #undef DEFTREESTRUCT
8770 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8772 /* Similar to tree_class_check_failed, except that we check for
8773 whether CODE contains the tree structure identified by EN. */
8776 tree_contains_struct_check_failed (const_tree node
,
8777 const enum tree_node_structure_enum en
,
8778 const char *file
, int line
,
8779 const char *function
)
8782 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8784 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8788 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8789 (dynamically sized) vector. */
8792 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8793 const char *function
)
8796 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8797 idx
+ 1, len
, function
, trim_filename (file
), line
);
8800 /* Similar to above, except that the check is for the bounds of the operand
8801 vector of an expression node EXP. */
8804 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8805 int line
, const char *function
)
8807 int code
= TREE_CODE (exp
);
8809 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8810 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8811 function
, trim_filename (file
), line
);
8814 /* Similar to above, except that the check is for the number of
8815 operands of an OMP_CLAUSE node. */
8818 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8819 int line
, const char *function
)
8822 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8823 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8824 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8825 trim_filename (file
), line
);
8827 #endif /* ENABLE_TREE_CHECKING */
8829 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8830 and mapped to the machine mode MODE. Initialize its fields and build
8831 the information necessary for debugging output. */
8834 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8837 hashval_t hashcode
= 0;
8839 t
= make_node (VECTOR_TYPE
);
8840 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8841 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8842 SET_TYPE_MODE (t
, mode
);
8844 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8845 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8846 else if (TYPE_CANONICAL (innertype
) != innertype
8847 || mode
!= VOIDmode
)
8849 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8853 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8854 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8855 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8856 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8857 t
= type_hash_canon (hashcode
, t
);
8859 /* We have built a main variant, based on the main variant of the
8860 inner type. Use it to build the variant we return. */
8861 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8862 && TREE_TYPE (t
) != innertype
)
8863 return build_type_attribute_qual_variant (t
,
8864 TYPE_ATTRIBUTES (innertype
),
8865 TYPE_QUALS (innertype
));
8871 make_or_reuse_type (unsigned size
, int unsignedp
)
8873 if (size
== INT_TYPE_SIZE
)
8874 return unsignedp
? unsigned_type_node
: integer_type_node
;
8875 if (size
== CHAR_TYPE_SIZE
)
8876 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8877 if (size
== SHORT_TYPE_SIZE
)
8878 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8879 if (size
== LONG_TYPE_SIZE
)
8880 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8881 if (size
== LONG_LONG_TYPE_SIZE
)
8882 return (unsignedp
? long_long_unsigned_type_node
8883 : long_long_integer_type_node
);
8884 if (size
== 128 && int128_integer_type_node
)
8885 return (unsignedp
? int128_unsigned_type_node
8886 : int128_integer_type_node
);
8889 return make_unsigned_type (size
);
8891 return make_signed_type (size
);
8894 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8897 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8901 if (size
== SHORT_FRACT_TYPE_SIZE
)
8902 return unsignedp
? sat_unsigned_short_fract_type_node
8903 : sat_short_fract_type_node
;
8904 if (size
== FRACT_TYPE_SIZE
)
8905 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8906 if (size
== LONG_FRACT_TYPE_SIZE
)
8907 return unsignedp
? sat_unsigned_long_fract_type_node
8908 : sat_long_fract_type_node
;
8909 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8910 return unsignedp
? sat_unsigned_long_long_fract_type_node
8911 : sat_long_long_fract_type_node
;
8915 if (size
== SHORT_FRACT_TYPE_SIZE
)
8916 return unsignedp
? unsigned_short_fract_type_node
8917 : short_fract_type_node
;
8918 if (size
== FRACT_TYPE_SIZE
)
8919 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
8920 if (size
== LONG_FRACT_TYPE_SIZE
)
8921 return unsignedp
? unsigned_long_fract_type_node
8922 : long_fract_type_node
;
8923 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8924 return unsignedp
? unsigned_long_long_fract_type_node
8925 : long_long_fract_type_node
;
8928 return make_fract_type (size
, unsignedp
, satp
);
8931 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8934 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
8938 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8939 return unsignedp
? sat_unsigned_short_accum_type_node
8940 : sat_short_accum_type_node
;
8941 if (size
== ACCUM_TYPE_SIZE
)
8942 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
8943 if (size
== LONG_ACCUM_TYPE_SIZE
)
8944 return unsignedp
? sat_unsigned_long_accum_type_node
8945 : sat_long_accum_type_node
;
8946 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8947 return unsignedp
? sat_unsigned_long_long_accum_type_node
8948 : sat_long_long_accum_type_node
;
8952 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8953 return unsignedp
? unsigned_short_accum_type_node
8954 : short_accum_type_node
;
8955 if (size
== ACCUM_TYPE_SIZE
)
8956 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
8957 if (size
== LONG_ACCUM_TYPE_SIZE
)
8958 return unsignedp
? unsigned_long_accum_type_node
8959 : long_accum_type_node
;
8960 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8961 return unsignedp
? unsigned_long_long_accum_type_node
8962 : long_long_accum_type_node
;
8965 return make_accum_type (size
, unsignedp
, satp
);
8968 /* Create nodes for all integer types (and error_mark_node) using the sizes
8969 of C datatypes. The caller should call set_sizetype soon after calling
8970 this function to select one of the types as sizetype. */
8973 build_common_tree_nodes (bool signed_char
)
8975 error_mark_node
= make_node (ERROR_MARK
);
8976 TREE_TYPE (error_mark_node
) = error_mark_node
;
8978 initialize_sizetypes ();
8980 /* Define both `signed char' and `unsigned char'. */
8981 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
8982 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
8983 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
8984 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
8986 /* Define `char', which is like either `signed char' or `unsigned char'
8987 but not the same as either. */
8990 ? make_signed_type (CHAR_TYPE_SIZE
)
8991 : make_unsigned_type (CHAR_TYPE_SIZE
));
8992 TYPE_STRING_FLAG (char_type_node
) = 1;
8994 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
8995 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
8996 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
8997 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
8998 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
8999 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9000 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9001 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9002 #if HOST_BITS_PER_WIDE_INT >= 64
9003 /* TODO: This isn't correct, but as logic depends at the moment on
9004 host's instead of target's wide-integer.
9005 If there is a target not supporting TImode, but has an 128-bit
9006 integer-scalar register, this target check needs to be adjusted. */
9007 if (targetm
.scalar_mode_supported_p (TImode
))
9009 int128_integer_type_node
= make_signed_type (128);
9010 int128_unsigned_type_node
= make_unsigned_type (128);
9013 /* Define a boolean type. This type only represents boolean values but
9014 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9015 Front ends which want to override this size (i.e. Java) can redefine
9016 boolean_type_node before calling build_common_tree_nodes_2. */
9017 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9018 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9019 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9020 TYPE_PRECISION (boolean_type_node
) = 1;
9022 /* Fill in the rest of the sized types. Reuse existing type nodes
9024 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9025 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9026 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9027 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9028 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9030 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9031 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9032 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9033 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9034 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9036 access_public_node
= get_identifier ("public");
9037 access_protected_node
= get_identifier ("protected");
9038 access_private_node
= get_identifier ("private");
9041 /* Call this function after calling build_common_tree_nodes and set_sizetype.
9042 It will create several other common tree nodes. */
9045 build_common_tree_nodes_2 (int short_double
)
9047 /* Define these next since types below may used them. */
9048 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9049 integer_one_node
= build_int_cst (integer_type_node
, 1);
9050 integer_three_node
= build_int_cst (integer_type_node
, 3);
9051 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9053 size_zero_node
= size_int (0);
9054 size_one_node
= size_int (1);
9055 bitsize_zero_node
= bitsize_int (0);
9056 bitsize_one_node
= bitsize_int (1);
9057 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9059 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9060 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9062 void_type_node
= make_node (VOID_TYPE
);
9063 layout_type (void_type_node
);
9065 /* We are not going to have real types in C with less than byte alignment,
9066 so we might as well not have any types that claim to have it. */
9067 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9068 TYPE_USER_ALIGN (void_type_node
) = 0;
9070 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9071 layout_type (TREE_TYPE (null_pointer_node
));
9073 ptr_type_node
= build_pointer_type (void_type_node
);
9075 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9076 fileptr_type_node
= ptr_type_node
;
9078 float_type_node
= make_node (REAL_TYPE
);
9079 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9080 layout_type (float_type_node
);
9082 double_type_node
= make_node (REAL_TYPE
);
9084 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9086 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9087 layout_type (double_type_node
);
9089 long_double_type_node
= make_node (REAL_TYPE
);
9090 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9091 layout_type (long_double_type_node
);
9093 float_ptr_type_node
= build_pointer_type (float_type_node
);
9094 double_ptr_type_node
= build_pointer_type (double_type_node
);
9095 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9096 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9098 /* Fixed size integer types. */
9099 uint32_type_node
= build_nonstandard_integer_type (32, true);
9100 uint64_type_node
= build_nonstandard_integer_type (64, true);
9102 /* Decimal float types. */
9103 dfloat32_type_node
= make_node (REAL_TYPE
);
9104 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9105 layout_type (dfloat32_type_node
);
9106 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9107 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9109 dfloat64_type_node
= make_node (REAL_TYPE
);
9110 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9111 layout_type (dfloat64_type_node
);
9112 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9113 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9115 dfloat128_type_node
= make_node (REAL_TYPE
);
9116 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9117 layout_type (dfloat128_type_node
);
9118 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9119 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9121 complex_integer_type_node
= build_complex_type (integer_type_node
);
9122 complex_float_type_node
= build_complex_type (float_type_node
);
9123 complex_double_type_node
= build_complex_type (double_type_node
);
9124 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9126 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9127 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9128 sat_ ## KIND ## _type_node = \
9129 make_sat_signed_ ## KIND ## _type (SIZE); \
9130 sat_unsigned_ ## KIND ## _type_node = \
9131 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9132 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9133 unsigned_ ## KIND ## _type_node = \
9134 make_unsigned_ ## KIND ## _type (SIZE);
9136 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9137 sat_ ## WIDTH ## KIND ## _type_node = \
9138 make_sat_signed_ ## KIND ## _type (SIZE); \
9139 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9140 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9141 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9142 unsigned_ ## WIDTH ## KIND ## _type_node = \
9143 make_unsigned_ ## KIND ## _type (SIZE);
9145 /* Make fixed-point type nodes based on four different widths. */
9146 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9147 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9148 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9149 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9150 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9152 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9153 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9154 NAME ## _type_node = \
9155 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9156 u ## NAME ## _type_node = \
9157 make_or_reuse_unsigned_ ## KIND ## _type \
9158 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9159 sat_ ## NAME ## _type_node = \
9160 make_or_reuse_sat_signed_ ## KIND ## _type \
9161 (GET_MODE_BITSIZE (MODE ## mode)); \
9162 sat_u ## NAME ## _type_node = \
9163 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9164 (GET_MODE_BITSIZE (U ## MODE ## mode));
9166 /* Fixed-point type and mode nodes. */
9167 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9168 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9169 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9170 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9171 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9172 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9173 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9174 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9175 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9176 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9177 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9180 tree t
= targetm
.build_builtin_va_list ();
9182 /* Many back-ends define record types without setting TYPE_NAME.
9183 If we copied the record type here, we'd keep the original
9184 record type without a name. This breaks name mangling. So,
9185 don't copy record types and let c_common_nodes_and_builtins()
9186 declare the type to be __builtin_va_list. */
9187 if (TREE_CODE (t
) != RECORD_TYPE
)
9188 t
= build_variant_type_copy (t
);
9190 va_list_type_node
= t
;
9194 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9197 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9198 const char *library_name
, int ecf_flags
)
9202 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9203 library_name
, NULL_TREE
);
9204 if (ecf_flags
& ECF_CONST
)
9205 TREE_READONLY (decl
) = 1;
9206 if (ecf_flags
& ECF_PURE
)
9207 DECL_PURE_P (decl
) = 1;
9208 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9209 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9210 if (ecf_flags
& ECF_NORETURN
)
9211 TREE_THIS_VOLATILE (decl
) = 1;
9212 if (ecf_flags
& ECF_NOTHROW
)
9213 TREE_NOTHROW (decl
) = 1;
9214 if (ecf_flags
& ECF_MALLOC
)
9215 DECL_IS_MALLOC (decl
) = 1;
9216 if (ecf_flags
& ECF_LEAF
)
9217 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9218 NULL
, DECL_ATTRIBUTES (decl
));
9220 built_in_decls
[code
] = decl
;
9221 implicit_built_in_decls
[code
] = decl
;
9224 /* Call this function after instantiating all builtins that the language
9225 front end cares about. This will build the rest of the builtins that
9226 are relied upon by the tree optimizers and the middle-end. */
9229 build_common_builtin_nodes (void)
9233 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
9234 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9236 ftype
= build_function_type_list (ptr_type_node
,
9237 ptr_type_node
, const_ptr_type_node
,
9238 size_type_node
, NULL_TREE
);
9240 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
9241 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9242 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9243 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9244 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9245 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9248 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
9250 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9251 const_ptr_type_node
, size_type_node
,
9253 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9254 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9257 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
9259 ftype
= build_function_type_list (ptr_type_node
,
9260 ptr_type_node
, integer_type_node
,
9261 size_type_node
, NULL_TREE
);
9262 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9263 "memset", ECF_NOTHROW
| ECF_LEAF
);
9266 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9268 ftype
= build_function_type_list (ptr_type_node
,
9269 size_type_node
, NULL_TREE
);
9270 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9271 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9274 /* If we're checking the stack, `alloca' can throw. */
9275 if (flag_stack_check
)
9276 TREE_NOTHROW (built_in_decls
[BUILT_IN_ALLOCA
]) = 0;
9278 ftype
= build_function_type_list (void_type_node
,
9279 ptr_type_node
, ptr_type_node
,
9280 ptr_type_node
, NULL_TREE
);
9281 local_define_builtin ("__builtin_init_trampoline", ftype
,
9282 BUILT_IN_INIT_TRAMPOLINE
,
9283 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9285 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9286 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9287 BUILT_IN_ADJUST_TRAMPOLINE
,
9288 "__builtin_adjust_trampoline",
9289 ECF_CONST
| ECF_NOTHROW
);
9291 ftype
= build_function_type_list (void_type_node
,
9292 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9293 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9294 BUILT_IN_NONLOCAL_GOTO
,
9295 "__builtin_nonlocal_goto",
9296 ECF_NORETURN
| ECF_NOTHROW
);
9298 ftype
= build_function_type_list (void_type_node
,
9299 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9300 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9301 BUILT_IN_SETJMP_SETUP
,
9302 "__builtin_setjmp_setup", ECF_NOTHROW
);
9304 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9305 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9306 BUILT_IN_SETJMP_DISPATCHER
,
9307 "__builtin_setjmp_dispatcher",
9308 ECF_PURE
| ECF_NOTHROW
);
9310 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9311 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9312 BUILT_IN_SETJMP_RECEIVER
,
9313 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9315 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9316 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9317 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9319 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9320 local_define_builtin ("__builtin_stack_restore", ftype
,
9321 BUILT_IN_STACK_RESTORE
,
9322 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9324 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9325 local_define_builtin ("__builtin_profile_func_enter", ftype
,
9326 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
9327 local_define_builtin ("__builtin_profile_func_exit", ftype
,
9328 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
9330 /* If there's a possibility that we might use the ARM EABI, build the
9331 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9332 if (targetm
.arm_eabi_unwinder
)
9334 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9335 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9336 BUILT_IN_CXA_END_CLEANUP
,
9337 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9340 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9341 local_define_builtin ("__builtin_unwind_resume", ftype
,
9342 BUILT_IN_UNWIND_RESUME
,
9343 (targetm
.except_unwind_info () == UI_SJLJ
9344 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9347 /* The exception object and filter values from the runtime. The argument
9348 must be zero before exception lowering, i.e. from the front end. After
9349 exception lowering, it will be the region number for the exception
9350 landing pad. These functions are PURE instead of CONST to prevent
9351 them from being hoisted past the exception edge that will initialize
9352 its value in the landing pad. */
9353 ftype
= build_function_type_list (ptr_type_node
,
9354 integer_type_node
, NULL_TREE
);
9355 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9356 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9358 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9359 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9360 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9361 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9363 ftype
= build_function_type_list (void_type_node
,
9364 integer_type_node
, integer_type_node
,
9366 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9367 BUILT_IN_EH_COPY_VALUES
,
9368 "__builtin_eh_copy_values", ECF_NOTHROW
);
9370 /* Complex multiplication and division. These are handled as builtins
9371 rather than optabs because emit_library_call_value doesn't support
9372 complex. Further, we can do slightly better with folding these
9373 beasties if the real and complex parts of the arguments are separate. */
9377 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9379 char mode_name_buf
[4], *q
;
9381 enum built_in_function mcode
, dcode
;
9382 tree type
, inner_type
;
9384 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9387 inner_type
= TREE_TYPE (type
);
9389 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9390 inner_type
, inner_type
, NULL_TREE
);
9392 mcode
= ((enum built_in_function
)
9393 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9394 dcode
= ((enum built_in_function
)
9395 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9397 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9401 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9402 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9403 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9405 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9406 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9407 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9412 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9415 If we requested a pointer to a vector, build up the pointers that
9416 we stripped off while looking for the inner type. Similarly for
9417 return values from functions.
9419 The argument TYPE is the top of the chain, and BOTTOM is the
9420 new type which we will point to. */
9423 reconstruct_complex_type (tree type
, tree bottom
)
9427 if (TREE_CODE (type
) == POINTER_TYPE
)
9429 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9430 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9431 TYPE_REF_CAN_ALIAS_ALL (type
));
9433 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9435 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9436 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9437 TYPE_REF_CAN_ALIAS_ALL (type
));
9439 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9441 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9442 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9444 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9446 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9447 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9449 else if (TREE_CODE (type
) == METHOD_TYPE
)
9451 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9452 /* The build_method_type_directly() routine prepends 'this' to argument list,
9453 so we must compensate by getting rid of it. */
9455 = build_method_type_directly
9456 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9458 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9460 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9462 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9463 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9468 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9472 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9475 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9479 switch (GET_MODE_CLASS (mode
))
9481 case MODE_VECTOR_INT
:
9482 case MODE_VECTOR_FLOAT
:
9483 case MODE_VECTOR_FRACT
:
9484 case MODE_VECTOR_UFRACT
:
9485 case MODE_VECTOR_ACCUM
:
9486 case MODE_VECTOR_UACCUM
:
9487 nunits
= GET_MODE_NUNITS (mode
);
9491 /* Check that there are no leftover bits. */
9492 gcc_assert (GET_MODE_BITSIZE (mode
)
9493 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9495 nunits
= GET_MODE_BITSIZE (mode
)
9496 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9503 return make_vector_type (innertype
, nunits
, mode
);
9506 /* Similarly, but takes the inner type and number of units, which must be
9510 build_vector_type (tree innertype
, int nunits
)
9512 return make_vector_type (innertype
, nunits
, VOIDmode
);
9515 /* Similarly, but takes the inner type and number of units, which must be
9519 build_opaque_vector_type (tree innertype
, int nunits
)
9522 innertype
= build_distinct_type_copy (innertype
);
9523 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9524 TYPE_VECTOR_OPAQUE (t
) = true;
9529 /* Given an initializer INIT, return TRUE if INIT is zero or some
9530 aggregate of zeros. Otherwise return FALSE. */
9532 initializer_zerop (const_tree init
)
9538 switch (TREE_CODE (init
))
9541 return integer_zerop (init
);
9544 /* ??? Note that this is not correct for C4X float formats. There,
9545 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9546 negative exponent. */
9547 return real_zerop (init
)
9548 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9551 return fixed_zerop (init
);
9554 return integer_zerop (init
)
9555 || (real_zerop (init
)
9556 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9557 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9560 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9561 if (!initializer_zerop (TREE_VALUE (elt
)))
9567 unsigned HOST_WIDE_INT idx
;
9569 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9570 if (!initializer_zerop (elt
))
9579 /* We need to loop through all elements to handle cases like
9580 "\0" and "\0foobar". */
9581 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9582 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9593 /* Build an empty statement at location LOC. */
9596 build_empty_stmt (location_t loc
)
9598 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9599 SET_EXPR_LOCATION (t
, loc
);
9604 /* Build an OpenMP clause with code CODE. LOC is the location of the
9608 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9613 length
= omp_clause_num_ops
[code
];
9614 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9616 t
= ggc_alloc_tree_node (size
);
9617 memset (t
, 0, size
);
9618 TREE_SET_CODE (t
, OMP_CLAUSE
);
9619 OMP_CLAUSE_SET_CODE (t
, code
);
9620 OMP_CLAUSE_LOCATION (t
) = loc
;
9622 #ifdef GATHER_STATISTICS
9623 tree_node_counts
[(int) omp_clause_kind
]++;
9624 tree_node_sizes
[(int) omp_clause_kind
] += size
;
9630 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9631 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9632 Except for the CODE and operand count field, other storage for the
9633 object is initialized to zeros. */
9636 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9639 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9641 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9642 gcc_assert (len
>= 1);
9644 #ifdef GATHER_STATISTICS
9645 tree_node_counts
[(int) e_kind
]++;
9646 tree_node_sizes
[(int) e_kind
] += length
;
9649 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
9651 TREE_SET_CODE (t
, code
);
9653 /* Can't use TREE_OPERAND to store the length because if checking is
9654 enabled, it will try to check the length before we store it. :-P */
9655 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9660 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9661 FN and a null static chain slot. NARGS is the number of call arguments
9662 which are specified as "..." arguments. */
9665 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9669 va_start (args
, nargs
);
9670 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9675 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9676 FN and a null static chain slot. NARGS is the number of call arguments
9677 which are specified as a va_list ARGS. */
9680 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9685 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9686 TREE_TYPE (t
) = return_type
;
9687 CALL_EXPR_FN (t
) = fn
;
9688 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9689 for (i
= 0; i
< nargs
; i
++)
9690 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9691 process_call_operands (t
);
9695 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9696 FN and a null static chain slot. NARGS is the number of call arguments
9697 which are specified as a tree array ARGS. */
9700 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9701 int nargs
, const tree
*args
)
9706 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9707 TREE_TYPE (t
) = return_type
;
9708 CALL_EXPR_FN (t
) = fn
;
9709 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9710 for (i
= 0; i
< nargs
; i
++)
9711 CALL_EXPR_ARG (t
, i
) = args
[i
];
9712 process_call_operands (t
);
9713 SET_EXPR_LOCATION (t
, loc
);
9717 /* Like build_call_array, but takes a VEC. */
9720 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9725 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
9726 TREE_TYPE (ret
) = return_type
;
9727 CALL_EXPR_FN (ret
) = fn
;
9728 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
9729 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
9730 CALL_EXPR_ARG (ret
, ix
) = t
;
9731 process_call_operands (ret
);
9736 /* Returns true if it is possible to prove that the index of
9737 an array access REF (an ARRAY_REF expression) falls into the
9741 in_array_bounds_p (tree ref
)
9743 tree idx
= TREE_OPERAND (ref
, 1);
9746 if (TREE_CODE (idx
) != INTEGER_CST
)
9749 min
= array_ref_low_bound (ref
);
9750 max
= array_ref_up_bound (ref
);
9753 || TREE_CODE (min
) != INTEGER_CST
9754 || TREE_CODE (max
) != INTEGER_CST
)
9757 if (tree_int_cst_lt (idx
, min
)
9758 || tree_int_cst_lt (max
, idx
))
9764 /* Returns true if it is possible to prove that the range of
9765 an array access REF (an ARRAY_RANGE_REF expression) falls
9766 into the array bounds. */
9769 range_in_array_bounds_p (tree ref
)
9771 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9772 tree range_min
, range_max
, min
, max
;
9774 range_min
= TYPE_MIN_VALUE (domain_type
);
9775 range_max
= TYPE_MAX_VALUE (domain_type
);
9778 || TREE_CODE (range_min
) != INTEGER_CST
9779 || TREE_CODE (range_max
) != INTEGER_CST
)
9782 min
= array_ref_low_bound (ref
);
9783 max
= array_ref_up_bound (ref
);
9786 || TREE_CODE (min
) != INTEGER_CST
9787 || TREE_CODE (max
) != INTEGER_CST
)
9790 if (tree_int_cst_lt (range_min
, min
)
9791 || tree_int_cst_lt (max
, range_max
))
9797 /* Return true if T (assumed to be a DECL) must be assigned a memory
9801 needs_to_live_in_memory (const_tree t
)
9803 if (TREE_CODE (t
) == SSA_NAME
)
9804 t
= SSA_NAME_VAR (t
);
9806 return (TREE_ADDRESSABLE (t
)
9807 || is_global_var (t
)
9808 || (TREE_CODE (t
) == RESULT_DECL
9809 && !DECL_BY_REFERENCE (t
)
9810 && aggregate_value_p (t
, current_function_decl
)));
9813 /* There are situations in which a language considers record types
9814 compatible which have different field lists. Decide if two fields
9815 are compatible. It is assumed that the parent records are compatible. */
9818 fields_compatible_p (const_tree f1
, const_tree f2
)
9820 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9821 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9824 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9825 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9828 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9834 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9837 find_compatible_field (tree record
, tree orig_field
)
9841 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9842 if (TREE_CODE (f
) == FIELD_DECL
9843 && fields_compatible_p (f
, orig_field
))
9846 /* ??? Why isn't this on the main fields list? */
9847 f
= TYPE_VFIELD (record
);
9848 if (f
&& TREE_CODE (f
) == FIELD_DECL
9849 && fields_compatible_p (f
, orig_field
))
9852 /* ??? We should abort here, but Java appears to do Bad Things
9853 with inherited fields. */
9857 /* Return value of a constant X and sign-extend it. */
9860 int_cst_value (const_tree x
)
9862 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9863 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9865 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9866 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9867 || TREE_INT_CST_HIGH (x
) == -1);
9869 if (bits
< HOST_BITS_PER_WIDE_INT
)
9871 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9873 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9875 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9881 /* Return value of a constant X and sign-extend it. */
9884 widest_int_cst_value (const_tree x
)
9886 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9887 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9889 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9890 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9891 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9892 << HOST_BITS_PER_WIDE_INT
);
9894 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9895 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9896 || TREE_INT_CST_HIGH (x
) == -1);
9899 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9901 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9903 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9905 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9911 /* If TYPE is an integral type, return an equivalent type which is
9912 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9913 return TYPE itself. */
9916 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9919 if (POINTER_TYPE_P (type
))
9921 /* If the pointer points to the normal address space, use the
9922 size_type_node. Otherwise use an appropriate size for the pointer
9923 based on the named address space it points to. */
9924 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
9927 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9930 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9933 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9936 /* Returns unsigned variant of TYPE. */
9939 unsigned_type_for (tree type
)
9941 return signed_or_unsigned_type_for (1, type
);
9944 /* Returns signed variant of TYPE. */
9947 signed_type_for (tree type
)
9949 return signed_or_unsigned_type_for (0, type
);
9952 /* Returns the largest value obtainable by casting something in INNER type to
9956 upper_bound_in_type (tree outer
, tree inner
)
9958 unsigned HOST_WIDE_INT lo
, hi
;
9959 unsigned int det
= 0;
9960 unsigned oprec
= TYPE_PRECISION (outer
);
9961 unsigned iprec
= TYPE_PRECISION (inner
);
9964 /* Compute a unique number for every combination. */
9965 det
|= (oprec
> iprec
) ? 4 : 0;
9966 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
9967 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
9969 /* Determine the exponent to use. */
9974 /* oprec <= iprec, outer: signed, inner: don't care. */
9979 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9983 /* oprec > iprec, outer: signed, inner: signed. */
9987 /* oprec > iprec, outer: signed, inner: unsigned. */
9991 /* oprec > iprec, outer: unsigned, inner: signed. */
9995 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10002 /* Compute 2^^prec - 1. */
10003 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10006 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
10007 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10011 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10012 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
10013 lo
= ~(unsigned HOST_WIDE_INT
) 0;
10016 return build_int_cst_wide (outer
, lo
, hi
);
10019 /* Returns the smallest value obtainable by casting something in INNER type to
10023 lower_bound_in_type (tree outer
, tree inner
)
10025 unsigned HOST_WIDE_INT lo
, hi
;
10026 unsigned oprec
= TYPE_PRECISION (outer
);
10027 unsigned iprec
= TYPE_PRECISION (inner
);
10029 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10031 if (TYPE_UNSIGNED (outer
)
10032 /* If we are widening something of an unsigned type, OUTER type
10033 contains all values of INNER type. In particular, both INNER
10034 and OUTER types have zero in common. */
10035 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10039 /* If we are widening a signed type to another signed type, we
10040 want to obtain -2^^(iprec-1). If we are keeping the
10041 precision or narrowing to a signed type, we want to obtain
10043 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10045 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10047 hi
= ~(unsigned HOST_WIDE_INT
) 0;
10048 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10052 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10053 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10058 return build_int_cst_wide (outer
, lo
, hi
);
10061 /* Return nonzero if two operands that are suitable for PHI nodes are
10062 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10063 SSA_NAME or invariant. Note that this is strictly an optimization.
10064 That is, callers of this function can directly call operand_equal_p
10065 and get the same result, only slower. */
10068 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10072 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10074 return operand_equal_p (arg0
, arg1
, 0);
10077 /* Returns number of zeros at the end of binary representation of X.
10079 ??? Use ffs if available? */
10082 num_ending_zeros (const_tree x
)
10084 unsigned HOST_WIDE_INT fr
, nfr
;
10085 unsigned num
, abits
;
10086 tree type
= TREE_TYPE (x
);
10088 if (TREE_INT_CST_LOW (x
) == 0)
10090 num
= HOST_BITS_PER_WIDE_INT
;
10091 fr
= TREE_INT_CST_HIGH (x
);
10096 fr
= TREE_INT_CST_LOW (x
);
10099 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10102 if (nfr
<< abits
== fr
)
10109 if (num
> TYPE_PRECISION (type
))
10110 num
= TYPE_PRECISION (type
);
10112 return build_int_cst_type (type
, num
);
10116 #define WALK_SUBTREE(NODE) \
10119 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10125 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10126 be walked whenever a type is seen in the tree. Rest of operands and return
10127 value are as for walk_tree. */
10130 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10131 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10133 tree result
= NULL_TREE
;
10135 switch (TREE_CODE (type
))
10138 case REFERENCE_TYPE
:
10139 /* We have to worry about mutually recursive pointers. These can't
10140 be written in C. They can in Ada. It's pathological, but
10141 there's an ACATS test (c38102a) that checks it. Deal with this
10142 by checking if we're pointing to another pointer, that one
10143 points to another pointer, that one does too, and we have no htab.
10144 If so, get a hash table. We check three levels deep to avoid
10145 the cost of the hash table if we don't need one. */
10146 if (POINTER_TYPE_P (TREE_TYPE (type
))
10147 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10148 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10151 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10159 /* ... fall through ... */
10162 WALK_SUBTREE (TREE_TYPE (type
));
10166 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10168 /* Fall through. */
10170 case FUNCTION_TYPE
:
10171 WALK_SUBTREE (TREE_TYPE (type
));
10175 /* We never want to walk into default arguments. */
10176 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10177 WALK_SUBTREE (TREE_VALUE (arg
));
10182 /* Don't follow this nodes's type if a pointer for fear that
10183 we'll have infinite recursion. If we have a PSET, then we
10186 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10187 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10188 WALK_SUBTREE (TREE_TYPE (type
));
10189 WALK_SUBTREE (TYPE_DOMAIN (type
));
10193 WALK_SUBTREE (TREE_TYPE (type
));
10194 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10204 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10205 called with the DATA and the address of each sub-tree. If FUNC returns a
10206 non-NULL value, the traversal is stopped, and the value returned by FUNC
10207 is returned. If PSET is non-NULL it is used to record the nodes visited,
10208 and to avoid visiting a node more than once. */
10211 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10212 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10214 enum tree_code code
;
10218 #define WALK_SUBTREE_TAIL(NODE) \
10222 goto tail_recurse; \
10227 /* Skip empty subtrees. */
10231 /* Don't walk the same tree twice, if the user has requested
10232 that we avoid doing so. */
10233 if (pset
&& pointer_set_insert (pset
, *tp
))
10236 /* Call the function. */
10238 result
= (*func
) (tp
, &walk_subtrees
, data
);
10240 /* If we found something, return it. */
10244 code
= TREE_CODE (*tp
);
10246 /* Even if we didn't, FUNC may have decided that there was nothing
10247 interesting below this point in the tree. */
10248 if (!walk_subtrees
)
10250 /* But we still need to check our siblings. */
10251 if (code
== TREE_LIST
)
10252 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10253 else if (code
== OMP_CLAUSE
)
10254 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10261 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10262 if (result
|| !walk_subtrees
)
10269 case IDENTIFIER_NODE
:
10276 case PLACEHOLDER_EXPR
:
10280 /* None of these have subtrees other than those already walked
10285 WALK_SUBTREE (TREE_VALUE (*tp
));
10286 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10291 int len
= TREE_VEC_LENGTH (*tp
);
10296 /* Walk all elements but the first. */
10298 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10300 /* Now walk the first one as a tail call. */
10301 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10305 WALK_SUBTREE (TREE_REALPART (*tp
));
10306 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10310 unsigned HOST_WIDE_INT idx
;
10311 constructor_elt
*ce
;
10314 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10316 WALK_SUBTREE (ce
->value
);
10321 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10326 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10328 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10329 into declarations that are just mentioned, rather than
10330 declared; they don't really belong to this part of the tree.
10331 And, we can see cycles: the initializer for a declaration
10332 can refer to the declaration itself. */
10333 WALK_SUBTREE (DECL_INITIAL (decl
));
10334 WALK_SUBTREE (DECL_SIZE (decl
));
10335 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10337 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10340 case STATEMENT_LIST
:
10342 tree_stmt_iterator i
;
10343 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10344 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10349 switch (OMP_CLAUSE_CODE (*tp
))
10351 case OMP_CLAUSE_PRIVATE
:
10352 case OMP_CLAUSE_SHARED
:
10353 case OMP_CLAUSE_FIRSTPRIVATE
:
10354 case OMP_CLAUSE_COPYIN
:
10355 case OMP_CLAUSE_COPYPRIVATE
:
10356 case OMP_CLAUSE_IF
:
10357 case OMP_CLAUSE_NUM_THREADS
:
10358 case OMP_CLAUSE_SCHEDULE
:
10359 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10362 case OMP_CLAUSE_NOWAIT
:
10363 case OMP_CLAUSE_ORDERED
:
10364 case OMP_CLAUSE_DEFAULT
:
10365 case OMP_CLAUSE_UNTIED
:
10366 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10368 case OMP_CLAUSE_LASTPRIVATE
:
10369 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10370 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10371 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10373 case OMP_CLAUSE_COLLAPSE
:
10376 for (i
= 0; i
< 3; i
++)
10377 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10378 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10381 case OMP_CLAUSE_REDUCTION
:
10384 for (i
= 0; i
< 4; i
++)
10385 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10386 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10390 gcc_unreachable ();
10398 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10399 But, we only want to walk once. */
10400 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10401 for (i
= 0; i
< len
; ++i
)
10402 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10403 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10407 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10408 defining. We only want to walk into these fields of a type in this
10409 case and not in the general case of a mere reference to the type.
10411 The criterion is as follows: if the field can be an expression, it
10412 must be walked only here. This should be in keeping with the fields
10413 that are directly gimplified in gimplify_type_sizes in order for the
10414 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10415 variable-sized types.
10417 Note that DECLs get walked as part of processing the BIND_EXPR. */
10418 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10420 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10421 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10424 /* Call the function for the type. See if it returns anything or
10425 doesn't want us to continue. If we are to continue, walk both
10426 the normal fields and those for the declaration case. */
10427 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10428 if (result
|| !walk_subtrees
)
10431 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10435 /* If this is a record type, also walk the fields. */
10436 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10440 for (field
= TYPE_FIELDS (*type_p
); field
;
10441 field
= DECL_CHAIN (field
))
10443 /* We'd like to look at the type of the field, but we can
10444 easily get infinite recursion. So assume it's pointed
10445 to elsewhere in the tree. Also, ignore things that
10447 if (TREE_CODE (field
) != FIELD_DECL
)
10450 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10451 WALK_SUBTREE (DECL_SIZE (field
));
10452 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10453 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10454 WALK_SUBTREE (DECL_QUALIFIER (field
));
10458 /* Same for scalar types. */
10459 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10460 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10461 || TREE_CODE (*type_p
) == INTEGER_TYPE
10462 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10463 || TREE_CODE (*type_p
) == REAL_TYPE
)
10465 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10466 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10469 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10470 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10475 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10479 /* Walk over all the sub-trees of this operand. */
10480 len
= TREE_OPERAND_LENGTH (*tp
);
10482 /* Go through the subtrees. We need to do this in forward order so
10483 that the scope of a FOR_EXPR is handled properly. */
10486 for (i
= 0; i
< len
- 1; ++i
)
10487 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10488 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10491 /* If this is a type, walk the needed fields in the type. */
10492 else if (TYPE_P (*tp
))
10493 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10497 /* We didn't find what we were looking for. */
10500 #undef WALK_SUBTREE_TAIL
10502 #undef WALK_SUBTREE
10504 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10507 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10511 struct pointer_set_t
*pset
;
10513 pset
= pointer_set_create ();
10514 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10515 pointer_set_destroy (pset
);
10521 tree_block (tree t
)
10523 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10525 if (IS_EXPR_CODE_CLASS (c
))
10526 return &t
->exp
.block
;
10527 gcc_unreachable ();
10531 /* Create a nameless artificial label and put it in the current
10532 function context. The label has a location of LOC. Returns the
10533 newly created label. */
10536 create_artificial_label (location_t loc
)
10538 tree lab
= build_decl (loc
,
10539 LABEL_DECL
, NULL_TREE
, void_type_node
);
10541 DECL_ARTIFICIAL (lab
) = 1;
10542 DECL_IGNORED_P (lab
) = 1;
10543 DECL_CONTEXT (lab
) = current_function_decl
;
10547 /* Given a tree, try to return a useful variable name that we can use
10548 to prefix a temporary that is being assigned the value of the tree.
10549 I.E. given <temp> = &A, return A. */
10554 tree stripped_decl
;
10557 STRIP_NOPS (stripped_decl
);
10558 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10559 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10562 switch (TREE_CODE (stripped_decl
))
10565 return get_name (TREE_OPERAND (stripped_decl
, 0));
10572 /* Return true if TYPE has a variable argument list. */
10575 stdarg_p (const_tree fntype
)
10577 function_args_iterator args_iter
;
10578 tree n
= NULL_TREE
, t
;
10583 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10588 return n
!= NULL_TREE
&& n
!= void_type_node
;
10591 /* Return true if TYPE has a prototype. */
10594 prototype_p (tree fntype
)
10598 gcc_assert (fntype
!= NULL_TREE
);
10600 t
= TYPE_ARG_TYPES (fntype
);
10601 return (t
!= NULL_TREE
);
10604 /* If BLOCK is inlined from an __attribute__((__artificial__))
10605 routine, return pointer to location from where it has been
10608 block_nonartificial_location (tree block
)
10610 location_t
*ret
= NULL
;
10612 while (block
&& TREE_CODE (block
) == BLOCK
10613 && BLOCK_ABSTRACT_ORIGIN (block
))
10615 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10617 while (TREE_CODE (ao
) == BLOCK
10618 && BLOCK_ABSTRACT_ORIGIN (ao
)
10619 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10620 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10622 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10624 /* If AO is an artificial inline, point RET to the
10625 call site locus at which it has been inlined and continue
10626 the loop, in case AO's caller is also an artificial
10628 if (DECL_DECLARED_INLINE_P (ao
)
10629 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10630 ret
= &BLOCK_SOURCE_LOCATION (block
);
10634 else if (TREE_CODE (ao
) != BLOCK
)
10637 block
= BLOCK_SUPERCONTEXT (block
);
10643 /* If EXP is inlined from an __attribute__((__artificial__))
10644 function, return the location of the original call expression. */
10647 tree_nonartificial_location (tree exp
)
10649 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10654 return EXPR_LOCATION (exp
);
10658 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10661 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10664 cl_option_hash_hash (const void *x
)
10666 const_tree
const t
= (const_tree
) x
;
10670 hashval_t hash
= 0;
10672 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10674 p
= (const char *)TREE_OPTIMIZATION (t
);
10675 len
= sizeof (struct cl_optimization
);
10678 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10680 p
= (const char *)TREE_TARGET_OPTION (t
);
10681 len
= sizeof (struct cl_target_option
);
10685 gcc_unreachable ();
10687 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10689 for (i
= 0; i
< len
; i
++)
10691 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10696 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10697 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10701 cl_option_hash_eq (const void *x
, const void *y
)
10703 const_tree
const xt
= (const_tree
) x
;
10704 const_tree
const yt
= (const_tree
) y
;
10709 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10712 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10714 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10715 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10716 len
= sizeof (struct cl_optimization
);
10719 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10721 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10722 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10723 len
= sizeof (struct cl_target_option
);
10727 gcc_unreachable ();
10729 return (memcmp (xp
, yp
, len
) == 0);
10732 /* Build an OPTIMIZATION_NODE based on the current options. */
10735 build_optimization_node (void)
10740 /* Use the cache of optimization nodes. */
10742 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
10745 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10749 /* Insert this one into the hash table. */
10750 t
= cl_optimization_node
;
10753 /* Make a new node for next time round. */
10754 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10760 /* Build a TARGET_OPTION_NODE based on the current options. */
10763 build_target_option_node (void)
10768 /* Use the cache of optimization nodes. */
10770 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
10773 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10777 /* Insert this one into the hash table. */
10778 t
= cl_target_option_node
;
10781 /* Make a new node for next time round. */
10782 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10788 /* Determine the "ultimate origin" of a block. The block may be an inlined
10789 instance of an inlined instance of a block which is local to an inline
10790 function, so we have to trace all of the way back through the origin chain
10791 to find out what sort of node actually served as the original seed for the
10795 block_ultimate_origin (const_tree block
)
10797 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10799 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10800 nodes in the function to point to themselves; ignore that if
10801 we're trying to output the abstract instance of this function. */
10802 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10805 if (immediate_origin
== NULL_TREE
)
10810 tree lookahead
= immediate_origin
;
10814 ret_val
= lookahead
;
10815 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10816 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10818 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10820 /* The block's abstract origin chain may not be the *ultimate* origin of
10821 the block. It could lead to a DECL that has an abstract origin set.
10822 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10823 will give us if it has one). Note that DECL's abstract origins are
10824 supposed to be the most distant ancestor (or so decl_ultimate_origin
10825 claims), so we don't need to loop following the DECL origins. */
10826 if (DECL_P (ret_val
))
10827 return DECL_ORIGIN (ret_val
);
10833 /* Return true if T1 and T2 are equivalent lists. */
10836 list_equal_p (const_tree t1
, const_tree t2
)
10838 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10839 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10844 /* Return true iff conversion in EXP generates no instruction. Mark
10845 it inline so that we fully inline into the stripping functions even
10846 though we have two uses of this function. */
10849 tree_nop_conversion (const_tree exp
)
10851 tree outer_type
, inner_type
;
10853 if (!CONVERT_EXPR_P (exp
)
10854 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10856 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10859 outer_type
= TREE_TYPE (exp
);
10860 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10865 /* Use precision rather then machine mode when we can, which gives
10866 the correct answer even for submode (bit-field) types. */
10867 if ((INTEGRAL_TYPE_P (outer_type
)
10868 || POINTER_TYPE_P (outer_type
)
10869 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10870 && (INTEGRAL_TYPE_P (inner_type
)
10871 || POINTER_TYPE_P (inner_type
)
10872 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10873 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10875 /* Otherwise fall back on comparing machine modes (e.g. for
10876 aggregate types, floats). */
10877 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10880 /* Return true iff conversion in EXP generates no instruction. Don't
10881 consider conversions changing the signedness. */
10884 tree_sign_nop_conversion (const_tree exp
)
10886 tree outer_type
, inner_type
;
10888 if (!tree_nop_conversion (exp
))
10891 outer_type
= TREE_TYPE (exp
);
10892 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10894 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10895 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10898 /* Strip conversions from EXP according to tree_nop_conversion and
10899 return the resulting expression. */
10902 tree_strip_nop_conversions (tree exp
)
10904 while (tree_nop_conversion (exp
))
10905 exp
= TREE_OPERAND (exp
, 0);
10909 /* Strip conversions from EXP according to tree_sign_nop_conversion
10910 and return the resulting expression. */
10913 tree_strip_sign_nop_conversions (tree exp
)
10915 while (tree_sign_nop_conversion (exp
))
10916 exp
= TREE_OPERAND (exp
, 0);
10920 static GTY(()) tree gcc_eh_personality_decl
;
10922 /* Return the GCC personality function decl. */
10925 lhd_gcc_personality (void)
10927 if (!gcc_eh_personality_decl
)
10928 gcc_eh_personality_decl
= build_personality_function ("gcc");
10929 return gcc_eh_personality_decl
;
10932 /* Try to find a base info of BINFO that would have its field decl at offset
10933 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10934 found, return, otherwise return NULL_TREE. */
10937 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
10939 tree type
= TREE_TYPE (binfo
);
10943 HOST_WIDE_INT pos
, size
;
10947 gcc_checking_assert (offset
>= 0);
10948 if (type
== expected_type
)
10950 if (TREE_CODE (type
) != RECORD_TYPE
)
10953 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
10955 if (TREE_CODE (fld
) != FIELD_DECL
)
10958 pos
= int_bit_position (fld
);
10959 size
= tree_low_cst (DECL_SIZE (fld
), 1);
10960 if (pos
<= offset
&& (pos
+ size
) > offset
)
10963 if (!fld
|| !DECL_ARTIFICIAL (fld
))
10966 /* Offset 0 indicates the primary base, whose vtable contents are
10967 represented in the binfo for the derived class. */
10970 tree base_binfo
, found_binfo
= NULL_TREE
;
10971 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
10972 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
10974 found_binfo
= base_binfo
;
10979 binfo
= found_binfo
;
10982 type
= TREE_TYPE (fld
);
10987 /* Returns true if X is a typedef decl. */
10990 is_typedef_decl (tree x
)
10992 return (x
&& TREE_CODE (x
) == TYPE_DECL
10993 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
10996 /* Returns true iff TYPE is a type variant created for a typedef. */
10999 typedef_variant_p (tree type
)
11001 return is_typedef_decl (TYPE_NAME (type
));
11004 #include "gt-tree.h"