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 an invariant ADDR_EXPR of type TYPE taking the address of BASE
4267 offsetted by OFFSET units. */
4270 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4272 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4273 build_fold_addr_expr (base
),
4274 build_int_cst (ptr_type_node
, offset
));
4275 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4276 recompute_tree_invariant_for_addr_expr (addr
);
4280 /* Similar except don't specify the TREE_TYPE
4281 and leave the TREE_SIDE_EFFECTS as 0.
4282 It is permissible for arguments to be null,
4283 or even garbage if their values do not matter. */
4286 build_nt (enum tree_code code
, ...)
4293 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4297 t
= make_node (code
);
4298 length
= TREE_CODE_LENGTH (code
);
4300 for (i
= 0; i
< length
; i
++)
4301 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4307 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4311 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4316 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4317 CALL_EXPR_FN (ret
) = fn
;
4318 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4319 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4320 CALL_EXPR_ARG (ret
, ix
) = t
;
4324 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4325 We do NOT enter this node in any sort of symbol table.
4327 LOC is the location of the decl.
4329 layout_decl is used to set up the decl's storage layout.
4330 Other slots are initialized to 0 or null pointers. */
4333 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4334 tree type MEM_STAT_DECL
)
4338 t
= make_node_stat (code PASS_MEM_STAT
);
4339 DECL_SOURCE_LOCATION (t
) = loc
;
4341 /* if (type == error_mark_node)
4342 type = integer_type_node; */
4343 /* That is not done, deliberately, so that having error_mark_node
4344 as the type can suppress useless errors in the use of this variable. */
4346 DECL_NAME (t
) = name
;
4347 TREE_TYPE (t
) = type
;
4349 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4355 /* Builds and returns function declaration with NAME and TYPE. */
4358 build_fn_decl (const char *name
, tree type
)
4360 tree id
= get_identifier (name
);
4361 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4363 DECL_EXTERNAL (decl
) = 1;
4364 TREE_PUBLIC (decl
) = 1;
4365 DECL_ARTIFICIAL (decl
) = 1;
4366 TREE_NOTHROW (decl
) = 1;
4371 vec
<tree
, va_gc
> *all_translation_units
;
4373 /* Builds a new translation-unit decl with name NAME, queues it in the
4374 global list of translation-unit decls and returns it. */
4377 build_translation_unit_decl (tree name
)
4379 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4381 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4382 vec_safe_push (all_translation_units
, tu
);
4387 /* BLOCK nodes are used to represent the structure of binding contours
4388 and declarations, once those contours have been exited and their contents
4389 compiled. This information is used for outputting debugging info. */
4392 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4394 tree block
= make_node (BLOCK
);
4396 BLOCK_VARS (block
) = vars
;
4397 BLOCK_SUBBLOCKS (block
) = subblocks
;
4398 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4399 BLOCK_CHAIN (block
) = chain
;
4404 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4406 LOC is the location to use in tree T. */
4409 protected_set_expr_location (tree t
, location_t loc
)
4411 if (t
&& CAN_HAVE_LOCATION_P (t
))
4412 SET_EXPR_LOCATION (t
, loc
);
4415 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4419 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4421 DECL_ATTRIBUTES (ddecl
) = attribute
;
4425 /* Borrowed from hashtab.c iterative_hash implementation. */
4426 #define mix(a,b,c) \
4428 a -= b; a -= c; a ^= (c>>13); \
4429 b -= c; b -= a; b ^= (a<< 8); \
4430 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4431 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4432 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4433 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4434 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4435 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4436 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4440 /* Produce good hash value combining VAL and VAL2. */
4442 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4444 /* the golden ratio; an arbitrary value. */
4445 hashval_t a
= 0x9e3779b9;
4451 /* Produce good hash value combining VAL and VAL2. */
4453 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4455 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4456 return iterative_hash_hashval_t (val
, val2
);
4459 hashval_t a
= (hashval_t
) val
;
4460 /* Avoid warnings about shifting of more than the width of the type on
4461 hosts that won't execute this path. */
4463 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4465 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4467 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4468 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4475 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4476 is ATTRIBUTE and its qualifiers are QUALS.
4478 Record such modified types already made so we don't make duplicates. */
4481 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4483 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4485 hashval_t hashcode
= 0;
4487 enum tree_code code
= TREE_CODE (ttype
);
4489 /* Building a distinct copy of a tagged type is inappropriate; it
4490 causes breakage in code that expects there to be a one-to-one
4491 relationship between a struct and its fields.
4492 build_duplicate_type is another solution (as used in
4493 handle_transparent_union_attribute), but that doesn't play well
4494 with the stronger C++ type identity model. */
4495 if (TREE_CODE (ttype
) == RECORD_TYPE
4496 || TREE_CODE (ttype
) == UNION_TYPE
4497 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4498 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4500 warning (OPT_Wattributes
,
4501 "ignoring attributes applied to %qT after definition",
4502 TYPE_MAIN_VARIANT (ttype
));
4503 return build_qualified_type (ttype
, quals
);
4506 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4507 ntype
= build_distinct_type_copy (ttype
);
4509 TYPE_ATTRIBUTES (ntype
) = attribute
;
4511 hashcode
= iterative_hash_object (code
, hashcode
);
4512 if (TREE_TYPE (ntype
))
4513 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4515 hashcode
= attribute_hash_list (attribute
, hashcode
);
4517 switch (TREE_CODE (ntype
))
4520 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4523 if (TYPE_DOMAIN (ntype
))
4524 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4528 hashcode
= iterative_hash_object
4529 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4530 hashcode
= iterative_hash_object
4531 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4534 case FIXED_POINT_TYPE
:
4536 unsigned int precision
= TYPE_PRECISION (ntype
);
4537 hashcode
= iterative_hash_object (precision
, hashcode
);
4544 ntype
= type_hash_canon (hashcode
, ntype
);
4546 /* If the target-dependent attributes make NTYPE different from
4547 its canonical type, we will need to use structural equality
4548 checks for this type. */
4549 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4550 || !comp_type_attributes (ntype
, ttype
))
4551 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4552 else if (TYPE_CANONICAL (ntype
) == ntype
)
4553 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4555 ttype
= build_qualified_type (ntype
, quals
);
4557 else if (TYPE_QUALS (ttype
) != quals
)
4558 ttype
= build_qualified_type (ttype
, quals
);
4563 /* Compare two attributes for their value identity. Return true if the
4564 attribute values are known to be equal; otherwise return false.
4568 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4570 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4573 if (TREE_VALUE (attr1
) != NULL_TREE
4574 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4575 && TREE_VALUE (attr2
) != NULL
4576 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4577 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4578 TREE_VALUE (attr2
)) == 1);
4580 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4583 /* Return 0 if the attributes for two types are incompatible, 1 if they
4584 are compatible, and 2 if they are nearly compatible (which causes a
4585 warning to be generated). */
4587 comp_type_attributes (const_tree type1
, const_tree type2
)
4589 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4590 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4595 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4597 const struct attribute_spec
*as
;
4600 as
= lookup_attribute_spec (get_attribute_name (a
));
4601 if (!as
|| as
->affects_type_identity
== false)
4604 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4605 if (!attr
|| !attribute_value_equal (a
, attr
))
4610 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4612 const struct attribute_spec
*as
;
4614 as
= lookup_attribute_spec (get_attribute_name (a
));
4615 if (!as
|| as
->affects_type_identity
== false)
4618 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4620 /* We don't need to compare trees again, as we did this
4621 already in first loop. */
4623 /* All types - affecting identity - are equal, so
4624 there is no need to call target hook for comparison. */
4628 /* As some type combinations - like default calling-convention - might
4629 be compatible, we have to call the target hook to get the final result. */
4630 return targetm
.comp_type_attributes (type1
, type2
);
4633 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4636 Record such modified types already made so we don't make duplicates. */
4639 build_type_attribute_variant (tree ttype
, tree attribute
)
4641 return build_type_attribute_qual_variant (ttype
, attribute
,
4642 TYPE_QUALS (ttype
));
4646 /* Reset the expression *EXPR_P, a size or position.
4648 ??? We could reset all non-constant sizes or positions. But it's cheap
4649 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4651 We need to reset self-referential sizes or positions because they cannot
4652 be gimplified and thus can contain a CALL_EXPR after the gimplification
4653 is finished, which will run afoul of LTO streaming. And they need to be
4654 reset to something essentially dummy but not constant, so as to preserve
4655 the properties of the object they are attached to. */
4658 free_lang_data_in_one_sizepos (tree
*expr_p
)
4660 tree expr
= *expr_p
;
4661 if (CONTAINS_PLACEHOLDER_P (expr
))
4662 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4666 /* Reset all the fields in a binfo node BINFO. We only keep
4667 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4670 free_lang_data_in_binfo (tree binfo
)
4675 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4677 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4678 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4679 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4680 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4682 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4683 free_lang_data_in_binfo (t
);
4687 /* Reset all language specific information still present in TYPE. */
4690 free_lang_data_in_type (tree type
)
4692 gcc_assert (TYPE_P (type
));
4694 /* Give the FE a chance to remove its own data first. */
4695 lang_hooks
.free_lang_data (type
);
4697 TREE_LANG_FLAG_0 (type
) = 0;
4698 TREE_LANG_FLAG_1 (type
) = 0;
4699 TREE_LANG_FLAG_2 (type
) = 0;
4700 TREE_LANG_FLAG_3 (type
) = 0;
4701 TREE_LANG_FLAG_4 (type
) = 0;
4702 TREE_LANG_FLAG_5 (type
) = 0;
4703 TREE_LANG_FLAG_6 (type
) = 0;
4705 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4707 /* Remove the const and volatile qualifiers from arguments. The
4708 C++ front end removes them, but the C front end does not,
4709 leading to false ODR violation errors when merging two
4710 instances of the same function signature compiled by
4711 different front ends. */
4714 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4716 tree arg_type
= TREE_VALUE (p
);
4718 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4720 int quals
= TYPE_QUALS (arg_type
)
4722 & ~TYPE_QUAL_VOLATILE
;
4723 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4724 free_lang_data_in_type (TREE_VALUE (p
));
4729 /* Remove members that are not actually FIELD_DECLs from the field
4730 list of an aggregate. These occur in C++. */
4731 if (RECORD_OR_UNION_TYPE_P (type
))
4735 /* Note that TYPE_FIELDS can be shared across distinct
4736 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4737 to be removed, we cannot set its TREE_CHAIN to NULL.
4738 Otherwise, we would not be able to find all the other fields
4739 in the other instances of this TREE_TYPE.
4741 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4743 member
= TYPE_FIELDS (type
);
4746 if (TREE_CODE (member
) == FIELD_DECL
4747 || TREE_CODE (member
) == TYPE_DECL
)
4750 TREE_CHAIN (prev
) = member
;
4752 TYPE_FIELDS (type
) = member
;
4756 member
= TREE_CHAIN (member
);
4760 TREE_CHAIN (prev
) = NULL_TREE
;
4762 TYPE_FIELDS (type
) = NULL_TREE
;
4764 TYPE_METHODS (type
) = NULL_TREE
;
4765 if (TYPE_BINFO (type
))
4766 free_lang_data_in_binfo (TYPE_BINFO (type
));
4770 /* For non-aggregate types, clear out the language slot (which
4771 overloads TYPE_BINFO). */
4772 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4774 if (INTEGRAL_TYPE_P (type
)
4775 || SCALAR_FLOAT_TYPE_P (type
)
4776 || FIXED_POINT_TYPE_P (type
))
4778 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4779 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4783 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4784 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4786 if (TYPE_CONTEXT (type
)
4787 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4789 tree ctx
= TYPE_CONTEXT (type
);
4792 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4794 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4795 TYPE_CONTEXT (type
) = ctx
;
4800 /* Return true if DECL may need an assembler name to be set. */
4803 need_assembler_name_p (tree decl
)
4805 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4806 if (TREE_CODE (decl
) != FUNCTION_DECL
4807 && TREE_CODE (decl
) != VAR_DECL
)
4810 /* If DECL already has its assembler name set, it does not need a
4812 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4813 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4816 /* Abstract decls do not need an assembler name. */
4817 if (DECL_ABSTRACT (decl
))
4820 /* For VAR_DECLs, only static, public and external symbols need an
4822 if (TREE_CODE (decl
) == VAR_DECL
4823 && !TREE_STATIC (decl
)
4824 && !TREE_PUBLIC (decl
)
4825 && !DECL_EXTERNAL (decl
))
4828 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4830 /* Do not set assembler name on builtins. Allow RTL expansion to
4831 decide whether to expand inline or via a regular call. */
4832 if (DECL_BUILT_IN (decl
)
4833 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4836 /* Functions represented in the callgraph need an assembler name. */
4837 if (cgraph_get_node (decl
) != NULL
)
4840 /* Unused and not public functions don't need an assembler name. */
4841 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4849 /* Reset all language specific information still present in symbol
4853 free_lang_data_in_decl (tree decl
)
4855 gcc_assert (DECL_P (decl
));
4857 /* Give the FE a chance to remove its own data first. */
4858 lang_hooks
.free_lang_data (decl
);
4860 TREE_LANG_FLAG_0 (decl
) = 0;
4861 TREE_LANG_FLAG_1 (decl
) = 0;
4862 TREE_LANG_FLAG_2 (decl
) = 0;
4863 TREE_LANG_FLAG_3 (decl
) = 0;
4864 TREE_LANG_FLAG_4 (decl
) = 0;
4865 TREE_LANG_FLAG_5 (decl
) = 0;
4866 TREE_LANG_FLAG_6 (decl
) = 0;
4868 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4869 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4870 if (TREE_CODE (decl
) == FIELD_DECL
)
4872 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4873 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4874 DECL_QUALIFIER (decl
) = NULL_TREE
;
4877 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4879 struct cgraph_node
*node
;
4880 if (!(node
= cgraph_get_node (decl
))
4881 || (!node
->symbol
.definition
&& !node
->clones
))
4884 cgraph_release_function_body (node
);
4887 release_function_body (decl
);
4888 DECL_ARGUMENTS (decl
) = NULL
;
4889 DECL_RESULT (decl
) = NULL
;
4890 DECL_INITIAL (decl
) = error_mark_node
;
4893 if (gimple_has_body_p (decl
))
4897 /* If DECL has a gimple body, then the context for its
4898 arguments must be DECL. Otherwise, it doesn't really
4899 matter, as we will not be emitting any code for DECL. In
4900 general, there may be other instances of DECL created by
4901 the front end and since PARM_DECLs are generally shared,
4902 their DECL_CONTEXT changes as the replicas of DECL are
4903 created. The only time where DECL_CONTEXT is important
4904 is for the FUNCTION_DECLs that have a gimple body (since
4905 the PARM_DECL will be used in the function's body). */
4906 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4907 DECL_CONTEXT (t
) = decl
;
4910 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4911 At this point, it is not needed anymore. */
4912 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4914 /* Clear the abstract origin if it refers to a method. Otherwise
4915 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4916 origin will not be output correctly. */
4917 if (DECL_ABSTRACT_ORIGIN (decl
)
4918 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4919 && RECORD_OR_UNION_TYPE_P
4920 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4921 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4923 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4924 DECL_VINDEX referring to itself into a vtable slot number as it
4925 should. Happens with functions that are copied and then forgotten
4926 about. Just clear it, it won't matter anymore. */
4927 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4928 DECL_VINDEX (decl
) = NULL_TREE
;
4930 else if (TREE_CODE (decl
) == VAR_DECL
)
4932 if ((DECL_EXTERNAL (decl
)
4933 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4934 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4935 DECL_INITIAL (decl
) = NULL_TREE
;
4937 else if (TREE_CODE (decl
) == TYPE_DECL
4938 || TREE_CODE (decl
) == FIELD_DECL
)
4939 DECL_INITIAL (decl
) = NULL_TREE
;
4940 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4941 && DECL_INITIAL (decl
)
4942 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4944 /* Strip builtins from the translation-unit BLOCK. We still have targets
4945 without builtin_decl_explicit support and also builtins are shared
4946 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4947 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4951 if (TREE_CODE (var
) == FUNCTION_DECL
4952 && DECL_BUILT_IN (var
))
4953 *nextp
= TREE_CHAIN (var
);
4955 nextp
= &TREE_CHAIN (var
);
4961 /* Data used when collecting DECLs and TYPEs for language data removal. */
4963 struct free_lang_data_d
4965 /* Worklist to avoid excessive recursion. */
4968 /* Set of traversed objects. Used to avoid duplicate visits. */
4969 struct pointer_set_t
*pset
;
4971 /* Array of symbols to process with free_lang_data_in_decl. */
4974 /* Array of types to process with free_lang_data_in_type. */
4979 /* Save all language fields needed to generate proper debug information
4980 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4983 save_debug_info_for_decl (tree t
)
4985 /*struct saved_debug_info_d *sdi;*/
4987 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4989 /* FIXME. Partial implementation for saving debug info removed. */
4993 /* Save all language fields needed to generate proper debug information
4994 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4997 save_debug_info_for_type (tree t
)
4999 /*struct saved_debug_info_d *sdi;*/
5001 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5003 /* FIXME. Partial implementation for saving debug info removed. */
5007 /* Add type or decl T to one of the list of tree nodes that need their
5008 language data removed. The lists are held inside FLD. */
5011 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5015 fld
->decls
.safe_push (t
);
5016 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5017 save_debug_info_for_decl (t
);
5019 else if (TYPE_P (t
))
5021 fld
->types
.safe_push (t
);
5022 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5023 save_debug_info_for_type (t
);
5029 /* Push tree node T into FLD->WORKLIST. */
5032 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5034 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5035 fld
->worklist
.safe_push ((t
));
5039 /* Operand callback helper for free_lang_data_in_node. *TP is the
5040 subtree operand being considered. */
5043 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5046 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5048 if (TREE_CODE (t
) == TREE_LIST
)
5051 /* Language specific nodes will be removed, so there is no need
5052 to gather anything under them. */
5053 if (is_lang_specific (t
))
5061 /* Note that walk_tree does not traverse every possible field in
5062 decls, so we have to do our own traversals here. */
5063 add_tree_to_fld_list (t
, fld
);
5065 fld_worklist_push (DECL_NAME (t
), fld
);
5066 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5067 fld_worklist_push (DECL_SIZE (t
), fld
);
5068 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5070 /* We are going to remove everything under DECL_INITIAL for
5071 TYPE_DECLs. No point walking them. */
5072 if (TREE_CODE (t
) != TYPE_DECL
)
5073 fld_worklist_push (DECL_INITIAL (t
), fld
);
5075 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5076 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5078 if (TREE_CODE (t
) == FUNCTION_DECL
)
5080 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5081 fld_worklist_push (DECL_RESULT (t
), fld
);
5083 else if (TREE_CODE (t
) == TYPE_DECL
)
5085 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5086 fld_worklist_push (DECL_VINDEX (t
), fld
);
5087 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5089 else if (TREE_CODE (t
) == FIELD_DECL
)
5091 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5092 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5093 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5094 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5096 else if (TREE_CODE (t
) == VAR_DECL
)
5098 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5099 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
5102 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5103 && DECL_HAS_VALUE_EXPR_P (t
))
5104 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5106 if (TREE_CODE (t
) != FIELD_DECL
5107 && TREE_CODE (t
) != TYPE_DECL
)
5108 fld_worklist_push (TREE_CHAIN (t
), fld
);
5111 else if (TYPE_P (t
))
5113 /* Note that walk_tree does not traverse every possible field in
5114 types, so we have to do our own traversals here. */
5115 add_tree_to_fld_list (t
, fld
);
5117 if (!RECORD_OR_UNION_TYPE_P (t
))
5118 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5119 fld_worklist_push (TYPE_SIZE (t
), fld
);
5120 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5121 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5122 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5123 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5124 fld_worklist_push (TYPE_NAME (t
), fld
);
5125 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5126 them and thus do not and want not to reach unused pointer types
5128 if (!POINTER_TYPE_P (t
))
5129 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5130 if (!RECORD_OR_UNION_TYPE_P (t
))
5131 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5132 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5133 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5134 do not and want not to reach unused variants this way. */
5135 if (TYPE_CONTEXT (t
))
5137 tree ctx
= TYPE_CONTEXT (t
);
5138 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5139 So push that instead. */
5140 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5141 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5142 fld_worklist_push (ctx
, fld
);
5144 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5145 and want not to reach unused types this way. */
5147 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5151 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5152 fld_worklist_push (TREE_TYPE (tem
), fld
);
5153 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5155 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5156 && TREE_CODE (tem
) == TREE_LIST
)
5159 fld_worklist_push (TREE_VALUE (tem
), fld
);
5160 tem
= TREE_CHAIN (tem
);
5164 if (RECORD_OR_UNION_TYPE_P (t
))
5167 /* Push all TYPE_FIELDS - there can be interleaving interesting
5168 and non-interesting things. */
5169 tem
= TYPE_FIELDS (t
);
5172 if (TREE_CODE (tem
) == FIELD_DECL
5173 || TREE_CODE (tem
) == TYPE_DECL
)
5174 fld_worklist_push (tem
, fld
);
5175 tem
= TREE_CHAIN (tem
);
5179 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5182 else if (TREE_CODE (t
) == BLOCK
)
5185 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5186 fld_worklist_push (tem
, fld
);
5187 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5188 fld_worklist_push (tem
, fld
);
5189 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5192 if (TREE_CODE (t
) != IDENTIFIER_NODE
5193 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5194 fld_worklist_push (TREE_TYPE (t
), fld
);
5200 /* Find decls and types in T. */
5203 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5207 if (!pointer_set_contains (fld
->pset
, t
))
5208 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5209 if (fld
->worklist
.is_empty ())
5211 t
= fld
->worklist
.pop ();
5215 /* Translate all the types in LIST with the corresponding runtime
5219 get_eh_types_for_runtime (tree list
)
5223 if (list
== NULL_TREE
)
5226 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5228 list
= TREE_CHAIN (list
);
5231 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5232 TREE_CHAIN (prev
) = n
;
5233 prev
= TREE_CHAIN (prev
);
5234 list
= TREE_CHAIN (list
);
5241 /* Find decls and types referenced in EH region R and store them in
5242 FLD->DECLS and FLD->TYPES. */
5245 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5256 /* The types referenced in each catch must first be changed to the
5257 EH types used at runtime. This removes references to FE types
5259 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5261 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5262 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5267 case ERT_ALLOWED_EXCEPTIONS
:
5268 r
->u
.allowed
.type_list
5269 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5270 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5273 case ERT_MUST_NOT_THROW
:
5274 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5275 find_decls_types_r
, fld
, fld
->pset
);
5281 /* Find decls and types referenced in cgraph node N and store them in
5282 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5283 look for *every* kind of DECL and TYPE node reachable from N,
5284 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5285 NAMESPACE_DECLs, etc). */
5288 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5291 struct function
*fn
;
5295 find_decls_types (n
->symbol
.decl
, fld
);
5297 if (!gimple_has_body_p (n
->symbol
.decl
))
5300 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5302 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5304 /* Traverse locals. */
5305 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5306 find_decls_types (t
, fld
);
5308 /* Traverse EH regions in FN. */
5311 FOR_ALL_EH_REGION_FN (r
, fn
)
5312 find_decls_types_in_eh_region (r
, fld
);
5315 /* Traverse every statement in FN. */
5316 FOR_EACH_BB_FN (bb
, fn
)
5318 gimple_stmt_iterator si
;
5321 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5323 gimple phi
= gsi_stmt (si
);
5325 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5327 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5328 find_decls_types (*arg_p
, fld
);
5332 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5334 gimple stmt
= gsi_stmt (si
);
5336 if (is_gimple_call (stmt
))
5337 find_decls_types (gimple_call_fntype (stmt
), fld
);
5339 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5341 tree arg
= gimple_op (stmt
, i
);
5342 find_decls_types (arg
, fld
);
5349 /* Find decls and types referenced in varpool node N and store them in
5350 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5351 look for *every* kind of DECL and TYPE node reachable from N,
5352 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5353 NAMESPACE_DECLs, etc). */
5356 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5358 find_decls_types (v
->symbol
.decl
, fld
);
5361 /* If T needs an assembler name, have one created for it. */
5364 assign_assembler_name_if_neeeded (tree t
)
5366 if (need_assembler_name_p (t
))
5368 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5369 diagnostics that use input_location to show locus
5370 information. The problem here is that, at this point,
5371 input_location is generally anchored to the end of the file
5372 (since the parser is long gone), so we don't have a good
5373 position to pin it to.
5375 To alleviate this problem, this uses the location of T's
5376 declaration. Examples of this are
5377 testsuite/g++.dg/template/cond2.C and
5378 testsuite/g++.dg/template/pr35240.C. */
5379 location_t saved_location
= input_location
;
5380 input_location
= DECL_SOURCE_LOCATION (t
);
5382 decl_assembler_name (t
);
5384 input_location
= saved_location
;
5389 /* Free language specific information for every operand and expression
5390 in every node of the call graph. This process operates in three stages:
5392 1- Every callgraph node and varpool node is traversed looking for
5393 decls and types embedded in them. This is a more exhaustive
5394 search than that done by find_referenced_vars, because it will
5395 also collect individual fields, decls embedded in types, etc.
5397 2- All the decls found are sent to free_lang_data_in_decl.
5399 3- All the types found are sent to free_lang_data_in_type.
5401 The ordering between decls and types is important because
5402 free_lang_data_in_decl sets assembler names, which includes
5403 mangling. So types cannot be freed up until assembler names have
5407 free_lang_data_in_cgraph (void)
5409 struct cgraph_node
*n
;
5410 struct varpool_node
*v
;
5411 struct free_lang_data_d fld
;
5416 /* Initialize sets and arrays to store referenced decls and types. */
5417 fld
.pset
= pointer_set_create ();
5418 fld
.worklist
.create (0);
5419 fld
.decls
.create (100);
5420 fld
.types
.create (100);
5422 /* Find decls and types in the body of every function in the callgraph. */
5423 FOR_EACH_FUNCTION (n
)
5424 find_decls_types_in_node (n
, &fld
);
5426 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5427 find_decls_types (p
->decl
, &fld
);
5429 /* Find decls and types in every varpool symbol. */
5430 FOR_EACH_VARIABLE (v
)
5431 find_decls_types_in_var (v
, &fld
);
5433 /* Set the assembler name on every decl found. We need to do this
5434 now because free_lang_data_in_decl will invalidate data needed
5435 for mangling. This breaks mangling on interdependent decls. */
5436 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5437 assign_assembler_name_if_neeeded (t
);
5439 /* Traverse every decl found freeing its language data. */
5440 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5441 free_lang_data_in_decl (t
);
5443 /* Traverse every type found freeing its language data. */
5444 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5445 free_lang_data_in_type (t
);
5447 pointer_set_destroy (fld
.pset
);
5448 fld
.worklist
.release ();
5449 fld
.decls
.release ();
5450 fld
.types
.release ();
5454 /* Free resources that are used by FE but are not needed once they are done. */
5457 free_lang_data (void)
5461 /* If we are the LTO frontend we have freed lang-specific data already. */
5463 || !flag_generate_lto
)
5466 /* Allocate and assign alias sets to the standard integer types
5467 while the slots are still in the way the frontends generated them. */
5468 for (i
= 0; i
< itk_none
; ++i
)
5469 if (integer_types
[i
])
5470 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5472 /* Traverse the IL resetting language specific information for
5473 operands, expressions, etc. */
5474 free_lang_data_in_cgraph ();
5476 /* Create gimple variants for common types. */
5477 ptrdiff_type_node
= integer_type_node
;
5478 fileptr_type_node
= ptr_type_node
;
5480 /* Reset some langhooks. Do not reset types_compatible_p, it may
5481 still be used indirectly via the get_alias_set langhook. */
5482 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5483 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5484 /* We do not want the default decl_assembler_name implementation,
5485 rather if we have fixed everything we want a wrapper around it
5486 asserting that all non-local symbols already got their assembler
5487 name and only produce assembler names for local symbols. Or rather
5488 make sure we never call decl_assembler_name on local symbols and
5489 devise a separate, middle-end private scheme for it. */
5491 /* Reset diagnostic machinery. */
5492 tree_diagnostics_defaults (global_dc
);
5500 const pass_data pass_data_ipa_free_lang_data
=
5502 SIMPLE_IPA_PASS
, /* type */
5503 "*free_lang_data", /* name */
5504 OPTGROUP_NONE
, /* optinfo_flags */
5505 false, /* has_gate */
5506 true, /* has_execute */
5507 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5508 0, /* properties_required */
5509 0, /* properties_provided */
5510 0, /* properties_destroyed */
5511 0, /* todo_flags_start */
5512 0, /* todo_flags_finish */
5515 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5518 pass_ipa_free_lang_data(gcc::context
*ctxt
)
5519 : simple_ipa_opt_pass(pass_data_ipa_free_lang_data
, ctxt
)
5522 /* opt_pass methods: */
5523 unsigned int execute () { return free_lang_data (); }
5525 }; // class pass_ipa_free_lang_data
5529 simple_ipa_opt_pass
*
5530 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5532 return new pass_ipa_free_lang_data (ctxt
);
5535 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5536 ATTR_NAME. Also used internally by remove_attribute(). */
5538 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5540 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5542 if (ident_len
== attr_len
)
5544 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5547 else if (ident_len
== attr_len
+ 4)
5549 /* There is the possibility that ATTR is 'text' and IDENT is
5551 const char *p
= IDENTIFIER_POINTER (ident
);
5552 if (p
[0] == '_' && p
[1] == '_'
5553 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5554 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5561 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5562 of ATTR_NAME, and LIST is not NULL_TREE. */
5564 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5568 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5570 if (ident_len
== attr_len
)
5572 if (!strcmp (attr_name
,
5573 IDENTIFIER_POINTER (get_attribute_name (list
))))
5576 /* TODO: If we made sure that attributes were stored in the
5577 canonical form without '__...__' (ie, as in 'text' as opposed
5578 to '__text__') then we could avoid the following case. */
5579 else if (ident_len
== attr_len
+ 4)
5581 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5582 if (p
[0] == '_' && p
[1] == '_'
5583 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5584 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5587 list
= TREE_CHAIN (list
);
5593 /* A variant of lookup_attribute() that can be used with an identifier
5594 as the first argument, and where the identifier can be either
5595 'text' or '__text__'.
5597 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5598 return a pointer to the attribute's list element if the attribute
5599 is part of the list, or NULL_TREE if not found. If the attribute
5600 appears more than once, this only returns the first occurrence; the
5601 TREE_CHAIN of the return value should be passed back in if further
5602 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5603 can be in the form 'text' or '__text__'. */
5605 lookup_ident_attribute (tree attr_identifier
, tree list
)
5607 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5611 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5612 == IDENTIFIER_NODE
);
5614 /* Identifiers can be compared directly for equality. */
5615 if (attr_identifier
== get_attribute_name (list
))
5618 /* If they are not equal, they may still be one in the form
5619 'text' while the other one is in the form '__text__'. TODO:
5620 If we were storing attributes in normalized 'text' form, then
5621 this could all go away and we could take full advantage of
5622 the fact that we're comparing identifiers. :-) */
5624 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5625 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5627 if (ident_len
== attr_len
+ 4)
5629 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5630 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5631 if (p
[0] == '_' && p
[1] == '_'
5632 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5633 && strncmp (q
, p
+ 2, attr_len
) == 0)
5636 else if (ident_len
+ 4 == attr_len
)
5638 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5639 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5640 if (q
[0] == '_' && q
[1] == '_'
5641 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5642 && strncmp (q
+ 2, p
, ident_len
) == 0)
5646 list
= TREE_CHAIN (list
);
5652 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5656 remove_attribute (const char *attr_name
, tree list
)
5659 size_t attr_len
= strlen (attr_name
);
5661 gcc_checking_assert (attr_name
[0] != '_');
5663 for (p
= &list
; *p
; )
5666 /* TODO: If we were storing attributes in normalized form, here
5667 we could use a simple strcmp(). */
5668 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5669 *p
= TREE_CHAIN (l
);
5671 p
= &TREE_CHAIN (l
);
5677 /* Return an attribute list that is the union of a1 and a2. */
5680 merge_attributes (tree a1
, tree a2
)
5684 /* Either one unset? Take the set one. */
5686 if ((attributes
= a1
) == 0)
5689 /* One that completely contains the other? Take it. */
5691 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5693 if (attribute_list_contained (a2
, a1
))
5697 /* Pick the longest list, and hang on the other list. */
5699 if (list_length (a1
) < list_length (a2
))
5700 attributes
= a2
, a2
= a1
;
5702 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5705 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5707 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5708 a
= lookup_ident_attribute (get_attribute_name (a2
),
5713 a1
= copy_node (a2
);
5714 TREE_CHAIN (a1
) = attributes
;
5723 /* Given types T1 and T2, merge their attributes and return
5727 merge_type_attributes (tree t1
, tree t2
)
5729 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5730 TYPE_ATTRIBUTES (t2
));
5733 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5737 merge_decl_attributes (tree olddecl
, tree newdecl
)
5739 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5740 DECL_ATTRIBUTES (newdecl
));
5743 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5745 /* Specialization of merge_decl_attributes for various Windows targets.
5747 This handles the following situation:
5749 __declspec (dllimport) int foo;
5752 The second instance of `foo' nullifies the dllimport. */
5755 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5758 int delete_dllimport_p
= 1;
5760 /* What we need to do here is remove from `old' dllimport if it doesn't
5761 appear in `new'. dllimport behaves like extern: if a declaration is
5762 marked dllimport and a definition appears later, then the object
5763 is not dllimport'd. We also remove a `new' dllimport if the old list
5764 contains dllexport: dllexport always overrides dllimport, regardless
5765 of the order of declaration. */
5766 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5767 delete_dllimport_p
= 0;
5768 else if (DECL_DLLIMPORT_P (new_tree
)
5769 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5771 DECL_DLLIMPORT_P (new_tree
) = 0;
5772 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5773 "dllimport ignored", new_tree
);
5775 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5777 /* Warn about overriding a symbol that has already been used, e.g.:
5778 extern int __attribute__ ((dllimport)) foo;
5779 int* bar () {return &foo;}
5782 if (TREE_USED (old
))
5784 warning (0, "%q+D redeclared without dllimport attribute "
5785 "after being referenced with dll linkage", new_tree
);
5786 /* If we have used a variable's address with dllimport linkage,
5787 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5788 decl may already have had TREE_CONSTANT computed.
5789 We still remove the attribute so that assembler code refers
5790 to '&foo rather than '_imp__foo'. */
5791 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5792 DECL_DLLIMPORT_P (new_tree
) = 1;
5795 /* Let an inline definition silently override the external reference,
5796 but otherwise warn about attribute inconsistency. */
5797 else if (TREE_CODE (new_tree
) == VAR_DECL
5798 || !DECL_DECLARED_INLINE_P (new_tree
))
5799 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5800 "previous dllimport ignored", new_tree
);
5803 delete_dllimport_p
= 0;
5805 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5807 if (delete_dllimport_p
)
5808 a
= remove_attribute ("dllimport", a
);
5813 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5814 struct attribute_spec.handler. */
5817 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5823 /* These attributes may apply to structure and union types being created,
5824 but otherwise should pass to the declaration involved. */
5827 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5828 | (int) ATTR_FLAG_ARRAY_NEXT
))
5830 *no_add_attrs
= true;
5831 return tree_cons (name
, args
, NULL_TREE
);
5833 if (TREE_CODE (node
) == RECORD_TYPE
5834 || TREE_CODE (node
) == UNION_TYPE
)
5836 node
= TYPE_NAME (node
);
5842 warning (OPT_Wattributes
, "%qE attribute ignored",
5844 *no_add_attrs
= true;
5849 if (TREE_CODE (node
) != FUNCTION_DECL
5850 && TREE_CODE (node
) != VAR_DECL
5851 && TREE_CODE (node
) != TYPE_DECL
)
5853 *no_add_attrs
= true;
5854 warning (OPT_Wattributes
, "%qE attribute ignored",
5859 if (TREE_CODE (node
) == TYPE_DECL
5860 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5861 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5863 *no_add_attrs
= true;
5864 warning (OPT_Wattributes
, "%qE attribute ignored",
5869 is_dllimport
= is_attribute_p ("dllimport", name
);
5871 /* Report error on dllimport ambiguities seen now before they cause
5875 /* Honor any target-specific overrides. */
5876 if (!targetm
.valid_dllimport_attribute_p (node
))
5877 *no_add_attrs
= true;
5879 else if (TREE_CODE (node
) == FUNCTION_DECL
5880 && DECL_DECLARED_INLINE_P (node
))
5882 warning (OPT_Wattributes
, "inline function %q+D declared as "
5883 " dllimport: attribute ignored", node
);
5884 *no_add_attrs
= true;
5886 /* Like MS, treat definition of dllimported variables and
5887 non-inlined functions on declaration as syntax errors. */
5888 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5890 error ("function %q+D definition is marked dllimport", node
);
5891 *no_add_attrs
= true;
5894 else if (TREE_CODE (node
) == VAR_DECL
)
5896 if (DECL_INITIAL (node
))
5898 error ("variable %q+D definition is marked dllimport",
5900 *no_add_attrs
= true;
5903 /* `extern' needn't be specified with dllimport.
5904 Specify `extern' now and hope for the best. Sigh. */
5905 DECL_EXTERNAL (node
) = 1;
5906 /* Also, implicitly give dllimport'd variables declared within
5907 a function global scope, unless declared static. */
5908 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5909 TREE_PUBLIC (node
) = 1;
5912 if (*no_add_attrs
== false)
5913 DECL_DLLIMPORT_P (node
) = 1;
5915 else if (TREE_CODE (node
) == FUNCTION_DECL
5916 && DECL_DECLARED_INLINE_P (node
)
5917 && flag_keep_inline_dllexport
)
5918 /* An exported function, even if inline, must be emitted. */
5919 DECL_EXTERNAL (node
) = 0;
5921 /* Report error if symbol is not accessible at global scope. */
5922 if (!TREE_PUBLIC (node
)
5923 && (TREE_CODE (node
) == VAR_DECL
5924 || TREE_CODE (node
) == FUNCTION_DECL
))
5926 error ("external linkage required for symbol %q+D because of "
5927 "%qE attribute", node
, name
);
5928 *no_add_attrs
= true;
5931 /* A dllexport'd entity must have default visibility so that other
5932 program units (shared libraries or the main executable) can see
5933 it. A dllimport'd entity must have default visibility so that
5934 the linker knows that undefined references within this program
5935 unit can be resolved by the dynamic linker. */
5938 if (DECL_VISIBILITY_SPECIFIED (node
)
5939 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5940 error ("%qE implies default visibility, but %qD has already "
5941 "been declared with a different visibility",
5943 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5944 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5950 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5952 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5953 of the various TYPE_QUAL values. */
5956 set_type_quals (tree type
, int type_quals
)
5958 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5959 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5960 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5961 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5964 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5967 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5969 return (TYPE_QUALS (cand
) == type_quals
5970 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5971 /* Apparently this is needed for Objective-C. */
5972 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5973 /* Check alignment. */
5974 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5975 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5976 TYPE_ATTRIBUTES (base
)));
5979 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5982 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5984 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5985 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5986 /* Apparently this is needed for Objective-C. */
5987 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5988 /* Check alignment. */
5989 && TYPE_ALIGN (cand
) == align
5990 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5991 TYPE_ATTRIBUTES (base
)));
5994 /* Return a version of the TYPE, qualified as indicated by the
5995 TYPE_QUALS, if one exists. If no qualified version exists yet,
5996 return NULL_TREE. */
5999 get_qualified_type (tree type
, int type_quals
)
6003 if (TYPE_QUALS (type
) == type_quals
)
6006 /* Search the chain of variants to see if there is already one there just
6007 like the one we need to have. If so, use that existing one. We must
6008 preserve the TYPE_NAME, since there is code that depends on this. */
6009 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6010 if (check_qualified_type (t
, type
, type_quals
))
6016 /* Like get_qualified_type, but creates the type if it does not
6017 exist. This function never returns NULL_TREE. */
6020 build_qualified_type (tree type
, int type_quals
)
6024 /* See if we already have the appropriate qualified variant. */
6025 t
= get_qualified_type (type
, type_quals
);
6027 /* If not, build it. */
6030 t
= build_variant_type_copy (type
);
6031 set_type_quals (t
, type_quals
);
6033 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6034 /* Propagate structural equality. */
6035 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6036 else if (TYPE_CANONICAL (type
) != type
)
6037 /* Build the underlying canonical type, since it is different
6039 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6042 /* T is its own canonical type. */
6043 TYPE_CANONICAL (t
) = t
;
6050 /* Create a variant of type T with alignment ALIGN. */
6053 build_aligned_type (tree type
, unsigned int align
)
6057 if (TYPE_PACKED (type
)
6058 || TYPE_ALIGN (type
) == align
)
6061 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6062 if (check_aligned_type (t
, type
, align
))
6065 t
= build_variant_type_copy (type
);
6066 TYPE_ALIGN (t
) = align
;
6071 /* Create a new distinct copy of TYPE. The new type is made its own
6072 MAIN_VARIANT. If TYPE requires structural equality checks, the
6073 resulting type requires structural equality checks; otherwise, its
6074 TYPE_CANONICAL points to itself. */
6077 build_distinct_type_copy (tree type
)
6079 tree t
= copy_node (type
);
6081 TYPE_POINTER_TO (t
) = 0;
6082 TYPE_REFERENCE_TO (t
) = 0;
6084 /* Set the canonical type either to a new equivalence class, or
6085 propagate the need for structural equality checks. */
6086 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6087 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6089 TYPE_CANONICAL (t
) = t
;
6091 /* Make it its own variant. */
6092 TYPE_MAIN_VARIANT (t
) = t
;
6093 TYPE_NEXT_VARIANT (t
) = 0;
6095 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6096 whose TREE_TYPE is not t. This can also happen in the Ada
6097 frontend when using subtypes. */
6102 /* Create a new variant of TYPE, equivalent but distinct. This is so
6103 the caller can modify it. TYPE_CANONICAL for the return type will
6104 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6105 are considered equal by the language itself (or that both types
6106 require structural equality checks). */
6109 build_variant_type_copy (tree type
)
6111 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6113 t
= build_distinct_type_copy (type
);
6115 /* Since we're building a variant, assume that it is a non-semantic
6116 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6117 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6119 /* Add the new type to the chain of variants of TYPE. */
6120 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6121 TYPE_NEXT_VARIANT (m
) = t
;
6122 TYPE_MAIN_VARIANT (t
) = m
;
6127 /* Return true if the from tree in both tree maps are equal. */
6130 tree_map_base_eq (const void *va
, const void *vb
)
6132 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6133 *const b
= (const struct tree_map_base
*) vb
;
6134 return (a
->from
== b
->from
);
6137 /* Hash a from tree in a tree_base_map. */
6140 tree_map_base_hash (const void *item
)
6142 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6145 /* Return true if this tree map structure is marked for garbage collection
6146 purposes. We simply return true if the from tree is marked, so that this
6147 structure goes away when the from tree goes away. */
6150 tree_map_base_marked_p (const void *p
)
6152 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6155 /* Hash a from tree in a tree_map. */
6158 tree_map_hash (const void *item
)
6160 return (((const struct tree_map
*) item
)->hash
);
6163 /* Hash a from tree in a tree_decl_map. */
6166 tree_decl_map_hash (const void *item
)
6168 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6171 /* Return the initialization priority for DECL. */
6174 decl_init_priority_lookup (tree decl
)
6176 struct tree_priority_map
*h
;
6177 struct tree_map_base in
;
6179 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6181 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6182 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6185 /* Return the finalization priority for DECL. */
6188 decl_fini_priority_lookup (tree decl
)
6190 struct tree_priority_map
*h
;
6191 struct tree_map_base in
;
6193 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6195 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6196 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6199 /* Return the initialization and finalization priority information for
6200 DECL. If there is no previous priority information, a freshly
6201 allocated structure is returned. */
6203 static struct tree_priority_map
*
6204 decl_priority_info (tree decl
)
6206 struct tree_priority_map in
;
6207 struct tree_priority_map
*h
;
6210 in
.base
.from
= decl
;
6211 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6212 h
= (struct tree_priority_map
*) *loc
;
6215 h
= ggc_alloc_cleared_tree_priority_map ();
6217 h
->base
.from
= decl
;
6218 h
->init
= DEFAULT_INIT_PRIORITY
;
6219 h
->fini
= DEFAULT_INIT_PRIORITY
;
6225 /* Set the initialization priority for DECL to PRIORITY. */
6228 decl_init_priority_insert (tree decl
, priority_type priority
)
6230 struct tree_priority_map
*h
;
6232 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6233 if (priority
== DEFAULT_INIT_PRIORITY
)
6235 h
= decl_priority_info (decl
);
6239 /* Set the finalization priority for DECL to PRIORITY. */
6242 decl_fini_priority_insert (tree decl
, priority_type priority
)
6244 struct tree_priority_map
*h
;
6246 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6247 if (priority
== DEFAULT_INIT_PRIORITY
)
6249 h
= decl_priority_info (decl
);
6253 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6256 print_debug_expr_statistics (void)
6258 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6259 (long) htab_size (debug_expr_for_decl
),
6260 (long) htab_elements (debug_expr_for_decl
),
6261 htab_collisions (debug_expr_for_decl
));
6264 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6267 print_value_expr_statistics (void)
6269 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6270 (long) htab_size (value_expr_for_decl
),
6271 (long) htab_elements (value_expr_for_decl
),
6272 htab_collisions (value_expr_for_decl
));
6275 /* Lookup a debug expression for FROM, and return it if we find one. */
6278 decl_debug_expr_lookup (tree from
)
6280 struct tree_decl_map
*h
, in
;
6281 in
.base
.from
= from
;
6283 h
= (struct tree_decl_map
*)
6284 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6290 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6293 decl_debug_expr_insert (tree from
, tree to
)
6295 struct tree_decl_map
*h
;
6298 h
= ggc_alloc_tree_decl_map ();
6299 h
->base
.from
= from
;
6301 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6303 *(struct tree_decl_map
**) loc
= h
;
6306 /* Lookup a value expression for FROM, and return it if we find one. */
6309 decl_value_expr_lookup (tree from
)
6311 struct tree_decl_map
*h
, in
;
6312 in
.base
.from
= from
;
6314 h
= (struct tree_decl_map
*)
6315 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6321 /* Insert a mapping FROM->TO in the value expression hashtable. */
6324 decl_value_expr_insert (tree from
, tree to
)
6326 struct tree_decl_map
*h
;
6329 h
= ggc_alloc_tree_decl_map ();
6330 h
->base
.from
= from
;
6332 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6334 *(struct tree_decl_map
**) loc
= h
;
6337 /* Lookup a vector of debug arguments for FROM, and return it if we
6341 decl_debug_args_lookup (tree from
)
6343 struct tree_vec_map
*h
, in
;
6345 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6347 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6348 in
.base
.from
= from
;
6349 h
= (struct tree_vec_map
*)
6350 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6356 /* Insert a mapping FROM->empty vector of debug arguments in the value
6357 expression hashtable. */
6360 decl_debug_args_insert (tree from
)
6362 struct tree_vec_map
*h
;
6365 if (DECL_HAS_DEBUG_ARGS_P (from
))
6366 return decl_debug_args_lookup (from
);
6367 if (debug_args_for_decl
== NULL
)
6368 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6369 tree_vec_map_eq
, 0);
6370 h
= ggc_alloc_tree_vec_map ();
6371 h
->base
.from
= from
;
6373 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6375 *(struct tree_vec_map
**) loc
= h
;
6376 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6380 /* Hashing of types so that we don't make duplicates.
6381 The entry point is `type_hash_canon'. */
6383 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6384 with types in the TREE_VALUE slots), by adding the hash codes
6385 of the individual types. */
6388 type_hash_list (const_tree list
, hashval_t hashcode
)
6392 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6393 if (TREE_VALUE (tail
) != error_mark_node
)
6394 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6400 /* These are the Hashtable callback functions. */
6402 /* Returns true iff the types are equivalent. */
6405 type_hash_eq (const void *va
, const void *vb
)
6407 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6408 *const b
= (const struct type_hash
*) vb
;
6410 /* First test the things that are the same for all types. */
6411 if (a
->hash
!= b
->hash
6412 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6413 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6414 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6415 TYPE_ATTRIBUTES (b
->type
))
6416 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6417 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6420 /* Be careful about comparing arrays before and after the element type
6421 has been completed; don't compare TYPE_ALIGN unless both types are
6423 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6424 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6425 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6428 switch (TREE_CODE (a
->type
))
6433 case REFERENCE_TYPE
:
6438 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6441 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6442 && !(TYPE_VALUES (a
->type
)
6443 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6444 && TYPE_VALUES (b
->type
)
6445 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6446 && type_list_equal (TYPE_VALUES (a
->type
),
6447 TYPE_VALUES (b
->type
))))
6450 /* ... fall through ... */
6455 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6456 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6457 TYPE_MAX_VALUE (b
->type
)))
6458 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6459 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6460 TYPE_MIN_VALUE (b
->type
))));
6462 case FIXED_POINT_TYPE
:
6463 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6466 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6469 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6470 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6471 || (TYPE_ARG_TYPES (a
->type
)
6472 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6473 && TYPE_ARG_TYPES (b
->type
)
6474 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6475 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6476 TYPE_ARG_TYPES (b
->type
)))))
6480 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6484 case QUAL_UNION_TYPE
:
6485 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6486 || (TYPE_FIELDS (a
->type
)
6487 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6488 && TYPE_FIELDS (b
->type
)
6489 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6490 && type_list_equal (TYPE_FIELDS (a
->type
),
6491 TYPE_FIELDS (b
->type
))));
6494 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6495 || (TYPE_ARG_TYPES (a
->type
)
6496 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6497 && TYPE_ARG_TYPES (b
->type
)
6498 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6499 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6500 TYPE_ARG_TYPES (b
->type
))))
6508 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6509 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6514 /* Return the cached hash value. */
6517 type_hash_hash (const void *item
)
6519 return ((const struct type_hash
*) item
)->hash
;
6522 /* Look in the type hash table for a type isomorphic to TYPE.
6523 If one is found, return it. Otherwise return 0. */
6526 type_hash_lookup (hashval_t hashcode
, tree type
)
6528 struct type_hash
*h
, in
;
6530 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6531 must call that routine before comparing TYPE_ALIGNs. */
6537 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6544 /* Add an entry to the type-hash-table
6545 for a type TYPE whose hash code is HASHCODE. */
6548 type_hash_add (hashval_t hashcode
, tree type
)
6550 struct type_hash
*h
;
6553 h
= ggc_alloc_type_hash ();
6556 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6560 /* Given TYPE, and HASHCODE its hash code, return the canonical
6561 object for an identical type if one already exists.
6562 Otherwise, return TYPE, and record it as the canonical object.
6564 To use this function, first create a type of the sort you want.
6565 Then compute its hash code from the fields of the type that
6566 make it different from other similar types.
6567 Then call this function and use the value. */
6570 type_hash_canon (unsigned int hashcode
, tree type
)
6574 /* The hash table only contains main variants, so ensure that's what we're
6576 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6578 /* See if the type is in the hash table already. If so, return it.
6579 Otherwise, add the type. */
6580 t1
= type_hash_lookup (hashcode
, type
);
6583 if (GATHER_STATISTICS
)
6585 tree_code_counts
[(int) TREE_CODE (type
)]--;
6586 tree_node_counts
[(int) t_kind
]--;
6587 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6593 type_hash_add (hashcode
, type
);
6598 /* See if the data pointed to by the type hash table is marked. We consider
6599 it marked if the type is marked or if a debug type number or symbol
6600 table entry has been made for the type. */
6603 type_hash_marked_p (const void *p
)
6605 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6607 return ggc_marked_p (type
);
6611 print_type_hash_statistics (void)
6613 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6614 (long) htab_size (type_hash_table
),
6615 (long) htab_elements (type_hash_table
),
6616 htab_collisions (type_hash_table
));
6619 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6620 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6621 by adding the hash codes of the individual attributes. */
6624 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6628 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6629 /* ??? Do we want to add in TREE_VALUE too? */
6630 hashcode
= iterative_hash_object
6631 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6635 /* Given two lists of attributes, return true if list l2 is
6636 equivalent to l1. */
6639 attribute_list_equal (const_tree l1
, const_tree l2
)
6644 return attribute_list_contained (l1
, l2
)
6645 && attribute_list_contained (l2
, l1
);
6648 /* Given two lists of attributes, return true if list L2 is
6649 completely contained within L1. */
6650 /* ??? This would be faster if attribute names were stored in a canonicalized
6651 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6652 must be used to show these elements are equivalent (which they are). */
6653 /* ??? It's not clear that attributes with arguments will always be handled
6657 attribute_list_contained (const_tree l1
, const_tree l2
)
6661 /* First check the obvious, maybe the lists are identical. */
6665 /* Maybe the lists are similar. */
6666 for (t1
= l1
, t2
= l2
;
6668 && get_attribute_name (t1
) == get_attribute_name (t2
)
6669 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6670 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6673 /* Maybe the lists are equal. */
6674 if (t1
== 0 && t2
== 0)
6677 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6680 /* This CONST_CAST is okay because lookup_attribute does not
6681 modify its argument and the return value is assigned to a
6683 for (attr
= lookup_ident_attribute (get_attribute_name (t2
), CONST_CAST_TREE(l1
));
6684 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6685 attr
= lookup_ident_attribute (get_attribute_name (t2
), TREE_CHAIN (attr
)))
6688 if (attr
== NULL_TREE
)
6695 /* Given two lists of types
6696 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6697 return 1 if the lists contain the same types in the same order.
6698 Also, the TREE_PURPOSEs must match. */
6701 type_list_equal (const_tree l1
, const_tree l2
)
6705 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6706 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6707 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6708 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6709 && (TREE_TYPE (TREE_PURPOSE (t1
))
6710 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6716 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6717 given by TYPE. If the argument list accepts variable arguments,
6718 then this function counts only the ordinary arguments. */
6721 type_num_arguments (const_tree type
)
6726 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6727 /* If the function does not take a variable number of arguments,
6728 the last element in the list will have type `void'. */
6729 if (VOID_TYPE_P (TREE_VALUE (t
)))
6737 /* Nonzero if integer constants T1 and T2
6738 represent the same constant value. */
6741 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6746 if (t1
== 0 || t2
== 0)
6749 if (TREE_CODE (t1
) == INTEGER_CST
6750 && TREE_CODE (t2
) == INTEGER_CST
6751 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6752 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6758 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6759 The precise way of comparison depends on their data type. */
6762 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6767 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6769 int t1_sgn
= tree_int_cst_sgn (t1
);
6770 int t2_sgn
= tree_int_cst_sgn (t2
);
6772 if (t1_sgn
< t2_sgn
)
6774 else if (t1_sgn
> t2_sgn
)
6776 /* Otherwise, both are non-negative, so we compare them as
6777 unsigned just in case one of them would overflow a signed
6780 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6781 return INT_CST_LT (t1
, t2
);
6783 return INT_CST_LT_UNSIGNED (t1
, t2
);
6786 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6789 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6791 if (tree_int_cst_lt (t1
, t2
))
6793 else if (tree_int_cst_lt (t2
, t1
))
6799 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6800 the host. If POS is zero, the value can be represented in a single
6801 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6802 be represented in a single unsigned HOST_WIDE_INT. */
6805 host_integerp (const_tree t
, int pos
)
6810 return (TREE_CODE (t
) == INTEGER_CST
6811 && ((TREE_INT_CST_HIGH (t
) == 0
6812 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6813 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6814 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6815 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6816 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6819 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6820 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6821 be non-negative. We must be able to satisfy the above conditions. */
6824 tree_low_cst (const_tree t
, int pos
)
6826 gcc_assert (host_integerp (t
, pos
));
6827 return TREE_INT_CST_LOW (t
);
6830 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6831 kind INTEGER_CST. This makes sure to properly sign-extend the
6835 size_low_cst (const_tree t
)
6837 double_int d
= tree_to_double_int (t
);
6838 return d
.sext (TYPE_PRECISION (TREE_TYPE (t
))).low
;
6841 /* Return the most significant (sign) bit of T. */
6844 tree_int_cst_sign_bit (const_tree t
)
6846 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6847 unsigned HOST_WIDE_INT w
;
6849 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6850 w
= TREE_INT_CST_LOW (t
);
6853 w
= TREE_INT_CST_HIGH (t
);
6854 bitno
-= HOST_BITS_PER_WIDE_INT
;
6857 return (w
>> bitno
) & 1;
6860 /* Return an indication of the sign of the integer constant T.
6861 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6862 Note that -1 will never be returned if T's type is unsigned. */
6865 tree_int_cst_sgn (const_tree t
)
6867 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6869 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6871 else if (TREE_INT_CST_HIGH (t
) < 0)
6877 /* Return the minimum number of bits needed to represent VALUE in a
6878 signed or unsigned type, UNSIGNEDP says which. */
6881 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6883 /* If the value is negative, compute its negative minus 1. The latter
6884 adjustment is because the absolute value of the largest negative value
6885 is one larger than the largest positive value. This is equivalent to
6886 a bit-wise negation, so use that operation instead. */
6888 if (tree_int_cst_sgn (value
) < 0)
6889 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6891 /* Return the number of bits needed, taking into account the fact
6892 that we need one more bit for a signed than unsigned type.
6893 If value is 0 or -1, the minimum precision is 1 no matter
6894 whether unsignedp is true or false. */
6896 if (integer_zerop (value
))
6899 return tree_floor_log2 (value
) + 1 + !unsignedp
;
6902 /* Compare two constructor-element-type constants. Return 1 if the lists
6903 are known to be equal; otherwise return 0. */
6906 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6908 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6910 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6913 l1
= TREE_CHAIN (l1
);
6914 l2
= TREE_CHAIN (l2
);
6920 /* Return truthvalue of whether T1 is the same tree structure as T2.
6921 Return 1 if they are the same.
6922 Return 0 if they are understandably different.
6923 Return -1 if either contains tree structure not understood by
6927 simple_cst_equal (const_tree t1
, const_tree t2
)
6929 enum tree_code code1
, code2
;
6935 if (t1
== 0 || t2
== 0)
6938 code1
= TREE_CODE (t1
);
6939 code2
= TREE_CODE (t2
);
6941 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6943 if (CONVERT_EXPR_CODE_P (code2
)
6944 || code2
== NON_LVALUE_EXPR
)
6945 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6947 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6950 else if (CONVERT_EXPR_CODE_P (code2
)
6951 || code2
== NON_LVALUE_EXPR
)
6952 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6960 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6961 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6964 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6967 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6970 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6971 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6972 TREE_STRING_LENGTH (t1
)));
6976 unsigned HOST_WIDE_INT idx
;
6977 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6978 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6980 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6983 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6984 /* ??? Should we handle also fields here? */
6985 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6991 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6994 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6997 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7000 const_tree arg1
, arg2
;
7001 const_call_expr_arg_iterator iter1
, iter2
;
7002 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7003 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7005 arg1
= next_const_call_expr_arg (&iter1
),
7006 arg2
= next_const_call_expr_arg (&iter2
))
7008 cmp
= simple_cst_equal (arg1
, arg2
);
7012 return arg1
== arg2
;
7016 /* Special case: if either target is an unallocated VAR_DECL,
7017 it means that it's going to be unified with whatever the
7018 TARGET_EXPR is really supposed to initialize, so treat it
7019 as being equivalent to anything. */
7020 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7021 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7022 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7023 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7024 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7025 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7028 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7033 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7035 case WITH_CLEANUP_EXPR
:
7036 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7040 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7043 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7044 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7058 /* This general rule works for most tree codes. All exceptions should be
7059 handled above. If this is a language-specific tree code, we can't
7060 trust what might be in the operand, so say we don't know
7062 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7065 switch (TREE_CODE_CLASS (code1
))
7069 case tcc_comparison
:
7070 case tcc_expression
:
7074 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7076 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7088 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7089 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7090 than U, respectively. */
7093 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7095 if (tree_int_cst_sgn (t
) < 0)
7097 else if (TREE_INT_CST_HIGH (t
) != 0)
7099 else if (TREE_INT_CST_LOW (t
) == u
)
7101 else if (TREE_INT_CST_LOW (t
) < u
)
7107 /* Return true if SIZE represents a constant size that is in bounds of
7108 what the middle-end and the backend accepts (covering not more than
7109 half of the address-space). */
7112 valid_constant_size_p (const_tree size
)
7114 if (! host_integerp (size
, 1)
7115 || TREE_OVERFLOW (size
)
7116 || tree_int_cst_sign_bit (size
) != 0)
7121 /* Return the precision of the type, or for a complex or vector type the
7122 precision of the type of its elements. */
7125 element_precision (const_tree type
)
7127 enum tree_code code
= TREE_CODE (type
);
7128 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7129 type
= TREE_TYPE (type
);
7131 return TYPE_PRECISION (type
);
7134 /* Return true if CODE represents an associative tree code. Otherwise
7137 associative_tree_code (enum tree_code code
)
7156 /* Return true if CODE represents a commutative tree code. Otherwise
7159 commutative_tree_code (enum tree_code code
)
7165 case MULT_HIGHPART_EXPR
:
7173 case UNORDERED_EXPR
:
7177 case TRUTH_AND_EXPR
:
7178 case TRUTH_XOR_EXPR
:
7180 case WIDEN_MULT_EXPR
:
7181 case VEC_WIDEN_MULT_HI_EXPR
:
7182 case VEC_WIDEN_MULT_LO_EXPR
:
7183 case VEC_WIDEN_MULT_EVEN_EXPR
:
7184 case VEC_WIDEN_MULT_ODD_EXPR
:
7193 /* Return true if CODE represents a ternary tree code for which the
7194 first two operands are commutative. Otherwise return false. */
7196 commutative_ternary_tree_code (enum tree_code code
)
7200 case WIDEN_MULT_PLUS_EXPR
:
7201 case WIDEN_MULT_MINUS_EXPR
:
7210 /* Generate a hash value for an expression. This can be used iteratively
7211 by passing a previous result as the VAL argument.
7213 This function is intended to produce the same hash for expressions which
7214 would compare equal using operand_equal_p. */
7217 iterative_hash_expr (const_tree t
, hashval_t val
)
7220 enum tree_code code
;
7224 return iterative_hash_hashval_t (0, val
);
7226 code
= TREE_CODE (t
);
7230 /* Alas, constants aren't shared, so we can't rely on pointer
7233 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
7234 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
7237 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7239 return iterative_hash_hashval_t (val2
, val
);
7243 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7245 return iterative_hash_hashval_t (val2
, val
);
7248 return iterative_hash (TREE_STRING_POINTER (t
),
7249 TREE_STRING_LENGTH (t
), val
);
7251 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7252 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7256 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7257 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7261 /* We can just compare by pointer. */
7262 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7263 case PLACEHOLDER_EXPR
:
7264 /* The node itself doesn't matter. */
7267 /* A list of expressions, for a CALL_EXPR or as the elements of a
7269 for (; t
; t
= TREE_CHAIN (t
))
7270 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7274 unsigned HOST_WIDE_INT idx
;
7276 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7278 val
= iterative_hash_expr (field
, val
);
7279 val
= iterative_hash_expr (value
, val
);
7284 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7285 Otherwise nodes that compare equal according to operand_equal_p might
7286 get different hash codes. However, don't do this for machine specific
7287 or front end builtins, since the function code is overloaded in those
7289 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7290 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7292 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7293 code
= TREE_CODE (t
);
7297 tclass
= TREE_CODE_CLASS (code
);
7299 if (tclass
== tcc_declaration
)
7301 /* DECL's have a unique ID */
7302 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7306 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7308 val
= iterative_hash_object (code
, val
);
7310 /* Don't hash the type, that can lead to having nodes which
7311 compare equal according to operand_equal_p, but which
7312 have different hash codes. */
7313 if (CONVERT_EXPR_CODE_P (code
)
7314 || code
== NON_LVALUE_EXPR
)
7316 /* Make sure to include signness in the hash computation. */
7317 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7318 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7321 else if (commutative_tree_code (code
))
7323 /* It's a commutative expression. We want to hash it the same
7324 however it appears. We do this by first hashing both operands
7325 and then rehashing based on the order of their independent
7327 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7328 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7332 t
= one
, one
= two
, two
= t
;
7334 val
= iterative_hash_hashval_t (one
, val
);
7335 val
= iterative_hash_hashval_t (two
, val
);
7338 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7339 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7345 /* Generate a hash value for a pair of expressions. This can be used
7346 iteratively by passing a previous result as the VAL argument.
7348 The same hash value is always returned for a given pair of expressions,
7349 regardless of the order in which they are presented. This is useful in
7350 hashing the operands of commutative functions. */
7353 iterative_hash_exprs_commutative (const_tree t1
,
7354 const_tree t2
, hashval_t val
)
7356 hashval_t one
= iterative_hash_expr (t1
, 0);
7357 hashval_t two
= iterative_hash_expr (t2
, 0);
7361 t
= one
, one
= two
, two
= t
;
7362 val
= iterative_hash_hashval_t (one
, val
);
7363 val
= iterative_hash_hashval_t (two
, val
);
7368 /* Constructors for pointer, array and function types.
7369 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7370 constructed by language-dependent code, not here.) */
7372 /* Construct, lay out and return the type of pointers to TO_TYPE with
7373 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7374 reference all of memory. If such a type has already been
7375 constructed, reuse it. */
7378 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7383 if (to_type
== error_mark_node
)
7384 return error_mark_node
;
7386 /* If the pointed-to type has the may_alias attribute set, force
7387 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7388 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7389 can_alias_all
= true;
7391 /* In some cases, languages will have things that aren't a POINTER_TYPE
7392 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7393 In that case, return that type without regard to the rest of our
7396 ??? This is a kludge, but consistent with the way this function has
7397 always operated and there doesn't seem to be a good way to avoid this
7399 if (TYPE_POINTER_TO (to_type
) != 0
7400 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7401 return TYPE_POINTER_TO (to_type
);
7403 /* First, if we already have a type for pointers to TO_TYPE and it's
7404 the proper mode, use it. */
7405 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7406 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7409 t
= make_node (POINTER_TYPE
);
7411 TREE_TYPE (t
) = to_type
;
7412 SET_TYPE_MODE (t
, mode
);
7413 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7414 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7415 TYPE_POINTER_TO (to_type
) = t
;
7417 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7418 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7419 else if (TYPE_CANONICAL (to_type
) != to_type
)
7421 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7422 mode
, can_alias_all
);
7424 /* Lay out the type. This function has many callers that are concerned
7425 with expression-construction, and this simplifies them all. */
7431 /* By default build pointers in ptr_mode. */
7434 build_pointer_type (tree to_type
)
7436 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7437 : TYPE_ADDR_SPACE (to_type
);
7438 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7439 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7442 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7445 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7450 if (to_type
== error_mark_node
)
7451 return error_mark_node
;
7453 /* If the pointed-to type has the may_alias attribute set, force
7454 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7455 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7456 can_alias_all
= true;
7458 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7459 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7460 In that case, return that type without regard to the rest of our
7463 ??? This is a kludge, but consistent with the way this function has
7464 always operated and there doesn't seem to be a good way to avoid this
7466 if (TYPE_REFERENCE_TO (to_type
) != 0
7467 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7468 return TYPE_REFERENCE_TO (to_type
);
7470 /* First, if we already have a type for pointers to TO_TYPE and it's
7471 the proper mode, use it. */
7472 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7473 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7476 t
= make_node (REFERENCE_TYPE
);
7478 TREE_TYPE (t
) = to_type
;
7479 SET_TYPE_MODE (t
, mode
);
7480 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7481 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7482 TYPE_REFERENCE_TO (to_type
) = t
;
7484 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7485 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7486 else if (TYPE_CANONICAL (to_type
) != to_type
)
7488 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7489 mode
, can_alias_all
);
7497 /* Build the node for the type of references-to-TO_TYPE by default
7501 build_reference_type (tree to_type
)
7503 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7504 : TYPE_ADDR_SPACE (to_type
);
7505 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7506 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7509 /* Build a type that is compatible with t but has no cv quals anywhere
7512 const char *const *const * -> char ***. */
7515 build_type_no_quals (tree t
)
7517 switch (TREE_CODE (t
))
7520 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7522 TYPE_REF_CAN_ALIAS_ALL (t
));
7523 case REFERENCE_TYPE
:
7525 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7527 TYPE_REF_CAN_ALIAS_ALL (t
));
7529 return TYPE_MAIN_VARIANT (t
);
7533 #define MAX_INT_CACHED_PREC \
7534 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7535 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7537 /* Builds a signed or unsigned integer type of precision PRECISION.
7538 Used for C bitfields whose precision does not match that of
7539 built-in target types. */
7541 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7547 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7549 if (precision
<= MAX_INT_CACHED_PREC
)
7551 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7556 itype
= make_node (INTEGER_TYPE
);
7557 TYPE_PRECISION (itype
) = precision
;
7560 fixup_unsigned_type (itype
);
7562 fixup_signed_type (itype
);
7565 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7566 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7567 if (precision
<= MAX_INT_CACHED_PREC
)
7568 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7573 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7574 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7575 is true, reuse such a type that has already been constructed. */
7578 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7580 tree itype
= make_node (INTEGER_TYPE
);
7581 hashval_t hashcode
= 0;
7583 TREE_TYPE (itype
) = type
;
7585 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7586 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7588 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7589 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7590 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7591 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7592 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7593 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7598 if ((TYPE_MIN_VALUE (itype
)
7599 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7600 || (TYPE_MAX_VALUE (itype
)
7601 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7603 /* Since we cannot reliably merge this type, we need to compare it using
7604 structural equality checks. */
7605 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7609 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7610 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7611 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7612 itype
= type_hash_canon (hashcode
, itype
);
7617 /* Wrapper around build_range_type_1 with SHARED set to true. */
7620 build_range_type (tree type
, tree lowval
, tree highval
)
7622 return build_range_type_1 (type
, lowval
, highval
, true);
7625 /* Wrapper around build_range_type_1 with SHARED set to false. */
7628 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7630 return build_range_type_1 (type
, lowval
, highval
, false);
7633 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7634 MAXVAL should be the maximum value in the domain
7635 (one less than the length of the array).
7637 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7638 We don't enforce this limit, that is up to caller (e.g. language front end).
7639 The limit exists because the result is a signed type and we don't handle
7640 sizes that use more than one HOST_WIDE_INT. */
7643 build_index_type (tree maxval
)
7645 return build_range_type (sizetype
, size_zero_node
, maxval
);
7648 /* Return true if the debug information for TYPE, a subtype, should be emitted
7649 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7650 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7651 debug info and doesn't reflect the source code. */
7654 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7656 tree base_type
= TREE_TYPE (type
), low
, high
;
7658 /* Subrange types have a base type which is an integral type. */
7659 if (!INTEGRAL_TYPE_P (base_type
))
7662 /* Get the real bounds of the subtype. */
7663 if (lang_hooks
.types
.get_subrange_bounds
)
7664 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7667 low
= TYPE_MIN_VALUE (type
);
7668 high
= TYPE_MAX_VALUE (type
);
7671 /* If the type and its base type have the same representation and the same
7672 name, then the type is not a subrange but a copy of the base type. */
7673 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7674 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7675 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7676 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7677 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7679 tree type_name
= TYPE_NAME (type
);
7680 tree base_type_name
= TYPE_NAME (base_type
);
7682 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7683 type_name
= DECL_NAME (type_name
);
7685 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7686 base_type_name
= DECL_NAME (base_type_name
);
7688 if (type_name
== base_type_name
)
7699 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7700 and number of elements specified by the range of values of INDEX_TYPE.
7701 If SHARED is true, reuse such a type that has already been constructed. */
7704 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7708 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7710 error ("arrays of functions are not meaningful");
7711 elt_type
= integer_type_node
;
7714 t
= make_node (ARRAY_TYPE
);
7715 TREE_TYPE (t
) = elt_type
;
7716 TYPE_DOMAIN (t
) = index_type
;
7717 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7720 /* If the element type is incomplete at this point we get marked for
7721 structural equality. Do not record these types in the canonical
7723 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7728 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7730 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7731 t
= type_hash_canon (hashcode
, t
);
7734 if (TYPE_CANONICAL (t
) == t
)
7736 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7737 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7738 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7739 else if (TYPE_CANONICAL (elt_type
) != elt_type
7740 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7742 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7744 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7751 /* Wrapper around build_array_type_1 with SHARED set to true. */
7754 build_array_type (tree elt_type
, tree index_type
)
7756 return build_array_type_1 (elt_type
, index_type
, true);
7759 /* Wrapper around build_array_type_1 with SHARED set to false. */
7762 build_nonshared_array_type (tree elt_type
, tree index_type
)
7764 return build_array_type_1 (elt_type
, index_type
, false);
7767 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7771 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7773 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7776 /* Recursively examines the array elements of TYPE, until a non-array
7777 element type is found. */
7780 strip_array_types (tree type
)
7782 while (TREE_CODE (type
) == ARRAY_TYPE
)
7783 type
= TREE_TYPE (type
);
7788 /* Computes the canonical argument types from the argument type list
7791 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7792 on entry to this function, or if any of the ARGTYPES are
7795 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7796 true on entry to this function, or if any of the ARGTYPES are
7799 Returns a canonical argument list, which may be ARGTYPES when the
7800 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7801 true) or would not differ from ARGTYPES. */
7804 maybe_canonicalize_argtypes(tree argtypes
,
7805 bool *any_structural_p
,
7806 bool *any_noncanonical_p
)
7809 bool any_noncanonical_argtypes_p
= false;
7811 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7813 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7814 /* Fail gracefully by stating that the type is structural. */
7815 *any_structural_p
= true;
7816 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7817 *any_structural_p
= true;
7818 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7819 || TREE_PURPOSE (arg
))
7820 /* If the argument has a default argument, we consider it
7821 non-canonical even though the type itself is canonical.
7822 That way, different variants of function and method types
7823 with default arguments will all point to the variant with
7824 no defaults as their canonical type. */
7825 any_noncanonical_argtypes_p
= true;
7828 if (*any_structural_p
)
7831 if (any_noncanonical_argtypes_p
)
7833 /* Build the canonical list of argument types. */
7834 tree canon_argtypes
= NULL_TREE
;
7835 bool is_void
= false;
7837 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7839 if (arg
== void_list_node
)
7842 canon_argtypes
= tree_cons (NULL_TREE
,
7843 TYPE_CANONICAL (TREE_VALUE (arg
)),
7847 canon_argtypes
= nreverse (canon_argtypes
);
7849 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7851 /* There is a non-canonical type. */
7852 *any_noncanonical_p
= true;
7853 return canon_argtypes
;
7856 /* The canonical argument types are the same as ARGTYPES. */
7860 /* Construct, lay out and return
7861 the type of functions returning type VALUE_TYPE
7862 given arguments of types ARG_TYPES.
7863 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7864 are data type nodes for the arguments of the function.
7865 If such a type has already been constructed, reuse it. */
7868 build_function_type (tree value_type
, tree arg_types
)
7871 hashval_t hashcode
= 0;
7872 bool any_structural_p
, any_noncanonical_p
;
7873 tree canon_argtypes
;
7875 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7877 error ("function return type cannot be function");
7878 value_type
= integer_type_node
;
7881 /* Make a node of the sort we want. */
7882 t
= make_node (FUNCTION_TYPE
);
7883 TREE_TYPE (t
) = value_type
;
7884 TYPE_ARG_TYPES (t
) = arg_types
;
7886 /* If we already have such a type, use the old one. */
7887 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7888 hashcode
= type_hash_list (arg_types
, hashcode
);
7889 t
= type_hash_canon (hashcode
, t
);
7891 /* Set up the canonical type. */
7892 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7893 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7894 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7896 &any_noncanonical_p
);
7897 if (any_structural_p
)
7898 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7899 else if (any_noncanonical_p
)
7900 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7903 if (!COMPLETE_TYPE_P (t
))
7908 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7909 return value if SKIP_RETURN is true. */
7912 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7915 tree new_type
= NULL
;
7916 tree args
, new_args
= NULL
, t
;
7920 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7921 args
= TREE_CHAIN (args
), i
++)
7922 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7923 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7925 new_reversed
= nreverse (new_args
);
7929 TREE_CHAIN (new_args
) = void_list_node
;
7931 new_reversed
= void_list_node
;
7934 /* Use copy_node to preserve as much as possible from original type
7935 (debug info, attribute lists etc.)
7936 Exception is METHOD_TYPEs must have THIS argument.
7937 When we are asked to remove it, we need to build new FUNCTION_TYPE
7939 if (TREE_CODE (orig_type
) != METHOD_TYPE
7941 || !bitmap_bit_p (args_to_skip
, 0))
7943 new_type
= build_distinct_type_copy (orig_type
);
7944 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7949 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7951 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7955 TREE_TYPE (new_type
) = void_type_node
;
7957 /* This is a new type, not a copy of an old type. Need to reassociate
7958 variants. We can handle everything except the main variant lazily. */
7959 t
= TYPE_MAIN_VARIANT (orig_type
);
7962 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7963 TYPE_MAIN_VARIANT (new_type
) = t
;
7964 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7965 TYPE_NEXT_VARIANT (t
) = new_type
;
7969 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7970 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7976 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7977 return value if SKIP_RETURN is true.
7979 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7980 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7981 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7984 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7987 tree new_decl
= copy_node (orig_decl
);
7990 new_type
= TREE_TYPE (orig_decl
);
7991 if (prototype_p (new_type
)
7992 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7994 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7995 TREE_TYPE (new_decl
) = new_type
;
7997 /* For declarations setting DECL_VINDEX (i.e. methods)
7998 we expect first argument to be THIS pointer. */
7999 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
8000 DECL_VINDEX (new_decl
) = NULL_TREE
;
8002 /* When signature changes, we need to clear builtin info. */
8003 if (DECL_BUILT_IN (new_decl
)
8005 && !bitmap_empty_p (args_to_skip
))
8007 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
8008 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
8013 /* Build a function type. The RETURN_TYPE is the type returned by the
8014 function. If VAARGS is set, no void_type_node is appended to the
8015 the list. ARGP must be always be terminated be a NULL_TREE. */
8018 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8022 t
= va_arg (argp
, tree
);
8023 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8024 args
= tree_cons (NULL_TREE
, t
, args
);
8029 if (args
!= NULL_TREE
)
8030 args
= nreverse (args
);
8031 gcc_assert (last
!= void_list_node
);
8033 else if (args
== NULL_TREE
)
8034 args
= void_list_node
;
8038 args
= nreverse (args
);
8039 TREE_CHAIN (last
) = void_list_node
;
8041 args
= build_function_type (return_type
, args
);
8046 /* Build a function type. The RETURN_TYPE is the type returned by the
8047 function. If additional arguments are provided, they are
8048 additional argument types. The list of argument types must always
8049 be terminated by NULL_TREE. */
8052 build_function_type_list (tree return_type
, ...)
8057 va_start (p
, return_type
);
8058 args
= build_function_type_list_1 (false, return_type
, p
);
8063 /* Build a variable argument function type. The RETURN_TYPE is the
8064 type returned by the function. If additional arguments are provided,
8065 they are additional argument types. The list of argument types must
8066 always be terminated by NULL_TREE. */
8069 build_varargs_function_type_list (tree return_type
, ...)
8074 va_start (p
, return_type
);
8075 args
= build_function_type_list_1 (true, return_type
, p
);
8081 /* Build a function type. RETURN_TYPE is the type returned by the
8082 function; VAARGS indicates whether the function takes varargs. The
8083 function takes N named arguments, the types of which are provided in
8087 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8091 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8093 for (i
= n
- 1; i
>= 0; i
--)
8094 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8096 return build_function_type (return_type
, t
);
8099 /* Build a function type. RETURN_TYPE is the type returned by the
8100 function. The function takes N named arguments, the types of which
8101 are provided in ARG_TYPES. */
8104 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8106 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8109 /* Build a variable argument function type. RETURN_TYPE is the type
8110 returned by the function. The function takes N named arguments, the
8111 types of which are provided in ARG_TYPES. */
8114 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8116 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8119 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8120 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8121 for the method. An implicit additional parameter (of type
8122 pointer-to-BASETYPE) is added to the ARGTYPES. */
8125 build_method_type_directly (tree basetype
,
8132 bool any_structural_p
, any_noncanonical_p
;
8133 tree canon_argtypes
;
8135 /* Make a node of the sort we want. */
8136 t
= make_node (METHOD_TYPE
);
8138 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8139 TREE_TYPE (t
) = rettype
;
8140 ptype
= build_pointer_type (basetype
);
8142 /* The actual arglist for this function includes a "hidden" argument
8143 which is "this". Put it into the list of argument types. */
8144 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8145 TYPE_ARG_TYPES (t
) = argtypes
;
8147 /* If we already have such a type, use the old one. */
8148 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8149 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8150 hashcode
= type_hash_list (argtypes
, hashcode
);
8151 t
= type_hash_canon (hashcode
, t
);
8153 /* Set up the canonical type. */
8155 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8156 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8158 = (TYPE_CANONICAL (basetype
) != basetype
8159 || TYPE_CANONICAL (rettype
) != rettype
);
8160 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8162 &any_noncanonical_p
);
8163 if (any_structural_p
)
8164 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8165 else if (any_noncanonical_p
)
8167 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8168 TYPE_CANONICAL (rettype
),
8170 if (!COMPLETE_TYPE_P (t
))
8176 /* Construct, lay out and return the type of methods belonging to class
8177 BASETYPE and whose arguments and values are described by TYPE.
8178 If that type exists already, reuse it.
8179 TYPE must be a FUNCTION_TYPE node. */
8182 build_method_type (tree basetype
, tree type
)
8184 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8186 return build_method_type_directly (basetype
,
8188 TYPE_ARG_TYPES (type
));
8191 /* Construct, lay out and return the type of offsets to a value
8192 of type TYPE, within an object of type BASETYPE.
8193 If a suitable offset type exists already, reuse it. */
8196 build_offset_type (tree basetype
, tree type
)
8199 hashval_t hashcode
= 0;
8201 /* Make a node of the sort we want. */
8202 t
= make_node (OFFSET_TYPE
);
8204 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8205 TREE_TYPE (t
) = type
;
8207 /* If we already have such a type, use the old one. */
8208 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8209 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8210 t
= type_hash_canon (hashcode
, t
);
8212 if (!COMPLETE_TYPE_P (t
))
8215 if (TYPE_CANONICAL (t
) == t
)
8217 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8218 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8219 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8220 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8221 || TYPE_CANONICAL (type
) != type
)
8223 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8224 TYPE_CANONICAL (type
));
8230 /* Create a complex type whose components are COMPONENT_TYPE. */
8233 build_complex_type (tree component_type
)
8238 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8239 || SCALAR_FLOAT_TYPE_P (component_type
)
8240 || FIXED_POINT_TYPE_P (component_type
));
8242 /* Make a node of the sort we want. */
8243 t
= make_node (COMPLEX_TYPE
);
8245 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8247 /* If we already have such a type, use the old one. */
8248 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8249 t
= type_hash_canon (hashcode
, t
);
8251 if (!COMPLETE_TYPE_P (t
))
8254 if (TYPE_CANONICAL (t
) == t
)
8256 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8257 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8258 else if (TYPE_CANONICAL (component_type
) != component_type
)
8260 = build_complex_type (TYPE_CANONICAL (component_type
));
8263 /* We need to create a name, since complex is a fundamental type. */
8264 if (! TYPE_NAME (t
))
8267 if (component_type
== char_type_node
)
8268 name
= "complex char";
8269 else if (component_type
== signed_char_type_node
)
8270 name
= "complex signed char";
8271 else if (component_type
== unsigned_char_type_node
)
8272 name
= "complex unsigned char";
8273 else if (component_type
== short_integer_type_node
)
8274 name
= "complex short int";
8275 else if (component_type
== short_unsigned_type_node
)
8276 name
= "complex short unsigned int";
8277 else if (component_type
== integer_type_node
)
8278 name
= "complex int";
8279 else if (component_type
== unsigned_type_node
)
8280 name
= "complex unsigned int";
8281 else if (component_type
== long_integer_type_node
)
8282 name
= "complex long int";
8283 else if (component_type
== long_unsigned_type_node
)
8284 name
= "complex long unsigned int";
8285 else if (component_type
== long_long_integer_type_node
)
8286 name
= "complex long long int";
8287 else if (component_type
== long_long_unsigned_type_node
)
8288 name
= "complex long long unsigned int";
8293 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8294 get_identifier (name
), t
);
8297 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8300 /* If TYPE is a real or complex floating-point type and the target
8301 does not directly support arithmetic on TYPE then return the wider
8302 type to be used for arithmetic on TYPE. Otherwise, return
8306 excess_precision_type (tree type
)
8308 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8310 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8311 switch (TREE_CODE (type
))
8314 switch (flt_eval_method
)
8317 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8318 return double_type_node
;
8321 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8322 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8323 return long_double_type_node
;
8330 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8332 switch (flt_eval_method
)
8335 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8336 return complex_double_type_node
;
8339 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8340 || (TYPE_MODE (TREE_TYPE (type
))
8341 == TYPE_MODE (double_type_node
)))
8342 return complex_long_double_type_node
;
8355 /* Return OP, stripped of any conversions to wider types as much as is safe.
8356 Converting the value back to OP's type makes a value equivalent to OP.
8358 If FOR_TYPE is nonzero, we return a value which, if converted to
8359 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8361 OP must have integer, real or enumeral type. Pointers are not allowed!
8363 There are some cases where the obvious value we could return
8364 would regenerate to OP if converted to OP's type,
8365 but would not extend like OP to wider types.
8366 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8367 For example, if OP is (unsigned short)(signed char)-1,
8368 we avoid returning (signed char)-1 if FOR_TYPE is int,
8369 even though extending that to an unsigned short would regenerate OP,
8370 since the result of extending (signed char)-1 to (int)
8371 is different from (int) OP. */
8374 get_unwidened (tree op
, tree for_type
)
8376 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8377 tree type
= TREE_TYPE (op
);
8379 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8381 = (for_type
!= 0 && for_type
!= type
8382 && final_prec
> TYPE_PRECISION (type
)
8383 && TYPE_UNSIGNED (type
));
8386 while (CONVERT_EXPR_P (op
))
8390 /* TYPE_PRECISION on vector types has different meaning
8391 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8392 so avoid them here. */
8393 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8396 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8397 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8399 /* Truncations are many-one so cannot be removed.
8400 Unless we are later going to truncate down even farther. */
8402 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8405 /* See what's inside this conversion. If we decide to strip it,
8407 op
= TREE_OPERAND (op
, 0);
8409 /* If we have not stripped any zero-extensions (uns is 0),
8410 we can strip any kind of extension.
8411 If we have previously stripped a zero-extension,
8412 only zero-extensions can safely be stripped.
8413 Any extension can be stripped if the bits it would produce
8414 are all going to be discarded later by truncating to FOR_TYPE. */
8418 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8420 /* TYPE_UNSIGNED says whether this is a zero-extension.
8421 Let's avoid computing it if it does not affect WIN
8422 and if UNS will not be needed again. */
8424 || CONVERT_EXPR_P (op
))
8425 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8433 /* If we finally reach a constant see if it fits in for_type and
8434 in that case convert it. */
8436 && TREE_CODE (win
) == INTEGER_CST
8437 && TREE_TYPE (win
) != for_type
8438 && int_fits_type_p (win
, for_type
))
8439 win
= fold_convert (for_type
, win
);
8444 /* Return OP or a simpler expression for a narrower value
8445 which can be sign-extended or zero-extended to give back OP.
8446 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8447 or 0 if the value should be sign-extended. */
8450 get_narrower (tree op
, int *unsignedp_ptr
)
8455 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8457 while (TREE_CODE (op
) == NOP_EXPR
)
8460 = (TYPE_PRECISION (TREE_TYPE (op
))
8461 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8463 /* Truncations are many-one so cannot be removed. */
8467 /* See what's inside this conversion. If we decide to strip it,
8472 op
= TREE_OPERAND (op
, 0);
8473 /* An extension: the outermost one can be stripped,
8474 but remember whether it is zero or sign extension. */
8476 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8477 /* Otherwise, if a sign extension has been stripped,
8478 only sign extensions can now be stripped;
8479 if a zero extension has been stripped, only zero-extensions. */
8480 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8484 else /* bitschange == 0 */
8486 /* A change in nominal type can always be stripped, but we must
8487 preserve the unsignedness. */
8489 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8491 op
= TREE_OPERAND (op
, 0);
8492 /* Keep trying to narrow, but don't assign op to win if it
8493 would turn an integral type into something else. */
8494 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8501 if (TREE_CODE (op
) == COMPONENT_REF
8502 /* Since type_for_size always gives an integer type. */
8503 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8504 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8505 /* Ensure field is laid out already. */
8506 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8507 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8509 unsigned HOST_WIDE_INT innerprec
8510 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8511 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8512 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8513 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8515 /* We can get this structure field in a narrower type that fits it,
8516 but the resulting extension to its nominal type (a fullword type)
8517 must satisfy the same conditions as for other extensions.
8519 Do this only for fields that are aligned (not bit-fields),
8520 because when bit-field insns will be used there is no
8521 advantage in doing this. */
8523 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8524 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8525 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8529 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8530 win
= fold_convert (type
, op
);
8534 *unsignedp_ptr
= uns
;
8538 /* Returns true if integer constant C has a value that is permissible
8539 for type TYPE (an INTEGER_TYPE). */
8542 int_fits_type_p (const_tree c
, const_tree type
)
8544 tree type_low_bound
, type_high_bound
;
8545 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8548 dc
= tree_to_double_int (c
);
8549 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8552 type_low_bound
= TYPE_MIN_VALUE (type
);
8553 type_high_bound
= TYPE_MAX_VALUE (type
);
8555 /* If at least one bound of the type is a constant integer, we can check
8556 ourselves and maybe make a decision. If no such decision is possible, but
8557 this type is a subtype, try checking against that. Otherwise, use
8558 double_int_fits_to_tree_p, which checks against the precision.
8560 Compute the status for each possibly constant bound, and return if we see
8561 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8562 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8563 for "constant known to fit". */
8565 /* Check if c >= type_low_bound. */
8566 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8568 dd
= tree_to_double_int (type_low_bound
);
8569 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8571 int c_neg
= (!unsc
&& dc
.is_negative ());
8572 int t_neg
= (unsc
&& dd
.is_negative ());
8574 if (c_neg
&& !t_neg
)
8576 if ((c_neg
|| !t_neg
) && dc
.ult (dd
))
8579 else if (dc
.cmp (dd
, unsc
) < 0)
8581 ok_for_low_bound
= true;
8584 ok_for_low_bound
= false;
8586 /* Check if c <= type_high_bound. */
8587 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8589 dd
= tree_to_double_int (type_high_bound
);
8590 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8592 int c_neg
= (!unsc
&& dc
.is_negative ());
8593 int t_neg
= (unsc
&& dd
.is_negative ());
8595 if (t_neg
&& !c_neg
)
8597 if ((t_neg
|| !c_neg
) && dc
.ugt (dd
))
8600 else if (dc
.cmp (dd
, unsc
) > 0)
8602 ok_for_high_bound
= true;
8605 ok_for_high_bound
= false;
8607 /* If the constant fits both bounds, the result is known. */
8608 if (ok_for_low_bound
&& ok_for_high_bound
)
8611 /* Perform some generic filtering which may allow making a decision
8612 even if the bounds are not constant. First, negative integers
8613 never fit in unsigned types, */
8614 if (TYPE_UNSIGNED (type
) && !unsc
&& dc
.is_negative ())
8617 /* Second, narrower types always fit in wider ones. */
8618 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8621 /* Third, unsigned integers with top bit set never fit signed types. */
8622 if (! TYPE_UNSIGNED (type
) && unsc
)
8624 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8625 if (prec
< HOST_BITS_PER_WIDE_INT
)
8627 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8630 else if (((((unsigned HOST_WIDE_INT
) 1)
8631 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8635 /* If we haven't been able to decide at this point, there nothing more we
8636 can check ourselves here. Look at the base type if we have one and it
8637 has the same precision. */
8638 if (TREE_CODE (type
) == INTEGER_TYPE
8639 && TREE_TYPE (type
) != 0
8640 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8642 type
= TREE_TYPE (type
);
8646 /* Or to double_int_fits_to_tree_p, if nothing else. */
8647 return double_int_fits_to_tree_p (type
, dc
);
8650 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8651 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8652 represented (assuming two's-complement arithmetic) within the bit
8653 precision of the type are returned instead. */
8656 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8658 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8659 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8660 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8661 TYPE_UNSIGNED (type
));
8664 if (TYPE_UNSIGNED (type
))
8665 mpz_set_ui (min
, 0);
8669 mn
= double_int::mask (TYPE_PRECISION (type
) - 1);
8670 mn
= (mn
+ double_int_one
).sext (TYPE_PRECISION (type
));
8671 mpz_set_double_int (min
, mn
, false);
8675 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8676 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8677 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8678 TYPE_UNSIGNED (type
));
8681 if (TYPE_UNSIGNED (type
))
8682 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
)),
8685 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
) - 1),
8690 /* Return true if VAR is an automatic variable defined in function FN. */
8693 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8695 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8696 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8697 || TREE_CODE (var
) == PARM_DECL
)
8698 && ! TREE_STATIC (var
))
8699 || TREE_CODE (var
) == LABEL_DECL
8700 || TREE_CODE (var
) == RESULT_DECL
));
8703 /* Subprogram of following function. Called by walk_tree.
8705 Return *TP if it is an automatic variable or parameter of the
8706 function passed in as DATA. */
8709 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8711 tree fn
= (tree
) data
;
8716 else if (DECL_P (*tp
)
8717 && auto_var_in_fn_p (*tp
, fn
))
8723 /* Returns true if T is, contains, or refers to a type with variable
8724 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8725 arguments, but not the return type. If FN is nonzero, only return
8726 true if a modifier of the type or position of FN is a variable or
8727 parameter inside FN.
8729 This concept is more general than that of C99 'variably modified types':
8730 in C99, a struct type is never variably modified because a VLA may not
8731 appear as a structure member. However, in GNU C code like:
8733 struct S { int i[f()]; };
8735 is valid, and other languages may define similar constructs. */
8738 variably_modified_type_p (tree type
, tree fn
)
8742 /* Test if T is either variable (if FN is zero) or an expression containing
8743 a variable in FN. If TYPE isn't gimplified, return true also if
8744 gimplify_one_sizepos would gimplify the expression into a local
8746 #define RETURN_TRUE_IF_VAR(T) \
8747 do { tree _t = (T); \
8748 if (_t != NULL_TREE \
8749 && _t != error_mark_node \
8750 && TREE_CODE (_t) != INTEGER_CST \
8751 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8753 || (!TYPE_SIZES_GIMPLIFIED (type) \
8754 && !is_gimple_sizepos (_t)) \
8755 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8756 return true; } while (0)
8758 if (type
== error_mark_node
)
8761 /* If TYPE itself has variable size, it is variably modified. */
8762 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8763 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8765 switch (TREE_CODE (type
))
8768 case REFERENCE_TYPE
:
8770 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8776 /* If TYPE is a function type, it is variably modified if the
8777 return type is variably modified. */
8778 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8784 case FIXED_POINT_TYPE
:
8787 /* Scalar types are variably modified if their end points
8789 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8790 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8795 case QUAL_UNION_TYPE
:
8796 /* We can't see if any of the fields are variably-modified by the
8797 definition we normally use, since that would produce infinite
8798 recursion via pointers. */
8799 /* This is variably modified if some field's type is. */
8800 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8801 if (TREE_CODE (t
) == FIELD_DECL
)
8803 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8804 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8805 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8807 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8808 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8813 /* Do not call ourselves to avoid infinite recursion. This is
8814 variably modified if the element type is. */
8815 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8816 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8823 /* The current language may have other cases to check, but in general,
8824 all other types are not variably modified. */
8825 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8827 #undef RETURN_TRUE_IF_VAR
8830 /* Given a DECL or TYPE, return the scope in which it was declared, or
8831 NULL_TREE if there is no containing scope. */
8834 get_containing_scope (const_tree t
)
8836 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8839 /* Return the innermost context enclosing DECL that is
8840 a FUNCTION_DECL, or zero if none. */
8843 decl_function_context (const_tree decl
)
8847 if (TREE_CODE (decl
) == ERROR_MARK
)
8850 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8851 where we look up the function at runtime. Such functions always take
8852 a first argument of type 'pointer to real context'.
8854 C++ should really be fixed to use DECL_CONTEXT for the real context,
8855 and use something else for the "virtual context". */
8856 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8859 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8861 context
= DECL_CONTEXT (decl
);
8863 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8865 if (TREE_CODE (context
) == BLOCK
)
8866 context
= BLOCK_SUPERCONTEXT (context
);
8868 context
= get_containing_scope (context
);
8874 /* Return the innermost context enclosing DECL that is
8875 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8876 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8879 decl_type_context (const_tree decl
)
8881 tree context
= DECL_CONTEXT (decl
);
8884 switch (TREE_CODE (context
))
8886 case NAMESPACE_DECL
:
8887 case TRANSLATION_UNIT_DECL
:
8892 case QUAL_UNION_TYPE
:
8897 context
= DECL_CONTEXT (context
);
8901 context
= BLOCK_SUPERCONTEXT (context
);
8911 /* CALL is a CALL_EXPR. Return the declaration for the function
8912 called, or NULL_TREE if the called function cannot be
8916 get_callee_fndecl (const_tree call
)
8920 if (call
== error_mark_node
)
8921 return error_mark_node
;
8923 /* It's invalid to call this function with anything but a
8925 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8927 /* The first operand to the CALL is the address of the function
8929 addr
= CALL_EXPR_FN (call
);
8933 /* If this is a readonly function pointer, extract its initial value. */
8934 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8935 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8936 && DECL_INITIAL (addr
))
8937 addr
= DECL_INITIAL (addr
);
8939 /* If the address is just `&f' for some function `f', then we know
8940 that `f' is being called. */
8941 if (TREE_CODE (addr
) == ADDR_EXPR
8942 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8943 return TREE_OPERAND (addr
, 0);
8945 /* We couldn't figure out what was being called. */
8949 /* Print debugging information about tree nodes generated during the compile,
8950 and any language-specific information. */
8953 dump_tree_statistics (void)
8955 if (GATHER_STATISTICS
)
8958 int total_nodes
, total_bytes
;
8959 fprintf (stderr
, "Kind Nodes Bytes\n");
8960 fprintf (stderr
, "---------------------------------------\n");
8961 total_nodes
= total_bytes
= 0;
8962 for (i
= 0; i
< (int) all_kinds
; i
++)
8964 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8965 tree_node_counts
[i
], tree_node_sizes
[i
]);
8966 total_nodes
+= tree_node_counts
[i
];
8967 total_bytes
+= tree_node_sizes
[i
];
8969 fprintf (stderr
, "---------------------------------------\n");
8970 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8971 fprintf (stderr
, "---------------------------------------\n");
8972 fprintf (stderr
, "Code Nodes\n");
8973 fprintf (stderr
, "----------------------------\n");
8974 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8975 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8976 fprintf (stderr
, "----------------------------\n");
8977 ssanames_print_statistics ();
8978 phinodes_print_statistics ();
8981 fprintf (stderr
, "(No per-node statistics)\n");
8983 print_type_hash_statistics ();
8984 print_debug_expr_statistics ();
8985 print_value_expr_statistics ();
8986 lang_hooks
.print_statistics ();
8989 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8991 /* Generate a crc32 of a byte. */
8994 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8998 for (ix
= bits
; ix
--; value
<<= 1)
9002 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9009 /* Generate a crc32 of a 32-bit unsigned. */
9012 crc32_unsigned (unsigned chksum
, unsigned value
)
9014 return crc32_unsigned_bits (chksum
, value
, 32);
9017 /* Generate a crc32 of a byte. */
9020 crc32_byte (unsigned chksum
, char byte
)
9022 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9025 /* Generate a crc32 of a string. */
9028 crc32_string (unsigned chksum
, const char *string
)
9032 chksum
= crc32_byte (chksum
, *string
);
9038 /* P is a string that will be used in a symbol. Mask out any characters
9039 that are not valid in that context. */
9042 clean_symbol_name (char *p
)
9046 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9049 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9056 /* Generate a name for a special-purpose function.
9057 The generated name may need to be unique across the whole link.
9058 Changes to this function may also require corresponding changes to
9059 xstrdup_mask_random.
9060 TYPE is some string to identify the purpose of this function to the
9061 linker or collect2; it must start with an uppercase letter,
9063 I - for constructors
9065 N - for C++ anonymous namespaces
9066 F - for DWARF unwind frame information. */
9069 get_file_function_name (const char *type
)
9075 /* If we already have a name we know to be unique, just use that. */
9076 if (first_global_object_name
)
9077 p
= q
= ASTRDUP (first_global_object_name
);
9078 /* If the target is handling the constructors/destructors, they
9079 will be local to this file and the name is only necessary for
9081 We also assign sub_I and sub_D sufixes to constructors called from
9082 the global static constructors. These are always local. */
9083 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9084 || (strncmp (type
, "sub_", 4) == 0
9085 && (type
[4] == 'I' || type
[4] == 'D')))
9087 const char *file
= main_input_filename
;
9089 file
= input_filename
;
9090 /* Just use the file's basename, because the full pathname
9091 might be quite long. */
9092 p
= q
= ASTRDUP (lbasename (file
));
9096 /* Otherwise, the name must be unique across the entire link.
9097 We don't have anything that we know to be unique to this translation
9098 unit, so use what we do have and throw in some randomness. */
9100 const char *name
= weak_global_object_name
;
9101 const char *file
= main_input_filename
;
9106 file
= input_filename
;
9108 len
= strlen (file
);
9109 q
= (char *) alloca (9 + 17 + len
+ 1);
9110 memcpy (q
, file
, len
+ 1);
9112 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9113 crc32_string (0, name
), get_random_seed (false));
9118 clean_symbol_name (q
);
9119 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9122 /* Set up the name of the file-level functions we may need.
9123 Use a global object (which is already required to be unique over
9124 the program) rather than the file name (which imposes extra
9126 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9128 return get_identifier (buf
);
9131 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9133 /* Complain that the tree code of NODE does not match the expected 0
9134 terminated list of trailing codes. The trailing code list can be
9135 empty, for a more vague error message. FILE, LINE, and FUNCTION
9136 are of the caller. */
9139 tree_check_failed (const_tree node
, const char *file
,
9140 int line
, const char *function
, ...)
9144 unsigned length
= 0;
9147 va_start (args
, function
);
9148 while ((code
= va_arg (args
, int)))
9149 length
+= 4 + strlen (tree_code_name
[code
]);
9154 va_start (args
, function
);
9155 length
+= strlen ("expected ");
9156 buffer
= tmp
= (char *) alloca (length
);
9158 while ((code
= va_arg (args
, int)))
9160 const char *prefix
= length
? " or " : "expected ";
9162 strcpy (tmp
+ length
, prefix
);
9163 length
+= strlen (prefix
);
9164 strcpy (tmp
+ length
, tree_code_name
[code
]);
9165 length
+= strlen (tree_code_name
[code
]);
9170 buffer
= "unexpected node";
9172 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9173 buffer
, tree_code_name
[TREE_CODE (node
)],
9174 function
, trim_filename (file
), line
);
9177 /* Complain that the tree code of NODE does match the expected 0
9178 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9182 tree_not_check_failed (const_tree node
, const char *file
,
9183 int line
, const char *function
, ...)
9187 unsigned length
= 0;
9190 va_start (args
, function
);
9191 while ((code
= va_arg (args
, int)))
9192 length
+= 4 + strlen (tree_code_name
[code
]);
9194 va_start (args
, function
);
9195 buffer
= (char *) alloca (length
);
9197 while ((code
= va_arg (args
, int)))
9201 strcpy (buffer
+ length
, " or ");
9204 strcpy (buffer
+ length
, tree_code_name
[code
]);
9205 length
+= strlen (tree_code_name
[code
]);
9209 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9210 buffer
, tree_code_name
[TREE_CODE (node
)],
9211 function
, trim_filename (file
), line
);
9214 /* Similar to tree_check_failed, except that we check for a class of tree
9215 code, given in CL. */
9218 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9219 const char *file
, int line
, const char *function
)
9222 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9223 TREE_CODE_CLASS_STRING (cl
),
9224 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9225 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9228 /* Similar to tree_check_failed, except that instead of specifying a
9229 dozen codes, use the knowledge that they're all sequential. */
9232 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9233 const char *function
, enum tree_code c1
,
9237 unsigned length
= 0;
9240 for (c
= c1
; c
<= c2
; ++c
)
9241 length
+= 4 + strlen (tree_code_name
[c
]);
9243 length
+= strlen ("expected ");
9244 buffer
= (char *) alloca (length
);
9247 for (c
= c1
; c
<= c2
; ++c
)
9249 const char *prefix
= length
? " or " : "expected ";
9251 strcpy (buffer
+ length
, prefix
);
9252 length
+= strlen (prefix
);
9253 strcpy (buffer
+ length
, tree_code_name
[c
]);
9254 length
+= strlen (tree_code_name
[c
]);
9257 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9258 buffer
, tree_code_name
[TREE_CODE (node
)],
9259 function
, trim_filename (file
), line
);
9263 /* Similar to tree_check_failed, except that we check that a tree does
9264 not have the specified code, given in CL. */
9267 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9268 const char *file
, int line
, const char *function
)
9271 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9272 TREE_CODE_CLASS_STRING (cl
),
9273 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9274 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9278 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9281 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9282 const char *function
, enum omp_clause_code code
)
9284 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9285 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9286 function
, trim_filename (file
), line
);
9290 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9293 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9294 const char *function
, enum omp_clause_code c1
,
9295 enum omp_clause_code c2
)
9298 unsigned length
= 0;
9301 for (c
= c1
; c
<= c2
; ++c
)
9302 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9304 length
+= strlen ("expected ");
9305 buffer
= (char *) alloca (length
);
9308 for (c
= c1
; c
<= c2
; ++c
)
9310 const char *prefix
= length
? " or " : "expected ";
9312 strcpy (buffer
+ length
, prefix
);
9313 length
+= strlen (prefix
);
9314 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9315 length
+= strlen (omp_clause_code_name
[c
]);
9318 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9319 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9320 function
, trim_filename (file
), line
);
9324 #undef DEFTREESTRUCT
9325 #define DEFTREESTRUCT(VAL, NAME) NAME,
9327 static const char *ts_enum_names
[] = {
9328 #include "treestruct.def"
9330 #undef DEFTREESTRUCT
9332 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9334 /* Similar to tree_class_check_failed, except that we check for
9335 whether CODE contains the tree structure identified by EN. */
9338 tree_contains_struct_check_failed (const_tree node
,
9339 const enum tree_node_structure_enum en
,
9340 const char *file
, int line
,
9341 const char *function
)
9344 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9346 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9350 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9351 (dynamically sized) vector. */
9354 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9355 const char *function
)
9358 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9359 idx
+ 1, len
, function
, trim_filename (file
), line
);
9362 /* Similar to above, except that the check is for the bounds of the operand
9363 vector of an expression node EXP. */
9366 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9367 int line
, const char *function
)
9369 int code
= TREE_CODE (exp
);
9371 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9372 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9373 function
, trim_filename (file
), line
);
9376 /* Similar to above, except that the check is for the number of
9377 operands of an OMP_CLAUSE node. */
9380 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9381 int line
, const char *function
)
9384 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9385 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9386 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9387 trim_filename (file
), line
);
9389 #endif /* ENABLE_TREE_CHECKING */
9391 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9392 and mapped to the machine mode MODE. Initialize its fields and build
9393 the information necessary for debugging output. */
9396 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9399 hashval_t hashcode
= 0;
9401 t
= make_node (VECTOR_TYPE
);
9402 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9403 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9404 SET_TYPE_MODE (t
, mode
);
9406 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9407 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9408 else if (TYPE_CANONICAL (innertype
) != innertype
9409 || mode
!= VOIDmode
)
9411 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9415 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9416 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9417 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9418 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9419 t
= type_hash_canon (hashcode
, t
);
9421 /* We have built a main variant, based on the main variant of the
9422 inner type. Use it to build the variant we return. */
9423 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9424 && TREE_TYPE (t
) != innertype
)
9425 return build_type_attribute_qual_variant (t
,
9426 TYPE_ATTRIBUTES (innertype
),
9427 TYPE_QUALS (innertype
));
9433 make_or_reuse_type (unsigned size
, int unsignedp
)
9435 if (size
== INT_TYPE_SIZE
)
9436 return unsignedp
? unsigned_type_node
: integer_type_node
;
9437 if (size
== CHAR_TYPE_SIZE
)
9438 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9439 if (size
== SHORT_TYPE_SIZE
)
9440 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9441 if (size
== LONG_TYPE_SIZE
)
9442 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9443 if (size
== LONG_LONG_TYPE_SIZE
)
9444 return (unsignedp
? long_long_unsigned_type_node
9445 : long_long_integer_type_node
);
9446 if (size
== 128 && int128_integer_type_node
)
9447 return (unsignedp
? int128_unsigned_type_node
9448 : int128_integer_type_node
);
9451 return make_unsigned_type (size
);
9453 return make_signed_type (size
);
9456 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9459 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9463 if (size
== SHORT_FRACT_TYPE_SIZE
)
9464 return unsignedp
? sat_unsigned_short_fract_type_node
9465 : sat_short_fract_type_node
;
9466 if (size
== FRACT_TYPE_SIZE
)
9467 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9468 if (size
== LONG_FRACT_TYPE_SIZE
)
9469 return unsignedp
? sat_unsigned_long_fract_type_node
9470 : sat_long_fract_type_node
;
9471 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9472 return unsignedp
? sat_unsigned_long_long_fract_type_node
9473 : sat_long_long_fract_type_node
;
9477 if (size
== SHORT_FRACT_TYPE_SIZE
)
9478 return unsignedp
? unsigned_short_fract_type_node
9479 : short_fract_type_node
;
9480 if (size
== FRACT_TYPE_SIZE
)
9481 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9482 if (size
== LONG_FRACT_TYPE_SIZE
)
9483 return unsignedp
? unsigned_long_fract_type_node
9484 : long_fract_type_node
;
9485 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9486 return unsignedp
? unsigned_long_long_fract_type_node
9487 : long_long_fract_type_node
;
9490 return make_fract_type (size
, unsignedp
, satp
);
9493 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9496 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9500 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9501 return unsignedp
? sat_unsigned_short_accum_type_node
9502 : sat_short_accum_type_node
;
9503 if (size
== ACCUM_TYPE_SIZE
)
9504 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9505 if (size
== LONG_ACCUM_TYPE_SIZE
)
9506 return unsignedp
? sat_unsigned_long_accum_type_node
9507 : sat_long_accum_type_node
;
9508 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9509 return unsignedp
? sat_unsigned_long_long_accum_type_node
9510 : sat_long_long_accum_type_node
;
9514 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9515 return unsignedp
? unsigned_short_accum_type_node
9516 : short_accum_type_node
;
9517 if (size
== ACCUM_TYPE_SIZE
)
9518 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9519 if (size
== LONG_ACCUM_TYPE_SIZE
)
9520 return unsignedp
? unsigned_long_accum_type_node
9521 : long_accum_type_node
;
9522 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9523 return unsignedp
? unsigned_long_long_accum_type_node
9524 : long_long_accum_type_node
;
9527 return make_accum_type (size
, unsignedp
, satp
);
9530 /* Create nodes for all integer types (and error_mark_node) using the sizes
9531 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9532 SHORT_DOUBLE specifies whether double should be of the same precision
9536 build_common_tree_nodes (bool signed_char
, bool short_double
)
9538 error_mark_node
= make_node (ERROR_MARK
);
9539 TREE_TYPE (error_mark_node
) = error_mark_node
;
9541 initialize_sizetypes ();
9543 /* Define both `signed char' and `unsigned char'. */
9544 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9545 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9546 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9547 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9549 /* Define `char', which is like either `signed char' or `unsigned char'
9550 but not the same as either. */
9553 ? make_signed_type (CHAR_TYPE_SIZE
)
9554 : make_unsigned_type (CHAR_TYPE_SIZE
));
9555 TYPE_STRING_FLAG (char_type_node
) = 1;
9557 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9558 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9559 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9560 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9561 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9562 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9563 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9564 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9565 #if HOST_BITS_PER_WIDE_INT >= 64
9566 /* TODO: This isn't correct, but as logic depends at the moment on
9567 host's instead of target's wide-integer.
9568 If there is a target not supporting TImode, but has an 128-bit
9569 integer-scalar register, this target check needs to be adjusted. */
9570 if (targetm
.scalar_mode_supported_p (TImode
))
9572 int128_integer_type_node
= make_signed_type (128);
9573 int128_unsigned_type_node
= make_unsigned_type (128);
9577 /* Define a boolean type. This type only represents boolean values but
9578 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9579 Front ends which want to override this size (i.e. Java) can redefine
9580 boolean_type_node before calling build_common_tree_nodes_2. */
9581 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9582 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9583 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9584 TYPE_PRECISION (boolean_type_node
) = 1;
9586 /* Define what type to use for size_t. */
9587 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9588 size_type_node
= unsigned_type_node
;
9589 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9590 size_type_node
= long_unsigned_type_node
;
9591 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9592 size_type_node
= long_long_unsigned_type_node
;
9593 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9594 size_type_node
= short_unsigned_type_node
;
9598 /* Fill in the rest of the sized types. Reuse existing type nodes
9600 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9601 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9602 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9603 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9604 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9606 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9607 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9608 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9609 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9610 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9612 access_public_node
= get_identifier ("public");
9613 access_protected_node
= get_identifier ("protected");
9614 access_private_node
= get_identifier ("private");
9616 /* Define these next since types below may used them. */
9617 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9618 integer_one_node
= build_int_cst (integer_type_node
, 1);
9619 integer_three_node
= build_int_cst (integer_type_node
, 3);
9620 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9622 size_zero_node
= size_int (0);
9623 size_one_node
= size_int (1);
9624 bitsize_zero_node
= bitsize_int (0);
9625 bitsize_one_node
= bitsize_int (1);
9626 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9628 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9629 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9631 void_type_node
= make_node (VOID_TYPE
);
9632 layout_type (void_type_node
);
9634 /* We are not going to have real types in C with less than byte alignment,
9635 so we might as well not have any types that claim to have it. */
9636 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9637 TYPE_USER_ALIGN (void_type_node
) = 0;
9639 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9640 layout_type (TREE_TYPE (null_pointer_node
));
9642 ptr_type_node
= build_pointer_type (void_type_node
);
9644 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9645 fileptr_type_node
= ptr_type_node
;
9647 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9649 float_type_node
= make_node (REAL_TYPE
);
9650 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9651 layout_type (float_type_node
);
9653 double_type_node
= make_node (REAL_TYPE
);
9655 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9657 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9658 layout_type (double_type_node
);
9660 long_double_type_node
= make_node (REAL_TYPE
);
9661 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9662 layout_type (long_double_type_node
);
9664 float_ptr_type_node
= build_pointer_type (float_type_node
);
9665 double_ptr_type_node
= build_pointer_type (double_type_node
);
9666 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9667 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9669 /* Fixed size integer types. */
9670 uint16_type_node
= build_nonstandard_integer_type (16, true);
9671 uint32_type_node
= build_nonstandard_integer_type (32, true);
9672 uint64_type_node
= build_nonstandard_integer_type (64, true);
9674 /* Decimal float types. */
9675 dfloat32_type_node
= make_node (REAL_TYPE
);
9676 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9677 layout_type (dfloat32_type_node
);
9678 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9679 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9681 dfloat64_type_node
= make_node (REAL_TYPE
);
9682 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9683 layout_type (dfloat64_type_node
);
9684 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9685 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9687 dfloat128_type_node
= make_node (REAL_TYPE
);
9688 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9689 layout_type (dfloat128_type_node
);
9690 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9691 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9693 complex_integer_type_node
= build_complex_type (integer_type_node
);
9694 complex_float_type_node
= build_complex_type (float_type_node
);
9695 complex_double_type_node
= build_complex_type (double_type_node
);
9696 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9698 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9699 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9700 sat_ ## KIND ## _type_node = \
9701 make_sat_signed_ ## KIND ## _type (SIZE); \
9702 sat_unsigned_ ## KIND ## _type_node = \
9703 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9704 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9705 unsigned_ ## KIND ## _type_node = \
9706 make_unsigned_ ## KIND ## _type (SIZE);
9708 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9709 sat_ ## WIDTH ## KIND ## _type_node = \
9710 make_sat_signed_ ## KIND ## _type (SIZE); \
9711 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9712 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9713 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9714 unsigned_ ## WIDTH ## KIND ## _type_node = \
9715 make_unsigned_ ## KIND ## _type (SIZE);
9717 /* Make fixed-point type nodes based on four different widths. */
9718 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9719 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9720 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9721 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9722 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9724 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9725 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9726 NAME ## _type_node = \
9727 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9728 u ## NAME ## _type_node = \
9729 make_or_reuse_unsigned_ ## KIND ## _type \
9730 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9731 sat_ ## NAME ## _type_node = \
9732 make_or_reuse_sat_signed_ ## KIND ## _type \
9733 (GET_MODE_BITSIZE (MODE ## mode)); \
9734 sat_u ## NAME ## _type_node = \
9735 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9736 (GET_MODE_BITSIZE (U ## MODE ## mode));
9738 /* Fixed-point type and mode nodes. */
9739 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9740 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9741 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9742 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9743 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9744 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9745 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9746 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9747 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9748 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9749 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9752 tree t
= targetm
.build_builtin_va_list ();
9754 /* Many back-ends define record types without setting TYPE_NAME.
9755 If we copied the record type here, we'd keep the original
9756 record type without a name. This breaks name mangling. So,
9757 don't copy record types and let c_common_nodes_and_builtins()
9758 declare the type to be __builtin_va_list. */
9759 if (TREE_CODE (t
) != RECORD_TYPE
)
9760 t
= build_variant_type_copy (t
);
9762 va_list_type_node
= t
;
9766 /* Modify DECL for given flags.
9767 TM_PURE attribute is set only on types, so the function will modify
9768 DECL's type when ECF_TM_PURE is used. */
9771 set_call_expr_flags (tree decl
, int flags
)
9773 if (flags
& ECF_NOTHROW
)
9774 TREE_NOTHROW (decl
) = 1;
9775 if (flags
& ECF_CONST
)
9776 TREE_READONLY (decl
) = 1;
9777 if (flags
& ECF_PURE
)
9778 DECL_PURE_P (decl
) = 1;
9779 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9780 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9781 if (flags
& ECF_NOVOPS
)
9782 DECL_IS_NOVOPS (decl
) = 1;
9783 if (flags
& ECF_NORETURN
)
9784 TREE_THIS_VOLATILE (decl
) = 1;
9785 if (flags
& ECF_MALLOC
)
9786 DECL_IS_MALLOC (decl
) = 1;
9787 if (flags
& ECF_RETURNS_TWICE
)
9788 DECL_IS_RETURNS_TWICE (decl
) = 1;
9789 if (flags
& ECF_LEAF
)
9790 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9791 NULL
, DECL_ATTRIBUTES (decl
));
9792 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9793 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9794 /* Looping const or pure is implied by noreturn.
9795 There is currently no way to declare looping const or looping pure alone. */
9796 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9797 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9801 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9804 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9805 const char *library_name
, int ecf_flags
)
9809 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9810 library_name
, NULL_TREE
);
9811 set_call_expr_flags (decl
, ecf_flags
);
9813 set_builtin_decl (code
, decl
, true);
9816 /* Call this function after instantiating all builtins that the language
9817 front end cares about. This will build the rest of the builtins that
9818 are relied upon by the tree optimizers and the middle-end. */
9821 build_common_builtin_nodes (void)
9826 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9828 ftype
= build_function_type (void_type_node
, void_list_node
);
9829 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9830 "__builtin_unreachable",
9831 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9832 | ECF_CONST
| ECF_LEAF
);
9835 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9836 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9838 ftype
= build_function_type_list (ptr_type_node
,
9839 ptr_type_node
, const_ptr_type_node
,
9840 size_type_node
, NULL_TREE
);
9842 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9843 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9844 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9845 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9846 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9847 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9850 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9852 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9853 const_ptr_type_node
, size_type_node
,
9855 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9856 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9859 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9861 ftype
= build_function_type_list (ptr_type_node
,
9862 ptr_type_node
, integer_type_node
,
9863 size_type_node
, NULL_TREE
);
9864 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9865 "memset", ECF_NOTHROW
| ECF_LEAF
);
9868 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9870 ftype
= build_function_type_list (ptr_type_node
,
9871 size_type_node
, NULL_TREE
);
9872 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9873 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9876 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9877 size_type_node
, NULL_TREE
);
9878 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9879 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9880 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9882 /* If we're checking the stack, `alloca' can throw. */
9883 if (flag_stack_check
)
9885 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9886 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9889 ftype
= build_function_type_list (void_type_node
,
9890 ptr_type_node
, ptr_type_node
,
9891 ptr_type_node
, NULL_TREE
);
9892 local_define_builtin ("__builtin_init_trampoline", ftype
,
9893 BUILT_IN_INIT_TRAMPOLINE
,
9894 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9895 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9896 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9897 "__builtin_init_heap_trampoline",
9898 ECF_NOTHROW
| ECF_LEAF
);
9900 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9901 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9902 BUILT_IN_ADJUST_TRAMPOLINE
,
9903 "__builtin_adjust_trampoline",
9904 ECF_CONST
| ECF_NOTHROW
);
9906 ftype
= build_function_type_list (void_type_node
,
9907 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9908 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9909 BUILT_IN_NONLOCAL_GOTO
,
9910 "__builtin_nonlocal_goto",
9911 ECF_NORETURN
| ECF_NOTHROW
);
9913 ftype
= build_function_type_list (void_type_node
,
9914 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9915 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9916 BUILT_IN_SETJMP_SETUP
,
9917 "__builtin_setjmp_setup", ECF_NOTHROW
);
9919 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9920 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9921 BUILT_IN_SETJMP_DISPATCHER
,
9922 "__builtin_setjmp_dispatcher",
9923 ECF_PURE
| ECF_NOTHROW
);
9925 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9926 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9927 BUILT_IN_SETJMP_RECEIVER
,
9928 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9930 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9931 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9932 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9934 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9935 local_define_builtin ("__builtin_stack_restore", ftype
,
9936 BUILT_IN_STACK_RESTORE
,
9937 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9939 /* If there's a possibility that we might use the ARM EABI, build the
9940 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9941 if (targetm
.arm_eabi_unwinder
)
9943 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9944 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9945 BUILT_IN_CXA_END_CLEANUP
,
9946 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9949 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9950 local_define_builtin ("__builtin_unwind_resume", ftype
,
9951 BUILT_IN_UNWIND_RESUME
,
9952 ((targetm_common
.except_unwind_info (&global_options
)
9954 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9957 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9959 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9961 local_define_builtin ("__builtin_return_address", ftype
,
9962 BUILT_IN_RETURN_ADDRESS
,
9963 "__builtin_return_address",
9967 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9968 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9970 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9971 ptr_type_node
, NULL_TREE
);
9972 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9973 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9974 BUILT_IN_PROFILE_FUNC_ENTER
,
9975 "__cyg_profile_func_enter", 0);
9976 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9977 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9978 BUILT_IN_PROFILE_FUNC_EXIT
,
9979 "__cyg_profile_func_exit", 0);
9982 /* The exception object and filter values from the runtime. The argument
9983 must be zero before exception lowering, i.e. from the front end. After
9984 exception lowering, it will be the region number for the exception
9985 landing pad. These functions are PURE instead of CONST to prevent
9986 them from being hoisted past the exception edge that will initialize
9987 its value in the landing pad. */
9988 ftype
= build_function_type_list (ptr_type_node
,
9989 integer_type_node
, NULL_TREE
);
9990 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9991 /* Only use TM_PURE if we we have TM language support. */
9992 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9993 ecf_flags
|= ECF_TM_PURE
;
9994 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9995 "__builtin_eh_pointer", ecf_flags
);
9997 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9998 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9999 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10000 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10002 ftype
= build_function_type_list (void_type_node
,
10003 integer_type_node
, integer_type_node
,
10005 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10006 BUILT_IN_EH_COPY_VALUES
,
10007 "__builtin_eh_copy_values", ECF_NOTHROW
);
10009 /* Complex multiplication and division. These are handled as builtins
10010 rather than optabs because emit_library_call_value doesn't support
10011 complex. Further, we can do slightly better with folding these
10012 beasties if the real and complex parts of the arguments are separate. */
10016 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10018 char mode_name_buf
[4], *q
;
10020 enum built_in_function mcode
, dcode
;
10021 tree type
, inner_type
;
10022 const char *prefix
= "__";
10024 if (targetm
.libfunc_gnu_prefix
)
10027 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10030 inner_type
= TREE_TYPE (type
);
10032 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10033 inner_type
, inner_type
, NULL_TREE
);
10035 mcode
= ((enum built_in_function
)
10036 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10037 dcode
= ((enum built_in_function
)
10038 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10040 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10044 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10046 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10047 built_in_names
[mcode
],
10048 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10050 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10052 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10053 built_in_names
[dcode
],
10054 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10059 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10062 If we requested a pointer to a vector, build up the pointers that
10063 we stripped off while looking for the inner type. Similarly for
10064 return values from functions.
10066 The argument TYPE is the top of the chain, and BOTTOM is the
10067 new type which we will point to. */
10070 reconstruct_complex_type (tree type
, tree bottom
)
10074 if (TREE_CODE (type
) == POINTER_TYPE
)
10076 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10077 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10078 TYPE_REF_CAN_ALIAS_ALL (type
));
10080 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10082 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10083 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10084 TYPE_REF_CAN_ALIAS_ALL (type
));
10086 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10088 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10089 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10091 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10093 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10094 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10096 else if (TREE_CODE (type
) == METHOD_TYPE
)
10098 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10099 /* The build_method_type_directly() routine prepends 'this' to argument list,
10100 so we must compensate by getting rid of it. */
10102 = build_method_type_directly
10103 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10105 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10107 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10109 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10110 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10115 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10116 TYPE_QUALS (type
));
10119 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10122 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10126 switch (GET_MODE_CLASS (mode
))
10128 case MODE_VECTOR_INT
:
10129 case MODE_VECTOR_FLOAT
:
10130 case MODE_VECTOR_FRACT
:
10131 case MODE_VECTOR_UFRACT
:
10132 case MODE_VECTOR_ACCUM
:
10133 case MODE_VECTOR_UACCUM
:
10134 nunits
= GET_MODE_NUNITS (mode
);
10138 /* Check that there are no leftover bits. */
10139 gcc_assert (GET_MODE_BITSIZE (mode
)
10140 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10142 nunits
= GET_MODE_BITSIZE (mode
)
10143 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10147 gcc_unreachable ();
10150 return make_vector_type (innertype
, nunits
, mode
);
10153 /* Similarly, but takes the inner type and number of units, which must be
10157 build_vector_type (tree innertype
, int nunits
)
10159 return make_vector_type (innertype
, nunits
, VOIDmode
);
10162 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10165 build_opaque_vector_type (tree innertype
, int nunits
)
10167 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10169 /* We always build the non-opaque variant before the opaque one,
10170 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10171 cand
= TYPE_NEXT_VARIANT (t
);
10173 && TYPE_VECTOR_OPAQUE (cand
)
10174 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10176 /* Othewise build a variant type and make sure to queue it after
10177 the non-opaque type. */
10178 cand
= build_distinct_type_copy (t
);
10179 TYPE_VECTOR_OPAQUE (cand
) = true;
10180 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10181 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10182 TYPE_NEXT_VARIANT (t
) = cand
;
10183 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10188 /* Given an initializer INIT, return TRUE if INIT is zero or some
10189 aggregate of zeros. Otherwise return FALSE. */
10191 initializer_zerop (const_tree init
)
10197 switch (TREE_CODE (init
))
10200 return integer_zerop (init
);
10203 /* ??? Note that this is not correct for C4X float formats. There,
10204 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10205 negative exponent. */
10206 return real_zerop (init
)
10207 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10210 return fixed_zerop (init
);
10213 return integer_zerop (init
)
10214 || (real_zerop (init
)
10215 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10216 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10221 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10222 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10229 unsigned HOST_WIDE_INT idx
;
10231 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10232 if (!initializer_zerop (elt
))
10241 /* We need to loop through all elements to handle cases like
10242 "\0" and "\0foobar". */
10243 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10244 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10255 /* Check if vector VEC consists of all the equal elements and
10256 that the number of elements corresponds to the type of VEC.
10257 The function returns first element of the vector
10258 or NULL_TREE if the vector is not uniform. */
10260 uniform_vector_p (const_tree vec
)
10265 if (vec
== NULL_TREE
)
10268 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10270 if (TREE_CODE (vec
) == VECTOR_CST
)
10272 first
= VECTOR_CST_ELT (vec
, 0);
10273 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10274 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10280 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10282 first
= error_mark_node
;
10284 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10291 if (!operand_equal_p (first
, t
, 0))
10294 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10303 /* Build an empty statement at location LOC. */
10306 build_empty_stmt (location_t loc
)
10308 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10309 SET_EXPR_LOCATION (t
, loc
);
10314 /* Build an OpenMP clause with code CODE. LOC is the location of the
10318 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10323 length
= omp_clause_num_ops
[code
];
10324 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10326 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10328 t
= ggc_alloc_tree_node (size
);
10329 memset (t
, 0, size
);
10330 TREE_SET_CODE (t
, OMP_CLAUSE
);
10331 OMP_CLAUSE_SET_CODE (t
, code
);
10332 OMP_CLAUSE_LOCATION (t
) = loc
;
10337 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10338 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10339 Except for the CODE and operand count field, other storage for the
10340 object is initialized to zeros. */
10343 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10346 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10348 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10349 gcc_assert (len
>= 1);
10351 record_node_allocation_statistics (code
, length
);
10353 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10355 TREE_SET_CODE (t
, code
);
10357 /* Can't use TREE_OPERAND to store the length because if checking is
10358 enabled, it will try to check the length before we store it. :-P */
10359 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10364 /* Helper function for build_call_* functions; build a CALL_EXPR with
10365 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10366 the argument slots. */
10369 build_call_1 (tree return_type
, tree fn
, int nargs
)
10373 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10374 TREE_TYPE (t
) = return_type
;
10375 CALL_EXPR_FN (t
) = fn
;
10376 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10381 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10382 FN and a null static chain slot. NARGS is the number of call arguments
10383 which are specified as "..." arguments. */
10386 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10390 va_start (args
, nargs
);
10391 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10396 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10397 FN and a null static chain slot. NARGS is the number of call arguments
10398 which are specified as a va_list ARGS. */
10401 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10406 t
= build_call_1 (return_type
, fn
, nargs
);
10407 for (i
= 0; i
< nargs
; i
++)
10408 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10409 process_call_operands (t
);
10413 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10414 FN and a null static chain slot. NARGS is the number of call arguments
10415 which are specified as a tree array ARGS. */
10418 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10419 int nargs
, const tree
*args
)
10424 t
= build_call_1 (return_type
, fn
, nargs
);
10425 for (i
= 0; i
< nargs
; i
++)
10426 CALL_EXPR_ARG (t
, i
) = args
[i
];
10427 process_call_operands (t
);
10428 SET_EXPR_LOCATION (t
, loc
);
10432 /* Like build_call_array, but takes a vec. */
10435 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10440 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10441 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10442 CALL_EXPR_ARG (ret
, ix
) = t
;
10443 process_call_operands (ret
);
10448 /* Returns true if it is possible to prove that the index of
10449 an array access REF (an ARRAY_REF expression) falls into the
10453 in_array_bounds_p (tree ref
)
10455 tree idx
= TREE_OPERAND (ref
, 1);
10458 if (TREE_CODE (idx
) != INTEGER_CST
)
10461 min
= array_ref_low_bound (ref
);
10462 max
= array_ref_up_bound (ref
);
10465 || TREE_CODE (min
) != INTEGER_CST
10466 || TREE_CODE (max
) != INTEGER_CST
)
10469 if (tree_int_cst_lt (idx
, min
)
10470 || tree_int_cst_lt (max
, idx
))
10476 /* Returns true if it is possible to prove that the range of
10477 an array access REF (an ARRAY_RANGE_REF expression) falls
10478 into the array bounds. */
10481 range_in_array_bounds_p (tree ref
)
10483 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10484 tree range_min
, range_max
, min
, max
;
10486 range_min
= TYPE_MIN_VALUE (domain_type
);
10487 range_max
= TYPE_MAX_VALUE (domain_type
);
10490 || TREE_CODE (range_min
) != INTEGER_CST
10491 || TREE_CODE (range_max
) != 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 (range_min
, min
)
10503 || tree_int_cst_lt (max
, range_max
))
10509 /* Return true if T (assumed to be a DECL) must be assigned a memory
10513 needs_to_live_in_memory (const_tree t
)
10515 return (TREE_ADDRESSABLE (t
)
10516 || is_global_var (t
)
10517 || (TREE_CODE (t
) == RESULT_DECL
10518 && !DECL_BY_REFERENCE (t
)
10519 && aggregate_value_p (t
, current_function_decl
)));
10522 /* Return value of a constant X and sign-extend it. */
10525 int_cst_value (const_tree x
)
10527 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10528 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10530 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10531 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10532 || TREE_INT_CST_HIGH (x
) == -1);
10534 if (bits
< HOST_BITS_PER_WIDE_INT
)
10536 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10538 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10540 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10546 /* Return value of a constant X and sign-extend it. */
10549 widest_int_cst_value (const_tree x
)
10551 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10552 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10554 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10555 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10556 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10557 << HOST_BITS_PER_WIDE_INT
);
10559 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10560 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10561 || TREE_INT_CST_HIGH (x
) == -1);
10564 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10566 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10568 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10570 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10576 /* If TYPE is an integral or pointer type, return an integer type with
10577 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10578 if TYPE is already an integer type of signedness UNSIGNEDP. */
10581 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10583 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10586 if (TREE_CODE (type
) == VECTOR_TYPE
)
10588 tree inner
= TREE_TYPE (type
);
10589 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10592 if (inner
== inner2
)
10594 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10597 if (!INTEGRAL_TYPE_P (type
)
10598 && !POINTER_TYPE_P (type
))
10601 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10604 /* If TYPE is an integral or pointer type, return an integer type with
10605 the same precision which is unsigned, or itself if TYPE is already an
10606 unsigned integer type. */
10609 unsigned_type_for (tree type
)
10611 return signed_or_unsigned_type_for (1, type
);
10614 /* If TYPE is an integral or pointer type, return an integer type with
10615 the same precision which is signed, or itself if TYPE is already a
10616 signed integer type. */
10619 signed_type_for (tree type
)
10621 return signed_or_unsigned_type_for (0, type
);
10624 /* If TYPE is a vector type, return a signed integer vector type with the
10625 same width and number of subparts. Otherwise return boolean_type_node. */
10628 truth_type_for (tree type
)
10630 if (TREE_CODE (type
) == VECTOR_TYPE
)
10632 tree elem
= lang_hooks
.types
.type_for_size
10633 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10634 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10637 return boolean_type_node
;
10640 /* Returns the largest value obtainable by casting something in INNER type to
10644 upper_bound_in_type (tree outer
, tree inner
)
10647 unsigned int det
= 0;
10648 unsigned oprec
= TYPE_PRECISION (outer
);
10649 unsigned iprec
= TYPE_PRECISION (inner
);
10652 /* Compute a unique number for every combination. */
10653 det
|= (oprec
> iprec
) ? 4 : 0;
10654 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10655 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10657 /* Determine the exponent to use. */
10662 /* oprec <= iprec, outer: signed, inner: don't care. */
10667 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10671 /* oprec > iprec, outer: signed, inner: signed. */
10675 /* oprec > iprec, outer: signed, inner: unsigned. */
10679 /* oprec > iprec, outer: unsigned, inner: signed. */
10683 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10687 gcc_unreachable ();
10690 /* Compute 2^^prec - 1. */
10691 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10694 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10695 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10699 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10700 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10701 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10704 return double_int_to_tree (outer
, high
);
10707 /* Returns the smallest value obtainable by casting something in INNER type to
10711 lower_bound_in_type (tree outer
, tree inner
)
10714 unsigned oprec
= TYPE_PRECISION (outer
);
10715 unsigned iprec
= TYPE_PRECISION (inner
);
10717 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10719 if (TYPE_UNSIGNED (outer
)
10720 /* If we are widening something of an unsigned type, OUTER type
10721 contains all values of INNER type. In particular, both INNER
10722 and OUTER types have zero in common. */
10723 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10724 low
.low
= low
.high
= 0;
10727 /* If we are widening a signed type to another signed type, we
10728 want to obtain -2^^(iprec-1). If we are keeping the
10729 precision or narrowing to a signed type, we want to obtain
10731 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10733 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10735 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10736 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10740 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10741 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10746 return double_int_to_tree (outer
, low
);
10749 /* Return nonzero if two operands that are suitable for PHI nodes are
10750 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10751 SSA_NAME or invariant. Note that this is strictly an optimization.
10752 That is, callers of this function can directly call operand_equal_p
10753 and get the same result, only slower. */
10756 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10760 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10762 return operand_equal_p (arg0
, arg1
, 0);
10765 /* Returns number of zeros at the end of binary representation of X.
10767 ??? Use ffs if available? */
10770 num_ending_zeros (const_tree x
)
10772 unsigned HOST_WIDE_INT fr
, nfr
;
10773 unsigned num
, abits
;
10774 tree type
= TREE_TYPE (x
);
10776 if (TREE_INT_CST_LOW (x
) == 0)
10778 num
= HOST_BITS_PER_WIDE_INT
;
10779 fr
= TREE_INT_CST_HIGH (x
);
10784 fr
= TREE_INT_CST_LOW (x
);
10787 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10790 if (nfr
<< abits
== fr
)
10797 if (num
> TYPE_PRECISION (type
))
10798 num
= TYPE_PRECISION (type
);
10800 return build_int_cst_type (type
, num
);
10804 #define WALK_SUBTREE(NODE) \
10807 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10813 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10814 be walked whenever a type is seen in the tree. Rest of operands and return
10815 value are as for walk_tree. */
10818 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10819 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10821 tree result
= NULL_TREE
;
10823 switch (TREE_CODE (type
))
10826 case REFERENCE_TYPE
:
10827 /* We have to worry about mutually recursive pointers. These can't
10828 be written in C. They can in Ada. It's pathological, but
10829 there's an ACATS test (c38102a) that checks it. Deal with this
10830 by checking if we're pointing to another pointer, that one
10831 points to another pointer, that one does too, and we have no htab.
10832 If so, get a hash table. We check three levels deep to avoid
10833 the cost of the hash table if we don't need one. */
10834 if (POINTER_TYPE_P (TREE_TYPE (type
))
10835 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10836 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10839 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10847 /* ... fall through ... */
10850 WALK_SUBTREE (TREE_TYPE (type
));
10854 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10856 /* Fall through. */
10858 case FUNCTION_TYPE
:
10859 WALK_SUBTREE (TREE_TYPE (type
));
10863 /* We never want to walk into default arguments. */
10864 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10865 WALK_SUBTREE (TREE_VALUE (arg
));
10870 /* Don't follow this nodes's type if a pointer for fear that
10871 we'll have infinite recursion. If we have a PSET, then we
10874 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10875 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10876 WALK_SUBTREE (TREE_TYPE (type
));
10877 WALK_SUBTREE (TYPE_DOMAIN (type
));
10881 WALK_SUBTREE (TREE_TYPE (type
));
10882 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10892 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10893 called with the DATA and the address of each sub-tree. If FUNC returns a
10894 non-NULL value, the traversal is stopped, and the value returned by FUNC
10895 is returned. If PSET is non-NULL it is used to record the nodes visited,
10896 and to avoid visiting a node more than once. */
10899 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10900 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10902 enum tree_code code
;
10906 #define WALK_SUBTREE_TAIL(NODE) \
10910 goto tail_recurse; \
10915 /* Skip empty subtrees. */
10919 /* Don't walk the same tree twice, if the user has requested
10920 that we avoid doing so. */
10921 if (pset
&& pointer_set_insert (pset
, *tp
))
10924 /* Call the function. */
10926 result
= (*func
) (tp
, &walk_subtrees
, data
);
10928 /* If we found something, return it. */
10932 code
= TREE_CODE (*tp
);
10934 /* Even if we didn't, FUNC may have decided that there was nothing
10935 interesting below this point in the tree. */
10936 if (!walk_subtrees
)
10938 /* But we still need to check our siblings. */
10939 if (code
== TREE_LIST
)
10940 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10941 else if (code
== OMP_CLAUSE
)
10942 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10949 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10950 if (result
|| !walk_subtrees
)
10957 case IDENTIFIER_NODE
:
10964 case PLACEHOLDER_EXPR
:
10968 /* None of these have subtrees other than those already walked
10973 WALK_SUBTREE (TREE_VALUE (*tp
));
10974 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10979 int len
= TREE_VEC_LENGTH (*tp
);
10984 /* Walk all elements but the first. */
10986 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10988 /* Now walk the first one as a tail call. */
10989 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10993 WALK_SUBTREE (TREE_REALPART (*tp
));
10994 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10998 unsigned HOST_WIDE_INT idx
;
10999 constructor_elt
*ce
;
11001 for (idx
= 0; vec_safe_iterate(CONSTRUCTOR_ELTS (*tp
), idx
, &ce
); idx
++)
11002 WALK_SUBTREE (ce
->value
);
11007 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11012 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11014 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11015 into declarations that are just mentioned, rather than
11016 declared; they don't really belong to this part of the tree.
11017 And, we can see cycles: the initializer for a declaration
11018 can refer to the declaration itself. */
11019 WALK_SUBTREE (DECL_INITIAL (decl
));
11020 WALK_SUBTREE (DECL_SIZE (decl
));
11021 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11023 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11026 case STATEMENT_LIST
:
11028 tree_stmt_iterator i
;
11029 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11030 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11035 switch (OMP_CLAUSE_CODE (*tp
))
11037 case OMP_CLAUSE_PRIVATE
:
11038 case OMP_CLAUSE_SHARED
:
11039 case OMP_CLAUSE_FIRSTPRIVATE
:
11040 case OMP_CLAUSE_COPYIN
:
11041 case OMP_CLAUSE_COPYPRIVATE
:
11042 case OMP_CLAUSE_FINAL
:
11043 case OMP_CLAUSE_IF
:
11044 case OMP_CLAUSE_NUM_THREADS
:
11045 case OMP_CLAUSE_SCHEDULE
:
11046 case OMP_CLAUSE_UNIFORM
:
11047 case OMP_CLAUSE_SAFELEN
:
11048 case OMP_CLAUSE__SIMDUID_
:
11049 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11052 case OMP_CLAUSE_NOWAIT
:
11053 case OMP_CLAUSE_ORDERED
:
11054 case OMP_CLAUSE_DEFAULT
:
11055 case OMP_CLAUSE_UNTIED
:
11056 case OMP_CLAUSE_MERGEABLE
:
11057 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11059 case OMP_CLAUSE_LASTPRIVATE
:
11060 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11061 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11062 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11064 case OMP_CLAUSE_COLLAPSE
:
11067 for (i
= 0; i
< 3; i
++)
11068 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11069 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11072 case OMP_CLAUSE_LINEAR
:
11073 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11074 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11075 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11077 case OMP_CLAUSE_REDUCTION
:
11080 for (i
= 0; i
< 4; i
++)
11081 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11082 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11086 gcc_unreachable ();
11094 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11095 But, we only want to walk once. */
11096 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11097 for (i
= 0; i
< len
; ++i
)
11098 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11099 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11103 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11104 defining. We only want to walk into these fields of a type in this
11105 case and not in the general case of a mere reference to the type.
11107 The criterion is as follows: if the field can be an expression, it
11108 must be walked only here. This should be in keeping with the fields
11109 that are directly gimplified in gimplify_type_sizes in order for the
11110 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11111 variable-sized types.
11113 Note that DECLs get walked as part of processing the BIND_EXPR. */
11114 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11116 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11117 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11120 /* Call the function for the type. See if it returns anything or
11121 doesn't want us to continue. If we are to continue, walk both
11122 the normal fields and those for the declaration case. */
11123 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11124 if (result
|| !walk_subtrees
)
11127 /* But do not walk a pointed-to type since it may itself need to
11128 be walked in the declaration case if it isn't anonymous. */
11129 if (!POINTER_TYPE_P (*type_p
))
11131 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11136 /* If this is a record type, also walk the fields. */
11137 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11141 for (field
= TYPE_FIELDS (*type_p
); field
;
11142 field
= DECL_CHAIN (field
))
11144 /* We'd like to look at the type of the field, but we can
11145 easily get infinite recursion. So assume it's pointed
11146 to elsewhere in the tree. Also, ignore things that
11148 if (TREE_CODE (field
) != FIELD_DECL
)
11151 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11152 WALK_SUBTREE (DECL_SIZE (field
));
11153 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11154 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11155 WALK_SUBTREE (DECL_QUALIFIER (field
));
11159 /* Same for scalar types. */
11160 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11161 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11162 || TREE_CODE (*type_p
) == INTEGER_TYPE
11163 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11164 || TREE_CODE (*type_p
) == REAL_TYPE
)
11166 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11167 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11170 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11171 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11176 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11180 /* Walk over all the sub-trees of this operand. */
11181 len
= TREE_OPERAND_LENGTH (*tp
);
11183 /* Go through the subtrees. We need to do this in forward order so
11184 that the scope of a FOR_EXPR is handled properly. */
11187 for (i
= 0; i
< len
- 1; ++i
)
11188 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11189 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11192 /* If this is a type, walk the needed fields in the type. */
11193 else if (TYPE_P (*tp
))
11194 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11198 /* We didn't find what we were looking for. */
11201 #undef WALK_SUBTREE_TAIL
11203 #undef WALK_SUBTREE
11205 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11208 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11212 struct pointer_set_t
*pset
;
11214 pset
= pointer_set_create ();
11215 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11216 pointer_set_destroy (pset
);
11222 tree_block (tree t
)
11224 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11226 if (IS_EXPR_CODE_CLASS (c
))
11227 return LOCATION_BLOCK (t
->exp
.locus
);
11228 gcc_unreachable ();
11233 tree_set_block (tree t
, tree b
)
11235 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11237 if (IS_EXPR_CODE_CLASS (c
))
11240 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11242 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11245 gcc_unreachable ();
11248 /* Create a nameless artificial label and put it in the current
11249 function context. The label has a location of LOC. Returns the
11250 newly created label. */
11253 create_artificial_label (location_t loc
)
11255 tree lab
= build_decl (loc
,
11256 LABEL_DECL
, NULL_TREE
, void_type_node
);
11258 DECL_ARTIFICIAL (lab
) = 1;
11259 DECL_IGNORED_P (lab
) = 1;
11260 DECL_CONTEXT (lab
) = current_function_decl
;
11264 /* Given a tree, try to return a useful variable name that we can use
11265 to prefix a temporary that is being assigned the value of the tree.
11266 I.E. given <temp> = &A, return A. */
11271 tree stripped_decl
;
11274 STRIP_NOPS (stripped_decl
);
11275 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11276 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11277 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11279 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11282 return IDENTIFIER_POINTER (name
);
11286 switch (TREE_CODE (stripped_decl
))
11289 return get_name (TREE_OPERAND (stripped_decl
, 0));
11296 /* Return true if TYPE has a variable argument list. */
11299 stdarg_p (const_tree fntype
)
11301 function_args_iterator args_iter
;
11302 tree n
= NULL_TREE
, t
;
11307 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
11312 return n
!= NULL_TREE
&& n
!= void_type_node
;
11315 /* Return true if TYPE has a prototype. */
11318 prototype_p (tree fntype
)
11322 gcc_assert (fntype
!= NULL_TREE
);
11324 t
= TYPE_ARG_TYPES (fntype
);
11325 return (t
!= NULL_TREE
);
11328 /* If BLOCK is inlined from an __attribute__((__artificial__))
11329 routine, return pointer to location from where it has been
11332 block_nonartificial_location (tree block
)
11334 location_t
*ret
= NULL
;
11336 while (block
&& TREE_CODE (block
) == BLOCK
11337 && BLOCK_ABSTRACT_ORIGIN (block
))
11339 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11341 while (TREE_CODE (ao
) == BLOCK
11342 && BLOCK_ABSTRACT_ORIGIN (ao
)
11343 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11344 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11346 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11348 /* If AO is an artificial inline, point RET to the
11349 call site locus at which it has been inlined and continue
11350 the loop, in case AO's caller is also an artificial
11352 if (DECL_DECLARED_INLINE_P (ao
)
11353 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11354 ret
= &BLOCK_SOURCE_LOCATION (block
);
11358 else if (TREE_CODE (ao
) != BLOCK
)
11361 block
= BLOCK_SUPERCONTEXT (block
);
11367 /* If EXP is inlined from an __attribute__((__artificial__))
11368 function, return the location of the original call expression. */
11371 tree_nonartificial_location (tree exp
)
11373 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11378 return EXPR_LOCATION (exp
);
11382 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11385 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11388 cl_option_hash_hash (const void *x
)
11390 const_tree
const t
= (const_tree
) x
;
11394 hashval_t hash
= 0;
11396 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11398 p
= (const char *)TREE_OPTIMIZATION (t
);
11399 len
= sizeof (struct cl_optimization
);
11402 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11404 p
= (const char *)TREE_TARGET_OPTION (t
);
11405 len
= sizeof (struct cl_target_option
);
11409 gcc_unreachable ();
11411 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11413 for (i
= 0; i
< len
; i
++)
11415 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11420 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11421 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11425 cl_option_hash_eq (const void *x
, const void *y
)
11427 const_tree
const xt
= (const_tree
) x
;
11428 const_tree
const yt
= (const_tree
) y
;
11433 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11436 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11438 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11439 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11440 len
= sizeof (struct cl_optimization
);
11443 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11445 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11446 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11447 len
= sizeof (struct cl_target_option
);
11451 gcc_unreachable ();
11453 return (memcmp (xp
, yp
, len
) == 0);
11456 /* Build an OPTIMIZATION_NODE based on the current options. */
11459 build_optimization_node (void)
11464 /* Use the cache of optimization nodes. */
11466 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11469 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11473 /* Insert this one into the hash table. */
11474 t
= cl_optimization_node
;
11477 /* Make a new node for next time round. */
11478 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11484 /* Build a TARGET_OPTION_NODE based on the current options. */
11487 build_target_option_node (void)
11492 /* Use the cache of optimization nodes. */
11494 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11497 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11501 /* Insert this one into the hash table. */
11502 t
= cl_target_option_node
;
11505 /* Make a new node for next time round. */
11506 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11512 /* Determine the "ultimate origin" of a block. The block may be an inlined
11513 instance of an inlined instance of a block which is local to an inline
11514 function, so we have to trace all of the way back through the origin chain
11515 to find out what sort of node actually served as the original seed for the
11519 block_ultimate_origin (const_tree block
)
11521 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11523 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11524 nodes in the function to point to themselves; ignore that if
11525 we're trying to output the abstract instance of this function. */
11526 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11529 if (immediate_origin
== NULL_TREE
)
11534 tree lookahead
= immediate_origin
;
11538 ret_val
= lookahead
;
11539 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11540 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11542 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11544 /* The block's abstract origin chain may not be the *ultimate* origin of
11545 the block. It could lead to a DECL that has an abstract origin set.
11546 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11547 will give us if it has one). Note that DECL's abstract origins are
11548 supposed to be the most distant ancestor (or so decl_ultimate_origin
11549 claims), so we don't need to loop following the DECL origins. */
11550 if (DECL_P (ret_val
))
11551 return DECL_ORIGIN (ret_val
);
11557 /* Return true if T1 and T2 are equivalent lists. */
11560 list_equal_p (const_tree t1
, const_tree t2
)
11562 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11563 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11568 /* Return true iff conversion in EXP generates no instruction. Mark
11569 it inline so that we fully inline into the stripping functions even
11570 though we have two uses of this function. */
11573 tree_nop_conversion (const_tree exp
)
11575 tree outer_type
, inner_type
;
11577 if (!CONVERT_EXPR_P (exp
)
11578 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11580 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11583 outer_type
= TREE_TYPE (exp
);
11584 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11589 /* Use precision rather then machine mode when we can, which gives
11590 the correct answer even for submode (bit-field) types. */
11591 if ((INTEGRAL_TYPE_P (outer_type
)
11592 || POINTER_TYPE_P (outer_type
)
11593 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11594 && (INTEGRAL_TYPE_P (inner_type
)
11595 || POINTER_TYPE_P (inner_type
)
11596 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11597 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11599 /* Otherwise fall back on comparing machine modes (e.g. for
11600 aggregate types, floats). */
11601 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11604 /* Return true iff conversion in EXP generates no instruction. Don't
11605 consider conversions changing the signedness. */
11608 tree_sign_nop_conversion (const_tree exp
)
11610 tree outer_type
, inner_type
;
11612 if (!tree_nop_conversion (exp
))
11615 outer_type
= TREE_TYPE (exp
);
11616 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11618 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11619 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11622 /* Strip conversions from EXP according to tree_nop_conversion and
11623 return the resulting expression. */
11626 tree_strip_nop_conversions (tree exp
)
11628 while (tree_nop_conversion (exp
))
11629 exp
= TREE_OPERAND (exp
, 0);
11633 /* Strip conversions from EXP according to tree_sign_nop_conversion
11634 and return the resulting expression. */
11637 tree_strip_sign_nop_conversions (tree exp
)
11639 while (tree_sign_nop_conversion (exp
))
11640 exp
= TREE_OPERAND (exp
, 0);
11644 /* Avoid any floating point extensions from EXP. */
11646 strip_float_extensions (tree exp
)
11648 tree sub
, expt
, subt
;
11650 /* For floating point constant look up the narrowest type that can hold
11651 it properly and handle it like (type)(narrowest_type)constant.
11652 This way we can optimize for instance a=a*2.0 where "a" is float
11653 but 2.0 is double constant. */
11654 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11656 REAL_VALUE_TYPE orig
;
11659 orig
= TREE_REAL_CST (exp
);
11660 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11661 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11662 type
= float_type_node
;
11663 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11664 > TYPE_PRECISION (double_type_node
)
11665 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11666 type
= double_type_node
;
11668 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11671 if (!CONVERT_EXPR_P (exp
))
11674 sub
= TREE_OPERAND (exp
, 0);
11675 subt
= TREE_TYPE (sub
);
11676 expt
= TREE_TYPE (exp
);
11678 if (!FLOAT_TYPE_P (subt
))
11681 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11684 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11687 return strip_float_extensions (sub
);
11690 /* Strip out all handled components that produce invariant
11694 strip_invariant_refs (const_tree op
)
11696 while (handled_component_p (op
))
11698 switch (TREE_CODE (op
))
11701 case ARRAY_RANGE_REF
:
11702 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11703 || TREE_OPERAND (op
, 2) != NULL_TREE
11704 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11708 case COMPONENT_REF
:
11709 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11715 op
= TREE_OPERAND (op
, 0);
11721 static GTY(()) tree gcc_eh_personality_decl
;
11723 /* Return the GCC personality function decl. */
11726 lhd_gcc_personality (void)
11728 if (!gcc_eh_personality_decl
)
11729 gcc_eh_personality_decl
= build_personality_function ("gcc");
11730 return gcc_eh_personality_decl
;
11733 /* For languages with One Definition Rule, work out if
11734 trees are actually the same even if the tree representation
11735 differs. This handles only decls appearing in TYPE_NAME
11736 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11737 RECORD_TYPE and IDENTIFIER_NODE. */
11740 same_for_odr (tree t1
, tree t2
)
11746 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11747 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11748 && TREE_CODE (t2
) == TYPE_DECL
11749 && DECL_FILE_SCOPE_P (t1
))
11751 t2
= DECL_NAME (t2
);
11752 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11754 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11755 && TREE_CODE (t1
) == TYPE_DECL
11756 && DECL_FILE_SCOPE_P (t2
))
11758 t1
= DECL_NAME (t1
);
11759 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11761 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11764 return types_same_for_odr (t1
, t2
);
11766 return decls_same_for_odr (t1
, t2
);
11770 /* For languages with One Definition Rule, work out if
11771 decls are actually the same even if the tree representation
11772 differs. This handles only decls appearing in TYPE_NAME
11773 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11774 RECORD_TYPE and IDENTIFIER_NODE. */
11777 decls_same_for_odr (tree decl1
, tree decl2
)
11779 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11780 && DECL_ORIGINAL_TYPE (decl1
))
11781 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11782 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11783 && DECL_ORIGINAL_TYPE (decl2
))
11784 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11785 if (decl1
== decl2
)
11787 if (!decl1
|| !decl2
)
11789 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11790 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11792 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11794 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11795 && TREE_CODE (decl1
) != TYPE_DECL
)
11797 if (!DECL_NAME (decl1
))
11799 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11800 gcc_checking_assert (!DECL_NAME (decl2
)
11801 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11802 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11804 return same_for_odr (DECL_CONTEXT (decl1
),
11805 DECL_CONTEXT (decl2
));
11808 /* For languages with One Definition Rule, work out if
11809 types are same even if the tree representation differs.
11810 This is non-trivial for LTO where minnor differences in
11811 the type representation may have prevented type merging
11812 to merge two copies of otherwise equivalent type. */
11815 types_same_for_odr (tree type1
, tree type2
)
11817 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11818 type1
= TYPE_MAIN_VARIANT (type1
);
11819 type2
= TYPE_MAIN_VARIANT (type2
);
11820 if (type1
== type2
)
11823 #ifndef ENABLE_CHECKING
11828 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11829 on the corresponding TYPE_STUB_DECL. */
11830 if (type_in_anonymous_namespace_p (type1
)
11831 || type_in_anonymous_namespace_p (type2
))
11833 /* When assembler name of virtual table is available, it is
11834 easy to compare types for equivalence. */
11835 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11836 && BINFO_VTABLE (TYPE_BINFO (type1
))
11837 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11839 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11840 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11842 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11844 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11845 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11846 TREE_OPERAND (v2
, 1), 0))
11848 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11849 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11851 v1
= DECL_ASSEMBLER_NAME (v1
);
11852 v2
= DECL_ASSEMBLER_NAME (v2
);
11856 /* FIXME: the code comparing type names consider all instantiations of the
11857 same template to have same name. This is because we have no access
11858 to template parameters. For types with no virtual method tables
11859 we thus can return false positives. At the moment we do not need
11860 to compare types in other scenarios than devirtualization. */
11862 /* If types are not structuraly same, do not bother to contnue.
11863 Match in the remainder of code would mean ODR violation. */
11864 if (!types_compatible_p (type1
, type2
))
11866 if (!TYPE_NAME (type1
))
11868 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11870 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11872 /* When not in LTO the MAIN_VARIANT check should be the same. */
11873 gcc_assert (in_lto_p
);
11878 /* TARGET is a call target of GIMPLE call statement
11879 (obtained by gimple_call_fn). Return true if it is
11880 OBJ_TYPE_REF representing an virtual call of C++ method.
11881 (As opposed to OBJ_TYPE_REF representing objc calls
11882 through a cast where middle-end devirtualization machinery
11886 virtual_method_call_p (tree target
)
11888 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11890 target
= TREE_TYPE (target
);
11891 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11892 target
= TREE_TYPE (target
);
11893 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11895 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11899 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11902 obj_type_ref_class (tree ref
)
11904 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11905 ref
= TREE_TYPE (ref
);
11906 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11907 ref
= TREE_TYPE (ref
);
11908 /* We look for type THIS points to. ObjC also builds
11909 OBJ_TYPE_REF with non-method calls, Their first parameter
11910 ID however also corresponds to class type. */
11911 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11912 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11913 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11914 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11915 return TREE_TYPE (ref
);
11918 /* Return true if T is in anonymous namespace. */
11921 type_in_anonymous_namespace_p (tree t
)
11923 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11926 /* Try to find a base info of BINFO that would have its field decl at offset
11927 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11928 found, return, otherwise return NULL_TREE. */
11931 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11933 tree type
= BINFO_TYPE (binfo
);
11937 HOST_WIDE_INT pos
, size
;
11941 if (types_same_for_odr (type
, expected_type
))
11946 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11948 if (TREE_CODE (fld
) != FIELD_DECL
)
11951 pos
= int_bit_position (fld
);
11952 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11953 if (pos
<= offset
&& (pos
+ size
) > offset
)
11956 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11959 if (!DECL_ARTIFICIAL (fld
))
11961 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11965 /* Offset 0 indicates the primary base, whose vtable contents are
11966 represented in the binfo for the derived class. */
11967 else if (offset
!= 0)
11969 tree base_binfo
, found_binfo
= NULL_TREE
;
11970 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11971 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11973 found_binfo
= base_binfo
;
11978 binfo
= found_binfo
;
11981 type
= TREE_TYPE (fld
);
11986 /* Returns true if X is a typedef decl. */
11989 is_typedef_decl (tree x
)
11991 return (x
&& TREE_CODE (x
) == TYPE_DECL
11992 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11995 /* Returns true iff TYPE is a type variant created for a typedef. */
11998 typedef_variant_p (tree type
)
12000 return is_typedef_decl (TYPE_NAME (type
));
12003 /* Warn about a use of an identifier which was marked deprecated. */
12005 warn_deprecated_use (tree node
, tree attr
)
12009 if (node
== 0 || !warn_deprecated_decl
)
12015 attr
= DECL_ATTRIBUTES (node
);
12016 else if (TYPE_P (node
))
12018 tree decl
= TYPE_STUB_DECL (node
);
12020 attr
= lookup_attribute ("deprecated",
12021 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12026 attr
= lookup_attribute ("deprecated", attr
);
12029 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12035 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12037 warning (OPT_Wdeprecated_declarations
,
12038 "%qD is deprecated (declared at %r%s:%d%R): %s",
12039 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12041 warning (OPT_Wdeprecated_declarations
,
12042 "%qD is deprecated (declared at %r%s:%d%R)",
12043 node
, "locus", xloc
.file
, xloc
.line
);
12045 else if (TYPE_P (node
))
12047 tree what
= NULL_TREE
;
12048 tree decl
= TYPE_STUB_DECL (node
);
12050 if (TYPE_NAME (node
))
12052 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12053 what
= TYPE_NAME (node
);
12054 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12055 && DECL_NAME (TYPE_NAME (node
)))
12056 what
= DECL_NAME (TYPE_NAME (node
));
12061 expanded_location xloc
12062 = expand_location (DECL_SOURCE_LOCATION (decl
));
12066 warning (OPT_Wdeprecated_declarations
,
12067 "%qE is deprecated (declared at %r%s:%d%R): %s",
12068 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12070 warning (OPT_Wdeprecated_declarations
,
12071 "%qE is deprecated (declared at %r%s:%d%R)",
12072 what
, "locus", xloc
.file
, xloc
.line
);
12077 warning (OPT_Wdeprecated_declarations
,
12078 "type is deprecated (declared at %r%s:%d%R): %s",
12079 "locus", xloc
.file
, xloc
.line
, msg
);
12081 warning (OPT_Wdeprecated_declarations
,
12082 "type is deprecated (declared at %r%s:%d%R)",
12083 "locus", xloc
.file
, xloc
.line
);
12091 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12094 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12099 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12102 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12108 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12109 somewhere in it. */
12112 contains_bitfld_component_ref_p (const_tree ref
)
12114 while (handled_component_p (ref
))
12116 if (TREE_CODE (ref
) == COMPONENT_REF
12117 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12119 ref
= TREE_OPERAND (ref
, 0);
12125 #include "gt-tree.h"