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"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
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, tree
);
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 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0, /* OMP_CLAUSE_UNTIED */
247 1, /* OMP_CLAUSE_FINAL */
248 0 /* OMP_CLAUSE_MERGEABLE */
251 const char * const omp_clause_code_name
[] =
274 /* Return the tree node structure used by tree code CODE. */
276 static inline enum tree_node_structure_enum
277 tree_node_structure_for_code (enum tree_code code
)
279 switch (TREE_CODE_CLASS (code
))
281 case tcc_declaration
:
286 return TS_FIELD_DECL
;
292 return TS_LABEL_DECL
;
294 return TS_RESULT_DECL
;
295 case DEBUG_EXPR_DECL
:
298 return TS_CONST_DECL
;
302 return TS_FUNCTION_DECL
;
303 case TRANSLATION_UNIT_DECL
:
304 return TS_TRANSLATION_UNIT_DECL
;
306 return TS_DECL_NON_COMMON
;
310 return TS_TYPE_NON_COMMON
;
319 default: /* tcc_constant and tcc_exceptional */
324 /* tcc_constant cases. */
325 case INTEGER_CST
: return TS_INT_CST
;
326 case REAL_CST
: return TS_REAL_CST
;
327 case FIXED_CST
: return TS_FIXED_CST
;
328 case COMPLEX_CST
: return TS_COMPLEX
;
329 case VECTOR_CST
: return TS_VECTOR
;
330 case STRING_CST
: return TS_STRING
;
331 /* tcc_exceptional cases. */
332 case ERROR_MARK
: return TS_COMMON
;
333 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
334 case TREE_LIST
: return TS_LIST
;
335 case TREE_VEC
: return TS_VEC
;
336 case SSA_NAME
: return TS_SSA_NAME
;
337 case PLACEHOLDER_EXPR
: return TS_COMMON
;
338 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
339 case BLOCK
: return TS_BLOCK
;
340 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
341 case TREE_BINFO
: return TS_BINFO
;
342 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
343 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
344 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
352 /* Initialize tree_contains_struct to describe the hierarchy of tree
356 initialize_tree_contains_struct (void)
360 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
363 enum tree_node_structure_enum ts_code
;
365 code
= (enum tree_code
) i
;
366 ts_code
= tree_node_structure_for_code (code
);
368 /* Mark the TS structure itself. */
369 tree_contains_struct
[code
][ts_code
] = 1;
371 /* Mark all the structures that TS is derived from. */
389 case TS_STATEMENT_LIST
:
390 MARK_TS_TYPED (code
);
394 case TS_DECL_MINIMAL
:
400 case TS_OPTIMIZATION
:
401 case TS_TARGET_OPTION
:
402 MARK_TS_COMMON (code
);
405 case TS_TYPE_WITH_LANG_SPECIFIC
:
406 MARK_TS_TYPE_COMMON (code
);
409 case TS_TYPE_NON_COMMON
:
410 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
414 MARK_TS_DECL_MINIMAL (code
);
419 MARK_TS_DECL_COMMON (code
);
422 case TS_DECL_NON_COMMON
:
423 MARK_TS_DECL_WITH_VIS (code
);
426 case TS_DECL_WITH_VIS
:
430 MARK_TS_DECL_WRTL (code
);
434 MARK_TS_DECL_COMMON (code
);
438 MARK_TS_DECL_WITH_VIS (code
);
442 case TS_FUNCTION_DECL
:
443 MARK_TS_DECL_NON_COMMON (code
);
446 case TS_TRANSLATION_UNIT_DECL
:
447 MARK_TS_DECL_COMMON (code
);
455 /* Basic consistency checks for attributes used in fold. */
456 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
457 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
458 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
459 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
460 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
461 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
462 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
463 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
464 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
465 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
466 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
468 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
469 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
470 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
471 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
472 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
473 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
474 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
475 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
476 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
477 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
478 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
479 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
480 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
482 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
483 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
484 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
485 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
486 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
487 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
488 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
489 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
490 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
491 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
492 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
493 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
502 /* Initialize the hash table of types. */
503 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
506 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
507 tree_decl_map_eq
, 0);
509 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
510 tree_decl_map_eq
, 0);
511 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
512 tree_priority_map_eq
, 0);
514 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
515 int_cst_hash_eq
, NULL
);
517 int_cst_node
= make_node (INTEGER_CST
);
519 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
520 cl_option_hash_eq
, NULL
);
522 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
523 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
525 /* Initialize the tree_contains_struct array. */
526 initialize_tree_contains_struct ();
527 lang_hooks
.init_ts ();
531 /* The name of the object as the assembler will see it (but before any
532 translations made by ASM_OUTPUT_LABELREF). Often this is the same
533 as DECL_NAME. It is an IDENTIFIER_NODE. */
535 decl_assembler_name (tree decl
)
537 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
538 lang_hooks
.set_decl_assembler_name (decl
);
539 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
542 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
545 decl_assembler_name_equal (tree decl
, const_tree asmname
)
547 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
548 const char *decl_str
;
549 const char *asmname_str
;
552 if (decl_asmname
== asmname
)
555 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
556 asmname_str
= IDENTIFIER_POINTER (asmname
);
559 /* If the target assembler name was set by the user, things are trickier.
560 We have a leading '*' to begin with. After that, it's arguable what
561 is the correct thing to do with -fleading-underscore. Arguably, we've
562 historically been doing the wrong thing in assemble_alias by always
563 printing the leading underscore. Since we're not changing that, make
564 sure user_label_prefix follows the '*' before matching. */
565 if (decl_str
[0] == '*')
567 size_t ulp_len
= strlen (user_label_prefix
);
573 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
574 decl_str
+= ulp_len
, test
=true;
578 if (asmname_str
[0] == '*')
580 size_t ulp_len
= strlen (user_label_prefix
);
586 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
587 asmname_str
+= ulp_len
, test
=true;
594 return strcmp (decl_str
, asmname_str
) == 0;
597 /* Hash asmnames ignoring the user specified marks. */
600 decl_assembler_name_hash (const_tree asmname
)
602 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
604 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
605 size_t ulp_len
= strlen (user_label_prefix
);
609 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
612 return htab_hash_string (decl_str
);
615 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
618 /* Compute the number of bytes occupied by a tree with code CODE.
619 This function cannot be used for nodes that have variable sizes,
620 including TREE_VEC, STRING_CST, and CALL_EXPR. */
622 tree_code_size (enum tree_code code
)
624 switch (TREE_CODE_CLASS (code
))
626 case tcc_declaration
: /* A decl node */
631 return sizeof (struct tree_field_decl
);
633 return sizeof (struct tree_parm_decl
);
635 return sizeof (struct tree_var_decl
);
637 return sizeof (struct tree_label_decl
);
639 return sizeof (struct tree_result_decl
);
641 return sizeof (struct tree_const_decl
);
643 return sizeof (struct tree_type_decl
);
645 return sizeof (struct tree_function_decl
);
646 case DEBUG_EXPR_DECL
:
647 return sizeof (struct tree_decl_with_rtl
);
649 return sizeof (struct tree_decl_non_common
);
653 case tcc_type
: /* a type node */
654 return sizeof (struct tree_type_non_common
);
656 case tcc_reference
: /* a reference */
657 case tcc_expression
: /* an expression */
658 case tcc_statement
: /* an expression with side effects */
659 case tcc_comparison
: /* a comparison expression */
660 case tcc_unary
: /* a unary arithmetic expression */
661 case tcc_binary
: /* a binary arithmetic expression */
662 return (sizeof (struct tree_exp
)
663 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
665 case tcc_constant
: /* a constant */
668 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
669 case REAL_CST
: return sizeof (struct tree_real_cst
);
670 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
671 case COMPLEX_CST
: return sizeof (struct tree_complex
);
672 case VECTOR_CST
: return sizeof (struct tree_vector
);
673 case STRING_CST
: gcc_unreachable ();
675 return lang_hooks
.tree_size (code
);
678 case tcc_exceptional
: /* something random, like an identifier. */
681 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
682 case TREE_LIST
: return sizeof (struct tree_list
);
685 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
688 case OMP_CLAUSE
: gcc_unreachable ();
690 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
692 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
693 case BLOCK
: return sizeof (struct tree_block
);
694 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
695 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
696 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
699 return lang_hooks
.tree_size (code
);
707 /* Compute the number of bytes occupied by NODE. This routine only
708 looks at TREE_CODE, except for those nodes that have variable sizes. */
710 tree_size (const_tree node
)
712 const enum tree_code code
= TREE_CODE (node
);
716 return (offsetof (struct tree_binfo
, base_binfos
)
718 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
721 return (sizeof (struct tree_vec
)
722 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
725 return (sizeof (struct tree_vector
)
726 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
729 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
732 return (sizeof (struct tree_omp_clause
)
733 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
737 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
738 return (sizeof (struct tree_exp
)
739 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
741 return tree_code_size (code
);
745 /* Record interesting allocation statistics for a tree node with CODE
749 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
750 size_t length ATTRIBUTE_UNUSED
)
752 enum tree_code_class type
= TREE_CODE_CLASS (code
);
755 if (!GATHER_STATISTICS
)
760 case tcc_declaration
: /* A decl node */
764 case tcc_type
: /* a type node */
768 case tcc_statement
: /* an expression with side effects */
772 case tcc_reference
: /* a reference */
776 case tcc_expression
: /* an expression */
777 case tcc_comparison
: /* a comparison expression */
778 case tcc_unary
: /* a unary arithmetic expression */
779 case tcc_binary
: /* a binary arithmetic expression */
783 case tcc_constant
: /* a constant */
787 case tcc_exceptional
: /* something random, like an identifier. */
790 case IDENTIFIER_NODE
:
803 kind
= ssa_name_kind
;
815 kind
= omp_clause_kind
;
832 tree_code_counts
[(int) code
]++;
833 tree_node_counts
[(int) kind
]++;
834 tree_node_sizes
[(int) kind
] += length
;
837 /* Allocate and return a new UID from the DECL_UID namespace. */
840 allocate_decl_uid (void)
842 return next_decl_uid
++;
845 /* Return a newly allocated node of code CODE. For decl and type
846 nodes, some other fields are initialized. The rest of the node is
847 initialized to zero. This function cannot be used for TREE_VEC or
848 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
850 Achoo! I got a code in the node. */
853 make_node_stat (enum tree_code code MEM_STAT_DECL
)
856 enum tree_code_class type
= TREE_CODE_CLASS (code
);
857 size_t length
= tree_code_size (code
);
859 record_node_allocation_statistics (code
, length
);
861 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
862 TREE_SET_CODE (t
, code
);
867 TREE_SIDE_EFFECTS (t
) = 1;
870 case tcc_declaration
:
871 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
873 if (code
== FUNCTION_DECL
)
875 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
876 DECL_MODE (t
) = FUNCTION_MODE
;
881 DECL_SOURCE_LOCATION (t
) = input_location
;
882 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
883 DECL_UID (t
) = --next_debug_decl_uid
;
886 DECL_UID (t
) = allocate_decl_uid ();
887 SET_DECL_PT_UID (t
, -1);
889 if (TREE_CODE (t
) == LABEL_DECL
)
890 LABEL_DECL_UID (t
) = -1;
895 TYPE_UID (t
) = next_type_uid
++;
896 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
897 TYPE_USER_ALIGN (t
) = 0;
898 TYPE_MAIN_VARIANT (t
) = t
;
899 TYPE_CANONICAL (t
) = t
;
901 /* Default to no attributes for type, but let target change that. */
902 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
903 targetm
.set_default_type_attributes (t
);
905 /* We have not yet computed the alias set for this type. */
906 TYPE_ALIAS_SET (t
) = -1;
910 TREE_CONSTANT (t
) = 1;
919 case PREDECREMENT_EXPR
:
920 case PREINCREMENT_EXPR
:
921 case POSTDECREMENT_EXPR
:
922 case POSTINCREMENT_EXPR
:
923 /* All of these have side-effects, no matter what their
925 TREE_SIDE_EFFECTS (t
) = 1;
934 /* Other classes need no special treatment. */
941 /* Return a new node with the same contents as NODE except that its
942 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
945 copy_node_stat (tree node MEM_STAT_DECL
)
948 enum tree_code code
= TREE_CODE (node
);
951 gcc_assert (code
!= STATEMENT_LIST
);
953 length
= tree_size (node
);
954 record_node_allocation_statistics (code
, length
);
955 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
956 memcpy (t
, node
, length
);
958 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
960 TREE_ASM_WRITTEN (t
) = 0;
961 TREE_VISITED (t
) = 0;
963 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
965 if (code
== DEBUG_EXPR_DECL
)
966 DECL_UID (t
) = --next_debug_decl_uid
;
969 DECL_UID (t
) = allocate_decl_uid ();
970 if (DECL_PT_UID_SET_P (node
))
971 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
973 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
974 && DECL_HAS_VALUE_EXPR_P (node
))
976 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
977 DECL_HAS_VALUE_EXPR_P (t
) = 1;
979 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
980 if (TREE_CODE (node
) == VAR_DECL
)
981 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
982 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
984 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
985 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
987 if (TREE_CODE (node
) == FUNCTION_DECL
)
988 DECL_STRUCT_FUNCTION (t
) = NULL
;
990 else if (TREE_CODE_CLASS (code
) == tcc_type
)
992 TYPE_UID (t
) = next_type_uid
++;
993 /* The following is so that the debug code for
994 the copy is different from the original type.
995 The two statements usually duplicate each other
996 (because they clear fields of the same union),
997 but the optimizer should catch that. */
998 TYPE_SYMTAB_POINTER (t
) = 0;
999 TYPE_SYMTAB_ADDRESS (t
) = 0;
1001 /* Do not copy the values cache. */
1002 if (TYPE_CACHED_VALUES_P(t
))
1004 TYPE_CACHED_VALUES_P (t
) = 0;
1005 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1008 if (TYPE_HAS_BLOCK_FACTOR (node
))
1009 SET_TYPE_BLOCK_FACTOR (t
, TYPE_BLOCK_FACTOR (node
));
1015 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1016 For example, this can copy a list made of TREE_LIST nodes. */
1019 copy_list (tree list
)
1027 head
= prev
= copy_node (list
);
1028 next
= TREE_CHAIN (list
);
1031 TREE_CHAIN (prev
) = copy_node (next
);
1032 prev
= TREE_CHAIN (prev
);
1033 next
= TREE_CHAIN (next
);
1039 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1042 build_int_cst (tree type
, HOST_WIDE_INT low
)
1044 /* Support legacy code. */
1046 type
= integer_type_node
;
1048 return double_int_to_tree (type
, double_int::from_shwi (low
));
1051 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1054 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1058 return double_int_to_tree (type
, double_int::from_shwi (low
));
1061 /* Constructs tree in type TYPE from with value given by CST. Signedness
1062 of CST is assumed to be the same as the signedness of TYPE. */
1065 double_int_to_tree (tree type
, double_int cst
)
1067 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1069 cst
= cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1071 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1074 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1075 to be the same as the signedness of TYPE. */
1078 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1080 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1083 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1088 /* We force the double_int CST to the range of the type TYPE by sign or
1089 zero extending it. OVERFLOWABLE indicates if we are interested in
1090 overflow of the value, when >0 we are only interested in signed
1091 overflow, for <0 we are interested in any overflow. OVERFLOWED
1092 indicates whether overflow has already occurred. CONST_OVERFLOWED
1093 indicates whether constant overflow has already occurred. We force
1094 T's value to be within range of T's type (by setting to 0 or 1 all
1095 the bits outside the type's range). We set TREE_OVERFLOWED if,
1096 OVERFLOWED is nonzero,
1097 or OVERFLOWABLE is >0 and signed overflow occurs
1098 or OVERFLOWABLE is <0 and any overflow occurs
1099 We return a new tree node for the extended double_int. The node
1100 is shared if no overflow flags are set. */
1104 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1107 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1109 /* If we need to set overflow flags, return a new unshared node. */
1110 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1114 || (overflowable
> 0 && sign_extended_type
))
1116 tree t
= make_node (INTEGER_CST
);
1118 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1119 TREE_TYPE (t
) = type
;
1120 TREE_OVERFLOW (t
) = 1;
1125 /* Else build a shared node. */
1126 return double_int_to_tree (type
, cst
);
1129 /* These are the hash table functions for the hash table of INTEGER_CST
1130 nodes of a sizetype. */
1132 /* Return the hash code code X, an INTEGER_CST. */
1135 int_cst_hash_hash (const void *x
)
1137 const_tree
const t
= (const_tree
) x
;
1139 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1140 ^ htab_hash_pointer (TREE_TYPE (t
)));
1143 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1144 is the same as that given by *Y, which is the same. */
1147 int_cst_hash_eq (const void *x
, const void *y
)
1149 const_tree
const xt
= (const_tree
) x
;
1150 const_tree
const yt
= (const_tree
) y
;
1152 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1153 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1154 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1157 /* Create an INT_CST node of TYPE and value HI:LOW.
1158 The returned node is always shared. For small integers we use a
1159 per-type vector cache, for larger ones we use a single hash table. */
1162 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1170 switch (TREE_CODE (type
))
1173 gcc_assert (hi
== 0 && low
== 0);
1177 case REFERENCE_TYPE
:
1178 /* Cache NULL pointer. */
1187 /* Cache false or true. */
1195 if (TYPE_UNSIGNED (type
))
1198 limit
= INTEGER_SHARE_LIMIT
;
1199 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1205 limit
= INTEGER_SHARE_LIMIT
+ 1;
1206 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1208 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1222 /* Look for it in the type's vector of small shared ints. */
1223 if (!TYPE_CACHED_VALUES_P (type
))
1225 TYPE_CACHED_VALUES_P (type
) = 1;
1226 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1229 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1232 /* Make sure no one is clobbering the shared constant. */
1233 gcc_assert (TREE_TYPE (t
) == type
);
1234 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1235 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1239 /* Create a new shared int. */
1240 t
= make_node (INTEGER_CST
);
1242 TREE_INT_CST_LOW (t
) = low
;
1243 TREE_INT_CST_HIGH (t
) = hi
;
1244 TREE_TYPE (t
) = type
;
1246 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1251 /* Use the cache of larger shared ints. */
1254 TREE_INT_CST_LOW (int_cst_node
) = low
;
1255 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1256 TREE_TYPE (int_cst_node
) = type
;
1258 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1262 /* Insert this one into the hash table. */
1265 /* Make a new node for next time round. */
1266 int_cst_node
= make_node (INTEGER_CST
);
1274 cache_integer_cst (tree t
)
1276 tree type
= TREE_TYPE (t
);
1277 HOST_WIDE_INT hi
= TREE_INT_CST_HIGH (t
);
1278 unsigned HOST_WIDE_INT low
= TREE_INT_CST_LOW (t
);
1282 gcc_assert (!TREE_OVERFLOW (t
));
1284 switch (TREE_CODE (type
))
1287 gcc_assert (hi
== 0 && low
== 0);
1291 case REFERENCE_TYPE
:
1292 /* Cache NULL pointer. */
1301 /* Cache false or true. */
1309 if (TYPE_UNSIGNED (type
))
1312 limit
= INTEGER_SHARE_LIMIT
;
1313 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1319 limit
= INTEGER_SHARE_LIMIT
+ 1;
1320 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1322 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1336 /* Look for it in the type's vector of small shared ints. */
1337 if (!TYPE_CACHED_VALUES_P (type
))
1339 TYPE_CACHED_VALUES_P (type
) = 1;
1340 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1343 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1344 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1348 /* Use the cache of larger shared ints. */
1351 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1352 /* If there is already an entry for the number verify it's the
1356 gcc_assert (TREE_INT_CST_LOW ((tree
)*slot
) == low
1357 && TREE_INT_CST_HIGH ((tree
)*slot
) == hi
);
1360 /* Otherwise insert this one into the hash table. */
1366 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1367 and the rest are zeros. */
1370 build_low_bits_mask (tree type
, unsigned bits
)
1374 gcc_assert (bits
<= TYPE_PRECISION (type
));
1376 if (bits
== TYPE_PRECISION (type
)
1377 && !TYPE_UNSIGNED (type
))
1378 /* Sign extended all-ones mask. */
1379 mask
= double_int_minus_one
;
1381 mask
= double_int::mask (bits
);
1383 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1386 /* Checks that X is integer constant that can be expressed in (unsigned)
1387 HOST_WIDE_INT without loss of precision. */
1390 cst_and_fits_in_hwi (const_tree x
)
1392 if (TREE_CODE (x
) != INTEGER_CST
)
1395 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1398 return (TREE_INT_CST_HIGH (x
) == 0
1399 || TREE_INT_CST_HIGH (x
) == -1);
1402 /* Build a newly constructed TREE_VEC node of length LEN. */
1405 make_vector_stat (unsigned len MEM_STAT_DECL
)
1408 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1410 record_node_allocation_statistics (VECTOR_CST
, length
);
1412 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1414 TREE_SET_CODE (t
, VECTOR_CST
);
1415 TREE_CONSTANT (t
) = 1;
1420 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1421 are in a list pointed to by VALS. */
1424 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1428 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1429 TREE_TYPE (v
) = type
;
1431 /* Iterate through elements and check for overflow. */
1432 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1434 tree value
= vals
[cnt
];
1436 VECTOR_CST_ELT (v
, cnt
) = value
;
1438 /* Don't crash if we get an address constant. */
1439 if (!CONSTANT_CLASS_P (value
))
1442 over
|= TREE_OVERFLOW (value
);
1445 TREE_OVERFLOW (v
) = over
;
1449 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1450 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1453 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1455 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1456 unsigned HOST_WIDE_INT idx
;
1459 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1461 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1462 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1464 return build_vector (type
, vec
);
1467 /* Build a vector of type VECTYPE where all the elements are SCs. */
1469 build_vector_from_val (tree vectype
, tree sc
)
1471 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1473 if (sc
== error_mark_node
)
1476 /* Verify that the vector type is suitable for SC. Note that there
1477 is some inconsistency in the type-system with respect to restrict
1478 qualifications of pointers. Vector types always have a main-variant
1479 element type and the qualification is applied to the vector-type.
1480 So TREE_TYPE (vector-type) does not return a properly qualified
1481 vector element-type. */
1482 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1483 TREE_TYPE (vectype
)));
1485 if (CONSTANT_CLASS_P (sc
))
1487 tree
*v
= XALLOCAVEC (tree
, nunits
);
1488 for (i
= 0; i
< nunits
; ++i
)
1490 return build_vector (vectype
, v
);
1494 vec
<constructor_elt
, va_gc
> *v
;
1495 vec_alloc (v
, nunits
);
1496 for (i
= 0; i
< nunits
; ++i
)
1497 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1498 return build_constructor (vectype
, v
);
1502 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1503 are in the vec pointed to by VALS. */
1505 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1507 tree c
= make_node (CONSTRUCTOR
);
1509 constructor_elt
*elt
;
1510 bool constant_p
= true;
1511 bool side_effects_p
= false;
1513 TREE_TYPE (c
) = type
;
1514 CONSTRUCTOR_ELTS (c
) = vals
;
1516 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1518 /* Mostly ctors will have elts that don't have side-effects, so
1519 the usual case is to scan all the elements. Hence a single
1520 loop for both const and side effects, rather than one loop
1521 each (with early outs). */
1522 if (!TREE_CONSTANT (elt
->value
))
1524 if (TREE_SIDE_EFFECTS (elt
->value
))
1525 side_effects_p
= true;
1528 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1529 TREE_CONSTANT (c
) = constant_p
;
1534 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1537 build_constructor_single (tree type
, tree index
, tree value
)
1539 vec
<constructor_elt
, va_gc
> *v
;
1540 constructor_elt elt
= {index
, value
};
1543 v
->quick_push (elt
);
1545 return build_constructor (type
, v
);
1549 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1550 are in a list pointed to by VALS. */
1552 build_constructor_from_list (tree type
, tree vals
)
1555 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1559 vec_alloc (v
, list_length (vals
));
1560 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1561 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1564 return build_constructor (type
, v
);
1567 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1568 of elements, provided as index/value pairs. */
1571 build_constructor_va (tree type
, int nelts
, ...)
1573 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1576 va_start (p
, nelts
);
1577 vec_alloc (v
, nelts
);
1580 tree index
= va_arg (p
, tree
);
1581 tree value
= va_arg (p
, tree
);
1582 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1585 return build_constructor (type
, v
);
1588 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1591 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1594 FIXED_VALUE_TYPE
*fp
;
1596 v
= make_node (FIXED_CST
);
1597 fp
= ggc_alloc_fixed_value ();
1598 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1600 TREE_TYPE (v
) = type
;
1601 TREE_FIXED_CST_PTR (v
) = fp
;
1605 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1608 build_real (tree type
, REAL_VALUE_TYPE d
)
1611 REAL_VALUE_TYPE
*dp
;
1614 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1615 Consider doing it via real_convert now. */
1617 v
= make_node (REAL_CST
);
1618 dp
= ggc_alloc_real_value ();
1619 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1621 TREE_TYPE (v
) = type
;
1622 TREE_REAL_CST_PTR (v
) = dp
;
1623 TREE_OVERFLOW (v
) = overflow
;
1627 /* Return a new REAL_CST node whose type is TYPE
1628 and whose value is the integer value of the INTEGER_CST node I. */
1631 real_value_from_int_cst (const_tree type
, const_tree i
)
1635 /* Clear all bits of the real value type so that we can later do
1636 bitwise comparisons to see if two values are the same. */
1637 memset (&d
, 0, sizeof d
);
1639 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1640 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1641 TYPE_UNSIGNED (TREE_TYPE (i
)));
1645 /* Given a tree representing an integer constant I, return a tree
1646 representing the same value as a floating-point constant of type TYPE. */
1649 build_real_from_int_cst (tree type
, const_tree i
)
1652 int overflow
= TREE_OVERFLOW (i
);
1654 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1656 TREE_OVERFLOW (v
) |= overflow
;
1660 /* Return a newly constructed STRING_CST node whose value is
1661 the LEN characters at STR.
1662 Note that for a C string literal, LEN should include the trailing NUL.
1663 The TREE_TYPE is not initialized. */
1666 build_string (int len
, const char *str
)
1671 /* Do not waste bytes provided by padding of struct tree_string. */
1672 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1674 record_node_allocation_statistics (STRING_CST
, length
);
1676 s
= ggc_alloc_tree_node (length
);
1678 memset (s
, 0, sizeof (struct tree_typed
));
1679 TREE_SET_CODE (s
, STRING_CST
);
1680 TREE_CONSTANT (s
) = 1;
1681 TREE_STRING_LENGTH (s
) = len
;
1682 memcpy (s
->string
.str
, str
, len
);
1683 s
->string
.str
[len
] = '\0';
1688 /* Return a newly constructed COMPLEX_CST node whose value is
1689 specified by the real and imaginary parts REAL and IMAG.
1690 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1691 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1694 build_complex (tree type
, tree real
, tree imag
)
1696 tree t
= make_node (COMPLEX_CST
);
1698 TREE_REALPART (t
) = real
;
1699 TREE_IMAGPART (t
) = imag
;
1700 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1701 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1705 /* Return a constant of arithmetic type TYPE which is the
1706 multiplicative identity of the set TYPE. */
1709 build_one_cst (tree type
)
1711 switch (TREE_CODE (type
))
1713 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1714 case POINTER_TYPE
: case REFERENCE_TYPE
:
1716 return build_int_cst (type
, 1);
1719 return build_real (type
, dconst1
);
1721 case FIXED_POINT_TYPE
:
1722 /* We can only generate 1 for accum types. */
1723 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1724 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1728 tree scalar
= build_one_cst (TREE_TYPE (type
));
1730 return build_vector_from_val (type
, scalar
);
1734 return build_complex (type
,
1735 build_one_cst (TREE_TYPE (type
)),
1736 build_zero_cst (TREE_TYPE (type
)));
1743 /* Return an integer of type TYPE containing all 1's in as much precision as
1744 it contains, or a complex or vector whose subparts are such integers. */
1747 build_all_ones_cst (tree type
)
1749 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1751 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1752 return build_complex (type
, scalar
, scalar
);
1755 return build_minus_one_cst (type
);
1758 /* Return a constant of arithmetic type TYPE which is the
1759 opposite of the multiplicative identity of the set TYPE. */
1762 build_minus_one_cst (tree type
)
1764 switch (TREE_CODE (type
))
1766 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1767 case POINTER_TYPE
: case REFERENCE_TYPE
:
1769 return build_int_cst (type
, -1);
1772 return build_real (type
, dconstm1
);
1774 case FIXED_POINT_TYPE
:
1775 /* We can only generate 1 for accum types. */
1776 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1777 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1782 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1784 return build_vector_from_val (type
, scalar
);
1788 return build_complex (type
,
1789 build_minus_one_cst (TREE_TYPE (type
)),
1790 build_zero_cst (TREE_TYPE (type
)));
1797 /* Build 0 constant of type TYPE. This is used by constructor folding
1798 and thus the constant should be represented in memory by
1802 build_zero_cst (tree type
)
1804 switch (TREE_CODE (type
))
1806 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1807 case POINTER_TYPE
: case REFERENCE_TYPE
:
1808 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1809 return build_int_cst (type
, 0);
1812 return build_real (type
, dconst0
);
1814 case FIXED_POINT_TYPE
:
1815 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1819 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1821 return build_vector_from_val (type
, scalar
);
1826 tree zero
= build_zero_cst (TREE_TYPE (type
));
1828 return build_complex (type
, zero
, zero
);
1832 if (!AGGREGATE_TYPE_P (type
))
1833 return fold_convert (type
, integer_zero_node
);
1834 return build_constructor (type
, NULL
);
1839 /* Build a BINFO with LEN language slots. */
1842 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1845 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1846 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1848 record_node_allocation_statistics (TREE_BINFO
, length
);
1850 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1852 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1854 TREE_SET_CODE (t
, TREE_BINFO
);
1856 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1861 /* Create a CASE_LABEL_EXPR tree node and return it. */
1864 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1866 tree t
= make_node (CASE_LABEL_EXPR
);
1868 TREE_TYPE (t
) = void_type_node
;
1869 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1871 CASE_LOW (t
) = low_value
;
1872 CASE_HIGH (t
) = high_value
;
1873 CASE_LABEL (t
) = label_decl
;
1874 CASE_CHAIN (t
) = NULL_TREE
;
1879 /* Build a newly constructed TREE_VEC node of length LEN. */
1882 make_tree_vec_stat (int len MEM_STAT_DECL
)
1885 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1887 record_node_allocation_statistics (TREE_VEC
, length
);
1889 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1891 TREE_SET_CODE (t
, TREE_VEC
);
1892 TREE_VEC_LENGTH (t
) = len
;
1897 /* Return 1 if EXPR is the integer constant zero or a complex constant
1901 integer_zerop (const_tree expr
)
1905 switch (TREE_CODE (expr
))
1908 return (TREE_INT_CST_LOW (expr
) == 0
1909 && TREE_INT_CST_HIGH (expr
) == 0);
1911 return (integer_zerop (TREE_REALPART (expr
))
1912 && integer_zerop (TREE_IMAGPART (expr
)));
1916 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1917 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1926 /* Return 1 if EXPR is the integer constant one or the corresponding
1927 complex constant. */
1930 integer_onep (const_tree expr
)
1934 switch (TREE_CODE (expr
))
1937 return (TREE_INT_CST_LOW (expr
) == 1
1938 && TREE_INT_CST_HIGH (expr
) == 0);
1940 return (integer_onep (TREE_REALPART (expr
))
1941 && integer_zerop (TREE_IMAGPART (expr
)));
1945 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1946 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1955 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1956 it contains, or a complex or vector whose subparts are such integers. */
1959 integer_all_onesp (const_tree expr
)
1966 if (TREE_CODE (expr
) == COMPLEX_CST
1967 && integer_all_onesp (TREE_REALPART (expr
))
1968 && integer_all_onesp (TREE_IMAGPART (expr
)))
1971 else if (TREE_CODE (expr
) == VECTOR_CST
)
1974 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1975 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1980 else if (TREE_CODE (expr
) != INTEGER_CST
)
1983 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1984 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1985 && TREE_INT_CST_HIGH (expr
) == -1)
1990 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1991 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1993 HOST_WIDE_INT high_value
;
1996 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1998 /* Can not handle precisions greater than twice the host int size. */
1999 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
2000 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
2001 /* Shifting by the host word size is undefined according to the ANSI
2002 standard, so we must handle this as a special case. */
2005 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
2007 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
2008 && TREE_INT_CST_HIGH (expr
) == high_value
);
2011 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
2014 /* Return 1 if EXPR is the integer constant minus one. */
2017 integer_minus_onep (const_tree expr
)
2021 if (TREE_CODE (expr
) == COMPLEX_CST
)
2022 return (integer_all_onesp (TREE_REALPART (expr
))
2023 && integer_zerop (TREE_IMAGPART (expr
)));
2025 return integer_all_onesp (expr
);
2028 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2032 integer_pow2p (const_tree expr
)
2035 unsigned HOST_WIDE_INT high
, low
;
2039 if (TREE_CODE (expr
) == COMPLEX_CST
2040 && integer_pow2p (TREE_REALPART (expr
))
2041 && integer_zerop (TREE_IMAGPART (expr
)))
2044 if (TREE_CODE (expr
) != INTEGER_CST
)
2047 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2048 high
= TREE_INT_CST_HIGH (expr
);
2049 low
= TREE_INT_CST_LOW (expr
);
2051 /* First clear all bits that are beyond the type's precision in case
2052 we've been sign extended. */
2054 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
2056 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2057 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
2061 if (prec
< HOST_BITS_PER_WIDE_INT
)
2062 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
2065 if (high
== 0 && low
== 0)
2068 return ((high
== 0 && (low
& (low
- 1)) == 0)
2069 || (low
== 0 && (high
& (high
- 1)) == 0));
2072 /* Return 1 if EXPR is an integer constant other than zero or a
2073 complex constant other than zero. */
2076 integer_nonzerop (const_tree expr
)
2080 return ((TREE_CODE (expr
) == INTEGER_CST
2081 && (TREE_INT_CST_LOW (expr
) != 0
2082 || TREE_INT_CST_HIGH (expr
) != 0))
2083 || (TREE_CODE (expr
) == COMPLEX_CST
2084 && (integer_nonzerop (TREE_REALPART (expr
))
2085 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2088 /* Return 1 if EXPR is the fixed-point constant zero. */
2091 fixed_zerop (const_tree expr
)
2093 return (TREE_CODE (expr
) == FIXED_CST
2094 && TREE_FIXED_CST (expr
).data
.is_zero ());
2097 /* Return the power of two represented by a tree node known to be a
2101 tree_log2 (const_tree expr
)
2104 HOST_WIDE_INT high
, low
;
2108 if (TREE_CODE (expr
) == COMPLEX_CST
)
2109 return tree_log2 (TREE_REALPART (expr
));
2111 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2112 high
= TREE_INT_CST_HIGH (expr
);
2113 low
= TREE_INT_CST_LOW (expr
);
2115 /* First clear all bits that are beyond the type's precision in case
2116 we've been sign extended. */
2118 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
2120 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2121 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
2125 if (prec
< HOST_BITS_PER_WIDE_INT
)
2126 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
2129 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
2130 : exact_log2 (low
));
2133 /* Similar, but return the largest integer Y such that 2 ** Y is less
2134 than or equal to EXPR. */
2137 tree_floor_log2 (const_tree expr
)
2140 HOST_WIDE_INT high
, low
;
2144 if (TREE_CODE (expr
) == COMPLEX_CST
)
2145 return tree_log2 (TREE_REALPART (expr
));
2147 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2148 high
= TREE_INT_CST_HIGH (expr
);
2149 low
= TREE_INT_CST_LOW (expr
);
2151 /* First clear all bits that are beyond the type's precision in case
2152 we've been sign extended. Ignore if type's precision hasn't been set
2153 since what we are doing is setting it. */
2155 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
2157 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2158 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
2162 if (prec
< HOST_BITS_PER_WIDE_INT
)
2163 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
2166 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
2167 : floor_log2 (low
));
2170 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2171 decimal float constants, so don't return 1 for them. */
2174 real_zerop (const_tree expr
)
2178 switch (TREE_CODE (expr
))
2181 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2182 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2184 return real_zerop (TREE_REALPART (expr
))
2185 && real_zerop (TREE_IMAGPART (expr
));
2189 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2190 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2199 /* Return 1 if EXPR is the real constant one in real or complex form.
2200 Trailing zeroes matter for decimal float constants, so don't return
2204 real_onep (const_tree expr
)
2208 switch (TREE_CODE (expr
))
2211 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2212 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2214 return real_onep (TREE_REALPART (expr
))
2215 && real_zerop (TREE_IMAGPART (expr
));
2219 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2220 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2229 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2230 for decimal float constants, so don't return 1 for them. */
2233 real_twop (const_tree expr
)
2237 switch (TREE_CODE (expr
))
2240 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2241 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2243 return real_twop (TREE_REALPART (expr
))
2244 && real_zerop (TREE_IMAGPART (expr
));
2248 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2249 if (!real_twop (VECTOR_CST_ELT (expr
, i
)))
2258 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2259 matter for decimal float constants, so don't return 1 for them. */
2262 real_minus_onep (const_tree expr
)
2266 switch (TREE_CODE (expr
))
2269 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2270 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2272 return real_minus_onep (TREE_REALPART (expr
))
2273 && real_zerop (TREE_IMAGPART (expr
));
2277 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2278 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2287 /* Nonzero if EXP is a constant or a cast of a constant. */
2290 really_constant_p (const_tree exp
)
2292 /* This is not quite the same as STRIP_NOPS. It does more. */
2293 while (CONVERT_EXPR_P (exp
)
2294 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2295 exp
= TREE_OPERAND (exp
, 0);
2296 return TREE_CONSTANT (exp
);
2299 /* Return first list element whose TREE_VALUE is ELEM.
2300 Return 0 if ELEM is not in LIST. */
2303 value_member (tree elem
, tree list
)
2307 if (elem
== TREE_VALUE (list
))
2309 list
= TREE_CHAIN (list
);
2314 /* Return first list element whose TREE_PURPOSE is ELEM.
2315 Return 0 if ELEM is not in LIST. */
2318 purpose_member (const_tree elem
, tree list
)
2322 if (elem
== TREE_PURPOSE (list
))
2324 list
= TREE_CHAIN (list
);
2329 /* Return true if ELEM is in V. */
2332 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2336 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2342 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2346 chain_index (int idx
, tree chain
)
2348 for (; chain
&& idx
> 0; --idx
)
2349 chain
= TREE_CHAIN (chain
);
2353 /* Return nonzero if ELEM is part of the chain CHAIN. */
2356 chain_member (const_tree elem
, const_tree chain
)
2362 chain
= DECL_CHAIN (chain
);
2368 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2369 We expect a null pointer to mark the end of the chain.
2370 This is the Lisp primitive `length'. */
2373 list_length (const_tree t
)
2376 #ifdef ENABLE_TREE_CHECKING
2384 #ifdef ENABLE_TREE_CHECKING
2387 gcc_assert (p
!= q
);
2395 /* Returns the number of FIELD_DECLs in TYPE. */
2398 fields_length (const_tree type
)
2400 tree t
= TYPE_FIELDS (type
);
2403 for (; t
; t
= DECL_CHAIN (t
))
2404 if (TREE_CODE (t
) == FIELD_DECL
)
2410 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2411 UNION_TYPE TYPE, or NULL_TREE if none. */
2414 first_field (const_tree type
)
2416 tree t
= TYPE_FIELDS (type
);
2417 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2422 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2423 by modifying the last node in chain 1 to point to chain 2.
2424 This is the Lisp primitive `nconc'. */
2427 chainon (tree op1
, tree op2
)
2436 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2438 TREE_CHAIN (t1
) = op2
;
2440 #ifdef ENABLE_TREE_CHECKING
2443 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2444 gcc_assert (t2
!= t1
);
2451 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2454 tree_last (tree chain
)
2458 while ((next
= TREE_CHAIN (chain
)))
2463 /* Reverse the order of elements in the chain T,
2464 and return the new head of the chain (old last element). */
2469 tree prev
= 0, decl
, next
;
2470 for (decl
= t
; decl
; decl
= next
)
2472 /* We shouldn't be using this function to reverse BLOCK chains; we
2473 have blocks_nreverse for that. */
2474 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2475 next
= TREE_CHAIN (decl
);
2476 TREE_CHAIN (decl
) = prev
;
2482 /* Return a newly created TREE_LIST node whose
2483 purpose and value fields are PARM and VALUE. */
2486 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2488 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2489 TREE_PURPOSE (t
) = parm
;
2490 TREE_VALUE (t
) = value
;
2494 /* Build a chain of TREE_LIST nodes from a vector. */
2497 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2499 tree ret
= NULL_TREE
;
2503 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2505 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2506 pp
= &TREE_CHAIN (*pp
);
2511 /* Return a newly created TREE_LIST node whose
2512 purpose and value fields are PURPOSE and VALUE
2513 and whose TREE_CHAIN is CHAIN. */
2516 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2520 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2521 memset (node
, 0, sizeof (struct tree_common
));
2523 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2525 TREE_SET_CODE (node
, TREE_LIST
);
2526 TREE_CHAIN (node
) = chain
;
2527 TREE_PURPOSE (node
) = purpose
;
2528 TREE_VALUE (node
) = value
;
2532 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2536 ctor_to_vec (tree ctor
)
2538 vec
<tree
, va_gc
> *vec
;
2539 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2543 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2544 vec
->quick_push (val
);
2549 /* Return the size nominally occupied by an object of type TYPE
2550 when it resides in memory. The value is measured in units of bytes,
2551 and its data type is that normally used for type sizes
2552 (which is the first type created by make_signed_type or
2553 make_unsigned_type). */
2556 size_in_bytes (const_tree type
)
2560 if (type
== error_mark_node
)
2561 return integer_zero_node
;
2563 type
= TYPE_MAIN_VARIANT (type
);
2564 t
= TYPE_SIZE_UNIT (type
);
2568 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2569 return size_zero_node
;
2575 /* Return the size of TYPE (in bytes) as a wide integer
2576 or return -1 if the size can vary or is larger than an integer. */
2579 int_size_in_bytes (const_tree type
)
2583 if (type
== error_mark_node
)
2586 type
= TYPE_MAIN_VARIANT (type
);
2587 t
= TYPE_SIZE_UNIT (type
);
2589 || TREE_CODE (t
) != INTEGER_CST
2590 || TREE_INT_CST_HIGH (t
) != 0
2591 /* If the result would appear negative, it's too big to represent. */
2592 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2595 return TREE_INT_CST_LOW (t
);
2598 /* Return the maximum size of TYPE (in bytes) as a wide integer
2599 or return -1 if the size can vary or is larger than an integer. */
2602 max_int_size_in_bytes (const_tree type
)
2604 HOST_WIDE_INT size
= -1;
2607 /* If this is an array type, check for a possible MAX_SIZE attached. */
2609 if (TREE_CODE (type
) == ARRAY_TYPE
)
2611 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2613 if (size_tree
&& host_integerp (size_tree
, 1))
2614 size
= tree_low_cst (size_tree
, 1);
2617 /* If we still haven't been able to get a size, see if the language
2618 can compute a maximum size. */
2622 size_tree
= lang_hooks
.types
.max_size (type
);
2624 if (size_tree
&& host_integerp (size_tree
, 1))
2625 size
= tree_low_cst (size_tree
, 1);
2631 /* Returns a tree for the size of EXP in bytes. */
2634 tree_expr_size (const_tree exp
)
2637 && DECL_SIZE_UNIT (exp
) != 0)
2638 return DECL_SIZE_UNIT (exp
);
2640 return size_in_bytes (TREE_TYPE (exp
));
2643 /* Return the bit position of FIELD, in bits from the start of the record.
2644 This is a tree of type bitsizetype. */
2647 bit_position (const_tree field
)
2649 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2650 DECL_FIELD_BIT_OFFSET (field
));
2653 /* Likewise, but return as an integer. It must be representable in
2654 that way (since it could be a signed value, we don't have the
2655 option of returning -1 like int_size_in_byte can. */
2658 int_bit_position (const_tree field
)
2660 return tree_low_cst (bit_position (field
), 0);
2663 /* Return the byte position of FIELD, in bytes from the start of the record.
2664 This is a tree of type sizetype. */
2667 byte_position (const_tree field
)
2669 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2670 DECL_FIELD_BIT_OFFSET (field
));
2673 /* Likewise, but return as an integer. It must be representable in
2674 that way (since it could be a signed value, we don't have the
2675 option of returning -1 like int_size_in_byte can. */
2678 int_byte_position (const_tree field
)
2680 return tree_low_cst (byte_position (field
), 0);
2683 /* Return the strictest alignment, in bits, that T is known to have. */
2686 expr_align (const_tree t
)
2688 unsigned int align0
, align1
;
2690 switch (TREE_CODE (t
))
2692 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2693 /* If we have conversions, we know that the alignment of the
2694 object must meet each of the alignments of the types. */
2695 align0
= expr_align (TREE_OPERAND (t
, 0));
2696 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2697 return MAX (align0
, align1
);
2699 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2700 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2701 case CLEANUP_POINT_EXPR
:
2702 /* These don't change the alignment of an object. */
2703 return expr_align (TREE_OPERAND (t
, 0));
2706 /* The best we can do is say that the alignment is the least aligned
2708 align0
= expr_align (TREE_OPERAND (t
, 1));
2709 align1
= expr_align (TREE_OPERAND (t
, 2));
2710 return MIN (align0
, align1
);
2712 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2713 meaningfully, it's always 1. */
2714 case LABEL_DECL
: case CONST_DECL
:
2715 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2717 gcc_assert (DECL_ALIGN (t
) != 0);
2718 return DECL_ALIGN (t
);
2724 /* Otherwise take the alignment from that of the type. */
2725 return TYPE_ALIGN (TREE_TYPE (t
));
2728 /* Return, as a tree node, the number of elements for TYPE (which is an
2729 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2732 array_type_nelts (const_tree type
)
2734 tree index_type
, min
, max
;
2736 /* If they did it with unspecified bounds, then we should have already
2737 given an error about it before we got here. */
2738 if (! TYPE_DOMAIN (type
))
2739 return error_mark_node
;
2741 index_type
= TYPE_DOMAIN (type
);
2742 min
= TYPE_MIN_VALUE (index_type
);
2743 max
= TYPE_MAX_VALUE (index_type
);
2745 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2747 return error_mark_node
;
2749 return (integer_zerop (min
)
2751 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2754 /* If arg is static -- a reference to an object in static storage -- then
2755 return the object. This is not the same as the C meaning of `static'.
2756 If arg isn't static, return NULL. */
2761 switch (TREE_CODE (arg
))
2764 /* Nested functions are static, even though taking their address will
2765 involve a trampoline as we unnest the nested function and create
2766 the trampoline on the tree level. */
2770 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2771 && ! DECL_THREAD_LOCAL_P (arg
)
2772 && ! DECL_DLLIMPORT_P (arg
)
2776 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2780 return TREE_STATIC (arg
) ? arg
: NULL
;
2787 /* If the thing being referenced is not a field, then it is
2788 something language specific. */
2789 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2791 /* If we are referencing a bitfield, we can't evaluate an
2792 ADDR_EXPR at compile time and so it isn't a constant. */
2793 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2796 return staticp (TREE_OPERAND (arg
, 0));
2802 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2805 case ARRAY_RANGE_REF
:
2806 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2807 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2808 return staticp (TREE_OPERAND (arg
, 0));
2812 case COMPOUND_LITERAL_EXPR
:
2813 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2823 /* Return whether OP is a DECL whose address is function-invariant. */
2826 decl_address_invariant_p (const_tree op
)
2828 /* The conditions below are slightly less strict than the one in
2831 switch (TREE_CODE (op
))
2840 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2841 || DECL_THREAD_LOCAL_P (op
)
2842 || DECL_CONTEXT (op
) == current_function_decl
2843 || decl_function_context (op
) == current_function_decl
)
2848 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2849 || decl_function_context (op
) == current_function_decl
)
2860 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2863 decl_address_ip_invariant_p (const_tree op
)
2865 /* The conditions below are slightly less strict than the one in
2868 switch (TREE_CODE (op
))
2876 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2877 && !DECL_DLLIMPORT_P (op
))
2878 || DECL_THREAD_LOCAL_P (op
))
2883 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2895 /* Return true if T is function-invariant (internal function, does
2896 not handle arithmetic; that's handled in skip_simple_arithmetic and
2897 tree_invariant_p). */
2899 static bool tree_invariant_p (tree t
);
2902 tree_invariant_p_1 (tree t
)
2906 if (TREE_CONSTANT (t
)
2907 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2910 switch (TREE_CODE (t
))
2916 op
= TREE_OPERAND (t
, 0);
2917 while (handled_component_p (op
))
2919 switch (TREE_CODE (op
))
2922 case ARRAY_RANGE_REF
:
2923 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2924 || TREE_OPERAND (op
, 2) != NULL_TREE
2925 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2930 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2936 op
= TREE_OPERAND (op
, 0);
2939 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2948 /* Return true if T is function-invariant. */
2951 tree_invariant_p (tree t
)
2953 tree inner
= skip_simple_arithmetic (t
);
2954 return tree_invariant_p_1 (inner
);
2957 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2958 Do this to any expression which may be used in more than one place,
2959 but must be evaluated only once.
2961 Normally, expand_expr would reevaluate the expression each time.
2962 Calling save_expr produces something that is evaluated and recorded
2963 the first time expand_expr is called on it. Subsequent calls to
2964 expand_expr just reuse the recorded value.
2966 The call to expand_expr that generates code that actually computes
2967 the value is the first call *at compile time*. Subsequent calls
2968 *at compile time* generate code to use the saved value.
2969 This produces correct result provided that *at run time* control
2970 always flows through the insns made by the first expand_expr
2971 before reaching the other places where the save_expr was evaluated.
2972 You, the caller of save_expr, must make sure this is so.
2974 Constants, and certain read-only nodes, are returned with no
2975 SAVE_EXPR because that is safe. Expressions containing placeholders
2976 are not touched; see tree.def for an explanation of what these
2980 save_expr (tree expr
)
2982 tree t
= fold (expr
);
2985 /* If the tree evaluates to a constant, then we don't want to hide that
2986 fact (i.e. this allows further folding, and direct checks for constants).
2987 However, a read-only object that has side effects cannot be bypassed.
2988 Since it is no problem to reevaluate literals, we just return the
2990 inner
= skip_simple_arithmetic (t
);
2991 if (TREE_CODE (inner
) == ERROR_MARK
)
2994 if (tree_invariant_p_1 (inner
))
2997 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2998 it means that the size or offset of some field of an object depends on
2999 the value within another field.
3001 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3002 and some variable since it would then need to be both evaluated once and
3003 evaluated more than once. Front-ends must assure this case cannot
3004 happen by surrounding any such subexpressions in their own SAVE_EXPR
3005 and forcing evaluation at the proper time. */
3006 if (contains_placeholder_p (inner
))
3009 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3010 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3012 /* This expression might be placed ahead of a jump to ensure that the
3013 value was computed on both sides of the jump. So make sure it isn't
3014 eliminated as dead. */
3015 TREE_SIDE_EFFECTS (t
) = 1;
3019 /* Look inside EXPR into any simple arithmetic operations. Return the
3020 outermost non-arithmetic or non-invariant node. */
3023 skip_simple_arithmetic (tree expr
)
3025 /* We don't care about whether this can be used as an lvalue in this
3027 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3028 expr
= TREE_OPERAND (expr
, 0);
3030 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3031 a constant, it will be more efficient to not make another SAVE_EXPR since
3032 it will allow better simplification and GCSE will be able to merge the
3033 computations if they actually occur. */
3036 if (UNARY_CLASS_P (expr
))
3037 expr
= TREE_OPERAND (expr
, 0);
3038 else if (BINARY_CLASS_P (expr
))
3040 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3041 expr
= TREE_OPERAND (expr
, 0);
3042 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3043 expr
= TREE_OPERAND (expr
, 1);
3054 /* Look inside EXPR into simple arithmetic operations involving constants.
3055 Return the outermost non-arithmetic or non-constant node. */
3058 skip_simple_constant_arithmetic (tree expr
)
3060 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3061 expr
= TREE_OPERAND (expr
, 0);
3065 if (UNARY_CLASS_P (expr
))
3066 expr
= TREE_OPERAND (expr
, 0);
3067 else if (BINARY_CLASS_P (expr
))
3069 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3070 expr
= TREE_OPERAND (expr
, 0);
3071 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3072 expr
= TREE_OPERAND (expr
, 1);
3083 /* Return which tree structure is used by T. */
3085 enum tree_node_structure_enum
3086 tree_node_structure (const_tree t
)
3088 const enum tree_code code
= TREE_CODE (t
);
3089 return tree_node_structure_for_code (code
);
3092 /* Set various status flags when building a CALL_EXPR object T. */
3095 process_call_operands (tree t
)
3097 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3098 bool read_only
= false;
3099 int i
= call_expr_flags (t
);
3101 /* Calls have side-effects, except those to const or pure functions. */
3102 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3103 side_effects
= true;
3104 /* Propagate TREE_READONLY of arguments for const functions. */
3108 if (!side_effects
|| read_only
)
3109 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3111 tree op
= TREE_OPERAND (t
, i
);
3112 if (op
&& TREE_SIDE_EFFECTS (op
))
3113 side_effects
= true;
3114 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3118 TREE_SIDE_EFFECTS (t
) = side_effects
;
3119 TREE_READONLY (t
) = read_only
;
3122 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3123 size or offset that depends on a field within a record. */
3126 contains_placeholder_p (const_tree exp
)
3128 enum tree_code code
;
3133 code
= TREE_CODE (exp
);
3134 if (code
== PLACEHOLDER_EXPR
)
3137 switch (TREE_CODE_CLASS (code
))
3140 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3141 position computations since they will be converted into a
3142 WITH_RECORD_EXPR involving the reference, which will assume
3143 here will be valid. */
3144 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3146 case tcc_exceptional
:
3147 if (code
== TREE_LIST
)
3148 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3149 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3154 case tcc_comparison
:
3155 case tcc_expression
:
3159 /* Ignoring the first operand isn't quite right, but works best. */
3160 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3163 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3164 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3165 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3168 /* The save_expr function never wraps anything containing
3169 a PLACEHOLDER_EXPR. */
3176 switch (TREE_CODE_LENGTH (code
))
3179 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3181 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3182 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3193 const_call_expr_arg_iterator iter
;
3194 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3195 if (CONTAINS_PLACEHOLDER_P (arg
))
3209 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3210 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3214 type_contains_placeholder_1 (const_tree type
)
3216 /* If the size contains a placeholder or the parent type (component type in
3217 the case of arrays) type involves a placeholder, this type does. */
3218 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3219 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3220 || (!POINTER_TYPE_P (type
)
3222 && type_contains_placeholder_p (TREE_TYPE (type
))))
3225 /* Now do type-specific checks. Note that the last part of the check above
3226 greatly limits what we have to do below. */
3227 switch (TREE_CODE (type
))
3235 case REFERENCE_TYPE
:
3244 case FIXED_POINT_TYPE
:
3245 /* Here we just check the bounds. */
3246 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3247 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3250 /* We have already checked the component type above, so just check the
3252 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3256 case QUAL_UNION_TYPE
:
3260 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3261 if (TREE_CODE (field
) == FIELD_DECL
3262 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3263 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3264 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3265 || type_contains_placeholder_p (TREE_TYPE (field
))))
3276 /* Wrapper around above function used to cache its result. */
3279 type_contains_placeholder_p (tree type
)
3283 /* If the contains_placeholder_bits field has been initialized,
3284 then we know the answer. */
3285 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3286 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3288 /* Indicate that we've seen this type node, and the answer is false.
3289 This is what we want to return if we run into recursion via fields. */
3290 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3292 /* Compute the real value. */
3293 result
= type_contains_placeholder_1 (type
);
3295 /* Store the real value. */
3296 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3301 /* Push tree EXP onto vector QUEUE if it is not already present. */
3304 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3309 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3310 if (simple_cst_equal (iter
, exp
) == 1)
3314 queue
->safe_push (exp
);
3317 /* Given a tree EXP, find all occurrences of references to fields
3318 in a PLACEHOLDER_EXPR and place them in vector REFS without
3319 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3320 we assume here that EXP contains only arithmetic expressions
3321 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3325 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3327 enum tree_code code
= TREE_CODE (exp
);
3331 /* We handle TREE_LIST and COMPONENT_REF separately. */
3332 if (code
== TREE_LIST
)
3334 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3335 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3337 else if (code
== COMPONENT_REF
)
3339 for (inner
= TREE_OPERAND (exp
, 0);
3340 REFERENCE_CLASS_P (inner
);
3341 inner
= TREE_OPERAND (inner
, 0))
3344 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3345 push_without_duplicates (exp
, refs
);
3347 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3350 switch (TREE_CODE_CLASS (code
))
3355 case tcc_declaration
:
3356 /* Variables allocated to static storage can stay. */
3357 if (!TREE_STATIC (exp
))
3358 push_without_duplicates (exp
, refs
);
3361 case tcc_expression
:
3362 /* This is the pattern built in ada/make_aligning_type. */
3363 if (code
== ADDR_EXPR
3364 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3366 push_without_duplicates (exp
, refs
);
3370 /* Fall through... */
3372 case tcc_exceptional
:
3375 case tcc_comparison
:
3377 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3378 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3382 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3383 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3391 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3392 return a tree with all occurrences of references to F in a
3393 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3394 CONST_DECLs. Note that we assume here that EXP contains only
3395 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3396 occurring only in their argument list. */
3399 substitute_in_expr (tree exp
, tree f
, tree r
)
3401 enum tree_code code
= TREE_CODE (exp
);
3402 tree op0
, op1
, op2
, op3
;
3405 /* We handle TREE_LIST and COMPONENT_REF separately. */
3406 if (code
== TREE_LIST
)
3408 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3409 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3410 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3413 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3415 else if (code
== COMPONENT_REF
)
3419 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3420 and it is the right field, replace it with R. */
3421 for (inner
= TREE_OPERAND (exp
, 0);
3422 REFERENCE_CLASS_P (inner
);
3423 inner
= TREE_OPERAND (inner
, 0))
3427 op1
= TREE_OPERAND (exp
, 1);
3429 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3432 /* If this expression hasn't been completed let, leave it alone. */
3433 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3436 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3437 if (op0
== TREE_OPERAND (exp
, 0))
3441 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3444 switch (TREE_CODE_CLASS (code
))
3449 case tcc_declaration
:
3455 case tcc_expression
:
3459 /* Fall through... */
3461 case tcc_exceptional
:
3464 case tcc_comparison
:
3466 switch (TREE_CODE_LENGTH (code
))
3472 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3473 if (op0
== TREE_OPERAND (exp
, 0))
3476 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3480 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3481 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3483 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3486 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3490 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3491 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3492 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3494 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3495 && op2
== TREE_OPERAND (exp
, 2))
3498 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3502 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3503 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3504 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3505 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3507 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3508 && op2
== TREE_OPERAND (exp
, 2)
3509 && op3
== TREE_OPERAND (exp
, 3))
3513 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3525 new_tree
= NULL_TREE
;
3527 /* If we are trying to replace F with a constant, inline back
3528 functions which do nothing else than computing a value from
3529 the arguments they are passed. This makes it possible to
3530 fold partially or entirely the replacement expression. */
3531 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3533 tree t
= maybe_inline_call_in_expr (exp
);
3535 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3538 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3540 tree op
= TREE_OPERAND (exp
, i
);
3541 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3545 new_tree
= copy_node (exp
);
3546 TREE_OPERAND (new_tree
, i
) = new_op
;
3552 new_tree
= fold (new_tree
);
3553 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3554 process_call_operands (new_tree
);
3565 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3567 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3568 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3573 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3574 for it within OBJ, a tree that is an object or a chain of references. */
3577 substitute_placeholder_in_expr (tree exp
, tree obj
)
3579 enum tree_code code
= TREE_CODE (exp
);
3580 tree op0
, op1
, op2
, op3
;
3583 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3584 in the chain of OBJ. */
3585 if (code
== PLACEHOLDER_EXPR
)
3587 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3590 for (elt
= obj
; elt
!= 0;
3591 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3592 || TREE_CODE (elt
) == COND_EXPR
)
3593 ? TREE_OPERAND (elt
, 1)
3594 : (REFERENCE_CLASS_P (elt
)
3595 || UNARY_CLASS_P (elt
)
3596 || BINARY_CLASS_P (elt
)
3597 || VL_EXP_CLASS_P (elt
)
3598 || EXPRESSION_CLASS_P (elt
))
3599 ? TREE_OPERAND (elt
, 0) : 0))
3600 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3603 for (elt
= obj
; elt
!= 0;
3604 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3605 || TREE_CODE (elt
) == COND_EXPR
)
3606 ? TREE_OPERAND (elt
, 1)
3607 : (REFERENCE_CLASS_P (elt
)
3608 || UNARY_CLASS_P (elt
)
3609 || BINARY_CLASS_P (elt
)
3610 || VL_EXP_CLASS_P (elt
)
3611 || EXPRESSION_CLASS_P (elt
))
3612 ? TREE_OPERAND (elt
, 0) : 0))
3613 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3614 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3616 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3618 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3619 survives until RTL generation, there will be an error. */
3623 /* TREE_LIST is special because we need to look at TREE_VALUE
3624 and TREE_CHAIN, not TREE_OPERANDS. */
3625 else if (code
== TREE_LIST
)
3627 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3628 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3629 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3632 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3635 switch (TREE_CODE_CLASS (code
))
3638 case tcc_declaration
:
3641 case tcc_exceptional
:
3644 case tcc_comparison
:
3645 case tcc_expression
:
3648 switch (TREE_CODE_LENGTH (code
))
3654 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3655 if (op0
== TREE_OPERAND (exp
, 0))
3658 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3662 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3663 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3665 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3668 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3672 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3673 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3674 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3676 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3677 && op2
== TREE_OPERAND (exp
, 2))
3680 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3684 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3685 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3686 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3687 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3689 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3690 && op2
== TREE_OPERAND (exp
, 2)
3691 && op3
== TREE_OPERAND (exp
, 3))
3695 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3707 new_tree
= NULL_TREE
;
3709 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3711 tree op
= TREE_OPERAND (exp
, i
);
3712 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3716 new_tree
= copy_node (exp
);
3717 TREE_OPERAND (new_tree
, i
) = new_op
;
3723 new_tree
= fold (new_tree
);
3724 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3725 process_call_operands (new_tree
);
3736 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3738 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3739 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3744 /* Stabilize a reference so that we can use it any number of times
3745 without causing its operands to be evaluated more than once.
3746 Returns the stabilized reference. This works by means of save_expr,
3747 so see the caveats in the comments about save_expr.
3749 Also allows conversion expressions whose operands are references.
3750 Any other kind of expression is returned unchanged. */
3753 stabilize_reference (tree ref
)
3756 enum tree_code code
= TREE_CODE (ref
);
3763 /* No action is needed in this case. */
3768 case FIX_TRUNC_EXPR
:
3769 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3773 result
= build_nt (INDIRECT_REF
,
3774 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3778 result
= build_nt (COMPONENT_REF
,
3779 stabilize_reference (TREE_OPERAND (ref
, 0)),
3780 TREE_OPERAND (ref
, 1), NULL_TREE
);
3784 result
= build_nt (BIT_FIELD_REF
,
3785 stabilize_reference (TREE_OPERAND (ref
, 0)),
3786 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3790 result
= build_nt (ARRAY_REF
,
3791 stabilize_reference (TREE_OPERAND (ref
, 0)),
3792 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3793 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3796 case ARRAY_RANGE_REF
:
3797 result
= build_nt (ARRAY_RANGE_REF
,
3798 stabilize_reference (TREE_OPERAND (ref
, 0)),
3799 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3800 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3804 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3805 it wouldn't be ignored. This matters when dealing with
3807 return stabilize_reference_1 (ref
);
3809 /* If arg isn't a kind of lvalue we recognize, make no change.
3810 Caller should recognize the error for an invalid lvalue. */
3815 return error_mark_node
;
3818 TREE_TYPE (result
) = TREE_TYPE (ref
);
3819 TREE_READONLY (result
) = TREE_READONLY (ref
);
3820 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3821 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3822 TREE_SHARED (result
) = TREE_SHARED (ref
);
3823 TREE_STRICT (result
) = TREE_STRICT (ref
);
3824 TREE_RELAXED (result
) = TREE_RELAXED (ref
);
3829 /* Subroutine of stabilize_reference; this is called for subtrees of
3830 references. Any expression with side-effects must be put in a SAVE_EXPR
3831 to ensure that it is only evaluated once.
3833 We don't put SAVE_EXPR nodes around everything, because assigning very
3834 simple expressions to temporaries causes us to miss good opportunities
3835 for optimizations. Among other things, the opportunity to fold in the
3836 addition of a constant into an addressing mode often gets lost, e.g.
3837 "y[i+1] += x;". In general, we take the approach that we should not make
3838 an assignment unless we are forced into it - i.e., that any non-side effect
3839 operator should be allowed, and that cse should take care of coalescing
3840 multiple utterances of the same expression should that prove fruitful. */
3843 stabilize_reference_1 (tree e
)
3846 enum tree_code code
= TREE_CODE (e
);
3848 /* We cannot ignore const expressions because it might be a reference
3849 to a const array but whose index contains side-effects. But we can
3850 ignore things that are actual constant or that already have been
3851 handled by this function. */
3853 if (tree_invariant_p (e
))
3856 switch (TREE_CODE_CLASS (code
))
3858 case tcc_exceptional
:
3860 case tcc_declaration
:
3861 case tcc_comparison
:
3863 case tcc_expression
:
3866 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3867 so that it will only be evaluated once. */
3868 /* The reference (r) and comparison (<) classes could be handled as
3869 below, but it is generally faster to only evaluate them once. */
3870 if (TREE_SIDE_EFFECTS (e
))
3871 return save_expr (e
);
3875 /* Constants need no processing. In fact, we should never reach
3880 /* Division is slow and tends to be compiled with jumps,
3881 especially the division by powers of 2 that is often
3882 found inside of an array reference. So do it just once. */
3883 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3884 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3885 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3886 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3887 return save_expr (e
);
3888 /* Recursively stabilize each operand. */
3889 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3890 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3894 /* Recursively stabilize each operand. */
3895 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3902 TREE_TYPE (result
) = TREE_TYPE (e
);
3903 TREE_READONLY (result
) = TREE_READONLY (e
);
3904 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3905 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3906 TREE_SHARED (result
) = TREE_SHARED (e
);
3907 TREE_STRICT (result
) = TREE_STRICT (e
);
3908 TREE_RELAXED (result
) = TREE_RELAXED (e
);
3913 /* Low-level constructors for expressions. */
3915 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3916 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3919 recompute_tree_invariant_for_addr_expr (tree t
)
3922 bool tc
= true, se
= false;
3924 /* We started out assuming this address is both invariant and constant, but
3925 does not have side effects. Now go down any handled components and see if
3926 any of them involve offsets that are either non-constant or non-invariant.
3927 Also check for side-effects.
3929 ??? Note that this code makes no attempt to deal with the case where
3930 taking the address of something causes a copy due to misalignment. */
3932 #define UPDATE_FLAGS(NODE) \
3933 do { tree _node = (NODE); \
3934 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3935 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3937 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3938 node
= TREE_OPERAND (node
, 0))
3940 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3941 array reference (probably made temporarily by the G++ front end),
3942 so ignore all the operands. */
3943 if ((TREE_CODE (node
) == ARRAY_REF
3944 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3945 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3947 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3948 if (TREE_OPERAND (node
, 2))
3949 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3950 if (TREE_OPERAND (node
, 3))
3951 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3953 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3954 FIELD_DECL, apparently. The G++ front end can put something else
3955 there, at least temporarily. */
3956 else if (TREE_CODE (node
) == COMPONENT_REF
3957 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3959 if (TREE_OPERAND (node
, 2))
3960 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3964 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3966 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3967 the address, since &(*a)->b is a form of addition. If it's a constant, the
3968 address is constant too. If it's a decl, its address is constant if the
3969 decl is static. Everything else is not constant and, furthermore,
3970 taking the address of a volatile variable is not volatile. */
3971 if (TREE_CODE (node
) == INDIRECT_REF
3972 || TREE_CODE (node
) == MEM_REF
)
3973 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3974 else if (CONSTANT_CLASS_P (node
))
3976 else if (DECL_P (node
))
3977 tc
&= (staticp (node
) != NULL_TREE
);
3981 se
|= TREE_SIDE_EFFECTS (node
);
3985 TREE_CONSTANT (t
) = tc
;
3986 TREE_SIDE_EFFECTS (t
) = se
;
3990 /* Build an expression of code CODE, data type TYPE, and operands as
3991 specified. Expressions and reference nodes can be created this way.
3992 Constants, decls, types and misc nodes cannot be.
3994 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3995 enough for all extant tree codes. */
3998 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4002 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4004 t
= make_node_stat (code PASS_MEM_STAT
);
4011 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4013 int length
= sizeof (struct tree_exp
);
4016 record_node_allocation_statistics (code
, length
);
4018 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4020 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4022 memset (t
, 0, sizeof (struct tree_common
));
4024 TREE_SET_CODE (t
, code
);
4026 TREE_TYPE (t
) = type
;
4027 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4028 TREE_OPERAND (t
, 0) = node
;
4029 if (node
&& !TYPE_P (node
))
4031 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4032 TREE_READONLY (t
) = TREE_READONLY (node
);
4035 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4036 TREE_SIDE_EFFECTS (t
) = 1;
4040 /* All of these have side-effects, no matter what their
4042 TREE_SIDE_EFFECTS (t
) = 1;
4043 TREE_READONLY (t
) = 0;
4047 /* Whether a dereference is readonly has nothing to do with whether
4048 its operand is readonly. */
4049 TREE_READONLY (t
) = 0;
4050 TREE_SHARED (t
) = upc_shared_type_p (type
);
4055 recompute_tree_invariant_for_addr_expr (t
);
4059 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4060 && node
&& !TYPE_P (node
)
4061 && TREE_CONSTANT (node
))
4062 TREE_CONSTANT (t
) = 1;
4063 if (TREE_CODE_CLASS (code
) == tcc_reference
4064 && node
&& TREE_THIS_VOLATILE (node
))
4065 TREE_THIS_VOLATILE (t
) = 1;
4066 /* Drop the UPC "shared" type qualifier for
4067 expressions involving UPC shared objects. */
4068 if (TREE_CODE_CLASS (code
) == tcc_unary
4069 && node
&& !TYPE_P (node
)
4070 && upc_shared_type_p (type
))
4071 TREE_TYPE (t
) = build_upc_unshared_type (type
);
4078 #define PROCESS_ARG(N) \
4080 TREE_OPERAND (t, N) = arg##N; \
4081 if (arg##N &&!TYPE_P (arg##N)) \
4083 if (TREE_SIDE_EFFECTS (arg##N)) \
4085 if (!TREE_READONLY (arg##N) \
4086 && !CONSTANT_CLASS_P (arg##N)) \
4087 (void) (read_only = 0); \
4088 if (!TREE_CONSTANT (arg##N)) \
4089 (void) (constant = 0); \
4094 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4096 bool constant
, read_only
, side_effects
;
4099 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4101 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4102 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4103 /* When sizetype precision doesn't match that of pointers
4104 we need to be able to build explicit extensions or truncations
4105 of the offset argument. */
4106 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4107 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4108 && TREE_CODE (arg1
) == INTEGER_CST
);
4110 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4111 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4112 && ptrofftype_p (TREE_TYPE (arg1
)));
4114 t
= make_node_stat (code PASS_MEM_STAT
);
4116 /* Remove UPC shared type qualifiers from the result type. */
4117 if (upc_shared_type_p (tt
))
4118 tt
= build_upc_unshared_type (tt
);
4121 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4122 result based on those same flags for the arguments. But if the
4123 arguments aren't really even `tree' expressions, we shouldn't be trying
4126 /* Expressions without side effects may be constant if their
4127 arguments are as well. */
4128 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4129 || TREE_CODE_CLASS (code
) == tcc_binary
);
4131 side_effects
= TREE_SIDE_EFFECTS (t
);
4136 TREE_READONLY (t
) = read_only
;
4137 TREE_CONSTANT (t
) = constant
;
4138 TREE_SIDE_EFFECTS (t
) = side_effects
;
4139 TREE_THIS_VOLATILE (t
)
4140 = (TREE_CODE_CLASS (code
) == tcc_reference
4141 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4148 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4149 tree arg2 MEM_STAT_DECL
)
4151 bool constant
, read_only
, side_effects
;
4154 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4155 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4157 t
= make_node_stat (code PASS_MEM_STAT
);
4162 /* As a special exception, if COND_EXPR has NULL branches, we
4163 assume that it is a gimple statement and always consider
4164 it to have side effects. */
4165 if (code
== COND_EXPR
4166 && tt
== void_type_node
4167 && arg1
== NULL_TREE
4168 && arg2
== NULL_TREE
)
4169 side_effects
= true;
4171 side_effects
= TREE_SIDE_EFFECTS (t
);
4177 if (code
== COND_EXPR
)
4178 TREE_READONLY (t
) = read_only
;
4180 TREE_SIDE_EFFECTS (t
) = side_effects
;
4181 TREE_THIS_VOLATILE (t
)
4182 = (TREE_CODE_CLASS (code
) == tcc_reference
4183 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4185 = (TREE_CODE_CLASS (code
) == tcc_reference
4186 && arg0
&& TREE_SHARED (arg0
));
4187 if (TREE_SHARED (t
))
4189 TREE_STRICT (t
) = TREE_STRICT (arg0
);
4190 TREE_RELAXED (t
) = TREE_RELAXED (arg0
);
4197 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4198 tree arg2
, tree arg3 MEM_STAT_DECL
)
4200 bool constant
, read_only
, side_effects
;
4203 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4205 t
= make_node_stat (code PASS_MEM_STAT
);
4208 side_effects
= TREE_SIDE_EFFECTS (t
);
4215 TREE_SIDE_EFFECTS (t
) = side_effects
;
4216 TREE_THIS_VOLATILE (t
)
4217 = (TREE_CODE_CLASS (code
) == tcc_reference
4218 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4224 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4225 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4227 bool constant
, read_only
, side_effects
;
4230 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4232 t
= make_node_stat (code PASS_MEM_STAT
);
4235 side_effects
= TREE_SIDE_EFFECTS (t
);
4243 TREE_SIDE_EFFECTS (t
) = side_effects
;
4244 TREE_THIS_VOLATILE (t
)
4245 = (TREE_CODE_CLASS (code
) == tcc_reference
4246 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4251 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4252 on the pointer PTR. */
4255 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4257 HOST_WIDE_INT offset
= 0;
4258 tree ptype
= TREE_TYPE (ptr
);
4260 /* For convenience allow addresses that collapse to a simple base
4262 if (TREE_CODE (ptr
) == ADDR_EXPR
4263 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4264 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4266 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4268 ptr
= build_fold_addr_expr (ptr
);
4269 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4271 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4272 ptr
, build_int_cst (ptype
, offset
));
4273 SET_EXPR_LOCATION (tem
, loc
);
4277 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4280 mem_ref_offset (const_tree t
)
4282 tree toff
= TREE_OPERAND (t
, 1);
4283 return tree_to_double_int (toff
).sext (TYPE_PRECISION (TREE_TYPE (toff
)));
4286 /* Return the pointer-type relevant for TBAA purposes from the
4287 gimple memory reference tree T. This is the type to be used for
4288 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4291 reference_alias_ptr_type (const_tree t
)
4293 const_tree base
= t
;
4294 while (handled_component_p (base
))
4295 base
= TREE_OPERAND (base
, 0);
4296 if (TREE_CODE (base
) == MEM_REF
)
4297 return TREE_TYPE (TREE_OPERAND (base
, 1));
4298 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4299 return TREE_TYPE (TMR_OFFSET (base
));
4301 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4304 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4305 offsetted by OFFSET units. */
4308 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4310 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4311 build_fold_addr_expr (base
),
4312 build_int_cst (ptr_type_node
, offset
));
4313 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4314 recompute_tree_invariant_for_addr_expr (addr
);
4318 /* Similar except don't specify the TREE_TYPE
4319 and leave the TREE_SIDE_EFFECTS as 0.
4320 It is permissible for arguments to be null,
4321 or even garbage if their values do not matter. */
4324 build_nt (enum tree_code code
, ...)
4331 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4335 t
= make_node (code
);
4336 length
= TREE_CODE_LENGTH (code
);
4338 for (i
= 0; i
< length
; i
++)
4339 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4345 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4349 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4354 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4355 CALL_EXPR_FN (ret
) = fn
;
4356 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4357 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4358 CALL_EXPR_ARG (ret
, ix
) = t
;
4362 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4363 We do NOT enter this node in any sort of symbol table.
4365 LOC is the location of the decl.
4367 layout_decl is used to set up the decl's storage layout.
4368 Other slots are initialized to 0 or null pointers. */
4371 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4372 tree type MEM_STAT_DECL
)
4376 t
= make_node_stat (code PASS_MEM_STAT
);
4377 DECL_SOURCE_LOCATION (t
) = loc
;
4379 /* if (type == error_mark_node)
4380 type = integer_type_node; */
4381 /* That is not done, deliberately, so that having error_mark_node
4382 as the type can suppress useless errors in the use of this variable. */
4384 DECL_NAME (t
) = name
;
4385 TREE_TYPE (t
) = type
;
4387 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4393 /* Builds and returns function declaration with NAME and TYPE. */
4396 build_fn_decl (const char *name
, tree type
)
4398 tree id
= get_identifier (name
);
4399 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4401 DECL_EXTERNAL (decl
) = 1;
4402 TREE_PUBLIC (decl
) = 1;
4403 DECL_ARTIFICIAL (decl
) = 1;
4404 TREE_NOTHROW (decl
) = 1;
4409 vec
<tree
, va_gc
> *all_translation_units
;
4411 /* Builds a new translation-unit decl with name NAME, queues it in the
4412 global list of translation-unit decls and returns it. */
4415 build_translation_unit_decl (tree name
)
4417 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4419 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4420 vec_safe_push (all_translation_units
, tu
);
4425 /* BLOCK nodes are used to represent the structure of binding contours
4426 and declarations, once those contours have been exited and their contents
4427 compiled. This information is used for outputting debugging info. */
4430 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4432 tree block
= make_node (BLOCK
);
4434 BLOCK_VARS (block
) = vars
;
4435 BLOCK_SUBBLOCKS (block
) = subblocks
;
4436 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4437 BLOCK_CHAIN (block
) = chain
;
4442 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4444 LOC is the location to use in tree T. */
4447 protected_set_expr_location (tree t
, location_t loc
)
4449 if (t
&& CAN_HAVE_LOCATION_P (t
))
4450 SET_EXPR_LOCATION (t
, loc
);
4453 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4457 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4459 DECL_ATTRIBUTES (ddecl
) = attribute
;
4463 /* Borrowed from hashtab.c iterative_hash implementation. */
4464 #define mix(a,b,c) \
4466 a -= b; a -= c; a ^= (c>>13); \
4467 b -= c; b -= a; b ^= (a<< 8); \
4468 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4469 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4470 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4471 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4472 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4473 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4474 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4478 /* Produce good hash value combining VAL and VAL2. */
4480 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4482 /* the golden ratio; an arbitrary value. */
4483 hashval_t a
= 0x9e3779b9;
4489 /* Produce good hash value combining VAL and VAL2. */
4491 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4493 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4494 return iterative_hash_hashval_t (val
, val2
);
4497 hashval_t a
= (hashval_t
) val
;
4498 /* Avoid warnings about shifting of more than the width of the type on
4499 hosts that won't execute this path. */
4501 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4503 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4505 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4506 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4513 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4514 is ATTRIBUTE and its qualifiers are QUALS.
4516 Record such modified types already made so we don't make duplicates. */
4519 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4521 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4523 hashval_t hashcode
= 0;
4525 enum tree_code code
= TREE_CODE (ttype
);
4527 /* Building a distinct copy of a tagged type is inappropriate; it
4528 causes breakage in code that expects there to be a one-to-one
4529 relationship between a struct and its fields.
4530 build_duplicate_type is another solution (as used in
4531 handle_transparent_union_attribute), but that doesn't play well
4532 with the stronger C++ type identity model. */
4533 if (TREE_CODE (ttype
) == RECORD_TYPE
4534 || TREE_CODE (ttype
) == UNION_TYPE
4535 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4536 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4538 warning (OPT_Wattributes
,
4539 "ignoring attributes applied to %qT after definition",
4540 TYPE_MAIN_VARIANT (ttype
));
4541 return build_qualified_type (ttype
, quals
);
4544 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4545 ntype
= build_distinct_type_copy (ttype
);
4547 TYPE_ATTRIBUTES (ntype
) = attribute
;
4549 hashcode
= iterative_hash_object (code
, hashcode
);
4550 if (TREE_TYPE (ntype
))
4551 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4553 hashcode
= attribute_hash_list (attribute
, hashcode
);
4555 switch (TREE_CODE (ntype
))
4558 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4561 if (TYPE_DOMAIN (ntype
))
4562 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4566 hashcode
= iterative_hash_object
4567 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4568 hashcode
= iterative_hash_object
4569 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4572 case FIXED_POINT_TYPE
:
4574 unsigned int precision
= TYPE_PRECISION (ntype
);
4575 hashcode
= iterative_hash_object (precision
, hashcode
);
4582 ntype
= type_hash_canon (hashcode
, ntype
);
4584 /* If the target-dependent attributes make NTYPE different from
4585 its canonical type, we will need to use structural equality
4586 checks for this type. */
4587 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4588 || !comp_type_attributes (ntype
, ttype
))
4589 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4590 else if (TYPE_CANONICAL (ntype
) == ntype
)
4591 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4593 ttype
= build_qualified_type (ntype
, quals
);
4595 else if (TYPE_QUALS (ttype
) != quals
)
4596 ttype
= build_qualified_type (ttype
, quals
);
4601 /* Compare two attributes for their value identity. Return true if the
4602 attribute values are known to be equal; otherwise return false.
4606 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4608 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4611 if (TREE_VALUE (attr1
) != NULL_TREE
4612 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4613 && TREE_VALUE (attr2
) != NULL
4614 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4615 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4616 TREE_VALUE (attr2
)) == 1);
4618 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4621 /* Return 0 if the attributes for two types are incompatible, 1 if they
4622 are compatible, and 2 if they are nearly compatible (which causes a
4623 warning to be generated). */
4625 comp_type_attributes (const_tree type1
, const_tree type2
)
4627 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4628 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4633 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4635 const struct attribute_spec
*as
;
4638 as
= lookup_attribute_spec (get_attribute_name (a
));
4639 if (!as
|| as
->affects_type_identity
== false)
4642 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4643 if (!attr
|| !attribute_value_equal (a
, attr
))
4648 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4650 const struct attribute_spec
*as
;
4652 as
= lookup_attribute_spec (get_attribute_name (a
));
4653 if (!as
|| as
->affects_type_identity
== false)
4656 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4658 /* We don't need to compare trees again, as we did this
4659 already in first loop. */
4661 /* All types - affecting identity - are equal, so
4662 there is no need to call target hook for comparison. */
4666 /* As some type combinations - like default calling-convention - might
4667 be compatible, we have to call the target hook to get the final result. */
4668 return targetm
.comp_type_attributes (type1
, type2
);
4671 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4674 Record such modified types already made so we don't make duplicates. */
4677 build_type_attribute_variant (tree ttype
, tree attribute
)
4679 return build_type_attribute_qual_variant (ttype
, attribute
,
4680 TYPE_QUALS (ttype
));
4684 /* Reset the expression *EXPR_P, a size or position.
4686 ??? We could reset all non-constant sizes or positions. But it's cheap
4687 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4689 We need to reset self-referential sizes or positions because they cannot
4690 be gimplified and thus can contain a CALL_EXPR after the gimplification
4691 is finished, which will run afoul of LTO streaming. And they need to be
4692 reset to something essentially dummy but not constant, so as to preserve
4693 the properties of the object they are attached to. */
4696 free_lang_data_in_one_sizepos (tree
*expr_p
)
4698 tree expr
= *expr_p
;
4699 if (CONTAINS_PLACEHOLDER_P (expr
))
4700 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4704 /* Reset all the fields in a binfo node BINFO. We only keep
4705 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4708 free_lang_data_in_binfo (tree binfo
)
4713 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4715 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4716 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4717 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4718 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4720 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4721 free_lang_data_in_binfo (t
);
4725 /* Reset all language specific information still present in TYPE. */
4728 free_lang_data_in_type (tree type
)
4730 gcc_assert (TYPE_P (type
));
4732 /* Give the FE a chance to remove its own data first. */
4733 lang_hooks
.free_lang_data (type
);
4735 TREE_LANG_FLAG_0 (type
) = 0;
4736 TREE_LANG_FLAG_1 (type
) = 0;
4737 TREE_LANG_FLAG_2 (type
) = 0;
4738 TREE_LANG_FLAG_3 (type
) = 0;
4739 TREE_LANG_FLAG_4 (type
) = 0;
4740 TREE_LANG_FLAG_5 (type
) = 0;
4741 TREE_LANG_FLAG_6 (type
) = 0;
4743 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4745 /* Remove the const and volatile qualifiers from arguments. The
4746 C++ front end removes them, but the C front end does not,
4747 leading to false ODR violation errors when merging two
4748 instances of the same function signature compiled by
4749 different front ends. */
4752 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4754 tree arg_type
= TREE_VALUE (p
);
4756 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4758 int quals
= TYPE_QUALS (arg_type
)
4760 & ~TYPE_QUAL_VOLATILE
;
4761 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4762 free_lang_data_in_type (TREE_VALUE (p
));
4767 /* Remove members that are not actually FIELD_DECLs from the field
4768 list of an aggregate. These occur in C++. */
4769 if (RECORD_OR_UNION_TYPE_P (type
))
4773 /* Note that TYPE_FIELDS can be shared across distinct
4774 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4775 to be removed, we cannot set its TREE_CHAIN to NULL.
4776 Otherwise, we would not be able to find all the other fields
4777 in the other instances of this TREE_TYPE.
4779 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4781 member
= TYPE_FIELDS (type
);
4784 if (TREE_CODE (member
) == FIELD_DECL
4785 || TREE_CODE (member
) == TYPE_DECL
)
4788 TREE_CHAIN (prev
) = member
;
4790 TYPE_FIELDS (type
) = member
;
4794 member
= TREE_CHAIN (member
);
4798 TREE_CHAIN (prev
) = NULL_TREE
;
4800 TYPE_FIELDS (type
) = NULL_TREE
;
4802 TYPE_METHODS (type
) = NULL_TREE
;
4803 if (TYPE_BINFO (type
))
4804 free_lang_data_in_binfo (TYPE_BINFO (type
));
4808 /* For non-aggregate types, clear out the language slot (which
4809 overloads TYPE_BINFO). */
4810 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4812 if (INTEGRAL_TYPE_P (type
)
4813 || SCALAR_FLOAT_TYPE_P (type
)
4814 || FIXED_POINT_TYPE_P (type
))
4816 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4817 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4821 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4822 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4824 if (TYPE_CONTEXT (type
)
4825 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4827 tree ctx
= TYPE_CONTEXT (type
);
4830 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4832 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4833 TYPE_CONTEXT (type
) = ctx
;
4838 /* Return true if DECL may need an assembler name to be set. */
4841 need_assembler_name_p (tree decl
)
4843 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4844 if (TREE_CODE (decl
) != FUNCTION_DECL
4845 && TREE_CODE (decl
) != VAR_DECL
)
4848 /* If DECL already has its assembler name set, it does not need a
4850 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4851 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4854 /* Abstract decls do not need an assembler name. */
4855 if (DECL_ABSTRACT (decl
))
4858 /* For VAR_DECLs, only static, public and external symbols need an
4860 if (TREE_CODE (decl
) == VAR_DECL
4861 && !TREE_STATIC (decl
)
4862 && !TREE_PUBLIC (decl
)
4863 && !DECL_EXTERNAL (decl
))
4866 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4868 /* Do not set assembler name on builtins. Allow RTL expansion to
4869 decide whether to expand inline or via a regular call. */
4870 if (DECL_BUILT_IN (decl
)
4871 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4874 /* Functions represented in the callgraph need an assembler name. */
4875 if (cgraph_get_node (decl
) != NULL
)
4878 /* Unused and not public functions don't need an assembler name. */
4879 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4887 /* Reset all language specific information still present in symbol
4891 free_lang_data_in_decl (tree decl
)
4893 gcc_assert (DECL_P (decl
));
4895 /* Give the FE a chance to remove its own data first. */
4896 lang_hooks
.free_lang_data (decl
);
4898 TREE_LANG_FLAG_0 (decl
) = 0;
4899 TREE_LANG_FLAG_1 (decl
) = 0;
4900 TREE_LANG_FLAG_2 (decl
) = 0;
4901 TREE_LANG_FLAG_3 (decl
) = 0;
4902 TREE_LANG_FLAG_4 (decl
) = 0;
4903 TREE_LANG_FLAG_5 (decl
) = 0;
4904 TREE_LANG_FLAG_6 (decl
) = 0;
4906 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4907 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4908 if (TREE_CODE (decl
) == FIELD_DECL
)
4910 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4911 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4912 DECL_QUALIFIER (decl
) = NULL_TREE
;
4915 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4917 struct cgraph_node
*node
;
4918 if (!(node
= cgraph_get_node (decl
))
4919 || (!node
->symbol
.definition
&& !node
->clones
))
4922 cgraph_release_function_body (node
);
4925 release_function_body (decl
);
4926 DECL_ARGUMENTS (decl
) = NULL
;
4927 DECL_RESULT (decl
) = NULL
;
4928 DECL_INITIAL (decl
) = error_mark_node
;
4931 if (gimple_has_body_p (decl
))
4935 /* If DECL has a gimple body, then the context for its
4936 arguments must be DECL. Otherwise, it doesn't really
4937 matter, as we will not be emitting any code for DECL. In
4938 general, there may be other instances of DECL created by
4939 the front end and since PARM_DECLs are generally shared,
4940 their DECL_CONTEXT changes as the replicas of DECL are
4941 created. The only time where DECL_CONTEXT is important
4942 is for the FUNCTION_DECLs that have a gimple body (since
4943 the PARM_DECL will be used in the function's body). */
4944 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4945 DECL_CONTEXT (t
) = decl
;
4948 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4949 At this point, it is not needed anymore. */
4950 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4952 /* Clear the abstract origin if it refers to a method. Otherwise
4953 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4954 origin will not be output correctly. */
4955 if (DECL_ABSTRACT_ORIGIN (decl
)
4956 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4957 && RECORD_OR_UNION_TYPE_P
4958 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4959 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4961 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4962 DECL_VINDEX referring to itself into a vtable slot number as it
4963 should. Happens with functions that are copied and then forgotten
4964 about. Just clear it, it won't matter anymore. */
4965 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4966 DECL_VINDEX (decl
) = NULL_TREE
;
4968 else if (TREE_CODE (decl
) == VAR_DECL
)
4970 if ((DECL_EXTERNAL (decl
)
4971 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4972 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4973 DECL_INITIAL (decl
) = NULL_TREE
;
4975 else if (TREE_CODE (decl
) == TYPE_DECL
4976 || TREE_CODE (decl
) == FIELD_DECL
)
4977 DECL_INITIAL (decl
) = NULL_TREE
;
4978 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4979 && DECL_INITIAL (decl
)
4980 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4982 /* Strip builtins from the translation-unit BLOCK. We still have targets
4983 without builtin_decl_explicit support and also builtins are shared
4984 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4985 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4989 if (TREE_CODE (var
) == FUNCTION_DECL
4990 && DECL_BUILT_IN (var
))
4991 *nextp
= TREE_CHAIN (var
);
4993 nextp
= &TREE_CHAIN (var
);
4999 /* Data used when collecting DECLs and TYPEs for language data removal. */
5001 struct free_lang_data_d
5003 /* Worklist to avoid excessive recursion. */
5006 /* Set of traversed objects. Used to avoid duplicate visits. */
5007 struct pointer_set_t
*pset
;
5009 /* Array of symbols to process with free_lang_data_in_decl. */
5012 /* Array of types to process with free_lang_data_in_type. */
5017 /* Save all language fields needed to generate proper debug information
5018 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5021 save_debug_info_for_decl (tree t
)
5023 /*struct saved_debug_info_d *sdi;*/
5025 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5027 /* FIXME. Partial implementation for saving debug info removed. */
5031 /* Save all language fields needed to generate proper debug information
5032 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5035 save_debug_info_for_type (tree t
)
5037 /*struct saved_debug_info_d *sdi;*/
5039 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5041 /* FIXME. Partial implementation for saving debug info removed. */
5045 /* Add type or decl T to one of the list of tree nodes that need their
5046 language data removed. The lists are held inside FLD. */
5049 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5053 fld
->decls
.safe_push (t
);
5054 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5055 save_debug_info_for_decl (t
);
5057 else if (TYPE_P (t
))
5059 fld
->types
.safe_push (t
);
5060 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5061 save_debug_info_for_type (t
);
5067 /* Push tree node T into FLD->WORKLIST. */
5070 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5072 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5073 fld
->worklist
.safe_push ((t
));
5077 /* Operand callback helper for free_lang_data_in_node. *TP is the
5078 subtree operand being considered. */
5081 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5084 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5086 if (TREE_CODE (t
) == TREE_LIST
)
5089 /* Language specific nodes will be removed, so there is no need
5090 to gather anything under them. */
5091 if (is_lang_specific (t
))
5099 /* Note that walk_tree does not traverse every possible field in
5100 decls, so we have to do our own traversals here. */
5101 add_tree_to_fld_list (t
, fld
);
5103 fld_worklist_push (DECL_NAME (t
), fld
);
5104 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5105 fld_worklist_push (DECL_SIZE (t
), fld
);
5106 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5108 /* We are going to remove everything under DECL_INITIAL for
5109 TYPE_DECLs. No point walking them. */
5110 if (TREE_CODE (t
) != TYPE_DECL
)
5111 fld_worklist_push (DECL_INITIAL (t
), fld
);
5113 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5114 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5116 if (TREE_CODE (t
) == FUNCTION_DECL
)
5118 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5119 fld_worklist_push (DECL_RESULT (t
), fld
);
5121 else if (TREE_CODE (t
) == TYPE_DECL
)
5123 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5124 fld_worklist_push (DECL_VINDEX (t
), fld
);
5125 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5127 else if (TREE_CODE (t
) == FIELD_DECL
)
5129 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5130 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5131 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5132 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5134 else if (TREE_CODE (t
) == VAR_DECL
)
5136 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5137 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
5140 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5141 && DECL_HAS_VALUE_EXPR_P (t
))
5142 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5144 if (TREE_CODE (t
) != FIELD_DECL
5145 && TREE_CODE (t
) != TYPE_DECL
)
5146 fld_worklist_push (TREE_CHAIN (t
), fld
);
5149 else if (TYPE_P (t
))
5151 /* Note that walk_tree does not traverse every possible field in
5152 types, so we have to do our own traversals here. */
5153 add_tree_to_fld_list (t
, fld
);
5155 if (!RECORD_OR_UNION_TYPE_P (t
))
5156 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5157 fld_worklist_push (TYPE_SIZE (t
), fld
);
5158 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5159 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5160 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5161 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5162 fld_worklist_push (TYPE_NAME (t
), fld
);
5163 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5164 them and thus do not and want not to reach unused pointer types
5166 if (!POINTER_TYPE_P (t
))
5167 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5168 if (!RECORD_OR_UNION_TYPE_P (t
))
5169 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5170 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5171 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5172 do not and want not to reach unused variants this way. */
5173 if (TYPE_CONTEXT (t
))
5175 tree ctx
= TYPE_CONTEXT (t
);
5176 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5177 So push that instead. */
5178 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5179 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5180 fld_worklist_push (ctx
, fld
);
5182 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5183 and want not to reach unused types this way. */
5185 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5189 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5190 fld_worklist_push (TREE_TYPE (tem
), fld
);
5191 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5193 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5194 && TREE_CODE (tem
) == TREE_LIST
)
5197 fld_worklist_push (TREE_VALUE (tem
), fld
);
5198 tem
= TREE_CHAIN (tem
);
5202 if (RECORD_OR_UNION_TYPE_P (t
))
5205 /* Push all TYPE_FIELDS - there can be interleaving interesting
5206 and non-interesting things. */
5207 tem
= TYPE_FIELDS (t
);
5210 if (TREE_CODE (tem
) == FIELD_DECL
5211 || TREE_CODE (tem
) == TYPE_DECL
)
5212 fld_worklist_push (tem
, fld
);
5213 tem
= TREE_CHAIN (tem
);
5217 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5220 else if (TREE_CODE (t
) == BLOCK
)
5223 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5224 fld_worklist_push (tem
, fld
);
5225 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5226 fld_worklist_push (tem
, fld
);
5227 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5230 if (TREE_CODE (t
) != IDENTIFIER_NODE
5231 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5232 fld_worklist_push (TREE_TYPE (t
), fld
);
5238 /* Find decls and types in T. */
5241 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5245 if (!pointer_set_contains (fld
->pset
, t
))
5246 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5247 if (fld
->worklist
.is_empty ())
5249 t
= fld
->worklist
.pop ();
5253 /* Translate all the types in LIST with the corresponding runtime
5257 get_eh_types_for_runtime (tree list
)
5261 if (list
== NULL_TREE
)
5264 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5266 list
= TREE_CHAIN (list
);
5269 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5270 TREE_CHAIN (prev
) = n
;
5271 prev
= TREE_CHAIN (prev
);
5272 list
= TREE_CHAIN (list
);
5279 /* Find decls and types referenced in EH region R and store them in
5280 FLD->DECLS and FLD->TYPES. */
5283 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5294 /* The types referenced in each catch must first be changed to the
5295 EH types used at runtime. This removes references to FE types
5297 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5299 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5300 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5305 case ERT_ALLOWED_EXCEPTIONS
:
5306 r
->u
.allowed
.type_list
5307 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5308 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5311 case ERT_MUST_NOT_THROW
:
5312 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5313 find_decls_types_r
, fld
, fld
->pset
);
5319 /* Find decls and types referenced in cgraph node N and store them in
5320 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5321 look for *every* kind of DECL and TYPE node reachable from N,
5322 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5323 NAMESPACE_DECLs, etc). */
5326 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5329 struct function
*fn
;
5333 find_decls_types (n
->symbol
.decl
, fld
);
5335 if (!gimple_has_body_p (n
->symbol
.decl
))
5338 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5340 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5342 /* Traverse locals. */
5343 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5344 find_decls_types (t
, fld
);
5346 /* Traverse EH regions in FN. */
5349 FOR_ALL_EH_REGION_FN (r
, fn
)
5350 find_decls_types_in_eh_region (r
, fld
);
5353 /* Traverse every statement in FN. */
5354 FOR_EACH_BB_FN (bb
, fn
)
5356 gimple_stmt_iterator si
;
5359 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5361 gimple phi
= gsi_stmt (si
);
5363 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5365 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5366 find_decls_types (*arg_p
, fld
);
5370 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5372 gimple stmt
= gsi_stmt (si
);
5374 if (is_gimple_call (stmt
))
5375 find_decls_types (gimple_call_fntype (stmt
), fld
);
5377 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5379 tree arg
= gimple_op (stmt
, i
);
5380 find_decls_types (arg
, fld
);
5387 /* Find decls and types referenced in varpool node N and store them in
5388 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5389 look for *every* kind of DECL and TYPE node reachable from N,
5390 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5391 NAMESPACE_DECLs, etc). */
5394 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5396 find_decls_types (v
->symbol
.decl
, fld
);
5399 /* If T needs an assembler name, have one created for it. */
5402 assign_assembler_name_if_neeeded (tree t
)
5404 if (need_assembler_name_p (t
))
5406 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5407 diagnostics that use input_location to show locus
5408 information. The problem here is that, at this point,
5409 input_location is generally anchored to the end of the file
5410 (since the parser is long gone), so we don't have a good
5411 position to pin it to.
5413 To alleviate this problem, this uses the location of T's
5414 declaration. Examples of this are
5415 testsuite/g++.dg/template/cond2.C and
5416 testsuite/g++.dg/template/pr35240.C. */
5417 location_t saved_location
= input_location
;
5418 input_location
= DECL_SOURCE_LOCATION (t
);
5420 decl_assembler_name (t
);
5422 input_location
= saved_location
;
5427 /* Free language specific information for every operand and expression
5428 in every node of the call graph. This process operates in three stages:
5430 1- Every callgraph node and varpool node is traversed looking for
5431 decls and types embedded in them. This is a more exhaustive
5432 search than that done by find_referenced_vars, because it will
5433 also collect individual fields, decls embedded in types, etc.
5435 2- All the decls found are sent to free_lang_data_in_decl.
5437 3- All the types found are sent to free_lang_data_in_type.
5439 The ordering between decls and types is important because
5440 free_lang_data_in_decl sets assembler names, which includes
5441 mangling. So types cannot be freed up until assembler names have
5445 free_lang_data_in_cgraph (void)
5447 struct cgraph_node
*n
;
5448 struct varpool_node
*v
;
5449 struct free_lang_data_d fld
;
5454 /* Initialize sets and arrays to store referenced decls and types. */
5455 fld
.pset
= pointer_set_create ();
5456 fld
.worklist
.create (0);
5457 fld
.decls
.create (100);
5458 fld
.types
.create (100);
5460 /* Find decls and types in the body of every function in the callgraph. */
5461 FOR_EACH_FUNCTION (n
)
5462 find_decls_types_in_node (n
, &fld
);
5464 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5465 find_decls_types (p
->decl
, &fld
);
5467 /* Find decls and types in every varpool symbol. */
5468 FOR_EACH_VARIABLE (v
)
5469 find_decls_types_in_var (v
, &fld
);
5471 /* Set the assembler name on every decl found. We need to do this
5472 now because free_lang_data_in_decl will invalidate data needed
5473 for mangling. This breaks mangling on interdependent decls. */
5474 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5475 assign_assembler_name_if_neeeded (t
);
5477 /* Traverse every decl found freeing its language data. */
5478 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5479 free_lang_data_in_decl (t
);
5481 /* Traverse every type found freeing its language data. */
5482 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5483 free_lang_data_in_type (t
);
5485 pointer_set_destroy (fld
.pset
);
5486 fld
.worklist
.release ();
5487 fld
.decls
.release ();
5488 fld
.types
.release ();
5492 /* Free resources that are used by FE but are not needed once they are done. */
5495 free_lang_data (void)
5499 /* If we are the LTO frontend we have freed lang-specific data already. */
5501 || !flag_generate_lto
)
5504 /* Allocate and assign alias sets to the standard integer types
5505 while the slots are still in the way the frontends generated them. */
5506 for (i
= 0; i
< itk_none
; ++i
)
5507 if (integer_types
[i
])
5508 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5510 /* Traverse the IL resetting language specific information for
5511 operands, expressions, etc. */
5512 free_lang_data_in_cgraph ();
5514 /* Create gimple variants for common types. */
5515 ptrdiff_type_node
= integer_type_node
;
5516 fileptr_type_node
= ptr_type_node
;
5518 /* Reset some langhooks. Do not reset types_compatible_p, it may
5519 still be used indirectly via the get_alias_set langhook. */
5520 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5521 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5522 /* We do not want the default decl_assembler_name implementation,
5523 rather if we have fixed everything we want a wrapper around it
5524 asserting that all non-local symbols already got their assembler
5525 name and only produce assembler names for local symbols. Or rather
5526 make sure we never call decl_assembler_name on local symbols and
5527 devise a separate, middle-end private scheme for it. */
5529 /* Reset diagnostic machinery. */
5530 tree_diagnostics_defaults (global_dc
);
5538 const pass_data pass_data_ipa_free_lang_data
=
5540 SIMPLE_IPA_PASS
, /* type */
5541 "*free_lang_data", /* name */
5542 OPTGROUP_NONE
, /* optinfo_flags */
5543 false, /* has_gate */
5544 true, /* has_execute */
5545 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5546 0, /* properties_required */
5547 0, /* properties_provided */
5548 0, /* properties_destroyed */
5549 0, /* todo_flags_start */
5550 0, /* todo_flags_finish */
5553 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5556 pass_ipa_free_lang_data(gcc::context
*ctxt
)
5557 : simple_ipa_opt_pass(pass_data_ipa_free_lang_data
, ctxt
)
5560 /* opt_pass methods: */
5561 unsigned int execute () { return free_lang_data (); }
5563 }; // class pass_ipa_free_lang_data
5567 simple_ipa_opt_pass
*
5568 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5570 return new pass_ipa_free_lang_data (ctxt
);
5573 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5574 ATTR_NAME. Also used internally by remove_attribute(). */
5576 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5578 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5580 if (ident_len
== attr_len
)
5582 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5585 else if (ident_len
== attr_len
+ 4)
5587 /* There is the possibility that ATTR is 'text' and IDENT is
5589 const char *p
= IDENTIFIER_POINTER (ident
);
5590 if (p
[0] == '_' && p
[1] == '_'
5591 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5592 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5599 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5600 of ATTR_NAME, and LIST is not NULL_TREE. */
5602 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5606 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5608 if (ident_len
== attr_len
)
5610 if (!strcmp (attr_name
,
5611 IDENTIFIER_POINTER (get_attribute_name (list
))))
5614 /* TODO: If we made sure that attributes were stored in the
5615 canonical form without '__...__' (ie, as in 'text' as opposed
5616 to '__text__') then we could avoid the following case. */
5617 else if (ident_len
== attr_len
+ 4)
5619 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5620 if (p
[0] == '_' && p
[1] == '_'
5621 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5622 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5625 list
= TREE_CHAIN (list
);
5631 /* A variant of lookup_attribute() that can be used with an identifier
5632 as the first argument, and where the identifier can be either
5633 'text' or '__text__'.
5635 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5636 return a pointer to the attribute's list element if the attribute
5637 is part of the list, or NULL_TREE if not found. If the attribute
5638 appears more than once, this only returns the first occurrence; the
5639 TREE_CHAIN of the return value should be passed back in if further
5640 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5641 can be in the form 'text' or '__text__'. */
5643 lookup_ident_attribute (tree attr_identifier
, tree list
)
5645 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5649 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5650 == IDENTIFIER_NODE
);
5652 /* Identifiers can be compared directly for equality. */
5653 if (attr_identifier
== get_attribute_name (list
))
5656 /* If they are not equal, they may still be one in the form
5657 'text' while the other one is in the form '__text__'. TODO:
5658 If we were storing attributes in normalized 'text' form, then
5659 this could all go away and we could take full advantage of
5660 the fact that we're comparing identifiers. :-) */
5662 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5663 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5665 if (ident_len
== attr_len
+ 4)
5667 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5668 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5669 if (p
[0] == '_' && p
[1] == '_'
5670 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5671 && strncmp (q
, p
+ 2, attr_len
) == 0)
5674 else if (ident_len
+ 4 == attr_len
)
5676 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5677 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5678 if (q
[0] == '_' && q
[1] == '_'
5679 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5680 && strncmp (q
+ 2, p
, ident_len
) == 0)
5684 list
= TREE_CHAIN (list
);
5690 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5694 remove_attribute (const char *attr_name
, tree list
)
5697 size_t attr_len
= strlen (attr_name
);
5699 gcc_checking_assert (attr_name
[0] != '_');
5701 for (p
= &list
; *p
; )
5704 /* TODO: If we were storing attributes in normalized form, here
5705 we could use a simple strcmp(). */
5706 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5707 *p
= TREE_CHAIN (l
);
5709 p
= &TREE_CHAIN (l
);
5715 /* Return an attribute list that is the union of a1 and a2. */
5718 merge_attributes (tree a1
, tree a2
)
5722 /* Either one unset? Take the set one. */
5724 if ((attributes
= a1
) == 0)
5727 /* One that completely contains the other? Take it. */
5729 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5731 if (attribute_list_contained (a2
, a1
))
5735 /* Pick the longest list, and hang on the other list. */
5737 if (list_length (a1
) < list_length (a2
))
5738 attributes
= a2
, a2
= a1
;
5740 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5743 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5745 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5746 a
= lookup_ident_attribute (get_attribute_name (a2
),
5751 a1
= copy_node (a2
);
5752 TREE_CHAIN (a1
) = attributes
;
5761 /* Given types T1 and T2, merge their attributes and return
5765 merge_type_attributes (tree t1
, tree t2
)
5767 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5768 TYPE_ATTRIBUTES (t2
));
5771 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5775 merge_decl_attributes (tree olddecl
, tree newdecl
)
5777 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5778 DECL_ATTRIBUTES (newdecl
));
5781 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5783 /* Specialization of merge_decl_attributes for various Windows targets.
5785 This handles the following situation:
5787 __declspec (dllimport) int foo;
5790 The second instance of `foo' nullifies the dllimport. */
5793 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5796 int delete_dllimport_p
= 1;
5798 /* What we need to do here is remove from `old' dllimport if it doesn't
5799 appear in `new'. dllimport behaves like extern: if a declaration is
5800 marked dllimport and a definition appears later, then the object
5801 is not dllimport'd. We also remove a `new' dllimport if the old list
5802 contains dllexport: dllexport always overrides dllimport, regardless
5803 of the order of declaration. */
5804 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5805 delete_dllimport_p
= 0;
5806 else if (DECL_DLLIMPORT_P (new_tree
)
5807 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5809 DECL_DLLIMPORT_P (new_tree
) = 0;
5810 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5811 "dllimport ignored", new_tree
);
5813 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5815 /* Warn about overriding a symbol that has already been used, e.g.:
5816 extern int __attribute__ ((dllimport)) foo;
5817 int* bar () {return &foo;}
5820 if (TREE_USED (old
))
5822 warning (0, "%q+D redeclared without dllimport attribute "
5823 "after being referenced with dll linkage", new_tree
);
5824 /* If we have used a variable's address with dllimport linkage,
5825 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5826 decl may already have had TREE_CONSTANT computed.
5827 We still remove the attribute so that assembler code refers
5828 to '&foo rather than '_imp__foo'. */
5829 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5830 DECL_DLLIMPORT_P (new_tree
) = 1;
5833 /* Let an inline definition silently override the external reference,
5834 but otherwise warn about attribute inconsistency. */
5835 else if (TREE_CODE (new_tree
) == VAR_DECL
5836 || !DECL_DECLARED_INLINE_P (new_tree
))
5837 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5838 "previous dllimport ignored", new_tree
);
5841 delete_dllimport_p
= 0;
5843 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5845 if (delete_dllimport_p
)
5846 a
= remove_attribute ("dllimport", a
);
5851 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5852 struct attribute_spec.handler. */
5855 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5861 /* These attributes may apply to structure and union types being created,
5862 but otherwise should pass to the declaration involved. */
5865 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5866 | (int) ATTR_FLAG_ARRAY_NEXT
))
5868 *no_add_attrs
= true;
5869 return tree_cons (name
, args
, NULL_TREE
);
5871 if (TREE_CODE (node
) == RECORD_TYPE
5872 || TREE_CODE (node
) == UNION_TYPE
)
5874 node
= TYPE_NAME (node
);
5880 warning (OPT_Wattributes
, "%qE attribute ignored",
5882 *no_add_attrs
= true;
5887 if (TREE_CODE (node
) != FUNCTION_DECL
5888 && TREE_CODE (node
) != VAR_DECL
5889 && TREE_CODE (node
) != TYPE_DECL
)
5891 *no_add_attrs
= true;
5892 warning (OPT_Wattributes
, "%qE attribute ignored",
5897 if (TREE_CODE (node
) == TYPE_DECL
5898 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5899 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5901 *no_add_attrs
= true;
5902 warning (OPT_Wattributes
, "%qE attribute ignored",
5907 is_dllimport
= is_attribute_p ("dllimport", name
);
5909 /* Report error on dllimport ambiguities seen now before they cause
5913 /* Honor any target-specific overrides. */
5914 if (!targetm
.valid_dllimport_attribute_p (node
))
5915 *no_add_attrs
= true;
5917 else if (TREE_CODE (node
) == FUNCTION_DECL
5918 && DECL_DECLARED_INLINE_P (node
))
5920 warning (OPT_Wattributes
, "inline function %q+D declared as "
5921 " dllimport: attribute ignored", node
);
5922 *no_add_attrs
= true;
5924 /* Like MS, treat definition of dllimported variables and
5925 non-inlined functions on declaration as syntax errors. */
5926 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5928 error ("function %q+D definition is marked dllimport", node
);
5929 *no_add_attrs
= true;
5932 else if (TREE_CODE (node
) == VAR_DECL
)
5934 if (DECL_INITIAL (node
))
5936 error ("variable %q+D definition is marked dllimport",
5938 *no_add_attrs
= true;
5941 /* `extern' needn't be specified with dllimport.
5942 Specify `extern' now and hope for the best. Sigh. */
5943 DECL_EXTERNAL (node
) = 1;
5944 /* Also, implicitly give dllimport'd variables declared within
5945 a function global scope, unless declared static. */
5946 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5947 TREE_PUBLIC (node
) = 1;
5950 if (*no_add_attrs
== false)
5951 DECL_DLLIMPORT_P (node
) = 1;
5953 else if (TREE_CODE (node
) == FUNCTION_DECL
5954 && DECL_DECLARED_INLINE_P (node
)
5955 && flag_keep_inline_dllexport
)
5956 /* An exported function, even if inline, must be emitted. */
5957 DECL_EXTERNAL (node
) = 0;
5959 /* Report error if symbol is not accessible at global scope. */
5960 if (!TREE_PUBLIC (node
)
5961 && (TREE_CODE (node
) == VAR_DECL
5962 || TREE_CODE (node
) == FUNCTION_DECL
))
5964 error ("external linkage required for symbol %q+D because of "
5965 "%qE attribute", node
, name
);
5966 *no_add_attrs
= true;
5969 /* A dllexport'd entity must have default visibility so that other
5970 program units (shared libraries or the main executable) can see
5971 it. A dllimport'd entity must have default visibility so that
5972 the linker knows that undefined references within this program
5973 unit can be resolved by the dynamic linker. */
5976 if (DECL_VISIBILITY_SPECIFIED (node
)
5977 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5978 error ("%qE implies default visibility, but %qD has already "
5979 "been declared with a different visibility",
5981 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5982 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5988 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5990 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5991 of the various TYPE_QUAL values. Also, set the UPC layout qualifier,
5992 which is either null or a reference to an integral constant. */
5995 set_type_quals (tree type
, int type_quals
, tree layout_qualifier
)
5997 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5998 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5999 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6000 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6001 TYPE_SHARED (type
) = (type_quals
& TYPE_QUAL_SHARED
) != 0;
6002 TYPE_STRICT (type
) = (type_quals
& TYPE_QUAL_STRICT
) != 0;
6003 TYPE_RELAXED (type
) = (type_quals
& TYPE_QUAL_RELAXED
) != 0;
6004 if (TYPE_SHARED (type
))
6005 SET_TYPE_BLOCK_FACTOR (type
, layout_qualifier
);
6008 /* Returns true iff CAND is equivalent to BASE with
6009 TYPE_QUALS and LAYOUT_QUALIFIER. */
6012 check_qualified_type (const_tree cand
, const_tree base
,
6013 int type_quals
, tree layout_qualifier
)
6015 return (TYPE_QUALS (cand
) == type_quals
6016 && (TYPE_BLOCK_FACTOR (cand
) == layout_qualifier
6017 || tree_int_cst_equal (TYPE_BLOCK_FACTOR (cand
),
6019 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6020 /* Apparently this is needed for Objective-C. */
6021 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6022 /* Check alignment. */
6023 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6024 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6025 TYPE_ATTRIBUTES (base
)));
6028 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6031 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6033 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6034 && (TYPE_BLOCK_FACTOR (cand
) == TYPE_BLOCK_FACTOR (base
)
6035 || tree_int_cst_equal (TYPE_BLOCK_FACTOR (cand
),
6036 TYPE_BLOCK_FACTOR (base
)))
6037 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6038 /* Apparently this is needed for Objective-C. */
6039 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6040 /* Check alignment. */
6041 && TYPE_ALIGN (cand
) == align
6042 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6043 TYPE_ATTRIBUTES (base
)));
6046 /* Return a version of the TYPE, qualified as indicated by the
6047 TYPE_QUALS, if one exists. If no qualified version exists yet,
6048 return NULL_TREE. */
6051 get_qualified_type_1 (tree type
, int type_quals
, tree layout_qualifier
)
6055 if (TYPE_QUALS (type
) == type_quals
)
6058 /* Search the chain of variants to see if there is already one there just
6059 like the one we need to have. If so, use that existing one. We must
6060 preserve the TYPE_NAME, since there is code that depends on this. */
6061 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6062 if (check_qualified_type (t
, type
, type_quals
, layout_qualifier
))
6068 /* Like get_qualified_type_1, but creates the type if it does not
6069 exist. This function never returns NULL_TREE. */
6072 build_qualified_type_1 (tree type
, int type_quals
, tree layout_qualifier
)
6076 /* See if we already have the appropriate qualified variant. */
6077 t
= get_qualified_type_1 (type
, type_quals
, layout_qualifier
);
6079 /* If not, build it. */
6082 t
= build_variant_type_copy (type
);
6083 set_type_quals (t
, type_quals
, layout_qualifier
);
6085 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6086 /* Propagate structural equality. */
6087 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6088 else if (TYPE_CANONICAL (type
) != type
)
6089 /* Build the underlying canonical type, since it is different
6091 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6094 /* T is its own canonical type. */
6095 TYPE_CANONICAL (t
) = t
;
6102 /* Return a variant of TYPE, where all UPC qualifiers
6103 have been removed. */
6106 build_upc_unshared_type (tree type
)
6109 if (TREE_CODE (type
) == ARRAY_TYPE
)
6111 const tree elem_type
= TREE_TYPE(type
);
6112 const tree u_elem_type
= build_upc_unshared_type (elem_type
);
6113 if (u_elem_type
!= elem_type
)
6115 for (u_type
= TYPE_MAIN_VARIANT (type
);
6116 u_type
&& TREE_TYPE(u_type
) != u_elem_type
;
6117 u_type
= TYPE_NEXT_VARIANT (u_type
)) /* loop */;
6120 u_type
= build_variant_type_copy (type
);
6121 TREE_TYPE (u_type
) = u_elem_type
;
6127 const int quals
= TYPE_QUALS (type
);
6128 const int u_quals
= quals
& ~(TYPE_QUAL_SHARED
6130 | TYPE_QUAL_STRICT
);
6131 u_type
= build_qualified_type (type
, u_quals
);
6136 /* Create a variant of type T with alignment ALIGN. */
6139 build_aligned_type (tree type
, unsigned int align
)
6143 if (TYPE_PACKED (type
)
6144 || TYPE_ALIGN (type
) == align
)
6147 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6148 if (check_aligned_type (t
, type
, align
))
6151 t
= build_variant_type_copy (type
);
6152 TYPE_ALIGN (t
) = align
;
6157 /* Create a new distinct copy of TYPE. The new type is made its own
6158 MAIN_VARIANT. If TYPE requires structural equality checks, the
6159 resulting type requires structural equality checks; otherwise, its
6160 TYPE_CANONICAL points to itself. */
6163 build_distinct_type_copy (tree type
)
6165 tree t
= copy_node (type
);
6167 TYPE_POINTER_TO (t
) = 0;
6168 TYPE_REFERENCE_TO (t
) = 0;
6170 /* Set the canonical type either to a new equivalence class, or
6171 propagate the need for structural equality checks. */
6172 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6173 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6175 TYPE_CANONICAL (t
) = t
;
6177 /* Make it its own variant. */
6178 TYPE_MAIN_VARIANT (t
) = t
;
6179 TYPE_NEXT_VARIANT (t
) = 0;
6181 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6182 whose TREE_TYPE is not t. This can also happen in the Ada
6183 frontend when using subtypes. */
6188 /* Create a new variant of TYPE, equivalent but distinct. This is so
6189 the caller can modify it. TYPE_CANONICAL for the return type will
6190 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6191 are considered equal by the language itself (or that both types
6192 require structural equality checks). */
6195 build_variant_type_copy (tree type
)
6197 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6199 t
= build_distinct_type_copy (type
);
6201 /* Since we're building a variant, assume that it is a non-semantic
6202 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6203 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6205 /* Add the new type to the chain of variants of TYPE. */
6206 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6207 TYPE_NEXT_VARIANT (m
) = t
;
6208 TYPE_MAIN_VARIANT (t
) = m
;
6213 /* Return true if the from tree in both tree maps are equal. */
6216 tree_map_base_eq (const void *va
, const void *vb
)
6218 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6219 *const b
= (const struct tree_map_base
*) vb
;
6220 return (a
->from
== b
->from
);
6223 /* Hash a from tree in a tree_base_map. */
6226 tree_map_base_hash (const void *item
)
6228 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6231 /* Return true if this tree map structure is marked for garbage collection
6232 purposes. We simply return true if the from tree is marked, so that this
6233 structure goes away when the from tree goes away. */
6236 tree_map_base_marked_p (const void *p
)
6238 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6241 /* Hash a from tree in a tree_map. */
6244 tree_map_hash (const void *item
)
6246 return (((const struct tree_map
*) item
)->hash
);
6249 /* Hash a from tree in a tree_decl_map. */
6252 tree_decl_map_hash (const void *item
)
6254 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6257 /* Return the initialization priority for DECL. */
6260 decl_init_priority_lookup (tree decl
)
6262 struct tree_priority_map
*h
;
6263 struct tree_map_base in
;
6265 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6267 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6268 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6271 /* Return the finalization priority for DECL. */
6274 decl_fini_priority_lookup (tree decl
)
6276 struct tree_priority_map
*h
;
6277 struct tree_map_base in
;
6279 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6281 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6282 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6285 /* Return the initialization and finalization priority information for
6286 DECL. If there is no previous priority information, a freshly
6287 allocated structure is returned. */
6289 static struct tree_priority_map
*
6290 decl_priority_info (tree decl
)
6292 struct tree_priority_map in
;
6293 struct tree_priority_map
*h
;
6296 in
.base
.from
= decl
;
6297 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6298 h
= (struct tree_priority_map
*) *loc
;
6301 h
= ggc_alloc_cleared_tree_priority_map ();
6303 h
->base
.from
= decl
;
6304 h
->init
= DEFAULT_INIT_PRIORITY
;
6305 h
->fini
= DEFAULT_INIT_PRIORITY
;
6311 /* Set the initialization priority for DECL to PRIORITY. */
6314 decl_init_priority_insert (tree decl
, priority_type priority
)
6316 struct tree_priority_map
*h
;
6318 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6319 if (priority
== DEFAULT_INIT_PRIORITY
)
6321 h
= decl_priority_info (decl
);
6325 /* Set the finalization priority for DECL to PRIORITY. */
6328 decl_fini_priority_insert (tree decl
, priority_type priority
)
6330 struct tree_priority_map
*h
;
6332 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6333 if (priority
== DEFAULT_INIT_PRIORITY
)
6335 h
= decl_priority_info (decl
);
6339 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6342 print_debug_expr_statistics (void)
6344 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6345 (long) htab_size (debug_expr_for_decl
),
6346 (long) htab_elements (debug_expr_for_decl
),
6347 htab_collisions (debug_expr_for_decl
));
6350 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6353 print_value_expr_statistics (void)
6355 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6356 (long) htab_size (value_expr_for_decl
),
6357 (long) htab_elements (value_expr_for_decl
),
6358 htab_collisions (value_expr_for_decl
));
6361 /* Lookup a debug expression for FROM, and return it if we find one. */
6364 decl_debug_expr_lookup (tree from
)
6366 struct tree_decl_map
*h
, in
;
6367 in
.base
.from
= from
;
6369 h
= (struct tree_decl_map
*)
6370 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6376 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6379 decl_debug_expr_insert (tree from
, tree to
)
6381 struct tree_decl_map
*h
;
6384 h
= ggc_alloc_tree_decl_map ();
6385 h
->base
.from
= from
;
6387 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6389 *(struct tree_decl_map
**) loc
= h
;
6392 /* Lookup a value expression for FROM, and return it if we find one. */
6395 decl_value_expr_lookup (tree from
)
6397 struct tree_decl_map
*h
, in
;
6398 in
.base
.from
= from
;
6400 h
= (struct tree_decl_map
*)
6401 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6407 /* Insert a mapping FROM->TO in the value expression hashtable. */
6410 decl_value_expr_insert (tree from
, tree to
)
6412 struct tree_decl_map
*h
;
6415 h
= ggc_alloc_tree_decl_map ();
6416 h
->base
.from
= from
;
6418 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6420 *(struct tree_decl_map
**) loc
= h
;
6423 /* Lookup a vector of debug arguments for FROM, and return it if we
6427 decl_debug_args_lookup (tree from
)
6429 struct tree_vec_map
*h
, in
;
6431 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6433 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6434 in
.base
.from
= from
;
6435 h
= (struct tree_vec_map
*)
6436 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6442 /* Insert a mapping FROM->empty vector of debug arguments in the value
6443 expression hashtable. */
6446 decl_debug_args_insert (tree from
)
6448 struct tree_vec_map
*h
;
6451 if (DECL_HAS_DEBUG_ARGS_P (from
))
6452 return decl_debug_args_lookup (from
);
6453 if (debug_args_for_decl
== NULL
)
6454 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6455 tree_vec_map_eq
, 0);
6456 h
= ggc_alloc_tree_vec_map ();
6457 h
->base
.from
= from
;
6459 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6461 *(struct tree_vec_map
**) loc
= h
;
6462 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6466 /* Hashing of types so that we don't make duplicates.
6467 The entry point is `type_hash_canon'. */
6469 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6470 with types in the TREE_VALUE slots), by adding the hash codes
6471 of the individual types. */
6474 type_hash_list (const_tree list
, hashval_t hashcode
)
6478 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6479 if (TREE_VALUE (tail
) != error_mark_node
)
6480 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6486 /* These are the Hashtable callback functions. */
6488 /* Returns true iff the types are equivalent. */
6491 type_hash_eq (const void *va
, const void *vb
)
6493 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6494 *const b
= (const struct type_hash
*) vb
;
6496 /* First test the things that are the same for all types. */
6497 if (a
->hash
!= b
->hash
6498 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6499 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6500 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6501 TYPE_ATTRIBUTES (b
->type
))
6502 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6503 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6506 /* Be careful about comparing arrays before and after the element type
6507 has been completed; don't compare TYPE_ALIGN unless both types are
6509 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6510 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6511 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6514 switch (TREE_CODE (a
->type
))
6519 case REFERENCE_TYPE
:
6524 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6527 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6528 && !(TYPE_VALUES (a
->type
)
6529 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6530 && TYPE_VALUES (b
->type
)
6531 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6532 && type_list_equal (TYPE_VALUES (a
->type
),
6533 TYPE_VALUES (b
->type
))))
6536 /* ... fall through ... */
6541 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6542 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6543 TYPE_MAX_VALUE (b
->type
)))
6544 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6545 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6546 TYPE_MIN_VALUE (b
->type
))));
6548 case FIXED_POINT_TYPE
:
6549 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6552 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6555 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6556 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6557 || (TYPE_ARG_TYPES (a
->type
)
6558 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6559 && TYPE_ARG_TYPES (b
->type
)
6560 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6561 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6562 TYPE_ARG_TYPES (b
->type
)))))
6566 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6570 case QUAL_UNION_TYPE
:
6571 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6572 || (TYPE_FIELDS (a
->type
)
6573 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6574 && TYPE_FIELDS (b
->type
)
6575 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6576 && type_list_equal (TYPE_FIELDS (a
->type
),
6577 TYPE_FIELDS (b
->type
))));
6580 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6581 || (TYPE_ARG_TYPES (a
->type
)
6582 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6583 && TYPE_ARG_TYPES (b
->type
)
6584 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6585 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6586 TYPE_ARG_TYPES (b
->type
))))
6594 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6595 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6600 /* Return the cached hash value. */
6603 type_hash_hash (const void *item
)
6605 return ((const struct type_hash
*) item
)->hash
;
6608 /* Look in the type hash table for a type isomorphic to TYPE.
6609 If one is found, return it. Otherwise return 0. */
6612 type_hash_lookup (hashval_t hashcode
, tree type
)
6614 struct type_hash
*h
, in
;
6616 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6617 must call that routine before comparing TYPE_ALIGNs. */
6623 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6630 /* Add an entry to the type-hash-table
6631 for a type TYPE whose hash code is HASHCODE. */
6634 type_hash_add (hashval_t hashcode
, tree type
)
6636 struct type_hash
*h
;
6639 h
= ggc_alloc_type_hash ();
6642 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6646 /* Given TYPE, and HASHCODE its hash code, return the canonical
6647 object for an identical type if one already exists.
6648 Otherwise, return TYPE, and record it as the canonical object.
6650 To use this function, first create a type of the sort you want.
6651 Then compute its hash code from the fields of the type that
6652 make it different from other similar types.
6653 Then call this function and use the value. */
6656 type_hash_canon (unsigned int hashcode
, tree type
)
6660 /* The hash table only contains main variants, so ensure that's what we're
6662 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6664 /* See if the type is in the hash table already. If so, return it.
6665 Otherwise, add the type. */
6666 t1
= type_hash_lookup (hashcode
, type
);
6669 if (GATHER_STATISTICS
)
6671 tree_code_counts
[(int) TREE_CODE (type
)]--;
6672 tree_node_counts
[(int) t_kind
]--;
6673 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6679 type_hash_add (hashcode
, type
);
6684 /* See if the data pointed to by the type hash table is marked. We consider
6685 it marked if the type is marked or if a debug type number or symbol
6686 table entry has been made for the type. */
6689 type_hash_marked_p (const void *p
)
6691 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6693 return ggc_marked_p (type
);
6697 print_type_hash_statistics (void)
6699 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6700 (long) htab_size (type_hash_table
),
6701 (long) htab_elements (type_hash_table
),
6702 htab_collisions (type_hash_table
));
6705 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6706 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6707 by adding the hash codes of the individual attributes. */
6710 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6714 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6715 /* ??? Do we want to add in TREE_VALUE too? */
6716 hashcode
= iterative_hash_object
6717 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6721 /* Given two lists of attributes, return true if list l2 is
6722 equivalent to l1. */
6725 attribute_list_equal (const_tree l1
, const_tree l2
)
6730 return attribute_list_contained (l1
, l2
)
6731 && attribute_list_contained (l2
, l1
);
6734 /* Given two lists of attributes, return true if list L2 is
6735 completely contained within L1. */
6736 /* ??? This would be faster if attribute names were stored in a canonicalized
6737 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6738 must be used to show these elements are equivalent (which they are). */
6739 /* ??? It's not clear that attributes with arguments will always be handled
6743 attribute_list_contained (const_tree l1
, const_tree l2
)
6747 /* First check the obvious, maybe the lists are identical. */
6751 /* Maybe the lists are similar. */
6752 for (t1
= l1
, t2
= l2
;
6754 && get_attribute_name (t1
) == get_attribute_name (t2
)
6755 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6756 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6759 /* Maybe the lists are equal. */
6760 if (t1
== 0 && t2
== 0)
6763 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6766 /* This CONST_CAST is okay because lookup_attribute does not
6767 modify its argument and the return value is assigned to a
6769 for (attr
= lookup_ident_attribute (get_attribute_name (t2
), CONST_CAST_TREE(l1
));
6770 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6771 attr
= lookup_ident_attribute (get_attribute_name (t2
), TREE_CHAIN (attr
)))
6774 if (attr
== NULL_TREE
)
6781 /* Given two lists of types
6782 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6783 return 1 if the lists contain the same types in the same order.
6784 Also, the TREE_PURPOSEs must match. */
6787 type_list_equal (const_tree l1
, const_tree l2
)
6791 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6792 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6793 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6794 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6795 && (TREE_TYPE (TREE_PURPOSE (t1
))
6796 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6802 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6803 given by TYPE. If the argument list accepts variable arguments,
6804 then this function counts only the ordinary arguments. */
6807 type_num_arguments (const_tree type
)
6812 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6813 /* If the function does not take a variable number of arguments,
6814 the last element in the list will have type `void'. */
6815 if (VOID_TYPE_P (TREE_VALUE (t
)))
6823 /* Nonzero if integer constants T1 and T2
6824 represent the same constant value. */
6827 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6832 if (t1
== 0 || t2
== 0)
6835 if (TREE_CODE (t1
) == INTEGER_CST
6836 && TREE_CODE (t2
) == INTEGER_CST
6837 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6838 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6844 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6845 The precise way of comparison depends on their data type. */
6848 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6853 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6855 int t1_sgn
= tree_int_cst_sgn (t1
);
6856 int t2_sgn
= tree_int_cst_sgn (t2
);
6858 if (t1_sgn
< t2_sgn
)
6860 else if (t1_sgn
> t2_sgn
)
6862 /* Otherwise, both are non-negative, so we compare them as
6863 unsigned just in case one of them would overflow a signed
6866 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6867 return INT_CST_LT (t1
, t2
);
6869 return INT_CST_LT_UNSIGNED (t1
, t2
);
6872 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6875 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6877 if (tree_int_cst_lt (t1
, t2
))
6879 else if (tree_int_cst_lt (t2
, t1
))
6885 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6886 the host. If POS is zero, the value can be represented in a single
6887 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6888 be represented in a single unsigned HOST_WIDE_INT. */
6891 host_integerp (const_tree t
, int pos
)
6896 return (TREE_CODE (t
) == INTEGER_CST
6897 && ((TREE_INT_CST_HIGH (t
) == 0
6898 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6899 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6900 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6901 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6902 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6905 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6906 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6907 be non-negative. We must be able to satisfy the above conditions. */
6910 tree_low_cst (const_tree t
, int pos
)
6912 gcc_assert (host_integerp (t
, pos
));
6913 return TREE_INT_CST_LOW (t
);
6916 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6917 kind INTEGER_CST. This makes sure to properly sign-extend the
6921 size_low_cst (const_tree t
)
6923 double_int d
= tree_to_double_int (t
);
6924 return d
.sext (TYPE_PRECISION (TREE_TYPE (t
))).low
;
6927 /* Return the most significant (sign) bit of T. */
6930 tree_int_cst_sign_bit (const_tree t
)
6932 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6933 unsigned HOST_WIDE_INT w
;
6935 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6936 w
= TREE_INT_CST_LOW (t
);
6939 w
= TREE_INT_CST_HIGH (t
);
6940 bitno
-= HOST_BITS_PER_WIDE_INT
;
6943 return (w
>> bitno
) & 1;
6946 /* Return an indication of the sign of the integer constant T.
6947 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6948 Note that -1 will never be returned if T's type is unsigned. */
6951 tree_int_cst_sgn (const_tree t
)
6953 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6955 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6957 else if (TREE_INT_CST_HIGH (t
) < 0)
6963 /* Return the minimum number of bits needed to represent VALUE in a
6964 signed or unsigned type, UNSIGNEDP says which. */
6967 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6969 /* If the value is negative, compute its negative minus 1. The latter
6970 adjustment is because the absolute value of the largest negative value
6971 is one larger than the largest positive value. This is equivalent to
6972 a bit-wise negation, so use that operation instead. */
6974 if (tree_int_cst_sgn (value
) < 0)
6975 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6977 /* Return the number of bits needed, taking into account the fact
6978 that we need one more bit for a signed than unsigned type.
6979 If value is 0 or -1, the minimum precision is 1 no matter
6980 whether unsignedp is true or false. */
6982 if (integer_zerop (value
))
6985 return tree_floor_log2 (value
) + 1 + !unsignedp
;
6988 /* Compare two constructor-element-type constants. Return 1 if the lists
6989 are known to be equal; otherwise return 0. */
6992 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6994 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6996 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6999 l1
= TREE_CHAIN (l1
);
7000 l2
= TREE_CHAIN (l2
);
7006 /* Return truthvalue of whether T1 is the same tree structure as T2.
7007 Return 1 if they are the same.
7008 Return 0 if they are understandably different.
7009 Return -1 if either contains tree structure not understood by
7013 simple_cst_equal (const_tree t1
, const_tree t2
)
7015 enum tree_code code1
, code2
;
7021 if (t1
== 0 || t2
== 0)
7024 code1
= TREE_CODE (t1
);
7025 code2
= TREE_CODE (t2
);
7027 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7029 if (CONVERT_EXPR_CODE_P (code2
)
7030 || code2
== NON_LVALUE_EXPR
)
7031 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7033 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7036 else if (CONVERT_EXPR_CODE_P (code2
)
7037 || code2
== NON_LVALUE_EXPR
)
7038 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7046 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
7047 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
7050 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7053 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7056 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7057 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7058 TREE_STRING_LENGTH (t1
)));
7062 unsigned HOST_WIDE_INT idx
;
7063 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7064 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7066 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7069 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7070 /* ??? Should we handle also fields here? */
7071 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7077 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7080 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7083 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7086 const_tree arg1
, arg2
;
7087 const_call_expr_arg_iterator iter1
, iter2
;
7088 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7089 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7091 arg1
= next_const_call_expr_arg (&iter1
),
7092 arg2
= next_const_call_expr_arg (&iter2
))
7094 cmp
= simple_cst_equal (arg1
, arg2
);
7098 return arg1
== arg2
;
7102 /* Special case: if either target is an unallocated VAR_DECL,
7103 it means that it's going to be unified with whatever the
7104 TARGET_EXPR is really supposed to initialize, so treat it
7105 as being equivalent to anything. */
7106 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7107 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7108 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7109 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7110 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7111 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7114 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7119 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7121 case WITH_CLEANUP_EXPR
:
7122 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7126 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7129 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7130 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7144 /* This general rule works for most tree codes. All exceptions should be
7145 handled above. If this is a language-specific tree code, we can't
7146 trust what might be in the operand, so say we don't know
7148 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7151 switch (TREE_CODE_CLASS (code1
))
7155 case tcc_comparison
:
7156 case tcc_expression
:
7160 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7162 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7174 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7175 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7176 than U, respectively. */
7179 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7181 if (tree_int_cst_sgn (t
) < 0)
7183 else if (TREE_INT_CST_HIGH (t
) != 0)
7185 else if (TREE_INT_CST_LOW (t
) == u
)
7187 else if (TREE_INT_CST_LOW (t
) < u
)
7193 /* Return true if SIZE represents a constant size that is in bounds of
7194 what the middle-end and the backend accepts (covering not more than
7195 half of the address-space). */
7198 valid_constant_size_p (const_tree size
)
7200 if (! host_integerp (size
, 1)
7201 || TREE_OVERFLOW (size
)
7202 || tree_int_cst_sign_bit (size
) != 0)
7207 /* Return the precision of the type, or for a complex or vector type the
7208 precision of the type of its elements. */
7211 element_precision (const_tree type
)
7213 enum tree_code code
= TREE_CODE (type
);
7214 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7215 type
= TREE_TYPE (type
);
7217 return TYPE_PRECISION (type
);
7220 /* Return true if CODE represents an associative tree code. Otherwise
7223 associative_tree_code (enum tree_code code
)
7242 /* Return true if CODE represents a commutative tree code. Otherwise
7245 commutative_tree_code (enum tree_code code
)
7251 case MULT_HIGHPART_EXPR
:
7259 case UNORDERED_EXPR
:
7263 case TRUTH_AND_EXPR
:
7264 case TRUTH_XOR_EXPR
:
7266 case WIDEN_MULT_EXPR
:
7267 case VEC_WIDEN_MULT_HI_EXPR
:
7268 case VEC_WIDEN_MULT_LO_EXPR
:
7269 case VEC_WIDEN_MULT_EVEN_EXPR
:
7270 case VEC_WIDEN_MULT_ODD_EXPR
:
7279 /* Return true if CODE represents a ternary tree code for which the
7280 first two operands are commutative. Otherwise return false. */
7282 commutative_ternary_tree_code (enum tree_code code
)
7286 case WIDEN_MULT_PLUS_EXPR
:
7287 case WIDEN_MULT_MINUS_EXPR
:
7296 /* Generate a hash value for an expression. This can be used iteratively
7297 by passing a previous result as the VAL argument.
7299 This function is intended to produce the same hash for expressions which
7300 would compare equal using operand_equal_p. */
7303 iterative_hash_expr (const_tree t
, hashval_t val
)
7306 enum tree_code code
;
7310 return iterative_hash_hashval_t (0, val
);
7312 code
= TREE_CODE (t
);
7316 /* Alas, constants aren't shared, so we can't rely on pointer
7319 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
7320 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
7323 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7325 return iterative_hash_hashval_t (val2
, val
);
7329 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7331 return iterative_hash_hashval_t (val2
, val
);
7334 return iterative_hash (TREE_STRING_POINTER (t
),
7335 TREE_STRING_LENGTH (t
), val
);
7337 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7338 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7342 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7343 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7347 /* We can just compare by pointer. */
7348 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7349 case PLACEHOLDER_EXPR
:
7350 /* The node itself doesn't matter. */
7353 /* A list of expressions, for a CALL_EXPR or as the elements of a
7355 for (; t
; t
= TREE_CHAIN (t
))
7356 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7360 unsigned HOST_WIDE_INT idx
;
7362 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7364 val
= iterative_hash_expr (field
, val
);
7365 val
= iterative_hash_expr (value
, val
);
7371 /* The type of the second operand is relevant, except for
7372 its top-level qualifiers. */
7373 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7375 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7377 /* We could use the standard hash computation from this point
7379 val
= iterative_hash_object (code
, val
);
7380 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7381 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7385 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7386 Otherwise nodes that compare equal according to operand_equal_p might
7387 get different hash codes. However, don't do this for machine specific
7388 or front end builtins, since the function code is overloaded in those
7390 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7391 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7393 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7394 code
= TREE_CODE (t
);
7398 tclass
= TREE_CODE_CLASS (code
);
7400 if (tclass
== tcc_declaration
)
7402 /* DECL's have a unique ID */
7403 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7407 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7409 val
= iterative_hash_object (code
, val
);
7411 /* Don't hash the type, that can lead to having nodes which
7412 compare equal according to operand_equal_p, but which
7413 have different hash codes. */
7414 if (CONVERT_EXPR_CODE_P (code
)
7415 || code
== NON_LVALUE_EXPR
)
7417 /* Make sure to include signness in the hash computation. */
7418 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7419 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7422 else if (commutative_tree_code (code
))
7424 /* It's a commutative expression. We want to hash it the same
7425 however it appears. We do this by first hashing both operands
7426 and then rehashing based on the order of their independent
7428 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7429 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7433 t
= one
, one
= two
, two
= t
;
7435 val
= iterative_hash_hashval_t (one
, val
);
7436 val
= iterative_hash_hashval_t (two
, val
);
7439 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7440 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7446 /* Generate a hash value for a pair of expressions. This can be used
7447 iteratively by passing a previous result as the VAL argument.
7449 The same hash value is always returned for a given pair of expressions,
7450 regardless of the order in which they are presented. This is useful in
7451 hashing the operands of commutative functions. */
7454 iterative_hash_exprs_commutative (const_tree t1
,
7455 const_tree t2
, hashval_t val
)
7457 hashval_t one
= iterative_hash_expr (t1
, 0);
7458 hashval_t two
= iterative_hash_expr (t2
, 0);
7462 t
= one
, one
= two
, two
= t
;
7463 val
= iterative_hash_hashval_t (one
, val
);
7464 val
= iterative_hash_hashval_t (two
, val
);
7469 /* Constructors for pointer, array and function types.
7470 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7471 constructed by language-dependent code, not here.) */
7473 /* Construct, lay out and return the type of pointers to TO_TYPE with
7474 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7475 reference all of memory. If such a type has already been
7476 constructed, reuse it. */
7479 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7484 if (to_type
== error_mark_node
)
7485 return error_mark_node
;
7487 /* If the pointed-to type has the may_alias attribute set, force
7488 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7489 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7490 can_alias_all
= true;
7492 /* In some cases, languages will have things that aren't a POINTER_TYPE
7493 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7494 In that case, return that type without regard to the rest of our
7497 ??? This is a kludge, but consistent with the way this function has
7498 always operated and there doesn't seem to be a good way to avoid this
7500 if (TYPE_POINTER_TO (to_type
) != 0
7501 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7502 return TYPE_POINTER_TO (to_type
);
7504 /* First, if we already have a type for pointers to TO_TYPE and it's
7505 the proper mode, use it. */
7506 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7507 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7510 t
= make_node (POINTER_TYPE
);
7512 TREE_TYPE (t
) = to_type
;
7513 SET_TYPE_MODE (t
, mode
);
7514 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7515 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7516 TYPE_POINTER_TO (to_type
) = t
;
7518 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7519 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7520 else if (TYPE_CANONICAL (to_type
) != to_type
)
7522 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7523 mode
, can_alias_all
);
7525 /* Lay out the type. This function has many callers that are concerned
7526 with expression-construction, and this simplifies them all. */
7532 /* By default build pointers in ptr_mode. */
7535 build_pointer_type (tree to_type
)
7537 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7538 : TYPE_ADDR_SPACE (to_type
);
7539 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7540 if (upc_shared_type_p (to_type
))
7543 pointer_mode
= TYPE_MODE (upc_pts_rep_type_node
);
7544 upc_pts_type
= build_pointer_type_for_mode (to_type
, pointer_mode
,
7546 TYPE_USER_ALIGN (upc_pts_type
) = TYPE_USER_ALIGN (upc_pts_rep_type_node
);
7547 TYPE_ALIGN (upc_pts_type
) = TYPE_ALIGN (upc_pts_rep_type_node
);
7548 return upc_pts_type
;
7550 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7553 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7556 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7561 if (to_type
== error_mark_node
)
7562 return error_mark_node
;
7564 /* If the pointed-to type has the may_alias attribute set, force
7565 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7566 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7567 can_alias_all
= true;
7569 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7570 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7571 In that case, return that type without regard to the rest of our
7574 ??? This is a kludge, but consistent with the way this function has
7575 always operated and there doesn't seem to be a good way to avoid this
7577 if (TYPE_REFERENCE_TO (to_type
) != 0
7578 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7579 return TYPE_REFERENCE_TO (to_type
);
7581 /* First, if we already have a type for pointers to TO_TYPE and it's
7582 the proper mode, use it. */
7583 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7584 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7587 t
= make_node (REFERENCE_TYPE
);
7589 TREE_TYPE (t
) = to_type
;
7590 SET_TYPE_MODE (t
, mode
);
7591 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7592 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7593 TYPE_REFERENCE_TO (to_type
) = t
;
7595 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7596 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7597 else if (TYPE_CANONICAL (to_type
) != to_type
)
7599 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7600 mode
, can_alias_all
);
7608 /* Build the node for the type of references-to-TO_TYPE by default
7612 build_reference_type (tree to_type
)
7614 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7615 : TYPE_ADDR_SPACE (to_type
);
7616 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7617 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7620 /* Build a type that is compatible with t but has no cv quals anywhere
7623 const char *const *const * -> char ***. */
7626 build_type_no_quals (tree t
)
7628 switch (TREE_CODE (t
))
7631 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7633 TYPE_REF_CAN_ALIAS_ALL (t
));
7634 case REFERENCE_TYPE
:
7636 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7638 TYPE_REF_CAN_ALIAS_ALL (t
));
7640 return TYPE_MAIN_VARIANT (t
);
7644 #define MAX_INT_CACHED_PREC \
7645 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7646 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7648 /* Builds a signed or unsigned integer type of precision PRECISION.
7649 Used for C bitfields whose precision does not match that of
7650 built-in target types. */
7652 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7658 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7660 if (precision
<= MAX_INT_CACHED_PREC
)
7662 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7667 itype
= make_node (INTEGER_TYPE
);
7668 TYPE_PRECISION (itype
) = precision
;
7671 fixup_unsigned_type (itype
);
7673 fixup_signed_type (itype
);
7676 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7677 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7678 if (precision
<= MAX_INT_CACHED_PREC
)
7679 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7684 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7685 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7686 is true, reuse such a type that has already been constructed. */
7689 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7691 tree itype
= make_node (INTEGER_TYPE
);
7692 hashval_t hashcode
= 0;
7694 TREE_TYPE (itype
) = type
;
7696 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7697 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7699 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7700 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7701 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7702 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7703 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7704 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7709 if ((TYPE_MIN_VALUE (itype
)
7710 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7711 || (TYPE_MAX_VALUE (itype
)
7712 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7714 /* Since we cannot reliably merge this type, we need to compare it using
7715 structural equality checks. */
7716 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7720 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7721 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7722 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7723 itype
= type_hash_canon (hashcode
, itype
);
7728 /* Wrapper around build_range_type_1 with SHARED set to true. */
7731 build_range_type (tree type
, tree lowval
, tree highval
)
7733 return build_range_type_1 (type
, lowval
, highval
, true);
7736 /* Wrapper around build_range_type_1 with SHARED set to false. */
7739 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7741 return build_range_type_1 (type
, lowval
, highval
, false);
7744 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7745 MAXVAL should be the maximum value in the domain
7746 (one less than the length of the array).
7748 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7749 We don't enforce this limit, that is up to caller (e.g. language front end).
7750 The limit exists because the result is a signed type and we don't handle
7751 sizes that use more than one HOST_WIDE_INT. */
7754 build_index_type (tree maxval
)
7756 return build_range_type (sizetype
, size_zero_node
, maxval
);
7759 /* Return true if the debug information for TYPE, a subtype, should be emitted
7760 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7761 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7762 debug info and doesn't reflect the source code. */
7765 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7767 tree base_type
= TREE_TYPE (type
), low
, high
;
7769 /* Subrange types have a base type which is an integral type. */
7770 if (!INTEGRAL_TYPE_P (base_type
))
7773 /* Get the real bounds of the subtype. */
7774 if (lang_hooks
.types
.get_subrange_bounds
)
7775 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7778 low
= TYPE_MIN_VALUE (type
);
7779 high
= TYPE_MAX_VALUE (type
);
7782 /* If the type and its base type have the same representation and the same
7783 name, then the type is not a subrange but a copy of the base type. */
7784 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7785 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7786 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7787 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7788 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7790 tree type_name
= TYPE_NAME (type
);
7791 tree base_type_name
= TYPE_NAME (base_type
);
7793 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7794 type_name
= DECL_NAME (type_name
);
7796 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7797 base_type_name
= DECL_NAME (base_type_name
);
7799 if (type_name
== base_type_name
)
7810 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7811 and number of elements specified by the range of values of INDEX_TYPE.
7812 If SHARED is true, reuse such a type that has already been constructed. */
7815 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7819 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7821 error ("arrays of functions are not meaningful");
7822 elt_type
= integer_type_node
;
7825 t
= make_node (ARRAY_TYPE
);
7826 TREE_TYPE (t
) = elt_type
;
7827 TYPE_DOMAIN (t
) = index_type
;
7828 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7831 /* If the element type is incomplete at this point we get marked for
7832 structural equality. Do not record these types in the canonical
7834 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7839 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7841 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7842 t
= type_hash_canon (hashcode
, t
);
7845 if (TYPE_CANONICAL (t
) == t
)
7847 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7848 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7849 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7850 else if (TYPE_CANONICAL (elt_type
) != elt_type
7851 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7853 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7855 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7862 /* Wrapper around build_array_type_1 with SHARED set to true. */
7865 build_array_type (tree elt_type
, tree index_type
)
7867 return build_array_type_1 (elt_type
, index_type
, true);
7870 /* Wrapper around build_array_type_1 with SHARED set to false. */
7873 build_nonshared_array_type (tree elt_type
, tree index_type
)
7875 return build_array_type_1 (elt_type
, index_type
, false);
7878 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7882 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7884 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7887 /* Recursively examines the array elements of TYPE, until a non-array
7888 element type is found. */
7891 strip_array_types (tree type
)
7893 while (TREE_CODE (type
) == ARRAY_TYPE
)
7894 type
= TREE_TYPE (type
);
7899 /* Computes the canonical argument types from the argument type list
7902 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7903 on entry to this function, or if any of the ARGTYPES are
7906 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7907 true on entry to this function, or if any of the ARGTYPES are
7910 Returns a canonical argument list, which may be ARGTYPES when the
7911 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7912 true) or would not differ from ARGTYPES. */
7915 maybe_canonicalize_argtypes(tree argtypes
,
7916 bool *any_structural_p
,
7917 bool *any_noncanonical_p
)
7920 bool any_noncanonical_argtypes_p
= false;
7922 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7924 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7925 /* Fail gracefully by stating that the type is structural. */
7926 *any_structural_p
= true;
7927 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7928 *any_structural_p
= true;
7929 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7930 || TREE_PURPOSE (arg
))
7931 /* If the argument has a default argument, we consider it
7932 non-canonical even though the type itself is canonical.
7933 That way, different variants of function and method types
7934 with default arguments will all point to the variant with
7935 no defaults as their canonical type. */
7936 any_noncanonical_argtypes_p
= true;
7939 if (*any_structural_p
)
7942 if (any_noncanonical_argtypes_p
)
7944 /* Build the canonical list of argument types. */
7945 tree canon_argtypes
= NULL_TREE
;
7946 bool is_void
= false;
7948 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7950 if (arg
== void_list_node
)
7953 canon_argtypes
= tree_cons (NULL_TREE
,
7954 TYPE_CANONICAL (TREE_VALUE (arg
)),
7958 canon_argtypes
= nreverse (canon_argtypes
);
7960 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7962 /* There is a non-canonical type. */
7963 *any_noncanonical_p
= true;
7964 return canon_argtypes
;
7967 /* The canonical argument types are the same as ARGTYPES. */
7971 /* Construct, lay out and return
7972 the type of functions returning type VALUE_TYPE
7973 given arguments of types ARG_TYPES.
7974 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7975 are data type nodes for the arguments of the function.
7976 If such a type has already been constructed, reuse it. */
7979 build_function_type (tree value_type
, tree arg_types
)
7982 hashval_t hashcode
= 0;
7983 bool any_structural_p
, any_noncanonical_p
;
7984 tree canon_argtypes
;
7986 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7988 error ("function return type cannot be function");
7989 value_type
= integer_type_node
;
7992 /* Make a node of the sort we want. */
7993 t
= make_node (FUNCTION_TYPE
);
7994 TREE_TYPE (t
) = value_type
;
7995 TYPE_ARG_TYPES (t
) = arg_types
;
7997 /* If we already have such a type, use the old one. */
7998 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7999 hashcode
= type_hash_list (arg_types
, hashcode
);
8000 t
= type_hash_canon (hashcode
, t
);
8002 /* Set up the canonical type. */
8003 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8004 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8005 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8007 &any_noncanonical_p
);
8008 if (any_structural_p
)
8009 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8010 else if (any_noncanonical_p
)
8011 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8014 if (!COMPLETE_TYPE_P (t
))
8019 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
8020 return value if SKIP_RETURN is true. */
8023 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
8026 tree new_type
= NULL
;
8027 tree args
, new_args
= NULL
, t
;
8031 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
8032 args
= TREE_CHAIN (args
), i
++)
8033 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
8034 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
8036 new_reversed
= nreverse (new_args
);
8040 TREE_CHAIN (new_args
) = void_list_node
;
8042 new_reversed
= void_list_node
;
8045 /* Use copy_node to preserve as much as possible from original type
8046 (debug info, attribute lists etc.)
8047 Exception is METHOD_TYPEs must have THIS argument.
8048 When we are asked to remove it, we need to build new FUNCTION_TYPE
8050 if (TREE_CODE (orig_type
) != METHOD_TYPE
8052 || !bitmap_bit_p (args_to_skip
, 0))
8054 new_type
= build_distinct_type_copy (orig_type
);
8055 TYPE_ARG_TYPES (new_type
) = new_reversed
;
8060 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
8062 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
8066 TREE_TYPE (new_type
) = void_type_node
;
8068 /* This is a new type, not a copy of an old type. Need to reassociate
8069 variants. We can handle everything except the main variant lazily. */
8070 t
= TYPE_MAIN_VARIANT (orig_type
);
8073 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
8074 TYPE_MAIN_VARIANT (new_type
) = t
;
8075 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
8076 TYPE_NEXT_VARIANT (t
) = new_type
;
8080 TYPE_MAIN_VARIANT (new_type
) = new_type
;
8081 TYPE_NEXT_VARIANT (new_type
) = NULL
;
8087 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
8088 return value if SKIP_RETURN is true.
8090 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
8091 linked by TREE_CHAIN directly. The caller is responsible for eliminating
8092 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
8095 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
8098 tree new_decl
= copy_node (orig_decl
);
8101 new_type
= TREE_TYPE (orig_decl
);
8102 if (prototype_p (new_type
)
8103 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
8105 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
8106 TREE_TYPE (new_decl
) = new_type
;
8108 /* For declarations setting DECL_VINDEX (i.e. methods)
8109 we expect first argument to be THIS pointer. */
8110 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
8111 DECL_VINDEX (new_decl
) = NULL_TREE
;
8113 /* When signature changes, we need to clear builtin info. */
8114 if (DECL_BUILT_IN (new_decl
)
8116 && !bitmap_empty_p (args_to_skip
))
8118 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
8119 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
8124 /* Build a function type. The RETURN_TYPE is the type returned by the
8125 function. If VAARGS is set, no void_type_node is appended to the
8126 the list. ARGP must be always be terminated be a NULL_TREE. */
8129 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8133 t
= va_arg (argp
, tree
);
8134 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8135 args
= tree_cons (NULL_TREE
, t
, args
);
8140 if (args
!= NULL_TREE
)
8141 args
= nreverse (args
);
8142 gcc_assert (last
!= void_list_node
);
8144 else if (args
== NULL_TREE
)
8145 args
= void_list_node
;
8149 args
= nreverse (args
);
8150 TREE_CHAIN (last
) = void_list_node
;
8152 args
= build_function_type (return_type
, args
);
8157 /* Build a function type. The RETURN_TYPE is the type returned by the
8158 function. If additional arguments are provided, they are
8159 additional argument types. The list of argument types must always
8160 be terminated by NULL_TREE. */
8163 build_function_type_list (tree return_type
, ...)
8168 va_start (p
, return_type
);
8169 args
= build_function_type_list_1 (false, return_type
, p
);
8174 /* Build a variable argument function type. The RETURN_TYPE is the
8175 type returned by the function. If additional arguments are provided,
8176 they are additional argument types. The list of argument types must
8177 always be terminated by NULL_TREE. */
8180 build_varargs_function_type_list (tree return_type
, ...)
8185 va_start (p
, return_type
);
8186 args
= build_function_type_list_1 (true, return_type
, p
);
8192 /* Build a function type. RETURN_TYPE is the type returned by the
8193 function; VAARGS indicates whether the function takes varargs. The
8194 function takes N named arguments, the types of which are provided in
8198 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8202 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8204 for (i
= n
- 1; i
>= 0; i
--)
8205 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8207 return build_function_type (return_type
, t
);
8210 /* Build a function type. RETURN_TYPE is the type returned by the
8211 function. The function takes N named arguments, the types of which
8212 are provided in ARG_TYPES. */
8215 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8217 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8220 /* Build a variable argument function type. RETURN_TYPE is the type
8221 returned by the function. The function takes N named arguments, the
8222 types of which are provided in ARG_TYPES. */
8225 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8227 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8230 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8231 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8232 for the method. An implicit additional parameter (of type
8233 pointer-to-BASETYPE) is added to the ARGTYPES. */
8236 build_method_type_directly (tree basetype
,
8243 bool any_structural_p
, any_noncanonical_p
;
8244 tree canon_argtypes
;
8246 /* Make a node of the sort we want. */
8247 t
= make_node (METHOD_TYPE
);
8249 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8250 TREE_TYPE (t
) = rettype
;
8251 ptype
= build_pointer_type (basetype
);
8253 /* The actual arglist for this function includes a "hidden" argument
8254 which is "this". Put it into the list of argument types. */
8255 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8256 TYPE_ARG_TYPES (t
) = argtypes
;
8258 /* If we already have such a type, use the old one. */
8259 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8260 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8261 hashcode
= type_hash_list (argtypes
, hashcode
);
8262 t
= type_hash_canon (hashcode
, t
);
8264 /* Set up the canonical type. */
8266 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8267 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8269 = (TYPE_CANONICAL (basetype
) != basetype
8270 || TYPE_CANONICAL (rettype
) != rettype
);
8271 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8273 &any_noncanonical_p
);
8274 if (any_structural_p
)
8275 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8276 else if (any_noncanonical_p
)
8278 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8279 TYPE_CANONICAL (rettype
),
8281 if (!COMPLETE_TYPE_P (t
))
8287 /* Construct, lay out and return the type of methods belonging to class
8288 BASETYPE and whose arguments and values are described by TYPE.
8289 If that type exists already, reuse it.
8290 TYPE must be a FUNCTION_TYPE node. */
8293 build_method_type (tree basetype
, tree type
)
8295 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8297 return build_method_type_directly (basetype
,
8299 TYPE_ARG_TYPES (type
));
8302 /* Construct, lay out and return the type of offsets to a value
8303 of type TYPE, within an object of type BASETYPE.
8304 If a suitable offset type exists already, reuse it. */
8307 build_offset_type (tree basetype
, tree type
)
8310 hashval_t hashcode
= 0;
8312 /* Make a node of the sort we want. */
8313 t
= make_node (OFFSET_TYPE
);
8315 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8316 TREE_TYPE (t
) = type
;
8318 /* If we already have such a type, use the old one. */
8319 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8320 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8321 t
= type_hash_canon (hashcode
, t
);
8323 if (!COMPLETE_TYPE_P (t
))
8326 if (TYPE_CANONICAL (t
) == t
)
8328 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8329 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8330 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8331 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8332 || TYPE_CANONICAL (type
) != type
)
8334 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8335 TYPE_CANONICAL (type
));
8341 /* Create a complex type whose components are COMPONENT_TYPE. */
8344 build_complex_type (tree component_type
)
8349 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8350 || SCALAR_FLOAT_TYPE_P (component_type
)
8351 || FIXED_POINT_TYPE_P (component_type
));
8353 /* Make a node of the sort we want. */
8354 t
= make_node (COMPLEX_TYPE
);
8356 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8358 /* If we already have such a type, use the old one. */
8359 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8360 t
= type_hash_canon (hashcode
, t
);
8362 if (!COMPLETE_TYPE_P (t
))
8365 if (TYPE_CANONICAL (t
) == t
)
8367 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8368 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8369 else if (TYPE_CANONICAL (component_type
) != component_type
)
8371 = build_complex_type (TYPE_CANONICAL (component_type
));
8374 /* We need to create a name, since complex is a fundamental type. */
8375 if (! TYPE_NAME (t
))
8378 if (component_type
== char_type_node
)
8379 name
= "complex char";
8380 else if (component_type
== signed_char_type_node
)
8381 name
= "complex signed char";
8382 else if (component_type
== unsigned_char_type_node
)
8383 name
= "complex unsigned char";
8384 else if (component_type
== short_integer_type_node
)
8385 name
= "complex short int";
8386 else if (component_type
== short_unsigned_type_node
)
8387 name
= "complex short unsigned int";
8388 else if (component_type
== integer_type_node
)
8389 name
= "complex int";
8390 else if (component_type
== unsigned_type_node
)
8391 name
= "complex unsigned int";
8392 else if (component_type
== long_integer_type_node
)
8393 name
= "complex long int";
8394 else if (component_type
== long_unsigned_type_node
)
8395 name
= "complex long unsigned int";
8396 else if (component_type
== long_long_integer_type_node
)
8397 name
= "complex long long int";
8398 else if (component_type
== long_long_unsigned_type_node
)
8399 name
= "complex long long unsigned int";
8404 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8405 get_identifier (name
), t
);
8408 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8411 /* If TYPE is a real or complex floating-point type and the target
8412 does not directly support arithmetic on TYPE then return the wider
8413 type to be used for arithmetic on TYPE. Otherwise, return
8417 excess_precision_type (tree type
)
8419 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8421 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8422 switch (TREE_CODE (type
))
8425 switch (flt_eval_method
)
8428 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8429 return double_type_node
;
8432 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8433 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8434 return long_double_type_node
;
8441 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8443 switch (flt_eval_method
)
8446 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8447 return complex_double_type_node
;
8450 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8451 || (TYPE_MODE (TREE_TYPE (type
))
8452 == TYPE_MODE (double_type_node
)))
8453 return complex_long_double_type_node
;
8466 /* Return OP, stripped of any conversions to wider types as much as is safe.
8467 Converting the value back to OP's type makes a value equivalent to OP.
8469 If FOR_TYPE is nonzero, we return a value which, if converted to
8470 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8472 OP must have integer, real or enumeral type. Pointers are not allowed!
8474 There are some cases where the obvious value we could return
8475 would regenerate to OP if converted to OP's type,
8476 but would not extend like OP to wider types.
8477 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8478 For example, if OP is (unsigned short)(signed char)-1,
8479 we avoid returning (signed char)-1 if FOR_TYPE is int,
8480 even though extending that to an unsigned short would regenerate OP,
8481 since the result of extending (signed char)-1 to (int)
8482 is different from (int) OP. */
8485 get_unwidened (tree op
, tree for_type
)
8487 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8488 tree type
= TREE_TYPE (op
);
8490 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8492 = (for_type
!= 0 && for_type
!= type
8493 && final_prec
> TYPE_PRECISION (type
)
8494 && TYPE_UNSIGNED (type
));
8497 while (CONVERT_EXPR_P (op
))
8501 /* TYPE_PRECISION on vector types has different meaning
8502 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8503 so avoid them here. */
8504 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8507 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8508 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8510 /* Truncations are many-one so cannot be removed.
8511 Unless we are later going to truncate down even farther. */
8513 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8516 /* See what's inside this conversion. If we decide to strip it,
8518 op
= TREE_OPERAND (op
, 0);
8520 /* If we have not stripped any zero-extensions (uns is 0),
8521 we can strip any kind of extension.
8522 If we have previously stripped a zero-extension,
8523 only zero-extensions can safely be stripped.
8524 Any extension can be stripped if the bits it would produce
8525 are all going to be discarded later by truncating to FOR_TYPE. */
8529 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8531 /* TYPE_UNSIGNED says whether this is a zero-extension.
8532 Let's avoid computing it if it does not affect WIN
8533 and if UNS will not be needed again. */
8535 || CONVERT_EXPR_P (op
))
8536 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8544 /* If we finally reach a constant see if it fits in for_type and
8545 in that case convert it. */
8547 && TREE_CODE (win
) == INTEGER_CST
8548 && TREE_TYPE (win
) != for_type
8549 && int_fits_type_p (win
, for_type
))
8550 win
= fold_convert (for_type
, win
);
8555 /* Return OP or a simpler expression for a narrower value
8556 which can be sign-extended or zero-extended to give back OP.
8557 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8558 or 0 if the value should be sign-extended. */
8561 get_narrower (tree op
, int *unsignedp_ptr
)
8566 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8568 while (TREE_CODE (op
) == NOP_EXPR
)
8571 = (TYPE_PRECISION (TREE_TYPE (op
))
8572 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8574 /* Truncations are many-one so cannot be removed. */
8578 /* See what's inside this conversion. If we decide to strip it,
8583 op
= TREE_OPERAND (op
, 0);
8584 /* An extension: the outermost one can be stripped,
8585 but remember whether it is zero or sign extension. */
8587 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8588 /* Otherwise, if a sign extension has been stripped,
8589 only sign extensions can now be stripped;
8590 if a zero extension has been stripped, only zero-extensions. */
8591 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8595 else /* bitschange == 0 */
8597 /* A change in nominal type can always be stripped, but we must
8598 preserve the unsignedness. */
8600 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8602 op
= TREE_OPERAND (op
, 0);
8603 /* Keep trying to narrow, but don't assign op to win if it
8604 would turn an integral type into something else. */
8605 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8612 if (TREE_CODE (op
) == COMPONENT_REF
8613 /* Since type_for_size always gives an integer type. */
8614 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8615 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8616 /* Ensure field is laid out already. */
8617 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8618 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8620 unsigned HOST_WIDE_INT innerprec
8621 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8622 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8623 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8624 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8626 /* We can get this structure field in a narrower type that fits it,
8627 but the resulting extension to its nominal type (a fullword type)
8628 must satisfy the same conditions as for other extensions.
8630 Do this only for fields that are aligned (not bit-fields),
8631 because when bit-field insns will be used there is no
8632 advantage in doing this. */
8634 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8635 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8636 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8640 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8641 win
= fold_convert (type
, op
);
8645 *unsignedp_ptr
= uns
;
8649 /* Returns true if integer constant C has a value that is permissible
8650 for type TYPE (an INTEGER_TYPE). */
8653 int_fits_type_p (const_tree c
, const_tree type
)
8655 tree type_low_bound
, type_high_bound
;
8656 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8659 dc
= tree_to_double_int (c
);
8660 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8663 type_low_bound
= TYPE_MIN_VALUE (type
);
8664 type_high_bound
= TYPE_MAX_VALUE (type
);
8666 /* If at least one bound of the type is a constant integer, we can check
8667 ourselves and maybe make a decision. If no such decision is possible, but
8668 this type is a subtype, try checking against that. Otherwise, use
8669 double_int_fits_to_tree_p, which checks against the precision.
8671 Compute the status for each possibly constant bound, and return if we see
8672 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8673 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8674 for "constant known to fit". */
8676 /* Check if c >= type_low_bound. */
8677 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8679 dd
= tree_to_double_int (type_low_bound
);
8680 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8682 int c_neg
= (!unsc
&& dc
.is_negative ());
8683 int t_neg
= (unsc
&& dd
.is_negative ());
8685 if (c_neg
&& !t_neg
)
8687 if ((c_neg
|| !t_neg
) && dc
.ult (dd
))
8690 else if (dc
.cmp (dd
, unsc
) < 0)
8692 ok_for_low_bound
= true;
8695 ok_for_low_bound
= false;
8697 /* Check if c <= type_high_bound. */
8698 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8700 dd
= tree_to_double_int (type_high_bound
);
8701 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8703 int c_neg
= (!unsc
&& dc
.is_negative ());
8704 int t_neg
= (unsc
&& dd
.is_negative ());
8706 if (t_neg
&& !c_neg
)
8708 if ((t_neg
|| !c_neg
) && dc
.ugt (dd
))
8711 else if (dc
.cmp (dd
, unsc
) > 0)
8713 ok_for_high_bound
= true;
8716 ok_for_high_bound
= false;
8718 /* If the constant fits both bounds, the result is known. */
8719 if (ok_for_low_bound
&& ok_for_high_bound
)
8722 /* Perform some generic filtering which may allow making a decision
8723 even if the bounds are not constant. First, negative integers
8724 never fit in unsigned types, */
8725 if (TYPE_UNSIGNED (type
) && !unsc
&& dc
.is_negative ())
8728 /* Second, narrower types always fit in wider ones. */
8729 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8732 /* Third, unsigned integers with top bit set never fit signed types. */
8733 if (! TYPE_UNSIGNED (type
) && unsc
)
8735 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8736 if (prec
< HOST_BITS_PER_WIDE_INT
)
8738 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8741 else if (((((unsigned HOST_WIDE_INT
) 1)
8742 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8746 /* If we haven't been able to decide at this point, there nothing more we
8747 can check ourselves here. Look at the base type if we have one and it
8748 has the same precision. */
8749 if (TREE_CODE (type
) == INTEGER_TYPE
8750 && TREE_TYPE (type
) != 0
8751 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8753 type
= TREE_TYPE (type
);
8757 /* Or to double_int_fits_to_tree_p, if nothing else. */
8758 return double_int_fits_to_tree_p (type
, dc
);
8761 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8762 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8763 represented (assuming two's-complement arithmetic) within the bit
8764 precision of the type are returned instead. */
8767 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8769 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8770 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8771 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8772 TYPE_UNSIGNED (type
));
8775 if (TYPE_UNSIGNED (type
))
8776 mpz_set_ui (min
, 0);
8780 mn
= double_int::mask (TYPE_PRECISION (type
) - 1);
8781 mn
= (mn
+ double_int_one
).sext (TYPE_PRECISION (type
));
8782 mpz_set_double_int (min
, mn
, false);
8786 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8787 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8788 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8789 TYPE_UNSIGNED (type
));
8792 if (TYPE_UNSIGNED (type
))
8793 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
)),
8796 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
) - 1),
8801 /* Return true if VAR is an automatic variable defined in function FN. */
8804 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8806 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8807 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8808 || TREE_CODE (var
) == PARM_DECL
)
8809 && ! TREE_STATIC (var
))
8810 || TREE_CODE (var
) == LABEL_DECL
8811 || TREE_CODE (var
) == RESULT_DECL
));
8814 /* Subprogram of following function. Called by walk_tree.
8816 Return *TP if it is an automatic variable or parameter of the
8817 function passed in as DATA. */
8820 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8822 tree fn
= (tree
) data
;
8827 else if (DECL_P (*tp
)
8828 && auto_var_in_fn_p (*tp
, fn
))
8834 /* Returns true if T is, contains, or refers to a type with variable
8835 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8836 arguments, but not the return type. If FN is nonzero, only return
8837 true if a modifier of the type or position of FN is a variable or
8838 parameter inside FN.
8840 This concept is more general than that of C99 'variably modified types':
8841 in C99, a struct type is never variably modified because a VLA may not
8842 appear as a structure member. However, in GNU C code like:
8844 struct S { int i[f()]; };
8846 is valid, and other languages may define similar constructs. */
8849 variably_modified_type_p (tree type
, tree fn
)
8853 /* Test if T is either variable (if FN is zero) or an expression containing
8854 a variable in FN. If TYPE isn't gimplified, return true also if
8855 gimplify_one_sizepos would gimplify the expression into a local
8857 #define RETURN_TRUE_IF_VAR(T) \
8858 do { tree _t = (T); \
8859 if (_t != NULL_TREE \
8860 && _t != error_mark_node \
8861 && TREE_CODE (_t) != INTEGER_CST \
8862 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8864 || (!TYPE_SIZES_GIMPLIFIED (type) \
8865 && !is_gimple_sizepos (_t)) \
8866 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8867 return true; } while (0)
8869 if (type
== error_mark_node
)
8872 /* If TYPE itself has variable size, it is variably modified. */
8873 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8874 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8876 switch (TREE_CODE (type
))
8879 case REFERENCE_TYPE
:
8881 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8887 /* If TYPE is a function type, it is variably modified if the
8888 return type is variably modified. */
8889 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8895 case FIXED_POINT_TYPE
:
8898 /* Scalar types are variably modified if their end points
8900 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8901 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8906 case QUAL_UNION_TYPE
:
8907 /* We can't see if any of the fields are variably-modified by the
8908 definition we normally use, since that would produce infinite
8909 recursion via pointers. */
8910 /* This is variably modified if some field's type is. */
8911 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8912 if (TREE_CODE (t
) == FIELD_DECL
)
8914 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8915 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8916 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8918 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8919 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8924 /* Do not call ourselves to avoid infinite recursion. This is
8925 variably modified if the element type is. */
8926 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8927 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8934 /* The current language may have other cases to check, but in general,
8935 all other types are not variably modified. */
8936 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8938 #undef RETURN_TRUE_IF_VAR
8941 /* Given a DECL or TYPE, return the scope in which it was declared, or
8942 NULL_TREE if there is no containing scope. */
8945 get_containing_scope (const_tree t
)
8947 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8950 /* Return the innermost context enclosing DECL that is
8951 a FUNCTION_DECL, or zero if none. */
8954 decl_function_context (const_tree decl
)
8958 if (TREE_CODE (decl
) == ERROR_MARK
)
8961 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8962 where we look up the function at runtime. Such functions always take
8963 a first argument of type 'pointer to real context'.
8965 C++ should really be fixed to use DECL_CONTEXT for the real context,
8966 and use something else for the "virtual context". */
8967 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8970 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8972 context
= DECL_CONTEXT (decl
);
8974 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8976 if (TREE_CODE (context
) == BLOCK
)
8977 context
= BLOCK_SUPERCONTEXT (context
);
8979 context
= get_containing_scope (context
);
8985 /* Return the innermost context enclosing DECL that is
8986 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8987 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8990 decl_type_context (const_tree decl
)
8992 tree context
= DECL_CONTEXT (decl
);
8995 switch (TREE_CODE (context
))
8997 case NAMESPACE_DECL
:
8998 case TRANSLATION_UNIT_DECL
:
9003 case QUAL_UNION_TYPE
:
9008 context
= DECL_CONTEXT (context
);
9012 context
= BLOCK_SUPERCONTEXT (context
);
9022 /* CALL is a CALL_EXPR. Return the declaration for the function
9023 called, or NULL_TREE if the called function cannot be
9027 get_callee_fndecl (const_tree call
)
9031 if (call
== error_mark_node
)
9032 return error_mark_node
;
9034 /* It's invalid to call this function with anything but a
9036 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9038 /* The first operand to the CALL is the address of the function
9040 addr
= CALL_EXPR_FN (call
);
9044 /* If this is a readonly function pointer, extract its initial value. */
9045 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9046 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9047 && DECL_INITIAL (addr
))
9048 addr
= DECL_INITIAL (addr
);
9050 /* If the address is just `&f' for some function `f', then we know
9051 that `f' is being called. */
9052 if (TREE_CODE (addr
) == ADDR_EXPR
9053 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9054 return TREE_OPERAND (addr
, 0);
9056 /* We couldn't figure out what was being called. */
9060 /* Print debugging information about tree nodes generated during the compile,
9061 and any language-specific information. */
9064 dump_tree_statistics (void)
9066 if (GATHER_STATISTICS
)
9069 int total_nodes
, total_bytes
;
9070 fprintf (stderr
, "Kind Nodes Bytes\n");
9071 fprintf (stderr
, "---------------------------------------\n");
9072 total_nodes
= total_bytes
= 0;
9073 for (i
= 0; i
< (int) all_kinds
; i
++)
9075 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9076 tree_node_counts
[i
], tree_node_sizes
[i
]);
9077 total_nodes
+= tree_node_counts
[i
];
9078 total_bytes
+= tree_node_sizes
[i
];
9080 fprintf (stderr
, "---------------------------------------\n");
9081 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9082 fprintf (stderr
, "---------------------------------------\n");
9083 fprintf (stderr
, "Code Nodes\n");
9084 fprintf (stderr
, "----------------------------\n");
9085 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9086 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
9087 fprintf (stderr
, "----------------------------\n");
9088 ssanames_print_statistics ();
9089 phinodes_print_statistics ();
9092 fprintf (stderr
, "(No per-node statistics)\n");
9094 print_type_hash_statistics ();
9095 print_debug_expr_statistics ();
9096 print_value_expr_statistics ();
9097 lang_hooks
.print_statistics ();
9100 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9102 /* Generate a crc32 of a byte. */
9105 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9109 for (ix
= bits
; ix
--; value
<<= 1)
9113 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9120 /* Generate a crc32 of a 32-bit unsigned. */
9123 crc32_unsigned (unsigned chksum
, unsigned value
)
9125 return crc32_unsigned_bits (chksum
, value
, 32);
9128 /* Generate a crc32 of a byte. */
9131 crc32_byte (unsigned chksum
, char byte
)
9133 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9136 /* Generate a crc32 of a string. */
9139 crc32_string (unsigned chksum
, const char *string
)
9143 chksum
= crc32_byte (chksum
, *string
);
9149 /* P is a string that will be used in a symbol. Mask out any characters
9150 that are not valid in that context. */
9153 clean_symbol_name (char *p
)
9157 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9160 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9167 /* Generate a name for a special-purpose function.
9168 The generated name may need to be unique across the whole link.
9169 Changes to this function may also require corresponding changes to
9170 xstrdup_mask_random.
9171 TYPE is some string to identify the purpose of this function to the
9172 linker or collect2; it must start with an uppercase letter,
9174 I - for constructors
9176 N - for C++ anonymous namespaces
9177 F - for DWARF unwind frame information. */
9180 get_file_function_name (const char *type
)
9186 /* If we already have a name we know to be unique, just use that. */
9187 if (first_global_object_name
)
9188 p
= q
= ASTRDUP (first_global_object_name
);
9189 /* If the target is handling the constructors/destructors, they
9190 will be local to this file and the name is only necessary for
9192 We also assign sub_I and sub_D sufixes to constructors called from
9193 the global static constructors. These are always local. */
9194 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9195 || (strncmp (type
, "sub_", 4) == 0
9196 && (type
[4] == 'I' || type
[4] == 'D')))
9198 const char *file
= main_input_filename
;
9200 file
= input_filename
;
9201 /* Just use the file's basename, because the full pathname
9202 might be quite long. */
9203 p
= q
= ASTRDUP (lbasename (file
));
9207 /* Otherwise, the name must be unique across the entire link.
9208 We don't have anything that we know to be unique to this translation
9209 unit, so use what we do have and throw in some randomness. */
9211 const char *name
= weak_global_object_name
;
9212 const char *file
= main_input_filename
;
9217 file
= input_filename
;
9219 len
= strlen (file
);
9220 q
= (char *) alloca (9 + 17 + len
+ 1);
9221 memcpy (q
, file
, len
+ 1);
9223 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9224 crc32_string (0, name
), get_random_seed (false));
9229 clean_symbol_name (q
);
9230 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9233 /* Set up the name of the file-level functions we may need.
9234 Use a global object (which is already required to be unique over
9235 the program) rather than the file name (which imposes extra
9237 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9239 return get_identifier (buf
);
9242 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9244 /* Complain that the tree code of NODE does not match the expected 0
9245 terminated list of trailing codes. The trailing code list can be
9246 empty, for a more vague error message. FILE, LINE, and FUNCTION
9247 are of the caller. */
9250 tree_check_failed (const_tree node
, const char *file
,
9251 int line
, const char *function
, ...)
9255 unsigned length
= 0;
9258 va_start (args
, function
);
9259 while ((code
= va_arg (args
, int)))
9260 length
+= 4 + strlen (tree_code_name
[code
]);
9265 va_start (args
, function
);
9266 length
+= strlen ("expected ");
9267 buffer
= tmp
= (char *) alloca (length
);
9269 while ((code
= va_arg (args
, int)))
9271 const char *prefix
= length
? " or " : "expected ";
9273 strcpy (tmp
+ length
, prefix
);
9274 length
+= strlen (prefix
);
9275 strcpy (tmp
+ length
, tree_code_name
[code
]);
9276 length
+= strlen (tree_code_name
[code
]);
9281 buffer
= "unexpected node";
9283 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9284 buffer
, tree_code_name
[TREE_CODE (node
)],
9285 function
, trim_filename (file
), line
);
9288 /* Complain that the tree code of NODE does match the expected 0
9289 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9293 tree_not_check_failed (const_tree node
, const char *file
,
9294 int line
, const char *function
, ...)
9298 unsigned length
= 0;
9301 va_start (args
, function
);
9302 while ((code
= va_arg (args
, int)))
9303 length
+= 4 + strlen (tree_code_name
[code
]);
9305 va_start (args
, function
);
9306 buffer
= (char *) alloca (length
);
9308 while ((code
= va_arg (args
, int)))
9312 strcpy (buffer
+ length
, " or ");
9315 strcpy (buffer
+ length
, tree_code_name
[code
]);
9316 length
+= strlen (tree_code_name
[code
]);
9320 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9321 buffer
, tree_code_name
[TREE_CODE (node
)],
9322 function
, trim_filename (file
), line
);
9325 /* Similar to tree_check_failed, except that we check for a class of tree
9326 code, given in CL. */
9329 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9330 const char *file
, int line
, const char *function
)
9333 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9334 TREE_CODE_CLASS_STRING (cl
),
9335 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9336 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9339 /* Similar to tree_check_failed, except that instead of specifying a
9340 dozen codes, use the knowledge that they're all sequential. */
9343 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9344 const char *function
, enum tree_code c1
,
9348 unsigned length
= 0;
9351 for (c
= c1
; c
<= c2
; ++c
)
9352 length
+= 4 + strlen (tree_code_name
[c
]);
9354 length
+= strlen ("expected ");
9355 buffer
= (char *) alloca (length
);
9358 for (c
= c1
; c
<= c2
; ++c
)
9360 const char *prefix
= length
? " or " : "expected ";
9362 strcpy (buffer
+ length
, prefix
);
9363 length
+= strlen (prefix
);
9364 strcpy (buffer
+ length
, tree_code_name
[c
]);
9365 length
+= strlen (tree_code_name
[c
]);
9368 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9369 buffer
, tree_code_name
[TREE_CODE (node
)],
9370 function
, trim_filename (file
), line
);
9374 /* Similar to tree_check_failed, except that we check that a tree does
9375 not have the specified code, given in CL. */
9378 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9379 const char *file
, int line
, const char *function
)
9382 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9383 TREE_CODE_CLASS_STRING (cl
),
9384 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9385 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9389 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9392 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9393 const char *function
, enum omp_clause_code code
)
9395 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9396 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9397 function
, trim_filename (file
), line
);
9401 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9404 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9405 const char *function
, enum omp_clause_code c1
,
9406 enum omp_clause_code c2
)
9409 unsigned length
= 0;
9412 for (c
= c1
; c
<= c2
; ++c
)
9413 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9415 length
+= strlen ("expected ");
9416 buffer
= (char *) alloca (length
);
9419 for (c
= c1
; c
<= c2
; ++c
)
9421 const char *prefix
= length
? " or " : "expected ";
9423 strcpy (buffer
+ length
, prefix
);
9424 length
+= strlen (prefix
);
9425 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9426 length
+= strlen (omp_clause_code_name
[c
]);
9429 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9430 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9431 function
, trim_filename (file
), line
);
9435 #undef DEFTREESTRUCT
9436 #define DEFTREESTRUCT(VAL, NAME) NAME,
9438 static const char *ts_enum_names
[] = {
9439 #include "treestruct.def"
9441 #undef DEFTREESTRUCT
9443 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9445 /* Similar to tree_class_check_failed, except that we check for
9446 whether CODE contains the tree structure identified by EN. */
9449 tree_contains_struct_check_failed (const_tree node
,
9450 const enum tree_node_structure_enum en
,
9451 const char *file
, int line
,
9452 const char *function
)
9455 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9457 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9461 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9462 (dynamically sized) vector. */
9465 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9466 const char *function
)
9469 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9470 idx
+ 1, len
, function
, trim_filename (file
), line
);
9473 /* Similar to above, except that the check is for the bounds of the operand
9474 vector of an expression node EXP. */
9477 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9478 int line
, const char *function
)
9480 int code
= TREE_CODE (exp
);
9482 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9483 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9484 function
, trim_filename (file
), line
);
9487 /* Similar to above, except that the check is for the number of
9488 operands of an OMP_CLAUSE node. */
9491 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9492 int line
, const char *function
)
9495 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9496 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9497 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9498 trim_filename (file
), line
);
9500 #endif /* ENABLE_TREE_CHECKING */
9502 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9503 and mapped to the machine mode MODE. Initialize its fields and build
9504 the information necessary for debugging output. */
9507 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9510 hashval_t hashcode
= 0;
9512 t
= make_node (VECTOR_TYPE
);
9513 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9514 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9515 SET_TYPE_MODE (t
, mode
);
9517 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9518 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9519 else if (TYPE_CANONICAL (innertype
) != innertype
9520 || mode
!= VOIDmode
)
9522 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9526 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9527 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9528 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9529 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9530 t
= type_hash_canon (hashcode
, t
);
9532 /* We have built a main variant, based on the main variant of the
9533 inner type. Use it to build the variant we return. */
9534 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9535 && TREE_TYPE (t
) != innertype
)
9536 return build_type_attribute_qual_variant (t
,
9537 TYPE_ATTRIBUTES (innertype
),
9538 TYPE_QUALS (innertype
));
9544 make_or_reuse_type (unsigned size
, int unsignedp
)
9546 if (size
== INT_TYPE_SIZE
)
9547 return unsignedp
? unsigned_type_node
: integer_type_node
;
9548 if (size
== CHAR_TYPE_SIZE
)
9549 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9550 if (size
== SHORT_TYPE_SIZE
)
9551 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9552 if (size
== LONG_TYPE_SIZE
)
9553 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9554 if (size
== LONG_LONG_TYPE_SIZE
)
9555 return (unsignedp
? long_long_unsigned_type_node
9556 : long_long_integer_type_node
);
9557 if (size
== 128 && int128_integer_type_node
)
9558 return (unsignedp
? int128_unsigned_type_node
9559 : int128_integer_type_node
);
9562 return make_unsigned_type (size
);
9564 return make_signed_type (size
);
9567 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9570 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9574 if (size
== SHORT_FRACT_TYPE_SIZE
)
9575 return unsignedp
? sat_unsigned_short_fract_type_node
9576 : sat_short_fract_type_node
;
9577 if (size
== FRACT_TYPE_SIZE
)
9578 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9579 if (size
== LONG_FRACT_TYPE_SIZE
)
9580 return unsignedp
? sat_unsigned_long_fract_type_node
9581 : sat_long_fract_type_node
;
9582 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9583 return unsignedp
? sat_unsigned_long_long_fract_type_node
9584 : sat_long_long_fract_type_node
;
9588 if (size
== SHORT_FRACT_TYPE_SIZE
)
9589 return unsignedp
? unsigned_short_fract_type_node
9590 : short_fract_type_node
;
9591 if (size
== FRACT_TYPE_SIZE
)
9592 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9593 if (size
== LONG_FRACT_TYPE_SIZE
)
9594 return unsignedp
? unsigned_long_fract_type_node
9595 : long_fract_type_node
;
9596 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9597 return unsignedp
? unsigned_long_long_fract_type_node
9598 : long_long_fract_type_node
;
9601 return make_fract_type (size
, unsignedp
, satp
);
9604 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9607 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9611 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9612 return unsignedp
? sat_unsigned_short_accum_type_node
9613 : sat_short_accum_type_node
;
9614 if (size
== ACCUM_TYPE_SIZE
)
9615 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9616 if (size
== LONG_ACCUM_TYPE_SIZE
)
9617 return unsignedp
? sat_unsigned_long_accum_type_node
9618 : sat_long_accum_type_node
;
9619 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9620 return unsignedp
? sat_unsigned_long_long_accum_type_node
9621 : sat_long_long_accum_type_node
;
9625 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9626 return unsignedp
? unsigned_short_accum_type_node
9627 : short_accum_type_node
;
9628 if (size
== ACCUM_TYPE_SIZE
)
9629 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9630 if (size
== LONG_ACCUM_TYPE_SIZE
)
9631 return unsignedp
? unsigned_long_accum_type_node
9632 : long_accum_type_node
;
9633 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9634 return unsignedp
? unsigned_long_long_accum_type_node
9635 : long_long_accum_type_node
;
9638 return make_accum_type (size
, unsignedp
, satp
);
9641 /* Create nodes for all integer types (and error_mark_node) using the sizes
9642 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9643 SHORT_DOUBLE specifies whether double should be of the same precision
9647 build_common_tree_nodes (bool signed_char
, bool short_double
)
9649 error_mark_node
= make_node (ERROR_MARK
);
9650 TREE_TYPE (error_mark_node
) = error_mark_node
;
9652 initialize_sizetypes ();
9654 /* Define both `signed char' and `unsigned char'. */
9655 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9656 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9657 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9658 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9660 /* Define `char', which is like either `signed char' or `unsigned char'
9661 but not the same as either. */
9664 ? make_signed_type (CHAR_TYPE_SIZE
)
9665 : make_unsigned_type (CHAR_TYPE_SIZE
));
9666 TYPE_STRING_FLAG (char_type_node
) = 1;
9668 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9669 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9670 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9671 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9672 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9673 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9674 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9675 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9676 #if HOST_BITS_PER_WIDE_INT >= 64
9677 /* TODO: This isn't correct, but as logic depends at the moment on
9678 host's instead of target's wide-integer.
9679 If there is a target not supporting TImode, but has an 128-bit
9680 integer-scalar register, this target check needs to be adjusted. */
9681 if (targetm
.scalar_mode_supported_p (TImode
))
9683 int128_integer_type_node
= make_signed_type (128);
9684 int128_unsigned_type_node
= make_unsigned_type (128);
9688 /* Define a boolean type. This type only represents boolean values but
9689 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9690 Front ends which want to override this size (i.e. Java) can redefine
9691 boolean_type_node before calling build_common_tree_nodes_2. */
9692 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9693 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9694 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9695 TYPE_PRECISION (boolean_type_node
) = 1;
9697 /* Define what type to use for size_t. */
9698 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9699 size_type_node
= unsigned_type_node
;
9700 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9701 size_type_node
= long_unsigned_type_node
;
9702 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9703 size_type_node
= long_long_unsigned_type_node
;
9704 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9705 size_type_node
= short_unsigned_type_node
;
9709 /* Fill in the rest of the sized types. Reuse existing type nodes
9711 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9712 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9713 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9714 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9715 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9717 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9718 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9719 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9720 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9721 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9723 access_public_node
= get_identifier ("public");
9724 access_protected_node
= get_identifier ("protected");
9725 access_private_node
= get_identifier ("private");
9727 /* Define these next since types below may used them. */
9728 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9729 integer_one_node
= build_int_cst (integer_type_node
, 1);
9730 integer_three_node
= build_int_cst (integer_type_node
, 3);
9731 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9733 size_zero_node
= size_int (0);
9734 size_one_node
= size_int (1);
9735 bitsize_zero_node
= bitsize_int (0);
9736 bitsize_one_node
= bitsize_int (1);
9737 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9739 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9740 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9742 void_type_node
= make_node (VOID_TYPE
);
9743 layout_type (void_type_node
);
9745 /* We are not going to have real types in C with less than byte alignment,
9746 so we might as well not have any types that claim to have it. */
9747 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9748 TYPE_USER_ALIGN (void_type_node
) = 0;
9750 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9751 layout_type (TREE_TYPE (null_pointer_node
));
9753 ptr_type_node
= build_pointer_type (void_type_node
);
9755 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9756 fileptr_type_node
= ptr_type_node
;
9758 float_type_node
= make_node (REAL_TYPE
);
9759 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9760 layout_type (float_type_node
);
9762 double_type_node
= make_node (REAL_TYPE
);
9764 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9766 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9767 layout_type (double_type_node
);
9769 long_double_type_node
= make_node (REAL_TYPE
);
9770 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9771 layout_type (long_double_type_node
);
9773 float_ptr_type_node
= build_pointer_type (float_type_node
);
9774 double_ptr_type_node
= build_pointer_type (double_type_node
);
9775 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9776 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9778 /* Fixed size integer types. */
9779 uint16_type_node
= build_nonstandard_integer_type (16, true);
9780 uint32_type_node
= build_nonstandard_integer_type (32, true);
9781 uint64_type_node
= build_nonstandard_integer_type (64, true);
9783 /* Decimal float types. */
9784 dfloat32_type_node
= make_node (REAL_TYPE
);
9785 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9786 layout_type (dfloat32_type_node
);
9787 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9788 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9790 dfloat64_type_node
= make_node (REAL_TYPE
);
9791 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9792 layout_type (dfloat64_type_node
);
9793 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9794 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9796 dfloat128_type_node
= make_node (REAL_TYPE
);
9797 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9798 layout_type (dfloat128_type_node
);
9799 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9800 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9802 complex_integer_type_node
= build_complex_type (integer_type_node
);
9803 complex_float_type_node
= build_complex_type (float_type_node
);
9804 complex_double_type_node
= build_complex_type (double_type_node
);
9805 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9807 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9808 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9809 sat_ ## KIND ## _type_node = \
9810 make_sat_signed_ ## KIND ## _type (SIZE); \
9811 sat_unsigned_ ## KIND ## _type_node = \
9812 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9813 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9814 unsigned_ ## KIND ## _type_node = \
9815 make_unsigned_ ## KIND ## _type (SIZE);
9817 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9818 sat_ ## WIDTH ## KIND ## _type_node = \
9819 make_sat_signed_ ## KIND ## _type (SIZE); \
9820 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9821 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9822 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9823 unsigned_ ## WIDTH ## KIND ## _type_node = \
9824 make_unsigned_ ## KIND ## _type (SIZE);
9826 /* Make fixed-point type nodes based on four different widths. */
9827 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9828 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9829 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9830 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9831 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9833 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9834 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9835 NAME ## _type_node = \
9836 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9837 u ## NAME ## _type_node = \
9838 make_or_reuse_unsigned_ ## KIND ## _type \
9839 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9840 sat_ ## NAME ## _type_node = \
9841 make_or_reuse_sat_signed_ ## KIND ## _type \
9842 (GET_MODE_BITSIZE (MODE ## mode)); \
9843 sat_u ## NAME ## _type_node = \
9844 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9845 (GET_MODE_BITSIZE (U ## MODE ## mode));
9847 /* Fixed-point type and mode nodes. */
9848 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9849 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9850 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9851 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9852 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9853 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9854 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9855 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9856 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9857 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9858 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9861 tree t
= targetm
.build_builtin_va_list ();
9863 /* Many back-ends define record types without setting TYPE_NAME.
9864 If we copied the record type here, we'd keep the original
9865 record type without a name. This breaks name mangling. So,
9866 don't copy record types and let c_common_nodes_and_builtins()
9867 declare the type to be __builtin_va_list. */
9868 if (TREE_CODE (t
) != RECORD_TYPE
)
9869 t
= build_variant_type_copy (t
);
9871 va_list_type_node
= t
;
9875 /* Modify DECL for given flags. */
9877 set_call_expr_flags (tree decl
, int flags
)
9879 if (flags
& ECF_NOTHROW
)
9880 TREE_NOTHROW (decl
) = 1;
9881 if (flags
& ECF_CONST
)
9882 TREE_READONLY (decl
) = 1;
9883 if (flags
& ECF_PURE
)
9884 DECL_PURE_P (decl
) = 1;
9885 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9886 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9887 if (flags
& ECF_NOVOPS
)
9888 DECL_IS_NOVOPS (decl
) = 1;
9889 if (flags
& ECF_NORETURN
)
9890 TREE_THIS_VOLATILE (decl
) = 1;
9891 if (flags
& ECF_MALLOC
)
9892 DECL_IS_MALLOC (decl
) = 1;
9893 if (flags
& ECF_RETURNS_TWICE
)
9894 DECL_IS_RETURNS_TWICE (decl
) = 1;
9895 if (flags
& ECF_LEAF
)
9896 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9897 NULL
, DECL_ATTRIBUTES (decl
));
9898 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9899 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("transaction_pure"),
9900 NULL
, DECL_ATTRIBUTES (decl
));
9901 /* Looping const or pure is implied by noreturn.
9902 There is currently no way to declare looping const or looping pure alone. */
9903 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9904 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9908 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9911 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9912 const char *library_name
, int ecf_flags
)
9916 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9917 library_name
, NULL_TREE
);
9918 set_call_expr_flags (decl
, ecf_flags
);
9920 set_builtin_decl (code
, decl
, true);
9923 /* Call this function after instantiating all builtins that the language
9924 front end cares about. This will build the rest of the builtins that
9925 are relied upon by the tree optimizers and the middle-end. */
9928 build_common_builtin_nodes (void)
9933 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9935 ftype
= build_function_type (void_type_node
, void_list_node
);
9936 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9937 "__builtin_unreachable",
9938 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9939 | ECF_CONST
| ECF_LEAF
);
9942 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9943 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9945 ftype
= build_function_type_list (ptr_type_node
,
9946 ptr_type_node
, const_ptr_type_node
,
9947 size_type_node
, NULL_TREE
);
9949 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9950 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9951 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9952 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9953 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9954 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9957 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9959 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9960 const_ptr_type_node
, size_type_node
,
9962 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9963 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9966 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9968 ftype
= build_function_type_list (ptr_type_node
,
9969 ptr_type_node
, integer_type_node
,
9970 size_type_node
, NULL_TREE
);
9971 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9972 "memset", ECF_NOTHROW
| ECF_LEAF
);
9975 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9977 ftype
= build_function_type_list (ptr_type_node
,
9978 size_type_node
, NULL_TREE
);
9979 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9980 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9983 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9984 size_type_node
, NULL_TREE
);
9985 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9986 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9987 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9989 /* If we're checking the stack, `alloca' can throw. */
9990 if (flag_stack_check
)
9992 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9993 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9996 ftype
= build_function_type_list (void_type_node
,
9997 ptr_type_node
, ptr_type_node
,
9998 ptr_type_node
, NULL_TREE
);
9999 local_define_builtin ("__builtin_init_trampoline", ftype
,
10000 BUILT_IN_INIT_TRAMPOLINE
,
10001 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10002 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10003 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10004 "__builtin_init_heap_trampoline",
10005 ECF_NOTHROW
| ECF_LEAF
);
10007 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10008 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10009 BUILT_IN_ADJUST_TRAMPOLINE
,
10010 "__builtin_adjust_trampoline",
10011 ECF_CONST
| ECF_NOTHROW
);
10013 ftype
= build_function_type_list (void_type_node
,
10014 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10015 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10016 BUILT_IN_NONLOCAL_GOTO
,
10017 "__builtin_nonlocal_goto",
10018 ECF_NORETURN
| ECF_NOTHROW
);
10020 ftype
= build_function_type_list (void_type_node
,
10021 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10022 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10023 BUILT_IN_SETJMP_SETUP
,
10024 "__builtin_setjmp_setup", ECF_NOTHROW
);
10026 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10027 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
10028 BUILT_IN_SETJMP_DISPATCHER
,
10029 "__builtin_setjmp_dispatcher",
10030 ECF_PURE
| ECF_NOTHROW
);
10032 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10033 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10034 BUILT_IN_SETJMP_RECEIVER
,
10035 "__builtin_setjmp_receiver", ECF_NOTHROW
);
10037 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10038 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10039 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10041 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10042 local_define_builtin ("__builtin_stack_restore", ftype
,
10043 BUILT_IN_STACK_RESTORE
,
10044 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10046 /* If there's a possibility that we might use the ARM EABI, build the
10047 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10048 if (targetm
.arm_eabi_unwinder
)
10050 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10051 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10052 BUILT_IN_CXA_END_CLEANUP
,
10053 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10056 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10057 local_define_builtin ("__builtin_unwind_resume", ftype
,
10058 BUILT_IN_UNWIND_RESUME
,
10059 ((targetm_common
.except_unwind_info (&global_options
)
10061 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10064 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10066 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10068 local_define_builtin ("__builtin_return_address", ftype
,
10069 BUILT_IN_RETURN_ADDRESS
,
10070 "__builtin_return_address",
10074 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10075 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10077 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10078 ptr_type_node
, NULL_TREE
);
10079 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10080 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10081 BUILT_IN_PROFILE_FUNC_ENTER
,
10082 "__cyg_profile_func_enter", 0);
10083 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10084 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10085 BUILT_IN_PROFILE_FUNC_EXIT
,
10086 "__cyg_profile_func_exit", 0);
10089 /* The exception object and filter values from the runtime. The argument
10090 must be zero before exception lowering, i.e. from the front end. After
10091 exception lowering, it will be the region number for the exception
10092 landing pad. These functions are PURE instead of CONST to prevent
10093 them from being hoisted past the exception edge that will initialize
10094 its value in the landing pad. */
10095 ftype
= build_function_type_list (ptr_type_node
,
10096 integer_type_node
, NULL_TREE
);
10097 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10098 /* Only use TM_PURE if we we have TM language support. */
10099 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10100 ecf_flags
|= ECF_TM_PURE
;
10101 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10102 "__builtin_eh_pointer", ecf_flags
);
10104 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10105 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10106 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10107 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10109 ftype
= build_function_type_list (void_type_node
,
10110 integer_type_node
, integer_type_node
,
10112 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10113 BUILT_IN_EH_COPY_VALUES
,
10114 "__builtin_eh_copy_values", ECF_NOTHROW
);
10116 /* Complex multiplication and division. These are handled as builtins
10117 rather than optabs because emit_library_call_value doesn't support
10118 complex. Further, we can do slightly better with folding these
10119 beasties if the real and complex parts of the arguments are separate. */
10123 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10125 char mode_name_buf
[4], *q
;
10127 enum built_in_function mcode
, dcode
;
10128 tree type
, inner_type
;
10129 const char *prefix
= "__";
10131 if (targetm
.libfunc_gnu_prefix
)
10134 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10137 inner_type
= TREE_TYPE (type
);
10139 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10140 inner_type
, inner_type
, NULL_TREE
);
10142 mcode
= ((enum built_in_function
)
10143 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10144 dcode
= ((enum built_in_function
)
10145 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10147 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10151 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10153 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10154 built_in_names
[mcode
],
10155 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10157 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10159 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10160 built_in_names
[dcode
],
10161 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10166 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10169 If we requested a pointer to a vector, build up the pointers that
10170 we stripped off while looking for the inner type. Similarly for
10171 return values from functions.
10173 The argument TYPE is the top of the chain, and BOTTOM is the
10174 new type which we will point to. */
10177 reconstruct_complex_type (tree type
, tree bottom
)
10181 if (TREE_CODE (type
) == POINTER_TYPE
)
10183 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10184 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10185 TYPE_REF_CAN_ALIAS_ALL (type
));
10187 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10189 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10190 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10191 TYPE_REF_CAN_ALIAS_ALL (type
));
10193 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10195 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10196 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10198 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10200 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10201 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10203 else if (TREE_CODE (type
) == METHOD_TYPE
)
10205 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10206 /* The build_method_type_directly() routine prepends 'this' to argument list,
10207 so we must compensate by getting rid of it. */
10209 = build_method_type_directly
10210 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10212 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10214 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10216 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10217 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10222 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10223 TYPE_QUALS (type
));
10226 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10229 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10233 switch (GET_MODE_CLASS (mode
))
10235 case MODE_VECTOR_INT
:
10236 case MODE_VECTOR_FLOAT
:
10237 case MODE_VECTOR_FRACT
:
10238 case MODE_VECTOR_UFRACT
:
10239 case MODE_VECTOR_ACCUM
:
10240 case MODE_VECTOR_UACCUM
:
10241 nunits
= GET_MODE_NUNITS (mode
);
10245 /* Check that there are no leftover bits. */
10246 gcc_assert (GET_MODE_BITSIZE (mode
)
10247 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10249 nunits
= GET_MODE_BITSIZE (mode
)
10250 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10254 gcc_unreachable ();
10257 return make_vector_type (innertype
, nunits
, mode
);
10260 /* Similarly, but takes the inner type and number of units, which must be
10264 build_vector_type (tree innertype
, int nunits
)
10266 return make_vector_type (innertype
, nunits
, VOIDmode
);
10269 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10272 build_opaque_vector_type (tree innertype
, int nunits
)
10274 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10276 /* We always build the non-opaque variant before the opaque one,
10277 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10278 cand
= TYPE_NEXT_VARIANT (t
);
10280 && TYPE_VECTOR_OPAQUE (cand
)
10281 && check_qualified_type (cand
, t
, TYPE_QUALS (t
), NULL_TREE
))
10283 /* Othewise build a variant type and make sure to queue it after
10284 the non-opaque type. */
10285 cand
= build_distinct_type_copy (t
);
10286 TYPE_VECTOR_OPAQUE (cand
) = true;
10287 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10288 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10289 TYPE_NEXT_VARIANT (t
) = cand
;
10290 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10295 /* Given an initializer INIT, return TRUE if INIT is zero or some
10296 aggregate of zeros. Otherwise return FALSE. */
10298 initializer_zerop (const_tree init
)
10304 switch (TREE_CODE (init
))
10307 return integer_zerop (init
);
10310 /* ??? Note that this is not correct for C4X float formats. There,
10311 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10312 negative exponent. */
10313 return real_zerop (init
)
10314 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10317 return fixed_zerop (init
);
10320 return integer_zerop (init
)
10321 || (real_zerop (init
)
10322 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10323 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10328 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10329 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10336 unsigned HOST_WIDE_INT idx
;
10338 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10339 if (!initializer_zerop (elt
))
10348 /* We need to loop through all elements to handle cases like
10349 "\0" and "\0foobar". */
10350 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10351 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10362 /* Check if vector VEC consists of all the equal elements and
10363 that the number of elements corresponds to the type of VEC.
10364 The function returns first element of the vector
10365 or NULL_TREE if the vector is not uniform. */
10367 uniform_vector_p (const_tree vec
)
10372 if (vec
== NULL_TREE
)
10375 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10377 if (TREE_CODE (vec
) == VECTOR_CST
)
10379 first
= VECTOR_CST_ELT (vec
, 0);
10380 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10381 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10387 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10389 first
= error_mark_node
;
10391 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10398 if (!operand_equal_p (first
, t
, 0))
10401 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10410 /* Build an empty statement at location LOC. */
10413 build_empty_stmt (location_t loc
)
10415 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10416 SET_EXPR_LOCATION (t
, loc
);
10421 /* Build an OpenMP clause with code CODE. LOC is the location of the
10425 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10430 length
= omp_clause_num_ops
[code
];
10431 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10433 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10435 t
= ggc_alloc_tree_node (size
);
10436 memset (t
, 0, size
);
10437 TREE_SET_CODE (t
, OMP_CLAUSE
);
10438 OMP_CLAUSE_SET_CODE (t
, code
);
10439 OMP_CLAUSE_LOCATION (t
) = loc
;
10444 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10445 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10446 Except for the CODE and operand count field, other storage for the
10447 object is initialized to zeros. */
10450 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10453 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10455 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10456 gcc_assert (len
>= 1);
10458 record_node_allocation_statistics (code
, length
);
10460 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10462 TREE_SET_CODE (t
, code
);
10464 /* Can't use TREE_OPERAND to store the length because if checking is
10465 enabled, it will try to check the length before we store it. :-P */
10466 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10471 /* Helper function for build_call_* functions; build a CALL_EXPR with
10472 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10473 the argument slots. */
10476 build_call_1 (tree return_type
, tree fn
, int nargs
)
10480 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10481 TREE_TYPE (t
) = return_type
;
10482 CALL_EXPR_FN (t
) = fn
;
10483 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10488 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10489 FN and a null static chain slot. NARGS is the number of call arguments
10490 which are specified as "..." arguments. */
10493 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10497 va_start (args
, nargs
);
10498 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10503 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10504 FN and a null static chain slot. NARGS is the number of call arguments
10505 which are specified as a va_list ARGS. */
10508 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10513 t
= build_call_1 (return_type
, fn
, nargs
);
10514 for (i
= 0; i
< nargs
; i
++)
10515 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10516 process_call_operands (t
);
10520 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10521 FN and a null static chain slot. NARGS is the number of call arguments
10522 which are specified as a tree array ARGS. */
10525 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10526 int nargs
, const tree
*args
)
10531 t
= build_call_1 (return_type
, fn
, nargs
);
10532 for (i
= 0; i
< nargs
; i
++)
10533 CALL_EXPR_ARG (t
, i
) = args
[i
];
10534 process_call_operands (t
);
10535 SET_EXPR_LOCATION (t
, loc
);
10539 /* Like build_call_array, but takes a vec. */
10542 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10547 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10548 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10549 CALL_EXPR_ARG (ret
, ix
) = t
;
10550 process_call_operands (ret
);
10555 /* Returns true if it is possible to prove that the index of
10556 an array access REF (an ARRAY_REF expression) falls into the
10560 in_array_bounds_p (tree ref
)
10562 tree idx
= TREE_OPERAND (ref
, 1);
10565 if (TREE_CODE (idx
) != INTEGER_CST
)
10568 min
= array_ref_low_bound (ref
);
10569 max
= array_ref_up_bound (ref
);
10572 || TREE_CODE (min
) != INTEGER_CST
10573 || TREE_CODE (max
) != INTEGER_CST
)
10576 if (tree_int_cst_lt (idx
, min
)
10577 || tree_int_cst_lt (max
, idx
))
10583 /* Returns true if it is possible to prove that the range of
10584 an array access REF (an ARRAY_RANGE_REF expression) falls
10585 into the array bounds. */
10588 range_in_array_bounds_p (tree ref
)
10590 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10591 tree range_min
, range_max
, min
, max
;
10593 range_min
= TYPE_MIN_VALUE (domain_type
);
10594 range_max
= TYPE_MAX_VALUE (domain_type
);
10597 || TREE_CODE (range_min
) != INTEGER_CST
10598 || TREE_CODE (range_max
) != INTEGER_CST
)
10601 min
= array_ref_low_bound (ref
);
10602 max
= array_ref_up_bound (ref
);
10605 || TREE_CODE (min
) != INTEGER_CST
10606 || TREE_CODE (max
) != INTEGER_CST
)
10609 if (tree_int_cst_lt (range_min
, min
)
10610 || tree_int_cst_lt (max
, range_max
))
10616 /* Return true if T (assumed to be a DECL) must be assigned a memory
10620 needs_to_live_in_memory (const_tree t
)
10622 return (TREE_ADDRESSABLE (t
)
10623 || is_global_var (t
)
10624 || (TREE_CODE (t
) == RESULT_DECL
10625 && !DECL_BY_REFERENCE (t
)
10626 && aggregate_value_p (t
, current_function_decl
)));
10629 /* Return value of a constant X and sign-extend it. */
10632 int_cst_value (const_tree x
)
10634 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10635 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10637 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10638 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10639 || TREE_INT_CST_HIGH (x
) == -1);
10641 if (bits
< HOST_BITS_PER_WIDE_INT
)
10643 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10645 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10647 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10653 /* Return value of a constant X and sign-extend it. */
10656 widest_int_cst_value (const_tree x
)
10658 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10659 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10661 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10662 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10663 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10664 << HOST_BITS_PER_WIDE_INT
);
10666 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10667 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10668 || TREE_INT_CST_HIGH (x
) == -1);
10671 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10673 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10675 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10677 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10683 /* If TYPE is an integral or pointer type, return an integer type with
10684 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10685 if TYPE is already an integer type of signedness UNSIGNEDP. */
10688 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10690 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10693 if (TREE_CODE (type
) == VECTOR_TYPE
)
10695 tree inner
= TREE_TYPE (type
);
10696 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10699 if (inner
== inner2
)
10701 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10704 if (!INTEGRAL_TYPE_P (type
)
10705 && !POINTER_TYPE_P (type
))
10708 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10711 /* If TYPE is an integral or pointer type, return an integer type with
10712 the same precision which is unsigned, or itself if TYPE is already an
10713 unsigned integer type. */
10716 unsigned_type_for (tree type
)
10718 return signed_or_unsigned_type_for (1, type
);
10721 /* If TYPE is an integral or pointer type, return an integer type with
10722 the same precision which is signed, or itself if TYPE is already a
10723 signed integer type. */
10726 signed_type_for (tree type
)
10728 return signed_or_unsigned_type_for (0, type
);
10731 /* If TYPE is a vector type, return a signed integer vector type with the
10732 same width and number of subparts. Otherwise return boolean_type_node. */
10735 truth_type_for (tree type
)
10737 if (TREE_CODE (type
) == VECTOR_TYPE
)
10739 tree elem
= lang_hooks
.types
.type_for_size
10740 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10741 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10744 return boolean_type_node
;
10747 /* Returns the largest value obtainable by casting something in INNER type to
10751 upper_bound_in_type (tree outer
, tree inner
)
10754 unsigned int det
= 0;
10755 unsigned oprec
= TYPE_PRECISION (outer
);
10756 unsigned iprec
= TYPE_PRECISION (inner
);
10759 /* Compute a unique number for every combination. */
10760 det
|= (oprec
> iprec
) ? 4 : 0;
10761 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10762 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10764 /* Determine the exponent to use. */
10769 /* oprec <= iprec, outer: signed, inner: don't care. */
10774 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10778 /* oprec > iprec, outer: signed, inner: signed. */
10782 /* oprec > iprec, outer: signed, inner: unsigned. */
10786 /* oprec > iprec, outer: unsigned, inner: signed. */
10790 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10794 gcc_unreachable ();
10797 /* Compute 2^^prec - 1. */
10798 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10801 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10802 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10806 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10807 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10808 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10811 return double_int_to_tree (outer
, high
);
10814 /* Returns the smallest value obtainable by casting something in INNER type to
10818 lower_bound_in_type (tree outer
, tree inner
)
10821 unsigned oprec
= TYPE_PRECISION (outer
);
10822 unsigned iprec
= TYPE_PRECISION (inner
);
10824 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10826 if (TYPE_UNSIGNED (outer
)
10827 /* If we are widening something of an unsigned type, OUTER type
10828 contains all values of INNER type. In particular, both INNER
10829 and OUTER types have zero in common. */
10830 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10831 low
.low
= low
.high
= 0;
10834 /* If we are widening a signed type to another signed type, we
10835 want to obtain -2^^(iprec-1). If we are keeping the
10836 precision or narrowing to a signed type, we want to obtain
10838 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10840 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10842 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10843 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10847 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10848 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10853 return double_int_to_tree (outer
, low
);
10856 /* Return nonzero if two operands that are suitable for PHI nodes are
10857 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10858 SSA_NAME or invariant. Note that this is strictly an optimization.
10859 That is, callers of this function can directly call operand_equal_p
10860 and get the same result, only slower. */
10863 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10867 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10869 return operand_equal_p (arg0
, arg1
, 0);
10872 /* Returns number of zeros at the end of binary representation of X.
10874 ??? Use ffs if available? */
10877 num_ending_zeros (const_tree x
)
10879 unsigned HOST_WIDE_INT fr
, nfr
;
10880 unsigned num
, abits
;
10881 tree type
= TREE_TYPE (x
);
10883 if (TREE_INT_CST_LOW (x
) == 0)
10885 num
= HOST_BITS_PER_WIDE_INT
;
10886 fr
= TREE_INT_CST_HIGH (x
);
10891 fr
= TREE_INT_CST_LOW (x
);
10894 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10897 if (nfr
<< abits
== fr
)
10904 if (num
> TYPE_PRECISION (type
))
10905 num
= TYPE_PRECISION (type
);
10907 return build_int_cst_type (type
, num
);
10911 #define WALK_SUBTREE(NODE) \
10914 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10920 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10921 be walked whenever a type is seen in the tree. Rest of operands and return
10922 value are as for walk_tree. */
10925 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10926 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10928 tree result
= NULL_TREE
;
10930 switch (TREE_CODE (type
))
10933 case REFERENCE_TYPE
:
10934 /* We have to worry about mutually recursive pointers. These can't
10935 be written in C. They can in Ada. It's pathological, but
10936 there's an ACATS test (c38102a) that checks it. Deal with this
10937 by checking if we're pointing to another pointer, that one
10938 points to another pointer, that one does too, and we have no htab.
10939 If so, get a hash table. We check three levels deep to avoid
10940 the cost of the hash table if we don't need one. */
10941 if (POINTER_TYPE_P (TREE_TYPE (type
))
10942 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10943 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10946 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10954 /* ... fall through ... */
10957 WALK_SUBTREE (TREE_TYPE (type
));
10961 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10963 /* Fall through. */
10965 case FUNCTION_TYPE
:
10966 WALK_SUBTREE (TREE_TYPE (type
));
10970 /* We never want to walk into default arguments. */
10971 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10972 WALK_SUBTREE (TREE_VALUE (arg
));
10977 /* Don't follow this nodes's type if a pointer for fear that
10978 we'll have infinite recursion. If we have a PSET, then we
10981 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10982 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10983 WALK_SUBTREE (TREE_TYPE (type
));
10984 WALK_SUBTREE (TYPE_DOMAIN (type
));
10988 WALK_SUBTREE (TREE_TYPE (type
));
10989 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10999 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11000 called with the DATA and the address of each sub-tree. If FUNC returns a
11001 non-NULL value, the traversal is stopped, and the value returned by FUNC
11002 is returned. If PSET is non-NULL it is used to record the nodes visited,
11003 and to avoid visiting a node more than once. */
11006 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11007 struct pointer_set_t
*pset
, walk_tree_lh lh
)
11009 enum tree_code code
;
11013 #define WALK_SUBTREE_TAIL(NODE) \
11017 goto tail_recurse; \
11022 /* Skip empty subtrees. */
11026 /* Don't walk the same tree twice, if the user has requested
11027 that we avoid doing so. */
11028 if (pset
&& pointer_set_insert (pset
, *tp
))
11031 /* Call the function. */
11033 result
= (*func
) (tp
, &walk_subtrees
, data
);
11035 /* If we found something, return it. */
11039 code
= TREE_CODE (*tp
);
11041 /* Even if we didn't, FUNC may have decided that there was nothing
11042 interesting below this point in the tree. */
11043 if (!walk_subtrees
)
11045 /* But we still need to check our siblings. */
11046 if (code
== TREE_LIST
)
11047 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11048 else if (code
== OMP_CLAUSE
)
11049 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11056 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11057 if (result
|| !walk_subtrees
)
11064 case IDENTIFIER_NODE
:
11071 case PLACEHOLDER_EXPR
:
11075 /* None of these have subtrees other than those already walked
11080 WALK_SUBTREE (TREE_VALUE (*tp
));
11081 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11086 int len
= TREE_VEC_LENGTH (*tp
);
11091 /* Walk all elements but the first. */
11093 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11095 /* Now walk the first one as a tail call. */
11096 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11100 WALK_SUBTREE (TREE_REALPART (*tp
));
11101 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11105 unsigned HOST_WIDE_INT idx
;
11106 constructor_elt
*ce
;
11108 for (idx
= 0; vec_safe_iterate(CONSTRUCTOR_ELTS (*tp
), idx
, &ce
); idx
++)
11109 WALK_SUBTREE (ce
->value
);
11114 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11119 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11121 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11122 into declarations that are just mentioned, rather than
11123 declared; they don't really belong to this part of the tree.
11124 And, we can see cycles: the initializer for a declaration
11125 can refer to the declaration itself. */
11126 WALK_SUBTREE (DECL_INITIAL (decl
));
11127 WALK_SUBTREE (DECL_SIZE (decl
));
11128 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11130 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11133 case STATEMENT_LIST
:
11135 tree_stmt_iterator i
;
11136 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11137 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11142 switch (OMP_CLAUSE_CODE (*tp
))
11144 case OMP_CLAUSE_PRIVATE
:
11145 case OMP_CLAUSE_SHARED
:
11146 case OMP_CLAUSE_FIRSTPRIVATE
:
11147 case OMP_CLAUSE_COPYIN
:
11148 case OMP_CLAUSE_COPYPRIVATE
:
11149 case OMP_CLAUSE_FINAL
:
11150 case OMP_CLAUSE_IF
:
11151 case OMP_CLAUSE_NUM_THREADS
:
11152 case OMP_CLAUSE_SCHEDULE
:
11153 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11156 case OMP_CLAUSE_NOWAIT
:
11157 case OMP_CLAUSE_ORDERED
:
11158 case OMP_CLAUSE_DEFAULT
:
11159 case OMP_CLAUSE_UNTIED
:
11160 case OMP_CLAUSE_MERGEABLE
:
11161 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11163 case OMP_CLAUSE_LASTPRIVATE
:
11164 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11165 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11166 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11168 case OMP_CLAUSE_COLLAPSE
:
11171 for (i
= 0; i
< 3; i
++)
11172 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11173 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11176 case OMP_CLAUSE_REDUCTION
:
11179 for (i
= 0; i
< 4; i
++)
11180 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11181 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11185 gcc_unreachable ();
11193 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11194 But, we only want to walk once. */
11195 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11196 for (i
= 0; i
< len
; ++i
)
11197 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11198 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11202 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11203 defining. We only want to walk into these fields of a type in this
11204 case and not in the general case of a mere reference to the type.
11206 The criterion is as follows: if the field can be an expression, it
11207 must be walked only here. This should be in keeping with the fields
11208 that are directly gimplified in gimplify_type_sizes in order for the
11209 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11210 variable-sized types.
11212 Note that DECLs get walked as part of processing the BIND_EXPR. */
11213 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11215 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11216 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11219 /* Call the function for the type. See if it returns anything or
11220 doesn't want us to continue. If we are to continue, walk both
11221 the normal fields and those for the declaration case. */
11222 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11223 if (result
|| !walk_subtrees
)
11226 /* But do not walk a pointed-to type since it may itself need to
11227 be walked in the declaration case if it isn't anonymous. */
11228 if (!POINTER_TYPE_P (*type_p
))
11230 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11235 /* If this is a record type, also walk the fields. */
11236 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11240 for (field
= TYPE_FIELDS (*type_p
); field
;
11241 field
= DECL_CHAIN (field
))
11243 /* We'd like to look at the type of the field, but we can
11244 easily get infinite recursion. So assume it's pointed
11245 to elsewhere in the tree. Also, ignore things that
11247 if (TREE_CODE (field
) != FIELD_DECL
)
11250 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11251 WALK_SUBTREE (DECL_SIZE (field
));
11252 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11253 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11254 WALK_SUBTREE (DECL_QUALIFIER (field
));
11258 /* Same for scalar types. */
11259 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11260 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11261 || TREE_CODE (*type_p
) == INTEGER_TYPE
11262 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11263 || TREE_CODE (*type_p
) == REAL_TYPE
)
11265 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11266 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11269 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11270 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11275 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11279 /* Walk over all the sub-trees of this operand. */
11280 len
= TREE_OPERAND_LENGTH (*tp
);
11282 /* Go through the subtrees. We need to do this in forward order so
11283 that the scope of a FOR_EXPR is handled properly. */
11286 for (i
= 0; i
< len
- 1; ++i
)
11287 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11288 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11291 /* If this is a type, walk the needed fields in the type. */
11292 else if (TYPE_P (*tp
))
11293 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11297 /* We didn't find what we were looking for. */
11300 #undef WALK_SUBTREE_TAIL
11302 #undef WALK_SUBTREE
11304 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11307 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11311 struct pointer_set_t
*pset
;
11313 pset
= pointer_set_create ();
11314 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11315 pointer_set_destroy (pset
);
11321 tree_block (tree t
)
11323 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11325 if (IS_EXPR_CODE_CLASS (c
))
11326 return LOCATION_BLOCK (t
->exp
.locus
);
11327 gcc_unreachable ();
11332 tree_set_block (tree t
, tree b
)
11334 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11336 if (IS_EXPR_CODE_CLASS (c
))
11339 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11341 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11344 gcc_unreachable ();
11347 /* Create a nameless artificial label and put it in the current
11348 function context. The label has a location of LOC. Returns the
11349 newly created label. */
11352 create_artificial_label (location_t loc
)
11354 tree lab
= build_decl (loc
,
11355 LABEL_DECL
, NULL_TREE
, void_type_node
);
11357 DECL_ARTIFICIAL (lab
) = 1;
11358 DECL_IGNORED_P (lab
) = 1;
11359 DECL_CONTEXT (lab
) = current_function_decl
;
11363 /* Given a tree, try to return a useful variable name that we can use
11364 to prefix a temporary that is being assigned the value of the tree.
11365 I.E. given <temp> = &A, return A. */
11370 tree stripped_decl
;
11373 STRIP_NOPS (stripped_decl
);
11374 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11375 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11376 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11378 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11381 return IDENTIFIER_POINTER (name
);
11385 switch (TREE_CODE (stripped_decl
))
11388 return get_name (TREE_OPERAND (stripped_decl
, 0));
11395 /* Return true if TYPE has a variable argument list. */
11398 stdarg_p (const_tree fntype
)
11400 function_args_iterator args_iter
;
11401 tree n
= NULL_TREE
, t
;
11406 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
11411 return n
!= NULL_TREE
&& n
!= void_type_node
;
11414 /* Return true if TYPE has a prototype. */
11417 prototype_p (tree fntype
)
11421 gcc_assert (fntype
!= NULL_TREE
);
11423 t
= TYPE_ARG_TYPES (fntype
);
11424 return (t
!= NULL_TREE
);
11427 /* If BLOCK is inlined from an __attribute__((__artificial__))
11428 routine, return pointer to location from where it has been
11431 block_nonartificial_location (tree block
)
11433 location_t
*ret
= NULL
;
11435 while (block
&& TREE_CODE (block
) == BLOCK
11436 && BLOCK_ABSTRACT_ORIGIN (block
))
11438 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11440 while (TREE_CODE (ao
) == BLOCK
11441 && BLOCK_ABSTRACT_ORIGIN (ao
)
11442 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11443 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11445 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11447 /* If AO is an artificial inline, point RET to the
11448 call site locus at which it has been inlined and continue
11449 the loop, in case AO's caller is also an artificial
11451 if (DECL_DECLARED_INLINE_P (ao
)
11452 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11453 ret
= &BLOCK_SOURCE_LOCATION (block
);
11457 else if (TREE_CODE (ao
) != BLOCK
)
11460 block
= BLOCK_SUPERCONTEXT (block
);
11466 /* If EXP is inlined from an __attribute__((__artificial__))
11467 function, return the location of the original call expression. */
11470 tree_nonartificial_location (tree exp
)
11472 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11477 return EXPR_LOCATION (exp
);
11481 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11484 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11487 cl_option_hash_hash (const void *x
)
11489 const_tree
const t
= (const_tree
) x
;
11493 hashval_t hash
= 0;
11495 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11497 p
= (const char *)TREE_OPTIMIZATION (t
);
11498 len
= sizeof (struct cl_optimization
);
11501 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11503 p
= (const char *)TREE_TARGET_OPTION (t
);
11504 len
= sizeof (struct cl_target_option
);
11508 gcc_unreachable ();
11510 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11512 for (i
= 0; i
< len
; i
++)
11514 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11519 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11520 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11524 cl_option_hash_eq (const void *x
, const void *y
)
11526 const_tree
const xt
= (const_tree
) x
;
11527 const_tree
const yt
= (const_tree
) y
;
11532 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11535 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11537 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11538 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11539 len
= sizeof (struct cl_optimization
);
11542 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11544 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11545 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11546 len
= sizeof (struct cl_target_option
);
11550 gcc_unreachable ();
11552 return (memcmp (xp
, yp
, len
) == 0);
11555 /* Build an OPTIMIZATION_NODE based on the current options. */
11558 build_optimization_node (void)
11563 /* Use the cache of optimization nodes. */
11565 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11568 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11572 /* Insert this one into the hash table. */
11573 t
= cl_optimization_node
;
11576 /* Make a new node for next time round. */
11577 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11583 /* Build a TARGET_OPTION_NODE based on the current options. */
11586 build_target_option_node (void)
11591 /* Use the cache of optimization nodes. */
11593 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11596 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11600 /* Insert this one into the hash table. */
11601 t
= cl_target_option_node
;
11604 /* Make a new node for next time round. */
11605 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11611 /* Determine the "ultimate origin" of a block. The block may be an inlined
11612 instance of an inlined instance of a block which is local to an inline
11613 function, so we have to trace all of the way back through the origin chain
11614 to find out what sort of node actually served as the original seed for the
11618 block_ultimate_origin (const_tree block
)
11620 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11622 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11623 nodes in the function to point to themselves; ignore that if
11624 we're trying to output the abstract instance of this function. */
11625 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11628 if (immediate_origin
== NULL_TREE
)
11633 tree lookahead
= immediate_origin
;
11637 ret_val
= lookahead
;
11638 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11639 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11641 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11643 /* The block's abstract origin chain may not be the *ultimate* origin of
11644 the block. It could lead to a DECL that has an abstract origin set.
11645 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11646 will give us if it has one). Note that DECL's abstract origins are
11647 supposed to be the most distant ancestor (or so decl_ultimate_origin
11648 claims), so we don't need to loop following the DECL origins. */
11649 if (DECL_P (ret_val
))
11650 return DECL_ORIGIN (ret_val
);
11656 /* Return true if T1 and T2 are equivalent lists. */
11659 list_equal_p (const_tree t1
, const_tree t2
)
11661 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11662 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11667 /* Return true iff conversion in EXP generates no instruction. Mark
11668 it inline so that we fully inline into the stripping functions even
11669 though we have two uses of this function. */
11672 tree_nop_conversion (const_tree exp
)
11674 tree outer_type
, inner_type
;
11675 int outer_is_pts_p
, inner_is_pts_p
;
11677 if (!CONVERT_EXPR_P (exp
)
11678 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11680 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11683 outer_type
= TREE_TYPE (exp
);
11684 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11689 outer_is_pts_p
= (POINTER_TYPE_P (outer_type
)
11690 && upc_shared_type_p (TREE_TYPE (outer_type
)));
11691 inner_is_pts_p
= (POINTER_TYPE_P (inner_type
)
11692 && upc_shared_type_p (TREE_TYPE (inner_type
)));
11694 /* UPC pointer-to-shared types have special
11695 equivalence rules that must be checked. */
11696 if (outer_is_pts_p
&& inner_is_pts_p
11697 && lang_hooks
.types_compatible_p
)
11698 return lang_hooks
.types_compatible_p (outer_type
, inner_type
);
11700 /* UPC pointer-to-shared types are not interchangeable
11701 with integral types. */
11702 if (outer_is_pts_p
|| inner_is_pts_p
)
11705 /* Use precision rather then machine mode when we can, which gives
11706 the correct answer even for submode (bit-field) types. */
11707 if ((INTEGRAL_TYPE_P (outer_type
)
11708 || POINTER_TYPE_P (outer_type
)
11709 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11710 && (INTEGRAL_TYPE_P (inner_type
)
11711 || POINTER_TYPE_P (inner_type
)
11712 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11713 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11715 /* Otherwise fall back on comparing machine modes (e.g. for
11716 aggregate types, floats). */
11717 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11720 /* Return true iff conversion in EXP generates no instruction. Don't
11721 consider conversions changing the signedness. */
11724 tree_sign_nop_conversion (const_tree exp
)
11726 tree outer_type
, inner_type
;
11728 if (!tree_nop_conversion (exp
))
11731 outer_type
= TREE_TYPE (exp
);
11732 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11734 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11735 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11738 /* Strip conversions from EXP according to tree_nop_conversion and
11739 return the resulting expression. */
11742 tree_strip_nop_conversions (tree exp
)
11744 while (tree_nop_conversion (exp
))
11745 exp
= TREE_OPERAND (exp
, 0);
11749 /* Strip conversions from EXP according to tree_sign_nop_conversion
11750 and return the resulting expression. */
11753 tree_strip_sign_nop_conversions (tree exp
)
11755 while (tree_sign_nop_conversion (exp
))
11756 exp
= TREE_OPERAND (exp
, 0);
11760 /* Avoid any floating point extensions from EXP. */
11762 strip_float_extensions (tree exp
)
11764 tree sub
, expt
, subt
;
11766 /* For floating point constant look up the narrowest type that can hold
11767 it properly and handle it like (type)(narrowest_type)constant.
11768 This way we can optimize for instance a=a*2.0 where "a" is float
11769 but 2.0 is double constant. */
11770 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11772 REAL_VALUE_TYPE orig
;
11775 orig
= TREE_REAL_CST (exp
);
11776 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11777 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11778 type
= float_type_node
;
11779 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11780 > TYPE_PRECISION (double_type_node
)
11781 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11782 type
= double_type_node
;
11784 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11787 if (!CONVERT_EXPR_P (exp
))
11790 sub
= TREE_OPERAND (exp
, 0);
11791 subt
= TREE_TYPE (sub
);
11792 expt
= TREE_TYPE (exp
);
11794 if (!FLOAT_TYPE_P (subt
))
11797 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11800 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11803 return strip_float_extensions (sub
);
11806 /* Strip out all handled components that produce invariant
11810 strip_invariant_refs (const_tree op
)
11812 while (handled_component_p (op
))
11814 switch (TREE_CODE (op
))
11817 case ARRAY_RANGE_REF
:
11818 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11819 || TREE_OPERAND (op
, 2) != NULL_TREE
11820 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11824 case COMPONENT_REF
:
11825 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11831 op
= TREE_OPERAND (op
, 0);
11837 static GTY(()) tree gcc_eh_personality_decl
;
11839 /* Return the GCC personality function decl. */
11842 lhd_gcc_personality (void)
11844 if (!gcc_eh_personality_decl
)
11845 gcc_eh_personality_decl
= build_personality_function ("gcc");
11846 return gcc_eh_personality_decl
;
11849 /* For languages with One Definition Rule, work out if
11850 trees are actually the same even if the tree representation
11851 differs. This handles only decls appearing in TYPE_NAME
11852 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11853 RECORD_TYPE and IDENTIFIER_NODE. */
11856 same_for_odr (tree t1
, tree t2
)
11862 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11863 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11864 && TREE_CODE (t2
) == TYPE_DECL
11865 && DECL_FILE_SCOPE_P (t1
))
11867 t2
= DECL_NAME (t2
);
11868 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11870 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11871 && TREE_CODE (t1
) == TYPE_DECL
11872 && DECL_FILE_SCOPE_P (t2
))
11874 t1
= DECL_NAME (t1
);
11875 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11877 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11880 return types_same_for_odr (t1
, t2
);
11882 return decls_same_for_odr (t1
, t2
);
11886 /* For languages with One Definition Rule, work out if
11887 decls are actually the same even if the tree representation
11888 differs. This handles only decls appearing in TYPE_NAME
11889 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11890 RECORD_TYPE and IDENTIFIER_NODE. */
11893 decls_same_for_odr (tree decl1
, tree decl2
)
11895 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11896 && DECL_ORIGINAL_TYPE (decl1
))
11897 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11898 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11899 && DECL_ORIGINAL_TYPE (decl2
))
11900 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11901 if (decl1
== decl2
)
11903 if (!decl1
|| !decl2
)
11905 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11906 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11908 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11910 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11911 && TREE_CODE (decl1
) != TYPE_DECL
)
11913 if (!DECL_NAME (decl1
))
11915 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11916 gcc_checking_assert (!DECL_NAME (decl2
)
11917 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11918 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11920 return same_for_odr (DECL_CONTEXT (decl1
),
11921 DECL_CONTEXT (decl2
));
11924 /* For languages with One Definition Rule, work out if
11925 types are same even if the tree representation differs.
11926 This is non-trivial for LTO where minnor differences in
11927 the type representation may have prevented type merging
11928 to merge two copies of otherwise equivalent type. */
11931 types_same_for_odr (tree type1
, tree type2
)
11933 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11934 type1
= TYPE_MAIN_VARIANT (type1
);
11935 type2
= TYPE_MAIN_VARIANT (type2
);
11936 if (type1
== type2
)
11939 /* If types are not structuraly same, do not bother to contnue.
11940 Match in the remainder of code would mean ODR violation. */
11941 if (!types_compatible_p (type1
, type2
))
11944 #ifndef ENABLE_CHECKING
11949 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11950 on the corresponding TYPE_STUB_DECL. */
11951 if (TYPE_STUB_DECL (type1
) != TYPE_STUB_DECL (type2
)
11952 && (!TYPE_STUB_DECL (type1
)
11953 || !TYPE_STUB_DECL (type2
)
11954 || !TREE_PUBLIC (TYPE_STUB_DECL (type1
))
11955 || !TREE_PUBLIC (TYPE_STUB_DECL (type2
))))
11958 if (!TYPE_NAME (type1
))
11960 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
11962 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
11964 /* When not in LTO the MAIN_VARIANT check should be the same. */
11965 gcc_assert (in_lto_p
);
11970 /* Try to find a base info of BINFO that would have its field decl at offset
11971 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11972 found, return, otherwise return NULL_TREE. */
11975 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11977 tree type
= BINFO_TYPE (binfo
);
11981 HOST_WIDE_INT pos
, size
;
11985 if (types_same_for_odr (type
, expected_type
))
11990 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11992 if (TREE_CODE (fld
) != FIELD_DECL
)
11995 pos
= int_bit_position (fld
);
11996 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11997 if (pos
<= offset
&& (pos
+ size
) > offset
)
12000 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12003 if (!DECL_ARTIFICIAL (fld
))
12005 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
12009 /* Offset 0 indicates the primary base, whose vtable contents are
12010 represented in the binfo for the derived class. */
12011 else if (offset
!= 0)
12013 tree base_binfo
, found_binfo
= NULL_TREE
;
12014 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12015 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12017 found_binfo
= base_binfo
;
12022 binfo
= found_binfo
;
12025 type
= TREE_TYPE (fld
);
12030 /* Returns true if X is a typedef decl. */
12033 is_typedef_decl (tree x
)
12035 return (x
&& TREE_CODE (x
) == TYPE_DECL
12036 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12039 /* Returns true iff TYPE is a type variant created for a typedef. */
12042 typedef_variant_p (tree type
)
12044 return is_typedef_decl (TYPE_NAME (type
));
12047 /* Warn about a use of an identifier which was marked deprecated. */
12049 warn_deprecated_use (tree node
, tree attr
)
12053 if (node
== 0 || !warn_deprecated_decl
)
12059 attr
= DECL_ATTRIBUTES (node
);
12060 else if (TYPE_P (node
))
12062 tree decl
= TYPE_STUB_DECL (node
);
12064 attr
= lookup_attribute ("deprecated",
12065 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12070 attr
= lookup_attribute ("deprecated", attr
);
12073 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12079 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12081 warning (OPT_Wdeprecated_declarations
,
12082 "%qD is deprecated (declared at %r%s:%d%R): %s",
12083 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12085 warning (OPT_Wdeprecated_declarations
,
12086 "%qD is deprecated (declared at %r%s:%d%R)",
12087 node
, "locus", xloc
.file
, xloc
.line
);
12089 else if (TYPE_P (node
))
12091 tree what
= NULL_TREE
;
12092 tree decl
= TYPE_STUB_DECL (node
);
12094 if (TYPE_NAME (node
))
12096 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12097 what
= TYPE_NAME (node
);
12098 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12099 && DECL_NAME (TYPE_NAME (node
)))
12100 what
= DECL_NAME (TYPE_NAME (node
));
12105 expanded_location xloc
12106 = expand_location (DECL_SOURCE_LOCATION (decl
));
12110 warning (OPT_Wdeprecated_declarations
,
12111 "%qE is deprecated (declared at %r%s:%d%R): %s",
12112 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12114 warning (OPT_Wdeprecated_declarations
,
12115 "%qE is deprecated (declared at %r%s:%d%R)",
12116 what
, "locus", xloc
.file
, xloc
.line
);
12121 warning (OPT_Wdeprecated_declarations
,
12122 "type is deprecated (declared at %r%s:%d%R): %s",
12123 "locus", xloc
.file
, xloc
.line
, msg
);
12125 warning (OPT_Wdeprecated_declarations
,
12126 "type is deprecated (declared at %r%s:%d%R)",
12127 "locus", xloc
.file
, xloc
.line
);
12135 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12138 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12143 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12146 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12152 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12153 somewhere in it. */
12156 contains_bitfld_component_ref_p (const_tree ref
)
12158 while (handled_component_p (ref
))
12160 if (TREE_CODE (ref
) == COMPONENT_REF
12161 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12163 ref
= TREE_OPERAND (ref
, 0);
12169 #include "gt-tree.h"