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 2011 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 /* Record interesting allocation statistics for a tree node with CODE
776 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
777 size_t length ATTRIBUTE_UNUSED
)
779 #ifdef GATHER_STATISTICS
780 enum tree_code_class type
= TREE_CODE_CLASS (code
);
785 case tcc_declaration
: /* A decl node */
789 case tcc_type
: /* a type node */
793 case tcc_statement
: /* an expression with side effects */
797 case tcc_reference
: /* a reference */
801 case tcc_expression
: /* an expression */
802 case tcc_comparison
: /* a comparison expression */
803 case tcc_unary
: /* a unary arithmetic expression */
804 case tcc_binary
: /* a binary arithmetic expression */
808 case tcc_constant
: /* a constant */
812 case tcc_exceptional
: /* something random, like an identifier. */
815 case IDENTIFIER_NODE
:
828 kind
= ssa_name_kind
;
840 kind
= omp_clause_kind
;
857 tree_node_counts
[(int) kind
]++;
858 tree_node_sizes
[(int) kind
] += length
;
862 /* Return a newly allocated node of code CODE. For decl and type
863 nodes, some other fields are initialized. The rest of the node is
864 initialized to zero. This function cannot be used for TREE_VEC or
865 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
867 Achoo! I got a code in the node. */
870 make_node_stat (enum tree_code code MEM_STAT_DECL
)
873 enum tree_code_class type
= TREE_CODE_CLASS (code
);
874 size_t length
= tree_code_size (code
);
876 record_node_allocation_statistics (code
, length
);
878 t
= ggc_alloc_zone_cleared_tree_node_stat (
879 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
880 length PASS_MEM_STAT
);
881 TREE_SET_CODE (t
, code
);
886 TREE_SIDE_EFFECTS (t
) = 1;
889 case tcc_declaration
:
890 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
892 if (code
== FUNCTION_DECL
)
894 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
895 DECL_MODE (t
) = FUNCTION_MODE
;
900 DECL_SOURCE_LOCATION (t
) = input_location
;
901 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
902 DECL_UID (t
) = --next_debug_decl_uid
;
905 DECL_UID (t
) = next_decl_uid
++;
906 SET_DECL_PT_UID (t
, -1);
908 if (TREE_CODE (t
) == LABEL_DECL
)
909 LABEL_DECL_UID (t
) = -1;
914 TYPE_UID (t
) = next_type_uid
++;
915 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
916 TYPE_USER_ALIGN (t
) = 0;
917 TYPE_MAIN_VARIANT (t
) = t
;
918 TYPE_CANONICAL (t
) = t
;
920 /* Default to no attributes for type, but let target change that. */
921 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
922 targetm
.set_default_type_attributes (t
);
924 /* We have not yet computed the alias set for this type. */
925 TYPE_ALIAS_SET (t
) = -1;
929 TREE_CONSTANT (t
) = 1;
938 case PREDECREMENT_EXPR
:
939 case PREINCREMENT_EXPR
:
940 case POSTDECREMENT_EXPR
:
941 case POSTINCREMENT_EXPR
:
942 /* All of these have side-effects, no matter what their
944 TREE_SIDE_EFFECTS (t
) = 1;
953 /* Other classes need no special treatment. */
960 /* Return a new node with the same contents as NODE except that its
961 TREE_CHAIN is zero and it has a fresh uid. */
964 copy_node_stat (tree node MEM_STAT_DECL
)
967 enum tree_code code
= TREE_CODE (node
);
970 gcc_assert (code
!= STATEMENT_LIST
);
972 length
= tree_size (node
);
973 record_node_allocation_statistics (code
, length
);
974 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
975 memcpy (t
, node
, length
);
978 TREE_ASM_WRITTEN (t
) = 0;
979 TREE_VISITED (t
) = 0;
980 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
981 *DECL_VAR_ANN_PTR (t
) = 0;
983 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
985 if (code
== DEBUG_EXPR_DECL
)
986 DECL_UID (t
) = --next_debug_decl_uid
;
989 DECL_UID (t
) = next_decl_uid
++;
990 if (DECL_PT_UID_SET_P (node
))
991 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
993 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
994 && DECL_HAS_VALUE_EXPR_P (node
))
996 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
997 DECL_HAS_VALUE_EXPR_P (t
) = 1;
999 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1001 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1002 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1005 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1007 TYPE_UID (t
) = next_type_uid
++;
1008 /* The following is so that the debug code for
1009 the copy is different from the original type.
1010 The two statements usually duplicate each other
1011 (because they clear fields of the same union),
1012 but the optimizer should catch that. */
1013 TYPE_SYMTAB_POINTER (t
) = 0;
1014 TYPE_SYMTAB_ADDRESS (t
) = 0;
1016 /* Do not copy the values cache. */
1017 if (TYPE_CACHED_VALUES_P(t
))
1019 TYPE_CACHED_VALUES_P (t
) = 0;
1020 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1027 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1028 For example, this can copy a list made of TREE_LIST nodes. */
1031 copy_list (tree list
)
1039 head
= prev
= copy_node (list
);
1040 next
= TREE_CHAIN (list
);
1043 TREE_CHAIN (prev
) = copy_node (next
);
1044 prev
= TREE_CHAIN (prev
);
1045 next
= TREE_CHAIN (next
);
1051 /* Create an INT_CST node with a LOW value sign extended. */
1054 build_int_cst (tree type
, HOST_WIDE_INT low
)
1056 /* Support legacy code. */
1058 type
= integer_type_node
;
1060 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1063 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1064 if it is negative. This function is similar to build_int_cst, but
1065 the extra bits outside of the type precision are cleared. Constants
1066 with these extra bits may confuse the fold so that it detects overflows
1067 even in cases when they do not occur, and in general should be avoided.
1068 We cannot however make this a default behavior of build_int_cst without
1069 more intrusive changes, since there are parts of gcc that rely on the extra
1070 precision of the integer constants. */
1073 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1077 return double_int_to_tree (type
, shwi_to_double_int (low
));
1080 /* Constructs tree in type TYPE from with value given by CST. Signedness
1081 of CST is assumed to be the same as the signedness of TYPE. */
1084 double_int_to_tree (tree type
, double_int cst
)
1086 /* Size types *are* sign extended. */
1087 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1088 || (TREE_CODE (type
) == INTEGER_TYPE
1089 && TYPE_IS_SIZETYPE (type
)));
1091 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1093 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1096 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1097 to be the same as the signedness of TYPE. */
1100 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1102 /* Size types *are* sign extended. */
1103 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1104 || (TREE_CODE (type
) == INTEGER_TYPE
1105 && TYPE_IS_SIZETYPE (type
)));
1108 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1110 return double_int_equal_p (cst
, ext
);
1113 /* We force the double_int CST to the range of the type TYPE by sign or
1114 zero extending it. OVERFLOWABLE indicates if we are interested in
1115 overflow of the value, when >0 we are only interested in signed
1116 overflow, for <0 we are interested in any overflow. OVERFLOWED
1117 indicates whether overflow has already occurred. CONST_OVERFLOWED
1118 indicates whether constant overflow has already occurred. We force
1119 T's value to be within range of T's type (by setting to 0 or 1 all
1120 the bits outside the type's range). We set TREE_OVERFLOWED if,
1121 OVERFLOWED is nonzero,
1122 or OVERFLOWABLE is >0 and signed overflow occurs
1123 or OVERFLOWABLE is <0 and any overflow occurs
1124 We return a new tree node for the extended double_int. The node
1125 is shared if no overflow flags are set. */
1129 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1132 bool sign_extended_type
;
1134 /* Size types *are* sign extended. */
1135 sign_extended_type
= (!TYPE_UNSIGNED (type
)
1136 || (TREE_CODE (type
) == INTEGER_TYPE
1137 && TYPE_IS_SIZETYPE (type
)));
1139 /* If we need to set overflow flags, return a new unshared node. */
1140 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1144 || (overflowable
> 0 && sign_extended_type
))
1146 tree t
= make_node (INTEGER_CST
);
1147 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1148 !sign_extended_type
);
1149 TREE_TYPE (t
) = type
;
1150 TREE_OVERFLOW (t
) = 1;
1155 /* Else build a shared node. */
1156 return double_int_to_tree (type
, cst
);
1159 /* These are the hash table functions for the hash table of INTEGER_CST
1160 nodes of a sizetype. */
1162 /* Return the hash code code X, an INTEGER_CST. */
1165 int_cst_hash_hash (const void *x
)
1167 const_tree
const t
= (const_tree
) x
;
1169 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1170 ^ htab_hash_pointer (TREE_TYPE (t
)));
1173 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1174 is the same as that given by *Y, which is the same. */
1177 int_cst_hash_eq (const void *x
, const void *y
)
1179 const_tree
const xt
= (const_tree
) x
;
1180 const_tree
const yt
= (const_tree
) y
;
1182 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1183 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1184 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1187 /* Create an INT_CST node of TYPE and value HI:LOW.
1188 The returned node is always shared. For small integers we use a
1189 per-type vector cache, for larger ones we use a single hash table. */
1192 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1200 switch (TREE_CODE (type
))
1203 gcc_assert (hi
== 0 && low
== 0);
1207 case REFERENCE_TYPE
:
1208 /* Cache NULL pointer. */
1217 /* Cache false or true. */
1225 if (TYPE_UNSIGNED (type
))
1228 limit
= INTEGER_SHARE_LIMIT
;
1229 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1235 limit
= INTEGER_SHARE_LIMIT
+ 1;
1236 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1238 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1252 /* Look for it in the type's vector of small shared ints. */
1253 if (!TYPE_CACHED_VALUES_P (type
))
1255 TYPE_CACHED_VALUES_P (type
) = 1;
1256 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1259 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1262 /* Make sure no one is clobbering the shared constant. */
1263 gcc_assert (TREE_TYPE (t
) == type
);
1264 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1265 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1269 /* Create a new shared int. */
1270 t
= make_node (INTEGER_CST
);
1272 TREE_INT_CST_LOW (t
) = low
;
1273 TREE_INT_CST_HIGH (t
) = hi
;
1274 TREE_TYPE (t
) = type
;
1276 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1281 /* Use the cache of larger shared ints. */
1284 TREE_INT_CST_LOW (int_cst_node
) = low
;
1285 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1286 TREE_TYPE (int_cst_node
) = type
;
1288 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1292 /* Insert this one into the hash table. */
1295 /* Make a new node for next time round. */
1296 int_cst_node
= make_node (INTEGER_CST
);
1303 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1304 and the rest are zeros. */
1307 build_low_bits_mask (tree type
, unsigned bits
)
1311 gcc_assert (bits
<= TYPE_PRECISION (type
));
1313 if (bits
== TYPE_PRECISION (type
)
1314 && !TYPE_UNSIGNED (type
))
1315 /* Sign extended all-ones mask. */
1316 mask
= double_int_minus_one
;
1318 mask
= double_int_mask (bits
);
1320 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1323 /* Checks that X is integer constant that can be expressed in (unsigned)
1324 HOST_WIDE_INT without loss of precision. */
1327 cst_and_fits_in_hwi (const_tree x
)
1329 if (TREE_CODE (x
) != INTEGER_CST
)
1332 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1335 return (TREE_INT_CST_HIGH (x
) == 0
1336 || TREE_INT_CST_HIGH (x
) == -1);
1339 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1340 are in a list pointed to by VALS. */
1343 build_vector (tree type
, tree vals
)
1345 tree v
= make_node (VECTOR_CST
);
1350 TREE_VECTOR_CST_ELTS (v
) = vals
;
1351 TREE_TYPE (v
) = type
;
1353 /* Iterate through elements and check for overflow. */
1354 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1356 tree value
= TREE_VALUE (link
);
1359 /* Don't crash if we get an address constant. */
1360 if (!CONSTANT_CLASS_P (value
))
1363 over
|= TREE_OVERFLOW (value
);
1366 gcc_assert (cnt
== TYPE_VECTOR_SUBPARTS (type
));
1368 TREE_OVERFLOW (v
) = over
;
1372 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1373 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1376 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1378 tree list
= NULL_TREE
;
1379 unsigned HOST_WIDE_INT idx
;
1382 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1383 list
= tree_cons (NULL_TREE
, value
, list
);
1384 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1385 list
= tree_cons (NULL_TREE
,
1386 build_zero_cst (TREE_TYPE (type
)), list
);
1387 return build_vector (type
, nreverse (list
));
1390 /* Build a vector of type VECTYPE where all the elements are SCs. */
1392 build_vector_from_val (tree vectype
, tree sc
)
1394 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1395 VEC(constructor_elt
, gc
) *v
= NULL
;
1397 if (sc
== error_mark_node
)
1400 /* Verify that the vector type is suitable for SC. Note that there
1401 is some inconsistency in the type-system with respect to restrict
1402 qualifications of pointers. Vector types always have a main-variant
1403 element type and the qualification is applied to the vector-type.
1404 So TREE_TYPE (vector-type) does not return a properly qualified
1405 vector element-type. */
1406 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1407 TREE_TYPE (vectype
)));
1409 v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1410 for (i
= 0; i
< nunits
; ++i
)
1411 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1413 if (CONSTANT_CLASS_P (sc
))
1414 return build_vector_from_ctor (vectype
, v
);
1416 return build_constructor (vectype
, v
);
1419 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1420 are in the VEC pointed to by VALS. */
1422 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1424 tree c
= make_node (CONSTRUCTOR
);
1426 constructor_elt
*elt
;
1427 bool constant_p
= true;
1429 TREE_TYPE (c
) = type
;
1430 CONSTRUCTOR_ELTS (c
) = vals
;
1432 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1433 if (!TREE_CONSTANT (elt
->value
))
1439 TREE_CONSTANT (c
) = constant_p
;
1444 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1447 build_constructor_single (tree type
, tree index
, tree value
)
1449 VEC(constructor_elt
,gc
) *v
;
1450 constructor_elt
*elt
;
1452 v
= VEC_alloc (constructor_elt
, gc
, 1);
1453 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1457 return build_constructor (type
, v
);
1461 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1462 are in a list pointed to by VALS. */
1464 build_constructor_from_list (tree type
, tree vals
)
1467 VEC(constructor_elt
,gc
) *v
= NULL
;
1471 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1472 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1473 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1476 return build_constructor (type
, v
);
1479 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1482 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1485 FIXED_VALUE_TYPE
*fp
;
1487 v
= make_node (FIXED_CST
);
1488 fp
= ggc_alloc_fixed_value ();
1489 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1491 TREE_TYPE (v
) = type
;
1492 TREE_FIXED_CST_PTR (v
) = fp
;
1496 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1499 build_real (tree type
, REAL_VALUE_TYPE d
)
1502 REAL_VALUE_TYPE
*dp
;
1505 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1506 Consider doing it via real_convert now. */
1508 v
= make_node (REAL_CST
);
1509 dp
= ggc_alloc_real_value ();
1510 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1512 TREE_TYPE (v
) = type
;
1513 TREE_REAL_CST_PTR (v
) = dp
;
1514 TREE_OVERFLOW (v
) = overflow
;
1518 /* Return a new REAL_CST node whose type is TYPE
1519 and whose value is the integer value of the INTEGER_CST node I. */
1522 real_value_from_int_cst (const_tree type
, const_tree i
)
1526 /* Clear all bits of the real value type so that we can later do
1527 bitwise comparisons to see if two values are the same. */
1528 memset (&d
, 0, sizeof d
);
1530 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1531 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1532 TYPE_UNSIGNED (TREE_TYPE (i
)));
1536 /* Given a tree representing an integer constant I, return a tree
1537 representing the same value as a floating-point constant of type TYPE. */
1540 build_real_from_int_cst (tree type
, const_tree i
)
1543 int overflow
= TREE_OVERFLOW (i
);
1545 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1547 TREE_OVERFLOW (v
) |= overflow
;
1551 /* Return a newly constructed STRING_CST node whose value is
1552 the LEN characters at STR.
1553 The TREE_TYPE is not initialized. */
1556 build_string (int len
, const char *str
)
1561 /* Do not waste bytes provided by padding of struct tree_string. */
1562 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1564 record_node_allocation_statistics (STRING_CST
, length
);
1566 s
= ggc_alloc_tree_node (length
);
1568 memset (s
, 0, sizeof (struct tree_common
));
1569 TREE_SET_CODE (s
, STRING_CST
);
1570 TREE_CONSTANT (s
) = 1;
1571 TREE_STRING_LENGTH (s
) = len
;
1572 memcpy (s
->string
.str
, str
, len
);
1573 s
->string
.str
[len
] = '\0';
1578 /* Return a newly constructed COMPLEX_CST node whose value is
1579 specified by the real and imaginary parts REAL and IMAG.
1580 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1581 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1584 build_complex (tree type
, tree real
, tree imag
)
1586 tree t
= make_node (COMPLEX_CST
);
1588 TREE_REALPART (t
) = real
;
1589 TREE_IMAGPART (t
) = imag
;
1590 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1591 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1595 /* Return a constant of arithmetic type TYPE which is the
1596 multiplicative identity of the set TYPE. */
1599 build_one_cst (tree type
)
1601 switch (TREE_CODE (type
))
1603 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1604 case POINTER_TYPE
: case REFERENCE_TYPE
:
1606 return build_int_cst (type
, 1);
1609 return build_real (type
, dconst1
);
1611 case FIXED_POINT_TYPE
:
1612 /* We can only generate 1 for accum types. */
1613 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1614 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1618 tree scalar
= build_one_cst (TREE_TYPE (type
));
1620 return build_vector_from_val (type
, scalar
);
1624 return build_complex (type
,
1625 build_one_cst (TREE_TYPE (type
)),
1626 build_zero_cst (TREE_TYPE (type
)));
1633 /* Build 0 constant of type TYPE. This is used by constructor folding
1634 and thus the constant should be represented in memory by
1638 build_zero_cst (tree type
)
1640 switch (TREE_CODE (type
))
1642 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1643 case POINTER_TYPE
: case REFERENCE_TYPE
:
1645 return build_int_cst (type
, 0);
1648 return build_real (type
, dconst0
);
1650 case FIXED_POINT_TYPE
:
1651 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1655 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1657 return build_vector_from_val (type
, scalar
);
1662 tree zero
= build_zero_cst (TREE_TYPE (type
));
1664 return build_complex (type
, zero
, zero
);
1668 if (!AGGREGATE_TYPE_P (type
))
1669 return fold_convert (type
, integer_zero_node
);
1670 return build_constructor (type
, NULL
);
1675 /* Build a BINFO with LEN language slots. */
1678 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1681 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1682 + VEC_embedded_size (tree
, base_binfos
));
1684 record_node_allocation_statistics (TREE_BINFO
, length
);
1686 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1688 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1690 TREE_SET_CODE (t
, TREE_BINFO
);
1692 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1698 /* Build a newly constructed TREE_VEC node of length LEN. */
1701 make_tree_vec_stat (int len MEM_STAT_DECL
)
1704 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1706 record_node_allocation_statistics (TREE_VEC
, length
);
1708 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1710 TREE_SET_CODE (t
, TREE_VEC
);
1711 TREE_VEC_LENGTH (t
) = len
;
1716 /* Return 1 if EXPR is the integer constant zero or a complex constant
1720 integer_zerop (const_tree expr
)
1724 return ((TREE_CODE (expr
) == INTEGER_CST
1725 && TREE_INT_CST_LOW (expr
) == 0
1726 && TREE_INT_CST_HIGH (expr
) == 0)
1727 || (TREE_CODE (expr
) == COMPLEX_CST
1728 && integer_zerop (TREE_REALPART (expr
))
1729 && integer_zerop (TREE_IMAGPART (expr
))));
1732 /* Return 1 if EXPR is the integer constant one or the corresponding
1733 complex constant. */
1736 integer_onep (const_tree expr
)
1740 return ((TREE_CODE (expr
) == INTEGER_CST
1741 && TREE_INT_CST_LOW (expr
) == 1
1742 && TREE_INT_CST_HIGH (expr
) == 0)
1743 || (TREE_CODE (expr
) == COMPLEX_CST
1744 && integer_onep (TREE_REALPART (expr
))
1745 && integer_zerop (TREE_IMAGPART (expr
))));
1748 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1749 it contains. Likewise for the corresponding complex constant. */
1752 integer_all_onesp (const_tree expr
)
1759 if (TREE_CODE (expr
) == COMPLEX_CST
1760 && integer_all_onesp (TREE_REALPART (expr
))
1761 && integer_zerop (TREE_IMAGPART (expr
)))
1764 else if (TREE_CODE (expr
) != INTEGER_CST
)
1767 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1768 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1769 && TREE_INT_CST_HIGH (expr
) == -1)
1774 /* Note that using TYPE_PRECISION here is wrong. We care about the
1775 actual bits, not the (arbitrary) range of the type. */
1776 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1777 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1779 HOST_WIDE_INT high_value
;
1782 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1784 /* Can not handle precisions greater than twice the host int size. */
1785 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1786 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1787 /* Shifting by the host word size is undefined according to the ANSI
1788 standard, so we must handle this as a special case. */
1791 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1793 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1794 && TREE_INT_CST_HIGH (expr
) == high_value
);
1797 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1800 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1804 integer_pow2p (const_tree expr
)
1807 HOST_WIDE_INT high
, low
;
1811 if (TREE_CODE (expr
) == COMPLEX_CST
1812 && integer_pow2p (TREE_REALPART (expr
))
1813 && integer_zerop (TREE_IMAGPART (expr
)))
1816 if (TREE_CODE (expr
) != INTEGER_CST
)
1819 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1820 high
= TREE_INT_CST_HIGH (expr
);
1821 low
= TREE_INT_CST_LOW (expr
);
1823 /* First clear all bits that are beyond the type's precision in case
1824 we've been sign extended. */
1826 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1828 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1829 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1833 if (prec
< HOST_BITS_PER_WIDE_INT
)
1834 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1837 if (high
== 0 && low
== 0)
1840 return ((high
== 0 && (low
& (low
- 1)) == 0)
1841 || (low
== 0 && (high
& (high
- 1)) == 0));
1844 /* Return 1 if EXPR is an integer constant other than zero or a
1845 complex constant other than zero. */
1848 integer_nonzerop (const_tree expr
)
1852 return ((TREE_CODE (expr
) == INTEGER_CST
1853 && (TREE_INT_CST_LOW (expr
) != 0
1854 || TREE_INT_CST_HIGH (expr
) != 0))
1855 || (TREE_CODE (expr
) == COMPLEX_CST
1856 && (integer_nonzerop (TREE_REALPART (expr
))
1857 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1860 /* Return 1 if EXPR is the fixed-point constant zero. */
1863 fixed_zerop (const_tree expr
)
1865 return (TREE_CODE (expr
) == FIXED_CST
1866 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1869 /* Return the power of two represented by a tree node known to be a
1873 tree_log2 (const_tree expr
)
1876 HOST_WIDE_INT high
, low
;
1880 if (TREE_CODE (expr
) == COMPLEX_CST
)
1881 return tree_log2 (TREE_REALPART (expr
));
1883 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1884 high
= TREE_INT_CST_HIGH (expr
);
1885 low
= TREE_INT_CST_LOW (expr
);
1887 /* First clear all bits that are beyond the type's precision in case
1888 we've been sign extended. */
1890 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1892 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1893 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1897 if (prec
< HOST_BITS_PER_WIDE_INT
)
1898 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1901 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1902 : exact_log2 (low
));
1905 /* Similar, but return the largest integer Y such that 2 ** Y is less
1906 than or equal to EXPR. */
1909 tree_floor_log2 (const_tree expr
)
1912 HOST_WIDE_INT high
, low
;
1916 if (TREE_CODE (expr
) == COMPLEX_CST
)
1917 return tree_log2 (TREE_REALPART (expr
));
1919 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1920 high
= TREE_INT_CST_HIGH (expr
);
1921 low
= TREE_INT_CST_LOW (expr
);
1923 /* First clear all bits that are beyond the type's precision in case
1924 we've been sign extended. Ignore if type's precision hasn't been set
1925 since what we are doing is setting it. */
1927 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1929 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1930 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1934 if (prec
< HOST_BITS_PER_WIDE_INT
)
1935 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1938 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1939 : floor_log2 (low
));
1942 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1943 decimal float constants, so don't return 1 for them. */
1946 real_zerop (const_tree expr
)
1950 return ((TREE_CODE (expr
) == REAL_CST
1951 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1952 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1953 || (TREE_CODE (expr
) == COMPLEX_CST
1954 && real_zerop (TREE_REALPART (expr
))
1955 && real_zerop (TREE_IMAGPART (expr
))));
1958 /* Return 1 if EXPR is the real constant one in real or complex form.
1959 Trailing zeroes matter for decimal float constants, so don't return
1963 real_onep (const_tree expr
)
1967 return ((TREE_CODE (expr
) == REAL_CST
1968 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1969 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1970 || (TREE_CODE (expr
) == COMPLEX_CST
1971 && real_onep (TREE_REALPART (expr
))
1972 && real_zerop (TREE_IMAGPART (expr
))));
1975 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1976 for decimal float constants, so don't return 1 for them. */
1979 real_twop (const_tree expr
)
1983 return ((TREE_CODE (expr
) == REAL_CST
1984 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1985 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1986 || (TREE_CODE (expr
) == COMPLEX_CST
1987 && real_twop (TREE_REALPART (expr
))
1988 && real_zerop (TREE_IMAGPART (expr
))));
1991 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1992 matter for decimal float constants, so don't return 1 for them. */
1995 real_minus_onep (const_tree expr
)
1999 return ((TREE_CODE (expr
) == REAL_CST
2000 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2001 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2002 || (TREE_CODE (expr
) == COMPLEX_CST
2003 && real_minus_onep (TREE_REALPART (expr
))
2004 && real_zerop (TREE_IMAGPART (expr
))));
2007 /* Nonzero if EXP is a constant or a cast of a constant. */
2010 really_constant_p (const_tree exp
)
2012 /* This is not quite the same as STRIP_NOPS. It does more. */
2013 while (CONVERT_EXPR_P (exp
)
2014 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2015 exp
= TREE_OPERAND (exp
, 0);
2016 return TREE_CONSTANT (exp
);
2019 /* Return first list element whose TREE_VALUE is ELEM.
2020 Return 0 if ELEM is not in LIST. */
2023 value_member (tree elem
, tree list
)
2027 if (elem
== TREE_VALUE (list
))
2029 list
= TREE_CHAIN (list
);
2034 /* Return first list element whose TREE_PURPOSE is ELEM.
2035 Return 0 if ELEM is not in LIST. */
2038 purpose_member (const_tree elem
, tree list
)
2042 if (elem
== TREE_PURPOSE (list
))
2044 list
= TREE_CHAIN (list
);
2049 /* Return true if ELEM is in V. */
2052 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2056 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2062 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2066 chain_index (int idx
, tree chain
)
2068 for (; chain
&& idx
> 0; --idx
)
2069 chain
= TREE_CHAIN (chain
);
2073 /* Return nonzero if ELEM is part of the chain CHAIN. */
2076 chain_member (const_tree elem
, const_tree chain
)
2082 chain
= DECL_CHAIN (chain
);
2088 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2089 We expect a null pointer to mark the end of the chain.
2090 This is the Lisp primitive `length'. */
2093 list_length (const_tree t
)
2096 #ifdef ENABLE_TREE_CHECKING
2104 #ifdef ENABLE_TREE_CHECKING
2107 gcc_assert (p
!= q
);
2115 /* Returns the number of FIELD_DECLs in TYPE. */
2118 fields_length (const_tree type
)
2120 tree t
= TYPE_FIELDS (type
);
2123 for (; t
; t
= DECL_CHAIN (t
))
2124 if (TREE_CODE (t
) == FIELD_DECL
)
2130 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2131 UNION_TYPE TYPE, or NULL_TREE if none. */
2134 first_field (const_tree type
)
2136 tree t
= TYPE_FIELDS (type
);
2137 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2142 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2143 by modifying the last node in chain 1 to point to chain 2.
2144 This is the Lisp primitive `nconc'. */
2147 chainon (tree op1
, tree op2
)
2156 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2158 TREE_CHAIN (t1
) = op2
;
2160 #ifdef ENABLE_TREE_CHECKING
2163 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2164 gcc_assert (t2
!= t1
);
2171 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2174 tree_last (tree chain
)
2178 while ((next
= TREE_CHAIN (chain
)))
2183 /* Reverse the order of elements in the chain T,
2184 and return the new head of the chain (old last element). */
2189 tree prev
= 0, decl
, next
;
2190 for (decl
= t
; decl
; decl
= next
)
2192 /* We shouldn't be using this function to reverse BLOCK chains; we
2193 have blocks_nreverse for that. */
2194 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2195 next
= TREE_CHAIN (decl
);
2196 TREE_CHAIN (decl
) = prev
;
2202 /* Return a newly created TREE_LIST node whose
2203 purpose and value fields are PARM and VALUE. */
2206 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2208 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2209 TREE_PURPOSE (t
) = parm
;
2210 TREE_VALUE (t
) = value
;
2214 /* Build a chain of TREE_LIST nodes from a vector. */
2217 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2219 tree ret
= NULL_TREE
;
2223 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2225 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2226 pp
= &TREE_CHAIN (*pp
);
2231 /* Return a newly created TREE_LIST node whose
2232 purpose and value fields are PURPOSE and VALUE
2233 and whose TREE_CHAIN is CHAIN. */
2236 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2240 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2242 memset (node
, 0, sizeof (struct tree_common
));
2244 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2246 TREE_SET_CODE (node
, TREE_LIST
);
2247 TREE_CHAIN (node
) = chain
;
2248 TREE_PURPOSE (node
) = purpose
;
2249 TREE_VALUE (node
) = value
;
2253 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2257 ctor_to_vec (tree ctor
)
2259 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2263 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2264 VEC_quick_push (tree
, vec
, val
);
2269 /* Return the size nominally occupied by an object of type TYPE
2270 when it resides in memory. The value is measured in units of bytes,
2271 and its data type is that normally used for type sizes
2272 (which is the first type created by make_signed_type or
2273 make_unsigned_type). */
2276 size_in_bytes (const_tree type
)
2280 if (type
== error_mark_node
)
2281 return integer_zero_node
;
2283 type
= TYPE_MAIN_VARIANT (type
);
2284 t
= TYPE_SIZE_UNIT (type
);
2288 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2289 return size_zero_node
;
2295 /* Return the size of TYPE (in bytes) as a wide integer
2296 or return -1 if the size can vary or is larger than an integer. */
2299 int_size_in_bytes (const_tree type
)
2303 if (type
== error_mark_node
)
2306 type
= TYPE_MAIN_VARIANT (type
);
2307 t
= TYPE_SIZE_UNIT (type
);
2309 || TREE_CODE (t
) != INTEGER_CST
2310 || TREE_INT_CST_HIGH (t
) != 0
2311 /* If the result would appear negative, it's too big to represent. */
2312 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2315 return TREE_INT_CST_LOW (t
);
2318 /* Return the maximum size of TYPE (in bytes) as a wide integer
2319 or return -1 if the size can vary or is larger than an integer. */
2322 max_int_size_in_bytes (const_tree type
)
2324 HOST_WIDE_INT size
= -1;
2327 /* If this is an array type, check for a possible MAX_SIZE attached. */
2329 if (TREE_CODE (type
) == ARRAY_TYPE
)
2331 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2333 if (size_tree
&& host_integerp (size_tree
, 1))
2334 size
= tree_low_cst (size_tree
, 1);
2337 /* If we still haven't been able to get a size, see if the language
2338 can compute a maximum size. */
2342 size_tree
= lang_hooks
.types
.max_size (type
);
2344 if (size_tree
&& host_integerp (size_tree
, 1))
2345 size
= tree_low_cst (size_tree
, 1);
2351 /* Returns a tree for the size of EXP in bytes. */
2354 tree_expr_size (const_tree exp
)
2357 && DECL_SIZE_UNIT (exp
) != 0)
2358 return DECL_SIZE_UNIT (exp
);
2360 return size_in_bytes (TREE_TYPE (exp
));
2363 /* Return the bit position of FIELD, in bits from the start of the record.
2364 This is a tree of type bitsizetype. */
2367 bit_position (const_tree field
)
2369 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2370 DECL_FIELD_BIT_OFFSET (field
));
2373 /* Likewise, but return as an integer. It must be representable in
2374 that way (since it could be a signed value, we don't have the
2375 option of returning -1 like int_size_in_byte can. */
2378 int_bit_position (const_tree field
)
2380 return tree_low_cst (bit_position (field
), 0);
2383 /* Return the byte position of FIELD, in bytes from the start of the record.
2384 This is a tree of type sizetype. */
2387 byte_position (const_tree field
)
2389 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2390 DECL_FIELD_BIT_OFFSET (field
));
2393 /* Likewise, but return as an integer. It must be representable in
2394 that way (since it could be a signed value, we don't have the
2395 option of returning -1 like int_size_in_byte can. */
2398 int_byte_position (const_tree field
)
2400 return tree_low_cst (byte_position (field
), 0);
2403 /* Return the strictest alignment, in bits, that T is known to have. */
2406 expr_align (const_tree t
)
2408 unsigned int align0
, align1
;
2410 switch (TREE_CODE (t
))
2412 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2413 /* If we have conversions, we know that the alignment of the
2414 object must meet each of the alignments of the types. */
2415 align0
= expr_align (TREE_OPERAND (t
, 0));
2416 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2417 return MAX (align0
, align1
);
2419 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2420 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2421 case CLEANUP_POINT_EXPR
:
2422 /* These don't change the alignment of an object. */
2423 return expr_align (TREE_OPERAND (t
, 0));
2426 /* The best we can do is say that the alignment is the least aligned
2428 align0
= expr_align (TREE_OPERAND (t
, 1));
2429 align1
= expr_align (TREE_OPERAND (t
, 2));
2430 return MIN (align0
, align1
);
2432 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2433 meaningfully, it's always 1. */
2434 case LABEL_DECL
: case CONST_DECL
:
2435 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2437 gcc_assert (DECL_ALIGN (t
) != 0);
2438 return DECL_ALIGN (t
);
2444 /* Otherwise take the alignment from that of the type. */
2445 return TYPE_ALIGN (TREE_TYPE (t
));
2448 /* Return, as a tree node, the number of elements for TYPE (which is an
2449 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2452 array_type_nelts (const_tree type
)
2454 tree index_type
, min
, max
;
2456 /* If they did it with unspecified bounds, then we should have already
2457 given an error about it before we got here. */
2458 if (! TYPE_DOMAIN (type
))
2459 return error_mark_node
;
2461 index_type
= TYPE_DOMAIN (type
);
2462 min
= TYPE_MIN_VALUE (index_type
);
2463 max
= TYPE_MAX_VALUE (index_type
);
2465 return (integer_zerop (min
)
2467 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2470 /* If arg is static -- a reference to an object in static storage -- then
2471 return the object. This is not the same as the C meaning of `static'.
2472 If arg isn't static, return NULL. */
2477 switch (TREE_CODE (arg
))
2480 /* Nested functions are static, even though taking their address will
2481 involve a trampoline as we unnest the nested function and create
2482 the trampoline on the tree level. */
2486 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2487 && ! DECL_THREAD_LOCAL_P (arg
)
2488 && ! DECL_DLLIMPORT_P (arg
)
2492 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2496 return TREE_STATIC (arg
) ? arg
: NULL
;
2503 /* If the thing being referenced is not a field, then it is
2504 something language specific. */
2505 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2507 /* If we are referencing a bitfield, we can't evaluate an
2508 ADDR_EXPR at compile time and so it isn't a constant. */
2509 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2512 return staticp (TREE_OPERAND (arg
, 0));
2518 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2521 case ARRAY_RANGE_REF
:
2522 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2523 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2524 return staticp (TREE_OPERAND (arg
, 0));
2528 case COMPOUND_LITERAL_EXPR
:
2529 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2539 /* Return whether OP is a DECL whose address is function-invariant. */
2542 decl_address_invariant_p (const_tree op
)
2544 /* The conditions below are slightly less strict than the one in
2547 switch (TREE_CODE (op
))
2556 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2557 || DECL_THREAD_LOCAL_P (op
)
2558 || DECL_CONTEXT (op
) == current_function_decl
2559 || decl_function_context (op
) == current_function_decl
)
2564 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2565 || decl_function_context (op
) == current_function_decl
)
2576 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2579 decl_address_ip_invariant_p (const_tree op
)
2581 /* The conditions below are slightly less strict than the one in
2584 switch (TREE_CODE (op
))
2592 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2593 && !DECL_DLLIMPORT_P (op
))
2594 || DECL_THREAD_LOCAL_P (op
))
2599 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2611 /* Return true if T is function-invariant (internal function, does
2612 not handle arithmetic; that's handled in skip_simple_arithmetic and
2613 tree_invariant_p). */
2615 static bool tree_invariant_p (tree t
);
2618 tree_invariant_p_1 (tree t
)
2622 if (TREE_CONSTANT (t
)
2623 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2626 switch (TREE_CODE (t
))
2632 op
= TREE_OPERAND (t
, 0);
2633 while (handled_component_p (op
))
2635 switch (TREE_CODE (op
))
2638 case ARRAY_RANGE_REF
:
2639 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2640 || TREE_OPERAND (op
, 2) != NULL_TREE
2641 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2646 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2652 op
= TREE_OPERAND (op
, 0);
2655 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2664 /* Return true if T is function-invariant. */
2667 tree_invariant_p (tree t
)
2669 tree inner
= skip_simple_arithmetic (t
);
2670 return tree_invariant_p_1 (inner
);
2673 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2674 Do this to any expression which may be used in more than one place,
2675 but must be evaluated only once.
2677 Normally, expand_expr would reevaluate the expression each time.
2678 Calling save_expr produces something that is evaluated and recorded
2679 the first time expand_expr is called on it. Subsequent calls to
2680 expand_expr just reuse the recorded value.
2682 The call to expand_expr that generates code that actually computes
2683 the value is the first call *at compile time*. Subsequent calls
2684 *at compile time* generate code to use the saved value.
2685 This produces correct result provided that *at run time* control
2686 always flows through the insns made by the first expand_expr
2687 before reaching the other places where the save_expr was evaluated.
2688 You, the caller of save_expr, must make sure this is so.
2690 Constants, and certain read-only nodes, are returned with no
2691 SAVE_EXPR because that is safe. Expressions containing placeholders
2692 are not touched; see tree.def for an explanation of what these
2696 save_expr (tree expr
)
2698 tree t
= fold (expr
);
2701 /* If the tree evaluates to a constant, then we don't want to hide that
2702 fact (i.e. this allows further folding, and direct checks for constants).
2703 However, a read-only object that has side effects cannot be bypassed.
2704 Since it is no problem to reevaluate literals, we just return the
2706 inner
= skip_simple_arithmetic (t
);
2707 if (TREE_CODE (inner
) == ERROR_MARK
)
2710 if (tree_invariant_p_1 (inner
))
2713 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2714 it means that the size or offset of some field of an object depends on
2715 the value within another field.
2717 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2718 and some variable since it would then need to be both evaluated once and
2719 evaluated more than once. Front-ends must assure this case cannot
2720 happen by surrounding any such subexpressions in their own SAVE_EXPR
2721 and forcing evaluation at the proper time. */
2722 if (contains_placeholder_p (inner
))
2725 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2726 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2728 /* This expression might be placed ahead of a jump to ensure that the
2729 value was computed on both sides of the jump. So make sure it isn't
2730 eliminated as dead. */
2731 TREE_SIDE_EFFECTS (t
) = 1;
2735 /* Look inside EXPR and into any simple arithmetic operations. Return
2736 the innermost non-arithmetic node. */
2739 skip_simple_arithmetic (tree expr
)
2743 /* We don't care about whether this can be used as an lvalue in this
2745 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2746 expr
= TREE_OPERAND (expr
, 0);
2748 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2749 a constant, it will be more efficient to not make another SAVE_EXPR since
2750 it will allow better simplification and GCSE will be able to merge the
2751 computations if they actually occur. */
2755 if (UNARY_CLASS_P (inner
))
2756 inner
= TREE_OPERAND (inner
, 0);
2757 else if (BINARY_CLASS_P (inner
))
2759 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2760 inner
= TREE_OPERAND (inner
, 0);
2761 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2762 inner
= TREE_OPERAND (inner
, 1);
2774 /* Return which tree structure is used by T. */
2776 enum tree_node_structure_enum
2777 tree_node_structure (const_tree t
)
2779 const enum tree_code code
= TREE_CODE (t
);
2780 return tree_node_structure_for_code (code
);
2783 /* Set various status flags when building a CALL_EXPR object T. */
2786 process_call_operands (tree t
)
2788 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2789 bool read_only
= false;
2790 int i
= call_expr_flags (t
);
2792 /* Calls have side-effects, except those to const or pure functions. */
2793 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2794 side_effects
= true;
2795 /* Propagate TREE_READONLY of arguments for const functions. */
2799 if (!side_effects
|| read_only
)
2800 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2802 tree op
= TREE_OPERAND (t
, i
);
2803 if (op
&& TREE_SIDE_EFFECTS (op
))
2804 side_effects
= true;
2805 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2809 TREE_SIDE_EFFECTS (t
) = side_effects
;
2810 TREE_READONLY (t
) = read_only
;
2813 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2814 size or offset that depends on a field within a record. */
2817 contains_placeholder_p (const_tree exp
)
2819 enum tree_code code
;
2824 code
= TREE_CODE (exp
);
2825 if (code
== PLACEHOLDER_EXPR
)
2828 switch (TREE_CODE_CLASS (code
))
2831 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2832 position computations since they will be converted into a
2833 WITH_RECORD_EXPR involving the reference, which will assume
2834 here will be valid. */
2835 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2837 case tcc_exceptional
:
2838 if (code
== TREE_LIST
)
2839 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2840 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2845 case tcc_comparison
:
2846 case tcc_expression
:
2850 /* Ignoring the first operand isn't quite right, but works best. */
2851 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2854 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2855 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2856 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2859 /* The save_expr function never wraps anything containing
2860 a PLACEHOLDER_EXPR. */
2867 switch (TREE_CODE_LENGTH (code
))
2870 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2872 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2873 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2884 const_call_expr_arg_iterator iter
;
2885 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2886 if (CONTAINS_PLACEHOLDER_P (arg
))
2900 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2901 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2905 type_contains_placeholder_1 (const_tree type
)
2907 /* If the size contains a placeholder or the parent type (component type in
2908 the case of arrays) type involves a placeholder, this type does. */
2909 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2910 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2911 || (!POINTER_TYPE_P (type
)
2913 && type_contains_placeholder_p (TREE_TYPE (type
))))
2916 /* Now do type-specific checks. Note that the last part of the check above
2917 greatly limits what we have to do below. */
2918 switch (TREE_CODE (type
))
2926 case REFERENCE_TYPE
:
2934 case FIXED_POINT_TYPE
:
2935 /* Here we just check the bounds. */
2936 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2937 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2940 /* We have already checked the component type above, so just check the
2942 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2946 case QUAL_UNION_TYPE
:
2950 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2951 if (TREE_CODE (field
) == FIELD_DECL
2952 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2953 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2954 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2955 || type_contains_placeholder_p (TREE_TYPE (field
))))
2966 /* Wrapper around above function used to cache its result. */
2969 type_contains_placeholder_p (tree type
)
2973 /* If the contains_placeholder_bits field has been initialized,
2974 then we know the answer. */
2975 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2976 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2978 /* Indicate that we've seen this type node, and the answer is false.
2979 This is what we want to return if we run into recursion via fields. */
2980 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2982 /* Compute the real value. */
2983 result
= type_contains_placeholder_1 (type
);
2985 /* Store the real value. */
2986 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2991 /* Push tree EXP onto vector QUEUE if it is not already present. */
2994 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2999 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
3000 if (simple_cst_equal (iter
, exp
) == 1)
3004 VEC_safe_push (tree
, heap
, *queue
, exp
);
3007 /* Given a tree EXP, find all occurences of references to fields
3008 in a PLACEHOLDER_EXPR and place them in vector REFS without
3009 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3010 we assume here that EXP contains only arithmetic expressions
3011 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3015 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3017 enum tree_code code
= TREE_CODE (exp
);
3021 /* We handle TREE_LIST and COMPONENT_REF separately. */
3022 if (code
== TREE_LIST
)
3024 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3025 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3027 else if (code
== COMPONENT_REF
)
3029 for (inner
= TREE_OPERAND (exp
, 0);
3030 REFERENCE_CLASS_P (inner
);
3031 inner
= TREE_OPERAND (inner
, 0))
3034 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3035 push_without_duplicates (exp
, refs
);
3037 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3040 switch (TREE_CODE_CLASS (code
))
3045 case tcc_declaration
:
3046 /* Variables allocated to static storage can stay. */
3047 if (!TREE_STATIC (exp
))
3048 push_without_duplicates (exp
, refs
);
3051 case tcc_expression
:
3052 /* This is the pattern built in ada/make_aligning_type. */
3053 if (code
== ADDR_EXPR
3054 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3056 push_without_duplicates (exp
, refs
);
3060 /* Fall through... */
3062 case tcc_exceptional
:
3065 case tcc_comparison
:
3067 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3068 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3072 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3073 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3081 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3082 return a tree with all occurrences of references to F in a
3083 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3084 CONST_DECLs. Note that we assume here that EXP contains only
3085 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3086 occurring only in their argument list. */
3089 substitute_in_expr (tree exp
, tree f
, tree r
)
3091 enum tree_code code
= TREE_CODE (exp
);
3092 tree op0
, op1
, op2
, op3
;
3095 /* We handle TREE_LIST and COMPONENT_REF separately. */
3096 if (code
== TREE_LIST
)
3098 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3099 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3100 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3103 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3105 else if (code
== COMPONENT_REF
)
3109 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3110 and it is the right field, replace it with R. */
3111 for (inner
= TREE_OPERAND (exp
, 0);
3112 REFERENCE_CLASS_P (inner
);
3113 inner
= TREE_OPERAND (inner
, 0))
3117 op1
= TREE_OPERAND (exp
, 1);
3119 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3122 /* If this expression hasn't been completed let, leave it alone. */
3123 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3126 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3127 if (op0
== TREE_OPERAND (exp
, 0))
3131 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3134 switch (TREE_CODE_CLASS (code
))
3139 case tcc_declaration
:
3145 case tcc_expression
:
3149 /* Fall through... */
3151 case tcc_exceptional
:
3154 case tcc_comparison
:
3156 switch (TREE_CODE_LENGTH (code
))
3162 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3163 if (op0
== TREE_OPERAND (exp
, 0))
3166 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3170 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3171 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3173 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3176 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3180 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3181 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3182 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3184 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3185 && op2
== TREE_OPERAND (exp
, 2))
3188 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3192 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3193 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3194 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3195 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3197 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3198 && op2
== TREE_OPERAND (exp
, 2)
3199 && op3
== TREE_OPERAND (exp
, 3))
3203 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3215 new_tree
= NULL_TREE
;
3217 /* If we are trying to replace F with a constant, inline back
3218 functions which do nothing else than computing a value from
3219 the arguments they are passed. This makes it possible to
3220 fold partially or entirely the replacement expression. */
3221 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3223 tree t
= maybe_inline_call_in_expr (exp
);
3225 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3228 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3230 tree op
= TREE_OPERAND (exp
, i
);
3231 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3235 new_tree
= copy_node (exp
);
3236 TREE_OPERAND (new_tree
, i
) = new_op
;
3242 new_tree
= fold (new_tree
);
3243 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3244 process_call_operands (new_tree
);
3255 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3257 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3258 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3263 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3264 for it within OBJ, a tree that is an object or a chain of references. */
3267 substitute_placeholder_in_expr (tree exp
, tree obj
)
3269 enum tree_code code
= TREE_CODE (exp
);
3270 tree op0
, op1
, op2
, op3
;
3273 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3274 in the chain of OBJ. */
3275 if (code
== PLACEHOLDER_EXPR
)
3277 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3280 for (elt
= obj
; elt
!= 0;
3281 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3282 || TREE_CODE (elt
) == COND_EXPR
)
3283 ? TREE_OPERAND (elt
, 1)
3284 : (REFERENCE_CLASS_P (elt
)
3285 || UNARY_CLASS_P (elt
)
3286 || BINARY_CLASS_P (elt
)
3287 || VL_EXP_CLASS_P (elt
)
3288 || EXPRESSION_CLASS_P (elt
))
3289 ? TREE_OPERAND (elt
, 0) : 0))
3290 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3293 for (elt
= obj
; elt
!= 0;
3294 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3295 || TREE_CODE (elt
) == COND_EXPR
)
3296 ? TREE_OPERAND (elt
, 1)
3297 : (REFERENCE_CLASS_P (elt
)
3298 || UNARY_CLASS_P (elt
)
3299 || BINARY_CLASS_P (elt
)
3300 || VL_EXP_CLASS_P (elt
)
3301 || EXPRESSION_CLASS_P (elt
))
3302 ? TREE_OPERAND (elt
, 0) : 0))
3303 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3304 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3306 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3308 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3309 survives until RTL generation, there will be an error. */
3313 /* TREE_LIST is special because we need to look at TREE_VALUE
3314 and TREE_CHAIN, not TREE_OPERANDS. */
3315 else if (code
== TREE_LIST
)
3317 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3318 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3319 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3322 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3325 switch (TREE_CODE_CLASS (code
))
3328 case tcc_declaration
:
3331 case tcc_exceptional
:
3334 case tcc_comparison
:
3335 case tcc_expression
:
3338 switch (TREE_CODE_LENGTH (code
))
3344 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3345 if (op0
== TREE_OPERAND (exp
, 0))
3348 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3352 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3353 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3355 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3358 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3362 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3363 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3364 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3366 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3367 && op2
== TREE_OPERAND (exp
, 2))
3370 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3374 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3375 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3376 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3377 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3379 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3380 && op2
== TREE_OPERAND (exp
, 2)
3381 && op3
== TREE_OPERAND (exp
, 3))
3385 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3397 new_tree
= NULL_TREE
;
3399 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3401 tree op
= TREE_OPERAND (exp
, i
);
3402 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3406 new_tree
= copy_node (exp
);
3407 TREE_OPERAND (new_tree
, i
) = new_op
;
3413 new_tree
= fold (new_tree
);
3414 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3415 process_call_operands (new_tree
);
3426 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3428 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3429 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3434 /* Stabilize a reference so that we can use it any number of times
3435 without causing its operands to be evaluated more than once.
3436 Returns the stabilized reference. This works by means of save_expr,
3437 so see the caveats in the comments about save_expr.
3439 Also allows conversion expressions whose operands are references.
3440 Any other kind of expression is returned unchanged. */
3443 stabilize_reference (tree ref
)
3446 enum tree_code code
= TREE_CODE (ref
);
3453 /* No action is needed in this case. */
3458 case FIX_TRUNC_EXPR
:
3459 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3463 result
= build_nt (INDIRECT_REF
,
3464 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3468 result
= build_nt (COMPONENT_REF
,
3469 stabilize_reference (TREE_OPERAND (ref
, 0)),
3470 TREE_OPERAND (ref
, 1), NULL_TREE
);
3474 result
= build_nt (BIT_FIELD_REF
,
3475 stabilize_reference (TREE_OPERAND (ref
, 0)),
3476 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3477 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3481 result
= build_nt (ARRAY_REF
,
3482 stabilize_reference (TREE_OPERAND (ref
, 0)),
3483 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3484 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3487 case ARRAY_RANGE_REF
:
3488 result
= build_nt (ARRAY_RANGE_REF
,
3489 stabilize_reference (TREE_OPERAND (ref
, 0)),
3490 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3491 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3495 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3496 it wouldn't be ignored. This matters when dealing with
3498 return stabilize_reference_1 (ref
);
3500 /* If arg isn't a kind of lvalue we recognize, make no change.
3501 Caller should recognize the error for an invalid lvalue. */
3506 return error_mark_node
;
3509 TREE_TYPE (result
) = TREE_TYPE (ref
);
3510 TREE_READONLY (result
) = TREE_READONLY (ref
);
3511 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3512 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3517 /* Subroutine of stabilize_reference; this is called for subtrees of
3518 references. Any expression with side-effects must be put in a SAVE_EXPR
3519 to ensure that it is only evaluated once.
3521 We don't put SAVE_EXPR nodes around everything, because assigning very
3522 simple expressions to temporaries causes us to miss good opportunities
3523 for optimizations. Among other things, the opportunity to fold in the
3524 addition of a constant into an addressing mode often gets lost, e.g.
3525 "y[i+1] += x;". In general, we take the approach that we should not make
3526 an assignment unless we are forced into it - i.e., that any non-side effect
3527 operator should be allowed, and that cse should take care of coalescing
3528 multiple utterances of the same expression should that prove fruitful. */
3531 stabilize_reference_1 (tree e
)
3534 enum tree_code code
= TREE_CODE (e
);
3536 /* We cannot ignore const expressions because it might be a reference
3537 to a const array but whose index contains side-effects. But we can
3538 ignore things that are actual constant or that already have been
3539 handled by this function. */
3541 if (tree_invariant_p (e
))
3544 switch (TREE_CODE_CLASS (code
))
3546 case tcc_exceptional
:
3548 case tcc_declaration
:
3549 case tcc_comparison
:
3551 case tcc_expression
:
3554 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3555 so that it will only be evaluated once. */
3556 /* The reference (r) and comparison (<) classes could be handled as
3557 below, but it is generally faster to only evaluate them once. */
3558 if (TREE_SIDE_EFFECTS (e
))
3559 return save_expr (e
);
3563 /* Constants need no processing. In fact, we should never reach
3568 /* Division is slow and tends to be compiled with jumps,
3569 especially the division by powers of 2 that is often
3570 found inside of an array reference. So do it just once. */
3571 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3572 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3573 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3574 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3575 return save_expr (e
);
3576 /* Recursively stabilize each operand. */
3577 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3578 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3582 /* Recursively stabilize each operand. */
3583 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3590 TREE_TYPE (result
) = TREE_TYPE (e
);
3591 TREE_READONLY (result
) = TREE_READONLY (e
);
3592 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3593 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3598 /* Low-level constructors for expressions. */
3600 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3601 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3604 recompute_tree_invariant_for_addr_expr (tree t
)
3607 bool tc
= true, se
= false;
3609 /* We started out assuming this address is both invariant and constant, but
3610 does not have side effects. Now go down any handled components and see if
3611 any of them involve offsets that are either non-constant or non-invariant.
3612 Also check for side-effects.
3614 ??? Note that this code makes no attempt to deal with the case where
3615 taking the address of something causes a copy due to misalignment. */
3617 #define UPDATE_FLAGS(NODE) \
3618 do { tree _node = (NODE); \
3619 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3620 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3622 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3623 node
= TREE_OPERAND (node
, 0))
3625 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3626 array reference (probably made temporarily by the G++ front end),
3627 so ignore all the operands. */
3628 if ((TREE_CODE (node
) == ARRAY_REF
3629 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3630 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3632 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3633 if (TREE_OPERAND (node
, 2))
3634 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3635 if (TREE_OPERAND (node
, 3))
3636 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3638 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3639 FIELD_DECL, apparently. The G++ front end can put something else
3640 there, at least temporarily. */
3641 else if (TREE_CODE (node
) == COMPONENT_REF
3642 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3644 if (TREE_OPERAND (node
, 2))
3645 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3647 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3648 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3651 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3653 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3654 the address, since &(*a)->b is a form of addition. If it's a constant, the
3655 address is constant too. If it's a decl, its address is constant if the
3656 decl is static. Everything else is not constant and, furthermore,
3657 taking the address of a volatile variable is not volatile. */
3658 if (TREE_CODE (node
) == INDIRECT_REF
3659 || TREE_CODE (node
) == MEM_REF
)
3660 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3661 else if (CONSTANT_CLASS_P (node
))
3663 else if (DECL_P (node
))
3664 tc
&= (staticp (node
) != NULL_TREE
);
3668 se
|= TREE_SIDE_EFFECTS (node
);
3672 TREE_CONSTANT (t
) = tc
;
3673 TREE_SIDE_EFFECTS (t
) = se
;
3677 /* Build an expression of code CODE, data type TYPE, and operands as
3678 specified. Expressions and reference nodes can be created this way.
3679 Constants, decls, types and misc nodes cannot be.
3681 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3682 enough for all extant tree codes. */
3685 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3689 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3691 t
= make_node_stat (code PASS_MEM_STAT
);
3698 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3700 int length
= sizeof (struct tree_exp
);
3703 record_node_allocation_statistics (code
, length
);
3705 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3707 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3709 memset (t
, 0, sizeof (struct tree_common
));
3711 TREE_SET_CODE (t
, code
);
3713 TREE_TYPE (t
) = type
;
3714 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3715 TREE_OPERAND (t
, 0) = node
;
3716 TREE_BLOCK (t
) = NULL_TREE
;
3717 if (node
&& !TYPE_P (node
))
3719 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3720 TREE_READONLY (t
) = TREE_READONLY (node
);
3723 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3724 TREE_SIDE_EFFECTS (t
) = 1;
3728 /* All of these have side-effects, no matter what their
3730 TREE_SIDE_EFFECTS (t
) = 1;
3731 TREE_READONLY (t
) = 0;
3735 /* Whether a dereference is readonly has nothing to do with whether
3736 its operand is readonly. */
3737 TREE_READONLY (t
) = 0;
3742 recompute_tree_invariant_for_addr_expr (t
);
3746 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3747 && node
&& !TYPE_P (node
)
3748 && TREE_CONSTANT (node
))
3749 TREE_CONSTANT (t
) = 1;
3750 if (TREE_CODE_CLASS (code
) == tcc_reference
3751 && node
&& TREE_THIS_VOLATILE (node
))
3752 TREE_THIS_VOLATILE (t
) = 1;
3759 #define PROCESS_ARG(N) \
3761 TREE_OPERAND (t, N) = arg##N; \
3762 if (arg##N &&!TYPE_P (arg##N)) \
3764 if (TREE_SIDE_EFFECTS (arg##N)) \
3766 if (!TREE_READONLY (arg##N) \
3767 && !CONSTANT_CLASS_P (arg##N)) \
3768 (void) (read_only = 0); \
3769 if (!TREE_CONSTANT (arg##N)) \
3770 (void) (constant = 0); \
3775 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3777 bool constant
, read_only
, side_effects
;
3780 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3782 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3783 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3784 /* When sizetype precision doesn't match that of pointers
3785 we need to be able to build explicit extensions or truncations
3786 of the offset argument. */
3787 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3788 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3789 && TREE_CODE (arg1
) == INTEGER_CST
);
3791 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3792 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3793 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3794 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3796 t
= make_node_stat (code PASS_MEM_STAT
);
3799 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3800 result based on those same flags for the arguments. But if the
3801 arguments aren't really even `tree' expressions, we shouldn't be trying
3804 /* Expressions without side effects may be constant if their
3805 arguments are as well. */
3806 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3807 || TREE_CODE_CLASS (code
) == tcc_binary
);
3809 side_effects
= TREE_SIDE_EFFECTS (t
);
3814 TREE_READONLY (t
) = read_only
;
3815 TREE_CONSTANT (t
) = constant
;
3816 TREE_SIDE_EFFECTS (t
) = side_effects
;
3817 TREE_THIS_VOLATILE (t
)
3818 = (TREE_CODE_CLASS (code
) == tcc_reference
3819 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3826 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3827 tree arg2 MEM_STAT_DECL
)
3829 bool constant
, read_only
, side_effects
;
3832 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3833 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3835 t
= make_node_stat (code PASS_MEM_STAT
);
3840 /* As a special exception, if COND_EXPR has NULL branches, we
3841 assume that it is a gimple statement and always consider
3842 it to have side effects. */
3843 if (code
== COND_EXPR
3844 && tt
== void_type_node
3845 && arg1
== NULL_TREE
3846 && arg2
== NULL_TREE
)
3847 side_effects
= true;
3849 side_effects
= TREE_SIDE_EFFECTS (t
);
3855 if (code
== COND_EXPR
)
3856 TREE_READONLY (t
) = read_only
;
3858 TREE_SIDE_EFFECTS (t
) = side_effects
;
3859 TREE_THIS_VOLATILE (t
)
3860 = (TREE_CODE_CLASS (code
) == tcc_reference
3861 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3867 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3868 tree arg2
, tree arg3 MEM_STAT_DECL
)
3870 bool constant
, read_only
, side_effects
;
3873 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3875 t
= make_node_stat (code PASS_MEM_STAT
);
3878 side_effects
= TREE_SIDE_EFFECTS (t
);
3885 TREE_SIDE_EFFECTS (t
) = side_effects
;
3886 TREE_THIS_VOLATILE (t
)
3887 = (TREE_CODE_CLASS (code
) == tcc_reference
3888 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3894 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3895 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3897 bool constant
, read_only
, side_effects
;
3900 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3902 t
= make_node_stat (code PASS_MEM_STAT
);
3905 side_effects
= TREE_SIDE_EFFECTS (t
);
3913 TREE_SIDE_EFFECTS (t
) = side_effects
;
3914 TREE_THIS_VOLATILE (t
)
3915 = (TREE_CODE_CLASS (code
) == tcc_reference
3916 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3922 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3923 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3925 bool constant
, read_only
, side_effects
;
3928 gcc_assert (code
== TARGET_MEM_REF
);
3930 t
= make_node_stat (code PASS_MEM_STAT
);
3933 side_effects
= TREE_SIDE_EFFECTS (t
);
3940 if (code
== TARGET_MEM_REF
)
3944 TREE_SIDE_EFFECTS (t
) = side_effects
;
3945 TREE_THIS_VOLATILE (t
)
3946 = (code
== TARGET_MEM_REF
3947 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3952 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3953 on the pointer PTR. */
3956 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3958 HOST_WIDE_INT offset
= 0;
3959 tree ptype
= TREE_TYPE (ptr
);
3961 /* For convenience allow addresses that collapse to a simple base
3963 if (TREE_CODE (ptr
) == ADDR_EXPR
3964 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3965 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3967 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3969 ptr
= build_fold_addr_expr (ptr
);
3970 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3972 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3973 ptr
, build_int_cst (ptype
, offset
));
3974 SET_EXPR_LOCATION (tem
, loc
);
3978 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3981 mem_ref_offset (const_tree t
)
3983 tree toff
= TREE_OPERAND (t
, 1);
3984 return double_int_sext (tree_to_double_int (toff
),
3985 TYPE_PRECISION (TREE_TYPE (toff
)));
3988 /* Return the pointer-type relevant for TBAA purposes from the
3989 gimple memory reference tree T. This is the type to be used for
3990 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3993 reference_alias_ptr_type (const_tree t
)
3995 const_tree base
= t
;
3996 while (handled_component_p (base
))
3997 base
= TREE_OPERAND (base
, 0);
3998 if (TREE_CODE (base
) == MEM_REF
)
3999 return TREE_TYPE (TREE_OPERAND (base
, 1));
4000 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4001 return TREE_TYPE (TMR_OFFSET (base
));
4003 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4006 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4007 offsetted by OFFSET units. */
4010 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4012 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4013 build_fold_addr_expr (base
),
4014 build_int_cst (ptr_type_node
, offset
));
4015 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4016 recompute_tree_invariant_for_addr_expr (addr
);
4020 /* Similar except don't specify the TREE_TYPE
4021 and leave the TREE_SIDE_EFFECTS as 0.
4022 It is permissible for arguments to be null,
4023 or even garbage if their values do not matter. */
4026 build_nt (enum tree_code code
, ...)
4033 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4037 t
= make_node (code
);
4038 length
= TREE_CODE_LENGTH (code
);
4040 for (i
= 0; i
< length
; i
++)
4041 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4047 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4051 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4056 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4057 CALL_EXPR_FN (ret
) = fn
;
4058 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4059 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4060 CALL_EXPR_ARG (ret
, ix
) = t
;
4064 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4065 We do NOT enter this node in any sort of symbol table.
4067 LOC is the location of the decl.
4069 layout_decl is used to set up the decl's storage layout.
4070 Other slots are initialized to 0 or null pointers. */
4073 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4074 tree type MEM_STAT_DECL
)
4078 t
= make_node_stat (code PASS_MEM_STAT
);
4079 DECL_SOURCE_LOCATION (t
) = loc
;
4081 /* if (type == error_mark_node)
4082 type = integer_type_node; */
4083 /* That is not done, deliberately, so that having error_mark_node
4084 as the type can suppress useless errors in the use of this variable. */
4086 DECL_NAME (t
) = name
;
4087 TREE_TYPE (t
) = type
;
4089 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4095 /* Builds and returns function declaration with NAME and TYPE. */
4098 build_fn_decl (const char *name
, tree type
)
4100 tree id
= get_identifier (name
);
4101 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4103 DECL_EXTERNAL (decl
) = 1;
4104 TREE_PUBLIC (decl
) = 1;
4105 DECL_ARTIFICIAL (decl
) = 1;
4106 TREE_NOTHROW (decl
) = 1;
4111 VEC(tree
,gc
) *all_translation_units
;
4113 /* Builds a new translation-unit decl with name NAME, queues it in the
4114 global list of translation-unit decls and returns it. */
4117 build_translation_unit_decl (tree name
)
4119 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4121 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4122 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4127 /* BLOCK nodes are used to represent the structure of binding contours
4128 and declarations, once those contours have been exited and their contents
4129 compiled. This information is used for outputting debugging info. */
4132 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4134 tree block
= make_node (BLOCK
);
4136 BLOCK_VARS (block
) = vars
;
4137 BLOCK_SUBBLOCKS (block
) = subblocks
;
4138 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4139 BLOCK_CHAIN (block
) = chain
;
4144 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4146 LOC is the location to use in tree T. */
4149 protected_set_expr_location (tree t
, location_t loc
)
4151 if (t
&& CAN_HAVE_LOCATION_P (t
))
4152 SET_EXPR_LOCATION (t
, loc
);
4155 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4159 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4161 DECL_ATTRIBUTES (ddecl
) = attribute
;
4165 /* Borrowed from hashtab.c iterative_hash implementation. */
4166 #define mix(a,b,c) \
4168 a -= b; a -= c; a ^= (c>>13); \
4169 b -= c; b -= a; b ^= (a<< 8); \
4170 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4171 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4172 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4173 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4174 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4175 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4176 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4180 /* Produce good hash value combining VAL and VAL2. */
4182 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4184 /* the golden ratio; an arbitrary value. */
4185 hashval_t a
= 0x9e3779b9;
4191 /* Produce good hash value combining VAL and VAL2. */
4193 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4195 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4196 return iterative_hash_hashval_t (val
, val2
);
4199 hashval_t a
= (hashval_t
) val
;
4200 /* Avoid warnings about shifting of more than the width of the type on
4201 hosts that won't execute this path. */
4203 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4205 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4207 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4208 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4215 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4216 is ATTRIBUTE and its qualifiers are QUALS.
4218 Record such modified types already made so we don't make duplicates. */
4221 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4223 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4225 hashval_t hashcode
= 0;
4227 enum tree_code code
= TREE_CODE (ttype
);
4229 /* Building a distinct copy of a tagged type is inappropriate; it
4230 causes breakage in code that expects there to be a one-to-one
4231 relationship between a struct and its fields.
4232 build_duplicate_type is another solution (as used in
4233 handle_transparent_union_attribute), but that doesn't play well
4234 with the stronger C++ type identity model. */
4235 if (TREE_CODE (ttype
) == RECORD_TYPE
4236 || TREE_CODE (ttype
) == UNION_TYPE
4237 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4238 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4240 warning (OPT_Wattributes
,
4241 "ignoring attributes applied to %qT after definition",
4242 TYPE_MAIN_VARIANT (ttype
));
4243 return build_qualified_type (ttype
, quals
);
4246 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4247 ntype
= build_distinct_type_copy (ttype
);
4249 TYPE_ATTRIBUTES (ntype
) = attribute
;
4251 hashcode
= iterative_hash_object (code
, hashcode
);
4252 if (TREE_TYPE (ntype
))
4253 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4255 hashcode
= attribute_hash_list (attribute
, hashcode
);
4257 switch (TREE_CODE (ntype
))
4260 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4263 if (TYPE_DOMAIN (ntype
))
4264 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4268 hashcode
= iterative_hash_object
4269 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4270 hashcode
= iterative_hash_object
4271 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4274 case FIXED_POINT_TYPE
:
4276 unsigned int precision
= TYPE_PRECISION (ntype
);
4277 hashcode
= iterative_hash_object (precision
, hashcode
);
4284 ntype
= type_hash_canon (hashcode
, ntype
);
4286 /* If the target-dependent attributes make NTYPE different from
4287 its canonical type, we will need to use structural equality
4288 checks for this type. */
4289 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4290 || !comp_type_attributes (ntype
, ttype
))
4291 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4292 else if (TYPE_CANONICAL (ntype
) == ntype
)
4293 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4295 ttype
= build_qualified_type (ntype
, quals
);
4297 else if (TYPE_QUALS (ttype
) != quals
)
4298 ttype
= build_qualified_type (ttype
, quals
);
4303 /* Compare two attributes for their value identity. Return true if the
4304 attribute values are known to be equal; otherwise return false.
4308 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4310 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4313 if (TREE_VALUE (attr1
) != NULL_TREE
4314 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4315 && TREE_VALUE (attr2
) != NULL
4316 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4317 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4318 TREE_VALUE (attr2
)) == 1);
4320 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4323 /* Return 0 if the attributes for two types are incompatible, 1 if they
4324 are compatible, and 2 if they are nearly compatible (which causes a
4325 warning to be generated). */
4327 comp_type_attributes (const_tree type1
, const_tree type2
)
4329 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4330 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4335 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4337 const struct attribute_spec
*as
;
4340 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4341 if (!as
|| as
->affects_type_identity
== false)
4344 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4345 if (!attr
|| !attribute_value_equal (a
, attr
))
4350 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4352 const struct attribute_spec
*as
;
4354 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4355 if (!as
|| as
->affects_type_identity
== false)
4358 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4360 /* We don't need to compare trees again, as we did this
4361 already in first loop. */
4363 /* All types - affecting identity - are equal, so
4364 there is no need to call target hook for comparison. */
4368 /* As some type combinations - like default calling-convention - might
4369 be compatible, we have to call the target hook to get the final result. */
4370 return targetm
.comp_type_attributes (type1
, type2
);
4373 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4376 Record such modified types already made so we don't make duplicates. */
4379 build_type_attribute_variant (tree ttype
, tree attribute
)
4381 return build_type_attribute_qual_variant (ttype
, attribute
,
4382 TYPE_QUALS (ttype
));
4386 /* Reset the expression *EXPR_P, a size or position.
4388 ??? We could reset all non-constant sizes or positions. But it's cheap
4389 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4391 We need to reset self-referential sizes or positions because they cannot
4392 be gimplified and thus can contain a CALL_EXPR after the gimplification
4393 is finished, which will run afoul of LTO streaming. And they need to be
4394 reset to something essentially dummy but not constant, so as to preserve
4395 the properties of the object they are attached to. */
4398 free_lang_data_in_one_sizepos (tree
*expr_p
)
4400 tree expr
= *expr_p
;
4401 if (CONTAINS_PLACEHOLDER_P (expr
))
4402 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4406 /* Reset all the fields in a binfo node BINFO. We only keep
4407 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4410 free_lang_data_in_binfo (tree binfo
)
4415 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4417 BINFO_VTABLE (binfo
) = NULL_TREE
;
4418 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4419 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4420 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4422 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4423 free_lang_data_in_binfo (t
);
4427 /* Reset all language specific information still present in TYPE. */
4430 free_lang_data_in_type (tree type
)
4432 gcc_assert (TYPE_P (type
));
4434 /* Give the FE a chance to remove its own data first. */
4435 lang_hooks
.free_lang_data (type
);
4437 TREE_LANG_FLAG_0 (type
) = 0;
4438 TREE_LANG_FLAG_1 (type
) = 0;
4439 TREE_LANG_FLAG_2 (type
) = 0;
4440 TREE_LANG_FLAG_3 (type
) = 0;
4441 TREE_LANG_FLAG_4 (type
) = 0;
4442 TREE_LANG_FLAG_5 (type
) = 0;
4443 TREE_LANG_FLAG_6 (type
) = 0;
4445 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4447 /* Remove the const and volatile qualifiers from arguments. The
4448 C++ front end removes them, but the C front end does not,
4449 leading to false ODR violation errors when merging two
4450 instances of the same function signature compiled by
4451 different front ends. */
4454 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4456 tree arg_type
= TREE_VALUE (p
);
4458 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4460 int quals
= TYPE_QUALS (arg_type
)
4462 & ~TYPE_QUAL_VOLATILE
;
4463 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4464 free_lang_data_in_type (TREE_VALUE (p
));
4469 /* Remove members that are not actually FIELD_DECLs from the field
4470 list of an aggregate. These occur in C++. */
4471 if (RECORD_OR_UNION_TYPE_P (type
))
4475 /* Note that TYPE_FIELDS can be shared across distinct
4476 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4477 to be removed, we cannot set its TREE_CHAIN to NULL.
4478 Otherwise, we would not be able to find all the other fields
4479 in the other instances of this TREE_TYPE.
4481 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4483 member
= TYPE_FIELDS (type
);
4486 if (TREE_CODE (member
) == FIELD_DECL
)
4489 TREE_CHAIN (prev
) = member
;
4491 TYPE_FIELDS (type
) = member
;
4495 member
= TREE_CHAIN (member
);
4499 TREE_CHAIN (prev
) = NULL_TREE
;
4501 TYPE_FIELDS (type
) = NULL_TREE
;
4503 TYPE_METHODS (type
) = NULL_TREE
;
4504 if (TYPE_BINFO (type
))
4505 free_lang_data_in_binfo (TYPE_BINFO (type
));
4509 /* For non-aggregate types, clear out the language slot (which
4510 overloads TYPE_BINFO). */
4511 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4513 if (INTEGRAL_TYPE_P (type
)
4514 || SCALAR_FLOAT_TYPE_P (type
)
4515 || FIXED_POINT_TYPE_P (type
))
4517 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4518 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4522 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4523 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4525 if (debug_info_level
< DINFO_LEVEL_TERSE
4526 || (TYPE_CONTEXT (type
)
4527 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4528 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4529 TYPE_CONTEXT (type
) = NULL_TREE
;
4531 if (debug_info_level
< DINFO_LEVEL_TERSE
)
4532 TYPE_STUB_DECL (type
) = NULL_TREE
;
4536 /* Return true if DECL may need an assembler name to be set. */
4539 need_assembler_name_p (tree decl
)
4541 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4542 if (TREE_CODE (decl
) != FUNCTION_DECL
4543 && TREE_CODE (decl
) != VAR_DECL
)
4546 /* If DECL already has its assembler name set, it does not need a
4548 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4549 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4552 /* Abstract decls do not need an assembler name. */
4553 if (DECL_ABSTRACT (decl
))
4556 /* For VAR_DECLs, only static, public and external symbols need an
4558 if (TREE_CODE (decl
) == VAR_DECL
4559 && !TREE_STATIC (decl
)
4560 && !TREE_PUBLIC (decl
)
4561 && !DECL_EXTERNAL (decl
))
4564 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4566 /* Do not set assembler name on builtins. Allow RTL expansion to
4567 decide whether to expand inline or via a regular call. */
4568 if (DECL_BUILT_IN (decl
)
4569 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4572 /* Functions represented in the callgraph need an assembler name. */
4573 if (cgraph_get_node (decl
) != NULL
)
4576 /* Unused and not public functions don't need an assembler name. */
4577 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4585 /* Reset all language specific information still present in symbol
4589 free_lang_data_in_decl (tree decl
)
4591 gcc_assert (DECL_P (decl
));
4593 /* Give the FE a chance to remove its own data first. */
4594 lang_hooks
.free_lang_data (decl
);
4596 TREE_LANG_FLAG_0 (decl
) = 0;
4597 TREE_LANG_FLAG_1 (decl
) = 0;
4598 TREE_LANG_FLAG_2 (decl
) = 0;
4599 TREE_LANG_FLAG_3 (decl
) = 0;
4600 TREE_LANG_FLAG_4 (decl
) = 0;
4601 TREE_LANG_FLAG_5 (decl
) = 0;
4602 TREE_LANG_FLAG_6 (decl
) = 0;
4604 /* Identifiers need not have a type. */
4605 if (DECL_NAME (decl
))
4606 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4608 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4609 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4610 if (TREE_CODE (decl
) == FIELD_DECL
)
4611 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4613 /* DECL_FCONTEXT is only used for debug info generation. */
4614 if (TREE_CODE (decl
) == FIELD_DECL
4615 && debug_info_level
< DINFO_LEVEL_TERSE
)
4616 DECL_FCONTEXT (decl
) = NULL_TREE
;
4618 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4620 if (gimple_has_body_p (decl
))
4624 /* If DECL has a gimple body, then the context for its
4625 arguments must be DECL. Otherwise, it doesn't really
4626 matter, as we will not be emitting any code for DECL. In
4627 general, there may be other instances of DECL created by
4628 the front end and since PARM_DECLs are generally shared,
4629 their DECL_CONTEXT changes as the replicas of DECL are
4630 created. The only time where DECL_CONTEXT is important
4631 is for the FUNCTION_DECLs that have a gimple body (since
4632 the PARM_DECL will be used in the function's body). */
4633 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4634 DECL_CONTEXT (t
) = decl
;
4637 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4638 At this point, it is not needed anymore. */
4639 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4641 /* Clear the abstract origin if it refers to a method. Otherwise
4642 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4643 origin will not be output correctly. */
4644 if (DECL_ABSTRACT_ORIGIN (decl
)
4645 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4646 && RECORD_OR_UNION_TYPE_P
4647 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4648 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4650 else if (TREE_CODE (decl
) == VAR_DECL
)
4652 if ((DECL_EXTERNAL (decl
)
4653 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4654 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4655 DECL_INITIAL (decl
) = NULL_TREE
;
4657 else if (TREE_CODE (decl
) == TYPE_DECL
)
4658 DECL_INITIAL (decl
) = NULL_TREE
;
4659 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4660 && DECL_INITIAL (decl
)
4661 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4663 /* Strip builtins from the translation-unit BLOCK. We still have
4664 targets without builtin_decl support and also builtins are
4665 shared nodes and thus we can't use TREE_CHAIN in multiple
4667 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4671 if (TREE_CODE (var
) == FUNCTION_DECL
4672 && DECL_BUILT_IN (var
))
4673 *nextp
= TREE_CHAIN (var
);
4675 nextp
= &TREE_CHAIN (var
);
4681 /* Data used when collecting DECLs and TYPEs for language data removal. */
4683 struct free_lang_data_d
4685 /* Worklist to avoid excessive recursion. */
4686 VEC(tree
,heap
) *worklist
;
4688 /* Set of traversed objects. Used to avoid duplicate visits. */
4689 struct pointer_set_t
*pset
;
4691 /* Array of symbols to process with free_lang_data_in_decl. */
4692 VEC(tree
,heap
) *decls
;
4694 /* Array of types to process with free_lang_data_in_type. */
4695 VEC(tree
,heap
) *types
;
4699 /* Save all language fields needed to generate proper debug information
4700 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4703 save_debug_info_for_decl (tree t
)
4705 /*struct saved_debug_info_d *sdi;*/
4707 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4709 /* FIXME. Partial implementation for saving debug info removed. */
4713 /* Save all language fields needed to generate proper debug information
4714 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4717 save_debug_info_for_type (tree t
)
4719 /*struct saved_debug_info_d *sdi;*/
4721 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4723 /* FIXME. Partial implementation for saving debug info removed. */
4727 /* Add type or decl T to one of the list of tree nodes that need their
4728 language data removed. The lists are held inside FLD. */
4731 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4735 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4736 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4737 save_debug_info_for_decl (t
);
4739 else if (TYPE_P (t
))
4741 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4742 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4743 save_debug_info_for_type (t
);
4749 /* Push tree node T into FLD->WORKLIST. */
4752 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4754 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4755 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4759 /* Operand callback helper for free_lang_data_in_node. *TP is the
4760 subtree operand being considered. */
4763 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4766 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4768 if (TREE_CODE (t
) == TREE_LIST
)
4771 /* Language specific nodes will be removed, so there is no need
4772 to gather anything under them. */
4773 if (is_lang_specific (t
))
4781 /* Note that walk_tree does not traverse every possible field in
4782 decls, so we have to do our own traversals here. */
4783 add_tree_to_fld_list (t
, fld
);
4785 fld_worklist_push (DECL_NAME (t
), fld
);
4786 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4787 fld_worklist_push (DECL_SIZE (t
), fld
);
4788 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4790 /* We are going to remove everything under DECL_INITIAL for
4791 TYPE_DECLs. No point walking them. */
4792 if (TREE_CODE (t
) != TYPE_DECL
)
4793 fld_worklist_push (DECL_INITIAL (t
), fld
);
4795 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4796 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4798 if (TREE_CODE (t
) == FUNCTION_DECL
)
4800 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4801 fld_worklist_push (DECL_RESULT (t
), fld
);
4803 else if (TREE_CODE (t
) == TYPE_DECL
)
4805 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4806 fld_worklist_push (DECL_VINDEX (t
), fld
);
4808 else if (TREE_CODE (t
) == FIELD_DECL
)
4810 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4811 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4812 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4813 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4814 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4816 else if (TREE_CODE (t
) == VAR_DECL
)
4818 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4819 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4822 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4823 && DECL_HAS_VALUE_EXPR_P (t
))
4824 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4826 if (TREE_CODE (t
) != FIELD_DECL
4827 && TREE_CODE (t
) != TYPE_DECL
)
4828 fld_worklist_push (TREE_CHAIN (t
), fld
);
4831 else if (TYPE_P (t
))
4833 /* Note that walk_tree does not traverse every possible field in
4834 types, so we have to do our own traversals here. */
4835 add_tree_to_fld_list (t
, fld
);
4837 if (!RECORD_OR_UNION_TYPE_P (t
))
4838 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4839 fld_worklist_push (TYPE_SIZE (t
), fld
);
4840 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4841 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4842 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4843 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4844 fld_worklist_push (TYPE_NAME (t
), fld
);
4845 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4846 them and thus do not and want not to reach unused pointer types
4848 if (!POINTER_TYPE_P (t
))
4849 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4850 if (!RECORD_OR_UNION_TYPE_P (t
))
4851 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4852 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4853 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4854 do not and want not to reach unused variants this way. */
4855 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4856 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4857 and want not to reach unused types this way. */
4859 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4863 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4865 fld_worklist_push (TREE_TYPE (tem
), fld
);
4866 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4868 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4869 && TREE_CODE (tem
) == TREE_LIST
)
4872 fld_worklist_push (TREE_VALUE (tem
), fld
);
4873 tem
= TREE_CHAIN (tem
);
4877 if (RECORD_OR_UNION_TYPE_P (t
))
4880 /* Push all TYPE_FIELDS - there can be interleaving interesting
4881 and non-interesting things. */
4882 tem
= TYPE_FIELDS (t
);
4885 if (TREE_CODE (tem
) == FIELD_DECL
)
4886 fld_worklist_push (tem
, fld
);
4887 tem
= TREE_CHAIN (tem
);
4891 fld_worklist_push (TREE_CHAIN (t
), fld
);
4894 else if (TREE_CODE (t
) == BLOCK
)
4897 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4898 fld_worklist_push (tem
, fld
);
4899 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4900 fld_worklist_push (tem
, fld
);
4901 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4904 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
4905 fld_worklist_push (TREE_TYPE (t
), fld
);
4911 /* Find decls and types in T. */
4914 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4918 if (!pointer_set_contains (fld
->pset
, t
))
4919 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4920 if (VEC_empty (tree
, fld
->worklist
))
4922 t
= VEC_pop (tree
, fld
->worklist
);
4926 /* Translate all the types in LIST with the corresponding runtime
4930 get_eh_types_for_runtime (tree list
)
4934 if (list
== NULL_TREE
)
4937 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4939 list
= TREE_CHAIN (list
);
4942 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4943 TREE_CHAIN (prev
) = n
;
4944 prev
= TREE_CHAIN (prev
);
4945 list
= TREE_CHAIN (list
);
4952 /* Find decls and types referenced in EH region R and store them in
4953 FLD->DECLS and FLD->TYPES. */
4956 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4967 /* The types referenced in each catch must first be changed to the
4968 EH types used at runtime. This removes references to FE types
4970 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4972 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4973 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4978 case ERT_ALLOWED_EXCEPTIONS
:
4979 r
->u
.allowed
.type_list
4980 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4981 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4984 case ERT_MUST_NOT_THROW
:
4985 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4986 find_decls_types_r
, fld
, fld
->pset
);
4992 /* Find decls and types referenced in cgraph node N and store them in
4993 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4994 look for *every* kind of DECL and TYPE node reachable from N,
4995 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4996 NAMESPACE_DECLs, etc). */
4999 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5002 struct function
*fn
;
5006 find_decls_types (n
->decl
, fld
);
5008 if (!gimple_has_body_p (n
->decl
))
5011 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5013 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5015 /* Traverse locals. */
5016 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5017 find_decls_types (t
, fld
);
5019 /* Traverse EH regions in FN. */
5022 FOR_ALL_EH_REGION_FN (r
, fn
)
5023 find_decls_types_in_eh_region (r
, fld
);
5026 /* Traverse every statement in FN. */
5027 FOR_EACH_BB_FN (bb
, fn
)
5029 gimple_stmt_iterator si
;
5032 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5034 gimple phi
= gsi_stmt (si
);
5036 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5038 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5039 find_decls_types (*arg_p
, fld
);
5043 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5045 gimple stmt
= gsi_stmt (si
);
5047 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5049 tree arg
= gimple_op (stmt
, i
);
5050 find_decls_types (arg
, fld
);
5057 /* Find decls and types referenced in varpool node N and store them in
5058 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5059 look for *every* kind of DECL and TYPE node reachable from N,
5060 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5061 NAMESPACE_DECLs, etc). */
5064 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5066 find_decls_types (v
->decl
, fld
);
5069 /* If T needs an assembler name, have one created for it. */
5072 assign_assembler_name_if_neeeded (tree t
)
5074 if (need_assembler_name_p (t
))
5076 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5077 diagnostics that use input_location to show locus
5078 information. The problem here is that, at this point,
5079 input_location is generally anchored to the end of the file
5080 (since the parser is long gone), so we don't have a good
5081 position to pin it to.
5083 To alleviate this problem, this uses the location of T's
5084 declaration. Examples of this are
5085 testsuite/g++.dg/template/cond2.C and
5086 testsuite/g++.dg/template/pr35240.C. */
5087 location_t saved_location
= input_location
;
5088 input_location
= DECL_SOURCE_LOCATION (t
);
5090 decl_assembler_name (t
);
5092 input_location
= saved_location
;
5097 /* Free language specific information for every operand and expression
5098 in every node of the call graph. This process operates in three stages:
5100 1- Every callgraph node and varpool node is traversed looking for
5101 decls and types embedded in them. This is a more exhaustive
5102 search than that done by find_referenced_vars, because it will
5103 also collect individual fields, decls embedded in types, etc.
5105 2- All the decls found are sent to free_lang_data_in_decl.
5107 3- All the types found are sent to free_lang_data_in_type.
5109 The ordering between decls and types is important because
5110 free_lang_data_in_decl sets assembler names, which includes
5111 mangling. So types cannot be freed up until assembler names have
5115 free_lang_data_in_cgraph (void)
5117 struct cgraph_node
*n
;
5118 struct varpool_node
*v
;
5119 struct free_lang_data_d fld
;
5124 /* Initialize sets and arrays to store referenced decls and types. */
5125 fld
.pset
= pointer_set_create ();
5126 fld
.worklist
= NULL
;
5127 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5128 fld
.types
= VEC_alloc (tree
, heap
, 100);
5130 /* Find decls and types in the body of every function in the callgraph. */
5131 for (n
= cgraph_nodes
; n
; n
= n
->next
)
5132 find_decls_types_in_node (n
, &fld
);
5134 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5135 find_decls_types (p
->decl
, &fld
);
5137 /* Find decls and types in every varpool symbol. */
5138 for (v
= varpool_nodes
; v
; v
= v
->next
)
5139 find_decls_types_in_var (v
, &fld
);
5141 /* Set the assembler name on every decl found. We need to do this
5142 now because free_lang_data_in_decl will invalidate data needed
5143 for mangling. This breaks mangling on interdependent decls. */
5144 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5145 assign_assembler_name_if_neeeded (t
);
5147 /* Traverse every decl found freeing its language data. */
5148 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5149 free_lang_data_in_decl (t
);
5151 /* Traverse every type found freeing its language data. */
5152 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5153 free_lang_data_in_type (t
);
5155 pointer_set_destroy (fld
.pset
);
5156 VEC_free (tree
, heap
, fld
.worklist
);
5157 VEC_free (tree
, heap
, fld
.decls
);
5158 VEC_free (tree
, heap
, fld
.types
);
5162 /* Free resources that are used by FE but are not needed once they are done. */
5165 free_lang_data (void)
5169 /* If we are the LTO frontend we have freed lang-specific data already. */
5171 || !flag_generate_lto
)
5174 /* Allocate and assign alias sets to the standard integer types
5175 while the slots are still in the way the frontends generated them. */
5176 for (i
= 0; i
< itk_none
; ++i
)
5177 if (integer_types
[i
])
5178 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5180 /* Traverse the IL resetting language specific information for
5181 operands, expressions, etc. */
5182 free_lang_data_in_cgraph ();
5184 /* Create gimple variants for common types. */
5185 ptrdiff_type_node
= integer_type_node
;
5186 fileptr_type_node
= ptr_type_node
;
5187 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
5188 || (TYPE_MODE (boolean_type_node
)
5189 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
5190 || TYPE_PRECISION (boolean_type_node
) != 1
5191 || !TYPE_UNSIGNED (boolean_type_node
))
5193 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5194 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5195 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5196 TYPE_PRECISION (boolean_type_node
) = 1;
5197 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5198 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5201 /* Unify char_type_node with its properly signed variant. */
5202 if (TYPE_UNSIGNED (char_type_node
))
5203 unsigned_char_type_node
= char_type_node
;
5205 signed_char_type_node
= char_type_node
;
5207 /* Reset some langhooks. Do not reset types_compatible_p, it may
5208 still be used indirectly via the get_alias_set langhook. */
5209 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5210 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5211 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5212 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
5214 /* Reset diagnostic machinery. */
5215 diagnostic_starter (global_dc
) = default_tree_diagnostic_starter
;
5216 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5217 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5223 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5227 "*free_lang_data", /* name */
5229 free_lang_data
, /* execute */
5232 0, /* static_pass_number */
5233 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5234 0, /* properties_required */
5235 0, /* properties_provided */
5236 0, /* properties_destroyed */
5237 0, /* todo_flags_start */
5238 TODO_ggc_collect
/* todo_flags_finish */
5242 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5245 We try both `text' and `__text__', ATTR may be either one. */
5246 /* ??? It might be a reasonable simplification to require ATTR to be only
5247 `text'. One might then also require attribute lists to be stored in
5248 their canonicalized form. */
5251 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5256 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5259 p
= IDENTIFIER_POINTER (ident
);
5260 ident_len
= IDENTIFIER_LENGTH (ident
);
5262 if (ident_len
== attr_len
5263 && strcmp (attr
, p
) == 0)
5266 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5269 gcc_assert (attr
[1] == '_');
5270 gcc_assert (attr
[attr_len
- 2] == '_');
5271 gcc_assert (attr
[attr_len
- 1] == '_');
5272 if (ident_len
== attr_len
- 4
5273 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5278 if (ident_len
== attr_len
+ 4
5279 && p
[0] == '_' && p
[1] == '_'
5280 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5281 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5288 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5291 We try both `text' and `__text__', ATTR may be either one. */
5294 is_attribute_p (const char *attr
, const_tree ident
)
5296 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5299 /* Given an attribute name and a list of attributes, return a pointer to the
5300 attribute's list element if the attribute is part of the list, or NULL_TREE
5301 if not found. If the attribute appears more than once, this only
5302 returns the first occurrence; the TREE_CHAIN of the return value should
5303 be passed back in if further occurrences are wanted. */
5306 lookup_attribute (const char *attr_name
, tree list
)
5309 size_t attr_len
= strlen (attr_name
);
5311 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5313 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5314 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5320 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5324 remove_attribute (const char *attr_name
, tree list
)
5327 size_t attr_len
= strlen (attr_name
);
5329 for (p
= &list
; *p
; )
5332 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5333 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5334 *p
= TREE_CHAIN (l
);
5336 p
= &TREE_CHAIN (l
);
5342 /* Return an attribute list that is the union of a1 and a2. */
5345 merge_attributes (tree a1
, tree a2
)
5349 /* Either one unset? Take the set one. */
5351 if ((attributes
= a1
) == 0)
5354 /* One that completely contains the other? Take it. */
5356 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5358 if (attribute_list_contained (a2
, a1
))
5362 /* Pick the longest list, and hang on the other list. */
5364 if (list_length (a1
) < list_length (a2
))
5365 attributes
= a2
, a2
= a1
;
5367 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5370 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5372 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5373 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5378 a1
= copy_node (a2
);
5379 TREE_CHAIN (a1
) = attributes
;
5388 /* Given types T1 and T2, merge their attributes and return
5392 merge_type_attributes (tree t1
, tree t2
)
5394 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5395 TYPE_ATTRIBUTES (t2
));
5398 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5402 merge_decl_attributes (tree olddecl
, tree newdecl
)
5404 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5405 DECL_ATTRIBUTES (newdecl
));
5408 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5410 /* Specialization of merge_decl_attributes for various Windows targets.
5412 This handles the following situation:
5414 __declspec (dllimport) int foo;
5417 The second instance of `foo' nullifies the dllimport. */
5420 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5423 int delete_dllimport_p
= 1;
5425 /* What we need to do here is remove from `old' dllimport if it doesn't
5426 appear in `new'. dllimport behaves like extern: if a declaration is
5427 marked dllimport and a definition appears later, then the object
5428 is not dllimport'd. We also remove a `new' dllimport if the old list
5429 contains dllexport: dllexport always overrides dllimport, regardless
5430 of the order of declaration. */
5431 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5432 delete_dllimport_p
= 0;
5433 else if (DECL_DLLIMPORT_P (new_tree
)
5434 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5436 DECL_DLLIMPORT_P (new_tree
) = 0;
5437 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5438 "dllimport ignored", new_tree
);
5440 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5442 /* Warn about overriding a symbol that has already been used, e.g.:
5443 extern int __attribute__ ((dllimport)) foo;
5444 int* bar () {return &foo;}
5447 if (TREE_USED (old
))
5449 warning (0, "%q+D redeclared without dllimport attribute "
5450 "after being referenced with dll linkage", new_tree
);
5451 /* If we have used a variable's address with dllimport linkage,
5452 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5453 decl may already have had TREE_CONSTANT computed.
5454 We still remove the attribute so that assembler code refers
5455 to '&foo rather than '_imp__foo'. */
5456 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5457 DECL_DLLIMPORT_P (new_tree
) = 1;
5460 /* Let an inline definition silently override the external reference,
5461 but otherwise warn about attribute inconsistency. */
5462 else if (TREE_CODE (new_tree
) == VAR_DECL
5463 || !DECL_DECLARED_INLINE_P (new_tree
))
5464 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5465 "previous dllimport ignored", new_tree
);
5468 delete_dllimport_p
= 0;
5470 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5472 if (delete_dllimport_p
)
5475 const size_t attr_len
= strlen ("dllimport");
5477 /* Scan the list for dllimport and delete it. */
5478 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5480 if (is_attribute_with_length_p ("dllimport", attr_len
,
5483 if (prev
== NULL_TREE
)
5486 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5495 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5496 struct attribute_spec.handler. */
5499 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5505 /* These attributes may apply to structure and union types being created,
5506 but otherwise should pass to the declaration involved. */
5509 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5510 | (int) ATTR_FLAG_ARRAY_NEXT
))
5512 *no_add_attrs
= true;
5513 return tree_cons (name
, args
, NULL_TREE
);
5515 if (TREE_CODE (node
) == RECORD_TYPE
5516 || TREE_CODE (node
) == UNION_TYPE
)
5518 node
= TYPE_NAME (node
);
5524 warning (OPT_Wattributes
, "%qE attribute ignored",
5526 *no_add_attrs
= true;
5531 if (TREE_CODE (node
) != FUNCTION_DECL
5532 && TREE_CODE (node
) != VAR_DECL
5533 && TREE_CODE (node
) != TYPE_DECL
)
5535 *no_add_attrs
= true;
5536 warning (OPT_Wattributes
, "%qE attribute ignored",
5541 if (TREE_CODE (node
) == TYPE_DECL
5542 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5543 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5545 *no_add_attrs
= true;
5546 warning (OPT_Wattributes
, "%qE attribute ignored",
5551 is_dllimport
= is_attribute_p ("dllimport", name
);
5553 /* Report error on dllimport ambiguities seen now before they cause
5557 /* Honor any target-specific overrides. */
5558 if (!targetm
.valid_dllimport_attribute_p (node
))
5559 *no_add_attrs
= true;
5561 else if (TREE_CODE (node
) == FUNCTION_DECL
5562 && DECL_DECLARED_INLINE_P (node
))
5564 warning (OPT_Wattributes
, "inline function %q+D declared as "
5565 " dllimport: attribute ignored", node
);
5566 *no_add_attrs
= true;
5568 /* Like MS, treat definition of dllimported variables and
5569 non-inlined functions on declaration as syntax errors. */
5570 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5572 error ("function %q+D definition is marked dllimport", node
);
5573 *no_add_attrs
= true;
5576 else if (TREE_CODE (node
) == VAR_DECL
)
5578 if (DECL_INITIAL (node
))
5580 error ("variable %q+D definition is marked dllimport",
5582 *no_add_attrs
= true;
5585 /* `extern' needn't be specified with dllimport.
5586 Specify `extern' now and hope for the best. Sigh. */
5587 DECL_EXTERNAL (node
) = 1;
5588 /* Also, implicitly give dllimport'd variables declared within
5589 a function global scope, unless declared static. */
5590 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5591 TREE_PUBLIC (node
) = 1;
5594 if (*no_add_attrs
== false)
5595 DECL_DLLIMPORT_P (node
) = 1;
5597 else if (TREE_CODE (node
) == FUNCTION_DECL
5598 && DECL_DECLARED_INLINE_P (node
)
5599 && flag_keep_inline_dllexport
)
5600 /* An exported function, even if inline, must be emitted. */
5601 DECL_EXTERNAL (node
) = 0;
5603 /* Report error if symbol is not accessible at global scope. */
5604 if (!TREE_PUBLIC (node
)
5605 && (TREE_CODE (node
) == VAR_DECL
5606 || TREE_CODE (node
) == FUNCTION_DECL
))
5608 error ("external linkage required for symbol %q+D because of "
5609 "%qE attribute", node
, name
);
5610 *no_add_attrs
= true;
5613 /* A dllexport'd entity must have default visibility so that other
5614 program units (shared libraries or the main executable) can see
5615 it. A dllimport'd entity must have default visibility so that
5616 the linker knows that undefined references within this program
5617 unit can be resolved by the dynamic linker. */
5620 if (DECL_VISIBILITY_SPECIFIED (node
)
5621 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5622 error ("%qE implies default visibility, but %qD has already "
5623 "been declared with a different visibility",
5625 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5626 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5632 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5634 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5635 of the various TYPE_QUAL values. */
5638 set_type_quals (tree type
, int type_quals
)
5640 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5641 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5642 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5643 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5646 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5649 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5651 return (TYPE_QUALS (cand
) == type_quals
5652 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5653 /* Apparently this is needed for Objective-C. */
5654 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5655 /* Check alignment. */
5656 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5657 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5658 TYPE_ATTRIBUTES (base
)));
5661 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5664 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5666 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5667 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5668 /* Apparently this is needed for Objective-C. */
5669 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5670 /* Check alignment. */
5671 && TYPE_ALIGN (cand
) == align
5672 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5673 TYPE_ATTRIBUTES (base
)));
5676 /* Return a version of the TYPE, qualified as indicated by the
5677 TYPE_QUALS, if one exists. If no qualified version exists yet,
5678 return NULL_TREE. */
5681 get_qualified_type (tree type
, int type_quals
)
5685 if (TYPE_QUALS (type
) == type_quals
)
5688 /* Search the chain of variants to see if there is already one there just
5689 like the one we need to have. If so, use that existing one. We must
5690 preserve the TYPE_NAME, since there is code that depends on this. */
5691 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5692 if (check_qualified_type (t
, type
, type_quals
))
5698 /* Like get_qualified_type, but creates the type if it does not
5699 exist. This function never returns NULL_TREE. */
5702 build_qualified_type (tree type
, int type_quals
)
5706 /* See if we already have the appropriate qualified variant. */
5707 t
= get_qualified_type (type
, type_quals
);
5709 /* If not, build it. */
5712 t
= build_variant_type_copy (type
);
5713 set_type_quals (t
, type_quals
);
5715 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5716 /* Propagate structural equality. */
5717 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5718 else if (TYPE_CANONICAL (type
) != type
)
5719 /* Build the underlying canonical type, since it is different
5721 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5724 /* T is its own canonical type. */
5725 TYPE_CANONICAL (t
) = t
;
5732 /* Create a variant of type T with alignment ALIGN. */
5735 build_aligned_type (tree type
, unsigned int align
)
5739 if (TYPE_PACKED (type
)
5740 || TYPE_ALIGN (type
) == align
)
5743 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5744 if (check_aligned_type (t
, type
, align
))
5747 t
= build_variant_type_copy (type
);
5748 TYPE_ALIGN (t
) = align
;
5753 /* Create a new distinct copy of TYPE. The new type is made its own
5754 MAIN_VARIANT. If TYPE requires structural equality checks, the
5755 resulting type requires structural equality checks; otherwise, its
5756 TYPE_CANONICAL points to itself. */
5759 build_distinct_type_copy (tree type
)
5761 tree t
= copy_node (type
);
5763 TYPE_POINTER_TO (t
) = 0;
5764 TYPE_REFERENCE_TO (t
) = 0;
5766 /* Set the canonical type either to a new equivalence class, or
5767 propagate the need for structural equality checks. */
5768 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5769 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5771 TYPE_CANONICAL (t
) = t
;
5773 /* Make it its own variant. */
5774 TYPE_MAIN_VARIANT (t
) = t
;
5775 TYPE_NEXT_VARIANT (t
) = 0;
5777 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5778 whose TREE_TYPE is not t. This can also happen in the Ada
5779 frontend when using subtypes. */
5784 /* Create a new variant of TYPE, equivalent but distinct. This is so
5785 the caller can modify it. TYPE_CANONICAL for the return type will
5786 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5787 are considered equal by the language itself (or that both types
5788 require structural equality checks). */
5791 build_variant_type_copy (tree type
)
5793 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5795 t
= build_distinct_type_copy (type
);
5797 /* Since we're building a variant, assume that it is a non-semantic
5798 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5799 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5801 /* Add the new type to the chain of variants of TYPE. */
5802 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5803 TYPE_NEXT_VARIANT (m
) = t
;
5804 TYPE_MAIN_VARIANT (t
) = m
;
5809 /* Return true if the from tree in both tree maps are equal. */
5812 tree_map_base_eq (const void *va
, const void *vb
)
5814 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5815 *const b
= (const struct tree_map_base
*) vb
;
5816 return (a
->from
== b
->from
);
5819 /* Hash a from tree in a tree_base_map. */
5822 tree_map_base_hash (const void *item
)
5824 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5827 /* Return true if this tree map structure is marked for garbage collection
5828 purposes. We simply return true if the from tree is marked, so that this
5829 structure goes away when the from tree goes away. */
5832 tree_map_base_marked_p (const void *p
)
5834 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5837 /* Hash a from tree in a tree_map. */
5840 tree_map_hash (const void *item
)
5842 return (((const struct tree_map
*) item
)->hash
);
5845 /* Hash a from tree in a tree_decl_map. */
5848 tree_decl_map_hash (const void *item
)
5850 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5853 /* Return the initialization priority for DECL. */
5856 decl_init_priority_lookup (tree decl
)
5858 struct tree_priority_map
*h
;
5859 struct tree_map_base in
;
5861 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5863 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5864 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5867 /* Return the finalization priority for DECL. */
5870 decl_fini_priority_lookup (tree decl
)
5872 struct tree_priority_map
*h
;
5873 struct tree_map_base in
;
5875 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5877 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5878 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5881 /* Return the initialization and finalization priority information for
5882 DECL. If there is no previous priority information, a freshly
5883 allocated structure is returned. */
5885 static struct tree_priority_map
*
5886 decl_priority_info (tree decl
)
5888 struct tree_priority_map in
;
5889 struct tree_priority_map
*h
;
5892 in
.base
.from
= decl
;
5893 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5894 h
= (struct tree_priority_map
*) *loc
;
5897 h
= ggc_alloc_cleared_tree_priority_map ();
5899 h
->base
.from
= decl
;
5900 h
->init
= DEFAULT_INIT_PRIORITY
;
5901 h
->fini
= DEFAULT_INIT_PRIORITY
;
5907 /* Set the initialization priority for DECL to PRIORITY. */
5910 decl_init_priority_insert (tree decl
, priority_type priority
)
5912 struct tree_priority_map
*h
;
5914 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5915 h
= decl_priority_info (decl
);
5919 /* Set the finalization priority for DECL to PRIORITY. */
5922 decl_fini_priority_insert (tree decl
, priority_type priority
)
5924 struct tree_priority_map
*h
;
5926 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5927 h
= decl_priority_info (decl
);
5931 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5934 print_debug_expr_statistics (void)
5936 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5937 (long) htab_size (debug_expr_for_decl
),
5938 (long) htab_elements (debug_expr_for_decl
),
5939 htab_collisions (debug_expr_for_decl
));
5942 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5945 print_value_expr_statistics (void)
5947 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5948 (long) htab_size (value_expr_for_decl
),
5949 (long) htab_elements (value_expr_for_decl
),
5950 htab_collisions (value_expr_for_decl
));
5953 /* Lookup a debug expression for FROM, and return it if we find one. */
5956 decl_debug_expr_lookup (tree from
)
5958 struct tree_decl_map
*h
, in
;
5959 in
.base
.from
= from
;
5961 h
= (struct tree_decl_map
*)
5962 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
5968 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5971 decl_debug_expr_insert (tree from
, tree to
)
5973 struct tree_decl_map
*h
;
5976 h
= ggc_alloc_tree_decl_map ();
5977 h
->base
.from
= from
;
5979 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
5981 *(struct tree_decl_map
**) loc
= h
;
5984 /* Lookup a value expression for FROM, and return it if we find one. */
5987 decl_value_expr_lookup (tree from
)
5989 struct tree_decl_map
*h
, in
;
5990 in
.base
.from
= from
;
5992 h
= (struct tree_decl_map
*)
5993 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
5999 /* Insert a mapping FROM->TO in the value expression hashtable. */
6002 decl_value_expr_insert (tree from
, tree to
)
6004 struct tree_decl_map
*h
;
6007 h
= ggc_alloc_tree_decl_map ();
6008 h
->base
.from
= from
;
6010 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6012 *(struct tree_decl_map
**) loc
= h
;
6015 /* Hashing of types so that we don't make duplicates.
6016 The entry point is `type_hash_canon'. */
6018 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6019 with types in the TREE_VALUE slots), by adding the hash codes
6020 of the individual types. */
6023 type_hash_list (const_tree list
, hashval_t hashcode
)
6027 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6028 if (TREE_VALUE (tail
) != error_mark_node
)
6029 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6035 /* These are the Hashtable callback functions. */
6037 /* Returns true iff the types are equivalent. */
6040 type_hash_eq (const void *va
, const void *vb
)
6042 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6043 *const b
= (const struct type_hash
*) vb
;
6045 /* First test the things that are the same for all types. */
6046 if (a
->hash
!= b
->hash
6047 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6048 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6049 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6050 TYPE_ATTRIBUTES (b
->type
))
6051 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6052 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6055 /* Be careful about comparing arrays before and after the element type
6056 has been completed; don't compare TYPE_ALIGN unless both types are
6058 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6059 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6060 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6063 switch (TREE_CODE (a
->type
))
6068 case REFERENCE_TYPE
:
6072 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6075 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6076 && !(TYPE_VALUES (a
->type
)
6077 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6078 && TYPE_VALUES (b
->type
)
6079 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6080 && type_list_equal (TYPE_VALUES (a
->type
),
6081 TYPE_VALUES (b
->type
))))
6084 /* ... fall through ... */
6089 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6090 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6091 TYPE_MAX_VALUE (b
->type
)))
6092 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6093 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6094 TYPE_MIN_VALUE (b
->type
))));
6096 case FIXED_POINT_TYPE
:
6097 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6100 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6103 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6104 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6105 || (TYPE_ARG_TYPES (a
->type
)
6106 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6107 && TYPE_ARG_TYPES (b
->type
)
6108 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6109 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6110 TYPE_ARG_TYPES (b
->type
)))))
6114 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6118 case QUAL_UNION_TYPE
:
6119 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6120 || (TYPE_FIELDS (a
->type
)
6121 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6122 && TYPE_FIELDS (b
->type
)
6123 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6124 && type_list_equal (TYPE_FIELDS (a
->type
),
6125 TYPE_FIELDS (b
->type
))));
6128 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6129 || (TYPE_ARG_TYPES (a
->type
)
6130 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6131 && TYPE_ARG_TYPES (b
->type
)
6132 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6133 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6134 TYPE_ARG_TYPES (b
->type
))))
6142 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6143 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6148 /* Return the cached hash value. */
6151 type_hash_hash (const void *item
)
6153 return ((const struct type_hash
*) item
)->hash
;
6156 /* Look in the type hash table for a type isomorphic to TYPE.
6157 If one is found, return it. Otherwise return 0. */
6160 type_hash_lookup (hashval_t hashcode
, tree type
)
6162 struct type_hash
*h
, in
;
6164 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6165 must call that routine before comparing TYPE_ALIGNs. */
6171 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6178 /* Add an entry to the type-hash-table
6179 for a type TYPE whose hash code is HASHCODE. */
6182 type_hash_add (hashval_t hashcode
, tree type
)
6184 struct type_hash
*h
;
6187 h
= ggc_alloc_type_hash ();
6190 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6194 /* Given TYPE, and HASHCODE its hash code, return the canonical
6195 object for an identical type if one already exists.
6196 Otherwise, return TYPE, and record it as the canonical object.
6198 To use this function, first create a type of the sort you want.
6199 Then compute its hash code from the fields of the type that
6200 make it different from other similar types.
6201 Then call this function and use the value. */
6204 type_hash_canon (unsigned int hashcode
, tree type
)
6208 /* The hash table only contains main variants, so ensure that's what we're
6210 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6212 /* See if the type is in the hash table already. If so, return it.
6213 Otherwise, add the type. */
6214 t1
= type_hash_lookup (hashcode
, type
);
6217 #ifdef GATHER_STATISTICS
6218 tree_node_counts
[(int) t_kind
]--;
6219 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
6225 type_hash_add (hashcode
, type
);
6230 /* See if the data pointed to by the type hash table is marked. We consider
6231 it marked if the type is marked or if a debug type number or symbol
6232 table entry has been made for the type. */
6235 type_hash_marked_p (const void *p
)
6237 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6239 return ggc_marked_p (type
);
6243 print_type_hash_statistics (void)
6245 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6246 (long) htab_size (type_hash_table
),
6247 (long) htab_elements (type_hash_table
),
6248 htab_collisions (type_hash_table
));
6251 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6252 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6253 by adding the hash codes of the individual attributes. */
6256 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6260 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6261 /* ??? Do we want to add in TREE_VALUE too? */
6262 hashcode
= iterative_hash_object
6263 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6267 /* Given two lists of attributes, return true if list l2 is
6268 equivalent to l1. */
6271 attribute_list_equal (const_tree l1
, const_tree l2
)
6273 return attribute_list_contained (l1
, l2
)
6274 && attribute_list_contained (l2
, l1
);
6277 /* Given two lists of attributes, return true if list L2 is
6278 completely contained within L1. */
6279 /* ??? This would be faster if attribute names were stored in a canonicalized
6280 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6281 must be used to show these elements are equivalent (which they are). */
6282 /* ??? It's not clear that attributes with arguments will always be handled
6286 attribute_list_contained (const_tree l1
, const_tree l2
)
6290 /* First check the obvious, maybe the lists are identical. */
6294 /* Maybe the lists are similar. */
6295 for (t1
= l1
, t2
= l2
;
6297 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6298 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6299 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6301 /* Maybe the lists are equal. */
6302 if (t1
== 0 && t2
== 0)
6305 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6308 /* This CONST_CAST is okay because lookup_attribute does not
6309 modify its argument and the return value is assigned to a
6311 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6312 CONST_CAST_TREE(l1
));
6313 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6314 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6318 if (attr
== NULL_TREE
)
6325 /* Given two lists of types
6326 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6327 return 1 if the lists contain the same types in the same order.
6328 Also, the TREE_PURPOSEs must match. */
6331 type_list_equal (const_tree l1
, const_tree l2
)
6335 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6336 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6337 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6338 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6339 && (TREE_TYPE (TREE_PURPOSE (t1
))
6340 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6346 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6347 given by TYPE. If the argument list accepts variable arguments,
6348 then this function counts only the ordinary arguments. */
6351 type_num_arguments (const_tree type
)
6356 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6357 /* If the function does not take a variable number of arguments,
6358 the last element in the list will have type `void'. */
6359 if (VOID_TYPE_P (TREE_VALUE (t
)))
6367 /* Nonzero if integer constants T1 and T2
6368 represent the same constant value. */
6371 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6376 if (t1
== 0 || t2
== 0)
6379 if (TREE_CODE (t1
) == INTEGER_CST
6380 && TREE_CODE (t2
) == INTEGER_CST
6381 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6382 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6388 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6389 The precise way of comparison depends on their data type. */
6392 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6397 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6399 int t1_sgn
= tree_int_cst_sgn (t1
);
6400 int t2_sgn
= tree_int_cst_sgn (t2
);
6402 if (t1_sgn
< t2_sgn
)
6404 else if (t1_sgn
> t2_sgn
)
6406 /* Otherwise, both are non-negative, so we compare them as
6407 unsigned just in case one of them would overflow a signed
6410 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6411 return INT_CST_LT (t1
, t2
);
6413 return INT_CST_LT_UNSIGNED (t1
, t2
);
6416 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6419 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6421 if (tree_int_cst_lt (t1
, t2
))
6423 else if (tree_int_cst_lt (t2
, t1
))
6429 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6430 the host. If POS is zero, the value can be represented in a single
6431 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6432 be represented in a single unsigned HOST_WIDE_INT. */
6435 host_integerp (const_tree t
, int pos
)
6440 return (TREE_CODE (t
) == INTEGER_CST
6441 && ((TREE_INT_CST_HIGH (t
) == 0
6442 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6443 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6444 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6445 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6446 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6447 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6448 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6451 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6452 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6453 be non-negative. We must be able to satisfy the above conditions. */
6456 tree_low_cst (const_tree t
, int pos
)
6458 gcc_assert (host_integerp (t
, pos
));
6459 return TREE_INT_CST_LOW (t
);
6462 /* Return the most significant bit of the integer constant T. */
6465 tree_int_cst_msb (const_tree t
)
6469 unsigned HOST_WIDE_INT l
;
6471 /* Note that using TYPE_PRECISION here is wrong. We care about the
6472 actual bits, not the (arbitrary) range of the type. */
6473 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6474 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6475 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6476 return (l
& 1) == 1;
6479 /* Return an indication of the sign of the integer constant T.
6480 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6481 Note that -1 will never be returned if T's type is unsigned. */
6484 tree_int_cst_sgn (const_tree t
)
6486 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6488 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6490 else if (TREE_INT_CST_HIGH (t
) < 0)
6496 /* Return the minimum number of bits needed to represent VALUE in a
6497 signed or unsigned type, UNSIGNEDP says which. */
6500 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6504 /* If the value is negative, compute its negative minus 1. The latter
6505 adjustment is because the absolute value of the largest negative value
6506 is one larger than the largest positive value. This is equivalent to
6507 a bit-wise negation, so use that operation instead. */
6509 if (tree_int_cst_sgn (value
) < 0)
6510 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6512 /* Return the number of bits needed, taking into account the fact
6513 that we need one more bit for a signed than unsigned type. */
6515 if (integer_zerop (value
))
6518 log
= tree_floor_log2 (value
);
6520 return log
+ 1 + !unsignedp
;
6523 /* Compare two constructor-element-type constants. Return 1 if the lists
6524 are known to be equal; otherwise return 0. */
6527 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6529 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6531 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6534 l1
= TREE_CHAIN (l1
);
6535 l2
= TREE_CHAIN (l2
);
6541 /* Return truthvalue of whether T1 is the same tree structure as T2.
6542 Return 1 if they are the same.
6543 Return 0 if they are understandably different.
6544 Return -1 if either contains tree structure not understood by
6548 simple_cst_equal (const_tree t1
, const_tree t2
)
6550 enum tree_code code1
, code2
;
6556 if (t1
== 0 || t2
== 0)
6559 code1
= TREE_CODE (t1
);
6560 code2
= TREE_CODE (t2
);
6562 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6564 if (CONVERT_EXPR_CODE_P (code2
)
6565 || code2
== NON_LVALUE_EXPR
)
6566 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6568 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6571 else if (CONVERT_EXPR_CODE_P (code2
)
6572 || code2
== NON_LVALUE_EXPR
)
6573 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6581 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6582 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6585 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6588 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6591 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6592 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6593 TREE_STRING_LENGTH (t1
)));
6597 unsigned HOST_WIDE_INT idx
;
6598 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6599 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6601 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6604 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6605 /* ??? Should we handle also fields here? */
6606 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6607 VEC_index (constructor_elt
, v2
, idx
)->value
))
6613 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6616 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6619 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6622 const_tree arg1
, arg2
;
6623 const_call_expr_arg_iterator iter1
, iter2
;
6624 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6625 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6627 arg1
= next_const_call_expr_arg (&iter1
),
6628 arg2
= next_const_call_expr_arg (&iter2
))
6630 cmp
= simple_cst_equal (arg1
, arg2
);
6634 return arg1
== arg2
;
6638 /* Special case: if either target is an unallocated VAR_DECL,
6639 it means that it's going to be unified with whatever the
6640 TARGET_EXPR is really supposed to initialize, so treat it
6641 as being equivalent to anything. */
6642 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6643 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6644 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6645 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6646 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6647 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6650 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6655 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6657 case WITH_CLEANUP_EXPR
:
6658 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6662 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6665 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6666 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6680 /* This general rule works for most tree codes. All exceptions should be
6681 handled above. If this is a language-specific tree code, we can't
6682 trust what might be in the operand, so say we don't know
6684 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6687 switch (TREE_CODE_CLASS (code1
))
6691 case tcc_comparison
:
6692 case tcc_expression
:
6696 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6698 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6710 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6711 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6712 than U, respectively. */
6715 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6717 if (tree_int_cst_sgn (t
) < 0)
6719 else if (TREE_INT_CST_HIGH (t
) != 0)
6721 else if (TREE_INT_CST_LOW (t
) == u
)
6723 else if (TREE_INT_CST_LOW (t
) < u
)
6729 /* Return true if CODE represents an associative tree code. Otherwise
6732 associative_tree_code (enum tree_code code
)
6751 /* Return true if CODE represents a commutative tree code. Otherwise
6754 commutative_tree_code (enum tree_code code
)
6767 case UNORDERED_EXPR
:
6771 case TRUTH_AND_EXPR
:
6772 case TRUTH_XOR_EXPR
:
6782 /* Return true if CODE represents a ternary tree code for which the
6783 first two operands are commutative. Otherwise return false. */
6785 commutative_ternary_tree_code (enum tree_code code
)
6789 case WIDEN_MULT_PLUS_EXPR
:
6790 case WIDEN_MULT_MINUS_EXPR
:
6799 /* Generate a hash value for an expression. This can be used iteratively
6800 by passing a previous result as the VAL argument.
6802 This function is intended to produce the same hash for expressions which
6803 would compare equal using operand_equal_p. */
6806 iterative_hash_expr (const_tree t
, hashval_t val
)
6809 enum tree_code code
;
6813 return iterative_hash_hashval_t (0, val
);
6815 code
= TREE_CODE (t
);
6819 /* Alas, constants aren't shared, so we can't rely on pointer
6822 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6823 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6826 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6828 return iterative_hash_hashval_t (val2
, val
);
6832 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6834 return iterative_hash_hashval_t (val2
, val
);
6837 return iterative_hash (TREE_STRING_POINTER (t
),
6838 TREE_STRING_LENGTH (t
), val
);
6840 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6841 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6843 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6845 /* We can just compare by pointer. */
6846 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6847 case PLACEHOLDER_EXPR
:
6848 /* The node itself doesn't matter. */
6851 /* A list of expressions, for a CALL_EXPR or as the elements of a
6853 for (; t
; t
= TREE_CHAIN (t
))
6854 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6858 unsigned HOST_WIDE_INT idx
;
6860 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6862 val
= iterative_hash_expr (field
, val
);
6863 val
= iterative_hash_expr (value
, val
);
6869 /* The type of the second operand is relevant, except for
6870 its top-level qualifiers. */
6871 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
6873 val
= iterative_hash_object (TYPE_HASH (type
), val
);
6875 /* We could use the standard hash computation from this point
6877 val
= iterative_hash_object (code
, val
);
6878 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
6879 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6883 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6884 Otherwise nodes that compare equal according to operand_equal_p might
6885 get different hash codes. However, don't do this for machine specific
6886 or front end builtins, since the function code is overloaded in those
6888 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6889 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6891 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6892 code
= TREE_CODE (t
);
6896 tclass
= TREE_CODE_CLASS (code
);
6898 if (tclass
== tcc_declaration
)
6900 /* DECL's have a unique ID */
6901 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6905 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6907 val
= iterative_hash_object (code
, val
);
6909 /* Don't hash the type, that can lead to having nodes which
6910 compare equal according to operand_equal_p, but which
6911 have different hash codes. */
6912 if (CONVERT_EXPR_CODE_P (code
)
6913 || code
== NON_LVALUE_EXPR
)
6915 /* Make sure to include signness in the hash computation. */
6916 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6917 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6920 else if (commutative_tree_code (code
))
6922 /* It's a commutative expression. We want to hash it the same
6923 however it appears. We do this by first hashing both operands
6924 and then rehashing based on the order of their independent
6926 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6927 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6931 t
= one
, one
= two
, two
= t
;
6933 val
= iterative_hash_hashval_t (one
, val
);
6934 val
= iterative_hash_hashval_t (two
, val
);
6937 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6938 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6945 /* Generate a hash value for a pair of expressions. This can be used
6946 iteratively by passing a previous result as the VAL argument.
6948 The same hash value is always returned for a given pair of expressions,
6949 regardless of the order in which they are presented. This is useful in
6950 hashing the operands of commutative functions. */
6953 iterative_hash_exprs_commutative (const_tree t1
,
6954 const_tree t2
, hashval_t val
)
6956 hashval_t one
= iterative_hash_expr (t1
, 0);
6957 hashval_t two
= iterative_hash_expr (t2
, 0);
6961 t
= one
, one
= two
, two
= t
;
6962 val
= iterative_hash_hashval_t (one
, val
);
6963 val
= iterative_hash_hashval_t (two
, val
);
6968 /* Constructors for pointer, array and function types.
6969 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6970 constructed by language-dependent code, not here.) */
6972 /* Construct, lay out and return the type of pointers to TO_TYPE with
6973 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6974 reference all of memory. If such a type has already been
6975 constructed, reuse it. */
6978 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6983 if (to_type
== error_mark_node
)
6984 return error_mark_node
;
6986 /* If the pointed-to type has the may_alias attribute set, force
6987 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6988 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6989 can_alias_all
= true;
6991 /* In some cases, languages will have things that aren't a POINTER_TYPE
6992 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6993 In that case, return that type without regard to the rest of our
6996 ??? This is a kludge, but consistent with the way this function has
6997 always operated and there doesn't seem to be a good way to avoid this
6999 if (TYPE_POINTER_TO (to_type
) != 0
7000 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7001 return TYPE_POINTER_TO (to_type
);
7003 /* First, if we already have a type for pointers to TO_TYPE and it's
7004 the proper mode, use it. */
7005 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7006 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7009 t
= make_node (POINTER_TYPE
);
7011 TREE_TYPE (t
) = to_type
;
7012 SET_TYPE_MODE (t
, mode
);
7013 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7014 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7015 TYPE_POINTER_TO (to_type
) = t
;
7017 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7018 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7019 else if (TYPE_CANONICAL (to_type
) != to_type
)
7021 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7022 mode
, can_alias_all
);
7024 /* Lay out the type. This function has many callers that are concerned
7025 with expression-construction, and this simplifies them all. */
7031 /* By default build pointers in ptr_mode. */
7034 build_pointer_type (tree to_type
)
7036 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7037 : TYPE_ADDR_SPACE (to_type
);
7038 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7039 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7042 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7045 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7050 if (to_type
== error_mark_node
)
7051 return error_mark_node
;
7053 /* If the pointed-to type has the may_alias attribute set, force
7054 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7055 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7056 can_alias_all
= true;
7058 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7059 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7060 In that case, return that type without regard to the rest of our
7063 ??? This is a kludge, but consistent with the way this function has
7064 always operated and there doesn't seem to be a good way to avoid this
7066 if (TYPE_REFERENCE_TO (to_type
) != 0
7067 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7068 return TYPE_REFERENCE_TO (to_type
);
7070 /* First, if we already have a type for pointers to TO_TYPE and it's
7071 the proper mode, use it. */
7072 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7073 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7076 t
= make_node (REFERENCE_TYPE
);
7078 TREE_TYPE (t
) = to_type
;
7079 SET_TYPE_MODE (t
, mode
);
7080 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7081 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7082 TYPE_REFERENCE_TO (to_type
) = t
;
7084 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7085 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7086 else if (TYPE_CANONICAL (to_type
) != to_type
)
7088 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7089 mode
, can_alias_all
);
7097 /* Build the node for the type of references-to-TO_TYPE by default
7101 build_reference_type (tree to_type
)
7103 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7104 : TYPE_ADDR_SPACE (to_type
);
7105 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7106 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7109 /* Build a type that is compatible with t but has no cv quals anywhere
7112 const char *const *const * -> char ***. */
7115 build_type_no_quals (tree t
)
7117 switch (TREE_CODE (t
))
7120 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7122 TYPE_REF_CAN_ALIAS_ALL (t
));
7123 case REFERENCE_TYPE
:
7125 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7127 TYPE_REF_CAN_ALIAS_ALL (t
));
7129 return TYPE_MAIN_VARIANT (t
);
7133 #define MAX_INT_CACHED_PREC \
7134 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7135 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7137 /* Builds a signed or unsigned integer type of precision PRECISION.
7138 Used for C bitfields whose precision does not match that of
7139 built-in target types. */
7141 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7147 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7149 if (precision
<= MAX_INT_CACHED_PREC
)
7151 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7156 itype
= make_node (INTEGER_TYPE
);
7157 TYPE_PRECISION (itype
) = precision
;
7160 fixup_unsigned_type (itype
);
7162 fixup_signed_type (itype
);
7165 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7166 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7167 if (precision
<= MAX_INT_CACHED_PREC
)
7168 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7173 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7174 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7175 is true, reuse such a type that has already been constructed. */
7178 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7180 tree itype
= make_node (INTEGER_TYPE
);
7181 hashval_t hashcode
= 0;
7183 TREE_TYPE (itype
) = type
;
7185 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7186 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7188 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7189 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7190 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7191 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7192 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7193 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7198 if ((TYPE_MIN_VALUE (itype
)
7199 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7200 || (TYPE_MAX_VALUE (itype
)
7201 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7203 /* Since we cannot reliably merge this type, we need to compare it using
7204 structural equality checks. */
7205 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7209 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7210 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7211 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7212 itype
= type_hash_canon (hashcode
, itype
);
7217 /* Wrapper around build_range_type_1 with SHARED set to true. */
7220 build_range_type (tree type
, tree lowval
, tree highval
)
7222 return build_range_type_1 (type
, lowval
, highval
, true);
7225 /* Wrapper around build_range_type_1 with SHARED set to false. */
7228 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7230 return build_range_type_1 (type
, lowval
, highval
, false);
7233 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7234 MAXVAL should be the maximum value in the domain
7235 (one less than the length of the array).
7237 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7238 We don't enforce this limit, that is up to caller (e.g. language front end).
7239 The limit exists because the result is a signed type and we don't handle
7240 sizes that use more than one HOST_WIDE_INT. */
7243 build_index_type (tree maxval
)
7245 return build_range_type (sizetype
, size_zero_node
, maxval
);
7248 /* Return true if the debug information for TYPE, a subtype, should be emitted
7249 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7250 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7251 debug info and doesn't reflect the source code. */
7254 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7256 tree base_type
= TREE_TYPE (type
), low
, high
;
7258 /* Subrange types have a base type which is an integral type. */
7259 if (!INTEGRAL_TYPE_P (base_type
))
7262 /* Get the real bounds of the subtype. */
7263 if (lang_hooks
.types
.get_subrange_bounds
)
7264 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7267 low
= TYPE_MIN_VALUE (type
);
7268 high
= TYPE_MAX_VALUE (type
);
7271 /* If the type and its base type have the same representation and the same
7272 name, then the type is not a subrange but a copy of the base type. */
7273 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7274 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7275 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7276 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7277 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7279 tree type_name
= TYPE_NAME (type
);
7280 tree base_type_name
= TYPE_NAME (base_type
);
7282 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7283 type_name
= DECL_NAME (type_name
);
7285 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7286 base_type_name
= DECL_NAME (base_type_name
);
7288 if (type_name
== base_type_name
)
7299 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7300 and number of elements specified by the range of values of INDEX_TYPE.
7301 If SHARED is true, reuse such a type that has already been constructed. */
7304 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7308 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7310 error ("arrays of functions are not meaningful");
7311 elt_type
= integer_type_node
;
7314 t
= make_node (ARRAY_TYPE
);
7315 TREE_TYPE (t
) = elt_type
;
7316 TYPE_DOMAIN (t
) = index_type
;
7317 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7320 /* If the element type is incomplete at this point we get marked for
7321 structural equality. Do not record these types in the canonical
7323 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7328 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7330 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7331 t
= type_hash_canon (hashcode
, t
);
7334 if (TYPE_CANONICAL (t
) == t
)
7336 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7337 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7338 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7339 else if (TYPE_CANONICAL (elt_type
) != elt_type
7340 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7342 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7344 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7351 /* Wrapper around build_array_type_1 with SHARED set to true. */
7354 build_array_type (tree elt_type
, tree index_type
)
7356 return build_array_type_1 (elt_type
, index_type
, true);
7359 /* Wrapper around build_array_type_1 with SHARED set to false. */
7362 build_nonshared_array_type (tree elt_type
, tree index_type
)
7364 return build_array_type_1 (elt_type
, index_type
, false);
7367 /* Recursively examines the array elements of TYPE, until a non-array
7368 element type is found. */
7371 strip_array_types (tree type
)
7373 while (TREE_CODE (type
) == ARRAY_TYPE
)
7374 type
= TREE_TYPE (type
);
7379 /* Computes the canonical argument types from the argument type list
7382 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7383 on entry to this function, or if any of the ARGTYPES are
7386 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7387 true on entry to this function, or if any of the ARGTYPES are
7390 Returns a canonical argument list, which may be ARGTYPES when the
7391 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7392 true) or would not differ from ARGTYPES. */
7395 maybe_canonicalize_argtypes(tree argtypes
,
7396 bool *any_structural_p
,
7397 bool *any_noncanonical_p
)
7400 bool any_noncanonical_argtypes_p
= false;
7402 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7404 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7405 /* Fail gracefully by stating that the type is structural. */
7406 *any_structural_p
= true;
7407 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7408 *any_structural_p
= true;
7409 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7410 || TREE_PURPOSE (arg
))
7411 /* If the argument has a default argument, we consider it
7412 non-canonical even though the type itself is canonical.
7413 That way, different variants of function and method types
7414 with default arguments will all point to the variant with
7415 no defaults as their canonical type. */
7416 any_noncanonical_argtypes_p
= true;
7419 if (*any_structural_p
)
7422 if (any_noncanonical_argtypes_p
)
7424 /* Build the canonical list of argument types. */
7425 tree canon_argtypes
= NULL_TREE
;
7426 bool is_void
= false;
7428 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7430 if (arg
== void_list_node
)
7433 canon_argtypes
= tree_cons (NULL_TREE
,
7434 TYPE_CANONICAL (TREE_VALUE (arg
)),
7438 canon_argtypes
= nreverse (canon_argtypes
);
7440 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7442 /* There is a non-canonical type. */
7443 *any_noncanonical_p
= true;
7444 return canon_argtypes
;
7447 /* The canonical argument types are the same as ARGTYPES. */
7451 /* Construct, lay out and return
7452 the type of functions returning type VALUE_TYPE
7453 given arguments of types ARG_TYPES.
7454 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7455 are data type nodes for the arguments of the function.
7456 If such a type has already been constructed, reuse it. */
7459 build_function_type (tree value_type
, tree arg_types
)
7462 hashval_t hashcode
= 0;
7463 bool any_structural_p
, any_noncanonical_p
;
7464 tree canon_argtypes
;
7466 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7468 error ("function return type cannot be function");
7469 value_type
= integer_type_node
;
7472 /* Make a node of the sort we want. */
7473 t
= make_node (FUNCTION_TYPE
);
7474 TREE_TYPE (t
) = value_type
;
7475 TYPE_ARG_TYPES (t
) = arg_types
;
7477 /* If we already have such a type, use the old one. */
7478 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7479 hashcode
= type_hash_list (arg_types
, hashcode
);
7480 t
= type_hash_canon (hashcode
, t
);
7482 /* Set up the canonical type. */
7483 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7484 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7485 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7487 &any_noncanonical_p
);
7488 if (any_structural_p
)
7489 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7490 else if (any_noncanonical_p
)
7491 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7494 if (!COMPLETE_TYPE_P (t
))
7499 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7502 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7504 tree new_type
= NULL
;
7505 tree args
, new_args
= NULL
, t
;
7509 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7510 args
= TREE_CHAIN (args
), i
++)
7511 if (!bitmap_bit_p (args_to_skip
, i
))
7512 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7514 new_reversed
= nreverse (new_args
);
7518 TREE_CHAIN (new_args
) = void_list_node
;
7520 new_reversed
= void_list_node
;
7523 /* Use copy_node to preserve as much as possible from original type
7524 (debug info, attribute lists etc.)
7525 Exception is METHOD_TYPEs must have THIS argument.
7526 When we are asked to remove it, we need to build new FUNCTION_TYPE
7528 if (TREE_CODE (orig_type
) != METHOD_TYPE
7529 || !bitmap_bit_p (args_to_skip
, 0))
7531 new_type
= build_distinct_type_copy (orig_type
);
7532 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7537 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7539 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7542 /* This is a new type, not a copy of an old type. Need to reassociate
7543 variants. We can handle everything except the main variant lazily. */
7544 t
= TYPE_MAIN_VARIANT (orig_type
);
7547 TYPE_MAIN_VARIANT (new_type
) = t
;
7548 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7549 TYPE_NEXT_VARIANT (t
) = new_type
;
7553 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7554 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7559 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7561 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7562 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7563 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7566 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7568 tree new_decl
= copy_node (orig_decl
);
7571 new_type
= TREE_TYPE (orig_decl
);
7572 if (prototype_p (new_type
))
7573 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7574 TREE_TYPE (new_decl
) = new_type
;
7576 /* For declarations setting DECL_VINDEX (i.e. methods)
7577 we expect first argument to be THIS pointer. */
7578 if (bitmap_bit_p (args_to_skip
, 0))
7579 DECL_VINDEX (new_decl
) = NULL_TREE
;
7581 /* When signature changes, we need to clear builtin info. */
7582 if (DECL_BUILT_IN (new_decl
) && !bitmap_empty_p (args_to_skip
))
7584 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7585 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7590 /* Build a function type. The RETURN_TYPE is the type returned by the
7591 function. If VAARGS is set, no void_type_node is appended to the
7592 the list. ARGP must be always be terminated be a NULL_TREE. */
7595 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7599 t
= va_arg (argp
, tree
);
7600 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7601 args
= tree_cons (NULL_TREE
, t
, args
);
7606 if (args
!= NULL_TREE
)
7607 args
= nreverse (args
);
7608 gcc_assert (last
!= void_list_node
);
7610 else if (args
== NULL_TREE
)
7611 args
= void_list_node
;
7615 args
= nreverse (args
);
7616 TREE_CHAIN (last
) = void_list_node
;
7618 args
= build_function_type (return_type
, args
);
7623 /* Build a function type. The RETURN_TYPE is the type returned by the
7624 function. If additional arguments are provided, they are
7625 additional argument types. The list of argument types must always
7626 be terminated by NULL_TREE. */
7629 build_function_type_list (tree return_type
, ...)
7634 va_start (p
, return_type
);
7635 args
= build_function_type_list_1 (false, return_type
, p
);
7640 /* Build a variable argument function type. The RETURN_TYPE is the
7641 type returned by the function. If additional arguments are provided,
7642 they are additional argument types. The list of argument types must
7643 always be terminated by NULL_TREE. */
7646 build_varargs_function_type_list (tree return_type
, ...)
7651 va_start (p
, return_type
);
7652 args
= build_function_type_list_1 (true, return_type
, p
);
7658 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7659 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7660 for the method. An implicit additional parameter (of type
7661 pointer-to-BASETYPE) is added to the ARGTYPES. */
7664 build_method_type_directly (tree basetype
,
7671 bool any_structural_p
, any_noncanonical_p
;
7672 tree canon_argtypes
;
7674 /* Make a node of the sort we want. */
7675 t
= make_node (METHOD_TYPE
);
7677 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7678 TREE_TYPE (t
) = rettype
;
7679 ptype
= build_pointer_type (basetype
);
7681 /* The actual arglist for this function includes a "hidden" argument
7682 which is "this". Put it into the list of argument types. */
7683 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7684 TYPE_ARG_TYPES (t
) = argtypes
;
7686 /* If we already have such a type, use the old one. */
7687 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7688 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7689 hashcode
= type_hash_list (argtypes
, hashcode
);
7690 t
= type_hash_canon (hashcode
, t
);
7692 /* Set up the canonical type. */
7694 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7695 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7697 = (TYPE_CANONICAL (basetype
) != basetype
7698 || TYPE_CANONICAL (rettype
) != rettype
);
7699 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7701 &any_noncanonical_p
);
7702 if (any_structural_p
)
7703 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7704 else if (any_noncanonical_p
)
7706 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7707 TYPE_CANONICAL (rettype
),
7709 if (!COMPLETE_TYPE_P (t
))
7715 /* Construct, lay out and return the type of methods belonging to class
7716 BASETYPE and whose arguments and values are described by TYPE.
7717 If that type exists already, reuse it.
7718 TYPE must be a FUNCTION_TYPE node. */
7721 build_method_type (tree basetype
, tree type
)
7723 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7725 return build_method_type_directly (basetype
,
7727 TYPE_ARG_TYPES (type
));
7730 /* Construct, lay out and return the type of offsets to a value
7731 of type TYPE, within an object of type BASETYPE.
7732 If a suitable offset type exists already, reuse it. */
7735 build_offset_type (tree basetype
, tree type
)
7738 hashval_t hashcode
= 0;
7740 /* Make a node of the sort we want. */
7741 t
= make_node (OFFSET_TYPE
);
7743 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7744 TREE_TYPE (t
) = type
;
7746 /* If we already have such a type, use the old one. */
7747 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7748 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7749 t
= type_hash_canon (hashcode
, t
);
7751 if (!COMPLETE_TYPE_P (t
))
7754 if (TYPE_CANONICAL (t
) == t
)
7756 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7757 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7758 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7759 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7760 || TYPE_CANONICAL (type
) != type
)
7762 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7763 TYPE_CANONICAL (type
));
7769 /* Create a complex type whose components are COMPONENT_TYPE. */
7772 build_complex_type (tree component_type
)
7777 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7778 || SCALAR_FLOAT_TYPE_P (component_type
)
7779 || FIXED_POINT_TYPE_P (component_type
));
7781 /* Make a node of the sort we want. */
7782 t
= make_node (COMPLEX_TYPE
);
7784 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7786 /* If we already have such a type, use the old one. */
7787 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7788 t
= type_hash_canon (hashcode
, t
);
7790 if (!COMPLETE_TYPE_P (t
))
7793 if (TYPE_CANONICAL (t
) == t
)
7795 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7796 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7797 else if (TYPE_CANONICAL (component_type
) != component_type
)
7799 = build_complex_type (TYPE_CANONICAL (component_type
));
7802 /* We need to create a name, since complex is a fundamental type. */
7803 if (! TYPE_NAME (t
))
7806 if (component_type
== char_type_node
)
7807 name
= "complex char";
7808 else if (component_type
== signed_char_type_node
)
7809 name
= "complex signed char";
7810 else if (component_type
== unsigned_char_type_node
)
7811 name
= "complex unsigned char";
7812 else if (component_type
== short_integer_type_node
)
7813 name
= "complex short int";
7814 else if (component_type
== short_unsigned_type_node
)
7815 name
= "complex short unsigned int";
7816 else if (component_type
== integer_type_node
)
7817 name
= "complex int";
7818 else if (component_type
== unsigned_type_node
)
7819 name
= "complex unsigned int";
7820 else if (component_type
== long_integer_type_node
)
7821 name
= "complex long int";
7822 else if (component_type
== long_unsigned_type_node
)
7823 name
= "complex long unsigned int";
7824 else if (component_type
== long_long_integer_type_node
)
7825 name
= "complex long long int";
7826 else if (component_type
== long_long_unsigned_type_node
)
7827 name
= "complex long long unsigned int";
7832 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7833 get_identifier (name
), t
);
7836 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7839 /* If TYPE is a real or complex floating-point type and the target
7840 does not directly support arithmetic on TYPE then return the wider
7841 type to be used for arithmetic on TYPE. Otherwise, return
7845 excess_precision_type (tree type
)
7847 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7849 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7850 switch (TREE_CODE (type
))
7853 switch (flt_eval_method
)
7856 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7857 return double_type_node
;
7860 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7861 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7862 return long_double_type_node
;
7869 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7871 switch (flt_eval_method
)
7874 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7875 return complex_double_type_node
;
7878 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7879 || (TYPE_MODE (TREE_TYPE (type
))
7880 == TYPE_MODE (double_type_node
)))
7881 return complex_long_double_type_node
;
7894 /* Return OP, stripped of any conversions to wider types as much as is safe.
7895 Converting the value back to OP's type makes a value equivalent to OP.
7897 If FOR_TYPE is nonzero, we return a value which, if converted to
7898 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7900 OP must have integer, real or enumeral type. Pointers are not allowed!
7902 There are some cases where the obvious value we could return
7903 would regenerate to OP if converted to OP's type,
7904 but would not extend like OP to wider types.
7905 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7906 For example, if OP is (unsigned short)(signed char)-1,
7907 we avoid returning (signed char)-1 if FOR_TYPE is int,
7908 even though extending that to an unsigned short would regenerate OP,
7909 since the result of extending (signed char)-1 to (int)
7910 is different from (int) OP. */
7913 get_unwidened (tree op
, tree for_type
)
7915 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7916 tree type
= TREE_TYPE (op
);
7918 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7920 = (for_type
!= 0 && for_type
!= type
7921 && final_prec
> TYPE_PRECISION (type
)
7922 && TYPE_UNSIGNED (type
));
7925 while (CONVERT_EXPR_P (op
))
7929 /* TYPE_PRECISION on vector types has different meaning
7930 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7931 so avoid them here. */
7932 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7935 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7936 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7938 /* Truncations are many-one so cannot be removed.
7939 Unless we are later going to truncate down even farther. */
7941 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7944 /* See what's inside this conversion. If we decide to strip it,
7946 op
= TREE_OPERAND (op
, 0);
7948 /* If we have not stripped any zero-extensions (uns is 0),
7949 we can strip any kind of extension.
7950 If we have previously stripped a zero-extension,
7951 only zero-extensions can safely be stripped.
7952 Any extension can be stripped if the bits it would produce
7953 are all going to be discarded later by truncating to FOR_TYPE. */
7957 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7959 /* TYPE_UNSIGNED says whether this is a zero-extension.
7960 Let's avoid computing it if it does not affect WIN
7961 and if UNS will not be needed again. */
7963 || CONVERT_EXPR_P (op
))
7964 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7972 /* If we finally reach a constant see if it fits in for_type and
7973 in that case convert it. */
7975 && TREE_CODE (win
) == INTEGER_CST
7976 && TREE_TYPE (win
) != for_type
7977 && int_fits_type_p (win
, for_type
))
7978 win
= fold_convert (for_type
, win
);
7983 /* Return OP or a simpler expression for a narrower value
7984 which can be sign-extended or zero-extended to give back OP.
7985 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7986 or 0 if the value should be sign-extended. */
7989 get_narrower (tree op
, int *unsignedp_ptr
)
7994 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7996 while (TREE_CODE (op
) == NOP_EXPR
)
7999 = (TYPE_PRECISION (TREE_TYPE (op
))
8000 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8002 /* Truncations are many-one so cannot be removed. */
8006 /* See what's inside this conversion. If we decide to strip it,
8011 op
= TREE_OPERAND (op
, 0);
8012 /* An extension: the outermost one can be stripped,
8013 but remember whether it is zero or sign extension. */
8015 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8016 /* Otherwise, if a sign extension has been stripped,
8017 only sign extensions can now be stripped;
8018 if a zero extension has been stripped, only zero-extensions. */
8019 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8023 else /* bitschange == 0 */
8025 /* A change in nominal type can always be stripped, but we must
8026 preserve the unsignedness. */
8028 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8030 op
= TREE_OPERAND (op
, 0);
8031 /* Keep trying to narrow, but don't assign op to win if it
8032 would turn an integral type into something else. */
8033 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8040 if (TREE_CODE (op
) == COMPONENT_REF
8041 /* Since type_for_size always gives an integer type. */
8042 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8043 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8044 /* Ensure field is laid out already. */
8045 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8046 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8048 unsigned HOST_WIDE_INT innerprec
8049 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8050 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8051 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8052 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8054 /* We can get this structure field in a narrower type that fits it,
8055 but the resulting extension to its nominal type (a fullword type)
8056 must satisfy the same conditions as for other extensions.
8058 Do this only for fields that are aligned (not bit-fields),
8059 because when bit-field insns will be used there is no
8060 advantage in doing this. */
8062 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8063 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8064 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8068 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8069 win
= fold_convert (type
, op
);
8073 *unsignedp_ptr
= uns
;
8077 /* Returns true if integer constant C has a value that is permissible
8078 for type TYPE (an INTEGER_TYPE). */
8081 int_fits_type_p (const_tree c
, const_tree type
)
8083 tree type_low_bound
, type_high_bound
;
8084 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8087 dc
= tree_to_double_int (c
);
8088 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8090 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
8091 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
8093 /* So c is an unsigned integer whose type is sizetype and type is not.
8094 sizetype'd integers are sign extended even though they are
8095 unsigned. If the integer value fits in the lower end word of c,
8096 and if the higher end word has all its bits set to 1, that
8097 means the higher end bits are set to 1 only for sign extension.
8098 So let's convert c into an equivalent zero extended unsigned
8100 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
8103 type_low_bound
= TYPE_MIN_VALUE (type
);
8104 type_high_bound
= TYPE_MAX_VALUE (type
);
8106 /* If at least one bound of the type is a constant integer, we can check
8107 ourselves and maybe make a decision. If no such decision is possible, but
8108 this type is a subtype, try checking against that. Otherwise, use
8109 double_int_fits_to_tree_p, which checks against the precision.
8111 Compute the status for each possibly constant bound, and return if we see
8112 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8113 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8114 for "constant known to fit". */
8116 /* Check if c >= type_low_bound. */
8117 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8119 dd
= tree_to_double_int (type_low_bound
);
8120 if (TREE_CODE (type
) == INTEGER_TYPE
8121 && TYPE_IS_SIZETYPE (type
)
8122 && TYPE_UNSIGNED (type
))
8123 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8124 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8126 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8127 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8129 if (c_neg
&& !t_neg
)
8131 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8134 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8136 ok_for_low_bound
= true;
8139 ok_for_low_bound
= false;
8141 /* Check if c <= type_high_bound. */
8142 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8144 dd
= tree_to_double_int (type_high_bound
);
8145 if (TREE_CODE (type
) == INTEGER_TYPE
8146 && TYPE_IS_SIZETYPE (type
)
8147 && TYPE_UNSIGNED (type
))
8148 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8149 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8151 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8152 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8154 if (t_neg
&& !c_neg
)
8156 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8159 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8161 ok_for_high_bound
= true;
8164 ok_for_high_bound
= false;
8166 /* If the constant fits both bounds, the result is known. */
8167 if (ok_for_low_bound
&& ok_for_high_bound
)
8170 /* Perform some generic filtering which may allow making a decision
8171 even if the bounds are not constant. First, negative integers
8172 never fit in unsigned types, */
8173 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8176 /* Second, narrower types always fit in wider ones. */
8177 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8180 /* Third, unsigned integers with top bit set never fit signed types. */
8181 if (! TYPE_UNSIGNED (type
) && unsc
)
8183 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8184 if (prec
< HOST_BITS_PER_WIDE_INT
)
8186 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8189 else if (((((unsigned HOST_WIDE_INT
) 1)
8190 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8194 /* If we haven't been able to decide at this point, there nothing more we
8195 can check ourselves here. Look at the base type if we have one and it
8196 has the same precision. */
8197 if (TREE_CODE (type
) == INTEGER_TYPE
8198 && TREE_TYPE (type
) != 0
8199 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8201 type
= TREE_TYPE (type
);
8205 /* Or to double_int_fits_to_tree_p, if nothing else. */
8206 return double_int_fits_to_tree_p (type
, dc
);
8209 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8210 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8211 represented (assuming two's-complement arithmetic) within the bit
8212 precision of the type are returned instead. */
8215 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8217 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8218 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8219 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8220 TYPE_UNSIGNED (type
));
8223 if (TYPE_UNSIGNED (type
))
8224 mpz_set_ui (min
, 0);
8228 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8229 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8230 TYPE_PRECISION (type
));
8231 mpz_set_double_int (min
, mn
, false);
8235 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8236 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8237 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8238 TYPE_UNSIGNED (type
));
8241 if (TYPE_UNSIGNED (type
))
8242 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8245 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8250 /* Return true if VAR is an automatic variable defined in function FN. */
8253 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8255 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8256 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8257 || TREE_CODE (var
) == PARM_DECL
)
8258 && ! TREE_STATIC (var
))
8259 || TREE_CODE (var
) == LABEL_DECL
8260 || TREE_CODE (var
) == RESULT_DECL
));
8263 /* Subprogram of following function. Called by walk_tree.
8265 Return *TP if it is an automatic variable or parameter of the
8266 function passed in as DATA. */
8269 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8271 tree fn
= (tree
) data
;
8276 else if (DECL_P (*tp
)
8277 && auto_var_in_fn_p (*tp
, fn
))
8283 /* Returns true if T is, contains, or refers to a type with variable
8284 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8285 arguments, but not the return type. If FN is nonzero, only return
8286 true if a modifier of the type or position of FN is a variable or
8287 parameter inside FN.
8289 This concept is more general than that of C99 'variably modified types':
8290 in C99, a struct type is never variably modified because a VLA may not
8291 appear as a structure member. However, in GNU C code like:
8293 struct S { int i[f()]; };
8295 is valid, and other languages may define similar constructs. */
8298 variably_modified_type_p (tree type
, tree fn
)
8302 /* Test if T is either variable (if FN is zero) or an expression containing
8303 a variable in FN. */
8304 #define RETURN_TRUE_IF_VAR(T) \
8305 do { tree _t = (T); \
8306 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8307 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8308 return true; } while (0)
8310 if (type
== error_mark_node
)
8313 /* If TYPE itself has variable size, it is variably modified. */
8314 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8315 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8317 switch (TREE_CODE (type
))
8320 case REFERENCE_TYPE
:
8322 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8328 /* If TYPE is a function type, it is variably modified if the
8329 return type is variably modified. */
8330 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8336 case FIXED_POINT_TYPE
:
8339 /* Scalar types are variably modified if their end points
8341 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8342 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8347 case QUAL_UNION_TYPE
:
8348 /* We can't see if any of the fields are variably-modified by the
8349 definition we normally use, since that would produce infinite
8350 recursion via pointers. */
8351 /* This is variably modified if some field's type is. */
8352 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8353 if (TREE_CODE (t
) == FIELD_DECL
)
8355 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8356 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8357 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8359 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8360 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8365 /* Do not call ourselves to avoid infinite recursion. This is
8366 variably modified if the element type is. */
8367 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8368 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8375 /* The current language may have other cases to check, but in general,
8376 all other types are not variably modified. */
8377 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8379 #undef RETURN_TRUE_IF_VAR
8382 /* Given a DECL or TYPE, return the scope in which it was declared, or
8383 NULL_TREE if there is no containing scope. */
8386 get_containing_scope (const_tree t
)
8388 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8391 /* Return the innermost context enclosing DECL that is
8392 a FUNCTION_DECL, or zero if none. */
8395 decl_function_context (const_tree decl
)
8399 if (TREE_CODE (decl
) == ERROR_MARK
)
8402 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8403 where we look up the function at runtime. Such functions always take
8404 a first argument of type 'pointer to real context'.
8406 C++ should really be fixed to use DECL_CONTEXT for the real context,
8407 and use something else for the "virtual context". */
8408 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8411 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8413 context
= DECL_CONTEXT (decl
);
8415 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8417 if (TREE_CODE (context
) == BLOCK
)
8418 context
= BLOCK_SUPERCONTEXT (context
);
8420 context
= get_containing_scope (context
);
8426 /* Return the innermost context enclosing DECL that is
8427 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8428 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8431 decl_type_context (const_tree decl
)
8433 tree context
= DECL_CONTEXT (decl
);
8436 switch (TREE_CODE (context
))
8438 case NAMESPACE_DECL
:
8439 case TRANSLATION_UNIT_DECL
:
8444 case QUAL_UNION_TYPE
:
8449 context
= DECL_CONTEXT (context
);
8453 context
= BLOCK_SUPERCONTEXT (context
);
8463 /* CALL is a CALL_EXPR. Return the declaration for the function
8464 called, or NULL_TREE if the called function cannot be
8468 get_callee_fndecl (const_tree call
)
8472 if (call
== error_mark_node
)
8473 return error_mark_node
;
8475 /* It's invalid to call this function with anything but a
8477 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8479 /* The first operand to the CALL is the address of the function
8481 addr
= CALL_EXPR_FN (call
);
8485 /* If this is a readonly function pointer, extract its initial value. */
8486 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8487 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8488 && DECL_INITIAL (addr
))
8489 addr
= DECL_INITIAL (addr
);
8491 /* If the address is just `&f' for some function `f', then we know
8492 that `f' is being called. */
8493 if (TREE_CODE (addr
) == ADDR_EXPR
8494 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8495 return TREE_OPERAND (addr
, 0);
8497 /* We couldn't figure out what was being called. */
8501 /* Print debugging information about tree nodes generated during the compile,
8502 and any language-specific information. */
8505 dump_tree_statistics (void)
8507 #ifdef GATHER_STATISTICS
8509 int total_nodes
, total_bytes
;
8512 fprintf (stderr
, "\n??? tree nodes created\n\n");
8513 #ifdef GATHER_STATISTICS
8514 fprintf (stderr
, "Kind Nodes Bytes\n");
8515 fprintf (stderr
, "---------------------------------------\n");
8516 total_nodes
= total_bytes
= 0;
8517 for (i
= 0; i
< (int) all_kinds
; i
++)
8519 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8520 tree_node_counts
[i
], tree_node_sizes
[i
]);
8521 total_nodes
+= tree_node_counts
[i
];
8522 total_bytes
+= tree_node_sizes
[i
];
8524 fprintf (stderr
, "---------------------------------------\n");
8525 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8526 fprintf (stderr
, "---------------------------------------\n");
8527 ssanames_print_statistics ();
8528 phinodes_print_statistics ();
8530 fprintf (stderr
, "(No per-node statistics)\n");
8532 print_type_hash_statistics ();
8533 print_debug_expr_statistics ();
8534 print_value_expr_statistics ();
8535 lang_hooks
.print_statistics ();
8538 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8540 /* Generate a crc32 of a string. */
8543 crc32_string (unsigned chksum
, const char *string
)
8547 unsigned value
= *string
<< 24;
8550 for (ix
= 8; ix
--; value
<<= 1)
8554 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8563 /* P is a string that will be used in a symbol. Mask out any characters
8564 that are not valid in that context. */
8567 clean_symbol_name (char *p
)
8571 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8574 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8581 /* Generate a name for a special-purpose function function.
8582 The generated name may need to be unique across the whole link.
8583 TYPE is some string to identify the purpose of this function to the
8584 linker or collect2; it must start with an uppercase letter,
8586 I - for constructors
8588 N - for C++ anonymous namespaces
8589 F - for DWARF unwind frame information. */
8592 get_file_function_name (const char *type
)
8598 /* If we already have a name we know to be unique, just use that. */
8599 if (first_global_object_name
)
8600 p
= q
= ASTRDUP (first_global_object_name
);
8601 /* If the target is handling the constructors/destructors, they
8602 will be local to this file and the name is only necessary for
8604 We also assign sub_I and sub_D sufixes to constructors called from
8605 the global static constructors. These are always local. */
8606 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8607 || (strncmp (type
, "sub_", 4) == 0
8608 && (type
[4] == 'I' || type
[4] == 'D')))
8610 const char *file
= main_input_filename
;
8612 file
= input_filename
;
8613 /* Just use the file's basename, because the full pathname
8614 might be quite long. */
8615 p
= strrchr (file
, '/');
8620 p
= q
= ASTRDUP (p
);
8624 /* Otherwise, the name must be unique across the entire link.
8625 We don't have anything that we know to be unique to this translation
8626 unit, so use what we do have and throw in some randomness. */
8628 const char *name
= weak_global_object_name
;
8629 const char *file
= main_input_filename
;
8634 file
= input_filename
;
8636 len
= strlen (file
);
8637 q
= (char *) alloca (9 * 2 + len
+ 1);
8638 memcpy (q
, file
, len
+ 1);
8640 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8641 crc32_string (0, get_random_seed (false)));
8646 clean_symbol_name (q
);
8647 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8650 /* Set up the name of the file-level functions we may need.
8651 Use a global object (which is already required to be unique over
8652 the program) rather than the file name (which imposes extra
8654 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8656 return get_identifier (buf
);
8659 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8661 /* Complain that the tree code of NODE does not match the expected 0
8662 terminated list of trailing codes. The trailing code list can be
8663 empty, for a more vague error message. FILE, LINE, and FUNCTION
8664 are of the caller. */
8667 tree_check_failed (const_tree node
, const char *file
,
8668 int line
, const char *function
, ...)
8672 unsigned length
= 0;
8675 va_start (args
, function
);
8676 while ((code
= va_arg (args
, int)))
8677 length
+= 4 + strlen (tree_code_name
[code
]);
8682 va_start (args
, function
);
8683 length
+= strlen ("expected ");
8684 buffer
= tmp
= (char *) alloca (length
);
8686 while ((code
= va_arg (args
, int)))
8688 const char *prefix
= length
? " or " : "expected ";
8690 strcpy (tmp
+ length
, prefix
);
8691 length
+= strlen (prefix
);
8692 strcpy (tmp
+ length
, tree_code_name
[code
]);
8693 length
+= strlen (tree_code_name
[code
]);
8698 buffer
= "unexpected node";
8700 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8701 buffer
, tree_code_name
[TREE_CODE (node
)],
8702 function
, trim_filename (file
), line
);
8705 /* Complain that the tree code of NODE does match the expected 0
8706 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8710 tree_not_check_failed (const_tree node
, const char *file
,
8711 int line
, const char *function
, ...)
8715 unsigned length
= 0;
8718 va_start (args
, function
);
8719 while ((code
= va_arg (args
, int)))
8720 length
+= 4 + strlen (tree_code_name
[code
]);
8722 va_start (args
, function
);
8723 buffer
= (char *) alloca (length
);
8725 while ((code
= va_arg (args
, int)))
8729 strcpy (buffer
+ length
, " or ");
8732 strcpy (buffer
+ length
, tree_code_name
[code
]);
8733 length
+= strlen (tree_code_name
[code
]);
8737 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8738 buffer
, tree_code_name
[TREE_CODE (node
)],
8739 function
, trim_filename (file
), line
);
8742 /* Similar to tree_check_failed, except that we check for a class of tree
8743 code, given in CL. */
8746 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8747 const char *file
, int line
, const char *function
)
8750 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8751 TREE_CODE_CLASS_STRING (cl
),
8752 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8753 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8756 /* Similar to tree_check_failed, except that instead of specifying a
8757 dozen codes, use the knowledge that they're all sequential. */
8760 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8761 const char *function
, enum tree_code c1
,
8765 unsigned length
= 0;
8768 for (c
= c1
; c
<= c2
; ++c
)
8769 length
+= 4 + strlen (tree_code_name
[c
]);
8771 length
+= strlen ("expected ");
8772 buffer
= (char *) alloca (length
);
8775 for (c
= c1
; c
<= c2
; ++c
)
8777 const char *prefix
= length
? " or " : "expected ";
8779 strcpy (buffer
+ length
, prefix
);
8780 length
+= strlen (prefix
);
8781 strcpy (buffer
+ length
, tree_code_name
[c
]);
8782 length
+= strlen (tree_code_name
[c
]);
8785 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8786 buffer
, tree_code_name
[TREE_CODE (node
)],
8787 function
, trim_filename (file
), line
);
8791 /* Similar to tree_check_failed, except that we check that a tree does
8792 not have the specified code, given in CL. */
8795 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8796 const char *file
, int line
, const char *function
)
8799 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8800 TREE_CODE_CLASS_STRING (cl
),
8801 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8802 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8806 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8809 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8810 const char *function
, enum omp_clause_code code
)
8812 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8813 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8814 function
, trim_filename (file
), line
);
8818 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8821 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8822 const char *function
, enum omp_clause_code c1
,
8823 enum omp_clause_code c2
)
8826 unsigned length
= 0;
8829 for (c
= c1
; c
<= c2
; ++c
)
8830 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8832 length
+= strlen ("expected ");
8833 buffer
= (char *) alloca (length
);
8836 for (c
= c1
; c
<= c2
; ++c
)
8838 const char *prefix
= length
? " or " : "expected ";
8840 strcpy (buffer
+ length
, prefix
);
8841 length
+= strlen (prefix
);
8842 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8843 length
+= strlen (omp_clause_code_name
[c
]);
8846 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8847 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8848 function
, trim_filename (file
), line
);
8852 #undef DEFTREESTRUCT
8853 #define DEFTREESTRUCT(VAL, NAME) NAME,
8855 static const char *ts_enum_names
[] = {
8856 #include "treestruct.def"
8858 #undef DEFTREESTRUCT
8860 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8862 /* Similar to tree_class_check_failed, except that we check for
8863 whether CODE contains the tree structure identified by EN. */
8866 tree_contains_struct_check_failed (const_tree node
,
8867 const enum tree_node_structure_enum en
,
8868 const char *file
, int line
,
8869 const char *function
)
8872 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8874 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8878 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8879 (dynamically sized) vector. */
8882 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8883 const char *function
)
8886 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8887 idx
+ 1, len
, function
, trim_filename (file
), line
);
8890 /* Similar to above, except that the check is for the bounds of the operand
8891 vector of an expression node EXP. */
8894 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8895 int line
, const char *function
)
8897 int code
= TREE_CODE (exp
);
8899 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8900 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8901 function
, trim_filename (file
), line
);
8904 /* Similar to above, except that the check is for the number of
8905 operands of an OMP_CLAUSE node. */
8908 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8909 int line
, const char *function
)
8912 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8913 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8914 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8915 trim_filename (file
), line
);
8917 #endif /* ENABLE_TREE_CHECKING */
8919 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8920 and mapped to the machine mode MODE. Initialize its fields and build
8921 the information necessary for debugging output. */
8924 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8927 hashval_t hashcode
= 0;
8929 t
= make_node (VECTOR_TYPE
);
8930 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8931 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8932 SET_TYPE_MODE (t
, mode
);
8934 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8935 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8936 else if (TYPE_CANONICAL (innertype
) != innertype
8937 || mode
!= VOIDmode
)
8939 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8943 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8944 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8945 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8946 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8947 t
= type_hash_canon (hashcode
, t
);
8949 /* We have built a main variant, based on the main variant of the
8950 inner type. Use it to build the variant we return. */
8951 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8952 && TREE_TYPE (t
) != innertype
)
8953 return build_type_attribute_qual_variant (t
,
8954 TYPE_ATTRIBUTES (innertype
),
8955 TYPE_QUALS (innertype
));
8961 make_or_reuse_type (unsigned size
, int unsignedp
)
8963 if (size
== INT_TYPE_SIZE
)
8964 return unsignedp
? unsigned_type_node
: integer_type_node
;
8965 if (size
== CHAR_TYPE_SIZE
)
8966 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8967 if (size
== SHORT_TYPE_SIZE
)
8968 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8969 if (size
== LONG_TYPE_SIZE
)
8970 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8971 if (size
== LONG_LONG_TYPE_SIZE
)
8972 return (unsignedp
? long_long_unsigned_type_node
8973 : long_long_integer_type_node
);
8974 if (size
== 128 && int128_integer_type_node
)
8975 return (unsignedp
? int128_unsigned_type_node
8976 : int128_integer_type_node
);
8979 return make_unsigned_type (size
);
8981 return make_signed_type (size
);
8984 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8987 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8991 if (size
== SHORT_FRACT_TYPE_SIZE
)
8992 return unsignedp
? sat_unsigned_short_fract_type_node
8993 : sat_short_fract_type_node
;
8994 if (size
== FRACT_TYPE_SIZE
)
8995 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8996 if (size
== LONG_FRACT_TYPE_SIZE
)
8997 return unsignedp
? sat_unsigned_long_fract_type_node
8998 : sat_long_fract_type_node
;
8999 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9000 return unsignedp
? sat_unsigned_long_long_fract_type_node
9001 : sat_long_long_fract_type_node
;
9005 if (size
== SHORT_FRACT_TYPE_SIZE
)
9006 return unsignedp
? unsigned_short_fract_type_node
9007 : short_fract_type_node
;
9008 if (size
== FRACT_TYPE_SIZE
)
9009 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9010 if (size
== LONG_FRACT_TYPE_SIZE
)
9011 return unsignedp
? unsigned_long_fract_type_node
9012 : long_fract_type_node
;
9013 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9014 return unsignedp
? unsigned_long_long_fract_type_node
9015 : long_long_fract_type_node
;
9018 return make_fract_type (size
, unsignedp
, satp
);
9021 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9024 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9028 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9029 return unsignedp
? sat_unsigned_short_accum_type_node
9030 : sat_short_accum_type_node
;
9031 if (size
== ACCUM_TYPE_SIZE
)
9032 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9033 if (size
== LONG_ACCUM_TYPE_SIZE
)
9034 return unsignedp
? sat_unsigned_long_accum_type_node
9035 : sat_long_accum_type_node
;
9036 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9037 return unsignedp
? sat_unsigned_long_long_accum_type_node
9038 : sat_long_long_accum_type_node
;
9042 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9043 return unsignedp
? unsigned_short_accum_type_node
9044 : short_accum_type_node
;
9045 if (size
== ACCUM_TYPE_SIZE
)
9046 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9047 if (size
== LONG_ACCUM_TYPE_SIZE
)
9048 return unsignedp
? unsigned_long_accum_type_node
9049 : long_accum_type_node
;
9050 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9051 return unsignedp
? unsigned_long_long_accum_type_node
9052 : long_long_accum_type_node
;
9055 return make_accum_type (size
, unsignedp
, satp
);
9058 /* Create nodes for all integer types (and error_mark_node) using the sizes
9059 of C datatypes. The caller should call set_sizetype soon after calling
9060 this function to select one of the types as sizetype. */
9063 build_common_tree_nodes (bool signed_char
)
9065 error_mark_node
= make_node (ERROR_MARK
);
9066 TREE_TYPE (error_mark_node
) = error_mark_node
;
9068 initialize_sizetypes ();
9070 /* Define both `signed char' and `unsigned char'. */
9071 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9072 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9073 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9074 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9076 /* Define `char', which is like either `signed char' or `unsigned char'
9077 but not the same as either. */
9080 ? make_signed_type (CHAR_TYPE_SIZE
)
9081 : make_unsigned_type (CHAR_TYPE_SIZE
));
9082 TYPE_STRING_FLAG (char_type_node
) = 1;
9084 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9085 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9086 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9087 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9088 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9089 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9090 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9091 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9092 #if HOST_BITS_PER_WIDE_INT >= 64
9093 /* TODO: This isn't correct, but as logic depends at the moment on
9094 host's instead of target's wide-integer.
9095 If there is a target not supporting TImode, but has an 128-bit
9096 integer-scalar register, this target check needs to be adjusted. */
9097 if (targetm
.scalar_mode_supported_p (TImode
))
9099 int128_integer_type_node
= make_signed_type (128);
9100 int128_unsigned_type_node
= make_unsigned_type (128);
9103 /* Define a boolean type. This type only represents boolean values but
9104 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9105 Front ends which want to override this size (i.e. Java) can redefine
9106 boolean_type_node before calling build_common_tree_nodes_2. */
9107 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9108 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9109 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9110 TYPE_PRECISION (boolean_type_node
) = 1;
9112 /* Fill in the rest of the sized types. Reuse existing type nodes
9114 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9115 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9116 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9117 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9118 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9120 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9121 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9122 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9123 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9124 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9126 access_public_node
= get_identifier ("public");
9127 access_protected_node
= get_identifier ("protected");
9128 access_private_node
= get_identifier ("private");
9131 /* Call this function after calling build_common_tree_nodes and set_sizetype.
9132 It will create several other common tree nodes. */
9135 build_common_tree_nodes_2 (int short_double
)
9137 /* Define these next since types below may used them. */
9138 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9139 integer_one_node
= build_int_cst (integer_type_node
, 1);
9140 integer_three_node
= build_int_cst (integer_type_node
, 3);
9141 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9143 size_zero_node
= size_int (0);
9144 size_one_node
= size_int (1);
9145 bitsize_zero_node
= bitsize_int (0);
9146 bitsize_one_node
= bitsize_int (1);
9147 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9149 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9150 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9152 void_type_node
= make_node (VOID_TYPE
);
9153 layout_type (void_type_node
);
9155 /* We are not going to have real types in C with less than byte alignment,
9156 so we might as well not have any types that claim to have it. */
9157 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9158 TYPE_USER_ALIGN (void_type_node
) = 0;
9160 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9161 layout_type (TREE_TYPE (null_pointer_node
));
9163 ptr_type_node
= build_pointer_type (void_type_node
);
9165 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9166 fileptr_type_node
= ptr_type_node
;
9168 float_type_node
= make_node (REAL_TYPE
);
9169 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9170 layout_type (float_type_node
);
9172 double_type_node
= make_node (REAL_TYPE
);
9174 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9176 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9177 layout_type (double_type_node
);
9179 long_double_type_node
= make_node (REAL_TYPE
);
9180 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9181 layout_type (long_double_type_node
);
9183 float_ptr_type_node
= build_pointer_type (float_type_node
);
9184 double_ptr_type_node
= build_pointer_type (double_type_node
);
9185 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9186 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9188 /* Fixed size integer types. */
9189 uint32_type_node
= build_nonstandard_integer_type (32, true);
9190 uint64_type_node
= build_nonstandard_integer_type (64, true);
9192 /* Decimal float types. */
9193 dfloat32_type_node
= make_node (REAL_TYPE
);
9194 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9195 layout_type (dfloat32_type_node
);
9196 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9197 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9199 dfloat64_type_node
= make_node (REAL_TYPE
);
9200 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9201 layout_type (dfloat64_type_node
);
9202 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9203 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9205 dfloat128_type_node
= make_node (REAL_TYPE
);
9206 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9207 layout_type (dfloat128_type_node
);
9208 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9209 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9211 complex_integer_type_node
= build_complex_type (integer_type_node
);
9212 complex_float_type_node
= build_complex_type (float_type_node
);
9213 complex_double_type_node
= build_complex_type (double_type_node
);
9214 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9216 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9217 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9218 sat_ ## KIND ## _type_node = \
9219 make_sat_signed_ ## KIND ## _type (SIZE); \
9220 sat_unsigned_ ## KIND ## _type_node = \
9221 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9222 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9223 unsigned_ ## KIND ## _type_node = \
9224 make_unsigned_ ## KIND ## _type (SIZE);
9226 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9227 sat_ ## WIDTH ## KIND ## _type_node = \
9228 make_sat_signed_ ## KIND ## _type (SIZE); \
9229 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9230 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9231 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9232 unsigned_ ## WIDTH ## KIND ## _type_node = \
9233 make_unsigned_ ## KIND ## _type (SIZE);
9235 /* Make fixed-point type nodes based on four different widths. */
9236 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9237 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9238 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9239 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9240 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9242 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9243 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9244 NAME ## _type_node = \
9245 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9246 u ## NAME ## _type_node = \
9247 make_or_reuse_unsigned_ ## KIND ## _type \
9248 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9249 sat_ ## NAME ## _type_node = \
9250 make_or_reuse_sat_signed_ ## KIND ## _type \
9251 (GET_MODE_BITSIZE (MODE ## mode)); \
9252 sat_u ## NAME ## _type_node = \
9253 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9254 (GET_MODE_BITSIZE (U ## MODE ## mode));
9256 /* Fixed-point type and mode nodes. */
9257 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9258 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9259 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9260 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9261 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9262 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9263 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9264 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9265 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9266 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9267 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9270 tree t
= targetm
.build_builtin_va_list ();
9272 /* Many back-ends define record types without setting TYPE_NAME.
9273 If we copied the record type here, we'd keep the original
9274 record type without a name. This breaks name mangling. So,
9275 don't copy record types and let c_common_nodes_and_builtins()
9276 declare the type to be __builtin_va_list. */
9277 if (TREE_CODE (t
) != RECORD_TYPE
)
9278 t
= build_variant_type_copy (t
);
9280 va_list_type_node
= t
;
9284 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9287 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9288 const char *library_name
, int ecf_flags
)
9292 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9293 library_name
, NULL_TREE
);
9294 if (ecf_flags
& ECF_CONST
)
9295 TREE_READONLY (decl
) = 1;
9296 if (ecf_flags
& ECF_PURE
)
9297 DECL_PURE_P (decl
) = 1;
9298 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9299 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9300 if (ecf_flags
& ECF_NORETURN
)
9301 TREE_THIS_VOLATILE (decl
) = 1;
9302 if (ecf_flags
& ECF_NOTHROW
)
9303 TREE_NOTHROW (decl
) = 1;
9304 if (ecf_flags
& ECF_MALLOC
)
9305 DECL_IS_MALLOC (decl
) = 1;
9306 if (ecf_flags
& ECF_LEAF
)
9307 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9308 NULL
, DECL_ATTRIBUTES (decl
));
9310 built_in_decls
[code
] = decl
;
9311 implicit_built_in_decls
[code
] = decl
;
9314 /* Call this function after instantiating all builtins that the language
9315 front end cares about. This will build the rest of the builtins that
9316 are relied upon by the tree optimizers and the middle-end. */
9319 build_common_builtin_nodes (void)
9323 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
9324 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9326 ftype
= build_function_type_list (ptr_type_node
,
9327 ptr_type_node
, const_ptr_type_node
,
9328 size_type_node
, NULL_TREE
);
9330 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
9331 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9332 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9333 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9334 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9335 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9338 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
9340 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9341 const_ptr_type_node
, size_type_node
,
9343 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9344 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9347 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
9349 ftype
= build_function_type_list (ptr_type_node
,
9350 ptr_type_node
, integer_type_node
,
9351 size_type_node
, NULL_TREE
);
9352 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9353 "memset", ECF_NOTHROW
| ECF_LEAF
);
9356 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9358 ftype
= build_function_type_list (ptr_type_node
,
9359 size_type_node
, NULL_TREE
);
9360 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9361 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9364 /* If we're checking the stack, `alloca' can throw. */
9365 if (flag_stack_check
)
9366 TREE_NOTHROW (built_in_decls
[BUILT_IN_ALLOCA
]) = 0;
9368 ftype
= build_function_type_list (void_type_node
,
9369 ptr_type_node
, ptr_type_node
,
9370 ptr_type_node
, NULL_TREE
);
9371 local_define_builtin ("__builtin_init_trampoline", ftype
,
9372 BUILT_IN_INIT_TRAMPOLINE
,
9373 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9375 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9376 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9377 BUILT_IN_ADJUST_TRAMPOLINE
,
9378 "__builtin_adjust_trampoline",
9379 ECF_CONST
| ECF_NOTHROW
);
9381 ftype
= build_function_type_list (void_type_node
,
9382 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9383 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9384 BUILT_IN_NONLOCAL_GOTO
,
9385 "__builtin_nonlocal_goto",
9386 ECF_NORETURN
| ECF_NOTHROW
);
9388 ftype
= build_function_type_list (void_type_node
,
9389 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9390 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9391 BUILT_IN_SETJMP_SETUP
,
9392 "__builtin_setjmp_setup", ECF_NOTHROW
);
9394 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9395 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9396 BUILT_IN_SETJMP_DISPATCHER
,
9397 "__builtin_setjmp_dispatcher",
9398 ECF_PURE
| ECF_NOTHROW
);
9400 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9401 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9402 BUILT_IN_SETJMP_RECEIVER
,
9403 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9405 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9406 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9407 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9409 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9410 local_define_builtin ("__builtin_stack_restore", ftype
,
9411 BUILT_IN_STACK_RESTORE
,
9412 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9414 /* If there's a possibility that we might use the ARM EABI, build the
9415 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9416 if (targetm
.arm_eabi_unwinder
)
9418 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9419 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9420 BUILT_IN_CXA_END_CLEANUP
,
9421 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9424 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9425 local_define_builtin ("__builtin_unwind_resume", ftype
,
9426 BUILT_IN_UNWIND_RESUME
,
9427 ((targetm
.except_unwind_info (&global_options
)
9429 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9432 /* The exception object and filter values from the runtime. The argument
9433 must be zero before exception lowering, i.e. from the front end. After
9434 exception lowering, it will be the region number for the exception
9435 landing pad. These functions are PURE instead of CONST to prevent
9436 them from being hoisted past the exception edge that will initialize
9437 its value in the landing pad. */
9438 ftype
= build_function_type_list (ptr_type_node
,
9439 integer_type_node
, NULL_TREE
);
9440 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9441 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9443 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9444 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9445 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9446 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9448 ftype
= build_function_type_list (void_type_node
,
9449 integer_type_node
, integer_type_node
,
9451 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9452 BUILT_IN_EH_COPY_VALUES
,
9453 "__builtin_eh_copy_values", ECF_NOTHROW
);
9455 /* Complex multiplication and division. These are handled as builtins
9456 rather than optabs because emit_library_call_value doesn't support
9457 complex. Further, we can do slightly better with folding these
9458 beasties if the real and complex parts of the arguments are separate. */
9462 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9464 char mode_name_buf
[4], *q
;
9466 enum built_in_function mcode
, dcode
;
9467 tree type
, inner_type
;
9469 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9472 inner_type
= TREE_TYPE (type
);
9474 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9475 inner_type
, inner_type
, NULL_TREE
);
9477 mcode
= ((enum built_in_function
)
9478 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9479 dcode
= ((enum built_in_function
)
9480 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9482 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9486 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9487 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9488 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9490 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9491 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9492 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9497 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9500 If we requested a pointer to a vector, build up the pointers that
9501 we stripped off while looking for the inner type. Similarly for
9502 return values from functions.
9504 The argument TYPE is the top of the chain, and BOTTOM is the
9505 new type which we will point to. */
9508 reconstruct_complex_type (tree type
, tree bottom
)
9512 if (TREE_CODE (type
) == POINTER_TYPE
)
9514 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9515 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9516 TYPE_REF_CAN_ALIAS_ALL (type
));
9518 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9520 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9521 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9522 TYPE_REF_CAN_ALIAS_ALL (type
));
9524 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9526 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9527 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9529 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9531 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9532 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9534 else if (TREE_CODE (type
) == METHOD_TYPE
)
9536 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9537 /* The build_method_type_directly() routine prepends 'this' to argument list,
9538 so we must compensate by getting rid of it. */
9540 = build_method_type_directly
9541 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9543 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9545 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9547 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9548 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9553 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9557 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9560 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9564 switch (GET_MODE_CLASS (mode
))
9566 case MODE_VECTOR_INT
:
9567 case MODE_VECTOR_FLOAT
:
9568 case MODE_VECTOR_FRACT
:
9569 case MODE_VECTOR_UFRACT
:
9570 case MODE_VECTOR_ACCUM
:
9571 case MODE_VECTOR_UACCUM
:
9572 nunits
= GET_MODE_NUNITS (mode
);
9576 /* Check that there are no leftover bits. */
9577 gcc_assert (GET_MODE_BITSIZE (mode
)
9578 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9580 nunits
= GET_MODE_BITSIZE (mode
)
9581 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9588 return make_vector_type (innertype
, nunits
, mode
);
9591 /* Similarly, but takes the inner type and number of units, which must be
9595 build_vector_type (tree innertype
, int nunits
)
9597 return make_vector_type (innertype
, nunits
, VOIDmode
);
9600 /* Similarly, but takes the inner type and number of units, which must be
9604 build_opaque_vector_type (tree innertype
, int nunits
)
9607 innertype
= build_distinct_type_copy (innertype
);
9608 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9609 TYPE_VECTOR_OPAQUE (t
) = true;
9614 /* Given an initializer INIT, return TRUE if INIT is zero or some
9615 aggregate of zeros. Otherwise return FALSE. */
9617 initializer_zerop (const_tree init
)
9623 switch (TREE_CODE (init
))
9626 return integer_zerop (init
);
9629 /* ??? Note that this is not correct for C4X float formats. There,
9630 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9631 negative exponent. */
9632 return real_zerop (init
)
9633 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9636 return fixed_zerop (init
);
9639 return integer_zerop (init
)
9640 || (real_zerop (init
)
9641 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9642 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9645 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9646 if (!initializer_zerop (TREE_VALUE (elt
)))
9652 unsigned HOST_WIDE_INT idx
;
9654 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9655 if (!initializer_zerop (elt
))
9664 /* We need to loop through all elements to handle cases like
9665 "\0" and "\0foobar". */
9666 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9667 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9678 /* Build an empty statement at location LOC. */
9681 build_empty_stmt (location_t loc
)
9683 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9684 SET_EXPR_LOCATION (t
, loc
);
9689 /* Build an OpenMP clause with code CODE. LOC is the location of the
9693 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9698 length
= omp_clause_num_ops
[code
];
9699 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9701 record_node_allocation_statistics (OMP_CLAUSE
, size
);
9703 t
= ggc_alloc_tree_node (size
);
9704 memset (t
, 0, size
);
9705 TREE_SET_CODE (t
, OMP_CLAUSE
);
9706 OMP_CLAUSE_SET_CODE (t
, code
);
9707 OMP_CLAUSE_LOCATION (t
) = loc
;
9712 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9713 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9714 Except for the CODE and operand count field, other storage for the
9715 object is initialized to zeros. */
9718 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9721 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9723 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9724 gcc_assert (len
>= 1);
9726 record_node_allocation_statistics (code
, length
);
9728 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
9730 TREE_SET_CODE (t
, code
);
9732 /* Can't use TREE_OPERAND to store the length because if checking is
9733 enabled, it will try to check the length before we store it. :-P */
9734 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9739 /* Helper function for build_call_* functions; build a CALL_EXPR with
9740 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9741 the argument slots. */
9744 build_call_1 (tree return_type
, tree fn
, int nargs
)
9748 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9749 TREE_TYPE (t
) = return_type
;
9750 CALL_EXPR_FN (t
) = fn
;
9751 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
9756 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9757 FN and a null static chain slot. NARGS is the number of call arguments
9758 which are specified as "..." arguments. */
9761 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9765 va_start (args
, nargs
);
9766 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9771 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9772 FN and a null static chain slot. NARGS is the number of call arguments
9773 which are specified as a va_list ARGS. */
9776 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9781 t
= build_call_1 (return_type
, fn
, nargs
);
9782 for (i
= 0; i
< nargs
; i
++)
9783 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9784 process_call_operands (t
);
9788 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9789 FN and a null static chain slot. NARGS is the number of call arguments
9790 which are specified as a tree array ARGS. */
9793 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9794 int nargs
, const tree
*args
)
9799 t
= build_call_1 (return_type
, fn
, nargs
);
9800 for (i
= 0; i
< nargs
; i
++)
9801 CALL_EXPR_ARG (t
, i
) = args
[i
];
9802 process_call_operands (t
);
9803 SET_EXPR_LOCATION (t
, loc
);
9807 /* Like build_call_array, but takes a VEC. */
9810 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9815 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
9816 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
9817 CALL_EXPR_ARG (ret
, ix
) = t
;
9818 process_call_operands (ret
);
9823 /* Returns true if it is possible to prove that the index of
9824 an array access REF (an ARRAY_REF expression) falls into the
9828 in_array_bounds_p (tree ref
)
9830 tree idx
= TREE_OPERAND (ref
, 1);
9833 if (TREE_CODE (idx
) != INTEGER_CST
)
9836 min
= array_ref_low_bound (ref
);
9837 max
= array_ref_up_bound (ref
);
9840 || TREE_CODE (min
) != INTEGER_CST
9841 || TREE_CODE (max
) != INTEGER_CST
)
9844 if (tree_int_cst_lt (idx
, min
)
9845 || tree_int_cst_lt (max
, idx
))
9851 /* Returns true if it is possible to prove that the range of
9852 an array access REF (an ARRAY_RANGE_REF expression) falls
9853 into the array bounds. */
9856 range_in_array_bounds_p (tree ref
)
9858 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9859 tree range_min
, range_max
, min
, max
;
9861 range_min
= TYPE_MIN_VALUE (domain_type
);
9862 range_max
= TYPE_MAX_VALUE (domain_type
);
9865 || TREE_CODE (range_min
) != INTEGER_CST
9866 || TREE_CODE (range_max
) != INTEGER_CST
)
9869 min
= array_ref_low_bound (ref
);
9870 max
= array_ref_up_bound (ref
);
9873 || TREE_CODE (min
) != INTEGER_CST
9874 || TREE_CODE (max
) != INTEGER_CST
)
9877 if (tree_int_cst_lt (range_min
, min
)
9878 || tree_int_cst_lt (max
, range_max
))
9884 /* Return true if T (assumed to be a DECL) must be assigned a memory
9888 needs_to_live_in_memory (const_tree t
)
9890 if (TREE_CODE (t
) == SSA_NAME
)
9891 t
= SSA_NAME_VAR (t
);
9893 return (TREE_ADDRESSABLE (t
)
9894 || is_global_var (t
)
9895 || (TREE_CODE (t
) == RESULT_DECL
9896 && !DECL_BY_REFERENCE (t
)
9897 && aggregate_value_p (t
, current_function_decl
)));
9900 /* There are situations in which a language considers record types
9901 compatible which have different field lists. Decide if two fields
9902 are compatible. It is assumed that the parent records are compatible. */
9905 fields_compatible_p (const_tree f1
, const_tree f2
)
9907 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9908 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9911 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9912 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9915 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9921 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9924 find_compatible_field (tree record
, tree orig_field
)
9928 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9929 if (TREE_CODE (f
) == FIELD_DECL
9930 && fields_compatible_p (f
, orig_field
))
9933 /* ??? Why isn't this on the main fields list? */
9934 f
= TYPE_VFIELD (record
);
9935 if (f
&& TREE_CODE (f
) == FIELD_DECL
9936 && fields_compatible_p (f
, orig_field
))
9939 /* ??? We should abort here, but Java appears to do Bad Things
9940 with inherited fields. */
9944 /* Return value of a constant X and sign-extend it. */
9947 int_cst_value (const_tree x
)
9949 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9950 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9952 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9953 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9954 || TREE_INT_CST_HIGH (x
) == -1);
9956 if (bits
< HOST_BITS_PER_WIDE_INT
)
9958 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9960 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9962 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9968 /* Return value of a constant X and sign-extend it. */
9971 widest_int_cst_value (const_tree x
)
9973 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9974 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9976 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9977 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9978 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9979 << HOST_BITS_PER_WIDE_INT
);
9981 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9982 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9983 || TREE_INT_CST_HIGH (x
) == -1);
9986 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9988 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9990 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9992 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9998 /* If TYPE is an integral type, return an equivalent type which is
9999 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10000 return TYPE itself. */
10003 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10006 if (POINTER_TYPE_P (type
))
10008 /* If the pointer points to the normal address space, use the
10009 size_type_node. Otherwise use an appropriate size for the pointer
10010 based on the named address space it points to. */
10011 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
10012 t
= size_type_node
;
10014 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
10017 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
10020 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
10023 /* Returns unsigned variant of TYPE. */
10026 unsigned_type_for (tree type
)
10028 return signed_or_unsigned_type_for (1, type
);
10031 /* Returns signed variant of TYPE. */
10034 signed_type_for (tree type
)
10036 return signed_or_unsigned_type_for (0, type
);
10039 /* Returns the largest value obtainable by casting something in INNER type to
10043 upper_bound_in_type (tree outer
, tree inner
)
10045 unsigned HOST_WIDE_INT lo
, hi
;
10046 unsigned int det
= 0;
10047 unsigned oprec
= TYPE_PRECISION (outer
);
10048 unsigned iprec
= TYPE_PRECISION (inner
);
10051 /* Compute a unique number for every combination. */
10052 det
|= (oprec
> iprec
) ? 4 : 0;
10053 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10054 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10056 /* Determine the exponent to use. */
10061 /* oprec <= iprec, outer: signed, inner: don't care. */
10066 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10070 /* oprec > iprec, outer: signed, inner: signed. */
10074 /* oprec > iprec, outer: signed, inner: unsigned. */
10078 /* oprec > iprec, outer: unsigned, inner: signed. */
10082 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10086 gcc_unreachable ();
10089 /* Compute 2^^prec - 1. */
10090 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10093 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
10094 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10098 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10099 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
10100 lo
= ~(unsigned HOST_WIDE_INT
) 0;
10103 return build_int_cst_wide (outer
, lo
, hi
);
10106 /* Returns the smallest value obtainable by casting something in INNER type to
10110 lower_bound_in_type (tree outer
, tree inner
)
10112 unsigned HOST_WIDE_INT lo
, hi
;
10113 unsigned oprec
= TYPE_PRECISION (outer
);
10114 unsigned iprec
= TYPE_PRECISION (inner
);
10116 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10118 if (TYPE_UNSIGNED (outer
)
10119 /* If we are widening something of an unsigned type, OUTER type
10120 contains all values of INNER type. In particular, both INNER
10121 and OUTER types have zero in common. */
10122 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10126 /* If we are widening a signed type to another signed type, we
10127 want to obtain -2^^(iprec-1). If we are keeping the
10128 precision or narrowing to a signed type, we want to obtain
10130 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10132 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10134 hi
= ~(unsigned HOST_WIDE_INT
) 0;
10135 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10139 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10140 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10145 return build_int_cst_wide (outer
, lo
, hi
);
10148 /* Return nonzero if two operands that are suitable for PHI nodes are
10149 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10150 SSA_NAME or invariant. Note that this is strictly an optimization.
10151 That is, callers of this function can directly call operand_equal_p
10152 and get the same result, only slower. */
10155 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10159 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10161 return operand_equal_p (arg0
, arg1
, 0);
10164 /* Returns number of zeros at the end of binary representation of X.
10166 ??? Use ffs if available? */
10169 num_ending_zeros (const_tree x
)
10171 unsigned HOST_WIDE_INT fr
, nfr
;
10172 unsigned num
, abits
;
10173 tree type
= TREE_TYPE (x
);
10175 if (TREE_INT_CST_LOW (x
) == 0)
10177 num
= HOST_BITS_PER_WIDE_INT
;
10178 fr
= TREE_INT_CST_HIGH (x
);
10183 fr
= TREE_INT_CST_LOW (x
);
10186 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10189 if (nfr
<< abits
== fr
)
10196 if (num
> TYPE_PRECISION (type
))
10197 num
= TYPE_PRECISION (type
);
10199 return build_int_cst_type (type
, num
);
10203 #define WALK_SUBTREE(NODE) \
10206 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10212 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10213 be walked whenever a type is seen in the tree. Rest of operands and return
10214 value are as for walk_tree. */
10217 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10218 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10220 tree result
= NULL_TREE
;
10222 switch (TREE_CODE (type
))
10225 case REFERENCE_TYPE
:
10226 /* We have to worry about mutually recursive pointers. These can't
10227 be written in C. They can in Ada. It's pathological, but
10228 there's an ACATS test (c38102a) that checks it. Deal with this
10229 by checking if we're pointing to another pointer, that one
10230 points to another pointer, that one does too, and we have no htab.
10231 If so, get a hash table. We check three levels deep to avoid
10232 the cost of the hash table if we don't need one. */
10233 if (POINTER_TYPE_P (TREE_TYPE (type
))
10234 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10235 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10238 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10246 /* ... fall through ... */
10249 WALK_SUBTREE (TREE_TYPE (type
));
10253 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10255 /* Fall through. */
10257 case FUNCTION_TYPE
:
10258 WALK_SUBTREE (TREE_TYPE (type
));
10262 /* We never want to walk into default arguments. */
10263 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10264 WALK_SUBTREE (TREE_VALUE (arg
));
10269 /* Don't follow this nodes's type if a pointer for fear that
10270 we'll have infinite recursion. If we have a PSET, then we
10273 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10274 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10275 WALK_SUBTREE (TREE_TYPE (type
));
10276 WALK_SUBTREE (TYPE_DOMAIN (type
));
10280 WALK_SUBTREE (TREE_TYPE (type
));
10281 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10291 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10292 called with the DATA and the address of each sub-tree. If FUNC returns a
10293 non-NULL value, the traversal is stopped, and the value returned by FUNC
10294 is returned. If PSET is non-NULL it is used to record the nodes visited,
10295 and to avoid visiting a node more than once. */
10298 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10299 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10301 enum tree_code code
;
10305 #define WALK_SUBTREE_TAIL(NODE) \
10309 goto tail_recurse; \
10314 /* Skip empty subtrees. */
10318 /* Don't walk the same tree twice, if the user has requested
10319 that we avoid doing so. */
10320 if (pset
&& pointer_set_insert (pset
, *tp
))
10323 /* Call the function. */
10325 result
= (*func
) (tp
, &walk_subtrees
, data
);
10327 /* If we found something, return it. */
10331 code
= TREE_CODE (*tp
);
10333 /* Even if we didn't, FUNC may have decided that there was nothing
10334 interesting below this point in the tree. */
10335 if (!walk_subtrees
)
10337 /* But we still need to check our siblings. */
10338 if (code
== TREE_LIST
)
10339 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10340 else if (code
== OMP_CLAUSE
)
10341 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10348 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10349 if (result
|| !walk_subtrees
)
10356 case IDENTIFIER_NODE
:
10363 case PLACEHOLDER_EXPR
:
10367 /* None of these have subtrees other than those already walked
10372 WALK_SUBTREE (TREE_VALUE (*tp
));
10373 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10378 int len
= TREE_VEC_LENGTH (*tp
);
10383 /* Walk all elements but the first. */
10385 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10387 /* Now walk the first one as a tail call. */
10388 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10392 WALK_SUBTREE (TREE_REALPART (*tp
));
10393 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10397 unsigned HOST_WIDE_INT idx
;
10398 constructor_elt
*ce
;
10401 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10403 WALK_SUBTREE (ce
->value
);
10408 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10413 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10415 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10416 into declarations that are just mentioned, rather than
10417 declared; they don't really belong to this part of the tree.
10418 And, we can see cycles: the initializer for a declaration
10419 can refer to the declaration itself. */
10420 WALK_SUBTREE (DECL_INITIAL (decl
));
10421 WALK_SUBTREE (DECL_SIZE (decl
));
10422 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10424 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10427 case STATEMENT_LIST
:
10429 tree_stmt_iterator i
;
10430 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10431 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10436 switch (OMP_CLAUSE_CODE (*tp
))
10438 case OMP_CLAUSE_PRIVATE
:
10439 case OMP_CLAUSE_SHARED
:
10440 case OMP_CLAUSE_FIRSTPRIVATE
:
10441 case OMP_CLAUSE_COPYIN
:
10442 case OMP_CLAUSE_COPYPRIVATE
:
10443 case OMP_CLAUSE_IF
:
10444 case OMP_CLAUSE_NUM_THREADS
:
10445 case OMP_CLAUSE_SCHEDULE
:
10446 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10449 case OMP_CLAUSE_NOWAIT
:
10450 case OMP_CLAUSE_ORDERED
:
10451 case OMP_CLAUSE_DEFAULT
:
10452 case OMP_CLAUSE_UNTIED
:
10453 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10455 case OMP_CLAUSE_LASTPRIVATE
:
10456 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10457 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10458 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10460 case OMP_CLAUSE_COLLAPSE
:
10463 for (i
= 0; i
< 3; i
++)
10464 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10465 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10468 case OMP_CLAUSE_REDUCTION
:
10471 for (i
= 0; i
< 4; i
++)
10472 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10473 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10477 gcc_unreachable ();
10485 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10486 But, we only want to walk once. */
10487 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10488 for (i
= 0; i
< len
; ++i
)
10489 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10490 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10494 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10495 defining. We only want to walk into these fields of a type in this
10496 case and not in the general case of a mere reference to the type.
10498 The criterion is as follows: if the field can be an expression, it
10499 must be walked only here. This should be in keeping with the fields
10500 that are directly gimplified in gimplify_type_sizes in order for the
10501 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10502 variable-sized types.
10504 Note that DECLs get walked as part of processing the BIND_EXPR. */
10505 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10507 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10508 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10511 /* Call the function for the type. See if it returns anything or
10512 doesn't want us to continue. If we are to continue, walk both
10513 the normal fields and those for the declaration case. */
10514 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10515 if (result
|| !walk_subtrees
)
10518 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10522 /* If this is a record type, also walk the fields. */
10523 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10527 for (field
= TYPE_FIELDS (*type_p
); field
;
10528 field
= DECL_CHAIN (field
))
10530 /* We'd like to look at the type of the field, but we can
10531 easily get infinite recursion. So assume it's pointed
10532 to elsewhere in the tree. Also, ignore things that
10534 if (TREE_CODE (field
) != FIELD_DECL
)
10537 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10538 WALK_SUBTREE (DECL_SIZE (field
));
10539 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10540 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10541 WALK_SUBTREE (DECL_QUALIFIER (field
));
10545 /* Same for scalar types. */
10546 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10547 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10548 || TREE_CODE (*type_p
) == INTEGER_TYPE
10549 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10550 || TREE_CODE (*type_p
) == REAL_TYPE
)
10552 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10553 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10556 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10557 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10562 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10566 /* Walk over all the sub-trees of this operand. */
10567 len
= TREE_OPERAND_LENGTH (*tp
);
10569 /* Go through the subtrees. We need to do this in forward order so
10570 that the scope of a FOR_EXPR is handled properly. */
10573 for (i
= 0; i
< len
- 1; ++i
)
10574 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10575 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10578 /* If this is a type, walk the needed fields in the type. */
10579 else if (TYPE_P (*tp
))
10580 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10584 /* We didn't find what we were looking for. */
10587 #undef WALK_SUBTREE_TAIL
10589 #undef WALK_SUBTREE
10591 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10594 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10598 struct pointer_set_t
*pset
;
10600 pset
= pointer_set_create ();
10601 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10602 pointer_set_destroy (pset
);
10608 tree_block (tree t
)
10610 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10612 if (IS_EXPR_CODE_CLASS (c
))
10613 return &t
->exp
.block
;
10614 gcc_unreachable ();
10618 /* Create a nameless artificial label and put it in the current
10619 function context. The label has a location of LOC. Returns the
10620 newly created label. */
10623 create_artificial_label (location_t loc
)
10625 tree lab
= build_decl (loc
,
10626 LABEL_DECL
, NULL_TREE
, void_type_node
);
10628 DECL_ARTIFICIAL (lab
) = 1;
10629 DECL_IGNORED_P (lab
) = 1;
10630 DECL_CONTEXT (lab
) = current_function_decl
;
10634 /* Given a tree, try to return a useful variable name that we can use
10635 to prefix a temporary that is being assigned the value of the tree.
10636 I.E. given <temp> = &A, return A. */
10641 tree stripped_decl
;
10644 STRIP_NOPS (stripped_decl
);
10645 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10646 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10649 switch (TREE_CODE (stripped_decl
))
10652 return get_name (TREE_OPERAND (stripped_decl
, 0));
10659 /* Return true if TYPE has a variable argument list. */
10662 stdarg_p (const_tree fntype
)
10664 function_args_iterator args_iter
;
10665 tree n
= NULL_TREE
, t
;
10670 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10675 return n
!= NULL_TREE
&& n
!= void_type_node
;
10678 /* Return true if TYPE has a prototype. */
10681 prototype_p (tree fntype
)
10685 gcc_assert (fntype
!= NULL_TREE
);
10687 t
= TYPE_ARG_TYPES (fntype
);
10688 return (t
!= NULL_TREE
);
10691 /* If BLOCK is inlined from an __attribute__((__artificial__))
10692 routine, return pointer to location from where it has been
10695 block_nonartificial_location (tree block
)
10697 location_t
*ret
= NULL
;
10699 while (block
&& TREE_CODE (block
) == BLOCK
10700 && BLOCK_ABSTRACT_ORIGIN (block
))
10702 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10704 while (TREE_CODE (ao
) == BLOCK
10705 && BLOCK_ABSTRACT_ORIGIN (ao
)
10706 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10707 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10709 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10711 /* If AO is an artificial inline, point RET to the
10712 call site locus at which it has been inlined and continue
10713 the loop, in case AO's caller is also an artificial
10715 if (DECL_DECLARED_INLINE_P (ao
)
10716 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10717 ret
= &BLOCK_SOURCE_LOCATION (block
);
10721 else if (TREE_CODE (ao
) != BLOCK
)
10724 block
= BLOCK_SUPERCONTEXT (block
);
10730 /* If EXP is inlined from an __attribute__((__artificial__))
10731 function, return the location of the original call expression. */
10734 tree_nonartificial_location (tree exp
)
10736 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10741 return EXPR_LOCATION (exp
);
10745 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10748 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10751 cl_option_hash_hash (const void *x
)
10753 const_tree
const t
= (const_tree
) x
;
10757 hashval_t hash
= 0;
10759 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10761 p
= (const char *)TREE_OPTIMIZATION (t
);
10762 len
= sizeof (struct cl_optimization
);
10765 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10767 p
= (const char *)TREE_TARGET_OPTION (t
);
10768 len
= sizeof (struct cl_target_option
);
10772 gcc_unreachable ();
10774 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10776 for (i
= 0; i
< len
; i
++)
10778 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10783 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10784 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10788 cl_option_hash_eq (const void *x
, const void *y
)
10790 const_tree
const xt
= (const_tree
) x
;
10791 const_tree
const yt
= (const_tree
) y
;
10796 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10799 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10801 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10802 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10803 len
= sizeof (struct cl_optimization
);
10806 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10808 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10809 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10810 len
= sizeof (struct cl_target_option
);
10814 gcc_unreachable ();
10816 return (memcmp (xp
, yp
, len
) == 0);
10819 /* Build an OPTIMIZATION_NODE based on the current options. */
10822 build_optimization_node (void)
10827 /* Use the cache of optimization nodes. */
10829 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
10832 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10836 /* Insert this one into the hash table. */
10837 t
= cl_optimization_node
;
10840 /* Make a new node for next time round. */
10841 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10847 /* Build a TARGET_OPTION_NODE based on the current options. */
10850 build_target_option_node (void)
10855 /* Use the cache of optimization nodes. */
10857 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
10860 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10864 /* Insert this one into the hash table. */
10865 t
= cl_target_option_node
;
10868 /* Make a new node for next time round. */
10869 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10875 /* Determine the "ultimate origin" of a block. The block may be an inlined
10876 instance of an inlined instance of a block which is local to an inline
10877 function, so we have to trace all of the way back through the origin chain
10878 to find out what sort of node actually served as the original seed for the
10882 block_ultimate_origin (const_tree block
)
10884 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10886 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10887 nodes in the function to point to themselves; ignore that if
10888 we're trying to output the abstract instance of this function. */
10889 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10892 if (immediate_origin
== NULL_TREE
)
10897 tree lookahead
= immediate_origin
;
10901 ret_val
= lookahead
;
10902 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10903 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10905 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10907 /* The block's abstract origin chain may not be the *ultimate* origin of
10908 the block. It could lead to a DECL that has an abstract origin set.
10909 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10910 will give us if it has one). Note that DECL's abstract origins are
10911 supposed to be the most distant ancestor (or so decl_ultimate_origin
10912 claims), so we don't need to loop following the DECL origins. */
10913 if (DECL_P (ret_val
))
10914 return DECL_ORIGIN (ret_val
);
10920 /* Return true if T1 and T2 are equivalent lists. */
10923 list_equal_p (const_tree t1
, const_tree t2
)
10925 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10926 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10931 /* Return true iff conversion in EXP generates no instruction. Mark
10932 it inline so that we fully inline into the stripping functions even
10933 though we have two uses of this function. */
10936 tree_nop_conversion (const_tree exp
)
10938 tree outer_type
, inner_type
;
10940 if (!CONVERT_EXPR_P (exp
)
10941 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10943 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10946 outer_type
= TREE_TYPE (exp
);
10947 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10952 /* Use precision rather then machine mode when we can, which gives
10953 the correct answer even for submode (bit-field) types. */
10954 if ((INTEGRAL_TYPE_P (outer_type
)
10955 || POINTER_TYPE_P (outer_type
)
10956 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10957 && (INTEGRAL_TYPE_P (inner_type
)
10958 || POINTER_TYPE_P (inner_type
)
10959 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10960 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10962 /* Otherwise fall back on comparing machine modes (e.g. for
10963 aggregate types, floats). */
10964 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10967 /* Return true iff conversion in EXP generates no instruction. Don't
10968 consider conversions changing the signedness. */
10971 tree_sign_nop_conversion (const_tree exp
)
10973 tree outer_type
, inner_type
;
10975 if (!tree_nop_conversion (exp
))
10978 outer_type
= TREE_TYPE (exp
);
10979 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10981 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10982 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10985 /* Strip conversions from EXP according to tree_nop_conversion and
10986 return the resulting expression. */
10989 tree_strip_nop_conversions (tree exp
)
10991 while (tree_nop_conversion (exp
))
10992 exp
= TREE_OPERAND (exp
, 0);
10996 /* Strip conversions from EXP according to tree_sign_nop_conversion
10997 and return the resulting expression. */
11000 tree_strip_sign_nop_conversions (tree exp
)
11002 while (tree_sign_nop_conversion (exp
))
11003 exp
= TREE_OPERAND (exp
, 0);
11007 static GTY(()) tree gcc_eh_personality_decl
;
11009 /* Return the GCC personality function decl. */
11012 lhd_gcc_personality (void)
11014 if (!gcc_eh_personality_decl
)
11015 gcc_eh_personality_decl
= build_personality_function ("gcc");
11016 return gcc_eh_personality_decl
;
11019 /* Try to find a base info of BINFO that would have its field decl at offset
11020 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11021 found, return, otherwise return NULL_TREE. */
11024 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11026 tree type
= BINFO_TYPE (binfo
);
11030 HOST_WIDE_INT pos
, size
;
11034 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11039 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11041 if (TREE_CODE (fld
) != FIELD_DECL
)
11044 pos
= int_bit_position (fld
);
11045 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11046 if (pos
<= offset
&& (pos
+ size
) > offset
)
11049 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11052 if (!DECL_ARTIFICIAL (fld
))
11054 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11058 /* Offset 0 indicates the primary base, whose vtable contents are
11059 represented in the binfo for the derived class. */
11060 else if (offset
!= 0)
11062 tree base_binfo
, found_binfo
= NULL_TREE
;
11063 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11064 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11066 found_binfo
= base_binfo
;
11071 binfo
= found_binfo
;
11074 type
= TREE_TYPE (fld
);
11079 /* Returns true if X is a typedef decl. */
11082 is_typedef_decl (tree x
)
11084 return (x
&& TREE_CODE (x
) == TYPE_DECL
11085 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11088 /* Returns true iff TYPE is a type variant created for a typedef. */
11091 typedef_variant_p (tree type
)
11093 return is_typedef_decl (TYPE_NAME (type
));
11096 /* Warn about a use of an identifier which was marked deprecated. */
11098 warn_deprecated_use (tree node
, tree attr
)
11102 if (node
== 0 || !warn_deprecated_decl
)
11108 attr
= DECL_ATTRIBUTES (node
);
11109 else if (TYPE_P (node
))
11111 tree decl
= TYPE_STUB_DECL (node
);
11113 attr
= lookup_attribute ("deprecated",
11114 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11119 attr
= lookup_attribute ("deprecated", attr
);
11122 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11128 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11130 warning (OPT_Wdeprecated_declarations
,
11131 "%qD is deprecated (declared at %s:%d): %s",
11132 node
, xloc
.file
, xloc
.line
, msg
);
11134 warning (OPT_Wdeprecated_declarations
,
11135 "%qD is deprecated (declared at %s:%d)",
11136 node
, xloc
.file
, xloc
.line
);
11138 else if (TYPE_P (node
))
11140 tree what
= NULL_TREE
;
11141 tree decl
= TYPE_STUB_DECL (node
);
11143 if (TYPE_NAME (node
))
11145 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11146 what
= TYPE_NAME (node
);
11147 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11148 && DECL_NAME (TYPE_NAME (node
)))
11149 what
= DECL_NAME (TYPE_NAME (node
));
11154 expanded_location xloc
11155 = expand_location (DECL_SOURCE_LOCATION (decl
));
11159 warning (OPT_Wdeprecated_declarations
,
11160 "%qE is deprecated (declared at %s:%d): %s",
11161 what
, xloc
.file
, xloc
.line
, msg
);
11163 warning (OPT_Wdeprecated_declarations
,
11164 "%qE is deprecated (declared at %s:%d)", what
,
11165 xloc
.file
, xloc
.line
);
11170 warning (OPT_Wdeprecated_declarations
,
11171 "type is deprecated (declared at %s:%d): %s",
11172 xloc
.file
, xloc
.line
, msg
);
11174 warning (OPT_Wdeprecated_declarations
,
11175 "type is deprecated (declared at %s:%d)",
11176 xloc
.file
, xloc
.line
);
11184 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11187 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11192 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11195 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11201 #include "gt-tree.h"