1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent, but occasionally
28 calls language-dependent routines defined (for C) in typecheck.c. */
32 #include "coretypes.h"
39 #include "toplev.h" /* get_random_seed */
42 #include "filenames.h"
45 #include "common/common-target.h"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.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"
63 /* Tree code classes. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 #define END_OF_BASE_TREE_CODES tcc_exceptional,
68 const enum tree_code_class tree_code_type
[] = {
69 #include "all-tree.def"
73 #undef END_OF_BASE_TREE_CODES
75 /* Table indexed by tree code giving number of expression
76 operands beyond the fixed part of the node structure.
77 Not used for types or decls. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
80 #define END_OF_BASE_TREE_CODES 0,
82 const unsigned char tree_code_length
[] = {
83 #include "all-tree.def"
87 #undef END_OF_BASE_TREE_CODES
89 /* Names of tree components.
90 Used for printing out the tree and error messages. */
91 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
92 #define END_OF_BASE_TREE_CODES "@dummy",
94 const char *const tree_code_name
[] = {
95 #include "all-tree.def"
99 #undef END_OF_BASE_TREE_CODES
101 /* Each tree code class has an associated string representation.
102 These must correspond to the tree_code_class entries. */
104 const char *const tree_code_class_strings
[] =
119 /* obstack.[ch] explicitly declined to prototype this. */
120 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
122 /* Statistics-gathering stuff. */
124 static int tree_code_counts
[MAX_TREE_CODES
];
125 int tree_node_counts
[(int) all_kinds
];
126 int tree_node_sizes
[(int) all_kinds
];
128 /* Keep in sync with tree.h:enum tree_node_kind. */
129 static const char * const tree_node_kind_names
[] = {
148 /* Unique id for next decl created. */
149 static GTY(()) int next_decl_uid
;
150 /* Unique id for next type created. */
151 static GTY(()) int next_type_uid
= 1;
152 /* Unique id for next debug decl created. Use negative numbers,
153 to catch erroneous uses. */
154 static GTY(()) int next_debug_decl_uid
;
156 /* Since we cannot rehash a type after it is in the table, we have to
157 keep the hash code. */
159 struct GTY(()) type_hash
{
164 /* Initial size of the hash table (rounded to next prime). */
165 #define TYPE_HASH_INITIAL_SIZE 1000
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
174 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
175 htab_t type_hash_table
;
177 /* Hash table and temporary node for larger integer const values. */
178 static GTY (()) tree int_cst_node
;
179 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
180 htab_t int_cst_hash_table
;
182 /* Hash table for optimization flags and target option flags. Use the same
183 hash table for both sets of options. Nodes for building the current
184 optimization and target option nodes. The assumption is most of the time
185 the options created will already be in the hash table, so we avoid
186 allocating and freeing up a node repeatably. */
187 static GTY (()) tree cl_optimization_node
;
188 static GTY (()) tree cl_target_option_node
;
189 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
190 htab_t cl_option_hash_table
;
192 /* General tree->tree mapping structure for use in hash tables. */
195 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
196 htab_t debug_expr_for_decl
;
198 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
199 htab_t value_expr_for_decl
;
201 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
202 htab_t debug_args_for_decl
;
204 static GTY ((if_marked ("tree_priority_map_marked_p"),
205 param_is (struct tree_priority_map
)))
206 htab_t init_priority_for_decl
;
208 static void set_type_quals (tree
, int);
209 static int type_hash_eq (const void *, const void *);
210 static hashval_t
type_hash_hash (const void *);
211 static hashval_t
int_cst_hash_hash (const void *);
212 static int int_cst_hash_eq (const void *, const void *);
213 static hashval_t
cl_option_hash_hash (const void *);
214 static int cl_option_hash_eq (const void *, const void *);
215 static void print_type_hash_statistics (void);
216 static void print_debug_expr_statistics (void);
217 static void print_value_expr_statistics (void);
218 static int type_hash_marked_p (const void *);
219 static unsigned int type_hash_list (const_tree
, hashval_t
);
220 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
221 static bool decls_same_for_odr (tree decl1
, tree decl2
);
223 tree global_trees
[TI_MAX
];
224 tree integer_types
[itk_none
];
226 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops
[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 2, /* OMP_CLAUSE_LINEAR */
240 1, /* OMP_CLAUSE_UNIFORM */
241 1, /* OMP_CLAUSE_IF */
242 1, /* OMP_CLAUSE_NUM_THREADS */
243 1, /* OMP_CLAUSE_SCHEDULE */
244 0, /* OMP_CLAUSE_NOWAIT */
245 0, /* OMP_CLAUSE_ORDERED */
246 0, /* OMP_CLAUSE_DEFAULT */
247 3, /* OMP_CLAUSE_COLLAPSE */
248 0, /* OMP_CLAUSE_UNTIED */
249 1, /* OMP_CLAUSE_FINAL */
250 0, /* OMP_CLAUSE_MERGEABLE */
251 1, /* OMP_CLAUSE_SAFELEN */
252 1, /* OMP_CLAUSE__SIMDUID_ */
255 const char * const omp_clause_code_name
[] =
282 /* Return the tree node structure used by tree code CODE. */
284 static inline enum tree_node_structure_enum
285 tree_node_structure_for_code (enum tree_code code
)
287 switch (TREE_CODE_CLASS (code
))
289 case tcc_declaration
:
294 return TS_FIELD_DECL
;
300 return TS_LABEL_DECL
;
302 return TS_RESULT_DECL
;
303 case DEBUG_EXPR_DECL
:
306 return TS_CONST_DECL
;
310 return TS_FUNCTION_DECL
;
311 case TRANSLATION_UNIT_DECL
:
312 return TS_TRANSLATION_UNIT_DECL
;
314 return TS_DECL_NON_COMMON
;
318 return TS_TYPE_NON_COMMON
;
327 default: /* tcc_constant and tcc_exceptional */
332 /* tcc_constant cases. */
333 case INTEGER_CST
: return TS_INT_CST
;
334 case REAL_CST
: return TS_REAL_CST
;
335 case FIXED_CST
: return TS_FIXED_CST
;
336 case COMPLEX_CST
: return TS_COMPLEX
;
337 case VECTOR_CST
: return TS_VECTOR
;
338 case STRING_CST
: return TS_STRING
;
339 /* tcc_exceptional cases. */
340 case ERROR_MARK
: return TS_COMMON
;
341 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
342 case TREE_LIST
: return TS_LIST
;
343 case TREE_VEC
: return TS_VEC
;
344 case SSA_NAME
: return TS_SSA_NAME
;
345 case PLACEHOLDER_EXPR
: return TS_COMMON
;
346 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
347 case BLOCK
: return TS_BLOCK
;
348 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
349 case TREE_BINFO
: return TS_BINFO
;
350 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
351 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
352 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
360 /* Initialize tree_contains_struct to describe the hierarchy of tree
364 initialize_tree_contains_struct (void)
368 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
371 enum tree_node_structure_enum ts_code
;
373 code
= (enum tree_code
) i
;
374 ts_code
= tree_node_structure_for_code (code
);
376 /* Mark the TS structure itself. */
377 tree_contains_struct
[code
][ts_code
] = 1;
379 /* Mark all the structures that TS is derived from. */
397 case TS_STATEMENT_LIST
:
398 MARK_TS_TYPED (code
);
402 case TS_DECL_MINIMAL
:
408 case TS_OPTIMIZATION
:
409 case TS_TARGET_OPTION
:
410 MARK_TS_COMMON (code
);
413 case TS_TYPE_WITH_LANG_SPECIFIC
:
414 MARK_TS_TYPE_COMMON (code
);
417 case TS_TYPE_NON_COMMON
:
418 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
422 MARK_TS_DECL_MINIMAL (code
);
427 MARK_TS_DECL_COMMON (code
);
430 case TS_DECL_NON_COMMON
:
431 MARK_TS_DECL_WITH_VIS (code
);
434 case TS_DECL_WITH_VIS
:
438 MARK_TS_DECL_WRTL (code
);
442 MARK_TS_DECL_COMMON (code
);
446 MARK_TS_DECL_WITH_VIS (code
);
450 case TS_FUNCTION_DECL
:
451 MARK_TS_DECL_NON_COMMON (code
);
454 case TS_TRANSLATION_UNIT_DECL
:
455 MARK_TS_DECL_COMMON (code
);
463 /* Basic consistency checks for attributes used in fold. */
464 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
465 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
466 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
468 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
469 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
470 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
471 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
472 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
473 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
474 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
475 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
476 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
477 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
478 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
479 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
480 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
482 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
483 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
484 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
485 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
486 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
487 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
488 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
489 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
490 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
491 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
492 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
493 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
494 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
495 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
496 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
497 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
498 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
499 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
500 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
510 /* Initialize the hash table of types. */
511 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
514 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
515 tree_decl_map_eq
, 0);
517 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
518 tree_decl_map_eq
, 0);
519 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
520 tree_priority_map_eq
, 0);
522 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
523 int_cst_hash_eq
, NULL
);
525 int_cst_node
= make_node (INTEGER_CST
);
527 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
528 cl_option_hash_eq
, NULL
);
530 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
531 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
533 /* Initialize the tree_contains_struct array. */
534 initialize_tree_contains_struct ();
535 lang_hooks
.init_ts ();
539 /* The name of the object as the assembler will see it (but before any
540 translations made by ASM_OUTPUT_LABELREF). Often this is the same
541 as DECL_NAME. It is an IDENTIFIER_NODE. */
543 decl_assembler_name (tree decl
)
545 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
546 lang_hooks
.set_decl_assembler_name (decl
);
547 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
550 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
553 decl_assembler_name_equal (tree decl
, const_tree asmname
)
555 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
556 const char *decl_str
;
557 const char *asmname_str
;
560 if (decl_asmname
== asmname
)
563 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
564 asmname_str
= IDENTIFIER_POINTER (asmname
);
567 /* If the target assembler name was set by the user, things are trickier.
568 We have a leading '*' to begin with. After that, it's arguable what
569 is the correct thing to do with -fleading-underscore. Arguably, we've
570 historically been doing the wrong thing in assemble_alias by always
571 printing the leading underscore. Since we're not changing that, make
572 sure user_label_prefix follows the '*' before matching. */
573 if (decl_str
[0] == '*')
575 size_t ulp_len
= strlen (user_label_prefix
);
581 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
582 decl_str
+= ulp_len
, test
=true;
586 if (asmname_str
[0] == '*')
588 size_t ulp_len
= strlen (user_label_prefix
);
594 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
595 asmname_str
+= ulp_len
, test
=true;
602 return strcmp (decl_str
, asmname_str
) == 0;
605 /* Hash asmnames ignoring the user specified marks. */
608 decl_assembler_name_hash (const_tree asmname
)
610 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
612 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
613 size_t ulp_len
= strlen (user_label_prefix
);
617 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
620 return htab_hash_string (decl_str
);
623 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
626 /* Compute the number of bytes occupied by a tree with code CODE.
627 This function cannot be used for nodes that have variable sizes,
628 including TREE_VEC, STRING_CST, and CALL_EXPR. */
630 tree_code_size (enum tree_code code
)
632 switch (TREE_CODE_CLASS (code
))
634 case tcc_declaration
: /* A decl node */
639 return sizeof (struct tree_field_decl
);
641 return sizeof (struct tree_parm_decl
);
643 return sizeof (struct tree_var_decl
);
645 return sizeof (struct tree_label_decl
);
647 return sizeof (struct tree_result_decl
);
649 return sizeof (struct tree_const_decl
);
651 return sizeof (struct tree_type_decl
);
653 return sizeof (struct tree_function_decl
);
654 case DEBUG_EXPR_DECL
:
655 return sizeof (struct tree_decl_with_rtl
);
657 return sizeof (struct tree_decl_non_common
);
661 case tcc_type
: /* a type node */
662 return sizeof (struct tree_type_non_common
);
664 case tcc_reference
: /* a reference */
665 case tcc_expression
: /* an expression */
666 case tcc_statement
: /* an expression with side effects */
667 case tcc_comparison
: /* a comparison expression */
668 case tcc_unary
: /* a unary arithmetic expression */
669 case tcc_binary
: /* a binary arithmetic expression */
670 return (sizeof (struct tree_exp
)
671 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
673 case tcc_constant
: /* a constant */
676 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
677 case REAL_CST
: return sizeof (struct tree_real_cst
);
678 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
679 case COMPLEX_CST
: return sizeof (struct tree_complex
);
680 case VECTOR_CST
: return sizeof (struct tree_vector
);
681 case STRING_CST
: gcc_unreachable ();
683 return lang_hooks
.tree_size (code
);
686 case tcc_exceptional
: /* something random, like an identifier. */
689 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
690 case TREE_LIST
: return sizeof (struct tree_list
);
693 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
696 case OMP_CLAUSE
: gcc_unreachable ();
698 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
700 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
701 case BLOCK
: return sizeof (struct tree_block
);
702 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
703 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
704 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
707 return lang_hooks
.tree_size (code
);
715 /* Compute the number of bytes occupied by NODE. This routine only
716 looks at TREE_CODE, except for those nodes that have variable sizes. */
718 tree_size (const_tree node
)
720 const enum tree_code code
= TREE_CODE (node
);
724 return (offsetof (struct tree_binfo
, base_binfos
)
726 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
729 return (sizeof (struct tree_vec
)
730 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
733 return (sizeof (struct tree_vector
)
734 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
737 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
740 return (sizeof (struct tree_omp_clause
)
741 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
745 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
746 return (sizeof (struct tree_exp
)
747 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
749 return tree_code_size (code
);
753 /* Record interesting allocation statistics for a tree node with CODE
757 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
758 size_t length ATTRIBUTE_UNUSED
)
760 enum tree_code_class type
= TREE_CODE_CLASS (code
);
763 if (!GATHER_STATISTICS
)
768 case tcc_declaration
: /* A decl node */
772 case tcc_type
: /* a type node */
776 case tcc_statement
: /* an expression with side effects */
780 case tcc_reference
: /* a reference */
784 case tcc_expression
: /* an expression */
785 case tcc_comparison
: /* a comparison expression */
786 case tcc_unary
: /* a unary arithmetic expression */
787 case tcc_binary
: /* a binary arithmetic expression */
791 case tcc_constant
: /* a constant */
795 case tcc_exceptional
: /* something random, like an identifier. */
798 case IDENTIFIER_NODE
:
811 kind
= ssa_name_kind
;
823 kind
= omp_clause_kind
;
840 tree_code_counts
[(int) code
]++;
841 tree_node_counts
[(int) kind
]++;
842 tree_node_sizes
[(int) kind
] += length
;
845 /* Allocate and return a new UID from the DECL_UID namespace. */
848 allocate_decl_uid (void)
850 return next_decl_uid
++;
853 /* Return a newly allocated node of code CODE. For decl and type
854 nodes, some other fields are initialized. The rest of the node is
855 initialized to zero. This function cannot be used for TREE_VEC or
856 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
858 Achoo! I got a code in the node. */
861 make_node_stat (enum tree_code code MEM_STAT_DECL
)
864 enum tree_code_class type
= TREE_CODE_CLASS (code
);
865 size_t length
= tree_code_size (code
);
867 record_node_allocation_statistics (code
, length
);
869 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
870 TREE_SET_CODE (t
, code
);
875 TREE_SIDE_EFFECTS (t
) = 1;
878 case tcc_declaration
:
879 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
881 if (code
== FUNCTION_DECL
)
883 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
884 DECL_MODE (t
) = FUNCTION_MODE
;
889 DECL_SOURCE_LOCATION (t
) = input_location
;
890 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
891 DECL_UID (t
) = --next_debug_decl_uid
;
894 DECL_UID (t
) = allocate_decl_uid ();
895 SET_DECL_PT_UID (t
, -1);
897 if (TREE_CODE (t
) == LABEL_DECL
)
898 LABEL_DECL_UID (t
) = -1;
903 TYPE_UID (t
) = next_type_uid
++;
904 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
905 TYPE_USER_ALIGN (t
) = 0;
906 TYPE_MAIN_VARIANT (t
) = t
;
907 TYPE_CANONICAL (t
) = t
;
909 /* Default to no attributes for type, but let target change that. */
910 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
911 targetm
.set_default_type_attributes (t
);
913 /* We have not yet computed the alias set for this type. */
914 TYPE_ALIAS_SET (t
) = -1;
918 TREE_CONSTANT (t
) = 1;
927 case PREDECREMENT_EXPR
:
928 case PREINCREMENT_EXPR
:
929 case POSTDECREMENT_EXPR
:
930 case POSTINCREMENT_EXPR
:
931 /* All of these have side-effects, no matter what their
933 TREE_SIDE_EFFECTS (t
) = 1;
942 /* Other classes need no special treatment. */
949 /* Return a new node with the same contents as NODE except that its
950 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
953 copy_node_stat (tree node MEM_STAT_DECL
)
956 enum tree_code code
= TREE_CODE (node
);
959 gcc_assert (code
!= STATEMENT_LIST
);
961 length
= tree_size (node
);
962 record_node_allocation_statistics (code
, length
);
963 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
964 memcpy (t
, node
, length
);
966 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
968 TREE_ASM_WRITTEN (t
) = 0;
969 TREE_VISITED (t
) = 0;
971 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
973 if (code
== DEBUG_EXPR_DECL
)
974 DECL_UID (t
) = --next_debug_decl_uid
;
977 DECL_UID (t
) = allocate_decl_uid ();
978 if (DECL_PT_UID_SET_P (node
))
979 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
981 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
982 && DECL_HAS_VALUE_EXPR_P (node
))
984 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
985 DECL_HAS_VALUE_EXPR_P (t
) = 1;
987 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
988 if (TREE_CODE (node
) == VAR_DECL
)
989 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
990 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
992 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
993 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
995 if (TREE_CODE (node
) == FUNCTION_DECL
)
996 DECL_STRUCT_FUNCTION (t
) = NULL
;
998 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1000 TYPE_UID (t
) = next_type_uid
++;
1001 /* The following is so that the debug code for
1002 the copy is different from the original type.
1003 The two statements usually duplicate each other
1004 (because they clear fields of the same union),
1005 but the optimizer should catch that. */
1006 TYPE_SYMTAB_POINTER (t
) = 0;
1007 TYPE_SYMTAB_ADDRESS (t
) = 0;
1009 /* Do not copy the values cache. */
1010 if (TYPE_CACHED_VALUES_P(t
))
1012 TYPE_CACHED_VALUES_P (t
) = 0;
1013 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1020 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1021 For example, this can copy a list made of TREE_LIST nodes. */
1024 copy_list (tree list
)
1032 head
= prev
= copy_node (list
);
1033 next
= TREE_CHAIN (list
);
1036 TREE_CHAIN (prev
) = copy_node (next
);
1037 prev
= TREE_CHAIN (prev
);
1038 next
= TREE_CHAIN (next
);
1044 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1047 build_int_cst (tree type
, HOST_WIDE_INT low
)
1049 /* Support legacy code. */
1051 type
= integer_type_node
;
1053 return double_int_to_tree (type
, double_int::from_shwi (low
));
1056 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1059 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1063 return double_int_to_tree (type
, double_int::from_shwi (low
));
1066 /* Constructs tree in type TYPE from with value given by CST. Signedness
1067 of CST is assumed to be the same as the signedness of TYPE. */
1070 double_int_to_tree (tree type
, double_int cst
)
1072 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1074 cst
= cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1076 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1079 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1080 to be the same as the signedness of TYPE. */
1083 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1085 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1088 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1093 /* We force the double_int CST to the range of the type TYPE by sign or
1094 zero extending it. OVERFLOWABLE indicates if we are interested in
1095 overflow of the value, when >0 we are only interested in signed
1096 overflow, for <0 we are interested in any overflow. OVERFLOWED
1097 indicates whether overflow has already occurred. CONST_OVERFLOWED
1098 indicates whether constant overflow has already occurred. We force
1099 T's value to be within range of T's type (by setting to 0 or 1 all
1100 the bits outside the type's range). We set TREE_OVERFLOWED if,
1101 OVERFLOWED is nonzero,
1102 or OVERFLOWABLE is >0 and signed overflow occurs
1103 or OVERFLOWABLE is <0 and any overflow occurs
1104 We return a new tree node for the extended double_int. The node
1105 is shared if no overflow flags are set. */
1109 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1112 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1114 /* If we need to set overflow flags, return a new unshared node. */
1115 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1119 || (overflowable
> 0 && sign_extended_type
))
1121 tree t
= make_node (INTEGER_CST
);
1123 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1124 TREE_TYPE (t
) = type
;
1125 TREE_OVERFLOW (t
) = 1;
1130 /* Else build a shared node. */
1131 return double_int_to_tree (type
, cst
);
1134 /* These are the hash table functions for the hash table of INTEGER_CST
1135 nodes of a sizetype. */
1137 /* Return the hash code code X, an INTEGER_CST. */
1140 int_cst_hash_hash (const void *x
)
1142 const_tree
const t
= (const_tree
) x
;
1144 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1145 ^ htab_hash_pointer (TREE_TYPE (t
)));
1148 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1149 is the same as that given by *Y, which is the same. */
1152 int_cst_hash_eq (const void *x
, const void *y
)
1154 const_tree
const xt
= (const_tree
) x
;
1155 const_tree
const yt
= (const_tree
) y
;
1157 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1158 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1159 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1162 /* Create an INT_CST node of TYPE and value HI:LOW.
1163 The returned node is always shared. For small integers we use a
1164 per-type vector cache, for larger ones we use a single hash table. */
1167 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1175 switch (TREE_CODE (type
))
1178 gcc_assert (hi
== 0 && low
== 0);
1182 case REFERENCE_TYPE
:
1183 /* Cache NULL pointer. */
1192 /* Cache false or true. */
1200 if (TYPE_UNSIGNED (type
))
1203 limit
= INTEGER_SHARE_LIMIT
;
1204 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1210 limit
= INTEGER_SHARE_LIMIT
+ 1;
1211 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1213 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1227 /* Look for it in the type's vector of small shared ints. */
1228 if (!TYPE_CACHED_VALUES_P (type
))
1230 TYPE_CACHED_VALUES_P (type
) = 1;
1231 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1234 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1237 /* Make sure no one is clobbering the shared constant. */
1238 gcc_assert (TREE_TYPE (t
) == type
);
1239 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1240 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1244 /* Create a new shared int. */
1245 t
= make_node (INTEGER_CST
);
1247 TREE_INT_CST_LOW (t
) = low
;
1248 TREE_INT_CST_HIGH (t
) = hi
;
1249 TREE_TYPE (t
) = type
;
1251 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1256 /* Use the cache of larger shared ints. */
1259 TREE_INT_CST_LOW (int_cst_node
) = low
;
1260 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1261 TREE_TYPE (int_cst_node
) = type
;
1263 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1267 /* Insert this one into the hash table. */
1270 /* Make a new node for next time round. */
1271 int_cst_node
= make_node (INTEGER_CST
);
1279 cache_integer_cst (tree t
)
1281 tree type
= TREE_TYPE (t
);
1282 HOST_WIDE_INT hi
= TREE_INT_CST_HIGH (t
);
1283 unsigned HOST_WIDE_INT low
= TREE_INT_CST_LOW (t
);
1287 gcc_assert (!TREE_OVERFLOW (t
));
1289 switch (TREE_CODE (type
))
1292 gcc_assert (hi
== 0 && low
== 0);
1296 case REFERENCE_TYPE
:
1297 /* Cache NULL pointer. */
1306 /* Cache false or true. */
1314 if (TYPE_UNSIGNED (type
))
1317 limit
= INTEGER_SHARE_LIMIT
;
1318 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1324 limit
= INTEGER_SHARE_LIMIT
+ 1;
1325 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1327 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1341 /* Look for it in the type's vector of small shared ints. */
1342 if (!TYPE_CACHED_VALUES_P (type
))
1344 TYPE_CACHED_VALUES_P (type
) = 1;
1345 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1348 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1349 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1353 /* Use the cache of larger shared ints. */
1356 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1357 /* If there is already an entry for the number verify it's the
1361 gcc_assert (TREE_INT_CST_LOW ((tree
)*slot
) == low
1362 && TREE_INT_CST_HIGH ((tree
)*slot
) == hi
);
1365 /* Otherwise insert this one into the hash table. */
1371 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1372 and the rest are zeros. */
1375 build_low_bits_mask (tree type
, unsigned bits
)
1379 gcc_assert (bits
<= TYPE_PRECISION (type
));
1381 if (bits
== TYPE_PRECISION (type
)
1382 && !TYPE_UNSIGNED (type
))
1383 /* Sign extended all-ones mask. */
1384 mask
= double_int_minus_one
;
1386 mask
= double_int::mask (bits
);
1388 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1391 /* Checks that X is integer constant that can be expressed in (unsigned)
1392 HOST_WIDE_INT without loss of precision. */
1395 cst_and_fits_in_hwi (const_tree x
)
1397 if (TREE_CODE (x
) != INTEGER_CST
)
1400 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1403 return (TREE_INT_CST_HIGH (x
) == 0
1404 || TREE_INT_CST_HIGH (x
) == -1);
1407 /* Build a newly constructed TREE_VEC node of length LEN. */
1410 make_vector_stat (unsigned len MEM_STAT_DECL
)
1413 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1415 record_node_allocation_statistics (VECTOR_CST
, length
);
1417 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1419 TREE_SET_CODE (t
, VECTOR_CST
);
1420 TREE_CONSTANT (t
) = 1;
1425 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1426 are in a list pointed to by VALS. */
1429 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1433 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1434 TREE_TYPE (v
) = type
;
1436 /* Iterate through elements and check for overflow. */
1437 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1439 tree value
= vals
[cnt
];
1441 VECTOR_CST_ELT (v
, cnt
) = value
;
1443 /* Don't crash if we get an address constant. */
1444 if (!CONSTANT_CLASS_P (value
))
1447 over
|= TREE_OVERFLOW (value
);
1450 TREE_OVERFLOW (v
) = over
;
1454 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1455 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1458 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1460 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1461 unsigned HOST_WIDE_INT idx
;
1464 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1466 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1467 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1469 return build_vector (type
, vec
);
1472 /* Build a vector of type VECTYPE where all the elements are SCs. */
1474 build_vector_from_val (tree vectype
, tree sc
)
1476 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1478 if (sc
== error_mark_node
)
1481 /* Verify that the vector type is suitable for SC. Note that there
1482 is some inconsistency in the type-system with respect to restrict
1483 qualifications of pointers. Vector types always have a main-variant
1484 element type and the qualification is applied to the vector-type.
1485 So TREE_TYPE (vector-type) does not return a properly qualified
1486 vector element-type. */
1487 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1488 TREE_TYPE (vectype
)));
1490 if (CONSTANT_CLASS_P (sc
))
1492 tree
*v
= XALLOCAVEC (tree
, nunits
);
1493 for (i
= 0; i
< nunits
; ++i
)
1495 return build_vector (vectype
, v
);
1499 vec
<constructor_elt
, va_gc
> *v
;
1500 vec_alloc (v
, nunits
);
1501 for (i
= 0; i
< nunits
; ++i
)
1502 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1503 return build_constructor (vectype
, v
);
1507 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1508 are in the vec pointed to by VALS. */
1510 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1512 tree c
= make_node (CONSTRUCTOR
);
1514 constructor_elt
*elt
;
1515 bool constant_p
= true;
1516 bool side_effects_p
= false;
1518 TREE_TYPE (c
) = type
;
1519 CONSTRUCTOR_ELTS (c
) = vals
;
1521 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1523 /* Mostly ctors will have elts that don't have side-effects, so
1524 the usual case is to scan all the elements. Hence a single
1525 loop for both const and side effects, rather than one loop
1526 each (with early outs). */
1527 if (!TREE_CONSTANT (elt
->value
))
1529 if (TREE_SIDE_EFFECTS (elt
->value
))
1530 side_effects_p
= true;
1533 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1534 TREE_CONSTANT (c
) = constant_p
;
1539 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1542 build_constructor_single (tree type
, tree index
, tree value
)
1544 vec
<constructor_elt
, va_gc
> *v
;
1545 constructor_elt elt
= {index
, value
};
1548 v
->quick_push (elt
);
1550 return build_constructor (type
, v
);
1554 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1555 are in a list pointed to by VALS. */
1557 build_constructor_from_list (tree type
, tree vals
)
1560 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1564 vec_alloc (v
, list_length (vals
));
1565 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1566 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1569 return build_constructor (type
, v
);
1572 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1573 of elements, provided as index/value pairs. */
1576 build_constructor_va (tree type
, int nelts
, ...)
1578 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1581 va_start (p
, nelts
);
1582 vec_alloc (v
, nelts
);
1585 tree index
= va_arg (p
, tree
);
1586 tree value
= va_arg (p
, tree
);
1587 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1590 return build_constructor (type
, v
);
1593 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1596 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1599 FIXED_VALUE_TYPE
*fp
;
1601 v
= make_node (FIXED_CST
);
1602 fp
= ggc_alloc_fixed_value ();
1603 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1605 TREE_TYPE (v
) = type
;
1606 TREE_FIXED_CST_PTR (v
) = fp
;
1610 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1613 build_real (tree type
, REAL_VALUE_TYPE d
)
1616 REAL_VALUE_TYPE
*dp
;
1619 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1620 Consider doing it via real_convert now. */
1622 v
= make_node (REAL_CST
);
1623 dp
= ggc_alloc_real_value ();
1624 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1626 TREE_TYPE (v
) = type
;
1627 TREE_REAL_CST_PTR (v
) = dp
;
1628 TREE_OVERFLOW (v
) = overflow
;
1632 /* Return a new REAL_CST node whose type is TYPE
1633 and whose value is the integer value of the INTEGER_CST node I. */
1636 real_value_from_int_cst (const_tree type
, const_tree i
)
1640 /* Clear all bits of the real value type so that we can later do
1641 bitwise comparisons to see if two values are the same. */
1642 memset (&d
, 0, sizeof d
);
1644 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1645 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1646 TYPE_UNSIGNED (TREE_TYPE (i
)));
1650 /* Given a tree representing an integer constant I, return a tree
1651 representing the same value as a floating-point constant of type TYPE. */
1654 build_real_from_int_cst (tree type
, const_tree i
)
1657 int overflow
= TREE_OVERFLOW (i
);
1659 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1661 TREE_OVERFLOW (v
) |= overflow
;
1665 /* Return a newly constructed STRING_CST node whose value is
1666 the LEN characters at STR.
1667 Note that for a C string literal, LEN should include the trailing NUL.
1668 The TREE_TYPE is not initialized. */
1671 build_string (int len
, const char *str
)
1676 /* Do not waste bytes provided by padding of struct tree_string. */
1677 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1679 record_node_allocation_statistics (STRING_CST
, length
);
1681 s
= ggc_alloc_tree_node (length
);
1683 memset (s
, 0, sizeof (struct tree_typed
));
1684 TREE_SET_CODE (s
, STRING_CST
);
1685 TREE_CONSTANT (s
) = 1;
1686 TREE_STRING_LENGTH (s
) = len
;
1687 memcpy (s
->string
.str
, str
, len
);
1688 s
->string
.str
[len
] = '\0';
1693 /* Return a newly constructed COMPLEX_CST node whose value is
1694 specified by the real and imaginary parts REAL and IMAG.
1695 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1696 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1699 build_complex (tree type
, tree real
, tree imag
)
1701 tree t
= make_node (COMPLEX_CST
);
1703 TREE_REALPART (t
) = real
;
1704 TREE_IMAGPART (t
) = imag
;
1705 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1706 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1710 /* Return a constant of arithmetic type TYPE which is the
1711 multiplicative identity of the set TYPE. */
1714 build_one_cst (tree type
)
1716 switch (TREE_CODE (type
))
1718 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1719 case POINTER_TYPE
: case REFERENCE_TYPE
:
1721 return build_int_cst (type
, 1);
1724 return build_real (type
, dconst1
);
1726 case FIXED_POINT_TYPE
:
1727 /* We can only generate 1 for accum types. */
1728 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1729 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1733 tree scalar
= build_one_cst (TREE_TYPE (type
));
1735 return build_vector_from_val (type
, scalar
);
1739 return build_complex (type
,
1740 build_one_cst (TREE_TYPE (type
)),
1741 build_zero_cst (TREE_TYPE (type
)));
1748 /* Return an integer of type TYPE containing all 1's in as much precision as
1749 it contains, or a complex or vector whose subparts are such integers. */
1752 build_all_ones_cst (tree type
)
1754 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1756 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1757 return build_complex (type
, scalar
, scalar
);
1760 return build_minus_one_cst (type
);
1763 /* Return a constant of arithmetic type TYPE which is the
1764 opposite of the multiplicative identity of the set TYPE. */
1767 build_minus_one_cst (tree type
)
1769 switch (TREE_CODE (type
))
1771 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1772 case POINTER_TYPE
: case REFERENCE_TYPE
:
1774 return build_int_cst (type
, -1);
1777 return build_real (type
, dconstm1
);
1779 case FIXED_POINT_TYPE
:
1780 /* We can only generate 1 for accum types. */
1781 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1782 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1787 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1789 return build_vector_from_val (type
, scalar
);
1793 return build_complex (type
,
1794 build_minus_one_cst (TREE_TYPE (type
)),
1795 build_zero_cst (TREE_TYPE (type
)));
1802 /* Build 0 constant of type TYPE. This is used by constructor folding
1803 and thus the constant should be represented in memory by
1807 build_zero_cst (tree type
)
1809 switch (TREE_CODE (type
))
1811 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1812 case POINTER_TYPE
: case REFERENCE_TYPE
:
1813 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1814 return build_int_cst (type
, 0);
1817 return build_real (type
, dconst0
);
1819 case FIXED_POINT_TYPE
:
1820 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1824 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1826 return build_vector_from_val (type
, scalar
);
1831 tree zero
= build_zero_cst (TREE_TYPE (type
));
1833 return build_complex (type
, zero
, zero
);
1837 if (!AGGREGATE_TYPE_P (type
))
1838 return fold_convert (type
, integer_zero_node
);
1839 return build_constructor (type
, NULL
);
1844 /* Build a BINFO with LEN language slots. */
1847 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1850 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1851 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1853 record_node_allocation_statistics (TREE_BINFO
, length
);
1855 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1857 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1859 TREE_SET_CODE (t
, TREE_BINFO
);
1861 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1866 /* Create a CASE_LABEL_EXPR tree node and return it. */
1869 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1871 tree t
= make_node (CASE_LABEL_EXPR
);
1873 TREE_TYPE (t
) = void_type_node
;
1874 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1876 CASE_LOW (t
) = low_value
;
1877 CASE_HIGH (t
) = high_value
;
1878 CASE_LABEL (t
) = label_decl
;
1879 CASE_CHAIN (t
) = NULL_TREE
;
1884 /* Build a newly constructed TREE_VEC node of length LEN. */
1887 make_tree_vec_stat (int len MEM_STAT_DECL
)
1890 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1892 record_node_allocation_statistics (TREE_VEC
, length
);
1894 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1896 TREE_SET_CODE (t
, TREE_VEC
);
1897 TREE_VEC_LENGTH (t
) = len
;
1902 /* Return 1 if EXPR is the integer constant zero or a complex constant
1906 integer_zerop (const_tree expr
)
1910 switch (TREE_CODE (expr
))
1913 return (TREE_INT_CST_LOW (expr
) == 0
1914 && TREE_INT_CST_HIGH (expr
) == 0);
1916 return (integer_zerop (TREE_REALPART (expr
))
1917 && integer_zerop (TREE_IMAGPART (expr
)));
1921 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1922 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1931 /* Return 1 if EXPR is the integer constant one or the corresponding
1932 complex constant. */
1935 integer_onep (const_tree expr
)
1939 switch (TREE_CODE (expr
))
1942 return (TREE_INT_CST_LOW (expr
) == 1
1943 && TREE_INT_CST_HIGH (expr
) == 0);
1945 return (integer_onep (TREE_REALPART (expr
))
1946 && integer_zerop (TREE_IMAGPART (expr
)));
1950 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1951 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1960 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1961 it contains, or a complex or vector whose subparts are such integers. */
1964 integer_all_onesp (const_tree expr
)
1971 if (TREE_CODE (expr
) == COMPLEX_CST
1972 && integer_all_onesp (TREE_REALPART (expr
))
1973 && integer_all_onesp (TREE_IMAGPART (expr
)))
1976 else if (TREE_CODE (expr
) == VECTOR_CST
)
1979 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1980 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1985 else if (TREE_CODE (expr
) != INTEGER_CST
)
1988 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1989 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1990 && TREE_INT_CST_HIGH (expr
) == -1)
1995 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1996 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1998 HOST_WIDE_INT high_value
;
2001 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
2003 /* Can not handle precisions greater than twice the host int size. */
2004 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
2005 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
2006 /* Shifting by the host word size is undefined according to the ANSI
2007 standard, so we must handle this as a special case. */
2010 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
2012 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
2013 && TREE_INT_CST_HIGH (expr
) == high_value
);
2016 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
2019 /* Return 1 if EXPR is the integer constant minus one. */
2022 integer_minus_onep (const_tree expr
)
2026 if (TREE_CODE (expr
) == COMPLEX_CST
)
2027 return (integer_all_onesp (TREE_REALPART (expr
))
2028 && integer_zerop (TREE_IMAGPART (expr
)));
2030 return integer_all_onesp (expr
);
2033 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2037 integer_pow2p (const_tree expr
)
2040 unsigned HOST_WIDE_INT high
, low
;
2044 if (TREE_CODE (expr
) == COMPLEX_CST
2045 && integer_pow2p (TREE_REALPART (expr
))
2046 && integer_zerop (TREE_IMAGPART (expr
)))
2049 if (TREE_CODE (expr
) != INTEGER_CST
)
2052 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2053 high
= TREE_INT_CST_HIGH (expr
);
2054 low
= TREE_INT_CST_LOW (expr
);
2056 /* First clear all bits that are beyond the type's precision in case
2057 we've been sign extended. */
2059 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
2061 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2062 high
&= ~(HOST_WIDE_INT_M1U
<< (prec
- HOST_BITS_PER_WIDE_INT
));
2066 if (prec
< HOST_BITS_PER_WIDE_INT
)
2067 low
&= ~(HOST_WIDE_INT_M1U
<< prec
);
2070 if (high
== 0 && low
== 0)
2073 return ((high
== 0 && (low
& (low
- 1)) == 0)
2074 || (low
== 0 && (high
& (high
- 1)) == 0));
2077 /* Return 1 if EXPR is an integer constant other than zero or a
2078 complex constant other than zero. */
2081 integer_nonzerop (const_tree expr
)
2085 return ((TREE_CODE (expr
) == INTEGER_CST
2086 && (TREE_INT_CST_LOW (expr
) != 0
2087 || TREE_INT_CST_HIGH (expr
) != 0))
2088 || (TREE_CODE (expr
) == COMPLEX_CST
2089 && (integer_nonzerop (TREE_REALPART (expr
))
2090 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2093 /* Return 1 if EXPR is the fixed-point constant zero. */
2096 fixed_zerop (const_tree expr
)
2098 return (TREE_CODE (expr
) == FIXED_CST
2099 && TREE_FIXED_CST (expr
).data
.is_zero ());
2102 /* Return the power of two represented by a tree node known to be a
2106 tree_log2 (const_tree expr
)
2109 HOST_WIDE_INT high
, low
;
2113 if (TREE_CODE (expr
) == COMPLEX_CST
)
2114 return tree_log2 (TREE_REALPART (expr
));
2116 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2117 high
= TREE_INT_CST_HIGH (expr
);
2118 low
= TREE_INT_CST_LOW (expr
);
2120 /* First clear all bits that are beyond the type's precision in case
2121 we've been sign extended. */
2123 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
2125 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2126 high
&= ~(HOST_WIDE_INT_M1U
<< (prec
- HOST_BITS_PER_WIDE_INT
));
2130 if (prec
< HOST_BITS_PER_WIDE_INT
)
2131 low
&= ~(HOST_WIDE_INT_M1U
<< prec
);
2134 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
2135 : exact_log2 (low
));
2138 /* Similar, but return the largest integer Y such that 2 ** Y is less
2139 than or equal to EXPR. */
2142 tree_floor_log2 (const_tree expr
)
2145 HOST_WIDE_INT high
, low
;
2149 if (TREE_CODE (expr
) == COMPLEX_CST
)
2150 return tree_log2 (TREE_REALPART (expr
));
2152 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2153 high
= TREE_INT_CST_HIGH (expr
);
2154 low
= TREE_INT_CST_LOW (expr
);
2156 /* First clear all bits that are beyond the type's precision in case
2157 we've been sign extended. Ignore if type's precision hasn't been set
2158 since what we are doing is setting it. */
2160 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
2162 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2163 high
&= ~(HOST_WIDE_INT_M1U
<< (prec
- HOST_BITS_PER_WIDE_INT
));
2167 if (prec
< HOST_BITS_PER_WIDE_INT
)
2168 low
&= ~(HOST_WIDE_INT_M1U
<< prec
);
2171 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
2172 : floor_log2 (low
));
2175 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2176 decimal float constants, so don't return 1 for them. */
2179 real_zerop (const_tree expr
)
2183 switch (TREE_CODE (expr
))
2186 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2187 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2189 return real_zerop (TREE_REALPART (expr
))
2190 && real_zerop (TREE_IMAGPART (expr
));
2194 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2195 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2204 /* Return 1 if EXPR is the real constant one in real or complex form.
2205 Trailing zeroes matter for decimal float constants, so don't return
2209 real_onep (const_tree expr
)
2213 switch (TREE_CODE (expr
))
2216 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2217 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2219 return real_onep (TREE_REALPART (expr
))
2220 && real_zerop (TREE_IMAGPART (expr
));
2224 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2225 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2234 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2235 for decimal float constants, so don't return 1 for them. */
2238 real_twop (const_tree expr
)
2242 switch (TREE_CODE (expr
))
2245 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2246 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2248 return real_twop (TREE_REALPART (expr
))
2249 && real_zerop (TREE_IMAGPART (expr
));
2253 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2254 if (!real_twop (VECTOR_CST_ELT (expr
, i
)))
2263 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2264 matter for decimal float constants, so don't return 1 for them. */
2267 real_minus_onep (const_tree expr
)
2271 switch (TREE_CODE (expr
))
2274 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2275 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2277 return real_minus_onep (TREE_REALPART (expr
))
2278 && real_zerop (TREE_IMAGPART (expr
));
2282 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2283 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2292 /* Nonzero if EXP is a constant or a cast of a constant. */
2295 really_constant_p (const_tree exp
)
2297 /* This is not quite the same as STRIP_NOPS. It does more. */
2298 while (CONVERT_EXPR_P (exp
)
2299 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2300 exp
= TREE_OPERAND (exp
, 0);
2301 return TREE_CONSTANT (exp
);
2304 /* Return first list element whose TREE_VALUE is ELEM.
2305 Return 0 if ELEM is not in LIST. */
2308 value_member (tree elem
, tree list
)
2312 if (elem
== TREE_VALUE (list
))
2314 list
= TREE_CHAIN (list
);
2319 /* Return first list element whose TREE_PURPOSE is ELEM.
2320 Return 0 if ELEM is not in LIST. */
2323 purpose_member (const_tree elem
, tree list
)
2327 if (elem
== TREE_PURPOSE (list
))
2329 list
= TREE_CHAIN (list
);
2334 /* Return true if ELEM is in V. */
2337 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2341 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2347 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2351 chain_index (int idx
, tree chain
)
2353 for (; chain
&& idx
> 0; --idx
)
2354 chain
= TREE_CHAIN (chain
);
2358 /* Return nonzero if ELEM is part of the chain CHAIN. */
2361 chain_member (const_tree elem
, const_tree chain
)
2367 chain
= DECL_CHAIN (chain
);
2373 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2374 We expect a null pointer to mark the end of the chain.
2375 This is the Lisp primitive `length'. */
2378 list_length (const_tree t
)
2381 #ifdef ENABLE_TREE_CHECKING
2389 #ifdef ENABLE_TREE_CHECKING
2392 gcc_assert (p
!= q
);
2400 /* Returns the number of FIELD_DECLs in TYPE. */
2403 fields_length (const_tree type
)
2405 tree t
= TYPE_FIELDS (type
);
2408 for (; t
; t
= DECL_CHAIN (t
))
2409 if (TREE_CODE (t
) == FIELD_DECL
)
2415 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2416 UNION_TYPE TYPE, or NULL_TREE if none. */
2419 first_field (const_tree type
)
2421 tree t
= TYPE_FIELDS (type
);
2422 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2427 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2428 by modifying the last node in chain 1 to point to chain 2.
2429 This is the Lisp primitive `nconc'. */
2432 chainon (tree op1
, tree op2
)
2441 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2443 TREE_CHAIN (t1
) = op2
;
2445 #ifdef ENABLE_TREE_CHECKING
2448 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2449 gcc_assert (t2
!= t1
);
2456 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2459 tree_last (tree chain
)
2463 while ((next
= TREE_CHAIN (chain
)))
2468 /* Reverse the order of elements in the chain T,
2469 and return the new head of the chain (old last element). */
2474 tree prev
= 0, decl
, next
;
2475 for (decl
= t
; decl
; decl
= next
)
2477 /* We shouldn't be using this function to reverse BLOCK chains; we
2478 have blocks_nreverse for that. */
2479 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2480 next
= TREE_CHAIN (decl
);
2481 TREE_CHAIN (decl
) = prev
;
2487 /* Return a newly created TREE_LIST node whose
2488 purpose and value fields are PARM and VALUE. */
2491 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2493 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2494 TREE_PURPOSE (t
) = parm
;
2495 TREE_VALUE (t
) = value
;
2499 /* Build a chain of TREE_LIST nodes from a vector. */
2502 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2504 tree ret
= NULL_TREE
;
2508 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2510 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2511 pp
= &TREE_CHAIN (*pp
);
2516 /* Return a newly created TREE_LIST node whose
2517 purpose and value fields are PURPOSE and VALUE
2518 and whose TREE_CHAIN is CHAIN. */
2521 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2525 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2526 memset (node
, 0, sizeof (struct tree_common
));
2528 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2530 TREE_SET_CODE (node
, TREE_LIST
);
2531 TREE_CHAIN (node
) = chain
;
2532 TREE_PURPOSE (node
) = purpose
;
2533 TREE_VALUE (node
) = value
;
2537 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2541 ctor_to_vec (tree ctor
)
2543 vec
<tree
, va_gc
> *vec
;
2544 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2548 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2549 vec
->quick_push (val
);
2554 /* Return the size nominally occupied by an object of type TYPE
2555 when it resides in memory. The value is measured in units of bytes,
2556 and its data type is that normally used for type sizes
2557 (which is the first type created by make_signed_type or
2558 make_unsigned_type). */
2561 size_in_bytes (const_tree type
)
2565 if (type
== error_mark_node
)
2566 return integer_zero_node
;
2568 type
= TYPE_MAIN_VARIANT (type
);
2569 t
= TYPE_SIZE_UNIT (type
);
2573 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2574 return size_zero_node
;
2580 /* Return the size of TYPE (in bytes) as a wide integer
2581 or return -1 if the size can vary or is larger than an integer. */
2584 int_size_in_bytes (const_tree type
)
2588 if (type
== error_mark_node
)
2591 type
= TYPE_MAIN_VARIANT (type
);
2592 t
= TYPE_SIZE_UNIT (type
);
2594 || TREE_CODE (t
) != INTEGER_CST
2595 || TREE_INT_CST_HIGH (t
) != 0
2596 /* If the result would appear negative, it's too big to represent. */
2597 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2600 return TREE_INT_CST_LOW (t
);
2603 /* Return the maximum size of TYPE (in bytes) as a wide integer
2604 or return -1 if the size can vary or is larger than an integer. */
2607 max_int_size_in_bytes (const_tree type
)
2609 HOST_WIDE_INT size
= -1;
2612 /* If this is an array type, check for a possible MAX_SIZE attached. */
2614 if (TREE_CODE (type
) == ARRAY_TYPE
)
2616 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2618 if (size_tree
&& host_integerp (size_tree
, 1))
2619 size
= tree_low_cst (size_tree
, 1);
2622 /* If we still haven't been able to get a size, see if the language
2623 can compute a maximum size. */
2627 size_tree
= lang_hooks
.types
.max_size (type
);
2629 if (size_tree
&& host_integerp (size_tree
, 1))
2630 size
= tree_low_cst (size_tree
, 1);
2636 /* Returns a tree for the size of EXP in bytes. */
2639 tree_expr_size (const_tree exp
)
2642 && DECL_SIZE_UNIT (exp
) != 0)
2643 return DECL_SIZE_UNIT (exp
);
2645 return size_in_bytes (TREE_TYPE (exp
));
2648 /* Return the bit position of FIELD, in bits from the start of the record.
2649 This is a tree of type bitsizetype. */
2652 bit_position (const_tree field
)
2654 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2655 DECL_FIELD_BIT_OFFSET (field
));
2658 /* Likewise, but return as an integer. It must be representable in
2659 that way (since it could be a signed value, we don't have the
2660 option of returning -1 like int_size_in_byte can. */
2663 int_bit_position (const_tree field
)
2665 return tree_low_cst (bit_position (field
), 0);
2668 /* Return the byte position of FIELD, in bytes from the start of the record.
2669 This is a tree of type sizetype. */
2672 byte_position (const_tree field
)
2674 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2675 DECL_FIELD_BIT_OFFSET (field
));
2678 /* Likewise, but return as an integer. It must be representable in
2679 that way (since it could be a signed value, we don't have the
2680 option of returning -1 like int_size_in_byte can. */
2683 int_byte_position (const_tree field
)
2685 return tree_low_cst (byte_position (field
), 0);
2688 /* Return the strictest alignment, in bits, that T is known to have. */
2691 expr_align (const_tree t
)
2693 unsigned int align0
, align1
;
2695 switch (TREE_CODE (t
))
2697 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2698 /* If we have conversions, we know that the alignment of the
2699 object must meet each of the alignments of the types. */
2700 align0
= expr_align (TREE_OPERAND (t
, 0));
2701 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2702 return MAX (align0
, align1
);
2704 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2705 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2706 case CLEANUP_POINT_EXPR
:
2707 /* These don't change the alignment of an object. */
2708 return expr_align (TREE_OPERAND (t
, 0));
2711 /* The best we can do is say that the alignment is the least aligned
2713 align0
= expr_align (TREE_OPERAND (t
, 1));
2714 align1
= expr_align (TREE_OPERAND (t
, 2));
2715 return MIN (align0
, align1
);
2717 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2718 meaningfully, it's always 1. */
2719 case LABEL_DECL
: case CONST_DECL
:
2720 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2722 gcc_assert (DECL_ALIGN (t
) != 0);
2723 return DECL_ALIGN (t
);
2729 /* Otherwise take the alignment from that of the type. */
2730 return TYPE_ALIGN (TREE_TYPE (t
));
2733 /* Return, as a tree node, the number of elements for TYPE (which is an
2734 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2737 array_type_nelts (const_tree type
)
2739 tree index_type
, min
, max
;
2741 /* If they did it with unspecified bounds, then we should have already
2742 given an error about it before we got here. */
2743 if (! TYPE_DOMAIN (type
))
2744 return error_mark_node
;
2746 index_type
= TYPE_DOMAIN (type
);
2747 min
= TYPE_MIN_VALUE (index_type
);
2748 max
= TYPE_MAX_VALUE (index_type
);
2750 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2752 return error_mark_node
;
2754 return (integer_zerop (min
)
2756 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2759 /* If arg is static -- a reference to an object in static storage -- then
2760 return the object. This is not the same as the C meaning of `static'.
2761 If arg isn't static, return NULL. */
2766 switch (TREE_CODE (arg
))
2769 /* Nested functions are static, even though taking their address will
2770 involve a trampoline as we unnest the nested function and create
2771 the trampoline on the tree level. */
2775 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2776 && ! DECL_THREAD_LOCAL_P (arg
)
2777 && ! DECL_DLLIMPORT_P (arg
)
2781 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2785 return TREE_STATIC (arg
) ? arg
: NULL
;
2792 /* If the thing being referenced is not a field, then it is
2793 something language specific. */
2794 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2796 /* If we are referencing a bitfield, we can't evaluate an
2797 ADDR_EXPR at compile time and so it isn't a constant. */
2798 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2801 return staticp (TREE_OPERAND (arg
, 0));
2807 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2810 case ARRAY_RANGE_REF
:
2811 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2812 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2813 return staticp (TREE_OPERAND (arg
, 0));
2817 case COMPOUND_LITERAL_EXPR
:
2818 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2828 /* Return whether OP is a DECL whose address is function-invariant. */
2831 decl_address_invariant_p (const_tree op
)
2833 /* The conditions below are slightly less strict than the one in
2836 switch (TREE_CODE (op
))
2845 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2846 || DECL_THREAD_LOCAL_P (op
)
2847 || DECL_CONTEXT (op
) == current_function_decl
2848 || decl_function_context (op
) == current_function_decl
)
2853 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2854 || decl_function_context (op
) == current_function_decl
)
2865 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2868 decl_address_ip_invariant_p (const_tree op
)
2870 /* The conditions below are slightly less strict than the one in
2873 switch (TREE_CODE (op
))
2881 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2882 && !DECL_DLLIMPORT_P (op
))
2883 || DECL_THREAD_LOCAL_P (op
))
2888 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2900 /* Return true if T is function-invariant (internal function, does
2901 not handle arithmetic; that's handled in skip_simple_arithmetic and
2902 tree_invariant_p). */
2904 static bool tree_invariant_p (tree t
);
2907 tree_invariant_p_1 (tree t
)
2911 if (TREE_CONSTANT (t
)
2912 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2915 switch (TREE_CODE (t
))
2921 op
= TREE_OPERAND (t
, 0);
2922 while (handled_component_p (op
))
2924 switch (TREE_CODE (op
))
2927 case ARRAY_RANGE_REF
:
2928 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2929 || TREE_OPERAND (op
, 2) != NULL_TREE
2930 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2935 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2941 op
= TREE_OPERAND (op
, 0);
2944 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2953 /* Return true if T is function-invariant. */
2956 tree_invariant_p (tree t
)
2958 tree inner
= skip_simple_arithmetic (t
);
2959 return tree_invariant_p_1 (inner
);
2962 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2963 Do this to any expression which may be used in more than one place,
2964 but must be evaluated only once.
2966 Normally, expand_expr would reevaluate the expression each time.
2967 Calling save_expr produces something that is evaluated and recorded
2968 the first time expand_expr is called on it. Subsequent calls to
2969 expand_expr just reuse the recorded value.
2971 The call to expand_expr that generates code that actually computes
2972 the value is the first call *at compile time*. Subsequent calls
2973 *at compile time* generate code to use the saved value.
2974 This produces correct result provided that *at run time* control
2975 always flows through the insns made by the first expand_expr
2976 before reaching the other places where the save_expr was evaluated.
2977 You, the caller of save_expr, must make sure this is so.
2979 Constants, and certain read-only nodes, are returned with no
2980 SAVE_EXPR because that is safe. Expressions containing placeholders
2981 are not touched; see tree.def for an explanation of what these
2985 save_expr (tree expr
)
2987 tree t
= fold (expr
);
2990 /* If the tree evaluates to a constant, then we don't want to hide that
2991 fact (i.e. this allows further folding, and direct checks for constants).
2992 However, a read-only object that has side effects cannot be bypassed.
2993 Since it is no problem to reevaluate literals, we just return the
2995 inner
= skip_simple_arithmetic (t
);
2996 if (TREE_CODE (inner
) == ERROR_MARK
)
2999 if (tree_invariant_p_1 (inner
))
3002 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3003 it means that the size or offset of some field of an object depends on
3004 the value within another field.
3006 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3007 and some variable since it would then need to be both evaluated once and
3008 evaluated more than once. Front-ends must assure this case cannot
3009 happen by surrounding any such subexpressions in their own SAVE_EXPR
3010 and forcing evaluation at the proper time. */
3011 if (contains_placeholder_p (inner
))
3014 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3015 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3017 /* This expression might be placed ahead of a jump to ensure that the
3018 value was computed on both sides of the jump. So make sure it isn't
3019 eliminated as dead. */
3020 TREE_SIDE_EFFECTS (t
) = 1;
3024 /* Look inside EXPR into any simple arithmetic operations. Return the
3025 outermost non-arithmetic or non-invariant node. */
3028 skip_simple_arithmetic (tree expr
)
3030 /* We don't care about whether this can be used as an lvalue in this
3032 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3033 expr
= TREE_OPERAND (expr
, 0);
3035 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3036 a constant, it will be more efficient to not make another SAVE_EXPR since
3037 it will allow better simplification and GCSE will be able to merge the
3038 computations if they actually occur. */
3041 if (UNARY_CLASS_P (expr
))
3042 expr
= TREE_OPERAND (expr
, 0);
3043 else if (BINARY_CLASS_P (expr
))
3045 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3046 expr
= TREE_OPERAND (expr
, 0);
3047 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3048 expr
= TREE_OPERAND (expr
, 1);
3059 /* Look inside EXPR into simple arithmetic operations involving constants.
3060 Return the outermost non-arithmetic or non-constant node. */
3063 skip_simple_constant_arithmetic (tree expr
)
3065 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3066 expr
= TREE_OPERAND (expr
, 0);
3070 if (UNARY_CLASS_P (expr
))
3071 expr
= TREE_OPERAND (expr
, 0);
3072 else if (BINARY_CLASS_P (expr
))
3074 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3075 expr
= TREE_OPERAND (expr
, 0);
3076 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3077 expr
= TREE_OPERAND (expr
, 1);
3088 /* Return which tree structure is used by T. */
3090 enum tree_node_structure_enum
3091 tree_node_structure (const_tree t
)
3093 const enum tree_code code
= TREE_CODE (t
);
3094 return tree_node_structure_for_code (code
);
3097 /* Set various status flags when building a CALL_EXPR object T. */
3100 process_call_operands (tree t
)
3102 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3103 bool read_only
= false;
3104 int i
= call_expr_flags (t
);
3106 /* Calls have side-effects, except those to const or pure functions. */
3107 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3108 side_effects
= true;
3109 /* Propagate TREE_READONLY of arguments for const functions. */
3113 if (!side_effects
|| read_only
)
3114 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3116 tree op
= TREE_OPERAND (t
, i
);
3117 if (op
&& TREE_SIDE_EFFECTS (op
))
3118 side_effects
= true;
3119 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3123 TREE_SIDE_EFFECTS (t
) = side_effects
;
3124 TREE_READONLY (t
) = read_only
;
3127 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3128 size or offset that depends on a field within a record. */
3131 contains_placeholder_p (const_tree exp
)
3133 enum tree_code code
;
3138 code
= TREE_CODE (exp
);
3139 if (code
== PLACEHOLDER_EXPR
)
3142 switch (TREE_CODE_CLASS (code
))
3145 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3146 position computations since they will be converted into a
3147 WITH_RECORD_EXPR involving the reference, which will assume
3148 here will be valid. */
3149 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3151 case tcc_exceptional
:
3152 if (code
== TREE_LIST
)
3153 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3154 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3159 case tcc_comparison
:
3160 case tcc_expression
:
3164 /* Ignoring the first operand isn't quite right, but works best. */
3165 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3168 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3169 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3170 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3173 /* The save_expr function never wraps anything containing
3174 a PLACEHOLDER_EXPR. */
3181 switch (TREE_CODE_LENGTH (code
))
3184 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3186 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3187 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3198 const_call_expr_arg_iterator iter
;
3199 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3200 if (CONTAINS_PLACEHOLDER_P (arg
))
3214 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3215 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3219 type_contains_placeholder_1 (const_tree type
)
3221 /* If the size contains a placeholder or the parent type (component type in
3222 the case of arrays) type involves a placeholder, this type does. */
3223 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3224 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3225 || (!POINTER_TYPE_P (type
)
3227 && type_contains_placeholder_p (TREE_TYPE (type
))))
3230 /* Now do type-specific checks. Note that the last part of the check above
3231 greatly limits what we have to do below. */
3232 switch (TREE_CODE (type
))
3240 case REFERENCE_TYPE
:
3249 case FIXED_POINT_TYPE
:
3250 /* Here we just check the bounds. */
3251 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3252 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3255 /* We have already checked the component type above, so just check the
3257 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3261 case QUAL_UNION_TYPE
:
3265 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3266 if (TREE_CODE (field
) == FIELD_DECL
3267 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3268 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3269 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3270 || type_contains_placeholder_p (TREE_TYPE (field
))))
3281 /* Wrapper around above function used to cache its result. */
3284 type_contains_placeholder_p (tree type
)
3288 /* If the contains_placeholder_bits field has been initialized,
3289 then we know the answer. */
3290 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3291 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3293 /* Indicate that we've seen this type node, and the answer is false.
3294 This is what we want to return if we run into recursion via fields. */
3295 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3297 /* Compute the real value. */
3298 result
= type_contains_placeholder_1 (type
);
3300 /* Store the real value. */
3301 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3306 /* Push tree EXP onto vector QUEUE if it is not already present. */
3309 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3314 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3315 if (simple_cst_equal (iter
, exp
) == 1)
3319 queue
->safe_push (exp
);
3322 /* Given a tree EXP, find all occurrences of references to fields
3323 in a PLACEHOLDER_EXPR and place them in vector REFS without
3324 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3325 we assume here that EXP contains only arithmetic expressions
3326 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3330 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3332 enum tree_code code
= TREE_CODE (exp
);
3336 /* We handle TREE_LIST and COMPONENT_REF separately. */
3337 if (code
== TREE_LIST
)
3339 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3340 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3342 else if (code
== COMPONENT_REF
)
3344 for (inner
= TREE_OPERAND (exp
, 0);
3345 REFERENCE_CLASS_P (inner
);
3346 inner
= TREE_OPERAND (inner
, 0))
3349 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3350 push_without_duplicates (exp
, refs
);
3352 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3355 switch (TREE_CODE_CLASS (code
))
3360 case tcc_declaration
:
3361 /* Variables allocated to static storage can stay. */
3362 if (!TREE_STATIC (exp
))
3363 push_without_duplicates (exp
, refs
);
3366 case tcc_expression
:
3367 /* This is the pattern built in ada/make_aligning_type. */
3368 if (code
== ADDR_EXPR
3369 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3371 push_without_duplicates (exp
, refs
);
3375 /* Fall through... */
3377 case tcc_exceptional
:
3380 case tcc_comparison
:
3382 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3383 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3387 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3388 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3396 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3397 return a tree with all occurrences of references to F in a
3398 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3399 CONST_DECLs. Note that we assume here that EXP contains only
3400 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3401 occurring only in their argument list. */
3404 substitute_in_expr (tree exp
, tree f
, tree r
)
3406 enum tree_code code
= TREE_CODE (exp
);
3407 tree op0
, op1
, op2
, op3
;
3410 /* We handle TREE_LIST and COMPONENT_REF separately. */
3411 if (code
== TREE_LIST
)
3413 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3414 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3415 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3418 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3420 else if (code
== COMPONENT_REF
)
3424 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3425 and it is the right field, replace it with R. */
3426 for (inner
= TREE_OPERAND (exp
, 0);
3427 REFERENCE_CLASS_P (inner
);
3428 inner
= TREE_OPERAND (inner
, 0))
3432 op1
= TREE_OPERAND (exp
, 1);
3434 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3437 /* If this expression hasn't been completed let, leave it alone. */
3438 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3441 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3442 if (op0
== TREE_OPERAND (exp
, 0))
3446 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3449 switch (TREE_CODE_CLASS (code
))
3454 case tcc_declaration
:
3460 case tcc_expression
:
3464 /* Fall through... */
3466 case tcc_exceptional
:
3469 case tcc_comparison
:
3471 switch (TREE_CODE_LENGTH (code
))
3477 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3478 if (op0
== TREE_OPERAND (exp
, 0))
3481 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3485 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3486 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3488 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3491 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3495 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3496 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3497 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3499 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3500 && op2
== TREE_OPERAND (exp
, 2))
3503 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3507 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3508 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3509 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3510 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3512 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3513 && op2
== TREE_OPERAND (exp
, 2)
3514 && op3
== TREE_OPERAND (exp
, 3))
3518 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3530 new_tree
= NULL_TREE
;
3532 /* If we are trying to replace F with a constant, inline back
3533 functions which do nothing else than computing a value from
3534 the arguments they are passed. This makes it possible to
3535 fold partially or entirely the replacement expression. */
3536 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3538 tree t
= maybe_inline_call_in_expr (exp
);
3540 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3543 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3545 tree op
= TREE_OPERAND (exp
, i
);
3546 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3550 new_tree
= copy_node (exp
);
3551 TREE_OPERAND (new_tree
, i
) = new_op
;
3557 new_tree
= fold (new_tree
);
3558 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3559 process_call_operands (new_tree
);
3570 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3572 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3573 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3578 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3579 for it within OBJ, a tree that is an object or a chain of references. */
3582 substitute_placeholder_in_expr (tree exp
, tree obj
)
3584 enum tree_code code
= TREE_CODE (exp
);
3585 tree op0
, op1
, op2
, op3
;
3588 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3589 in the chain of OBJ. */
3590 if (code
== PLACEHOLDER_EXPR
)
3592 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3595 for (elt
= obj
; elt
!= 0;
3596 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3597 || TREE_CODE (elt
) == COND_EXPR
)
3598 ? TREE_OPERAND (elt
, 1)
3599 : (REFERENCE_CLASS_P (elt
)
3600 || UNARY_CLASS_P (elt
)
3601 || BINARY_CLASS_P (elt
)
3602 || VL_EXP_CLASS_P (elt
)
3603 || EXPRESSION_CLASS_P (elt
))
3604 ? TREE_OPERAND (elt
, 0) : 0))
3605 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3608 for (elt
= obj
; elt
!= 0;
3609 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3610 || TREE_CODE (elt
) == COND_EXPR
)
3611 ? TREE_OPERAND (elt
, 1)
3612 : (REFERENCE_CLASS_P (elt
)
3613 || UNARY_CLASS_P (elt
)
3614 || BINARY_CLASS_P (elt
)
3615 || VL_EXP_CLASS_P (elt
)
3616 || EXPRESSION_CLASS_P (elt
))
3617 ? TREE_OPERAND (elt
, 0) : 0))
3618 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3619 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3621 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3623 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3624 survives until RTL generation, there will be an error. */
3628 /* TREE_LIST is special because we need to look at TREE_VALUE
3629 and TREE_CHAIN, not TREE_OPERANDS. */
3630 else if (code
== TREE_LIST
)
3632 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3633 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3634 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3637 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3640 switch (TREE_CODE_CLASS (code
))
3643 case tcc_declaration
:
3646 case tcc_exceptional
:
3649 case tcc_comparison
:
3650 case tcc_expression
:
3653 switch (TREE_CODE_LENGTH (code
))
3659 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3660 if (op0
== TREE_OPERAND (exp
, 0))
3663 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3667 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3668 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3670 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3673 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3677 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3678 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3679 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3681 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3682 && op2
== TREE_OPERAND (exp
, 2))
3685 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3689 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3690 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3691 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3692 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3694 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3695 && op2
== TREE_OPERAND (exp
, 2)
3696 && op3
== TREE_OPERAND (exp
, 3))
3700 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3712 new_tree
= NULL_TREE
;
3714 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3716 tree op
= TREE_OPERAND (exp
, i
);
3717 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3721 new_tree
= copy_node (exp
);
3722 TREE_OPERAND (new_tree
, i
) = new_op
;
3728 new_tree
= fold (new_tree
);
3729 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3730 process_call_operands (new_tree
);
3741 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3743 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3744 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3749 /* Stabilize a reference so that we can use it any number of times
3750 without causing its operands to be evaluated more than once.
3751 Returns the stabilized reference. This works by means of save_expr,
3752 so see the caveats in the comments about save_expr.
3754 Also allows conversion expressions whose operands are references.
3755 Any other kind of expression is returned unchanged. */
3758 stabilize_reference (tree ref
)
3761 enum tree_code code
= TREE_CODE (ref
);
3768 /* No action is needed in this case. */
3773 case FIX_TRUNC_EXPR
:
3774 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3778 result
= build_nt (INDIRECT_REF
,
3779 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3783 result
= build_nt (COMPONENT_REF
,
3784 stabilize_reference (TREE_OPERAND (ref
, 0)),
3785 TREE_OPERAND (ref
, 1), NULL_TREE
);
3789 result
= build_nt (BIT_FIELD_REF
,
3790 stabilize_reference (TREE_OPERAND (ref
, 0)),
3791 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3795 result
= build_nt (ARRAY_REF
,
3796 stabilize_reference (TREE_OPERAND (ref
, 0)),
3797 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3798 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3801 case ARRAY_RANGE_REF
:
3802 result
= build_nt (ARRAY_RANGE_REF
,
3803 stabilize_reference (TREE_OPERAND (ref
, 0)),
3804 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3805 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3809 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3810 it wouldn't be ignored. This matters when dealing with
3812 return stabilize_reference_1 (ref
);
3814 /* If arg isn't a kind of lvalue we recognize, make no change.
3815 Caller should recognize the error for an invalid lvalue. */
3820 return error_mark_node
;
3823 TREE_TYPE (result
) = TREE_TYPE (ref
);
3824 TREE_READONLY (result
) = TREE_READONLY (ref
);
3825 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3826 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3831 /* Subroutine of stabilize_reference; this is called for subtrees of
3832 references. Any expression with side-effects must be put in a SAVE_EXPR
3833 to ensure that it is only evaluated once.
3835 We don't put SAVE_EXPR nodes around everything, because assigning very
3836 simple expressions to temporaries causes us to miss good opportunities
3837 for optimizations. Among other things, the opportunity to fold in the
3838 addition of a constant into an addressing mode often gets lost, e.g.
3839 "y[i+1] += x;". In general, we take the approach that we should not make
3840 an assignment unless we are forced into it - i.e., that any non-side effect
3841 operator should be allowed, and that cse should take care of coalescing
3842 multiple utterances of the same expression should that prove fruitful. */
3845 stabilize_reference_1 (tree e
)
3848 enum tree_code code
= TREE_CODE (e
);
3850 /* We cannot ignore const expressions because it might be a reference
3851 to a const array but whose index contains side-effects. But we can
3852 ignore things that are actual constant or that already have been
3853 handled by this function. */
3855 if (tree_invariant_p (e
))
3858 switch (TREE_CODE_CLASS (code
))
3860 case tcc_exceptional
:
3862 case tcc_declaration
:
3863 case tcc_comparison
:
3865 case tcc_expression
:
3868 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3869 so that it will only be evaluated once. */
3870 /* The reference (r) and comparison (<) classes could be handled as
3871 below, but it is generally faster to only evaluate them once. */
3872 if (TREE_SIDE_EFFECTS (e
))
3873 return save_expr (e
);
3877 /* Constants need no processing. In fact, we should never reach
3882 /* Division is slow and tends to be compiled with jumps,
3883 especially the division by powers of 2 that is often
3884 found inside of an array reference. So do it just once. */
3885 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3886 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3887 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3888 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3889 return save_expr (e
);
3890 /* Recursively stabilize each operand. */
3891 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3892 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3896 /* Recursively stabilize each operand. */
3897 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3904 TREE_TYPE (result
) = TREE_TYPE (e
);
3905 TREE_READONLY (result
) = TREE_READONLY (e
);
3906 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3907 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3912 /* Low-level constructors for expressions. */
3914 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3915 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3918 recompute_tree_invariant_for_addr_expr (tree t
)
3921 bool tc
= true, se
= false;
3923 /* We started out assuming this address is both invariant and constant, but
3924 does not have side effects. Now go down any handled components and see if
3925 any of them involve offsets that are either non-constant or non-invariant.
3926 Also check for side-effects.
3928 ??? Note that this code makes no attempt to deal with the case where
3929 taking the address of something causes a copy due to misalignment. */
3931 #define UPDATE_FLAGS(NODE) \
3932 do { tree _node = (NODE); \
3933 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3934 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3936 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3937 node
= TREE_OPERAND (node
, 0))
3939 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3940 array reference (probably made temporarily by the G++ front end),
3941 so ignore all the operands. */
3942 if ((TREE_CODE (node
) == ARRAY_REF
3943 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3944 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3946 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3947 if (TREE_OPERAND (node
, 2))
3948 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3949 if (TREE_OPERAND (node
, 3))
3950 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3952 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3953 FIELD_DECL, apparently. The G++ front end can put something else
3954 there, at least temporarily. */
3955 else if (TREE_CODE (node
) == COMPONENT_REF
3956 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3958 if (TREE_OPERAND (node
, 2))
3959 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3963 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3965 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3966 the address, since &(*a)->b is a form of addition. If it's a constant, the
3967 address is constant too. If it's a decl, its address is constant if the
3968 decl is static. Everything else is not constant and, furthermore,
3969 taking the address of a volatile variable is not volatile. */
3970 if (TREE_CODE (node
) == INDIRECT_REF
3971 || TREE_CODE (node
) == MEM_REF
)
3972 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3973 else if (CONSTANT_CLASS_P (node
))
3975 else if (DECL_P (node
))
3976 tc
&= (staticp (node
) != NULL_TREE
);
3980 se
|= TREE_SIDE_EFFECTS (node
);
3984 TREE_CONSTANT (t
) = tc
;
3985 TREE_SIDE_EFFECTS (t
) = se
;
3989 /* Build an expression of code CODE, data type TYPE, and operands as
3990 specified. Expressions and reference nodes can be created this way.
3991 Constants, decls, types and misc nodes cannot be.
3993 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3994 enough for all extant tree codes. */
3997 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4001 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4003 t
= make_node_stat (code PASS_MEM_STAT
);
4010 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4012 int length
= sizeof (struct tree_exp
);
4015 record_node_allocation_statistics (code
, length
);
4017 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4019 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4021 memset (t
, 0, sizeof (struct tree_common
));
4023 TREE_SET_CODE (t
, code
);
4025 TREE_TYPE (t
) = type
;
4026 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4027 TREE_OPERAND (t
, 0) = node
;
4028 if (node
&& !TYPE_P (node
))
4030 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4031 TREE_READONLY (t
) = TREE_READONLY (node
);
4034 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4035 TREE_SIDE_EFFECTS (t
) = 1;
4039 /* All of these have side-effects, no matter what their
4041 TREE_SIDE_EFFECTS (t
) = 1;
4042 TREE_READONLY (t
) = 0;
4046 /* Whether a dereference is readonly has nothing to do with whether
4047 its operand is readonly. */
4048 TREE_READONLY (t
) = 0;
4053 recompute_tree_invariant_for_addr_expr (t
);
4057 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4058 && node
&& !TYPE_P (node
)
4059 && TREE_CONSTANT (node
))
4060 TREE_CONSTANT (t
) = 1;
4061 if (TREE_CODE_CLASS (code
) == tcc_reference
4062 && node
&& TREE_THIS_VOLATILE (node
))
4063 TREE_THIS_VOLATILE (t
) = 1;
4070 #define PROCESS_ARG(N) \
4072 TREE_OPERAND (t, N) = arg##N; \
4073 if (arg##N &&!TYPE_P (arg##N)) \
4075 if (TREE_SIDE_EFFECTS (arg##N)) \
4077 if (!TREE_READONLY (arg##N) \
4078 && !CONSTANT_CLASS_P (arg##N)) \
4079 (void) (read_only = 0); \
4080 if (!TREE_CONSTANT (arg##N)) \
4081 (void) (constant = 0); \
4086 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4088 bool constant
, read_only
, side_effects
;
4091 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4093 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4094 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4095 /* When sizetype precision doesn't match that of pointers
4096 we need to be able to build explicit extensions or truncations
4097 of the offset argument. */
4098 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4099 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4100 && TREE_CODE (arg1
) == INTEGER_CST
);
4102 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4103 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4104 && ptrofftype_p (TREE_TYPE (arg1
)));
4106 t
= make_node_stat (code PASS_MEM_STAT
);
4109 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4110 result based on those same flags for the arguments. But if the
4111 arguments aren't really even `tree' expressions, we shouldn't be trying
4114 /* Expressions without side effects may be constant if their
4115 arguments are as well. */
4116 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4117 || TREE_CODE_CLASS (code
) == tcc_binary
);
4119 side_effects
= TREE_SIDE_EFFECTS (t
);
4124 TREE_READONLY (t
) = read_only
;
4125 TREE_CONSTANT (t
) = constant
;
4126 TREE_SIDE_EFFECTS (t
) = side_effects
;
4127 TREE_THIS_VOLATILE (t
)
4128 = (TREE_CODE_CLASS (code
) == tcc_reference
4129 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4136 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4137 tree arg2 MEM_STAT_DECL
)
4139 bool constant
, read_only
, side_effects
;
4142 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4143 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4145 t
= make_node_stat (code PASS_MEM_STAT
);
4150 /* As a special exception, if COND_EXPR has NULL branches, we
4151 assume that it is a gimple statement and always consider
4152 it to have side effects. */
4153 if (code
== COND_EXPR
4154 && tt
== void_type_node
4155 && arg1
== NULL_TREE
4156 && arg2
== NULL_TREE
)
4157 side_effects
= true;
4159 side_effects
= TREE_SIDE_EFFECTS (t
);
4165 if (code
== COND_EXPR
)
4166 TREE_READONLY (t
) = read_only
;
4168 TREE_SIDE_EFFECTS (t
) = side_effects
;
4169 TREE_THIS_VOLATILE (t
)
4170 = (TREE_CODE_CLASS (code
) == tcc_reference
4171 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4177 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4178 tree arg2
, tree arg3 MEM_STAT_DECL
)
4180 bool constant
, read_only
, side_effects
;
4183 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4185 t
= make_node_stat (code PASS_MEM_STAT
);
4188 side_effects
= TREE_SIDE_EFFECTS (t
);
4195 TREE_SIDE_EFFECTS (t
) = side_effects
;
4196 TREE_THIS_VOLATILE (t
)
4197 = (TREE_CODE_CLASS (code
) == tcc_reference
4198 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4204 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4205 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4207 bool constant
, read_only
, side_effects
;
4210 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4212 t
= make_node_stat (code PASS_MEM_STAT
);
4215 side_effects
= TREE_SIDE_EFFECTS (t
);
4223 TREE_SIDE_EFFECTS (t
) = side_effects
;
4224 TREE_THIS_VOLATILE (t
)
4225 = (TREE_CODE_CLASS (code
) == tcc_reference
4226 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4231 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4232 on the pointer PTR. */
4235 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4237 HOST_WIDE_INT offset
= 0;
4238 tree ptype
= TREE_TYPE (ptr
);
4240 /* For convenience allow addresses that collapse to a simple base
4242 if (TREE_CODE (ptr
) == ADDR_EXPR
4243 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4244 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4246 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4248 ptr
= build_fold_addr_expr (ptr
);
4249 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4251 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4252 ptr
, build_int_cst (ptype
, offset
));
4253 SET_EXPR_LOCATION (tem
, loc
);
4257 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4260 mem_ref_offset (const_tree t
)
4262 tree toff
= TREE_OPERAND (t
, 1);
4263 return tree_to_double_int (toff
).sext (TYPE_PRECISION (TREE_TYPE (toff
)));
4266 /* Return the pointer-type relevant for TBAA purposes from the
4267 gimple memory reference tree T. This is the type to be used for
4268 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4271 reference_alias_ptr_type (const_tree t
)
4273 const_tree base
= t
;
4274 while (handled_component_p (base
))
4275 base
= TREE_OPERAND (base
, 0);
4276 if (TREE_CODE (base
) == MEM_REF
)
4277 return TREE_TYPE (TREE_OPERAND (base
, 1));
4278 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4279 return TREE_TYPE (TMR_OFFSET (base
));
4281 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4284 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4285 offsetted by OFFSET units. */
4288 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4290 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4291 build_fold_addr_expr (base
),
4292 build_int_cst (ptr_type_node
, offset
));
4293 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4294 recompute_tree_invariant_for_addr_expr (addr
);
4298 /* Similar except don't specify the TREE_TYPE
4299 and leave the TREE_SIDE_EFFECTS as 0.
4300 It is permissible for arguments to be null,
4301 or even garbage if their values do not matter. */
4304 build_nt (enum tree_code code
, ...)
4311 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4315 t
= make_node (code
);
4316 length
= TREE_CODE_LENGTH (code
);
4318 for (i
= 0; i
< length
; i
++)
4319 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4325 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4329 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4334 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4335 CALL_EXPR_FN (ret
) = fn
;
4336 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4337 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4338 CALL_EXPR_ARG (ret
, ix
) = t
;
4342 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4343 We do NOT enter this node in any sort of symbol table.
4345 LOC is the location of the decl.
4347 layout_decl is used to set up the decl's storage layout.
4348 Other slots are initialized to 0 or null pointers. */
4351 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4352 tree type MEM_STAT_DECL
)
4356 t
= make_node_stat (code PASS_MEM_STAT
);
4357 DECL_SOURCE_LOCATION (t
) = loc
;
4359 /* if (type == error_mark_node)
4360 type = integer_type_node; */
4361 /* That is not done, deliberately, so that having error_mark_node
4362 as the type can suppress useless errors in the use of this variable. */
4364 DECL_NAME (t
) = name
;
4365 TREE_TYPE (t
) = type
;
4367 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4373 /* Builds and returns function declaration with NAME and TYPE. */
4376 build_fn_decl (const char *name
, tree type
)
4378 tree id
= get_identifier (name
);
4379 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4381 DECL_EXTERNAL (decl
) = 1;
4382 TREE_PUBLIC (decl
) = 1;
4383 DECL_ARTIFICIAL (decl
) = 1;
4384 TREE_NOTHROW (decl
) = 1;
4389 vec
<tree
, va_gc
> *all_translation_units
;
4391 /* Builds a new translation-unit decl with name NAME, queues it in the
4392 global list of translation-unit decls and returns it. */
4395 build_translation_unit_decl (tree name
)
4397 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4399 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4400 vec_safe_push (all_translation_units
, tu
);
4405 /* BLOCK nodes are used to represent the structure of binding contours
4406 and declarations, once those contours have been exited and their contents
4407 compiled. This information is used for outputting debugging info. */
4410 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4412 tree block
= make_node (BLOCK
);
4414 BLOCK_VARS (block
) = vars
;
4415 BLOCK_SUBBLOCKS (block
) = subblocks
;
4416 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4417 BLOCK_CHAIN (block
) = chain
;
4422 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4424 LOC is the location to use in tree T. */
4427 protected_set_expr_location (tree t
, location_t loc
)
4429 if (t
&& CAN_HAVE_LOCATION_P (t
))
4430 SET_EXPR_LOCATION (t
, loc
);
4433 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4437 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4439 DECL_ATTRIBUTES (ddecl
) = attribute
;
4443 /* Borrowed from hashtab.c iterative_hash implementation. */
4444 #define mix(a,b,c) \
4446 a -= b; a -= c; a ^= (c>>13); \
4447 b -= c; b -= a; b ^= (a<< 8); \
4448 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4449 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4450 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4451 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4452 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4453 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4454 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4458 /* Produce good hash value combining VAL and VAL2. */
4460 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4462 /* the golden ratio; an arbitrary value. */
4463 hashval_t a
= 0x9e3779b9;
4469 /* Produce good hash value combining VAL and VAL2. */
4471 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4473 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4474 return iterative_hash_hashval_t (val
, val2
);
4477 hashval_t a
= (hashval_t
) val
;
4478 /* Avoid warnings about shifting of more than the width of the type on
4479 hosts that won't execute this path. */
4481 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4483 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4485 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4486 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4493 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4494 is ATTRIBUTE and its qualifiers are QUALS.
4496 Record such modified types already made so we don't make duplicates. */
4499 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4501 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4503 hashval_t hashcode
= 0;
4505 enum tree_code code
= TREE_CODE (ttype
);
4507 /* Building a distinct copy of a tagged type is inappropriate; it
4508 causes breakage in code that expects there to be a one-to-one
4509 relationship between a struct and its fields.
4510 build_duplicate_type is another solution (as used in
4511 handle_transparent_union_attribute), but that doesn't play well
4512 with the stronger C++ type identity model. */
4513 if (TREE_CODE (ttype
) == RECORD_TYPE
4514 || TREE_CODE (ttype
) == UNION_TYPE
4515 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4516 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4518 warning (OPT_Wattributes
,
4519 "ignoring attributes applied to %qT after definition",
4520 TYPE_MAIN_VARIANT (ttype
));
4521 return build_qualified_type (ttype
, quals
);
4524 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4525 ntype
= build_distinct_type_copy (ttype
);
4527 TYPE_ATTRIBUTES (ntype
) = attribute
;
4529 hashcode
= iterative_hash_object (code
, hashcode
);
4530 if (TREE_TYPE (ntype
))
4531 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4533 hashcode
= attribute_hash_list (attribute
, hashcode
);
4535 switch (TREE_CODE (ntype
))
4538 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4541 if (TYPE_DOMAIN (ntype
))
4542 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4546 hashcode
= iterative_hash_object
4547 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4548 hashcode
= iterative_hash_object
4549 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4552 case FIXED_POINT_TYPE
:
4554 unsigned int precision
= TYPE_PRECISION (ntype
);
4555 hashcode
= iterative_hash_object (precision
, hashcode
);
4562 ntype
= type_hash_canon (hashcode
, ntype
);
4564 /* If the target-dependent attributes make NTYPE different from
4565 its canonical type, we will need to use structural equality
4566 checks for this type. */
4567 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4568 || !comp_type_attributes (ntype
, ttype
))
4569 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4570 else if (TYPE_CANONICAL (ntype
) == ntype
)
4571 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4573 ttype
= build_qualified_type (ntype
, quals
);
4575 else if (TYPE_QUALS (ttype
) != quals
)
4576 ttype
= build_qualified_type (ttype
, quals
);
4581 /* Compare two attributes for their value identity. Return true if the
4582 attribute values are known to be equal; otherwise return false.
4586 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4588 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4591 if (TREE_VALUE (attr1
) != NULL_TREE
4592 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4593 && TREE_VALUE (attr2
) != NULL
4594 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4595 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4596 TREE_VALUE (attr2
)) == 1);
4598 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4601 /* Return 0 if the attributes for two types are incompatible, 1 if they
4602 are compatible, and 2 if they are nearly compatible (which causes a
4603 warning to be generated). */
4605 comp_type_attributes (const_tree type1
, const_tree type2
)
4607 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4608 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4613 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4615 const struct attribute_spec
*as
;
4618 as
= lookup_attribute_spec (get_attribute_name (a
));
4619 if (!as
|| as
->affects_type_identity
== false)
4622 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4623 if (!attr
|| !attribute_value_equal (a
, attr
))
4628 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4630 const struct attribute_spec
*as
;
4632 as
= lookup_attribute_spec (get_attribute_name (a
));
4633 if (!as
|| as
->affects_type_identity
== false)
4636 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4638 /* We don't need to compare trees again, as we did this
4639 already in first loop. */
4641 /* All types - affecting identity - are equal, so
4642 there is no need to call target hook for comparison. */
4646 /* As some type combinations - like default calling-convention - might
4647 be compatible, we have to call the target hook to get the final result. */
4648 return targetm
.comp_type_attributes (type1
, type2
);
4651 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4654 Record such modified types already made so we don't make duplicates. */
4657 build_type_attribute_variant (tree ttype
, tree attribute
)
4659 return build_type_attribute_qual_variant (ttype
, attribute
,
4660 TYPE_QUALS (ttype
));
4664 /* Reset the expression *EXPR_P, a size or position.
4666 ??? We could reset all non-constant sizes or positions. But it's cheap
4667 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4669 We need to reset self-referential sizes or positions because they cannot
4670 be gimplified and thus can contain a CALL_EXPR after the gimplification
4671 is finished, which will run afoul of LTO streaming. And they need to be
4672 reset to something essentially dummy but not constant, so as to preserve
4673 the properties of the object they are attached to. */
4676 free_lang_data_in_one_sizepos (tree
*expr_p
)
4678 tree expr
= *expr_p
;
4679 if (CONTAINS_PLACEHOLDER_P (expr
))
4680 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4684 /* Reset all the fields in a binfo node BINFO. We only keep
4685 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4688 free_lang_data_in_binfo (tree binfo
)
4693 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4695 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4696 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4697 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4698 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4700 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4701 free_lang_data_in_binfo (t
);
4705 /* Reset all language specific information still present in TYPE. */
4708 free_lang_data_in_type (tree type
)
4710 gcc_assert (TYPE_P (type
));
4712 /* Give the FE a chance to remove its own data first. */
4713 lang_hooks
.free_lang_data (type
);
4715 TREE_LANG_FLAG_0 (type
) = 0;
4716 TREE_LANG_FLAG_1 (type
) = 0;
4717 TREE_LANG_FLAG_2 (type
) = 0;
4718 TREE_LANG_FLAG_3 (type
) = 0;
4719 TREE_LANG_FLAG_4 (type
) = 0;
4720 TREE_LANG_FLAG_5 (type
) = 0;
4721 TREE_LANG_FLAG_6 (type
) = 0;
4723 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4725 /* Remove the const and volatile qualifiers from arguments. The
4726 C++ front end removes them, but the C front end does not,
4727 leading to false ODR violation errors when merging two
4728 instances of the same function signature compiled by
4729 different front ends. */
4732 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4734 tree arg_type
= TREE_VALUE (p
);
4736 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4738 int quals
= TYPE_QUALS (arg_type
)
4740 & ~TYPE_QUAL_VOLATILE
;
4741 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4742 free_lang_data_in_type (TREE_VALUE (p
));
4747 /* Remove members that are not actually FIELD_DECLs from the field
4748 list of an aggregate. These occur in C++. */
4749 if (RECORD_OR_UNION_TYPE_P (type
))
4753 /* Note that TYPE_FIELDS can be shared across distinct
4754 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4755 to be removed, we cannot set its TREE_CHAIN to NULL.
4756 Otherwise, we would not be able to find all the other fields
4757 in the other instances of this TREE_TYPE.
4759 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4761 member
= TYPE_FIELDS (type
);
4764 if (TREE_CODE (member
) == FIELD_DECL
4765 || TREE_CODE (member
) == TYPE_DECL
)
4768 TREE_CHAIN (prev
) = member
;
4770 TYPE_FIELDS (type
) = member
;
4774 member
= TREE_CHAIN (member
);
4778 TREE_CHAIN (prev
) = NULL_TREE
;
4780 TYPE_FIELDS (type
) = NULL_TREE
;
4782 TYPE_METHODS (type
) = NULL_TREE
;
4783 if (TYPE_BINFO (type
))
4784 free_lang_data_in_binfo (TYPE_BINFO (type
));
4788 /* For non-aggregate types, clear out the language slot (which
4789 overloads TYPE_BINFO). */
4790 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4792 if (INTEGRAL_TYPE_P (type
)
4793 || SCALAR_FLOAT_TYPE_P (type
)
4794 || FIXED_POINT_TYPE_P (type
))
4796 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4797 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4801 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4802 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4804 if (TYPE_CONTEXT (type
)
4805 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4807 tree ctx
= TYPE_CONTEXT (type
);
4810 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4812 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4813 TYPE_CONTEXT (type
) = ctx
;
4818 /* Return true if DECL may need an assembler name to be set. */
4821 need_assembler_name_p (tree decl
)
4823 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4824 if (TREE_CODE (decl
) != FUNCTION_DECL
4825 && TREE_CODE (decl
) != VAR_DECL
)
4828 /* If DECL already has its assembler name set, it does not need a
4830 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4831 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4834 /* Abstract decls do not need an assembler name. */
4835 if (DECL_ABSTRACT (decl
))
4838 /* For VAR_DECLs, only static, public and external symbols need an
4840 if (TREE_CODE (decl
) == VAR_DECL
4841 && !TREE_STATIC (decl
)
4842 && !TREE_PUBLIC (decl
)
4843 && !DECL_EXTERNAL (decl
))
4846 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4848 /* Do not set assembler name on builtins. Allow RTL expansion to
4849 decide whether to expand inline or via a regular call. */
4850 if (DECL_BUILT_IN (decl
)
4851 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4854 /* Functions represented in the callgraph need an assembler name. */
4855 if (cgraph_get_node (decl
) != NULL
)
4858 /* Unused and not public functions don't need an assembler name. */
4859 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4867 /* Reset all language specific information still present in symbol
4871 free_lang_data_in_decl (tree decl
)
4873 gcc_assert (DECL_P (decl
));
4875 /* Give the FE a chance to remove its own data first. */
4876 lang_hooks
.free_lang_data (decl
);
4878 TREE_LANG_FLAG_0 (decl
) = 0;
4879 TREE_LANG_FLAG_1 (decl
) = 0;
4880 TREE_LANG_FLAG_2 (decl
) = 0;
4881 TREE_LANG_FLAG_3 (decl
) = 0;
4882 TREE_LANG_FLAG_4 (decl
) = 0;
4883 TREE_LANG_FLAG_5 (decl
) = 0;
4884 TREE_LANG_FLAG_6 (decl
) = 0;
4886 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4887 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4888 if (TREE_CODE (decl
) == FIELD_DECL
)
4890 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4891 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4892 DECL_QUALIFIER (decl
) = NULL_TREE
;
4895 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4897 struct cgraph_node
*node
;
4898 if (!(node
= cgraph_get_node (decl
))
4899 || (!node
->symbol
.definition
&& !node
->clones
))
4902 cgraph_release_function_body (node
);
4905 release_function_body (decl
);
4906 DECL_ARGUMENTS (decl
) = NULL
;
4907 DECL_RESULT (decl
) = NULL
;
4908 DECL_INITIAL (decl
) = error_mark_node
;
4911 if (gimple_has_body_p (decl
))
4915 /* If DECL has a gimple body, then the context for its
4916 arguments must be DECL. Otherwise, it doesn't really
4917 matter, as we will not be emitting any code for DECL. In
4918 general, there may be other instances of DECL created by
4919 the front end and since PARM_DECLs are generally shared,
4920 their DECL_CONTEXT changes as the replicas of DECL are
4921 created. The only time where DECL_CONTEXT is important
4922 is for the FUNCTION_DECLs that have a gimple body (since
4923 the PARM_DECL will be used in the function's body). */
4924 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4925 DECL_CONTEXT (t
) = decl
;
4928 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4929 At this point, it is not needed anymore. */
4930 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4932 /* Clear the abstract origin if it refers to a method. Otherwise
4933 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4934 origin will not be output correctly. */
4935 if (DECL_ABSTRACT_ORIGIN (decl
)
4936 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4937 && RECORD_OR_UNION_TYPE_P
4938 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4939 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4941 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4942 DECL_VINDEX referring to itself into a vtable slot number as it
4943 should. Happens with functions that are copied and then forgotten
4944 about. Just clear it, it won't matter anymore. */
4945 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4946 DECL_VINDEX (decl
) = NULL_TREE
;
4948 else if (TREE_CODE (decl
) == VAR_DECL
)
4950 if ((DECL_EXTERNAL (decl
)
4951 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4952 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4953 DECL_INITIAL (decl
) = NULL_TREE
;
4955 else if (TREE_CODE (decl
) == TYPE_DECL
4956 || TREE_CODE (decl
) == FIELD_DECL
)
4957 DECL_INITIAL (decl
) = NULL_TREE
;
4958 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4959 && DECL_INITIAL (decl
)
4960 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4962 /* Strip builtins from the translation-unit BLOCK. We still have targets
4963 without builtin_decl_explicit support and also builtins are shared
4964 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4965 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4969 if (TREE_CODE (var
) == FUNCTION_DECL
4970 && DECL_BUILT_IN (var
))
4971 *nextp
= TREE_CHAIN (var
);
4973 nextp
= &TREE_CHAIN (var
);
4979 /* Data used when collecting DECLs and TYPEs for language data removal. */
4981 struct free_lang_data_d
4983 /* Worklist to avoid excessive recursion. */
4986 /* Set of traversed objects. Used to avoid duplicate visits. */
4987 struct pointer_set_t
*pset
;
4989 /* Array of symbols to process with free_lang_data_in_decl. */
4992 /* Array of types to process with free_lang_data_in_type. */
4997 /* Save all language fields needed to generate proper debug information
4998 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5001 save_debug_info_for_decl (tree t
)
5003 /*struct saved_debug_info_d *sdi;*/
5005 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5007 /* FIXME. Partial implementation for saving debug info removed. */
5011 /* Save all language fields needed to generate proper debug information
5012 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5015 save_debug_info_for_type (tree t
)
5017 /*struct saved_debug_info_d *sdi;*/
5019 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5021 /* FIXME. Partial implementation for saving debug info removed. */
5025 /* Add type or decl T to one of the list of tree nodes that need their
5026 language data removed. The lists are held inside FLD. */
5029 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5033 fld
->decls
.safe_push (t
);
5034 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5035 save_debug_info_for_decl (t
);
5037 else if (TYPE_P (t
))
5039 fld
->types
.safe_push (t
);
5040 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5041 save_debug_info_for_type (t
);
5047 /* Push tree node T into FLD->WORKLIST. */
5050 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5052 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5053 fld
->worklist
.safe_push ((t
));
5057 /* Operand callback helper for free_lang_data_in_node. *TP is the
5058 subtree operand being considered. */
5061 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5064 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5066 if (TREE_CODE (t
) == TREE_LIST
)
5069 /* Language specific nodes will be removed, so there is no need
5070 to gather anything under them. */
5071 if (is_lang_specific (t
))
5079 /* Note that walk_tree does not traverse every possible field in
5080 decls, so we have to do our own traversals here. */
5081 add_tree_to_fld_list (t
, fld
);
5083 fld_worklist_push (DECL_NAME (t
), fld
);
5084 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5085 fld_worklist_push (DECL_SIZE (t
), fld
);
5086 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5088 /* We are going to remove everything under DECL_INITIAL for
5089 TYPE_DECLs. No point walking them. */
5090 if (TREE_CODE (t
) != TYPE_DECL
)
5091 fld_worklist_push (DECL_INITIAL (t
), fld
);
5093 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5094 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5096 if (TREE_CODE (t
) == FUNCTION_DECL
)
5098 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5099 fld_worklist_push (DECL_RESULT (t
), fld
);
5101 else if (TREE_CODE (t
) == TYPE_DECL
)
5103 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5104 fld_worklist_push (DECL_VINDEX (t
), fld
);
5105 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5107 else if (TREE_CODE (t
) == FIELD_DECL
)
5109 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5110 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5111 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5112 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5114 else if (TREE_CODE (t
) == VAR_DECL
)
5116 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5117 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
5120 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5121 && DECL_HAS_VALUE_EXPR_P (t
))
5122 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5124 if (TREE_CODE (t
) != FIELD_DECL
5125 && TREE_CODE (t
) != TYPE_DECL
)
5126 fld_worklist_push (TREE_CHAIN (t
), fld
);
5129 else if (TYPE_P (t
))
5131 /* Note that walk_tree does not traverse every possible field in
5132 types, so we have to do our own traversals here. */
5133 add_tree_to_fld_list (t
, fld
);
5135 if (!RECORD_OR_UNION_TYPE_P (t
))
5136 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5137 fld_worklist_push (TYPE_SIZE (t
), fld
);
5138 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5139 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5140 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5141 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5142 fld_worklist_push (TYPE_NAME (t
), fld
);
5143 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5144 them and thus do not and want not to reach unused pointer types
5146 if (!POINTER_TYPE_P (t
))
5147 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5148 if (!RECORD_OR_UNION_TYPE_P (t
))
5149 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5150 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5151 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5152 do not and want not to reach unused variants this way. */
5153 if (TYPE_CONTEXT (t
))
5155 tree ctx
= TYPE_CONTEXT (t
);
5156 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5157 So push that instead. */
5158 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5159 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5160 fld_worklist_push (ctx
, fld
);
5162 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5163 and want not to reach unused types this way. */
5165 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5169 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5170 fld_worklist_push (TREE_TYPE (tem
), fld
);
5171 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5173 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5174 && TREE_CODE (tem
) == TREE_LIST
)
5177 fld_worklist_push (TREE_VALUE (tem
), fld
);
5178 tem
= TREE_CHAIN (tem
);
5182 if (RECORD_OR_UNION_TYPE_P (t
))
5185 /* Push all TYPE_FIELDS - there can be interleaving interesting
5186 and non-interesting things. */
5187 tem
= TYPE_FIELDS (t
);
5190 if (TREE_CODE (tem
) == FIELD_DECL
5191 || TREE_CODE (tem
) == TYPE_DECL
)
5192 fld_worklist_push (tem
, fld
);
5193 tem
= TREE_CHAIN (tem
);
5197 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5200 else if (TREE_CODE (t
) == BLOCK
)
5203 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5204 fld_worklist_push (tem
, fld
);
5205 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5206 fld_worklist_push (tem
, fld
);
5207 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5210 if (TREE_CODE (t
) != IDENTIFIER_NODE
5211 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5212 fld_worklist_push (TREE_TYPE (t
), fld
);
5218 /* Find decls and types in T. */
5221 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5225 if (!pointer_set_contains (fld
->pset
, t
))
5226 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5227 if (fld
->worklist
.is_empty ())
5229 t
= fld
->worklist
.pop ();
5233 /* Translate all the types in LIST with the corresponding runtime
5237 get_eh_types_for_runtime (tree list
)
5241 if (list
== NULL_TREE
)
5244 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5246 list
= TREE_CHAIN (list
);
5249 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5250 TREE_CHAIN (prev
) = n
;
5251 prev
= TREE_CHAIN (prev
);
5252 list
= TREE_CHAIN (list
);
5259 /* Find decls and types referenced in EH region R and store them in
5260 FLD->DECLS and FLD->TYPES. */
5263 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5274 /* The types referenced in each catch must first be changed to the
5275 EH types used at runtime. This removes references to FE types
5277 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5279 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5280 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5285 case ERT_ALLOWED_EXCEPTIONS
:
5286 r
->u
.allowed
.type_list
5287 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5288 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5291 case ERT_MUST_NOT_THROW
:
5292 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5293 find_decls_types_r
, fld
, fld
->pset
);
5299 /* Find decls and types referenced in cgraph node N and store them in
5300 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5301 look for *every* kind of DECL and TYPE node reachable from N,
5302 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5303 NAMESPACE_DECLs, etc). */
5306 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5309 struct function
*fn
;
5313 find_decls_types (n
->symbol
.decl
, fld
);
5315 if (!gimple_has_body_p (n
->symbol
.decl
))
5318 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5320 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5322 /* Traverse locals. */
5323 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5324 find_decls_types (t
, fld
);
5326 /* Traverse EH regions in FN. */
5329 FOR_ALL_EH_REGION_FN (r
, fn
)
5330 find_decls_types_in_eh_region (r
, fld
);
5333 /* Traverse every statement in FN. */
5334 FOR_EACH_BB_FN (bb
, fn
)
5336 gimple_stmt_iterator si
;
5339 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5341 gimple phi
= gsi_stmt (si
);
5343 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5345 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5346 find_decls_types (*arg_p
, fld
);
5350 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5352 gimple stmt
= gsi_stmt (si
);
5354 if (is_gimple_call (stmt
))
5355 find_decls_types (gimple_call_fntype (stmt
), fld
);
5357 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5359 tree arg
= gimple_op (stmt
, i
);
5360 find_decls_types (arg
, fld
);
5367 /* Find decls and types referenced in varpool node N and store them in
5368 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5369 look for *every* kind of DECL and TYPE node reachable from N,
5370 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5371 NAMESPACE_DECLs, etc). */
5374 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5376 find_decls_types (v
->symbol
.decl
, fld
);
5379 /* If T needs an assembler name, have one created for it. */
5382 assign_assembler_name_if_neeeded (tree t
)
5384 if (need_assembler_name_p (t
))
5386 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5387 diagnostics that use input_location to show locus
5388 information. The problem here is that, at this point,
5389 input_location is generally anchored to the end of the file
5390 (since the parser is long gone), so we don't have a good
5391 position to pin it to.
5393 To alleviate this problem, this uses the location of T's
5394 declaration. Examples of this are
5395 testsuite/g++.dg/template/cond2.C and
5396 testsuite/g++.dg/template/pr35240.C. */
5397 location_t saved_location
= input_location
;
5398 input_location
= DECL_SOURCE_LOCATION (t
);
5400 decl_assembler_name (t
);
5402 input_location
= saved_location
;
5407 /* Free language specific information for every operand and expression
5408 in every node of the call graph. This process operates in three stages:
5410 1- Every callgraph node and varpool node is traversed looking for
5411 decls and types embedded in them. This is a more exhaustive
5412 search than that done by find_referenced_vars, because it will
5413 also collect individual fields, decls embedded in types, etc.
5415 2- All the decls found are sent to free_lang_data_in_decl.
5417 3- All the types found are sent to free_lang_data_in_type.
5419 The ordering between decls and types is important because
5420 free_lang_data_in_decl sets assembler names, which includes
5421 mangling. So types cannot be freed up until assembler names have
5425 free_lang_data_in_cgraph (void)
5427 struct cgraph_node
*n
;
5428 struct varpool_node
*v
;
5429 struct free_lang_data_d fld
;
5434 /* Initialize sets and arrays to store referenced decls and types. */
5435 fld
.pset
= pointer_set_create ();
5436 fld
.worklist
.create (0);
5437 fld
.decls
.create (100);
5438 fld
.types
.create (100);
5440 /* Find decls and types in the body of every function in the callgraph. */
5441 FOR_EACH_FUNCTION (n
)
5442 find_decls_types_in_node (n
, &fld
);
5444 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5445 find_decls_types (p
->decl
, &fld
);
5447 /* Find decls and types in every varpool symbol. */
5448 FOR_EACH_VARIABLE (v
)
5449 find_decls_types_in_var (v
, &fld
);
5451 /* Set the assembler name on every decl found. We need to do this
5452 now because free_lang_data_in_decl will invalidate data needed
5453 for mangling. This breaks mangling on interdependent decls. */
5454 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5455 assign_assembler_name_if_neeeded (t
);
5457 /* Traverse every decl found freeing its language data. */
5458 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5459 free_lang_data_in_decl (t
);
5461 /* Traverse every type found freeing its language data. */
5462 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5463 free_lang_data_in_type (t
);
5465 pointer_set_destroy (fld
.pset
);
5466 fld
.worklist
.release ();
5467 fld
.decls
.release ();
5468 fld
.types
.release ();
5472 /* Free resources that are used by FE but are not needed once they are done. */
5475 free_lang_data (void)
5479 /* If we are the LTO frontend we have freed lang-specific data already. */
5481 || !flag_generate_lto
)
5484 /* Allocate and assign alias sets to the standard integer types
5485 while the slots are still in the way the frontends generated them. */
5486 for (i
= 0; i
< itk_none
; ++i
)
5487 if (integer_types
[i
])
5488 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5490 /* Traverse the IL resetting language specific information for
5491 operands, expressions, etc. */
5492 free_lang_data_in_cgraph ();
5494 /* Create gimple variants for common types. */
5495 ptrdiff_type_node
= integer_type_node
;
5496 fileptr_type_node
= ptr_type_node
;
5498 /* Reset some langhooks. Do not reset types_compatible_p, it may
5499 still be used indirectly via the get_alias_set langhook. */
5500 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5501 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5502 /* We do not want the default decl_assembler_name implementation,
5503 rather if we have fixed everything we want a wrapper around it
5504 asserting that all non-local symbols already got their assembler
5505 name and only produce assembler names for local symbols. Or rather
5506 make sure we never call decl_assembler_name on local symbols and
5507 devise a separate, middle-end private scheme for it. */
5509 /* Reset diagnostic machinery. */
5510 tree_diagnostics_defaults (global_dc
);
5518 const pass_data pass_data_ipa_free_lang_data
=
5520 SIMPLE_IPA_PASS
, /* type */
5521 "*free_lang_data", /* name */
5522 OPTGROUP_NONE
, /* optinfo_flags */
5523 false, /* has_gate */
5524 true, /* has_execute */
5525 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5526 0, /* properties_required */
5527 0, /* properties_provided */
5528 0, /* properties_destroyed */
5529 0, /* todo_flags_start */
5530 0, /* todo_flags_finish */
5533 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5536 pass_ipa_free_lang_data(gcc::context
*ctxt
)
5537 : simple_ipa_opt_pass(pass_data_ipa_free_lang_data
, ctxt
)
5540 /* opt_pass methods: */
5541 unsigned int execute () { return free_lang_data (); }
5543 }; // class pass_ipa_free_lang_data
5547 simple_ipa_opt_pass
*
5548 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5550 return new pass_ipa_free_lang_data (ctxt
);
5553 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5554 ATTR_NAME. Also used internally by remove_attribute(). */
5556 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5558 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5560 if (ident_len
== attr_len
)
5562 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5565 else if (ident_len
== attr_len
+ 4)
5567 /* There is the possibility that ATTR is 'text' and IDENT is
5569 const char *p
= IDENTIFIER_POINTER (ident
);
5570 if (p
[0] == '_' && p
[1] == '_'
5571 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5572 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5579 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5580 of ATTR_NAME, and LIST is not NULL_TREE. */
5582 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5586 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5588 if (ident_len
== attr_len
)
5590 if (!strcmp (attr_name
,
5591 IDENTIFIER_POINTER (get_attribute_name (list
))))
5594 /* TODO: If we made sure that attributes were stored in the
5595 canonical form without '__...__' (ie, as in 'text' as opposed
5596 to '__text__') then we could avoid the following case. */
5597 else if (ident_len
== attr_len
+ 4)
5599 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5600 if (p
[0] == '_' && p
[1] == '_'
5601 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5602 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5605 list
= TREE_CHAIN (list
);
5611 /* A variant of lookup_attribute() that can be used with an identifier
5612 as the first argument, and where the identifier can be either
5613 'text' or '__text__'.
5615 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5616 return a pointer to the attribute's list element if the attribute
5617 is part of the list, or NULL_TREE if not found. If the attribute
5618 appears more than once, this only returns the first occurrence; the
5619 TREE_CHAIN of the return value should be passed back in if further
5620 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5621 can be in the form 'text' or '__text__'. */
5623 lookup_ident_attribute (tree attr_identifier
, tree list
)
5625 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5629 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5630 == IDENTIFIER_NODE
);
5632 /* Identifiers can be compared directly for equality. */
5633 if (attr_identifier
== get_attribute_name (list
))
5636 /* If they are not equal, they may still be one in the form
5637 'text' while the other one is in the form '__text__'. TODO:
5638 If we were storing attributes in normalized 'text' form, then
5639 this could all go away and we could take full advantage of
5640 the fact that we're comparing identifiers. :-) */
5642 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5643 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5645 if (ident_len
== attr_len
+ 4)
5647 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5648 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5649 if (p
[0] == '_' && p
[1] == '_'
5650 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5651 && strncmp (q
, p
+ 2, attr_len
) == 0)
5654 else if (ident_len
+ 4 == attr_len
)
5656 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5657 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5658 if (q
[0] == '_' && q
[1] == '_'
5659 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5660 && strncmp (q
+ 2, p
, ident_len
) == 0)
5664 list
= TREE_CHAIN (list
);
5670 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5674 remove_attribute (const char *attr_name
, tree list
)
5677 size_t attr_len
= strlen (attr_name
);
5679 gcc_checking_assert (attr_name
[0] != '_');
5681 for (p
= &list
; *p
; )
5684 /* TODO: If we were storing attributes in normalized form, here
5685 we could use a simple strcmp(). */
5686 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5687 *p
= TREE_CHAIN (l
);
5689 p
= &TREE_CHAIN (l
);
5695 /* Return an attribute list that is the union of a1 and a2. */
5698 merge_attributes (tree a1
, tree a2
)
5702 /* Either one unset? Take the set one. */
5704 if ((attributes
= a1
) == 0)
5707 /* One that completely contains the other? Take it. */
5709 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5711 if (attribute_list_contained (a2
, a1
))
5715 /* Pick the longest list, and hang on the other list. */
5717 if (list_length (a1
) < list_length (a2
))
5718 attributes
= a2
, a2
= a1
;
5720 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5723 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5725 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5726 a
= lookup_ident_attribute (get_attribute_name (a2
),
5731 a1
= copy_node (a2
);
5732 TREE_CHAIN (a1
) = attributes
;
5741 /* Given types T1 and T2, merge their attributes and return
5745 merge_type_attributes (tree t1
, tree t2
)
5747 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5748 TYPE_ATTRIBUTES (t2
));
5751 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5755 merge_decl_attributes (tree olddecl
, tree newdecl
)
5757 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5758 DECL_ATTRIBUTES (newdecl
));
5761 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5763 /* Specialization of merge_decl_attributes for various Windows targets.
5765 This handles the following situation:
5767 __declspec (dllimport) int foo;
5770 The second instance of `foo' nullifies the dllimport. */
5773 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5776 int delete_dllimport_p
= 1;
5778 /* What we need to do here is remove from `old' dllimport if it doesn't
5779 appear in `new'. dllimport behaves like extern: if a declaration is
5780 marked dllimport and a definition appears later, then the object
5781 is not dllimport'd. We also remove a `new' dllimport if the old list
5782 contains dllexport: dllexport always overrides dllimport, regardless
5783 of the order of declaration. */
5784 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5785 delete_dllimport_p
= 0;
5786 else if (DECL_DLLIMPORT_P (new_tree
)
5787 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5789 DECL_DLLIMPORT_P (new_tree
) = 0;
5790 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5791 "dllimport ignored", new_tree
);
5793 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5795 /* Warn about overriding a symbol that has already been used, e.g.:
5796 extern int __attribute__ ((dllimport)) foo;
5797 int* bar () {return &foo;}
5800 if (TREE_USED (old
))
5802 warning (0, "%q+D redeclared without dllimport attribute "
5803 "after being referenced with dll linkage", new_tree
);
5804 /* If we have used a variable's address with dllimport linkage,
5805 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5806 decl may already have had TREE_CONSTANT computed.
5807 We still remove the attribute so that assembler code refers
5808 to '&foo rather than '_imp__foo'. */
5809 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5810 DECL_DLLIMPORT_P (new_tree
) = 1;
5813 /* Let an inline definition silently override the external reference,
5814 but otherwise warn about attribute inconsistency. */
5815 else if (TREE_CODE (new_tree
) == VAR_DECL
5816 || !DECL_DECLARED_INLINE_P (new_tree
))
5817 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5818 "previous dllimport ignored", new_tree
);
5821 delete_dllimport_p
= 0;
5823 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5825 if (delete_dllimport_p
)
5826 a
= remove_attribute ("dllimport", a
);
5831 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5832 struct attribute_spec.handler. */
5835 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5841 /* These attributes may apply to structure and union types being created,
5842 but otherwise should pass to the declaration involved. */
5845 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5846 | (int) ATTR_FLAG_ARRAY_NEXT
))
5848 *no_add_attrs
= true;
5849 return tree_cons (name
, args
, NULL_TREE
);
5851 if (TREE_CODE (node
) == RECORD_TYPE
5852 || TREE_CODE (node
) == UNION_TYPE
)
5854 node
= TYPE_NAME (node
);
5860 warning (OPT_Wattributes
, "%qE attribute ignored",
5862 *no_add_attrs
= true;
5867 if (TREE_CODE (node
) != FUNCTION_DECL
5868 && TREE_CODE (node
) != VAR_DECL
5869 && TREE_CODE (node
) != TYPE_DECL
)
5871 *no_add_attrs
= true;
5872 warning (OPT_Wattributes
, "%qE attribute ignored",
5877 if (TREE_CODE (node
) == TYPE_DECL
5878 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5879 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5881 *no_add_attrs
= true;
5882 warning (OPT_Wattributes
, "%qE attribute ignored",
5887 is_dllimport
= is_attribute_p ("dllimport", name
);
5889 /* Report error on dllimport ambiguities seen now before they cause
5893 /* Honor any target-specific overrides. */
5894 if (!targetm
.valid_dllimport_attribute_p (node
))
5895 *no_add_attrs
= true;
5897 else if (TREE_CODE (node
) == FUNCTION_DECL
5898 && DECL_DECLARED_INLINE_P (node
))
5900 warning (OPT_Wattributes
, "inline function %q+D declared as "
5901 " dllimport: attribute ignored", node
);
5902 *no_add_attrs
= true;
5904 /* Like MS, treat definition of dllimported variables and
5905 non-inlined functions on declaration as syntax errors. */
5906 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5908 error ("function %q+D definition is marked dllimport", node
);
5909 *no_add_attrs
= true;
5912 else if (TREE_CODE (node
) == VAR_DECL
)
5914 if (DECL_INITIAL (node
))
5916 error ("variable %q+D definition is marked dllimport",
5918 *no_add_attrs
= true;
5921 /* `extern' needn't be specified with dllimport.
5922 Specify `extern' now and hope for the best. Sigh. */
5923 DECL_EXTERNAL (node
) = 1;
5924 /* Also, implicitly give dllimport'd variables declared within
5925 a function global scope, unless declared static. */
5926 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5927 TREE_PUBLIC (node
) = 1;
5930 if (*no_add_attrs
== false)
5931 DECL_DLLIMPORT_P (node
) = 1;
5933 else if (TREE_CODE (node
) == FUNCTION_DECL
5934 && DECL_DECLARED_INLINE_P (node
)
5935 && flag_keep_inline_dllexport
)
5936 /* An exported function, even if inline, must be emitted. */
5937 DECL_EXTERNAL (node
) = 0;
5939 /* Report error if symbol is not accessible at global scope. */
5940 if (!TREE_PUBLIC (node
)
5941 && (TREE_CODE (node
) == VAR_DECL
5942 || TREE_CODE (node
) == FUNCTION_DECL
))
5944 error ("external linkage required for symbol %q+D because of "
5945 "%qE attribute", node
, name
);
5946 *no_add_attrs
= true;
5949 /* A dllexport'd entity must have default visibility so that other
5950 program units (shared libraries or the main executable) can see
5951 it. A dllimport'd entity must have default visibility so that
5952 the linker knows that undefined references within this program
5953 unit can be resolved by the dynamic linker. */
5956 if (DECL_VISIBILITY_SPECIFIED (node
)
5957 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5958 error ("%qE implies default visibility, but %qD has already "
5959 "been declared with a different visibility",
5961 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5962 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5968 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5970 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5971 of the various TYPE_QUAL values. */
5974 set_type_quals (tree type
, int type_quals
)
5976 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5977 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5978 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5979 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5982 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5985 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5987 return (TYPE_QUALS (cand
) == type_quals
5988 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5989 /* Apparently this is needed for Objective-C. */
5990 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5991 /* Check alignment. */
5992 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5993 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5994 TYPE_ATTRIBUTES (base
)));
5997 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6000 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6002 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6003 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6004 /* Apparently this is needed for Objective-C. */
6005 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6006 /* Check alignment. */
6007 && TYPE_ALIGN (cand
) == align
6008 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6009 TYPE_ATTRIBUTES (base
)));
6012 /* Return a version of the TYPE, qualified as indicated by the
6013 TYPE_QUALS, if one exists. If no qualified version exists yet,
6014 return NULL_TREE. */
6017 get_qualified_type (tree type
, int type_quals
)
6021 if (TYPE_QUALS (type
) == type_quals
)
6024 /* Search the chain of variants to see if there is already one there just
6025 like the one we need to have. If so, use that existing one. We must
6026 preserve the TYPE_NAME, since there is code that depends on this. */
6027 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6028 if (check_qualified_type (t
, type
, type_quals
))
6034 /* Like get_qualified_type, but creates the type if it does not
6035 exist. This function never returns NULL_TREE. */
6038 build_qualified_type (tree type
, int type_quals
)
6042 /* See if we already have the appropriate qualified variant. */
6043 t
= get_qualified_type (type
, type_quals
);
6045 /* If not, build it. */
6048 t
= build_variant_type_copy (type
);
6049 set_type_quals (t
, type_quals
);
6051 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6052 /* Propagate structural equality. */
6053 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6054 else if (TYPE_CANONICAL (type
) != type
)
6055 /* Build the underlying canonical type, since it is different
6057 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6060 /* T is its own canonical type. */
6061 TYPE_CANONICAL (t
) = t
;
6068 /* Create a variant of type T with alignment ALIGN. */
6071 build_aligned_type (tree type
, unsigned int align
)
6075 if (TYPE_PACKED (type
)
6076 || TYPE_ALIGN (type
) == align
)
6079 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6080 if (check_aligned_type (t
, type
, align
))
6083 t
= build_variant_type_copy (type
);
6084 TYPE_ALIGN (t
) = align
;
6089 /* Create a new distinct copy of TYPE. The new type is made its own
6090 MAIN_VARIANT. If TYPE requires structural equality checks, the
6091 resulting type requires structural equality checks; otherwise, its
6092 TYPE_CANONICAL points to itself. */
6095 build_distinct_type_copy (tree type
)
6097 tree t
= copy_node (type
);
6099 TYPE_POINTER_TO (t
) = 0;
6100 TYPE_REFERENCE_TO (t
) = 0;
6102 /* Set the canonical type either to a new equivalence class, or
6103 propagate the need for structural equality checks. */
6104 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6105 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6107 TYPE_CANONICAL (t
) = t
;
6109 /* Make it its own variant. */
6110 TYPE_MAIN_VARIANT (t
) = t
;
6111 TYPE_NEXT_VARIANT (t
) = 0;
6113 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6114 whose TREE_TYPE is not t. This can also happen in the Ada
6115 frontend when using subtypes. */
6120 /* Create a new variant of TYPE, equivalent but distinct. This is so
6121 the caller can modify it. TYPE_CANONICAL for the return type will
6122 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6123 are considered equal by the language itself (or that both types
6124 require structural equality checks). */
6127 build_variant_type_copy (tree type
)
6129 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6131 t
= build_distinct_type_copy (type
);
6133 /* Since we're building a variant, assume that it is a non-semantic
6134 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6135 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6137 /* Add the new type to the chain of variants of TYPE. */
6138 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6139 TYPE_NEXT_VARIANT (m
) = t
;
6140 TYPE_MAIN_VARIANT (t
) = m
;
6145 /* Return true if the from tree in both tree maps are equal. */
6148 tree_map_base_eq (const void *va
, const void *vb
)
6150 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6151 *const b
= (const struct tree_map_base
*) vb
;
6152 return (a
->from
== b
->from
);
6155 /* Hash a from tree in a tree_base_map. */
6158 tree_map_base_hash (const void *item
)
6160 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6163 /* Return true if this tree map structure is marked for garbage collection
6164 purposes. We simply return true if the from tree is marked, so that this
6165 structure goes away when the from tree goes away. */
6168 tree_map_base_marked_p (const void *p
)
6170 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6173 /* Hash a from tree in a tree_map. */
6176 tree_map_hash (const void *item
)
6178 return (((const struct tree_map
*) item
)->hash
);
6181 /* Hash a from tree in a tree_decl_map. */
6184 tree_decl_map_hash (const void *item
)
6186 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6189 /* Return the initialization priority for DECL. */
6192 decl_init_priority_lookup (tree decl
)
6194 struct tree_priority_map
*h
;
6195 struct tree_map_base in
;
6197 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6199 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6200 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6203 /* Return the finalization priority for DECL. */
6206 decl_fini_priority_lookup (tree decl
)
6208 struct tree_priority_map
*h
;
6209 struct tree_map_base in
;
6211 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6213 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6214 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6217 /* Return the initialization and finalization priority information for
6218 DECL. If there is no previous priority information, a freshly
6219 allocated structure is returned. */
6221 static struct tree_priority_map
*
6222 decl_priority_info (tree decl
)
6224 struct tree_priority_map in
;
6225 struct tree_priority_map
*h
;
6228 in
.base
.from
= decl
;
6229 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6230 h
= (struct tree_priority_map
*) *loc
;
6233 h
= ggc_alloc_cleared_tree_priority_map ();
6235 h
->base
.from
= decl
;
6236 h
->init
= DEFAULT_INIT_PRIORITY
;
6237 h
->fini
= DEFAULT_INIT_PRIORITY
;
6243 /* Set the initialization priority for DECL to PRIORITY. */
6246 decl_init_priority_insert (tree decl
, priority_type priority
)
6248 struct tree_priority_map
*h
;
6250 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6251 if (priority
== DEFAULT_INIT_PRIORITY
)
6253 h
= decl_priority_info (decl
);
6257 /* Set the finalization priority for DECL to PRIORITY. */
6260 decl_fini_priority_insert (tree decl
, priority_type priority
)
6262 struct tree_priority_map
*h
;
6264 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6265 if (priority
== DEFAULT_INIT_PRIORITY
)
6267 h
= decl_priority_info (decl
);
6271 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6274 print_debug_expr_statistics (void)
6276 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6277 (long) htab_size (debug_expr_for_decl
),
6278 (long) htab_elements (debug_expr_for_decl
),
6279 htab_collisions (debug_expr_for_decl
));
6282 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6285 print_value_expr_statistics (void)
6287 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6288 (long) htab_size (value_expr_for_decl
),
6289 (long) htab_elements (value_expr_for_decl
),
6290 htab_collisions (value_expr_for_decl
));
6293 /* Lookup a debug expression for FROM, and return it if we find one. */
6296 decl_debug_expr_lookup (tree from
)
6298 struct tree_decl_map
*h
, in
;
6299 in
.base
.from
= from
;
6301 h
= (struct tree_decl_map
*)
6302 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6308 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6311 decl_debug_expr_insert (tree from
, tree to
)
6313 struct tree_decl_map
*h
;
6316 h
= ggc_alloc_tree_decl_map ();
6317 h
->base
.from
= from
;
6319 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6321 *(struct tree_decl_map
**) loc
= h
;
6324 /* Lookup a value expression for FROM, and return it if we find one. */
6327 decl_value_expr_lookup (tree from
)
6329 struct tree_decl_map
*h
, in
;
6330 in
.base
.from
= from
;
6332 h
= (struct tree_decl_map
*)
6333 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6339 /* Insert a mapping FROM->TO in the value expression hashtable. */
6342 decl_value_expr_insert (tree from
, tree to
)
6344 struct tree_decl_map
*h
;
6347 h
= ggc_alloc_tree_decl_map ();
6348 h
->base
.from
= from
;
6350 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6352 *(struct tree_decl_map
**) loc
= h
;
6355 /* Lookup a vector of debug arguments for FROM, and return it if we
6359 decl_debug_args_lookup (tree from
)
6361 struct tree_vec_map
*h
, in
;
6363 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6365 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6366 in
.base
.from
= from
;
6367 h
= (struct tree_vec_map
*)
6368 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6374 /* Insert a mapping FROM->empty vector of debug arguments in the value
6375 expression hashtable. */
6378 decl_debug_args_insert (tree from
)
6380 struct tree_vec_map
*h
;
6383 if (DECL_HAS_DEBUG_ARGS_P (from
))
6384 return decl_debug_args_lookup (from
);
6385 if (debug_args_for_decl
== NULL
)
6386 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6387 tree_vec_map_eq
, 0);
6388 h
= ggc_alloc_tree_vec_map ();
6389 h
->base
.from
= from
;
6391 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6393 *(struct tree_vec_map
**) loc
= h
;
6394 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6398 /* Hashing of types so that we don't make duplicates.
6399 The entry point is `type_hash_canon'. */
6401 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6402 with types in the TREE_VALUE slots), by adding the hash codes
6403 of the individual types. */
6406 type_hash_list (const_tree list
, hashval_t hashcode
)
6410 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6411 if (TREE_VALUE (tail
) != error_mark_node
)
6412 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6418 /* These are the Hashtable callback functions. */
6420 /* Returns true iff the types are equivalent. */
6423 type_hash_eq (const void *va
, const void *vb
)
6425 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6426 *const b
= (const struct type_hash
*) vb
;
6428 /* First test the things that are the same for all types. */
6429 if (a
->hash
!= b
->hash
6430 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6431 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6432 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6433 TYPE_ATTRIBUTES (b
->type
))
6434 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6435 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6438 /* Be careful about comparing arrays before and after the element type
6439 has been completed; don't compare TYPE_ALIGN unless both types are
6441 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6442 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6443 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6446 switch (TREE_CODE (a
->type
))
6451 case REFERENCE_TYPE
:
6456 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6459 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6460 && !(TYPE_VALUES (a
->type
)
6461 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6462 && TYPE_VALUES (b
->type
)
6463 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6464 && type_list_equal (TYPE_VALUES (a
->type
),
6465 TYPE_VALUES (b
->type
))))
6468 /* ... fall through ... */
6473 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6474 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6475 TYPE_MAX_VALUE (b
->type
)))
6476 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6477 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6478 TYPE_MIN_VALUE (b
->type
))));
6480 case FIXED_POINT_TYPE
:
6481 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6484 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6487 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6488 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6489 || (TYPE_ARG_TYPES (a
->type
)
6490 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6491 && TYPE_ARG_TYPES (b
->type
)
6492 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6493 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6494 TYPE_ARG_TYPES (b
->type
)))))
6498 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6502 case QUAL_UNION_TYPE
:
6503 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6504 || (TYPE_FIELDS (a
->type
)
6505 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6506 && TYPE_FIELDS (b
->type
)
6507 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6508 && type_list_equal (TYPE_FIELDS (a
->type
),
6509 TYPE_FIELDS (b
->type
))));
6512 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6513 || (TYPE_ARG_TYPES (a
->type
)
6514 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6515 && TYPE_ARG_TYPES (b
->type
)
6516 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6517 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6518 TYPE_ARG_TYPES (b
->type
))))
6526 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6527 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6532 /* Return the cached hash value. */
6535 type_hash_hash (const void *item
)
6537 return ((const struct type_hash
*) item
)->hash
;
6540 /* Look in the type hash table for a type isomorphic to TYPE.
6541 If one is found, return it. Otherwise return 0. */
6544 type_hash_lookup (hashval_t hashcode
, tree type
)
6546 struct type_hash
*h
, in
;
6548 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6549 must call that routine before comparing TYPE_ALIGNs. */
6555 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6562 /* Add an entry to the type-hash-table
6563 for a type TYPE whose hash code is HASHCODE. */
6566 type_hash_add (hashval_t hashcode
, tree type
)
6568 struct type_hash
*h
;
6571 h
= ggc_alloc_type_hash ();
6574 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6578 /* Given TYPE, and HASHCODE its hash code, return the canonical
6579 object for an identical type if one already exists.
6580 Otherwise, return TYPE, and record it as the canonical object.
6582 To use this function, first create a type of the sort you want.
6583 Then compute its hash code from the fields of the type that
6584 make it different from other similar types.
6585 Then call this function and use the value. */
6588 type_hash_canon (unsigned int hashcode
, tree type
)
6592 /* The hash table only contains main variants, so ensure that's what we're
6594 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6596 /* See if the type is in the hash table already. If so, return it.
6597 Otherwise, add the type. */
6598 t1
= type_hash_lookup (hashcode
, type
);
6601 if (GATHER_STATISTICS
)
6603 tree_code_counts
[(int) TREE_CODE (type
)]--;
6604 tree_node_counts
[(int) t_kind
]--;
6605 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6611 type_hash_add (hashcode
, type
);
6616 /* See if the data pointed to by the type hash table is marked. We consider
6617 it marked if the type is marked or if a debug type number or symbol
6618 table entry has been made for the type. */
6621 type_hash_marked_p (const void *p
)
6623 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6625 return ggc_marked_p (type
);
6629 print_type_hash_statistics (void)
6631 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6632 (long) htab_size (type_hash_table
),
6633 (long) htab_elements (type_hash_table
),
6634 htab_collisions (type_hash_table
));
6637 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6638 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6639 by adding the hash codes of the individual attributes. */
6642 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6646 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6647 /* ??? Do we want to add in TREE_VALUE too? */
6648 hashcode
= iterative_hash_object
6649 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6653 /* Given two lists of attributes, return true if list l2 is
6654 equivalent to l1. */
6657 attribute_list_equal (const_tree l1
, const_tree l2
)
6662 return attribute_list_contained (l1
, l2
)
6663 && attribute_list_contained (l2
, l1
);
6666 /* Given two lists of attributes, return true if list L2 is
6667 completely contained within L1. */
6668 /* ??? This would be faster if attribute names were stored in a canonicalized
6669 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6670 must be used to show these elements are equivalent (which they are). */
6671 /* ??? It's not clear that attributes with arguments will always be handled
6675 attribute_list_contained (const_tree l1
, const_tree l2
)
6679 /* First check the obvious, maybe the lists are identical. */
6683 /* Maybe the lists are similar. */
6684 for (t1
= l1
, t2
= l2
;
6686 && get_attribute_name (t1
) == get_attribute_name (t2
)
6687 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6688 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6691 /* Maybe the lists are equal. */
6692 if (t1
== 0 && t2
== 0)
6695 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6698 /* This CONST_CAST is okay because lookup_attribute does not
6699 modify its argument and the return value is assigned to a
6701 for (attr
= lookup_ident_attribute (get_attribute_name (t2
), CONST_CAST_TREE(l1
));
6702 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6703 attr
= lookup_ident_attribute (get_attribute_name (t2
), TREE_CHAIN (attr
)))
6706 if (attr
== NULL_TREE
)
6713 /* Given two lists of types
6714 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6715 return 1 if the lists contain the same types in the same order.
6716 Also, the TREE_PURPOSEs must match. */
6719 type_list_equal (const_tree l1
, const_tree l2
)
6723 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6724 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6725 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6726 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6727 && (TREE_TYPE (TREE_PURPOSE (t1
))
6728 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6734 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6735 given by TYPE. If the argument list accepts variable arguments,
6736 then this function counts only the ordinary arguments. */
6739 type_num_arguments (const_tree type
)
6744 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6745 /* If the function does not take a variable number of arguments,
6746 the last element in the list will have type `void'. */
6747 if (VOID_TYPE_P (TREE_VALUE (t
)))
6755 /* Nonzero if integer constants T1 and T2
6756 represent the same constant value. */
6759 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6764 if (t1
== 0 || t2
== 0)
6767 if (TREE_CODE (t1
) == INTEGER_CST
6768 && TREE_CODE (t2
) == INTEGER_CST
6769 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6770 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6776 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6777 The precise way of comparison depends on their data type. */
6780 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6785 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6787 int t1_sgn
= tree_int_cst_sgn (t1
);
6788 int t2_sgn
= tree_int_cst_sgn (t2
);
6790 if (t1_sgn
< t2_sgn
)
6792 else if (t1_sgn
> t2_sgn
)
6794 /* Otherwise, both are non-negative, so we compare them as
6795 unsigned just in case one of them would overflow a signed
6798 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6799 return INT_CST_LT (t1
, t2
);
6801 return INT_CST_LT_UNSIGNED (t1
, t2
);
6804 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6807 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6809 if (tree_int_cst_lt (t1
, t2
))
6811 else if (tree_int_cst_lt (t2
, t1
))
6817 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6818 the host. If POS is zero, the value can be represented in a single
6819 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6820 be represented in a single unsigned HOST_WIDE_INT. */
6823 host_integerp (const_tree t
, int pos
)
6828 return (TREE_CODE (t
) == INTEGER_CST
6829 && ((TREE_INT_CST_HIGH (t
) == 0
6830 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6831 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6832 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6833 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6834 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6837 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6838 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6839 be non-negative. We must be able to satisfy the above conditions. */
6842 tree_low_cst (const_tree t
, int pos
)
6844 gcc_assert (host_integerp (t
, pos
));
6845 return TREE_INT_CST_LOW (t
);
6848 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6849 kind INTEGER_CST. This makes sure to properly sign-extend the
6853 size_low_cst (const_tree t
)
6855 double_int d
= tree_to_double_int (t
);
6856 return d
.sext (TYPE_PRECISION (TREE_TYPE (t
))).low
;
6859 /* Return the most significant (sign) bit of T. */
6862 tree_int_cst_sign_bit (const_tree t
)
6864 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6865 unsigned HOST_WIDE_INT w
;
6867 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6868 w
= TREE_INT_CST_LOW (t
);
6871 w
= TREE_INT_CST_HIGH (t
);
6872 bitno
-= HOST_BITS_PER_WIDE_INT
;
6875 return (w
>> bitno
) & 1;
6878 /* Return an indication of the sign of the integer constant T.
6879 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6880 Note that -1 will never be returned if T's type is unsigned. */
6883 tree_int_cst_sgn (const_tree t
)
6885 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6887 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6889 else if (TREE_INT_CST_HIGH (t
) < 0)
6895 /* Return the minimum number of bits needed to represent VALUE in a
6896 signed or unsigned type, UNSIGNEDP says which. */
6899 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6901 /* If the value is negative, compute its negative minus 1. The latter
6902 adjustment is because the absolute value of the largest negative value
6903 is one larger than the largest positive value. This is equivalent to
6904 a bit-wise negation, so use that operation instead. */
6906 if (tree_int_cst_sgn (value
) < 0)
6907 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6909 /* Return the number of bits needed, taking into account the fact
6910 that we need one more bit for a signed than unsigned type.
6911 If value is 0 or -1, the minimum precision is 1 no matter
6912 whether unsignedp is true or false. */
6914 if (integer_zerop (value
))
6917 return tree_floor_log2 (value
) + 1 + !unsignedp
;
6920 /* Compare two constructor-element-type constants. Return 1 if the lists
6921 are known to be equal; otherwise return 0. */
6924 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6926 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6928 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6931 l1
= TREE_CHAIN (l1
);
6932 l2
= TREE_CHAIN (l2
);
6938 /* Return truthvalue of whether T1 is the same tree structure as T2.
6939 Return 1 if they are the same.
6940 Return 0 if they are understandably different.
6941 Return -1 if either contains tree structure not understood by
6945 simple_cst_equal (const_tree t1
, const_tree t2
)
6947 enum tree_code code1
, code2
;
6953 if (t1
== 0 || t2
== 0)
6956 code1
= TREE_CODE (t1
);
6957 code2
= TREE_CODE (t2
);
6959 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6961 if (CONVERT_EXPR_CODE_P (code2
)
6962 || code2
== NON_LVALUE_EXPR
)
6963 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6965 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6968 else if (CONVERT_EXPR_CODE_P (code2
)
6969 || code2
== NON_LVALUE_EXPR
)
6970 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6978 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6979 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6982 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6985 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6988 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6989 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6990 TREE_STRING_LENGTH (t1
)));
6994 unsigned HOST_WIDE_INT idx
;
6995 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6996 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6998 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7001 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7002 /* ??? Should we handle also fields here? */
7003 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7009 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7012 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7015 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7018 const_tree arg1
, arg2
;
7019 const_call_expr_arg_iterator iter1
, iter2
;
7020 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7021 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7023 arg1
= next_const_call_expr_arg (&iter1
),
7024 arg2
= next_const_call_expr_arg (&iter2
))
7026 cmp
= simple_cst_equal (arg1
, arg2
);
7030 return arg1
== arg2
;
7034 /* Special case: if either target is an unallocated VAR_DECL,
7035 it means that it's going to be unified with whatever the
7036 TARGET_EXPR is really supposed to initialize, so treat it
7037 as being equivalent to anything. */
7038 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7039 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7040 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7041 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7042 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7043 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7046 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7051 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7053 case WITH_CLEANUP_EXPR
:
7054 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7058 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7061 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7062 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7076 /* This general rule works for most tree codes. All exceptions should be
7077 handled above. If this is a language-specific tree code, we can't
7078 trust what might be in the operand, so say we don't know
7080 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7083 switch (TREE_CODE_CLASS (code1
))
7087 case tcc_comparison
:
7088 case tcc_expression
:
7092 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7094 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7106 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7107 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7108 than U, respectively. */
7111 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7113 if (tree_int_cst_sgn (t
) < 0)
7115 else if (TREE_INT_CST_HIGH (t
) != 0)
7117 else if (TREE_INT_CST_LOW (t
) == u
)
7119 else if (TREE_INT_CST_LOW (t
) < u
)
7125 /* Return true if SIZE represents a constant size that is in bounds of
7126 what the middle-end and the backend accepts (covering not more than
7127 half of the address-space). */
7130 valid_constant_size_p (const_tree size
)
7132 if (! host_integerp (size
, 1)
7133 || TREE_OVERFLOW (size
)
7134 || tree_int_cst_sign_bit (size
) != 0)
7139 /* Return the precision of the type, or for a complex or vector type the
7140 precision of the type of its elements. */
7143 element_precision (const_tree type
)
7145 enum tree_code code
= TREE_CODE (type
);
7146 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7147 type
= TREE_TYPE (type
);
7149 return TYPE_PRECISION (type
);
7152 /* Return true if CODE represents an associative tree code. Otherwise
7155 associative_tree_code (enum tree_code code
)
7174 /* Return true if CODE represents a commutative tree code. Otherwise
7177 commutative_tree_code (enum tree_code code
)
7183 case MULT_HIGHPART_EXPR
:
7191 case UNORDERED_EXPR
:
7195 case TRUTH_AND_EXPR
:
7196 case TRUTH_XOR_EXPR
:
7198 case WIDEN_MULT_EXPR
:
7199 case VEC_WIDEN_MULT_HI_EXPR
:
7200 case VEC_WIDEN_MULT_LO_EXPR
:
7201 case VEC_WIDEN_MULT_EVEN_EXPR
:
7202 case VEC_WIDEN_MULT_ODD_EXPR
:
7211 /* Return true if CODE represents a ternary tree code for which the
7212 first two operands are commutative. Otherwise return false. */
7214 commutative_ternary_tree_code (enum tree_code code
)
7218 case WIDEN_MULT_PLUS_EXPR
:
7219 case WIDEN_MULT_MINUS_EXPR
:
7228 /* Generate a hash value for an expression. This can be used iteratively
7229 by passing a previous result as the VAL argument.
7231 This function is intended to produce the same hash for expressions which
7232 would compare equal using operand_equal_p. */
7235 iterative_hash_expr (const_tree t
, hashval_t val
)
7238 enum tree_code code
;
7242 return iterative_hash_hashval_t (0, val
);
7244 code
= TREE_CODE (t
);
7248 /* Alas, constants aren't shared, so we can't rely on pointer
7251 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
7252 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
7255 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7257 return iterative_hash_hashval_t (val2
, val
);
7261 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7263 return iterative_hash_hashval_t (val2
, val
);
7266 return iterative_hash (TREE_STRING_POINTER (t
),
7267 TREE_STRING_LENGTH (t
), val
);
7269 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7270 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7274 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7275 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7279 /* We can just compare by pointer. */
7280 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7281 case PLACEHOLDER_EXPR
:
7282 /* The node itself doesn't matter. */
7285 /* A list of expressions, for a CALL_EXPR or as the elements of a
7287 for (; t
; t
= TREE_CHAIN (t
))
7288 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7292 unsigned HOST_WIDE_INT idx
;
7294 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7296 val
= iterative_hash_expr (field
, val
);
7297 val
= iterative_hash_expr (value
, val
);
7303 /* The type of the second operand is relevant, except for
7304 its top-level qualifiers. */
7305 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7307 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7309 /* We could use the standard hash computation from this point
7311 val
= iterative_hash_object (code
, val
);
7312 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7313 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7317 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7318 Otherwise nodes that compare equal according to operand_equal_p might
7319 get different hash codes. However, don't do this for machine specific
7320 or front end builtins, since the function code is overloaded in those
7322 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7323 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7325 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7326 code
= TREE_CODE (t
);
7330 tclass
= TREE_CODE_CLASS (code
);
7332 if (tclass
== tcc_declaration
)
7334 /* DECL's have a unique ID */
7335 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7339 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7341 val
= iterative_hash_object (code
, val
);
7343 /* Don't hash the type, that can lead to having nodes which
7344 compare equal according to operand_equal_p, but which
7345 have different hash codes. */
7346 if (CONVERT_EXPR_CODE_P (code
)
7347 || code
== NON_LVALUE_EXPR
)
7349 /* Make sure to include signness in the hash computation. */
7350 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7351 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7354 else if (commutative_tree_code (code
))
7356 /* It's a commutative expression. We want to hash it the same
7357 however it appears. We do this by first hashing both operands
7358 and then rehashing based on the order of their independent
7360 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7361 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7365 t
= one
, one
= two
, two
= t
;
7367 val
= iterative_hash_hashval_t (one
, val
);
7368 val
= iterative_hash_hashval_t (two
, val
);
7371 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7372 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7378 /* Generate a hash value for a pair of expressions. This can be used
7379 iteratively by passing a previous result as the VAL argument.
7381 The same hash value is always returned for a given pair of expressions,
7382 regardless of the order in which they are presented. This is useful in
7383 hashing the operands of commutative functions. */
7386 iterative_hash_exprs_commutative (const_tree t1
,
7387 const_tree t2
, hashval_t val
)
7389 hashval_t one
= iterative_hash_expr (t1
, 0);
7390 hashval_t two
= iterative_hash_expr (t2
, 0);
7394 t
= one
, one
= two
, two
= t
;
7395 val
= iterative_hash_hashval_t (one
, val
);
7396 val
= iterative_hash_hashval_t (two
, val
);
7401 /* Constructors for pointer, array and function types.
7402 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7403 constructed by language-dependent code, not here.) */
7405 /* Construct, lay out and return the type of pointers to TO_TYPE with
7406 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7407 reference all of memory. If such a type has already been
7408 constructed, reuse it. */
7411 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7416 if (to_type
== error_mark_node
)
7417 return error_mark_node
;
7419 /* If the pointed-to type has the may_alias attribute set, force
7420 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7421 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7422 can_alias_all
= true;
7424 /* In some cases, languages will have things that aren't a POINTER_TYPE
7425 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7426 In that case, return that type without regard to the rest of our
7429 ??? This is a kludge, but consistent with the way this function has
7430 always operated and there doesn't seem to be a good way to avoid this
7432 if (TYPE_POINTER_TO (to_type
) != 0
7433 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7434 return TYPE_POINTER_TO (to_type
);
7436 /* First, if we already have a type for pointers to TO_TYPE and it's
7437 the proper mode, use it. */
7438 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7439 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7442 t
= make_node (POINTER_TYPE
);
7444 TREE_TYPE (t
) = to_type
;
7445 SET_TYPE_MODE (t
, mode
);
7446 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7447 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7448 TYPE_POINTER_TO (to_type
) = t
;
7450 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7451 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7452 else if (TYPE_CANONICAL (to_type
) != to_type
)
7454 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7455 mode
, can_alias_all
);
7457 /* Lay out the type. This function has many callers that are concerned
7458 with expression-construction, and this simplifies them all. */
7464 /* By default build pointers in ptr_mode. */
7467 build_pointer_type (tree to_type
)
7469 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7470 : TYPE_ADDR_SPACE (to_type
);
7471 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7472 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7475 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7478 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7483 if (to_type
== error_mark_node
)
7484 return error_mark_node
;
7486 /* If the pointed-to type has the may_alias attribute set, force
7487 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7488 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7489 can_alias_all
= true;
7491 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7492 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7493 In that case, return that type without regard to the rest of our
7496 ??? This is a kludge, but consistent with the way this function has
7497 always operated and there doesn't seem to be a good way to avoid this
7499 if (TYPE_REFERENCE_TO (to_type
) != 0
7500 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7501 return TYPE_REFERENCE_TO (to_type
);
7503 /* First, if we already have a type for pointers to TO_TYPE and it's
7504 the proper mode, use it. */
7505 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7506 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7509 t
= make_node (REFERENCE_TYPE
);
7511 TREE_TYPE (t
) = to_type
;
7512 SET_TYPE_MODE (t
, mode
);
7513 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7514 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7515 TYPE_REFERENCE_TO (to_type
) = t
;
7517 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7518 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7519 else if (TYPE_CANONICAL (to_type
) != to_type
)
7521 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7522 mode
, can_alias_all
);
7530 /* Build the node for the type of references-to-TO_TYPE by default
7534 build_reference_type (tree to_type
)
7536 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7537 : TYPE_ADDR_SPACE (to_type
);
7538 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7539 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7542 /* Build a type that is compatible with t but has no cv quals anywhere
7545 const char *const *const * -> char ***. */
7548 build_type_no_quals (tree t
)
7550 switch (TREE_CODE (t
))
7553 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7555 TYPE_REF_CAN_ALIAS_ALL (t
));
7556 case REFERENCE_TYPE
:
7558 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7560 TYPE_REF_CAN_ALIAS_ALL (t
));
7562 return TYPE_MAIN_VARIANT (t
);
7566 #define MAX_INT_CACHED_PREC \
7567 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7568 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7570 /* Builds a signed or unsigned integer type of precision PRECISION.
7571 Used for C bitfields whose precision does not match that of
7572 built-in target types. */
7574 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7580 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7582 if (precision
<= MAX_INT_CACHED_PREC
)
7584 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7589 itype
= make_node (INTEGER_TYPE
);
7590 TYPE_PRECISION (itype
) = precision
;
7593 fixup_unsigned_type (itype
);
7595 fixup_signed_type (itype
);
7598 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7599 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7600 if (precision
<= MAX_INT_CACHED_PREC
)
7601 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7606 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7607 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7608 is true, reuse such a type that has already been constructed. */
7611 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7613 tree itype
= make_node (INTEGER_TYPE
);
7614 hashval_t hashcode
= 0;
7616 TREE_TYPE (itype
) = type
;
7618 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7619 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7621 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7622 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7623 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7624 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7625 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7626 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7631 if ((TYPE_MIN_VALUE (itype
)
7632 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7633 || (TYPE_MAX_VALUE (itype
)
7634 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7636 /* Since we cannot reliably merge this type, we need to compare it using
7637 structural equality checks. */
7638 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7642 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7643 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7644 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7645 itype
= type_hash_canon (hashcode
, itype
);
7650 /* Wrapper around build_range_type_1 with SHARED set to true. */
7653 build_range_type (tree type
, tree lowval
, tree highval
)
7655 return build_range_type_1 (type
, lowval
, highval
, true);
7658 /* Wrapper around build_range_type_1 with SHARED set to false. */
7661 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7663 return build_range_type_1 (type
, lowval
, highval
, false);
7666 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7667 MAXVAL should be the maximum value in the domain
7668 (one less than the length of the array).
7670 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7671 We don't enforce this limit, that is up to caller (e.g. language front end).
7672 The limit exists because the result is a signed type and we don't handle
7673 sizes that use more than one HOST_WIDE_INT. */
7676 build_index_type (tree maxval
)
7678 return build_range_type (sizetype
, size_zero_node
, maxval
);
7681 /* Return true if the debug information for TYPE, a subtype, should be emitted
7682 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7683 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7684 debug info and doesn't reflect the source code. */
7687 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7689 tree base_type
= TREE_TYPE (type
), low
, high
;
7691 /* Subrange types have a base type which is an integral type. */
7692 if (!INTEGRAL_TYPE_P (base_type
))
7695 /* Get the real bounds of the subtype. */
7696 if (lang_hooks
.types
.get_subrange_bounds
)
7697 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7700 low
= TYPE_MIN_VALUE (type
);
7701 high
= TYPE_MAX_VALUE (type
);
7704 /* If the type and its base type have the same representation and the same
7705 name, then the type is not a subrange but a copy of the base type. */
7706 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7707 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7708 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7709 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7710 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7712 tree type_name
= TYPE_NAME (type
);
7713 tree base_type_name
= TYPE_NAME (base_type
);
7715 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7716 type_name
= DECL_NAME (type_name
);
7718 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7719 base_type_name
= DECL_NAME (base_type_name
);
7721 if (type_name
== base_type_name
)
7732 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7733 and number of elements specified by the range of values of INDEX_TYPE.
7734 If SHARED is true, reuse such a type that has already been constructed. */
7737 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7741 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7743 error ("arrays of functions are not meaningful");
7744 elt_type
= integer_type_node
;
7747 t
= make_node (ARRAY_TYPE
);
7748 TREE_TYPE (t
) = elt_type
;
7749 TYPE_DOMAIN (t
) = index_type
;
7750 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7753 /* If the element type is incomplete at this point we get marked for
7754 structural equality. Do not record these types in the canonical
7756 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7761 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7763 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7764 t
= type_hash_canon (hashcode
, t
);
7767 if (TYPE_CANONICAL (t
) == t
)
7769 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7770 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7771 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7772 else if (TYPE_CANONICAL (elt_type
) != elt_type
7773 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7775 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7777 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7784 /* Wrapper around build_array_type_1 with SHARED set to true. */
7787 build_array_type (tree elt_type
, tree index_type
)
7789 return build_array_type_1 (elt_type
, index_type
, true);
7792 /* Wrapper around build_array_type_1 with SHARED set to false. */
7795 build_nonshared_array_type (tree elt_type
, tree index_type
)
7797 return build_array_type_1 (elt_type
, index_type
, false);
7800 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7804 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7806 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7809 /* Recursively examines the array elements of TYPE, until a non-array
7810 element type is found. */
7813 strip_array_types (tree type
)
7815 while (TREE_CODE (type
) == ARRAY_TYPE
)
7816 type
= TREE_TYPE (type
);
7821 /* Computes the canonical argument types from the argument type list
7824 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7825 on entry to this function, or if any of the ARGTYPES are
7828 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7829 true on entry to this function, or if any of the ARGTYPES are
7832 Returns a canonical argument list, which may be ARGTYPES when the
7833 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7834 true) or would not differ from ARGTYPES. */
7837 maybe_canonicalize_argtypes(tree argtypes
,
7838 bool *any_structural_p
,
7839 bool *any_noncanonical_p
)
7842 bool any_noncanonical_argtypes_p
= false;
7844 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7846 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7847 /* Fail gracefully by stating that the type is structural. */
7848 *any_structural_p
= true;
7849 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7850 *any_structural_p
= true;
7851 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7852 || TREE_PURPOSE (arg
))
7853 /* If the argument has a default argument, we consider it
7854 non-canonical even though the type itself is canonical.
7855 That way, different variants of function and method types
7856 with default arguments will all point to the variant with
7857 no defaults as their canonical type. */
7858 any_noncanonical_argtypes_p
= true;
7861 if (*any_structural_p
)
7864 if (any_noncanonical_argtypes_p
)
7866 /* Build the canonical list of argument types. */
7867 tree canon_argtypes
= NULL_TREE
;
7868 bool is_void
= false;
7870 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7872 if (arg
== void_list_node
)
7875 canon_argtypes
= tree_cons (NULL_TREE
,
7876 TYPE_CANONICAL (TREE_VALUE (arg
)),
7880 canon_argtypes
= nreverse (canon_argtypes
);
7882 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7884 /* There is a non-canonical type. */
7885 *any_noncanonical_p
= true;
7886 return canon_argtypes
;
7889 /* The canonical argument types are the same as ARGTYPES. */
7893 /* Construct, lay out and return
7894 the type of functions returning type VALUE_TYPE
7895 given arguments of types ARG_TYPES.
7896 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7897 are data type nodes for the arguments of the function.
7898 If such a type has already been constructed, reuse it. */
7901 build_function_type (tree value_type
, tree arg_types
)
7904 hashval_t hashcode
= 0;
7905 bool any_structural_p
, any_noncanonical_p
;
7906 tree canon_argtypes
;
7908 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7910 error ("function return type cannot be function");
7911 value_type
= integer_type_node
;
7914 /* Make a node of the sort we want. */
7915 t
= make_node (FUNCTION_TYPE
);
7916 TREE_TYPE (t
) = value_type
;
7917 TYPE_ARG_TYPES (t
) = arg_types
;
7919 /* If we already have such a type, use the old one. */
7920 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7921 hashcode
= type_hash_list (arg_types
, hashcode
);
7922 t
= type_hash_canon (hashcode
, t
);
7924 /* Set up the canonical type. */
7925 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7926 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7927 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7929 &any_noncanonical_p
);
7930 if (any_structural_p
)
7931 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7932 else if (any_noncanonical_p
)
7933 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7936 if (!COMPLETE_TYPE_P (t
))
7941 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7942 return value if SKIP_RETURN is true. */
7945 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7948 tree new_type
= NULL
;
7949 tree args
, new_args
= NULL
, t
;
7953 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7954 args
= TREE_CHAIN (args
), i
++)
7955 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7956 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7958 new_reversed
= nreverse (new_args
);
7962 TREE_CHAIN (new_args
) = void_list_node
;
7964 new_reversed
= void_list_node
;
7967 /* Use copy_node to preserve as much as possible from original type
7968 (debug info, attribute lists etc.)
7969 Exception is METHOD_TYPEs must have THIS argument.
7970 When we are asked to remove it, we need to build new FUNCTION_TYPE
7972 if (TREE_CODE (orig_type
) != METHOD_TYPE
7974 || !bitmap_bit_p (args_to_skip
, 0))
7976 new_type
= build_distinct_type_copy (orig_type
);
7977 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7982 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7984 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7988 TREE_TYPE (new_type
) = void_type_node
;
7990 /* This is a new type, not a copy of an old type. Need to reassociate
7991 variants. We can handle everything except the main variant lazily. */
7992 t
= TYPE_MAIN_VARIANT (orig_type
);
7995 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7996 TYPE_MAIN_VARIANT (new_type
) = t
;
7997 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7998 TYPE_NEXT_VARIANT (t
) = new_type
;
8002 TYPE_MAIN_VARIANT (new_type
) = new_type
;
8003 TYPE_NEXT_VARIANT (new_type
) = NULL
;
8009 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
8010 return value if SKIP_RETURN is true.
8012 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
8013 linked by TREE_CHAIN directly. The caller is responsible for eliminating
8014 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
8017 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
8020 tree new_decl
= copy_node (orig_decl
);
8023 new_type
= TREE_TYPE (orig_decl
);
8024 if (prototype_p (new_type
)
8025 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
8027 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
8028 TREE_TYPE (new_decl
) = new_type
;
8030 /* For declarations setting DECL_VINDEX (i.e. methods)
8031 we expect first argument to be THIS pointer. */
8032 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
8033 DECL_VINDEX (new_decl
) = NULL_TREE
;
8035 /* When signature changes, we need to clear builtin info. */
8036 if (DECL_BUILT_IN (new_decl
)
8038 && !bitmap_empty_p (args_to_skip
))
8040 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
8041 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
8046 /* Build a function type. The RETURN_TYPE is the type returned by the
8047 function. If VAARGS is set, no void_type_node is appended to the
8048 the list. ARGP must be always be terminated be a NULL_TREE. */
8051 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8055 t
= va_arg (argp
, tree
);
8056 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8057 args
= tree_cons (NULL_TREE
, t
, args
);
8062 if (args
!= NULL_TREE
)
8063 args
= nreverse (args
);
8064 gcc_assert (last
!= void_list_node
);
8066 else if (args
== NULL_TREE
)
8067 args
= void_list_node
;
8071 args
= nreverse (args
);
8072 TREE_CHAIN (last
) = void_list_node
;
8074 args
= build_function_type (return_type
, args
);
8079 /* Build a function type. The RETURN_TYPE is the type returned by the
8080 function. If additional arguments are provided, they are
8081 additional argument types. The list of argument types must always
8082 be terminated by NULL_TREE. */
8085 build_function_type_list (tree return_type
, ...)
8090 va_start (p
, return_type
);
8091 args
= build_function_type_list_1 (false, return_type
, p
);
8096 /* Build a variable argument function type. The RETURN_TYPE is the
8097 type returned by the function. If additional arguments are provided,
8098 they are additional argument types. The list of argument types must
8099 always be terminated by NULL_TREE. */
8102 build_varargs_function_type_list (tree return_type
, ...)
8107 va_start (p
, return_type
);
8108 args
= build_function_type_list_1 (true, return_type
, p
);
8114 /* Build a function type. RETURN_TYPE is the type returned by the
8115 function; VAARGS indicates whether the function takes varargs. The
8116 function takes N named arguments, the types of which are provided in
8120 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8124 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8126 for (i
= n
- 1; i
>= 0; i
--)
8127 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8129 return build_function_type (return_type
, t
);
8132 /* Build a function type. RETURN_TYPE is the type returned by the
8133 function. The function takes N named arguments, the types of which
8134 are provided in ARG_TYPES. */
8137 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8139 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8142 /* Build a variable argument function type. RETURN_TYPE is the type
8143 returned by the function. The function takes N named arguments, the
8144 types of which are provided in ARG_TYPES. */
8147 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8149 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8152 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8153 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8154 for the method. An implicit additional parameter (of type
8155 pointer-to-BASETYPE) is added to the ARGTYPES. */
8158 build_method_type_directly (tree basetype
,
8165 bool any_structural_p
, any_noncanonical_p
;
8166 tree canon_argtypes
;
8168 /* Make a node of the sort we want. */
8169 t
= make_node (METHOD_TYPE
);
8171 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8172 TREE_TYPE (t
) = rettype
;
8173 ptype
= build_pointer_type (basetype
);
8175 /* The actual arglist for this function includes a "hidden" argument
8176 which is "this". Put it into the list of argument types. */
8177 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8178 TYPE_ARG_TYPES (t
) = argtypes
;
8180 /* If we already have such a type, use the old one. */
8181 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8182 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8183 hashcode
= type_hash_list (argtypes
, hashcode
);
8184 t
= type_hash_canon (hashcode
, t
);
8186 /* Set up the canonical type. */
8188 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8189 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8191 = (TYPE_CANONICAL (basetype
) != basetype
8192 || TYPE_CANONICAL (rettype
) != rettype
);
8193 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8195 &any_noncanonical_p
);
8196 if (any_structural_p
)
8197 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8198 else if (any_noncanonical_p
)
8200 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8201 TYPE_CANONICAL (rettype
),
8203 if (!COMPLETE_TYPE_P (t
))
8209 /* Construct, lay out and return the type of methods belonging to class
8210 BASETYPE and whose arguments and values are described by TYPE.
8211 If that type exists already, reuse it.
8212 TYPE must be a FUNCTION_TYPE node. */
8215 build_method_type (tree basetype
, tree type
)
8217 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8219 return build_method_type_directly (basetype
,
8221 TYPE_ARG_TYPES (type
));
8224 /* Construct, lay out and return the type of offsets to a value
8225 of type TYPE, within an object of type BASETYPE.
8226 If a suitable offset type exists already, reuse it. */
8229 build_offset_type (tree basetype
, tree type
)
8232 hashval_t hashcode
= 0;
8234 /* Make a node of the sort we want. */
8235 t
= make_node (OFFSET_TYPE
);
8237 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8238 TREE_TYPE (t
) = type
;
8240 /* If we already have such a type, use the old one. */
8241 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8242 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8243 t
= type_hash_canon (hashcode
, t
);
8245 if (!COMPLETE_TYPE_P (t
))
8248 if (TYPE_CANONICAL (t
) == t
)
8250 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8251 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8252 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8253 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8254 || TYPE_CANONICAL (type
) != type
)
8256 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8257 TYPE_CANONICAL (type
));
8263 /* Create a complex type whose components are COMPONENT_TYPE. */
8266 build_complex_type (tree component_type
)
8271 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8272 || SCALAR_FLOAT_TYPE_P (component_type
)
8273 || FIXED_POINT_TYPE_P (component_type
));
8275 /* Make a node of the sort we want. */
8276 t
= make_node (COMPLEX_TYPE
);
8278 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8280 /* If we already have such a type, use the old one. */
8281 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8282 t
= type_hash_canon (hashcode
, t
);
8284 if (!COMPLETE_TYPE_P (t
))
8287 if (TYPE_CANONICAL (t
) == t
)
8289 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8290 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8291 else if (TYPE_CANONICAL (component_type
) != component_type
)
8293 = build_complex_type (TYPE_CANONICAL (component_type
));
8296 /* We need to create a name, since complex is a fundamental type. */
8297 if (! TYPE_NAME (t
))
8300 if (component_type
== char_type_node
)
8301 name
= "complex char";
8302 else if (component_type
== signed_char_type_node
)
8303 name
= "complex signed char";
8304 else if (component_type
== unsigned_char_type_node
)
8305 name
= "complex unsigned char";
8306 else if (component_type
== short_integer_type_node
)
8307 name
= "complex short int";
8308 else if (component_type
== short_unsigned_type_node
)
8309 name
= "complex short unsigned int";
8310 else if (component_type
== integer_type_node
)
8311 name
= "complex int";
8312 else if (component_type
== unsigned_type_node
)
8313 name
= "complex unsigned int";
8314 else if (component_type
== long_integer_type_node
)
8315 name
= "complex long int";
8316 else if (component_type
== long_unsigned_type_node
)
8317 name
= "complex long unsigned int";
8318 else if (component_type
== long_long_integer_type_node
)
8319 name
= "complex long long int";
8320 else if (component_type
== long_long_unsigned_type_node
)
8321 name
= "complex long long unsigned int";
8326 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8327 get_identifier (name
), t
);
8330 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8333 /* If TYPE is a real or complex floating-point type and the target
8334 does not directly support arithmetic on TYPE then return the wider
8335 type to be used for arithmetic on TYPE. Otherwise, return
8339 excess_precision_type (tree type
)
8341 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8343 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8344 switch (TREE_CODE (type
))
8347 switch (flt_eval_method
)
8350 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8351 return double_type_node
;
8354 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8355 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8356 return long_double_type_node
;
8363 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8365 switch (flt_eval_method
)
8368 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8369 return complex_double_type_node
;
8372 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8373 || (TYPE_MODE (TREE_TYPE (type
))
8374 == TYPE_MODE (double_type_node
)))
8375 return complex_long_double_type_node
;
8388 /* Return OP, stripped of any conversions to wider types as much as is safe.
8389 Converting the value back to OP's type makes a value equivalent to OP.
8391 If FOR_TYPE is nonzero, we return a value which, if converted to
8392 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8394 OP must have integer, real or enumeral type. Pointers are not allowed!
8396 There are some cases where the obvious value we could return
8397 would regenerate to OP if converted to OP's type,
8398 but would not extend like OP to wider types.
8399 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8400 For example, if OP is (unsigned short)(signed char)-1,
8401 we avoid returning (signed char)-1 if FOR_TYPE is int,
8402 even though extending that to an unsigned short would regenerate OP,
8403 since the result of extending (signed char)-1 to (int)
8404 is different from (int) OP. */
8407 get_unwidened (tree op
, tree for_type
)
8409 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8410 tree type
= TREE_TYPE (op
);
8412 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8414 = (for_type
!= 0 && for_type
!= type
8415 && final_prec
> TYPE_PRECISION (type
)
8416 && TYPE_UNSIGNED (type
));
8419 while (CONVERT_EXPR_P (op
))
8423 /* TYPE_PRECISION on vector types has different meaning
8424 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8425 so avoid them here. */
8426 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8429 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8430 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8432 /* Truncations are many-one so cannot be removed.
8433 Unless we are later going to truncate down even farther. */
8435 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8438 /* See what's inside this conversion. If we decide to strip it,
8440 op
= TREE_OPERAND (op
, 0);
8442 /* If we have not stripped any zero-extensions (uns is 0),
8443 we can strip any kind of extension.
8444 If we have previously stripped a zero-extension,
8445 only zero-extensions can safely be stripped.
8446 Any extension can be stripped if the bits it would produce
8447 are all going to be discarded later by truncating to FOR_TYPE. */
8451 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8453 /* TYPE_UNSIGNED says whether this is a zero-extension.
8454 Let's avoid computing it if it does not affect WIN
8455 and if UNS will not be needed again. */
8457 || CONVERT_EXPR_P (op
))
8458 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8466 /* If we finally reach a constant see if it fits in for_type and
8467 in that case convert it. */
8469 && TREE_CODE (win
) == INTEGER_CST
8470 && TREE_TYPE (win
) != for_type
8471 && int_fits_type_p (win
, for_type
))
8472 win
= fold_convert (for_type
, win
);
8477 /* Return OP or a simpler expression for a narrower value
8478 which can be sign-extended or zero-extended to give back OP.
8479 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8480 or 0 if the value should be sign-extended. */
8483 get_narrower (tree op
, int *unsignedp_ptr
)
8488 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8490 while (TREE_CODE (op
) == NOP_EXPR
)
8493 = (TYPE_PRECISION (TREE_TYPE (op
))
8494 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8496 /* Truncations are many-one so cannot be removed. */
8500 /* See what's inside this conversion. If we decide to strip it,
8505 op
= TREE_OPERAND (op
, 0);
8506 /* An extension: the outermost one can be stripped,
8507 but remember whether it is zero or sign extension. */
8509 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8510 /* Otherwise, if a sign extension has been stripped,
8511 only sign extensions can now be stripped;
8512 if a zero extension has been stripped, only zero-extensions. */
8513 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8517 else /* bitschange == 0 */
8519 /* A change in nominal type can always be stripped, but we must
8520 preserve the unsignedness. */
8522 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8524 op
= TREE_OPERAND (op
, 0);
8525 /* Keep trying to narrow, but don't assign op to win if it
8526 would turn an integral type into something else. */
8527 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8534 if (TREE_CODE (op
) == COMPONENT_REF
8535 /* Since type_for_size always gives an integer type. */
8536 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8537 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8538 /* Ensure field is laid out already. */
8539 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8540 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8542 unsigned HOST_WIDE_INT innerprec
8543 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8544 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8545 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8546 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8548 /* We can get this structure field in a narrower type that fits it,
8549 but the resulting extension to its nominal type (a fullword type)
8550 must satisfy the same conditions as for other extensions.
8552 Do this only for fields that are aligned (not bit-fields),
8553 because when bit-field insns will be used there is no
8554 advantage in doing this. */
8556 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8557 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8558 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8562 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8563 win
= fold_convert (type
, op
);
8567 *unsignedp_ptr
= uns
;
8571 /* Returns true if integer constant C has a value that is permissible
8572 for type TYPE (an INTEGER_TYPE). */
8575 int_fits_type_p (const_tree c
, const_tree type
)
8577 tree type_low_bound
, type_high_bound
;
8578 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8581 dc
= tree_to_double_int (c
);
8582 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8585 type_low_bound
= TYPE_MIN_VALUE (type
);
8586 type_high_bound
= TYPE_MAX_VALUE (type
);
8588 /* If at least one bound of the type is a constant integer, we can check
8589 ourselves and maybe make a decision. If no such decision is possible, but
8590 this type is a subtype, try checking against that. Otherwise, use
8591 double_int_fits_to_tree_p, which checks against the precision.
8593 Compute the status for each possibly constant bound, and return if we see
8594 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8595 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8596 for "constant known to fit". */
8598 /* Check if c >= type_low_bound. */
8599 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8601 dd
= tree_to_double_int (type_low_bound
);
8602 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8604 int c_neg
= (!unsc
&& dc
.is_negative ());
8605 int t_neg
= (unsc
&& dd
.is_negative ());
8607 if (c_neg
&& !t_neg
)
8609 if ((c_neg
|| !t_neg
) && dc
.ult (dd
))
8612 else if (dc
.cmp (dd
, unsc
) < 0)
8614 ok_for_low_bound
= true;
8617 ok_for_low_bound
= false;
8619 /* Check if c <= type_high_bound. */
8620 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8622 dd
= tree_to_double_int (type_high_bound
);
8623 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8625 int c_neg
= (!unsc
&& dc
.is_negative ());
8626 int t_neg
= (unsc
&& dd
.is_negative ());
8628 if (t_neg
&& !c_neg
)
8630 if ((t_neg
|| !c_neg
) && dc
.ugt (dd
))
8633 else if (dc
.cmp (dd
, unsc
) > 0)
8635 ok_for_high_bound
= true;
8638 ok_for_high_bound
= false;
8640 /* If the constant fits both bounds, the result is known. */
8641 if (ok_for_low_bound
&& ok_for_high_bound
)
8644 /* Perform some generic filtering which may allow making a decision
8645 even if the bounds are not constant. First, negative integers
8646 never fit in unsigned types, */
8647 if (TYPE_UNSIGNED (type
) && !unsc
&& dc
.is_negative ())
8650 /* Second, narrower types always fit in wider ones. */
8651 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8654 /* Third, unsigned integers with top bit set never fit signed types. */
8655 if (! TYPE_UNSIGNED (type
) && unsc
)
8657 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8658 if (prec
< HOST_BITS_PER_WIDE_INT
)
8660 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8663 else if (((((unsigned HOST_WIDE_INT
) 1)
8664 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8668 /* If we haven't been able to decide at this point, there nothing more we
8669 can check ourselves here. Look at the base type if we have one and it
8670 has the same precision. */
8671 if (TREE_CODE (type
) == INTEGER_TYPE
8672 && TREE_TYPE (type
) != 0
8673 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8675 type
= TREE_TYPE (type
);
8679 /* Or to double_int_fits_to_tree_p, if nothing else. */
8680 return double_int_fits_to_tree_p (type
, dc
);
8683 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8684 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8685 represented (assuming two's-complement arithmetic) within the bit
8686 precision of the type are returned instead. */
8689 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8691 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8692 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8693 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8694 TYPE_UNSIGNED (type
));
8697 if (TYPE_UNSIGNED (type
))
8698 mpz_set_ui (min
, 0);
8702 mn
= double_int::mask (TYPE_PRECISION (type
) - 1);
8703 mn
= (mn
+ double_int_one
).sext (TYPE_PRECISION (type
));
8704 mpz_set_double_int (min
, mn
, false);
8708 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8709 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8710 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8711 TYPE_UNSIGNED (type
));
8714 if (TYPE_UNSIGNED (type
))
8715 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
)),
8718 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
) - 1),
8723 /* Return true if VAR is an automatic variable defined in function FN. */
8726 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8728 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8729 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8730 || TREE_CODE (var
) == PARM_DECL
)
8731 && ! TREE_STATIC (var
))
8732 || TREE_CODE (var
) == LABEL_DECL
8733 || TREE_CODE (var
) == RESULT_DECL
));
8736 /* Subprogram of following function. Called by walk_tree.
8738 Return *TP if it is an automatic variable or parameter of the
8739 function passed in as DATA. */
8742 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8744 tree fn
= (tree
) data
;
8749 else if (DECL_P (*tp
)
8750 && auto_var_in_fn_p (*tp
, fn
))
8756 /* Returns true if T is, contains, or refers to a type with variable
8757 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8758 arguments, but not the return type. If FN is nonzero, only return
8759 true if a modifier of the type or position of FN is a variable or
8760 parameter inside FN.
8762 This concept is more general than that of C99 'variably modified types':
8763 in C99, a struct type is never variably modified because a VLA may not
8764 appear as a structure member. However, in GNU C code like:
8766 struct S { int i[f()]; };
8768 is valid, and other languages may define similar constructs. */
8771 variably_modified_type_p (tree type
, tree fn
)
8775 /* Test if T is either variable (if FN is zero) or an expression containing
8776 a variable in FN. If TYPE isn't gimplified, return true also if
8777 gimplify_one_sizepos would gimplify the expression into a local
8779 #define RETURN_TRUE_IF_VAR(T) \
8780 do { tree _t = (T); \
8781 if (_t != NULL_TREE \
8782 && _t != error_mark_node \
8783 && TREE_CODE (_t) != INTEGER_CST \
8784 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8786 || (!TYPE_SIZES_GIMPLIFIED (type) \
8787 && !is_gimple_sizepos (_t)) \
8788 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8789 return true; } while (0)
8791 if (type
== error_mark_node
)
8794 /* If TYPE itself has variable size, it is variably modified. */
8795 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8796 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8798 switch (TREE_CODE (type
))
8801 case REFERENCE_TYPE
:
8803 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8809 /* If TYPE is a function type, it is variably modified if the
8810 return type is variably modified. */
8811 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8817 case FIXED_POINT_TYPE
:
8820 /* Scalar types are variably modified if their end points
8822 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8823 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8828 case QUAL_UNION_TYPE
:
8829 /* We can't see if any of the fields are variably-modified by the
8830 definition we normally use, since that would produce infinite
8831 recursion via pointers. */
8832 /* This is variably modified if some field's type is. */
8833 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8834 if (TREE_CODE (t
) == FIELD_DECL
)
8836 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8837 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8838 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8840 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8841 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8846 /* Do not call ourselves to avoid infinite recursion. This is
8847 variably modified if the element type is. */
8848 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8849 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8856 /* The current language may have other cases to check, but in general,
8857 all other types are not variably modified. */
8858 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8860 #undef RETURN_TRUE_IF_VAR
8863 /* Given a DECL or TYPE, return the scope in which it was declared, or
8864 NULL_TREE if there is no containing scope. */
8867 get_containing_scope (const_tree t
)
8869 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8872 /* Return the innermost context enclosing DECL that is
8873 a FUNCTION_DECL, or zero if none. */
8876 decl_function_context (const_tree decl
)
8880 if (TREE_CODE (decl
) == ERROR_MARK
)
8883 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8884 where we look up the function at runtime. Such functions always take
8885 a first argument of type 'pointer to real context'.
8887 C++ should really be fixed to use DECL_CONTEXT for the real context,
8888 and use something else for the "virtual context". */
8889 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8892 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8894 context
= DECL_CONTEXT (decl
);
8896 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8898 if (TREE_CODE (context
) == BLOCK
)
8899 context
= BLOCK_SUPERCONTEXT (context
);
8901 context
= get_containing_scope (context
);
8907 /* Return the innermost context enclosing DECL that is
8908 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8909 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8912 decl_type_context (const_tree decl
)
8914 tree context
= DECL_CONTEXT (decl
);
8917 switch (TREE_CODE (context
))
8919 case NAMESPACE_DECL
:
8920 case TRANSLATION_UNIT_DECL
:
8925 case QUAL_UNION_TYPE
:
8930 context
= DECL_CONTEXT (context
);
8934 context
= BLOCK_SUPERCONTEXT (context
);
8944 /* CALL is a CALL_EXPR. Return the declaration for the function
8945 called, or NULL_TREE if the called function cannot be
8949 get_callee_fndecl (const_tree call
)
8953 if (call
== error_mark_node
)
8954 return error_mark_node
;
8956 /* It's invalid to call this function with anything but a
8958 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8960 /* The first operand to the CALL is the address of the function
8962 addr
= CALL_EXPR_FN (call
);
8966 /* If this is a readonly function pointer, extract its initial value. */
8967 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8968 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8969 && DECL_INITIAL (addr
))
8970 addr
= DECL_INITIAL (addr
);
8972 /* If the address is just `&f' for some function `f', then we know
8973 that `f' is being called. */
8974 if (TREE_CODE (addr
) == ADDR_EXPR
8975 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8976 return TREE_OPERAND (addr
, 0);
8978 /* We couldn't figure out what was being called. */
8982 /* Print debugging information about tree nodes generated during the compile,
8983 and any language-specific information. */
8986 dump_tree_statistics (void)
8988 if (GATHER_STATISTICS
)
8991 int total_nodes
, total_bytes
;
8992 fprintf (stderr
, "Kind Nodes Bytes\n");
8993 fprintf (stderr
, "---------------------------------------\n");
8994 total_nodes
= total_bytes
= 0;
8995 for (i
= 0; i
< (int) all_kinds
; i
++)
8997 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8998 tree_node_counts
[i
], tree_node_sizes
[i
]);
8999 total_nodes
+= tree_node_counts
[i
];
9000 total_bytes
+= tree_node_sizes
[i
];
9002 fprintf (stderr
, "---------------------------------------\n");
9003 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9004 fprintf (stderr
, "---------------------------------------\n");
9005 fprintf (stderr
, "Code Nodes\n");
9006 fprintf (stderr
, "----------------------------\n");
9007 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9008 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
9009 fprintf (stderr
, "----------------------------\n");
9010 ssanames_print_statistics ();
9011 phinodes_print_statistics ();
9014 fprintf (stderr
, "(No per-node statistics)\n");
9016 print_type_hash_statistics ();
9017 print_debug_expr_statistics ();
9018 print_value_expr_statistics ();
9019 lang_hooks
.print_statistics ();
9022 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9024 /* Generate a crc32 of a byte. */
9027 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9031 for (ix
= bits
; ix
--; value
<<= 1)
9035 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9042 /* Generate a crc32 of a 32-bit unsigned. */
9045 crc32_unsigned (unsigned chksum
, unsigned value
)
9047 return crc32_unsigned_bits (chksum
, value
, 32);
9050 /* Generate a crc32 of a byte. */
9053 crc32_byte (unsigned chksum
, char byte
)
9055 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9058 /* Generate a crc32 of a string. */
9061 crc32_string (unsigned chksum
, const char *string
)
9065 chksum
= crc32_byte (chksum
, *string
);
9071 /* P is a string that will be used in a symbol. Mask out any characters
9072 that are not valid in that context. */
9075 clean_symbol_name (char *p
)
9079 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9082 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9089 /* Generate a name for a special-purpose function.
9090 The generated name may need to be unique across the whole link.
9091 Changes to this function may also require corresponding changes to
9092 xstrdup_mask_random.
9093 TYPE is some string to identify the purpose of this function to the
9094 linker or collect2; it must start with an uppercase letter,
9096 I - for constructors
9098 N - for C++ anonymous namespaces
9099 F - for DWARF unwind frame information. */
9102 get_file_function_name (const char *type
)
9108 /* If we already have a name we know to be unique, just use that. */
9109 if (first_global_object_name
)
9110 p
= q
= ASTRDUP (first_global_object_name
);
9111 /* If the target is handling the constructors/destructors, they
9112 will be local to this file and the name is only necessary for
9114 We also assign sub_I and sub_D sufixes to constructors called from
9115 the global static constructors. These are always local. */
9116 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9117 || (strncmp (type
, "sub_", 4) == 0
9118 && (type
[4] == 'I' || type
[4] == 'D')))
9120 const char *file
= main_input_filename
;
9122 file
= input_filename
;
9123 /* Just use the file's basename, because the full pathname
9124 might be quite long. */
9125 p
= q
= ASTRDUP (lbasename (file
));
9129 /* Otherwise, the name must be unique across the entire link.
9130 We don't have anything that we know to be unique to this translation
9131 unit, so use what we do have and throw in some randomness. */
9133 const char *name
= weak_global_object_name
;
9134 const char *file
= main_input_filename
;
9139 file
= input_filename
;
9141 len
= strlen (file
);
9142 q
= (char *) alloca (9 + 17 + len
+ 1);
9143 memcpy (q
, file
, len
+ 1);
9145 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9146 crc32_string (0, name
), get_random_seed (false));
9151 clean_symbol_name (q
);
9152 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9155 /* Set up the name of the file-level functions we may need.
9156 Use a global object (which is already required to be unique over
9157 the program) rather than the file name (which imposes extra
9159 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9161 return get_identifier (buf
);
9164 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9166 /* Complain that the tree code of NODE does not match the expected 0
9167 terminated list of trailing codes. The trailing code list can be
9168 empty, for a more vague error message. FILE, LINE, and FUNCTION
9169 are of the caller. */
9172 tree_check_failed (const_tree node
, const char *file
,
9173 int line
, const char *function
, ...)
9177 unsigned length
= 0;
9180 va_start (args
, function
);
9181 while ((code
= va_arg (args
, int)))
9182 length
+= 4 + strlen (tree_code_name
[code
]);
9187 va_start (args
, function
);
9188 length
+= strlen ("expected ");
9189 buffer
= tmp
= (char *) alloca (length
);
9191 while ((code
= va_arg (args
, int)))
9193 const char *prefix
= length
? " or " : "expected ";
9195 strcpy (tmp
+ length
, prefix
);
9196 length
+= strlen (prefix
);
9197 strcpy (tmp
+ length
, tree_code_name
[code
]);
9198 length
+= strlen (tree_code_name
[code
]);
9203 buffer
= "unexpected node";
9205 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9206 buffer
, tree_code_name
[TREE_CODE (node
)],
9207 function
, trim_filename (file
), line
);
9210 /* Complain that the tree code of NODE does match the expected 0
9211 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9215 tree_not_check_failed (const_tree node
, const char *file
,
9216 int line
, const char *function
, ...)
9220 unsigned length
= 0;
9223 va_start (args
, function
);
9224 while ((code
= va_arg (args
, int)))
9225 length
+= 4 + strlen (tree_code_name
[code
]);
9227 va_start (args
, function
);
9228 buffer
= (char *) alloca (length
);
9230 while ((code
= va_arg (args
, int)))
9234 strcpy (buffer
+ length
, " or ");
9237 strcpy (buffer
+ length
, tree_code_name
[code
]);
9238 length
+= strlen (tree_code_name
[code
]);
9242 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9243 buffer
, tree_code_name
[TREE_CODE (node
)],
9244 function
, trim_filename (file
), line
);
9247 /* Similar to tree_check_failed, except that we check for a class of tree
9248 code, given in CL. */
9251 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9252 const char *file
, int line
, const char *function
)
9255 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9256 TREE_CODE_CLASS_STRING (cl
),
9257 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9258 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9261 /* Similar to tree_check_failed, except that instead of specifying a
9262 dozen codes, use the knowledge that they're all sequential. */
9265 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9266 const char *function
, enum tree_code c1
,
9270 unsigned length
= 0;
9273 for (c
= c1
; c
<= c2
; ++c
)
9274 length
+= 4 + strlen (tree_code_name
[c
]);
9276 length
+= strlen ("expected ");
9277 buffer
= (char *) alloca (length
);
9280 for (c
= c1
; c
<= c2
; ++c
)
9282 const char *prefix
= length
? " or " : "expected ";
9284 strcpy (buffer
+ length
, prefix
);
9285 length
+= strlen (prefix
);
9286 strcpy (buffer
+ length
, tree_code_name
[c
]);
9287 length
+= strlen (tree_code_name
[c
]);
9290 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9291 buffer
, tree_code_name
[TREE_CODE (node
)],
9292 function
, trim_filename (file
), line
);
9296 /* Similar to tree_check_failed, except that we check that a tree does
9297 not have the specified code, given in CL. */
9300 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9301 const char *file
, int line
, const char *function
)
9304 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9305 TREE_CODE_CLASS_STRING (cl
),
9306 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9307 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9311 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9314 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9315 const char *function
, enum omp_clause_code code
)
9317 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9318 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9319 function
, trim_filename (file
), line
);
9323 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9326 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9327 const char *function
, enum omp_clause_code c1
,
9328 enum omp_clause_code c2
)
9331 unsigned length
= 0;
9334 for (c
= c1
; c
<= c2
; ++c
)
9335 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9337 length
+= strlen ("expected ");
9338 buffer
= (char *) alloca (length
);
9341 for (c
= c1
; c
<= c2
; ++c
)
9343 const char *prefix
= length
? " or " : "expected ";
9345 strcpy (buffer
+ length
, prefix
);
9346 length
+= strlen (prefix
);
9347 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9348 length
+= strlen (omp_clause_code_name
[c
]);
9351 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9352 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9353 function
, trim_filename (file
), line
);
9357 #undef DEFTREESTRUCT
9358 #define DEFTREESTRUCT(VAL, NAME) NAME,
9360 static const char *ts_enum_names
[] = {
9361 #include "treestruct.def"
9363 #undef DEFTREESTRUCT
9365 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9367 /* Similar to tree_class_check_failed, except that we check for
9368 whether CODE contains the tree structure identified by EN. */
9371 tree_contains_struct_check_failed (const_tree node
,
9372 const enum tree_node_structure_enum en
,
9373 const char *file
, int line
,
9374 const char *function
)
9377 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9379 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9383 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9384 (dynamically sized) vector. */
9387 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9388 const char *function
)
9391 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9392 idx
+ 1, len
, function
, trim_filename (file
), line
);
9395 /* Similar to above, except that the check is for the bounds of the operand
9396 vector of an expression node EXP. */
9399 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9400 int line
, const char *function
)
9402 int code
= TREE_CODE (exp
);
9404 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9405 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9406 function
, trim_filename (file
), line
);
9409 /* Similar to above, except that the check is for the number of
9410 operands of an OMP_CLAUSE node. */
9413 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9414 int line
, const char *function
)
9417 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9418 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9419 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9420 trim_filename (file
), line
);
9422 #endif /* ENABLE_TREE_CHECKING */
9424 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9425 and mapped to the machine mode MODE. Initialize its fields and build
9426 the information necessary for debugging output. */
9429 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9432 hashval_t hashcode
= 0;
9434 t
= make_node (VECTOR_TYPE
);
9435 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9436 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9437 SET_TYPE_MODE (t
, mode
);
9439 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9440 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9441 else if (TYPE_CANONICAL (innertype
) != innertype
9442 || mode
!= VOIDmode
)
9444 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9448 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9449 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9450 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9451 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9452 t
= type_hash_canon (hashcode
, t
);
9454 /* We have built a main variant, based on the main variant of the
9455 inner type. Use it to build the variant we return. */
9456 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9457 && TREE_TYPE (t
) != innertype
)
9458 return build_type_attribute_qual_variant (t
,
9459 TYPE_ATTRIBUTES (innertype
),
9460 TYPE_QUALS (innertype
));
9466 make_or_reuse_type (unsigned size
, int unsignedp
)
9468 if (size
== INT_TYPE_SIZE
)
9469 return unsignedp
? unsigned_type_node
: integer_type_node
;
9470 if (size
== CHAR_TYPE_SIZE
)
9471 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9472 if (size
== SHORT_TYPE_SIZE
)
9473 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9474 if (size
== LONG_TYPE_SIZE
)
9475 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9476 if (size
== LONG_LONG_TYPE_SIZE
)
9477 return (unsignedp
? long_long_unsigned_type_node
9478 : long_long_integer_type_node
);
9479 if (size
== 128 && int128_integer_type_node
)
9480 return (unsignedp
? int128_unsigned_type_node
9481 : int128_integer_type_node
);
9484 return make_unsigned_type (size
);
9486 return make_signed_type (size
);
9489 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9492 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9496 if (size
== SHORT_FRACT_TYPE_SIZE
)
9497 return unsignedp
? sat_unsigned_short_fract_type_node
9498 : sat_short_fract_type_node
;
9499 if (size
== FRACT_TYPE_SIZE
)
9500 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9501 if (size
== LONG_FRACT_TYPE_SIZE
)
9502 return unsignedp
? sat_unsigned_long_fract_type_node
9503 : sat_long_fract_type_node
;
9504 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9505 return unsignedp
? sat_unsigned_long_long_fract_type_node
9506 : sat_long_long_fract_type_node
;
9510 if (size
== SHORT_FRACT_TYPE_SIZE
)
9511 return unsignedp
? unsigned_short_fract_type_node
9512 : short_fract_type_node
;
9513 if (size
== FRACT_TYPE_SIZE
)
9514 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9515 if (size
== LONG_FRACT_TYPE_SIZE
)
9516 return unsignedp
? unsigned_long_fract_type_node
9517 : long_fract_type_node
;
9518 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9519 return unsignedp
? unsigned_long_long_fract_type_node
9520 : long_long_fract_type_node
;
9523 return make_fract_type (size
, unsignedp
, satp
);
9526 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9529 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9533 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9534 return unsignedp
? sat_unsigned_short_accum_type_node
9535 : sat_short_accum_type_node
;
9536 if (size
== ACCUM_TYPE_SIZE
)
9537 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9538 if (size
== LONG_ACCUM_TYPE_SIZE
)
9539 return unsignedp
? sat_unsigned_long_accum_type_node
9540 : sat_long_accum_type_node
;
9541 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9542 return unsignedp
? sat_unsigned_long_long_accum_type_node
9543 : sat_long_long_accum_type_node
;
9547 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9548 return unsignedp
? unsigned_short_accum_type_node
9549 : short_accum_type_node
;
9550 if (size
== ACCUM_TYPE_SIZE
)
9551 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9552 if (size
== LONG_ACCUM_TYPE_SIZE
)
9553 return unsignedp
? unsigned_long_accum_type_node
9554 : long_accum_type_node
;
9555 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9556 return unsignedp
? unsigned_long_long_accum_type_node
9557 : long_long_accum_type_node
;
9560 return make_accum_type (size
, unsignedp
, satp
);
9563 /* Create nodes for all integer types (and error_mark_node) using the sizes
9564 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9565 SHORT_DOUBLE specifies whether double should be of the same precision
9569 build_common_tree_nodes (bool signed_char
, bool short_double
)
9571 error_mark_node
= make_node (ERROR_MARK
);
9572 TREE_TYPE (error_mark_node
) = error_mark_node
;
9574 initialize_sizetypes ();
9576 /* Define both `signed char' and `unsigned char'. */
9577 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9578 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9579 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9580 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9582 /* Define `char', which is like either `signed char' or `unsigned char'
9583 but not the same as either. */
9586 ? make_signed_type (CHAR_TYPE_SIZE
)
9587 : make_unsigned_type (CHAR_TYPE_SIZE
));
9588 TYPE_STRING_FLAG (char_type_node
) = 1;
9590 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9591 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9592 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9593 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9594 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9595 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9596 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9597 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9598 #if HOST_BITS_PER_WIDE_INT >= 64
9599 /* TODO: This isn't correct, but as logic depends at the moment on
9600 host's instead of target's wide-integer.
9601 If there is a target not supporting TImode, but has an 128-bit
9602 integer-scalar register, this target check needs to be adjusted. */
9603 if (targetm
.scalar_mode_supported_p (TImode
))
9605 int128_integer_type_node
= make_signed_type (128);
9606 int128_unsigned_type_node
= make_unsigned_type (128);
9610 /* Define a boolean type. This type only represents boolean values but
9611 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9612 Front ends which want to override this size (i.e. Java) can redefine
9613 boolean_type_node before calling build_common_tree_nodes_2. */
9614 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9615 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9616 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9617 TYPE_PRECISION (boolean_type_node
) = 1;
9619 /* Define what type to use for size_t. */
9620 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9621 size_type_node
= unsigned_type_node
;
9622 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9623 size_type_node
= long_unsigned_type_node
;
9624 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9625 size_type_node
= long_long_unsigned_type_node
;
9626 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9627 size_type_node
= short_unsigned_type_node
;
9631 /* Fill in the rest of the sized types. Reuse existing type nodes
9633 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9634 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9635 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9636 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9637 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9639 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9640 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9641 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9642 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9643 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9645 access_public_node
= get_identifier ("public");
9646 access_protected_node
= get_identifier ("protected");
9647 access_private_node
= get_identifier ("private");
9649 /* Define these next since types below may used them. */
9650 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9651 integer_one_node
= build_int_cst (integer_type_node
, 1);
9652 integer_three_node
= build_int_cst (integer_type_node
, 3);
9653 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9655 size_zero_node
= size_int (0);
9656 size_one_node
= size_int (1);
9657 bitsize_zero_node
= bitsize_int (0);
9658 bitsize_one_node
= bitsize_int (1);
9659 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9661 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9662 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9664 void_type_node
= make_node (VOID_TYPE
);
9665 layout_type (void_type_node
);
9667 /* We are not going to have real types in C with less than byte alignment,
9668 so we might as well not have any types that claim to have it. */
9669 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9670 TYPE_USER_ALIGN (void_type_node
) = 0;
9672 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9673 layout_type (TREE_TYPE (null_pointer_node
));
9675 ptr_type_node
= build_pointer_type (void_type_node
);
9677 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9678 fileptr_type_node
= ptr_type_node
;
9680 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9682 float_type_node
= make_node (REAL_TYPE
);
9683 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9684 layout_type (float_type_node
);
9686 double_type_node
= make_node (REAL_TYPE
);
9688 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9690 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9691 layout_type (double_type_node
);
9693 long_double_type_node
= make_node (REAL_TYPE
);
9694 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9695 layout_type (long_double_type_node
);
9697 float_ptr_type_node
= build_pointer_type (float_type_node
);
9698 double_ptr_type_node
= build_pointer_type (double_type_node
);
9699 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9700 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9702 /* Fixed size integer types. */
9703 uint16_type_node
= build_nonstandard_integer_type (16, true);
9704 uint32_type_node
= build_nonstandard_integer_type (32, true);
9705 uint64_type_node
= build_nonstandard_integer_type (64, true);
9707 /* Decimal float types. */
9708 dfloat32_type_node
= make_node (REAL_TYPE
);
9709 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9710 layout_type (dfloat32_type_node
);
9711 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9712 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9714 dfloat64_type_node
= make_node (REAL_TYPE
);
9715 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9716 layout_type (dfloat64_type_node
);
9717 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9718 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9720 dfloat128_type_node
= make_node (REAL_TYPE
);
9721 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9722 layout_type (dfloat128_type_node
);
9723 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9724 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9726 complex_integer_type_node
= build_complex_type (integer_type_node
);
9727 complex_float_type_node
= build_complex_type (float_type_node
);
9728 complex_double_type_node
= build_complex_type (double_type_node
);
9729 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9731 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9732 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9733 sat_ ## KIND ## _type_node = \
9734 make_sat_signed_ ## KIND ## _type (SIZE); \
9735 sat_unsigned_ ## KIND ## _type_node = \
9736 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9737 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9738 unsigned_ ## KIND ## _type_node = \
9739 make_unsigned_ ## KIND ## _type (SIZE);
9741 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9742 sat_ ## WIDTH ## KIND ## _type_node = \
9743 make_sat_signed_ ## KIND ## _type (SIZE); \
9744 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9745 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9746 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9747 unsigned_ ## WIDTH ## KIND ## _type_node = \
9748 make_unsigned_ ## KIND ## _type (SIZE);
9750 /* Make fixed-point type nodes based on four different widths. */
9751 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9752 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9753 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9754 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9755 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9757 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9758 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9759 NAME ## _type_node = \
9760 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9761 u ## NAME ## _type_node = \
9762 make_or_reuse_unsigned_ ## KIND ## _type \
9763 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9764 sat_ ## NAME ## _type_node = \
9765 make_or_reuse_sat_signed_ ## KIND ## _type \
9766 (GET_MODE_BITSIZE (MODE ## mode)); \
9767 sat_u ## NAME ## _type_node = \
9768 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9769 (GET_MODE_BITSIZE (U ## MODE ## mode));
9771 /* Fixed-point type and mode nodes. */
9772 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9773 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9774 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9775 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9776 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9777 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9778 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9779 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9780 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9781 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9782 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9785 tree t
= targetm
.build_builtin_va_list ();
9787 /* Many back-ends define record types without setting TYPE_NAME.
9788 If we copied the record type here, we'd keep the original
9789 record type without a name. This breaks name mangling. So,
9790 don't copy record types and let c_common_nodes_and_builtins()
9791 declare the type to be __builtin_va_list. */
9792 if (TREE_CODE (t
) != RECORD_TYPE
)
9793 t
= build_variant_type_copy (t
);
9795 va_list_type_node
= t
;
9799 /* Modify DECL for given flags.
9800 TM_PURE attribute is set only on types, so the function will modify
9801 DECL's type when ECF_TM_PURE is used. */
9804 set_call_expr_flags (tree decl
, int flags
)
9806 if (flags
& ECF_NOTHROW
)
9807 TREE_NOTHROW (decl
) = 1;
9808 if (flags
& ECF_CONST
)
9809 TREE_READONLY (decl
) = 1;
9810 if (flags
& ECF_PURE
)
9811 DECL_PURE_P (decl
) = 1;
9812 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9813 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9814 if (flags
& ECF_NOVOPS
)
9815 DECL_IS_NOVOPS (decl
) = 1;
9816 if (flags
& ECF_NORETURN
)
9817 TREE_THIS_VOLATILE (decl
) = 1;
9818 if (flags
& ECF_MALLOC
)
9819 DECL_IS_MALLOC (decl
) = 1;
9820 if (flags
& ECF_RETURNS_TWICE
)
9821 DECL_IS_RETURNS_TWICE (decl
) = 1;
9822 if (flags
& ECF_LEAF
)
9823 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9824 NULL
, DECL_ATTRIBUTES (decl
));
9825 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9826 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9827 /* Looping const or pure is implied by noreturn.
9828 There is currently no way to declare looping const or looping pure alone. */
9829 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9830 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9834 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9837 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9838 const char *library_name
, int ecf_flags
)
9842 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9843 library_name
, NULL_TREE
);
9844 set_call_expr_flags (decl
, ecf_flags
);
9846 set_builtin_decl (code
, decl
, true);
9849 /* Call this function after instantiating all builtins that the language
9850 front end cares about. This will build the rest of the builtins that
9851 are relied upon by the tree optimizers and the middle-end. */
9854 build_common_builtin_nodes (void)
9859 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9861 ftype
= build_function_type (void_type_node
, void_list_node
);
9862 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9863 "__builtin_unreachable",
9864 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9865 | ECF_CONST
| ECF_LEAF
);
9868 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9869 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9871 ftype
= build_function_type_list (ptr_type_node
,
9872 ptr_type_node
, const_ptr_type_node
,
9873 size_type_node
, NULL_TREE
);
9875 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9876 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9877 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9878 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9879 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9880 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9883 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9885 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9886 const_ptr_type_node
, size_type_node
,
9888 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9889 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9892 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9894 ftype
= build_function_type_list (ptr_type_node
,
9895 ptr_type_node
, integer_type_node
,
9896 size_type_node
, NULL_TREE
);
9897 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9898 "memset", ECF_NOTHROW
| ECF_LEAF
);
9901 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9903 ftype
= build_function_type_list (ptr_type_node
,
9904 size_type_node
, NULL_TREE
);
9905 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9906 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9909 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9910 size_type_node
, NULL_TREE
);
9911 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9912 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9913 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9915 /* If we're checking the stack, `alloca' can throw. */
9916 if (flag_stack_check
)
9918 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9919 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9922 ftype
= build_function_type_list (void_type_node
,
9923 ptr_type_node
, ptr_type_node
,
9924 ptr_type_node
, NULL_TREE
);
9925 local_define_builtin ("__builtin_init_trampoline", ftype
,
9926 BUILT_IN_INIT_TRAMPOLINE
,
9927 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9928 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9929 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9930 "__builtin_init_heap_trampoline",
9931 ECF_NOTHROW
| ECF_LEAF
);
9933 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9934 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9935 BUILT_IN_ADJUST_TRAMPOLINE
,
9936 "__builtin_adjust_trampoline",
9937 ECF_CONST
| ECF_NOTHROW
);
9939 ftype
= build_function_type_list (void_type_node
,
9940 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9941 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9942 BUILT_IN_NONLOCAL_GOTO
,
9943 "__builtin_nonlocal_goto",
9944 ECF_NORETURN
| ECF_NOTHROW
);
9946 ftype
= build_function_type_list (void_type_node
,
9947 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9948 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9949 BUILT_IN_SETJMP_SETUP
,
9950 "__builtin_setjmp_setup", ECF_NOTHROW
);
9952 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9953 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9954 BUILT_IN_SETJMP_DISPATCHER
,
9955 "__builtin_setjmp_dispatcher",
9956 ECF_PURE
| ECF_NOTHROW
);
9958 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9959 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9960 BUILT_IN_SETJMP_RECEIVER
,
9961 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9963 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9964 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9965 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9967 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9968 local_define_builtin ("__builtin_stack_restore", ftype
,
9969 BUILT_IN_STACK_RESTORE
,
9970 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9972 /* If there's a possibility that we might use the ARM EABI, build the
9973 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9974 if (targetm
.arm_eabi_unwinder
)
9976 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9977 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9978 BUILT_IN_CXA_END_CLEANUP
,
9979 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9982 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9983 local_define_builtin ("__builtin_unwind_resume", ftype
,
9984 BUILT_IN_UNWIND_RESUME
,
9985 ((targetm_common
.except_unwind_info (&global_options
)
9987 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9990 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9992 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9994 local_define_builtin ("__builtin_return_address", ftype
,
9995 BUILT_IN_RETURN_ADDRESS
,
9996 "__builtin_return_address",
10000 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10001 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10003 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10004 ptr_type_node
, NULL_TREE
);
10005 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10006 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10007 BUILT_IN_PROFILE_FUNC_ENTER
,
10008 "__cyg_profile_func_enter", 0);
10009 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10010 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10011 BUILT_IN_PROFILE_FUNC_EXIT
,
10012 "__cyg_profile_func_exit", 0);
10015 /* The exception object and filter values from the runtime. The argument
10016 must be zero before exception lowering, i.e. from the front end. After
10017 exception lowering, it will be the region number for the exception
10018 landing pad. These functions are PURE instead of CONST to prevent
10019 them from being hoisted past the exception edge that will initialize
10020 its value in the landing pad. */
10021 ftype
= build_function_type_list (ptr_type_node
,
10022 integer_type_node
, NULL_TREE
);
10023 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10024 /* Only use TM_PURE if we we have TM language support. */
10025 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10026 ecf_flags
|= ECF_TM_PURE
;
10027 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10028 "__builtin_eh_pointer", ecf_flags
);
10030 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10031 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10032 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10033 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10035 ftype
= build_function_type_list (void_type_node
,
10036 integer_type_node
, integer_type_node
,
10038 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10039 BUILT_IN_EH_COPY_VALUES
,
10040 "__builtin_eh_copy_values", ECF_NOTHROW
);
10042 /* Complex multiplication and division. These are handled as builtins
10043 rather than optabs because emit_library_call_value doesn't support
10044 complex. Further, we can do slightly better with folding these
10045 beasties if the real and complex parts of the arguments are separate. */
10049 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10051 char mode_name_buf
[4], *q
;
10053 enum built_in_function mcode
, dcode
;
10054 tree type
, inner_type
;
10055 const char *prefix
= "__";
10057 if (targetm
.libfunc_gnu_prefix
)
10060 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10063 inner_type
= TREE_TYPE (type
);
10065 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10066 inner_type
, inner_type
, NULL_TREE
);
10068 mcode
= ((enum built_in_function
)
10069 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10070 dcode
= ((enum built_in_function
)
10071 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10073 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10077 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10079 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10080 built_in_names
[mcode
],
10081 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10083 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10085 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10086 built_in_names
[dcode
],
10087 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10092 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10095 If we requested a pointer to a vector, build up the pointers that
10096 we stripped off while looking for the inner type. Similarly for
10097 return values from functions.
10099 The argument TYPE is the top of the chain, and BOTTOM is the
10100 new type which we will point to. */
10103 reconstruct_complex_type (tree type
, tree bottom
)
10107 if (TREE_CODE (type
) == POINTER_TYPE
)
10109 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10110 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10111 TYPE_REF_CAN_ALIAS_ALL (type
));
10113 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10115 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10116 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10117 TYPE_REF_CAN_ALIAS_ALL (type
));
10119 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10121 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10122 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10124 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10126 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10127 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10129 else if (TREE_CODE (type
) == METHOD_TYPE
)
10131 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10132 /* The build_method_type_directly() routine prepends 'this' to argument list,
10133 so we must compensate by getting rid of it. */
10135 = build_method_type_directly
10136 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10138 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10140 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10142 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10143 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10148 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10149 TYPE_QUALS (type
));
10152 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10155 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10159 switch (GET_MODE_CLASS (mode
))
10161 case MODE_VECTOR_INT
:
10162 case MODE_VECTOR_FLOAT
:
10163 case MODE_VECTOR_FRACT
:
10164 case MODE_VECTOR_UFRACT
:
10165 case MODE_VECTOR_ACCUM
:
10166 case MODE_VECTOR_UACCUM
:
10167 nunits
= GET_MODE_NUNITS (mode
);
10171 /* Check that there are no leftover bits. */
10172 gcc_assert (GET_MODE_BITSIZE (mode
)
10173 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10175 nunits
= GET_MODE_BITSIZE (mode
)
10176 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10180 gcc_unreachable ();
10183 return make_vector_type (innertype
, nunits
, mode
);
10186 /* Similarly, but takes the inner type and number of units, which must be
10190 build_vector_type (tree innertype
, int nunits
)
10192 return make_vector_type (innertype
, nunits
, VOIDmode
);
10195 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10198 build_opaque_vector_type (tree innertype
, int nunits
)
10200 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10202 /* We always build the non-opaque variant before the opaque one,
10203 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10204 cand
= TYPE_NEXT_VARIANT (t
);
10206 && TYPE_VECTOR_OPAQUE (cand
)
10207 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10209 /* Othewise build a variant type and make sure to queue it after
10210 the non-opaque type. */
10211 cand
= build_distinct_type_copy (t
);
10212 TYPE_VECTOR_OPAQUE (cand
) = true;
10213 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10214 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10215 TYPE_NEXT_VARIANT (t
) = cand
;
10216 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10221 /* Given an initializer INIT, return TRUE if INIT is zero or some
10222 aggregate of zeros. Otherwise return FALSE. */
10224 initializer_zerop (const_tree init
)
10230 switch (TREE_CODE (init
))
10233 return integer_zerop (init
);
10236 /* ??? Note that this is not correct for C4X float formats. There,
10237 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10238 negative exponent. */
10239 return real_zerop (init
)
10240 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10243 return fixed_zerop (init
);
10246 return integer_zerop (init
)
10247 || (real_zerop (init
)
10248 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10249 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10254 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10255 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10262 unsigned HOST_WIDE_INT idx
;
10264 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10265 if (!initializer_zerop (elt
))
10274 /* We need to loop through all elements to handle cases like
10275 "\0" and "\0foobar". */
10276 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10277 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10288 /* Check if vector VEC consists of all the equal elements and
10289 that the number of elements corresponds to the type of VEC.
10290 The function returns first element of the vector
10291 or NULL_TREE if the vector is not uniform. */
10293 uniform_vector_p (const_tree vec
)
10298 if (vec
== NULL_TREE
)
10301 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10303 if (TREE_CODE (vec
) == VECTOR_CST
)
10305 first
= VECTOR_CST_ELT (vec
, 0);
10306 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10307 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10313 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10315 first
= error_mark_node
;
10317 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10324 if (!operand_equal_p (first
, t
, 0))
10327 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10336 /* Build an empty statement at location LOC. */
10339 build_empty_stmt (location_t loc
)
10341 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10342 SET_EXPR_LOCATION (t
, loc
);
10347 /* Build an OpenMP clause with code CODE. LOC is the location of the
10351 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10356 length
= omp_clause_num_ops
[code
];
10357 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10359 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10361 t
= ggc_alloc_tree_node (size
);
10362 memset (t
, 0, size
);
10363 TREE_SET_CODE (t
, OMP_CLAUSE
);
10364 OMP_CLAUSE_SET_CODE (t
, code
);
10365 OMP_CLAUSE_LOCATION (t
) = loc
;
10370 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10371 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10372 Except for the CODE and operand count field, other storage for the
10373 object is initialized to zeros. */
10376 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10379 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10381 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10382 gcc_assert (len
>= 1);
10384 record_node_allocation_statistics (code
, length
);
10386 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10388 TREE_SET_CODE (t
, code
);
10390 /* Can't use TREE_OPERAND to store the length because if checking is
10391 enabled, it will try to check the length before we store it. :-P */
10392 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10397 /* Helper function for build_call_* functions; build a CALL_EXPR with
10398 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10399 the argument slots. */
10402 build_call_1 (tree return_type
, tree fn
, int nargs
)
10406 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10407 TREE_TYPE (t
) = return_type
;
10408 CALL_EXPR_FN (t
) = fn
;
10409 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10414 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10415 FN and a null static chain slot. NARGS is the number of call arguments
10416 which are specified as "..." arguments. */
10419 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10423 va_start (args
, nargs
);
10424 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10429 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10430 FN and a null static chain slot. NARGS is the number of call arguments
10431 which are specified as a va_list ARGS. */
10434 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10439 t
= build_call_1 (return_type
, fn
, nargs
);
10440 for (i
= 0; i
< nargs
; i
++)
10441 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10442 process_call_operands (t
);
10446 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10447 FN and a null static chain slot. NARGS is the number of call arguments
10448 which are specified as a tree array ARGS. */
10451 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10452 int nargs
, const tree
*args
)
10457 t
= build_call_1 (return_type
, fn
, nargs
);
10458 for (i
= 0; i
< nargs
; i
++)
10459 CALL_EXPR_ARG (t
, i
) = args
[i
];
10460 process_call_operands (t
);
10461 SET_EXPR_LOCATION (t
, loc
);
10465 /* Like build_call_array, but takes a vec. */
10468 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10473 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10474 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10475 CALL_EXPR_ARG (ret
, ix
) = t
;
10476 process_call_operands (ret
);
10481 /* Returns true if it is possible to prove that the index of
10482 an array access REF (an ARRAY_REF expression) falls into the
10486 in_array_bounds_p (tree ref
)
10488 tree idx
= TREE_OPERAND (ref
, 1);
10491 if (TREE_CODE (idx
) != INTEGER_CST
)
10494 min
= array_ref_low_bound (ref
);
10495 max
= array_ref_up_bound (ref
);
10498 || TREE_CODE (min
) != INTEGER_CST
10499 || TREE_CODE (max
) != INTEGER_CST
)
10502 if (tree_int_cst_lt (idx
, min
)
10503 || tree_int_cst_lt (max
, idx
))
10509 /* Returns true if it is possible to prove that the range of
10510 an array access REF (an ARRAY_RANGE_REF expression) falls
10511 into the array bounds. */
10514 range_in_array_bounds_p (tree ref
)
10516 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10517 tree range_min
, range_max
, min
, max
;
10519 range_min
= TYPE_MIN_VALUE (domain_type
);
10520 range_max
= TYPE_MAX_VALUE (domain_type
);
10523 || TREE_CODE (range_min
) != INTEGER_CST
10524 || TREE_CODE (range_max
) != INTEGER_CST
)
10527 min
= array_ref_low_bound (ref
);
10528 max
= array_ref_up_bound (ref
);
10531 || TREE_CODE (min
) != INTEGER_CST
10532 || TREE_CODE (max
) != INTEGER_CST
)
10535 if (tree_int_cst_lt (range_min
, min
)
10536 || tree_int_cst_lt (max
, range_max
))
10542 /* Return true if T (assumed to be a DECL) must be assigned a memory
10546 needs_to_live_in_memory (const_tree t
)
10548 return (TREE_ADDRESSABLE (t
)
10549 || is_global_var (t
)
10550 || (TREE_CODE (t
) == RESULT_DECL
10551 && !DECL_BY_REFERENCE (t
)
10552 && aggregate_value_p (t
, current_function_decl
)));
10555 /* Return value of a constant X and sign-extend it. */
10558 int_cst_value (const_tree x
)
10560 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10561 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10563 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10564 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10565 || TREE_INT_CST_HIGH (x
) == -1);
10567 if (bits
< HOST_BITS_PER_WIDE_INT
)
10569 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10571 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10573 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10579 /* Return value of a constant X and sign-extend it. */
10582 widest_int_cst_value (const_tree x
)
10584 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10585 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10587 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10588 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10589 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10590 << HOST_BITS_PER_WIDE_INT
);
10592 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10593 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10594 || TREE_INT_CST_HIGH (x
) == -1);
10597 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10599 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10601 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10603 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10609 /* If TYPE is an integral or pointer type, return an integer type with
10610 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10611 if TYPE is already an integer type of signedness UNSIGNEDP. */
10614 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10616 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10619 if (TREE_CODE (type
) == VECTOR_TYPE
)
10621 tree inner
= TREE_TYPE (type
);
10622 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10625 if (inner
== inner2
)
10627 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10630 if (!INTEGRAL_TYPE_P (type
)
10631 && !POINTER_TYPE_P (type
))
10634 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10637 /* If TYPE is an integral or pointer type, return an integer type with
10638 the same precision which is unsigned, or itself if TYPE is already an
10639 unsigned integer type. */
10642 unsigned_type_for (tree type
)
10644 return signed_or_unsigned_type_for (1, type
);
10647 /* If TYPE is an integral or pointer type, return an integer type with
10648 the same precision which is signed, or itself if TYPE is already a
10649 signed integer type. */
10652 signed_type_for (tree type
)
10654 return signed_or_unsigned_type_for (0, type
);
10657 /* If TYPE is a vector type, return a signed integer vector type with the
10658 same width and number of subparts. Otherwise return boolean_type_node. */
10661 truth_type_for (tree type
)
10663 if (TREE_CODE (type
) == VECTOR_TYPE
)
10665 tree elem
= lang_hooks
.types
.type_for_size
10666 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10667 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10670 return boolean_type_node
;
10673 /* Returns the largest value obtainable by casting something in INNER type to
10677 upper_bound_in_type (tree outer
, tree inner
)
10680 unsigned int det
= 0;
10681 unsigned oprec
= TYPE_PRECISION (outer
);
10682 unsigned iprec
= TYPE_PRECISION (inner
);
10685 /* Compute a unique number for every combination. */
10686 det
|= (oprec
> iprec
) ? 4 : 0;
10687 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10688 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10690 /* Determine the exponent to use. */
10695 /* oprec <= iprec, outer: signed, inner: don't care. */
10700 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10704 /* oprec > iprec, outer: signed, inner: signed. */
10708 /* oprec > iprec, outer: signed, inner: unsigned. */
10712 /* oprec > iprec, outer: unsigned, inner: signed. */
10716 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10720 gcc_unreachable ();
10723 /* Compute 2^^prec - 1. */
10724 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10727 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10728 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10732 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10733 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10734 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10737 return double_int_to_tree (outer
, high
);
10740 /* Returns the smallest value obtainable by casting something in INNER type to
10744 lower_bound_in_type (tree outer
, tree inner
)
10747 unsigned oprec
= TYPE_PRECISION (outer
);
10748 unsigned iprec
= TYPE_PRECISION (inner
);
10750 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10752 if (TYPE_UNSIGNED (outer
)
10753 /* If we are widening something of an unsigned type, OUTER type
10754 contains all values of INNER type. In particular, both INNER
10755 and OUTER types have zero in common. */
10756 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10757 low
.low
= low
.high
= 0;
10760 /* If we are widening a signed type to another signed type, we
10761 want to obtain -2^^(iprec-1). If we are keeping the
10762 precision or narrowing to a signed type, we want to obtain
10764 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10766 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10768 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10769 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10773 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10774 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10779 return double_int_to_tree (outer
, low
);
10782 /* Return nonzero if two operands that are suitable for PHI nodes are
10783 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10784 SSA_NAME or invariant. Note that this is strictly an optimization.
10785 That is, callers of this function can directly call operand_equal_p
10786 and get the same result, only slower. */
10789 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10793 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10795 return operand_equal_p (arg0
, arg1
, 0);
10798 /* Returns number of zeros at the end of binary representation of X.
10800 ??? Use ffs if available? */
10803 num_ending_zeros (const_tree x
)
10805 unsigned HOST_WIDE_INT fr
, nfr
;
10806 unsigned num
, abits
;
10807 tree type
= TREE_TYPE (x
);
10809 if (TREE_INT_CST_LOW (x
) == 0)
10811 num
= HOST_BITS_PER_WIDE_INT
;
10812 fr
= TREE_INT_CST_HIGH (x
);
10817 fr
= TREE_INT_CST_LOW (x
);
10820 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10823 if (nfr
<< abits
== fr
)
10830 if (num
> TYPE_PRECISION (type
))
10831 num
= TYPE_PRECISION (type
);
10833 return build_int_cst_type (type
, num
);
10837 #define WALK_SUBTREE(NODE) \
10840 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10846 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10847 be walked whenever a type is seen in the tree. Rest of operands and return
10848 value are as for walk_tree. */
10851 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10852 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10854 tree result
= NULL_TREE
;
10856 switch (TREE_CODE (type
))
10859 case REFERENCE_TYPE
:
10860 /* We have to worry about mutually recursive pointers. These can't
10861 be written in C. They can in Ada. It's pathological, but
10862 there's an ACATS test (c38102a) that checks it. Deal with this
10863 by checking if we're pointing to another pointer, that one
10864 points to another pointer, that one does too, and we have no htab.
10865 If so, get a hash table. We check three levels deep to avoid
10866 the cost of the hash table if we don't need one. */
10867 if (POINTER_TYPE_P (TREE_TYPE (type
))
10868 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10869 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10872 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10880 /* ... fall through ... */
10883 WALK_SUBTREE (TREE_TYPE (type
));
10887 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10889 /* Fall through. */
10891 case FUNCTION_TYPE
:
10892 WALK_SUBTREE (TREE_TYPE (type
));
10896 /* We never want to walk into default arguments. */
10897 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10898 WALK_SUBTREE (TREE_VALUE (arg
));
10903 /* Don't follow this nodes's type if a pointer for fear that
10904 we'll have infinite recursion. If we have a PSET, then we
10907 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10908 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10909 WALK_SUBTREE (TREE_TYPE (type
));
10910 WALK_SUBTREE (TYPE_DOMAIN (type
));
10914 WALK_SUBTREE (TREE_TYPE (type
));
10915 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10925 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10926 called with the DATA and the address of each sub-tree. If FUNC returns a
10927 non-NULL value, the traversal is stopped, and the value returned by FUNC
10928 is returned. If PSET is non-NULL it is used to record the nodes visited,
10929 and to avoid visiting a node more than once. */
10932 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10933 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10935 enum tree_code code
;
10939 #define WALK_SUBTREE_TAIL(NODE) \
10943 goto tail_recurse; \
10948 /* Skip empty subtrees. */
10952 /* Don't walk the same tree twice, if the user has requested
10953 that we avoid doing so. */
10954 if (pset
&& pointer_set_insert (pset
, *tp
))
10957 /* Call the function. */
10959 result
= (*func
) (tp
, &walk_subtrees
, data
);
10961 /* If we found something, return it. */
10965 code
= TREE_CODE (*tp
);
10967 /* Even if we didn't, FUNC may have decided that there was nothing
10968 interesting below this point in the tree. */
10969 if (!walk_subtrees
)
10971 /* But we still need to check our siblings. */
10972 if (code
== TREE_LIST
)
10973 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10974 else if (code
== OMP_CLAUSE
)
10975 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10982 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10983 if (result
|| !walk_subtrees
)
10990 case IDENTIFIER_NODE
:
10997 case PLACEHOLDER_EXPR
:
11001 /* None of these have subtrees other than those already walked
11006 WALK_SUBTREE (TREE_VALUE (*tp
));
11007 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11012 int len
= TREE_VEC_LENGTH (*tp
);
11017 /* Walk all elements but the first. */
11019 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11021 /* Now walk the first one as a tail call. */
11022 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11026 WALK_SUBTREE (TREE_REALPART (*tp
));
11027 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11031 unsigned HOST_WIDE_INT idx
;
11032 constructor_elt
*ce
;
11034 for (idx
= 0; vec_safe_iterate(CONSTRUCTOR_ELTS (*tp
), idx
, &ce
); idx
++)
11035 WALK_SUBTREE (ce
->value
);
11040 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11045 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11047 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11048 into declarations that are just mentioned, rather than
11049 declared; they don't really belong to this part of the tree.
11050 And, we can see cycles: the initializer for a declaration
11051 can refer to the declaration itself. */
11052 WALK_SUBTREE (DECL_INITIAL (decl
));
11053 WALK_SUBTREE (DECL_SIZE (decl
));
11054 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11056 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11059 case STATEMENT_LIST
:
11061 tree_stmt_iterator i
;
11062 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11063 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11068 switch (OMP_CLAUSE_CODE (*tp
))
11070 case OMP_CLAUSE_PRIVATE
:
11071 case OMP_CLAUSE_SHARED
:
11072 case OMP_CLAUSE_FIRSTPRIVATE
:
11073 case OMP_CLAUSE_COPYIN
:
11074 case OMP_CLAUSE_COPYPRIVATE
:
11075 case OMP_CLAUSE_FINAL
:
11076 case OMP_CLAUSE_IF
:
11077 case OMP_CLAUSE_NUM_THREADS
:
11078 case OMP_CLAUSE_SCHEDULE
:
11079 case OMP_CLAUSE_UNIFORM
:
11080 case OMP_CLAUSE_SAFELEN
:
11081 case OMP_CLAUSE__SIMDUID_
:
11082 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11085 case OMP_CLAUSE_NOWAIT
:
11086 case OMP_CLAUSE_ORDERED
:
11087 case OMP_CLAUSE_DEFAULT
:
11088 case OMP_CLAUSE_UNTIED
:
11089 case OMP_CLAUSE_MERGEABLE
:
11090 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11092 case OMP_CLAUSE_LASTPRIVATE
:
11093 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11094 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11095 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11097 case OMP_CLAUSE_COLLAPSE
:
11100 for (i
= 0; i
< 3; i
++)
11101 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11102 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11105 case OMP_CLAUSE_LINEAR
:
11106 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11107 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11108 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11110 case OMP_CLAUSE_REDUCTION
:
11113 for (i
= 0; i
< 4; i
++)
11114 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11115 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11119 gcc_unreachable ();
11127 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11128 But, we only want to walk once. */
11129 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11130 for (i
= 0; i
< len
; ++i
)
11131 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11132 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11136 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11137 defining. We only want to walk into these fields of a type in this
11138 case and not in the general case of a mere reference to the type.
11140 The criterion is as follows: if the field can be an expression, it
11141 must be walked only here. This should be in keeping with the fields
11142 that are directly gimplified in gimplify_type_sizes in order for the
11143 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11144 variable-sized types.
11146 Note that DECLs get walked as part of processing the BIND_EXPR. */
11147 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11149 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11150 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11153 /* Call the function for the type. See if it returns anything or
11154 doesn't want us to continue. If we are to continue, walk both
11155 the normal fields and those for the declaration case. */
11156 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11157 if (result
|| !walk_subtrees
)
11160 /* But do not walk a pointed-to type since it may itself need to
11161 be walked in the declaration case if it isn't anonymous. */
11162 if (!POINTER_TYPE_P (*type_p
))
11164 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11169 /* If this is a record type, also walk the fields. */
11170 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11174 for (field
= TYPE_FIELDS (*type_p
); field
;
11175 field
= DECL_CHAIN (field
))
11177 /* We'd like to look at the type of the field, but we can
11178 easily get infinite recursion. So assume it's pointed
11179 to elsewhere in the tree. Also, ignore things that
11181 if (TREE_CODE (field
) != FIELD_DECL
)
11184 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11185 WALK_SUBTREE (DECL_SIZE (field
));
11186 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11187 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11188 WALK_SUBTREE (DECL_QUALIFIER (field
));
11192 /* Same for scalar types. */
11193 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11194 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11195 || TREE_CODE (*type_p
) == INTEGER_TYPE
11196 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11197 || TREE_CODE (*type_p
) == REAL_TYPE
)
11199 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11200 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11203 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11204 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11209 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11213 /* Walk over all the sub-trees of this operand. */
11214 len
= TREE_OPERAND_LENGTH (*tp
);
11216 /* Go through the subtrees. We need to do this in forward order so
11217 that the scope of a FOR_EXPR is handled properly. */
11220 for (i
= 0; i
< len
- 1; ++i
)
11221 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11222 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11225 /* If this is a type, walk the needed fields in the type. */
11226 else if (TYPE_P (*tp
))
11227 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11231 /* We didn't find what we were looking for. */
11234 #undef WALK_SUBTREE_TAIL
11236 #undef WALK_SUBTREE
11238 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11241 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11245 struct pointer_set_t
*pset
;
11247 pset
= pointer_set_create ();
11248 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11249 pointer_set_destroy (pset
);
11255 tree_block (tree t
)
11257 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11259 if (IS_EXPR_CODE_CLASS (c
))
11260 return LOCATION_BLOCK (t
->exp
.locus
);
11261 gcc_unreachable ();
11266 tree_set_block (tree t
, tree b
)
11268 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11270 if (IS_EXPR_CODE_CLASS (c
))
11273 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11275 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11278 gcc_unreachable ();
11281 /* Create a nameless artificial label and put it in the current
11282 function context. The label has a location of LOC. Returns the
11283 newly created label. */
11286 create_artificial_label (location_t loc
)
11288 tree lab
= build_decl (loc
,
11289 LABEL_DECL
, NULL_TREE
, void_type_node
);
11291 DECL_ARTIFICIAL (lab
) = 1;
11292 DECL_IGNORED_P (lab
) = 1;
11293 DECL_CONTEXT (lab
) = current_function_decl
;
11297 /* Given a tree, try to return a useful variable name that we can use
11298 to prefix a temporary that is being assigned the value of the tree.
11299 I.E. given <temp> = &A, return A. */
11304 tree stripped_decl
;
11307 STRIP_NOPS (stripped_decl
);
11308 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11309 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11310 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11312 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11315 return IDENTIFIER_POINTER (name
);
11319 switch (TREE_CODE (stripped_decl
))
11322 return get_name (TREE_OPERAND (stripped_decl
, 0));
11329 /* Return true if TYPE has a variable argument list. */
11332 stdarg_p (const_tree fntype
)
11334 function_args_iterator args_iter
;
11335 tree n
= NULL_TREE
, t
;
11340 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
11345 return n
!= NULL_TREE
&& n
!= void_type_node
;
11348 /* Return true if TYPE has a prototype. */
11351 prototype_p (tree fntype
)
11355 gcc_assert (fntype
!= NULL_TREE
);
11357 t
= TYPE_ARG_TYPES (fntype
);
11358 return (t
!= NULL_TREE
);
11361 /* If BLOCK is inlined from an __attribute__((__artificial__))
11362 routine, return pointer to location from where it has been
11365 block_nonartificial_location (tree block
)
11367 location_t
*ret
= NULL
;
11369 while (block
&& TREE_CODE (block
) == BLOCK
11370 && BLOCK_ABSTRACT_ORIGIN (block
))
11372 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11374 while (TREE_CODE (ao
) == BLOCK
11375 && BLOCK_ABSTRACT_ORIGIN (ao
)
11376 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11377 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11379 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11381 /* If AO is an artificial inline, point RET to the
11382 call site locus at which it has been inlined and continue
11383 the loop, in case AO's caller is also an artificial
11385 if (DECL_DECLARED_INLINE_P (ao
)
11386 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11387 ret
= &BLOCK_SOURCE_LOCATION (block
);
11391 else if (TREE_CODE (ao
) != BLOCK
)
11394 block
= BLOCK_SUPERCONTEXT (block
);
11400 /* If EXP is inlined from an __attribute__((__artificial__))
11401 function, return the location of the original call expression. */
11404 tree_nonartificial_location (tree exp
)
11406 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11411 return EXPR_LOCATION (exp
);
11415 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11418 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11421 cl_option_hash_hash (const void *x
)
11423 const_tree
const t
= (const_tree
) x
;
11427 hashval_t hash
= 0;
11429 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11431 p
= (const char *)TREE_OPTIMIZATION (t
);
11432 len
= sizeof (struct cl_optimization
);
11435 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11437 p
= (const char *)TREE_TARGET_OPTION (t
);
11438 len
= sizeof (struct cl_target_option
);
11442 gcc_unreachable ();
11444 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11446 for (i
= 0; i
< len
; i
++)
11448 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11453 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11454 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11458 cl_option_hash_eq (const void *x
, const void *y
)
11460 const_tree
const xt
= (const_tree
) x
;
11461 const_tree
const yt
= (const_tree
) y
;
11466 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11469 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11471 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11472 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11473 len
= sizeof (struct cl_optimization
);
11476 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11478 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11479 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11480 len
= sizeof (struct cl_target_option
);
11484 gcc_unreachable ();
11486 return (memcmp (xp
, yp
, len
) == 0);
11489 /* Build an OPTIMIZATION_NODE based on the current options. */
11492 build_optimization_node (void)
11497 /* Use the cache of optimization nodes. */
11499 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11502 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11506 /* Insert this one into the hash table. */
11507 t
= cl_optimization_node
;
11510 /* Make a new node for next time round. */
11511 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11517 /* Build a TARGET_OPTION_NODE based on the current options. */
11520 build_target_option_node (void)
11525 /* Use the cache of optimization nodes. */
11527 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11530 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11534 /* Insert this one into the hash table. */
11535 t
= cl_target_option_node
;
11538 /* Make a new node for next time round. */
11539 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11545 /* Determine the "ultimate origin" of a block. The block may be an inlined
11546 instance of an inlined instance of a block which is local to an inline
11547 function, so we have to trace all of the way back through the origin chain
11548 to find out what sort of node actually served as the original seed for the
11552 block_ultimate_origin (const_tree block
)
11554 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11556 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11557 nodes in the function to point to themselves; ignore that if
11558 we're trying to output the abstract instance of this function. */
11559 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11562 if (immediate_origin
== NULL_TREE
)
11567 tree lookahead
= immediate_origin
;
11571 ret_val
= lookahead
;
11572 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11573 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11575 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11577 /* The block's abstract origin chain may not be the *ultimate* origin of
11578 the block. It could lead to a DECL that has an abstract origin set.
11579 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11580 will give us if it has one). Note that DECL's abstract origins are
11581 supposed to be the most distant ancestor (or so decl_ultimate_origin
11582 claims), so we don't need to loop following the DECL origins. */
11583 if (DECL_P (ret_val
))
11584 return DECL_ORIGIN (ret_val
);
11590 /* Return true if T1 and T2 are equivalent lists. */
11593 list_equal_p (const_tree t1
, const_tree t2
)
11595 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11596 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11601 /* Return true iff conversion in EXP generates no instruction. Mark
11602 it inline so that we fully inline into the stripping functions even
11603 though we have two uses of this function. */
11606 tree_nop_conversion (const_tree exp
)
11608 tree outer_type
, inner_type
;
11610 if (!CONVERT_EXPR_P (exp
)
11611 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11613 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11616 outer_type
= TREE_TYPE (exp
);
11617 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11622 /* Use precision rather then machine mode when we can, which gives
11623 the correct answer even for submode (bit-field) types. */
11624 if ((INTEGRAL_TYPE_P (outer_type
)
11625 || POINTER_TYPE_P (outer_type
)
11626 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11627 && (INTEGRAL_TYPE_P (inner_type
)
11628 || POINTER_TYPE_P (inner_type
)
11629 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11630 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11632 /* Otherwise fall back on comparing machine modes (e.g. for
11633 aggregate types, floats). */
11634 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11637 /* Return true iff conversion in EXP generates no instruction. Don't
11638 consider conversions changing the signedness. */
11641 tree_sign_nop_conversion (const_tree exp
)
11643 tree outer_type
, inner_type
;
11645 if (!tree_nop_conversion (exp
))
11648 outer_type
= TREE_TYPE (exp
);
11649 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11651 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11652 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11655 /* Strip conversions from EXP according to tree_nop_conversion and
11656 return the resulting expression. */
11659 tree_strip_nop_conversions (tree exp
)
11661 while (tree_nop_conversion (exp
))
11662 exp
= TREE_OPERAND (exp
, 0);
11666 /* Strip conversions from EXP according to tree_sign_nop_conversion
11667 and return the resulting expression. */
11670 tree_strip_sign_nop_conversions (tree exp
)
11672 while (tree_sign_nop_conversion (exp
))
11673 exp
= TREE_OPERAND (exp
, 0);
11677 /* Avoid any floating point extensions from EXP. */
11679 strip_float_extensions (tree exp
)
11681 tree sub
, expt
, subt
;
11683 /* For floating point constant look up the narrowest type that can hold
11684 it properly and handle it like (type)(narrowest_type)constant.
11685 This way we can optimize for instance a=a*2.0 where "a" is float
11686 but 2.0 is double constant. */
11687 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11689 REAL_VALUE_TYPE orig
;
11692 orig
= TREE_REAL_CST (exp
);
11693 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11694 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11695 type
= float_type_node
;
11696 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11697 > TYPE_PRECISION (double_type_node
)
11698 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11699 type
= double_type_node
;
11701 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11704 if (!CONVERT_EXPR_P (exp
))
11707 sub
= TREE_OPERAND (exp
, 0);
11708 subt
= TREE_TYPE (sub
);
11709 expt
= TREE_TYPE (exp
);
11711 if (!FLOAT_TYPE_P (subt
))
11714 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11717 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11720 return strip_float_extensions (sub
);
11723 /* Strip out all handled components that produce invariant
11727 strip_invariant_refs (const_tree op
)
11729 while (handled_component_p (op
))
11731 switch (TREE_CODE (op
))
11734 case ARRAY_RANGE_REF
:
11735 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11736 || TREE_OPERAND (op
, 2) != NULL_TREE
11737 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11741 case COMPONENT_REF
:
11742 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11748 op
= TREE_OPERAND (op
, 0);
11754 static GTY(()) tree gcc_eh_personality_decl
;
11756 /* Return the GCC personality function decl. */
11759 lhd_gcc_personality (void)
11761 if (!gcc_eh_personality_decl
)
11762 gcc_eh_personality_decl
= build_personality_function ("gcc");
11763 return gcc_eh_personality_decl
;
11766 /* For languages with One Definition Rule, work out if
11767 trees are actually the same even if the tree representation
11768 differs. This handles only decls appearing in TYPE_NAME
11769 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11770 RECORD_TYPE and IDENTIFIER_NODE. */
11773 same_for_odr (tree t1
, tree t2
)
11779 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11780 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11781 && TREE_CODE (t2
) == TYPE_DECL
11782 && DECL_FILE_SCOPE_P (t1
))
11784 t2
= DECL_NAME (t2
);
11785 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11787 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11788 && TREE_CODE (t1
) == TYPE_DECL
11789 && DECL_FILE_SCOPE_P (t2
))
11791 t1
= DECL_NAME (t1
);
11792 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11794 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11797 return types_same_for_odr (t1
, t2
);
11799 return decls_same_for_odr (t1
, t2
);
11803 /* For languages with One Definition Rule, work out if
11804 decls are actually the same even if the tree representation
11805 differs. This handles only decls appearing in TYPE_NAME
11806 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11807 RECORD_TYPE and IDENTIFIER_NODE. */
11810 decls_same_for_odr (tree decl1
, tree decl2
)
11812 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11813 && DECL_ORIGINAL_TYPE (decl1
))
11814 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11815 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11816 && DECL_ORIGINAL_TYPE (decl2
))
11817 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11818 if (decl1
== decl2
)
11820 if (!decl1
|| !decl2
)
11822 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11823 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11825 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11827 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11828 && TREE_CODE (decl1
) != TYPE_DECL
)
11830 if (!DECL_NAME (decl1
))
11832 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11833 gcc_checking_assert (!DECL_NAME (decl2
)
11834 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11835 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11837 return same_for_odr (DECL_CONTEXT (decl1
),
11838 DECL_CONTEXT (decl2
));
11841 /* For languages with One Definition Rule, work out if
11842 types are same even if the tree representation differs.
11843 This is non-trivial for LTO where minnor differences in
11844 the type representation may have prevented type merging
11845 to merge two copies of otherwise equivalent type. */
11848 types_same_for_odr (tree type1
, tree type2
)
11850 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11851 type1
= TYPE_MAIN_VARIANT (type1
);
11852 type2
= TYPE_MAIN_VARIANT (type2
);
11853 if (type1
== type2
)
11856 #ifndef ENABLE_CHECKING
11861 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11862 on the corresponding TYPE_STUB_DECL. */
11863 if (type_in_anonymous_namespace_p (type1
)
11864 || type_in_anonymous_namespace_p (type2
))
11866 /* When assembler name of virtual table is available, it is
11867 easy to compare types for equivalence. */
11868 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11869 && BINFO_VTABLE (TYPE_BINFO (type1
))
11870 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11872 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11873 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11875 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11877 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11878 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11879 TREE_OPERAND (v2
, 1), 0))
11881 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11882 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11884 v1
= DECL_ASSEMBLER_NAME (v1
);
11885 v2
= DECL_ASSEMBLER_NAME (v2
);
11889 /* FIXME: the code comparing type names consider all instantiations of the
11890 same template to have same name. This is because we have no access
11891 to template parameters. For types with no virtual method tables
11892 we thus can return false positives. At the moment we do not need
11893 to compare types in other scenarios than devirtualization. */
11895 /* If types are not structuraly same, do not bother to contnue.
11896 Match in the remainder of code would mean ODR violation. */
11897 if (!types_compatible_p (type1
, type2
))
11899 if (!TYPE_NAME (type1
))
11901 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11903 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11905 /* When not in LTO the MAIN_VARIANT check should be the same. */
11906 gcc_assert (in_lto_p
);
11911 /* TARGET is a call target of GIMPLE call statement
11912 (obtained by gimple_call_fn). Return true if it is
11913 OBJ_TYPE_REF representing an virtual call of C++ method.
11914 (As opposed to OBJ_TYPE_REF representing objc calls
11915 through a cast where middle-end devirtualization machinery
11919 virtual_method_call_p (tree target
)
11921 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11923 target
= TREE_TYPE (target
);
11924 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11925 target
= TREE_TYPE (target
);
11926 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11928 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11932 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11935 obj_type_ref_class (tree ref
)
11937 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11938 ref
= TREE_TYPE (ref
);
11939 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11940 ref
= TREE_TYPE (ref
);
11941 /* We look for type THIS points to. ObjC also builds
11942 OBJ_TYPE_REF with non-method calls, Their first parameter
11943 ID however also corresponds to class type. */
11944 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11945 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11946 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11947 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11948 return TREE_TYPE (ref
);
11951 /* Return true if T is in anonymous namespace. */
11954 type_in_anonymous_namespace_p (tree t
)
11956 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11959 /* Try to find a base info of BINFO that would have its field decl at offset
11960 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11961 found, return, otherwise return NULL_TREE. */
11964 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11966 tree type
= BINFO_TYPE (binfo
);
11970 HOST_WIDE_INT pos
, size
;
11974 if (types_same_for_odr (type
, expected_type
))
11979 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11981 if (TREE_CODE (fld
) != FIELD_DECL
)
11984 pos
= int_bit_position (fld
);
11985 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11986 if (pos
<= offset
&& (pos
+ size
) > offset
)
11989 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11992 if (!DECL_ARTIFICIAL (fld
))
11994 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11998 /* Offset 0 indicates the primary base, whose vtable contents are
11999 represented in the binfo for the derived class. */
12000 else if (offset
!= 0)
12002 tree base_binfo
, found_binfo
= NULL_TREE
;
12003 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12004 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12006 found_binfo
= base_binfo
;
12011 binfo
= found_binfo
;
12014 type
= TREE_TYPE (fld
);
12019 /* Returns true if X is a typedef decl. */
12022 is_typedef_decl (tree x
)
12024 return (x
&& TREE_CODE (x
) == TYPE_DECL
12025 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12028 /* Returns true iff TYPE is a type variant created for a typedef. */
12031 typedef_variant_p (tree type
)
12033 return is_typedef_decl (TYPE_NAME (type
));
12036 /* Warn about a use of an identifier which was marked deprecated. */
12038 warn_deprecated_use (tree node
, tree attr
)
12042 if (node
== 0 || !warn_deprecated_decl
)
12048 attr
= DECL_ATTRIBUTES (node
);
12049 else if (TYPE_P (node
))
12051 tree decl
= TYPE_STUB_DECL (node
);
12053 attr
= lookup_attribute ("deprecated",
12054 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12059 attr
= lookup_attribute ("deprecated", attr
);
12062 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12068 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12070 warning (OPT_Wdeprecated_declarations
,
12071 "%qD is deprecated (declared at %r%s:%d%R): %s",
12072 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12074 warning (OPT_Wdeprecated_declarations
,
12075 "%qD is deprecated (declared at %r%s:%d%R)",
12076 node
, "locus", xloc
.file
, xloc
.line
);
12078 else if (TYPE_P (node
))
12080 tree what
= NULL_TREE
;
12081 tree decl
= TYPE_STUB_DECL (node
);
12083 if (TYPE_NAME (node
))
12085 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12086 what
= TYPE_NAME (node
);
12087 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12088 && DECL_NAME (TYPE_NAME (node
)))
12089 what
= DECL_NAME (TYPE_NAME (node
));
12094 expanded_location xloc
12095 = expand_location (DECL_SOURCE_LOCATION (decl
));
12099 warning (OPT_Wdeprecated_declarations
,
12100 "%qE is deprecated (declared at %r%s:%d%R): %s",
12101 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12103 warning (OPT_Wdeprecated_declarations
,
12104 "%qE is deprecated (declared at %r%s:%d%R)",
12105 what
, "locus", xloc
.file
, xloc
.line
);
12110 warning (OPT_Wdeprecated_declarations
,
12111 "type is deprecated (declared at %r%s:%d%R): %s",
12112 "locus", xloc
.file
, xloc
.line
, msg
);
12114 warning (OPT_Wdeprecated_declarations
,
12115 "type is deprecated (declared at %r%s:%d%R)",
12116 "locus", xloc
.file
, xloc
.line
);
12124 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12127 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12132 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12135 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12141 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12142 somewhere in it. */
12145 contains_bitfld_component_ref_p (const_tree ref
)
12147 while (handled_component_p (ref
))
12149 if (TREE_CODE (ref
) == COMPONENT_REF
12150 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12152 ref
= TREE_OPERAND (ref
, 0);
12158 #include "gt-tree.h"