1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "fixed-value.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type
[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length
[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name
[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings
[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts
[(int) all_kinds
];
127 int tree_node_sizes
[(int) all_kinds
];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names
[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid
;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid
= 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid
;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash
{
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
179 htab_t type_hash_table
;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node
;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
184 htab_t int_cst_hash_table
;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node
;
192 static GTY (()) tree cl_target_option_node
;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
194 htab_t cl_option_hash_table
;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
200 htab_t debug_expr_for_decl
;
202 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
203 htab_t value_expr_for_decl
;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map
)))
207 htab_t init_priority_for_decl
;
209 static void set_type_quals (tree
, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t
type_hash_hash (const void *);
212 static hashval_t
int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t
cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree
, hashval_t
);
221 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
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 */
249 const char * const omp_clause_code_name
[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code
)
275 switch (TREE_CODE_CLASS (code
))
277 case tcc_declaration
:
282 return TS_FIELD_DECL
;
288 return TS_LABEL_DECL
;
290 return TS_RESULT_DECL
;
291 case DEBUG_EXPR_DECL
:
294 return TS_CONST_DECL
;
298 return TS_FUNCTION_DECL
;
300 return TS_DECL_NON_COMMON
;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST
: return TS_INT_CST
;
320 case REAL_CST
: return TS_REAL_CST
;
321 case FIXED_CST
: return TS_FIXED_CST
;
322 case COMPLEX_CST
: return TS_COMPLEX
;
323 case VECTOR_CST
: return TS_VECTOR
;
324 case STRING_CST
: return TS_STRING
;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK
: return TS_COMMON
;
327 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
328 case TREE_LIST
: return TS_LIST
;
329 case TREE_VEC
: return TS_VEC
;
330 case SSA_NAME
: return TS_SSA_NAME
;
331 case PLACEHOLDER_EXPR
: return TS_COMMON
;
332 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
333 case BLOCK
: return TS_BLOCK
;
334 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
335 case TREE_BINFO
: return TS_BINFO
;
336 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
337 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
338 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
398 enum tree_node_structure_enum ts_code
;
400 code
= (enum tree_code
) i
;
401 ts_code
= tree_node_structure_for_code (code
);
403 /* Mark the TS structure itself. */
404 tree_contains_struct
[code
][ts_code
] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL
:
428 case TS_STATEMENT_LIST
:
431 case TS_OPTIMIZATION
:
432 case TS_TARGET_OPTION
:
433 MARK_TS_COMMON (code
);
437 MARK_TS_DECL_MINIMAL (code
);
441 MARK_TS_DECL_COMMON (code
);
444 case TS_DECL_NON_COMMON
:
445 MARK_TS_DECL_WITH_VIS (code
);
448 case TS_DECL_WITH_VIS
:
453 MARK_TS_DECL_WRTL (code
);
457 MARK_TS_DECL_COMMON (code
);
461 MARK_TS_DECL_WITH_VIS (code
);
465 case TS_FUNCTION_DECL
:
466 MARK_TS_DECL_NON_COMMON (code
);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
476 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
]);
477 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
478 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
479 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
480 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
481 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
482 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
483 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
484 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
485 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
486 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
487 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
]);
488 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
489 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
490 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
491 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
492 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
493 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
494 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
495 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
496 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
498 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
499 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
500 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
502 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
503 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
504 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
505 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
]);
506 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
507 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
508 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
509 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
510 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
511 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
512 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
513 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
514 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
515 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
536 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
539 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
541 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
542 tree_priority_map_eq
, 0);
544 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
545 int_cst_hash_eq
, NULL
);
547 int_cst_node
= make_node (INTEGER_CST
);
549 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
550 cl_option_hash_eq
, NULL
);
552 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
553 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks
.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl
)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
568 lang_hooks
.set_decl_assembler_name (decl
);
569 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl
, const_tree asmname
)
577 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
578 const char *decl_str
;
579 const char *asmname_str
;
582 if (decl_asmname
== asmname
)
585 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
586 asmname_str
= IDENTIFIER_POINTER (asmname
);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str
[0] == '*')
597 size_t ulp_len
= strlen (user_label_prefix
);
603 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
604 decl_str
+= ulp_len
, test
=true;
608 if (asmname_str
[0] == '*')
610 size_t ulp_len
= strlen (user_label_prefix
);
616 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
617 asmname_str
+= ulp_len
, test
=true;
624 return strcmp (decl_str
, asmname_str
) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname
)
632 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
634 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
635 size_t ulp_len
= strlen (user_label_prefix
);
639 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
642 return htab_hash_string (decl_str
);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code
)
654 switch (TREE_CODE_CLASS (code
))
656 case tcc_declaration
: /* A decl node */
661 return sizeof (struct tree_field_decl
);
663 return sizeof (struct tree_parm_decl
);
665 return sizeof (struct tree_var_decl
);
667 return sizeof (struct tree_label_decl
);
669 return sizeof (struct tree_result_decl
);
671 return sizeof (struct tree_const_decl
);
673 return sizeof (struct tree_type_decl
);
675 return sizeof (struct tree_function_decl
);
676 case DEBUG_EXPR_DECL
:
677 return sizeof (struct tree_decl_with_rtl
);
679 return sizeof (struct tree_decl_non_common
);
683 case tcc_type
: /* a type node */
684 return sizeof (struct tree_type
);
686 case tcc_reference
: /* a reference */
687 case tcc_expression
: /* an expression */
688 case tcc_statement
: /* an expression with side effects */
689 case tcc_comparison
: /* a comparison expression */
690 case tcc_unary
: /* a unary arithmetic expression */
691 case tcc_binary
: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp
)
693 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
695 case tcc_constant
: /* a constant */
698 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
699 case REAL_CST
: return sizeof (struct tree_real_cst
);
700 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
701 case COMPLEX_CST
: return sizeof (struct tree_complex
);
702 case VECTOR_CST
: return sizeof (struct tree_vector
);
703 case STRING_CST
: gcc_unreachable ();
705 return lang_hooks
.tree_size (code
);
708 case tcc_exceptional
: /* something random, like an identifier. */
711 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
712 case TREE_LIST
: return sizeof (struct tree_list
);
715 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
718 case OMP_CLAUSE
: gcc_unreachable ();
720 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
722 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
723 case BLOCK
: return sizeof (struct tree_block
);
724 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
725 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
726 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
729 return lang_hooks
.tree_size (code
);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node
)
742 const enum tree_code code
= TREE_CODE (node
);
746 return (offsetof (struct tree_binfo
, base_binfos
)
747 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
750 return (sizeof (struct tree_vec
)
751 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
754 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
757 return (sizeof (struct tree_omp_clause
)
758 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
762 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
763 return (sizeof (struct tree_exp
)
764 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
766 return tree_code_size (code
);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL
)
781 enum tree_code_class type
= TREE_CODE_CLASS (code
);
782 size_t length
= tree_code_size (code
);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration
: /* A decl node */
792 case tcc_type
: /* a type node */
796 case tcc_statement
: /* an expression with side effects */
800 case tcc_reference
: /* a reference */
804 case tcc_expression
: /* an expression */
805 case tcc_comparison
: /* a comparison expression */
806 case tcc_unary
: /* a unary arithmetic expression */
807 case tcc_binary
: /* a binary arithmetic expression */
811 case tcc_constant
: /* a constant */
815 case tcc_exceptional
: /* something random, like an identifier. */
818 case IDENTIFIER_NODE
:
831 kind
= ssa_name_kind
;
852 tree_node_counts
[(int) kind
]++;
853 tree_node_sizes
[(int) kind
] += length
;
856 if (code
== IDENTIFIER_NODE
)
857 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
859 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
861 memset (t
, 0, length
);
863 TREE_SET_CODE (t
, code
);
868 TREE_SIDE_EFFECTS (t
) = 1;
871 case tcc_declaration
:
872 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
874 if (code
== FUNCTION_DECL
)
876 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
877 DECL_MODE (t
) = FUNCTION_MODE
;
882 DECL_SOURCE_LOCATION (t
) = input_location
;
883 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
884 DECL_UID (t
) = --next_debug_decl_uid
;
887 DECL_UID (t
) = next_decl_uid
++;
888 SET_DECL_PT_UID (t
, -1);
890 if (TREE_CODE (t
) == LABEL_DECL
)
891 LABEL_DECL_UID (t
) = -1;
896 TYPE_UID (t
) = next_type_uid
++;
897 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
898 TYPE_USER_ALIGN (t
) = 0;
899 TYPE_MAIN_VARIANT (t
) = t
;
900 TYPE_CANONICAL (t
) = t
;
902 /* Default to no attributes for type, but let target change that. */
903 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
904 targetm
.set_default_type_attributes (t
);
906 /* We have not yet computed the alias set for this type. */
907 TYPE_ALIAS_SET (t
) = -1;
911 TREE_CONSTANT (t
) = 1;
920 case PREDECREMENT_EXPR
:
921 case PREINCREMENT_EXPR
:
922 case POSTDECREMENT_EXPR
:
923 case POSTINCREMENT_EXPR
:
924 /* All of these have side-effects, no matter what their
926 TREE_SIDE_EFFECTS (t
) = 1;
935 /* Other classes need no special treatment. */
942 /* Return a new node with the same contents as NODE except that its
943 TREE_CHAIN is zero and it has a fresh uid. */
946 copy_node_stat (tree node MEM_STAT_DECL
)
949 enum tree_code code
= TREE_CODE (node
);
952 gcc_assert (code
!= STATEMENT_LIST
);
954 length
= tree_size (node
);
955 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
956 memcpy (t
, node
, length
);
959 TREE_ASM_WRITTEN (t
) = 0;
960 TREE_VISITED (t
) = 0;
961 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
962 *DECL_VAR_ANN_PTR (t
) = 0;
964 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
966 if (code
== DEBUG_EXPR_DECL
)
967 DECL_UID (t
) = --next_debug_decl_uid
;
970 DECL_UID (t
) = next_decl_uid
++;
971 if (DECL_PT_UID_SET_P (node
))
972 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
974 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
975 && DECL_HAS_VALUE_EXPR_P (node
))
977 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
978 DECL_HAS_VALUE_EXPR_P (t
) = 1;
980 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
982 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
983 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
986 else if (TREE_CODE_CLASS (code
) == tcc_type
)
988 TYPE_UID (t
) = next_type_uid
++;
989 /* The following is so that the debug code for
990 the copy is different from the original type.
991 The two statements usually duplicate each other
992 (because they clear fields of the same union),
993 but the optimizer should catch that. */
994 TYPE_SYMTAB_POINTER (t
) = 0;
995 TYPE_SYMTAB_ADDRESS (t
) = 0;
997 /* Do not copy the values cache. */
998 if (TYPE_CACHED_VALUES_P(t
))
1000 TYPE_CACHED_VALUES_P (t
) = 0;
1001 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1008 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1009 For example, this can copy a list made of TREE_LIST nodes. */
1012 copy_list (tree list
)
1020 head
= prev
= copy_node (list
);
1021 next
= TREE_CHAIN (list
);
1024 TREE_CHAIN (prev
) = copy_node (next
);
1025 prev
= TREE_CHAIN (prev
);
1026 next
= TREE_CHAIN (next
);
1032 /* Create an INT_CST node with a LOW value sign extended. */
1035 build_int_cst (tree type
, HOST_WIDE_INT low
)
1037 /* Support legacy code. */
1039 type
= integer_type_node
;
1041 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1044 /* Create an INT_CST node with a LOW value zero extended. */
1047 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
1049 return build_int_cst_wide (type
, low
, 0);
1052 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1053 if it is negative. This function is similar to build_int_cst, but
1054 the extra bits outside of the type precision are cleared. Constants
1055 with these extra bits may confuse the fold so that it detects overflows
1056 even in cases when they do not occur, and in general should be avoided.
1057 We cannot however make this a default behavior of build_int_cst without
1058 more intrusive changes, since there are parts of gcc that rely on the extra
1059 precision of the integer constants. */
1062 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1064 unsigned HOST_WIDE_INT low1
;
1069 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
1071 return build_int_cst_wide (type
, low1
, hi
);
1074 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1075 and sign extended according to the value range of TYPE. */
1078 build_int_cst_wide_type (tree type
,
1079 unsigned HOST_WIDE_INT low
, HOST_WIDE_INT high
)
1081 fit_double_type (low
, high
, &low
, &high
, type
);
1082 return build_int_cst_wide (type
, low
, high
);
1085 /* Constructs tree in type TYPE from with value given by CST. Signedness
1086 of CST is assumed to be the same as the signedness of TYPE. */
1089 double_int_to_tree (tree type
, double_int cst
)
1091 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), TYPE_UNSIGNED (type
));
1093 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1096 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1097 to be the same as the signedness of TYPE. */
1100 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1102 double_int ext
= double_int_ext (cst
,
1103 TYPE_PRECISION (type
),
1104 TYPE_UNSIGNED (type
));
1106 return double_int_equal_p (cst
, ext
);
1109 /* These are the hash table functions for the hash table of INTEGER_CST
1110 nodes of a sizetype. */
1112 /* Return the hash code code X, an INTEGER_CST. */
1115 int_cst_hash_hash (const void *x
)
1117 const_tree
const t
= (const_tree
) x
;
1119 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1120 ^ htab_hash_pointer (TREE_TYPE (t
)));
1123 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1124 is the same as that given by *Y, which is the same. */
1127 int_cst_hash_eq (const void *x
, const void *y
)
1129 const_tree
const xt
= (const_tree
) x
;
1130 const_tree
const yt
= (const_tree
) y
;
1132 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1133 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1134 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1137 /* Create an INT_CST node of TYPE and value HI:LOW.
1138 The returned node is always shared. For small integers we use a
1139 per-type vector cache, for larger ones we use a single hash table. */
1142 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1150 switch (TREE_CODE (type
))
1153 case REFERENCE_TYPE
:
1154 /* Cache NULL pointer. */
1163 /* Cache false or true. */
1171 if (TYPE_UNSIGNED (type
))
1174 limit
= INTEGER_SHARE_LIMIT
;
1175 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1181 limit
= INTEGER_SHARE_LIMIT
+ 1;
1182 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1184 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1198 /* Look for it in the type's vector of small shared ints. */
1199 if (!TYPE_CACHED_VALUES_P (type
))
1201 TYPE_CACHED_VALUES_P (type
) = 1;
1202 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1205 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1208 /* Make sure no one is clobbering the shared constant. */
1209 gcc_assert (TREE_TYPE (t
) == type
);
1210 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1211 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1215 /* Create a new shared int. */
1216 t
= make_node (INTEGER_CST
);
1218 TREE_INT_CST_LOW (t
) = low
;
1219 TREE_INT_CST_HIGH (t
) = hi
;
1220 TREE_TYPE (t
) = type
;
1222 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1227 /* Use the cache of larger shared ints. */
1230 TREE_INT_CST_LOW (int_cst_node
) = low
;
1231 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1232 TREE_TYPE (int_cst_node
) = type
;
1234 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1238 /* Insert this one into the hash table. */
1241 /* Make a new node for next time round. */
1242 int_cst_node
= make_node (INTEGER_CST
);
1249 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1250 and the rest are zeros. */
1253 build_low_bits_mask (tree type
, unsigned bits
)
1257 gcc_assert (bits
<= TYPE_PRECISION (type
));
1259 if (bits
== TYPE_PRECISION (type
)
1260 && !TYPE_UNSIGNED (type
))
1261 /* Sign extended all-ones mask. */
1262 mask
= double_int_minus_one
;
1264 mask
= double_int_mask (bits
);
1266 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1269 /* Checks that X is integer constant that can be expressed in (unsigned)
1270 HOST_WIDE_INT without loss of precision. */
1273 cst_and_fits_in_hwi (const_tree x
)
1275 if (TREE_CODE (x
) != INTEGER_CST
)
1278 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1281 return (TREE_INT_CST_HIGH (x
) == 0
1282 || TREE_INT_CST_HIGH (x
) == -1);
1285 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1286 are in a list pointed to by VALS. */
1289 build_vector (tree type
, tree vals
)
1291 tree v
= make_node (VECTOR_CST
);
1295 TREE_VECTOR_CST_ELTS (v
) = vals
;
1296 TREE_TYPE (v
) = type
;
1298 /* Iterate through elements and check for overflow. */
1299 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1301 tree value
= TREE_VALUE (link
);
1303 /* Don't crash if we get an address constant. */
1304 if (!CONSTANT_CLASS_P (value
))
1307 over
|= TREE_OVERFLOW (value
);
1310 TREE_OVERFLOW (v
) = over
;
1314 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1315 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1318 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1320 tree list
= NULL_TREE
;
1321 unsigned HOST_WIDE_INT idx
;
1324 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1325 list
= tree_cons (NULL_TREE
, value
, list
);
1326 return build_vector (type
, nreverse (list
));
1329 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1330 are in the VEC pointed to by VALS. */
1332 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1334 tree c
= make_node (CONSTRUCTOR
);
1336 constructor_elt
*elt
;
1337 bool constant_p
= true;
1339 TREE_TYPE (c
) = type
;
1340 CONSTRUCTOR_ELTS (c
) = vals
;
1342 for (i
= 0; VEC_iterate (constructor_elt
, vals
, i
, elt
); i
++)
1343 if (!TREE_CONSTANT (elt
->value
))
1349 TREE_CONSTANT (c
) = constant_p
;
1354 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1357 build_constructor_single (tree type
, tree index
, tree value
)
1359 VEC(constructor_elt
,gc
) *v
;
1360 constructor_elt
*elt
;
1362 v
= VEC_alloc (constructor_elt
, gc
, 1);
1363 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1367 return build_constructor (type
, v
);
1371 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1372 are in a list pointed to by VALS. */
1374 build_constructor_from_list (tree type
, tree vals
)
1377 VEC(constructor_elt
,gc
) *v
= NULL
;
1381 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1382 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1383 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1386 return build_constructor (type
, v
);
1389 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1392 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1395 FIXED_VALUE_TYPE
*fp
;
1397 v
= make_node (FIXED_CST
);
1398 fp
= GGC_NEW (FIXED_VALUE_TYPE
);
1399 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1401 TREE_TYPE (v
) = type
;
1402 TREE_FIXED_CST_PTR (v
) = fp
;
1406 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1409 build_real (tree type
, REAL_VALUE_TYPE d
)
1412 REAL_VALUE_TYPE
*dp
;
1415 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1416 Consider doing it via real_convert now. */
1418 v
= make_node (REAL_CST
);
1419 dp
= GGC_NEW (REAL_VALUE_TYPE
);
1420 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1422 TREE_TYPE (v
) = type
;
1423 TREE_REAL_CST_PTR (v
) = dp
;
1424 TREE_OVERFLOW (v
) = overflow
;
1428 /* Return a new REAL_CST node whose type is TYPE
1429 and whose value is the integer value of the INTEGER_CST node I. */
1432 real_value_from_int_cst (const_tree type
, const_tree i
)
1436 /* Clear all bits of the real value type so that we can later do
1437 bitwise comparisons to see if two values are the same. */
1438 memset (&d
, 0, sizeof d
);
1440 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1441 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1442 TYPE_UNSIGNED (TREE_TYPE (i
)));
1446 /* Given a tree representing an integer constant I, return a tree
1447 representing the same value as a floating-point constant of type TYPE. */
1450 build_real_from_int_cst (tree type
, const_tree i
)
1453 int overflow
= TREE_OVERFLOW (i
);
1455 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1457 TREE_OVERFLOW (v
) |= overflow
;
1461 /* Return a newly constructed STRING_CST node whose value is
1462 the LEN characters at STR.
1463 The TREE_TYPE is not initialized. */
1466 build_string (int len
, const char *str
)
1471 /* Do not waste bytes provided by padding of struct tree_string. */
1472 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1474 #ifdef GATHER_STATISTICS
1475 tree_node_counts
[(int) c_kind
]++;
1476 tree_node_sizes
[(int) c_kind
] += length
;
1479 s
= ggc_alloc_tree (length
);
1481 memset (s
, 0, sizeof (struct tree_common
));
1482 TREE_SET_CODE (s
, STRING_CST
);
1483 TREE_CONSTANT (s
) = 1;
1484 TREE_STRING_LENGTH (s
) = len
;
1485 memcpy (s
->string
.str
, str
, len
);
1486 s
->string
.str
[len
] = '\0';
1491 /* Return a newly constructed COMPLEX_CST node whose value is
1492 specified by the real and imaginary parts REAL and IMAG.
1493 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1494 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1497 build_complex (tree type
, tree real
, tree imag
)
1499 tree t
= make_node (COMPLEX_CST
);
1501 TREE_REALPART (t
) = real
;
1502 TREE_IMAGPART (t
) = imag
;
1503 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1504 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1508 /* Return a constant of arithmetic type TYPE which is the
1509 multiplicative identity of the set TYPE. */
1512 build_one_cst (tree type
)
1514 switch (TREE_CODE (type
))
1516 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1517 case POINTER_TYPE
: case REFERENCE_TYPE
:
1519 return build_int_cst (type
, 1);
1522 return build_real (type
, dconst1
);
1524 case FIXED_POINT_TYPE
:
1525 /* We can only generate 1 for accum types. */
1526 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1527 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1534 scalar
= build_one_cst (TREE_TYPE (type
));
1536 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1538 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1539 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1541 return build_vector (type
, cst
);
1545 return build_complex (type
,
1546 build_one_cst (TREE_TYPE (type
)),
1547 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1554 /* Build a BINFO with LEN language slots. */
1557 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1560 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1561 + VEC_embedded_size (tree
, base_binfos
));
1563 #ifdef GATHER_STATISTICS
1564 tree_node_counts
[(int) binfo_kind
]++;
1565 tree_node_sizes
[(int) binfo_kind
] += length
;
1568 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1570 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1572 TREE_SET_CODE (t
, TREE_BINFO
);
1574 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1580 /* Build a newly constructed TREE_VEC node of length LEN. */
1583 make_tree_vec_stat (int len MEM_STAT_DECL
)
1586 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1588 #ifdef GATHER_STATISTICS
1589 tree_node_counts
[(int) vec_kind
]++;
1590 tree_node_sizes
[(int) vec_kind
] += length
;
1593 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1595 memset (t
, 0, length
);
1597 TREE_SET_CODE (t
, TREE_VEC
);
1598 TREE_VEC_LENGTH (t
) = len
;
1603 /* Return 1 if EXPR is the integer constant zero or a complex constant
1607 integer_zerop (const_tree expr
)
1611 return ((TREE_CODE (expr
) == INTEGER_CST
1612 && TREE_INT_CST_LOW (expr
) == 0
1613 && TREE_INT_CST_HIGH (expr
) == 0)
1614 || (TREE_CODE (expr
) == COMPLEX_CST
1615 && integer_zerop (TREE_REALPART (expr
))
1616 && integer_zerop (TREE_IMAGPART (expr
))));
1619 /* Return 1 if EXPR is the integer constant one or the corresponding
1620 complex constant. */
1623 integer_onep (const_tree expr
)
1627 return ((TREE_CODE (expr
) == INTEGER_CST
1628 && TREE_INT_CST_LOW (expr
) == 1
1629 && TREE_INT_CST_HIGH (expr
) == 0)
1630 || (TREE_CODE (expr
) == COMPLEX_CST
1631 && integer_onep (TREE_REALPART (expr
))
1632 && integer_zerop (TREE_IMAGPART (expr
))));
1635 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1636 it contains. Likewise for the corresponding complex constant. */
1639 integer_all_onesp (const_tree expr
)
1646 if (TREE_CODE (expr
) == COMPLEX_CST
1647 && integer_all_onesp (TREE_REALPART (expr
))
1648 && integer_zerop (TREE_IMAGPART (expr
)))
1651 else if (TREE_CODE (expr
) != INTEGER_CST
)
1654 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1655 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1656 && TREE_INT_CST_HIGH (expr
) == -1)
1661 /* Note that using TYPE_PRECISION here is wrong. We care about the
1662 actual bits, not the (arbitrary) range of the type. */
1663 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1664 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1666 HOST_WIDE_INT high_value
;
1669 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1671 /* Can not handle precisions greater than twice the host int size. */
1672 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1673 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1674 /* Shifting by the host word size is undefined according to the ANSI
1675 standard, so we must handle this as a special case. */
1678 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1680 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1681 && TREE_INT_CST_HIGH (expr
) == high_value
);
1684 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1687 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1691 integer_pow2p (const_tree expr
)
1694 HOST_WIDE_INT high
, low
;
1698 if (TREE_CODE (expr
) == COMPLEX_CST
1699 && integer_pow2p (TREE_REALPART (expr
))
1700 && integer_zerop (TREE_IMAGPART (expr
)))
1703 if (TREE_CODE (expr
) != INTEGER_CST
)
1706 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1707 high
= TREE_INT_CST_HIGH (expr
);
1708 low
= TREE_INT_CST_LOW (expr
);
1710 /* First clear all bits that are beyond the type's precision in case
1711 we've been sign extended. */
1713 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1715 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1716 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1720 if (prec
< HOST_BITS_PER_WIDE_INT
)
1721 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1724 if (high
== 0 && low
== 0)
1727 return ((high
== 0 && (low
& (low
- 1)) == 0)
1728 || (low
== 0 && (high
& (high
- 1)) == 0));
1731 /* Return 1 if EXPR is an integer constant other than zero or a
1732 complex constant other than zero. */
1735 integer_nonzerop (const_tree expr
)
1739 return ((TREE_CODE (expr
) == INTEGER_CST
1740 && (TREE_INT_CST_LOW (expr
) != 0
1741 || TREE_INT_CST_HIGH (expr
) != 0))
1742 || (TREE_CODE (expr
) == COMPLEX_CST
1743 && (integer_nonzerop (TREE_REALPART (expr
))
1744 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1747 /* Return 1 if EXPR is the fixed-point constant zero. */
1750 fixed_zerop (const_tree expr
)
1752 return (TREE_CODE (expr
) == FIXED_CST
1753 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1756 /* Return the power of two represented by a tree node known to be a
1760 tree_log2 (const_tree expr
)
1763 HOST_WIDE_INT high
, low
;
1767 if (TREE_CODE (expr
) == COMPLEX_CST
)
1768 return tree_log2 (TREE_REALPART (expr
));
1770 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1771 high
= TREE_INT_CST_HIGH (expr
);
1772 low
= TREE_INT_CST_LOW (expr
);
1774 /* First clear all bits that are beyond the type's precision in case
1775 we've been sign extended. */
1777 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1779 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1780 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1784 if (prec
< HOST_BITS_PER_WIDE_INT
)
1785 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1788 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1789 : exact_log2 (low
));
1792 /* Similar, but return the largest integer Y such that 2 ** Y is less
1793 than or equal to EXPR. */
1796 tree_floor_log2 (const_tree expr
)
1799 HOST_WIDE_INT high
, low
;
1803 if (TREE_CODE (expr
) == COMPLEX_CST
)
1804 return tree_log2 (TREE_REALPART (expr
));
1806 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1807 high
= TREE_INT_CST_HIGH (expr
);
1808 low
= TREE_INT_CST_LOW (expr
);
1810 /* First clear all bits that are beyond the type's precision in case
1811 we've been sign extended. Ignore if type's precision hasn't been set
1812 since what we are doing is setting it. */
1814 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1816 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1817 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1821 if (prec
< HOST_BITS_PER_WIDE_INT
)
1822 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1825 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1826 : floor_log2 (low
));
1829 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1830 decimal float constants, so don't return 1 for them. */
1833 real_zerop (const_tree expr
)
1837 return ((TREE_CODE (expr
) == REAL_CST
1838 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1839 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1840 || (TREE_CODE (expr
) == COMPLEX_CST
1841 && real_zerop (TREE_REALPART (expr
))
1842 && real_zerop (TREE_IMAGPART (expr
))));
1845 /* Return 1 if EXPR is the real constant one in real or complex form.
1846 Trailing zeroes matter for decimal float constants, so don't return
1850 real_onep (const_tree expr
)
1854 return ((TREE_CODE (expr
) == REAL_CST
1855 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1856 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1857 || (TREE_CODE (expr
) == COMPLEX_CST
1858 && real_onep (TREE_REALPART (expr
))
1859 && real_zerop (TREE_IMAGPART (expr
))));
1862 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1863 for decimal float constants, so don't return 1 for them. */
1866 real_twop (const_tree expr
)
1870 return ((TREE_CODE (expr
) == REAL_CST
1871 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1872 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1873 || (TREE_CODE (expr
) == COMPLEX_CST
1874 && real_twop (TREE_REALPART (expr
))
1875 && real_zerop (TREE_IMAGPART (expr
))));
1878 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1879 matter for decimal float constants, so don't return 1 for them. */
1882 real_minus_onep (const_tree expr
)
1886 return ((TREE_CODE (expr
) == REAL_CST
1887 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
1888 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1889 || (TREE_CODE (expr
) == COMPLEX_CST
1890 && real_minus_onep (TREE_REALPART (expr
))
1891 && real_zerop (TREE_IMAGPART (expr
))));
1894 /* Nonzero if EXP is a constant or a cast of a constant. */
1897 really_constant_p (const_tree exp
)
1899 /* This is not quite the same as STRIP_NOPS. It does more. */
1900 while (CONVERT_EXPR_P (exp
)
1901 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1902 exp
= TREE_OPERAND (exp
, 0);
1903 return TREE_CONSTANT (exp
);
1906 /* Return first list element whose TREE_VALUE is ELEM.
1907 Return 0 if ELEM is not in LIST. */
1910 value_member (tree elem
, tree list
)
1914 if (elem
== TREE_VALUE (list
))
1916 list
= TREE_CHAIN (list
);
1921 /* Return first list element whose TREE_PURPOSE is ELEM.
1922 Return 0 if ELEM is not in LIST. */
1925 purpose_member (const_tree elem
, tree list
)
1929 if (elem
== TREE_PURPOSE (list
))
1931 list
= TREE_CHAIN (list
);
1936 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1940 chain_index (int idx
, tree chain
)
1942 for (; chain
&& idx
> 0; --idx
)
1943 chain
= TREE_CHAIN (chain
);
1947 /* Return nonzero if ELEM is part of the chain CHAIN. */
1950 chain_member (const_tree elem
, const_tree chain
)
1956 chain
= TREE_CHAIN (chain
);
1962 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1963 We expect a null pointer to mark the end of the chain.
1964 This is the Lisp primitive `length'. */
1967 list_length (const_tree t
)
1970 #ifdef ENABLE_TREE_CHECKING
1978 #ifdef ENABLE_TREE_CHECKING
1981 gcc_assert (p
!= q
);
1989 /* Returns the number of FIELD_DECLs in TYPE. */
1992 fields_length (const_tree type
)
1994 tree t
= TYPE_FIELDS (type
);
1997 for (; t
; t
= TREE_CHAIN (t
))
1998 if (TREE_CODE (t
) == FIELD_DECL
)
2004 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2005 UNION_TYPE TYPE, or NULL_TREE if none. */
2008 first_field (const_tree type
)
2010 tree t
= TYPE_FIELDS (type
);
2011 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2016 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2017 by modifying the last node in chain 1 to point to chain 2.
2018 This is the Lisp primitive `nconc'. */
2021 chainon (tree op1
, tree op2
)
2030 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2032 TREE_CHAIN (t1
) = op2
;
2034 #ifdef ENABLE_TREE_CHECKING
2037 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2038 gcc_assert (t2
!= t1
);
2045 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2048 tree_last (tree chain
)
2052 while ((next
= TREE_CHAIN (chain
)))
2057 /* Reverse the order of elements in the chain T,
2058 and return the new head of the chain (old last element). */
2063 tree prev
= 0, decl
, next
;
2064 for (decl
= t
; decl
; decl
= next
)
2066 next
= TREE_CHAIN (decl
);
2067 TREE_CHAIN (decl
) = prev
;
2073 /* Return a newly created TREE_LIST node whose
2074 purpose and value fields are PARM and VALUE. */
2077 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2079 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2080 TREE_PURPOSE (t
) = parm
;
2081 TREE_VALUE (t
) = value
;
2085 /* Build a chain of TREE_LIST nodes from a vector. */
2088 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2090 tree ret
= NULL_TREE
;
2094 for (i
= 0; VEC_iterate (tree
, vec
, i
, t
); ++i
)
2096 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2097 pp
= &TREE_CHAIN (*pp
);
2102 /* Return a newly created TREE_LIST node whose
2103 purpose and value fields are PURPOSE and VALUE
2104 and whose TREE_CHAIN is CHAIN. */
2107 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2111 node
= (tree
) ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
2113 memset (node
, 0, sizeof (struct tree_common
));
2115 #ifdef GATHER_STATISTICS
2116 tree_node_counts
[(int) x_kind
]++;
2117 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
2120 TREE_SET_CODE (node
, TREE_LIST
);
2121 TREE_CHAIN (node
) = chain
;
2122 TREE_PURPOSE (node
) = purpose
;
2123 TREE_VALUE (node
) = value
;
2127 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2130 ctor_to_list (tree ctor
)
2132 tree list
= NULL_TREE
;
2137 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), ix
, purpose
, val
)
2139 *p
= build_tree_list (purpose
, val
);
2140 p
= &TREE_CHAIN (*p
);
2146 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2150 ctor_to_vec (tree ctor
)
2152 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2156 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2157 VEC_quick_push (tree
, vec
, val
);
2162 /* Return the size nominally occupied by an object of type TYPE
2163 when it resides in memory. The value is measured in units of bytes,
2164 and its data type is that normally used for type sizes
2165 (which is the first type created by make_signed_type or
2166 make_unsigned_type). */
2169 size_in_bytes (const_tree type
)
2173 if (type
== error_mark_node
)
2174 return integer_zero_node
;
2176 type
= TYPE_MAIN_VARIANT (type
);
2177 t
= TYPE_SIZE_UNIT (type
);
2181 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2182 return size_zero_node
;
2188 /* Return the size of TYPE (in bytes) as a wide integer
2189 or return -1 if the size can vary or is larger than an integer. */
2192 int_size_in_bytes (const_tree type
)
2196 if (type
== error_mark_node
)
2199 type
= TYPE_MAIN_VARIANT (type
);
2200 t
= TYPE_SIZE_UNIT (type
);
2202 || TREE_CODE (t
) != INTEGER_CST
2203 || TREE_INT_CST_HIGH (t
) != 0
2204 /* If the result would appear negative, it's too big to represent. */
2205 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2208 return TREE_INT_CST_LOW (t
);
2211 /* Return the maximum size of TYPE (in bytes) as a wide integer
2212 or return -1 if the size can vary or is larger than an integer. */
2215 max_int_size_in_bytes (const_tree type
)
2217 HOST_WIDE_INT size
= -1;
2220 /* If this is an array type, check for a possible MAX_SIZE attached. */
2222 if (TREE_CODE (type
) == ARRAY_TYPE
)
2224 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2226 if (size_tree
&& host_integerp (size_tree
, 1))
2227 size
= tree_low_cst (size_tree
, 1);
2230 /* If we still haven't been able to get a size, see if the language
2231 can compute a maximum size. */
2235 size_tree
= lang_hooks
.types
.max_size (type
);
2237 if (size_tree
&& host_integerp (size_tree
, 1))
2238 size
= tree_low_cst (size_tree
, 1);
2244 /* Returns a tree for the size of EXP in bytes. */
2247 tree_expr_size (const_tree exp
)
2250 && DECL_SIZE_UNIT (exp
) != 0)
2251 return DECL_SIZE_UNIT (exp
);
2253 return size_in_bytes (TREE_TYPE (exp
));
2256 /* Return the bit position of FIELD, in bits from the start of the record.
2257 This is a tree of type bitsizetype. */
2260 bit_position (const_tree field
)
2262 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2263 DECL_FIELD_BIT_OFFSET (field
));
2266 /* Likewise, but return as an integer. It must be representable in
2267 that way (since it could be a signed value, we don't have the
2268 option of returning -1 like int_size_in_byte can. */
2271 int_bit_position (const_tree field
)
2273 return tree_low_cst (bit_position (field
), 0);
2276 /* Return the byte position of FIELD, in bytes from the start of the record.
2277 This is a tree of type sizetype. */
2280 byte_position (const_tree field
)
2282 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2283 DECL_FIELD_BIT_OFFSET (field
));
2286 /* Likewise, but return as an integer. It must be representable in
2287 that way (since it could be a signed value, we don't have the
2288 option of returning -1 like int_size_in_byte can. */
2291 int_byte_position (const_tree field
)
2293 return tree_low_cst (byte_position (field
), 0);
2296 /* Return the strictest alignment, in bits, that T is known to have. */
2299 expr_align (const_tree t
)
2301 unsigned int align0
, align1
;
2303 switch (TREE_CODE (t
))
2305 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2306 /* If we have conversions, we know that the alignment of the
2307 object must meet each of the alignments of the types. */
2308 align0
= expr_align (TREE_OPERAND (t
, 0));
2309 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2310 return MAX (align0
, align1
);
2312 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2313 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2314 case CLEANUP_POINT_EXPR
:
2315 /* These don't change the alignment of an object. */
2316 return expr_align (TREE_OPERAND (t
, 0));
2319 /* The best we can do is say that the alignment is the least aligned
2321 align0
= expr_align (TREE_OPERAND (t
, 1));
2322 align1
= expr_align (TREE_OPERAND (t
, 2));
2323 return MIN (align0
, align1
);
2325 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2326 meaningfully, it's always 1. */
2327 case LABEL_DECL
: case CONST_DECL
:
2328 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2330 gcc_assert (DECL_ALIGN (t
) != 0);
2331 return DECL_ALIGN (t
);
2337 /* Otherwise take the alignment from that of the type. */
2338 return TYPE_ALIGN (TREE_TYPE (t
));
2341 /* Return, as a tree node, the number of elements for TYPE (which is an
2342 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2345 array_type_nelts (const_tree type
)
2347 tree index_type
, min
, max
;
2349 /* If they did it with unspecified bounds, then we should have already
2350 given an error about it before we got here. */
2351 if (! TYPE_DOMAIN (type
))
2352 return error_mark_node
;
2354 index_type
= TYPE_DOMAIN (type
);
2355 min
= TYPE_MIN_VALUE (index_type
);
2356 max
= TYPE_MAX_VALUE (index_type
);
2358 return (integer_zerop (min
)
2360 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2363 /* If arg is static -- a reference to an object in static storage -- then
2364 return the object. This is not the same as the C meaning of `static'.
2365 If arg isn't static, return NULL. */
2370 switch (TREE_CODE (arg
))
2373 /* Nested functions are static, even though taking their address will
2374 involve a trampoline as we unnest the nested function and create
2375 the trampoline on the tree level. */
2379 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2380 && ! DECL_THREAD_LOCAL_P (arg
)
2381 && ! DECL_DLLIMPORT_P (arg
)
2385 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2389 return TREE_STATIC (arg
) ? arg
: NULL
;
2396 /* If the thing being referenced is not a field, then it is
2397 something language specific. */
2398 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2400 /* If we are referencing a bitfield, we can't evaluate an
2401 ADDR_EXPR at compile time and so it isn't a constant. */
2402 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2405 return staticp (TREE_OPERAND (arg
, 0));
2410 case MISALIGNED_INDIRECT_REF
:
2411 case ALIGN_INDIRECT_REF
:
2413 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2416 case ARRAY_RANGE_REF
:
2417 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2418 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2419 return staticp (TREE_OPERAND (arg
, 0));
2423 case COMPOUND_LITERAL_EXPR
:
2424 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2434 /* Return whether OP is a DECL whose address is function-invariant. */
2437 decl_address_invariant_p (const_tree op
)
2439 /* The conditions below are slightly less strict than the one in
2442 switch (TREE_CODE (op
))
2451 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2452 && !DECL_DLLIMPORT_P (op
))
2453 || DECL_THREAD_LOCAL_P (op
)
2454 || DECL_CONTEXT (op
) == current_function_decl
2455 || decl_function_context (op
) == current_function_decl
)
2460 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2461 || decl_function_context (op
) == current_function_decl
)
2472 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2475 decl_address_ip_invariant_p (const_tree op
)
2477 /* The conditions below are slightly less strict than the one in
2480 switch (TREE_CODE (op
))
2488 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2489 && !DECL_DLLIMPORT_P (op
))
2490 || DECL_THREAD_LOCAL_P (op
))
2495 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2507 /* Return true if T is function-invariant (internal function, does
2508 not handle arithmetic; that's handled in skip_simple_arithmetic and
2509 tree_invariant_p). */
2511 static bool tree_invariant_p (tree t
);
2514 tree_invariant_p_1 (tree t
)
2518 if (TREE_CONSTANT (t
)
2519 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2522 switch (TREE_CODE (t
))
2528 op
= TREE_OPERAND (t
, 0);
2529 while (handled_component_p (op
))
2531 switch (TREE_CODE (op
))
2534 case ARRAY_RANGE_REF
:
2535 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2536 || TREE_OPERAND (op
, 2) != NULL_TREE
2537 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2542 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2548 op
= TREE_OPERAND (op
, 0);
2551 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2560 /* Return true if T is function-invariant. */
2563 tree_invariant_p (tree t
)
2565 tree inner
= skip_simple_arithmetic (t
);
2566 return tree_invariant_p_1 (inner
);
2569 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2570 Do this to any expression which may be used in more than one place,
2571 but must be evaluated only once.
2573 Normally, expand_expr would reevaluate the expression each time.
2574 Calling save_expr produces something that is evaluated and recorded
2575 the first time expand_expr is called on it. Subsequent calls to
2576 expand_expr just reuse the recorded value.
2578 The call to expand_expr that generates code that actually computes
2579 the value is the first call *at compile time*. Subsequent calls
2580 *at compile time* generate code to use the saved value.
2581 This produces correct result provided that *at run time* control
2582 always flows through the insns made by the first expand_expr
2583 before reaching the other places where the save_expr was evaluated.
2584 You, the caller of save_expr, must make sure this is so.
2586 Constants, and certain read-only nodes, are returned with no
2587 SAVE_EXPR because that is safe. Expressions containing placeholders
2588 are not touched; see tree.def for an explanation of what these
2592 save_expr (tree expr
)
2594 tree t
= fold (expr
);
2597 /* If the tree evaluates to a constant, then we don't want to hide that
2598 fact (i.e. this allows further folding, and direct checks for constants).
2599 However, a read-only object that has side effects cannot be bypassed.
2600 Since it is no problem to reevaluate literals, we just return the
2602 inner
= skip_simple_arithmetic (t
);
2603 if (TREE_CODE (inner
) == ERROR_MARK
)
2606 if (tree_invariant_p_1 (inner
))
2609 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2610 it means that the size or offset of some field of an object depends on
2611 the value within another field.
2613 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2614 and some variable since it would then need to be both evaluated once and
2615 evaluated more than once. Front-ends must assure this case cannot
2616 happen by surrounding any such subexpressions in their own SAVE_EXPR
2617 and forcing evaluation at the proper time. */
2618 if (contains_placeholder_p (inner
))
2621 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2622 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2624 /* This expression might be placed ahead of a jump to ensure that the
2625 value was computed on both sides of the jump. So make sure it isn't
2626 eliminated as dead. */
2627 TREE_SIDE_EFFECTS (t
) = 1;
2631 /* Look inside EXPR and into any simple arithmetic operations. Return
2632 the innermost non-arithmetic node. */
2635 skip_simple_arithmetic (tree expr
)
2639 /* We don't care about whether this can be used as an lvalue in this
2641 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2642 expr
= TREE_OPERAND (expr
, 0);
2644 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2645 a constant, it will be more efficient to not make another SAVE_EXPR since
2646 it will allow better simplification and GCSE will be able to merge the
2647 computations if they actually occur. */
2651 if (UNARY_CLASS_P (inner
))
2652 inner
= TREE_OPERAND (inner
, 0);
2653 else if (BINARY_CLASS_P (inner
))
2655 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2656 inner
= TREE_OPERAND (inner
, 0);
2657 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2658 inner
= TREE_OPERAND (inner
, 1);
2670 /* Return which tree structure is used by T. */
2672 enum tree_node_structure_enum
2673 tree_node_structure (const_tree t
)
2675 const enum tree_code code
= TREE_CODE (t
);
2676 return tree_node_structure_for_code (code
);
2679 /* Set various status flags when building a CALL_EXPR object T. */
2682 process_call_operands (tree t
)
2684 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2685 bool read_only
= false;
2686 int i
= call_expr_flags (t
);
2688 /* Calls have side-effects, except those to const or pure functions. */
2689 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2690 side_effects
= true;
2691 /* Propagate TREE_READONLY of arguments for const functions. */
2695 if (!side_effects
|| read_only
)
2696 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2698 tree op
= TREE_OPERAND (t
, i
);
2699 if (op
&& TREE_SIDE_EFFECTS (op
))
2700 side_effects
= true;
2701 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2705 TREE_SIDE_EFFECTS (t
) = side_effects
;
2706 TREE_READONLY (t
) = read_only
;
2709 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2710 or offset that depends on a field within a record. */
2713 contains_placeholder_p (const_tree exp
)
2715 enum tree_code code
;
2720 code
= TREE_CODE (exp
);
2721 if (code
== PLACEHOLDER_EXPR
)
2724 switch (TREE_CODE_CLASS (code
))
2727 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2728 position computations since they will be converted into a
2729 WITH_RECORD_EXPR involving the reference, which will assume
2730 here will be valid. */
2731 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2733 case tcc_exceptional
:
2734 if (code
== TREE_LIST
)
2735 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2736 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2741 case tcc_comparison
:
2742 case tcc_expression
:
2746 /* Ignoring the first operand isn't quite right, but works best. */
2747 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2750 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2751 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2752 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2755 /* The save_expr function never wraps anything containing
2756 a PLACEHOLDER_EXPR. */
2763 switch (TREE_CODE_LENGTH (code
))
2766 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2768 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2769 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2780 const_call_expr_arg_iterator iter
;
2781 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2782 if (CONTAINS_PLACEHOLDER_P (arg
))
2796 /* Return true if any part of the computation of TYPE involves a
2797 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2798 (for QUAL_UNION_TYPE) and field positions. */
2801 type_contains_placeholder_1 (const_tree type
)
2803 /* If the size contains a placeholder or the parent type (component type in
2804 the case of arrays) type involves a placeholder, this type does. */
2805 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2806 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2807 || (TREE_TYPE (type
) != 0
2808 && type_contains_placeholder_p (TREE_TYPE (type
))))
2811 /* Now do type-specific checks. Note that the last part of the check above
2812 greatly limits what we have to do below. */
2813 switch (TREE_CODE (type
))
2821 case REFERENCE_TYPE
:
2829 case FIXED_POINT_TYPE
:
2830 /* Here we just check the bounds. */
2831 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2832 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2835 /* We're already checked the component type (TREE_TYPE), so just check
2837 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2841 case QUAL_UNION_TYPE
:
2845 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2846 if (TREE_CODE (field
) == FIELD_DECL
2847 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2848 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2849 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2850 || type_contains_placeholder_p (TREE_TYPE (field
))))
2862 type_contains_placeholder_p (tree type
)
2866 /* If the contains_placeholder_bits field has been initialized,
2867 then we know the answer. */
2868 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2869 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2871 /* Indicate that we've seen this type node, and the answer is false.
2872 This is what we want to return if we run into recursion via fields. */
2873 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2875 /* Compute the real value. */
2876 result
= type_contains_placeholder_1 (type
);
2878 /* Store the real value. */
2879 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2884 /* Push tree EXP onto vector QUEUE if it is not already present. */
2887 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2892 for (i
= 0; VEC_iterate (tree
, *queue
, i
, iter
); i
++)
2893 if (simple_cst_equal (iter
, exp
) == 1)
2897 VEC_safe_push (tree
, heap
, *queue
, exp
);
2900 /* Given a tree EXP, find all occurences of references to fields
2901 in a PLACEHOLDER_EXPR and place them in vector REFS without
2902 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2903 we assume here that EXP contains only arithmetic expressions
2904 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2908 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
2910 enum tree_code code
= TREE_CODE (exp
);
2914 /* We handle TREE_LIST and COMPONENT_REF separately. */
2915 if (code
== TREE_LIST
)
2917 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
2918 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
2920 else if (code
== COMPONENT_REF
)
2922 for (inner
= TREE_OPERAND (exp
, 0);
2923 REFERENCE_CLASS_P (inner
);
2924 inner
= TREE_OPERAND (inner
, 0))
2927 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
2928 push_without_duplicates (exp
, refs
);
2930 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
2933 switch (TREE_CODE_CLASS (code
))
2938 case tcc_declaration
:
2939 /* Variables allocated to static storage can stay. */
2940 if (!TREE_STATIC (exp
))
2941 push_without_duplicates (exp
, refs
);
2944 case tcc_expression
:
2945 /* This is the pattern built in ada/make_aligning_type. */
2946 if (code
== ADDR_EXPR
2947 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
2949 push_without_duplicates (exp
, refs
);
2953 /* Fall through... */
2955 case tcc_exceptional
:
2958 case tcc_comparison
:
2960 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
2961 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2965 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2966 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2974 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2975 return a tree with all occurrences of references to F in a
2976 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2977 CONST_DECLs. Note that we assume here that EXP contains only
2978 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2979 occurring only in their argument list. */
2982 substitute_in_expr (tree exp
, tree f
, tree r
)
2984 enum tree_code code
= TREE_CODE (exp
);
2985 tree op0
, op1
, op2
, op3
;
2988 /* We handle TREE_LIST and COMPONENT_REF separately. */
2989 if (code
== TREE_LIST
)
2991 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2992 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2993 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2996 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2998 else if (code
== COMPONENT_REF
)
3002 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3003 and it is the right field, replace it with R. */
3004 for (inner
= TREE_OPERAND (exp
, 0);
3005 REFERENCE_CLASS_P (inner
);
3006 inner
= TREE_OPERAND (inner
, 0))
3010 op1
= TREE_OPERAND (exp
, 1);
3012 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3015 /* If this expression hasn't been completed let, leave it alone. */
3016 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3019 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3020 if (op0
== TREE_OPERAND (exp
, 0))
3024 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3027 switch (TREE_CODE_CLASS (code
))
3032 case tcc_declaration
:
3038 case tcc_expression
:
3042 /* Fall through... */
3044 case tcc_exceptional
:
3047 case tcc_comparison
:
3049 switch (TREE_CODE_LENGTH (code
))
3055 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3056 if (op0
== TREE_OPERAND (exp
, 0))
3059 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3063 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3064 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3066 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3069 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3073 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3074 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3075 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3077 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3078 && op2
== TREE_OPERAND (exp
, 2))
3081 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3085 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3086 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3087 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3088 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3090 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3091 && op2
== TREE_OPERAND (exp
, 2)
3092 && op3
== TREE_OPERAND (exp
, 3))
3096 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3108 new_tree
= NULL_TREE
;
3110 /* If we are trying to replace F with a constant, inline back
3111 functions which do nothing else than computing a value from
3112 the arguments they are passed. This makes it possible to
3113 fold partially or entirely the replacement expression. */
3114 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3116 tree t
= maybe_inline_call_in_expr (exp
);
3118 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3121 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3123 tree op
= TREE_OPERAND (exp
, i
);
3124 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3128 new_tree
= copy_node (exp
);
3129 TREE_OPERAND (new_tree
, i
) = new_op
;
3135 new_tree
= fold (new_tree
);
3136 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3137 process_call_operands (new_tree
);
3148 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3152 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3153 for it within OBJ, a tree that is an object or a chain of references. */
3156 substitute_placeholder_in_expr (tree exp
, tree obj
)
3158 enum tree_code code
= TREE_CODE (exp
);
3159 tree op0
, op1
, op2
, op3
;
3162 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3163 in the chain of OBJ. */
3164 if (code
== PLACEHOLDER_EXPR
)
3166 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3169 for (elt
= obj
; elt
!= 0;
3170 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3171 || TREE_CODE (elt
) == COND_EXPR
)
3172 ? TREE_OPERAND (elt
, 1)
3173 : (REFERENCE_CLASS_P (elt
)
3174 || UNARY_CLASS_P (elt
)
3175 || BINARY_CLASS_P (elt
)
3176 || VL_EXP_CLASS_P (elt
)
3177 || EXPRESSION_CLASS_P (elt
))
3178 ? TREE_OPERAND (elt
, 0) : 0))
3179 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3182 for (elt
= obj
; elt
!= 0;
3183 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3184 || TREE_CODE (elt
) == COND_EXPR
)
3185 ? TREE_OPERAND (elt
, 1)
3186 : (REFERENCE_CLASS_P (elt
)
3187 || UNARY_CLASS_P (elt
)
3188 || BINARY_CLASS_P (elt
)
3189 || VL_EXP_CLASS_P (elt
)
3190 || EXPRESSION_CLASS_P (elt
))
3191 ? TREE_OPERAND (elt
, 0) : 0))
3192 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3193 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3195 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3197 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3198 survives until RTL generation, there will be an error. */
3202 /* TREE_LIST is special because we need to look at TREE_VALUE
3203 and TREE_CHAIN, not TREE_OPERANDS. */
3204 else if (code
== TREE_LIST
)
3206 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3207 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3208 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3211 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3214 switch (TREE_CODE_CLASS (code
))
3217 case tcc_declaration
:
3220 case tcc_exceptional
:
3223 case tcc_comparison
:
3224 case tcc_expression
:
3227 switch (TREE_CODE_LENGTH (code
))
3233 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3234 if (op0
== TREE_OPERAND (exp
, 0))
3237 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3241 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3242 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3244 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3247 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3251 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3252 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3253 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3255 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3256 && op2
== TREE_OPERAND (exp
, 2))
3259 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3263 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3264 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3265 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3266 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3268 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3269 && op2
== TREE_OPERAND (exp
, 2)
3270 && op3
== TREE_OPERAND (exp
, 3))
3274 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3286 new_tree
= NULL_TREE
;
3288 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3290 tree op
= TREE_OPERAND (exp
, i
);
3291 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3295 new_tree
= copy_node (exp
);
3296 TREE_OPERAND (new_tree
, i
) = new_op
;
3302 new_tree
= fold (new_tree
);
3303 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3304 process_call_operands (new_tree
);
3315 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3319 /* Stabilize a reference so that we can use it any number of times
3320 without causing its operands to be evaluated more than once.
3321 Returns the stabilized reference. This works by means of save_expr,
3322 so see the caveats in the comments about save_expr.
3324 Also allows conversion expressions whose operands are references.
3325 Any other kind of expression is returned unchanged. */
3328 stabilize_reference (tree ref
)
3331 enum tree_code code
= TREE_CODE (ref
);
3338 /* No action is needed in this case. */
3343 case FIX_TRUNC_EXPR
:
3344 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3348 result
= build_nt (INDIRECT_REF
,
3349 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3353 result
= build_nt (COMPONENT_REF
,
3354 stabilize_reference (TREE_OPERAND (ref
, 0)),
3355 TREE_OPERAND (ref
, 1), NULL_TREE
);
3359 result
= build_nt (BIT_FIELD_REF
,
3360 stabilize_reference (TREE_OPERAND (ref
, 0)),
3361 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3362 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3366 result
= build_nt (ARRAY_REF
,
3367 stabilize_reference (TREE_OPERAND (ref
, 0)),
3368 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3369 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3372 case ARRAY_RANGE_REF
:
3373 result
= build_nt (ARRAY_RANGE_REF
,
3374 stabilize_reference (TREE_OPERAND (ref
, 0)),
3375 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3376 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3380 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3381 it wouldn't be ignored. This matters when dealing with
3383 return stabilize_reference_1 (ref
);
3385 /* If arg isn't a kind of lvalue we recognize, make no change.
3386 Caller should recognize the error for an invalid lvalue. */
3391 return error_mark_node
;
3394 TREE_TYPE (result
) = TREE_TYPE (ref
);
3395 TREE_READONLY (result
) = TREE_READONLY (ref
);
3396 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3397 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3402 /* Subroutine of stabilize_reference; this is called for subtrees of
3403 references. Any expression with side-effects must be put in a SAVE_EXPR
3404 to ensure that it is only evaluated once.
3406 We don't put SAVE_EXPR nodes around everything, because assigning very
3407 simple expressions to temporaries causes us to miss good opportunities
3408 for optimizations. Among other things, the opportunity to fold in the
3409 addition of a constant into an addressing mode often gets lost, e.g.
3410 "y[i+1] += x;". In general, we take the approach that we should not make
3411 an assignment unless we are forced into it - i.e., that any non-side effect
3412 operator should be allowed, and that cse should take care of coalescing
3413 multiple utterances of the same expression should that prove fruitful. */
3416 stabilize_reference_1 (tree e
)
3419 enum tree_code code
= TREE_CODE (e
);
3421 /* We cannot ignore const expressions because it might be a reference
3422 to a const array but whose index contains side-effects. But we can
3423 ignore things that are actual constant or that already have been
3424 handled by this function. */
3426 if (tree_invariant_p (e
))
3429 switch (TREE_CODE_CLASS (code
))
3431 case tcc_exceptional
:
3433 case tcc_declaration
:
3434 case tcc_comparison
:
3436 case tcc_expression
:
3439 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3440 so that it will only be evaluated once. */
3441 /* The reference (r) and comparison (<) classes could be handled as
3442 below, but it is generally faster to only evaluate them once. */
3443 if (TREE_SIDE_EFFECTS (e
))
3444 return save_expr (e
);
3448 /* Constants need no processing. In fact, we should never reach
3453 /* Division is slow and tends to be compiled with jumps,
3454 especially the division by powers of 2 that is often
3455 found inside of an array reference. So do it just once. */
3456 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3457 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3458 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3459 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3460 return save_expr (e
);
3461 /* Recursively stabilize each operand. */
3462 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3463 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3467 /* Recursively stabilize each operand. */
3468 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3475 TREE_TYPE (result
) = TREE_TYPE (e
);
3476 TREE_READONLY (result
) = TREE_READONLY (e
);
3477 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3478 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3483 /* Low-level constructors for expressions. */
3485 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3486 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3489 recompute_tree_invariant_for_addr_expr (tree t
)
3492 bool tc
= true, se
= false;
3494 /* We started out assuming this address is both invariant and constant, but
3495 does not have side effects. Now go down any handled components and see if
3496 any of them involve offsets that are either non-constant or non-invariant.
3497 Also check for side-effects.
3499 ??? Note that this code makes no attempt to deal with the case where
3500 taking the address of something causes a copy due to misalignment. */
3502 #define UPDATE_FLAGS(NODE) \
3503 do { tree _node = (NODE); \
3504 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3505 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3507 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3508 node
= TREE_OPERAND (node
, 0))
3510 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3511 array reference (probably made temporarily by the G++ front end),
3512 so ignore all the operands. */
3513 if ((TREE_CODE (node
) == ARRAY_REF
3514 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3515 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3517 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3518 if (TREE_OPERAND (node
, 2))
3519 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3520 if (TREE_OPERAND (node
, 3))
3521 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3523 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3524 FIELD_DECL, apparently. The G++ front end can put something else
3525 there, at least temporarily. */
3526 else if (TREE_CODE (node
) == COMPONENT_REF
3527 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3529 if (TREE_OPERAND (node
, 2))
3530 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3532 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3533 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3536 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3538 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3539 the address, since &(*a)->b is a form of addition. If it's a constant, the
3540 address is constant too. If it's a decl, its address is constant if the
3541 decl is static. Everything else is not constant and, furthermore,
3542 taking the address of a volatile variable is not volatile. */
3543 if (TREE_CODE (node
) == INDIRECT_REF
)
3544 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3545 else if (CONSTANT_CLASS_P (node
))
3547 else if (DECL_P (node
))
3548 tc
&= (staticp (node
) != NULL_TREE
);
3552 se
|= TREE_SIDE_EFFECTS (node
);
3556 TREE_CONSTANT (t
) = tc
;
3557 TREE_SIDE_EFFECTS (t
) = se
;
3561 /* Build an expression of code CODE, data type TYPE, and operands as
3562 specified. Expressions and reference nodes can be created this way.
3563 Constants, decls, types and misc nodes cannot be.
3565 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3566 enough for all extant tree codes. */
3569 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3573 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3575 t
= make_node_stat (code PASS_MEM_STAT
);
3582 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3584 int length
= sizeof (struct tree_exp
);
3585 #ifdef GATHER_STATISTICS
3586 tree_node_kind kind
;
3590 #ifdef GATHER_STATISTICS
3591 switch (TREE_CODE_CLASS (code
))
3593 case tcc_statement
: /* an expression with side effects */
3596 case tcc_reference
: /* a reference */
3604 tree_node_counts
[(int) kind
]++;
3605 tree_node_sizes
[(int) kind
] += length
;
3608 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3610 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
3612 memset (t
, 0, sizeof (struct tree_common
));
3614 TREE_SET_CODE (t
, code
);
3616 TREE_TYPE (t
) = type
;
3617 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3618 TREE_OPERAND (t
, 0) = node
;
3619 TREE_BLOCK (t
) = NULL_TREE
;
3620 if (node
&& !TYPE_P (node
))
3622 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3623 TREE_READONLY (t
) = TREE_READONLY (node
);
3626 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3627 TREE_SIDE_EFFECTS (t
) = 1;
3631 /* All of these have side-effects, no matter what their
3633 TREE_SIDE_EFFECTS (t
) = 1;
3634 TREE_READONLY (t
) = 0;
3637 case MISALIGNED_INDIRECT_REF
:
3638 case ALIGN_INDIRECT_REF
:
3640 /* Whether a dereference is readonly has nothing to do with whether
3641 its operand is readonly. */
3642 TREE_READONLY (t
) = 0;
3647 recompute_tree_invariant_for_addr_expr (t
);
3651 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3652 && node
&& !TYPE_P (node
)
3653 && TREE_CONSTANT (node
))
3654 TREE_CONSTANT (t
) = 1;
3655 if (TREE_CODE_CLASS (code
) == tcc_reference
3656 && node
&& TREE_THIS_VOLATILE (node
))
3657 TREE_THIS_VOLATILE (t
) = 1;
3664 #define PROCESS_ARG(N) \
3666 TREE_OPERAND (t, N) = arg##N; \
3667 if (arg##N &&!TYPE_P (arg##N)) \
3669 if (TREE_SIDE_EFFECTS (arg##N)) \
3671 if (!TREE_READONLY (arg##N) \
3672 && !CONSTANT_CLASS_P (arg##N)) \
3673 (void) (read_only = 0); \
3674 if (!TREE_CONSTANT (arg##N)) \
3675 (void) (constant = 0); \
3680 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3682 bool constant
, read_only
, side_effects
;
3685 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3687 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3688 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3689 /* When sizetype precision doesn't match that of pointers
3690 we need to be able to build explicit extensions or truncations
3691 of the offset argument. */
3692 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3693 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3694 && TREE_CODE (arg1
) == INTEGER_CST
);
3696 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3697 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3698 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3699 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3701 t
= make_node_stat (code PASS_MEM_STAT
);
3704 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3705 result based on those same flags for the arguments. But if the
3706 arguments aren't really even `tree' expressions, we shouldn't be trying
3709 /* Expressions without side effects may be constant if their
3710 arguments are as well. */
3711 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3712 || TREE_CODE_CLASS (code
) == tcc_binary
);
3714 side_effects
= TREE_SIDE_EFFECTS (t
);
3719 TREE_READONLY (t
) = read_only
;
3720 TREE_CONSTANT (t
) = constant
;
3721 TREE_SIDE_EFFECTS (t
) = side_effects
;
3722 TREE_THIS_VOLATILE (t
)
3723 = (TREE_CODE_CLASS (code
) == tcc_reference
3724 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3731 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3732 tree arg2 MEM_STAT_DECL
)
3734 bool constant
, read_only
, side_effects
;
3737 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3738 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3740 t
= make_node_stat (code PASS_MEM_STAT
);
3745 /* As a special exception, if COND_EXPR has NULL branches, we
3746 assume that it is a gimple statement and always consider
3747 it to have side effects. */
3748 if (code
== COND_EXPR
3749 && tt
== void_type_node
3750 && arg1
== NULL_TREE
3751 && arg2
== NULL_TREE
)
3752 side_effects
= true;
3754 side_effects
= TREE_SIDE_EFFECTS (t
);
3760 if (code
== COND_EXPR
)
3761 TREE_READONLY (t
) = read_only
;
3763 TREE_SIDE_EFFECTS (t
) = side_effects
;
3764 TREE_THIS_VOLATILE (t
)
3765 = (TREE_CODE_CLASS (code
) == tcc_reference
3766 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3772 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3773 tree arg2
, tree arg3 MEM_STAT_DECL
)
3775 bool constant
, read_only
, side_effects
;
3778 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3780 t
= make_node_stat (code PASS_MEM_STAT
);
3783 side_effects
= TREE_SIDE_EFFECTS (t
);
3790 TREE_SIDE_EFFECTS (t
) = side_effects
;
3791 TREE_THIS_VOLATILE (t
)
3792 = (TREE_CODE_CLASS (code
) == tcc_reference
3793 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3799 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3800 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3802 bool constant
, read_only
, side_effects
;
3805 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3807 t
= make_node_stat (code PASS_MEM_STAT
);
3810 side_effects
= TREE_SIDE_EFFECTS (t
);
3818 TREE_SIDE_EFFECTS (t
) = side_effects
;
3819 TREE_THIS_VOLATILE (t
)
3820 = (TREE_CODE_CLASS (code
) == tcc_reference
3821 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3827 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3828 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3830 bool constant
, read_only
, side_effects
;
3833 gcc_assert (code
== TARGET_MEM_REF
);
3835 t
= make_node_stat (code PASS_MEM_STAT
);
3838 side_effects
= TREE_SIDE_EFFECTS (t
);
3845 if (code
== TARGET_MEM_REF
)
3849 TREE_SIDE_EFFECTS (t
) = side_effects
;
3850 TREE_THIS_VOLATILE (t
)
3851 = (code
== TARGET_MEM_REF
3852 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3857 /* Similar except don't specify the TREE_TYPE
3858 and leave the TREE_SIDE_EFFECTS as 0.
3859 It is permissible for arguments to be null,
3860 or even garbage if their values do not matter. */
3863 build_nt (enum tree_code code
, ...)
3870 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3874 t
= make_node (code
);
3875 length
= TREE_CODE_LENGTH (code
);
3877 for (i
= 0; i
< length
; i
++)
3878 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3884 /* Similar to build_nt, but for creating a CALL_EXPR object with
3885 ARGLIST passed as a list. */
3888 build_nt_call_list (tree fn
, tree arglist
)
3893 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
3894 CALL_EXPR_FN (t
) = fn
;
3895 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
3896 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
3897 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
3901 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3905 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
3910 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
3911 CALL_EXPR_FN (ret
) = fn
;
3912 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
3913 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
3914 CALL_EXPR_ARG (ret
, ix
) = t
;
3918 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3919 We do NOT enter this node in any sort of symbol table.
3921 LOC is the location of the decl.
3923 layout_decl is used to set up the decl's storage layout.
3924 Other slots are initialized to 0 or null pointers. */
3927 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
3928 tree type MEM_STAT_DECL
)
3932 t
= make_node_stat (code PASS_MEM_STAT
);
3933 DECL_SOURCE_LOCATION (t
) = loc
;
3935 /* if (type == error_mark_node)
3936 type = integer_type_node; */
3937 /* That is not done, deliberately, so that having error_mark_node
3938 as the type can suppress useless errors in the use of this variable. */
3940 DECL_NAME (t
) = name
;
3941 TREE_TYPE (t
) = type
;
3943 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3949 /* Builds and returns function declaration with NAME and TYPE. */
3952 build_fn_decl (const char *name
, tree type
)
3954 tree id
= get_identifier (name
);
3955 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
3957 DECL_EXTERNAL (decl
) = 1;
3958 TREE_PUBLIC (decl
) = 1;
3959 DECL_ARTIFICIAL (decl
) = 1;
3960 TREE_NOTHROW (decl
) = 1;
3966 /* BLOCK nodes are used to represent the structure of binding contours
3967 and declarations, once those contours have been exited and their contents
3968 compiled. This information is used for outputting debugging info. */
3971 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3973 tree block
= make_node (BLOCK
);
3975 BLOCK_VARS (block
) = vars
;
3976 BLOCK_SUBBLOCKS (block
) = subblocks
;
3977 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3978 BLOCK_CHAIN (block
) = chain
;
3983 expand_location (source_location loc
)
3985 expanded_location xloc
;
3986 if (loc
<= BUILTINS_LOCATION
)
3988 xloc
.file
= loc
== UNKNOWN_LOCATION
? NULL
: _("<built-in>");
3995 const struct line_map
*map
= linemap_lookup (line_table
, loc
);
3996 xloc
.file
= map
->to_file
;
3997 xloc
.line
= SOURCE_LINE (map
, loc
);
3998 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3999 xloc
.sysp
= map
->sysp
!= 0;
4005 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4007 LOC is the location to use in tree T. */
4010 protected_set_expr_location (tree t
, location_t loc
)
4012 if (t
&& CAN_HAVE_LOCATION_P (t
))
4013 SET_EXPR_LOCATION (t
, loc
);
4016 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4020 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4022 DECL_ATTRIBUTES (ddecl
) = attribute
;
4026 /* Borrowed from hashtab.c iterative_hash implementation. */
4027 #define mix(a,b,c) \
4029 a -= b; a -= c; a ^= (c>>13); \
4030 b -= c; b -= a; b ^= (a<< 8); \
4031 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4032 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4033 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4034 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4035 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4036 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4037 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4041 /* Produce good hash value combining VAL and VAL2. */
4043 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4045 /* the golden ratio; an arbitrary value. */
4046 hashval_t a
= 0x9e3779b9;
4052 /* Produce good hash value combining VAL and VAL2. */
4054 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4056 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4057 return iterative_hash_hashval_t (val
, val2
);
4060 hashval_t a
= (hashval_t
) val
;
4061 /* Avoid warnings about shifting of more than the width of the type on
4062 hosts that won't execute this path. */
4064 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4066 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4068 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4069 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4076 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4077 is ATTRIBUTE and its qualifiers are QUALS.
4079 Record such modified types already made so we don't make duplicates. */
4082 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4084 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4086 hashval_t hashcode
= 0;
4088 enum tree_code code
= TREE_CODE (ttype
);
4090 /* Building a distinct copy of a tagged type is inappropriate; it
4091 causes breakage in code that expects there to be a one-to-one
4092 relationship between a struct and its fields.
4093 build_duplicate_type is another solution (as used in
4094 handle_transparent_union_attribute), but that doesn't play well
4095 with the stronger C++ type identity model. */
4096 if (TREE_CODE (ttype
) == RECORD_TYPE
4097 || TREE_CODE (ttype
) == UNION_TYPE
4098 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4099 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4101 warning (OPT_Wattributes
,
4102 "ignoring attributes applied to %qT after definition",
4103 TYPE_MAIN_VARIANT (ttype
));
4104 return build_qualified_type (ttype
, quals
);
4107 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4108 ntype
= build_distinct_type_copy (ttype
);
4110 TYPE_ATTRIBUTES (ntype
) = attribute
;
4112 hashcode
= iterative_hash_object (code
, hashcode
);
4113 if (TREE_TYPE (ntype
))
4114 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4116 hashcode
= attribute_hash_list (attribute
, hashcode
);
4118 switch (TREE_CODE (ntype
))
4121 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4124 if (TYPE_DOMAIN (ntype
))
4125 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4129 hashcode
= iterative_hash_object
4130 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4131 hashcode
= iterative_hash_object
4132 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4135 case FIXED_POINT_TYPE
:
4137 unsigned int precision
= TYPE_PRECISION (ntype
);
4138 hashcode
= iterative_hash_object (precision
, hashcode
);
4145 ntype
= type_hash_canon (hashcode
, ntype
);
4147 /* If the target-dependent attributes make NTYPE different from
4148 its canonical type, we will need to use structural equality
4149 checks for this type. */
4150 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4151 || !targetm
.comp_type_attributes (ntype
, ttype
))
4152 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4153 else if (TYPE_CANONICAL (ntype
) == ntype
)
4154 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4156 ttype
= build_qualified_type (ntype
, quals
);
4158 else if (TYPE_QUALS (ttype
) != quals
)
4159 ttype
= build_qualified_type (ttype
, quals
);
4165 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4168 Record such modified types already made so we don't make duplicates. */
4171 build_type_attribute_variant (tree ttype
, tree attribute
)
4173 return build_type_attribute_qual_variant (ttype
, attribute
,
4174 TYPE_QUALS (ttype
));
4178 /* Reset the expression *EXPR_P, a size or position.
4180 ??? We could reset all non-constant sizes or positions. But it's cheap
4181 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4183 We need to reset self-referential sizes or positions because they cannot
4184 be gimplified and thus can contain a CALL_EXPR after the gimplification
4185 is finished, which will run afoul of LTO streaming. And they need to be
4186 reset to something essentially dummy but not constant, so as to preserve
4187 the properties of the object they are attached to. */
4190 free_lang_data_in_one_sizepos (tree
*expr_p
)
4192 tree expr
= *expr_p
;
4193 if (CONTAINS_PLACEHOLDER_P (expr
))
4194 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4198 /* Reset all the fields in a binfo node BINFO. We only keep
4199 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4202 free_lang_data_in_binfo (tree binfo
)
4207 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4209 BINFO_VTABLE (binfo
) = NULL_TREE
;
4210 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4211 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4212 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4214 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
); i
++)
4215 free_lang_data_in_binfo (t
);
4219 /* Reset all language specific information still present in TYPE. */
4222 free_lang_data_in_type (tree type
)
4224 gcc_assert (TYPE_P (type
));
4226 /* Give the FE a chance to remove its own data first. */
4227 lang_hooks
.free_lang_data (type
);
4229 TREE_LANG_FLAG_0 (type
) = 0;
4230 TREE_LANG_FLAG_1 (type
) = 0;
4231 TREE_LANG_FLAG_2 (type
) = 0;
4232 TREE_LANG_FLAG_3 (type
) = 0;
4233 TREE_LANG_FLAG_4 (type
) = 0;
4234 TREE_LANG_FLAG_5 (type
) = 0;
4235 TREE_LANG_FLAG_6 (type
) = 0;
4237 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4239 /* Remove the const and volatile qualifiers from arguments. The
4240 C++ front end removes them, but the C front end does not,
4241 leading to false ODR violation errors when merging two
4242 instances of the same function signature compiled by
4243 different front ends. */
4246 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4248 tree arg_type
= TREE_VALUE (p
);
4250 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4252 int quals
= TYPE_QUALS (arg_type
)
4254 & ~TYPE_QUAL_VOLATILE
;
4255 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4256 free_lang_data_in_type (TREE_VALUE (p
));
4261 /* Remove members that are not actually FIELD_DECLs from the field
4262 list of an aggregate. These occur in C++. */
4263 if (RECORD_OR_UNION_TYPE_P (type
))
4267 /* Note that TYPE_FIELDS can be shared across distinct
4268 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4269 to be removed, we cannot set its TREE_CHAIN to NULL.
4270 Otherwise, we would not be able to find all the other fields
4271 in the other instances of this TREE_TYPE.
4273 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4275 member
= TYPE_FIELDS (type
);
4278 if (TREE_CODE (member
) == FIELD_DECL
)
4281 TREE_CHAIN (prev
) = member
;
4283 TYPE_FIELDS (type
) = member
;
4287 member
= TREE_CHAIN (member
);
4291 TREE_CHAIN (prev
) = NULL_TREE
;
4293 TYPE_FIELDS (type
) = NULL_TREE
;
4295 TYPE_METHODS (type
) = NULL_TREE
;
4296 if (TYPE_BINFO (type
))
4297 free_lang_data_in_binfo (TYPE_BINFO (type
));
4301 /* For non-aggregate types, clear out the language slot (which
4302 overloads TYPE_BINFO). */
4303 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4305 if (INTEGRAL_TYPE_P (type
)
4306 || SCALAR_FLOAT_TYPE_P (type
)
4307 || FIXED_POINT_TYPE_P (type
))
4309 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4310 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4314 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4315 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4317 if (debug_info_level
< DINFO_LEVEL_TERSE
4318 || (TYPE_CONTEXT (type
)
4319 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4320 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4321 TYPE_CONTEXT (type
) = NULL_TREE
;
4323 if (debug_info_level
< DINFO_LEVEL_TERSE
)
4324 TYPE_STUB_DECL (type
) = NULL_TREE
;
4328 /* Return true if DECL may need an assembler name to be set. */
4331 need_assembler_name_p (tree decl
)
4333 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4334 if (TREE_CODE (decl
) != FUNCTION_DECL
4335 && TREE_CODE (decl
) != VAR_DECL
)
4338 /* If DECL already has its assembler name set, it does not need a
4340 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4341 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4344 /* Abstract decls do not need an assembler name. */
4345 if (DECL_ABSTRACT (decl
))
4348 /* For VAR_DECLs, only static, public and external symbols need an
4350 if (TREE_CODE (decl
) == VAR_DECL
4351 && !TREE_STATIC (decl
)
4352 && !TREE_PUBLIC (decl
)
4353 && !DECL_EXTERNAL (decl
))
4356 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4358 /* Do not set assembler name on builtins. Allow RTL expansion to
4359 decide whether to expand inline or via a regular call. */
4360 if (DECL_BUILT_IN (decl
)
4361 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4364 /* Functions represented in the callgraph need an assembler name. */
4365 if (cgraph_get_node (decl
) != NULL
)
4368 /* Unused and not public functions don't need an assembler name. */
4369 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4377 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4378 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4379 in BLOCK that is not in LOCALS is removed. */
4382 free_lang_data_in_block (tree fn
, tree block
, struct pointer_set_t
*locals
)
4386 tp
= &BLOCK_VARS (block
);
4389 if (!pointer_set_contains (locals
, *tp
))
4390 *tp
= TREE_CHAIN (*tp
);
4392 tp
= &TREE_CHAIN (*tp
);
4395 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4396 free_lang_data_in_block (fn
, t
, locals
);
4400 /* Reset all language specific information still present in symbol
4404 free_lang_data_in_decl (tree decl
)
4406 gcc_assert (DECL_P (decl
));
4408 /* Give the FE a chance to remove its own data first. */
4409 lang_hooks
.free_lang_data (decl
);
4411 TREE_LANG_FLAG_0 (decl
) = 0;
4412 TREE_LANG_FLAG_1 (decl
) = 0;
4413 TREE_LANG_FLAG_2 (decl
) = 0;
4414 TREE_LANG_FLAG_3 (decl
) = 0;
4415 TREE_LANG_FLAG_4 (decl
) = 0;
4416 TREE_LANG_FLAG_5 (decl
) = 0;
4417 TREE_LANG_FLAG_6 (decl
) = 0;
4419 /* Identifiers need not have a type. */
4420 if (DECL_NAME (decl
))
4421 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4423 /* Ignore any intervening types, because we are going to clear their
4424 TYPE_CONTEXT fields. */
4425 if (TREE_CODE (decl
) != FIELD_DECL
4426 && TREE_CODE (decl
) != FUNCTION_DECL
)
4427 DECL_CONTEXT (decl
) = decl_function_context (decl
);
4429 if (DECL_CONTEXT (decl
)
4430 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
)
4431 DECL_CONTEXT (decl
) = NULL_TREE
;
4433 if (TREE_CODE (decl
) == VAR_DECL
)
4435 tree context
= DECL_CONTEXT (decl
);
4439 enum tree_code code
= TREE_CODE (context
);
4440 if (code
== FUNCTION_DECL
&& DECL_ABSTRACT (context
))
4442 /* Do not clear the decl context here, that will promote
4443 all vars to global ones. */
4444 DECL_INITIAL (decl
) = NULL_TREE
;
4447 if (TREE_STATIC (decl
))
4448 DECL_CONTEXT (decl
) = NULL_TREE
;
4452 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4453 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4454 if (TREE_CODE (decl
) == FIELD_DECL
)
4455 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4457 /* DECL_FCONTEXT is only used for debug info generation. */
4458 if (TREE_CODE (decl
) == FIELD_DECL
4459 && debug_info_level
< DINFO_LEVEL_TERSE
)
4460 DECL_FCONTEXT (decl
) = NULL_TREE
;
4462 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4464 if (gimple_has_body_p (decl
))
4467 struct pointer_set_t
*locals
;
4469 /* If DECL has a gimple body, then the context for its
4470 arguments must be DECL. Otherwise, it doesn't really
4471 matter, as we will not be emitting any code for DECL. In
4472 general, there may be other instances of DECL created by
4473 the front end and since PARM_DECLs are generally shared,
4474 their DECL_CONTEXT changes as the replicas of DECL are
4475 created. The only time where DECL_CONTEXT is important
4476 is for the FUNCTION_DECLs that have a gimple body (since
4477 the PARM_DECL will be used in the function's body). */
4478 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4479 DECL_CONTEXT (t
) = decl
;
4481 /* Collect all the symbols declared in DECL. */
4482 locals
= pointer_set_create ();
4483 t
= DECL_STRUCT_FUNCTION (decl
)->local_decls
;
4484 for (; t
; t
= TREE_CHAIN (t
))
4486 pointer_set_insert (locals
, TREE_VALUE (t
));
4488 /* All the local symbols should have DECL as their
4490 DECL_CONTEXT (TREE_VALUE (t
)) = decl
;
4493 /* Get rid of any decl not in local_decls. */
4494 free_lang_data_in_block (decl
, DECL_INITIAL (decl
), locals
);
4496 pointer_set_destroy (locals
);
4499 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4500 At this point, it is not needed anymore. */
4501 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4503 else if (TREE_CODE (decl
) == VAR_DECL
)
4505 tree expr
= DECL_DEBUG_EXPR (decl
);
4507 && TREE_CODE (expr
) == VAR_DECL
4508 && !TREE_STATIC (expr
) && !DECL_EXTERNAL (expr
))
4509 SET_DECL_DEBUG_EXPR (decl
, NULL_TREE
);
4511 if (DECL_EXTERNAL (decl
)
4512 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4513 DECL_INITIAL (decl
) = NULL_TREE
;
4515 else if (TREE_CODE (decl
) == TYPE_DECL
)
4517 DECL_INITIAL (decl
) = NULL_TREE
;
4519 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4520 FIELD_DECLs, which should be preserved. Otherwise,
4521 we shouldn't be concerned with source-level lexical
4522 nesting beyond this point. */
4523 DECL_CONTEXT (decl
) = NULL_TREE
;
4528 /* Data used when collecting DECLs and TYPEs for language data removal. */
4530 struct free_lang_data_d
4532 /* Worklist to avoid excessive recursion. */
4533 VEC(tree
,heap
) *worklist
;
4535 /* Set of traversed objects. Used to avoid duplicate visits. */
4536 struct pointer_set_t
*pset
;
4538 /* Array of symbols to process with free_lang_data_in_decl. */
4539 VEC(tree
,heap
) *decls
;
4541 /* Array of types to process with free_lang_data_in_type. */
4542 VEC(tree
,heap
) *types
;
4546 /* Save all language fields needed to generate proper debug information
4547 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4550 save_debug_info_for_decl (tree t
)
4552 /*struct saved_debug_info_d *sdi;*/
4554 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4556 /* FIXME. Partial implementation for saving debug info removed. */
4560 /* Save all language fields needed to generate proper debug information
4561 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4564 save_debug_info_for_type (tree t
)
4566 /*struct saved_debug_info_d *sdi;*/
4568 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4570 /* FIXME. Partial implementation for saving debug info removed. */
4574 /* Add type or decl T to one of the list of tree nodes that need their
4575 language data removed. The lists are held inside FLD. */
4578 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4582 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4583 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4584 save_debug_info_for_decl (t
);
4586 else if (TYPE_P (t
))
4588 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4589 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4590 save_debug_info_for_type (t
);
4596 /* Push tree node T into FLD->WORKLIST. */
4599 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4601 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4602 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4606 /* Operand callback helper for free_lang_data_in_node. *TP is the
4607 subtree operand being considered. */
4610 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4613 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4615 if (TREE_CODE (t
) == TREE_LIST
)
4618 /* Language specific nodes will be removed, so there is no need
4619 to gather anything under them. */
4620 if (is_lang_specific (t
))
4628 /* Note that walk_tree does not traverse every possible field in
4629 decls, so we have to do our own traversals here. */
4630 add_tree_to_fld_list (t
, fld
);
4632 fld_worklist_push (DECL_NAME (t
), fld
);
4633 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4634 fld_worklist_push (DECL_SIZE (t
), fld
);
4635 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4637 /* We are going to remove everything under DECL_INITIAL for
4638 TYPE_DECLs. No point walking them. */
4639 if (TREE_CODE (t
) != TYPE_DECL
)
4640 fld_worklist_push (DECL_INITIAL (t
), fld
);
4642 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4643 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4645 if (TREE_CODE (t
) == FUNCTION_DECL
)
4647 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4648 fld_worklist_push (DECL_RESULT (t
), fld
);
4650 else if (TREE_CODE (t
) == TYPE_DECL
)
4652 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4653 fld_worklist_push (DECL_VINDEX (t
), fld
);
4655 else if (TREE_CODE (t
) == FIELD_DECL
)
4657 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4658 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4659 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4660 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4661 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4663 else if (TREE_CODE (t
) == VAR_DECL
)
4665 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4666 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4669 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4670 && DECL_HAS_VALUE_EXPR_P (t
))
4671 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4673 if (TREE_CODE (t
) != FIELD_DECL
)
4674 fld_worklist_push (TREE_CHAIN (t
), fld
);
4677 else if (TYPE_P (t
))
4679 /* Note that walk_tree does not traverse every possible field in
4680 types, so we have to do our own traversals here. */
4681 add_tree_to_fld_list (t
, fld
);
4683 if (!RECORD_OR_UNION_TYPE_P (t
))
4684 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4685 fld_worklist_push (TYPE_SIZE (t
), fld
);
4686 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4687 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4688 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4689 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4690 fld_worklist_push (TYPE_NAME (t
), fld
);
4691 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4692 if (!RECORD_OR_UNION_TYPE_P (t
))
4693 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4694 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4695 fld_worklist_push (TYPE_NEXT_VARIANT (t
), fld
);
4696 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4697 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
4699 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4703 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4705 fld_worklist_push (TREE_TYPE (tem
), fld
);
4706 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4708 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4709 && TREE_CODE (tem
) == TREE_LIST
)
4712 fld_worklist_push (TREE_VALUE (tem
), fld
);
4713 tem
= TREE_CHAIN (tem
);
4717 if (RECORD_OR_UNION_TYPE_P (t
))
4720 /* Push all TYPE_FIELDS - there can be interleaving interesting
4721 and non-interesting things. */
4722 tem
= TYPE_FIELDS (t
);
4725 if (TREE_CODE (tem
) == FIELD_DECL
)
4726 fld_worklist_push (tem
, fld
);
4727 tem
= TREE_CHAIN (tem
);
4731 fld_worklist_push (TREE_CHAIN (t
), fld
);
4735 fld_worklist_push (TREE_TYPE (t
), fld
);
4741 /* Find decls and types in T. */
4744 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4748 if (!pointer_set_contains (fld
->pset
, t
))
4749 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4750 if (VEC_empty (tree
, fld
->worklist
))
4752 t
= VEC_pop (tree
, fld
->worklist
);
4756 /* Translate all the types in LIST with the corresponding runtime
4760 get_eh_types_for_runtime (tree list
)
4764 if (list
== NULL_TREE
)
4767 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4769 list
= TREE_CHAIN (list
);
4772 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4773 TREE_CHAIN (prev
) = n
;
4774 prev
= TREE_CHAIN (prev
);
4775 list
= TREE_CHAIN (list
);
4782 /* Find decls and types referenced in EH region R and store them in
4783 FLD->DECLS and FLD->TYPES. */
4786 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4797 /* The types referenced in each catch must first be changed to the
4798 EH types used at runtime. This removes references to FE types
4800 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4802 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4803 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4808 case ERT_ALLOWED_EXCEPTIONS
:
4809 r
->u
.allowed
.type_list
4810 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4811 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4814 case ERT_MUST_NOT_THROW
:
4815 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4816 find_decls_types_r
, fld
, fld
->pset
);
4822 /* Find decls and types referenced in cgraph node N and store them in
4823 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4824 look for *every* kind of DECL and TYPE node reachable from N,
4825 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4826 NAMESPACE_DECLs, etc). */
4829 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4832 struct function
*fn
;
4835 find_decls_types (n
->decl
, fld
);
4837 if (!gimple_has_body_p (n
->decl
))
4840 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
4842 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
4844 /* Traverse locals. */
4845 for (t
= fn
->local_decls
; t
; t
= TREE_CHAIN (t
))
4846 find_decls_types (TREE_VALUE (t
), fld
);
4848 /* Traverse EH regions in FN. */
4851 FOR_ALL_EH_REGION_FN (r
, fn
)
4852 find_decls_types_in_eh_region (r
, fld
);
4855 /* Traverse every statement in FN. */
4856 FOR_EACH_BB_FN (bb
, fn
)
4858 gimple_stmt_iterator si
;
4861 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
4863 gimple phi
= gsi_stmt (si
);
4865 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4867 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
4868 find_decls_types (*arg_p
, fld
);
4872 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
4874 gimple stmt
= gsi_stmt (si
);
4876 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
4878 tree arg
= gimple_op (stmt
, i
);
4879 find_decls_types (arg
, fld
);
4886 /* Find decls and types referenced in varpool node N and store them in
4887 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4888 look for *every* kind of DECL and TYPE node reachable from N,
4889 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4890 NAMESPACE_DECLs, etc). */
4893 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
4895 find_decls_types (v
->decl
, fld
);
4898 /* If T needs an assembler name, have one created for it. */
4901 assign_assembler_name_if_neeeded (tree t
)
4903 if (need_assembler_name_p (t
))
4905 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4906 diagnostics that use input_location to show locus
4907 information. The problem here is that, at this point,
4908 input_location is generally anchored to the end of the file
4909 (since the parser is long gone), so we don't have a good
4910 position to pin it to.
4912 To alleviate this problem, this uses the location of T's
4913 declaration. Examples of this are
4914 testsuite/g++.dg/template/cond2.C and
4915 testsuite/g++.dg/template/pr35240.C. */
4916 location_t saved_location
= input_location
;
4917 input_location
= DECL_SOURCE_LOCATION (t
);
4919 decl_assembler_name (t
);
4921 input_location
= saved_location
;
4926 /* Free language specific information for every operand and expression
4927 in every node of the call graph. This process operates in three stages:
4929 1- Every callgraph node and varpool node is traversed looking for
4930 decls and types embedded in them. This is a more exhaustive
4931 search than that done by find_referenced_vars, because it will
4932 also collect individual fields, decls embedded in types, etc.
4934 2- All the decls found are sent to free_lang_data_in_decl.
4936 3- All the types found are sent to free_lang_data_in_type.
4938 The ordering between decls and types is important because
4939 free_lang_data_in_decl sets assembler names, which includes
4940 mangling. So types cannot be freed up until assembler names have
4944 free_lang_data_in_cgraph (void)
4946 struct cgraph_node
*n
;
4947 struct varpool_node
*v
;
4948 struct free_lang_data_d fld
;
4953 /* Initialize sets and arrays to store referenced decls and types. */
4954 fld
.pset
= pointer_set_create ();
4955 fld
.worklist
= NULL
;
4956 fld
.decls
= VEC_alloc (tree
, heap
, 100);
4957 fld
.types
= VEC_alloc (tree
, heap
, 100);
4959 /* Find decls and types in the body of every function in the callgraph. */
4960 for (n
= cgraph_nodes
; n
; n
= n
->next
)
4961 find_decls_types_in_node (n
, &fld
);
4963 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4964 find_decls_types (p
->decl
, &fld
);
4966 /* Find decls and types in every varpool symbol. */
4967 for (v
= varpool_nodes_queue
; v
; v
= v
->next_needed
)
4968 find_decls_types_in_var (v
, &fld
);
4970 /* Set the assembler name on every decl found. We need to do this
4971 now because free_lang_data_in_decl will invalidate data needed
4972 for mangling. This breaks mangling on interdependent decls. */
4973 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
4974 assign_assembler_name_if_neeeded (t
);
4976 /* Traverse every decl found freeing its language data. */
4977 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
4978 free_lang_data_in_decl (t
);
4980 /* Traverse every type found freeing its language data. */
4981 for (i
= 0; VEC_iterate (tree
, fld
.types
, i
, t
); i
++)
4982 free_lang_data_in_type (t
);
4984 pointer_set_destroy (fld
.pset
);
4985 VEC_free (tree
, heap
, fld
.worklist
);
4986 VEC_free (tree
, heap
, fld
.decls
);
4987 VEC_free (tree
, heap
, fld
.types
);
4991 /* Free resources that are used by FE but are not needed once they are done. */
4994 free_lang_data (void)
4998 /* If we are the LTO frontend we have freed lang-specific data already. */
5000 || !flag_generate_lto
)
5003 /* Allocate and assign alias sets to the standard integer types
5004 while the slots are still in the way the frontends generated them. */
5005 for (i
= 0; i
< itk_none
; ++i
)
5006 if (integer_types
[i
])
5007 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5009 /* Traverse the IL resetting language specific information for
5010 operands, expressions, etc. */
5011 free_lang_data_in_cgraph ();
5013 /* Create gimple variants for common types. */
5014 ptrdiff_type_node
= integer_type_node
;
5015 fileptr_type_node
= ptr_type_node
;
5016 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
5017 || (TYPE_MODE (boolean_type_node
)
5018 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
5019 || TYPE_PRECISION (boolean_type_node
) != 1
5020 || !TYPE_UNSIGNED (boolean_type_node
))
5022 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5023 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5024 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5025 TYPE_PRECISION (boolean_type_node
) = 1;
5026 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5027 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5030 /* Unify char_type_node with its properly signed variant. */
5031 if (TYPE_UNSIGNED (char_type_node
))
5032 unsigned_char_type_node
= char_type_node
;
5034 signed_char_type_node
= char_type_node
;
5036 /* Reset some langhooks. Do not reset types_compatible_p, it may
5037 still be used indirectly via the get_alias_set langhook. */
5038 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5039 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5040 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5041 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
5042 lang_hooks
.fold_obj_type_ref
= gimple_fold_obj_type_ref
;
5044 /* Reset diagnostic machinery. */
5045 diagnostic_starter (global_dc
) = default_diagnostic_starter
;
5046 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5047 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5053 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5057 "*free_lang_data", /* name */
5059 free_lang_data
, /* execute */
5062 0, /* static_pass_number */
5063 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5064 0, /* properties_required */
5065 0, /* properties_provided */
5066 0, /* properties_destroyed */
5067 0, /* todo_flags_start */
5068 TODO_ggc_collect
/* todo_flags_finish */
5072 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5075 We try both `text' and `__text__', ATTR may be either one. */
5076 /* ??? It might be a reasonable simplification to require ATTR to be only
5077 `text'. One might then also require attribute lists to be stored in
5078 their canonicalized form. */
5081 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5086 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5089 p
= IDENTIFIER_POINTER (ident
);
5090 ident_len
= IDENTIFIER_LENGTH (ident
);
5092 if (ident_len
== attr_len
5093 && strcmp (attr
, p
) == 0)
5096 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5099 gcc_assert (attr
[1] == '_');
5100 gcc_assert (attr
[attr_len
- 2] == '_');
5101 gcc_assert (attr
[attr_len
- 1] == '_');
5102 if (ident_len
== attr_len
- 4
5103 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5108 if (ident_len
== attr_len
+ 4
5109 && p
[0] == '_' && p
[1] == '_'
5110 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5111 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5118 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5121 We try both `text' and `__text__', ATTR may be either one. */
5124 is_attribute_p (const char *attr
, const_tree ident
)
5126 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5129 /* Given an attribute name and a list of attributes, return a pointer to the
5130 attribute's list element if the attribute is part of the list, or NULL_TREE
5131 if not found. If the attribute appears more than once, this only
5132 returns the first occurrence; the TREE_CHAIN of the return value should
5133 be passed back in if further occurrences are wanted. */
5136 lookup_attribute (const char *attr_name
, tree list
)
5139 size_t attr_len
= strlen (attr_name
);
5141 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5143 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5144 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5150 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5154 remove_attribute (const char *attr_name
, tree list
)
5157 size_t attr_len
= strlen (attr_name
);
5159 for (p
= &list
; *p
; )
5162 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5163 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5164 *p
= TREE_CHAIN (l
);
5166 p
= &TREE_CHAIN (l
);
5172 /* Return an attribute list that is the union of a1 and a2. */
5175 merge_attributes (tree a1
, tree a2
)
5179 /* Either one unset? Take the set one. */
5181 if ((attributes
= a1
) == 0)
5184 /* One that completely contains the other? Take it. */
5186 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5188 if (attribute_list_contained (a2
, a1
))
5192 /* Pick the longest list, and hang on the other list. */
5194 if (list_length (a1
) < list_length (a2
))
5195 attributes
= a2
, a2
= a1
;
5197 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5200 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5203 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5206 if (TREE_VALUE (a
) != NULL
5207 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
5208 && TREE_VALUE (a2
) != NULL
5209 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
5211 if (simple_cst_list_equal (TREE_VALUE (a
),
5212 TREE_VALUE (a2
)) == 1)
5215 else if (simple_cst_equal (TREE_VALUE (a
),
5216 TREE_VALUE (a2
)) == 1)
5221 a1
= copy_node (a2
);
5222 TREE_CHAIN (a1
) = attributes
;
5231 /* Given types T1 and T2, merge their attributes and return
5235 merge_type_attributes (tree t1
, tree t2
)
5237 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5238 TYPE_ATTRIBUTES (t2
));
5241 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5245 merge_decl_attributes (tree olddecl
, tree newdecl
)
5247 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5248 DECL_ATTRIBUTES (newdecl
));
5251 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5253 /* Specialization of merge_decl_attributes for various Windows targets.
5255 This handles the following situation:
5257 __declspec (dllimport) int foo;
5260 The second instance of `foo' nullifies the dllimport. */
5263 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5266 int delete_dllimport_p
= 1;
5268 /* What we need to do here is remove from `old' dllimport if it doesn't
5269 appear in `new'. dllimport behaves like extern: if a declaration is
5270 marked dllimport and a definition appears later, then the object
5271 is not dllimport'd. We also remove a `new' dllimport if the old list
5272 contains dllexport: dllexport always overrides dllimport, regardless
5273 of the order of declaration. */
5274 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5275 delete_dllimport_p
= 0;
5276 else if (DECL_DLLIMPORT_P (new_tree
)
5277 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5279 DECL_DLLIMPORT_P (new_tree
) = 0;
5280 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5281 "dllimport ignored", new_tree
);
5283 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5285 /* Warn about overriding a symbol that has already been used, e.g.:
5286 extern int __attribute__ ((dllimport)) foo;
5287 int* bar () {return &foo;}
5290 if (TREE_USED (old
))
5292 warning (0, "%q+D redeclared without dllimport attribute "
5293 "after being referenced with dll linkage", new_tree
);
5294 /* If we have used a variable's address with dllimport linkage,
5295 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5296 decl may already have had TREE_CONSTANT computed.
5297 We still remove the attribute so that assembler code refers
5298 to '&foo rather than '_imp__foo'. */
5299 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5300 DECL_DLLIMPORT_P (new_tree
) = 1;
5303 /* Let an inline definition silently override the external reference,
5304 but otherwise warn about attribute inconsistency. */
5305 else if (TREE_CODE (new_tree
) == VAR_DECL
5306 || !DECL_DECLARED_INLINE_P (new_tree
))
5307 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5308 "previous dllimport ignored", new_tree
);
5311 delete_dllimport_p
= 0;
5313 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5315 if (delete_dllimport_p
)
5318 const size_t attr_len
= strlen ("dllimport");
5320 /* Scan the list for dllimport and delete it. */
5321 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5323 if (is_attribute_with_length_p ("dllimport", attr_len
,
5326 if (prev
== NULL_TREE
)
5329 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5338 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5339 struct attribute_spec.handler. */
5342 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5348 /* These attributes may apply to structure and union types being created,
5349 but otherwise should pass to the declaration involved. */
5352 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5353 | (int) ATTR_FLAG_ARRAY_NEXT
))
5355 *no_add_attrs
= true;
5356 return tree_cons (name
, args
, NULL_TREE
);
5358 if (TREE_CODE (node
) == RECORD_TYPE
5359 || TREE_CODE (node
) == UNION_TYPE
)
5361 node
= TYPE_NAME (node
);
5367 warning (OPT_Wattributes
, "%qE attribute ignored",
5369 *no_add_attrs
= true;
5374 if (TREE_CODE (node
) != FUNCTION_DECL
5375 && TREE_CODE (node
) != VAR_DECL
5376 && TREE_CODE (node
) != TYPE_DECL
)
5378 *no_add_attrs
= true;
5379 warning (OPT_Wattributes
, "%qE attribute ignored",
5384 if (TREE_CODE (node
) == TYPE_DECL
5385 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5386 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5388 *no_add_attrs
= true;
5389 warning (OPT_Wattributes
, "%qE attribute ignored",
5394 is_dllimport
= is_attribute_p ("dllimport", name
);
5396 /* Report error on dllimport ambiguities seen now before they cause
5400 /* Honor any target-specific overrides. */
5401 if (!targetm
.valid_dllimport_attribute_p (node
))
5402 *no_add_attrs
= true;
5404 else if (TREE_CODE (node
) == FUNCTION_DECL
5405 && DECL_DECLARED_INLINE_P (node
))
5407 warning (OPT_Wattributes
, "inline function %q+D declared as "
5408 " dllimport: attribute ignored", node
);
5409 *no_add_attrs
= true;
5411 /* Like MS, treat definition of dllimported variables and
5412 non-inlined functions on declaration as syntax errors. */
5413 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5415 error ("function %q+D definition is marked dllimport", node
);
5416 *no_add_attrs
= true;
5419 else if (TREE_CODE (node
) == VAR_DECL
)
5421 if (DECL_INITIAL (node
))
5423 error ("variable %q+D definition is marked dllimport",
5425 *no_add_attrs
= true;
5428 /* `extern' needn't be specified with dllimport.
5429 Specify `extern' now and hope for the best. Sigh. */
5430 DECL_EXTERNAL (node
) = 1;
5431 /* Also, implicitly give dllimport'd variables declared within
5432 a function global scope, unless declared static. */
5433 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5434 TREE_PUBLIC (node
) = 1;
5437 if (*no_add_attrs
== false)
5438 DECL_DLLIMPORT_P (node
) = 1;
5440 else if (TREE_CODE (node
) == FUNCTION_DECL
5441 && DECL_DECLARED_INLINE_P (node
))
5442 /* An exported function, even if inline, must be emitted. */
5443 DECL_EXTERNAL (node
) = 0;
5445 /* Report error if symbol is not accessible at global scope. */
5446 if (!TREE_PUBLIC (node
)
5447 && (TREE_CODE (node
) == VAR_DECL
5448 || TREE_CODE (node
) == FUNCTION_DECL
))
5450 error ("external linkage required for symbol %q+D because of "
5451 "%qE attribute", node
, name
);
5452 *no_add_attrs
= true;
5455 /* A dllexport'd entity must have default visibility so that other
5456 program units (shared libraries or the main executable) can see
5457 it. A dllimport'd entity must have default visibility so that
5458 the linker knows that undefined references within this program
5459 unit can be resolved by the dynamic linker. */
5462 if (DECL_VISIBILITY_SPECIFIED (node
)
5463 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5464 error ("%qE implies default visibility, but %qD has already "
5465 "been declared with a different visibility",
5467 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5468 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5474 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5476 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5477 of the various TYPE_QUAL values. */
5480 set_type_quals (tree type
, int type_quals
)
5482 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5483 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5484 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5485 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5488 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5491 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5493 return (TYPE_QUALS (cand
) == type_quals
5494 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5495 /* Apparently this is needed for Objective-C. */
5496 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5497 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5498 TYPE_ATTRIBUTES (base
)));
5501 /* Return a version of the TYPE, qualified as indicated by the
5502 TYPE_QUALS, if one exists. If no qualified version exists yet,
5503 return NULL_TREE. */
5506 get_qualified_type (tree type
, int type_quals
)
5510 if (TYPE_QUALS (type
) == type_quals
)
5513 /* Search the chain of variants to see if there is already one there just
5514 like the one we need to have. If so, use that existing one. We must
5515 preserve the TYPE_NAME, since there is code that depends on this. */
5516 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5517 if (check_qualified_type (t
, type
, type_quals
))
5523 /* Like get_qualified_type, but creates the type if it does not
5524 exist. This function never returns NULL_TREE. */
5527 build_qualified_type (tree type
, int type_quals
)
5531 /* See if we already have the appropriate qualified variant. */
5532 t
= get_qualified_type (type
, type_quals
);
5534 /* If not, build it. */
5537 t
= build_variant_type_copy (type
);
5538 set_type_quals (t
, type_quals
);
5540 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5541 /* Propagate structural equality. */
5542 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5543 else if (TYPE_CANONICAL (type
) != type
)
5544 /* Build the underlying canonical type, since it is different
5546 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5549 /* T is its own canonical type. */
5550 TYPE_CANONICAL (t
) = t
;
5557 /* Create a new distinct copy of TYPE. The new type is made its own
5558 MAIN_VARIANT. If TYPE requires structural equality checks, the
5559 resulting type requires structural equality checks; otherwise, its
5560 TYPE_CANONICAL points to itself. */
5563 build_distinct_type_copy (tree type
)
5565 tree t
= copy_node (type
);
5567 TYPE_POINTER_TO (t
) = 0;
5568 TYPE_REFERENCE_TO (t
) = 0;
5570 /* Set the canonical type either to a new equivalence class, or
5571 propagate the need for structural equality checks. */
5572 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5573 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5575 TYPE_CANONICAL (t
) = t
;
5577 /* Make it its own variant. */
5578 TYPE_MAIN_VARIANT (t
) = t
;
5579 TYPE_NEXT_VARIANT (t
) = 0;
5581 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5582 whose TREE_TYPE is not t. This can also happen in the Ada
5583 frontend when using subtypes. */
5588 /* Create a new variant of TYPE, equivalent but distinct. This is so
5589 the caller can modify it. TYPE_CANONICAL for the return type will
5590 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5591 are considered equal by the language itself (or that both types
5592 require structural equality checks). */
5595 build_variant_type_copy (tree type
)
5597 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5599 t
= build_distinct_type_copy (type
);
5601 /* Since we're building a variant, assume that it is a non-semantic
5602 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5603 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5605 /* Add the new type to the chain of variants of TYPE. */
5606 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5607 TYPE_NEXT_VARIANT (m
) = t
;
5608 TYPE_MAIN_VARIANT (t
) = m
;
5613 /* Return true if the from tree in both tree maps are equal. */
5616 tree_map_base_eq (const void *va
, const void *vb
)
5618 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5619 *const b
= (const struct tree_map_base
*) vb
;
5620 return (a
->from
== b
->from
);
5623 /* Hash a from tree in a tree_map. */
5626 tree_map_base_hash (const void *item
)
5628 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5631 /* Return true if this tree map structure is marked for garbage collection
5632 purposes. We simply return true if the from tree is marked, so that this
5633 structure goes away when the from tree goes away. */
5636 tree_map_base_marked_p (const void *p
)
5638 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5642 tree_map_hash (const void *item
)
5644 return (((const struct tree_map
*) item
)->hash
);
5647 /* Return the initialization priority for DECL. */
5650 decl_init_priority_lookup (tree decl
)
5652 struct tree_priority_map
*h
;
5653 struct tree_map_base in
;
5655 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5657 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5658 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5661 /* Return the finalization priority for DECL. */
5664 decl_fini_priority_lookup (tree decl
)
5666 struct tree_priority_map
*h
;
5667 struct tree_map_base in
;
5669 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5671 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5672 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5675 /* Return the initialization and finalization priority information for
5676 DECL. If there is no previous priority information, a freshly
5677 allocated structure is returned. */
5679 static struct tree_priority_map
*
5680 decl_priority_info (tree decl
)
5682 struct tree_priority_map in
;
5683 struct tree_priority_map
*h
;
5686 in
.base
.from
= decl
;
5687 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5688 h
= (struct tree_priority_map
*) *loc
;
5691 h
= GGC_CNEW (struct tree_priority_map
);
5693 h
->base
.from
= decl
;
5694 h
->init
= DEFAULT_INIT_PRIORITY
;
5695 h
->fini
= DEFAULT_INIT_PRIORITY
;
5701 /* Set the initialization priority for DECL to PRIORITY. */
5704 decl_init_priority_insert (tree decl
, priority_type priority
)
5706 struct tree_priority_map
*h
;
5708 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5709 h
= decl_priority_info (decl
);
5713 /* Set the finalization priority for DECL to PRIORITY. */
5716 decl_fini_priority_insert (tree decl
, priority_type priority
)
5718 struct tree_priority_map
*h
;
5720 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5721 h
= decl_priority_info (decl
);
5725 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5728 print_debug_expr_statistics (void)
5730 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5731 (long) htab_size (debug_expr_for_decl
),
5732 (long) htab_elements (debug_expr_for_decl
),
5733 htab_collisions (debug_expr_for_decl
));
5736 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5739 print_value_expr_statistics (void)
5741 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5742 (long) htab_size (value_expr_for_decl
),
5743 (long) htab_elements (value_expr_for_decl
),
5744 htab_collisions (value_expr_for_decl
));
5747 /* Lookup a debug expression for FROM, and return it if we find one. */
5750 decl_debug_expr_lookup (tree from
)
5752 struct tree_map
*h
, in
;
5753 in
.base
.from
= from
;
5755 h
= (struct tree_map
*) htab_find_with_hash (debug_expr_for_decl
, &in
,
5756 htab_hash_pointer (from
));
5762 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5765 decl_debug_expr_insert (tree from
, tree to
)
5770 h
= GGC_NEW (struct tree_map
);
5771 h
->hash
= htab_hash_pointer (from
);
5772 h
->base
.from
= from
;
5774 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
5775 *(struct tree_map
**) loc
= h
;
5778 /* Lookup a value expression for FROM, and return it if we find one. */
5781 decl_value_expr_lookup (tree from
)
5783 struct tree_map
*h
, in
;
5784 in
.base
.from
= from
;
5786 h
= (struct tree_map
*) htab_find_with_hash (value_expr_for_decl
, &in
,
5787 htab_hash_pointer (from
));
5793 /* Insert a mapping FROM->TO in the value expression hashtable. */
5796 decl_value_expr_insert (tree from
, tree to
)
5801 h
= GGC_NEW (struct tree_map
);
5802 h
->hash
= htab_hash_pointer (from
);
5803 h
->base
.from
= from
;
5805 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
5806 *(struct tree_map
**) loc
= h
;
5809 /* Hashing of types so that we don't make duplicates.
5810 The entry point is `type_hash_canon'. */
5812 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5813 with types in the TREE_VALUE slots), by adding the hash codes
5814 of the individual types. */
5817 type_hash_list (const_tree list
, hashval_t hashcode
)
5821 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5822 if (TREE_VALUE (tail
) != error_mark_node
)
5823 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
5829 /* These are the Hashtable callback functions. */
5831 /* Returns true iff the types are equivalent. */
5834 type_hash_eq (const void *va
, const void *vb
)
5836 const struct type_hash
*const a
= (const struct type_hash
*) va
,
5837 *const b
= (const struct type_hash
*) vb
;
5839 /* First test the things that are the same for all types. */
5840 if (a
->hash
!= b
->hash
5841 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
5842 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
5843 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
5844 TYPE_ATTRIBUTES (b
->type
))
5845 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
5846 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)
5847 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
5848 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
5851 switch (TREE_CODE (a
->type
))
5856 case REFERENCE_TYPE
:
5860 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
5863 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
5864 && !(TYPE_VALUES (a
->type
)
5865 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
5866 && TYPE_VALUES (b
->type
)
5867 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
5868 && type_list_equal (TYPE_VALUES (a
->type
),
5869 TYPE_VALUES (b
->type
))))
5872 /* ... fall through ... */
5877 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
5878 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
5879 TYPE_MAX_VALUE (b
->type
)))
5880 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
5881 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
5882 TYPE_MIN_VALUE (b
->type
))));
5884 case FIXED_POINT_TYPE
:
5885 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
5888 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
5891 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
5892 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5893 || (TYPE_ARG_TYPES (a
->type
)
5894 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5895 && TYPE_ARG_TYPES (b
->type
)
5896 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5897 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5898 TYPE_ARG_TYPES (b
->type
)))));
5901 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
5905 case QUAL_UNION_TYPE
:
5906 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
5907 || (TYPE_FIELDS (a
->type
)
5908 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
5909 && TYPE_FIELDS (b
->type
)
5910 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
5911 && type_list_equal (TYPE_FIELDS (a
->type
),
5912 TYPE_FIELDS (b
->type
))));
5915 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5916 || (TYPE_ARG_TYPES (a
->type
)
5917 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5918 && TYPE_ARG_TYPES (b
->type
)
5919 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5920 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5921 TYPE_ARG_TYPES (b
->type
))))
5929 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
5930 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
5935 /* Return the cached hash value. */
5938 type_hash_hash (const void *item
)
5940 return ((const struct type_hash
*) item
)->hash
;
5943 /* Look in the type hash table for a type isomorphic to TYPE.
5944 If one is found, return it. Otherwise return 0. */
5947 type_hash_lookup (hashval_t hashcode
, tree type
)
5949 struct type_hash
*h
, in
;
5951 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5952 must call that routine before comparing TYPE_ALIGNs. */
5958 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
5965 /* Add an entry to the type-hash-table
5966 for a type TYPE whose hash code is HASHCODE. */
5969 type_hash_add (hashval_t hashcode
, tree type
)
5971 struct type_hash
*h
;
5974 h
= GGC_NEW (struct type_hash
);
5977 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
5981 /* Given TYPE, and HASHCODE its hash code, return the canonical
5982 object for an identical type if one already exists.
5983 Otherwise, return TYPE, and record it as the canonical object.
5985 To use this function, first create a type of the sort you want.
5986 Then compute its hash code from the fields of the type that
5987 make it different from other similar types.
5988 Then call this function and use the value. */
5991 type_hash_canon (unsigned int hashcode
, tree type
)
5995 /* The hash table only contains main variants, so ensure that's what we're
5997 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
5999 if (!lang_hooks
.types
.hash_types
)
6002 /* See if the type is in the hash table already. If so, return it.
6003 Otherwise, add the type. */
6004 t1
= type_hash_lookup (hashcode
, type
);
6007 #ifdef GATHER_STATISTICS
6008 tree_node_counts
[(int) t_kind
]--;
6009 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
6015 type_hash_add (hashcode
, type
);
6020 /* See if the data pointed to by the type hash table is marked. We consider
6021 it marked if the type is marked or if a debug type number or symbol
6022 table entry has been made for the type. This reduces the amount of
6023 debugging output and eliminates that dependency of the debug output on
6024 the number of garbage collections. */
6027 type_hash_marked_p (const void *p
)
6029 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6031 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
6035 print_type_hash_statistics (void)
6037 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6038 (long) htab_size (type_hash_table
),
6039 (long) htab_elements (type_hash_table
),
6040 htab_collisions (type_hash_table
));
6043 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6044 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6045 by adding the hash codes of the individual attributes. */
6048 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6052 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6053 /* ??? Do we want to add in TREE_VALUE too? */
6054 hashcode
= iterative_hash_object
6055 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6059 /* Given two lists of attributes, return true if list l2 is
6060 equivalent to l1. */
6063 attribute_list_equal (const_tree l1
, const_tree l2
)
6065 return attribute_list_contained (l1
, l2
)
6066 && attribute_list_contained (l2
, l1
);
6069 /* Given two lists of attributes, return true if list L2 is
6070 completely contained within L1. */
6071 /* ??? This would be faster if attribute names were stored in a canonicalized
6072 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6073 must be used to show these elements are equivalent (which they are). */
6074 /* ??? It's not clear that attributes with arguments will always be handled
6078 attribute_list_contained (const_tree l1
, const_tree l2
)
6082 /* First check the obvious, maybe the lists are identical. */
6086 /* Maybe the lists are similar. */
6087 for (t1
= l1
, t2
= l2
;
6089 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6090 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6091 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6093 /* Maybe the lists are equal. */
6094 if (t1
== 0 && t2
== 0)
6097 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6100 /* This CONST_CAST is okay because lookup_attribute does not
6101 modify its argument and the return value is assigned to a
6103 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6104 CONST_CAST_TREE(l1
));
6106 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6109 if (TREE_VALUE (t2
) != NULL
6110 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
6111 && TREE_VALUE (attr
) != NULL
6112 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
6114 if (simple_cst_list_equal (TREE_VALUE (t2
),
6115 TREE_VALUE (attr
)) == 1)
6118 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
6129 /* Given two lists of types
6130 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6131 return 1 if the lists contain the same types in the same order.
6132 Also, the TREE_PURPOSEs must match. */
6135 type_list_equal (const_tree l1
, const_tree l2
)
6139 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6140 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6141 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6142 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6143 && (TREE_TYPE (TREE_PURPOSE (t1
))
6144 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6150 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6151 given by TYPE. If the argument list accepts variable arguments,
6152 then this function counts only the ordinary arguments. */
6155 type_num_arguments (const_tree type
)
6160 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6161 /* If the function does not take a variable number of arguments,
6162 the last element in the list will have type `void'. */
6163 if (VOID_TYPE_P (TREE_VALUE (t
)))
6171 /* Nonzero if integer constants T1 and T2
6172 represent the same constant value. */
6175 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6180 if (t1
== 0 || t2
== 0)
6183 if (TREE_CODE (t1
) == INTEGER_CST
6184 && TREE_CODE (t2
) == INTEGER_CST
6185 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6186 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6192 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6193 The precise way of comparison depends on their data type. */
6196 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6201 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6203 int t1_sgn
= tree_int_cst_sgn (t1
);
6204 int t2_sgn
= tree_int_cst_sgn (t2
);
6206 if (t1_sgn
< t2_sgn
)
6208 else if (t1_sgn
> t2_sgn
)
6210 /* Otherwise, both are non-negative, so we compare them as
6211 unsigned just in case one of them would overflow a signed
6214 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6215 return INT_CST_LT (t1
, t2
);
6217 return INT_CST_LT_UNSIGNED (t1
, t2
);
6220 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6223 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6225 if (tree_int_cst_lt (t1
, t2
))
6227 else if (tree_int_cst_lt (t2
, t1
))
6233 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6234 the host. If POS is zero, the value can be represented in a single
6235 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6236 be represented in a single unsigned HOST_WIDE_INT. */
6239 host_integerp (const_tree t
, int pos
)
6244 return (TREE_CODE (t
) == INTEGER_CST
6245 && ((TREE_INT_CST_HIGH (t
) == 0
6246 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6247 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6248 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6249 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6250 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6251 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6252 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6255 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6256 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6257 be non-negative. We must be able to satisfy the above conditions. */
6260 tree_low_cst (const_tree t
, int pos
)
6262 gcc_assert (host_integerp (t
, pos
));
6263 return TREE_INT_CST_LOW (t
);
6266 /* Return the most significant bit of the integer constant T. */
6269 tree_int_cst_msb (const_tree t
)
6273 unsigned HOST_WIDE_INT l
;
6275 /* Note that using TYPE_PRECISION here is wrong. We care about the
6276 actual bits, not the (arbitrary) range of the type. */
6277 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6278 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6279 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6280 return (l
& 1) == 1;
6283 /* Return an indication of the sign of the integer constant T.
6284 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6285 Note that -1 will never be returned if T's type is unsigned. */
6288 tree_int_cst_sgn (const_tree t
)
6290 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6292 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6294 else if (TREE_INT_CST_HIGH (t
) < 0)
6300 /* Return the minimum number of bits needed to represent VALUE in a
6301 signed or unsigned type, UNSIGNEDP says which. */
6304 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6308 /* If the value is negative, compute its negative minus 1. The latter
6309 adjustment is because the absolute value of the largest negative value
6310 is one larger than the largest positive value. This is equivalent to
6311 a bit-wise negation, so use that operation instead. */
6313 if (tree_int_cst_sgn (value
) < 0)
6314 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6316 /* Return the number of bits needed, taking into account the fact
6317 that we need one more bit for a signed than unsigned type. */
6319 if (integer_zerop (value
))
6322 log
= tree_floor_log2 (value
);
6324 return log
+ 1 + !unsignedp
;
6327 /* Compare two constructor-element-type constants. Return 1 if the lists
6328 are known to be equal; otherwise return 0. */
6331 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6333 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6335 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6338 l1
= TREE_CHAIN (l1
);
6339 l2
= TREE_CHAIN (l2
);
6345 /* Return truthvalue of whether T1 is the same tree structure as T2.
6346 Return 1 if they are the same.
6347 Return 0 if they are understandably different.
6348 Return -1 if either contains tree structure not understood by
6352 simple_cst_equal (const_tree t1
, const_tree t2
)
6354 enum tree_code code1
, code2
;
6360 if (t1
== 0 || t2
== 0)
6363 code1
= TREE_CODE (t1
);
6364 code2
= TREE_CODE (t2
);
6366 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6368 if (CONVERT_EXPR_CODE_P (code2
)
6369 || code2
== NON_LVALUE_EXPR
)
6370 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6372 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6375 else if (CONVERT_EXPR_CODE_P (code2
)
6376 || code2
== NON_LVALUE_EXPR
)
6377 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6385 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6386 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6389 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6392 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6395 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6396 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6397 TREE_STRING_LENGTH (t1
)));
6401 unsigned HOST_WIDE_INT idx
;
6402 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6403 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6405 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6408 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6409 /* ??? Should we handle also fields here? */
6410 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6411 VEC_index (constructor_elt
, v2
, idx
)->value
))
6417 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6420 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6423 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6426 const_tree arg1
, arg2
;
6427 const_call_expr_arg_iterator iter1
, iter2
;
6428 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6429 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6431 arg1
= next_const_call_expr_arg (&iter1
),
6432 arg2
= next_const_call_expr_arg (&iter2
))
6434 cmp
= simple_cst_equal (arg1
, arg2
);
6438 return arg1
== arg2
;
6442 /* Special case: if either target is an unallocated VAR_DECL,
6443 it means that it's going to be unified with whatever the
6444 TARGET_EXPR is really supposed to initialize, so treat it
6445 as being equivalent to anything. */
6446 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6447 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6448 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6449 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6450 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6451 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6454 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6459 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6461 case WITH_CLEANUP_EXPR
:
6462 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6466 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6469 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6470 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6484 /* This general rule works for most tree codes. All exceptions should be
6485 handled above. If this is a language-specific tree code, we can't
6486 trust what might be in the operand, so say we don't know
6488 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6491 switch (TREE_CODE_CLASS (code1
))
6495 case tcc_comparison
:
6496 case tcc_expression
:
6500 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6502 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6514 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6515 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6516 than U, respectively. */
6519 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6521 if (tree_int_cst_sgn (t
) < 0)
6523 else if (TREE_INT_CST_HIGH (t
) != 0)
6525 else if (TREE_INT_CST_LOW (t
) == u
)
6527 else if (TREE_INT_CST_LOW (t
) < u
)
6533 /* Return true if CODE represents an associative tree code. Otherwise
6536 associative_tree_code (enum tree_code code
)
6555 /* Return true if CODE represents a commutative tree code. Otherwise
6558 commutative_tree_code (enum tree_code code
)
6571 case UNORDERED_EXPR
:
6575 case TRUTH_AND_EXPR
:
6576 case TRUTH_XOR_EXPR
:
6586 /* Generate a hash value for an expression. This can be used iteratively
6587 by passing a previous result as the VAL argument.
6589 This function is intended to produce the same hash for expressions which
6590 would compare equal using operand_equal_p. */
6593 iterative_hash_expr (const_tree t
, hashval_t val
)
6596 enum tree_code code
;
6600 return iterative_hash_hashval_t (0, val
);
6602 code
= TREE_CODE (t
);
6606 /* Alas, constants aren't shared, so we can't rely on pointer
6609 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6610 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6613 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6615 return iterative_hash_hashval_t (val2
, val
);
6619 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6621 return iterative_hash_hashval_t (val2
, val
);
6624 return iterative_hash (TREE_STRING_POINTER (t
),
6625 TREE_STRING_LENGTH (t
), val
);
6627 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6628 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6630 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6632 /* We can just compare by pointer. */
6633 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6634 case PLACEHOLDER_EXPR
:
6635 /* The node itself doesn't matter. */
6638 /* A list of expressions, for a CALL_EXPR or as the elements of a
6640 for (; t
; t
= TREE_CHAIN (t
))
6641 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6645 unsigned HOST_WIDE_INT idx
;
6647 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6649 val
= iterative_hash_expr (field
, val
);
6650 val
= iterative_hash_expr (value
, val
);
6655 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6656 Otherwise nodes that compare equal according to operand_equal_p might
6657 get different hash codes. However, don't do this for machine specific
6658 or front end builtins, since the function code is overloaded in those
6660 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6661 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6663 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6664 code
= TREE_CODE (t
);
6668 tclass
= TREE_CODE_CLASS (code
);
6670 if (tclass
== tcc_declaration
)
6672 /* DECL's have a unique ID */
6673 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6677 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6679 val
= iterative_hash_object (code
, val
);
6681 /* Don't hash the type, that can lead to having nodes which
6682 compare equal according to operand_equal_p, but which
6683 have different hash codes. */
6684 if (CONVERT_EXPR_CODE_P (code
)
6685 || code
== NON_LVALUE_EXPR
)
6687 /* Make sure to include signness in the hash computation. */
6688 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6689 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6692 else if (commutative_tree_code (code
))
6694 /* It's a commutative expression. We want to hash it the same
6695 however it appears. We do this by first hashing both operands
6696 and then rehashing based on the order of their independent
6698 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6699 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6703 t
= one
, one
= two
, two
= t
;
6705 val
= iterative_hash_hashval_t (one
, val
);
6706 val
= iterative_hash_hashval_t (two
, val
);
6709 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6710 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6717 /* Generate a hash value for a pair of expressions. This can be used
6718 iteratively by passing a previous result as the VAL argument.
6720 The same hash value is always returned for a given pair of expressions,
6721 regardless of the order in which they are presented. This is useful in
6722 hashing the operands of commutative functions. */
6725 iterative_hash_exprs_commutative (const_tree t1
,
6726 const_tree t2
, hashval_t val
)
6728 hashval_t one
= iterative_hash_expr (t1
, 0);
6729 hashval_t two
= iterative_hash_expr (t2
, 0);
6733 t
= one
, one
= two
, two
= t
;
6734 val
= iterative_hash_hashval_t (one
, val
);
6735 val
= iterative_hash_hashval_t (two
, val
);
6740 /* Constructors for pointer, array and function types.
6741 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6742 constructed by language-dependent code, not here.) */
6744 /* Construct, lay out and return the type of pointers to TO_TYPE with
6745 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6746 reference all of memory. If such a type has already been
6747 constructed, reuse it. */
6750 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6755 if (to_type
== error_mark_node
)
6756 return error_mark_node
;
6758 /* If the pointed-to type has the may_alias attribute set, force
6759 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6760 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6761 can_alias_all
= true;
6763 /* In some cases, languages will have things that aren't a POINTER_TYPE
6764 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6765 In that case, return that type without regard to the rest of our
6768 ??? This is a kludge, but consistent with the way this function has
6769 always operated and there doesn't seem to be a good way to avoid this
6771 if (TYPE_POINTER_TO (to_type
) != 0
6772 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6773 return TYPE_POINTER_TO (to_type
);
6775 /* First, if we already have a type for pointers to TO_TYPE and it's
6776 the proper mode, use it. */
6777 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6778 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6781 t
= make_node (POINTER_TYPE
);
6783 TREE_TYPE (t
) = to_type
;
6784 SET_TYPE_MODE (t
, mode
);
6785 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6786 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6787 TYPE_POINTER_TO (to_type
) = t
;
6789 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6790 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6791 else if (TYPE_CANONICAL (to_type
) != to_type
)
6793 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
6794 mode
, can_alias_all
);
6796 /* Lay out the type. This function has many callers that are concerned
6797 with expression-construction, and this simplifies them all. */
6803 /* By default build pointers in ptr_mode. */
6806 build_pointer_type (tree to_type
)
6808 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
6809 : TYPE_ADDR_SPACE (to_type
);
6810 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
6811 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
6814 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6817 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
6822 if (to_type
== error_mark_node
)
6823 return error_mark_node
;
6825 /* If the pointed-to type has the may_alias attribute set, force
6826 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6827 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6828 can_alias_all
= true;
6830 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6831 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6832 In that case, return that type without regard to the rest of our
6835 ??? This is a kludge, but consistent with the way this function has
6836 always operated and there doesn't seem to be a good way to avoid this
6838 if (TYPE_REFERENCE_TO (to_type
) != 0
6839 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
6840 return TYPE_REFERENCE_TO (to_type
);
6842 /* First, if we already have a type for pointers to TO_TYPE and it's
6843 the proper mode, use it. */
6844 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
6845 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6848 t
= make_node (REFERENCE_TYPE
);
6850 TREE_TYPE (t
) = to_type
;
6851 SET_TYPE_MODE (t
, mode
);
6852 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6853 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
6854 TYPE_REFERENCE_TO (to_type
) = t
;
6856 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6857 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6858 else if (TYPE_CANONICAL (to_type
) != to_type
)
6860 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
6861 mode
, can_alias_all
);
6869 /* Build the node for the type of references-to-TO_TYPE by default
6873 build_reference_type (tree to_type
)
6875 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
6876 : TYPE_ADDR_SPACE (to_type
);
6877 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
6878 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
6881 /* Build a type that is compatible with t but has no cv quals anywhere
6884 const char *const *const * -> char ***. */
6887 build_type_no_quals (tree t
)
6889 switch (TREE_CODE (t
))
6892 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6894 TYPE_REF_CAN_ALIAS_ALL (t
));
6895 case REFERENCE_TYPE
:
6897 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6899 TYPE_REF_CAN_ALIAS_ALL (t
));
6901 return TYPE_MAIN_VARIANT (t
);
6905 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6906 MAXVAL should be the maximum value in the domain
6907 (one less than the length of the array).
6909 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6910 We don't enforce this limit, that is up to caller (e.g. language front end).
6911 The limit exists because the result is a signed type and we don't handle
6912 sizes that use more than one HOST_WIDE_INT. */
6915 build_index_type (tree maxval
)
6917 tree itype
= make_node (INTEGER_TYPE
);
6919 TREE_TYPE (itype
) = sizetype
;
6920 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
6921 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6922 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
6923 SET_TYPE_MODE (itype
, TYPE_MODE (sizetype
));
6924 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
6925 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
6926 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
6927 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
6929 if (host_integerp (maxval
, 1))
6930 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
6933 /* Since we cannot hash this type, we need to compare it using
6934 structural equality checks. */
6935 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
6940 #define MAX_INT_CACHED_PREC \
6941 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6942 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
6944 /* Builds a signed or unsigned integer type of precision PRECISION.
6945 Used for C bitfields whose precision does not match that of
6946 built-in target types. */
6948 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
6954 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
6956 if (precision
<= MAX_INT_CACHED_PREC
)
6958 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
6963 itype
= make_node (INTEGER_TYPE
);
6964 TYPE_PRECISION (itype
) = precision
;
6967 fixup_unsigned_type (itype
);
6969 fixup_signed_type (itype
);
6972 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
6973 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
6974 if (precision
<= MAX_INT_CACHED_PREC
&& lang_hooks
.types
.hash_types
)
6975 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
6980 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6981 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6982 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6985 build_range_type (tree type
, tree lowval
, tree highval
)
6987 tree itype
= make_node (INTEGER_TYPE
);
6989 TREE_TYPE (itype
) = type
;
6990 if (type
== NULL_TREE
)
6993 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
6994 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
6996 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
6997 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
6998 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
6999 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7000 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7001 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7003 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
7004 return type_hash_canon (tree_low_cst (highval
, 0)
7005 - tree_low_cst (lowval
, 0),
7011 /* Return true if the debug information for TYPE, a subtype, should be emitted
7012 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7013 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7014 debug info and doesn't reflect the source code. */
7017 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7019 tree base_type
= TREE_TYPE (type
), low
, high
;
7021 /* Subrange types have a base type which is an integral type. */
7022 if (!INTEGRAL_TYPE_P (base_type
))
7025 /* Get the real bounds of the subtype. */
7026 if (lang_hooks
.types
.get_subrange_bounds
)
7027 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7030 low
= TYPE_MIN_VALUE (type
);
7031 high
= TYPE_MAX_VALUE (type
);
7034 /* If the type and its base type have the same representation and the same
7035 name, then the type is not a subrange but a copy of the base type. */
7036 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7037 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7038 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7039 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7040 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7042 tree type_name
= TYPE_NAME (type
);
7043 tree base_type_name
= TYPE_NAME (base_type
);
7045 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7046 type_name
= DECL_NAME (type_name
);
7048 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7049 base_type_name
= DECL_NAME (base_type_name
);
7051 if (type_name
== base_type_name
)
7062 /* Just like build_index_type, but takes lowval and highval instead
7063 of just highval (maxval). */
7066 build_index_2_type (tree lowval
, tree highval
)
7068 return build_range_type (sizetype
, lowval
, highval
);
7071 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7072 and number of elements specified by the range of values of INDEX_TYPE.
7073 If such a type has already been constructed, reuse it. */
7076 build_array_type (tree elt_type
, tree index_type
)
7079 hashval_t hashcode
= 0;
7081 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7083 error ("arrays of functions are not meaningful");
7084 elt_type
= integer_type_node
;
7087 t
= make_node (ARRAY_TYPE
);
7088 TREE_TYPE (t
) = elt_type
;
7089 TYPE_DOMAIN (t
) = index_type
;
7090 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7093 /* If the element type is incomplete at this point we get marked for
7094 structural equality. Do not record these types in the canonical
7096 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7099 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
7101 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7102 t
= type_hash_canon (hashcode
, t
);
7104 if (TYPE_CANONICAL (t
) == t
)
7106 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7107 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7108 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7109 else if (TYPE_CANONICAL (elt_type
) != elt_type
7110 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7112 = build_array_type (TYPE_CANONICAL (elt_type
),
7113 index_type
? TYPE_CANONICAL (index_type
) : NULL
);
7119 /* Recursively examines the array elements of TYPE, until a non-array
7120 element type is found. */
7123 strip_array_types (tree type
)
7125 while (TREE_CODE (type
) == ARRAY_TYPE
)
7126 type
= TREE_TYPE (type
);
7131 /* Computes the canonical argument types from the argument type list
7134 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7135 on entry to this function, or if any of the ARGTYPES are
7138 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7139 true on entry to this function, or if any of the ARGTYPES are
7142 Returns a canonical argument list, which may be ARGTYPES when the
7143 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7144 true) or would not differ from ARGTYPES. */
7147 maybe_canonicalize_argtypes(tree argtypes
,
7148 bool *any_structural_p
,
7149 bool *any_noncanonical_p
)
7152 bool any_noncanonical_argtypes_p
= false;
7154 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7156 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7157 /* Fail gracefully by stating that the type is structural. */
7158 *any_structural_p
= true;
7159 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7160 *any_structural_p
= true;
7161 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7162 || TREE_PURPOSE (arg
))
7163 /* If the argument has a default argument, we consider it
7164 non-canonical even though the type itself is canonical.
7165 That way, different variants of function and method types
7166 with default arguments will all point to the variant with
7167 no defaults as their canonical type. */
7168 any_noncanonical_argtypes_p
= true;
7171 if (*any_structural_p
)
7174 if (any_noncanonical_argtypes_p
)
7176 /* Build the canonical list of argument types. */
7177 tree canon_argtypes
= NULL_TREE
;
7178 bool is_void
= false;
7180 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7182 if (arg
== void_list_node
)
7185 canon_argtypes
= tree_cons (NULL_TREE
,
7186 TYPE_CANONICAL (TREE_VALUE (arg
)),
7190 canon_argtypes
= nreverse (canon_argtypes
);
7192 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7194 /* There is a non-canonical type. */
7195 *any_noncanonical_p
= true;
7196 return canon_argtypes
;
7199 /* The canonical argument types are the same as ARGTYPES. */
7203 /* Construct, lay out and return
7204 the type of functions returning type VALUE_TYPE
7205 given arguments of types ARG_TYPES.
7206 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7207 are data type nodes for the arguments of the function.
7208 If such a type has already been constructed, reuse it. */
7211 build_function_type (tree value_type
, tree arg_types
)
7214 hashval_t hashcode
= 0;
7215 bool any_structural_p
, any_noncanonical_p
;
7216 tree canon_argtypes
;
7218 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7220 error ("function return type cannot be function");
7221 value_type
= integer_type_node
;
7224 /* Make a node of the sort we want. */
7225 t
= make_node (FUNCTION_TYPE
);
7226 TREE_TYPE (t
) = value_type
;
7227 TYPE_ARG_TYPES (t
) = arg_types
;
7229 /* If we already have such a type, use the old one. */
7230 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7231 hashcode
= type_hash_list (arg_types
, hashcode
);
7232 t
= type_hash_canon (hashcode
, t
);
7234 /* Set up the canonical type. */
7235 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7236 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7237 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7239 &any_noncanonical_p
);
7240 if (any_structural_p
)
7241 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7242 else if (any_noncanonical_p
)
7243 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7246 if (!COMPLETE_TYPE_P (t
))
7251 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7254 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7256 tree new_type
= NULL
;
7257 tree args
, new_args
= NULL
, t
;
7261 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7262 args
= TREE_CHAIN (args
), i
++)
7263 if (!bitmap_bit_p (args_to_skip
, i
))
7264 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7266 new_reversed
= nreverse (new_args
);
7270 TREE_CHAIN (new_args
) = void_list_node
;
7272 new_reversed
= void_list_node
;
7275 /* Use copy_node to preserve as much as possible from original type
7276 (debug info, attribute lists etc.)
7277 Exception is METHOD_TYPEs must have THIS argument.
7278 When we are asked to remove it, we need to build new FUNCTION_TYPE
7280 if (TREE_CODE (orig_type
) != METHOD_TYPE
7281 || !bitmap_bit_p (args_to_skip
, 0))
7283 new_type
= copy_node (orig_type
);
7284 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7289 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7291 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7294 /* This is a new type, not a copy of an old type. Need to reassociate
7295 variants. We can handle everything except the main variant lazily. */
7296 t
= TYPE_MAIN_VARIANT (orig_type
);
7299 TYPE_MAIN_VARIANT (new_type
) = t
;
7300 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7301 TYPE_NEXT_VARIANT (t
) = new_type
;
7305 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7306 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7311 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7313 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7314 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7315 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7318 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7320 tree new_decl
= copy_node (orig_decl
);
7323 new_type
= TREE_TYPE (orig_decl
);
7324 if (prototype_p (new_type
))
7325 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7326 TREE_TYPE (new_decl
) = new_type
;
7328 /* For declarations setting DECL_VINDEX (i.e. methods)
7329 we expect first argument to be THIS pointer. */
7330 if (bitmap_bit_p (args_to_skip
, 0))
7331 DECL_VINDEX (new_decl
) = NULL_TREE
;
7335 /* Build a function type. The RETURN_TYPE is the type returned by the
7336 function. If VAARGS is set, no void_type_node is appended to the
7337 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7340 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7344 t
= va_arg (argp
, tree
);
7345 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7346 args
= tree_cons (NULL_TREE
, t
, args
);
7351 if (args
!= NULL_TREE
)
7352 args
= nreverse (args
);
7353 gcc_assert (args
!= NULL_TREE
&& last
!= void_list_node
);
7355 else if (args
== NULL_TREE
)
7356 args
= void_list_node
;
7360 args
= nreverse (args
);
7361 TREE_CHAIN (last
) = void_list_node
;
7363 args
= build_function_type (return_type
, args
);
7368 /* Build a function type. The RETURN_TYPE is the type returned by the
7369 function. If additional arguments are provided, they are
7370 additional argument types. The list of argument types must always
7371 be terminated by NULL_TREE. */
7374 build_function_type_list (tree return_type
, ...)
7379 va_start (p
, return_type
);
7380 args
= build_function_type_list_1 (false, return_type
, p
);
7385 /* Build a variable argument function type. The RETURN_TYPE is the
7386 type returned by the function. If additional arguments are provided,
7387 they are additional argument types. The list of argument types must
7388 always be terminated by NULL_TREE. */
7391 build_varargs_function_type_list (tree return_type
, ...)
7396 va_start (p
, return_type
);
7397 args
= build_function_type_list_1 (true, return_type
, p
);
7403 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7404 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7405 for the method. An implicit additional parameter (of type
7406 pointer-to-BASETYPE) is added to the ARGTYPES. */
7409 build_method_type_directly (tree basetype
,
7416 bool any_structural_p
, any_noncanonical_p
;
7417 tree canon_argtypes
;
7419 /* Make a node of the sort we want. */
7420 t
= make_node (METHOD_TYPE
);
7422 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7423 TREE_TYPE (t
) = rettype
;
7424 ptype
= build_pointer_type (basetype
);
7426 /* The actual arglist for this function includes a "hidden" argument
7427 which is "this". Put it into the list of argument types. */
7428 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7429 TYPE_ARG_TYPES (t
) = argtypes
;
7431 /* If we already have such a type, use the old one. */
7432 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7433 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7434 hashcode
= type_hash_list (argtypes
, hashcode
);
7435 t
= type_hash_canon (hashcode
, t
);
7437 /* Set up the canonical type. */
7439 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7440 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7442 = (TYPE_CANONICAL (basetype
) != basetype
7443 || TYPE_CANONICAL (rettype
) != rettype
);
7444 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7446 &any_noncanonical_p
);
7447 if (any_structural_p
)
7448 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7449 else if (any_noncanonical_p
)
7451 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7452 TYPE_CANONICAL (rettype
),
7454 if (!COMPLETE_TYPE_P (t
))
7460 /* Construct, lay out and return the type of methods belonging to class
7461 BASETYPE and whose arguments and values are described by TYPE.
7462 If that type exists already, reuse it.
7463 TYPE must be a FUNCTION_TYPE node. */
7466 build_method_type (tree basetype
, tree type
)
7468 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7470 return build_method_type_directly (basetype
,
7472 TYPE_ARG_TYPES (type
));
7475 /* Construct, lay out and return the type of offsets to a value
7476 of type TYPE, within an object of type BASETYPE.
7477 If a suitable offset type exists already, reuse it. */
7480 build_offset_type (tree basetype
, tree type
)
7483 hashval_t hashcode
= 0;
7485 /* Make a node of the sort we want. */
7486 t
= make_node (OFFSET_TYPE
);
7488 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7489 TREE_TYPE (t
) = type
;
7491 /* If we already have such a type, use the old one. */
7492 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7493 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7494 t
= type_hash_canon (hashcode
, t
);
7496 if (!COMPLETE_TYPE_P (t
))
7499 if (TYPE_CANONICAL (t
) == t
)
7501 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7502 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7503 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7504 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7505 || TYPE_CANONICAL (type
) != type
)
7507 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7508 TYPE_CANONICAL (type
));
7514 /* Create a complex type whose components are COMPONENT_TYPE. */
7517 build_complex_type (tree component_type
)
7522 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7523 || SCALAR_FLOAT_TYPE_P (component_type
)
7524 || FIXED_POINT_TYPE_P (component_type
));
7526 /* Make a node of the sort we want. */
7527 t
= make_node (COMPLEX_TYPE
);
7529 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7531 /* If we already have such a type, use the old one. */
7532 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7533 t
= type_hash_canon (hashcode
, t
);
7535 if (!COMPLETE_TYPE_P (t
))
7538 if (TYPE_CANONICAL (t
) == t
)
7540 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7541 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7542 else if (TYPE_CANONICAL (component_type
) != component_type
)
7544 = build_complex_type (TYPE_CANONICAL (component_type
));
7547 /* We need to create a name, since complex is a fundamental type. */
7548 if (! TYPE_NAME (t
))
7551 if (component_type
== char_type_node
)
7552 name
= "complex char";
7553 else if (component_type
== signed_char_type_node
)
7554 name
= "complex signed char";
7555 else if (component_type
== unsigned_char_type_node
)
7556 name
= "complex unsigned char";
7557 else if (component_type
== short_integer_type_node
)
7558 name
= "complex short int";
7559 else if (component_type
== short_unsigned_type_node
)
7560 name
= "complex short unsigned int";
7561 else if (component_type
== integer_type_node
)
7562 name
= "complex int";
7563 else if (component_type
== unsigned_type_node
)
7564 name
= "complex unsigned int";
7565 else if (component_type
== long_integer_type_node
)
7566 name
= "complex long int";
7567 else if (component_type
== long_unsigned_type_node
)
7568 name
= "complex long unsigned int";
7569 else if (component_type
== long_long_integer_type_node
)
7570 name
= "complex long long int";
7571 else if (component_type
== long_long_unsigned_type_node
)
7572 name
= "complex long long unsigned int";
7577 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7578 get_identifier (name
), t
);
7581 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7584 /* If TYPE is a real or complex floating-point type and the target
7585 does not directly support arithmetic on TYPE then return the wider
7586 type to be used for arithmetic on TYPE. Otherwise, return
7590 excess_precision_type (tree type
)
7592 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7594 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7595 switch (TREE_CODE (type
))
7598 switch (flt_eval_method
)
7601 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7602 return double_type_node
;
7605 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7606 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7607 return long_double_type_node
;
7614 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7616 switch (flt_eval_method
)
7619 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7620 return complex_double_type_node
;
7623 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7624 || (TYPE_MODE (TREE_TYPE (type
))
7625 == TYPE_MODE (double_type_node
)))
7626 return complex_long_double_type_node
;
7639 /* Return OP, stripped of any conversions to wider types as much as is safe.
7640 Converting the value back to OP's type makes a value equivalent to OP.
7642 If FOR_TYPE is nonzero, we return a value which, if converted to
7643 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7645 OP must have integer, real or enumeral type. Pointers are not allowed!
7647 There are some cases where the obvious value we could return
7648 would regenerate to OP if converted to OP's type,
7649 but would not extend like OP to wider types.
7650 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7651 For example, if OP is (unsigned short)(signed char)-1,
7652 we avoid returning (signed char)-1 if FOR_TYPE is int,
7653 even though extending that to an unsigned short would regenerate OP,
7654 since the result of extending (signed char)-1 to (int)
7655 is different from (int) OP. */
7658 get_unwidened (tree op
, tree for_type
)
7660 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7661 tree type
= TREE_TYPE (op
);
7663 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7665 = (for_type
!= 0 && for_type
!= type
7666 && final_prec
> TYPE_PRECISION (type
)
7667 && TYPE_UNSIGNED (type
));
7670 while (CONVERT_EXPR_P (op
))
7674 /* TYPE_PRECISION on vector types has different meaning
7675 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7676 so avoid them here. */
7677 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7680 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7681 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7683 /* Truncations are many-one so cannot be removed.
7684 Unless we are later going to truncate down even farther. */
7686 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7689 /* See what's inside this conversion. If we decide to strip it,
7691 op
= TREE_OPERAND (op
, 0);
7693 /* If we have not stripped any zero-extensions (uns is 0),
7694 we can strip any kind of extension.
7695 If we have previously stripped a zero-extension,
7696 only zero-extensions can safely be stripped.
7697 Any extension can be stripped if the bits it would produce
7698 are all going to be discarded later by truncating to FOR_TYPE. */
7702 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7704 /* TYPE_UNSIGNED says whether this is a zero-extension.
7705 Let's avoid computing it if it does not affect WIN
7706 and if UNS will not be needed again. */
7708 || CONVERT_EXPR_P (op
))
7709 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7717 /* If we finally reach a constant see if it fits in for_type and
7718 in that case convert it. */
7720 && TREE_CODE (win
) == INTEGER_CST
7721 && TREE_TYPE (win
) != for_type
7722 && int_fits_type_p (win
, for_type
))
7723 win
= fold_convert (for_type
, win
);
7728 /* Return OP or a simpler expression for a narrower value
7729 which can be sign-extended or zero-extended to give back OP.
7730 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7731 or 0 if the value should be sign-extended. */
7734 get_narrower (tree op
, int *unsignedp_ptr
)
7739 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7741 while (TREE_CODE (op
) == NOP_EXPR
)
7744 = (TYPE_PRECISION (TREE_TYPE (op
))
7745 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
7747 /* Truncations are many-one so cannot be removed. */
7751 /* See what's inside this conversion. If we decide to strip it,
7756 op
= TREE_OPERAND (op
, 0);
7757 /* An extension: the outermost one can be stripped,
7758 but remember whether it is zero or sign extension. */
7760 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7761 /* Otherwise, if a sign extension has been stripped,
7762 only sign extensions can now be stripped;
7763 if a zero extension has been stripped, only zero-extensions. */
7764 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
7768 else /* bitschange == 0 */
7770 /* A change in nominal type can always be stripped, but we must
7771 preserve the unsignedness. */
7773 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7775 op
= TREE_OPERAND (op
, 0);
7776 /* Keep trying to narrow, but don't assign op to win if it
7777 would turn an integral type into something else. */
7778 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
7785 if (TREE_CODE (op
) == COMPONENT_REF
7786 /* Since type_for_size always gives an integer type. */
7787 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
7788 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
7789 /* Ensure field is laid out already. */
7790 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
7791 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
7793 unsigned HOST_WIDE_INT innerprec
7794 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
7795 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
7796 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
7797 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
7799 /* We can get this structure field in a narrower type that fits it,
7800 but the resulting extension to its nominal type (a fullword type)
7801 must satisfy the same conditions as for other extensions.
7803 Do this only for fields that are aligned (not bit-fields),
7804 because when bit-field insns will be used there is no
7805 advantage in doing this. */
7807 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
7808 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
7809 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
7813 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
7814 win
= fold_convert (type
, op
);
7818 *unsignedp_ptr
= uns
;
7822 /* Nonzero if integer constant C has a value that is permissible
7823 for type TYPE (an INTEGER_TYPE). */
7826 int_fits_type_p (const_tree c
, const_tree type
)
7828 tree type_low_bound
, type_high_bound
;
7829 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
7832 dc
= tree_to_double_int (c
);
7833 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
7835 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
7836 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
7838 /* So c is an unsigned integer whose type is sizetype and type is not.
7839 sizetype'd integers are sign extended even though they are
7840 unsigned. If the integer value fits in the lower end word of c,
7841 and if the higher end word has all its bits set to 1, that
7842 means the higher end bits are set to 1 only for sign extension.
7843 So let's convert c into an equivalent zero extended unsigned
7845 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
7848 type_low_bound
= TYPE_MIN_VALUE (type
);
7849 type_high_bound
= TYPE_MAX_VALUE (type
);
7851 /* If at least one bound of the type is a constant integer, we can check
7852 ourselves and maybe make a decision. If no such decision is possible, but
7853 this type is a subtype, try checking against that. Otherwise, use
7854 fit_double_type, which checks against the precision.
7856 Compute the status for each possibly constant bound, and return if we see
7857 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7858 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7859 for "constant known to fit". */
7861 /* Check if c >= type_low_bound. */
7862 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
7864 dd
= tree_to_double_int (type_low_bound
);
7865 if (TREE_CODE (type
) == INTEGER_TYPE
7866 && TYPE_IS_SIZETYPE (type
)
7867 && TYPE_UNSIGNED (type
))
7868 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7869 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
7871 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7872 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7874 if (c_neg
&& !t_neg
)
7876 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
7879 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
7881 ok_for_low_bound
= true;
7884 ok_for_low_bound
= false;
7886 /* Check if c <= type_high_bound. */
7887 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
7889 dd
= tree_to_double_int (type_high_bound
);
7890 if (TREE_CODE (type
) == INTEGER_TYPE
7891 && TYPE_IS_SIZETYPE (type
)
7892 && TYPE_UNSIGNED (type
))
7893 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7894 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
7896 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7897 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7899 if (t_neg
&& !c_neg
)
7901 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
7904 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
7906 ok_for_high_bound
= true;
7909 ok_for_high_bound
= false;
7911 /* If the constant fits both bounds, the result is known. */
7912 if (ok_for_low_bound
&& ok_for_high_bound
)
7915 /* Perform some generic filtering which may allow making a decision
7916 even if the bounds are not constant. First, negative integers
7917 never fit in unsigned types, */
7918 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
7921 /* Second, narrower types always fit in wider ones. */
7922 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
7925 /* Third, unsigned integers with top bit set never fit signed types. */
7926 if (! TYPE_UNSIGNED (type
) && unsc
)
7928 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
7929 if (prec
< HOST_BITS_PER_WIDE_INT
)
7931 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
7934 else if (((((unsigned HOST_WIDE_INT
) 1)
7935 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
7939 /* If we haven't been able to decide at this point, there nothing more we
7940 can check ourselves here. Look at the base type if we have one and it
7941 has the same precision. */
7942 if (TREE_CODE (type
) == INTEGER_TYPE
7943 && TREE_TYPE (type
) != 0
7944 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
7946 type
= TREE_TYPE (type
);
7950 /* Or to fit_double_type, if nothing else. */
7951 return !fit_double_type (dc
.low
, dc
.high
, &dc
.low
, &dc
.high
, type
);
7954 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7955 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7956 represented (assuming two's-complement arithmetic) within the bit
7957 precision of the type are returned instead. */
7960 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
7962 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
7963 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
7964 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
7965 TYPE_UNSIGNED (type
));
7968 if (TYPE_UNSIGNED (type
))
7969 mpz_set_ui (min
, 0);
7973 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
7974 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
7975 TYPE_PRECISION (type
));
7976 mpz_set_double_int (min
, mn
, false);
7980 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
7981 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
7982 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
7983 TYPE_UNSIGNED (type
));
7986 if (TYPE_UNSIGNED (type
))
7987 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
7990 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
7995 /* Return true if VAR is an automatic variable defined in function FN. */
7998 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8000 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8001 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8002 || TREE_CODE (var
) == PARM_DECL
)
8003 && ! TREE_STATIC (var
))
8004 || TREE_CODE (var
) == LABEL_DECL
8005 || TREE_CODE (var
) == RESULT_DECL
));
8008 /* Subprogram of following function. Called by walk_tree.
8010 Return *TP if it is an automatic variable or parameter of the
8011 function passed in as DATA. */
8014 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8016 tree fn
= (tree
) data
;
8021 else if (DECL_P (*tp
)
8022 && auto_var_in_fn_p (*tp
, fn
))
8028 /* Returns true if T is, contains, or refers to a type with variable
8029 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8030 arguments, but not the return type. If FN is nonzero, only return
8031 true if a modifier of the type or position of FN is a variable or
8032 parameter inside FN.
8034 This concept is more general than that of C99 'variably modified types':
8035 in C99, a struct type is never variably modified because a VLA may not
8036 appear as a structure member. However, in GNU C code like:
8038 struct S { int i[f()]; };
8040 is valid, and other languages may define similar constructs. */
8043 variably_modified_type_p (tree type
, tree fn
)
8047 /* Test if T is either variable (if FN is zero) or an expression containing
8048 a variable in FN. */
8049 #define RETURN_TRUE_IF_VAR(T) \
8050 do { tree _t = (T); \
8051 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8052 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8053 return true; } while (0)
8055 if (type
== error_mark_node
)
8058 /* If TYPE itself has variable size, it is variably modified. */
8059 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8060 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8062 switch (TREE_CODE (type
))
8065 case REFERENCE_TYPE
:
8067 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8073 /* If TYPE is a function type, it is variably modified if the
8074 return type is variably modified. */
8075 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8081 case FIXED_POINT_TYPE
:
8084 /* Scalar types are variably modified if their end points
8086 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8087 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8092 case QUAL_UNION_TYPE
:
8093 /* We can't see if any of the fields are variably-modified by the
8094 definition we normally use, since that would produce infinite
8095 recursion via pointers. */
8096 /* This is variably modified if some field's type is. */
8097 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
8098 if (TREE_CODE (t
) == FIELD_DECL
)
8100 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8101 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8102 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8104 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8105 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8110 /* Do not call ourselves to avoid infinite recursion. This is
8111 variably modified if the element type is. */
8112 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8113 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8120 /* The current language may have other cases to check, but in general,
8121 all other types are not variably modified. */
8122 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8124 #undef RETURN_TRUE_IF_VAR
8127 /* Given a DECL or TYPE, return the scope in which it was declared, or
8128 NULL_TREE if there is no containing scope. */
8131 get_containing_scope (const_tree t
)
8133 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8136 /* Return the innermost context enclosing DECL that is
8137 a FUNCTION_DECL, or zero if none. */
8140 decl_function_context (const_tree decl
)
8144 if (TREE_CODE (decl
) == ERROR_MARK
)
8147 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8148 where we look up the function at runtime. Such functions always take
8149 a first argument of type 'pointer to real context'.
8151 C++ should really be fixed to use DECL_CONTEXT for the real context,
8152 and use something else for the "virtual context". */
8153 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8156 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8158 context
= DECL_CONTEXT (decl
);
8160 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8162 if (TREE_CODE (context
) == BLOCK
)
8163 context
= BLOCK_SUPERCONTEXT (context
);
8165 context
= get_containing_scope (context
);
8171 /* Return the innermost context enclosing DECL that is
8172 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8173 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8176 decl_type_context (const_tree decl
)
8178 tree context
= DECL_CONTEXT (decl
);
8181 switch (TREE_CODE (context
))
8183 case NAMESPACE_DECL
:
8184 case TRANSLATION_UNIT_DECL
:
8189 case QUAL_UNION_TYPE
:
8194 context
= DECL_CONTEXT (context
);
8198 context
= BLOCK_SUPERCONTEXT (context
);
8208 /* CALL is a CALL_EXPR. Return the declaration for the function
8209 called, or NULL_TREE if the called function cannot be
8213 get_callee_fndecl (const_tree call
)
8217 if (call
== error_mark_node
)
8218 return error_mark_node
;
8220 /* It's invalid to call this function with anything but a
8222 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8224 /* The first operand to the CALL is the address of the function
8226 addr
= CALL_EXPR_FN (call
);
8230 /* If this is a readonly function pointer, extract its initial value. */
8231 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8232 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8233 && DECL_INITIAL (addr
))
8234 addr
= DECL_INITIAL (addr
);
8236 /* If the address is just `&f' for some function `f', then we know
8237 that `f' is being called. */
8238 if (TREE_CODE (addr
) == ADDR_EXPR
8239 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8240 return TREE_OPERAND (addr
, 0);
8242 /* We couldn't figure out what was being called. */
8246 /* Print debugging information about tree nodes generated during the compile,
8247 and any language-specific information. */
8250 dump_tree_statistics (void)
8252 #ifdef GATHER_STATISTICS
8254 int total_nodes
, total_bytes
;
8257 fprintf (stderr
, "\n??? tree nodes created\n\n");
8258 #ifdef GATHER_STATISTICS
8259 fprintf (stderr
, "Kind Nodes Bytes\n");
8260 fprintf (stderr
, "---------------------------------------\n");
8261 total_nodes
= total_bytes
= 0;
8262 for (i
= 0; i
< (int) all_kinds
; i
++)
8264 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8265 tree_node_counts
[i
], tree_node_sizes
[i
]);
8266 total_nodes
+= tree_node_counts
[i
];
8267 total_bytes
+= tree_node_sizes
[i
];
8269 fprintf (stderr
, "---------------------------------------\n");
8270 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8271 fprintf (stderr
, "---------------------------------------\n");
8272 ssanames_print_statistics ();
8273 phinodes_print_statistics ();
8275 fprintf (stderr
, "(No per-node statistics)\n");
8277 print_type_hash_statistics ();
8278 print_debug_expr_statistics ();
8279 print_value_expr_statistics ();
8280 lang_hooks
.print_statistics ();
8283 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8285 /* Generate a crc32 of a string. */
8288 crc32_string (unsigned chksum
, const char *string
)
8292 unsigned value
= *string
<< 24;
8295 for (ix
= 8; ix
--; value
<<= 1)
8299 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8308 /* P is a string that will be used in a symbol. Mask out any characters
8309 that are not valid in that context. */
8312 clean_symbol_name (char *p
)
8316 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8319 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8326 /* Generate a name for a special-purpose function function.
8327 The generated name may need to be unique across the whole link.
8328 TYPE is some string to identify the purpose of this function to the
8329 linker or collect2; it must start with an uppercase letter,
8331 I - for constructors
8333 N - for C++ anonymous namespaces
8334 F - for DWARF unwind frame information. */
8337 get_file_function_name (const char *type
)
8343 /* If we already have a name we know to be unique, just use that. */
8344 if (first_global_object_name
)
8345 p
= q
= ASTRDUP (first_global_object_name
);
8346 /* If the target is handling the constructors/destructors, they
8347 will be local to this file and the name is only necessary for
8348 debugging purposes. */
8349 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8351 const char *file
= main_input_filename
;
8353 file
= input_filename
;
8354 /* Just use the file's basename, because the full pathname
8355 might be quite long. */
8356 p
= strrchr (file
, '/');
8361 p
= q
= ASTRDUP (p
);
8365 /* Otherwise, the name must be unique across the entire link.
8366 We don't have anything that we know to be unique to this translation
8367 unit, so use what we do have and throw in some randomness. */
8369 const char *name
= weak_global_object_name
;
8370 const char *file
= main_input_filename
;
8375 file
= input_filename
;
8377 len
= strlen (file
);
8378 q
= (char *) alloca (9 * 2 + len
+ 1);
8379 memcpy (q
, file
, len
+ 1);
8381 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8382 crc32_string (0, get_random_seed (false)));
8387 clean_symbol_name (q
);
8388 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8391 /* Set up the name of the file-level functions we may need.
8392 Use a global object (which is already required to be unique over
8393 the program) rather than the file name (which imposes extra
8395 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8397 return get_identifier (buf
);
8400 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8402 /* Complain that the tree code of NODE does not match the expected 0
8403 terminated list of trailing codes. The trailing code list can be
8404 empty, for a more vague error message. FILE, LINE, and FUNCTION
8405 are of the caller. */
8408 tree_check_failed (const_tree node
, const char *file
,
8409 int line
, const char *function
, ...)
8413 unsigned length
= 0;
8416 va_start (args
, function
);
8417 while ((code
= va_arg (args
, int)))
8418 length
+= 4 + strlen (tree_code_name
[code
]);
8423 va_start (args
, function
);
8424 length
+= strlen ("expected ");
8425 buffer
= tmp
= (char *) alloca (length
);
8427 while ((code
= va_arg (args
, int)))
8429 const char *prefix
= length
? " or " : "expected ";
8431 strcpy (tmp
+ length
, prefix
);
8432 length
+= strlen (prefix
);
8433 strcpy (tmp
+ length
, tree_code_name
[code
]);
8434 length
+= strlen (tree_code_name
[code
]);
8439 buffer
= "unexpected node";
8441 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8442 buffer
, tree_code_name
[TREE_CODE (node
)],
8443 function
, trim_filename (file
), line
);
8446 /* Complain that the tree code of NODE does match the expected 0
8447 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8451 tree_not_check_failed (const_tree node
, const char *file
,
8452 int line
, const char *function
, ...)
8456 unsigned length
= 0;
8459 va_start (args
, function
);
8460 while ((code
= va_arg (args
, int)))
8461 length
+= 4 + strlen (tree_code_name
[code
]);
8463 va_start (args
, function
);
8464 buffer
= (char *) alloca (length
);
8466 while ((code
= va_arg (args
, int)))
8470 strcpy (buffer
+ length
, " or ");
8473 strcpy (buffer
+ length
, tree_code_name
[code
]);
8474 length
+= strlen (tree_code_name
[code
]);
8478 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8479 buffer
, tree_code_name
[TREE_CODE (node
)],
8480 function
, trim_filename (file
), line
);
8483 /* Similar to tree_check_failed, except that we check for a class of tree
8484 code, given in CL. */
8487 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8488 const char *file
, int line
, const char *function
)
8491 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8492 TREE_CODE_CLASS_STRING (cl
),
8493 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8494 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8497 /* Similar to tree_check_failed, except that instead of specifying a
8498 dozen codes, use the knowledge that they're all sequential. */
8501 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8502 const char *function
, enum tree_code c1
,
8506 unsigned length
= 0;
8509 for (c
= c1
; c
<= c2
; ++c
)
8510 length
+= 4 + strlen (tree_code_name
[c
]);
8512 length
+= strlen ("expected ");
8513 buffer
= (char *) alloca (length
);
8516 for (c
= c1
; c
<= c2
; ++c
)
8518 const char *prefix
= length
? " or " : "expected ";
8520 strcpy (buffer
+ length
, prefix
);
8521 length
+= strlen (prefix
);
8522 strcpy (buffer
+ length
, tree_code_name
[c
]);
8523 length
+= strlen (tree_code_name
[c
]);
8526 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8527 buffer
, tree_code_name
[TREE_CODE (node
)],
8528 function
, trim_filename (file
), line
);
8532 /* Similar to tree_check_failed, except that we check that a tree does
8533 not have the specified code, given in CL. */
8536 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8537 const char *file
, int line
, const char *function
)
8540 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8541 TREE_CODE_CLASS_STRING (cl
),
8542 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8543 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8547 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8550 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8551 const char *function
, enum omp_clause_code code
)
8553 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8554 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8555 function
, trim_filename (file
), line
);
8559 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8562 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8563 const char *function
, enum omp_clause_code c1
,
8564 enum omp_clause_code c2
)
8567 unsigned length
= 0;
8570 for (c
= c1
; c
<= c2
; ++c
)
8571 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8573 length
+= strlen ("expected ");
8574 buffer
= (char *) alloca (length
);
8577 for (c
= c1
; c
<= c2
; ++c
)
8579 const char *prefix
= length
? " or " : "expected ";
8581 strcpy (buffer
+ length
, prefix
);
8582 length
+= strlen (prefix
);
8583 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8584 length
+= strlen (omp_clause_code_name
[c
]);
8587 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8588 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8589 function
, trim_filename (file
), line
);
8593 #undef DEFTREESTRUCT
8594 #define DEFTREESTRUCT(VAL, NAME) NAME,
8596 static const char *ts_enum_names
[] = {
8597 #include "treestruct.def"
8599 #undef DEFTREESTRUCT
8601 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8603 /* Similar to tree_class_check_failed, except that we check for
8604 whether CODE contains the tree structure identified by EN. */
8607 tree_contains_struct_check_failed (const_tree node
,
8608 const enum tree_node_structure_enum en
,
8609 const char *file
, int line
,
8610 const char *function
)
8613 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8615 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8619 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8620 (dynamically sized) vector. */
8623 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8624 const char *function
)
8627 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8628 idx
+ 1, len
, function
, trim_filename (file
), line
);
8631 /* Similar to above, except that the check is for the bounds of the operand
8632 vector of an expression node EXP. */
8635 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8636 int line
, const char *function
)
8638 int code
= TREE_CODE (exp
);
8640 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8641 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8642 function
, trim_filename (file
), line
);
8645 /* Similar to above, except that the check is for the number of
8646 operands of an OMP_CLAUSE node. */
8649 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8650 int line
, const char *function
)
8653 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8654 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8655 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8656 trim_filename (file
), line
);
8658 #endif /* ENABLE_TREE_CHECKING */
8660 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8661 and mapped to the machine mode MODE. Initialize its fields and build
8662 the information necessary for debugging output. */
8665 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8668 hashval_t hashcode
= 0;
8670 t
= make_node (VECTOR_TYPE
);
8671 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8672 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8673 SET_TYPE_MODE (t
, mode
);
8675 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8676 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8677 else if (TYPE_CANONICAL (innertype
) != innertype
8678 || mode
!= VOIDmode
)
8680 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8685 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
8686 tree array
= build_array_type (TYPE_MAIN_VARIANT (innertype
),
8687 build_index_type (index
));
8688 tree rt
= make_node (RECORD_TYPE
);
8690 TYPE_FIELDS (rt
) = build_decl (UNKNOWN_LOCATION
, FIELD_DECL
,
8691 get_identifier ("f"), array
);
8692 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
8694 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
8695 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8696 the representation type, and we want to find that die when looking up
8697 the vector type. This is most easily achieved by making the TYPE_UID
8699 TYPE_UID (rt
) = TYPE_UID (t
);
8702 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8703 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8704 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8705 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8706 t
= type_hash_canon (hashcode
, t
);
8708 /* We have built a main variant, based on the main variant of the
8709 inner type. Use it to build the variant we return. */
8710 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8711 && TREE_TYPE (t
) != innertype
)
8712 return build_type_attribute_qual_variant (t
,
8713 TYPE_ATTRIBUTES (innertype
),
8714 TYPE_QUALS (innertype
));
8720 make_or_reuse_type (unsigned size
, int unsignedp
)
8722 if (size
== INT_TYPE_SIZE
)
8723 return unsignedp
? unsigned_type_node
: integer_type_node
;
8724 if (size
== CHAR_TYPE_SIZE
)
8725 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8726 if (size
== SHORT_TYPE_SIZE
)
8727 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8728 if (size
== LONG_TYPE_SIZE
)
8729 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8730 if (size
== LONG_LONG_TYPE_SIZE
)
8731 return (unsignedp
? long_long_unsigned_type_node
8732 : long_long_integer_type_node
);
8735 return make_unsigned_type (size
);
8737 return make_signed_type (size
);
8740 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8743 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8747 if (size
== SHORT_FRACT_TYPE_SIZE
)
8748 return unsignedp
? sat_unsigned_short_fract_type_node
8749 : sat_short_fract_type_node
;
8750 if (size
== FRACT_TYPE_SIZE
)
8751 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8752 if (size
== LONG_FRACT_TYPE_SIZE
)
8753 return unsignedp
? sat_unsigned_long_fract_type_node
8754 : sat_long_fract_type_node
;
8755 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8756 return unsignedp
? sat_unsigned_long_long_fract_type_node
8757 : sat_long_long_fract_type_node
;
8761 if (size
== SHORT_FRACT_TYPE_SIZE
)
8762 return unsignedp
? unsigned_short_fract_type_node
8763 : short_fract_type_node
;
8764 if (size
== FRACT_TYPE_SIZE
)
8765 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
8766 if (size
== LONG_FRACT_TYPE_SIZE
)
8767 return unsignedp
? unsigned_long_fract_type_node
8768 : long_fract_type_node
;
8769 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8770 return unsignedp
? unsigned_long_long_fract_type_node
8771 : long_long_fract_type_node
;
8774 return make_fract_type (size
, unsignedp
, satp
);
8777 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8780 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
8784 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8785 return unsignedp
? sat_unsigned_short_accum_type_node
8786 : sat_short_accum_type_node
;
8787 if (size
== ACCUM_TYPE_SIZE
)
8788 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
8789 if (size
== LONG_ACCUM_TYPE_SIZE
)
8790 return unsignedp
? sat_unsigned_long_accum_type_node
8791 : sat_long_accum_type_node
;
8792 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8793 return unsignedp
? sat_unsigned_long_long_accum_type_node
8794 : sat_long_long_accum_type_node
;
8798 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8799 return unsignedp
? unsigned_short_accum_type_node
8800 : short_accum_type_node
;
8801 if (size
== ACCUM_TYPE_SIZE
)
8802 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
8803 if (size
== LONG_ACCUM_TYPE_SIZE
)
8804 return unsignedp
? unsigned_long_accum_type_node
8805 : long_accum_type_node
;
8806 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8807 return unsignedp
? unsigned_long_long_accum_type_node
8808 : long_long_accum_type_node
;
8811 return make_accum_type (size
, unsignedp
, satp
);
8814 /* Create nodes for all integer types (and error_mark_node) using the sizes
8815 of C datatypes. The caller should call set_sizetype soon after calling
8816 this function to select one of the types as sizetype. */
8819 build_common_tree_nodes (bool signed_char
)
8821 error_mark_node
= make_node (ERROR_MARK
);
8822 TREE_TYPE (error_mark_node
) = error_mark_node
;
8824 initialize_sizetypes ();
8826 /* Define both `signed char' and `unsigned char'. */
8827 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
8828 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
8829 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
8830 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
8832 /* Define `char', which is like either `signed char' or `unsigned char'
8833 but not the same as either. */
8836 ? make_signed_type (CHAR_TYPE_SIZE
)
8837 : make_unsigned_type (CHAR_TYPE_SIZE
));
8838 TYPE_STRING_FLAG (char_type_node
) = 1;
8840 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
8841 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
8842 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
8843 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
8844 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
8845 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
8846 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
8847 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
8849 /* Define a boolean type. This type only represents boolean values but
8850 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8851 Front ends which want to override this size (i.e. Java) can redefine
8852 boolean_type_node before calling build_common_tree_nodes_2. */
8853 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
8854 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
8855 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
8856 TYPE_PRECISION (boolean_type_node
) = 1;
8858 /* Fill in the rest of the sized types. Reuse existing type nodes
8860 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
8861 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
8862 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
8863 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
8864 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
8866 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
8867 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
8868 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
8869 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
8870 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
8872 access_public_node
= get_identifier ("public");
8873 access_protected_node
= get_identifier ("protected");
8874 access_private_node
= get_identifier ("private");
8877 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8878 It will create several other common tree nodes. */
8881 build_common_tree_nodes_2 (int short_double
)
8883 /* Define these next since types below may used them. */
8884 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
8885 integer_one_node
= build_int_cst (NULL_TREE
, 1);
8886 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
8888 size_zero_node
= size_int (0);
8889 size_one_node
= size_int (1);
8890 bitsize_zero_node
= bitsize_int (0);
8891 bitsize_one_node
= bitsize_int (1);
8892 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
8894 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
8895 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
8897 void_type_node
= make_node (VOID_TYPE
);
8898 layout_type (void_type_node
);
8900 /* We are not going to have real types in C with less than byte alignment,
8901 so we might as well not have any types that claim to have it. */
8902 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
8903 TYPE_USER_ALIGN (void_type_node
) = 0;
8905 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
8906 layout_type (TREE_TYPE (null_pointer_node
));
8908 ptr_type_node
= build_pointer_type (void_type_node
);
8910 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
8911 fileptr_type_node
= ptr_type_node
;
8913 float_type_node
= make_node (REAL_TYPE
);
8914 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
8915 layout_type (float_type_node
);
8917 double_type_node
= make_node (REAL_TYPE
);
8919 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
8921 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
8922 layout_type (double_type_node
);
8924 long_double_type_node
= make_node (REAL_TYPE
);
8925 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
8926 layout_type (long_double_type_node
);
8928 float_ptr_type_node
= build_pointer_type (float_type_node
);
8929 double_ptr_type_node
= build_pointer_type (double_type_node
);
8930 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
8931 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
8933 /* Fixed size integer types. */
8934 uint32_type_node
= build_nonstandard_integer_type (32, true);
8935 uint64_type_node
= build_nonstandard_integer_type (64, true);
8937 /* Decimal float types. */
8938 dfloat32_type_node
= make_node (REAL_TYPE
);
8939 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
8940 layout_type (dfloat32_type_node
);
8941 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
8942 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
8944 dfloat64_type_node
= make_node (REAL_TYPE
);
8945 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
8946 layout_type (dfloat64_type_node
);
8947 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
8948 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
8950 dfloat128_type_node
= make_node (REAL_TYPE
);
8951 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
8952 layout_type (dfloat128_type_node
);
8953 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
8954 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
8956 complex_integer_type_node
= build_complex_type (integer_type_node
);
8957 complex_float_type_node
= build_complex_type (float_type_node
);
8958 complex_double_type_node
= build_complex_type (double_type_node
);
8959 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
8961 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8962 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8963 sat_ ## KIND ## _type_node = \
8964 make_sat_signed_ ## KIND ## _type (SIZE); \
8965 sat_unsigned_ ## KIND ## _type_node = \
8966 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8967 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8968 unsigned_ ## KIND ## _type_node = \
8969 make_unsigned_ ## KIND ## _type (SIZE);
8971 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8972 sat_ ## WIDTH ## KIND ## _type_node = \
8973 make_sat_signed_ ## KIND ## _type (SIZE); \
8974 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8975 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8976 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8977 unsigned_ ## WIDTH ## KIND ## _type_node = \
8978 make_unsigned_ ## KIND ## _type (SIZE);
8980 /* Make fixed-point type nodes based on four different widths. */
8981 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8982 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8983 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8984 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8985 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8987 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8988 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8989 NAME ## _type_node = \
8990 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8991 u ## NAME ## _type_node = \
8992 make_or_reuse_unsigned_ ## KIND ## _type \
8993 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8994 sat_ ## NAME ## _type_node = \
8995 make_or_reuse_sat_signed_ ## KIND ## _type \
8996 (GET_MODE_BITSIZE (MODE ## mode)); \
8997 sat_u ## NAME ## _type_node = \
8998 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8999 (GET_MODE_BITSIZE (U ## MODE ## mode));
9001 /* Fixed-point type and mode nodes. */
9002 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9003 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9004 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9005 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9006 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9007 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9008 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9009 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9010 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9011 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9012 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9015 tree t
= targetm
.build_builtin_va_list ();
9017 /* Many back-ends define record types without setting TYPE_NAME.
9018 If we copied the record type here, we'd keep the original
9019 record type without a name. This breaks name mangling. So,
9020 don't copy record types and let c_common_nodes_and_builtins()
9021 declare the type to be __builtin_va_list. */
9022 if (TREE_CODE (t
) != RECORD_TYPE
)
9023 t
= build_variant_type_copy (t
);
9025 va_list_type_node
= t
;
9029 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9032 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9033 const char *library_name
, int ecf_flags
)
9037 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9038 library_name
, NULL_TREE
);
9039 if (ecf_flags
& ECF_CONST
)
9040 TREE_READONLY (decl
) = 1;
9041 if (ecf_flags
& ECF_PURE
)
9042 DECL_PURE_P (decl
) = 1;
9043 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9044 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9045 if (ecf_flags
& ECF_NORETURN
)
9046 TREE_THIS_VOLATILE (decl
) = 1;
9047 if (ecf_flags
& ECF_NOTHROW
)
9048 TREE_NOTHROW (decl
) = 1;
9049 if (ecf_flags
& ECF_MALLOC
)
9050 DECL_IS_MALLOC (decl
) = 1;
9052 built_in_decls
[code
] = decl
;
9053 implicit_built_in_decls
[code
] = decl
;
9056 /* Call this function after instantiating all builtins that the language
9057 front end cares about. This will build the rest of the builtins that
9058 are relied upon by the tree optimizers and the middle-end. */
9061 build_common_builtin_nodes (void)
9063 tree tmp
, tmp2
, ftype
;
9065 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
9066 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9068 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9069 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
9070 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9071 ftype
= build_function_type (ptr_type_node
, tmp
);
9073 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
9074 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9075 "memcpy", ECF_NOTHROW
);
9076 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9077 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9078 "memmove", ECF_NOTHROW
);
9081 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
9083 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9084 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
9085 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
9086 ftype
= build_function_type (integer_type_node
, tmp
);
9087 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9088 "memcmp", ECF_PURE
| ECF_NOTHROW
);
9091 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
9093 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9094 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
9095 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9096 ftype
= build_function_type (ptr_type_node
, tmp
);
9097 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9098 "memset", ECF_NOTHROW
);
9101 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9103 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9104 ftype
= build_function_type (ptr_type_node
, tmp
);
9105 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9107 ECF_MALLOC
| (flag_stack_check
? 0 : ECF_NOTHROW
));
9110 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9111 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9112 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9113 ftype
= build_function_type (void_type_node
, tmp
);
9114 local_define_builtin ("__builtin_init_trampoline", ftype
,
9115 BUILT_IN_INIT_TRAMPOLINE
,
9116 "__builtin_init_trampoline", ECF_NOTHROW
);
9118 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9119 ftype
= build_function_type (ptr_type_node
, tmp
);
9120 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9121 BUILT_IN_ADJUST_TRAMPOLINE
,
9122 "__builtin_adjust_trampoline",
9123 ECF_CONST
| ECF_NOTHROW
);
9125 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9126 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9127 ftype
= build_function_type (void_type_node
, tmp
);
9128 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9129 BUILT_IN_NONLOCAL_GOTO
,
9130 "__builtin_nonlocal_goto",
9131 ECF_NORETURN
| ECF_NOTHROW
);
9133 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9134 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9135 ftype
= build_function_type (void_type_node
, tmp
);
9136 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9137 BUILT_IN_SETJMP_SETUP
,
9138 "__builtin_setjmp_setup", ECF_NOTHROW
);
9140 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9141 ftype
= build_function_type (ptr_type_node
, tmp
);
9142 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9143 BUILT_IN_SETJMP_DISPATCHER
,
9144 "__builtin_setjmp_dispatcher",
9145 ECF_PURE
| ECF_NOTHROW
);
9147 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9148 ftype
= build_function_type (void_type_node
, tmp
);
9149 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9150 BUILT_IN_SETJMP_RECEIVER
,
9151 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9153 ftype
= build_function_type (ptr_type_node
, void_list_node
);
9154 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9155 "__builtin_stack_save", ECF_NOTHROW
);
9157 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9158 ftype
= build_function_type (void_type_node
, tmp
);
9159 local_define_builtin ("__builtin_stack_restore", ftype
,
9160 BUILT_IN_STACK_RESTORE
,
9161 "__builtin_stack_restore", ECF_NOTHROW
);
9163 ftype
= build_function_type (void_type_node
, void_list_node
);
9164 local_define_builtin ("__builtin_profile_func_enter", ftype
,
9165 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
9166 local_define_builtin ("__builtin_profile_func_exit", ftype
,
9167 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
9169 /* If there's a possibility that we might use the ARM EABI, build the
9170 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9171 if (targetm
.arm_eabi_unwinder
)
9173 ftype
= build_function_type (void_type_node
, void_list_node
);
9174 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9175 BUILT_IN_CXA_END_CLEANUP
,
9176 "__cxa_end_cleanup", ECF_NORETURN
);
9179 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9180 ftype
= build_function_type (void_type_node
, tmp
);
9181 local_define_builtin ("__builtin_unwind_resume", ftype
,
9182 BUILT_IN_UNWIND_RESUME
,
9183 (USING_SJLJ_EXCEPTIONS
9184 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9187 /* The exception object and filter values from the runtime. The argument
9188 must be zero before exception lowering, i.e. from the front end. After
9189 exception lowering, it will be the region number for the exception
9190 landing pad. These functions are PURE instead of CONST to prevent
9191 them from being hoisted past the exception edge that will initialize
9192 its value in the landing pad. */
9193 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9194 ftype
= build_function_type (ptr_type_node
, tmp
);
9195 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9196 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
);
9198 tmp2
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9199 ftype
= build_function_type (tmp2
, tmp
);
9200 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9201 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
);
9203 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9204 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
9205 ftype
= build_function_type (void_type_node
, tmp
);
9206 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9207 BUILT_IN_EH_COPY_VALUES
,
9208 "__builtin_eh_copy_values", ECF_NOTHROW
);
9210 /* Complex multiplication and division. These are handled as builtins
9211 rather than optabs because emit_library_call_value doesn't support
9212 complex. Further, we can do slightly better with folding these
9213 beasties if the real and complex parts of the arguments are separate. */
9217 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9219 char mode_name_buf
[4], *q
;
9221 enum built_in_function mcode
, dcode
;
9222 tree type
, inner_type
;
9224 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9227 inner_type
= TREE_TYPE (type
);
9229 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
9230 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9231 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9232 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9233 ftype
= build_function_type (type
, tmp
);
9235 mcode
= ((enum built_in_function
)
9236 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9237 dcode
= ((enum built_in_function
)
9238 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9240 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9244 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9245 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9246 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
9248 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9249 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9250 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
9255 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9258 If we requested a pointer to a vector, build up the pointers that
9259 we stripped off while looking for the inner type. Similarly for
9260 return values from functions.
9262 The argument TYPE is the top of the chain, and BOTTOM is the
9263 new type which we will point to. */
9266 reconstruct_complex_type (tree type
, tree bottom
)
9270 if (TREE_CODE (type
) == POINTER_TYPE
)
9272 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9273 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9274 TYPE_REF_CAN_ALIAS_ALL (type
));
9276 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9278 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9279 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9280 TYPE_REF_CAN_ALIAS_ALL (type
));
9282 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9284 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9285 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9287 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9289 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9290 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9292 else if (TREE_CODE (type
) == METHOD_TYPE
)
9294 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9295 /* The build_method_type_directly() routine prepends 'this' to argument list,
9296 so we must compensate by getting rid of it. */
9298 = build_method_type_directly
9299 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9301 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9303 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9305 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9306 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9311 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9315 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9318 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9322 switch (GET_MODE_CLASS (mode
))
9324 case MODE_VECTOR_INT
:
9325 case MODE_VECTOR_FLOAT
:
9326 case MODE_VECTOR_FRACT
:
9327 case MODE_VECTOR_UFRACT
:
9328 case MODE_VECTOR_ACCUM
:
9329 case MODE_VECTOR_UACCUM
:
9330 nunits
= GET_MODE_NUNITS (mode
);
9334 /* Check that there are no leftover bits. */
9335 gcc_assert (GET_MODE_BITSIZE (mode
)
9336 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9338 nunits
= GET_MODE_BITSIZE (mode
)
9339 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9346 return make_vector_type (innertype
, nunits
, mode
);
9349 /* Similarly, but takes the inner type and number of units, which must be
9353 build_vector_type (tree innertype
, int nunits
)
9355 return make_vector_type (innertype
, nunits
, VOIDmode
);
9358 /* Similarly, but takes the inner type and number of units, which must be
9362 build_opaque_vector_type (tree innertype
, int nunits
)
9365 innertype
= build_distinct_type_copy (innertype
);
9366 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9367 TYPE_VECTOR_OPAQUE (t
) = true;
9372 /* Given an initializer INIT, return TRUE if INIT is zero or some
9373 aggregate of zeros. Otherwise return FALSE. */
9375 initializer_zerop (const_tree init
)
9381 switch (TREE_CODE (init
))
9384 return integer_zerop (init
);
9387 /* ??? Note that this is not correct for C4X float formats. There,
9388 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9389 negative exponent. */
9390 return real_zerop (init
)
9391 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9394 return fixed_zerop (init
);
9397 return integer_zerop (init
)
9398 || (real_zerop (init
)
9399 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9400 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9403 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9404 if (!initializer_zerop (TREE_VALUE (elt
)))
9410 unsigned HOST_WIDE_INT idx
;
9412 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9413 if (!initializer_zerop (elt
))
9422 /* We need to loop through all elements to handle cases like
9423 "\0" and "\0foobar". */
9424 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9425 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9436 /* Build an empty statement at location LOC. */
9439 build_empty_stmt (location_t loc
)
9441 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9442 SET_EXPR_LOCATION (t
, loc
);
9447 /* Build an OpenMP clause with code CODE. LOC is the location of the
9451 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9456 length
= omp_clause_num_ops
[code
];
9457 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9459 t
= GGC_NEWVAR (union tree_node
, size
);
9460 memset (t
, 0, size
);
9461 TREE_SET_CODE (t
, OMP_CLAUSE
);
9462 OMP_CLAUSE_SET_CODE (t
, code
);
9463 OMP_CLAUSE_LOCATION (t
) = loc
;
9465 #ifdef GATHER_STATISTICS
9466 tree_node_counts
[(int) omp_clause_kind
]++;
9467 tree_node_sizes
[(int) omp_clause_kind
] += size
;
9473 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9474 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9475 Except for the CODE and operand count field, other storage for the
9476 object is initialized to zeros. */
9479 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9482 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9484 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9485 gcc_assert (len
>= 1);
9487 #ifdef GATHER_STATISTICS
9488 tree_node_counts
[(int) e_kind
]++;
9489 tree_node_sizes
[(int) e_kind
] += length
;
9492 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
9494 memset (t
, 0, length
);
9496 TREE_SET_CODE (t
, code
);
9498 /* Can't use TREE_OPERAND to store the length because if checking is
9499 enabled, it will try to check the length before we store it. :-P */
9500 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9506 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9507 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9511 build_call_list (tree return_type
, tree fn
, tree arglist
)
9516 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
9517 TREE_TYPE (t
) = return_type
;
9518 CALL_EXPR_FN (t
) = fn
;
9519 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9520 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
9521 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
9522 process_call_operands (t
);
9526 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9527 FN and a null static chain slot. NARGS is the number of call arguments
9528 which are specified as "..." arguments. */
9531 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9535 va_start (args
, nargs
);
9536 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9541 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9542 FN and a null static chain slot. NARGS is the number of call arguments
9543 which are specified as a va_list ARGS. */
9546 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9551 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9552 TREE_TYPE (t
) = return_type
;
9553 CALL_EXPR_FN (t
) = fn
;
9554 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9555 for (i
= 0; i
< nargs
; i
++)
9556 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9557 process_call_operands (t
);
9561 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9562 FN and a null static chain slot. NARGS is the number of call arguments
9563 which are specified as a tree array ARGS. */
9566 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9567 int nargs
, const tree
*args
)
9572 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9573 TREE_TYPE (t
) = return_type
;
9574 CALL_EXPR_FN (t
) = fn
;
9575 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9576 for (i
= 0; i
< nargs
; i
++)
9577 CALL_EXPR_ARG (t
, i
) = args
[i
];
9578 process_call_operands (t
);
9579 SET_EXPR_LOCATION (t
, loc
);
9583 /* Like build_call_array, but takes a VEC. */
9586 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9591 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
9592 TREE_TYPE (ret
) = return_type
;
9593 CALL_EXPR_FN (ret
) = fn
;
9594 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
9595 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
9596 CALL_EXPR_ARG (ret
, ix
) = t
;
9597 process_call_operands (ret
);
9602 /* Returns true if it is possible to prove that the index of
9603 an array access REF (an ARRAY_REF expression) falls into the
9607 in_array_bounds_p (tree ref
)
9609 tree idx
= TREE_OPERAND (ref
, 1);
9612 if (TREE_CODE (idx
) != INTEGER_CST
)
9615 min
= array_ref_low_bound (ref
);
9616 max
= array_ref_up_bound (ref
);
9619 || TREE_CODE (min
) != INTEGER_CST
9620 || TREE_CODE (max
) != INTEGER_CST
)
9623 if (tree_int_cst_lt (idx
, min
)
9624 || tree_int_cst_lt (max
, idx
))
9630 /* Returns true if it is possible to prove that the range of
9631 an array access REF (an ARRAY_RANGE_REF expression) falls
9632 into the array bounds. */
9635 range_in_array_bounds_p (tree ref
)
9637 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9638 tree range_min
, range_max
, min
, max
;
9640 range_min
= TYPE_MIN_VALUE (domain_type
);
9641 range_max
= TYPE_MAX_VALUE (domain_type
);
9644 || TREE_CODE (range_min
) != INTEGER_CST
9645 || TREE_CODE (range_max
) != INTEGER_CST
)
9648 min
= array_ref_low_bound (ref
);
9649 max
= array_ref_up_bound (ref
);
9652 || TREE_CODE (min
) != INTEGER_CST
9653 || TREE_CODE (max
) != INTEGER_CST
)
9656 if (tree_int_cst_lt (range_min
, min
)
9657 || tree_int_cst_lt (max
, range_max
))
9663 /* Return true if T (assumed to be a DECL) must be assigned a memory
9667 needs_to_live_in_memory (const_tree t
)
9669 if (TREE_CODE (t
) == SSA_NAME
)
9670 t
= SSA_NAME_VAR (t
);
9672 return (TREE_ADDRESSABLE (t
)
9673 || is_global_var (t
)
9674 || (TREE_CODE (t
) == RESULT_DECL
9675 && aggregate_value_p (t
, current_function_decl
)));
9678 /* There are situations in which a language considers record types
9679 compatible which have different field lists. Decide if two fields
9680 are compatible. It is assumed that the parent records are compatible. */
9683 fields_compatible_p (const_tree f1
, const_tree f2
)
9685 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9686 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9689 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9690 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9693 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9699 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9702 find_compatible_field (tree record
, tree orig_field
)
9706 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9707 if (TREE_CODE (f
) == FIELD_DECL
9708 && fields_compatible_p (f
, orig_field
))
9711 /* ??? Why isn't this on the main fields list? */
9712 f
= TYPE_VFIELD (record
);
9713 if (f
&& TREE_CODE (f
) == FIELD_DECL
9714 && fields_compatible_p (f
, orig_field
))
9717 /* ??? We should abort here, but Java appears to do Bad Things
9718 with inherited fields. */
9722 /* Return value of a constant X and sign-extend it. */
9725 int_cst_value (const_tree x
)
9727 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9728 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9730 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9731 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9732 || TREE_INT_CST_HIGH (x
) == -1);
9734 if (bits
< HOST_BITS_PER_WIDE_INT
)
9736 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9738 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9740 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9746 /* Return value of a constant X and sign-extend it. */
9749 widest_int_cst_value (const_tree x
)
9751 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9752 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9754 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9755 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9756 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9757 << HOST_BITS_PER_WIDE_INT
);
9759 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9760 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9761 || TREE_INT_CST_HIGH (x
) == -1);
9764 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9766 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9768 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9770 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9776 /* If TYPE is an integral type, return an equivalent type which is
9777 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9778 return TYPE itself. */
9781 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9784 if (POINTER_TYPE_P (type
))
9786 /* If the pointer points to the normal address space, use the
9787 size_type_node. Otherwise use an appropriate size for the pointer
9788 based on the named address space it points to. */
9789 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
9792 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9795 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9798 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9801 /* Returns unsigned variant of TYPE. */
9804 unsigned_type_for (tree type
)
9806 return signed_or_unsigned_type_for (1, type
);
9809 /* Returns signed variant of TYPE. */
9812 signed_type_for (tree type
)
9814 return signed_or_unsigned_type_for (0, type
);
9817 /* Returns the largest value obtainable by casting something in INNER type to
9821 upper_bound_in_type (tree outer
, tree inner
)
9823 unsigned HOST_WIDE_INT lo
, hi
;
9824 unsigned int det
= 0;
9825 unsigned oprec
= TYPE_PRECISION (outer
);
9826 unsigned iprec
= TYPE_PRECISION (inner
);
9829 /* Compute a unique number for every combination. */
9830 det
|= (oprec
> iprec
) ? 4 : 0;
9831 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
9832 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
9834 /* Determine the exponent to use. */
9839 /* oprec <= iprec, outer: signed, inner: don't care. */
9844 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9848 /* oprec > iprec, outer: signed, inner: signed. */
9852 /* oprec > iprec, outer: signed, inner: unsigned. */
9856 /* oprec > iprec, outer: unsigned, inner: signed. */
9860 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9867 /* Compute 2^^prec - 1. */
9868 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9871 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
9872 >> (HOST_BITS_PER_WIDE_INT
- prec
));
9876 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9877 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
9878 lo
= ~(unsigned HOST_WIDE_INT
) 0;
9881 return build_int_cst_wide (outer
, lo
, hi
);
9884 /* Returns the smallest value obtainable by casting something in INNER type to
9888 lower_bound_in_type (tree outer
, tree inner
)
9890 unsigned HOST_WIDE_INT lo
, hi
;
9891 unsigned oprec
= TYPE_PRECISION (outer
);
9892 unsigned iprec
= TYPE_PRECISION (inner
);
9894 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9896 if (TYPE_UNSIGNED (outer
)
9897 /* If we are widening something of an unsigned type, OUTER type
9898 contains all values of INNER type. In particular, both INNER
9899 and OUTER types have zero in common. */
9900 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
9904 /* If we are widening a signed type to another signed type, we
9905 want to obtain -2^^(iprec-1). If we are keeping the
9906 precision or narrowing to a signed type, we want to obtain
9908 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
9910 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9912 hi
= ~(unsigned HOST_WIDE_INT
) 0;
9913 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
9917 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9918 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
9923 return build_int_cst_wide (outer
, lo
, hi
);
9926 /* Return nonzero if two operands that are suitable for PHI nodes are
9927 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9928 SSA_NAME or invariant. Note that this is strictly an optimization.
9929 That is, callers of this function can directly call operand_equal_p
9930 and get the same result, only slower. */
9933 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
9937 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
9939 return operand_equal_p (arg0
, arg1
, 0);
9942 /* Returns number of zeros at the end of binary representation of X.
9944 ??? Use ffs if available? */
9947 num_ending_zeros (const_tree x
)
9949 unsigned HOST_WIDE_INT fr
, nfr
;
9950 unsigned num
, abits
;
9951 tree type
= TREE_TYPE (x
);
9953 if (TREE_INT_CST_LOW (x
) == 0)
9955 num
= HOST_BITS_PER_WIDE_INT
;
9956 fr
= TREE_INT_CST_HIGH (x
);
9961 fr
= TREE_INT_CST_LOW (x
);
9964 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
9967 if (nfr
<< abits
== fr
)
9974 if (num
> TYPE_PRECISION (type
))
9975 num
= TYPE_PRECISION (type
);
9977 return build_int_cst_type (type
, num
);
9981 #define WALK_SUBTREE(NODE) \
9984 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9990 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9991 be walked whenever a type is seen in the tree. Rest of operands and return
9992 value are as for walk_tree. */
9995 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
9996 struct pointer_set_t
*pset
, walk_tree_lh lh
)
9998 tree result
= NULL_TREE
;
10000 switch (TREE_CODE (type
))
10003 case REFERENCE_TYPE
:
10004 /* We have to worry about mutually recursive pointers. These can't
10005 be written in C. They can in Ada. It's pathological, but
10006 there's an ACATS test (c38102a) that checks it. Deal with this
10007 by checking if we're pointing to another pointer, that one
10008 points to another pointer, that one does too, and we have no htab.
10009 If so, get a hash table. We check three levels deep to avoid
10010 the cost of the hash table if we don't need one. */
10011 if (POINTER_TYPE_P (TREE_TYPE (type
))
10012 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10013 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10016 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10024 /* ... fall through ... */
10027 WALK_SUBTREE (TREE_TYPE (type
));
10031 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10033 /* Fall through. */
10035 case FUNCTION_TYPE
:
10036 WALK_SUBTREE (TREE_TYPE (type
));
10040 /* We never want to walk into default arguments. */
10041 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10042 WALK_SUBTREE (TREE_VALUE (arg
));
10047 /* Don't follow this nodes's type if a pointer for fear that
10048 we'll have infinite recursion. If we have a PSET, then we
10051 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10052 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10053 WALK_SUBTREE (TREE_TYPE (type
));
10054 WALK_SUBTREE (TYPE_DOMAIN (type
));
10058 WALK_SUBTREE (TREE_TYPE (type
));
10059 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10069 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10070 called with the DATA and the address of each sub-tree. If FUNC returns a
10071 non-NULL value, the traversal is stopped, and the value returned by FUNC
10072 is returned. If PSET is non-NULL it is used to record the nodes visited,
10073 and to avoid visiting a node more than once. */
10076 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10077 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10079 enum tree_code code
;
10083 #define WALK_SUBTREE_TAIL(NODE) \
10087 goto tail_recurse; \
10092 /* Skip empty subtrees. */
10096 /* Don't walk the same tree twice, if the user has requested
10097 that we avoid doing so. */
10098 if (pset
&& pointer_set_insert (pset
, *tp
))
10101 /* Call the function. */
10103 result
= (*func
) (tp
, &walk_subtrees
, data
);
10105 /* If we found something, return it. */
10109 code
= TREE_CODE (*tp
);
10111 /* Even if we didn't, FUNC may have decided that there was nothing
10112 interesting below this point in the tree. */
10113 if (!walk_subtrees
)
10115 /* But we still need to check our siblings. */
10116 if (code
== TREE_LIST
)
10117 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10118 else if (code
== OMP_CLAUSE
)
10119 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10126 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10127 if (result
|| !walk_subtrees
)
10134 case IDENTIFIER_NODE
:
10141 case PLACEHOLDER_EXPR
:
10145 /* None of these have subtrees other than those already walked
10150 WALK_SUBTREE (TREE_VALUE (*tp
));
10151 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10156 int len
= TREE_VEC_LENGTH (*tp
);
10161 /* Walk all elements but the first. */
10163 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10165 /* Now walk the first one as a tail call. */
10166 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10170 WALK_SUBTREE (TREE_REALPART (*tp
));
10171 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10175 unsigned HOST_WIDE_INT idx
;
10176 constructor_elt
*ce
;
10179 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10181 WALK_SUBTREE (ce
->value
);
10186 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10191 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
10193 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10194 into declarations that are just mentioned, rather than
10195 declared; they don't really belong to this part of the tree.
10196 And, we can see cycles: the initializer for a declaration
10197 can refer to the declaration itself. */
10198 WALK_SUBTREE (DECL_INITIAL (decl
));
10199 WALK_SUBTREE (DECL_SIZE (decl
));
10200 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10202 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10205 case STATEMENT_LIST
:
10207 tree_stmt_iterator i
;
10208 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10209 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10214 switch (OMP_CLAUSE_CODE (*tp
))
10216 case OMP_CLAUSE_PRIVATE
:
10217 case OMP_CLAUSE_SHARED
:
10218 case OMP_CLAUSE_FIRSTPRIVATE
:
10219 case OMP_CLAUSE_COPYIN
:
10220 case OMP_CLAUSE_COPYPRIVATE
:
10221 case OMP_CLAUSE_IF
:
10222 case OMP_CLAUSE_NUM_THREADS
:
10223 case OMP_CLAUSE_SCHEDULE
:
10224 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10227 case OMP_CLAUSE_NOWAIT
:
10228 case OMP_CLAUSE_ORDERED
:
10229 case OMP_CLAUSE_DEFAULT
:
10230 case OMP_CLAUSE_UNTIED
:
10231 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10233 case OMP_CLAUSE_LASTPRIVATE
:
10234 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10235 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10236 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10238 case OMP_CLAUSE_COLLAPSE
:
10241 for (i
= 0; i
< 3; i
++)
10242 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10243 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10246 case OMP_CLAUSE_REDUCTION
:
10249 for (i
= 0; i
< 4; i
++)
10250 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10251 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10255 gcc_unreachable ();
10263 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10264 But, we only want to walk once. */
10265 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10266 for (i
= 0; i
< len
; ++i
)
10267 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10268 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10272 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10273 defining. We only want to walk into these fields of a type in this
10274 case and not in the general case of a mere reference to the type.
10276 The criterion is as follows: if the field can be an expression, it
10277 must be walked only here. This should be in keeping with the fields
10278 that are directly gimplified in gimplify_type_sizes in order for the
10279 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10280 variable-sized types.
10282 Note that DECLs get walked as part of processing the BIND_EXPR. */
10283 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10285 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10286 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10289 /* Call the function for the type. See if it returns anything or
10290 doesn't want us to continue. If we are to continue, walk both
10291 the normal fields and those for the declaration case. */
10292 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10293 if (result
|| !walk_subtrees
)
10296 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10300 /* If this is a record type, also walk the fields. */
10301 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10305 for (field
= TYPE_FIELDS (*type_p
); field
;
10306 field
= TREE_CHAIN (field
))
10308 /* We'd like to look at the type of the field, but we can
10309 easily get infinite recursion. So assume it's pointed
10310 to elsewhere in the tree. Also, ignore things that
10312 if (TREE_CODE (field
) != FIELD_DECL
)
10315 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10316 WALK_SUBTREE (DECL_SIZE (field
));
10317 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10318 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10319 WALK_SUBTREE (DECL_QUALIFIER (field
));
10323 /* Same for scalar types. */
10324 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10325 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10326 || TREE_CODE (*type_p
) == INTEGER_TYPE
10327 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10328 || TREE_CODE (*type_p
) == REAL_TYPE
)
10330 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10331 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10334 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10335 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10340 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10344 /* Walk over all the sub-trees of this operand. */
10345 len
= TREE_OPERAND_LENGTH (*tp
);
10347 /* Go through the subtrees. We need to do this in forward order so
10348 that the scope of a FOR_EXPR is handled properly. */
10351 for (i
= 0; i
< len
- 1; ++i
)
10352 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10353 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10356 /* If this is a type, walk the needed fields in the type. */
10357 else if (TYPE_P (*tp
))
10358 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10362 /* We didn't find what we were looking for. */
10365 #undef WALK_SUBTREE_TAIL
10367 #undef WALK_SUBTREE
10369 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10372 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10376 struct pointer_set_t
*pset
;
10378 pset
= pointer_set_create ();
10379 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10380 pointer_set_destroy (pset
);
10386 tree_block (tree t
)
10388 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10390 if (IS_EXPR_CODE_CLASS (c
))
10391 return &t
->exp
.block
;
10392 gcc_unreachable ();
10396 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10397 FIXME: don't use this function. It exists for compatibility with
10398 the old representation of CALL_EXPRs where a list was used to hold the
10399 arguments. Places that currently extract the arglist from a CALL_EXPR
10400 ought to be rewritten to use the CALL_EXPR itself. */
10402 call_expr_arglist (tree exp
)
10404 tree arglist
= NULL_TREE
;
10406 for (i
= call_expr_nargs (exp
) - 1; i
>= 0; i
--)
10407 arglist
= tree_cons (NULL_TREE
, CALL_EXPR_ARG (exp
, i
), arglist
);
10412 /* Create a nameless artificial label and put it in the current
10413 function context. The label has a location of LOC. Returns the
10414 newly created label. */
10417 create_artificial_label (location_t loc
)
10419 tree lab
= build_decl (loc
,
10420 LABEL_DECL
, NULL_TREE
, void_type_node
);
10422 DECL_ARTIFICIAL (lab
) = 1;
10423 DECL_IGNORED_P (lab
) = 1;
10424 DECL_CONTEXT (lab
) = current_function_decl
;
10428 /* Given a tree, try to return a useful variable name that we can use
10429 to prefix a temporary that is being assigned the value of the tree.
10430 I.E. given <temp> = &A, return A. */
10435 tree stripped_decl
;
10438 STRIP_NOPS (stripped_decl
);
10439 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10440 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10443 switch (TREE_CODE (stripped_decl
))
10446 return get_name (TREE_OPERAND (stripped_decl
, 0));
10453 /* Return true if TYPE has a variable argument list. */
10456 stdarg_p (tree fntype
)
10458 function_args_iterator args_iter
;
10459 tree n
= NULL_TREE
, t
;
10464 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10469 return n
!= NULL_TREE
&& n
!= void_type_node
;
10472 /* Return true if TYPE has a prototype. */
10475 prototype_p (tree fntype
)
10479 gcc_assert (fntype
!= NULL_TREE
);
10481 t
= TYPE_ARG_TYPES (fntype
);
10482 return (t
!= NULL_TREE
);
10485 /* If BLOCK is inlined from an __attribute__((__artificial__))
10486 routine, return pointer to location from where it has been
10489 block_nonartificial_location (tree block
)
10491 location_t
*ret
= NULL
;
10493 while (block
&& TREE_CODE (block
) == BLOCK
10494 && BLOCK_ABSTRACT_ORIGIN (block
))
10496 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10498 while (TREE_CODE (ao
) == BLOCK
10499 && BLOCK_ABSTRACT_ORIGIN (ao
)
10500 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10501 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10503 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10505 /* If AO is an artificial inline, point RET to the
10506 call site locus at which it has been inlined and continue
10507 the loop, in case AO's caller is also an artificial
10509 if (DECL_DECLARED_INLINE_P (ao
)
10510 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10511 ret
= &BLOCK_SOURCE_LOCATION (block
);
10515 else if (TREE_CODE (ao
) != BLOCK
)
10518 block
= BLOCK_SUPERCONTEXT (block
);
10524 /* If EXP is inlined from an __attribute__((__artificial__))
10525 function, return the location of the original call expression. */
10528 tree_nonartificial_location (tree exp
)
10530 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10535 return EXPR_LOCATION (exp
);
10539 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10542 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10545 cl_option_hash_hash (const void *x
)
10547 const_tree
const t
= (const_tree
) x
;
10551 hashval_t hash
= 0;
10553 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10555 p
= (const char *)TREE_OPTIMIZATION (t
);
10556 len
= sizeof (struct cl_optimization
);
10559 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10561 p
= (const char *)TREE_TARGET_OPTION (t
);
10562 len
= sizeof (struct cl_target_option
);
10566 gcc_unreachable ();
10568 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10570 for (i
= 0; i
< len
; i
++)
10572 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10577 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10578 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10582 cl_option_hash_eq (const void *x
, const void *y
)
10584 const_tree
const xt
= (const_tree
) x
;
10585 const_tree
const yt
= (const_tree
) y
;
10590 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10593 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10595 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10596 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10597 len
= sizeof (struct cl_optimization
);
10600 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10602 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10603 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10604 len
= sizeof (struct cl_target_option
);
10608 gcc_unreachable ();
10610 return (memcmp (xp
, yp
, len
) == 0);
10613 /* Build an OPTIMIZATION_NODE based on the current options. */
10616 build_optimization_node (void)
10621 /* Use the cache of optimization nodes. */
10623 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
));
10625 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10629 /* Insert this one into the hash table. */
10630 t
= cl_optimization_node
;
10633 /* Make a new node for next time round. */
10634 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10640 /* Build a TARGET_OPTION_NODE based on the current options. */
10643 build_target_option_node (void)
10648 /* Use the cache of optimization nodes. */
10650 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
));
10652 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10656 /* Insert this one into the hash table. */
10657 t
= cl_target_option_node
;
10660 /* Make a new node for next time round. */
10661 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10667 /* Determine the "ultimate origin" of a block. The block may be an inlined
10668 instance of an inlined instance of a block which is local to an inline
10669 function, so we have to trace all of the way back through the origin chain
10670 to find out what sort of node actually served as the original seed for the
10674 block_ultimate_origin (const_tree block
)
10676 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10678 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10679 nodes in the function to point to themselves; ignore that if
10680 we're trying to output the abstract instance of this function. */
10681 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10684 if (immediate_origin
== NULL_TREE
)
10689 tree lookahead
= immediate_origin
;
10693 ret_val
= lookahead
;
10694 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10695 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10697 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10699 /* The block's abstract origin chain may not be the *ultimate* origin of
10700 the block. It could lead to a DECL that has an abstract origin set.
10701 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10702 will give us if it has one). Note that DECL's abstract origins are
10703 supposed to be the most distant ancestor (or so decl_ultimate_origin
10704 claims), so we don't need to loop following the DECL origins. */
10705 if (DECL_P (ret_val
))
10706 return DECL_ORIGIN (ret_val
);
10712 /* Return true if T1 and T2 are equivalent lists. */
10715 list_equal_p (const_tree t1
, const_tree t2
)
10717 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10718 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10723 /* Return true iff conversion in EXP generates no instruction. Mark
10724 it inline so that we fully inline into the stripping functions even
10725 though we have two uses of this function. */
10728 tree_nop_conversion (const_tree exp
)
10730 tree outer_type
, inner_type
;
10732 if (!CONVERT_EXPR_P (exp
)
10733 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10735 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10738 outer_type
= TREE_TYPE (exp
);
10739 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10744 /* Use precision rather then machine mode when we can, which gives
10745 the correct answer even for submode (bit-field) types. */
10746 if ((INTEGRAL_TYPE_P (outer_type
)
10747 || POINTER_TYPE_P (outer_type
)
10748 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10749 && (INTEGRAL_TYPE_P (inner_type
)
10750 || POINTER_TYPE_P (inner_type
)
10751 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10752 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10754 /* Otherwise fall back on comparing machine modes (e.g. for
10755 aggregate types, floats). */
10756 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10759 /* Return true iff conversion in EXP generates no instruction. Don't
10760 consider conversions changing the signedness. */
10763 tree_sign_nop_conversion (const_tree exp
)
10765 tree outer_type
, inner_type
;
10767 if (!tree_nop_conversion (exp
))
10770 outer_type
= TREE_TYPE (exp
);
10771 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10773 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10774 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10777 /* Strip conversions from EXP according to tree_nop_conversion and
10778 return the resulting expression. */
10781 tree_strip_nop_conversions (tree exp
)
10783 while (tree_nop_conversion (exp
))
10784 exp
= TREE_OPERAND (exp
, 0);
10788 /* Strip conversions from EXP according to tree_sign_nop_conversion
10789 and return the resulting expression. */
10792 tree_strip_sign_nop_conversions (tree exp
)
10794 while (tree_sign_nop_conversion (exp
))
10795 exp
= TREE_OPERAND (exp
, 0);
10799 static GTY(()) tree gcc_eh_personality_decl
;
10801 /* Return the GCC personality function decl. */
10804 lhd_gcc_personality (void)
10806 if (!gcc_eh_personality_decl
)
10807 gcc_eh_personality_decl
10808 = build_personality_function (USING_SJLJ_EXCEPTIONS
10809 ? "__gcc_personality_sj0"
10810 : "__gcc_personality_v0");
10812 return gcc_eh_personality_decl
;
10815 #include "gt-tree.h"