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
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"
63 /* Tree code classes. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 #define END_OF_BASE_TREE_CODES tcc_exceptional,
68 const enum tree_code_class tree_code_type
[] = {
69 #include "all-tree.def"
73 #undef END_OF_BASE_TREE_CODES
75 /* Table indexed by tree code giving number of expression
76 operands beyond the fixed part of the node structure.
77 Not used for types or decls. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
80 #define END_OF_BASE_TREE_CODES 0,
82 const unsigned char tree_code_length
[] = {
83 #include "all-tree.def"
87 #undef END_OF_BASE_TREE_CODES
89 /* Names of tree components.
90 Used for printing out the tree and error messages. */
91 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
92 #define END_OF_BASE_TREE_CODES "@dummy",
94 const char *const tree_code_name
[] = {
95 #include "all-tree.def"
99 #undef END_OF_BASE_TREE_CODES
101 /* Each tree code class has an associated string representation.
102 These must correspond to the tree_code_class entries. */
104 const char *const tree_code_class_strings
[] =
119 /* obstack.[ch] explicitly declined to prototype this. */
120 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
122 #ifdef GATHER_STATISTICS
123 /* Statistics-gathering stuff. */
125 int tree_node_counts
[(int) all_kinds
];
126 int tree_node_sizes
[(int) all_kinds
];
128 /* Keep in sync with tree.h:enum tree_node_kind. */
129 static const char * const tree_node_kind_names
[] = {
149 #endif /* GATHER_STATISTICS */
151 /* Unique id for next decl created. */
152 static GTY(()) int next_decl_uid
;
153 /* Unique id for next type created. */
154 static GTY(()) int next_type_uid
= 1;
156 /* Since we cannot rehash a type after it is in the table, we have to
157 keep the hash code. */
159 struct GTY(()) type_hash
{
164 /* Initial size of the hash table (rounded to next prime). */
165 #define TYPE_HASH_INITIAL_SIZE 1000
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
174 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
175 htab_t type_hash_table
;
177 /* Hash table and temporary node for larger integer const values. */
178 static GTY (()) tree int_cst_node
;
179 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
180 htab_t int_cst_hash_table
;
182 /* Hash table for optimization flags and target option flags. Use the same
183 hash table for both sets of options. Nodes for building the current
184 optimization and target option nodes. The assumption is most of the time
185 the options created will already be in the hash table, so we avoid
186 allocating and freeing up a node repeatably. */
187 static GTY (()) tree cl_optimization_node
;
188 static GTY (()) tree cl_target_option_node
;
189 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
190 htab_t cl_option_hash_table
;
192 /* General tree->tree mapping structure for use in hash tables. */
195 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
196 htab_t debug_expr_for_decl
;
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
199 htab_t value_expr_for_decl
;
201 static GTY ((if_marked ("tree_priority_map_marked_p"),
202 param_is (struct tree_priority_map
)))
203 htab_t init_priority_for_decl
;
205 static void set_type_quals (tree
, int);
206 static int type_hash_eq (const void *, const void *);
207 static hashval_t
type_hash_hash (const void *);
208 static hashval_t
int_cst_hash_hash (const void *);
209 static int int_cst_hash_eq (const void *, const void *);
210 static hashval_t
cl_option_hash_hash (const void *);
211 static int cl_option_hash_eq (const void *, const void *);
212 static void print_type_hash_statistics (void);
213 static void print_debug_expr_statistics (void);
214 static void print_value_expr_statistics (void);
215 static int type_hash_marked_p (const void *);
216 static unsigned int type_hash_list (const_tree
, hashval_t
);
217 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
219 tree global_trees
[TI_MAX
];
220 tree integer_types
[itk_none
];
222 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
224 /* Number of operands for each OpenMP clause. */
225 unsigned const char omp_clause_num_ops
[] =
227 0, /* OMP_CLAUSE_ERROR */
228 1, /* OMP_CLAUSE_PRIVATE */
229 1, /* OMP_CLAUSE_SHARED */
230 1, /* OMP_CLAUSE_FIRSTPRIVATE */
231 2, /* OMP_CLAUSE_LASTPRIVATE */
232 4, /* OMP_CLAUSE_REDUCTION */
233 1, /* OMP_CLAUSE_COPYIN */
234 1, /* OMP_CLAUSE_COPYPRIVATE */
235 1, /* OMP_CLAUSE_IF */
236 1, /* OMP_CLAUSE_NUM_THREADS */
237 1, /* OMP_CLAUSE_SCHEDULE */
238 0, /* OMP_CLAUSE_NOWAIT */
239 0, /* OMP_CLAUSE_ORDERED */
240 0, /* OMP_CLAUSE_DEFAULT */
241 3, /* OMP_CLAUSE_COLLAPSE */
242 0 /* OMP_CLAUSE_UNTIED */
245 const char * const omp_clause_code_name
[] =
266 /* Return the tree node structure used by tree code CODE. */
268 static inline enum tree_node_structure_enum
269 tree_node_structure_for_code (enum tree_code code
)
271 switch (TREE_CODE_CLASS (code
))
273 case tcc_declaration
:
278 return TS_FIELD_DECL
;
284 return TS_LABEL_DECL
;
286 return TS_RESULT_DECL
;
288 return TS_CONST_DECL
;
292 return TS_FUNCTION_DECL
;
294 return TS_DECL_NON_COMMON
;
307 default: /* tcc_constant and tcc_exceptional */
312 /* tcc_constant cases. */
313 case INTEGER_CST
: return TS_INT_CST
;
314 case REAL_CST
: return TS_REAL_CST
;
315 case FIXED_CST
: return TS_FIXED_CST
;
316 case COMPLEX_CST
: return TS_COMPLEX
;
317 case VECTOR_CST
: return TS_VECTOR
;
318 case STRING_CST
: return TS_STRING
;
319 /* tcc_exceptional cases. */
320 case ERROR_MARK
: return TS_COMMON
;
321 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
322 case TREE_LIST
: return TS_LIST
;
323 case TREE_VEC
: return TS_VEC
;
324 case SSA_NAME
: return TS_SSA_NAME
;
325 case PLACEHOLDER_EXPR
: return TS_COMMON
;
326 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
327 case BLOCK
: return TS_BLOCK
;
328 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
329 case TREE_BINFO
: return TS_BINFO
;
330 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
331 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
332 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
340 /* Initialize tree_contains_struct to describe the hierarchy of tree
344 initialize_tree_contains_struct (void)
348 #define MARK_TS_BASE(C) \
350 tree_contains_struct[C][TS_BASE] = 1; \
353 #define MARK_TS_COMMON(C) \
356 tree_contains_struct[C][TS_COMMON] = 1; \
359 #define MARK_TS_DECL_MINIMAL(C) \
361 MARK_TS_COMMON (C); \
362 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
365 #define MARK_TS_DECL_COMMON(C) \
367 MARK_TS_DECL_MINIMAL (C); \
368 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
371 #define MARK_TS_DECL_WRTL(C) \
373 MARK_TS_DECL_COMMON (C); \
374 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
377 #define MARK_TS_DECL_WITH_VIS(C) \
379 MARK_TS_DECL_WRTL (C); \
380 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
383 #define MARK_TS_DECL_NON_COMMON(C) \
385 MARK_TS_DECL_WITH_VIS (C); \
386 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
389 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
392 enum tree_node_structure_enum ts_code
;
394 code
= (enum tree_code
) i
;
395 ts_code
= tree_node_structure_for_code (code
);
397 /* Mark the TS structure itself. */
398 tree_contains_struct
[code
][ts_code
] = 1;
400 /* Mark all the structures that TS is derived from. */
414 case TS_DECL_MINIMAL
:
422 case TS_STATEMENT_LIST
:
425 case TS_OPTIMIZATION
:
426 case TS_TARGET_OPTION
:
427 MARK_TS_COMMON (code
);
431 MARK_TS_DECL_MINIMAL (code
);
435 MARK_TS_DECL_COMMON (code
);
438 case TS_DECL_NON_COMMON
:
439 MARK_TS_DECL_WITH_VIS (code
);
442 case TS_DECL_WITH_VIS
:
447 MARK_TS_DECL_WRTL (code
);
451 MARK_TS_DECL_COMMON (code
);
455 MARK_TS_DECL_WITH_VIS (code
);
459 case TS_FUNCTION_DECL
:
460 MARK_TS_DECL_NON_COMMON (code
);
468 /* Basic consistency checks for attributes used in fold. */
469 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
470 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
]);
471 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
472 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
473 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
474 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
475 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
476 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
477 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
478 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
479 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
480 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
481 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
]);
482 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
483 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
484 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
485 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
486 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
487 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
488 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
489 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
490 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
491 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
492 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
493 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
494 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
495 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
496 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
497 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
498 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
499 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
]);
500 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
501 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
502 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
503 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
504 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
505 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
506 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
507 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
508 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
509 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
512 #undef MARK_TS_COMMON
513 #undef MARK_TS_DECL_MINIMAL
514 #undef MARK_TS_DECL_COMMON
515 #undef MARK_TS_DECL_WRTL
516 #undef MARK_TS_DECL_WITH_VIS
517 #undef MARK_TS_DECL_NON_COMMON
526 /* Initialize the hash table of types. */
527 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
530 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
533 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
535 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
536 tree_priority_map_eq
, 0);
538 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
539 int_cst_hash_eq
, NULL
);
541 int_cst_node
= make_node (INTEGER_CST
);
543 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
544 cl_option_hash_eq
, NULL
);
546 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
547 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
549 /* Initialize the tree_contains_struct array. */
550 initialize_tree_contains_struct ();
551 lang_hooks
.init_ts ();
555 /* The name of the object as the assembler will see it (but before any
556 translations made by ASM_OUTPUT_LABELREF). Often this is the same
557 as DECL_NAME. It is an IDENTIFIER_NODE. */
559 decl_assembler_name (tree decl
)
561 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
562 lang_hooks
.set_decl_assembler_name (decl
);
563 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
566 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
569 decl_assembler_name_equal (tree decl
, const_tree asmname
)
571 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
572 const char *decl_str
;
573 const char *asmname_str
;
576 if (decl_asmname
== asmname
)
579 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
580 asmname_str
= IDENTIFIER_POINTER (asmname
);
583 /* If the target assembler name was set by the user, things are trickier.
584 We have a leading '*' to begin with. After that, it's arguable what
585 is the correct thing to do with -fleading-underscore. Arguably, we've
586 historically been doing the wrong thing in assemble_alias by always
587 printing the leading underscore. Since we're not changing that, make
588 sure user_label_prefix follows the '*' before matching. */
589 if (decl_str
[0] == '*')
591 size_t ulp_len
= strlen (user_label_prefix
);
597 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
598 decl_str
+= ulp_len
, test
=true;
602 if (asmname_str
[0] == '*')
604 size_t ulp_len
= strlen (user_label_prefix
);
610 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
611 asmname_str
+= ulp_len
, test
=true;
618 return strcmp (decl_str
, asmname_str
) == 0;
621 /* Hash asmnames ignoring the user specified marks. */
624 decl_assembler_name_hash (const_tree asmname
)
626 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
628 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
629 size_t ulp_len
= strlen (user_label_prefix
);
633 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
636 return htab_hash_string (decl_str
);
639 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
642 /* Compute the number of bytes occupied by a tree with code CODE.
643 This function cannot be used for nodes that have variable sizes,
644 including TREE_VEC, STRING_CST, and CALL_EXPR. */
646 tree_code_size (enum tree_code code
)
648 switch (TREE_CODE_CLASS (code
))
650 case tcc_declaration
: /* A decl node */
655 return sizeof (struct tree_field_decl
);
657 return sizeof (struct tree_parm_decl
);
659 return sizeof (struct tree_var_decl
);
661 return sizeof (struct tree_label_decl
);
663 return sizeof (struct tree_result_decl
);
665 return sizeof (struct tree_const_decl
);
667 return sizeof (struct tree_type_decl
);
669 return sizeof (struct tree_function_decl
);
671 return sizeof (struct tree_decl_non_common
);
675 case tcc_type
: /* a type node */
676 return sizeof (struct tree_type
);
678 case tcc_reference
: /* a reference */
679 case tcc_expression
: /* an expression */
680 case tcc_statement
: /* an expression with side effects */
681 case tcc_comparison
: /* a comparison expression */
682 case tcc_unary
: /* a unary arithmetic expression */
683 case tcc_binary
: /* a binary arithmetic expression */
684 return (sizeof (struct tree_exp
)
685 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
687 case tcc_constant
: /* a constant */
690 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
691 case REAL_CST
: return sizeof (struct tree_real_cst
);
692 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
693 case COMPLEX_CST
: return sizeof (struct tree_complex
);
694 case VECTOR_CST
: return sizeof (struct tree_vector
);
695 case STRING_CST
: gcc_unreachable ();
697 return lang_hooks
.tree_size (code
);
700 case tcc_exceptional
: /* something random, like an identifier. */
703 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
704 case TREE_LIST
: return sizeof (struct tree_list
);
707 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
710 case OMP_CLAUSE
: gcc_unreachable ();
712 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
714 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
715 case BLOCK
: return sizeof (struct tree_block
);
716 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
717 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
718 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
721 return lang_hooks
.tree_size (code
);
729 /* Compute the number of bytes occupied by NODE. This routine only
730 looks at TREE_CODE, except for those nodes that have variable sizes. */
732 tree_size (const_tree node
)
734 const enum tree_code code
= TREE_CODE (node
);
738 return (offsetof (struct tree_binfo
, base_binfos
)
739 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
742 return (sizeof (struct tree_vec
)
743 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
746 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
749 return (sizeof (struct tree_omp_clause
)
750 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
754 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
755 return (sizeof (struct tree_exp
)
756 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
758 return tree_code_size (code
);
762 /* Return a newly allocated node of code CODE. For decl and type
763 nodes, some other fields are initialized. The rest of the node is
764 initialized to zero. This function cannot be used for TREE_VEC or
765 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
767 Achoo! I got a code in the node. */
770 make_node_stat (enum tree_code code MEM_STAT_DECL
)
773 enum tree_code_class type
= TREE_CODE_CLASS (code
);
774 size_t length
= tree_code_size (code
);
775 #ifdef GATHER_STATISTICS
780 case tcc_declaration
: /* A decl node */
784 case tcc_type
: /* a type node */
788 case tcc_statement
: /* an expression with side effects */
792 case tcc_reference
: /* a reference */
796 case tcc_expression
: /* an expression */
797 case tcc_comparison
: /* a comparison expression */
798 case tcc_unary
: /* a unary arithmetic expression */
799 case tcc_binary
: /* a binary arithmetic expression */
803 case tcc_constant
: /* a constant */
807 case tcc_exceptional
: /* something random, like an identifier. */
810 case IDENTIFIER_NODE
:
823 kind
= ssa_name_kind
;
844 tree_node_counts
[(int) kind
]++;
845 tree_node_sizes
[(int) kind
] += length
;
848 if (code
== IDENTIFIER_NODE
)
849 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
851 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
853 memset (t
, 0, length
);
855 TREE_SET_CODE (t
, code
);
860 TREE_SIDE_EFFECTS (t
) = 1;
863 case tcc_declaration
:
864 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
866 if (code
== FUNCTION_DECL
)
868 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
869 DECL_MODE (t
) = FUNCTION_MODE
;
874 DECL_SOURCE_LOCATION (t
) = input_location
;
875 DECL_UID (t
) = next_decl_uid
++;
876 if (TREE_CODE (t
) == LABEL_DECL
)
877 LABEL_DECL_UID (t
) = -1;
882 TYPE_UID (t
) = next_type_uid
++;
883 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
884 TYPE_USER_ALIGN (t
) = 0;
885 TYPE_MAIN_VARIANT (t
) = t
;
886 TYPE_CANONICAL (t
) = t
;
888 /* Default to no attributes for type, but let target change that. */
889 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
890 targetm
.set_default_type_attributes (t
);
892 /* We have not yet computed the alias set for this type. */
893 TYPE_ALIAS_SET (t
) = -1;
897 TREE_CONSTANT (t
) = 1;
906 case PREDECREMENT_EXPR
:
907 case PREINCREMENT_EXPR
:
908 case POSTDECREMENT_EXPR
:
909 case POSTINCREMENT_EXPR
:
910 /* All of these have side-effects, no matter what their
912 TREE_SIDE_EFFECTS (t
) = 1;
921 /* Other classes need no special treatment. */
928 /* Return a new node with the same contents as NODE except that its
929 TREE_CHAIN is zero and it has a fresh uid. */
932 copy_node_stat (tree node MEM_STAT_DECL
)
935 enum tree_code code
= TREE_CODE (node
);
938 gcc_assert (code
!= STATEMENT_LIST
);
940 length
= tree_size (node
);
941 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
942 memcpy (t
, node
, length
);
945 TREE_ASM_WRITTEN (t
) = 0;
946 TREE_VISITED (t
) = 0;
949 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
951 DECL_UID (t
) = next_decl_uid
++;
952 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
953 && DECL_HAS_VALUE_EXPR_P (node
))
955 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
956 DECL_HAS_VALUE_EXPR_P (t
) = 1;
958 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
960 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
961 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
964 else if (TREE_CODE_CLASS (code
) == tcc_type
)
966 TYPE_UID (t
) = next_type_uid
++;
967 /* The following is so that the debug code for
968 the copy is different from the original type.
969 The two statements usually duplicate each other
970 (because they clear fields of the same union),
971 but the optimizer should catch that. */
972 TYPE_SYMTAB_POINTER (t
) = 0;
973 TYPE_SYMTAB_ADDRESS (t
) = 0;
975 /* Do not copy the values cache. */
976 if (TYPE_CACHED_VALUES_P(t
))
978 TYPE_CACHED_VALUES_P (t
) = 0;
979 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
986 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
987 For example, this can copy a list made of TREE_LIST nodes. */
990 copy_list (tree list
)
998 head
= prev
= copy_node (list
);
999 next
= TREE_CHAIN (list
);
1002 TREE_CHAIN (prev
) = copy_node (next
);
1003 prev
= TREE_CHAIN (prev
);
1004 next
= TREE_CHAIN (next
);
1010 /* Create an INT_CST node with a LOW value sign extended. */
1013 build_int_cst (tree type
, HOST_WIDE_INT low
)
1015 /* Support legacy code. */
1017 type
= integer_type_node
;
1019 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1022 /* Create an INT_CST node with a LOW value zero extended. */
1025 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
1027 return build_int_cst_wide (type
, low
, 0);
1030 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1031 if it is negative. This function is similar to build_int_cst, but
1032 the extra bits outside of the type precision are cleared. Constants
1033 with these extra bits may confuse the fold so that it detects overflows
1034 even in cases when they do not occur, and in general should be avoided.
1035 We cannot however make this a default behavior of build_int_cst without
1036 more intrusive changes, since there are parts of gcc that rely on the extra
1037 precision of the integer constants. */
1040 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1042 unsigned HOST_WIDE_INT low1
;
1047 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
1049 return build_int_cst_wide (type
, low1
, hi
);
1052 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1053 and sign extended according to the value range of TYPE. */
1056 build_int_cst_wide_type (tree type
,
1057 unsigned HOST_WIDE_INT low
, HOST_WIDE_INT high
)
1059 fit_double_type (low
, high
, &low
, &high
, type
);
1060 return build_int_cst_wide (type
, low
, high
);
1063 /* These are the hash table functions for the hash table of INTEGER_CST
1064 nodes of a sizetype. */
1066 /* Return the hash code code X, an INTEGER_CST. */
1069 int_cst_hash_hash (const void *x
)
1071 const_tree
const t
= (const_tree
) x
;
1073 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1074 ^ htab_hash_pointer (TREE_TYPE (t
)));
1077 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1078 is the same as that given by *Y, which is the same. */
1081 int_cst_hash_eq (const void *x
, const void *y
)
1083 const_tree
const xt
= (const_tree
) x
;
1084 const_tree
const yt
= (const_tree
) y
;
1086 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1087 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1088 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1091 /* Create an INT_CST node of TYPE and value HI:LOW.
1092 The returned node is always shared. For small integers we use a
1093 per-type vector cache, for larger ones we use a single hash table. */
1096 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1104 switch (TREE_CODE (type
))
1107 case REFERENCE_TYPE
:
1108 /* Cache NULL pointer. */
1117 /* Cache false or true. */
1125 if (TYPE_UNSIGNED (type
))
1128 limit
= INTEGER_SHARE_LIMIT
;
1129 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1135 limit
= INTEGER_SHARE_LIMIT
+ 1;
1136 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1138 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1152 /* Look for it in the type's vector of small shared ints. */
1153 if (!TYPE_CACHED_VALUES_P (type
))
1155 TYPE_CACHED_VALUES_P (type
) = 1;
1156 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1159 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1162 /* Make sure no one is clobbering the shared constant. */
1163 gcc_assert (TREE_TYPE (t
) == type
);
1164 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1165 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1169 /* Create a new shared int. */
1170 t
= make_node (INTEGER_CST
);
1172 TREE_INT_CST_LOW (t
) = low
;
1173 TREE_INT_CST_HIGH (t
) = hi
;
1174 TREE_TYPE (t
) = type
;
1176 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1181 /* Use the cache of larger shared ints. */
1184 TREE_INT_CST_LOW (int_cst_node
) = low
;
1185 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1186 TREE_TYPE (int_cst_node
) = type
;
1188 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1192 /* Insert this one into the hash table. */
1195 /* Make a new node for next time round. */
1196 int_cst_node
= make_node (INTEGER_CST
);
1203 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1204 and the rest are zeros. */
1207 build_low_bits_mask (tree type
, unsigned bits
)
1209 unsigned HOST_WIDE_INT low
;
1211 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
1213 gcc_assert (bits
<= TYPE_PRECISION (type
));
1215 if (bits
== TYPE_PRECISION (type
)
1216 && !TYPE_UNSIGNED (type
))
1218 /* Sign extended all-ones mask. */
1222 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
1224 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1229 bits
-= HOST_BITS_PER_WIDE_INT
;
1231 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1234 return build_int_cst_wide (type
, low
, high
);
1237 /* Checks that X is integer constant that can be expressed in (unsigned)
1238 HOST_WIDE_INT without loss of precision. */
1241 cst_and_fits_in_hwi (const_tree x
)
1243 if (TREE_CODE (x
) != INTEGER_CST
)
1246 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1249 return (TREE_INT_CST_HIGH (x
) == 0
1250 || TREE_INT_CST_HIGH (x
) == -1);
1253 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1254 are in a list pointed to by VALS. */
1257 build_vector (tree type
, tree vals
)
1259 tree v
= make_node (VECTOR_CST
);
1263 TREE_VECTOR_CST_ELTS (v
) = vals
;
1264 TREE_TYPE (v
) = type
;
1266 /* Iterate through elements and check for overflow. */
1267 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1269 tree value
= TREE_VALUE (link
);
1271 /* Don't crash if we get an address constant. */
1272 if (!CONSTANT_CLASS_P (value
))
1275 over
|= TREE_OVERFLOW (value
);
1278 TREE_OVERFLOW (v
) = over
;
1282 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1283 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1286 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1288 tree list
= NULL_TREE
;
1289 unsigned HOST_WIDE_INT idx
;
1292 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1293 list
= tree_cons (NULL_TREE
, value
, list
);
1294 return build_vector (type
, nreverse (list
));
1297 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1298 are in the VEC pointed to by VALS. */
1300 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1302 tree c
= make_node (CONSTRUCTOR
);
1303 TREE_TYPE (c
) = type
;
1304 CONSTRUCTOR_ELTS (c
) = vals
;
1308 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1311 build_constructor_single (tree type
, tree index
, tree value
)
1313 VEC(constructor_elt
,gc
) *v
;
1314 constructor_elt
*elt
;
1317 v
= VEC_alloc (constructor_elt
, gc
, 1);
1318 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1322 t
= build_constructor (type
, v
);
1323 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1328 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1329 are in a list pointed to by VALS. */
1331 build_constructor_from_list (tree type
, tree vals
)
1334 VEC(constructor_elt
,gc
) *v
= NULL
;
1335 bool constant_p
= true;
1339 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1340 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1342 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1343 val
= TREE_VALUE (t
);
1344 elt
->index
= TREE_PURPOSE (t
);
1346 if (!TREE_CONSTANT (val
))
1351 t
= build_constructor (type
, v
);
1352 TREE_CONSTANT (t
) = constant_p
;
1356 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1359 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1362 FIXED_VALUE_TYPE
*fp
;
1364 v
= make_node (FIXED_CST
);
1365 fp
= GGC_NEW (FIXED_VALUE_TYPE
);
1366 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1368 TREE_TYPE (v
) = type
;
1369 TREE_FIXED_CST_PTR (v
) = fp
;
1373 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1376 build_real (tree type
, REAL_VALUE_TYPE d
)
1379 REAL_VALUE_TYPE
*dp
;
1382 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1383 Consider doing it via real_convert now. */
1385 v
= make_node (REAL_CST
);
1386 dp
= GGC_NEW (REAL_VALUE_TYPE
);
1387 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1389 TREE_TYPE (v
) = type
;
1390 TREE_REAL_CST_PTR (v
) = dp
;
1391 TREE_OVERFLOW (v
) = overflow
;
1395 /* Return a new REAL_CST node whose type is TYPE
1396 and whose value is the integer value of the INTEGER_CST node I. */
1399 real_value_from_int_cst (const_tree type
, const_tree i
)
1403 /* Clear all bits of the real value type so that we can later do
1404 bitwise comparisons to see if two values are the same. */
1405 memset (&d
, 0, sizeof d
);
1407 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1408 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1409 TYPE_UNSIGNED (TREE_TYPE (i
)));
1413 /* Given a tree representing an integer constant I, return a tree
1414 representing the same value as a floating-point constant of type TYPE. */
1417 build_real_from_int_cst (tree type
, const_tree i
)
1420 int overflow
= TREE_OVERFLOW (i
);
1422 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1424 TREE_OVERFLOW (v
) |= overflow
;
1428 /* Return a newly constructed STRING_CST node whose value is
1429 the LEN characters at STR.
1430 The TREE_TYPE is not initialized. */
1433 build_string (int len
, const char *str
)
1438 /* Do not waste bytes provided by padding of struct tree_string. */
1439 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1441 #ifdef GATHER_STATISTICS
1442 tree_node_counts
[(int) c_kind
]++;
1443 tree_node_sizes
[(int) c_kind
] += length
;
1446 s
= ggc_alloc_tree (length
);
1448 memset (s
, 0, sizeof (struct tree_common
));
1449 TREE_SET_CODE (s
, STRING_CST
);
1450 TREE_CONSTANT (s
) = 1;
1451 TREE_STRING_LENGTH (s
) = len
;
1452 memcpy (s
->string
.str
, str
, len
);
1453 s
->string
.str
[len
] = '\0';
1458 /* Return a newly constructed COMPLEX_CST node whose value is
1459 specified by the real and imaginary parts REAL and IMAG.
1460 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1461 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1464 build_complex (tree type
, tree real
, tree imag
)
1466 tree t
= make_node (COMPLEX_CST
);
1468 TREE_REALPART (t
) = real
;
1469 TREE_IMAGPART (t
) = imag
;
1470 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1471 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1475 /* Return a constant of arithmetic type TYPE which is the
1476 multiplicative identity of the set TYPE. */
1479 build_one_cst (tree type
)
1481 switch (TREE_CODE (type
))
1483 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1484 case POINTER_TYPE
: case REFERENCE_TYPE
:
1486 return build_int_cst (type
, 1);
1489 return build_real (type
, dconst1
);
1491 case FIXED_POINT_TYPE
:
1492 /* We can only generate 1 for accum types. */
1493 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1494 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1501 scalar
= build_one_cst (TREE_TYPE (type
));
1503 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1505 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1506 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1508 return build_vector (type
, cst
);
1512 return build_complex (type
,
1513 build_one_cst (TREE_TYPE (type
)),
1514 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1521 /* Build a BINFO with LEN language slots. */
1524 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1527 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1528 + VEC_embedded_size (tree
, base_binfos
));
1530 #ifdef GATHER_STATISTICS
1531 tree_node_counts
[(int) binfo_kind
]++;
1532 tree_node_sizes
[(int) binfo_kind
] += length
;
1535 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1537 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1539 TREE_SET_CODE (t
, TREE_BINFO
);
1541 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1547 /* Build a newly constructed TREE_VEC node of length LEN. */
1550 make_tree_vec_stat (int len MEM_STAT_DECL
)
1553 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1555 #ifdef GATHER_STATISTICS
1556 tree_node_counts
[(int) vec_kind
]++;
1557 tree_node_sizes
[(int) vec_kind
] += length
;
1560 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1562 memset (t
, 0, length
);
1564 TREE_SET_CODE (t
, TREE_VEC
);
1565 TREE_VEC_LENGTH (t
) = len
;
1570 /* Return 1 if EXPR is the integer constant zero or a complex constant
1574 integer_zerop (const_tree expr
)
1578 return ((TREE_CODE (expr
) == INTEGER_CST
1579 && TREE_INT_CST_LOW (expr
) == 0
1580 && TREE_INT_CST_HIGH (expr
) == 0)
1581 || (TREE_CODE (expr
) == COMPLEX_CST
1582 && integer_zerop (TREE_REALPART (expr
))
1583 && integer_zerop (TREE_IMAGPART (expr
))));
1586 /* Return 1 if EXPR is the integer constant one or the corresponding
1587 complex constant. */
1590 integer_onep (const_tree expr
)
1594 return ((TREE_CODE (expr
) == INTEGER_CST
1595 && TREE_INT_CST_LOW (expr
) == 1
1596 && TREE_INT_CST_HIGH (expr
) == 0)
1597 || (TREE_CODE (expr
) == COMPLEX_CST
1598 && integer_onep (TREE_REALPART (expr
))
1599 && integer_zerop (TREE_IMAGPART (expr
))));
1602 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1603 it contains. Likewise for the corresponding complex constant. */
1606 integer_all_onesp (const_tree expr
)
1613 if (TREE_CODE (expr
) == COMPLEX_CST
1614 && integer_all_onesp (TREE_REALPART (expr
))
1615 && integer_zerop (TREE_IMAGPART (expr
)))
1618 else if (TREE_CODE (expr
) != INTEGER_CST
)
1621 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1622 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1623 && TREE_INT_CST_HIGH (expr
) == -1)
1628 /* Note that using TYPE_PRECISION here is wrong. We care about the
1629 actual bits, not the (arbitrary) range of the type. */
1630 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1631 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1633 HOST_WIDE_INT high_value
;
1636 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1638 /* Can not handle precisions greater than twice the host int size. */
1639 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1640 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1641 /* Shifting by the host word size is undefined according to the ANSI
1642 standard, so we must handle this as a special case. */
1645 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1647 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1648 && TREE_INT_CST_HIGH (expr
) == high_value
);
1651 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1654 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1658 integer_pow2p (const_tree expr
)
1661 HOST_WIDE_INT high
, low
;
1665 if (TREE_CODE (expr
) == COMPLEX_CST
1666 && integer_pow2p (TREE_REALPART (expr
))
1667 && integer_zerop (TREE_IMAGPART (expr
)))
1670 if (TREE_CODE (expr
) != INTEGER_CST
)
1673 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1674 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1675 high
= TREE_INT_CST_HIGH (expr
);
1676 low
= TREE_INT_CST_LOW (expr
);
1678 /* First clear all bits that are beyond the type's precision in case
1679 we've been sign extended. */
1681 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1683 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1684 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1688 if (prec
< HOST_BITS_PER_WIDE_INT
)
1689 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1692 if (high
== 0 && low
== 0)
1695 return ((high
== 0 && (low
& (low
- 1)) == 0)
1696 || (low
== 0 && (high
& (high
- 1)) == 0));
1699 /* Return 1 if EXPR is an integer constant other than zero or a
1700 complex constant other than zero. */
1703 integer_nonzerop (const_tree expr
)
1707 return ((TREE_CODE (expr
) == INTEGER_CST
1708 && (TREE_INT_CST_LOW (expr
) != 0
1709 || TREE_INT_CST_HIGH (expr
) != 0))
1710 || (TREE_CODE (expr
) == COMPLEX_CST
1711 && (integer_nonzerop (TREE_REALPART (expr
))
1712 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1715 /* Return 1 if EXPR is the fixed-point constant zero. */
1718 fixed_zerop (const_tree expr
)
1720 return (TREE_CODE (expr
) == FIXED_CST
1721 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1724 /* Return the power of two represented by a tree node known to be a
1728 tree_log2 (const_tree expr
)
1731 HOST_WIDE_INT high
, low
;
1735 if (TREE_CODE (expr
) == COMPLEX_CST
)
1736 return tree_log2 (TREE_REALPART (expr
));
1738 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1739 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1741 high
= TREE_INT_CST_HIGH (expr
);
1742 low
= TREE_INT_CST_LOW (expr
);
1744 /* First clear all bits that are beyond the type's precision in case
1745 we've been sign extended. */
1747 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1749 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1750 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1754 if (prec
< HOST_BITS_PER_WIDE_INT
)
1755 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1758 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1759 : exact_log2 (low
));
1762 /* Similar, but return the largest integer Y such that 2 ** Y is less
1763 than or equal to EXPR. */
1766 tree_floor_log2 (const_tree expr
)
1769 HOST_WIDE_INT high
, low
;
1773 if (TREE_CODE (expr
) == COMPLEX_CST
)
1774 return tree_log2 (TREE_REALPART (expr
));
1776 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1777 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1779 high
= TREE_INT_CST_HIGH (expr
);
1780 low
= TREE_INT_CST_LOW (expr
);
1782 /* First clear all bits that are beyond the type's precision in case
1783 we've been sign extended. Ignore if type's precision hasn't been set
1784 since what we are doing is setting it. */
1786 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1788 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1789 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1793 if (prec
< HOST_BITS_PER_WIDE_INT
)
1794 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1797 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1798 : floor_log2 (low
));
1801 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1802 decimal float constants, so don't return 1 for them. */
1805 real_zerop (const_tree expr
)
1809 return ((TREE_CODE (expr
) == REAL_CST
1810 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1811 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1812 || (TREE_CODE (expr
) == COMPLEX_CST
1813 && real_zerop (TREE_REALPART (expr
))
1814 && real_zerop (TREE_IMAGPART (expr
))));
1817 /* Return 1 if EXPR is the real constant one in real or complex form.
1818 Trailing zeroes matter for decimal float constants, so don't return
1822 real_onep (const_tree expr
)
1826 return ((TREE_CODE (expr
) == REAL_CST
1827 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1828 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1829 || (TREE_CODE (expr
) == COMPLEX_CST
1830 && real_onep (TREE_REALPART (expr
))
1831 && real_zerop (TREE_IMAGPART (expr
))));
1834 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1835 for decimal float constants, so don't return 1 for them. */
1838 real_twop (const_tree expr
)
1842 return ((TREE_CODE (expr
) == REAL_CST
1843 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1844 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1845 || (TREE_CODE (expr
) == COMPLEX_CST
1846 && real_twop (TREE_REALPART (expr
))
1847 && real_zerop (TREE_IMAGPART (expr
))));
1850 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1851 matter for decimal float constants, so don't return 1 for them. */
1854 real_minus_onep (const_tree expr
)
1858 return ((TREE_CODE (expr
) == REAL_CST
1859 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
1860 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1861 || (TREE_CODE (expr
) == COMPLEX_CST
1862 && real_minus_onep (TREE_REALPART (expr
))
1863 && real_zerop (TREE_IMAGPART (expr
))));
1866 /* Nonzero if EXP is a constant or a cast of a constant. */
1869 really_constant_p (const_tree exp
)
1871 /* This is not quite the same as STRIP_NOPS. It does more. */
1872 while (CONVERT_EXPR_P (exp
)
1873 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1874 exp
= TREE_OPERAND (exp
, 0);
1875 return TREE_CONSTANT (exp
);
1878 /* Return first list element whose TREE_VALUE is ELEM.
1879 Return 0 if ELEM is not in LIST. */
1882 value_member (tree elem
, tree list
)
1886 if (elem
== TREE_VALUE (list
))
1888 list
= TREE_CHAIN (list
);
1893 /* Return first list element whose TREE_PURPOSE is ELEM.
1894 Return 0 if ELEM is not in LIST. */
1897 purpose_member (const_tree elem
, tree list
)
1901 if (elem
== TREE_PURPOSE (list
))
1903 list
= TREE_CHAIN (list
);
1908 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1912 chain_index (int idx
, tree chain
)
1914 for (; chain
&& idx
> 0; --idx
)
1915 chain
= TREE_CHAIN (chain
);
1919 /* Return nonzero if ELEM is part of the chain CHAIN. */
1922 chain_member (const_tree elem
, const_tree chain
)
1928 chain
= TREE_CHAIN (chain
);
1934 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1935 We expect a null pointer to mark the end of the chain.
1936 This is the Lisp primitive `length'. */
1939 list_length (const_tree t
)
1942 #ifdef ENABLE_TREE_CHECKING
1950 #ifdef ENABLE_TREE_CHECKING
1953 gcc_assert (p
!= q
);
1961 /* Returns the number of FIELD_DECLs in TYPE. */
1964 fields_length (const_tree type
)
1966 tree t
= TYPE_FIELDS (type
);
1969 for (; t
; t
= TREE_CHAIN (t
))
1970 if (TREE_CODE (t
) == FIELD_DECL
)
1976 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1977 by modifying the last node in chain 1 to point to chain 2.
1978 This is the Lisp primitive `nconc'. */
1981 chainon (tree op1
, tree op2
)
1990 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1992 TREE_CHAIN (t1
) = op2
;
1994 #ifdef ENABLE_TREE_CHECKING
1997 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1998 gcc_assert (t2
!= t1
);
2005 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2008 tree_last (tree chain
)
2012 while ((next
= TREE_CHAIN (chain
)))
2017 /* Reverse the order of elements in the chain T,
2018 and return the new head of the chain (old last element). */
2023 tree prev
= 0, decl
, next
;
2024 for (decl
= t
; decl
; decl
= next
)
2026 next
= TREE_CHAIN (decl
);
2027 TREE_CHAIN (decl
) = prev
;
2033 /* Return a newly created TREE_LIST node whose
2034 purpose and value fields are PARM and VALUE. */
2037 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2039 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2040 TREE_PURPOSE (t
) = parm
;
2041 TREE_VALUE (t
) = value
;
2045 /* Build a chain of TREE_LIST nodes from a vector. */
2048 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2050 tree ret
= NULL_TREE
;
2054 for (i
= 0; VEC_iterate (tree
, vec
, i
, t
); ++i
)
2056 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2057 pp
= &TREE_CHAIN (*pp
);
2062 /* Return a newly created TREE_LIST node whose
2063 purpose and value fields are PURPOSE and VALUE
2064 and whose TREE_CHAIN is CHAIN. */
2067 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2071 node
= (tree
) ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
2073 memset (node
, 0, sizeof (struct tree_common
));
2075 #ifdef GATHER_STATISTICS
2076 tree_node_counts
[(int) x_kind
]++;
2077 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
2080 TREE_SET_CODE (node
, TREE_LIST
);
2081 TREE_CHAIN (node
) = chain
;
2082 TREE_PURPOSE (node
) = purpose
;
2083 TREE_VALUE (node
) = value
;
2087 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2090 ctor_to_list (tree ctor
)
2092 tree list
= NULL_TREE
;
2097 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), ix
, purpose
, val
)
2099 *p
= build_tree_list (purpose
, val
);
2100 p
= &TREE_CHAIN (*p
);
2106 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2110 ctor_to_vec (tree ctor
)
2112 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2116 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2117 VEC_quick_push (tree
, vec
, val
);
2122 /* Return the size nominally occupied by an object of type TYPE
2123 when it resides in memory. The value is measured in units of bytes,
2124 and its data type is that normally used for type sizes
2125 (which is the first type created by make_signed_type or
2126 make_unsigned_type). */
2129 size_in_bytes (const_tree type
)
2133 if (type
== error_mark_node
)
2134 return integer_zero_node
;
2136 type
= TYPE_MAIN_VARIANT (type
);
2137 t
= TYPE_SIZE_UNIT (type
);
2141 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2142 return size_zero_node
;
2148 /* Return the size of TYPE (in bytes) as a wide integer
2149 or return -1 if the size can vary or is larger than an integer. */
2152 int_size_in_bytes (const_tree type
)
2156 if (type
== error_mark_node
)
2159 type
= TYPE_MAIN_VARIANT (type
);
2160 t
= TYPE_SIZE_UNIT (type
);
2162 || TREE_CODE (t
) != INTEGER_CST
2163 || TREE_INT_CST_HIGH (t
) != 0
2164 /* If the result would appear negative, it's too big to represent. */
2165 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2168 return TREE_INT_CST_LOW (t
);
2171 /* Return the maximum size of TYPE (in bytes) as a wide integer
2172 or return -1 if the size can vary or is larger than an integer. */
2175 max_int_size_in_bytes (const_tree type
)
2177 HOST_WIDE_INT size
= -1;
2180 /* If this is an array type, check for a possible MAX_SIZE attached. */
2182 if (TREE_CODE (type
) == ARRAY_TYPE
)
2184 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2186 if (size_tree
&& host_integerp (size_tree
, 1))
2187 size
= tree_low_cst (size_tree
, 1);
2190 /* If we still haven't been able to get a size, see if the language
2191 can compute a maximum size. */
2195 size_tree
= lang_hooks
.types
.max_size (type
);
2197 if (size_tree
&& host_integerp (size_tree
, 1))
2198 size
= tree_low_cst (size_tree
, 1);
2204 /* Returns a tree for the size of EXP in bytes. */
2207 tree_expr_size (const_tree exp
)
2210 && DECL_SIZE_UNIT (exp
) != 0)
2211 return DECL_SIZE_UNIT (exp
);
2213 return size_in_bytes (TREE_TYPE (exp
));
2216 /* Return the bit position of FIELD, in bits from the start of the record.
2217 This is a tree of type bitsizetype. */
2220 bit_position (const_tree field
)
2222 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2223 DECL_FIELD_BIT_OFFSET (field
));
2226 /* Likewise, but return as an integer. It must be representable in
2227 that way (since it could be a signed value, we don't have the
2228 option of returning -1 like int_size_in_byte can. */
2231 int_bit_position (const_tree field
)
2233 return tree_low_cst (bit_position (field
), 0);
2236 /* Return the byte position of FIELD, in bytes from the start of the record.
2237 This is a tree of type sizetype. */
2240 byte_position (const_tree field
)
2242 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2243 DECL_FIELD_BIT_OFFSET (field
));
2246 /* Likewise, but return as an integer. It must be representable in
2247 that way (since it could be a signed value, we don't have the
2248 option of returning -1 like int_size_in_byte can. */
2251 int_byte_position (const_tree field
)
2253 return tree_low_cst (byte_position (field
), 0);
2256 /* Return the strictest alignment, in bits, that T is known to have. */
2259 expr_align (const_tree t
)
2261 unsigned int align0
, align1
;
2263 switch (TREE_CODE (t
))
2265 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2266 /* If we have conversions, we know that the alignment of the
2267 object must meet each of the alignments of the types. */
2268 align0
= expr_align (TREE_OPERAND (t
, 0));
2269 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2270 return MAX (align0
, align1
);
2272 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2273 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2274 case CLEANUP_POINT_EXPR
:
2275 /* These don't change the alignment of an object. */
2276 return expr_align (TREE_OPERAND (t
, 0));
2279 /* The best we can do is say that the alignment is the least aligned
2281 align0
= expr_align (TREE_OPERAND (t
, 1));
2282 align1
= expr_align (TREE_OPERAND (t
, 2));
2283 return MIN (align0
, align1
);
2285 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2286 meaningfully, it's always 1. */
2287 case LABEL_DECL
: case CONST_DECL
:
2288 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2290 gcc_assert (DECL_ALIGN (t
) != 0);
2291 return DECL_ALIGN (t
);
2297 /* Otherwise take the alignment from that of the type. */
2298 return TYPE_ALIGN (TREE_TYPE (t
));
2301 /* Return, as a tree node, the number of elements for TYPE (which is an
2302 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2305 array_type_nelts (const_tree type
)
2307 tree index_type
, min
, max
;
2309 /* If they did it with unspecified bounds, then we should have already
2310 given an error about it before we got here. */
2311 if (! TYPE_DOMAIN (type
))
2312 return error_mark_node
;
2314 index_type
= TYPE_DOMAIN (type
);
2315 min
= TYPE_MIN_VALUE (index_type
);
2316 max
= TYPE_MAX_VALUE (index_type
);
2318 return (integer_zerop (min
)
2320 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2323 /* If arg is static -- a reference to an object in static storage -- then
2324 return the object. This is not the same as the C meaning of `static'.
2325 If arg isn't static, return NULL. */
2330 switch (TREE_CODE (arg
))
2333 /* Nested functions are static, even though taking their address will
2334 involve a trampoline as we unnest the nested function and create
2335 the trampoline on the tree level. */
2339 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2340 && ! DECL_THREAD_LOCAL_P (arg
)
2341 && ! DECL_DLLIMPORT_P (arg
)
2345 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2349 return TREE_STATIC (arg
) ? arg
: NULL
;
2356 /* If the thing being referenced is not a field, then it is
2357 something language specific. */
2358 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2360 /* If we are referencing a bitfield, we can't evaluate an
2361 ADDR_EXPR at compile time and so it isn't a constant. */
2362 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2365 return staticp (TREE_OPERAND (arg
, 0));
2370 case MISALIGNED_INDIRECT_REF
:
2371 case ALIGN_INDIRECT_REF
:
2373 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2376 case ARRAY_RANGE_REF
:
2377 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2378 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2379 return staticp (TREE_OPERAND (arg
, 0));
2383 case COMPOUND_LITERAL_EXPR
:
2384 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2394 /* Return whether OP is a DECL whose address is function-invariant. */
2397 decl_address_invariant_p (const_tree op
)
2399 /* The conditions below are slightly less strict than the one in
2402 switch (TREE_CODE (op
))
2411 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2412 && !DECL_DLLIMPORT_P (op
))
2413 || DECL_THREAD_LOCAL_P (op
)
2414 || DECL_CONTEXT (op
) == current_function_decl
2415 || decl_function_context (op
) == current_function_decl
)
2420 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2421 || decl_function_context (op
) == current_function_decl
)
2432 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2435 decl_address_ip_invariant_p (const_tree op
)
2437 /* The conditions below are slightly less strict than the one in
2440 switch (TREE_CODE (op
))
2448 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2449 && !DECL_DLLIMPORT_P (op
))
2450 || DECL_THREAD_LOCAL_P (op
))
2455 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2467 /* Return true if T is function-invariant (internal function, does
2468 not handle arithmetic; that's handled in skip_simple_arithmetic and
2469 tree_invariant_p). */
2471 static bool tree_invariant_p (tree t
);
2474 tree_invariant_p_1 (tree t
)
2478 if (TREE_CONSTANT (t
)
2479 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2482 switch (TREE_CODE (t
))
2488 op
= TREE_OPERAND (t
, 0);
2489 while (handled_component_p (op
))
2491 switch (TREE_CODE (op
))
2494 case ARRAY_RANGE_REF
:
2495 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2496 || TREE_OPERAND (op
, 2) != NULL_TREE
2497 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2502 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2508 op
= TREE_OPERAND (op
, 0);
2511 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2520 /* Return true if T is function-invariant. */
2523 tree_invariant_p (tree t
)
2525 tree inner
= skip_simple_arithmetic (t
);
2526 return tree_invariant_p_1 (inner
);
2529 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2530 Do this to any expression which may be used in more than one place,
2531 but must be evaluated only once.
2533 Normally, expand_expr would reevaluate the expression each time.
2534 Calling save_expr produces something that is evaluated and recorded
2535 the first time expand_expr is called on it. Subsequent calls to
2536 expand_expr just reuse the recorded value.
2538 The call to expand_expr that generates code that actually computes
2539 the value is the first call *at compile time*. Subsequent calls
2540 *at compile time* generate code to use the saved value.
2541 This produces correct result provided that *at run time* control
2542 always flows through the insns made by the first expand_expr
2543 before reaching the other places where the save_expr was evaluated.
2544 You, the caller of save_expr, must make sure this is so.
2546 Constants, and certain read-only nodes, are returned with no
2547 SAVE_EXPR because that is safe. Expressions containing placeholders
2548 are not touched; see tree.def for an explanation of what these
2552 save_expr (tree expr
)
2554 tree t
= fold (expr
);
2557 /* If the tree evaluates to a constant, then we don't want to hide that
2558 fact (i.e. this allows further folding, and direct checks for constants).
2559 However, a read-only object that has side effects cannot be bypassed.
2560 Since it is no problem to reevaluate literals, we just return the
2562 inner
= skip_simple_arithmetic (t
);
2563 if (TREE_CODE (inner
) == ERROR_MARK
)
2566 if (tree_invariant_p_1 (inner
))
2569 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2570 it means that the size or offset of some field of an object depends on
2571 the value within another field.
2573 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2574 and some variable since it would then need to be both evaluated once and
2575 evaluated more than once. Front-ends must assure this case cannot
2576 happen by surrounding any such subexpressions in their own SAVE_EXPR
2577 and forcing evaluation at the proper time. */
2578 if (contains_placeholder_p (inner
))
2581 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2582 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2584 /* This expression might be placed ahead of a jump to ensure that the
2585 value was computed on both sides of the jump. So make sure it isn't
2586 eliminated as dead. */
2587 TREE_SIDE_EFFECTS (t
) = 1;
2591 /* Look inside EXPR and into any simple arithmetic operations. Return
2592 the innermost non-arithmetic node. */
2595 skip_simple_arithmetic (tree expr
)
2599 /* We don't care about whether this can be used as an lvalue in this
2601 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2602 expr
= TREE_OPERAND (expr
, 0);
2604 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2605 a constant, it will be more efficient to not make another SAVE_EXPR since
2606 it will allow better simplification and GCSE will be able to merge the
2607 computations if they actually occur. */
2611 if (UNARY_CLASS_P (inner
))
2612 inner
= TREE_OPERAND (inner
, 0);
2613 else if (BINARY_CLASS_P (inner
))
2615 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2616 inner
= TREE_OPERAND (inner
, 0);
2617 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2618 inner
= TREE_OPERAND (inner
, 1);
2630 /* Return which tree structure is used by T. */
2632 enum tree_node_structure_enum
2633 tree_node_structure (const_tree t
)
2635 const enum tree_code code
= TREE_CODE (t
);
2636 return tree_node_structure_for_code (code
);
2639 /* Set various status flags when building a CALL_EXPR object T. */
2642 process_call_operands (tree t
)
2644 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2645 bool read_only
= false;
2646 int i
= call_expr_flags (t
);
2648 /* Calls have side-effects, except those to const or pure functions. */
2649 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2650 side_effects
= true;
2651 /* Propagate TREE_READONLY of arguments for const functions. */
2655 if (!side_effects
|| read_only
)
2656 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2658 tree op
= TREE_OPERAND (t
, i
);
2659 if (op
&& TREE_SIDE_EFFECTS (op
))
2660 side_effects
= true;
2661 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2665 TREE_SIDE_EFFECTS (t
) = side_effects
;
2666 TREE_READONLY (t
) = read_only
;
2669 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2670 or offset that depends on a field within a record. */
2673 contains_placeholder_p (const_tree exp
)
2675 enum tree_code code
;
2680 code
= TREE_CODE (exp
);
2681 if (code
== PLACEHOLDER_EXPR
)
2684 switch (TREE_CODE_CLASS (code
))
2687 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2688 position computations since they will be converted into a
2689 WITH_RECORD_EXPR involving the reference, which will assume
2690 here will be valid. */
2691 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2693 case tcc_exceptional
:
2694 if (code
== TREE_LIST
)
2695 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2696 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2701 case tcc_comparison
:
2702 case tcc_expression
:
2706 /* Ignoring the first operand isn't quite right, but works best. */
2707 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2710 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2711 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2712 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2715 /* The save_expr function never wraps anything containing
2716 a PLACEHOLDER_EXPR. */
2723 switch (TREE_CODE_LENGTH (code
))
2726 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2728 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2729 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2740 const_call_expr_arg_iterator iter
;
2741 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2742 if (CONTAINS_PLACEHOLDER_P (arg
))
2756 /* Return true if any part of the computation of TYPE involves a
2757 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2758 (for QUAL_UNION_TYPE) and field positions. */
2761 type_contains_placeholder_1 (const_tree type
)
2763 /* If the size contains a placeholder or the parent type (component type in
2764 the case of arrays) type involves a placeholder, this type does. */
2765 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2766 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2767 || (TREE_TYPE (type
) != 0
2768 && type_contains_placeholder_p (TREE_TYPE (type
))))
2771 /* Now do type-specific checks. Note that the last part of the check above
2772 greatly limits what we have to do below. */
2773 switch (TREE_CODE (type
))
2781 case REFERENCE_TYPE
:
2789 case FIXED_POINT_TYPE
:
2790 /* Here we just check the bounds. */
2791 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2792 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2795 /* We're already checked the component type (TREE_TYPE), so just check
2797 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2801 case QUAL_UNION_TYPE
:
2805 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2806 if (TREE_CODE (field
) == FIELD_DECL
2807 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2808 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2809 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2810 || type_contains_placeholder_p (TREE_TYPE (field
))))
2822 type_contains_placeholder_p (tree type
)
2826 /* If the contains_placeholder_bits field has been initialized,
2827 then we know the answer. */
2828 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2829 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2831 /* Indicate that we've seen this type node, and the answer is false.
2832 This is what we want to return if we run into recursion via fields. */
2833 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2835 /* Compute the real value. */
2836 result
= type_contains_placeholder_1 (type
);
2838 /* Store the real value. */
2839 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2844 /* Push tree EXP onto vector QUEUE if it is not already present. */
2847 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2852 for (i
= 0; VEC_iterate (tree
, *queue
, i
, iter
); i
++)
2853 if (simple_cst_equal (iter
, exp
) == 1)
2857 VEC_safe_push (tree
, heap
, *queue
, exp
);
2860 /* Given a tree EXP, find all occurences of references to fields
2861 in a PLACEHOLDER_EXPR and place them in vector REFS without
2862 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2863 we assume here that EXP contains only arithmetic expressions
2864 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2868 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
2870 enum tree_code code
= TREE_CODE (exp
);
2874 /* We handle TREE_LIST and COMPONENT_REF separately. */
2875 if (code
== TREE_LIST
)
2877 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
2878 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
2880 else if (code
== COMPONENT_REF
)
2882 for (inner
= TREE_OPERAND (exp
, 0);
2883 REFERENCE_CLASS_P (inner
);
2884 inner
= TREE_OPERAND (inner
, 0))
2887 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
2888 push_without_duplicates (exp
, refs
);
2890 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
2893 switch (TREE_CODE_CLASS (code
))
2898 case tcc_declaration
:
2899 /* Variables allocated to static storage can stay. */
2900 if (!TREE_STATIC (exp
))
2901 push_without_duplicates (exp
, refs
);
2904 case tcc_expression
:
2905 /* This is the pattern built in ada/make_aligning_type. */
2906 if (code
== ADDR_EXPR
2907 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
2909 push_without_duplicates (exp
, refs
);
2913 /* Fall through... */
2915 case tcc_exceptional
:
2918 case tcc_comparison
:
2920 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
2921 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2925 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2926 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2934 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2935 return a tree with all occurrences of references to F in a
2936 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2937 CONST_DECLs. Note that we assume here that EXP contains only
2938 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2939 occurring only in their argument list. */
2942 substitute_in_expr (tree exp
, tree f
, tree r
)
2944 enum tree_code code
= TREE_CODE (exp
);
2945 tree op0
, op1
, op2
, op3
;
2948 /* We handle TREE_LIST and COMPONENT_REF separately. */
2949 if (code
== TREE_LIST
)
2951 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2952 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2953 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2956 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2958 else if (code
== COMPONENT_REF
)
2962 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2963 and it is the right field, replace it with R. */
2964 for (inner
= TREE_OPERAND (exp
, 0);
2965 REFERENCE_CLASS_P (inner
);
2966 inner
= TREE_OPERAND (inner
, 0))
2970 op1
= TREE_OPERAND (exp
, 1);
2972 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
2975 /* If this expression hasn't been completed let, leave it alone. */
2976 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
2979 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2980 if (op0
== TREE_OPERAND (exp
, 0))
2984 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
2987 switch (TREE_CODE_CLASS (code
))
2992 case tcc_declaration
:
2998 case tcc_expression
:
3002 /* Fall through... */
3004 case tcc_exceptional
:
3007 case tcc_comparison
:
3009 switch (TREE_CODE_LENGTH (code
))
3015 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3016 if (op0
== TREE_OPERAND (exp
, 0))
3019 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3023 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3024 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3026 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3029 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3033 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3034 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3035 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3037 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3038 && op2
== TREE_OPERAND (exp
, 2))
3041 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3045 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3046 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3047 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3048 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3050 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3051 && op2
== TREE_OPERAND (exp
, 2)
3052 && op3
== TREE_OPERAND (exp
, 3))
3056 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3068 new_tree
= NULL_TREE
;
3070 /* If we are trying to replace F with a constant, inline back
3071 functions which do nothing else than computing a value from
3072 the arguments they are passed. This makes it possible to
3073 fold partially or entirely the replacement expression. */
3074 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3076 tree t
= maybe_inline_call_in_expr (exp
);
3078 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3081 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3083 tree op
= TREE_OPERAND (exp
, i
);
3084 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3088 new_tree
= copy_node (exp
);
3089 TREE_OPERAND (new_tree
, i
) = new_op
;
3095 new_tree
= fold (new_tree
);
3096 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3097 process_call_operands (new_tree
);
3108 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3112 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3113 for it within OBJ, a tree that is an object or a chain of references. */
3116 substitute_placeholder_in_expr (tree exp
, tree obj
)
3118 enum tree_code code
= TREE_CODE (exp
);
3119 tree op0
, op1
, op2
, op3
;
3122 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3123 in the chain of OBJ. */
3124 if (code
== PLACEHOLDER_EXPR
)
3126 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3129 for (elt
= obj
; elt
!= 0;
3130 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3131 || TREE_CODE (elt
) == COND_EXPR
)
3132 ? TREE_OPERAND (elt
, 1)
3133 : (REFERENCE_CLASS_P (elt
)
3134 || UNARY_CLASS_P (elt
)
3135 || BINARY_CLASS_P (elt
)
3136 || VL_EXP_CLASS_P (elt
)
3137 || EXPRESSION_CLASS_P (elt
))
3138 ? TREE_OPERAND (elt
, 0) : 0))
3139 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3142 for (elt
= obj
; elt
!= 0;
3143 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3144 || TREE_CODE (elt
) == COND_EXPR
)
3145 ? TREE_OPERAND (elt
, 1)
3146 : (REFERENCE_CLASS_P (elt
)
3147 || UNARY_CLASS_P (elt
)
3148 || BINARY_CLASS_P (elt
)
3149 || VL_EXP_CLASS_P (elt
)
3150 || EXPRESSION_CLASS_P (elt
))
3151 ? TREE_OPERAND (elt
, 0) : 0))
3152 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3153 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3155 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3157 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3158 survives until RTL generation, there will be an error. */
3162 /* TREE_LIST is special because we need to look at TREE_VALUE
3163 and TREE_CHAIN, not TREE_OPERANDS. */
3164 else if (code
== TREE_LIST
)
3166 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3167 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3168 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3171 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3174 switch (TREE_CODE_CLASS (code
))
3177 case tcc_declaration
:
3180 case tcc_exceptional
:
3183 case tcc_comparison
:
3184 case tcc_expression
:
3187 switch (TREE_CODE_LENGTH (code
))
3193 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3194 if (op0
== TREE_OPERAND (exp
, 0))
3197 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3201 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3202 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3204 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3207 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3211 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3212 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3213 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3215 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3216 && op2
== TREE_OPERAND (exp
, 2))
3219 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3223 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3224 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3225 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3226 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3228 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3229 && op2
== TREE_OPERAND (exp
, 2)
3230 && op3
== TREE_OPERAND (exp
, 3))
3234 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3246 new_tree
= NULL_TREE
;
3248 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3250 tree op
= TREE_OPERAND (exp
, i
);
3251 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3255 new_tree
= copy_node (exp
);
3256 TREE_OPERAND (new_tree
, i
) = new_op
;
3262 new_tree
= fold (new_tree
);
3263 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3264 process_call_operands (new_tree
);
3275 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3279 /* Stabilize a reference so that we can use it any number of times
3280 without causing its operands to be evaluated more than once.
3281 Returns the stabilized reference. This works by means of save_expr,
3282 so see the caveats in the comments about save_expr.
3284 Also allows conversion expressions whose operands are references.
3285 Any other kind of expression is returned unchanged. */
3288 stabilize_reference (tree ref
)
3291 enum tree_code code
= TREE_CODE (ref
);
3298 /* No action is needed in this case. */
3303 case FIX_TRUNC_EXPR
:
3304 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3308 result
= build_nt (INDIRECT_REF
,
3309 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3313 result
= build_nt (COMPONENT_REF
,
3314 stabilize_reference (TREE_OPERAND (ref
, 0)),
3315 TREE_OPERAND (ref
, 1), NULL_TREE
);
3319 result
= build_nt (BIT_FIELD_REF
,
3320 stabilize_reference (TREE_OPERAND (ref
, 0)),
3321 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3322 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3326 result
= build_nt (ARRAY_REF
,
3327 stabilize_reference (TREE_OPERAND (ref
, 0)),
3328 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3329 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3332 case ARRAY_RANGE_REF
:
3333 result
= build_nt (ARRAY_RANGE_REF
,
3334 stabilize_reference (TREE_OPERAND (ref
, 0)),
3335 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3336 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3340 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3341 it wouldn't be ignored. This matters when dealing with
3343 return stabilize_reference_1 (ref
);
3345 /* If arg isn't a kind of lvalue we recognize, make no change.
3346 Caller should recognize the error for an invalid lvalue. */
3351 return error_mark_node
;
3354 TREE_TYPE (result
) = TREE_TYPE (ref
);
3355 TREE_READONLY (result
) = TREE_READONLY (ref
);
3356 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3357 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3362 /* Subroutine of stabilize_reference; this is called for subtrees of
3363 references. Any expression with side-effects must be put in a SAVE_EXPR
3364 to ensure that it is only evaluated once.
3366 We don't put SAVE_EXPR nodes around everything, because assigning very
3367 simple expressions to temporaries causes us to miss good opportunities
3368 for optimizations. Among other things, the opportunity to fold in the
3369 addition of a constant into an addressing mode often gets lost, e.g.
3370 "y[i+1] += x;". In general, we take the approach that we should not make
3371 an assignment unless we are forced into it - i.e., that any non-side effect
3372 operator should be allowed, and that cse should take care of coalescing
3373 multiple utterances of the same expression should that prove fruitful. */
3376 stabilize_reference_1 (tree e
)
3379 enum tree_code code
= TREE_CODE (e
);
3381 /* We cannot ignore const expressions because it might be a reference
3382 to a const array but whose index contains side-effects. But we can
3383 ignore things that are actual constant or that already have been
3384 handled by this function. */
3386 if (tree_invariant_p (e
))
3389 switch (TREE_CODE_CLASS (code
))
3391 case tcc_exceptional
:
3393 case tcc_declaration
:
3394 case tcc_comparison
:
3396 case tcc_expression
:
3399 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3400 so that it will only be evaluated once. */
3401 /* The reference (r) and comparison (<) classes could be handled as
3402 below, but it is generally faster to only evaluate them once. */
3403 if (TREE_SIDE_EFFECTS (e
))
3404 return save_expr (e
);
3408 /* Constants need no processing. In fact, we should never reach
3413 /* Division is slow and tends to be compiled with jumps,
3414 especially the division by powers of 2 that is often
3415 found inside of an array reference. So do it just once. */
3416 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3417 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3418 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3419 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3420 return save_expr (e
);
3421 /* Recursively stabilize each operand. */
3422 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3423 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3427 /* Recursively stabilize each operand. */
3428 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3435 TREE_TYPE (result
) = TREE_TYPE (e
);
3436 TREE_READONLY (result
) = TREE_READONLY (e
);
3437 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3438 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3443 /* Low-level constructors for expressions. */
3445 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3446 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3449 recompute_tree_invariant_for_addr_expr (tree t
)
3452 bool tc
= true, se
= false;
3454 /* We started out assuming this address is both invariant and constant, but
3455 does not have side effects. Now go down any handled components and see if
3456 any of them involve offsets that are either non-constant or non-invariant.
3457 Also check for side-effects.
3459 ??? Note that this code makes no attempt to deal with the case where
3460 taking the address of something causes a copy due to misalignment. */
3462 #define UPDATE_FLAGS(NODE) \
3463 do { tree _node = (NODE); \
3464 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3465 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3467 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3468 node
= TREE_OPERAND (node
, 0))
3470 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3471 array reference (probably made temporarily by the G++ front end),
3472 so ignore all the operands. */
3473 if ((TREE_CODE (node
) == ARRAY_REF
3474 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3475 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3477 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3478 if (TREE_OPERAND (node
, 2))
3479 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3480 if (TREE_OPERAND (node
, 3))
3481 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3483 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3484 FIELD_DECL, apparently. The G++ front end can put something else
3485 there, at least temporarily. */
3486 else if (TREE_CODE (node
) == COMPONENT_REF
3487 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3489 if (TREE_OPERAND (node
, 2))
3490 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3492 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3493 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3496 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3498 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3499 the address, since &(*a)->b is a form of addition. If it's a constant, the
3500 address is constant too. If it's a decl, its address is constant if the
3501 decl is static. Everything else is not constant and, furthermore,
3502 taking the address of a volatile variable is not volatile. */
3503 if (TREE_CODE (node
) == INDIRECT_REF
)
3504 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3505 else if (CONSTANT_CLASS_P (node
))
3507 else if (DECL_P (node
))
3508 tc
&= (staticp (node
) != NULL_TREE
);
3512 se
|= TREE_SIDE_EFFECTS (node
);
3516 TREE_CONSTANT (t
) = tc
;
3517 TREE_SIDE_EFFECTS (t
) = se
;
3521 /* Build an expression of code CODE, data type TYPE, and operands as
3522 specified. Expressions and reference nodes can be created this way.
3523 Constants, decls, types and misc nodes cannot be.
3525 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3526 enough for all extant tree codes. */
3529 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3533 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3535 t
= make_node_stat (code PASS_MEM_STAT
);
3542 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3544 int length
= sizeof (struct tree_exp
);
3545 #ifdef GATHER_STATISTICS
3546 tree_node_kind kind
;
3550 #ifdef GATHER_STATISTICS
3551 switch (TREE_CODE_CLASS (code
))
3553 case tcc_statement
: /* an expression with side effects */
3556 case tcc_reference
: /* a reference */
3564 tree_node_counts
[(int) kind
]++;
3565 tree_node_sizes
[(int) kind
] += length
;
3568 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3570 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
3572 memset (t
, 0, sizeof (struct tree_common
));
3574 TREE_SET_CODE (t
, code
);
3576 TREE_TYPE (t
) = type
;
3577 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3578 TREE_OPERAND (t
, 0) = node
;
3579 TREE_BLOCK (t
) = NULL_TREE
;
3580 if (node
&& !TYPE_P (node
))
3582 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3583 TREE_READONLY (t
) = TREE_READONLY (node
);
3586 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3587 TREE_SIDE_EFFECTS (t
) = 1;
3591 /* All of these have side-effects, no matter what their
3593 TREE_SIDE_EFFECTS (t
) = 1;
3594 TREE_READONLY (t
) = 0;
3597 case MISALIGNED_INDIRECT_REF
:
3598 case ALIGN_INDIRECT_REF
:
3600 /* Whether a dereference is readonly has nothing to do with whether
3601 its operand is readonly. */
3602 TREE_READONLY (t
) = 0;
3607 recompute_tree_invariant_for_addr_expr (t
);
3611 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3612 && node
&& !TYPE_P (node
)
3613 && TREE_CONSTANT (node
))
3614 TREE_CONSTANT (t
) = 1;
3615 if (TREE_CODE_CLASS (code
) == tcc_reference
3616 && node
&& TREE_THIS_VOLATILE (node
))
3617 TREE_THIS_VOLATILE (t
) = 1;
3624 #define PROCESS_ARG(N) \
3626 TREE_OPERAND (t, N) = arg##N; \
3627 if (arg##N &&!TYPE_P (arg##N)) \
3629 if (TREE_SIDE_EFFECTS (arg##N)) \
3631 if (!TREE_READONLY (arg##N) \
3632 && !CONSTANT_CLASS_P (arg##N)) \
3634 if (!TREE_CONSTANT (arg##N)) \
3640 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3642 bool constant
, read_only
, side_effects
;
3645 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3647 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3648 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3649 /* When sizetype precision doesn't match that of pointers
3650 we need to be able to build explicit extensions or truncations
3651 of the offset argument. */
3652 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3653 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3654 && TREE_CODE (arg1
) == INTEGER_CST
);
3656 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3657 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3658 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3659 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3661 t
= make_node_stat (code PASS_MEM_STAT
);
3664 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3665 result based on those same flags for the arguments. But if the
3666 arguments aren't really even `tree' expressions, we shouldn't be trying
3669 /* Expressions without side effects may be constant if their
3670 arguments are as well. */
3671 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3672 || TREE_CODE_CLASS (code
) == tcc_binary
);
3674 side_effects
= TREE_SIDE_EFFECTS (t
);
3679 TREE_READONLY (t
) = read_only
;
3680 TREE_CONSTANT (t
) = constant
;
3681 TREE_SIDE_EFFECTS (t
) = side_effects
;
3682 TREE_THIS_VOLATILE (t
)
3683 = (TREE_CODE_CLASS (code
) == tcc_reference
3684 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3691 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3692 tree arg2 MEM_STAT_DECL
)
3694 bool constant
, read_only
, side_effects
;
3697 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3698 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3700 t
= make_node_stat (code PASS_MEM_STAT
);
3705 /* As a special exception, if COND_EXPR has NULL branches, we
3706 assume that it is a gimple statement and always consider
3707 it to have side effects. */
3708 if (code
== COND_EXPR
3709 && tt
== void_type_node
3710 && arg1
== NULL_TREE
3711 && arg2
== NULL_TREE
)
3712 side_effects
= true;
3714 side_effects
= TREE_SIDE_EFFECTS (t
);
3720 if (code
== COND_EXPR
)
3721 TREE_READONLY (t
) = read_only
;
3723 TREE_SIDE_EFFECTS (t
) = side_effects
;
3724 TREE_THIS_VOLATILE (t
)
3725 = (TREE_CODE_CLASS (code
) == tcc_reference
3726 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3732 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3733 tree arg2
, tree arg3 MEM_STAT_DECL
)
3735 bool constant
, read_only
, side_effects
;
3738 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3740 t
= make_node_stat (code PASS_MEM_STAT
);
3743 side_effects
= TREE_SIDE_EFFECTS (t
);
3750 TREE_SIDE_EFFECTS (t
) = side_effects
;
3751 TREE_THIS_VOLATILE (t
)
3752 = (TREE_CODE_CLASS (code
) == tcc_reference
3753 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3759 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3760 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3762 bool constant
, read_only
, side_effects
;
3765 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3767 t
= make_node_stat (code PASS_MEM_STAT
);
3770 side_effects
= TREE_SIDE_EFFECTS (t
);
3778 TREE_SIDE_EFFECTS (t
) = side_effects
;
3779 TREE_THIS_VOLATILE (t
)
3780 = (TREE_CODE_CLASS (code
) == tcc_reference
3781 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3787 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3788 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3790 bool constant
, read_only
, side_effects
;
3793 gcc_assert (code
== TARGET_MEM_REF
);
3795 t
= make_node_stat (code PASS_MEM_STAT
);
3798 side_effects
= TREE_SIDE_EFFECTS (t
);
3807 TREE_SIDE_EFFECTS (t
) = side_effects
;
3808 TREE_THIS_VOLATILE (t
) = 0;
3813 /* Similar except don't specify the TREE_TYPE
3814 and leave the TREE_SIDE_EFFECTS as 0.
3815 It is permissible for arguments to be null,
3816 or even garbage if their values do not matter. */
3819 build_nt (enum tree_code code
, ...)
3826 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3830 t
= make_node (code
);
3831 length
= TREE_CODE_LENGTH (code
);
3833 for (i
= 0; i
< length
; i
++)
3834 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3840 /* Similar to build_nt, but for creating a CALL_EXPR object with
3841 ARGLIST passed as a list. */
3844 build_nt_call_list (tree fn
, tree arglist
)
3849 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
3850 CALL_EXPR_FN (t
) = fn
;
3851 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
3852 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
3853 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
3857 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3861 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
3866 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
3867 CALL_EXPR_FN (ret
) = fn
;
3868 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
3869 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
3870 CALL_EXPR_ARG (ret
, ix
) = t
;
3874 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3875 We do NOT enter this node in any sort of symbol table.
3877 LOC is the location of the decl.
3879 layout_decl is used to set up the decl's storage layout.
3880 Other slots are initialized to 0 or null pointers. */
3883 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
3884 tree type MEM_STAT_DECL
)
3888 t
= make_node_stat (code PASS_MEM_STAT
);
3889 DECL_SOURCE_LOCATION (t
) = loc
;
3891 /* if (type == error_mark_node)
3892 type = integer_type_node; */
3893 /* That is not done, deliberately, so that having error_mark_node
3894 as the type can suppress useless errors in the use of this variable. */
3896 DECL_NAME (t
) = name
;
3897 TREE_TYPE (t
) = type
;
3899 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3905 /* Builds and returns function declaration with NAME and TYPE. */
3908 build_fn_decl (const char *name
, tree type
)
3910 tree id
= get_identifier (name
);
3911 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
3913 DECL_EXTERNAL (decl
) = 1;
3914 TREE_PUBLIC (decl
) = 1;
3915 DECL_ARTIFICIAL (decl
) = 1;
3916 TREE_NOTHROW (decl
) = 1;
3922 /* BLOCK nodes are used to represent the structure of binding contours
3923 and declarations, once those contours have been exited and their contents
3924 compiled. This information is used for outputting debugging info. */
3927 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3929 tree block
= make_node (BLOCK
);
3931 BLOCK_VARS (block
) = vars
;
3932 BLOCK_SUBBLOCKS (block
) = subblocks
;
3933 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3934 BLOCK_CHAIN (block
) = chain
;
3939 expand_location (source_location loc
)
3941 expanded_location xloc
;
3951 const struct line_map
*map
= linemap_lookup (line_table
, loc
);
3952 xloc
.file
= map
->to_file
;
3953 xloc
.line
= SOURCE_LINE (map
, loc
);
3954 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3955 xloc
.sysp
= map
->sysp
!= 0;
3961 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3963 LOC is the location to use in tree T. */
3966 protected_set_expr_location (tree t
, location_t loc
)
3968 if (t
&& CAN_HAVE_LOCATION_P (t
))
3969 SET_EXPR_LOCATION (t
, loc
);
3972 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3976 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3978 DECL_ATTRIBUTES (ddecl
) = attribute
;
3982 /* Borrowed from hashtab.c iterative_hash implementation. */
3983 #define mix(a,b,c) \
3985 a -= b; a -= c; a ^= (c>>13); \
3986 b -= c; b -= a; b ^= (a<< 8); \
3987 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3988 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3989 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3990 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3991 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3992 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3993 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3997 /* Produce good hash value combining VAL and VAL2. */
3999 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4001 /* the golden ratio; an arbitrary value. */
4002 hashval_t a
= 0x9e3779b9;
4008 /* Produce good hash value combining VAL and VAL2. */
4010 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4012 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4013 return iterative_hash_hashval_t (val
, val2
);
4016 hashval_t a
= (hashval_t
) val
;
4017 /* Avoid warnings about shifting of more than the width of the type on
4018 hosts that won't execute this path. */
4020 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4022 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4024 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4025 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4032 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4033 is ATTRIBUTE and its qualifiers are QUALS.
4035 Record such modified types already made so we don't make duplicates. */
4038 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4040 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4042 hashval_t hashcode
= 0;
4044 enum tree_code code
= TREE_CODE (ttype
);
4046 /* Building a distinct copy of a tagged type is inappropriate; it
4047 causes breakage in code that expects there to be a one-to-one
4048 relationship between a struct and its fields.
4049 build_duplicate_type is another solution (as used in
4050 handle_transparent_union_attribute), but that doesn't play well
4051 with the stronger C++ type identity model. */
4052 if (TREE_CODE (ttype
) == RECORD_TYPE
4053 || TREE_CODE (ttype
) == UNION_TYPE
4054 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4055 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4057 warning (OPT_Wattributes
,
4058 "ignoring attributes applied to %qT after definition",
4059 TYPE_MAIN_VARIANT (ttype
));
4060 return build_qualified_type (ttype
, quals
);
4063 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4064 ntype
= build_distinct_type_copy (ttype
);
4066 TYPE_ATTRIBUTES (ntype
) = attribute
;
4068 hashcode
= iterative_hash_object (code
, hashcode
);
4069 if (TREE_TYPE (ntype
))
4070 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4072 hashcode
= attribute_hash_list (attribute
, hashcode
);
4074 switch (TREE_CODE (ntype
))
4077 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4080 if (TYPE_DOMAIN (ntype
))
4081 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4085 hashcode
= iterative_hash_object
4086 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4087 hashcode
= iterative_hash_object
4088 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4091 case FIXED_POINT_TYPE
:
4093 unsigned int precision
= TYPE_PRECISION (ntype
);
4094 hashcode
= iterative_hash_object (precision
, hashcode
);
4101 ntype
= type_hash_canon (hashcode
, ntype
);
4103 /* If the target-dependent attributes make NTYPE different from
4104 its canonical type, we will need to use structural equality
4105 checks for this type. */
4106 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4107 || !targetm
.comp_type_attributes (ntype
, ttype
))
4108 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4109 else if (TYPE_CANONICAL (ntype
) == ntype
)
4110 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4112 ttype
= build_qualified_type (ntype
, quals
);
4114 else if (TYPE_QUALS (ttype
) != quals
)
4115 ttype
= build_qualified_type (ttype
, quals
);
4121 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4124 Record such modified types already made so we don't make duplicates. */
4127 build_type_attribute_variant (tree ttype
, tree attribute
)
4129 return build_type_attribute_qual_variant (ttype
, attribute
,
4130 TYPE_QUALS (ttype
));
4133 /* Reset all language specific information still present in TYPE. */
4136 free_lang_data_in_type (tree type
)
4138 gcc_assert (TYPE_P (type
));
4140 /* Fill in the alias-set. We need to at least track zeroness here
4142 if (lang_hooks
.get_alias_set (type
) == 0)
4143 TYPE_ALIAS_SET (type
) = 0;
4145 /* Give the FE a chance to remove its own data first. */
4146 lang_hooks
.free_lang_data (type
);
4148 TREE_LANG_FLAG_0 (type
) = 0;
4149 TREE_LANG_FLAG_1 (type
) = 0;
4150 TREE_LANG_FLAG_2 (type
) = 0;
4151 TREE_LANG_FLAG_3 (type
) = 0;
4152 TREE_LANG_FLAG_4 (type
) = 0;
4153 TREE_LANG_FLAG_5 (type
) = 0;
4154 TREE_LANG_FLAG_6 (type
) = 0;
4156 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4158 /* Remove the const and volatile qualifiers from arguments. The
4159 C++ front end removes them, but the C front end does not,
4160 leading to false ODR violation errors when merging two
4161 instances of the same function signature compiled by
4162 different front ends. */
4165 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4167 tree arg_type
= TREE_VALUE (p
);
4169 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4171 int quals
= TYPE_QUALS (arg_type
)
4173 & ~TYPE_QUAL_VOLATILE
;
4174 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4175 free_lang_data_in_type (TREE_VALUE (p
));
4180 /* Remove members that are not actually FIELD_DECLs from the field
4181 list of an aggregate. These occur in C++. */
4182 if (TREE_CODE (type
) == RECORD_TYPE
4183 || TREE_CODE (type
) == UNION_TYPE
4184 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4188 /* Note that TYPE_FIELDS can be shared across distinct
4189 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4190 to be removed, we cannot set its TREE_CHAIN to NULL.
4191 Otherwise, we would not be able to find all the other fields
4192 in the other instances of this TREE_TYPE.
4194 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4196 member
= TYPE_FIELDS (type
);
4199 if (TREE_CODE (member
) == FIELD_DECL
)
4202 TREE_CHAIN (prev
) = member
;
4204 TYPE_FIELDS (type
) = member
;
4208 member
= TREE_CHAIN (member
);
4212 TREE_CHAIN (prev
) = NULL_TREE
;
4214 TYPE_FIELDS (type
) = NULL_TREE
;
4216 TYPE_METHODS (type
) = NULL_TREE
;
4217 if (TYPE_BINFO (type
))
4219 tree binfo
= TYPE_BINFO (type
);
4221 if (BINFO_VIRTUALS (binfo
))
4223 /* If the virtual function table for BINFO contains
4224 entries, these may be useful for folding OBJ_TYPE_REF
4225 expressions (see gimple_fold_obj_type_ref). In that
4226 case, we only clear the unused fields in the BINFO
4228 BINFO_OFFSET (binfo
) = NULL_TREE
;
4229 BINFO_VTABLE (binfo
) = NULL_TREE
;
4230 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
4231 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4232 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4233 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4234 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
4238 /* Otherwise, get rid of the whole binfo data. */
4239 TYPE_BINFO (type
) = NULL_TREE
;
4245 /* For non-aggregate types, clear out the language slot (which
4246 overloads TYPE_BINFO). */
4247 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4250 TYPE_CONTEXT (type
) = NULL_TREE
;
4251 TYPE_STUB_DECL (type
) = NULL_TREE
;
4255 /* Return true if DECL may need an assembler name to be set. */
4258 need_assembler_name_p (tree decl
)
4260 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4261 if (TREE_CODE (decl
) != FUNCTION_DECL
4262 && TREE_CODE (decl
) != VAR_DECL
)
4265 /* If DECL already has its assembler name set, it does not need a
4267 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4268 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4271 /* For VAR_DECLs, only static, public and external symbols need an
4273 if (TREE_CODE (decl
) == VAR_DECL
4274 && !TREE_STATIC (decl
)
4275 && !TREE_PUBLIC (decl
)
4276 && !DECL_EXTERNAL (decl
))
4279 /* Do not set assembler name on builtins. Allow RTL expansion to
4280 decide whether to expand inline or via a regular call. */
4281 if (TREE_CODE (decl
) == FUNCTION_DECL
4282 && DECL_BUILT_IN (decl
)
4283 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4286 /* For FUNCTION_DECLs, only used functions and functions
4287 represented in the callgraph need an assembler name. */
4288 if (TREE_CODE (decl
) == FUNCTION_DECL
4289 && cgraph_node_for_decl (decl
) == NULL
4290 && !TREE_USED (decl
))
4297 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4298 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4299 in BLOCK that is not in LOCALS is removed. */
4302 free_lang_data_in_block (tree fn
, tree block
, struct pointer_set_t
*locals
)
4306 tp
= &BLOCK_VARS (block
);
4309 if (!pointer_set_contains (locals
, *tp
))
4310 *tp
= TREE_CHAIN (*tp
);
4312 tp
= &TREE_CHAIN (*tp
);
4315 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4316 free_lang_data_in_block (fn
, t
, locals
);
4320 /* Reset all language specific information still present in symbol
4324 free_lang_data_in_decl (tree decl
)
4326 gcc_assert (DECL_P (decl
));
4328 /* Give the FE a chance to remove its own data first. */
4329 lang_hooks
.free_lang_data (decl
);
4331 TREE_LANG_FLAG_0 (decl
) = 0;
4332 TREE_LANG_FLAG_1 (decl
) = 0;
4333 TREE_LANG_FLAG_2 (decl
) = 0;
4334 TREE_LANG_FLAG_3 (decl
) = 0;
4335 TREE_LANG_FLAG_4 (decl
) = 0;
4336 TREE_LANG_FLAG_5 (decl
) = 0;
4337 TREE_LANG_FLAG_6 (decl
) = 0;
4339 /* Identifiers need not have a type. */
4340 if (DECL_NAME (decl
))
4341 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4343 if (TREE_CODE (decl
) == CONST_DECL
)
4344 DECL_CONTEXT (decl
) = NULL_TREE
;
4346 /* Ignore any intervening types, because we are going to clear their
4347 TYPE_CONTEXT fields. */
4348 if (TREE_CODE (decl
) != FIELD_DECL
)
4349 DECL_CONTEXT (decl
) = decl_function_context (decl
);
4351 if (DECL_CONTEXT (decl
)
4352 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
)
4353 DECL_CONTEXT (decl
) = NULL_TREE
;
4355 if (TREE_CODE (decl
) == VAR_DECL
)
4357 tree context
= DECL_CONTEXT (decl
);
4361 enum tree_code code
= TREE_CODE (context
);
4362 if (code
== FUNCTION_DECL
&& DECL_ABSTRACT (context
))
4364 /* Do not clear the decl context here, that will promote
4365 all vars to global ones. */
4366 DECL_INITIAL (decl
) = NULL_TREE
;
4369 if (TREE_STATIC (decl
))
4370 DECL_CONTEXT (decl
) = NULL_TREE
;
4374 if (TREE_CODE (decl
) == PARM_DECL
4375 || TREE_CODE (decl
) == FIELD_DECL
4376 || TREE_CODE (decl
) == RESULT_DECL
)
4378 tree unit_size
= DECL_SIZE_UNIT (decl
);
4379 tree size
= DECL_SIZE (decl
);
4380 if ((unit_size
&& TREE_CODE (unit_size
) != INTEGER_CST
)
4381 || (size
&& TREE_CODE (size
) != INTEGER_CST
))
4383 DECL_SIZE_UNIT (decl
) = NULL_TREE
;
4384 DECL_SIZE (decl
) = NULL_TREE
;
4387 if (TREE_CODE (decl
) == FIELD_DECL
4388 && DECL_FIELD_OFFSET (decl
)
4389 && TREE_CODE (DECL_FIELD_OFFSET (decl
)) != INTEGER_CST
)
4390 DECL_FIELD_OFFSET (decl
) = NULL_TREE
;
4392 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4394 if (gimple_has_body_p (decl
))
4397 struct pointer_set_t
*locals
;
4399 /* If DECL has a gimple body, then the context for its
4400 arguments must be DECL. Otherwise, it doesn't really
4401 matter, as we will not be emitting any code for DECL. In
4402 general, there may be other instances of DECL created by
4403 the front end and since PARM_DECLs are generally shared,
4404 their DECL_CONTEXT changes as the replicas of DECL are
4405 created. The only time where DECL_CONTEXT is important
4406 is for the FUNCTION_DECLs that have a gimple body (since
4407 the PARM_DECL will be used in the function's body). */
4408 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4409 DECL_CONTEXT (t
) = decl
;
4411 /* Collect all the symbols declared in DECL. */
4412 locals
= pointer_set_create ();
4413 t
= DECL_STRUCT_FUNCTION (decl
)->local_decls
;
4414 for (; t
; t
= TREE_CHAIN (t
))
4416 pointer_set_insert (locals
, TREE_VALUE (t
));
4418 /* All the local symbols should have DECL as their
4420 DECL_CONTEXT (TREE_VALUE (t
)) = decl
;
4423 /* Get rid of any decl not in local_decls. */
4424 free_lang_data_in_block (decl
, DECL_INITIAL (decl
), locals
);
4426 pointer_set_destroy (locals
);
4429 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4430 At this point, it is not needed anymore. */
4431 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4433 else if (TREE_CODE (decl
) == VAR_DECL
)
4435 tree expr
= DECL_DEBUG_EXPR (decl
);
4437 && TREE_CODE (expr
) == VAR_DECL
4438 && !TREE_STATIC (expr
) && !DECL_EXTERNAL (expr
))
4439 SET_DECL_DEBUG_EXPR (decl
, NULL_TREE
);
4441 if (DECL_EXTERNAL (decl
))
4442 DECL_INITIAL (decl
) = NULL_TREE
;
4444 else if (TREE_CODE (decl
) == TYPE_DECL
)
4446 DECL_INITIAL (decl
) = NULL_TREE
;
4448 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4449 FIELD_DECLs, which should be preserved. Otherwise,
4450 we shouldn't be concerned with source-level lexical
4451 nesting beyond this point. */
4452 DECL_CONTEXT (decl
) = NULL_TREE
;
4457 /* Data used when collecting DECLs and TYPEs for language data removal. */
4459 struct free_lang_data_d
4461 /* Worklist to avoid excessive recursion. */
4462 VEC(tree
,heap
) *worklist
;
4464 /* Set of traversed objects. Used to avoid duplicate visits. */
4465 struct pointer_set_t
*pset
;
4467 /* Array of symbols to process with free_lang_data_in_decl. */
4468 VEC(tree
,heap
) *decls
;
4470 /* Array of types to process with free_lang_data_in_type. */
4471 VEC(tree
,heap
) *types
;
4475 /* Save all language fields needed to generate proper debug information
4476 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4479 save_debug_info_for_decl (tree t
)
4481 /*struct saved_debug_info_d *sdi;*/
4483 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4485 /* FIXME. Partial implementation for saving debug info removed. */
4489 /* Save all language fields needed to generate proper debug information
4490 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4493 save_debug_info_for_type (tree t
)
4495 /*struct saved_debug_info_d *sdi;*/
4497 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4499 /* FIXME. Partial implementation for saving debug info removed. */
4503 /* Add type or decl T to one of the list of tree nodes that need their
4504 language data removed. The lists are held inside FLD. */
4507 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4511 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4512 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4513 save_debug_info_for_decl (t
);
4515 else if (TYPE_P (t
))
4517 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4518 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4519 save_debug_info_for_type (t
);
4526 if (t && !pointer_set_contains (fld->pset, t)) \
4527 VEC_safe_push (tree, heap, fld->worklist, (t))
4529 /* Operand callback helper for free_lang_data_in_node. *TP is the
4530 subtree operand being considered. */
4533 find_decls_types_r (tree
*tp
, int *ws ATTRIBUTE_UNUSED
, void *data
)
4536 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4538 if (TREE_CODE (t
) == TREE_LIST
)
4543 /* Note that walk_tree does not traverse every possible field in
4544 decls, so we have to do our own traversals here. */
4545 add_tree_to_fld_list (t
, fld
);
4547 PUSH (DECL_NAME (t
));
4548 PUSH (DECL_CONTEXT (t
));
4549 PUSH (DECL_SIZE (t
));
4550 PUSH (DECL_SIZE_UNIT (t
));
4551 PUSH (DECL_INITIAL(t
));
4552 PUSH (DECL_ATTRIBUTES (t
));
4553 PUSH (DECL_ABSTRACT_ORIGIN (t
));
4555 if (TREE_CODE (t
) == FUNCTION_DECL
)
4557 PUSH (DECL_ARGUMENTS (t
));
4558 PUSH (DECL_RESULT (t
));
4560 else if (TREE_CODE (t
) == TYPE_DECL
)
4562 PUSH (DECL_ARGUMENT_FLD (t
));
4563 PUSH (DECL_VINDEX (t
));
4565 else if (TREE_CODE (t
) == FIELD_DECL
)
4567 PUSH (DECL_FIELD_OFFSET (t
));
4568 PUSH (DECL_BIT_FIELD_TYPE (t
));
4569 PUSH (DECL_QUALIFIER (t
));
4570 PUSH (DECL_FIELD_BIT_OFFSET (t
));
4571 PUSH (DECL_FCONTEXT (t
));
4573 else if (TREE_CODE (t
) == VAR_DECL
)
4575 PUSH (DECL_SECTION_NAME (t
));
4576 PUSH (DECL_COMDAT_GROUP (t
));
4579 PUSH (TREE_CHAIN (t
));
4582 else if (TYPE_P (t
))
4584 /* Note that walk_tree does not traverse every possible field in
4585 types, so we have to do our own traversals here. */
4586 add_tree_to_fld_list (t
, fld
);
4588 PUSH (TYPE_CACHED_VALUES (t
));
4589 PUSH (TYPE_SIZE (t
));
4590 PUSH (TYPE_SIZE_UNIT (t
));
4591 PUSH (TYPE_ATTRIBUTES (t
));
4592 PUSH (TYPE_POINTER_TO (t
));
4593 PUSH (TYPE_REFERENCE_TO (t
));
4594 PUSH (TYPE_NAME (t
));
4595 PUSH (TYPE_MINVAL (t
));
4596 PUSH (TYPE_MAXVAL (t
));
4597 PUSH (TYPE_MAIN_VARIANT (t
));
4598 PUSH (TYPE_NEXT_VARIANT (t
));
4599 PUSH (TYPE_CONTEXT (t
));
4600 PUSH (TYPE_CANONICAL (t
));
4602 if (RECORD_OR_UNION_TYPE_P (t
)
4607 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4609 PUSH (TREE_TYPE (tem
));
4612 PUSH (TREE_CHAIN (t
));
4616 PUSH (TREE_TYPE (t
));
4623 /* Find decls and types in T. */
4626 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4630 if (!pointer_set_contains (fld
->pset
, t
))
4631 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4632 if (VEC_empty (tree
, fld
->worklist
))
4634 t
= VEC_pop (tree
, fld
->worklist
);
4638 /* Translate all the types in LIST with the corresponding runtime
4642 get_eh_types_for_runtime (tree list
)
4646 if (list
== NULL_TREE
)
4649 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4651 list
= TREE_CHAIN (list
);
4654 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4655 TREE_CHAIN (prev
) = n
;
4656 prev
= TREE_CHAIN (prev
);
4657 list
= TREE_CHAIN (list
);
4664 /* Find decls and types referenced in EH region R and store them in
4665 FLD->DECLS and FLD->TYPES. */
4668 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4679 /* The types referenced in each catch must first be changed to the
4680 EH types used at runtime. This removes references to FE types
4682 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4684 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4685 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4690 case ERT_ALLOWED_EXCEPTIONS
:
4691 r
->u
.allowed
.type_list
4692 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4693 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4696 case ERT_MUST_NOT_THROW
:
4697 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4698 find_decls_types_r
, fld
, fld
->pset
);
4704 /* Find decls and types referenced in cgraph node N and store them in
4705 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4706 look for *every* kind of DECL and TYPE node reachable from N,
4707 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4708 NAMESPACE_DECLs, etc). */
4711 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4714 struct function
*fn
;
4717 find_decls_types (n
->decl
, fld
);
4719 if (!gimple_has_body_p (n
->decl
))
4722 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
4724 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
4726 /* Traverse locals. */
4727 for (t
= fn
->local_decls
; t
; t
= TREE_CHAIN (t
))
4728 find_decls_types (TREE_VALUE (t
), fld
);
4730 /* Traverse EH regions in FN. */
4733 FOR_ALL_EH_REGION_FN (r
, fn
)
4734 find_decls_types_in_eh_region (r
, fld
);
4737 /* Traverse every statement in FN. */
4738 FOR_EACH_BB_FN (bb
, fn
)
4740 gimple_stmt_iterator si
;
4743 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
4745 gimple phi
= gsi_stmt (si
);
4747 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4749 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
4750 find_decls_types (*arg_p
, fld
);
4754 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
4756 gimple stmt
= gsi_stmt (si
);
4758 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
4760 tree arg
= gimple_op (stmt
, i
);
4761 find_decls_types (arg
, fld
);
4768 /* Find decls and types referenced in varpool node N and store them in
4769 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4770 look for *every* kind of DECL and TYPE node reachable from N,
4771 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4772 NAMESPACE_DECLs, etc). */
4775 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
4777 find_decls_types (v
->decl
, fld
);
4781 /* Free language specific information for every operand and expression
4782 in every node of the call graph. This process operates in three stages:
4784 1- Every callgraph node and varpool node is traversed looking for
4785 decls and types embedded in them. This is a more exhaustive
4786 search than that done by find_referenced_vars, because it will
4787 also collect individual fields, decls embedded in types, etc.
4789 2- All the decls found are sent to free_lang_data_in_decl.
4791 3- All the types found are sent to free_lang_data_in_type.
4793 The ordering between decls and types is important because
4794 free_lang_data_in_decl sets assembler names, which includes
4795 mangling. So types cannot be freed up until assembler names have
4799 free_lang_data_in_cgraph (void)
4801 struct cgraph_node
*n
;
4802 struct varpool_node
*v
;
4803 struct free_lang_data_d fld
;
4808 /* Initialize sets and arrays to store referenced decls and types. */
4809 fld
.pset
= pointer_set_create ();
4810 fld
.worklist
= NULL
;
4811 fld
.decls
= VEC_alloc (tree
, heap
, 100);
4812 fld
.types
= VEC_alloc (tree
, heap
, 100);
4814 /* Find decls and types in the body of every function in the callgraph. */
4815 for (n
= cgraph_nodes
; n
; n
= n
->next
)
4816 find_decls_types_in_node (n
, &fld
);
4818 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4819 find_decls_types (p
->decl
, &fld
);
4821 /* Find decls and types in every varpool symbol. */
4822 for (v
= varpool_nodes_queue
; v
; v
= v
->next_needed
)
4823 find_decls_types_in_var (v
, &fld
);
4825 /* Set the assembler name on every decl found. We need to do this
4826 now because free_lang_data_in_decl will invalidate data needed
4827 for mangling. This breaks mangling on interdependent decls. */
4828 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
4829 if (need_assembler_name_p (t
))
4831 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4832 diagnostics that use input_location to show locus
4833 information. The problem here is that, at this point,
4834 input_location is generally anchored to the end of the file
4835 (since the parser is long gone), so we don't have a good
4836 position to pin it to.
4838 To alleviate this problem, this uses the location of T's
4839 declaration. Examples of this are
4840 testsuite/g++.dg/template/cond2.C and
4841 testsuite/g++.dg/template/pr35240.C. */
4842 location_t saved_location
= input_location
;
4843 input_location
= DECL_SOURCE_LOCATION (t
);
4845 decl_assembler_name (t
);
4847 input_location
= saved_location
;
4850 /* Traverse every decl found freeing its language data. */
4851 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
4852 free_lang_data_in_decl (t
);
4854 /* Traverse every type found freeing its language data. */
4855 for (i
= 0; VEC_iterate (tree
, fld
.types
, i
, t
); i
++)
4856 free_lang_data_in_type (t
);
4858 pointer_set_destroy (fld
.pset
);
4859 VEC_free (tree
, heap
, fld
.worklist
);
4860 VEC_free (tree
, heap
, fld
.decls
);
4861 VEC_free (tree
, heap
, fld
.types
);
4865 /* Free resources that are used by FE but are not needed once they are done. */
4868 free_lang_data (void)
4870 /* Traverse the IL resetting language specific information for
4871 operands, expressions, etc. */
4872 free_lang_data_in_cgraph ();
4874 /* Create gimple variants for common types. */
4875 ptrdiff_type_node
= integer_type_node
;
4876 fileptr_type_node
= ptr_type_node
;
4877 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
4878 || (TYPE_MODE (boolean_type_node
)
4879 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
4880 || TYPE_PRECISION (boolean_type_node
) != 1
4881 || !TYPE_UNSIGNED (boolean_type_node
))
4883 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
4884 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
4885 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
4886 TYPE_PRECISION (boolean_type_node
) = 1;
4887 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
4888 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
4891 /* Unify char_type_node with its properly signed variant. */
4892 if (TYPE_UNSIGNED (char_type_node
))
4893 unsigned_char_type_node
= char_type_node
;
4895 signed_char_type_node
= char_type_node
;
4897 /* Reset some langhooks. */
4898 lang_hooks
.callgraph
.analyze_expr
= NULL
;
4899 lang_hooks
.types_compatible_p
= NULL
;
4900 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
4901 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
4902 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
4903 lang_hooks
.fold_obj_type_ref
= gimple_fold_obj_type_ref
;
4905 /* Reset diagnostic machinery. */
4906 diagnostic_starter (global_dc
) = default_diagnostic_starter
;
4907 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
4908 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
4914 /* Gate function for free_lang_data. */
4917 gate_free_lang_data (void)
4919 /* FIXME. Remove after save_debug_info is working. */
4920 return !flag_gtoggle
&& debug_info_level
<= DINFO_LEVEL_TERSE
;
4924 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
4929 gate_free_lang_data
, /* gate */
4930 free_lang_data
, /* execute */
4933 0, /* static_pass_number */
4934 TV_IPA_FREE_LANG_DATA
, /* tv_id */
4935 0, /* properties_required */
4936 0, /* properties_provided */
4937 0, /* properties_destroyed */
4938 0, /* todo_flags_start */
4939 TODO_ggc_collect
/* todo_flags_finish */
4943 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4946 We try both `text' and `__text__', ATTR may be either one. */
4947 /* ??? It might be a reasonable simplification to require ATTR to be only
4948 `text'. One might then also require attribute lists to be stored in
4949 their canonicalized form. */
4952 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
4957 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
4960 p
= IDENTIFIER_POINTER (ident
);
4961 ident_len
= IDENTIFIER_LENGTH (ident
);
4963 if (ident_len
== attr_len
4964 && strcmp (attr
, p
) == 0)
4967 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
4970 gcc_assert (attr
[1] == '_');
4971 gcc_assert (attr
[attr_len
- 2] == '_');
4972 gcc_assert (attr
[attr_len
- 1] == '_');
4973 if (ident_len
== attr_len
- 4
4974 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
4979 if (ident_len
== attr_len
+ 4
4980 && p
[0] == '_' && p
[1] == '_'
4981 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
4982 && strncmp (attr
, p
+ 2, attr_len
) == 0)
4989 /* Return nonzero if IDENT is a valid name for attribute ATTR,
4992 We try both `text' and `__text__', ATTR may be either one. */
4995 is_attribute_p (const char *attr
, const_tree ident
)
4997 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5000 /* Given an attribute name and a list of attributes, return a pointer to the
5001 attribute's list element if the attribute is part of the list, or NULL_TREE
5002 if not found. If the attribute appears more than once, this only
5003 returns the first occurrence; the TREE_CHAIN of the return value should
5004 be passed back in if further occurrences are wanted. */
5007 lookup_attribute (const char *attr_name
, tree list
)
5010 size_t attr_len
= strlen (attr_name
);
5012 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5014 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5015 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5021 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5025 remove_attribute (const char *attr_name
, tree list
)
5028 size_t attr_len
= strlen (attr_name
);
5030 for (p
= &list
; *p
; )
5033 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5034 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5035 *p
= TREE_CHAIN (l
);
5037 p
= &TREE_CHAIN (l
);
5043 /* Return an attribute list that is the union of a1 and a2. */
5046 merge_attributes (tree a1
, tree a2
)
5050 /* Either one unset? Take the set one. */
5052 if ((attributes
= a1
) == 0)
5055 /* One that completely contains the other? Take it. */
5057 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5059 if (attribute_list_contained (a2
, a1
))
5063 /* Pick the longest list, and hang on the other list. */
5065 if (list_length (a1
) < list_length (a2
))
5066 attributes
= a2
, a2
= a1
;
5068 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5071 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5074 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5077 if (TREE_VALUE (a
) != NULL
5078 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
5079 && TREE_VALUE (a2
) != NULL
5080 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
5082 if (simple_cst_list_equal (TREE_VALUE (a
),
5083 TREE_VALUE (a2
)) == 1)
5086 else if (simple_cst_equal (TREE_VALUE (a
),
5087 TREE_VALUE (a2
)) == 1)
5092 a1
= copy_node (a2
);
5093 TREE_CHAIN (a1
) = attributes
;
5102 /* Given types T1 and T2, merge their attributes and return
5106 merge_type_attributes (tree t1
, tree t2
)
5108 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5109 TYPE_ATTRIBUTES (t2
));
5112 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5116 merge_decl_attributes (tree olddecl
, tree newdecl
)
5118 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5119 DECL_ATTRIBUTES (newdecl
));
5122 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5124 /* Specialization of merge_decl_attributes for various Windows targets.
5126 This handles the following situation:
5128 __declspec (dllimport) int foo;
5131 The second instance of `foo' nullifies the dllimport. */
5134 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5137 int delete_dllimport_p
= 1;
5139 /* What we need to do here is remove from `old' dllimport if it doesn't
5140 appear in `new'. dllimport behaves like extern: if a declaration is
5141 marked dllimport and a definition appears later, then the object
5142 is not dllimport'd. We also remove a `new' dllimport if the old list
5143 contains dllexport: dllexport always overrides dllimport, regardless
5144 of the order of declaration. */
5145 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5146 delete_dllimport_p
= 0;
5147 else if (DECL_DLLIMPORT_P (new_tree
)
5148 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5150 DECL_DLLIMPORT_P (new_tree
) = 0;
5151 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5152 "dllimport ignored", new_tree
);
5154 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5156 /* Warn about overriding a symbol that has already been used, e.g.:
5157 extern int __attribute__ ((dllimport)) foo;
5158 int* bar () {return &foo;}
5161 if (TREE_USED (old
))
5163 warning (0, "%q+D redeclared without dllimport attribute "
5164 "after being referenced with dll linkage", new_tree
);
5165 /* If we have used a variable's address with dllimport linkage,
5166 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5167 decl may already have had TREE_CONSTANT computed.
5168 We still remove the attribute so that assembler code refers
5169 to '&foo rather than '_imp__foo'. */
5170 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5171 DECL_DLLIMPORT_P (new_tree
) = 1;
5174 /* Let an inline definition silently override the external reference,
5175 but otherwise warn about attribute inconsistency. */
5176 else if (TREE_CODE (new_tree
) == VAR_DECL
5177 || !DECL_DECLARED_INLINE_P (new_tree
))
5178 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5179 "previous dllimport ignored", new_tree
);
5182 delete_dllimport_p
= 0;
5184 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5186 if (delete_dllimport_p
)
5189 const size_t attr_len
= strlen ("dllimport");
5191 /* Scan the list for dllimport and delete it. */
5192 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5194 if (is_attribute_with_length_p ("dllimport", attr_len
,
5197 if (prev
== NULL_TREE
)
5200 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5209 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5210 struct attribute_spec.handler. */
5213 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5219 /* These attributes may apply to structure and union types being created,
5220 but otherwise should pass to the declaration involved. */
5223 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5224 | (int) ATTR_FLAG_ARRAY_NEXT
))
5226 *no_add_attrs
= true;
5227 return tree_cons (name
, args
, NULL_TREE
);
5229 if (TREE_CODE (node
) == RECORD_TYPE
5230 || TREE_CODE (node
) == UNION_TYPE
)
5232 node
= TYPE_NAME (node
);
5238 warning (OPT_Wattributes
, "%qE attribute ignored",
5240 *no_add_attrs
= true;
5245 if (TREE_CODE (node
) != FUNCTION_DECL
5246 && TREE_CODE (node
) != VAR_DECL
5247 && TREE_CODE (node
) != TYPE_DECL
)
5249 *no_add_attrs
= true;
5250 warning (OPT_Wattributes
, "%qE attribute ignored",
5255 if (TREE_CODE (node
) == TYPE_DECL
5256 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5257 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5259 *no_add_attrs
= true;
5260 warning (OPT_Wattributes
, "%qE attribute ignored",
5265 is_dllimport
= is_attribute_p ("dllimport", name
);
5267 /* Report error on dllimport ambiguities seen now before they cause
5271 /* Honor any target-specific overrides. */
5272 if (!targetm
.valid_dllimport_attribute_p (node
))
5273 *no_add_attrs
= true;
5275 else if (TREE_CODE (node
) == FUNCTION_DECL
5276 && DECL_DECLARED_INLINE_P (node
))
5278 warning (OPT_Wattributes
, "inline function %q+D declared as "
5279 " dllimport: attribute ignored", node
);
5280 *no_add_attrs
= true;
5282 /* Like MS, treat definition of dllimported variables and
5283 non-inlined functions on declaration as syntax errors. */
5284 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5286 error ("function %q+D definition is marked dllimport", node
);
5287 *no_add_attrs
= true;
5290 else if (TREE_CODE (node
) == VAR_DECL
)
5292 if (DECL_INITIAL (node
))
5294 error ("variable %q+D definition is marked dllimport",
5296 *no_add_attrs
= true;
5299 /* `extern' needn't be specified with dllimport.
5300 Specify `extern' now and hope for the best. Sigh. */
5301 DECL_EXTERNAL (node
) = 1;
5302 /* Also, implicitly give dllimport'd variables declared within
5303 a function global scope, unless declared static. */
5304 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5305 TREE_PUBLIC (node
) = 1;
5308 if (*no_add_attrs
== false)
5309 DECL_DLLIMPORT_P (node
) = 1;
5311 else if (TREE_CODE (node
) == FUNCTION_DECL
5312 && DECL_DECLARED_INLINE_P (node
))
5313 /* An exported function, even if inline, must be emitted. */
5314 DECL_EXTERNAL (node
) = 0;
5316 /* Report error if symbol is not accessible at global scope. */
5317 if (!TREE_PUBLIC (node
)
5318 && (TREE_CODE (node
) == VAR_DECL
5319 || TREE_CODE (node
) == FUNCTION_DECL
))
5321 error ("external linkage required for symbol %q+D because of "
5322 "%qE attribute", node
, name
);
5323 *no_add_attrs
= true;
5326 /* A dllexport'd entity must have default visibility so that other
5327 program units (shared libraries or the main executable) can see
5328 it. A dllimport'd entity must have default visibility so that
5329 the linker knows that undefined references within this program
5330 unit can be resolved by the dynamic linker. */
5333 if (DECL_VISIBILITY_SPECIFIED (node
)
5334 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5335 error ("%qE implies default visibility, but %qD has already "
5336 "been declared with a different visibility",
5338 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5339 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5345 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5347 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5348 of the various TYPE_QUAL values. */
5351 set_type_quals (tree type
, int type_quals
)
5353 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5354 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5355 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5358 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5361 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5363 return (TYPE_QUALS (cand
) == type_quals
5364 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5365 /* Apparently this is needed for Objective-C. */
5366 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5367 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5368 TYPE_ATTRIBUTES (base
)));
5371 /* Return a version of the TYPE, qualified as indicated by the
5372 TYPE_QUALS, if one exists. If no qualified version exists yet,
5373 return NULL_TREE. */
5376 get_qualified_type (tree type
, int type_quals
)
5380 if (TYPE_QUALS (type
) == type_quals
)
5383 /* Search the chain of variants to see if there is already one there just
5384 like the one we need to have. If so, use that existing one. We must
5385 preserve the TYPE_NAME, since there is code that depends on this. */
5386 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5387 if (check_qualified_type (t
, type
, type_quals
))
5393 /* Like get_qualified_type, but creates the type if it does not
5394 exist. This function never returns NULL_TREE. */
5397 build_qualified_type (tree type
, int type_quals
)
5401 /* See if we already have the appropriate qualified variant. */
5402 t
= get_qualified_type (type
, type_quals
);
5404 /* If not, build it. */
5407 t
= build_variant_type_copy (type
);
5408 set_type_quals (t
, type_quals
);
5410 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5411 /* Propagate structural equality. */
5412 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5413 else if (TYPE_CANONICAL (type
) != type
)
5414 /* Build the underlying canonical type, since it is different
5416 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5419 /* T is its own canonical type. */
5420 TYPE_CANONICAL (t
) = t
;
5427 /* Create a new distinct copy of TYPE. The new type is made its own
5428 MAIN_VARIANT. If TYPE requires structural equality checks, the
5429 resulting type requires structural equality checks; otherwise, its
5430 TYPE_CANONICAL points to itself. */
5433 build_distinct_type_copy (tree type
)
5435 tree t
= copy_node (type
);
5437 TYPE_POINTER_TO (t
) = 0;
5438 TYPE_REFERENCE_TO (t
) = 0;
5440 /* Set the canonical type either to a new equivalence class, or
5441 propagate the need for structural equality checks. */
5442 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5443 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5445 TYPE_CANONICAL (t
) = t
;
5447 /* Make it its own variant. */
5448 TYPE_MAIN_VARIANT (t
) = t
;
5449 TYPE_NEXT_VARIANT (t
) = 0;
5451 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5452 whose TREE_TYPE is not t. This can also happen in the Ada
5453 frontend when using subtypes. */
5458 /* Create a new variant of TYPE, equivalent but distinct. This is so
5459 the caller can modify it. TYPE_CANONICAL for the return type will
5460 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5461 are considered equal by the language itself (or that both types
5462 require structural equality checks). */
5465 build_variant_type_copy (tree type
)
5467 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5469 t
= build_distinct_type_copy (type
);
5471 /* Since we're building a variant, assume that it is a non-semantic
5472 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5473 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5475 /* Add the new type to the chain of variants of TYPE. */
5476 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5477 TYPE_NEXT_VARIANT (m
) = t
;
5478 TYPE_MAIN_VARIANT (t
) = m
;
5483 /* Return true if the from tree in both tree maps are equal. */
5486 tree_map_base_eq (const void *va
, const void *vb
)
5488 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5489 *const b
= (const struct tree_map_base
*) vb
;
5490 return (a
->from
== b
->from
);
5493 /* Hash a from tree in a tree_map. */
5496 tree_map_base_hash (const void *item
)
5498 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5501 /* Return true if this tree map structure is marked for garbage collection
5502 purposes. We simply return true if the from tree is marked, so that this
5503 structure goes away when the from tree goes away. */
5506 tree_map_base_marked_p (const void *p
)
5508 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5512 tree_map_hash (const void *item
)
5514 return (((const struct tree_map
*) item
)->hash
);
5517 /* Return the initialization priority for DECL. */
5520 decl_init_priority_lookup (tree decl
)
5522 struct tree_priority_map
*h
;
5523 struct tree_map_base in
;
5525 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5527 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5528 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5531 /* Return the finalization priority for DECL. */
5534 decl_fini_priority_lookup (tree decl
)
5536 struct tree_priority_map
*h
;
5537 struct tree_map_base in
;
5539 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5541 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5542 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5545 /* Return the initialization and finalization priority information for
5546 DECL. If there is no previous priority information, a freshly
5547 allocated structure is returned. */
5549 static struct tree_priority_map
*
5550 decl_priority_info (tree decl
)
5552 struct tree_priority_map in
;
5553 struct tree_priority_map
*h
;
5556 in
.base
.from
= decl
;
5557 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5558 h
= (struct tree_priority_map
*) *loc
;
5561 h
= GGC_CNEW (struct tree_priority_map
);
5563 h
->base
.from
= decl
;
5564 h
->init
= DEFAULT_INIT_PRIORITY
;
5565 h
->fini
= DEFAULT_INIT_PRIORITY
;
5571 /* Set the initialization priority for DECL to PRIORITY. */
5574 decl_init_priority_insert (tree decl
, priority_type priority
)
5576 struct tree_priority_map
*h
;
5578 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5579 h
= decl_priority_info (decl
);
5583 /* Set the finalization priority for DECL to PRIORITY. */
5586 decl_fini_priority_insert (tree decl
, priority_type priority
)
5588 struct tree_priority_map
*h
;
5590 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5591 h
= decl_priority_info (decl
);
5595 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5598 print_debug_expr_statistics (void)
5600 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5601 (long) htab_size (debug_expr_for_decl
),
5602 (long) htab_elements (debug_expr_for_decl
),
5603 htab_collisions (debug_expr_for_decl
));
5606 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5609 print_value_expr_statistics (void)
5611 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5612 (long) htab_size (value_expr_for_decl
),
5613 (long) htab_elements (value_expr_for_decl
),
5614 htab_collisions (value_expr_for_decl
));
5617 /* Lookup a debug expression for FROM, and return it if we find one. */
5620 decl_debug_expr_lookup (tree from
)
5622 struct tree_map
*h
, in
;
5623 in
.base
.from
= from
;
5625 h
= (struct tree_map
*) htab_find_with_hash (debug_expr_for_decl
, &in
,
5626 htab_hash_pointer (from
));
5632 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5635 decl_debug_expr_insert (tree from
, tree to
)
5640 h
= GGC_NEW (struct tree_map
);
5641 h
->hash
= htab_hash_pointer (from
);
5642 h
->base
.from
= from
;
5644 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
5645 *(struct tree_map
**) loc
= h
;
5648 /* Lookup a value expression for FROM, and return it if we find one. */
5651 decl_value_expr_lookup (tree from
)
5653 struct tree_map
*h
, in
;
5654 in
.base
.from
= from
;
5656 h
= (struct tree_map
*) htab_find_with_hash (value_expr_for_decl
, &in
,
5657 htab_hash_pointer (from
));
5663 /* Insert a mapping FROM->TO in the value expression hashtable. */
5666 decl_value_expr_insert (tree from
, tree to
)
5671 h
= GGC_NEW (struct tree_map
);
5672 h
->hash
= htab_hash_pointer (from
);
5673 h
->base
.from
= from
;
5675 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
5676 *(struct tree_map
**) loc
= h
;
5679 /* Hashing of types so that we don't make duplicates.
5680 The entry point is `type_hash_canon'. */
5682 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5683 with types in the TREE_VALUE slots), by adding the hash codes
5684 of the individual types. */
5687 type_hash_list (const_tree list
, hashval_t hashcode
)
5691 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5692 if (TREE_VALUE (tail
) != error_mark_node
)
5693 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
5699 /* These are the Hashtable callback functions. */
5701 /* Returns true iff the types are equivalent. */
5704 type_hash_eq (const void *va
, const void *vb
)
5706 const struct type_hash
*const a
= (const struct type_hash
*) va
,
5707 *const b
= (const struct type_hash
*) vb
;
5709 /* First test the things that are the same for all types. */
5710 if (a
->hash
!= b
->hash
5711 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
5712 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
5713 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
5714 TYPE_ATTRIBUTES (b
->type
))
5715 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
5716 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)
5717 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
5718 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
5721 switch (TREE_CODE (a
->type
))
5726 case REFERENCE_TYPE
:
5730 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
5733 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
5734 && !(TYPE_VALUES (a
->type
)
5735 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
5736 && TYPE_VALUES (b
->type
)
5737 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
5738 && type_list_equal (TYPE_VALUES (a
->type
),
5739 TYPE_VALUES (b
->type
))))
5742 /* ... fall through ... */
5747 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
5748 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
5749 TYPE_MAX_VALUE (b
->type
)))
5750 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
5751 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
5752 TYPE_MIN_VALUE (b
->type
))));
5754 case FIXED_POINT_TYPE
:
5755 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
5758 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
5761 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
5762 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5763 || (TYPE_ARG_TYPES (a
->type
)
5764 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5765 && TYPE_ARG_TYPES (b
->type
)
5766 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5767 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5768 TYPE_ARG_TYPES (b
->type
)))));
5771 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
5775 case QUAL_UNION_TYPE
:
5776 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
5777 || (TYPE_FIELDS (a
->type
)
5778 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
5779 && TYPE_FIELDS (b
->type
)
5780 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
5781 && type_list_equal (TYPE_FIELDS (a
->type
),
5782 TYPE_FIELDS (b
->type
))));
5785 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5786 || (TYPE_ARG_TYPES (a
->type
)
5787 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5788 && TYPE_ARG_TYPES (b
->type
)
5789 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5790 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5791 TYPE_ARG_TYPES (b
->type
))))
5799 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
5800 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
5805 /* Return the cached hash value. */
5808 type_hash_hash (const void *item
)
5810 return ((const struct type_hash
*) item
)->hash
;
5813 /* Look in the type hash table for a type isomorphic to TYPE.
5814 If one is found, return it. Otherwise return 0. */
5817 type_hash_lookup (hashval_t hashcode
, tree type
)
5819 struct type_hash
*h
, in
;
5821 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5822 must call that routine before comparing TYPE_ALIGNs. */
5828 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
5835 /* Add an entry to the type-hash-table
5836 for a type TYPE whose hash code is HASHCODE. */
5839 type_hash_add (hashval_t hashcode
, tree type
)
5841 struct type_hash
*h
;
5844 h
= GGC_NEW (struct type_hash
);
5847 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
5851 /* Given TYPE, and HASHCODE its hash code, return the canonical
5852 object for an identical type if one already exists.
5853 Otherwise, return TYPE, and record it as the canonical object.
5855 To use this function, first create a type of the sort you want.
5856 Then compute its hash code from the fields of the type that
5857 make it different from other similar types.
5858 Then call this function and use the value. */
5861 type_hash_canon (unsigned int hashcode
, tree type
)
5865 /* The hash table only contains main variants, so ensure that's what we're
5867 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
5869 if (!lang_hooks
.types
.hash_types
)
5872 /* See if the type is in the hash table already. If so, return it.
5873 Otherwise, add the type. */
5874 t1
= type_hash_lookup (hashcode
, type
);
5877 #ifdef GATHER_STATISTICS
5878 tree_node_counts
[(int) t_kind
]--;
5879 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
5885 type_hash_add (hashcode
, type
);
5890 /* See if the data pointed to by the type hash table is marked. We consider
5891 it marked if the type is marked or if a debug type number or symbol
5892 table entry has been made for the type. This reduces the amount of
5893 debugging output and eliminates that dependency of the debug output on
5894 the number of garbage collections. */
5897 type_hash_marked_p (const void *p
)
5899 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
5901 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
5905 print_type_hash_statistics (void)
5907 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
5908 (long) htab_size (type_hash_table
),
5909 (long) htab_elements (type_hash_table
),
5910 htab_collisions (type_hash_table
));
5913 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5914 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5915 by adding the hash codes of the individual attributes. */
5918 attribute_hash_list (const_tree list
, hashval_t hashcode
)
5922 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5923 /* ??? Do we want to add in TREE_VALUE too? */
5924 hashcode
= iterative_hash_object
5925 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
5929 /* Given two lists of attributes, return true if list l2 is
5930 equivalent to l1. */
5933 attribute_list_equal (const_tree l1
, const_tree l2
)
5935 return attribute_list_contained (l1
, l2
)
5936 && attribute_list_contained (l2
, l1
);
5939 /* Given two lists of attributes, return true if list L2 is
5940 completely contained within L1. */
5941 /* ??? This would be faster if attribute names were stored in a canonicalized
5942 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
5943 must be used to show these elements are equivalent (which they are). */
5944 /* ??? It's not clear that attributes with arguments will always be handled
5948 attribute_list_contained (const_tree l1
, const_tree l2
)
5952 /* First check the obvious, maybe the lists are identical. */
5956 /* Maybe the lists are similar. */
5957 for (t1
= l1
, t2
= l2
;
5959 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
5960 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
5961 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
5963 /* Maybe the lists are equal. */
5964 if (t1
== 0 && t2
== 0)
5967 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
5970 /* This CONST_CAST is okay because lookup_attribute does not
5971 modify its argument and the return value is assigned to a
5973 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
5974 CONST_CAST_TREE(l1
));
5976 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
5979 if (TREE_VALUE (t2
) != NULL
5980 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
5981 && TREE_VALUE (attr
) != NULL
5982 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
5984 if (simple_cst_list_equal (TREE_VALUE (t2
),
5985 TREE_VALUE (attr
)) == 1)
5988 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
5999 /* Given two lists of types
6000 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6001 return 1 if the lists contain the same types in the same order.
6002 Also, the TREE_PURPOSEs must match. */
6005 type_list_equal (const_tree l1
, const_tree l2
)
6009 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6010 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6011 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6012 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6013 && (TREE_TYPE (TREE_PURPOSE (t1
))
6014 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6020 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6021 given by TYPE. If the argument list accepts variable arguments,
6022 then this function counts only the ordinary arguments. */
6025 type_num_arguments (const_tree type
)
6030 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6031 /* If the function does not take a variable number of arguments,
6032 the last element in the list will have type `void'. */
6033 if (VOID_TYPE_P (TREE_VALUE (t
)))
6041 /* Nonzero if integer constants T1 and T2
6042 represent the same constant value. */
6045 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6050 if (t1
== 0 || t2
== 0)
6053 if (TREE_CODE (t1
) == INTEGER_CST
6054 && TREE_CODE (t2
) == INTEGER_CST
6055 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6056 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6062 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6063 The precise way of comparison depends on their data type. */
6066 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6071 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6073 int t1_sgn
= tree_int_cst_sgn (t1
);
6074 int t2_sgn
= tree_int_cst_sgn (t2
);
6076 if (t1_sgn
< t2_sgn
)
6078 else if (t1_sgn
> t2_sgn
)
6080 /* Otherwise, both are non-negative, so we compare them as
6081 unsigned just in case one of them would overflow a signed
6084 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6085 return INT_CST_LT (t1
, t2
);
6087 return INT_CST_LT_UNSIGNED (t1
, t2
);
6090 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6093 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6095 if (tree_int_cst_lt (t1
, t2
))
6097 else if (tree_int_cst_lt (t2
, t1
))
6103 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6104 the host. If POS is zero, the value can be represented in a single
6105 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6106 be represented in a single unsigned HOST_WIDE_INT. */
6109 host_integerp (const_tree t
, int pos
)
6114 return (TREE_CODE (t
) == INTEGER_CST
6115 && ((TREE_INT_CST_HIGH (t
) == 0
6116 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6117 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6118 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6119 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6120 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6121 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6122 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6125 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6126 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6127 be non-negative. We must be able to satisfy the above conditions. */
6130 tree_low_cst (const_tree t
, int pos
)
6132 gcc_assert (host_integerp (t
, pos
));
6133 return TREE_INT_CST_LOW (t
);
6136 /* Return the most significant bit of the integer constant T. */
6139 tree_int_cst_msb (const_tree t
)
6143 unsigned HOST_WIDE_INT l
;
6145 /* Note that using TYPE_PRECISION here is wrong. We care about the
6146 actual bits, not the (arbitrary) range of the type. */
6147 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6148 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6149 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6150 return (l
& 1) == 1;
6153 /* Return an indication of the sign of the integer constant T.
6154 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6155 Note that -1 will never be returned if T's type is unsigned. */
6158 tree_int_cst_sgn (const_tree t
)
6160 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6162 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6164 else if (TREE_INT_CST_HIGH (t
) < 0)
6170 /* Return the minimum number of bits needed to represent VALUE in a
6171 signed or unsigned type, UNSIGNEDP says which. */
6174 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6178 /* If the value is negative, compute its negative minus 1. The latter
6179 adjustment is because the absolute value of the largest negative value
6180 is one larger than the largest positive value. This is equivalent to
6181 a bit-wise negation, so use that operation instead. */
6183 if (tree_int_cst_sgn (value
) < 0)
6184 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6186 /* Return the number of bits needed, taking into account the fact
6187 that we need one more bit for a signed than unsigned type. */
6189 if (integer_zerop (value
))
6192 log
= tree_floor_log2 (value
);
6194 return log
+ 1 + !unsignedp
;
6197 /* Compare two constructor-element-type constants. Return 1 if the lists
6198 are known to be equal; otherwise return 0. */
6201 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6203 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6205 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6208 l1
= TREE_CHAIN (l1
);
6209 l2
= TREE_CHAIN (l2
);
6215 /* Return truthvalue of whether T1 is the same tree structure as T2.
6216 Return 1 if they are the same.
6217 Return 0 if they are understandably different.
6218 Return -1 if either contains tree structure not understood by
6222 simple_cst_equal (const_tree t1
, const_tree t2
)
6224 enum tree_code code1
, code2
;
6230 if (t1
== 0 || t2
== 0)
6233 code1
= TREE_CODE (t1
);
6234 code2
= TREE_CODE (t2
);
6236 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6238 if (CONVERT_EXPR_CODE_P (code2
)
6239 || code2
== NON_LVALUE_EXPR
)
6240 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6242 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6245 else if (CONVERT_EXPR_CODE_P (code2
)
6246 || code2
== NON_LVALUE_EXPR
)
6247 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6255 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6256 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6259 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6262 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6265 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6266 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6267 TREE_STRING_LENGTH (t1
)));
6271 unsigned HOST_WIDE_INT idx
;
6272 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6273 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6275 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6278 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6279 /* ??? Should we handle also fields here? */
6280 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6281 VEC_index (constructor_elt
, v2
, idx
)->value
))
6287 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6290 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6293 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6296 const_tree arg1
, arg2
;
6297 const_call_expr_arg_iterator iter1
, iter2
;
6298 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6299 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6301 arg1
= next_const_call_expr_arg (&iter1
),
6302 arg2
= next_const_call_expr_arg (&iter2
))
6304 cmp
= simple_cst_equal (arg1
, arg2
);
6308 return arg1
== arg2
;
6312 /* Special case: if either target is an unallocated VAR_DECL,
6313 it means that it's going to be unified with whatever the
6314 TARGET_EXPR is really supposed to initialize, so treat it
6315 as being equivalent to anything. */
6316 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6317 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6318 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6319 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6320 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6321 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6324 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6329 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6331 case WITH_CLEANUP_EXPR
:
6332 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6336 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6339 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6340 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6354 /* This general rule works for most tree codes. All exceptions should be
6355 handled above. If this is a language-specific tree code, we can't
6356 trust what might be in the operand, so say we don't know
6358 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6361 switch (TREE_CODE_CLASS (code1
))
6365 case tcc_comparison
:
6366 case tcc_expression
:
6370 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6372 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6384 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6385 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6386 than U, respectively. */
6389 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6391 if (tree_int_cst_sgn (t
) < 0)
6393 else if (TREE_INT_CST_HIGH (t
) != 0)
6395 else if (TREE_INT_CST_LOW (t
) == u
)
6397 else if (TREE_INT_CST_LOW (t
) < u
)
6403 /* Return true if CODE represents an associative tree code. Otherwise
6406 associative_tree_code (enum tree_code code
)
6425 /* Return true if CODE represents a commutative tree code. Otherwise
6428 commutative_tree_code (enum tree_code code
)
6441 case UNORDERED_EXPR
:
6445 case TRUTH_AND_EXPR
:
6446 case TRUTH_XOR_EXPR
:
6456 /* Generate a hash value for an expression. This can be used iteratively
6457 by passing a previous result as the VAL argument.
6459 This function is intended to produce the same hash for expressions which
6460 would compare equal using operand_equal_p. */
6463 iterative_hash_expr (const_tree t
, hashval_t val
)
6466 enum tree_code code
;
6470 return iterative_hash_hashval_t (0, val
);
6472 code
= TREE_CODE (t
);
6476 /* Alas, constants aren't shared, so we can't rely on pointer
6479 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6480 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6483 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6485 return iterative_hash_hashval_t (val2
, val
);
6489 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6491 return iterative_hash_hashval_t (val2
, val
);
6494 return iterative_hash (TREE_STRING_POINTER (t
),
6495 TREE_STRING_LENGTH (t
), val
);
6497 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6498 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6500 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6503 /* we can just compare by pointer. */
6504 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6507 /* A list of expressions, for a CALL_EXPR or as the elements of a
6509 for (; t
; t
= TREE_CHAIN (t
))
6510 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6514 unsigned HOST_WIDE_INT idx
;
6516 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6518 val
= iterative_hash_expr (field
, val
);
6519 val
= iterative_hash_expr (value
, val
);
6524 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6525 Otherwise nodes that compare equal according to operand_equal_p might
6526 get different hash codes. However, don't do this for machine specific
6527 or front end builtins, since the function code is overloaded in those
6529 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6530 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6532 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6533 code
= TREE_CODE (t
);
6537 tclass
= TREE_CODE_CLASS (code
);
6539 if (tclass
== tcc_declaration
)
6541 /* DECL's have a unique ID */
6542 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6546 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6548 val
= iterative_hash_object (code
, val
);
6550 /* Don't hash the type, that can lead to having nodes which
6551 compare equal according to operand_equal_p, but which
6552 have different hash codes. */
6553 if (CONVERT_EXPR_CODE_P (code
)
6554 || code
== NON_LVALUE_EXPR
)
6556 /* Make sure to include signness in the hash computation. */
6557 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6558 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6561 else if (commutative_tree_code (code
))
6563 /* It's a commutative expression. We want to hash it the same
6564 however it appears. We do this by first hashing both operands
6565 and then rehashing based on the order of their independent
6567 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6568 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6572 t
= one
, one
= two
, two
= t
;
6574 val
= iterative_hash_hashval_t (one
, val
);
6575 val
= iterative_hash_hashval_t (two
, val
);
6578 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6579 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6586 /* Generate a hash value for a pair of expressions. This can be used
6587 iteratively by passing a previous result as the VAL argument.
6589 The same hash value is always returned for a given pair of expressions,
6590 regardless of the order in which they are presented. This is useful in
6591 hashing the operands of commutative functions. */
6594 iterative_hash_exprs_commutative (const_tree t1
,
6595 const_tree t2
, hashval_t val
)
6597 hashval_t one
= iterative_hash_expr (t1
, 0);
6598 hashval_t two
= iterative_hash_expr (t2
, 0);
6602 t
= one
, one
= two
, two
= t
;
6603 val
= iterative_hash_hashval_t (one
, val
);
6604 val
= iterative_hash_hashval_t (two
, val
);
6609 /* Constructors for pointer, array and function types.
6610 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6611 constructed by language-dependent code, not here.) */
6613 /* Construct, lay out and return the type of pointers to TO_TYPE with
6614 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6615 reference all of memory. If such a type has already been
6616 constructed, reuse it. */
6619 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6624 if (to_type
== error_mark_node
)
6625 return error_mark_node
;
6627 /* If the pointed-to type has the may_alias attribute set, force
6628 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6629 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6630 can_alias_all
= true;
6632 /* In some cases, languages will have things that aren't a POINTER_TYPE
6633 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6634 In that case, return that type without regard to the rest of our
6637 ??? This is a kludge, but consistent with the way this function has
6638 always operated and there doesn't seem to be a good way to avoid this
6640 if (TYPE_POINTER_TO (to_type
) != 0
6641 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6642 return TYPE_POINTER_TO (to_type
);
6644 /* First, if we already have a type for pointers to TO_TYPE and it's
6645 the proper mode, use it. */
6646 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6647 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6650 t
= make_node (POINTER_TYPE
);
6652 TREE_TYPE (t
) = to_type
;
6653 SET_TYPE_MODE (t
, mode
);
6654 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6655 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6656 TYPE_POINTER_TO (to_type
) = t
;
6658 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6659 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6660 else if (TYPE_CANONICAL (to_type
) != to_type
)
6662 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
6663 mode
, can_alias_all
);
6665 /* Lay out the type. This function has many callers that are concerned
6666 with expression-construction, and this simplifies them all. */
6672 /* By default build pointers in ptr_mode. */
6675 build_pointer_type (tree to_type
)
6677 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
6680 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6683 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
6688 if (to_type
== error_mark_node
)
6689 return error_mark_node
;
6691 /* If the pointed-to type has the may_alias attribute set, force
6692 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6693 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6694 can_alias_all
= true;
6696 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6697 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6698 In that case, return that type without regard to the rest of our
6701 ??? This is a kludge, but consistent with the way this function has
6702 always operated and there doesn't seem to be a good way to avoid this
6704 if (TYPE_REFERENCE_TO (to_type
) != 0
6705 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
6706 return TYPE_REFERENCE_TO (to_type
);
6708 /* First, if we already have a type for pointers to TO_TYPE and it's
6709 the proper mode, use it. */
6710 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
6711 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6714 t
= make_node (REFERENCE_TYPE
);
6716 TREE_TYPE (t
) = to_type
;
6717 SET_TYPE_MODE (t
, mode
);
6718 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6719 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
6720 TYPE_REFERENCE_TO (to_type
) = t
;
6722 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6723 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6724 else if (TYPE_CANONICAL (to_type
) != to_type
)
6726 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
6727 mode
, can_alias_all
);
6735 /* Build the node for the type of references-to-TO_TYPE by default
6739 build_reference_type (tree to_type
)
6741 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
6744 /* Build a type that is compatible with t but has no cv quals anywhere
6747 const char *const *const * -> char ***. */
6750 build_type_no_quals (tree t
)
6752 switch (TREE_CODE (t
))
6755 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6757 TYPE_REF_CAN_ALIAS_ALL (t
));
6758 case REFERENCE_TYPE
:
6760 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6762 TYPE_REF_CAN_ALIAS_ALL (t
));
6764 return TYPE_MAIN_VARIANT (t
);
6768 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6769 MAXVAL should be the maximum value in the domain
6770 (one less than the length of the array).
6772 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6773 We don't enforce this limit, that is up to caller (e.g. language front end).
6774 The limit exists because the result is a signed type and we don't handle
6775 sizes that use more than one HOST_WIDE_INT. */
6778 build_index_type (tree maxval
)
6780 tree itype
= make_node (INTEGER_TYPE
);
6782 TREE_TYPE (itype
) = sizetype
;
6783 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
6784 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6785 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
6786 SET_TYPE_MODE (itype
, TYPE_MODE (sizetype
));
6787 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
6788 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
6789 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
6790 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
6792 if (host_integerp (maxval
, 1))
6793 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
6796 /* Since we cannot hash this type, we need to compare it using
6797 structural equality checks. */
6798 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
6803 /* Builds a signed or unsigned integer type of precision PRECISION.
6804 Used for C bitfields whose precision does not match that of
6805 built-in target types. */
6807 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
6810 tree itype
= make_node (INTEGER_TYPE
);
6812 TYPE_PRECISION (itype
) = precision
;
6815 fixup_unsigned_type (itype
);
6817 fixup_signed_type (itype
);
6819 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
6820 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
6825 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6826 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6827 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6830 build_range_type (tree type
, tree lowval
, tree highval
)
6832 tree itype
= make_node (INTEGER_TYPE
);
6834 TREE_TYPE (itype
) = type
;
6835 if (type
== NULL_TREE
)
6838 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
6839 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
6841 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
6842 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
6843 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
6844 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
6845 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
6846 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
6848 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
6849 return type_hash_canon (tree_low_cst (highval
, 0)
6850 - tree_low_cst (lowval
, 0),
6856 /* Return true if the debug information for TYPE, a subtype, should be emitted
6857 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6858 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6859 debug info and doesn't reflect the source code. */
6862 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
6864 tree base_type
= TREE_TYPE (type
), low
, high
;
6866 /* Subrange types have a base type which is an integral type. */
6867 if (!INTEGRAL_TYPE_P (base_type
))
6870 /* Get the real bounds of the subtype. */
6871 if (lang_hooks
.types
.get_subrange_bounds
)
6872 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
6875 low
= TYPE_MIN_VALUE (type
);
6876 high
= TYPE_MAX_VALUE (type
);
6879 /* If the type and its base type have the same representation and the same
6880 name, then the type is not a subrange but a copy of the base type. */
6881 if ((TREE_CODE (base_type
) == INTEGER_TYPE
6882 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
6883 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
6884 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
6885 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
6887 tree type_name
= TYPE_NAME (type
);
6888 tree base_type_name
= TYPE_NAME (base_type
);
6890 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
6891 type_name
= DECL_NAME (type_name
);
6893 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
6894 base_type_name
= DECL_NAME (base_type_name
);
6896 if (type_name
== base_type_name
)
6907 /* Just like build_index_type, but takes lowval and highval instead
6908 of just highval (maxval). */
6911 build_index_2_type (tree lowval
, tree highval
)
6913 return build_range_type (sizetype
, lowval
, highval
);
6916 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6917 and number of elements specified by the range of values of INDEX_TYPE.
6918 If such a type has already been constructed, reuse it. */
6921 build_array_type (tree elt_type
, tree index_type
)
6924 hashval_t hashcode
= 0;
6926 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
6928 error ("arrays of functions are not meaningful");
6929 elt_type
= integer_type_node
;
6932 t
= make_node (ARRAY_TYPE
);
6933 TREE_TYPE (t
) = elt_type
;
6934 TYPE_DOMAIN (t
) = index_type
;
6937 /* If the element type is incomplete at this point we get marked for
6938 structural equality. Do not record these types in the canonical
6940 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
6943 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
6945 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
6946 t
= type_hash_canon (hashcode
, t
);
6948 if (TYPE_CANONICAL (t
) == t
)
6950 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
6951 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
6952 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6953 else if (TYPE_CANONICAL (elt_type
) != elt_type
6954 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
6956 = build_array_type (TYPE_CANONICAL (elt_type
),
6957 index_type
? TYPE_CANONICAL (index_type
) : NULL
);
6963 /* Recursively examines the array elements of TYPE, until a non-array
6964 element type is found. */
6967 strip_array_types (tree type
)
6969 while (TREE_CODE (type
) == ARRAY_TYPE
)
6970 type
= TREE_TYPE (type
);
6975 /* Computes the canonical argument types from the argument type list
6978 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
6979 on entry to this function, or if any of the ARGTYPES are
6982 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
6983 true on entry to this function, or if any of the ARGTYPES are
6986 Returns a canonical argument list, which may be ARGTYPES when the
6987 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
6988 true) or would not differ from ARGTYPES. */
6991 maybe_canonicalize_argtypes(tree argtypes
,
6992 bool *any_structural_p
,
6993 bool *any_noncanonical_p
)
6996 bool any_noncanonical_argtypes_p
= false;
6998 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7000 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7001 /* Fail gracefully by stating that the type is structural. */
7002 *any_structural_p
= true;
7003 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7004 *any_structural_p
= true;
7005 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7006 || TREE_PURPOSE (arg
))
7007 /* If the argument has a default argument, we consider it
7008 non-canonical even though the type itself is canonical.
7009 That way, different variants of function and method types
7010 with default arguments will all point to the variant with
7011 no defaults as their canonical type. */
7012 any_noncanonical_argtypes_p
= true;
7015 if (*any_structural_p
)
7018 if (any_noncanonical_argtypes_p
)
7020 /* Build the canonical list of argument types. */
7021 tree canon_argtypes
= NULL_TREE
;
7022 bool is_void
= false;
7024 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7026 if (arg
== void_list_node
)
7029 canon_argtypes
= tree_cons (NULL_TREE
,
7030 TYPE_CANONICAL (TREE_VALUE (arg
)),
7034 canon_argtypes
= nreverse (canon_argtypes
);
7036 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7038 /* There is a non-canonical type. */
7039 *any_noncanonical_p
= true;
7040 return canon_argtypes
;
7043 /* The canonical argument types are the same as ARGTYPES. */
7047 /* Construct, lay out and return
7048 the type of functions returning type VALUE_TYPE
7049 given arguments of types ARG_TYPES.
7050 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7051 are data type nodes for the arguments of the function.
7052 If such a type has already been constructed, reuse it. */
7055 build_function_type (tree value_type
, tree arg_types
)
7058 hashval_t hashcode
= 0;
7059 bool any_structural_p
, any_noncanonical_p
;
7060 tree canon_argtypes
;
7062 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7064 error ("function return type cannot be function");
7065 value_type
= integer_type_node
;
7068 /* Make a node of the sort we want. */
7069 t
= make_node (FUNCTION_TYPE
);
7070 TREE_TYPE (t
) = value_type
;
7071 TYPE_ARG_TYPES (t
) = arg_types
;
7073 /* If we already have such a type, use the old one. */
7074 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7075 hashcode
= type_hash_list (arg_types
, hashcode
);
7076 t
= type_hash_canon (hashcode
, t
);
7078 /* Set up the canonical type. */
7079 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7080 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7081 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7083 &any_noncanonical_p
);
7084 if (any_structural_p
)
7085 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7086 else if (any_noncanonical_p
)
7087 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7090 if (!COMPLETE_TYPE_P (t
))
7095 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7098 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7100 tree new_type
= NULL
;
7101 tree args
, new_args
= NULL
, t
;
7105 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7106 args
= TREE_CHAIN (args
), i
++)
7107 if (!bitmap_bit_p (args_to_skip
, i
))
7108 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7110 new_reversed
= nreverse (new_args
);
7114 TREE_CHAIN (new_args
) = void_list_node
;
7116 new_reversed
= void_list_node
;
7119 /* Use copy_node to preserve as much as possible from original type
7120 (debug info, attribute lists etc.)
7121 Exception is METHOD_TYPEs must have THIS argument.
7122 When we are asked to remove it, we need to build new FUNCTION_TYPE
7124 if (TREE_CODE (orig_type
) != METHOD_TYPE
7125 || !bitmap_bit_p (args_to_skip
, 0))
7127 new_type
= copy_node (orig_type
);
7128 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7133 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7135 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7138 /* This is a new type, not a copy of an old type. Need to reassociate
7139 variants. We can handle everything except the main variant lazily. */
7140 t
= TYPE_MAIN_VARIANT (orig_type
);
7143 TYPE_MAIN_VARIANT (new_type
) = t
;
7144 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7145 TYPE_NEXT_VARIANT (t
) = new_type
;
7149 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7150 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7155 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7157 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7158 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7159 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7162 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7164 tree new_decl
= copy_node (orig_decl
);
7167 new_type
= TREE_TYPE (orig_decl
);
7168 if (prototype_p (new_type
))
7169 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7170 TREE_TYPE (new_decl
) = new_type
;
7172 /* For declarations setting DECL_VINDEX (i.e. methods)
7173 we expect first argument to be THIS pointer. */
7174 if (bitmap_bit_p (args_to_skip
, 0))
7175 DECL_VINDEX (new_decl
) = NULL_TREE
;
7179 /* Build a function type. The RETURN_TYPE is the type returned by the
7180 function. If VAARGS is set, no void_type_node is appended to the
7181 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7184 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7188 t
= va_arg (argp
, tree
);
7189 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7190 args
= tree_cons (NULL_TREE
, t
, args
);
7195 if (args
!= NULL_TREE
)
7196 args
= nreverse (args
);
7197 gcc_assert (args
!= NULL_TREE
&& last
!= void_list_node
);
7199 else if (args
== NULL_TREE
)
7200 args
= void_list_node
;
7204 args
= nreverse (args
);
7205 TREE_CHAIN (last
) = void_list_node
;
7207 args
= build_function_type (return_type
, args
);
7212 /* Build a function type. The RETURN_TYPE is the type returned by the
7213 function. If additional arguments are provided, they are
7214 additional argument types. The list of argument types must always
7215 be terminated by NULL_TREE. */
7218 build_function_type_list (tree return_type
, ...)
7223 va_start (p
, return_type
);
7224 args
= build_function_type_list_1 (false, return_type
, p
);
7229 /* Build a variable argument function type. The RETURN_TYPE is the
7230 type returned by the function. If additional arguments are provided,
7231 they are additional argument types. The list of argument types must
7232 always be terminated by NULL_TREE. */
7235 build_varargs_function_type_list (tree return_type
, ...)
7240 va_start (p
, return_type
);
7241 args
= build_function_type_list_1 (true, return_type
, p
);
7247 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7248 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7249 for the method. An implicit additional parameter (of type
7250 pointer-to-BASETYPE) is added to the ARGTYPES. */
7253 build_method_type_directly (tree basetype
,
7260 bool any_structural_p
, any_noncanonical_p
;
7261 tree canon_argtypes
;
7263 /* Make a node of the sort we want. */
7264 t
= make_node (METHOD_TYPE
);
7266 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7267 TREE_TYPE (t
) = rettype
;
7268 ptype
= build_pointer_type (basetype
);
7270 /* The actual arglist for this function includes a "hidden" argument
7271 which is "this". Put it into the list of argument types. */
7272 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7273 TYPE_ARG_TYPES (t
) = argtypes
;
7275 /* If we already have such a type, use the old one. */
7276 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7277 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7278 hashcode
= type_hash_list (argtypes
, hashcode
);
7279 t
= type_hash_canon (hashcode
, t
);
7281 /* Set up the canonical type. */
7283 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7284 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7286 = (TYPE_CANONICAL (basetype
) != basetype
7287 || TYPE_CANONICAL (rettype
) != rettype
);
7288 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7290 &any_noncanonical_p
);
7291 if (any_structural_p
)
7292 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7293 else if (any_noncanonical_p
)
7295 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7296 TYPE_CANONICAL (rettype
),
7298 if (!COMPLETE_TYPE_P (t
))
7304 /* Construct, lay out and return the type of methods belonging to class
7305 BASETYPE and whose arguments and values are described by TYPE.
7306 If that type exists already, reuse it.
7307 TYPE must be a FUNCTION_TYPE node. */
7310 build_method_type (tree basetype
, tree type
)
7312 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7314 return build_method_type_directly (basetype
,
7316 TYPE_ARG_TYPES (type
));
7319 /* Construct, lay out and return the type of offsets to a value
7320 of type TYPE, within an object of type BASETYPE.
7321 If a suitable offset type exists already, reuse it. */
7324 build_offset_type (tree basetype
, tree type
)
7327 hashval_t hashcode
= 0;
7329 /* Make a node of the sort we want. */
7330 t
= make_node (OFFSET_TYPE
);
7332 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7333 TREE_TYPE (t
) = type
;
7335 /* If we already have such a type, use the old one. */
7336 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7337 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7338 t
= type_hash_canon (hashcode
, t
);
7340 if (!COMPLETE_TYPE_P (t
))
7343 if (TYPE_CANONICAL (t
) == t
)
7345 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7346 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7347 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7348 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7349 || TYPE_CANONICAL (type
) != type
)
7351 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7352 TYPE_CANONICAL (type
));
7358 /* Create a complex type whose components are COMPONENT_TYPE. */
7361 build_complex_type (tree component_type
)
7366 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7367 || SCALAR_FLOAT_TYPE_P (component_type
)
7368 || FIXED_POINT_TYPE_P (component_type
));
7370 /* Make a node of the sort we want. */
7371 t
= make_node (COMPLEX_TYPE
);
7373 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7375 /* If we already have such a type, use the old one. */
7376 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7377 t
= type_hash_canon (hashcode
, t
);
7379 if (!COMPLETE_TYPE_P (t
))
7382 if (TYPE_CANONICAL (t
) == t
)
7384 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7385 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7386 else if (TYPE_CANONICAL (component_type
) != component_type
)
7388 = build_complex_type (TYPE_CANONICAL (component_type
));
7391 /* We need to create a name, since complex is a fundamental type. */
7392 if (! TYPE_NAME (t
))
7395 if (component_type
== char_type_node
)
7396 name
= "complex char";
7397 else if (component_type
== signed_char_type_node
)
7398 name
= "complex signed char";
7399 else if (component_type
== unsigned_char_type_node
)
7400 name
= "complex unsigned char";
7401 else if (component_type
== short_integer_type_node
)
7402 name
= "complex short int";
7403 else if (component_type
== short_unsigned_type_node
)
7404 name
= "complex short unsigned int";
7405 else if (component_type
== integer_type_node
)
7406 name
= "complex int";
7407 else if (component_type
== unsigned_type_node
)
7408 name
= "complex unsigned int";
7409 else if (component_type
== long_integer_type_node
)
7410 name
= "complex long int";
7411 else if (component_type
== long_unsigned_type_node
)
7412 name
= "complex long unsigned int";
7413 else if (component_type
== long_long_integer_type_node
)
7414 name
= "complex long long int";
7415 else if (component_type
== long_long_unsigned_type_node
)
7416 name
= "complex long long unsigned int";
7421 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7422 get_identifier (name
), t
);
7425 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7428 /* If TYPE is a real or complex floating-point type and the target
7429 does not directly support arithmetic on TYPE then return the wider
7430 type to be used for arithmetic on TYPE. Otherwise, return
7434 excess_precision_type (tree type
)
7436 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7438 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7439 switch (TREE_CODE (type
))
7442 switch (flt_eval_method
)
7445 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7446 return double_type_node
;
7449 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7450 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7451 return long_double_type_node
;
7458 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7460 switch (flt_eval_method
)
7463 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7464 return complex_double_type_node
;
7467 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7468 || (TYPE_MODE (TREE_TYPE (type
))
7469 == TYPE_MODE (double_type_node
)))
7470 return complex_long_double_type_node
;
7483 /* Return OP, stripped of any conversions to wider types as much as is safe.
7484 Converting the value back to OP's type makes a value equivalent to OP.
7486 If FOR_TYPE is nonzero, we return a value which, if converted to
7487 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7489 OP must have integer, real or enumeral type. Pointers are not allowed!
7491 There are some cases where the obvious value we could return
7492 would regenerate to OP if converted to OP's type,
7493 but would not extend like OP to wider types.
7494 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7495 For example, if OP is (unsigned short)(signed char)-1,
7496 we avoid returning (signed char)-1 if FOR_TYPE is int,
7497 even though extending that to an unsigned short would regenerate OP,
7498 since the result of extending (signed char)-1 to (int)
7499 is different from (int) OP. */
7502 get_unwidened (tree op
, tree for_type
)
7504 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7505 tree type
= TREE_TYPE (op
);
7507 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7509 = (for_type
!= 0 && for_type
!= type
7510 && final_prec
> TYPE_PRECISION (type
)
7511 && TYPE_UNSIGNED (type
));
7514 while (CONVERT_EXPR_P (op
))
7518 /* TYPE_PRECISION on vector types has different meaning
7519 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7520 so avoid them here. */
7521 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7524 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7525 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7527 /* Truncations are many-one so cannot be removed.
7528 Unless we are later going to truncate down even farther. */
7530 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7533 /* See what's inside this conversion. If we decide to strip it,
7535 op
= TREE_OPERAND (op
, 0);
7537 /* If we have not stripped any zero-extensions (uns is 0),
7538 we can strip any kind of extension.
7539 If we have previously stripped a zero-extension,
7540 only zero-extensions can safely be stripped.
7541 Any extension can be stripped if the bits it would produce
7542 are all going to be discarded later by truncating to FOR_TYPE. */
7546 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7548 /* TYPE_UNSIGNED says whether this is a zero-extension.
7549 Let's avoid computing it if it does not affect WIN
7550 and if UNS will not be needed again. */
7552 || CONVERT_EXPR_P (op
))
7553 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7564 /* Return OP or a simpler expression for a narrower value
7565 which can be sign-extended or zero-extended to give back OP.
7566 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7567 or 0 if the value should be sign-extended. */
7570 get_narrower (tree op
, int *unsignedp_ptr
)
7575 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7577 while (TREE_CODE (op
) == NOP_EXPR
)
7580 = (TYPE_PRECISION (TREE_TYPE (op
))
7581 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
7583 /* Truncations are many-one so cannot be removed. */
7587 /* See what's inside this conversion. If we decide to strip it,
7592 op
= TREE_OPERAND (op
, 0);
7593 /* An extension: the outermost one can be stripped,
7594 but remember whether it is zero or sign extension. */
7596 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7597 /* Otherwise, if a sign extension has been stripped,
7598 only sign extensions can now be stripped;
7599 if a zero extension has been stripped, only zero-extensions. */
7600 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
7604 else /* bitschange == 0 */
7606 /* A change in nominal type can always be stripped, but we must
7607 preserve the unsignedness. */
7609 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7611 op
= TREE_OPERAND (op
, 0);
7612 /* Keep trying to narrow, but don't assign op to win if it
7613 would turn an integral type into something else. */
7614 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
7621 if (TREE_CODE (op
) == COMPONENT_REF
7622 /* Since type_for_size always gives an integer type. */
7623 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
7624 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
7625 /* Ensure field is laid out already. */
7626 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
7627 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
7629 unsigned HOST_WIDE_INT innerprec
7630 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
7631 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
7632 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
7633 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
7635 /* We can get this structure field in a narrower type that fits it,
7636 but the resulting extension to its nominal type (a fullword type)
7637 must satisfy the same conditions as for other extensions.
7639 Do this only for fields that are aligned (not bit-fields),
7640 because when bit-field insns will be used there is no
7641 advantage in doing this. */
7643 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
7644 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
7645 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
7649 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
7650 win
= fold_convert (type
, op
);
7654 *unsignedp_ptr
= uns
;
7658 /* Nonzero if integer constant C has a value that is permissible
7659 for type TYPE (an INTEGER_TYPE). */
7662 int_fits_type_p (const_tree c
, const_tree type
)
7664 tree type_low_bound
, type_high_bound
;
7665 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
7668 dc
= tree_to_double_int (c
);
7669 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
7671 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
7672 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
7674 /* So c is an unsigned integer whose type is sizetype and type is not.
7675 sizetype'd integers are sign extended even though they are
7676 unsigned. If the integer value fits in the lower end word of c,
7677 and if the higher end word has all its bits set to 1, that
7678 means the higher end bits are set to 1 only for sign extension.
7679 So let's convert c into an equivalent zero extended unsigned
7681 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
7684 type_low_bound
= TYPE_MIN_VALUE (type
);
7685 type_high_bound
= TYPE_MAX_VALUE (type
);
7687 /* If at least one bound of the type is a constant integer, we can check
7688 ourselves and maybe make a decision. If no such decision is possible, but
7689 this type is a subtype, try checking against that. Otherwise, use
7690 fit_double_type, which checks against the precision.
7692 Compute the status for each possibly constant bound, and return if we see
7693 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7694 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7695 for "constant known to fit". */
7697 /* Check if c >= type_low_bound. */
7698 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
7700 dd
= tree_to_double_int (type_low_bound
);
7701 if (TREE_CODE (type
) == INTEGER_TYPE
7702 && TYPE_IS_SIZETYPE (type
)
7703 && TYPE_UNSIGNED (type
))
7704 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7705 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
7707 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7708 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7710 if (c_neg
&& !t_neg
)
7712 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
7715 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
7717 ok_for_low_bound
= true;
7720 ok_for_low_bound
= false;
7722 /* Check if c <= type_high_bound. */
7723 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
7725 dd
= tree_to_double_int (type_high_bound
);
7726 if (TREE_CODE (type
) == INTEGER_TYPE
7727 && TYPE_IS_SIZETYPE (type
)
7728 && TYPE_UNSIGNED (type
))
7729 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7730 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
7732 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7733 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7735 if (t_neg
&& !c_neg
)
7737 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
7740 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
7742 ok_for_high_bound
= true;
7745 ok_for_high_bound
= false;
7747 /* If the constant fits both bounds, the result is known. */
7748 if (ok_for_low_bound
&& ok_for_high_bound
)
7751 /* Perform some generic filtering which may allow making a decision
7752 even if the bounds are not constant. First, negative integers
7753 never fit in unsigned types, */
7754 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
7757 /* Second, narrower types always fit in wider ones. */
7758 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
7761 /* Third, unsigned integers with top bit set never fit signed types. */
7762 if (! TYPE_UNSIGNED (type
) && unsc
)
7764 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
7765 if (prec
< HOST_BITS_PER_WIDE_INT
)
7767 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
7770 else if (((((unsigned HOST_WIDE_INT
) 1)
7771 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
7775 /* If we haven't been able to decide at this point, there nothing more we
7776 can check ourselves here. Look at the base type if we have one and it
7777 has the same precision. */
7778 if (TREE_CODE (type
) == INTEGER_TYPE
7779 && TREE_TYPE (type
) != 0
7780 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
7782 type
= TREE_TYPE (type
);
7786 /* Or to fit_double_type, if nothing else. */
7787 return !fit_double_type (dc
.low
, dc
.high
, &dc
.low
, &dc
.high
, type
);
7790 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7791 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7792 represented (assuming two's-complement arithmetic) within the bit
7793 precision of the type are returned instead. */
7796 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
7798 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
7799 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
7800 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
7801 TYPE_UNSIGNED (type
));
7804 if (TYPE_UNSIGNED (type
))
7805 mpz_set_ui (min
, 0);
7809 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
7810 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
7811 TYPE_PRECISION (type
));
7812 mpz_set_double_int (min
, mn
, false);
7816 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
7817 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
7818 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
7819 TYPE_UNSIGNED (type
));
7822 if (TYPE_UNSIGNED (type
))
7823 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
7826 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
7831 /* Return true if VAR is an automatic variable defined in function FN. */
7834 auto_var_in_fn_p (const_tree var
, const_tree fn
)
7836 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
7837 && (((TREE_CODE (var
) == VAR_DECL
|| TREE_CODE (var
) == PARM_DECL
)
7838 && ! TREE_STATIC (var
))
7839 || TREE_CODE (var
) == LABEL_DECL
7840 || TREE_CODE (var
) == RESULT_DECL
));
7843 /* Subprogram of following function. Called by walk_tree.
7845 Return *TP if it is an automatic variable or parameter of the
7846 function passed in as DATA. */
7849 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
7851 tree fn
= (tree
) data
;
7856 else if (DECL_P (*tp
)
7857 && auto_var_in_fn_p (*tp
, fn
))
7863 /* Returns true if T is, contains, or refers to a type with variable
7864 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7865 arguments, but not the return type. If FN is nonzero, only return
7866 true if a modifier of the type or position of FN is a variable or
7867 parameter inside FN.
7869 This concept is more general than that of C99 'variably modified types':
7870 in C99, a struct type is never variably modified because a VLA may not
7871 appear as a structure member. However, in GNU C code like:
7873 struct S { int i[f()]; };
7875 is valid, and other languages may define similar constructs. */
7878 variably_modified_type_p (tree type
, tree fn
)
7882 /* Test if T is either variable (if FN is zero) or an expression containing
7883 a variable in FN. */
7884 #define RETURN_TRUE_IF_VAR(T) \
7885 do { tree _t = (T); \
7886 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7887 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7888 return true; } while (0)
7890 if (type
== error_mark_node
)
7893 /* If TYPE itself has variable size, it is variably modified. */
7894 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
7895 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
7897 switch (TREE_CODE (type
))
7900 case REFERENCE_TYPE
:
7902 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
7908 /* If TYPE is a function type, it is variably modified if the
7909 return type is variably modified. */
7910 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
7916 case FIXED_POINT_TYPE
:
7919 /* Scalar types are variably modified if their end points
7921 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
7922 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
7927 case QUAL_UNION_TYPE
:
7928 /* We can't see if any of the fields are variably-modified by the
7929 definition we normally use, since that would produce infinite
7930 recursion via pointers. */
7931 /* This is variably modified if some field's type is. */
7932 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
7933 if (TREE_CODE (t
) == FIELD_DECL
)
7935 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
7936 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
7937 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
7939 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
7940 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
7945 /* Do not call ourselves to avoid infinite recursion. This is
7946 variably modified if the element type is. */
7947 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
7948 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
7955 /* The current language may have other cases to check, but in general,
7956 all other types are not variably modified. */
7957 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
7959 #undef RETURN_TRUE_IF_VAR
7962 /* Given a DECL or TYPE, return the scope in which it was declared, or
7963 NULL_TREE if there is no containing scope. */
7966 get_containing_scope (const_tree t
)
7968 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
7971 /* Return the innermost context enclosing DECL that is
7972 a FUNCTION_DECL, or zero if none. */
7975 decl_function_context (const_tree decl
)
7979 if (TREE_CODE (decl
) == ERROR_MARK
)
7982 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
7983 where we look up the function at runtime. Such functions always take
7984 a first argument of type 'pointer to real context'.
7986 C++ should really be fixed to use DECL_CONTEXT for the real context,
7987 and use something else for the "virtual context". */
7988 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
7991 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
7993 context
= DECL_CONTEXT (decl
);
7995 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
7997 if (TREE_CODE (context
) == BLOCK
)
7998 context
= BLOCK_SUPERCONTEXT (context
);
8000 context
= get_containing_scope (context
);
8006 /* Return the innermost context enclosing DECL that is
8007 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8008 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8011 decl_type_context (const_tree decl
)
8013 tree context
= DECL_CONTEXT (decl
);
8016 switch (TREE_CODE (context
))
8018 case NAMESPACE_DECL
:
8019 case TRANSLATION_UNIT_DECL
:
8024 case QUAL_UNION_TYPE
:
8029 context
= DECL_CONTEXT (context
);
8033 context
= BLOCK_SUPERCONTEXT (context
);
8043 /* CALL is a CALL_EXPR. Return the declaration for the function
8044 called, or NULL_TREE if the called function cannot be
8048 get_callee_fndecl (const_tree call
)
8052 if (call
== error_mark_node
)
8053 return error_mark_node
;
8055 /* It's invalid to call this function with anything but a
8057 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8059 /* The first operand to the CALL is the address of the function
8061 addr
= CALL_EXPR_FN (call
);
8065 /* If this is a readonly function pointer, extract its initial value. */
8066 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8067 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8068 && DECL_INITIAL (addr
))
8069 addr
= DECL_INITIAL (addr
);
8071 /* If the address is just `&f' for some function `f', then we know
8072 that `f' is being called. */
8073 if (TREE_CODE (addr
) == ADDR_EXPR
8074 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8075 return TREE_OPERAND (addr
, 0);
8077 /* We couldn't figure out what was being called. */
8081 /* Print debugging information about tree nodes generated during the compile,
8082 and any language-specific information. */
8085 dump_tree_statistics (void)
8087 #ifdef GATHER_STATISTICS
8089 int total_nodes
, total_bytes
;
8092 fprintf (stderr
, "\n??? tree nodes created\n\n");
8093 #ifdef GATHER_STATISTICS
8094 fprintf (stderr
, "Kind Nodes Bytes\n");
8095 fprintf (stderr
, "---------------------------------------\n");
8096 total_nodes
= total_bytes
= 0;
8097 for (i
= 0; i
< (int) all_kinds
; i
++)
8099 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8100 tree_node_counts
[i
], tree_node_sizes
[i
]);
8101 total_nodes
+= tree_node_counts
[i
];
8102 total_bytes
+= tree_node_sizes
[i
];
8104 fprintf (stderr
, "---------------------------------------\n");
8105 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8106 fprintf (stderr
, "---------------------------------------\n");
8107 ssanames_print_statistics ();
8108 phinodes_print_statistics ();
8110 fprintf (stderr
, "(No per-node statistics)\n");
8112 print_type_hash_statistics ();
8113 print_debug_expr_statistics ();
8114 print_value_expr_statistics ();
8115 lang_hooks
.print_statistics ();
8118 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8120 /* Generate a crc32 of a string. */
8123 crc32_string (unsigned chksum
, const char *string
)
8127 unsigned value
= *string
<< 24;
8130 for (ix
= 8; ix
--; value
<<= 1)
8134 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8143 /* P is a string that will be used in a symbol. Mask out any characters
8144 that are not valid in that context. */
8147 clean_symbol_name (char *p
)
8151 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8154 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8161 /* Generate a name for a special-purpose function function.
8162 The generated name may need to be unique across the whole link.
8163 TYPE is some string to identify the purpose of this function to the
8164 linker or collect2; it must start with an uppercase letter,
8166 I - for constructors
8168 N - for C++ anonymous namespaces
8169 F - for DWARF unwind frame information. */
8172 get_file_function_name (const char *type
)
8178 /* If we already have a name we know to be unique, just use that. */
8179 if (first_global_object_name
)
8180 p
= q
= ASTRDUP (first_global_object_name
);
8181 /* If the target is handling the constructors/destructors, they
8182 will be local to this file and the name is only necessary for
8183 debugging purposes. */
8184 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8186 const char *file
= main_input_filename
;
8188 file
= input_filename
;
8189 /* Just use the file's basename, because the full pathname
8190 might be quite long. */
8191 p
= strrchr (file
, '/');
8196 p
= q
= ASTRDUP (p
);
8200 /* Otherwise, the name must be unique across the entire link.
8201 We don't have anything that we know to be unique to this translation
8202 unit, so use what we do have and throw in some randomness. */
8204 const char *name
= weak_global_object_name
;
8205 const char *file
= main_input_filename
;
8210 file
= input_filename
;
8212 len
= strlen (file
);
8213 q
= (char *) alloca (9 * 2 + len
+ 1);
8214 memcpy (q
, file
, len
+ 1);
8216 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8217 crc32_string (0, get_random_seed (false)));
8222 clean_symbol_name (q
);
8223 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8226 /* Set up the name of the file-level functions we may need.
8227 Use a global object (which is already required to be unique over
8228 the program) rather than the file name (which imposes extra
8230 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8232 return get_identifier (buf
);
8235 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8237 /* Complain that the tree code of NODE does not match the expected 0
8238 terminated list of trailing codes. The trailing code list can be
8239 empty, for a more vague error message. FILE, LINE, and FUNCTION
8240 are of the caller. */
8243 tree_check_failed (const_tree node
, const char *file
,
8244 int line
, const char *function
, ...)
8248 unsigned length
= 0;
8251 va_start (args
, function
);
8252 while ((code
= va_arg (args
, int)))
8253 length
+= 4 + strlen (tree_code_name
[code
]);
8258 va_start (args
, function
);
8259 length
+= strlen ("expected ");
8260 buffer
= tmp
= (char *) alloca (length
);
8262 while ((code
= va_arg (args
, int)))
8264 const char *prefix
= length
? " or " : "expected ";
8266 strcpy (tmp
+ length
, prefix
);
8267 length
+= strlen (prefix
);
8268 strcpy (tmp
+ length
, tree_code_name
[code
]);
8269 length
+= strlen (tree_code_name
[code
]);
8274 buffer
= "unexpected node";
8276 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8277 buffer
, tree_code_name
[TREE_CODE (node
)],
8278 function
, trim_filename (file
), line
);
8281 /* Complain that the tree code of NODE does match the expected 0
8282 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8286 tree_not_check_failed (const_tree node
, const char *file
,
8287 int line
, const char *function
, ...)
8291 unsigned length
= 0;
8294 va_start (args
, function
);
8295 while ((code
= va_arg (args
, int)))
8296 length
+= 4 + strlen (tree_code_name
[code
]);
8298 va_start (args
, function
);
8299 buffer
= (char *) alloca (length
);
8301 while ((code
= va_arg (args
, int)))
8305 strcpy (buffer
+ length
, " or ");
8308 strcpy (buffer
+ length
, tree_code_name
[code
]);
8309 length
+= strlen (tree_code_name
[code
]);
8313 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8314 buffer
, tree_code_name
[TREE_CODE (node
)],
8315 function
, trim_filename (file
), line
);
8318 /* Similar to tree_check_failed, except that we check for a class of tree
8319 code, given in CL. */
8322 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8323 const char *file
, int line
, const char *function
)
8326 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8327 TREE_CODE_CLASS_STRING (cl
),
8328 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8329 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8332 /* Similar to tree_check_failed, except that instead of specifying a
8333 dozen codes, use the knowledge that they're all sequential. */
8336 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8337 const char *function
, enum tree_code c1
,
8341 unsigned length
= 0;
8344 for (c
= c1
; c
<= c2
; ++c
)
8345 length
+= 4 + strlen (tree_code_name
[c
]);
8347 length
+= strlen ("expected ");
8348 buffer
= (char *) alloca (length
);
8351 for (c
= c1
; c
<= c2
; ++c
)
8353 const char *prefix
= length
? " or " : "expected ";
8355 strcpy (buffer
+ length
, prefix
);
8356 length
+= strlen (prefix
);
8357 strcpy (buffer
+ length
, tree_code_name
[c
]);
8358 length
+= strlen (tree_code_name
[c
]);
8361 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8362 buffer
, tree_code_name
[TREE_CODE (node
)],
8363 function
, trim_filename (file
), line
);
8367 /* Similar to tree_check_failed, except that we check that a tree does
8368 not have the specified code, given in CL. */
8371 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8372 const char *file
, int line
, const char *function
)
8375 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8376 TREE_CODE_CLASS_STRING (cl
),
8377 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8378 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8382 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8385 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8386 const char *function
, enum omp_clause_code code
)
8388 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8389 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8390 function
, trim_filename (file
), line
);
8394 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8397 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8398 const char *function
, enum omp_clause_code c1
,
8399 enum omp_clause_code c2
)
8402 unsigned length
= 0;
8405 for (c
= c1
; c
<= c2
; ++c
)
8406 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8408 length
+= strlen ("expected ");
8409 buffer
= (char *) alloca (length
);
8412 for (c
= c1
; c
<= c2
; ++c
)
8414 const char *prefix
= length
? " or " : "expected ";
8416 strcpy (buffer
+ length
, prefix
);
8417 length
+= strlen (prefix
);
8418 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8419 length
+= strlen (omp_clause_code_name
[c
]);
8422 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8423 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8424 function
, trim_filename (file
), line
);
8428 #undef DEFTREESTRUCT
8429 #define DEFTREESTRUCT(VAL, NAME) NAME,
8431 static const char *ts_enum_names
[] = {
8432 #include "treestruct.def"
8434 #undef DEFTREESTRUCT
8436 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8438 /* Similar to tree_class_check_failed, except that we check for
8439 whether CODE contains the tree structure identified by EN. */
8442 tree_contains_struct_check_failed (const_tree node
,
8443 const enum tree_node_structure_enum en
,
8444 const char *file
, int line
,
8445 const char *function
)
8448 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8450 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8454 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8455 (dynamically sized) vector. */
8458 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8459 const char *function
)
8462 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8463 idx
+ 1, len
, function
, trim_filename (file
), line
);
8466 /* Similar to above, except that the check is for the bounds of the operand
8467 vector of an expression node EXP. */
8470 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8471 int line
, const char *function
)
8473 int code
= TREE_CODE (exp
);
8475 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8476 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8477 function
, trim_filename (file
), line
);
8480 /* Similar to above, except that the check is for the number of
8481 operands of an OMP_CLAUSE node. */
8484 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8485 int line
, const char *function
)
8488 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8489 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8490 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8491 trim_filename (file
), line
);
8493 #endif /* ENABLE_TREE_CHECKING */
8495 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8496 and mapped to the machine mode MODE. Initialize its fields and build
8497 the information necessary for debugging output. */
8500 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8503 hashval_t hashcode
= 0;
8505 t
= make_node (VECTOR_TYPE
);
8506 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8507 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8508 SET_TYPE_MODE (t
, mode
);
8510 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8511 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8512 else if (TYPE_CANONICAL (innertype
) != innertype
8513 || mode
!= VOIDmode
)
8515 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8520 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
8521 tree array
= build_array_type (TYPE_MAIN_VARIANT (innertype
),
8522 build_index_type (index
));
8523 tree rt
= make_node (RECORD_TYPE
);
8525 TYPE_FIELDS (rt
) = build_decl (UNKNOWN_LOCATION
, FIELD_DECL
,
8526 get_identifier ("f"), array
);
8527 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
8529 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
8530 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8531 the representation type, and we want to find that die when looking up
8532 the vector type. This is most easily achieved by making the TYPE_UID
8534 TYPE_UID (rt
) = TYPE_UID (t
);
8537 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8538 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8539 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8540 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8541 t
= type_hash_canon (hashcode
, t
);
8543 /* We have built a main variant, based on the main variant of the
8544 inner type. Use it to build the variant we return. */
8545 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8546 && TREE_TYPE (t
) != innertype
)
8547 return build_type_attribute_qual_variant (t
,
8548 TYPE_ATTRIBUTES (innertype
),
8549 TYPE_QUALS (innertype
));
8555 make_or_reuse_type (unsigned size
, int unsignedp
)
8557 if (size
== INT_TYPE_SIZE
)
8558 return unsignedp
? unsigned_type_node
: integer_type_node
;
8559 if (size
== CHAR_TYPE_SIZE
)
8560 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8561 if (size
== SHORT_TYPE_SIZE
)
8562 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8563 if (size
== LONG_TYPE_SIZE
)
8564 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8565 if (size
== LONG_LONG_TYPE_SIZE
)
8566 return (unsignedp
? long_long_unsigned_type_node
8567 : long_long_integer_type_node
);
8570 return make_unsigned_type (size
);
8572 return make_signed_type (size
);
8575 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8578 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8582 if (size
== SHORT_FRACT_TYPE_SIZE
)
8583 return unsignedp
? sat_unsigned_short_fract_type_node
8584 : sat_short_fract_type_node
;
8585 if (size
== FRACT_TYPE_SIZE
)
8586 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8587 if (size
== LONG_FRACT_TYPE_SIZE
)
8588 return unsignedp
? sat_unsigned_long_fract_type_node
8589 : sat_long_fract_type_node
;
8590 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8591 return unsignedp
? sat_unsigned_long_long_fract_type_node
8592 : sat_long_long_fract_type_node
;
8596 if (size
== SHORT_FRACT_TYPE_SIZE
)
8597 return unsignedp
? unsigned_short_fract_type_node
8598 : short_fract_type_node
;
8599 if (size
== FRACT_TYPE_SIZE
)
8600 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
8601 if (size
== LONG_FRACT_TYPE_SIZE
)
8602 return unsignedp
? unsigned_long_fract_type_node
8603 : long_fract_type_node
;
8604 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8605 return unsignedp
? unsigned_long_long_fract_type_node
8606 : long_long_fract_type_node
;
8609 return make_fract_type (size
, unsignedp
, satp
);
8612 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8615 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
8619 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8620 return unsignedp
? sat_unsigned_short_accum_type_node
8621 : sat_short_accum_type_node
;
8622 if (size
== ACCUM_TYPE_SIZE
)
8623 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
8624 if (size
== LONG_ACCUM_TYPE_SIZE
)
8625 return unsignedp
? sat_unsigned_long_accum_type_node
8626 : sat_long_accum_type_node
;
8627 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8628 return unsignedp
? sat_unsigned_long_long_accum_type_node
8629 : sat_long_long_accum_type_node
;
8633 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8634 return unsignedp
? unsigned_short_accum_type_node
8635 : short_accum_type_node
;
8636 if (size
== ACCUM_TYPE_SIZE
)
8637 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
8638 if (size
== LONG_ACCUM_TYPE_SIZE
)
8639 return unsignedp
? unsigned_long_accum_type_node
8640 : long_accum_type_node
;
8641 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8642 return unsignedp
? unsigned_long_long_accum_type_node
8643 : long_long_accum_type_node
;
8646 return make_accum_type (size
, unsignedp
, satp
);
8649 /* Create nodes for all integer types (and error_mark_node) using the sizes
8650 of C datatypes. The caller should call set_sizetype soon after calling
8651 this function to select one of the types as sizetype. */
8654 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
8656 error_mark_node
= make_node (ERROR_MARK
);
8657 TREE_TYPE (error_mark_node
) = error_mark_node
;
8659 initialize_sizetypes (signed_sizetype
);
8661 /* Define both `signed char' and `unsigned char'. */
8662 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
8663 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
8664 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
8665 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
8667 /* Define `char', which is like either `signed char' or `unsigned char'
8668 but not the same as either. */
8671 ? make_signed_type (CHAR_TYPE_SIZE
)
8672 : make_unsigned_type (CHAR_TYPE_SIZE
));
8673 TYPE_STRING_FLAG (char_type_node
) = 1;
8675 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
8676 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
8677 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
8678 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
8679 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
8680 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
8681 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
8682 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
8684 /* Define a boolean type. This type only represents boolean values but
8685 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8686 Front ends which want to override this size (i.e. Java) can redefine
8687 boolean_type_node before calling build_common_tree_nodes_2. */
8688 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
8689 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
8690 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
8691 TYPE_PRECISION (boolean_type_node
) = 1;
8693 /* Fill in the rest of the sized types. Reuse existing type nodes
8695 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
8696 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
8697 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
8698 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
8699 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
8701 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
8702 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
8703 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
8704 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
8705 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
8707 access_public_node
= get_identifier ("public");
8708 access_protected_node
= get_identifier ("protected");
8709 access_private_node
= get_identifier ("private");
8712 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8713 It will create several other common tree nodes. */
8716 build_common_tree_nodes_2 (int short_double
)
8718 /* Define these next since types below may used them. */
8719 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
8720 integer_one_node
= build_int_cst (NULL_TREE
, 1);
8721 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
8723 size_zero_node
= size_int (0);
8724 size_one_node
= size_int (1);
8725 bitsize_zero_node
= bitsize_int (0);
8726 bitsize_one_node
= bitsize_int (1);
8727 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
8729 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
8730 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
8732 void_type_node
= make_node (VOID_TYPE
);
8733 layout_type (void_type_node
);
8735 /* We are not going to have real types in C with less than byte alignment,
8736 so we might as well not have any types that claim to have it. */
8737 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
8738 TYPE_USER_ALIGN (void_type_node
) = 0;
8740 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
8741 layout_type (TREE_TYPE (null_pointer_node
));
8743 ptr_type_node
= build_pointer_type (void_type_node
);
8745 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
8746 fileptr_type_node
= ptr_type_node
;
8748 float_type_node
= make_node (REAL_TYPE
);
8749 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
8750 layout_type (float_type_node
);
8752 double_type_node
= make_node (REAL_TYPE
);
8754 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
8756 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
8757 layout_type (double_type_node
);
8759 long_double_type_node
= make_node (REAL_TYPE
);
8760 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
8761 layout_type (long_double_type_node
);
8763 float_ptr_type_node
= build_pointer_type (float_type_node
);
8764 double_ptr_type_node
= build_pointer_type (double_type_node
);
8765 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
8766 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
8768 /* Fixed size integer types. */
8769 uint32_type_node
= build_nonstandard_integer_type (32, true);
8770 uint64_type_node
= build_nonstandard_integer_type (64, true);
8772 /* Decimal float types. */
8773 dfloat32_type_node
= make_node (REAL_TYPE
);
8774 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
8775 layout_type (dfloat32_type_node
);
8776 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
8777 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
8779 dfloat64_type_node
= make_node (REAL_TYPE
);
8780 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
8781 layout_type (dfloat64_type_node
);
8782 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
8783 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
8785 dfloat128_type_node
= make_node (REAL_TYPE
);
8786 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
8787 layout_type (dfloat128_type_node
);
8788 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
8789 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
8791 complex_integer_type_node
= build_complex_type (integer_type_node
);
8792 complex_float_type_node
= build_complex_type (float_type_node
);
8793 complex_double_type_node
= build_complex_type (double_type_node
);
8794 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
8796 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8797 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8798 sat_ ## KIND ## _type_node = \
8799 make_sat_signed_ ## KIND ## _type (SIZE); \
8800 sat_unsigned_ ## KIND ## _type_node = \
8801 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8802 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8803 unsigned_ ## KIND ## _type_node = \
8804 make_unsigned_ ## KIND ## _type (SIZE);
8806 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8807 sat_ ## WIDTH ## KIND ## _type_node = \
8808 make_sat_signed_ ## KIND ## _type (SIZE); \
8809 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8810 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8811 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8812 unsigned_ ## WIDTH ## KIND ## _type_node = \
8813 make_unsigned_ ## KIND ## _type (SIZE);
8815 /* Make fixed-point type nodes based on four different widths. */
8816 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8817 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8818 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8819 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8820 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8822 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8823 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8824 NAME ## _type_node = \
8825 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8826 u ## NAME ## _type_node = \
8827 make_or_reuse_unsigned_ ## KIND ## _type \
8828 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8829 sat_ ## NAME ## _type_node = \
8830 make_or_reuse_sat_signed_ ## KIND ## _type \
8831 (GET_MODE_BITSIZE (MODE ## mode)); \
8832 sat_u ## NAME ## _type_node = \
8833 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8834 (GET_MODE_BITSIZE (U ## MODE ## mode));
8836 /* Fixed-point type and mode nodes. */
8837 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
8838 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
8839 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
8840 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
8841 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
8842 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
8843 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
8844 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
8845 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
8846 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
8847 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
8850 tree t
= targetm
.build_builtin_va_list ();
8852 /* Many back-ends define record types without setting TYPE_NAME.
8853 If we copied the record type here, we'd keep the original
8854 record type without a name. This breaks name mangling. So,
8855 don't copy record types and let c_common_nodes_and_builtins()
8856 declare the type to be __builtin_va_list. */
8857 if (TREE_CODE (t
) != RECORD_TYPE
)
8858 t
= build_variant_type_copy (t
);
8860 va_list_type_node
= t
;
8864 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8867 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
8868 const char *library_name
, int ecf_flags
)
8872 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
8873 library_name
, NULL_TREE
);
8874 if (ecf_flags
& ECF_CONST
)
8875 TREE_READONLY (decl
) = 1;
8876 if (ecf_flags
& ECF_PURE
)
8877 DECL_PURE_P (decl
) = 1;
8878 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
8879 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
8880 if (ecf_flags
& ECF_NORETURN
)
8881 TREE_THIS_VOLATILE (decl
) = 1;
8882 if (ecf_flags
& ECF_NOTHROW
)
8883 TREE_NOTHROW (decl
) = 1;
8884 if (ecf_flags
& ECF_MALLOC
)
8885 DECL_IS_MALLOC (decl
) = 1;
8887 built_in_decls
[code
] = decl
;
8888 implicit_built_in_decls
[code
] = decl
;
8891 /* Call this function after instantiating all builtins that the language
8892 front end cares about. This will build the rest of the builtins that
8893 are relied upon by the tree optimizers and the middle-end.
8895 ENABLE_CXA_END_CLEANUP should be true for C++ and Java, where the ARM
8896 EABI requires a slightly different implementation of _Unwind_Resume. */
8899 build_common_builtin_nodes (bool enable_cxa_end_cleanup
)
8901 tree tmp
, tmp2
, ftype
;
8903 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
8904 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
8906 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8907 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
8908 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8909 ftype
= build_function_type (ptr_type_node
, tmp
);
8911 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
8912 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
8913 "memcpy", ECF_NOTHROW
);
8914 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
8915 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
8916 "memmove", ECF_NOTHROW
);
8919 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
8921 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8922 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
8923 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
8924 ftype
= build_function_type (integer_type_node
, tmp
);
8925 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
8926 "memcmp", ECF_PURE
| ECF_NOTHROW
);
8929 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
8931 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8932 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
8933 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8934 ftype
= build_function_type (ptr_type_node
, tmp
);
8935 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
8936 "memset", ECF_NOTHROW
);
8939 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
8941 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8942 ftype
= build_function_type (ptr_type_node
, tmp
);
8943 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
8944 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
8947 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8948 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8949 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8950 ftype
= build_function_type (void_type_node
, tmp
);
8951 local_define_builtin ("__builtin_init_trampoline", ftype
,
8952 BUILT_IN_INIT_TRAMPOLINE
,
8953 "__builtin_init_trampoline", ECF_NOTHROW
);
8955 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8956 ftype
= build_function_type (ptr_type_node
, tmp
);
8957 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
8958 BUILT_IN_ADJUST_TRAMPOLINE
,
8959 "__builtin_adjust_trampoline",
8960 ECF_CONST
| ECF_NOTHROW
);
8962 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8963 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8964 ftype
= build_function_type (void_type_node
, tmp
);
8965 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
8966 BUILT_IN_NONLOCAL_GOTO
,
8967 "__builtin_nonlocal_goto",
8968 ECF_NORETURN
| ECF_NOTHROW
);
8970 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8971 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8972 ftype
= build_function_type (void_type_node
, tmp
);
8973 local_define_builtin ("__builtin_setjmp_setup", ftype
,
8974 BUILT_IN_SETJMP_SETUP
,
8975 "__builtin_setjmp_setup", ECF_NOTHROW
);
8977 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8978 ftype
= build_function_type (ptr_type_node
, tmp
);
8979 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
8980 BUILT_IN_SETJMP_DISPATCHER
,
8981 "__builtin_setjmp_dispatcher",
8982 ECF_PURE
| ECF_NOTHROW
);
8984 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8985 ftype
= build_function_type (void_type_node
, tmp
);
8986 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
8987 BUILT_IN_SETJMP_RECEIVER
,
8988 "__builtin_setjmp_receiver", ECF_NOTHROW
);
8990 ftype
= build_function_type (ptr_type_node
, void_list_node
);
8991 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
8992 "__builtin_stack_save", ECF_NOTHROW
);
8994 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8995 ftype
= build_function_type (void_type_node
, tmp
);
8996 local_define_builtin ("__builtin_stack_restore", ftype
,
8997 BUILT_IN_STACK_RESTORE
,
8998 "__builtin_stack_restore", ECF_NOTHROW
);
9000 ftype
= build_function_type (void_type_node
, void_list_node
);
9001 local_define_builtin ("__builtin_profile_func_enter", ftype
,
9002 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
9003 local_define_builtin ("__builtin_profile_func_exit", ftype
,
9004 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
9006 if (enable_cxa_end_cleanup
&& targetm
.arm_eabi_unwinder
)
9008 ftype
= build_function_type (void_type_node
, void_list_node
);
9009 local_define_builtin ("__builtin_unwind_resume", ftype
,
9010 BUILT_IN_UNWIND_RESUME
,
9011 "__cxa_end_cleanup", ECF_NORETURN
);
9015 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9016 ftype
= build_function_type (void_type_node
, tmp
);
9017 local_define_builtin ("__builtin_unwind_resume", ftype
,
9018 BUILT_IN_UNWIND_RESUME
,
9019 (USING_SJLJ_EXCEPTIONS
9020 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9024 /* The exception object and filter values from the runtime. The argument
9025 must be zero before exception lowering, i.e. from the front end. After
9026 exception lowering, it will be the region number for the exception
9027 landing pad. These functions are PURE instead of CONST to prevent
9028 them from being hoisted past the exception edge that will initialize
9029 its value in the landing pad. */
9030 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9031 ftype
= build_function_type (ptr_type_node
, tmp
);
9032 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9033 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
);
9035 tmp2
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9036 ftype
= build_function_type (tmp2
, tmp
);
9037 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9038 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
);
9040 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9041 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
9042 ftype
= build_function_type (void_type_node
, tmp
);
9043 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9044 BUILT_IN_EH_COPY_VALUES
,
9045 "__builtin_eh_copy_values", ECF_NOTHROW
);
9047 /* Complex multiplication and division. These are handled as builtins
9048 rather than optabs because emit_library_call_value doesn't support
9049 complex. Further, we can do slightly better with folding these
9050 beasties if the real and complex parts of the arguments are separate. */
9054 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9056 char mode_name_buf
[4], *q
;
9058 enum built_in_function mcode
, dcode
;
9059 tree type
, inner_type
;
9061 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9064 inner_type
= TREE_TYPE (type
);
9066 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
9067 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9068 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9069 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9070 ftype
= build_function_type (type
, tmp
);
9072 mcode
= ((enum built_in_function
)
9073 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9074 dcode
= ((enum built_in_function
)
9075 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9077 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9081 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9082 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9083 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
9085 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9086 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9087 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
9092 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9095 If we requested a pointer to a vector, build up the pointers that
9096 we stripped off while looking for the inner type. Similarly for
9097 return values from functions.
9099 The argument TYPE is the top of the chain, and BOTTOM is the
9100 new type which we will point to. */
9103 reconstruct_complex_type (tree type
, tree bottom
)
9107 if (TREE_CODE (type
) == POINTER_TYPE
)
9109 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9110 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9111 TYPE_REF_CAN_ALIAS_ALL (type
));
9113 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9115 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9116 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9117 TYPE_REF_CAN_ALIAS_ALL (type
));
9119 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9121 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9122 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9124 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9126 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9127 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9129 else if (TREE_CODE (type
) == METHOD_TYPE
)
9131 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9132 /* The build_method_type_directly() routine prepends 'this' to argument list,
9133 so we must compensate by getting rid of it. */
9135 = build_method_type_directly
9136 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9138 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9140 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9142 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9143 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9148 return build_qualified_type (outer
, TYPE_QUALS (type
));
9151 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9154 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9158 switch (GET_MODE_CLASS (mode
))
9160 case MODE_VECTOR_INT
:
9161 case MODE_VECTOR_FLOAT
:
9162 case MODE_VECTOR_FRACT
:
9163 case MODE_VECTOR_UFRACT
:
9164 case MODE_VECTOR_ACCUM
:
9165 case MODE_VECTOR_UACCUM
:
9166 nunits
= GET_MODE_NUNITS (mode
);
9170 /* Check that there are no leftover bits. */
9171 gcc_assert (GET_MODE_BITSIZE (mode
)
9172 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9174 nunits
= GET_MODE_BITSIZE (mode
)
9175 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9182 return make_vector_type (innertype
, nunits
, mode
);
9185 /* Similarly, but takes the inner type and number of units, which must be
9189 build_vector_type (tree innertype
, int nunits
)
9191 return make_vector_type (innertype
, nunits
, VOIDmode
);
9194 /* Similarly, but takes the inner type and number of units, which must be
9198 build_opaque_vector_type (tree innertype
, int nunits
)
9201 innertype
= build_distinct_type_copy (innertype
);
9202 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9203 TYPE_VECTOR_OPAQUE (t
) = true;
9208 /* Given an initializer INIT, return TRUE if INIT is zero or some
9209 aggregate of zeros. Otherwise return FALSE. */
9211 initializer_zerop (const_tree init
)
9217 switch (TREE_CODE (init
))
9220 return integer_zerop (init
);
9223 /* ??? Note that this is not correct for C4X float formats. There,
9224 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9225 negative exponent. */
9226 return real_zerop (init
)
9227 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9230 return fixed_zerop (init
);
9233 return integer_zerop (init
)
9234 || (real_zerop (init
)
9235 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9236 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9239 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9240 if (!initializer_zerop (TREE_VALUE (elt
)))
9246 unsigned HOST_WIDE_INT idx
;
9248 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9249 if (!initializer_zerop (elt
))
9259 /* Build an empty statement at location LOC. */
9262 build_empty_stmt (location_t loc
)
9264 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9265 SET_EXPR_LOCATION (t
, loc
);
9270 /* Build an OpenMP clause with code CODE. LOC is the location of the
9274 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9279 length
= omp_clause_num_ops
[code
];
9280 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9282 t
= GGC_NEWVAR (union tree_node
, size
);
9283 memset (t
, 0, size
);
9284 TREE_SET_CODE (t
, OMP_CLAUSE
);
9285 OMP_CLAUSE_SET_CODE (t
, code
);
9286 OMP_CLAUSE_LOCATION (t
) = loc
;
9288 #ifdef GATHER_STATISTICS
9289 tree_node_counts
[(int) omp_clause_kind
]++;
9290 tree_node_sizes
[(int) omp_clause_kind
] += size
;
9296 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9297 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9298 Except for the CODE and operand count field, other storage for the
9299 object is initialized to zeros. */
9302 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9305 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9307 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9308 gcc_assert (len
>= 1);
9310 #ifdef GATHER_STATISTICS
9311 tree_node_counts
[(int) e_kind
]++;
9312 tree_node_sizes
[(int) e_kind
] += length
;
9315 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
9317 memset (t
, 0, length
);
9319 TREE_SET_CODE (t
, code
);
9321 /* Can't use TREE_OPERAND to store the length because if checking is
9322 enabled, it will try to check the length before we store it. :-P */
9323 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9329 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9330 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9334 build_call_list (tree return_type
, tree fn
, tree arglist
)
9339 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
9340 TREE_TYPE (t
) = return_type
;
9341 CALL_EXPR_FN (t
) = fn
;
9342 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9343 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
9344 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
9345 process_call_operands (t
);
9349 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9350 FN and a null static chain slot. NARGS is the number of call arguments
9351 which are specified as "..." arguments. */
9354 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9358 va_start (args
, nargs
);
9359 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9364 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9365 FN and a null static chain slot. NARGS is the number of call arguments
9366 which are specified as a va_list ARGS. */
9369 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9374 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9375 TREE_TYPE (t
) = return_type
;
9376 CALL_EXPR_FN (t
) = fn
;
9377 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9378 for (i
= 0; i
< nargs
; i
++)
9379 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9380 process_call_operands (t
);
9384 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9385 FN and a null static chain slot. NARGS is the number of call arguments
9386 which are specified as a tree array ARGS. */
9389 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9390 int nargs
, const tree
*args
)
9395 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9396 TREE_TYPE (t
) = return_type
;
9397 CALL_EXPR_FN (t
) = fn
;
9398 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9399 for (i
= 0; i
< nargs
; i
++)
9400 CALL_EXPR_ARG (t
, i
) = args
[i
];
9401 process_call_operands (t
);
9402 SET_EXPR_LOCATION (t
, loc
);
9406 /* Like build_call_array, but takes a VEC. */
9409 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9414 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
9415 TREE_TYPE (ret
) = return_type
;
9416 CALL_EXPR_FN (ret
) = fn
;
9417 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
9418 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
9419 CALL_EXPR_ARG (ret
, ix
) = t
;
9420 process_call_operands (ret
);
9425 /* Returns true if it is possible to prove that the index of
9426 an array access REF (an ARRAY_REF expression) falls into the
9430 in_array_bounds_p (tree ref
)
9432 tree idx
= TREE_OPERAND (ref
, 1);
9435 if (TREE_CODE (idx
) != INTEGER_CST
)
9438 min
= array_ref_low_bound (ref
);
9439 max
= array_ref_up_bound (ref
);
9442 || TREE_CODE (min
) != INTEGER_CST
9443 || TREE_CODE (max
) != INTEGER_CST
)
9446 if (tree_int_cst_lt (idx
, min
)
9447 || tree_int_cst_lt (max
, idx
))
9453 /* Returns true if it is possible to prove that the range of
9454 an array access REF (an ARRAY_RANGE_REF expression) falls
9455 into the array bounds. */
9458 range_in_array_bounds_p (tree ref
)
9460 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9461 tree range_min
, range_max
, min
, max
;
9463 range_min
= TYPE_MIN_VALUE (domain_type
);
9464 range_max
= TYPE_MAX_VALUE (domain_type
);
9467 || TREE_CODE (range_min
) != INTEGER_CST
9468 || TREE_CODE (range_max
) != INTEGER_CST
)
9471 min
= array_ref_low_bound (ref
);
9472 max
= array_ref_up_bound (ref
);
9475 || TREE_CODE (min
) != INTEGER_CST
9476 || TREE_CODE (max
) != INTEGER_CST
)
9479 if (tree_int_cst_lt (range_min
, min
)
9480 || tree_int_cst_lt (max
, range_max
))
9486 /* Return true if T (assumed to be a DECL) must be assigned a memory
9490 needs_to_live_in_memory (const_tree t
)
9492 if (TREE_CODE (t
) == SSA_NAME
)
9493 t
= SSA_NAME_VAR (t
);
9495 return (TREE_ADDRESSABLE (t
)
9496 || is_global_var (t
)
9497 || (TREE_CODE (t
) == RESULT_DECL
9498 && aggregate_value_p (t
, current_function_decl
)));
9501 /* There are situations in which a language considers record types
9502 compatible which have different field lists. Decide if two fields
9503 are compatible. It is assumed that the parent records are compatible. */
9506 fields_compatible_p (const_tree f1
, const_tree f2
)
9508 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9509 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9512 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9513 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9516 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9522 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9525 find_compatible_field (tree record
, tree orig_field
)
9529 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9530 if (TREE_CODE (f
) == FIELD_DECL
9531 && fields_compatible_p (f
, orig_field
))
9534 /* ??? Why isn't this on the main fields list? */
9535 f
= TYPE_VFIELD (record
);
9536 if (f
&& TREE_CODE (f
) == FIELD_DECL
9537 && fields_compatible_p (f
, orig_field
))
9540 /* ??? We should abort here, but Java appears to do Bad Things
9541 with inherited fields. */
9545 /* Return value of a constant X and sign-extend it. */
9548 int_cst_value (const_tree x
)
9550 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9551 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9553 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9554 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9555 || TREE_INT_CST_HIGH (x
) == -1);
9557 if (bits
< HOST_BITS_PER_WIDE_INT
)
9559 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9561 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9563 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9569 /* Return value of a constant X and sign-extend it. */
9572 widest_int_cst_value (const_tree x
)
9574 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9575 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9577 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9578 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9579 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9580 << HOST_BITS_PER_WIDE_INT
);
9582 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9583 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9584 || TREE_INT_CST_HIGH (x
) == -1);
9587 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9589 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9591 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9593 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9599 /* If TYPE is an integral type, return an equivalent type which is
9600 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9601 return TYPE itself. */
9604 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9607 if (POINTER_TYPE_P (type
))
9610 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9613 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9616 /* Returns unsigned variant of TYPE. */
9619 unsigned_type_for (tree type
)
9621 return signed_or_unsigned_type_for (1, type
);
9624 /* Returns signed variant of TYPE. */
9627 signed_type_for (tree type
)
9629 return signed_or_unsigned_type_for (0, type
);
9632 /* Returns the largest value obtainable by casting something in INNER type to
9636 upper_bound_in_type (tree outer
, tree inner
)
9638 unsigned HOST_WIDE_INT lo
, hi
;
9639 unsigned int det
= 0;
9640 unsigned oprec
= TYPE_PRECISION (outer
);
9641 unsigned iprec
= TYPE_PRECISION (inner
);
9644 /* Compute a unique number for every combination. */
9645 det
|= (oprec
> iprec
) ? 4 : 0;
9646 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
9647 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
9649 /* Determine the exponent to use. */
9654 /* oprec <= iprec, outer: signed, inner: don't care. */
9659 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9663 /* oprec > iprec, outer: signed, inner: signed. */
9667 /* oprec > iprec, outer: signed, inner: unsigned. */
9671 /* oprec > iprec, outer: unsigned, inner: signed. */
9675 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9682 /* Compute 2^^prec - 1. */
9683 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9686 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
9687 >> (HOST_BITS_PER_WIDE_INT
- prec
));
9691 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9692 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
9693 lo
= ~(unsigned HOST_WIDE_INT
) 0;
9696 return build_int_cst_wide (outer
, lo
, hi
);
9699 /* Returns the smallest value obtainable by casting something in INNER type to
9703 lower_bound_in_type (tree outer
, tree inner
)
9705 unsigned HOST_WIDE_INT lo
, hi
;
9706 unsigned oprec
= TYPE_PRECISION (outer
);
9707 unsigned iprec
= TYPE_PRECISION (inner
);
9709 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9711 if (TYPE_UNSIGNED (outer
)
9712 /* If we are widening something of an unsigned type, OUTER type
9713 contains all values of INNER type. In particular, both INNER
9714 and OUTER types have zero in common. */
9715 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
9719 /* If we are widening a signed type to another signed type, we
9720 want to obtain -2^^(iprec-1). If we are keeping the
9721 precision or narrowing to a signed type, we want to obtain
9723 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
9725 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9727 hi
= ~(unsigned HOST_WIDE_INT
) 0;
9728 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
9732 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9733 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
9738 return build_int_cst_wide (outer
, lo
, hi
);
9741 /* Return nonzero if two operands that are suitable for PHI nodes are
9742 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9743 SSA_NAME or invariant. Note that this is strictly an optimization.
9744 That is, callers of this function can directly call operand_equal_p
9745 and get the same result, only slower. */
9748 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
9752 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
9754 return operand_equal_p (arg0
, arg1
, 0);
9757 /* Returns number of zeros at the end of binary representation of X.
9759 ??? Use ffs if available? */
9762 num_ending_zeros (const_tree x
)
9764 unsigned HOST_WIDE_INT fr
, nfr
;
9765 unsigned num
, abits
;
9766 tree type
= TREE_TYPE (x
);
9768 if (TREE_INT_CST_LOW (x
) == 0)
9770 num
= HOST_BITS_PER_WIDE_INT
;
9771 fr
= TREE_INT_CST_HIGH (x
);
9776 fr
= TREE_INT_CST_LOW (x
);
9779 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
9782 if (nfr
<< abits
== fr
)
9789 if (num
> TYPE_PRECISION (type
))
9790 num
= TYPE_PRECISION (type
);
9792 return build_int_cst_type (type
, num
);
9796 #define WALK_SUBTREE(NODE) \
9799 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9805 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9806 be walked whenever a type is seen in the tree. Rest of operands and return
9807 value are as for walk_tree. */
9810 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
9811 struct pointer_set_t
*pset
, walk_tree_lh lh
)
9813 tree result
= NULL_TREE
;
9815 switch (TREE_CODE (type
))
9818 case REFERENCE_TYPE
:
9819 /* We have to worry about mutually recursive pointers. These can't
9820 be written in C. They can in Ada. It's pathological, but
9821 there's an ACATS test (c38102a) that checks it. Deal with this
9822 by checking if we're pointing to another pointer, that one
9823 points to another pointer, that one does too, and we have no htab.
9824 If so, get a hash table. We check three levels deep to avoid
9825 the cost of the hash table if we don't need one. */
9826 if (POINTER_TYPE_P (TREE_TYPE (type
))
9827 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
9828 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
9831 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
9839 /* ... fall through ... */
9842 WALK_SUBTREE (TREE_TYPE (type
));
9846 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
9851 WALK_SUBTREE (TREE_TYPE (type
));
9855 /* We never want to walk into default arguments. */
9856 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
9857 WALK_SUBTREE (TREE_VALUE (arg
));
9862 /* Don't follow this nodes's type if a pointer for fear that
9863 we'll have infinite recursion. If we have a PSET, then we
9866 || (!POINTER_TYPE_P (TREE_TYPE (type
))
9867 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
9868 WALK_SUBTREE (TREE_TYPE (type
));
9869 WALK_SUBTREE (TYPE_DOMAIN (type
));
9873 WALK_SUBTREE (TREE_TYPE (type
));
9874 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
9884 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9885 called with the DATA and the address of each sub-tree. If FUNC returns a
9886 non-NULL value, the traversal is stopped, and the value returned by FUNC
9887 is returned. If PSET is non-NULL it is used to record the nodes visited,
9888 and to avoid visiting a node more than once. */
9891 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
9892 struct pointer_set_t
*pset
, walk_tree_lh lh
)
9894 enum tree_code code
;
9898 #define WALK_SUBTREE_TAIL(NODE) \
9902 goto tail_recurse; \
9907 /* Skip empty subtrees. */
9911 /* Don't walk the same tree twice, if the user has requested
9912 that we avoid doing so. */
9913 if (pset
&& pointer_set_insert (pset
, *tp
))
9916 /* Call the function. */
9918 result
= (*func
) (tp
, &walk_subtrees
, data
);
9920 /* If we found something, return it. */
9924 code
= TREE_CODE (*tp
);
9926 /* Even if we didn't, FUNC may have decided that there was nothing
9927 interesting below this point in the tree. */
9930 /* But we still need to check our siblings. */
9931 if (code
== TREE_LIST
)
9932 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
9933 else if (code
== OMP_CLAUSE
)
9934 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
9941 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
9942 if (result
|| !walk_subtrees
)
9949 case IDENTIFIER_NODE
:
9956 case PLACEHOLDER_EXPR
:
9960 /* None of these have subtrees other than those already walked
9965 WALK_SUBTREE (TREE_VALUE (*tp
));
9966 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
9971 int len
= TREE_VEC_LENGTH (*tp
);
9976 /* Walk all elements but the first. */
9978 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
9980 /* Now walk the first one as a tail call. */
9981 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
9985 WALK_SUBTREE (TREE_REALPART (*tp
));
9986 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
9990 unsigned HOST_WIDE_INT idx
;
9991 constructor_elt
*ce
;
9994 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
9996 WALK_SUBTREE (ce
->value
);
10001 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10006 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
10008 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10009 into declarations that are just mentioned, rather than
10010 declared; they don't really belong to this part of the tree.
10011 And, we can see cycles: the initializer for a declaration
10012 can refer to the declaration itself. */
10013 WALK_SUBTREE (DECL_INITIAL (decl
));
10014 WALK_SUBTREE (DECL_SIZE (decl
));
10015 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10017 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10020 case STATEMENT_LIST
:
10022 tree_stmt_iterator i
;
10023 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10024 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10029 switch (OMP_CLAUSE_CODE (*tp
))
10031 case OMP_CLAUSE_PRIVATE
:
10032 case OMP_CLAUSE_SHARED
:
10033 case OMP_CLAUSE_FIRSTPRIVATE
:
10034 case OMP_CLAUSE_COPYIN
:
10035 case OMP_CLAUSE_COPYPRIVATE
:
10036 case OMP_CLAUSE_IF
:
10037 case OMP_CLAUSE_NUM_THREADS
:
10038 case OMP_CLAUSE_SCHEDULE
:
10039 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10042 case OMP_CLAUSE_NOWAIT
:
10043 case OMP_CLAUSE_ORDERED
:
10044 case OMP_CLAUSE_DEFAULT
:
10045 case OMP_CLAUSE_UNTIED
:
10046 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10048 case OMP_CLAUSE_LASTPRIVATE
:
10049 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10050 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10051 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10053 case OMP_CLAUSE_COLLAPSE
:
10056 for (i
= 0; i
< 3; i
++)
10057 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10058 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10061 case OMP_CLAUSE_REDUCTION
:
10064 for (i
= 0; i
< 4; i
++)
10065 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10066 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10070 gcc_unreachable ();
10078 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10079 But, we only want to walk once. */
10080 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10081 for (i
= 0; i
< len
; ++i
)
10082 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10083 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10087 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10088 defining. We only want to walk into these fields of a type in this
10089 case and not in the general case of a mere reference to the type.
10091 The criterion is as follows: if the field can be an expression, it
10092 must be walked only here. This should be in keeping with the fields
10093 that are directly gimplified in gimplify_type_sizes in order for the
10094 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10095 variable-sized types.
10097 Note that DECLs get walked as part of processing the BIND_EXPR. */
10098 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10100 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10101 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10104 /* Call the function for the type. See if it returns anything or
10105 doesn't want us to continue. If we are to continue, walk both
10106 the normal fields and those for the declaration case. */
10107 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10108 if (result
|| !walk_subtrees
)
10111 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10115 /* If this is a record type, also walk the fields. */
10116 if (TREE_CODE (*type_p
) == RECORD_TYPE
10117 || TREE_CODE (*type_p
) == UNION_TYPE
10118 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10122 for (field
= TYPE_FIELDS (*type_p
); field
;
10123 field
= TREE_CHAIN (field
))
10125 /* We'd like to look at the type of the field, but we can
10126 easily get infinite recursion. So assume it's pointed
10127 to elsewhere in the tree. Also, ignore things that
10129 if (TREE_CODE (field
) != FIELD_DECL
)
10132 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10133 WALK_SUBTREE (DECL_SIZE (field
));
10134 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10135 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10136 WALK_SUBTREE (DECL_QUALIFIER (field
));
10140 /* Same for scalar types. */
10141 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10142 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10143 || TREE_CODE (*type_p
) == INTEGER_TYPE
10144 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10145 || TREE_CODE (*type_p
) == REAL_TYPE
)
10147 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10148 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10151 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10152 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10157 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10161 /* Walk over all the sub-trees of this operand. */
10162 len
= TREE_OPERAND_LENGTH (*tp
);
10164 /* Go through the subtrees. We need to do this in forward order so
10165 that the scope of a FOR_EXPR is handled properly. */
10168 for (i
= 0; i
< len
- 1; ++i
)
10169 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10170 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10173 /* If this is a type, walk the needed fields in the type. */
10174 else if (TYPE_P (*tp
))
10175 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10179 /* We didn't find what we were looking for. */
10182 #undef WALK_SUBTREE_TAIL
10184 #undef WALK_SUBTREE
10186 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10189 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10193 struct pointer_set_t
*pset
;
10195 pset
= pointer_set_create ();
10196 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10197 pointer_set_destroy (pset
);
10203 tree_block (tree t
)
10205 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10207 if (IS_EXPR_CODE_CLASS (c
))
10208 return &t
->exp
.block
;
10209 gcc_unreachable ();
10213 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10214 FIXME: don't use this function. It exists for compatibility with
10215 the old representation of CALL_EXPRs where a list was used to hold the
10216 arguments. Places that currently extract the arglist from a CALL_EXPR
10217 ought to be rewritten to use the CALL_EXPR itself. */
10219 call_expr_arglist (tree exp
)
10221 tree arglist
= NULL_TREE
;
10223 for (i
= call_expr_nargs (exp
) - 1; i
>= 0; i
--)
10224 arglist
= tree_cons (NULL_TREE
, CALL_EXPR_ARG (exp
, i
), arglist
);
10229 /* Create a nameless artificial label and put it in the current
10230 function context. The label has a location of LOC. Returns the
10231 newly created label. */
10234 create_artificial_label (location_t loc
)
10236 tree lab
= build_decl (loc
,
10237 LABEL_DECL
, NULL_TREE
, void_type_node
);
10239 DECL_ARTIFICIAL (lab
) = 1;
10240 DECL_IGNORED_P (lab
) = 1;
10241 DECL_CONTEXT (lab
) = current_function_decl
;
10245 /* Given a tree, try to return a useful variable name that we can use
10246 to prefix a temporary that is being assigned the value of the tree.
10247 I.E. given <temp> = &A, return A. */
10252 tree stripped_decl
;
10255 STRIP_NOPS (stripped_decl
);
10256 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10257 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10260 switch (TREE_CODE (stripped_decl
))
10263 return get_name (TREE_OPERAND (stripped_decl
, 0));
10270 /* Return true if TYPE has a variable argument list. */
10273 stdarg_p (tree fntype
)
10275 function_args_iterator args_iter
;
10276 tree n
= NULL_TREE
, t
;
10281 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10286 return n
!= NULL_TREE
&& n
!= void_type_node
;
10289 /* Return true if TYPE has a prototype. */
10292 prototype_p (tree fntype
)
10296 gcc_assert (fntype
!= NULL_TREE
);
10298 t
= TYPE_ARG_TYPES (fntype
);
10299 return (t
!= NULL_TREE
);
10302 /* If BLOCK is inlined from an __attribute__((__artificial__))
10303 routine, return pointer to location from where it has been
10306 block_nonartificial_location (tree block
)
10308 location_t
*ret
= NULL
;
10310 while (block
&& TREE_CODE (block
) == BLOCK
10311 && BLOCK_ABSTRACT_ORIGIN (block
))
10313 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10315 while (TREE_CODE (ao
) == BLOCK
10316 && BLOCK_ABSTRACT_ORIGIN (ao
)
10317 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10318 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10320 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10322 /* If AO is an artificial inline, point RET to the
10323 call site locus at which it has been inlined and continue
10324 the loop, in case AO's caller is also an artificial
10326 if (DECL_DECLARED_INLINE_P (ao
)
10327 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10328 ret
= &BLOCK_SOURCE_LOCATION (block
);
10332 else if (TREE_CODE (ao
) != BLOCK
)
10335 block
= BLOCK_SUPERCONTEXT (block
);
10341 /* If EXP is inlined from an __attribute__((__artificial__))
10342 function, return the location of the original call expression. */
10345 tree_nonartificial_location (tree exp
)
10347 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10352 return EXPR_LOCATION (exp
);
10356 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10359 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10362 cl_option_hash_hash (const void *x
)
10364 const_tree
const t
= (const_tree
) x
;
10368 hashval_t hash
= 0;
10370 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10372 p
= (const char *)TREE_OPTIMIZATION (t
);
10373 len
= sizeof (struct cl_optimization
);
10376 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10378 p
= (const char *)TREE_TARGET_OPTION (t
);
10379 len
= sizeof (struct cl_target_option
);
10383 gcc_unreachable ();
10385 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10387 for (i
= 0; i
< len
; i
++)
10389 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10394 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10395 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10399 cl_option_hash_eq (const void *x
, const void *y
)
10401 const_tree
const xt
= (const_tree
) x
;
10402 const_tree
const yt
= (const_tree
) y
;
10407 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10410 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10412 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10413 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10414 len
= sizeof (struct cl_optimization
);
10417 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10419 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10420 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10421 len
= sizeof (struct cl_target_option
);
10425 gcc_unreachable ();
10427 return (memcmp (xp
, yp
, len
) == 0);
10430 /* Build an OPTIMIZATION_NODE based on the current options. */
10433 build_optimization_node (void)
10438 /* Use the cache of optimization nodes. */
10440 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
));
10442 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10446 /* Insert this one into the hash table. */
10447 t
= cl_optimization_node
;
10450 /* Make a new node for next time round. */
10451 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10457 /* Build a TARGET_OPTION_NODE based on the current options. */
10460 build_target_option_node (void)
10465 /* Use the cache of optimization nodes. */
10467 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
));
10469 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10473 /* Insert this one into the hash table. */
10474 t
= cl_target_option_node
;
10477 /* Make a new node for next time round. */
10478 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10484 /* Determine the "ultimate origin" of a block. The block may be an inlined
10485 instance of an inlined instance of a block which is local to an inline
10486 function, so we have to trace all of the way back through the origin chain
10487 to find out what sort of node actually served as the original seed for the
10491 block_ultimate_origin (const_tree block
)
10493 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10495 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10496 nodes in the function to point to themselves; ignore that if
10497 we're trying to output the abstract instance of this function. */
10498 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10501 if (immediate_origin
== NULL_TREE
)
10506 tree lookahead
= immediate_origin
;
10510 ret_val
= lookahead
;
10511 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10512 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10514 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10516 /* The block's abstract origin chain may not be the *ultimate* origin of
10517 the block. It could lead to a DECL that has an abstract origin set.
10518 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10519 will give us if it has one). Note that DECL's abstract origins are
10520 supposed to be the most distant ancestor (or so decl_ultimate_origin
10521 claims), so we don't need to loop following the DECL origins. */
10522 if (DECL_P (ret_val
))
10523 return DECL_ORIGIN (ret_val
);
10529 /* Return true if T1 and T2 are equivalent lists. */
10532 list_equal_p (const_tree t1
, const_tree t2
)
10534 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10535 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10540 /* Return true iff conversion in EXP generates no instruction. Mark
10541 it inline so that we fully inline into the stripping functions even
10542 though we have two uses of this function. */
10545 tree_nop_conversion (const_tree exp
)
10547 tree outer_type
, inner_type
;
10549 if (!CONVERT_EXPR_P (exp
)
10550 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10552 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10555 outer_type
= TREE_TYPE (exp
);
10556 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10558 /* Use precision rather then machine mode when we can, which gives
10559 the correct answer even for submode (bit-field) types. */
10560 if ((INTEGRAL_TYPE_P (outer_type
)
10561 || POINTER_TYPE_P (outer_type
)
10562 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10563 && (INTEGRAL_TYPE_P (inner_type
)
10564 || POINTER_TYPE_P (inner_type
)
10565 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10566 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10568 /* Otherwise fall back on comparing machine modes (e.g. for
10569 aggregate types, floats). */
10570 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10573 /* Return true iff conversion in EXP generates no instruction. Don't
10574 consider conversions changing the signedness. */
10577 tree_sign_nop_conversion (const_tree exp
)
10579 tree outer_type
, inner_type
;
10581 if (!tree_nop_conversion (exp
))
10584 outer_type
= TREE_TYPE (exp
);
10585 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10587 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10588 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10591 /* Strip conversions from EXP according to tree_nop_conversion and
10592 return the resulting expression. */
10595 tree_strip_nop_conversions (tree exp
)
10597 while (tree_nop_conversion (exp
))
10598 exp
= TREE_OPERAND (exp
, 0);
10602 /* Strip conversions from EXP according to tree_sign_nop_conversion
10603 and return the resulting expression. */
10606 tree_strip_sign_nop_conversions (tree exp
)
10608 while (tree_sign_nop_conversion (exp
))
10609 exp
= TREE_OPERAND (exp
, 0);
10613 static GTY(()) tree gcc_eh_personality_decl
;
10615 /* Return the GCC personality function decl. */
10618 lhd_gcc_personality (void)
10620 if (!gcc_eh_personality_decl
)
10621 gcc_eh_personality_decl
10622 = build_personality_function (USING_SJLJ_EXCEPTIONS
10623 ? "__gcc_personality_sj0"
10624 : "__gcc_personality_v0");
10626 return gcc_eh_personality_decl
;
10629 #include "gt-tree.h"