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 true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2799 size 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 structure of TYPE involves a PLACEHOLDER_EXPR
2886 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
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 || (!POINTER_TYPE_P (type
)
2898 && type_contains_placeholder_p (TREE_TYPE (type
))))
2901 /* Now do type-specific checks. Note that the last part of the check above
2902 greatly limits what we have to do below. */
2903 switch (TREE_CODE (type
))
2911 case REFERENCE_TYPE
:
2919 case FIXED_POINT_TYPE
:
2920 /* Here we just check the bounds. */
2921 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2922 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2925 /* We have already checked the component type above, so just check the
2927 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2931 case QUAL_UNION_TYPE
:
2935 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2936 if (TREE_CODE (field
) == FIELD_DECL
2937 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2938 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2939 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2940 || type_contains_placeholder_p (TREE_TYPE (field
))))
2951 /* Wrapper around above function used to cache its result. */
2954 type_contains_placeholder_p (tree type
)
2958 /* If the contains_placeholder_bits field has been initialized,
2959 then we know the answer. */
2960 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2961 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2963 /* Indicate that we've seen this type node, and the answer is false.
2964 This is what we want to return if we run into recursion via fields. */
2965 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2967 /* Compute the real value. */
2968 result
= type_contains_placeholder_1 (type
);
2970 /* Store the real value. */
2971 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2976 /* Push tree EXP onto vector QUEUE if it is not already present. */
2979 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2984 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
2985 if (simple_cst_equal (iter
, exp
) == 1)
2989 VEC_safe_push (tree
, heap
, *queue
, exp
);
2992 /* Given a tree EXP, find all occurences of references to fields
2993 in a PLACEHOLDER_EXPR and place them in vector REFS without
2994 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2995 we assume here that EXP contains only arithmetic expressions
2996 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3000 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3002 enum tree_code code
= TREE_CODE (exp
);
3006 /* We handle TREE_LIST and COMPONENT_REF separately. */
3007 if (code
== TREE_LIST
)
3009 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3010 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3012 else if (code
== COMPONENT_REF
)
3014 for (inner
= TREE_OPERAND (exp
, 0);
3015 REFERENCE_CLASS_P (inner
);
3016 inner
= TREE_OPERAND (inner
, 0))
3019 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3020 push_without_duplicates (exp
, refs
);
3022 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3025 switch (TREE_CODE_CLASS (code
))
3030 case tcc_declaration
:
3031 /* Variables allocated to static storage can stay. */
3032 if (!TREE_STATIC (exp
))
3033 push_without_duplicates (exp
, refs
);
3036 case tcc_expression
:
3037 /* This is the pattern built in ada/make_aligning_type. */
3038 if (code
== ADDR_EXPR
3039 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3041 push_without_duplicates (exp
, refs
);
3045 /* Fall through... */
3047 case tcc_exceptional
:
3050 case tcc_comparison
:
3052 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3053 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3057 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3058 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3066 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3067 return a tree with all occurrences of references to F in a
3068 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3069 CONST_DECLs. Note that we assume here that EXP contains only
3070 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3071 occurring only in their argument list. */
3074 substitute_in_expr (tree exp
, tree f
, tree r
)
3076 enum tree_code code
= TREE_CODE (exp
);
3077 tree op0
, op1
, op2
, op3
;
3080 /* We handle TREE_LIST and COMPONENT_REF separately. */
3081 if (code
== TREE_LIST
)
3083 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3084 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3085 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3088 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3090 else if (code
== COMPONENT_REF
)
3094 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3095 and it is the right field, replace it with R. */
3096 for (inner
= TREE_OPERAND (exp
, 0);
3097 REFERENCE_CLASS_P (inner
);
3098 inner
= TREE_OPERAND (inner
, 0))
3102 op1
= TREE_OPERAND (exp
, 1);
3104 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3107 /* If this expression hasn't been completed let, leave it alone. */
3108 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3111 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3112 if (op0
== TREE_OPERAND (exp
, 0))
3116 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3119 switch (TREE_CODE_CLASS (code
))
3124 case tcc_declaration
:
3130 case tcc_expression
:
3134 /* Fall through... */
3136 case tcc_exceptional
:
3139 case tcc_comparison
:
3141 switch (TREE_CODE_LENGTH (code
))
3147 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3148 if (op0
== TREE_OPERAND (exp
, 0))
3151 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3155 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3156 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3158 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3161 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3165 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3166 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3167 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3169 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3170 && op2
== TREE_OPERAND (exp
, 2))
3173 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3177 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3178 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3179 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3180 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3182 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3183 && op2
== TREE_OPERAND (exp
, 2)
3184 && op3
== TREE_OPERAND (exp
, 3))
3188 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3200 new_tree
= NULL_TREE
;
3202 /* If we are trying to replace F with a constant, inline back
3203 functions which do nothing else than computing a value from
3204 the arguments they are passed. This makes it possible to
3205 fold partially or entirely the replacement expression. */
3206 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3208 tree t
= maybe_inline_call_in_expr (exp
);
3210 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3213 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3215 tree op
= TREE_OPERAND (exp
, i
);
3216 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3220 new_tree
= copy_node (exp
);
3221 TREE_OPERAND (new_tree
, i
) = new_op
;
3227 new_tree
= fold (new_tree
);
3228 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3229 process_call_operands (new_tree
);
3240 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3242 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3243 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3248 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3249 for it within OBJ, a tree that is an object or a chain of references. */
3252 substitute_placeholder_in_expr (tree exp
, tree obj
)
3254 enum tree_code code
= TREE_CODE (exp
);
3255 tree op0
, op1
, op2
, op3
;
3258 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3259 in the chain of OBJ. */
3260 if (code
== PLACEHOLDER_EXPR
)
3262 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3265 for (elt
= obj
; elt
!= 0;
3266 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3267 || TREE_CODE (elt
) == COND_EXPR
)
3268 ? TREE_OPERAND (elt
, 1)
3269 : (REFERENCE_CLASS_P (elt
)
3270 || UNARY_CLASS_P (elt
)
3271 || BINARY_CLASS_P (elt
)
3272 || VL_EXP_CLASS_P (elt
)
3273 || EXPRESSION_CLASS_P (elt
))
3274 ? TREE_OPERAND (elt
, 0) : 0))
3275 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3278 for (elt
= obj
; elt
!= 0;
3279 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3280 || TREE_CODE (elt
) == COND_EXPR
)
3281 ? TREE_OPERAND (elt
, 1)
3282 : (REFERENCE_CLASS_P (elt
)
3283 || UNARY_CLASS_P (elt
)
3284 || BINARY_CLASS_P (elt
)
3285 || VL_EXP_CLASS_P (elt
)
3286 || EXPRESSION_CLASS_P (elt
))
3287 ? TREE_OPERAND (elt
, 0) : 0))
3288 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3289 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3291 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3293 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3294 survives until RTL generation, there will be an error. */
3298 /* TREE_LIST is special because we need to look at TREE_VALUE
3299 and TREE_CHAIN, not TREE_OPERANDS. */
3300 else if (code
== TREE_LIST
)
3302 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3303 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3304 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3307 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3310 switch (TREE_CODE_CLASS (code
))
3313 case tcc_declaration
:
3316 case tcc_exceptional
:
3319 case tcc_comparison
:
3320 case tcc_expression
:
3323 switch (TREE_CODE_LENGTH (code
))
3329 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3330 if (op0
== TREE_OPERAND (exp
, 0))
3333 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3337 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3338 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3340 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3343 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3347 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3348 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3349 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3351 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3352 && op2
== TREE_OPERAND (exp
, 2))
3355 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3359 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3360 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3361 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3362 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3364 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3365 && op2
== TREE_OPERAND (exp
, 2)
3366 && op3
== TREE_OPERAND (exp
, 3))
3370 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3382 new_tree
= NULL_TREE
;
3384 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3386 tree op
= TREE_OPERAND (exp
, i
);
3387 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3391 new_tree
= copy_node (exp
);
3392 TREE_OPERAND (new_tree
, i
) = new_op
;
3398 new_tree
= fold (new_tree
);
3399 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3400 process_call_operands (new_tree
);
3411 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3413 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3414 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3419 /* Stabilize a reference so that we can use it any number of times
3420 without causing its operands to be evaluated more than once.
3421 Returns the stabilized reference. This works by means of save_expr,
3422 so see the caveats in the comments about save_expr.
3424 Also allows conversion expressions whose operands are references.
3425 Any other kind of expression is returned unchanged. */
3428 stabilize_reference (tree ref
)
3431 enum tree_code code
= TREE_CODE (ref
);
3438 /* No action is needed in this case. */
3443 case FIX_TRUNC_EXPR
:
3444 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3448 result
= build_nt (INDIRECT_REF
,
3449 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3453 result
= build_nt (COMPONENT_REF
,
3454 stabilize_reference (TREE_OPERAND (ref
, 0)),
3455 TREE_OPERAND (ref
, 1), NULL_TREE
);
3459 result
= build_nt (BIT_FIELD_REF
,
3460 stabilize_reference (TREE_OPERAND (ref
, 0)),
3461 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3462 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3466 result
= build_nt (ARRAY_REF
,
3467 stabilize_reference (TREE_OPERAND (ref
, 0)),
3468 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3469 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3472 case ARRAY_RANGE_REF
:
3473 result
= build_nt (ARRAY_RANGE_REF
,
3474 stabilize_reference (TREE_OPERAND (ref
, 0)),
3475 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3476 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3480 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3481 it wouldn't be ignored. This matters when dealing with
3483 return stabilize_reference_1 (ref
);
3485 /* If arg isn't a kind of lvalue we recognize, make no change.
3486 Caller should recognize the error for an invalid lvalue. */
3491 return error_mark_node
;
3494 TREE_TYPE (result
) = TREE_TYPE (ref
);
3495 TREE_READONLY (result
) = TREE_READONLY (ref
);
3496 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3497 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3502 /* Subroutine of stabilize_reference; this is called for subtrees of
3503 references. Any expression with side-effects must be put in a SAVE_EXPR
3504 to ensure that it is only evaluated once.
3506 We don't put SAVE_EXPR nodes around everything, because assigning very
3507 simple expressions to temporaries causes us to miss good opportunities
3508 for optimizations. Among other things, the opportunity to fold in the
3509 addition of a constant into an addressing mode often gets lost, e.g.
3510 "y[i+1] += x;". In general, we take the approach that we should not make
3511 an assignment unless we are forced into it - i.e., that any non-side effect
3512 operator should be allowed, and that cse should take care of coalescing
3513 multiple utterances of the same expression should that prove fruitful. */
3516 stabilize_reference_1 (tree e
)
3519 enum tree_code code
= TREE_CODE (e
);
3521 /* We cannot ignore const expressions because it might be a reference
3522 to a const array but whose index contains side-effects. But we can
3523 ignore things that are actual constant or that already have been
3524 handled by this function. */
3526 if (tree_invariant_p (e
))
3529 switch (TREE_CODE_CLASS (code
))
3531 case tcc_exceptional
:
3533 case tcc_declaration
:
3534 case tcc_comparison
:
3536 case tcc_expression
:
3539 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3540 so that it will only be evaluated once. */
3541 /* The reference (r) and comparison (<) classes could be handled as
3542 below, but it is generally faster to only evaluate them once. */
3543 if (TREE_SIDE_EFFECTS (e
))
3544 return save_expr (e
);
3548 /* Constants need no processing. In fact, we should never reach
3553 /* Division is slow and tends to be compiled with jumps,
3554 especially the division by powers of 2 that is often
3555 found inside of an array reference. So do it just once. */
3556 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3557 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3558 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3559 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3560 return save_expr (e
);
3561 /* Recursively stabilize each operand. */
3562 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3563 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3567 /* Recursively stabilize each operand. */
3568 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3575 TREE_TYPE (result
) = TREE_TYPE (e
);
3576 TREE_READONLY (result
) = TREE_READONLY (e
);
3577 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3578 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3583 /* Low-level constructors for expressions. */
3585 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3586 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3589 recompute_tree_invariant_for_addr_expr (tree t
)
3592 bool tc
= true, se
= false;
3594 /* We started out assuming this address is both invariant and constant, but
3595 does not have side effects. Now go down any handled components and see if
3596 any of them involve offsets that are either non-constant or non-invariant.
3597 Also check for side-effects.
3599 ??? Note that this code makes no attempt to deal with the case where
3600 taking the address of something causes a copy due to misalignment. */
3602 #define UPDATE_FLAGS(NODE) \
3603 do { tree _node = (NODE); \
3604 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3605 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3607 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3608 node
= TREE_OPERAND (node
, 0))
3610 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3611 array reference (probably made temporarily by the G++ front end),
3612 so ignore all the operands. */
3613 if ((TREE_CODE (node
) == ARRAY_REF
3614 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3615 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3617 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3618 if (TREE_OPERAND (node
, 2))
3619 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3620 if (TREE_OPERAND (node
, 3))
3621 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3623 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3624 FIELD_DECL, apparently. The G++ front end can put something else
3625 there, at least temporarily. */
3626 else if (TREE_CODE (node
) == COMPONENT_REF
3627 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3629 if (TREE_OPERAND (node
, 2))
3630 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3632 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3633 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3636 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3638 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3639 the address, since &(*a)->b is a form of addition. If it's a constant, the
3640 address is constant too. If it's a decl, its address is constant if the
3641 decl is static. Everything else is not constant and, furthermore,
3642 taking the address of a volatile variable is not volatile. */
3643 if (TREE_CODE (node
) == INDIRECT_REF
3644 || TREE_CODE (node
) == MEM_REF
)
3645 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3646 else if (CONSTANT_CLASS_P (node
))
3648 else if (DECL_P (node
))
3649 tc
&= (staticp (node
) != NULL_TREE
);
3653 se
|= TREE_SIDE_EFFECTS (node
);
3657 TREE_CONSTANT (t
) = tc
;
3658 TREE_SIDE_EFFECTS (t
) = se
;
3662 /* Build an expression of code CODE, data type TYPE, and operands as
3663 specified. Expressions and reference nodes can be created this way.
3664 Constants, decls, types and misc nodes cannot be.
3666 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3667 enough for all extant tree codes. */
3670 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3674 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3676 t
= make_node_stat (code PASS_MEM_STAT
);
3683 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3685 int length
= sizeof (struct tree_exp
);
3686 #ifdef GATHER_STATISTICS
3687 tree_node_kind kind
;
3691 #ifdef GATHER_STATISTICS
3692 switch (TREE_CODE_CLASS (code
))
3694 case tcc_statement
: /* an expression with side effects */
3697 case tcc_reference
: /* a reference */
3705 tree_node_counts
[(int) kind
]++;
3706 tree_node_sizes
[(int) kind
] += length
;
3709 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3711 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3713 memset (t
, 0, sizeof (struct tree_common
));
3715 TREE_SET_CODE (t
, code
);
3717 TREE_TYPE (t
) = type
;
3718 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3719 TREE_OPERAND (t
, 0) = node
;
3720 TREE_BLOCK (t
) = NULL_TREE
;
3721 if (node
&& !TYPE_P (node
))
3723 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3724 TREE_READONLY (t
) = TREE_READONLY (node
);
3727 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3728 TREE_SIDE_EFFECTS (t
) = 1;
3732 /* All of these have side-effects, no matter what their
3734 TREE_SIDE_EFFECTS (t
) = 1;
3735 TREE_READONLY (t
) = 0;
3739 /* Whether a dereference is readonly has nothing to do with whether
3740 its operand is readonly. */
3741 TREE_READONLY (t
) = 0;
3746 recompute_tree_invariant_for_addr_expr (t
);
3750 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3751 && node
&& !TYPE_P (node
)
3752 && TREE_CONSTANT (node
))
3753 TREE_CONSTANT (t
) = 1;
3754 if (TREE_CODE_CLASS (code
) == tcc_reference
3755 && node
&& TREE_THIS_VOLATILE (node
))
3756 TREE_THIS_VOLATILE (t
) = 1;
3763 #define PROCESS_ARG(N) \
3765 TREE_OPERAND (t, N) = arg##N; \
3766 if (arg##N &&!TYPE_P (arg##N)) \
3768 if (TREE_SIDE_EFFECTS (arg##N)) \
3770 if (!TREE_READONLY (arg##N) \
3771 && !CONSTANT_CLASS_P (arg##N)) \
3772 (void) (read_only = 0); \
3773 if (!TREE_CONSTANT (arg##N)) \
3774 (void) (constant = 0); \
3779 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3781 bool constant
, read_only
, side_effects
;
3784 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3786 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3787 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3788 /* When sizetype precision doesn't match that of pointers
3789 we need to be able to build explicit extensions or truncations
3790 of the offset argument. */
3791 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3792 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3793 && TREE_CODE (arg1
) == INTEGER_CST
);
3795 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3796 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3797 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3798 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3800 t
= make_node_stat (code PASS_MEM_STAT
);
3803 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3804 result based on those same flags for the arguments. But if the
3805 arguments aren't really even `tree' expressions, we shouldn't be trying
3808 /* Expressions without side effects may be constant if their
3809 arguments are as well. */
3810 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3811 || TREE_CODE_CLASS (code
) == tcc_binary
);
3813 side_effects
= TREE_SIDE_EFFECTS (t
);
3818 TREE_READONLY (t
) = read_only
;
3819 TREE_CONSTANT (t
) = constant
;
3820 TREE_SIDE_EFFECTS (t
) = side_effects
;
3821 TREE_THIS_VOLATILE (t
)
3822 = (TREE_CODE_CLASS (code
) == tcc_reference
3823 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3830 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3831 tree arg2 MEM_STAT_DECL
)
3833 bool constant
, read_only
, side_effects
;
3836 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3837 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3839 t
= make_node_stat (code PASS_MEM_STAT
);
3844 /* As a special exception, if COND_EXPR has NULL branches, we
3845 assume that it is a gimple statement and always consider
3846 it to have side effects. */
3847 if (code
== COND_EXPR
3848 && tt
== void_type_node
3849 && arg1
== NULL_TREE
3850 && arg2
== NULL_TREE
)
3851 side_effects
= true;
3853 side_effects
= TREE_SIDE_EFFECTS (t
);
3859 if (code
== COND_EXPR
)
3860 TREE_READONLY (t
) = read_only
;
3862 TREE_SIDE_EFFECTS (t
) = side_effects
;
3863 TREE_THIS_VOLATILE (t
)
3864 = (TREE_CODE_CLASS (code
) == tcc_reference
3865 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3871 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3872 tree arg2
, tree arg3 MEM_STAT_DECL
)
3874 bool constant
, read_only
, side_effects
;
3877 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3879 t
= make_node_stat (code PASS_MEM_STAT
);
3882 side_effects
= TREE_SIDE_EFFECTS (t
);
3889 TREE_SIDE_EFFECTS (t
) = side_effects
;
3890 TREE_THIS_VOLATILE (t
)
3891 = (TREE_CODE_CLASS (code
) == tcc_reference
3892 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3898 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3899 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3901 bool constant
, read_only
, side_effects
;
3904 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3906 t
= make_node_stat (code PASS_MEM_STAT
);
3909 side_effects
= TREE_SIDE_EFFECTS (t
);
3917 TREE_SIDE_EFFECTS (t
) = side_effects
;
3918 TREE_THIS_VOLATILE (t
)
3919 = (TREE_CODE_CLASS (code
) == tcc_reference
3920 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3926 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3927 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3929 bool constant
, read_only
, side_effects
;
3932 gcc_assert (code
== TARGET_MEM_REF
);
3934 t
= make_node_stat (code PASS_MEM_STAT
);
3937 side_effects
= TREE_SIDE_EFFECTS (t
);
3944 if (code
== TARGET_MEM_REF
)
3948 TREE_SIDE_EFFECTS (t
) = side_effects
;
3949 TREE_THIS_VOLATILE (t
)
3950 = (code
== TARGET_MEM_REF
3951 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3956 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3957 on the pointer PTR. */
3960 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3962 HOST_WIDE_INT offset
= 0;
3963 tree ptype
= TREE_TYPE (ptr
);
3965 /* For convenience allow addresses that collapse to a simple base
3967 if (TREE_CODE (ptr
) == ADDR_EXPR
3968 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3969 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3971 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3973 ptr
= build_fold_addr_expr (ptr
);
3974 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3976 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3977 ptr
, build_int_cst (ptype
, offset
));
3978 SET_EXPR_LOCATION (tem
, loc
);
3982 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3985 mem_ref_offset (const_tree t
)
3987 tree toff
= TREE_OPERAND (t
, 1);
3988 return double_int_sext (tree_to_double_int (toff
),
3989 TYPE_PRECISION (TREE_TYPE (toff
)));
3992 /* Return the pointer-type relevant for TBAA purposes from the
3993 gimple memory reference tree T. This is the type to be used for
3994 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3997 reference_alias_ptr_type (const_tree t
)
3999 const_tree base
= t
;
4000 while (handled_component_p (base
))
4001 base
= TREE_OPERAND (base
, 0);
4002 if (TREE_CODE (base
) == MEM_REF
)
4003 return TREE_TYPE (TREE_OPERAND (base
, 1));
4004 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4005 return TREE_TYPE (TMR_OFFSET (base
));
4007 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4010 /* Similar except don't specify the TREE_TYPE
4011 and leave the TREE_SIDE_EFFECTS as 0.
4012 It is permissible for arguments to be null,
4013 or even garbage if their values do not matter. */
4016 build_nt (enum tree_code code
, ...)
4023 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4027 t
= make_node (code
);
4028 length
= TREE_CODE_LENGTH (code
);
4030 for (i
= 0; i
< length
; i
++)
4031 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4037 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4041 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4046 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4047 CALL_EXPR_FN (ret
) = fn
;
4048 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4049 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4050 CALL_EXPR_ARG (ret
, ix
) = t
;
4054 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4055 We do NOT enter this node in any sort of symbol table.
4057 LOC is the location of the decl.
4059 layout_decl is used to set up the decl's storage layout.
4060 Other slots are initialized to 0 or null pointers. */
4063 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4064 tree type MEM_STAT_DECL
)
4068 t
= make_node_stat (code PASS_MEM_STAT
);
4069 DECL_SOURCE_LOCATION (t
) = loc
;
4071 /* if (type == error_mark_node)
4072 type = integer_type_node; */
4073 /* That is not done, deliberately, so that having error_mark_node
4074 as the type can suppress useless errors in the use of this variable. */
4076 DECL_NAME (t
) = name
;
4077 TREE_TYPE (t
) = type
;
4079 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4085 /* Builds and returns function declaration with NAME and TYPE. */
4088 build_fn_decl (const char *name
, tree type
)
4090 tree id
= get_identifier (name
);
4091 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4093 DECL_EXTERNAL (decl
) = 1;
4094 TREE_PUBLIC (decl
) = 1;
4095 DECL_ARTIFICIAL (decl
) = 1;
4096 TREE_NOTHROW (decl
) = 1;
4101 VEC(tree
,gc
) *all_translation_units
;
4103 /* Builds a new translation-unit decl with name NAME, queues it in the
4104 global list of translation-unit decls and returns it. */
4107 build_translation_unit_decl (tree name
)
4109 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4111 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4112 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4117 /* BLOCK nodes are used to represent the structure of binding contours
4118 and declarations, once those contours have been exited and their contents
4119 compiled. This information is used for outputting debugging info. */
4122 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4124 tree block
= make_node (BLOCK
);
4126 BLOCK_VARS (block
) = vars
;
4127 BLOCK_SUBBLOCKS (block
) = subblocks
;
4128 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4129 BLOCK_CHAIN (block
) = chain
;
4134 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4136 LOC is the location to use in tree T. */
4139 protected_set_expr_location (tree t
, location_t loc
)
4141 if (t
&& CAN_HAVE_LOCATION_P (t
))
4142 SET_EXPR_LOCATION (t
, loc
);
4145 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4149 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4151 DECL_ATTRIBUTES (ddecl
) = attribute
;
4155 /* Borrowed from hashtab.c iterative_hash implementation. */
4156 #define mix(a,b,c) \
4158 a -= b; a -= c; a ^= (c>>13); \
4159 b -= c; b -= a; b ^= (a<< 8); \
4160 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4161 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4162 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4163 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4164 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4165 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4166 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4170 /* Produce good hash value combining VAL and VAL2. */
4172 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4174 /* the golden ratio; an arbitrary value. */
4175 hashval_t a
= 0x9e3779b9;
4181 /* Produce good hash value combining VAL and VAL2. */
4183 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4185 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4186 return iterative_hash_hashval_t (val
, val2
);
4189 hashval_t a
= (hashval_t
) val
;
4190 /* Avoid warnings about shifting of more than the width of the type on
4191 hosts that won't execute this path. */
4193 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4195 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4197 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4198 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4205 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4206 is ATTRIBUTE and its qualifiers are QUALS.
4208 Record such modified types already made so we don't make duplicates. */
4211 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4213 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4215 hashval_t hashcode
= 0;
4217 enum tree_code code
= TREE_CODE (ttype
);
4219 /* Building a distinct copy of a tagged type is inappropriate; it
4220 causes breakage in code that expects there to be a one-to-one
4221 relationship between a struct and its fields.
4222 build_duplicate_type is another solution (as used in
4223 handle_transparent_union_attribute), but that doesn't play well
4224 with the stronger C++ type identity model. */
4225 if (TREE_CODE (ttype
) == RECORD_TYPE
4226 || TREE_CODE (ttype
) == UNION_TYPE
4227 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4228 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4230 warning (OPT_Wattributes
,
4231 "ignoring attributes applied to %qT after definition",
4232 TYPE_MAIN_VARIANT (ttype
));
4233 return build_qualified_type (ttype
, quals
);
4236 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4237 ntype
= build_distinct_type_copy (ttype
);
4239 TYPE_ATTRIBUTES (ntype
) = attribute
;
4241 hashcode
= iterative_hash_object (code
, hashcode
);
4242 if (TREE_TYPE (ntype
))
4243 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4245 hashcode
= attribute_hash_list (attribute
, hashcode
);
4247 switch (TREE_CODE (ntype
))
4250 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4253 if (TYPE_DOMAIN (ntype
))
4254 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4258 hashcode
= iterative_hash_object
4259 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4260 hashcode
= iterative_hash_object
4261 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4264 case FIXED_POINT_TYPE
:
4266 unsigned int precision
= TYPE_PRECISION (ntype
);
4267 hashcode
= iterative_hash_object (precision
, hashcode
);
4274 ntype
= type_hash_canon (hashcode
, ntype
);
4276 /* If the target-dependent attributes make NTYPE different from
4277 its canonical type, we will need to use structural equality
4278 checks for this type. */
4279 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4280 || !targetm
.comp_type_attributes (ntype
, ttype
))
4281 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4282 else if (TYPE_CANONICAL (ntype
) == ntype
)
4283 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4285 ttype
= build_qualified_type (ntype
, quals
);
4287 else if (TYPE_QUALS (ttype
) != quals
)
4288 ttype
= build_qualified_type (ttype
, quals
);
4294 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4297 Record such modified types already made so we don't make duplicates. */
4300 build_type_attribute_variant (tree ttype
, tree attribute
)
4302 return build_type_attribute_qual_variant (ttype
, attribute
,
4303 TYPE_QUALS (ttype
));
4307 /* Reset the expression *EXPR_P, a size or position.
4309 ??? We could reset all non-constant sizes or positions. But it's cheap
4310 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4312 We need to reset self-referential sizes or positions because they cannot
4313 be gimplified and thus can contain a CALL_EXPR after the gimplification
4314 is finished, which will run afoul of LTO streaming. And they need to be
4315 reset to something essentially dummy but not constant, so as to preserve
4316 the properties of the object they are attached to. */
4319 free_lang_data_in_one_sizepos (tree
*expr_p
)
4321 tree expr
= *expr_p
;
4322 if (CONTAINS_PLACEHOLDER_P (expr
))
4323 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4327 /* Reset all the fields in a binfo node BINFO. We only keep
4328 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4331 free_lang_data_in_binfo (tree binfo
)
4336 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4338 BINFO_VTABLE (binfo
) = NULL_TREE
;
4339 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4340 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4341 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4343 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4344 free_lang_data_in_binfo (t
);
4348 /* Reset all language specific information still present in TYPE. */
4351 free_lang_data_in_type (tree type
)
4353 gcc_assert (TYPE_P (type
));
4355 /* Give the FE a chance to remove its own data first. */
4356 lang_hooks
.free_lang_data (type
);
4358 TREE_LANG_FLAG_0 (type
) = 0;
4359 TREE_LANG_FLAG_1 (type
) = 0;
4360 TREE_LANG_FLAG_2 (type
) = 0;
4361 TREE_LANG_FLAG_3 (type
) = 0;
4362 TREE_LANG_FLAG_4 (type
) = 0;
4363 TREE_LANG_FLAG_5 (type
) = 0;
4364 TREE_LANG_FLAG_6 (type
) = 0;
4366 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4368 /* Remove the const and volatile qualifiers from arguments. The
4369 C++ front end removes them, but the C front end does not,
4370 leading to false ODR violation errors when merging two
4371 instances of the same function signature compiled by
4372 different front ends. */
4375 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4377 tree arg_type
= TREE_VALUE (p
);
4379 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4381 int quals
= TYPE_QUALS (arg_type
)
4383 & ~TYPE_QUAL_VOLATILE
;
4384 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4385 free_lang_data_in_type (TREE_VALUE (p
));
4390 /* Remove members that are not actually FIELD_DECLs from the field
4391 list of an aggregate. These occur in C++. */
4392 if (RECORD_OR_UNION_TYPE_P (type
))
4396 /* Note that TYPE_FIELDS can be shared across distinct
4397 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4398 to be removed, we cannot set its TREE_CHAIN to NULL.
4399 Otherwise, we would not be able to find all the other fields
4400 in the other instances of this TREE_TYPE.
4402 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4404 member
= TYPE_FIELDS (type
);
4407 if (TREE_CODE (member
) == FIELD_DECL
)
4410 TREE_CHAIN (prev
) = member
;
4412 TYPE_FIELDS (type
) = member
;
4416 member
= TREE_CHAIN (member
);
4420 TREE_CHAIN (prev
) = NULL_TREE
;
4422 TYPE_FIELDS (type
) = NULL_TREE
;
4424 TYPE_METHODS (type
) = NULL_TREE
;
4425 if (TYPE_BINFO (type
))
4426 free_lang_data_in_binfo (TYPE_BINFO (type
));
4430 /* For non-aggregate types, clear out the language slot (which
4431 overloads TYPE_BINFO). */
4432 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4434 if (INTEGRAL_TYPE_P (type
)
4435 || SCALAR_FLOAT_TYPE_P (type
)
4436 || FIXED_POINT_TYPE_P (type
))
4438 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4439 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4443 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4444 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4446 if (debug_info_level
< DINFO_LEVEL_TERSE
4447 || (TYPE_CONTEXT (type
)
4448 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4449 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4450 TYPE_CONTEXT (type
) = NULL_TREE
;
4452 if (debug_info_level
< DINFO_LEVEL_TERSE
)
4453 TYPE_STUB_DECL (type
) = NULL_TREE
;
4457 /* Return true if DECL may need an assembler name to be set. */
4460 need_assembler_name_p (tree decl
)
4462 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4463 if (TREE_CODE (decl
) != FUNCTION_DECL
4464 && TREE_CODE (decl
) != VAR_DECL
)
4467 /* If DECL already has its assembler name set, it does not need a
4469 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4470 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4473 /* Abstract decls do not need an assembler name. */
4474 if (DECL_ABSTRACT (decl
))
4477 /* For VAR_DECLs, only static, public and external symbols need an
4479 if (TREE_CODE (decl
) == VAR_DECL
4480 && !TREE_STATIC (decl
)
4481 && !TREE_PUBLIC (decl
)
4482 && !DECL_EXTERNAL (decl
))
4485 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4487 /* Do not set assembler name on builtins. Allow RTL expansion to
4488 decide whether to expand inline or via a regular call. */
4489 if (DECL_BUILT_IN (decl
)
4490 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4493 /* Functions represented in the callgraph need an assembler name. */
4494 if (cgraph_get_node (decl
) != NULL
)
4497 /* Unused and not public functions don't need an assembler name. */
4498 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4506 /* Reset all language specific information still present in symbol
4510 free_lang_data_in_decl (tree decl
)
4512 gcc_assert (DECL_P (decl
));
4514 /* Give the FE a chance to remove its own data first. */
4515 lang_hooks
.free_lang_data (decl
);
4517 TREE_LANG_FLAG_0 (decl
) = 0;
4518 TREE_LANG_FLAG_1 (decl
) = 0;
4519 TREE_LANG_FLAG_2 (decl
) = 0;
4520 TREE_LANG_FLAG_3 (decl
) = 0;
4521 TREE_LANG_FLAG_4 (decl
) = 0;
4522 TREE_LANG_FLAG_5 (decl
) = 0;
4523 TREE_LANG_FLAG_6 (decl
) = 0;
4525 /* Identifiers need not have a type. */
4526 if (DECL_NAME (decl
))
4527 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4529 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4530 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4531 if (TREE_CODE (decl
) == FIELD_DECL
)
4532 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4534 /* DECL_FCONTEXT is only used for debug info generation. */
4535 if (TREE_CODE (decl
) == FIELD_DECL
4536 && debug_info_level
< DINFO_LEVEL_TERSE
)
4537 DECL_FCONTEXT (decl
) = NULL_TREE
;
4539 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4541 if (gimple_has_body_p (decl
))
4545 /* If DECL has a gimple body, then the context for its
4546 arguments must be DECL. Otherwise, it doesn't really
4547 matter, as we will not be emitting any code for DECL. In
4548 general, there may be other instances of DECL created by
4549 the front end and since PARM_DECLs are generally shared,
4550 their DECL_CONTEXT changes as the replicas of DECL are
4551 created. The only time where DECL_CONTEXT is important
4552 is for the FUNCTION_DECLs that have a gimple body (since
4553 the PARM_DECL will be used in the function's body). */
4554 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4555 DECL_CONTEXT (t
) = decl
;
4558 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4559 At this point, it is not needed anymore. */
4560 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4562 /* Clear the abstract origin if it refers to a method. Otherwise
4563 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4564 origin will not be output correctly. */
4565 if (DECL_ABSTRACT_ORIGIN (decl
)
4566 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4567 && RECORD_OR_UNION_TYPE_P
4568 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4569 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4571 else if (TREE_CODE (decl
) == VAR_DECL
)
4573 if ((DECL_EXTERNAL (decl
)
4574 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4575 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4576 DECL_INITIAL (decl
) = NULL_TREE
;
4578 else if (TREE_CODE (decl
) == TYPE_DECL
)
4579 DECL_INITIAL (decl
) = NULL_TREE
;
4583 /* Data used when collecting DECLs and TYPEs for language data removal. */
4585 struct free_lang_data_d
4587 /* Worklist to avoid excessive recursion. */
4588 VEC(tree
,heap
) *worklist
;
4590 /* Set of traversed objects. Used to avoid duplicate visits. */
4591 struct pointer_set_t
*pset
;
4593 /* Array of symbols to process with free_lang_data_in_decl. */
4594 VEC(tree
,heap
) *decls
;
4596 /* Array of types to process with free_lang_data_in_type. */
4597 VEC(tree
,heap
) *types
;
4601 /* Save all language fields needed to generate proper debug information
4602 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4605 save_debug_info_for_decl (tree t
)
4607 /*struct saved_debug_info_d *sdi;*/
4609 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4611 /* FIXME. Partial implementation for saving debug info removed. */
4615 /* Save all language fields needed to generate proper debug information
4616 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4619 save_debug_info_for_type (tree t
)
4621 /*struct saved_debug_info_d *sdi;*/
4623 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4625 /* FIXME. Partial implementation for saving debug info removed. */
4629 /* Add type or decl T to one of the list of tree nodes that need their
4630 language data removed. The lists are held inside FLD. */
4633 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4637 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4638 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4639 save_debug_info_for_decl (t
);
4641 else if (TYPE_P (t
))
4643 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4644 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4645 save_debug_info_for_type (t
);
4651 /* Push tree node T into FLD->WORKLIST. */
4654 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4656 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4657 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4661 /* Operand callback helper for free_lang_data_in_node. *TP is the
4662 subtree operand being considered. */
4665 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4668 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4670 if (TREE_CODE (t
) == TREE_LIST
)
4673 /* Language specific nodes will be removed, so there is no need
4674 to gather anything under them. */
4675 if (is_lang_specific (t
))
4683 /* Note that walk_tree does not traverse every possible field in
4684 decls, so we have to do our own traversals here. */
4685 add_tree_to_fld_list (t
, fld
);
4687 fld_worklist_push (DECL_NAME (t
), fld
);
4688 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4689 fld_worklist_push (DECL_SIZE (t
), fld
);
4690 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4692 /* We are going to remove everything under DECL_INITIAL for
4693 TYPE_DECLs. No point walking them. */
4694 if (TREE_CODE (t
) != TYPE_DECL
)
4695 fld_worklist_push (DECL_INITIAL (t
), fld
);
4697 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4698 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4700 if (TREE_CODE (t
) == FUNCTION_DECL
)
4702 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4703 fld_worklist_push (DECL_RESULT (t
), fld
);
4705 else if (TREE_CODE (t
) == TYPE_DECL
)
4707 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4708 fld_worklist_push (DECL_VINDEX (t
), fld
);
4710 else if (TREE_CODE (t
) == FIELD_DECL
)
4712 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4713 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4714 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4715 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4716 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4718 else if (TREE_CODE (t
) == VAR_DECL
)
4720 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4721 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4724 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4725 && DECL_HAS_VALUE_EXPR_P (t
))
4726 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4728 if (TREE_CODE (t
) != FIELD_DECL
4729 && TREE_CODE (t
) != TYPE_DECL
)
4730 fld_worklist_push (TREE_CHAIN (t
), fld
);
4733 else if (TYPE_P (t
))
4735 /* Note that walk_tree does not traverse every possible field in
4736 types, so we have to do our own traversals here. */
4737 add_tree_to_fld_list (t
, fld
);
4739 if (!RECORD_OR_UNION_TYPE_P (t
))
4740 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4741 fld_worklist_push (TYPE_SIZE (t
), fld
);
4742 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4743 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4744 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4745 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4746 fld_worklist_push (TYPE_NAME (t
), fld
);
4747 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4748 them and thus do not and want not to reach unused pointer types
4750 if (!POINTER_TYPE_P (t
))
4751 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4752 if (!RECORD_OR_UNION_TYPE_P (t
))
4753 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4754 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4755 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4756 do not and want not to reach unused variants this way. */
4757 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4758 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4759 and want not to reach unused types this way. */
4761 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4765 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4767 fld_worklist_push (TREE_TYPE (tem
), fld
);
4768 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4770 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4771 && TREE_CODE (tem
) == TREE_LIST
)
4774 fld_worklist_push (TREE_VALUE (tem
), fld
);
4775 tem
= TREE_CHAIN (tem
);
4779 if (RECORD_OR_UNION_TYPE_P (t
))
4782 /* Push all TYPE_FIELDS - there can be interleaving interesting
4783 and non-interesting things. */
4784 tem
= TYPE_FIELDS (t
);
4787 if (TREE_CODE (tem
) == FIELD_DECL
)
4788 fld_worklist_push (tem
, fld
);
4789 tem
= TREE_CHAIN (tem
);
4793 fld_worklist_push (TREE_CHAIN (t
), fld
);
4796 else if (TREE_CODE (t
) == BLOCK
)
4799 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4800 fld_worklist_push (tem
, fld
);
4801 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4802 fld_worklist_push (tem
, fld
);
4803 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4806 fld_worklist_push (TREE_TYPE (t
), fld
);
4812 /* Find decls and types in T. */
4815 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4819 if (!pointer_set_contains (fld
->pset
, t
))
4820 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4821 if (VEC_empty (tree
, fld
->worklist
))
4823 t
= VEC_pop (tree
, fld
->worklist
);
4827 /* Translate all the types in LIST with the corresponding runtime
4831 get_eh_types_for_runtime (tree list
)
4835 if (list
== NULL_TREE
)
4838 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4840 list
= TREE_CHAIN (list
);
4843 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4844 TREE_CHAIN (prev
) = n
;
4845 prev
= TREE_CHAIN (prev
);
4846 list
= TREE_CHAIN (list
);
4853 /* Find decls and types referenced in EH region R and store them in
4854 FLD->DECLS and FLD->TYPES. */
4857 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4868 /* The types referenced in each catch must first be changed to the
4869 EH types used at runtime. This removes references to FE types
4871 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4873 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4874 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4879 case ERT_ALLOWED_EXCEPTIONS
:
4880 r
->u
.allowed
.type_list
4881 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4882 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4885 case ERT_MUST_NOT_THROW
:
4886 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4887 find_decls_types_r
, fld
, fld
->pset
);
4893 /* Find decls and types referenced in cgraph node N and store them in
4894 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4895 look for *every* kind of DECL and TYPE node reachable from N,
4896 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4897 NAMESPACE_DECLs, etc). */
4900 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4903 struct function
*fn
;
4907 find_decls_types (n
->decl
, fld
);
4909 if (!gimple_has_body_p (n
->decl
))
4912 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
4914 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
4916 /* Traverse locals. */
4917 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
4918 find_decls_types (t
, fld
);
4920 /* Traverse EH regions in FN. */
4923 FOR_ALL_EH_REGION_FN (r
, fn
)
4924 find_decls_types_in_eh_region (r
, fld
);
4927 /* Traverse every statement in FN. */
4928 FOR_EACH_BB_FN (bb
, fn
)
4930 gimple_stmt_iterator si
;
4933 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
4935 gimple phi
= gsi_stmt (si
);
4937 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4939 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
4940 find_decls_types (*arg_p
, fld
);
4944 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
4946 gimple stmt
= gsi_stmt (si
);
4948 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
4950 tree arg
= gimple_op (stmt
, i
);
4951 find_decls_types (arg
, fld
);
4958 /* Find decls and types referenced in varpool node N and store them in
4959 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4960 look for *every* kind of DECL and TYPE node reachable from N,
4961 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4962 NAMESPACE_DECLs, etc). */
4965 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
4967 find_decls_types (v
->decl
, fld
);
4970 /* If T needs an assembler name, have one created for it. */
4973 assign_assembler_name_if_neeeded (tree t
)
4975 if (need_assembler_name_p (t
))
4977 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4978 diagnostics that use input_location to show locus
4979 information. The problem here is that, at this point,
4980 input_location is generally anchored to the end of the file
4981 (since the parser is long gone), so we don't have a good
4982 position to pin it to.
4984 To alleviate this problem, this uses the location of T's
4985 declaration. Examples of this are
4986 testsuite/g++.dg/template/cond2.C and
4987 testsuite/g++.dg/template/pr35240.C. */
4988 location_t saved_location
= input_location
;
4989 input_location
= DECL_SOURCE_LOCATION (t
);
4991 decl_assembler_name (t
);
4993 input_location
= saved_location
;
4998 /* Free language specific information for every operand and expression
4999 in every node of the call graph. This process operates in three stages:
5001 1- Every callgraph node and varpool node is traversed looking for
5002 decls and types embedded in them. This is a more exhaustive
5003 search than that done by find_referenced_vars, because it will
5004 also collect individual fields, decls embedded in types, etc.
5006 2- All the decls found are sent to free_lang_data_in_decl.
5008 3- All the types found are sent to free_lang_data_in_type.
5010 The ordering between decls and types is important because
5011 free_lang_data_in_decl sets assembler names, which includes
5012 mangling. So types cannot be freed up until assembler names have
5016 free_lang_data_in_cgraph (void)
5018 struct cgraph_node
*n
;
5019 struct varpool_node
*v
;
5020 struct free_lang_data_d fld
;
5025 /* Initialize sets and arrays to store referenced decls and types. */
5026 fld
.pset
= pointer_set_create ();
5027 fld
.worklist
= NULL
;
5028 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5029 fld
.types
= VEC_alloc (tree
, heap
, 100);
5031 /* Find decls and types in the body of every function in the callgraph. */
5032 for (n
= cgraph_nodes
; n
; n
= n
->next
)
5033 find_decls_types_in_node (n
, &fld
);
5035 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5036 find_decls_types (p
->decl
, &fld
);
5038 /* Find decls and types in every varpool symbol. */
5039 for (v
= varpool_nodes
; v
; v
= v
->next
)
5040 find_decls_types_in_var (v
, &fld
);
5042 /* Set the assembler name on every decl found. We need to do this
5043 now because free_lang_data_in_decl will invalidate data needed
5044 for mangling. This breaks mangling on interdependent decls. */
5045 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5046 assign_assembler_name_if_neeeded (t
);
5048 /* Traverse every decl found freeing its language data. */
5049 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5050 free_lang_data_in_decl (t
);
5052 /* Traverse every type found freeing its language data. */
5053 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5054 free_lang_data_in_type (t
);
5056 pointer_set_destroy (fld
.pset
);
5057 VEC_free (tree
, heap
, fld
.worklist
);
5058 VEC_free (tree
, heap
, fld
.decls
);
5059 VEC_free (tree
, heap
, fld
.types
);
5063 /* Free resources that are used by FE but are not needed once they are done. */
5066 free_lang_data (void)
5070 /* If we are the LTO frontend we have freed lang-specific data already. */
5072 || !flag_generate_lto
)
5075 /* Allocate and assign alias sets to the standard integer types
5076 while the slots are still in the way the frontends generated them. */
5077 for (i
= 0; i
< itk_none
; ++i
)
5078 if (integer_types
[i
])
5079 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5081 /* Traverse the IL resetting language specific information for
5082 operands, expressions, etc. */
5083 free_lang_data_in_cgraph ();
5085 /* Create gimple variants for common types. */
5086 ptrdiff_type_node
= integer_type_node
;
5087 fileptr_type_node
= ptr_type_node
;
5088 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
5089 || (TYPE_MODE (boolean_type_node
)
5090 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
5091 || TYPE_PRECISION (boolean_type_node
) != 1
5092 || !TYPE_UNSIGNED (boolean_type_node
))
5094 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5095 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5096 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5097 TYPE_PRECISION (boolean_type_node
) = 1;
5098 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5099 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5102 /* Unify char_type_node with its properly signed variant. */
5103 if (TYPE_UNSIGNED (char_type_node
))
5104 unsigned_char_type_node
= char_type_node
;
5106 signed_char_type_node
= char_type_node
;
5108 /* Reset some langhooks. Do not reset types_compatible_p, it may
5109 still be used indirectly via the get_alias_set langhook. */
5110 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5111 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5112 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5113 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
5115 /* Reset diagnostic machinery. */
5116 diagnostic_starter (global_dc
) = default_tree_diagnostic_starter
;
5117 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5118 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5124 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5128 "*free_lang_data", /* name */
5130 free_lang_data
, /* execute */
5133 0, /* static_pass_number */
5134 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5135 0, /* properties_required */
5136 0, /* properties_provided */
5137 0, /* properties_destroyed */
5138 0, /* todo_flags_start */
5139 TODO_ggc_collect
/* todo_flags_finish */
5143 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5146 We try both `text' and `__text__', ATTR may be either one. */
5147 /* ??? It might be a reasonable simplification to require ATTR to be only
5148 `text'. One might then also require attribute lists to be stored in
5149 their canonicalized form. */
5152 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5157 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5160 p
= IDENTIFIER_POINTER (ident
);
5161 ident_len
= IDENTIFIER_LENGTH (ident
);
5163 if (ident_len
== attr_len
5164 && strcmp (attr
, p
) == 0)
5167 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5170 gcc_assert (attr
[1] == '_');
5171 gcc_assert (attr
[attr_len
- 2] == '_');
5172 gcc_assert (attr
[attr_len
- 1] == '_');
5173 if (ident_len
== attr_len
- 4
5174 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5179 if (ident_len
== attr_len
+ 4
5180 && p
[0] == '_' && p
[1] == '_'
5181 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5182 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5189 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5192 We try both `text' and `__text__', ATTR may be either one. */
5195 is_attribute_p (const char *attr
, const_tree ident
)
5197 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5200 /* Given an attribute name and a list of attributes, return a pointer to the
5201 attribute's list element if the attribute is part of the list, or NULL_TREE
5202 if not found. If the attribute appears more than once, this only
5203 returns the first occurrence; the TREE_CHAIN of the return value should
5204 be passed back in if further occurrences are wanted. */
5207 lookup_attribute (const char *attr_name
, tree list
)
5210 size_t attr_len
= strlen (attr_name
);
5212 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5214 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5215 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5221 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5225 remove_attribute (const char *attr_name
, tree list
)
5228 size_t attr_len
= strlen (attr_name
);
5230 for (p
= &list
; *p
; )
5233 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5234 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5235 *p
= TREE_CHAIN (l
);
5237 p
= &TREE_CHAIN (l
);
5243 /* Return an attribute list that is the union of a1 and a2. */
5246 merge_attributes (tree a1
, tree a2
)
5250 /* Either one unset? Take the set one. */
5252 if ((attributes
= a1
) == 0)
5255 /* One that completely contains the other? Take it. */
5257 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5259 if (attribute_list_contained (a2
, a1
))
5263 /* Pick the longest list, and hang on the other list. */
5265 if (list_length (a1
) < list_length (a2
))
5266 attributes
= a2
, a2
= a1
;
5268 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5271 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5274 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5277 if (TREE_VALUE (a
) != NULL
5278 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
5279 && TREE_VALUE (a2
) != NULL
5280 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
5282 if (simple_cst_list_equal (TREE_VALUE (a
),
5283 TREE_VALUE (a2
)) == 1)
5286 else if (simple_cst_equal (TREE_VALUE (a
),
5287 TREE_VALUE (a2
)) == 1)
5292 a1
= copy_node (a2
);
5293 TREE_CHAIN (a1
) = attributes
;
5302 /* Given types T1 and T2, merge their attributes and return
5306 merge_type_attributes (tree t1
, tree t2
)
5308 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5309 TYPE_ATTRIBUTES (t2
));
5312 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5316 merge_decl_attributes (tree olddecl
, tree newdecl
)
5318 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5319 DECL_ATTRIBUTES (newdecl
));
5322 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5324 /* Specialization of merge_decl_attributes for various Windows targets.
5326 This handles the following situation:
5328 __declspec (dllimport) int foo;
5331 The second instance of `foo' nullifies the dllimport. */
5334 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5337 int delete_dllimport_p
= 1;
5339 /* What we need to do here is remove from `old' dllimport if it doesn't
5340 appear in `new'. dllimport behaves like extern: if a declaration is
5341 marked dllimport and a definition appears later, then the object
5342 is not dllimport'd. We also remove a `new' dllimport if the old list
5343 contains dllexport: dllexport always overrides dllimport, regardless
5344 of the order of declaration. */
5345 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5346 delete_dllimport_p
= 0;
5347 else if (DECL_DLLIMPORT_P (new_tree
)
5348 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5350 DECL_DLLIMPORT_P (new_tree
) = 0;
5351 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5352 "dllimport ignored", new_tree
);
5354 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5356 /* Warn about overriding a symbol that has already been used, e.g.:
5357 extern int __attribute__ ((dllimport)) foo;
5358 int* bar () {return &foo;}
5361 if (TREE_USED (old
))
5363 warning (0, "%q+D redeclared without dllimport attribute "
5364 "after being referenced with dll linkage", new_tree
);
5365 /* If we have used a variable's address with dllimport linkage,
5366 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5367 decl may already have had TREE_CONSTANT computed.
5368 We still remove the attribute so that assembler code refers
5369 to '&foo rather than '_imp__foo'. */
5370 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5371 DECL_DLLIMPORT_P (new_tree
) = 1;
5374 /* Let an inline definition silently override the external reference,
5375 but otherwise warn about attribute inconsistency. */
5376 else if (TREE_CODE (new_tree
) == VAR_DECL
5377 || !DECL_DECLARED_INLINE_P (new_tree
))
5378 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5379 "previous dllimport ignored", new_tree
);
5382 delete_dllimport_p
= 0;
5384 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5386 if (delete_dllimport_p
)
5389 const size_t attr_len
= strlen ("dllimport");
5391 /* Scan the list for dllimport and delete it. */
5392 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5394 if (is_attribute_with_length_p ("dllimport", attr_len
,
5397 if (prev
== NULL_TREE
)
5400 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5409 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5410 struct attribute_spec.handler. */
5413 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5419 /* These attributes may apply to structure and union types being created,
5420 but otherwise should pass to the declaration involved. */
5423 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5424 | (int) ATTR_FLAG_ARRAY_NEXT
))
5426 *no_add_attrs
= true;
5427 return tree_cons (name
, args
, NULL_TREE
);
5429 if (TREE_CODE (node
) == RECORD_TYPE
5430 || TREE_CODE (node
) == UNION_TYPE
)
5432 node
= TYPE_NAME (node
);
5438 warning (OPT_Wattributes
, "%qE attribute ignored",
5440 *no_add_attrs
= true;
5445 if (TREE_CODE (node
) != FUNCTION_DECL
5446 && TREE_CODE (node
) != VAR_DECL
5447 && TREE_CODE (node
) != TYPE_DECL
)
5449 *no_add_attrs
= true;
5450 warning (OPT_Wattributes
, "%qE attribute ignored",
5455 if (TREE_CODE (node
) == TYPE_DECL
5456 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5457 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5459 *no_add_attrs
= true;
5460 warning (OPT_Wattributes
, "%qE attribute ignored",
5465 is_dllimport
= is_attribute_p ("dllimport", name
);
5467 /* Report error on dllimport ambiguities seen now before they cause
5471 /* Honor any target-specific overrides. */
5472 if (!targetm
.valid_dllimport_attribute_p (node
))
5473 *no_add_attrs
= true;
5475 else if (TREE_CODE (node
) == FUNCTION_DECL
5476 && DECL_DECLARED_INLINE_P (node
))
5478 warning (OPT_Wattributes
, "inline function %q+D declared as "
5479 " dllimport: attribute ignored", node
);
5480 *no_add_attrs
= true;
5482 /* Like MS, treat definition of dllimported variables and
5483 non-inlined functions on declaration as syntax errors. */
5484 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5486 error ("function %q+D definition is marked dllimport", node
);
5487 *no_add_attrs
= true;
5490 else if (TREE_CODE (node
) == VAR_DECL
)
5492 if (DECL_INITIAL (node
))
5494 error ("variable %q+D definition is marked dllimport",
5496 *no_add_attrs
= true;
5499 /* `extern' needn't be specified with dllimport.
5500 Specify `extern' now and hope for the best. Sigh. */
5501 DECL_EXTERNAL (node
) = 1;
5502 /* Also, implicitly give dllimport'd variables declared within
5503 a function global scope, unless declared static. */
5504 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5505 TREE_PUBLIC (node
) = 1;
5508 if (*no_add_attrs
== false)
5509 DECL_DLLIMPORT_P (node
) = 1;
5511 else if (TREE_CODE (node
) == FUNCTION_DECL
5512 && DECL_DECLARED_INLINE_P (node
))
5513 /* An exported function, even if inline, must be emitted. */
5514 DECL_EXTERNAL (node
) = 0;
5516 /* Report error if symbol is not accessible at global scope. */
5517 if (!TREE_PUBLIC (node
)
5518 && (TREE_CODE (node
) == VAR_DECL
5519 || TREE_CODE (node
) == FUNCTION_DECL
))
5521 error ("external linkage required for symbol %q+D because of "
5522 "%qE attribute", node
, name
);
5523 *no_add_attrs
= true;
5526 /* A dllexport'd entity must have default visibility so that other
5527 program units (shared libraries or the main executable) can see
5528 it. A dllimport'd entity must have default visibility so that
5529 the linker knows that undefined references within this program
5530 unit can be resolved by the dynamic linker. */
5533 if (DECL_VISIBILITY_SPECIFIED (node
)
5534 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5535 error ("%qE implies default visibility, but %qD has already "
5536 "been declared with a different visibility",
5538 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5539 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5545 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5547 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5548 of the various TYPE_QUAL values. */
5551 set_type_quals (tree type
, int type_quals
)
5553 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5554 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5555 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5556 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5559 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5562 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5564 return (TYPE_QUALS (cand
) == type_quals
5565 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5566 /* Apparently this is needed for Objective-C. */
5567 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5568 /* Check alignment. */
5569 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5570 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5571 TYPE_ATTRIBUTES (base
)));
5574 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5577 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5579 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5580 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5581 /* Apparently this is needed for Objective-C. */
5582 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5583 /* Check alignment. */
5584 && TYPE_ALIGN (cand
) == align
5585 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5586 TYPE_ATTRIBUTES (base
)));
5589 /* Return a version of the TYPE, qualified as indicated by the
5590 TYPE_QUALS, if one exists. If no qualified version exists yet,
5591 return NULL_TREE. */
5594 get_qualified_type (tree type
, int type_quals
)
5598 if (TYPE_QUALS (type
) == type_quals
)
5601 /* Search the chain of variants to see if there is already one there just
5602 like the one we need to have. If so, use that existing one. We must
5603 preserve the TYPE_NAME, since there is code that depends on this. */
5604 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5605 if (check_qualified_type (t
, type
, type_quals
))
5611 /* Like get_qualified_type, but creates the type if it does not
5612 exist. This function never returns NULL_TREE. */
5615 build_qualified_type (tree type
, int type_quals
)
5619 /* See if we already have the appropriate qualified variant. */
5620 t
= get_qualified_type (type
, type_quals
);
5622 /* If not, build it. */
5625 t
= build_variant_type_copy (type
);
5626 set_type_quals (t
, type_quals
);
5628 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5629 /* Propagate structural equality. */
5630 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5631 else if (TYPE_CANONICAL (type
) != type
)
5632 /* Build the underlying canonical type, since it is different
5634 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5637 /* T is its own canonical type. */
5638 TYPE_CANONICAL (t
) = t
;
5645 /* Create a variant of type T with alignment ALIGN. */
5648 build_aligned_type (tree type
, unsigned int align
)
5652 if (TYPE_PACKED (type
)
5653 || TYPE_ALIGN (type
) == align
)
5656 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5657 if (check_aligned_type (t
, type
, align
))
5660 t
= build_variant_type_copy (type
);
5661 TYPE_ALIGN (t
) = align
;
5666 /* Create a new distinct copy of TYPE. The new type is made its own
5667 MAIN_VARIANT. If TYPE requires structural equality checks, the
5668 resulting type requires structural equality checks; otherwise, its
5669 TYPE_CANONICAL points to itself. */
5672 build_distinct_type_copy (tree type
)
5674 tree t
= copy_node (type
);
5676 TYPE_POINTER_TO (t
) = 0;
5677 TYPE_REFERENCE_TO (t
) = 0;
5679 /* Set the canonical type either to a new equivalence class, or
5680 propagate the need for structural equality checks. */
5681 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5682 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5684 TYPE_CANONICAL (t
) = t
;
5686 /* Make it its own variant. */
5687 TYPE_MAIN_VARIANT (t
) = t
;
5688 TYPE_NEXT_VARIANT (t
) = 0;
5690 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5691 whose TREE_TYPE is not t. This can also happen in the Ada
5692 frontend when using subtypes. */
5697 /* Create a new variant of TYPE, equivalent but distinct. This is so
5698 the caller can modify it. TYPE_CANONICAL for the return type will
5699 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5700 are considered equal by the language itself (or that both types
5701 require structural equality checks). */
5704 build_variant_type_copy (tree type
)
5706 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5708 t
= build_distinct_type_copy (type
);
5710 /* Since we're building a variant, assume that it is a non-semantic
5711 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5712 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5714 /* Add the new type to the chain of variants of TYPE. */
5715 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5716 TYPE_NEXT_VARIANT (m
) = t
;
5717 TYPE_MAIN_VARIANT (t
) = m
;
5722 /* Return true if the from tree in both tree maps are equal. */
5725 tree_map_base_eq (const void *va
, const void *vb
)
5727 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5728 *const b
= (const struct tree_map_base
*) vb
;
5729 return (a
->from
== b
->from
);
5732 /* Hash a from tree in a tree_base_map. */
5735 tree_map_base_hash (const void *item
)
5737 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5740 /* Return true if this tree map structure is marked for garbage collection
5741 purposes. We simply return true if the from tree is marked, so that this
5742 structure goes away when the from tree goes away. */
5745 tree_map_base_marked_p (const void *p
)
5747 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5750 /* Hash a from tree in a tree_map. */
5753 tree_map_hash (const void *item
)
5755 return (((const struct tree_map
*) item
)->hash
);
5758 /* Hash a from tree in a tree_decl_map. */
5761 tree_decl_map_hash (const void *item
)
5763 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5766 /* Return the initialization priority for DECL. */
5769 decl_init_priority_lookup (tree decl
)
5771 struct tree_priority_map
*h
;
5772 struct tree_map_base in
;
5774 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5776 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5777 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5780 /* Return the finalization priority for DECL. */
5783 decl_fini_priority_lookup (tree decl
)
5785 struct tree_priority_map
*h
;
5786 struct tree_map_base in
;
5788 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5790 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5791 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5794 /* Return the initialization and finalization priority information for
5795 DECL. If there is no previous priority information, a freshly
5796 allocated structure is returned. */
5798 static struct tree_priority_map
*
5799 decl_priority_info (tree decl
)
5801 struct tree_priority_map in
;
5802 struct tree_priority_map
*h
;
5805 in
.base
.from
= decl
;
5806 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5807 h
= (struct tree_priority_map
*) *loc
;
5810 h
= ggc_alloc_cleared_tree_priority_map ();
5812 h
->base
.from
= decl
;
5813 h
->init
= DEFAULT_INIT_PRIORITY
;
5814 h
->fini
= DEFAULT_INIT_PRIORITY
;
5820 /* Set the initialization priority for DECL to PRIORITY. */
5823 decl_init_priority_insert (tree decl
, priority_type priority
)
5825 struct tree_priority_map
*h
;
5827 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5828 h
= decl_priority_info (decl
);
5832 /* Set the finalization priority for DECL to PRIORITY. */
5835 decl_fini_priority_insert (tree decl
, priority_type priority
)
5837 struct tree_priority_map
*h
;
5839 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5840 h
= decl_priority_info (decl
);
5844 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5847 print_debug_expr_statistics (void)
5849 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5850 (long) htab_size (debug_expr_for_decl
),
5851 (long) htab_elements (debug_expr_for_decl
),
5852 htab_collisions (debug_expr_for_decl
));
5855 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5858 print_value_expr_statistics (void)
5860 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5861 (long) htab_size (value_expr_for_decl
),
5862 (long) htab_elements (value_expr_for_decl
),
5863 htab_collisions (value_expr_for_decl
));
5866 /* Lookup a debug expression for FROM, and return it if we find one. */
5869 decl_debug_expr_lookup (tree from
)
5871 struct tree_decl_map
*h
, in
;
5872 in
.base
.from
= from
;
5874 h
= (struct tree_decl_map
*)
5875 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
5881 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5884 decl_debug_expr_insert (tree from
, tree to
)
5886 struct tree_decl_map
*h
;
5889 h
= ggc_alloc_tree_decl_map ();
5890 h
->base
.from
= from
;
5892 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
5894 *(struct tree_decl_map
**) loc
= h
;
5897 /* Lookup a value expression for FROM, and return it if we find one. */
5900 decl_value_expr_lookup (tree from
)
5902 struct tree_decl_map
*h
, in
;
5903 in
.base
.from
= from
;
5905 h
= (struct tree_decl_map
*)
5906 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
5912 /* Insert a mapping FROM->TO in the value expression hashtable. */
5915 decl_value_expr_insert (tree from
, tree to
)
5917 struct tree_decl_map
*h
;
5920 h
= ggc_alloc_tree_decl_map ();
5921 h
->base
.from
= from
;
5923 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
5925 *(struct tree_decl_map
**) loc
= h
;
5928 /* Hashing of types so that we don't make duplicates.
5929 The entry point is `type_hash_canon'. */
5931 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5932 with types in the TREE_VALUE slots), by adding the hash codes
5933 of the individual types. */
5936 type_hash_list (const_tree list
, hashval_t hashcode
)
5940 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5941 if (TREE_VALUE (tail
) != error_mark_node
)
5942 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
5948 /* These are the Hashtable callback functions. */
5950 /* Returns true iff the types are equivalent. */
5953 type_hash_eq (const void *va
, const void *vb
)
5955 const struct type_hash
*const a
= (const struct type_hash
*) va
,
5956 *const b
= (const struct type_hash
*) vb
;
5958 /* First test the things that are the same for all types. */
5959 if (a
->hash
!= b
->hash
5960 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
5961 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
5962 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
5963 TYPE_ATTRIBUTES (b
->type
))
5964 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
5965 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)
5966 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
5967 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
5970 switch (TREE_CODE (a
->type
))
5975 case REFERENCE_TYPE
:
5979 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
5982 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
5983 && !(TYPE_VALUES (a
->type
)
5984 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
5985 && TYPE_VALUES (b
->type
)
5986 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
5987 && type_list_equal (TYPE_VALUES (a
->type
),
5988 TYPE_VALUES (b
->type
))))
5991 /* ... fall through ... */
5996 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
5997 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
5998 TYPE_MAX_VALUE (b
->type
)))
5999 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6000 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6001 TYPE_MIN_VALUE (b
->type
))));
6003 case FIXED_POINT_TYPE
:
6004 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6007 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6010 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6011 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6012 || (TYPE_ARG_TYPES (a
->type
)
6013 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6014 && TYPE_ARG_TYPES (b
->type
)
6015 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6016 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6017 TYPE_ARG_TYPES (b
->type
)))))
6021 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6025 case QUAL_UNION_TYPE
:
6026 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6027 || (TYPE_FIELDS (a
->type
)
6028 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6029 && TYPE_FIELDS (b
->type
)
6030 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6031 && type_list_equal (TYPE_FIELDS (a
->type
),
6032 TYPE_FIELDS (b
->type
))));
6035 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6036 || (TYPE_ARG_TYPES (a
->type
)
6037 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6038 && TYPE_ARG_TYPES (b
->type
)
6039 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6040 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6041 TYPE_ARG_TYPES (b
->type
))))
6049 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6050 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6055 /* Return the cached hash value. */
6058 type_hash_hash (const void *item
)
6060 return ((const struct type_hash
*) item
)->hash
;
6063 /* Look in the type hash table for a type isomorphic to TYPE.
6064 If one is found, return it. Otherwise return 0. */
6067 type_hash_lookup (hashval_t hashcode
, tree type
)
6069 struct type_hash
*h
, in
;
6071 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6072 must call that routine before comparing TYPE_ALIGNs. */
6078 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6085 /* Add an entry to the type-hash-table
6086 for a type TYPE whose hash code is HASHCODE. */
6089 type_hash_add (hashval_t hashcode
, tree type
)
6091 struct type_hash
*h
;
6094 h
= ggc_alloc_type_hash ();
6097 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6101 /* Given TYPE, and HASHCODE its hash code, return the canonical
6102 object for an identical type if one already exists.
6103 Otherwise, return TYPE, and record it as the canonical object.
6105 To use this function, first create a type of the sort you want.
6106 Then compute its hash code from the fields of the type that
6107 make it different from other similar types.
6108 Then call this function and use the value. */
6111 type_hash_canon (unsigned int hashcode
, tree type
)
6115 /* The hash table only contains main variants, so ensure that's what we're
6117 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6119 /* See if the type is in the hash table already. If so, return it.
6120 Otherwise, add the type. */
6121 t1
= type_hash_lookup (hashcode
, type
);
6124 #ifdef GATHER_STATISTICS
6125 tree_node_counts
[(int) t_kind
]--;
6126 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
6132 type_hash_add (hashcode
, type
);
6137 /* See if the data pointed to by the type hash table is marked. We consider
6138 it marked if the type is marked or if a debug type number or symbol
6139 table entry has been made for the type. */
6142 type_hash_marked_p (const void *p
)
6144 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6146 return ggc_marked_p (type
);
6150 print_type_hash_statistics (void)
6152 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6153 (long) htab_size (type_hash_table
),
6154 (long) htab_elements (type_hash_table
),
6155 htab_collisions (type_hash_table
));
6158 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6159 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6160 by adding the hash codes of the individual attributes. */
6163 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6167 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6168 /* ??? Do we want to add in TREE_VALUE too? */
6169 hashcode
= iterative_hash_object
6170 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6174 /* Given two lists of attributes, return true if list l2 is
6175 equivalent to l1. */
6178 attribute_list_equal (const_tree l1
, const_tree l2
)
6180 return attribute_list_contained (l1
, l2
)
6181 && attribute_list_contained (l2
, l1
);
6184 /* Given two lists of attributes, return true if list L2 is
6185 completely contained within L1. */
6186 /* ??? This would be faster if attribute names were stored in a canonicalized
6187 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6188 must be used to show these elements are equivalent (which they are). */
6189 /* ??? It's not clear that attributes with arguments will always be handled
6193 attribute_list_contained (const_tree l1
, const_tree l2
)
6197 /* First check the obvious, maybe the lists are identical. */
6201 /* Maybe the lists are similar. */
6202 for (t1
= l1
, t2
= l2
;
6204 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6205 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6206 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6208 /* Maybe the lists are equal. */
6209 if (t1
== 0 && t2
== 0)
6212 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6215 /* This CONST_CAST is okay because lookup_attribute does not
6216 modify its argument and the return value is assigned to a
6218 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6219 CONST_CAST_TREE(l1
));
6221 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6224 if (TREE_VALUE (t2
) != NULL
6225 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
6226 && TREE_VALUE (attr
) != NULL
6227 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
6229 if (simple_cst_list_equal (TREE_VALUE (t2
),
6230 TREE_VALUE (attr
)) == 1)
6233 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
6244 /* Given two lists of types
6245 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6246 return 1 if the lists contain the same types in the same order.
6247 Also, the TREE_PURPOSEs must match. */
6250 type_list_equal (const_tree l1
, const_tree l2
)
6254 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6255 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6256 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6257 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6258 && (TREE_TYPE (TREE_PURPOSE (t1
))
6259 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6265 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6266 given by TYPE. If the argument list accepts variable arguments,
6267 then this function counts only the ordinary arguments. */
6270 type_num_arguments (const_tree type
)
6275 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6276 /* If the function does not take a variable number of arguments,
6277 the last element in the list will have type `void'. */
6278 if (VOID_TYPE_P (TREE_VALUE (t
)))
6286 /* Nonzero if integer constants T1 and T2
6287 represent the same constant value. */
6290 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6295 if (t1
== 0 || t2
== 0)
6298 if (TREE_CODE (t1
) == INTEGER_CST
6299 && TREE_CODE (t2
) == INTEGER_CST
6300 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6301 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6307 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6308 The precise way of comparison depends on their data type. */
6311 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6316 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6318 int t1_sgn
= tree_int_cst_sgn (t1
);
6319 int t2_sgn
= tree_int_cst_sgn (t2
);
6321 if (t1_sgn
< t2_sgn
)
6323 else if (t1_sgn
> t2_sgn
)
6325 /* Otherwise, both are non-negative, so we compare them as
6326 unsigned just in case one of them would overflow a signed
6329 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6330 return INT_CST_LT (t1
, t2
);
6332 return INT_CST_LT_UNSIGNED (t1
, t2
);
6335 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6338 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6340 if (tree_int_cst_lt (t1
, t2
))
6342 else if (tree_int_cst_lt (t2
, t1
))
6348 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6349 the host. If POS is zero, the value can be represented in a single
6350 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6351 be represented in a single unsigned HOST_WIDE_INT. */
6354 host_integerp (const_tree t
, int pos
)
6359 return (TREE_CODE (t
) == INTEGER_CST
6360 && ((TREE_INT_CST_HIGH (t
) == 0
6361 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6362 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6363 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6364 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6365 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6366 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6367 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6370 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6371 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6372 be non-negative. We must be able to satisfy the above conditions. */
6375 tree_low_cst (const_tree t
, int pos
)
6377 gcc_assert (host_integerp (t
, pos
));
6378 return TREE_INT_CST_LOW (t
);
6381 /* Return the most significant bit of the integer constant T. */
6384 tree_int_cst_msb (const_tree t
)
6388 unsigned HOST_WIDE_INT l
;
6390 /* Note that using TYPE_PRECISION here is wrong. We care about the
6391 actual bits, not the (arbitrary) range of the type. */
6392 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6393 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6394 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6395 return (l
& 1) == 1;
6398 /* Return an indication of the sign of the integer constant T.
6399 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6400 Note that -1 will never be returned if T's type is unsigned. */
6403 tree_int_cst_sgn (const_tree t
)
6405 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6407 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6409 else if (TREE_INT_CST_HIGH (t
) < 0)
6415 /* Return the minimum number of bits needed to represent VALUE in a
6416 signed or unsigned type, UNSIGNEDP says which. */
6419 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6423 /* If the value is negative, compute its negative minus 1. The latter
6424 adjustment is because the absolute value of the largest negative value
6425 is one larger than the largest positive value. This is equivalent to
6426 a bit-wise negation, so use that operation instead. */
6428 if (tree_int_cst_sgn (value
) < 0)
6429 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6431 /* Return the number of bits needed, taking into account the fact
6432 that we need one more bit for a signed than unsigned type. */
6434 if (integer_zerop (value
))
6437 log
= tree_floor_log2 (value
);
6439 return log
+ 1 + !unsignedp
;
6442 /* Compare two constructor-element-type constants. Return 1 if the lists
6443 are known to be equal; otherwise return 0. */
6446 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6448 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6450 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6453 l1
= TREE_CHAIN (l1
);
6454 l2
= TREE_CHAIN (l2
);
6460 /* Return truthvalue of whether T1 is the same tree structure as T2.
6461 Return 1 if they are the same.
6462 Return 0 if they are understandably different.
6463 Return -1 if either contains tree structure not understood by
6467 simple_cst_equal (const_tree t1
, const_tree t2
)
6469 enum tree_code code1
, code2
;
6475 if (t1
== 0 || t2
== 0)
6478 code1
= TREE_CODE (t1
);
6479 code2
= TREE_CODE (t2
);
6481 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6483 if (CONVERT_EXPR_CODE_P (code2
)
6484 || code2
== NON_LVALUE_EXPR
)
6485 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6487 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6490 else if (CONVERT_EXPR_CODE_P (code2
)
6491 || code2
== NON_LVALUE_EXPR
)
6492 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6500 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6501 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6504 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6507 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6510 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6511 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6512 TREE_STRING_LENGTH (t1
)));
6516 unsigned HOST_WIDE_INT idx
;
6517 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6518 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6520 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6523 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6524 /* ??? Should we handle also fields here? */
6525 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6526 VEC_index (constructor_elt
, v2
, idx
)->value
))
6532 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6535 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6538 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6541 const_tree arg1
, arg2
;
6542 const_call_expr_arg_iterator iter1
, iter2
;
6543 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6544 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6546 arg1
= next_const_call_expr_arg (&iter1
),
6547 arg2
= next_const_call_expr_arg (&iter2
))
6549 cmp
= simple_cst_equal (arg1
, arg2
);
6553 return arg1
== arg2
;
6557 /* Special case: if either target is an unallocated VAR_DECL,
6558 it means that it's going to be unified with whatever the
6559 TARGET_EXPR is really supposed to initialize, so treat it
6560 as being equivalent to anything. */
6561 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6562 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6563 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6564 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6565 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6566 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6569 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6574 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6576 case WITH_CLEANUP_EXPR
:
6577 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6581 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6584 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6585 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6599 /* This general rule works for most tree codes. All exceptions should be
6600 handled above. If this is a language-specific tree code, we can't
6601 trust what might be in the operand, so say we don't know
6603 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6606 switch (TREE_CODE_CLASS (code1
))
6610 case tcc_comparison
:
6611 case tcc_expression
:
6615 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6617 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6629 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6630 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6631 than U, respectively. */
6634 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6636 if (tree_int_cst_sgn (t
) < 0)
6638 else if (TREE_INT_CST_HIGH (t
) != 0)
6640 else if (TREE_INT_CST_LOW (t
) == u
)
6642 else if (TREE_INT_CST_LOW (t
) < u
)
6648 /* Return true if CODE represents an associative tree code. Otherwise
6651 associative_tree_code (enum tree_code code
)
6670 /* Return true if CODE represents a commutative tree code. Otherwise
6673 commutative_tree_code (enum tree_code code
)
6686 case UNORDERED_EXPR
:
6690 case TRUTH_AND_EXPR
:
6691 case TRUTH_XOR_EXPR
:
6701 /* Return true if CODE represents a ternary tree code for which the
6702 first two operands are commutative. Otherwise return false. */
6704 commutative_ternary_tree_code (enum tree_code code
)
6708 case WIDEN_MULT_PLUS_EXPR
:
6709 case WIDEN_MULT_MINUS_EXPR
:
6718 /* Generate a hash value for an expression. This can be used iteratively
6719 by passing a previous result as the VAL argument.
6721 This function is intended to produce the same hash for expressions which
6722 would compare equal using operand_equal_p. */
6725 iterative_hash_expr (const_tree t
, hashval_t val
)
6728 enum tree_code code
;
6732 return iterative_hash_hashval_t (0, val
);
6734 code
= TREE_CODE (t
);
6738 /* Alas, constants aren't shared, so we can't rely on pointer
6741 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6742 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6745 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6747 return iterative_hash_hashval_t (val2
, val
);
6751 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6753 return iterative_hash_hashval_t (val2
, val
);
6756 return iterative_hash (TREE_STRING_POINTER (t
),
6757 TREE_STRING_LENGTH (t
), val
);
6759 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6760 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6762 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6764 /* We can just compare by pointer. */
6765 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6766 case PLACEHOLDER_EXPR
:
6767 /* The node itself doesn't matter. */
6770 /* A list of expressions, for a CALL_EXPR or as the elements of a
6772 for (; t
; t
= TREE_CHAIN (t
))
6773 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6777 unsigned HOST_WIDE_INT idx
;
6779 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6781 val
= iterative_hash_expr (field
, val
);
6782 val
= iterative_hash_expr (value
, val
);
6788 /* The type of the second operand is relevant, except for
6789 its top-level qualifiers. */
6790 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
6792 val
= iterative_hash_object (TYPE_HASH (type
), val
);
6794 /* We could use the standard hash computation from this point
6796 val
= iterative_hash_object (code
, val
);
6797 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
6798 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6802 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6803 Otherwise nodes that compare equal according to operand_equal_p might
6804 get different hash codes. However, don't do this for machine specific
6805 or front end builtins, since the function code is overloaded in those
6807 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6808 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6810 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6811 code
= TREE_CODE (t
);
6815 tclass
= TREE_CODE_CLASS (code
);
6817 if (tclass
== tcc_declaration
)
6819 /* DECL's have a unique ID */
6820 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6824 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6826 val
= iterative_hash_object (code
, val
);
6828 /* Don't hash the type, that can lead to having nodes which
6829 compare equal according to operand_equal_p, but which
6830 have different hash codes. */
6831 if (CONVERT_EXPR_CODE_P (code
)
6832 || code
== NON_LVALUE_EXPR
)
6834 /* Make sure to include signness in the hash computation. */
6835 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6836 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6839 else if (commutative_tree_code (code
))
6841 /* It's a commutative expression. We want to hash it the same
6842 however it appears. We do this by first hashing both operands
6843 and then rehashing based on the order of their independent
6845 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6846 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6850 t
= one
, one
= two
, two
= t
;
6852 val
= iterative_hash_hashval_t (one
, val
);
6853 val
= iterative_hash_hashval_t (two
, val
);
6856 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6857 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6864 /* Generate a hash value for a pair of expressions. This can be used
6865 iteratively by passing a previous result as the VAL argument.
6867 The same hash value is always returned for a given pair of expressions,
6868 regardless of the order in which they are presented. This is useful in
6869 hashing the operands of commutative functions. */
6872 iterative_hash_exprs_commutative (const_tree t1
,
6873 const_tree t2
, hashval_t val
)
6875 hashval_t one
= iterative_hash_expr (t1
, 0);
6876 hashval_t two
= iterative_hash_expr (t2
, 0);
6880 t
= one
, one
= two
, two
= t
;
6881 val
= iterative_hash_hashval_t (one
, val
);
6882 val
= iterative_hash_hashval_t (two
, val
);
6887 /* Constructors for pointer, array and function types.
6888 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6889 constructed by language-dependent code, not here.) */
6891 /* Construct, lay out and return the type of pointers to TO_TYPE with
6892 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6893 reference all of memory. If such a type has already been
6894 constructed, reuse it. */
6897 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6902 if (to_type
== error_mark_node
)
6903 return error_mark_node
;
6905 /* If the pointed-to type has the may_alias attribute set, force
6906 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6907 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6908 can_alias_all
= true;
6910 /* In some cases, languages will have things that aren't a POINTER_TYPE
6911 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6912 In that case, return that type without regard to the rest of our
6915 ??? This is a kludge, but consistent with the way this function has
6916 always operated and there doesn't seem to be a good way to avoid this
6918 if (TYPE_POINTER_TO (to_type
) != 0
6919 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6920 return TYPE_POINTER_TO (to_type
);
6922 /* First, if we already have a type for pointers to TO_TYPE and it's
6923 the proper mode, use it. */
6924 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6925 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6928 t
= make_node (POINTER_TYPE
);
6930 TREE_TYPE (t
) = to_type
;
6931 SET_TYPE_MODE (t
, mode
);
6932 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6933 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6934 TYPE_POINTER_TO (to_type
) = t
;
6936 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6937 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6938 else if (TYPE_CANONICAL (to_type
) != to_type
)
6940 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
6941 mode
, can_alias_all
);
6943 /* Lay out the type. This function has many callers that are concerned
6944 with expression-construction, and this simplifies them all. */
6950 /* By default build pointers in ptr_mode. */
6953 build_pointer_type (tree to_type
)
6955 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
6956 : TYPE_ADDR_SPACE (to_type
);
6957 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
6958 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
6961 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6964 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
6969 if (to_type
== error_mark_node
)
6970 return error_mark_node
;
6972 /* If the pointed-to type has the may_alias attribute set, force
6973 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6974 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6975 can_alias_all
= true;
6977 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6978 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6979 In that case, return that type without regard to the rest of our
6982 ??? This is a kludge, but consistent with the way this function has
6983 always operated and there doesn't seem to be a good way to avoid this
6985 if (TYPE_REFERENCE_TO (to_type
) != 0
6986 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
6987 return TYPE_REFERENCE_TO (to_type
);
6989 /* First, if we already have a type for pointers to TO_TYPE and it's
6990 the proper mode, use it. */
6991 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
6992 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6995 t
= make_node (REFERENCE_TYPE
);
6997 TREE_TYPE (t
) = to_type
;
6998 SET_TYPE_MODE (t
, mode
);
6999 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7000 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7001 TYPE_REFERENCE_TO (to_type
) = t
;
7003 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7004 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7005 else if (TYPE_CANONICAL (to_type
) != to_type
)
7007 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7008 mode
, can_alias_all
);
7016 /* Build the node for the type of references-to-TO_TYPE by default
7020 build_reference_type (tree to_type
)
7022 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7023 : TYPE_ADDR_SPACE (to_type
);
7024 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7025 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7028 /* Build a type that is compatible with t but has no cv quals anywhere
7031 const char *const *const * -> char ***. */
7034 build_type_no_quals (tree t
)
7036 switch (TREE_CODE (t
))
7039 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7041 TYPE_REF_CAN_ALIAS_ALL (t
));
7042 case REFERENCE_TYPE
:
7044 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7046 TYPE_REF_CAN_ALIAS_ALL (t
));
7048 return TYPE_MAIN_VARIANT (t
);
7052 #define MAX_INT_CACHED_PREC \
7053 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7054 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7056 /* Builds a signed or unsigned integer type of precision PRECISION.
7057 Used for C bitfields whose precision does not match that of
7058 built-in target types. */
7060 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7066 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7068 if (precision
<= MAX_INT_CACHED_PREC
)
7070 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7075 itype
= make_node (INTEGER_TYPE
);
7076 TYPE_PRECISION (itype
) = precision
;
7079 fixup_unsigned_type (itype
);
7081 fixup_signed_type (itype
);
7084 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7085 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7086 if (precision
<= MAX_INT_CACHED_PREC
)
7087 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7092 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7093 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7094 is true, reuse such a type that has already been constructed. */
7097 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7099 tree itype
= make_node (INTEGER_TYPE
);
7100 hashval_t hashcode
= 0;
7102 TREE_TYPE (itype
) = type
;
7104 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7105 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7107 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7108 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7109 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7110 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7111 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7112 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7117 if ((TYPE_MIN_VALUE (itype
)
7118 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7119 || (TYPE_MAX_VALUE (itype
)
7120 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7122 /* Since we cannot reliably merge this type, we need to compare it using
7123 structural equality checks. */
7124 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7128 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7129 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7130 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7131 itype
= type_hash_canon (hashcode
, itype
);
7136 /* Wrapper around build_range_type_1 with SHARED set to true. */
7139 build_range_type (tree type
, tree lowval
, tree highval
)
7141 return build_range_type_1 (type
, lowval
, highval
, true);
7144 /* Wrapper around build_range_type_1 with SHARED set to false. */
7147 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7149 return build_range_type_1 (type
, lowval
, highval
, false);
7152 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7153 MAXVAL should be the maximum value in the domain
7154 (one less than the length of the array).
7156 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7157 We don't enforce this limit, that is up to caller (e.g. language front end).
7158 The limit exists because the result is a signed type and we don't handle
7159 sizes that use more than one HOST_WIDE_INT. */
7162 build_index_type (tree maxval
)
7164 return build_range_type (sizetype
, size_zero_node
, maxval
);
7167 /* Return true if the debug information for TYPE, a subtype, should be emitted
7168 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7169 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7170 debug info and doesn't reflect the source code. */
7173 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7175 tree base_type
= TREE_TYPE (type
), low
, high
;
7177 /* Subrange types have a base type which is an integral type. */
7178 if (!INTEGRAL_TYPE_P (base_type
))
7181 /* Get the real bounds of the subtype. */
7182 if (lang_hooks
.types
.get_subrange_bounds
)
7183 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7186 low
= TYPE_MIN_VALUE (type
);
7187 high
= TYPE_MAX_VALUE (type
);
7190 /* If the type and its base type have the same representation and the same
7191 name, then the type is not a subrange but a copy of the base type. */
7192 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7193 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7194 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7195 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7196 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7198 tree type_name
= TYPE_NAME (type
);
7199 tree base_type_name
= TYPE_NAME (base_type
);
7201 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7202 type_name
= DECL_NAME (type_name
);
7204 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7205 base_type_name
= DECL_NAME (base_type_name
);
7207 if (type_name
== base_type_name
)
7218 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7219 and number of elements specified by the range of values of INDEX_TYPE.
7220 If SHARED is true, reuse such a type that has already been constructed. */
7223 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7227 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7229 error ("arrays of functions are not meaningful");
7230 elt_type
= integer_type_node
;
7233 t
= make_node (ARRAY_TYPE
);
7234 TREE_TYPE (t
) = elt_type
;
7235 TYPE_DOMAIN (t
) = index_type
;
7236 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7239 /* If the element type is incomplete at this point we get marked for
7240 structural equality. Do not record these types in the canonical
7242 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7247 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7249 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7250 t
= type_hash_canon (hashcode
, t
);
7253 if (TYPE_CANONICAL (t
) == t
)
7255 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7256 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7257 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7258 else if (TYPE_CANONICAL (elt_type
) != elt_type
7259 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7261 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7263 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7270 /* Wrapper around build_array_type_1 with SHARED set to true. */
7273 build_array_type (tree elt_type
, tree index_type
)
7275 return build_array_type_1 (elt_type
, index_type
, true);
7278 /* Wrapper around build_array_type_1 with SHARED set to false. */
7281 build_nonshared_array_type (tree elt_type
, tree index_type
)
7283 return build_array_type_1 (elt_type
, index_type
, false);
7286 /* Recursively examines the array elements of TYPE, until a non-array
7287 element type is found. */
7290 strip_array_types (tree type
)
7292 while (TREE_CODE (type
) == ARRAY_TYPE
)
7293 type
= TREE_TYPE (type
);
7298 /* Computes the canonical argument types from the argument type list
7301 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7302 on entry to this function, or if any of the ARGTYPES are
7305 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7306 true on entry to this function, or if any of the ARGTYPES are
7309 Returns a canonical argument list, which may be ARGTYPES when the
7310 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7311 true) or would not differ from ARGTYPES. */
7314 maybe_canonicalize_argtypes(tree argtypes
,
7315 bool *any_structural_p
,
7316 bool *any_noncanonical_p
)
7319 bool any_noncanonical_argtypes_p
= false;
7321 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7323 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7324 /* Fail gracefully by stating that the type is structural. */
7325 *any_structural_p
= true;
7326 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7327 *any_structural_p
= true;
7328 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7329 || TREE_PURPOSE (arg
))
7330 /* If the argument has a default argument, we consider it
7331 non-canonical even though the type itself is canonical.
7332 That way, different variants of function and method types
7333 with default arguments will all point to the variant with
7334 no defaults as their canonical type. */
7335 any_noncanonical_argtypes_p
= true;
7338 if (*any_structural_p
)
7341 if (any_noncanonical_argtypes_p
)
7343 /* Build the canonical list of argument types. */
7344 tree canon_argtypes
= NULL_TREE
;
7345 bool is_void
= false;
7347 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7349 if (arg
== void_list_node
)
7352 canon_argtypes
= tree_cons (NULL_TREE
,
7353 TYPE_CANONICAL (TREE_VALUE (arg
)),
7357 canon_argtypes
= nreverse (canon_argtypes
);
7359 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7361 /* There is a non-canonical type. */
7362 *any_noncanonical_p
= true;
7363 return canon_argtypes
;
7366 /* The canonical argument types are the same as ARGTYPES. */
7370 /* Construct, lay out and return
7371 the type of functions returning type VALUE_TYPE
7372 given arguments of types ARG_TYPES.
7373 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7374 are data type nodes for the arguments of the function.
7375 If such a type has already been constructed, reuse it. */
7378 build_function_type (tree value_type
, tree arg_types
)
7381 hashval_t hashcode
= 0;
7382 bool any_structural_p
, any_noncanonical_p
;
7383 tree canon_argtypes
;
7385 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7387 error ("function return type cannot be function");
7388 value_type
= integer_type_node
;
7391 /* Make a node of the sort we want. */
7392 t
= make_node (FUNCTION_TYPE
);
7393 TREE_TYPE (t
) = value_type
;
7394 TYPE_ARG_TYPES (t
) = arg_types
;
7396 /* If we already have such a type, use the old one. */
7397 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7398 hashcode
= type_hash_list (arg_types
, hashcode
);
7399 t
= type_hash_canon (hashcode
, t
);
7401 /* Set up the canonical type. */
7402 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7403 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7404 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7406 &any_noncanonical_p
);
7407 if (any_structural_p
)
7408 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7409 else if (any_noncanonical_p
)
7410 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7413 if (!COMPLETE_TYPE_P (t
))
7418 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7421 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7423 tree new_type
= NULL
;
7424 tree args
, new_args
= NULL
, t
;
7428 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7429 args
= TREE_CHAIN (args
), i
++)
7430 if (!bitmap_bit_p (args_to_skip
, i
))
7431 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7433 new_reversed
= nreverse (new_args
);
7437 TREE_CHAIN (new_args
) = void_list_node
;
7439 new_reversed
= void_list_node
;
7442 /* Use copy_node to preserve as much as possible from original type
7443 (debug info, attribute lists etc.)
7444 Exception is METHOD_TYPEs must have THIS argument.
7445 When we are asked to remove it, we need to build new FUNCTION_TYPE
7447 if (TREE_CODE (orig_type
) != METHOD_TYPE
7448 || !bitmap_bit_p (args_to_skip
, 0))
7450 new_type
= build_distinct_type_copy (orig_type
);
7451 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7456 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7458 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7461 /* This is a new type, not a copy of an old type. Need to reassociate
7462 variants. We can handle everything except the main variant lazily. */
7463 t
= TYPE_MAIN_VARIANT (orig_type
);
7466 TYPE_MAIN_VARIANT (new_type
) = t
;
7467 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7468 TYPE_NEXT_VARIANT (t
) = new_type
;
7472 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7473 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7478 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7480 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7481 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7482 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7485 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7487 tree new_decl
= copy_node (orig_decl
);
7490 new_type
= TREE_TYPE (orig_decl
);
7491 if (prototype_p (new_type
))
7492 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7493 TREE_TYPE (new_decl
) = new_type
;
7495 /* For declarations setting DECL_VINDEX (i.e. methods)
7496 we expect first argument to be THIS pointer. */
7497 if (bitmap_bit_p (args_to_skip
, 0))
7498 DECL_VINDEX (new_decl
) = NULL_TREE
;
7500 /* When signature changes, we need to clear builtin info. */
7501 if (DECL_BUILT_IN (new_decl
) && !bitmap_empty_p (args_to_skip
))
7503 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7504 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7509 /* Build a function type. The RETURN_TYPE is the type returned by the
7510 function. If VAARGS is set, no void_type_node is appended to the
7511 the list. ARGP must be always be terminated be a NULL_TREE. */
7514 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7518 t
= va_arg (argp
, tree
);
7519 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7520 args
= tree_cons (NULL_TREE
, t
, args
);
7525 if (args
!= NULL_TREE
)
7526 args
= nreverse (args
);
7527 gcc_assert (last
!= void_list_node
);
7529 else if (args
== NULL_TREE
)
7530 args
= void_list_node
;
7534 args
= nreverse (args
);
7535 TREE_CHAIN (last
) = void_list_node
;
7537 args
= build_function_type (return_type
, args
);
7542 /* Build a function type. The RETURN_TYPE is the type returned by the
7543 function. If additional arguments are provided, they are
7544 additional argument types. The list of argument types must always
7545 be terminated by NULL_TREE. */
7548 build_function_type_list (tree return_type
, ...)
7553 va_start (p
, return_type
);
7554 args
= build_function_type_list_1 (false, return_type
, p
);
7559 /* Build a variable argument function type. The RETURN_TYPE is the
7560 type returned by the function. If additional arguments are provided,
7561 they are additional argument types. The list of argument types must
7562 always be terminated by NULL_TREE. */
7565 build_varargs_function_type_list (tree return_type
, ...)
7570 va_start (p
, return_type
);
7571 args
= build_function_type_list_1 (true, return_type
, p
);
7577 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7578 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7579 for the method. An implicit additional parameter (of type
7580 pointer-to-BASETYPE) is added to the ARGTYPES. */
7583 build_method_type_directly (tree basetype
,
7590 bool any_structural_p
, any_noncanonical_p
;
7591 tree canon_argtypes
;
7593 /* Make a node of the sort we want. */
7594 t
= make_node (METHOD_TYPE
);
7596 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7597 TREE_TYPE (t
) = rettype
;
7598 ptype
= build_pointer_type (basetype
);
7600 /* The actual arglist for this function includes a "hidden" argument
7601 which is "this". Put it into the list of argument types. */
7602 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7603 TYPE_ARG_TYPES (t
) = argtypes
;
7605 /* If we already have such a type, use the old one. */
7606 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7607 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7608 hashcode
= type_hash_list (argtypes
, hashcode
);
7609 t
= type_hash_canon (hashcode
, t
);
7611 /* Set up the canonical type. */
7613 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7614 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7616 = (TYPE_CANONICAL (basetype
) != basetype
7617 || TYPE_CANONICAL (rettype
) != rettype
);
7618 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7620 &any_noncanonical_p
);
7621 if (any_structural_p
)
7622 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7623 else if (any_noncanonical_p
)
7625 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7626 TYPE_CANONICAL (rettype
),
7628 if (!COMPLETE_TYPE_P (t
))
7634 /* Construct, lay out and return the type of methods belonging to class
7635 BASETYPE and whose arguments and values are described by TYPE.
7636 If that type exists already, reuse it.
7637 TYPE must be a FUNCTION_TYPE node. */
7640 build_method_type (tree basetype
, tree type
)
7642 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7644 return build_method_type_directly (basetype
,
7646 TYPE_ARG_TYPES (type
));
7649 /* Construct, lay out and return the type of offsets to a value
7650 of type TYPE, within an object of type BASETYPE.
7651 If a suitable offset type exists already, reuse it. */
7654 build_offset_type (tree basetype
, tree type
)
7657 hashval_t hashcode
= 0;
7659 /* Make a node of the sort we want. */
7660 t
= make_node (OFFSET_TYPE
);
7662 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7663 TREE_TYPE (t
) = type
;
7665 /* If we already have such a type, use the old one. */
7666 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7667 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7668 t
= type_hash_canon (hashcode
, t
);
7670 if (!COMPLETE_TYPE_P (t
))
7673 if (TYPE_CANONICAL (t
) == t
)
7675 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7676 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7677 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7678 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7679 || TYPE_CANONICAL (type
) != type
)
7681 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7682 TYPE_CANONICAL (type
));
7688 /* Create a complex type whose components are COMPONENT_TYPE. */
7691 build_complex_type (tree component_type
)
7696 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7697 || SCALAR_FLOAT_TYPE_P (component_type
)
7698 || FIXED_POINT_TYPE_P (component_type
));
7700 /* Make a node of the sort we want. */
7701 t
= make_node (COMPLEX_TYPE
);
7703 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7705 /* If we already have such a type, use the old one. */
7706 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7707 t
= type_hash_canon (hashcode
, t
);
7709 if (!COMPLETE_TYPE_P (t
))
7712 if (TYPE_CANONICAL (t
) == t
)
7714 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7715 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7716 else if (TYPE_CANONICAL (component_type
) != component_type
)
7718 = build_complex_type (TYPE_CANONICAL (component_type
));
7721 /* We need to create a name, since complex is a fundamental type. */
7722 if (! TYPE_NAME (t
))
7725 if (component_type
== char_type_node
)
7726 name
= "complex char";
7727 else if (component_type
== signed_char_type_node
)
7728 name
= "complex signed char";
7729 else if (component_type
== unsigned_char_type_node
)
7730 name
= "complex unsigned char";
7731 else if (component_type
== short_integer_type_node
)
7732 name
= "complex short int";
7733 else if (component_type
== short_unsigned_type_node
)
7734 name
= "complex short unsigned int";
7735 else if (component_type
== integer_type_node
)
7736 name
= "complex int";
7737 else if (component_type
== unsigned_type_node
)
7738 name
= "complex unsigned int";
7739 else if (component_type
== long_integer_type_node
)
7740 name
= "complex long int";
7741 else if (component_type
== long_unsigned_type_node
)
7742 name
= "complex long unsigned int";
7743 else if (component_type
== long_long_integer_type_node
)
7744 name
= "complex long long int";
7745 else if (component_type
== long_long_unsigned_type_node
)
7746 name
= "complex long long unsigned int";
7751 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7752 get_identifier (name
), t
);
7755 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7758 /* If TYPE is a real or complex floating-point type and the target
7759 does not directly support arithmetic on TYPE then return the wider
7760 type to be used for arithmetic on TYPE. Otherwise, return
7764 excess_precision_type (tree type
)
7766 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7768 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7769 switch (TREE_CODE (type
))
7772 switch (flt_eval_method
)
7775 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7776 return double_type_node
;
7779 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7780 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7781 return long_double_type_node
;
7788 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7790 switch (flt_eval_method
)
7793 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7794 return complex_double_type_node
;
7797 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7798 || (TYPE_MODE (TREE_TYPE (type
))
7799 == TYPE_MODE (double_type_node
)))
7800 return complex_long_double_type_node
;
7813 /* Return OP, stripped of any conversions to wider types as much as is safe.
7814 Converting the value back to OP's type makes a value equivalent to OP.
7816 If FOR_TYPE is nonzero, we return a value which, if converted to
7817 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7819 OP must have integer, real or enumeral type. Pointers are not allowed!
7821 There are some cases where the obvious value we could return
7822 would regenerate to OP if converted to OP's type,
7823 but would not extend like OP to wider types.
7824 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7825 For example, if OP is (unsigned short)(signed char)-1,
7826 we avoid returning (signed char)-1 if FOR_TYPE is int,
7827 even though extending that to an unsigned short would regenerate OP,
7828 since the result of extending (signed char)-1 to (int)
7829 is different from (int) OP. */
7832 get_unwidened (tree op
, tree for_type
)
7834 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7835 tree type
= TREE_TYPE (op
);
7837 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7839 = (for_type
!= 0 && for_type
!= type
7840 && final_prec
> TYPE_PRECISION (type
)
7841 && TYPE_UNSIGNED (type
));
7844 while (CONVERT_EXPR_P (op
))
7848 /* TYPE_PRECISION on vector types has different meaning
7849 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7850 so avoid them here. */
7851 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7854 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7855 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7857 /* Truncations are many-one so cannot be removed.
7858 Unless we are later going to truncate down even farther. */
7860 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7863 /* See what's inside this conversion. If we decide to strip it,
7865 op
= TREE_OPERAND (op
, 0);
7867 /* If we have not stripped any zero-extensions (uns is 0),
7868 we can strip any kind of extension.
7869 If we have previously stripped a zero-extension,
7870 only zero-extensions can safely be stripped.
7871 Any extension can be stripped if the bits it would produce
7872 are all going to be discarded later by truncating to FOR_TYPE. */
7876 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7878 /* TYPE_UNSIGNED says whether this is a zero-extension.
7879 Let's avoid computing it if it does not affect WIN
7880 and if UNS will not be needed again. */
7882 || CONVERT_EXPR_P (op
))
7883 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7891 /* If we finally reach a constant see if it fits in for_type and
7892 in that case convert it. */
7894 && TREE_CODE (win
) == INTEGER_CST
7895 && TREE_TYPE (win
) != for_type
7896 && int_fits_type_p (win
, for_type
))
7897 win
= fold_convert (for_type
, win
);
7902 /* Return OP or a simpler expression for a narrower value
7903 which can be sign-extended or zero-extended to give back OP.
7904 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7905 or 0 if the value should be sign-extended. */
7908 get_narrower (tree op
, int *unsignedp_ptr
)
7913 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7915 while (TREE_CODE (op
) == NOP_EXPR
)
7918 = (TYPE_PRECISION (TREE_TYPE (op
))
7919 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
7921 /* Truncations are many-one so cannot be removed. */
7925 /* See what's inside this conversion. If we decide to strip it,
7930 op
= TREE_OPERAND (op
, 0);
7931 /* An extension: the outermost one can be stripped,
7932 but remember whether it is zero or sign extension. */
7934 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7935 /* Otherwise, if a sign extension has been stripped,
7936 only sign extensions can now be stripped;
7937 if a zero extension has been stripped, only zero-extensions. */
7938 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
7942 else /* bitschange == 0 */
7944 /* A change in nominal type can always be stripped, but we must
7945 preserve the unsignedness. */
7947 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7949 op
= TREE_OPERAND (op
, 0);
7950 /* Keep trying to narrow, but don't assign op to win if it
7951 would turn an integral type into something else. */
7952 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
7959 if (TREE_CODE (op
) == COMPONENT_REF
7960 /* Since type_for_size always gives an integer type. */
7961 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
7962 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
7963 /* Ensure field is laid out already. */
7964 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
7965 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
7967 unsigned HOST_WIDE_INT innerprec
7968 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
7969 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
7970 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
7971 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
7973 /* We can get this structure field in a narrower type that fits it,
7974 but the resulting extension to its nominal type (a fullword type)
7975 must satisfy the same conditions as for other extensions.
7977 Do this only for fields that are aligned (not bit-fields),
7978 because when bit-field insns will be used there is no
7979 advantage in doing this. */
7981 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
7982 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
7983 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
7987 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
7988 win
= fold_convert (type
, op
);
7992 *unsignedp_ptr
= uns
;
7996 /* Returns true if integer constant C has a value that is permissible
7997 for type TYPE (an INTEGER_TYPE). */
8000 int_fits_type_p (const_tree c
, const_tree type
)
8002 tree type_low_bound
, type_high_bound
;
8003 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8006 dc
= tree_to_double_int (c
);
8007 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8009 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
8010 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
8012 /* So c is an unsigned integer whose type is sizetype and type is not.
8013 sizetype'd integers are sign extended even though they are
8014 unsigned. If the integer value fits in the lower end word of c,
8015 and if the higher end word has all its bits set to 1, that
8016 means the higher end bits are set to 1 only for sign extension.
8017 So let's convert c into an equivalent zero extended unsigned
8019 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
8022 type_low_bound
= TYPE_MIN_VALUE (type
);
8023 type_high_bound
= TYPE_MAX_VALUE (type
);
8025 /* If at least one bound of the type is a constant integer, we can check
8026 ourselves and maybe make a decision. If no such decision is possible, but
8027 this type is a subtype, try checking against that. Otherwise, use
8028 double_int_fits_to_tree_p, which checks against the precision.
8030 Compute the status for each possibly constant bound, and return if we see
8031 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8032 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8033 for "constant known to fit". */
8035 /* Check if c >= type_low_bound. */
8036 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8038 dd
= tree_to_double_int (type_low_bound
);
8039 if (TREE_CODE (type
) == INTEGER_TYPE
8040 && TYPE_IS_SIZETYPE (type
)
8041 && TYPE_UNSIGNED (type
))
8042 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8043 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8045 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8046 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8048 if (c_neg
&& !t_neg
)
8050 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8053 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8055 ok_for_low_bound
= true;
8058 ok_for_low_bound
= false;
8060 /* Check if c <= type_high_bound. */
8061 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8063 dd
= tree_to_double_int (type_high_bound
);
8064 if (TREE_CODE (type
) == INTEGER_TYPE
8065 && TYPE_IS_SIZETYPE (type
)
8066 && TYPE_UNSIGNED (type
))
8067 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8068 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8070 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8071 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8073 if (t_neg
&& !c_neg
)
8075 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8078 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8080 ok_for_high_bound
= true;
8083 ok_for_high_bound
= false;
8085 /* If the constant fits both bounds, the result is known. */
8086 if (ok_for_low_bound
&& ok_for_high_bound
)
8089 /* Perform some generic filtering which may allow making a decision
8090 even if the bounds are not constant. First, negative integers
8091 never fit in unsigned types, */
8092 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8095 /* Second, narrower types always fit in wider ones. */
8096 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8099 /* Third, unsigned integers with top bit set never fit signed types. */
8100 if (! TYPE_UNSIGNED (type
) && unsc
)
8102 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8103 if (prec
< HOST_BITS_PER_WIDE_INT
)
8105 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8108 else if (((((unsigned HOST_WIDE_INT
) 1)
8109 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8113 /* If we haven't been able to decide at this point, there nothing more we
8114 can check ourselves here. Look at the base type if we have one and it
8115 has the same precision. */
8116 if (TREE_CODE (type
) == INTEGER_TYPE
8117 && TREE_TYPE (type
) != 0
8118 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8120 type
= TREE_TYPE (type
);
8124 /* Or to double_int_fits_to_tree_p, if nothing else. */
8125 return double_int_fits_to_tree_p (type
, dc
);
8128 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8129 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8130 represented (assuming two's-complement arithmetic) within the bit
8131 precision of the type are returned instead. */
8134 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8136 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8137 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8138 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8139 TYPE_UNSIGNED (type
));
8142 if (TYPE_UNSIGNED (type
))
8143 mpz_set_ui (min
, 0);
8147 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8148 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8149 TYPE_PRECISION (type
));
8150 mpz_set_double_int (min
, mn
, false);
8154 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8155 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8156 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8157 TYPE_UNSIGNED (type
));
8160 if (TYPE_UNSIGNED (type
))
8161 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8164 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8169 /* Return true if VAR is an automatic variable defined in function FN. */
8172 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8174 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8175 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8176 || TREE_CODE (var
) == PARM_DECL
)
8177 && ! TREE_STATIC (var
))
8178 || TREE_CODE (var
) == LABEL_DECL
8179 || TREE_CODE (var
) == RESULT_DECL
));
8182 /* Subprogram of following function. Called by walk_tree.
8184 Return *TP if it is an automatic variable or parameter of the
8185 function passed in as DATA. */
8188 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8190 tree fn
= (tree
) data
;
8195 else if (DECL_P (*tp
)
8196 && auto_var_in_fn_p (*tp
, fn
))
8202 /* Returns true if T is, contains, or refers to a type with variable
8203 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8204 arguments, but not the return type. If FN is nonzero, only return
8205 true if a modifier of the type or position of FN is a variable or
8206 parameter inside FN.
8208 This concept is more general than that of C99 'variably modified types':
8209 in C99, a struct type is never variably modified because a VLA may not
8210 appear as a structure member. However, in GNU C code like:
8212 struct S { int i[f()]; };
8214 is valid, and other languages may define similar constructs. */
8217 variably_modified_type_p (tree type
, tree fn
)
8221 /* Test if T is either variable (if FN is zero) or an expression containing
8222 a variable in FN. */
8223 #define RETURN_TRUE_IF_VAR(T) \
8224 do { tree _t = (T); \
8225 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8226 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8227 return true; } while (0)
8229 if (type
== error_mark_node
)
8232 /* If TYPE itself has variable size, it is variably modified. */
8233 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8234 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8236 switch (TREE_CODE (type
))
8239 case REFERENCE_TYPE
:
8241 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8247 /* If TYPE is a function type, it is variably modified if the
8248 return type is variably modified. */
8249 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8255 case FIXED_POINT_TYPE
:
8258 /* Scalar types are variably modified if their end points
8260 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8261 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8266 case QUAL_UNION_TYPE
:
8267 /* We can't see if any of the fields are variably-modified by the
8268 definition we normally use, since that would produce infinite
8269 recursion via pointers. */
8270 /* This is variably modified if some field's type is. */
8271 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8272 if (TREE_CODE (t
) == FIELD_DECL
)
8274 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8275 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8276 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8278 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8279 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8284 /* Do not call ourselves to avoid infinite recursion. This is
8285 variably modified if the element type is. */
8286 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8287 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8294 /* The current language may have other cases to check, but in general,
8295 all other types are not variably modified. */
8296 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8298 #undef RETURN_TRUE_IF_VAR
8301 /* Given a DECL or TYPE, return the scope in which it was declared, or
8302 NULL_TREE if there is no containing scope. */
8305 get_containing_scope (const_tree t
)
8307 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8310 /* Return the innermost context enclosing DECL that is
8311 a FUNCTION_DECL, or zero if none. */
8314 decl_function_context (const_tree decl
)
8318 if (TREE_CODE (decl
) == ERROR_MARK
)
8321 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8322 where we look up the function at runtime. Such functions always take
8323 a first argument of type 'pointer to real context'.
8325 C++ should really be fixed to use DECL_CONTEXT for the real context,
8326 and use something else for the "virtual context". */
8327 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8330 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8332 context
= DECL_CONTEXT (decl
);
8334 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8336 if (TREE_CODE (context
) == BLOCK
)
8337 context
= BLOCK_SUPERCONTEXT (context
);
8339 context
= get_containing_scope (context
);
8345 /* Return the innermost context enclosing DECL that is
8346 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8347 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8350 decl_type_context (const_tree decl
)
8352 tree context
= DECL_CONTEXT (decl
);
8355 switch (TREE_CODE (context
))
8357 case NAMESPACE_DECL
:
8358 case TRANSLATION_UNIT_DECL
:
8363 case QUAL_UNION_TYPE
:
8368 context
= DECL_CONTEXT (context
);
8372 context
= BLOCK_SUPERCONTEXT (context
);
8382 /* CALL is a CALL_EXPR. Return the declaration for the function
8383 called, or NULL_TREE if the called function cannot be
8387 get_callee_fndecl (const_tree call
)
8391 if (call
== error_mark_node
)
8392 return error_mark_node
;
8394 /* It's invalid to call this function with anything but a
8396 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8398 /* The first operand to the CALL is the address of the function
8400 addr
= CALL_EXPR_FN (call
);
8404 /* If this is a readonly function pointer, extract its initial value. */
8405 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8406 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8407 && DECL_INITIAL (addr
))
8408 addr
= DECL_INITIAL (addr
);
8410 /* If the address is just `&f' for some function `f', then we know
8411 that `f' is being called. */
8412 if (TREE_CODE (addr
) == ADDR_EXPR
8413 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8414 return TREE_OPERAND (addr
, 0);
8416 /* We couldn't figure out what was being called. */
8420 /* Print debugging information about tree nodes generated during the compile,
8421 and any language-specific information. */
8424 dump_tree_statistics (void)
8426 #ifdef GATHER_STATISTICS
8428 int total_nodes
, total_bytes
;
8431 fprintf (stderr
, "\n??? tree nodes created\n\n");
8432 #ifdef GATHER_STATISTICS
8433 fprintf (stderr
, "Kind Nodes Bytes\n");
8434 fprintf (stderr
, "---------------------------------------\n");
8435 total_nodes
= total_bytes
= 0;
8436 for (i
= 0; i
< (int) all_kinds
; i
++)
8438 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8439 tree_node_counts
[i
], tree_node_sizes
[i
]);
8440 total_nodes
+= tree_node_counts
[i
];
8441 total_bytes
+= tree_node_sizes
[i
];
8443 fprintf (stderr
, "---------------------------------------\n");
8444 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8445 fprintf (stderr
, "---------------------------------------\n");
8446 ssanames_print_statistics ();
8447 phinodes_print_statistics ();
8449 fprintf (stderr
, "(No per-node statistics)\n");
8451 print_type_hash_statistics ();
8452 print_debug_expr_statistics ();
8453 print_value_expr_statistics ();
8454 lang_hooks
.print_statistics ();
8457 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8459 /* Generate a crc32 of a string. */
8462 crc32_string (unsigned chksum
, const char *string
)
8466 unsigned value
= *string
<< 24;
8469 for (ix
= 8; ix
--; value
<<= 1)
8473 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8482 /* P is a string that will be used in a symbol. Mask out any characters
8483 that are not valid in that context. */
8486 clean_symbol_name (char *p
)
8490 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8493 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8500 /* Generate a name for a special-purpose function function.
8501 The generated name may need to be unique across the whole link.
8502 TYPE is some string to identify the purpose of this function to the
8503 linker or collect2; it must start with an uppercase letter,
8505 I - for constructors
8507 N - for C++ anonymous namespaces
8508 F - for DWARF unwind frame information. */
8511 get_file_function_name (const char *type
)
8517 /* If we already have a name we know to be unique, just use that. */
8518 if (first_global_object_name
)
8519 p
= q
= ASTRDUP (first_global_object_name
);
8520 /* If the target is handling the constructors/destructors, they
8521 will be local to this file and the name is only necessary for
8523 We also assign sub_I and sub_D sufixes to constructors called from
8524 the global static constructors. These are always local. */
8525 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8526 || (strncmp (type
, "sub_", 4) == 0
8527 && (type
[4] == 'I' || type
[4] == 'D')))
8529 const char *file
= main_input_filename
;
8531 file
= input_filename
;
8532 /* Just use the file's basename, because the full pathname
8533 might be quite long. */
8534 p
= strrchr (file
, '/');
8539 p
= q
= ASTRDUP (p
);
8543 /* Otherwise, the name must be unique across the entire link.
8544 We don't have anything that we know to be unique to this translation
8545 unit, so use what we do have and throw in some randomness. */
8547 const char *name
= weak_global_object_name
;
8548 const char *file
= main_input_filename
;
8553 file
= input_filename
;
8555 len
= strlen (file
);
8556 q
= (char *) alloca (9 * 2 + len
+ 1);
8557 memcpy (q
, file
, len
+ 1);
8559 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8560 crc32_string (0, get_random_seed (false)));
8565 clean_symbol_name (q
);
8566 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8569 /* Set up the name of the file-level functions we may need.
8570 Use a global object (which is already required to be unique over
8571 the program) rather than the file name (which imposes extra
8573 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8575 return get_identifier (buf
);
8578 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8580 /* Complain that the tree code of NODE does not match the expected 0
8581 terminated list of trailing codes. The trailing code list can be
8582 empty, for a more vague error message. FILE, LINE, and FUNCTION
8583 are of the caller. */
8586 tree_check_failed (const_tree node
, const char *file
,
8587 int line
, const char *function
, ...)
8591 unsigned length
= 0;
8594 va_start (args
, function
);
8595 while ((code
= va_arg (args
, int)))
8596 length
+= 4 + strlen (tree_code_name
[code
]);
8601 va_start (args
, function
);
8602 length
+= strlen ("expected ");
8603 buffer
= tmp
= (char *) alloca (length
);
8605 while ((code
= va_arg (args
, int)))
8607 const char *prefix
= length
? " or " : "expected ";
8609 strcpy (tmp
+ length
, prefix
);
8610 length
+= strlen (prefix
);
8611 strcpy (tmp
+ length
, tree_code_name
[code
]);
8612 length
+= strlen (tree_code_name
[code
]);
8617 buffer
= "unexpected node";
8619 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8620 buffer
, tree_code_name
[TREE_CODE (node
)],
8621 function
, trim_filename (file
), line
);
8624 /* Complain that the tree code of NODE does match the expected 0
8625 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8629 tree_not_check_failed (const_tree node
, const char *file
,
8630 int line
, const char *function
, ...)
8634 unsigned length
= 0;
8637 va_start (args
, function
);
8638 while ((code
= va_arg (args
, int)))
8639 length
+= 4 + strlen (tree_code_name
[code
]);
8641 va_start (args
, function
);
8642 buffer
= (char *) alloca (length
);
8644 while ((code
= va_arg (args
, int)))
8648 strcpy (buffer
+ length
, " or ");
8651 strcpy (buffer
+ length
, tree_code_name
[code
]);
8652 length
+= strlen (tree_code_name
[code
]);
8656 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8657 buffer
, tree_code_name
[TREE_CODE (node
)],
8658 function
, trim_filename (file
), line
);
8661 /* Similar to tree_check_failed, except that we check for a class of tree
8662 code, given in CL. */
8665 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8666 const char *file
, int line
, const char *function
)
8669 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8670 TREE_CODE_CLASS_STRING (cl
),
8671 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8672 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8675 /* Similar to tree_check_failed, except that instead of specifying a
8676 dozen codes, use the knowledge that they're all sequential. */
8679 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8680 const char *function
, enum tree_code c1
,
8684 unsigned length
= 0;
8687 for (c
= c1
; c
<= c2
; ++c
)
8688 length
+= 4 + strlen (tree_code_name
[c
]);
8690 length
+= strlen ("expected ");
8691 buffer
= (char *) alloca (length
);
8694 for (c
= c1
; c
<= c2
; ++c
)
8696 const char *prefix
= length
? " or " : "expected ";
8698 strcpy (buffer
+ length
, prefix
);
8699 length
+= strlen (prefix
);
8700 strcpy (buffer
+ length
, tree_code_name
[c
]);
8701 length
+= strlen (tree_code_name
[c
]);
8704 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8705 buffer
, tree_code_name
[TREE_CODE (node
)],
8706 function
, trim_filename (file
), line
);
8710 /* Similar to tree_check_failed, except that we check that a tree does
8711 not have the specified code, given in CL. */
8714 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8715 const char *file
, int line
, const char *function
)
8718 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8719 TREE_CODE_CLASS_STRING (cl
),
8720 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8721 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8725 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8728 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8729 const char *function
, enum omp_clause_code code
)
8731 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8732 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8733 function
, trim_filename (file
), line
);
8737 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8740 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8741 const char *function
, enum omp_clause_code c1
,
8742 enum omp_clause_code c2
)
8745 unsigned length
= 0;
8748 for (c
= c1
; c
<= c2
; ++c
)
8749 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8751 length
+= strlen ("expected ");
8752 buffer
= (char *) alloca (length
);
8755 for (c
= c1
; c
<= c2
; ++c
)
8757 const char *prefix
= length
? " or " : "expected ";
8759 strcpy (buffer
+ length
, prefix
);
8760 length
+= strlen (prefix
);
8761 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8762 length
+= strlen (omp_clause_code_name
[c
]);
8765 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8766 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8767 function
, trim_filename (file
), line
);
8771 #undef DEFTREESTRUCT
8772 #define DEFTREESTRUCT(VAL, NAME) NAME,
8774 static const char *ts_enum_names
[] = {
8775 #include "treestruct.def"
8777 #undef DEFTREESTRUCT
8779 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8781 /* Similar to tree_class_check_failed, except that we check for
8782 whether CODE contains the tree structure identified by EN. */
8785 tree_contains_struct_check_failed (const_tree node
,
8786 const enum tree_node_structure_enum en
,
8787 const char *file
, int line
,
8788 const char *function
)
8791 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8793 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8797 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8798 (dynamically sized) vector. */
8801 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8802 const char *function
)
8805 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8806 idx
+ 1, len
, function
, trim_filename (file
), line
);
8809 /* Similar to above, except that the check is for the bounds of the operand
8810 vector of an expression node EXP. */
8813 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8814 int line
, const char *function
)
8816 int code
= TREE_CODE (exp
);
8818 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8819 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8820 function
, trim_filename (file
), line
);
8823 /* Similar to above, except that the check is for the number of
8824 operands of an OMP_CLAUSE node. */
8827 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8828 int line
, const char *function
)
8831 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8832 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8833 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8834 trim_filename (file
), line
);
8836 #endif /* ENABLE_TREE_CHECKING */
8838 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8839 and mapped to the machine mode MODE. Initialize its fields and build
8840 the information necessary for debugging output. */
8843 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8846 hashval_t hashcode
= 0;
8848 t
= make_node (VECTOR_TYPE
);
8849 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8850 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8851 SET_TYPE_MODE (t
, mode
);
8853 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8854 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8855 else if (TYPE_CANONICAL (innertype
) != innertype
8856 || mode
!= VOIDmode
)
8858 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8862 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8863 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8864 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8865 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8866 t
= type_hash_canon (hashcode
, t
);
8868 /* We have built a main variant, based on the main variant of the
8869 inner type. Use it to build the variant we return. */
8870 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8871 && TREE_TYPE (t
) != innertype
)
8872 return build_type_attribute_qual_variant (t
,
8873 TYPE_ATTRIBUTES (innertype
),
8874 TYPE_QUALS (innertype
));
8880 make_or_reuse_type (unsigned size
, int unsignedp
)
8882 if (size
== INT_TYPE_SIZE
)
8883 return unsignedp
? unsigned_type_node
: integer_type_node
;
8884 if (size
== CHAR_TYPE_SIZE
)
8885 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8886 if (size
== SHORT_TYPE_SIZE
)
8887 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8888 if (size
== LONG_TYPE_SIZE
)
8889 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8890 if (size
== LONG_LONG_TYPE_SIZE
)
8891 return (unsignedp
? long_long_unsigned_type_node
8892 : long_long_integer_type_node
);
8893 if (size
== 128 && int128_integer_type_node
)
8894 return (unsignedp
? int128_unsigned_type_node
8895 : int128_integer_type_node
);
8898 return make_unsigned_type (size
);
8900 return make_signed_type (size
);
8903 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8906 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8910 if (size
== SHORT_FRACT_TYPE_SIZE
)
8911 return unsignedp
? sat_unsigned_short_fract_type_node
8912 : sat_short_fract_type_node
;
8913 if (size
== FRACT_TYPE_SIZE
)
8914 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8915 if (size
== LONG_FRACT_TYPE_SIZE
)
8916 return unsignedp
? sat_unsigned_long_fract_type_node
8917 : sat_long_fract_type_node
;
8918 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8919 return unsignedp
? sat_unsigned_long_long_fract_type_node
8920 : sat_long_long_fract_type_node
;
8924 if (size
== SHORT_FRACT_TYPE_SIZE
)
8925 return unsignedp
? unsigned_short_fract_type_node
8926 : short_fract_type_node
;
8927 if (size
== FRACT_TYPE_SIZE
)
8928 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
8929 if (size
== LONG_FRACT_TYPE_SIZE
)
8930 return unsignedp
? unsigned_long_fract_type_node
8931 : long_fract_type_node
;
8932 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8933 return unsignedp
? unsigned_long_long_fract_type_node
8934 : long_long_fract_type_node
;
8937 return make_fract_type (size
, unsignedp
, satp
);
8940 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8943 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
8947 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8948 return unsignedp
? sat_unsigned_short_accum_type_node
8949 : sat_short_accum_type_node
;
8950 if (size
== ACCUM_TYPE_SIZE
)
8951 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
8952 if (size
== LONG_ACCUM_TYPE_SIZE
)
8953 return unsignedp
? sat_unsigned_long_accum_type_node
8954 : sat_long_accum_type_node
;
8955 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8956 return unsignedp
? sat_unsigned_long_long_accum_type_node
8957 : sat_long_long_accum_type_node
;
8961 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8962 return unsignedp
? unsigned_short_accum_type_node
8963 : short_accum_type_node
;
8964 if (size
== ACCUM_TYPE_SIZE
)
8965 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
8966 if (size
== LONG_ACCUM_TYPE_SIZE
)
8967 return unsignedp
? unsigned_long_accum_type_node
8968 : long_accum_type_node
;
8969 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8970 return unsignedp
? unsigned_long_long_accum_type_node
8971 : long_long_accum_type_node
;
8974 return make_accum_type (size
, unsignedp
, satp
);
8977 /* Create nodes for all integer types (and error_mark_node) using the sizes
8978 of C datatypes. The caller should call set_sizetype soon after calling
8979 this function to select one of the types as sizetype. */
8982 build_common_tree_nodes (bool signed_char
)
8984 error_mark_node
= make_node (ERROR_MARK
);
8985 TREE_TYPE (error_mark_node
) = error_mark_node
;
8987 initialize_sizetypes ();
8989 /* Define both `signed char' and `unsigned char'. */
8990 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
8991 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
8992 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
8993 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
8995 /* Define `char', which is like either `signed char' or `unsigned char'
8996 but not the same as either. */
8999 ? make_signed_type (CHAR_TYPE_SIZE
)
9000 : make_unsigned_type (CHAR_TYPE_SIZE
));
9001 TYPE_STRING_FLAG (char_type_node
) = 1;
9003 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9004 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9005 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9006 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9007 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9008 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9009 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9010 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9011 #if HOST_BITS_PER_WIDE_INT >= 64
9012 /* TODO: This isn't correct, but as logic depends at the moment on
9013 host's instead of target's wide-integer.
9014 If there is a target not supporting TImode, but has an 128-bit
9015 integer-scalar register, this target check needs to be adjusted. */
9016 if (targetm
.scalar_mode_supported_p (TImode
))
9018 int128_integer_type_node
= make_signed_type (128);
9019 int128_unsigned_type_node
= make_unsigned_type (128);
9022 /* Define a boolean type. This type only represents boolean values but
9023 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9024 Front ends which want to override this size (i.e. Java) can redefine
9025 boolean_type_node before calling build_common_tree_nodes_2. */
9026 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9027 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9028 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9029 TYPE_PRECISION (boolean_type_node
) = 1;
9031 /* Fill in the rest of the sized types. Reuse existing type nodes
9033 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9034 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9035 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9036 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9037 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9039 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9040 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9041 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9042 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9043 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9045 access_public_node
= get_identifier ("public");
9046 access_protected_node
= get_identifier ("protected");
9047 access_private_node
= get_identifier ("private");
9050 /* Call this function after calling build_common_tree_nodes and set_sizetype.
9051 It will create several other common tree nodes. */
9054 build_common_tree_nodes_2 (int short_double
)
9056 /* Define these next since types below may used them. */
9057 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9058 integer_one_node
= build_int_cst (integer_type_node
, 1);
9059 integer_three_node
= build_int_cst (integer_type_node
, 3);
9060 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9062 size_zero_node
= size_int (0);
9063 size_one_node
= size_int (1);
9064 bitsize_zero_node
= bitsize_int (0);
9065 bitsize_one_node
= bitsize_int (1);
9066 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9068 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9069 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9071 void_type_node
= make_node (VOID_TYPE
);
9072 layout_type (void_type_node
);
9074 /* We are not going to have real types in C with less than byte alignment,
9075 so we might as well not have any types that claim to have it. */
9076 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9077 TYPE_USER_ALIGN (void_type_node
) = 0;
9079 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9080 layout_type (TREE_TYPE (null_pointer_node
));
9082 ptr_type_node
= build_pointer_type (void_type_node
);
9084 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9085 fileptr_type_node
= ptr_type_node
;
9087 float_type_node
= make_node (REAL_TYPE
);
9088 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9089 layout_type (float_type_node
);
9091 double_type_node
= make_node (REAL_TYPE
);
9093 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9095 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9096 layout_type (double_type_node
);
9098 long_double_type_node
= make_node (REAL_TYPE
);
9099 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9100 layout_type (long_double_type_node
);
9102 float_ptr_type_node
= build_pointer_type (float_type_node
);
9103 double_ptr_type_node
= build_pointer_type (double_type_node
);
9104 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9105 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9107 /* Fixed size integer types. */
9108 uint32_type_node
= build_nonstandard_integer_type (32, true);
9109 uint64_type_node
= build_nonstandard_integer_type (64, true);
9111 /* Decimal float types. */
9112 dfloat32_type_node
= make_node (REAL_TYPE
);
9113 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9114 layout_type (dfloat32_type_node
);
9115 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9116 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9118 dfloat64_type_node
= make_node (REAL_TYPE
);
9119 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9120 layout_type (dfloat64_type_node
);
9121 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9122 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9124 dfloat128_type_node
= make_node (REAL_TYPE
);
9125 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9126 layout_type (dfloat128_type_node
);
9127 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9128 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9130 complex_integer_type_node
= build_complex_type (integer_type_node
);
9131 complex_float_type_node
= build_complex_type (float_type_node
);
9132 complex_double_type_node
= build_complex_type (double_type_node
);
9133 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9135 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9136 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9137 sat_ ## KIND ## _type_node = \
9138 make_sat_signed_ ## KIND ## _type (SIZE); \
9139 sat_unsigned_ ## KIND ## _type_node = \
9140 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9141 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9142 unsigned_ ## KIND ## _type_node = \
9143 make_unsigned_ ## KIND ## _type (SIZE);
9145 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9146 sat_ ## WIDTH ## KIND ## _type_node = \
9147 make_sat_signed_ ## KIND ## _type (SIZE); \
9148 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9149 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9150 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9151 unsigned_ ## WIDTH ## KIND ## _type_node = \
9152 make_unsigned_ ## KIND ## _type (SIZE);
9154 /* Make fixed-point type nodes based on four different widths. */
9155 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9156 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9157 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9158 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9159 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9161 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9162 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9163 NAME ## _type_node = \
9164 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9165 u ## NAME ## _type_node = \
9166 make_or_reuse_unsigned_ ## KIND ## _type \
9167 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9168 sat_ ## NAME ## _type_node = \
9169 make_or_reuse_sat_signed_ ## KIND ## _type \
9170 (GET_MODE_BITSIZE (MODE ## mode)); \
9171 sat_u ## NAME ## _type_node = \
9172 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9173 (GET_MODE_BITSIZE (U ## MODE ## mode));
9175 /* Fixed-point type and mode nodes. */
9176 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9177 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9178 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9179 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9180 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9181 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9182 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9183 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9184 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9185 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9186 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9189 tree t
= targetm
.build_builtin_va_list ();
9191 /* Many back-ends define record types without setting TYPE_NAME.
9192 If we copied the record type here, we'd keep the original
9193 record type without a name. This breaks name mangling. So,
9194 don't copy record types and let c_common_nodes_and_builtins()
9195 declare the type to be __builtin_va_list. */
9196 if (TREE_CODE (t
) != RECORD_TYPE
)
9197 t
= build_variant_type_copy (t
);
9199 va_list_type_node
= t
;
9203 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9206 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9207 const char *library_name
, int ecf_flags
)
9211 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9212 library_name
, NULL_TREE
);
9213 if (ecf_flags
& ECF_CONST
)
9214 TREE_READONLY (decl
) = 1;
9215 if (ecf_flags
& ECF_PURE
)
9216 DECL_PURE_P (decl
) = 1;
9217 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9218 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9219 if (ecf_flags
& ECF_NORETURN
)
9220 TREE_THIS_VOLATILE (decl
) = 1;
9221 if (ecf_flags
& ECF_NOTHROW
)
9222 TREE_NOTHROW (decl
) = 1;
9223 if (ecf_flags
& ECF_MALLOC
)
9224 DECL_IS_MALLOC (decl
) = 1;
9225 if (ecf_flags
& ECF_LEAF
)
9226 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9227 NULL
, DECL_ATTRIBUTES (decl
));
9229 built_in_decls
[code
] = decl
;
9230 implicit_built_in_decls
[code
] = decl
;
9233 /* Call this function after instantiating all builtins that the language
9234 front end cares about. This will build the rest of the builtins that
9235 are relied upon by the tree optimizers and the middle-end. */
9238 build_common_builtin_nodes (void)
9242 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
9243 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9245 ftype
= build_function_type_list (ptr_type_node
,
9246 ptr_type_node
, const_ptr_type_node
,
9247 size_type_node
, NULL_TREE
);
9249 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
9250 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9251 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9252 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9253 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9254 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9257 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
9259 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9260 const_ptr_type_node
, size_type_node
,
9262 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9263 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9266 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
9268 ftype
= build_function_type_list (ptr_type_node
,
9269 ptr_type_node
, integer_type_node
,
9270 size_type_node
, NULL_TREE
);
9271 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9272 "memset", ECF_NOTHROW
| ECF_LEAF
);
9275 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9277 ftype
= build_function_type_list (ptr_type_node
,
9278 size_type_node
, NULL_TREE
);
9279 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9280 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9283 /* If we're checking the stack, `alloca' can throw. */
9284 if (flag_stack_check
)
9285 TREE_NOTHROW (built_in_decls
[BUILT_IN_ALLOCA
]) = 0;
9287 ftype
= build_function_type_list (void_type_node
,
9288 ptr_type_node
, ptr_type_node
,
9289 ptr_type_node
, NULL_TREE
);
9290 local_define_builtin ("__builtin_init_trampoline", ftype
,
9291 BUILT_IN_INIT_TRAMPOLINE
,
9292 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9294 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9295 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9296 BUILT_IN_ADJUST_TRAMPOLINE
,
9297 "__builtin_adjust_trampoline",
9298 ECF_CONST
| ECF_NOTHROW
);
9300 ftype
= build_function_type_list (void_type_node
,
9301 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9302 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9303 BUILT_IN_NONLOCAL_GOTO
,
9304 "__builtin_nonlocal_goto",
9305 ECF_NORETURN
| ECF_NOTHROW
);
9307 ftype
= build_function_type_list (void_type_node
,
9308 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9309 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9310 BUILT_IN_SETJMP_SETUP
,
9311 "__builtin_setjmp_setup", ECF_NOTHROW
);
9313 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9314 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9315 BUILT_IN_SETJMP_DISPATCHER
,
9316 "__builtin_setjmp_dispatcher",
9317 ECF_PURE
| ECF_NOTHROW
);
9319 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9320 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9321 BUILT_IN_SETJMP_RECEIVER
,
9322 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9324 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9325 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9326 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9328 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9329 local_define_builtin ("__builtin_stack_restore", ftype
,
9330 BUILT_IN_STACK_RESTORE
,
9331 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9333 /* If there's a possibility that we might use the ARM EABI, build the
9334 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9335 if (targetm
.arm_eabi_unwinder
)
9337 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9338 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9339 BUILT_IN_CXA_END_CLEANUP
,
9340 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9343 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9344 local_define_builtin ("__builtin_unwind_resume", ftype
,
9345 BUILT_IN_UNWIND_RESUME
,
9346 ((targetm
.except_unwind_info (&global_options
)
9348 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9351 /* The exception object and filter values from the runtime. The argument
9352 must be zero before exception lowering, i.e. from the front end. After
9353 exception lowering, it will be the region number for the exception
9354 landing pad. These functions are PURE instead of CONST to prevent
9355 them from being hoisted past the exception edge that will initialize
9356 its value in the landing pad. */
9357 ftype
= build_function_type_list (ptr_type_node
,
9358 integer_type_node
, NULL_TREE
);
9359 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9360 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9362 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9363 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9364 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9365 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9367 ftype
= build_function_type_list (void_type_node
,
9368 integer_type_node
, integer_type_node
,
9370 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9371 BUILT_IN_EH_COPY_VALUES
,
9372 "__builtin_eh_copy_values", ECF_NOTHROW
);
9374 /* Complex multiplication and division. These are handled as builtins
9375 rather than optabs because emit_library_call_value doesn't support
9376 complex. Further, we can do slightly better with folding these
9377 beasties if the real and complex parts of the arguments are separate. */
9381 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9383 char mode_name_buf
[4], *q
;
9385 enum built_in_function mcode
, dcode
;
9386 tree type
, inner_type
;
9388 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9391 inner_type
= TREE_TYPE (type
);
9393 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9394 inner_type
, inner_type
, NULL_TREE
);
9396 mcode
= ((enum built_in_function
)
9397 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9398 dcode
= ((enum built_in_function
)
9399 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9401 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9405 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9406 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9407 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9409 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9410 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9411 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9416 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9419 If we requested a pointer to a vector, build up the pointers that
9420 we stripped off while looking for the inner type. Similarly for
9421 return values from functions.
9423 The argument TYPE is the top of the chain, and BOTTOM is the
9424 new type which we will point to. */
9427 reconstruct_complex_type (tree type
, tree bottom
)
9431 if (TREE_CODE (type
) == POINTER_TYPE
)
9433 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9434 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9435 TYPE_REF_CAN_ALIAS_ALL (type
));
9437 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9439 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9440 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9441 TYPE_REF_CAN_ALIAS_ALL (type
));
9443 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9445 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9446 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9448 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9450 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9451 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9453 else if (TREE_CODE (type
) == METHOD_TYPE
)
9455 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9456 /* The build_method_type_directly() routine prepends 'this' to argument list,
9457 so we must compensate by getting rid of it. */
9459 = build_method_type_directly
9460 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9462 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9464 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9466 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9467 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9472 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9476 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9479 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9483 switch (GET_MODE_CLASS (mode
))
9485 case MODE_VECTOR_INT
:
9486 case MODE_VECTOR_FLOAT
:
9487 case MODE_VECTOR_FRACT
:
9488 case MODE_VECTOR_UFRACT
:
9489 case MODE_VECTOR_ACCUM
:
9490 case MODE_VECTOR_UACCUM
:
9491 nunits
= GET_MODE_NUNITS (mode
);
9495 /* Check that there are no leftover bits. */
9496 gcc_assert (GET_MODE_BITSIZE (mode
)
9497 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9499 nunits
= GET_MODE_BITSIZE (mode
)
9500 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9507 return make_vector_type (innertype
, nunits
, mode
);
9510 /* Similarly, but takes the inner type and number of units, which must be
9514 build_vector_type (tree innertype
, int nunits
)
9516 return make_vector_type (innertype
, nunits
, VOIDmode
);
9519 /* Similarly, but takes the inner type and number of units, which must be
9523 build_opaque_vector_type (tree innertype
, int nunits
)
9526 innertype
= build_distinct_type_copy (innertype
);
9527 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9528 TYPE_VECTOR_OPAQUE (t
) = true;
9533 /* Given an initializer INIT, return TRUE if INIT is zero or some
9534 aggregate of zeros. Otherwise return FALSE. */
9536 initializer_zerop (const_tree init
)
9542 switch (TREE_CODE (init
))
9545 return integer_zerop (init
);
9548 /* ??? Note that this is not correct for C4X float formats. There,
9549 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9550 negative exponent. */
9551 return real_zerop (init
)
9552 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9555 return fixed_zerop (init
);
9558 return integer_zerop (init
)
9559 || (real_zerop (init
)
9560 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9561 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9564 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9565 if (!initializer_zerop (TREE_VALUE (elt
)))
9571 unsigned HOST_WIDE_INT idx
;
9573 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9574 if (!initializer_zerop (elt
))
9583 /* We need to loop through all elements to handle cases like
9584 "\0" and "\0foobar". */
9585 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9586 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9597 /* Build an empty statement at location LOC. */
9600 build_empty_stmt (location_t loc
)
9602 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9603 SET_EXPR_LOCATION (t
, loc
);
9608 /* Build an OpenMP clause with code CODE. LOC is the location of the
9612 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9617 length
= omp_clause_num_ops
[code
];
9618 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9620 t
= ggc_alloc_tree_node (size
);
9621 memset (t
, 0, size
);
9622 TREE_SET_CODE (t
, OMP_CLAUSE
);
9623 OMP_CLAUSE_SET_CODE (t
, code
);
9624 OMP_CLAUSE_LOCATION (t
) = loc
;
9626 #ifdef GATHER_STATISTICS
9627 tree_node_counts
[(int) omp_clause_kind
]++;
9628 tree_node_sizes
[(int) omp_clause_kind
] += size
;
9634 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9635 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9636 Except for the CODE and operand count field, other storage for the
9637 object is initialized to zeros. */
9640 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9643 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9645 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9646 gcc_assert (len
>= 1);
9648 #ifdef GATHER_STATISTICS
9649 tree_node_counts
[(int) e_kind
]++;
9650 tree_node_sizes
[(int) e_kind
] += length
;
9653 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
9655 TREE_SET_CODE (t
, code
);
9657 /* Can't use TREE_OPERAND to store the length because if checking is
9658 enabled, it will try to check the length before we store it. :-P */
9659 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9664 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9665 FN and a null static chain slot. NARGS is the number of call arguments
9666 which are specified as "..." arguments. */
9669 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9673 va_start (args
, nargs
);
9674 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9679 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9680 FN and a null static chain slot. NARGS is the number of call arguments
9681 which are specified as a va_list ARGS. */
9684 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9689 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9690 TREE_TYPE (t
) = return_type
;
9691 CALL_EXPR_FN (t
) = fn
;
9692 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9693 for (i
= 0; i
< nargs
; i
++)
9694 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9695 process_call_operands (t
);
9699 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9700 FN and a null static chain slot. NARGS is the number of call arguments
9701 which are specified as a tree array ARGS. */
9704 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9705 int nargs
, const tree
*args
)
9710 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9711 TREE_TYPE (t
) = return_type
;
9712 CALL_EXPR_FN (t
) = fn
;
9713 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9714 for (i
= 0; i
< nargs
; i
++)
9715 CALL_EXPR_ARG (t
, i
) = args
[i
];
9716 process_call_operands (t
);
9717 SET_EXPR_LOCATION (t
, loc
);
9721 /* Like build_call_array, but takes a VEC. */
9724 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9729 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
9730 TREE_TYPE (ret
) = return_type
;
9731 CALL_EXPR_FN (ret
) = fn
;
9732 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
9733 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
9734 CALL_EXPR_ARG (ret
, ix
) = t
;
9735 process_call_operands (ret
);
9740 /* Returns true if it is possible to prove that the index of
9741 an array access REF (an ARRAY_REF expression) falls into the
9745 in_array_bounds_p (tree ref
)
9747 tree idx
= TREE_OPERAND (ref
, 1);
9750 if (TREE_CODE (idx
) != INTEGER_CST
)
9753 min
= array_ref_low_bound (ref
);
9754 max
= array_ref_up_bound (ref
);
9757 || TREE_CODE (min
) != INTEGER_CST
9758 || TREE_CODE (max
) != INTEGER_CST
)
9761 if (tree_int_cst_lt (idx
, min
)
9762 || tree_int_cst_lt (max
, idx
))
9768 /* Returns true if it is possible to prove that the range of
9769 an array access REF (an ARRAY_RANGE_REF expression) falls
9770 into the array bounds. */
9773 range_in_array_bounds_p (tree ref
)
9775 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9776 tree range_min
, range_max
, min
, max
;
9778 range_min
= TYPE_MIN_VALUE (domain_type
);
9779 range_max
= TYPE_MAX_VALUE (domain_type
);
9782 || TREE_CODE (range_min
) != INTEGER_CST
9783 || TREE_CODE (range_max
) != INTEGER_CST
)
9786 min
= array_ref_low_bound (ref
);
9787 max
= array_ref_up_bound (ref
);
9790 || TREE_CODE (min
) != INTEGER_CST
9791 || TREE_CODE (max
) != INTEGER_CST
)
9794 if (tree_int_cst_lt (range_min
, min
)
9795 || tree_int_cst_lt (max
, range_max
))
9801 /* Return true if T (assumed to be a DECL) must be assigned a memory
9805 needs_to_live_in_memory (const_tree t
)
9807 if (TREE_CODE (t
) == SSA_NAME
)
9808 t
= SSA_NAME_VAR (t
);
9810 return (TREE_ADDRESSABLE (t
)
9811 || is_global_var (t
)
9812 || (TREE_CODE (t
) == RESULT_DECL
9813 && !DECL_BY_REFERENCE (t
)
9814 && aggregate_value_p (t
, current_function_decl
)));
9817 /* There are situations in which a language considers record types
9818 compatible which have different field lists. Decide if two fields
9819 are compatible. It is assumed that the parent records are compatible. */
9822 fields_compatible_p (const_tree f1
, const_tree f2
)
9824 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9825 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9828 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9829 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9832 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9838 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9841 find_compatible_field (tree record
, tree orig_field
)
9845 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9846 if (TREE_CODE (f
) == FIELD_DECL
9847 && fields_compatible_p (f
, orig_field
))
9850 /* ??? Why isn't this on the main fields list? */
9851 f
= TYPE_VFIELD (record
);
9852 if (f
&& TREE_CODE (f
) == FIELD_DECL
9853 && fields_compatible_p (f
, orig_field
))
9856 /* ??? We should abort here, but Java appears to do Bad Things
9857 with inherited fields. */
9861 /* Return value of a constant X and sign-extend it. */
9864 int_cst_value (const_tree x
)
9866 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9867 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9869 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9870 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9871 || TREE_INT_CST_HIGH (x
) == -1);
9873 if (bits
< HOST_BITS_PER_WIDE_INT
)
9875 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9877 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9879 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9885 /* Return value of a constant X and sign-extend it. */
9888 widest_int_cst_value (const_tree x
)
9890 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9891 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9893 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9894 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9895 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9896 << HOST_BITS_PER_WIDE_INT
);
9898 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9899 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9900 || TREE_INT_CST_HIGH (x
) == -1);
9903 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9905 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9907 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9909 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9915 /* If TYPE is an integral type, return an equivalent type which is
9916 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9917 return TYPE itself. */
9920 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9923 if (POINTER_TYPE_P (type
))
9925 /* If the pointer points to the normal address space, use the
9926 size_type_node. Otherwise use an appropriate size for the pointer
9927 based on the named address space it points to. */
9928 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
9931 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9934 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9937 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9940 /* Returns unsigned variant of TYPE. */
9943 unsigned_type_for (tree type
)
9945 return signed_or_unsigned_type_for (1, type
);
9948 /* Returns signed variant of TYPE. */
9951 signed_type_for (tree type
)
9953 return signed_or_unsigned_type_for (0, type
);
9956 /* Returns the largest value obtainable by casting something in INNER type to
9960 upper_bound_in_type (tree outer
, tree inner
)
9962 unsigned HOST_WIDE_INT lo
, hi
;
9963 unsigned int det
= 0;
9964 unsigned oprec
= TYPE_PRECISION (outer
);
9965 unsigned iprec
= TYPE_PRECISION (inner
);
9968 /* Compute a unique number for every combination. */
9969 det
|= (oprec
> iprec
) ? 4 : 0;
9970 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
9971 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
9973 /* Determine the exponent to use. */
9978 /* oprec <= iprec, outer: signed, inner: don't care. */
9983 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9987 /* oprec > iprec, outer: signed, inner: signed. */
9991 /* oprec > iprec, outer: signed, inner: unsigned. */
9995 /* oprec > iprec, outer: unsigned, inner: signed. */
9999 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10003 gcc_unreachable ();
10006 /* Compute 2^^prec - 1. */
10007 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10010 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
10011 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10015 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10016 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
10017 lo
= ~(unsigned HOST_WIDE_INT
) 0;
10020 return build_int_cst_wide (outer
, lo
, hi
);
10023 /* Returns the smallest value obtainable by casting something in INNER type to
10027 lower_bound_in_type (tree outer
, tree inner
)
10029 unsigned HOST_WIDE_INT lo
, hi
;
10030 unsigned oprec
= TYPE_PRECISION (outer
);
10031 unsigned iprec
= TYPE_PRECISION (inner
);
10033 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10035 if (TYPE_UNSIGNED (outer
)
10036 /* If we are widening something of an unsigned type, OUTER type
10037 contains all values of INNER type. In particular, both INNER
10038 and OUTER types have zero in common. */
10039 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10043 /* If we are widening a signed type to another signed type, we
10044 want to obtain -2^^(iprec-1). If we are keeping the
10045 precision or narrowing to a signed type, we want to obtain
10047 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10049 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10051 hi
= ~(unsigned HOST_WIDE_INT
) 0;
10052 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10056 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10057 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10062 return build_int_cst_wide (outer
, lo
, hi
);
10065 /* Return nonzero if two operands that are suitable for PHI nodes are
10066 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10067 SSA_NAME or invariant. Note that this is strictly an optimization.
10068 That is, callers of this function can directly call operand_equal_p
10069 and get the same result, only slower. */
10072 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10076 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10078 return operand_equal_p (arg0
, arg1
, 0);
10081 /* Returns number of zeros at the end of binary representation of X.
10083 ??? Use ffs if available? */
10086 num_ending_zeros (const_tree x
)
10088 unsigned HOST_WIDE_INT fr
, nfr
;
10089 unsigned num
, abits
;
10090 tree type
= TREE_TYPE (x
);
10092 if (TREE_INT_CST_LOW (x
) == 0)
10094 num
= HOST_BITS_PER_WIDE_INT
;
10095 fr
= TREE_INT_CST_HIGH (x
);
10100 fr
= TREE_INT_CST_LOW (x
);
10103 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10106 if (nfr
<< abits
== fr
)
10113 if (num
> TYPE_PRECISION (type
))
10114 num
= TYPE_PRECISION (type
);
10116 return build_int_cst_type (type
, num
);
10120 #define WALK_SUBTREE(NODE) \
10123 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10129 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10130 be walked whenever a type is seen in the tree. Rest of operands and return
10131 value are as for walk_tree. */
10134 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10135 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10137 tree result
= NULL_TREE
;
10139 switch (TREE_CODE (type
))
10142 case REFERENCE_TYPE
:
10143 /* We have to worry about mutually recursive pointers. These can't
10144 be written in C. They can in Ada. It's pathological, but
10145 there's an ACATS test (c38102a) that checks it. Deal with this
10146 by checking if we're pointing to another pointer, that one
10147 points to another pointer, that one does too, and we have no htab.
10148 If so, get a hash table. We check three levels deep to avoid
10149 the cost of the hash table if we don't need one. */
10150 if (POINTER_TYPE_P (TREE_TYPE (type
))
10151 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10152 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10155 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10163 /* ... fall through ... */
10166 WALK_SUBTREE (TREE_TYPE (type
));
10170 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10172 /* Fall through. */
10174 case FUNCTION_TYPE
:
10175 WALK_SUBTREE (TREE_TYPE (type
));
10179 /* We never want to walk into default arguments. */
10180 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10181 WALK_SUBTREE (TREE_VALUE (arg
));
10186 /* Don't follow this nodes's type if a pointer for fear that
10187 we'll have infinite recursion. If we have a PSET, then we
10190 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10191 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10192 WALK_SUBTREE (TREE_TYPE (type
));
10193 WALK_SUBTREE (TYPE_DOMAIN (type
));
10197 WALK_SUBTREE (TREE_TYPE (type
));
10198 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10208 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10209 called with the DATA and the address of each sub-tree. If FUNC returns a
10210 non-NULL value, the traversal is stopped, and the value returned by FUNC
10211 is returned. If PSET is non-NULL it is used to record the nodes visited,
10212 and to avoid visiting a node more than once. */
10215 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10216 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10218 enum tree_code code
;
10222 #define WALK_SUBTREE_TAIL(NODE) \
10226 goto tail_recurse; \
10231 /* Skip empty subtrees. */
10235 /* Don't walk the same tree twice, if the user has requested
10236 that we avoid doing so. */
10237 if (pset
&& pointer_set_insert (pset
, *tp
))
10240 /* Call the function. */
10242 result
= (*func
) (tp
, &walk_subtrees
, data
);
10244 /* If we found something, return it. */
10248 code
= TREE_CODE (*tp
);
10250 /* Even if we didn't, FUNC may have decided that there was nothing
10251 interesting below this point in the tree. */
10252 if (!walk_subtrees
)
10254 /* But we still need to check our siblings. */
10255 if (code
== TREE_LIST
)
10256 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10257 else if (code
== OMP_CLAUSE
)
10258 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10265 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10266 if (result
|| !walk_subtrees
)
10273 case IDENTIFIER_NODE
:
10280 case PLACEHOLDER_EXPR
:
10284 /* None of these have subtrees other than those already walked
10289 WALK_SUBTREE (TREE_VALUE (*tp
));
10290 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10295 int len
= TREE_VEC_LENGTH (*tp
);
10300 /* Walk all elements but the first. */
10302 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10304 /* Now walk the first one as a tail call. */
10305 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10309 WALK_SUBTREE (TREE_REALPART (*tp
));
10310 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10314 unsigned HOST_WIDE_INT idx
;
10315 constructor_elt
*ce
;
10318 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10320 WALK_SUBTREE (ce
->value
);
10325 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10330 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10332 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10333 into declarations that are just mentioned, rather than
10334 declared; they don't really belong to this part of the tree.
10335 And, we can see cycles: the initializer for a declaration
10336 can refer to the declaration itself. */
10337 WALK_SUBTREE (DECL_INITIAL (decl
));
10338 WALK_SUBTREE (DECL_SIZE (decl
));
10339 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10341 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10344 case STATEMENT_LIST
:
10346 tree_stmt_iterator i
;
10347 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10348 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10353 switch (OMP_CLAUSE_CODE (*tp
))
10355 case OMP_CLAUSE_PRIVATE
:
10356 case OMP_CLAUSE_SHARED
:
10357 case OMP_CLAUSE_FIRSTPRIVATE
:
10358 case OMP_CLAUSE_COPYIN
:
10359 case OMP_CLAUSE_COPYPRIVATE
:
10360 case OMP_CLAUSE_IF
:
10361 case OMP_CLAUSE_NUM_THREADS
:
10362 case OMP_CLAUSE_SCHEDULE
:
10363 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10366 case OMP_CLAUSE_NOWAIT
:
10367 case OMP_CLAUSE_ORDERED
:
10368 case OMP_CLAUSE_DEFAULT
:
10369 case OMP_CLAUSE_UNTIED
:
10370 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10372 case OMP_CLAUSE_LASTPRIVATE
:
10373 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10374 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10375 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10377 case OMP_CLAUSE_COLLAPSE
:
10380 for (i
= 0; i
< 3; i
++)
10381 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10382 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10385 case OMP_CLAUSE_REDUCTION
:
10388 for (i
= 0; i
< 4; i
++)
10389 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10390 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10394 gcc_unreachable ();
10402 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10403 But, we only want to walk once. */
10404 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10405 for (i
= 0; i
< len
; ++i
)
10406 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10407 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10411 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10412 defining. We only want to walk into these fields of a type in this
10413 case and not in the general case of a mere reference to the type.
10415 The criterion is as follows: if the field can be an expression, it
10416 must be walked only here. This should be in keeping with the fields
10417 that are directly gimplified in gimplify_type_sizes in order for the
10418 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10419 variable-sized types.
10421 Note that DECLs get walked as part of processing the BIND_EXPR. */
10422 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10424 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10425 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10428 /* Call the function for the type. See if it returns anything or
10429 doesn't want us to continue. If we are to continue, walk both
10430 the normal fields and those for the declaration case. */
10431 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10432 if (result
|| !walk_subtrees
)
10435 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10439 /* If this is a record type, also walk the fields. */
10440 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10444 for (field
= TYPE_FIELDS (*type_p
); field
;
10445 field
= DECL_CHAIN (field
))
10447 /* We'd like to look at the type of the field, but we can
10448 easily get infinite recursion. So assume it's pointed
10449 to elsewhere in the tree. Also, ignore things that
10451 if (TREE_CODE (field
) != FIELD_DECL
)
10454 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10455 WALK_SUBTREE (DECL_SIZE (field
));
10456 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10457 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10458 WALK_SUBTREE (DECL_QUALIFIER (field
));
10462 /* Same for scalar types. */
10463 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10464 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10465 || TREE_CODE (*type_p
) == INTEGER_TYPE
10466 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10467 || TREE_CODE (*type_p
) == REAL_TYPE
)
10469 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10470 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10473 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10474 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10479 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10483 /* Walk over all the sub-trees of this operand. */
10484 len
= TREE_OPERAND_LENGTH (*tp
);
10486 /* Go through the subtrees. We need to do this in forward order so
10487 that the scope of a FOR_EXPR is handled properly. */
10490 for (i
= 0; i
< len
- 1; ++i
)
10491 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10492 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10495 /* If this is a type, walk the needed fields in the type. */
10496 else if (TYPE_P (*tp
))
10497 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10501 /* We didn't find what we were looking for. */
10504 #undef WALK_SUBTREE_TAIL
10506 #undef WALK_SUBTREE
10508 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10511 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10515 struct pointer_set_t
*pset
;
10517 pset
= pointer_set_create ();
10518 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10519 pointer_set_destroy (pset
);
10525 tree_block (tree t
)
10527 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10529 if (IS_EXPR_CODE_CLASS (c
))
10530 return &t
->exp
.block
;
10531 gcc_unreachable ();
10535 /* Create a nameless artificial label and put it in the current
10536 function context. The label has a location of LOC. Returns the
10537 newly created label. */
10540 create_artificial_label (location_t loc
)
10542 tree lab
= build_decl (loc
,
10543 LABEL_DECL
, NULL_TREE
, void_type_node
);
10545 DECL_ARTIFICIAL (lab
) = 1;
10546 DECL_IGNORED_P (lab
) = 1;
10547 DECL_CONTEXT (lab
) = current_function_decl
;
10551 /* Given a tree, try to return a useful variable name that we can use
10552 to prefix a temporary that is being assigned the value of the tree.
10553 I.E. given <temp> = &A, return A. */
10558 tree stripped_decl
;
10561 STRIP_NOPS (stripped_decl
);
10562 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10563 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10566 switch (TREE_CODE (stripped_decl
))
10569 return get_name (TREE_OPERAND (stripped_decl
, 0));
10576 /* Return true if TYPE has a variable argument list. */
10579 stdarg_p (const_tree fntype
)
10581 function_args_iterator args_iter
;
10582 tree n
= NULL_TREE
, t
;
10587 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10592 return n
!= NULL_TREE
&& n
!= void_type_node
;
10595 /* Return true if TYPE has a prototype. */
10598 prototype_p (tree fntype
)
10602 gcc_assert (fntype
!= NULL_TREE
);
10604 t
= TYPE_ARG_TYPES (fntype
);
10605 return (t
!= NULL_TREE
);
10608 /* If BLOCK is inlined from an __attribute__((__artificial__))
10609 routine, return pointer to location from where it has been
10612 block_nonartificial_location (tree block
)
10614 location_t
*ret
= NULL
;
10616 while (block
&& TREE_CODE (block
) == BLOCK
10617 && BLOCK_ABSTRACT_ORIGIN (block
))
10619 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10621 while (TREE_CODE (ao
) == BLOCK
10622 && BLOCK_ABSTRACT_ORIGIN (ao
)
10623 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10624 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10626 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10628 /* If AO is an artificial inline, point RET to the
10629 call site locus at which it has been inlined and continue
10630 the loop, in case AO's caller is also an artificial
10632 if (DECL_DECLARED_INLINE_P (ao
)
10633 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10634 ret
= &BLOCK_SOURCE_LOCATION (block
);
10638 else if (TREE_CODE (ao
) != BLOCK
)
10641 block
= BLOCK_SUPERCONTEXT (block
);
10647 /* If EXP is inlined from an __attribute__((__artificial__))
10648 function, return the location of the original call expression. */
10651 tree_nonartificial_location (tree exp
)
10653 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10658 return EXPR_LOCATION (exp
);
10662 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10665 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10668 cl_option_hash_hash (const void *x
)
10670 const_tree
const t
= (const_tree
) x
;
10674 hashval_t hash
= 0;
10676 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10678 p
= (const char *)TREE_OPTIMIZATION (t
);
10679 len
= sizeof (struct cl_optimization
);
10682 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10684 p
= (const char *)TREE_TARGET_OPTION (t
);
10685 len
= sizeof (struct cl_target_option
);
10689 gcc_unreachable ();
10691 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10693 for (i
= 0; i
< len
; i
++)
10695 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10700 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10701 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10705 cl_option_hash_eq (const void *x
, const void *y
)
10707 const_tree
const xt
= (const_tree
) x
;
10708 const_tree
const yt
= (const_tree
) y
;
10713 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10716 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10718 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10719 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10720 len
= sizeof (struct cl_optimization
);
10723 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10725 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10726 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10727 len
= sizeof (struct cl_target_option
);
10731 gcc_unreachable ();
10733 return (memcmp (xp
, yp
, len
) == 0);
10736 /* Build an OPTIMIZATION_NODE based on the current options. */
10739 build_optimization_node (void)
10744 /* Use the cache of optimization nodes. */
10746 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
10749 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10753 /* Insert this one into the hash table. */
10754 t
= cl_optimization_node
;
10757 /* Make a new node for next time round. */
10758 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10764 /* Build a TARGET_OPTION_NODE based on the current options. */
10767 build_target_option_node (void)
10772 /* Use the cache of optimization nodes. */
10774 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
10777 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10781 /* Insert this one into the hash table. */
10782 t
= cl_target_option_node
;
10785 /* Make a new node for next time round. */
10786 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10792 /* Determine the "ultimate origin" of a block. The block may be an inlined
10793 instance of an inlined instance of a block which is local to an inline
10794 function, so we have to trace all of the way back through the origin chain
10795 to find out what sort of node actually served as the original seed for the
10799 block_ultimate_origin (const_tree block
)
10801 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10803 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10804 nodes in the function to point to themselves; ignore that if
10805 we're trying to output the abstract instance of this function. */
10806 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10809 if (immediate_origin
== NULL_TREE
)
10814 tree lookahead
= immediate_origin
;
10818 ret_val
= lookahead
;
10819 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10820 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10822 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10824 /* The block's abstract origin chain may not be the *ultimate* origin of
10825 the block. It could lead to a DECL that has an abstract origin set.
10826 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10827 will give us if it has one). Note that DECL's abstract origins are
10828 supposed to be the most distant ancestor (or so decl_ultimate_origin
10829 claims), so we don't need to loop following the DECL origins. */
10830 if (DECL_P (ret_val
))
10831 return DECL_ORIGIN (ret_val
);
10837 /* Return true if T1 and T2 are equivalent lists. */
10840 list_equal_p (const_tree t1
, const_tree t2
)
10842 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10843 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10848 /* Return true iff conversion in EXP generates no instruction. Mark
10849 it inline so that we fully inline into the stripping functions even
10850 though we have two uses of this function. */
10853 tree_nop_conversion (const_tree exp
)
10855 tree outer_type
, inner_type
;
10857 if (!CONVERT_EXPR_P (exp
)
10858 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10860 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10863 outer_type
= TREE_TYPE (exp
);
10864 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10869 /* Use precision rather then machine mode when we can, which gives
10870 the correct answer even for submode (bit-field) types. */
10871 if ((INTEGRAL_TYPE_P (outer_type
)
10872 || POINTER_TYPE_P (outer_type
)
10873 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10874 && (INTEGRAL_TYPE_P (inner_type
)
10875 || POINTER_TYPE_P (inner_type
)
10876 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10877 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10879 /* Otherwise fall back on comparing machine modes (e.g. for
10880 aggregate types, floats). */
10881 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10884 /* Return true iff conversion in EXP generates no instruction. Don't
10885 consider conversions changing the signedness. */
10888 tree_sign_nop_conversion (const_tree exp
)
10890 tree outer_type
, inner_type
;
10892 if (!tree_nop_conversion (exp
))
10895 outer_type
= TREE_TYPE (exp
);
10896 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10898 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10899 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10902 /* Strip conversions from EXP according to tree_nop_conversion and
10903 return the resulting expression. */
10906 tree_strip_nop_conversions (tree exp
)
10908 while (tree_nop_conversion (exp
))
10909 exp
= TREE_OPERAND (exp
, 0);
10913 /* Strip conversions from EXP according to tree_sign_nop_conversion
10914 and return the resulting expression. */
10917 tree_strip_sign_nop_conversions (tree exp
)
10919 while (tree_sign_nop_conversion (exp
))
10920 exp
= TREE_OPERAND (exp
, 0);
10924 static GTY(()) tree gcc_eh_personality_decl
;
10926 /* Return the GCC personality function decl. */
10929 lhd_gcc_personality (void)
10931 if (!gcc_eh_personality_decl
)
10932 gcc_eh_personality_decl
= build_personality_function ("gcc");
10933 return gcc_eh_personality_decl
;
10936 /* Try to find a base info of BINFO that would have its field decl at offset
10937 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10938 found, return, otherwise return NULL_TREE. */
10941 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
10943 tree type
= BINFO_TYPE (binfo
);
10947 HOST_WIDE_INT pos
, size
;
10951 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
10956 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
10958 if (TREE_CODE (fld
) != FIELD_DECL
)
10961 pos
= int_bit_position (fld
);
10962 size
= tree_low_cst (DECL_SIZE (fld
), 1);
10963 if (pos
<= offset
&& (pos
+ size
) > offset
)
10966 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
10969 if (!DECL_ARTIFICIAL (fld
))
10971 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
10975 /* Offset 0 indicates the primary base, whose vtable contents are
10976 represented in the binfo for the derived class. */
10977 else if (offset
!= 0)
10979 tree base_binfo
, found_binfo
= NULL_TREE
;
10980 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
10981 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
10983 found_binfo
= base_binfo
;
10988 binfo
= found_binfo
;
10991 type
= TREE_TYPE (fld
);
10996 /* Returns true if X is a typedef decl. */
10999 is_typedef_decl (tree x
)
11001 return (x
&& TREE_CODE (x
) == TYPE_DECL
11002 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11005 /* Returns true iff TYPE is a type variant created for a typedef. */
11008 typedef_variant_p (tree type
)
11010 return is_typedef_decl (TYPE_NAME (type
));
11013 /* Warn about a use of an identifier which was marked deprecated. */
11015 warn_deprecated_use (tree node
, tree attr
)
11019 if (node
== 0 || !warn_deprecated_decl
)
11025 attr
= DECL_ATTRIBUTES (node
);
11026 else if (TYPE_P (node
))
11028 tree decl
= TYPE_STUB_DECL (node
);
11030 attr
= lookup_attribute ("deprecated",
11031 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11036 attr
= lookup_attribute ("deprecated", attr
);
11039 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11045 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11047 warning (OPT_Wdeprecated_declarations
,
11048 "%qD is deprecated (declared at %s:%d): %s",
11049 node
, xloc
.file
, xloc
.line
, msg
);
11051 warning (OPT_Wdeprecated_declarations
,
11052 "%qD is deprecated (declared at %s:%d)",
11053 node
, xloc
.file
, xloc
.line
);
11055 else if (TYPE_P (node
))
11057 tree what
= NULL_TREE
;
11058 tree decl
= TYPE_STUB_DECL (node
);
11060 if (TYPE_NAME (node
))
11062 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11063 what
= TYPE_NAME (node
);
11064 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11065 && DECL_NAME (TYPE_NAME (node
)))
11066 what
= DECL_NAME (TYPE_NAME (node
));
11071 expanded_location xloc
11072 = expand_location (DECL_SOURCE_LOCATION (decl
));
11076 warning (OPT_Wdeprecated_declarations
,
11077 "%qE is deprecated (declared at %s:%d): %s",
11078 what
, xloc
.file
, xloc
.line
, msg
);
11080 warning (OPT_Wdeprecated_declarations
,
11081 "%qE is deprecated (declared at %s:%d)", what
,
11082 xloc
.file
, xloc
.line
);
11087 warning (OPT_Wdeprecated_declarations
,
11088 "type is deprecated (declared at %s:%d): %s",
11089 xloc
.file
, xloc
.line
, msg
);
11091 warning (OPT_Wdeprecated_declarations
,
11092 "type is deprecated (declared at %s:%d)",
11093 xloc
.file
, xloc
.line
);
11101 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11104 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11109 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11112 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11118 #include "gt-tree.h"