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;
155 /* Unique id for next debug decl created. Use negative numbers,
156 to catch erroneous uses. */
157 static GTY(()) int next_debug_decl_uid
;
159 /* Since we cannot rehash a type after it is in the table, we have to
160 keep the hash code. */
162 struct GTY(()) type_hash
{
167 /* Initial size of the hash table (rounded to next prime). */
168 #define TYPE_HASH_INITIAL_SIZE 1000
170 /* Now here is the hash table. When recording a type, it is added to
171 the slot whose index is the hash code. Note that the hash table is
172 used for several kinds of types (function types, array types and
173 array index range types, for now). While all these live in the
174 same table, they are completely independent, and the hash code is
175 computed differently for each of these. */
177 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
178 htab_t type_hash_table
;
180 /* Hash table and temporary node for larger integer const values. */
181 static GTY (()) tree int_cst_node
;
182 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
183 htab_t int_cst_hash_table
;
185 /* Hash table for optimization flags and target option flags. Use the same
186 hash table for both sets of options. Nodes for building the current
187 optimization and target option nodes. The assumption is most of the time
188 the options created will already be in the hash table, so we avoid
189 allocating and freeing up a node repeatably. */
190 static GTY (()) tree cl_optimization_node
;
191 static GTY (()) tree cl_target_option_node
;
192 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
193 htab_t cl_option_hash_table
;
195 /* General tree->tree mapping structure for use in hash tables. */
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
199 htab_t debug_expr_for_decl
;
201 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
202 htab_t value_expr_for_decl
;
204 static GTY ((if_marked ("tree_priority_map_marked_p"),
205 param_is (struct tree_priority_map
)))
206 htab_t init_priority_for_decl
;
208 static void set_type_quals (tree
, int);
209 static int type_hash_eq (const void *, const void *);
210 static hashval_t
type_hash_hash (const void *);
211 static hashval_t
int_cst_hash_hash (const void *);
212 static int int_cst_hash_eq (const void *, const void *);
213 static hashval_t
cl_option_hash_hash (const void *);
214 static int cl_option_hash_eq (const void *, const void *);
215 static void print_type_hash_statistics (void);
216 static void print_debug_expr_statistics (void);
217 static void print_value_expr_statistics (void);
218 static int type_hash_marked_p (const void *);
219 static unsigned int type_hash_list (const_tree
, hashval_t
);
220 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
222 tree global_trees
[TI_MAX
];
223 tree integer_types
[itk_none
];
225 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
227 /* Number of operands for each OpenMP clause. */
228 unsigned const char omp_clause_num_ops
[] =
230 0, /* OMP_CLAUSE_ERROR */
231 1, /* OMP_CLAUSE_PRIVATE */
232 1, /* OMP_CLAUSE_SHARED */
233 1, /* OMP_CLAUSE_FIRSTPRIVATE */
234 2, /* OMP_CLAUSE_LASTPRIVATE */
235 4, /* OMP_CLAUSE_REDUCTION */
236 1, /* OMP_CLAUSE_COPYIN */
237 1, /* OMP_CLAUSE_COPYPRIVATE */
238 1, /* OMP_CLAUSE_IF */
239 1, /* OMP_CLAUSE_NUM_THREADS */
240 1, /* OMP_CLAUSE_SCHEDULE */
241 0, /* OMP_CLAUSE_NOWAIT */
242 0, /* OMP_CLAUSE_ORDERED */
243 0, /* OMP_CLAUSE_DEFAULT */
244 3, /* OMP_CLAUSE_COLLAPSE */
245 0 /* OMP_CLAUSE_UNTIED */
248 const char * const omp_clause_code_name
[] =
269 /* Return the tree node structure used by tree code CODE. */
271 static inline enum tree_node_structure_enum
272 tree_node_structure_for_code (enum tree_code code
)
274 switch (TREE_CODE_CLASS (code
))
276 case tcc_declaration
:
281 return TS_FIELD_DECL
;
287 return TS_LABEL_DECL
;
289 return TS_RESULT_DECL
;
290 case DEBUG_EXPR_DECL
:
293 return TS_CONST_DECL
;
297 return TS_FUNCTION_DECL
;
299 return TS_DECL_NON_COMMON
;
312 default: /* tcc_constant and tcc_exceptional */
317 /* tcc_constant cases. */
318 case INTEGER_CST
: return TS_INT_CST
;
319 case REAL_CST
: return TS_REAL_CST
;
320 case FIXED_CST
: return TS_FIXED_CST
;
321 case COMPLEX_CST
: return TS_COMPLEX
;
322 case VECTOR_CST
: return TS_VECTOR
;
323 case STRING_CST
: return TS_STRING
;
324 /* tcc_exceptional cases. */
325 case ERROR_MARK
: return TS_COMMON
;
326 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
327 case TREE_LIST
: return TS_LIST
;
328 case TREE_VEC
: return TS_VEC
;
329 case SSA_NAME
: return TS_SSA_NAME
;
330 case PLACEHOLDER_EXPR
: return TS_COMMON
;
331 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
332 case BLOCK
: return TS_BLOCK
;
333 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
334 case TREE_BINFO
: return TS_BINFO
;
335 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
336 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
337 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
345 /* Initialize tree_contains_struct to describe the hierarchy of tree
349 initialize_tree_contains_struct (void)
353 #define MARK_TS_BASE(C) \
355 tree_contains_struct[C][TS_BASE] = 1; \
358 #define MARK_TS_COMMON(C) \
361 tree_contains_struct[C][TS_COMMON] = 1; \
364 #define MARK_TS_DECL_MINIMAL(C) \
366 MARK_TS_COMMON (C); \
367 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
370 #define MARK_TS_DECL_COMMON(C) \
372 MARK_TS_DECL_MINIMAL (C); \
373 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
376 #define MARK_TS_DECL_WRTL(C) \
378 MARK_TS_DECL_COMMON (C); \
379 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
382 #define MARK_TS_DECL_WITH_VIS(C) \
384 MARK_TS_DECL_WRTL (C); \
385 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
388 #define MARK_TS_DECL_NON_COMMON(C) \
390 MARK_TS_DECL_WITH_VIS (C); \
391 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
394 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
397 enum tree_node_structure_enum ts_code
;
399 code
= (enum tree_code
) i
;
400 ts_code
= tree_node_structure_for_code (code
);
402 /* Mark the TS structure itself. */
403 tree_contains_struct
[code
][ts_code
] = 1;
405 /* Mark all the structures that TS is derived from. */
419 case TS_DECL_MINIMAL
:
427 case TS_STATEMENT_LIST
:
430 case TS_OPTIMIZATION
:
431 case TS_TARGET_OPTION
:
432 MARK_TS_COMMON (code
);
436 MARK_TS_DECL_MINIMAL (code
);
440 MARK_TS_DECL_COMMON (code
);
443 case TS_DECL_NON_COMMON
:
444 MARK_TS_DECL_WITH_VIS (code
);
447 case TS_DECL_WITH_VIS
:
452 MARK_TS_DECL_WRTL (code
);
456 MARK_TS_DECL_COMMON (code
);
460 MARK_TS_DECL_WITH_VIS (code
);
464 case TS_FUNCTION_DECL
:
465 MARK_TS_DECL_NON_COMMON (code
);
473 /* Basic consistency checks for attributes used in fold. */
474 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
475 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
]);
476 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
477 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
478 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
479 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
480 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
481 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
482 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
483 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
484 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
485 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
486 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
]);
487 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
488 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
489 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
490 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
491 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
492 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
493 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
494 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
495 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
496 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
498 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
499 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
500 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
502 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
503 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
504 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
]);
505 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
506 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
507 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
508 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
509 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
510 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
511 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
512 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
513 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
514 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
517 #undef MARK_TS_COMMON
518 #undef MARK_TS_DECL_MINIMAL
519 #undef MARK_TS_DECL_COMMON
520 #undef MARK_TS_DECL_WRTL
521 #undef MARK_TS_DECL_WITH_VIS
522 #undef MARK_TS_DECL_NON_COMMON
531 /* Initialize the hash table of types. */
532 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
535 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
538 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
540 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
541 tree_priority_map_eq
, 0);
543 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
544 int_cst_hash_eq
, NULL
);
546 int_cst_node
= make_node (INTEGER_CST
);
548 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
549 cl_option_hash_eq
, NULL
);
551 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
552 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
554 /* Initialize the tree_contains_struct array. */
555 initialize_tree_contains_struct ();
556 lang_hooks
.init_ts ();
560 /* The name of the object as the assembler will see it (but before any
561 translations made by ASM_OUTPUT_LABELREF). Often this is the same
562 as DECL_NAME. It is an IDENTIFIER_NODE. */
564 decl_assembler_name (tree decl
)
566 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
567 lang_hooks
.set_decl_assembler_name (decl
);
568 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
571 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
574 decl_assembler_name_equal (tree decl
, const_tree asmname
)
576 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
577 const char *decl_str
;
578 const char *asmname_str
;
581 if (decl_asmname
== asmname
)
584 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
585 asmname_str
= IDENTIFIER_POINTER (asmname
);
588 /* If the target assembler name was set by the user, things are trickier.
589 We have a leading '*' to begin with. After that, it's arguable what
590 is the correct thing to do with -fleading-underscore. Arguably, we've
591 historically been doing the wrong thing in assemble_alias by always
592 printing the leading underscore. Since we're not changing that, make
593 sure user_label_prefix follows the '*' before matching. */
594 if (decl_str
[0] == '*')
596 size_t ulp_len
= strlen (user_label_prefix
);
602 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
603 decl_str
+= ulp_len
, test
=true;
607 if (asmname_str
[0] == '*')
609 size_t ulp_len
= strlen (user_label_prefix
);
615 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
616 asmname_str
+= ulp_len
, test
=true;
623 return strcmp (decl_str
, asmname_str
) == 0;
626 /* Hash asmnames ignoring the user specified marks. */
629 decl_assembler_name_hash (const_tree asmname
)
631 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
633 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
634 size_t ulp_len
= strlen (user_label_prefix
);
638 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
641 return htab_hash_string (decl_str
);
644 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
647 /* Compute the number of bytes occupied by a tree with code CODE.
648 This function cannot be used for nodes that have variable sizes,
649 including TREE_VEC, STRING_CST, and CALL_EXPR. */
651 tree_code_size (enum tree_code code
)
653 switch (TREE_CODE_CLASS (code
))
655 case tcc_declaration
: /* A decl node */
660 return sizeof (struct tree_field_decl
);
662 return sizeof (struct tree_parm_decl
);
664 return sizeof (struct tree_var_decl
);
666 return sizeof (struct tree_label_decl
);
668 return sizeof (struct tree_result_decl
);
670 return sizeof (struct tree_const_decl
);
672 return sizeof (struct tree_type_decl
);
674 return sizeof (struct tree_function_decl
);
675 case DEBUG_EXPR_DECL
:
676 return sizeof (struct tree_decl_with_rtl
);
678 return sizeof (struct tree_decl_non_common
);
682 case tcc_type
: /* a type node */
683 return sizeof (struct tree_type
);
685 case tcc_reference
: /* a reference */
686 case tcc_expression
: /* an expression */
687 case tcc_statement
: /* an expression with side effects */
688 case tcc_comparison
: /* a comparison expression */
689 case tcc_unary
: /* a unary arithmetic expression */
690 case tcc_binary
: /* a binary arithmetic expression */
691 return (sizeof (struct tree_exp
)
692 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
694 case tcc_constant
: /* a constant */
697 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
698 case REAL_CST
: return sizeof (struct tree_real_cst
);
699 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
700 case COMPLEX_CST
: return sizeof (struct tree_complex
);
701 case VECTOR_CST
: return sizeof (struct tree_vector
);
702 case STRING_CST
: gcc_unreachable ();
704 return lang_hooks
.tree_size (code
);
707 case tcc_exceptional
: /* something random, like an identifier. */
710 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
711 case TREE_LIST
: return sizeof (struct tree_list
);
714 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
717 case OMP_CLAUSE
: gcc_unreachable ();
719 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
721 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
722 case BLOCK
: return sizeof (struct tree_block
);
723 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
724 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
725 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
728 return lang_hooks
.tree_size (code
);
736 /* Compute the number of bytes occupied by NODE. This routine only
737 looks at TREE_CODE, except for those nodes that have variable sizes. */
739 tree_size (const_tree node
)
741 const enum tree_code code
= TREE_CODE (node
);
745 return (offsetof (struct tree_binfo
, base_binfos
)
746 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
749 return (sizeof (struct tree_vec
)
750 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
753 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
756 return (sizeof (struct tree_omp_clause
)
757 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
761 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
762 return (sizeof (struct tree_exp
)
763 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
765 return tree_code_size (code
);
769 /* Return a newly allocated node of code CODE. For decl and type
770 nodes, some other fields are initialized. The rest of the node is
771 initialized to zero. This function cannot be used for TREE_VEC or
772 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
774 Achoo! I got a code in the node. */
777 make_node_stat (enum tree_code code MEM_STAT_DECL
)
780 enum tree_code_class type
= TREE_CODE_CLASS (code
);
781 size_t length
= tree_code_size (code
);
782 #ifdef GATHER_STATISTICS
787 case tcc_declaration
: /* A decl node */
791 case tcc_type
: /* a type node */
795 case tcc_statement
: /* an expression with side effects */
799 case tcc_reference
: /* a reference */
803 case tcc_expression
: /* an expression */
804 case tcc_comparison
: /* a comparison expression */
805 case tcc_unary
: /* a unary arithmetic expression */
806 case tcc_binary
: /* a binary arithmetic expression */
810 case tcc_constant
: /* a constant */
814 case tcc_exceptional
: /* something random, like an identifier. */
817 case IDENTIFIER_NODE
:
830 kind
= ssa_name_kind
;
851 tree_node_counts
[(int) kind
]++;
852 tree_node_sizes
[(int) kind
] += length
;
855 if (code
== IDENTIFIER_NODE
)
856 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
858 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
860 memset (t
, 0, length
);
862 TREE_SET_CODE (t
, code
);
867 TREE_SIDE_EFFECTS (t
) = 1;
870 case tcc_declaration
:
871 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
873 if (code
== FUNCTION_DECL
)
875 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
876 DECL_MODE (t
) = FUNCTION_MODE
;
881 DECL_SOURCE_LOCATION (t
) = input_location
;
882 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
883 DECL_UID (t
) = --next_debug_decl_uid
;
885 DECL_UID (t
) = next_decl_uid
++;
886 if (TREE_CODE (t
) == LABEL_DECL
)
887 LABEL_DECL_UID (t
) = -1;
892 TYPE_UID (t
) = next_type_uid
++;
893 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
894 TYPE_USER_ALIGN (t
) = 0;
895 TYPE_MAIN_VARIANT (t
) = t
;
896 TYPE_CANONICAL (t
) = t
;
898 /* Default to no attributes for type, but let target change that. */
899 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
900 targetm
.set_default_type_attributes (t
);
902 /* We have not yet computed the alias set for this type. */
903 TYPE_ALIAS_SET (t
) = -1;
907 TREE_CONSTANT (t
) = 1;
916 case PREDECREMENT_EXPR
:
917 case PREINCREMENT_EXPR
:
918 case POSTDECREMENT_EXPR
:
919 case POSTINCREMENT_EXPR
:
920 /* All of these have side-effects, no matter what their
922 TREE_SIDE_EFFECTS (t
) = 1;
931 /* Other classes need no special treatment. */
938 /* Return a new node with the same contents as NODE except that its
939 TREE_CHAIN is zero and it has a fresh uid. */
942 copy_node_stat (tree node MEM_STAT_DECL
)
945 enum tree_code code
= TREE_CODE (node
);
948 gcc_assert (code
!= STATEMENT_LIST
);
950 length
= tree_size (node
);
951 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
952 memcpy (t
, node
, length
);
955 TREE_ASM_WRITTEN (t
) = 0;
956 TREE_VISITED (t
) = 0;
959 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
961 if (code
== DEBUG_EXPR_DECL
)
962 DECL_UID (t
) = --next_debug_decl_uid
;
964 DECL_UID (t
) = next_decl_uid
++;
965 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
966 && DECL_HAS_VALUE_EXPR_P (node
))
968 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
969 DECL_HAS_VALUE_EXPR_P (t
) = 1;
971 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
973 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
974 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
977 else if (TREE_CODE_CLASS (code
) == tcc_type
)
979 TYPE_UID (t
) = next_type_uid
++;
980 /* The following is so that the debug code for
981 the copy is different from the original type.
982 The two statements usually duplicate each other
983 (because they clear fields of the same union),
984 but the optimizer should catch that. */
985 TYPE_SYMTAB_POINTER (t
) = 0;
986 TYPE_SYMTAB_ADDRESS (t
) = 0;
988 /* Do not copy the values cache. */
989 if (TYPE_CACHED_VALUES_P(t
))
991 TYPE_CACHED_VALUES_P (t
) = 0;
992 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
999 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1000 For example, this can copy a list made of TREE_LIST nodes. */
1003 copy_list (tree list
)
1011 head
= prev
= copy_node (list
);
1012 next
= TREE_CHAIN (list
);
1015 TREE_CHAIN (prev
) = copy_node (next
);
1016 prev
= TREE_CHAIN (prev
);
1017 next
= TREE_CHAIN (next
);
1023 /* Create an INT_CST node with a LOW value sign extended. */
1026 build_int_cst (tree type
, HOST_WIDE_INT low
)
1028 /* Support legacy code. */
1030 type
= integer_type_node
;
1032 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1035 /* Create an INT_CST node with a LOW value zero extended. */
1038 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
1040 return build_int_cst_wide (type
, low
, 0);
1043 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1044 if it is negative. This function is similar to build_int_cst, but
1045 the extra bits outside of the type precision are cleared. Constants
1046 with these extra bits may confuse the fold so that it detects overflows
1047 even in cases when they do not occur, and in general should be avoided.
1048 We cannot however make this a default behavior of build_int_cst without
1049 more intrusive changes, since there are parts of gcc that rely on the extra
1050 precision of the integer constants. */
1053 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1055 unsigned HOST_WIDE_INT low1
;
1060 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
1062 return build_int_cst_wide (type
, low1
, hi
);
1065 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
1066 and sign extended according to the value range of TYPE. */
1069 build_int_cst_wide_type (tree type
,
1070 unsigned HOST_WIDE_INT low
, HOST_WIDE_INT high
)
1072 fit_double_type (low
, high
, &low
, &high
, type
);
1073 return build_int_cst_wide (type
, low
, high
);
1076 /* These are the hash table functions for the hash table of INTEGER_CST
1077 nodes of a sizetype. */
1079 /* Return the hash code code X, an INTEGER_CST. */
1082 int_cst_hash_hash (const void *x
)
1084 const_tree
const t
= (const_tree
) x
;
1086 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1087 ^ htab_hash_pointer (TREE_TYPE (t
)));
1090 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1091 is the same as that given by *Y, which is the same. */
1094 int_cst_hash_eq (const void *x
, const void *y
)
1096 const_tree
const xt
= (const_tree
) x
;
1097 const_tree
const yt
= (const_tree
) y
;
1099 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1100 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1101 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1104 /* Create an INT_CST node of TYPE and value HI:LOW.
1105 The returned node is always shared. For small integers we use a
1106 per-type vector cache, for larger ones we use a single hash table. */
1109 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1117 switch (TREE_CODE (type
))
1120 case REFERENCE_TYPE
:
1121 /* Cache NULL pointer. */
1130 /* Cache false or true. */
1138 if (TYPE_UNSIGNED (type
))
1141 limit
= INTEGER_SHARE_LIMIT
;
1142 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1148 limit
= INTEGER_SHARE_LIMIT
+ 1;
1149 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1151 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1165 /* Look for it in the type's vector of small shared ints. */
1166 if (!TYPE_CACHED_VALUES_P (type
))
1168 TYPE_CACHED_VALUES_P (type
) = 1;
1169 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1172 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1175 /* Make sure no one is clobbering the shared constant. */
1176 gcc_assert (TREE_TYPE (t
) == type
);
1177 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1178 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1182 /* Create a new shared int. */
1183 t
= make_node (INTEGER_CST
);
1185 TREE_INT_CST_LOW (t
) = low
;
1186 TREE_INT_CST_HIGH (t
) = hi
;
1187 TREE_TYPE (t
) = type
;
1189 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1194 /* Use the cache of larger shared ints. */
1197 TREE_INT_CST_LOW (int_cst_node
) = low
;
1198 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1199 TREE_TYPE (int_cst_node
) = type
;
1201 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1205 /* Insert this one into the hash table. */
1208 /* Make a new node for next time round. */
1209 int_cst_node
= make_node (INTEGER_CST
);
1216 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1217 and the rest are zeros. */
1220 build_low_bits_mask (tree type
, unsigned bits
)
1222 unsigned HOST_WIDE_INT low
;
1224 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
1226 gcc_assert (bits
<= TYPE_PRECISION (type
));
1228 if (bits
== TYPE_PRECISION (type
)
1229 && !TYPE_UNSIGNED (type
))
1231 /* Sign extended all-ones mask. */
1235 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
1237 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1242 bits
-= HOST_BITS_PER_WIDE_INT
;
1244 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1247 return build_int_cst_wide (type
, low
, high
);
1250 /* Checks that X is integer constant that can be expressed in (unsigned)
1251 HOST_WIDE_INT without loss of precision. */
1254 cst_and_fits_in_hwi (const_tree x
)
1256 if (TREE_CODE (x
) != INTEGER_CST
)
1259 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1262 return (TREE_INT_CST_HIGH (x
) == 0
1263 || TREE_INT_CST_HIGH (x
) == -1);
1266 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1267 are in a list pointed to by VALS. */
1270 build_vector (tree type
, tree vals
)
1272 tree v
= make_node (VECTOR_CST
);
1276 TREE_VECTOR_CST_ELTS (v
) = vals
;
1277 TREE_TYPE (v
) = type
;
1279 /* Iterate through elements and check for overflow. */
1280 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1282 tree value
= TREE_VALUE (link
);
1284 /* Don't crash if we get an address constant. */
1285 if (!CONSTANT_CLASS_P (value
))
1288 over
|= TREE_OVERFLOW (value
);
1291 TREE_OVERFLOW (v
) = over
;
1295 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1296 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1299 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1301 tree list
= NULL_TREE
;
1302 unsigned HOST_WIDE_INT idx
;
1305 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1306 list
= tree_cons (NULL_TREE
, value
, list
);
1307 return build_vector (type
, nreverse (list
));
1310 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1311 are in the VEC pointed to by VALS. */
1313 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1315 tree c
= make_node (CONSTRUCTOR
);
1316 TREE_TYPE (c
) = type
;
1317 CONSTRUCTOR_ELTS (c
) = vals
;
1321 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1324 build_constructor_single (tree type
, tree index
, tree value
)
1326 VEC(constructor_elt
,gc
) *v
;
1327 constructor_elt
*elt
;
1330 v
= VEC_alloc (constructor_elt
, gc
, 1);
1331 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1335 t
= build_constructor (type
, v
);
1336 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1341 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1342 are in a list pointed to by VALS. */
1344 build_constructor_from_list (tree type
, tree vals
)
1347 VEC(constructor_elt
,gc
) *v
= NULL
;
1348 bool constant_p
= true;
1352 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1353 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1355 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1356 val
= TREE_VALUE (t
);
1357 elt
->index
= TREE_PURPOSE (t
);
1359 if (!TREE_CONSTANT (val
))
1364 t
= build_constructor (type
, v
);
1365 TREE_CONSTANT (t
) = constant_p
;
1369 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1372 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1375 FIXED_VALUE_TYPE
*fp
;
1377 v
= make_node (FIXED_CST
);
1378 fp
= GGC_NEW (FIXED_VALUE_TYPE
);
1379 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1381 TREE_TYPE (v
) = type
;
1382 TREE_FIXED_CST_PTR (v
) = fp
;
1386 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1389 build_real (tree type
, REAL_VALUE_TYPE d
)
1392 REAL_VALUE_TYPE
*dp
;
1395 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1396 Consider doing it via real_convert now. */
1398 v
= make_node (REAL_CST
);
1399 dp
= GGC_NEW (REAL_VALUE_TYPE
);
1400 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1402 TREE_TYPE (v
) = type
;
1403 TREE_REAL_CST_PTR (v
) = dp
;
1404 TREE_OVERFLOW (v
) = overflow
;
1408 /* Return a new REAL_CST node whose type is TYPE
1409 and whose value is the integer value of the INTEGER_CST node I. */
1412 real_value_from_int_cst (const_tree type
, const_tree i
)
1416 /* Clear all bits of the real value type so that we can later do
1417 bitwise comparisons to see if two values are the same. */
1418 memset (&d
, 0, sizeof d
);
1420 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1421 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1422 TYPE_UNSIGNED (TREE_TYPE (i
)));
1426 /* Given a tree representing an integer constant I, return a tree
1427 representing the same value as a floating-point constant of type TYPE. */
1430 build_real_from_int_cst (tree type
, const_tree i
)
1433 int overflow
= TREE_OVERFLOW (i
);
1435 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1437 TREE_OVERFLOW (v
) |= overflow
;
1441 /* Return a newly constructed STRING_CST node whose value is
1442 the LEN characters at STR.
1443 The TREE_TYPE is not initialized. */
1446 build_string (int len
, const char *str
)
1451 /* Do not waste bytes provided by padding of struct tree_string. */
1452 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1454 #ifdef GATHER_STATISTICS
1455 tree_node_counts
[(int) c_kind
]++;
1456 tree_node_sizes
[(int) c_kind
] += length
;
1459 s
= ggc_alloc_tree (length
);
1461 memset (s
, 0, sizeof (struct tree_common
));
1462 TREE_SET_CODE (s
, STRING_CST
);
1463 TREE_CONSTANT (s
) = 1;
1464 TREE_STRING_LENGTH (s
) = len
;
1465 memcpy (s
->string
.str
, str
, len
);
1466 s
->string
.str
[len
] = '\0';
1471 /* Return a newly constructed COMPLEX_CST node whose value is
1472 specified by the real and imaginary parts REAL and IMAG.
1473 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1474 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1477 build_complex (tree type
, tree real
, tree imag
)
1479 tree t
= make_node (COMPLEX_CST
);
1481 TREE_REALPART (t
) = real
;
1482 TREE_IMAGPART (t
) = imag
;
1483 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1484 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1488 /* Return a constant of arithmetic type TYPE which is the
1489 multiplicative identity of the set TYPE. */
1492 build_one_cst (tree type
)
1494 switch (TREE_CODE (type
))
1496 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1497 case POINTER_TYPE
: case REFERENCE_TYPE
:
1499 return build_int_cst (type
, 1);
1502 return build_real (type
, dconst1
);
1504 case FIXED_POINT_TYPE
:
1505 /* We can only generate 1 for accum types. */
1506 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1507 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1514 scalar
= build_one_cst (TREE_TYPE (type
));
1516 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1518 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1519 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1521 return build_vector (type
, cst
);
1525 return build_complex (type
,
1526 build_one_cst (TREE_TYPE (type
)),
1527 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1534 /* Build a BINFO with LEN language slots. */
1537 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1540 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1541 + VEC_embedded_size (tree
, base_binfos
));
1543 #ifdef GATHER_STATISTICS
1544 tree_node_counts
[(int) binfo_kind
]++;
1545 tree_node_sizes
[(int) binfo_kind
] += length
;
1548 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1550 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1552 TREE_SET_CODE (t
, TREE_BINFO
);
1554 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1560 /* Build a newly constructed TREE_VEC node of length LEN. */
1563 make_tree_vec_stat (int len MEM_STAT_DECL
)
1566 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1568 #ifdef GATHER_STATISTICS
1569 tree_node_counts
[(int) vec_kind
]++;
1570 tree_node_sizes
[(int) vec_kind
] += length
;
1573 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1575 memset (t
, 0, length
);
1577 TREE_SET_CODE (t
, TREE_VEC
);
1578 TREE_VEC_LENGTH (t
) = len
;
1583 /* Return 1 if EXPR is the integer constant zero or a complex constant
1587 integer_zerop (const_tree expr
)
1591 return ((TREE_CODE (expr
) == INTEGER_CST
1592 && TREE_INT_CST_LOW (expr
) == 0
1593 && TREE_INT_CST_HIGH (expr
) == 0)
1594 || (TREE_CODE (expr
) == COMPLEX_CST
1595 && integer_zerop (TREE_REALPART (expr
))
1596 && integer_zerop (TREE_IMAGPART (expr
))));
1599 /* Return 1 if EXPR is the integer constant one or the corresponding
1600 complex constant. */
1603 integer_onep (const_tree expr
)
1607 return ((TREE_CODE (expr
) == INTEGER_CST
1608 && TREE_INT_CST_LOW (expr
) == 1
1609 && TREE_INT_CST_HIGH (expr
) == 0)
1610 || (TREE_CODE (expr
) == COMPLEX_CST
1611 && integer_onep (TREE_REALPART (expr
))
1612 && integer_zerop (TREE_IMAGPART (expr
))));
1615 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1616 it contains. Likewise for the corresponding complex constant. */
1619 integer_all_onesp (const_tree expr
)
1626 if (TREE_CODE (expr
) == COMPLEX_CST
1627 && integer_all_onesp (TREE_REALPART (expr
))
1628 && integer_zerop (TREE_IMAGPART (expr
)))
1631 else if (TREE_CODE (expr
) != INTEGER_CST
)
1634 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1635 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1636 && TREE_INT_CST_HIGH (expr
) == -1)
1641 /* Note that using TYPE_PRECISION here is wrong. We care about the
1642 actual bits, not the (arbitrary) range of the type. */
1643 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1644 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1646 HOST_WIDE_INT high_value
;
1649 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1651 /* Can not handle precisions greater than twice the host int size. */
1652 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1653 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1654 /* Shifting by the host word size is undefined according to the ANSI
1655 standard, so we must handle this as a special case. */
1658 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1660 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1661 && TREE_INT_CST_HIGH (expr
) == high_value
);
1664 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1667 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1671 integer_pow2p (const_tree expr
)
1674 HOST_WIDE_INT high
, low
;
1678 if (TREE_CODE (expr
) == COMPLEX_CST
1679 && integer_pow2p (TREE_REALPART (expr
))
1680 && integer_zerop (TREE_IMAGPART (expr
)))
1683 if (TREE_CODE (expr
) != INTEGER_CST
)
1686 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1687 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1688 high
= TREE_INT_CST_HIGH (expr
);
1689 low
= TREE_INT_CST_LOW (expr
);
1691 /* First clear all bits that are beyond the type's precision in case
1692 we've been sign extended. */
1694 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1696 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1697 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1701 if (prec
< HOST_BITS_PER_WIDE_INT
)
1702 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1705 if (high
== 0 && low
== 0)
1708 return ((high
== 0 && (low
& (low
- 1)) == 0)
1709 || (low
== 0 && (high
& (high
- 1)) == 0));
1712 /* Return 1 if EXPR is an integer constant other than zero or a
1713 complex constant other than zero. */
1716 integer_nonzerop (const_tree expr
)
1720 return ((TREE_CODE (expr
) == INTEGER_CST
1721 && (TREE_INT_CST_LOW (expr
) != 0
1722 || TREE_INT_CST_HIGH (expr
) != 0))
1723 || (TREE_CODE (expr
) == COMPLEX_CST
1724 && (integer_nonzerop (TREE_REALPART (expr
))
1725 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1728 /* Return 1 if EXPR is the fixed-point constant zero. */
1731 fixed_zerop (const_tree expr
)
1733 return (TREE_CODE (expr
) == FIXED_CST
1734 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1737 /* Return the power of two represented by a tree node known to be a
1741 tree_log2 (const_tree expr
)
1744 HOST_WIDE_INT high
, low
;
1748 if (TREE_CODE (expr
) == COMPLEX_CST
)
1749 return tree_log2 (TREE_REALPART (expr
));
1751 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1752 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1754 high
= TREE_INT_CST_HIGH (expr
);
1755 low
= TREE_INT_CST_LOW (expr
);
1757 /* First clear all bits that are beyond the type's precision in case
1758 we've been sign extended. */
1760 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1762 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1763 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1767 if (prec
< HOST_BITS_PER_WIDE_INT
)
1768 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1771 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1772 : exact_log2 (low
));
1775 /* Similar, but return the largest integer Y such that 2 ** Y is less
1776 than or equal to EXPR. */
1779 tree_floor_log2 (const_tree expr
)
1782 HOST_WIDE_INT high
, low
;
1786 if (TREE_CODE (expr
) == COMPLEX_CST
)
1787 return tree_log2 (TREE_REALPART (expr
));
1789 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1790 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1792 high
= TREE_INT_CST_HIGH (expr
);
1793 low
= TREE_INT_CST_LOW (expr
);
1795 /* First clear all bits that are beyond the type's precision in case
1796 we've been sign extended. Ignore if type's precision hasn't been set
1797 since what we are doing is setting it. */
1799 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1801 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1802 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1806 if (prec
< HOST_BITS_PER_WIDE_INT
)
1807 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1810 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1811 : floor_log2 (low
));
1814 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1815 decimal float constants, so don't return 1 for them. */
1818 real_zerop (const_tree expr
)
1822 return ((TREE_CODE (expr
) == REAL_CST
1823 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1824 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1825 || (TREE_CODE (expr
) == COMPLEX_CST
1826 && real_zerop (TREE_REALPART (expr
))
1827 && real_zerop (TREE_IMAGPART (expr
))));
1830 /* Return 1 if EXPR is the real constant one in real or complex form.
1831 Trailing zeroes matter for decimal float constants, so don't return
1835 real_onep (const_tree expr
)
1839 return ((TREE_CODE (expr
) == REAL_CST
1840 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1841 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1842 || (TREE_CODE (expr
) == COMPLEX_CST
1843 && real_onep (TREE_REALPART (expr
))
1844 && real_zerop (TREE_IMAGPART (expr
))));
1847 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1848 for decimal float constants, so don't return 1 for them. */
1851 real_twop (const_tree expr
)
1855 return ((TREE_CODE (expr
) == REAL_CST
1856 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1857 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1858 || (TREE_CODE (expr
) == COMPLEX_CST
1859 && real_twop (TREE_REALPART (expr
))
1860 && real_zerop (TREE_IMAGPART (expr
))));
1863 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1864 matter for decimal float constants, so don't return 1 for them. */
1867 real_minus_onep (const_tree expr
)
1871 return ((TREE_CODE (expr
) == REAL_CST
1872 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
1873 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1874 || (TREE_CODE (expr
) == COMPLEX_CST
1875 && real_minus_onep (TREE_REALPART (expr
))
1876 && real_zerop (TREE_IMAGPART (expr
))));
1879 /* Nonzero if EXP is a constant or a cast of a constant. */
1882 really_constant_p (const_tree exp
)
1884 /* This is not quite the same as STRIP_NOPS. It does more. */
1885 while (CONVERT_EXPR_P (exp
)
1886 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1887 exp
= TREE_OPERAND (exp
, 0);
1888 return TREE_CONSTANT (exp
);
1891 /* Return first list element whose TREE_VALUE is ELEM.
1892 Return 0 if ELEM is not in LIST. */
1895 value_member (tree elem
, tree list
)
1899 if (elem
== TREE_VALUE (list
))
1901 list
= TREE_CHAIN (list
);
1906 /* Return first list element whose TREE_PURPOSE is ELEM.
1907 Return 0 if ELEM is not in LIST. */
1910 purpose_member (const_tree elem
, tree list
)
1914 if (elem
== TREE_PURPOSE (list
))
1916 list
= TREE_CHAIN (list
);
1921 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1925 chain_index (int idx
, tree chain
)
1927 for (; chain
&& idx
> 0; --idx
)
1928 chain
= TREE_CHAIN (chain
);
1932 /* Return nonzero if ELEM is part of the chain CHAIN. */
1935 chain_member (const_tree elem
, const_tree chain
)
1941 chain
= TREE_CHAIN (chain
);
1947 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1948 We expect a null pointer to mark the end of the chain.
1949 This is the Lisp primitive `length'. */
1952 list_length (const_tree t
)
1955 #ifdef ENABLE_TREE_CHECKING
1963 #ifdef ENABLE_TREE_CHECKING
1966 gcc_assert (p
!= q
);
1974 /* Returns the number of FIELD_DECLs in TYPE. */
1977 fields_length (const_tree type
)
1979 tree t
= TYPE_FIELDS (type
);
1982 for (; t
; t
= TREE_CHAIN (t
))
1983 if (TREE_CODE (t
) == FIELD_DECL
)
1989 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1990 by modifying the last node in chain 1 to point to chain 2.
1991 This is the Lisp primitive `nconc'. */
1994 chainon (tree op1
, tree op2
)
2003 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2005 TREE_CHAIN (t1
) = op2
;
2007 #ifdef ENABLE_TREE_CHECKING
2010 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2011 gcc_assert (t2
!= t1
);
2018 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2021 tree_last (tree chain
)
2025 while ((next
= TREE_CHAIN (chain
)))
2030 /* Reverse the order of elements in the chain T,
2031 and return the new head of the chain (old last element). */
2036 tree prev
= 0, decl
, next
;
2037 for (decl
= t
; decl
; decl
= next
)
2039 next
= TREE_CHAIN (decl
);
2040 TREE_CHAIN (decl
) = prev
;
2046 /* Return a newly created TREE_LIST node whose
2047 purpose and value fields are PARM and VALUE. */
2050 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2052 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2053 TREE_PURPOSE (t
) = parm
;
2054 TREE_VALUE (t
) = value
;
2058 /* Build a chain of TREE_LIST nodes from a vector. */
2061 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2063 tree ret
= NULL_TREE
;
2067 for (i
= 0; VEC_iterate (tree
, vec
, i
, t
); ++i
)
2069 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2070 pp
= &TREE_CHAIN (*pp
);
2075 /* Return a newly created TREE_LIST node whose
2076 purpose and value fields are PURPOSE and VALUE
2077 and whose TREE_CHAIN is CHAIN. */
2080 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2084 node
= (tree
) ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
2086 memset (node
, 0, sizeof (struct tree_common
));
2088 #ifdef GATHER_STATISTICS
2089 tree_node_counts
[(int) x_kind
]++;
2090 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
2093 TREE_SET_CODE (node
, TREE_LIST
);
2094 TREE_CHAIN (node
) = chain
;
2095 TREE_PURPOSE (node
) = purpose
;
2096 TREE_VALUE (node
) = value
;
2100 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
2103 ctor_to_list (tree ctor
)
2105 tree list
= NULL_TREE
;
2110 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), ix
, purpose
, val
)
2112 *p
= build_tree_list (purpose
, val
);
2113 p
= &TREE_CHAIN (*p
);
2119 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2123 ctor_to_vec (tree ctor
)
2125 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2129 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2130 VEC_quick_push (tree
, vec
, val
);
2135 /* Return the size nominally occupied by an object of type TYPE
2136 when it resides in memory. The value is measured in units of bytes,
2137 and its data type is that normally used for type sizes
2138 (which is the first type created by make_signed_type or
2139 make_unsigned_type). */
2142 size_in_bytes (const_tree type
)
2146 if (type
== error_mark_node
)
2147 return integer_zero_node
;
2149 type
= TYPE_MAIN_VARIANT (type
);
2150 t
= TYPE_SIZE_UNIT (type
);
2154 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2155 return size_zero_node
;
2161 /* Return the size of TYPE (in bytes) as a wide integer
2162 or return -1 if the size can vary or is larger than an integer. */
2165 int_size_in_bytes (const_tree type
)
2169 if (type
== error_mark_node
)
2172 type
= TYPE_MAIN_VARIANT (type
);
2173 t
= TYPE_SIZE_UNIT (type
);
2175 || TREE_CODE (t
) != INTEGER_CST
2176 || TREE_INT_CST_HIGH (t
) != 0
2177 /* If the result would appear negative, it's too big to represent. */
2178 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2181 return TREE_INT_CST_LOW (t
);
2184 /* Return the maximum size of TYPE (in bytes) as a wide integer
2185 or return -1 if the size can vary or is larger than an integer. */
2188 max_int_size_in_bytes (const_tree type
)
2190 HOST_WIDE_INT size
= -1;
2193 /* If this is an array type, check for a possible MAX_SIZE attached. */
2195 if (TREE_CODE (type
) == ARRAY_TYPE
)
2197 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2199 if (size_tree
&& host_integerp (size_tree
, 1))
2200 size
= tree_low_cst (size_tree
, 1);
2203 /* If we still haven't been able to get a size, see if the language
2204 can compute a maximum size. */
2208 size_tree
= lang_hooks
.types
.max_size (type
);
2210 if (size_tree
&& host_integerp (size_tree
, 1))
2211 size
= tree_low_cst (size_tree
, 1);
2217 /* Returns a tree for the size of EXP in bytes. */
2220 tree_expr_size (const_tree exp
)
2223 && DECL_SIZE_UNIT (exp
) != 0)
2224 return DECL_SIZE_UNIT (exp
);
2226 return size_in_bytes (TREE_TYPE (exp
));
2229 /* Return the bit position of FIELD, in bits from the start of the record.
2230 This is a tree of type bitsizetype. */
2233 bit_position (const_tree field
)
2235 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2236 DECL_FIELD_BIT_OFFSET (field
));
2239 /* Likewise, but return as an integer. It must be representable in
2240 that way (since it could be a signed value, we don't have the
2241 option of returning -1 like int_size_in_byte can. */
2244 int_bit_position (const_tree field
)
2246 return tree_low_cst (bit_position (field
), 0);
2249 /* Return the byte position of FIELD, in bytes from the start of the record.
2250 This is a tree of type sizetype. */
2253 byte_position (const_tree field
)
2255 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2256 DECL_FIELD_BIT_OFFSET (field
));
2259 /* Likewise, but return as an integer. It must be representable in
2260 that way (since it could be a signed value, we don't have the
2261 option of returning -1 like int_size_in_byte can. */
2264 int_byte_position (const_tree field
)
2266 return tree_low_cst (byte_position (field
), 0);
2269 /* Return the strictest alignment, in bits, that T is known to have. */
2272 expr_align (const_tree t
)
2274 unsigned int align0
, align1
;
2276 switch (TREE_CODE (t
))
2278 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2279 /* If we have conversions, we know that the alignment of the
2280 object must meet each of the alignments of the types. */
2281 align0
= expr_align (TREE_OPERAND (t
, 0));
2282 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2283 return MAX (align0
, align1
);
2285 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2286 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2287 case CLEANUP_POINT_EXPR
:
2288 /* These don't change the alignment of an object. */
2289 return expr_align (TREE_OPERAND (t
, 0));
2292 /* The best we can do is say that the alignment is the least aligned
2294 align0
= expr_align (TREE_OPERAND (t
, 1));
2295 align1
= expr_align (TREE_OPERAND (t
, 2));
2296 return MIN (align0
, align1
);
2298 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2299 meaningfully, it's always 1. */
2300 case LABEL_DECL
: case CONST_DECL
:
2301 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2303 gcc_assert (DECL_ALIGN (t
) != 0);
2304 return DECL_ALIGN (t
);
2310 /* Otherwise take the alignment from that of the type. */
2311 return TYPE_ALIGN (TREE_TYPE (t
));
2314 /* Return, as a tree node, the number of elements for TYPE (which is an
2315 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2318 array_type_nelts (const_tree type
)
2320 tree index_type
, min
, max
;
2322 /* If they did it with unspecified bounds, then we should have already
2323 given an error about it before we got here. */
2324 if (! TYPE_DOMAIN (type
))
2325 return error_mark_node
;
2327 index_type
= TYPE_DOMAIN (type
);
2328 min
= TYPE_MIN_VALUE (index_type
);
2329 max
= TYPE_MAX_VALUE (index_type
);
2331 return (integer_zerop (min
)
2333 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2336 /* If arg is static -- a reference to an object in static storage -- then
2337 return the object. This is not the same as the C meaning of `static'.
2338 If arg isn't static, return NULL. */
2343 switch (TREE_CODE (arg
))
2346 /* Nested functions are static, even though taking their address will
2347 involve a trampoline as we unnest the nested function and create
2348 the trampoline on the tree level. */
2352 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2353 && ! DECL_THREAD_LOCAL_P (arg
)
2354 && ! DECL_DLLIMPORT_P (arg
)
2358 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2362 return TREE_STATIC (arg
) ? arg
: NULL
;
2369 /* If the thing being referenced is not a field, then it is
2370 something language specific. */
2371 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2373 /* If we are referencing a bitfield, we can't evaluate an
2374 ADDR_EXPR at compile time and so it isn't a constant. */
2375 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2378 return staticp (TREE_OPERAND (arg
, 0));
2383 case MISALIGNED_INDIRECT_REF
:
2384 case ALIGN_INDIRECT_REF
:
2386 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2389 case ARRAY_RANGE_REF
:
2390 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2391 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2392 return staticp (TREE_OPERAND (arg
, 0));
2396 case COMPOUND_LITERAL_EXPR
:
2397 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2407 /* Return whether OP is a DECL whose address is function-invariant. */
2410 decl_address_invariant_p (const_tree op
)
2412 /* The conditions below are slightly less strict than the one in
2415 switch (TREE_CODE (op
))
2424 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2425 && !DECL_DLLIMPORT_P (op
))
2426 || DECL_THREAD_LOCAL_P (op
)
2427 || DECL_CONTEXT (op
) == current_function_decl
2428 || decl_function_context (op
) == current_function_decl
)
2433 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2434 || decl_function_context (op
) == current_function_decl
)
2445 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2448 decl_address_ip_invariant_p (const_tree op
)
2450 /* The conditions below are slightly less strict than the one in
2453 switch (TREE_CODE (op
))
2461 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2462 && !DECL_DLLIMPORT_P (op
))
2463 || DECL_THREAD_LOCAL_P (op
))
2468 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2480 /* Return true if T is function-invariant (internal function, does
2481 not handle arithmetic; that's handled in skip_simple_arithmetic and
2482 tree_invariant_p). */
2484 static bool tree_invariant_p (tree t
);
2487 tree_invariant_p_1 (tree t
)
2491 if (TREE_CONSTANT (t
)
2492 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2495 switch (TREE_CODE (t
))
2501 op
= TREE_OPERAND (t
, 0);
2502 while (handled_component_p (op
))
2504 switch (TREE_CODE (op
))
2507 case ARRAY_RANGE_REF
:
2508 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2509 || TREE_OPERAND (op
, 2) != NULL_TREE
2510 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2515 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2521 op
= TREE_OPERAND (op
, 0);
2524 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2533 /* Return true if T is function-invariant. */
2536 tree_invariant_p (tree t
)
2538 tree inner
= skip_simple_arithmetic (t
);
2539 return tree_invariant_p_1 (inner
);
2542 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2543 Do this to any expression which may be used in more than one place,
2544 but must be evaluated only once.
2546 Normally, expand_expr would reevaluate the expression each time.
2547 Calling save_expr produces something that is evaluated and recorded
2548 the first time expand_expr is called on it. Subsequent calls to
2549 expand_expr just reuse the recorded value.
2551 The call to expand_expr that generates code that actually computes
2552 the value is the first call *at compile time*. Subsequent calls
2553 *at compile time* generate code to use the saved value.
2554 This produces correct result provided that *at run time* control
2555 always flows through the insns made by the first expand_expr
2556 before reaching the other places where the save_expr was evaluated.
2557 You, the caller of save_expr, must make sure this is so.
2559 Constants, and certain read-only nodes, are returned with no
2560 SAVE_EXPR because that is safe. Expressions containing placeholders
2561 are not touched; see tree.def for an explanation of what these
2565 save_expr (tree expr
)
2567 tree t
= fold (expr
);
2570 /* If the tree evaluates to a constant, then we don't want to hide that
2571 fact (i.e. this allows further folding, and direct checks for constants).
2572 However, a read-only object that has side effects cannot be bypassed.
2573 Since it is no problem to reevaluate literals, we just return the
2575 inner
= skip_simple_arithmetic (t
);
2576 if (TREE_CODE (inner
) == ERROR_MARK
)
2579 if (tree_invariant_p_1 (inner
))
2582 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2583 it means that the size or offset of some field of an object depends on
2584 the value within another field.
2586 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2587 and some variable since it would then need to be both evaluated once and
2588 evaluated more than once. Front-ends must assure this case cannot
2589 happen by surrounding any such subexpressions in their own SAVE_EXPR
2590 and forcing evaluation at the proper time. */
2591 if (contains_placeholder_p (inner
))
2594 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2595 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2597 /* This expression might be placed ahead of a jump to ensure that the
2598 value was computed on both sides of the jump. So make sure it isn't
2599 eliminated as dead. */
2600 TREE_SIDE_EFFECTS (t
) = 1;
2604 /* Look inside EXPR and into any simple arithmetic operations. Return
2605 the innermost non-arithmetic node. */
2608 skip_simple_arithmetic (tree expr
)
2612 /* We don't care about whether this can be used as an lvalue in this
2614 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2615 expr
= TREE_OPERAND (expr
, 0);
2617 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2618 a constant, it will be more efficient to not make another SAVE_EXPR since
2619 it will allow better simplification and GCSE will be able to merge the
2620 computations if they actually occur. */
2624 if (UNARY_CLASS_P (inner
))
2625 inner
= TREE_OPERAND (inner
, 0);
2626 else if (BINARY_CLASS_P (inner
))
2628 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2629 inner
= TREE_OPERAND (inner
, 0);
2630 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2631 inner
= TREE_OPERAND (inner
, 1);
2643 /* Return which tree structure is used by T. */
2645 enum tree_node_structure_enum
2646 tree_node_structure (const_tree t
)
2648 const enum tree_code code
= TREE_CODE (t
);
2649 return tree_node_structure_for_code (code
);
2652 /* Set various status flags when building a CALL_EXPR object T. */
2655 process_call_operands (tree t
)
2657 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2658 bool read_only
= false;
2659 int i
= call_expr_flags (t
);
2661 /* Calls have side-effects, except those to const or pure functions. */
2662 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2663 side_effects
= true;
2664 /* Propagate TREE_READONLY of arguments for const functions. */
2668 if (!side_effects
|| read_only
)
2669 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2671 tree op
= TREE_OPERAND (t
, i
);
2672 if (op
&& TREE_SIDE_EFFECTS (op
))
2673 side_effects
= true;
2674 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2678 TREE_SIDE_EFFECTS (t
) = side_effects
;
2679 TREE_READONLY (t
) = read_only
;
2682 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2683 or offset that depends on a field within a record. */
2686 contains_placeholder_p (const_tree exp
)
2688 enum tree_code code
;
2693 code
= TREE_CODE (exp
);
2694 if (code
== PLACEHOLDER_EXPR
)
2697 switch (TREE_CODE_CLASS (code
))
2700 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2701 position computations since they will be converted into a
2702 WITH_RECORD_EXPR involving the reference, which will assume
2703 here will be valid. */
2704 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2706 case tcc_exceptional
:
2707 if (code
== TREE_LIST
)
2708 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2709 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2714 case tcc_comparison
:
2715 case tcc_expression
:
2719 /* Ignoring the first operand isn't quite right, but works best. */
2720 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2723 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2724 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2725 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2728 /* The save_expr function never wraps anything containing
2729 a PLACEHOLDER_EXPR. */
2736 switch (TREE_CODE_LENGTH (code
))
2739 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2741 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2742 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2753 const_call_expr_arg_iterator iter
;
2754 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2755 if (CONTAINS_PLACEHOLDER_P (arg
))
2769 /* Return true if any part of the computation of TYPE involves a
2770 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2771 (for QUAL_UNION_TYPE) and field positions. */
2774 type_contains_placeholder_1 (const_tree type
)
2776 /* If the size contains a placeholder or the parent type (component type in
2777 the case of arrays) type involves a placeholder, this type does. */
2778 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2779 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2780 || (TREE_TYPE (type
) != 0
2781 && type_contains_placeholder_p (TREE_TYPE (type
))))
2784 /* Now do type-specific checks. Note that the last part of the check above
2785 greatly limits what we have to do below. */
2786 switch (TREE_CODE (type
))
2794 case REFERENCE_TYPE
:
2802 case FIXED_POINT_TYPE
:
2803 /* Here we just check the bounds. */
2804 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2805 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2808 /* We're already checked the component type (TREE_TYPE), so just check
2810 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2814 case QUAL_UNION_TYPE
:
2818 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2819 if (TREE_CODE (field
) == FIELD_DECL
2820 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2821 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2822 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2823 || type_contains_placeholder_p (TREE_TYPE (field
))))
2835 type_contains_placeholder_p (tree type
)
2839 /* If the contains_placeholder_bits field has been initialized,
2840 then we know the answer. */
2841 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2842 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2844 /* Indicate that we've seen this type node, and the answer is false.
2845 This is what we want to return if we run into recursion via fields. */
2846 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2848 /* Compute the real value. */
2849 result
= type_contains_placeholder_1 (type
);
2851 /* Store the real value. */
2852 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2857 /* Push tree EXP onto vector QUEUE if it is not already present. */
2860 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2865 for (i
= 0; VEC_iterate (tree
, *queue
, i
, iter
); i
++)
2866 if (simple_cst_equal (iter
, exp
) == 1)
2870 VEC_safe_push (tree
, heap
, *queue
, exp
);
2873 /* Given a tree EXP, find all occurences of references to fields
2874 in a PLACEHOLDER_EXPR and place them in vector REFS without
2875 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2876 we assume here that EXP contains only arithmetic expressions
2877 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2881 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
2883 enum tree_code code
= TREE_CODE (exp
);
2887 /* We handle TREE_LIST and COMPONENT_REF separately. */
2888 if (code
== TREE_LIST
)
2890 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
2891 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
2893 else if (code
== COMPONENT_REF
)
2895 for (inner
= TREE_OPERAND (exp
, 0);
2896 REFERENCE_CLASS_P (inner
);
2897 inner
= TREE_OPERAND (inner
, 0))
2900 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
2901 push_without_duplicates (exp
, refs
);
2903 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
2906 switch (TREE_CODE_CLASS (code
))
2911 case tcc_declaration
:
2912 /* Variables allocated to static storage can stay. */
2913 if (!TREE_STATIC (exp
))
2914 push_without_duplicates (exp
, refs
);
2917 case tcc_expression
:
2918 /* This is the pattern built in ada/make_aligning_type. */
2919 if (code
== ADDR_EXPR
2920 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
2922 push_without_duplicates (exp
, refs
);
2926 /* Fall through... */
2928 case tcc_exceptional
:
2931 case tcc_comparison
:
2933 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
2934 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2938 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2939 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2947 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2948 return a tree with all occurrences of references to F in a
2949 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
2950 CONST_DECLs. Note that we assume here that EXP contains only
2951 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
2952 occurring only in their argument list. */
2955 substitute_in_expr (tree exp
, tree f
, tree r
)
2957 enum tree_code code
= TREE_CODE (exp
);
2958 tree op0
, op1
, op2
, op3
;
2961 /* We handle TREE_LIST and COMPONENT_REF separately. */
2962 if (code
== TREE_LIST
)
2964 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2965 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2966 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2969 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2971 else if (code
== COMPONENT_REF
)
2975 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2976 and it is the right field, replace it with R. */
2977 for (inner
= TREE_OPERAND (exp
, 0);
2978 REFERENCE_CLASS_P (inner
);
2979 inner
= TREE_OPERAND (inner
, 0))
2983 op1
= TREE_OPERAND (exp
, 1);
2985 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
2988 /* If this expression hasn't been completed let, leave it alone. */
2989 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
2992 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2993 if (op0
== TREE_OPERAND (exp
, 0))
2997 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3000 switch (TREE_CODE_CLASS (code
))
3005 case tcc_declaration
:
3011 case tcc_expression
:
3015 /* Fall through... */
3017 case tcc_exceptional
:
3020 case tcc_comparison
:
3022 switch (TREE_CODE_LENGTH (code
))
3028 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3029 if (op0
== TREE_OPERAND (exp
, 0))
3032 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3036 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3037 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3039 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3042 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3046 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3047 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3048 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3050 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3051 && op2
== TREE_OPERAND (exp
, 2))
3054 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3058 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3059 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3060 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3061 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3063 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3064 && op2
== TREE_OPERAND (exp
, 2)
3065 && op3
== TREE_OPERAND (exp
, 3))
3069 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3081 new_tree
= NULL_TREE
;
3083 /* If we are trying to replace F with a constant, inline back
3084 functions which do nothing else than computing a value from
3085 the arguments they are passed. This makes it possible to
3086 fold partially or entirely the replacement expression. */
3087 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3089 tree t
= maybe_inline_call_in_expr (exp
);
3091 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3094 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3096 tree op
= TREE_OPERAND (exp
, i
);
3097 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3101 new_tree
= copy_node (exp
);
3102 TREE_OPERAND (new_tree
, i
) = new_op
;
3108 new_tree
= fold (new_tree
);
3109 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3110 process_call_operands (new_tree
);
3121 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3125 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3126 for it within OBJ, a tree that is an object or a chain of references. */
3129 substitute_placeholder_in_expr (tree exp
, tree obj
)
3131 enum tree_code code
= TREE_CODE (exp
);
3132 tree op0
, op1
, op2
, op3
;
3135 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3136 in the chain of OBJ. */
3137 if (code
== PLACEHOLDER_EXPR
)
3139 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
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 (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3155 for (elt
= obj
; elt
!= 0;
3156 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3157 || TREE_CODE (elt
) == COND_EXPR
)
3158 ? TREE_OPERAND (elt
, 1)
3159 : (REFERENCE_CLASS_P (elt
)
3160 || UNARY_CLASS_P (elt
)
3161 || BINARY_CLASS_P (elt
)
3162 || VL_EXP_CLASS_P (elt
)
3163 || EXPRESSION_CLASS_P (elt
))
3164 ? TREE_OPERAND (elt
, 0) : 0))
3165 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3166 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3168 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3170 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3171 survives until RTL generation, there will be an error. */
3175 /* TREE_LIST is special because we need to look at TREE_VALUE
3176 and TREE_CHAIN, not TREE_OPERANDS. */
3177 else if (code
== TREE_LIST
)
3179 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3180 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3181 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3184 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3187 switch (TREE_CODE_CLASS (code
))
3190 case tcc_declaration
:
3193 case tcc_exceptional
:
3196 case tcc_comparison
:
3197 case tcc_expression
:
3200 switch (TREE_CODE_LENGTH (code
))
3206 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3207 if (op0
== TREE_OPERAND (exp
, 0))
3210 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3214 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3215 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3217 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3220 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3224 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3225 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3226 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3228 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3229 && op2
== TREE_OPERAND (exp
, 2))
3232 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3236 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3237 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3238 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3239 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3241 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3242 && op2
== TREE_OPERAND (exp
, 2)
3243 && op3
== TREE_OPERAND (exp
, 3))
3247 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3259 new_tree
= NULL_TREE
;
3261 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3263 tree op
= TREE_OPERAND (exp
, i
);
3264 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3268 new_tree
= copy_node (exp
);
3269 TREE_OPERAND (new_tree
, i
) = new_op
;
3275 new_tree
= fold (new_tree
);
3276 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3277 process_call_operands (new_tree
);
3288 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3292 /* Stabilize a reference so that we can use it any number of times
3293 without causing its operands to be evaluated more than once.
3294 Returns the stabilized reference. This works by means of save_expr,
3295 so see the caveats in the comments about save_expr.
3297 Also allows conversion expressions whose operands are references.
3298 Any other kind of expression is returned unchanged. */
3301 stabilize_reference (tree ref
)
3304 enum tree_code code
= TREE_CODE (ref
);
3311 /* No action is needed in this case. */
3316 case FIX_TRUNC_EXPR
:
3317 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3321 result
= build_nt (INDIRECT_REF
,
3322 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3326 result
= build_nt (COMPONENT_REF
,
3327 stabilize_reference (TREE_OPERAND (ref
, 0)),
3328 TREE_OPERAND (ref
, 1), NULL_TREE
);
3332 result
= build_nt (BIT_FIELD_REF
,
3333 stabilize_reference (TREE_OPERAND (ref
, 0)),
3334 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3335 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3339 result
= build_nt (ARRAY_REF
,
3340 stabilize_reference (TREE_OPERAND (ref
, 0)),
3341 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3342 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3345 case ARRAY_RANGE_REF
:
3346 result
= build_nt (ARRAY_RANGE_REF
,
3347 stabilize_reference (TREE_OPERAND (ref
, 0)),
3348 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3349 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3353 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3354 it wouldn't be ignored. This matters when dealing with
3356 return stabilize_reference_1 (ref
);
3358 /* If arg isn't a kind of lvalue we recognize, make no change.
3359 Caller should recognize the error for an invalid lvalue. */
3364 return error_mark_node
;
3367 TREE_TYPE (result
) = TREE_TYPE (ref
);
3368 TREE_READONLY (result
) = TREE_READONLY (ref
);
3369 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3370 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3375 /* Subroutine of stabilize_reference; this is called for subtrees of
3376 references. Any expression with side-effects must be put in a SAVE_EXPR
3377 to ensure that it is only evaluated once.
3379 We don't put SAVE_EXPR nodes around everything, because assigning very
3380 simple expressions to temporaries causes us to miss good opportunities
3381 for optimizations. Among other things, the opportunity to fold in the
3382 addition of a constant into an addressing mode often gets lost, e.g.
3383 "y[i+1] += x;". In general, we take the approach that we should not make
3384 an assignment unless we are forced into it - i.e., that any non-side effect
3385 operator should be allowed, and that cse should take care of coalescing
3386 multiple utterances of the same expression should that prove fruitful. */
3389 stabilize_reference_1 (tree e
)
3392 enum tree_code code
= TREE_CODE (e
);
3394 /* We cannot ignore const expressions because it might be a reference
3395 to a const array but whose index contains side-effects. But we can
3396 ignore things that are actual constant or that already have been
3397 handled by this function. */
3399 if (tree_invariant_p (e
))
3402 switch (TREE_CODE_CLASS (code
))
3404 case tcc_exceptional
:
3406 case tcc_declaration
:
3407 case tcc_comparison
:
3409 case tcc_expression
:
3412 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3413 so that it will only be evaluated once. */
3414 /* The reference (r) and comparison (<) classes could be handled as
3415 below, but it is generally faster to only evaluate them once. */
3416 if (TREE_SIDE_EFFECTS (e
))
3417 return save_expr (e
);
3421 /* Constants need no processing. In fact, we should never reach
3426 /* Division is slow and tends to be compiled with jumps,
3427 especially the division by powers of 2 that is often
3428 found inside of an array reference. So do it just once. */
3429 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3430 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3431 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3432 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3433 return save_expr (e
);
3434 /* Recursively stabilize each operand. */
3435 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3436 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3440 /* Recursively stabilize each operand. */
3441 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3448 TREE_TYPE (result
) = TREE_TYPE (e
);
3449 TREE_READONLY (result
) = TREE_READONLY (e
);
3450 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3451 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3456 /* Low-level constructors for expressions. */
3458 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3459 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3462 recompute_tree_invariant_for_addr_expr (tree t
)
3465 bool tc
= true, se
= false;
3467 /* We started out assuming this address is both invariant and constant, but
3468 does not have side effects. Now go down any handled components and see if
3469 any of them involve offsets that are either non-constant or non-invariant.
3470 Also check for side-effects.
3472 ??? Note that this code makes no attempt to deal with the case where
3473 taking the address of something causes a copy due to misalignment. */
3475 #define UPDATE_FLAGS(NODE) \
3476 do { tree _node = (NODE); \
3477 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3478 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3480 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3481 node
= TREE_OPERAND (node
, 0))
3483 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3484 array reference (probably made temporarily by the G++ front end),
3485 so ignore all the operands. */
3486 if ((TREE_CODE (node
) == ARRAY_REF
3487 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3488 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3490 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3491 if (TREE_OPERAND (node
, 2))
3492 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3493 if (TREE_OPERAND (node
, 3))
3494 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3496 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3497 FIELD_DECL, apparently. The G++ front end can put something else
3498 there, at least temporarily. */
3499 else if (TREE_CODE (node
) == COMPONENT_REF
3500 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3502 if (TREE_OPERAND (node
, 2))
3503 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3505 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3506 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3509 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3511 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3512 the address, since &(*a)->b is a form of addition. If it's a constant, the
3513 address is constant too. If it's a decl, its address is constant if the
3514 decl is static. Everything else is not constant and, furthermore,
3515 taking the address of a volatile variable is not volatile. */
3516 if (TREE_CODE (node
) == INDIRECT_REF
)
3517 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3518 else if (CONSTANT_CLASS_P (node
))
3520 else if (DECL_P (node
))
3521 tc
&= (staticp (node
) != NULL_TREE
);
3525 se
|= TREE_SIDE_EFFECTS (node
);
3529 TREE_CONSTANT (t
) = tc
;
3530 TREE_SIDE_EFFECTS (t
) = se
;
3534 /* Build an expression of code CODE, data type TYPE, and operands as
3535 specified. Expressions and reference nodes can be created this way.
3536 Constants, decls, types and misc nodes cannot be.
3538 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3539 enough for all extant tree codes. */
3542 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3546 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3548 t
= make_node_stat (code PASS_MEM_STAT
);
3555 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3557 int length
= sizeof (struct tree_exp
);
3558 #ifdef GATHER_STATISTICS
3559 tree_node_kind kind
;
3563 #ifdef GATHER_STATISTICS
3564 switch (TREE_CODE_CLASS (code
))
3566 case tcc_statement
: /* an expression with side effects */
3569 case tcc_reference
: /* a reference */
3577 tree_node_counts
[(int) kind
]++;
3578 tree_node_sizes
[(int) kind
] += length
;
3581 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3583 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
3585 memset (t
, 0, sizeof (struct tree_common
));
3587 TREE_SET_CODE (t
, code
);
3589 TREE_TYPE (t
) = type
;
3590 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3591 TREE_OPERAND (t
, 0) = node
;
3592 TREE_BLOCK (t
) = NULL_TREE
;
3593 if (node
&& !TYPE_P (node
))
3595 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3596 TREE_READONLY (t
) = TREE_READONLY (node
);
3599 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3600 TREE_SIDE_EFFECTS (t
) = 1;
3604 /* All of these have side-effects, no matter what their
3606 TREE_SIDE_EFFECTS (t
) = 1;
3607 TREE_READONLY (t
) = 0;
3610 case MISALIGNED_INDIRECT_REF
:
3611 case ALIGN_INDIRECT_REF
:
3613 /* Whether a dereference is readonly has nothing to do with whether
3614 its operand is readonly. */
3615 TREE_READONLY (t
) = 0;
3620 recompute_tree_invariant_for_addr_expr (t
);
3624 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3625 && node
&& !TYPE_P (node
)
3626 && TREE_CONSTANT (node
))
3627 TREE_CONSTANT (t
) = 1;
3628 if (TREE_CODE_CLASS (code
) == tcc_reference
3629 && node
&& TREE_THIS_VOLATILE (node
))
3630 TREE_THIS_VOLATILE (t
) = 1;
3637 #define PROCESS_ARG(N) \
3639 TREE_OPERAND (t, N) = arg##N; \
3640 if (arg##N &&!TYPE_P (arg##N)) \
3642 if (TREE_SIDE_EFFECTS (arg##N)) \
3644 if (!TREE_READONLY (arg##N) \
3645 && !CONSTANT_CLASS_P (arg##N)) \
3647 if (!TREE_CONSTANT (arg##N)) \
3653 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3655 bool constant
, read_only
, side_effects
;
3658 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3660 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3661 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3662 /* When sizetype precision doesn't match that of pointers
3663 we need to be able to build explicit extensions or truncations
3664 of the offset argument. */
3665 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3666 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3667 && TREE_CODE (arg1
) == INTEGER_CST
);
3669 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3670 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3671 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3672 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3674 t
= make_node_stat (code PASS_MEM_STAT
);
3677 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3678 result based on those same flags for the arguments. But if the
3679 arguments aren't really even `tree' expressions, we shouldn't be trying
3682 /* Expressions without side effects may be constant if their
3683 arguments are as well. */
3684 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3685 || TREE_CODE_CLASS (code
) == tcc_binary
);
3687 side_effects
= TREE_SIDE_EFFECTS (t
);
3692 TREE_READONLY (t
) = read_only
;
3693 TREE_CONSTANT (t
) = constant
;
3694 TREE_SIDE_EFFECTS (t
) = side_effects
;
3695 TREE_THIS_VOLATILE (t
)
3696 = (TREE_CODE_CLASS (code
) == tcc_reference
3697 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3704 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3705 tree arg2 MEM_STAT_DECL
)
3707 bool constant
, read_only
, side_effects
;
3710 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3711 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3713 t
= make_node_stat (code PASS_MEM_STAT
);
3718 /* As a special exception, if COND_EXPR has NULL branches, we
3719 assume that it is a gimple statement and always consider
3720 it to have side effects. */
3721 if (code
== COND_EXPR
3722 && tt
== void_type_node
3723 && arg1
== NULL_TREE
3724 && arg2
== NULL_TREE
)
3725 side_effects
= true;
3727 side_effects
= TREE_SIDE_EFFECTS (t
);
3733 if (code
== COND_EXPR
)
3734 TREE_READONLY (t
) = read_only
;
3736 TREE_SIDE_EFFECTS (t
) = side_effects
;
3737 TREE_THIS_VOLATILE (t
)
3738 = (TREE_CODE_CLASS (code
) == tcc_reference
3739 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3745 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3746 tree arg2
, tree arg3 MEM_STAT_DECL
)
3748 bool constant
, read_only
, side_effects
;
3751 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3753 t
= make_node_stat (code PASS_MEM_STAT
);
3756 side_effects
= TREE_SIDE_EFFECTS (t
);
3763 TREE_SIDE_EFFECTS (t
) = side_effects
;
3764 TREE_THIS_VOLATILE (t
)
3765 = (TREE_CODE_CLASS (code
) == tcc_reference
3766 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3772 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3773 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3775 bool constant
, read_only
, side_effects
;
3778 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3780 t
= make_node_stat (code PASS_MEM_STAT
);
3783 side_effects
= TREE_SIDE_EFFECTS (t
);
3791 TREE_SIDE_EFFECTS (t
) = side_effects
;
3792 TREE_THIS_VOLATILE (t
)
3793 = (TREE_CODE_CLASS (code
) == tcc_reference
3794 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3800 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3801 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3803 bool constant
, read_only
, side_effects
;
3806 gcc_assert (code
== TARGET_MEM_REF
);
3808 t
= make_node_stat (code PASS_MEM_STAT
);
3811 side_effects
= TREE_SIDE_EFFECTS (t
);
3820 TREE_SIDE_EFFECTS (t
) = side_effects
;
3821 TREE_THIS_VOLATILE (t
) = 0;
3826 /* Similar except don't specify the TREE_TYPE
3827 and leave the TREE_SIDE_EFFECTS as 0.
3828 It is permissible for arguments to be null,
3829 or even garbage if their values do not matter. */
3832 build_nt (enum tree_code code
, ...)
3839 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3843 t
= make_node (code
);
3844 length
= TREE_CODE_LENGTH (code
);
3846 for (i
= 0; i
< length
; i
++)
3847 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3853 /* Similar to build_nt, but for creating a CALL_EXPR object with
3854 ARGLIST passed as a list. */
3857 build_nt_call_list (tree fn
, tree arglist
)
3862 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
3863 CALL_EXPR_FN (t
) = fn
;
3864 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
3865 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
3866 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
3870 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3874 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
3879 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
3880 CALL_EXPR_FN (ret
) = fn
;
3881 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
3882 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
3883 CALL_EXPR_ARG (ret
, ix
) = t
;
3887 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3888 We do NOT enter this node in any sort of symbol table.
3890 LOC is the location of the decl.
3892 layout_decl is used to set up the decl's storage layout.
3893 Other slots are initialized to 0 or null pointers. */
3896 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
3897 tree type MEM_STAT_DECL
)
3901 t
= make_node_stat (code PASS_MEM_STAT
);
3902 DECL_SOURCE_LOCATION (t
) = loc
;
3904 /* if (type == error_mark_node)
3905 type = integer_type_node; */
3906 /* That is not done, deliberately, so that having error_mark_node
3907 as the type can suppress useless errors in the use of this variable. */
3909 DECL_NAME (t
) = name
;
3910 TREE_TYPE (t
) = type
;
3912 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3918 /* Builds and returns function declaration with NAME and TYPE. */
3921 build_fn_decl (const char *name
, tree type
)
3923 tree id
= get_identifier (name
);
3924 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
3926 DECL_EXTERNAL (decl
) = 1;
3927 TREE_PUBLIC (decl
) = 1;
3928 DECL_ARTIFICIAL (decl
) = 1;
3929 TREE_NOTHROW (decl
) = 1;
3935 /* BLOCK nodes are used to represent the structure of binding contours
3936 and declarations, once those contours have been exited and their contents
3937 compiled. This information is used for outputting debugging info. */
3940 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3942 tree block
= make_node (BLOCK
);
3944 BLOCK_VARS (block
) = vars
;
3945 BLOCK_SUBBLOCKS (block
) = subblocks
;
3946 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3947 BLOCK_CHAIN (block
) = chain
;
3952 expand_location (source_location loc
)
3954 expanded_location xloc
;
3964 const struct line_map
*map
= linemap_lookup (line_table
, loc
);
3965 xloc
.file
= map
->to_file
;
3966 xloc
.line
= SOURCE_LINE (map
, loc
);
3967 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3968 xloc
.sysp
= map
->sysp
!= 0;
3974 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3976 LOC is the location to use in tree T. */
3979 protected_set_expr_location (tree t
, location_t loc
)
3981 if (t
&& CAN_HAVE_LOCATION_P (t
))
3982 SET_EXPR_LOCATION (t
, loc
);
3985 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3989 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3991 DECL_ATTRIBUTES (ddecl
) = attribute
;
3995 /* Borrowed from hashtab.c iterative_hash implementation. */
3996 #define mix(a,b,c) \
3998 a -= b; a -= c; a ^= (c>>13); \
3999 b -= c; b -= a; b ^= (a<< 8); \
4000 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4001 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4002 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4003 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4004 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4005 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4006 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4010 /* Produce good hash value combining VAL and VAL2. */
4012 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4014 /* the golden ratio; an arbitrary value. */
4015 hashval_t a
= 0x9e3779b9;
4021 /* Produce good hash value combining VAL and VAL2. */
4023 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4025 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4026 return iterative_hash_hashval_t (val
, val2
);
4029 hashval_t a
= (hashval_t
) val
;
4030 /* Avoid warnings about shifting of more than the width of the type on
4031 hosts that won't execute this path. */
4033 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4035 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4037 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4038 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4045 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4046 is ATTRIBUTE and its qualifiers are QUALS.
4048 Record such modified types already made so we don't make duplicates. */
4051 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4053 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4055 hashval_t hashcode
= 0;
4057 enum tree_code code
= TREE_CODE (ttype
);
4059 /* Building a distinct copy of a tagged type is inappropriate; it
4060 causes breakage in code that expects there to be a one-to-one
4061 relationship between a struct and its fields.
4062 build_duplicate_type is another solution (as used in
4063 handle_transparent_union_attribute), but that doesn't play well
4064 with the stronger C++ type identity model. */
4065 if (TREE_CODE (ttype
) == RECORD_TYPE
4066 || TREE_CODE (ttype
) == UNION_TYPE
4067 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4068 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4070 warning (OPT_Wattributes
,
4071 "ignoring attributes applied to %qT after definition",
4072 TYPE_MAIN_VARIANT (ttype
));
4073 return build_qualified_type (ttype
, quals
);
4076 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4077 ntype
= build_distinct_type_copy (ttype
);
4079 TYPE_ATTRIBUTES (ntype
) = attribute
;
4081 hashcode
= iterative_hash_object (code
, hashcode
);
4082 if (TREE_TYPE (ntype
))
4083 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4085 hashcode
= attribute_hash_list (attribute
, hashcode
);
4087 switch (TREE_CODE (ntype
))
4090 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4093 if (TYPE_DOMAIN (ntype
))
4094 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4098 hashcode
= iterative_hash_object
4099 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4100 hashcode
= iterative_hash_object
4101 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4104 case FIXED_POINT_TYPE
:
4106 unsigned int precision
= TYPE_PRECISION (ntype
);
4107 hashcode
= iterative_hash_object (precision
, hashcode
);
4114 ntype
= type_hash_canon (hashcode
, ntype
);
4116 /* If the target-dependent attributes make NTYPE different from
4117 its canonical type, we will need to use structural equality
4118 checks for this type. */
4119 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4120 || !targetm
.comp_type_attributes (ntype
, ttype
))
4121 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4122 else if (TYPE_CANONICAL (ntype
) == ntype
)
4123 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4125 ttype
= build_qualified_type (ntype
, quals
);
4127 else if (TYPE_QUALS (ttype
) != quals
)
4128 ttype
= build_qualified_type (ttype
, quals
);
4134 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4137 Record such modified types already made so we don't make duplicates. */
4140 build_type_attribute_variant (tree ttype
, tree attribute
)
4142 return build_type_attribute_qual_variant (ttype
, attribute
,
4143 TYPE_QUALS (ttype
));
4147 /* Reset all the fields in a binfo node BINFO. We only keep
4148 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4151 free_lang_data_in_binfo (tree binfo
)
4156 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4158 BINFO_OFFSET (binfo
) = NULL_TREE
;
4159 BINFO_VTABLE (binfo
) = NULL_TREE
;
4160 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
4161 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4162 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4163 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4164 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
4166 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
); i
++)
4167 free_lang_data_in_binfo (t
);
4171 /* Reset all language specific information still present in TYPE. */
4174 free_lang_data_in_type (tree type
)
4176 gcc_assert (TYPE_P (type
));
4178 /* Fill in the alias-set. We need to at least track zeroness here
4180 if (lang_hooks
.get_alias_set (type
) == 0)
4181 TYPE_ALIAS_SET (type
) = 0;
4183 /* Give the FE a chance to remove its own data first. */
4184 lang_hooks
.free_lang_data (type
);
4186 TREE_LANG_FLAG_0 (type
) = 0;
4187 TREE_LANG_FLAG_1 (type
) = 0;
4188 TREE_LANG_FLAG_2 (type
) = 0;
4189 TREE_LANG_FLAG_3 (type
) = 0;
4190 TREE_LANG_FLAG_4 (type
) = 0;
4191 TREE_LANG_FLAG_5 (type
) = 0;
4192 TREE_LANG_FLAG_6 (type
) = 0;
4194 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4196 /* Remove the const and volatile qualifiers from arguments. The
4197 C++ front end removes them, but the C front end does not,
4198 leading to false ODR violation errors when merging two
4199 instances of the same function signature compiled by
4200 different front ends. */
4203 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4205 tree arg_type
= TREE_VALUE (p
);
4207 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4209 int quals
= TYPE_QUALS (arg_type
)
4211 & ~TYPE_QUAL_VOLATILE
;
4212 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4213 free_lang_data_in_type (TREE_VALUE (p
));
4218 /* Remove members that are not actually FIELD_DECLs from the field
4219 list of an aggregate. These occur in C++. */
4220 if (RECORD_OR_UNION_TYPE_P (type
))
4224 /* Note that TYPE_FIELDS can be shared across distinct
4225 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4226 to be removed, we cannot set its TREE_CHAIN to NULL.
4227 Otherwise, we would not be able to find all the other fields
4228 in the other instances of this TREE_TYPE.
4230 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4232 member
= TYPE_FIELDS (type
);
4235 if (TREE_CODE (member
) == FIELD_DECL
)
4238 TREE_CHAIN (prev
) = member
;
4240 TYPE_FIELDS (type
) = member
;
4244 member
= TREE_CHAIN (member
);
4248 TREE_CHAIN (prev
) = NULL_TREE
;
4250 TYPE_FIELDS (type
) = NULL_TREE
;
4252 TYPE_METHODS (type
) = NULL_TREE
;
4253 if (TYPE_BINFO (type
))
4254 free_lang_data_in_binfo (TYPE_BINFO (type
));
4258 /* For non-aggregate types, clear out the language slot (which
4259 overloads TYPE_BINFO). */
4260 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4263 TYPE_CONTEXT (type
) = NULL_TREE
;
4264 TYPE_STUB_DECL (type
) = NULL_TREE
;
4268 /* Return true if DECL may need an assembler name to be set. */
4271 need_assembler_name_p (tree decl
)
4273 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4274 if (TREE_CODE (decl
) != FUNCTION_DECL
4275 && TREE_CODE (decl
) != VAR_DECL
)
4278 /* If DECL already has its assembler name set, it does not need a
4280 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4281 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4284 /* For VAR_DECLs, only static, public and external symbols need an
4286 if (TREE_CODE (decl
) == VAR_DECL
4287 && !TREE_STATIC (decl
)
4288 && !TREE_PUBLIC (decl
)
4289 && !DECL_EXTERNAL (decl
))
4292 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4294 /* Do not set assembler name on builtins. Allow RTL expansion to
4295 decide whether to expand inline or via a regular call. */
4296 if (DECL_BUILT_IN (decl
)
4297 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4300 /* Functions represented in the callgraph need an assembler name. */
4301 if (cgraph_node_for_decl (decl
) != NULL
)
4304 /* Unused and not public functions don't need an assembler name. */
4305 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4313 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4314 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4315 in BLOCK that is not in LOCALS is removed. */
4318 free_lang_data_in_block (tree fn
, tree block
, struct pointer_set_t
*locals
)
4322 tp
= &BLOCK_VARS (block
);
4325 if (!pointer_set_contains (locals
, *tp
))
4326 *tp
= TREE_CHAIN (*tp
);
4328 tp
= &TREE_CHAIN (*tp
);
4331 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4332 free_lang_data_in_block (fn
, t
, locals
);
4336 /* Reset all language specific information still present in symbol
4340 free_lang_data_in_decl (tree decl
)
4342 gcc_assert (DECL_P (decl
));
4344 /* Give the FE a chance to remove its own data first. */
4345 lang_hooks
.free_lang_data (decl
);
4347 TREE_LANG_FLAG_0 (decl
) = 0;
4348 TREE_LANG_FLAG_1 (decl
) = 0;
4349 TREE_LANG_FLAG_2 (decl
) = 0;
4350 TREE_LANG_FLAG_3 (decl
) = 0;
4351 TREE_LANG_FLAG_4 (decl
) = 0;
4352 TREE_LANG_FLAG_5 (decl
) = 0;
4353 TREE_LANG_FLAG_6 (decl
) = 0;
4355 /* Identifiers need not have a type. */
4356 if (DECL_NAME (decl
))
4357 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4359 /* Ignore any intervening types, because we are going to clear their
4360 TYPE_CONTEXT fields. */
4361 if (TREE_CODE (decl
) != FIELD_DECL
)
4362 DECL_CONTEXT (decl
) = decl_function_context (decl
);
4364 if (DECL_CONTEXT (decl
)
4365 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
)
4366 DECL_CONTEXT (decl
) = NULL_TREE
;
4368 if (TREE_CODE (decl
) == VAR_DECL
)
4370 tree context
= DECL_CONTEXT (decl
);
4374 enum tree_code code
= TREE_CODE (context
);
4375 if (code
== FUNCTION_DECL
&& DECL_ABSTRACT (context
))
4377 /* Do not clear the decl context here, that will promote
4378 all vars to global ones. */
4379 DECL_INITIAL (decl
) = NULL_TREE
;
4382 if (TREE_STATIC (decl
))
4383 DECL_CONTEXT (decl
) = NULL_TREE
;
4387 if (TREE_CODE (decl
) == PARM_DECL
4388 || TREE_CODE (decl
) == FIELD_DECL
4389 || TREE_CODE (decl
) == RESULT_DECL
)
4391 tree unit_size
= DECL_SIZE_UNIT (decl
);
4392 tree size
= DECL_SIZE (decl
);
4393 if ((unit_size
&& TREE_CODE (unit_size
) != INTEGER_CST
)
4394 || (size
&& TREE_CODE (size
) != INTEGER_CST
))
4396 DECL_SIZE_UNIT (decl
) = NULL_TREE
;
4397 DECL_SIZE (decl
) = NULL_TREE
;
4400 if (TREE_CODE (decl
) == FIELD_DECL
4401 && DECL_FIELD_OFFSET (decl
)
4402 && TREE_CODE (DECL_FIELD_OFFSET (decl
)) != INTEGER_CST
)
4403 DECL_FIELD_OFFSET (decl
) = NULL_TREE
;
4405 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
4407 if (gimple_has_body_p (decl
))
4410 struct pointer_set_t
*locals
;
4412 /* If DECL has a gimple body, then the context for its
4413 arguments must be DECL. Otherwise, it doesn't really
4414 matter, as we will not be emitting any code for DECL. In
4415 general, there may be other instances of DECL created by
4416 the front end and since PARM_DECLs are generally shared,
4417 their DECL_CONTEXT changes as the replicas of DECL are
4418 created. The only time where DECL_CONTEXT is important
4419 is for the FUNCTION_DECLs that have a gimple body (since
4420 the PARM_DECL will be used in the function's body). */
4421 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4422 DECL_CONTEXT (t
) = decl
;
4424 /* Collect all the symbols declared in DECL. */
4425 locals
= pointer_set_create ();
4426 t
= DECL_STRUCT_FUNCTION (decl
)->local_decls
;
4427 for (; t
; t
= TREE_CHAIN (t
))
4429 pointer_set_insert (locals
, TREE_VALUE (t
));
4431 /* All the local symbols should have DECL as their
4433 DECL_CONTEXT (TREE_VALUE (t
)) = decl
;
4436 /* Get rid of any decl not in local_decls. */
4437 free_lang_data_in_block (decl
, DECL_INITIAL (decl
), locals
);
4439 pointer_set_destroy (locals
);
4442 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4443 At this point, it is not needed anymore. */
4444 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4446 else if (TREE_CODE (decl
) == VAR_DECL
)
4448 tree expr
= DECL_DEBUG_EXPR (decl
);
4450 && TREE_CODE (expr
) == VAR_DECL
4451 && !TREE_STATIC (expr
) && !DECL_EXTERNAL (expr
))
4452 SET_DECL_DEBUG_EXPR (decl
, NULL_TREE
);
4454 if (DECL_EXTERNAL (decl
)
4455 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4456 DECL_INITIAL (decl
) = NULL_TREE
;
4458 else if (TREE_CODE (decl
) == TYPE_DECL
)
4460 DECL_INITIAL (decl
) = NULL_TREE
;
4462 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4463 FIELD_DECLs, which should be preserved. Otherwise,
4464 we shouldn't be concerned with source-level lexical
4465 nesting beyond this point. */
4466 DECL_CONTEXT (decl
) = NULL_TREE
;
4471 /* Data used when collecting DECLs and TYPEs for language data removal. */
4473 struct free_lang_data_d
4475 /* Worklist to avoid excessive recursion. */
4476 VEC(tree
,heap
) *worklist
;
4478 /* Set of traversed objects. Used to avoid duplicate visits. */
4479 struct pointer_set_t
*pset
;
4481 /* Array of symbols to process with free_lang_data_in_decl. */
4482 VEC(tree
,heap
) *decls
;
4484 /* Array of types to process with free_lang_data_in_type. */
4485 VEC(tree
,heap
) *types
;
4489 /* Save all language fields needed to generate proper debug information
4490 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4493 save_debug_info_for_decl (tree t
)
4495 /*struct saved_debug_info_d *sdi;*/
4497 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4499 /* FIXME. Partial implementation for saving debug info removed. */
4503 /* Save all language fields needed to generate proper debug information
4504 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4507 save_debug_info_for_type (tree t
)
4509 /*struct saved_debug_info_d *sdi;*/
4511 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4513 /* FIXME. Partial implementation for saving debug info removed. */
4517 /* Add type or decl T to one of the list of tree nodes that need their
4518 language data removed. The lists are held inside FLD. */
4521 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4525 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4526 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4527 save_debug_info_for_decl (t
);
4529 else if (TYPE_P (t
))
4531 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4532 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4533 save_debug_info_for_type (t
);
4539 /* Push tree node T into FLD->WORKLIST. */
4542 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4544 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4545 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4549 /* Operand callback helper for free_lang_data_in_node. *TP is the
4550 subtree operand being considered. */
4553 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4556 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4558 if (TREE_CODE (t
) == TREE_LIST
)
4561 /* Language specific nodes will be removed, so there is no need
4562 to gather anything under them. */
4563 if (is_lang_specific (t
))
4571 /* Note that walk_tree does not traverse every possible field in
4572 decls, so we have to do our own traversals here. */
4573 add_tree_to_fld_list (t
, fld
);
4575 fld_worklist_push (DECL_NAME (t
), fld
);
4576 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4577 fld_worklist_push (DECL_SIZE (t
), fld
);
4578 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4580 /* We are going to remove everything under DECL_INITIAL for
4581 TYPE_DECLs. No point walking them. */
4582 if (TREE_CODE (t
) != TYPE_DECL
)
4583 fld_worklist_push (DECL_INITIAL (t
), fld
);
4585 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4586 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4588 if (TREE_CODE (t
) == FUNCTION_DECL
)
4590 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4591 fld_worklist_push (DECL_RESULT (t
), fld
);
4593 else if (TREE_CODE (t
) == TYPE_DECL
)
4595 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4596 fld_worklist_push (DECL_VINDEX (t
), fld
);
4598 else if (TREE_CODE (t
) == FIELD_DECL
)
4600 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4601 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4602 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4603 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4604 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4606 else if (TREE_CODE (t
) == VAR_DECL
)
4608 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4609 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4612 if (TREE_CODE (t
) != FIELD_DECL
)
4613 fld_worklist_push (TREE_CHAIN (t
), fld
);
4616 else if (TYPE_P (t
))
4618 /* Note that walk_tree does not traverse every possible field in
4619 types, so we have to do our own traversals here. */
4620 add_tree_to_fld_list (t
, fld
);
4622 if (!RECORD_OR_UNION_TYPE_P (t
))
4623 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4624 fld_worklist_push (TYPE_SIZE (t
), fld
);
4625 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4626 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4627 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4628 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4629 fld_worklist_push (TYPE_NAME (t
), fld
);
4630 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4631 if (!RECORD_OR_UNION_TYPE_P (t
))
4632 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4633 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4634 fld_worklist_push (TYPE_NEXT_VARIANT (t
), fld
);
4635 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4636 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
4638 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4642 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4644 fld_worklist_push (TREE_TYPE (tem
), fld
);
4645 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4648 fld_worklist_push (TREE_VALUE (tem
), fld
);
4649 tem
= TREE_CHAIN (tem
);
4652 if (RECORD_OR_UNION_TYPE_P (t
))
4655 /* Push all TYPE_FIELDS - there can be interleaving interesting
4656 and non-interesting things. */
4657 tem
= TYPE_FIELDS (t
);
4660 if (TREE_CODE (tem
) == FIELD_DECL
)
4661 fld_worklist_push (tem
, fld
);
4662 tem
= TREE_CHAIN (tem
);
4666 fld_worklist_push (TREE_CHAIN (t
), fld
);
4670 fld_worklist_push (TREE_TYPE (t
), fld
);
4676 /* Find decls and types in T. */
4679 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4683 if (!pointer_set_contains (fld
->pset
, t
))
4684 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4685 if (VEC_empty (tree
, fld
->worklist
))
4687 t
= VEC_pop (tree
, fld
->worklist
);
4691 /* Translate all the types in LIST with the corresponding runtime
4695 get_eh_types_for_runtime (tree list
)
4699 if (list
== NULL_TREE
)
4702 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4704 list
= TREE_CHAIN (list
);
4707 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4708 TREE_CHAIN (prev
) = n
;
4709 prev
= TREE_CHAIN (prev
);
4710 list
= TREE_CHAIN (list
);
4717 /* Find decls and types referenced in EH region R and store them in
4718 FLD->DECLS and FLD->TYPES. */
4721 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4732 /* The types referenced in each catch must first be changed to the
4733 EH types used at runtime. This removes references to FE types
4735 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4737 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4738 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4743 case ERT_ALLOWED_EXCEPTIONS
:
4744 r
->u
.allowed
.type_list
4745 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4746 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4749 case ERT_MUST_NOT_THROW
:
4750 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4751 find_decls_types_r
, fld
, fld
->pset
);
4757 /* Find decls and types referenced in cgraph node N and store them in
4758 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4759 look for *every* kind of DECL and TYPE node reachable from N,
4760 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4761 NAMESPACE_DECLs, etc). */
4764 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4767 struct function
*fn
;
4770 find_decls_types (n
->decl
, fld
);
4772 if (!gimple_has_body_p (n
->decl
))
4775 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
4777 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
4779 /* Traverse locals. */
4780 for (t
= fn
->local_decls
; t
; t
= TREE_CHAIN (t
))
4781 find_decls_types (TREE_VALUE (t
), fld
);
4783 /* Traverse EH regions in FN. */
4786 FOR_ALL_EH_REGION_FN (r
, fn
)
4787 find_decls_types_in_eh_region (r
, fld
);
4790 /* Traverse every statement in FN. */
4791 FOR_EACH_BB_FN (bb
, fn
)
4793 gimple_stmt_iterator si
;
4796 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
4798 gimple phi
= gsi_stmt (si
);
4800 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4802 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
4803 find_decls_types (*arg_p
, fld
);
4807 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
4809 gimple stmt
= gsi_stmt (si
);
4811 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
4813 tree arg
= gimple_op (stmt
, i
);
4814 find_decls_types (arg
, fld
);
4821 /* Find decls and types referenced in varpool node N and store them in
4822 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4823 look for *every* kind of DECL and TYPE node reachable from N,
4824 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4825 NAMESPACE_DECLs, etc). */
4828 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
4830 find_decls_types (v
->decl
, fld
);
4834 /* Free language specific information for every operand and expression
4835 in every node of the call graph. This process operates in three stages:
4837 1- Every callgraph node and varpool node is traversed looking for
4838 decls and types embedded in them. This is a more exhaustive
4839 search than that done by find_referenced_vars, because it will
4840 also collect individual fields, decls embedded in types, etc.
4842 2- All the decls found are sent to free_lang_data_in_decl.
4844 3- All the types found are sent to free_lang_data_in_type.
4846 The ordering between decls and types is important because
4847 free_lang_data_in_decl sets assembler names, which includes
4848 mangling. So types cannot be freed up until assembler names have
4852 free_lang_data_in_cgraph (void)
4854 struct cgraph_node
*n
;
4855 struct varpool_node
*v
;
4856 struct free_lang_data_d fld
;
4861 /* Initialize sets and arrays to store referenced decls and types. */
4862 fld
.pset
= pointer_set_create ();
4863 fld
.worklist
= NULL
;
4864 fld
.decls
= VEC_alloc (tree
, heap
, 100);
4865 fld
.types
= VEC_alloc (tree
, heap
, 100);
4867 /* Find decls and types in the body of every function in the callgraph. */
4868 for (n
= cgraph_nodes
; n
; n
= n
->next
)
4869 find_decls_types_in_node (n
, &fld
);
4871 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4872 find_decls_types (p
->decl
, &fld
);
4874 /* Find decls and types in every varpool symbol. */
4875 for (v
= varpool_nodes_queue
; v
; v
= v
->next_needed
)
4876 find_decls_types_in_var (v
, &fld
);
4878 /* Set the assembler name on every decl found. We need to do this
4879 now because free_lang_data_in_decl will invalidate data needed
4880 for mangling. This breaks mangling on interdependent decls. */
4881 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
4882 if (need_assembler_name_p (t
))
4884 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4885 diagnostics that use input_location to show locus
4886 information. The problem here is that, at this point,
4887 input_location is generally anchored to the end of the file
4888 (since the parser is long gone), so we don't have a good
4889 position to pin it to.
4891 To alleviate this problem, this uses the location of T's
4892 declaration. Examples of this are
4893 testsuite/g++.dg/template/cond2.C and
4894 testsuite/g++.dg/template/pr35240.C. */
4895 location_t saved_location
= input_location
;
4896 input_location
= DECL_SOURCE_LOCATION (t
);
4898 decl_assembler_name (t
);
4900 input_location
= saved_location
;
4903 /* Traverse every decl found freeing its language data. */
4904 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
4905 free_lang_data_in_decl (t
);
4907 /* Traverse every type found freeing its language data. */
4908 for (i
= 0; VEC_iterate (tree
, fld
.types
, i
, t
); i
++)
4909 free_lang_data_in_type (t
);
4911 pointer_set_destroy (fld
.pset
);
4912 VEC_free (tree
, heap
, fld
.worklist
);
4913 VEC_free (tree
, heap
, fld
.decls
);
4914 VEC_free (tree
, heap
, fld
.types
);
4918 /* Free resources that are used by FE but are not needed once they are done. */
4921 free_lang_data (void)
4923 /* Traverse the IL resetting language specific information for
4924 operands, expressions, etc. */
4925 free_lang_data_in_cgraph ();
4927 /* Create gimple variants for common types. */
4928 ptrdiff_type_node
= integer_type_node
;
4929 fileptr_type_node
= ptr_type_node
;
4930 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
4931 || (TYPE_MODE (boolean_type_node
)
4932 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
4933 || TYPE_PRECISION (boolean_type_node
) != 1
4934 || !TYPE_UNSIGNED (boolean_type_node
))
4936 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
4937 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
4938 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
4939 TYPE_PRECISION (boolean_type_node
) = 1;
4940 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
4941 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
4944 /* Unify char_type_node with its properly signed variant. */
4945 if (TYPE_UNSIGNED (char_type_node
))
4946 unsigned_char_type_node
= char_type_node
;
4948 signed_char_type_node
= char_type_node
;
4950 /* Reset some langhooks. */
4951 lang_hooks
.callgraph
.analyze_expr
= NULL
;
4952 lang_hooks
.types_compatible_p
= NULL
;
4953 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
4954 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
4955 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
4956 lang_hooks
.fold_obj_type_ref
= gimple_fold_obj_type_ref
;
4958 /* Reset diagnostic machinery. */
4959 diagnostic_starter (global_dc
) = default_diagnostic_starter
;
4960 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
4961 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
4963 /* FIXME. We remove sufficient language data that the debug
4964 info writer gets completely confused. Disable debug information
4966 debug_info_level
= DINFO_LEVEL_NONE
;
4967 write_symbols
= NO_DEBUG
;
4968 debug_hooks
= &do_nothing_debug_hooks
;
4974 /* Gate function for free_lang_data. */
4977 gate_free_lang_data (void)
4979 /* FIXME. Remove after save_debug_info is working. */
4980 return (flag_generate_lto
4982 && !flag_gtoggle
&& debug_info_level
<= DINFO_LEVEL_TERSE
));
4986 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
4991 gate_free_lang_data
, /* gate */
4992 free_lang_data
, /* execute */
4995 0, /* static_pass_number */
4996 TV_IPA_FREE_LANG_DATA
, /* tv_id */
4997 0, /* properties_required */
4998 0, /* properties_provided */
4999 0, /* properties_destroyed */
5000 0, /* todo_flags_start */
5001 TODO_ggc_collect
/* todo_flags_finish */
5005 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5008 We try both `text' and `__text__', ATTR may be either one. */
5009 /* ??? It might be a reasonable simplification to require ATTR to be only
5010 `text'. One might then also require attribute lists to be stored in
5011 their canonicalized form. */
5014 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5019 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5022 p
= IDENTIFIER_POINTER (ident
);
5023 ident_len
= IDENTIFIER_LENGTH (ident
);
5025 if (ident_len
== attr_len
5026 && strcmp (attr
, p
) == 0)
5029 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5032 gcc_assert (attr
[1] == '_');
5033 gcc_assert (attr
[attr_len
- 2] == '_');
5034 gcc_assert (attr
[attr_len
- 1] == '_');
5035 if (ident_len
== attr_len
- 4
5036 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5041 if (ident_len
== attr_len
+ 4
5042 && p
[0] == '_' && p
[1] == '_'
5043 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5044 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5051 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5054 We try both `text' and `__text__', ATTR may be either one. */
5057 is_attribute_p (const char *attr
, const_tree ident
)
5059 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5062 /* Given an attribute name and a list of attributes, return a pointer to the
5063 attribute's list element if the attribute is part of the list, or NULL_TREE
5064 if not found. If the attribute appears more than once, this only
5065 returns the first occurrence; the TREE_CHAIN of the return value should
5066 be passed back in if further occurrences are wanted. */
5069 lookup_attribute (const char *attr_name
, tree list
)
5072 size_t attr_len
= strlen (attr_name
);
5074 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5076 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5077 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5083 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5087 remove_attribute (const char *attr_name
, tree list
)
5090 size_t attr_len
= strlen (attr_name
);
5092 for (p
= &list
; *p
; )
5095 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5096 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5097 *p
= TREE_CHAIN (l
);
5099 p
= &TREE_CHAIN (l
);
5105 /* Return an attribute list that is the union of a1 and a2. */
5108 merge_attributes (tree a1
, tree a2
)
5112 /* Either one unset? Take the set one. */
5114 if ((attributes
= a1
) == 0)
5117 /* One that completely contains the other? Take it. */
5119 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5121 if (attribute_list_contained (a2
, a1
))
5125 /* Pick the longest list, and hang on the other list. */
5127 if (list_length (a1
) < list_length (a2
))
5128 attributes
= a2
, a2
= a1
;
5130 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5133 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5136 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5139 if (TREE_VALUE (a
) != NULL
5140 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
5141 && TREE_VALUE (a2
) != NULL
5142 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
5144 if (simple_cst_list_equal (TREE_VALUE (a
),
5145 TREE_VALUE (a2
)) == 1)
5148 else if (simple_cst_equal (TREE_VALUE (a
),
5149 TREE_VALUE (a2
)) == 1)
5154 a1
= copy_node (a2
);
5155 TREE_CHAIN (a1
) = attributes
;
5164 /* Given types T1 and T2, merge their attributes and return
5168 merge_type_attributes (tree t1
, tree t2
)
5170 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5171 TYPE_ATTRIBUTES (t2
));
5174 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5178 merge_decl_attributes (tree olddecl
, tree newdecl
)
5180 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5181 DECL_ATTRIBUTES (newdecl
));
5184 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5186 /* Specialization of merge_decl_attributes for various Windows targets.
5188 This handles the following situation:
5190 __declspec (dllimport) int foo;
5193 The second instance of `foo' nullifies the dllimport. */
5196 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5199 int delete_dllimport_p
= 1;
5201 /* What we need to do here is remove from `old' dllimport if it doesn't
5202 appear in `new'. dllimport behaves like extern: if a declaration is
5203 marked dllimport and a definition appears later, then the object
5204 is not dllimport'd. We also remove a `new' dllimport if the old list
5205 contains dllexport: dllexport always overrides dllimport, regardless
5206 of the order of declaration. */
5207 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5208 delete_dllimport_p
= 0;
5209 else if (DECL_DLLIMPORT_P (new_tree
)
5210 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5212 DECL_DLLIMPORT_P (new_tree
) = 0;
5213 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5214 "dllimport ignored", new_tree
);
5216 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5218 /* Warn about overriding a symbol that has already been used, e.g.:
5219 extern int __attribute__ ((dllimport)) foo;
5220 int* bar () {return &foo;}
5223 if (TREE_USED (old
))
5225 warning (0, "%q+D redeclared without dllimport attribute "
5226 "after being referenced with dll linkage", new_tree
);
5227 /* If we have used a variable's address with dllimport linkage,
5228 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5229 decl may already have had TREE_CONSTANT computed.
5230 We still remove the attribute so that assembler code refers
5231 to '&foo rather than '_imp__foo'. */
5232 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5233 DECL_DLLIMPORT_P (new_tree
) = 1;
5236 /* Let an inline definition silently override the external reference,
5237 but otherwise warn about attribute inconsistency. */
5238 else if (TREE_CODE (new_tree
) == VAR_DECL
5239 || !DECL_DECLARED_INLINE_P (new_tree
))
5240 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5241 "previous dllimport ignored", new_tree
);
5244 delete_dllimport_p
= 0;
5246 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5248 if (delete_dllimport_p
)
5251 const size_t attr_len
= strlen ("dllimport");
5253 /* Scan the list for dllimport and delete it. */
5254 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5256 if (is_attribute_with_length_p ("dllimport", attr_len
,
5259 if (prev
== NULL_TREE
)
5262 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5271 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5272 struct attribute_spec.handler. */
5275 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5281 /* These attributes may apply to structure and union types being created,
5282 but otherwise should pass to the declaration involved. */
5285 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5286 | (int) ATTR_FLAG_ARRAY_NEXT
))
5288 *no_add_attrs
= true;
5289 return tree_cons (name
, args
, NULL_TREE
);
5291 if (TREE_CODE (node
) == RECORD_TYPE
5292 || TREE_CODE (node
) == UNION_TYPE
)
5294 node
= TYPE_NAME (node
);
5300 warning (OPT_Wattributes
, "%qE attribute ignored",
5302 *no_add_attrs
= true;
5307 if (TREE_CODE (node
) != FUNCTION_DECL
5308 && TREE_CODE (node
) != VAR_DECL
5309 && TREE_CODE (node
) != TYPE_DECL
)
5311 *no_add_attrs
= true;
5312 warning (OPT_Wattributes
, "%qE attribute ignored",
5317 if (TREE_CODE (node
) == TYPE_DECL
5318 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5319 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5321 *no_add_attrs
= true;
5322 warning (OPT_Wattributes
, "%qE attribute ignored",
5327 is_dllimport
= is_attribute_p ("dllimport", name
);
5329 /* Report error on dllimport ambiguities seen now before they cause
5333 /* Honor any target-specific overrides. */
5334 if (!targetm
.valid_dllimport_attribute_p (node
))
5335 *no_add_attrs
= true;
5337 else if (TREE_CODE (node
) == FUNCTION_DECL
5338 && DECL_DECLARED_INLINE_P (node
))
5340 warning (OPT_Wattributes
, "inline function %q+D declared as "
5341 " dllimport: attribute ignored", node
);
5342 *no_add_attrs
= true;
5344 /* Like MS, treat definition of dllimported variables and
5345 non-inlined functions on declaration as syntax errors. */
5346 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5348 error ("function %q+D definition is marked dllimport", node
);
5349 *no_add_attrs
= true;
5352 else if (TREE_CODE (node
) == VAR_DECL
)
5354 if (DECL_INITIAL (node
))
5356 error ("variable %q+D definition is marked dllimport",
5358 *no_add_attrs
= true;
5361 /* `extern' needn't be specified with dllimport.
5362 Specify `extern' now and hope for the best. Sigh. */
5363 DECL_EXTERNAL (node
) = 1;
5364 /* Also, implicitly give dllimport'd variables declared within
5365 a function global scope, unless declared static. */
5366 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5367 TREE_PUBLIC (node
) = 1;
5370 if (*no_add_attrs
== false)
5371 DECL_DLLIMPORT_P (node
) = 1;
5373 else if (TREE_CODE (node
) == FUNCTION_DECL
5374 && DECL_DECLARED_INLINE_P (node
))
5375 /* An exported function, even if inline, must be emitted. */
5376 DECL_EXTERNAL (node
) = 0;
5378 /* Report error if symbol is not accessible at global scope. */
5379 if (!TREE_PUBLIC (node
)
5380 && (TREE_CODE (node
) == VAR_DECL
5381 || TREE_CODE (node
) == FUNCTION_DECL
))
5383 error ("external linkage required for symbol %q+D because of "
5384 "%qE attribute", node
, name
);
5385 *no_add_attrs
= true;
5388 /* A dllexport'd entity must have default visibility so that other
5389 program units (shared libraries or the main executable) can see
5390 it. A dllimport'd entity must have default visibility so that
5391 the linker knows that undefined references within this program
5392 unit can be resolved by the dynamic linker. */
5395 if (DECL_VISIBILITY_SPECIFIED (node
)
5396 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5397 error ("%qE implies default visibility, but %qD has already "
5398 "been declared with a different visibility",
5400 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5401 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5407 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5409 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5410 of the various TYPE_QUAL values. */
5413 set_type_quals (tree type
, int type_quals
)
5415 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5416 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5417 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5420 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5423 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5425 return (TYPE_QUALS (cand
) == type_quals
5426 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5427 /* Apparently this is needed for Objective-C. */
5428 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5429 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5430 TYPE_ATTRIBUTES (base
)));
5433 /* Return a version of the TYPE, qualified as indicated by the
5434 TYPE_QUALS, if one exists. If no qualified version exists yet,
5435 return NULL_TREE. */
5438 get_qualified_type (tree type
, int type_quals
)
5442 if (TYPE_QUALS (type
) == type_quals
)
5445 /* Search the chain of variants to see if there is already one there just
5446 like the one we need to have. If so, use that existing one. We must
5447 preserve the TYPE_NAME, since there is code that depends on this. */
5448 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5449 if (check_qualified_type (t
, type
, type_quals
))
5455 /* Like get_qualified_type, but creates the type if it does not
5456 exist. This function never returns NULL_TREE. */
5459 build_qualified_type (tree type
, int type_quals
)
5463 /* See if we already have the appropriate qualified variant. */
5464 t
= get_qualified_type (type
, type_quals
);
5466 /* If not, build it. */
5469 t
= build_variant_type_copy (type
);
5470 set_type_quals (t
, type_quals
);
5472 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5473 /* Propagate structural equality. */
5474 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5475 else if (TYPE_CANONICAL (type
) != type
)
5476 /* Build the underlying canonical type, since it is different
5478 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5481 /* T is its own canonical type. */
5482 TYPE_CANONICAL (t
) = t
;
5489 /* Create a new distinct copy of TYPE. The new type is made its own
5490 MAIN_VARIANT. If TYPE requires structural equality checks, the
5491 resulting type requires structural equality checks; otherwise, its
5492 TYPE_CANONICAL points to itself. */
5495 build_distinct_type_copy (tree type
)
5497 tree t
= copy_node (type
);
5499 TYPE_POINTER_TO (t
) = 0;
5500 TYPE_REFERENCE_TO (t
) = 0;
5502 /* Set the canonical type either to a new equivalence class, or
5503 propagate the need for structural equality checks. */
5504 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5505 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5507 TYPE_CANONICAL (t
) = t
;
5509 /* Make it its own variant. */
5510 TYPE_MAIN_VARIANT (t
) = t
;
5511 TYPE_NEXT_VARIANT (t
) = 0;
5513 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5514 whose TREE_TYPE is not t. This can also happen in the Ada
5515 frontend when using subtypes. */
5520 /* Create a new variant of TYPE, equivalent but distinct. This is so
5521 the caller can modify it. TYPE_CANONICAL for the return type will
5522 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5523 are considered equal by the language itself (or that both types
5524 require structural equality checks). */
5527 build_variant_type_copy (tree type
)
5529 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5531 t
= build_distinct_type_copy (type
);
5533 /* Since we're building a variant, assume that it is a non-semantic
5534 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5535 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5537 /* Add the new type to the chain of variants of TYPE. */
5538 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5539 TYPE_NEXT_VARIANT (m
) = t
;
5540 TYPE_MAIN_VARIANT (t
) = m
;
5545 /* Return true if the from tree in both tree maps are equal. */
5548 tree_map_base_eq (const void *va
, const void *vb
)
5550 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5551 *const b
= (const struct tree_map_base
*) vb
;
5552 return (a
->from
== b
->from
);
5555 /* Hash a from tree in a tree_map. */
5558 tree_map_base_hash (const void *item
)
5560 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5563 /* Return true if this tree map structure is marked for garbage collection
5564 purposes. We simply return true if the from tree is marked, so that this
5565 structure goes away when the from tree goes away. */
5568 tree_map_base_marked_p (const void *p
)
5570 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5574 tree_map_hash (const void *item
)
5576 return (((const struct tree_map
*) item
)->hash
);
5579 /* Return the initialization priority for DECL. */
5582 decl_init_priority_lookup (tree decl
)
5584 struct tree_priority_map
*h
;
5585 struct tree_map_base in
;
5587 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5589 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5590 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5593 /* Return the finalization priority for DECL. */
5596 decl_fini_priority_lookup (tree decl
)
5598 struct tree_priority_map
*h
;
5599 struct tree_map_base in
;
5601 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5603 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5604 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5607 /* Return the initialization and finalization priority information for
5608 DECL. If there is no previous priority information, a freshly
5609 allocated structure is returned. */
5611 static struct tree_priority_map
*
5612 decl_priority_info (tree decl
)
5614 struct tree_priority_map in
;
5615 struct tree_priority_map
*h
;
5618 in
.base
.from
= decl
;
5619 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5620 h
= (struct tree_priority_map
*) *loc
;
5623 h
= GGC_CNEW (struct tree_priority_map
);
5625 h
->base
.from
= decl
;
5626 h
->init
= DEFAULT_INIT_PRIORITY
;
5627 h
->fini
= DEFAULT_INIT_PRIORITY
;
5633 /* Set the initialization priority for DECL to PRIORITY. */
5636 decl_init_priority_insert (tree decl
, priority_type priority
)
5638 struct tree_priority_map
*h
;
5640 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5641 h
= decl_priority_info (decl
);
5645 /* Set the finalization priority for DECL to PRIORITY. */
5648 decl_fini_priority_insert (tree decl
, priority_type priority
)
5650 struct tree_priority_map
*h
;
5652 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5653 h
= decl_priority_info (decl
);
5657 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5660 print_debug_expr_statistics (void)
5662 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5663 (long) htab_size (debug_expr_for_decl
),
5664 (long) htab_elements (debug_expr_for_decl
),
5665 htab_collisions (debug_expr_for_decl
));
5668 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5671 print_value_expr_statistics (void)
5673 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5674 (long) htab_size (value_expr_for_decl
),
5675 (long) htab_elements (value_expr_for_decl
),
5676 htab_collisions (value_expr_for_decl
));
5679 /* Lookup a debug expression for FROM, and return it if we find one. */
5682 decl_debug_expr_lookup (tree from
)
5684 struct tree_map
*h
, in
;
5685 in
.base
.from
= from
;
5687 h
= (struct tree_map
*) htab_find_with_hash (debug_expr_for_decl
, &in
,
5688 htab_hash_pointer (from
));
5694 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5697 decl_debug_expr_insert (tree from
, tree to
)
5702 h
= GGC_NEW (struct tree_map
);
5703 h
->hash
= htab_hash_pointer (from
);
5704 h
->base
.from
= from
;
5706 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
5707 *(struct tree_map
**) loc
= h
;
5710 /* Lookup a value expression for FROM, and return it if we find one. */
5713 decl_value_expr_lookup (tree from
)
5715 struct tree_map
*h
, in
;
5716 in
.base
.from
= from
;
5718 h
= (struct tree_map
*) htab_find_with_hash (value_expr_for_decl
, &in
,
5719 htab_hash_pointer (from
));
5725 /* Insert a mapping FROM->TO in the value expression hashtable. */
5728 decl_value_expr_insert (tree from
, tree to
)
5733 h
= GGC_NEW (struct tree_map
);
5734 h
->hash
= htab_hash_pointer (from
);
5735 h
->base
.from
= from
;
5737 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
5738 *(struct tree_map
**) loc
= h
;
5741 /* Hashing of types so that we don't make duplicates.
5742 The entry point is `type_hash_canon'. */
5744 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5745 with types in the TREE_VALUE slots), by adding the hash codes
5746 of the individual types. */
5749 type_hash_list (const_tree list
, hashval_t hashcode
)
5753 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5754 if (TREE_VALUE (tail
) != error_mark_node
)
5755 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
5761 /* These are the Hashtable callback functions. */
5763 /* Returns true iff the types are equivalent. */
5766 type_hash_eq (const void *va
, const void *vb
)
5768 const struct type_hash
*const a
= (const struct type_hash
*) va
,
5769 *const b
= (const struct type_hash
*) vb
;
5771 /* First test the things that are the same for all types. */
5772 if (a
->hash
!= b
->hash
5773 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
5774 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
5775 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
5776 TYPE_ATTRIBUTES (b
->type
))
5777 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
5778 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)
5779 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
5780 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
5783 switch (TREE_CODE (a
->type
))
5788 case REFERENCE_TYPE
:
5792 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
5795 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
5796 && !(TYPE_VALUES (a
->type
)
5797 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
5798 && TYPE_VALUES (b
->type
)
5799 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
5800 && type_list_equal (TYPE_VALUES (a
->type
),
5801 TYPE_VALUES (b
->type
))))
5804 /* ... fall through ... */
5809 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
5810 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
5811 TYPE_MAX_VALUE (b
->type
)))
5812 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
5813 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
5814 TYPE_MIN_VALUE (b
->type
))));
5816 case FIXED_POINT_TYPE
:
5817 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
5820 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
5823 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
5824 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5825 || (TYPE_ARG_TYPES (a
->type
)
5826 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5827 && TYPE_ARG_TYPES (b
->type
)
5828 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5829 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5830 TYPE_ARG_TYPES (b
->type
)))));
5833 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
5837 case QUAL_UNION_TYPE
:
5838 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
5839 || (TYPE_FIELDS (a
->type
)
5840 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
5841 && TYPE_FIELDS (b
->type
)
5842 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
5843 && type_list_equal (TYPE_FIELDS (a
->type
),
5844 TYPE_FIELDS (b
->type
))));
5847 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5848 || (TYPE_ARG_TYPES (a
->type
)
5849 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5850 && TYPE_ARG_TYPES (b
->type
)
5851 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5852 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5853 TYPE_ARG_TYPES (b
->type
))))
5861 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
5862 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
5867 /* Return the cached hash value. */
5870 type_hash_hash (const void *item
)
5872 return ((const struct type_hash
*) item
)->hash
;
5875 /* Look in the type hash table for a type isomorphic to TYPE.
5876 If one is found, return it. Otherwise return 0. */
5879 type_hash_lookup (hashval_t hashcode
, tree type
)
5881 struct type_hash
*h
, in
;
5883 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5884 must call that routine before comparing TYPE_ALIGNs. */
5890 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
5897 /* Add an entry to the type-hash-table
5898 for a type TYPE whose hash code is HASHCODE. */
5901 type_hash_add (hashval_t hashcode
, tree type
)
5903 struct type_hash
*h
;
5906 h
= GGC_NEW (struct type_hash
);
5909 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
5913 /* Given TYPE, and HASHCODE its hash code, return the canonical
5914 object for an identical type if one already exists.
5915 Otherwise, return TYPE, and record it as the canonical object.
5917 To use this function, first create a type of the sort you want.
5918 Then compute its hash code from the fields of the type that
5919 make it different from other similar types.
5920 Then call this function and use the value. */
5923 type_hash_canon (unsigned int hashcode
, tree type
)
5927 /* The hash table only contains main variants, so ensure that's what we're
5929 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
5931 if (!lang_hooks
.types
.hash_types
)
5934 /* See if the type is in the hash table already. If so, return it.
5935 Otherwise, add the type. */
5936 t1
= type_hash_lookup (hashcode
, type
);
5939 #ifdef GATHER_STATISTICS
5940 tree_node_counts
[(int) t_kind
]--;
5941 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
5947 type_hash_add (hashcode
, type
);
5952 /* See if the data pointed to by the type hash table is marked. We consider
5953 it marked if the type is marked or if a debug type number or symbol
5954 table entry has been made for the type. This reduces the amount of
5955 debugging output and eliminates that dependency of the debug output on
5956 the number of garbage collections. */
5959 type_hash_marked_p (const void *p
)
5961 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
5963 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
5967 print_type_hash_statistics (void)
5969 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
5970 (long) htab_size (type_hash_table
),
5971 (long) htab_elements (type_hash_table
),
5972 htab_collisions (type_hash_table
));
5975 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
5976 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
5977 by adding the hash codes of the individual attributes. */
5980 attribute_hash_list (const_tree list
, hashval_t hashcode
)
5984 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5985 /* ??? Do we want to add in TREE_VALUE too? */
5986 hashcode
= iterative_hash_object
5987 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
5991 /* Given two lists of attributes, return true if list l2 is
5992 equivalent to l1. */
5995 attribute_list_equal (const_tree l1
, const_tree l2
)
5997 return attribute_list_contained (l1
, l2
)
5998 && attribute_list_contained (l2
, l1
);
6001 /* Given two lists of attributes, return true if list L2 is
6002 completely contained within L1. */
6003 /* ??? This would be faster if attribute names were stored in a canonicalized
6004 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6005 must be used to show these elements are equivalent (which they are). */
6006 /* ??? It's not clear that attributes with arguments will always be handled
6010 attribute_list_contained (const_tree l1
, const_tree l2
)
6014 /* First check the obvious, maybe the lists are identical. */
6018 /* Maybe the lists are similar. */
6019 for (t1
= l1
, t2
= l2
;
6021 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6022 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6023 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6025 /* Maybe the lists are equal. */
6026 if (t1
== 0 && t2
== 0)
6029 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6032 /* This CONST_CAST is okay because lookup_attribute does not
6033 modify its argument and the return value is assigned to a
6035 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6036 CONST_CAST_TREE(l1
));
6038 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6041 if (TREE_VALUE (t2
) != NULL
6042 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
6043 && TREE_VALUE (attr
) != NULL
6044 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
6046 if (simple_cst_list_equal (TREE_VALUE (t2
),
6047 TREE_VALUE (attr
)) == 1)
6050 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
6061 /* Given two lists of types
6062 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6063 return 1 if the lists contain the same types in the same order.
6064 Also, the TREE_PURPOSEs must match. */
6067 type_list_equal (const_tree l1
, const_tree l2
)
6071 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6072 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6073 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6074 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6075 && (TREE_TYPE (TREE_PURPOSE (t1
))
6076 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6082 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6083 given by TYPE. If the argument list accepts variable arguments,
6084 then this function counts only the ordinary arguments. */
6087 type_num_arguments (const_tree type
)
6092 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6093 /* If the function does not take a variable number of arguments,
6094 the last element in the list will have type `void'. */
6095 if (VOID_TYPE_P (TREE_VALUE (t
)))
6103 /* Nonzero if integer constants T1 and T2
6104 represent the same constant value. */
6107 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6112 if (t1
== 0 || t2
== 0)
6115 if (TREE_CODE (t1
) == INTEGER_CST
6116 && TREE_CODE (t2
) == INTEGER_CST
6117 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6118 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6124 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6125 The precise way of comparison depends on their data type. */
6128 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6133 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6135 int t1_sgn
= tree_int_cst_sgn (t1
);
6136 int t2_sgn
= tree_int_cst_sgn (t2
);
6138 if (t1_sgn
< t2_sgn
)
6140 else if (t1_sgn
> t2_sgn
)
6142 /* Otherwise, both are non-negative, so we compare them as
6143 unsigned just in case one of them would overflow a signed
6146 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6147 return INT_CST_LT (t1
, t2
);
6149 return INT_CST_LT_UNSIGNED (t1
, t2
);
6152 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6155 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6157 if (tree_int_cst_lt (t1
, t2
))
6159 else if (tree_int_cst_lt (t2
, t1
))
6165 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6166 the host. If POS is zero, the value can be represented in a single
6167 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6168 be represented in a single unsigned HOST_WIDE_INT. */
6171 host_integerp (const_tree t
, int pos
)
6176 return (TREE_CODE (t
) == INTEGER_CST
6177 && ((TREE_INT_CST_HIGH (t
) == 0
6178 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6179 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6180 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6181 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6182 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6183 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6184 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6187 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6188 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6189 be non-negative. We must be able to satisfy the above conditions. */
6192 tree_low_cst (const_tree t
, int pos
)
6194 gcc_assert (host_integerp (t
, pos
));
6195 return TREE_INT_CST_LOW (t
);
6198 /* Return the most significant bit of the integer constant T. */
6201 tree_int_cst_msb (const_tree t
)
6205 unsigned HOST_WIDE_INT l
;
6207 /* Note that using TYPE_PRECISION here is wrong. We care about the
6208 actual bits, not the (arbitrary) range of the type. */
6209 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6210 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6211 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6212 return (l
& 1) == 1;
6215 /* Return an indication of the sign of the integer constant T.
6216 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6217 Note that -1 will never be returned if T's type is unsigned. */
6220 tree_int_cst_sgn (const_tree t
)
6222 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6224 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6226 else if (TREE_INT_CST_HIGH (t
) < 0)
6232 /* Return the minimum number of bits needed to represent VALUE in a
6233 signed or unsigned type, UNSIGNEDP says which. */
6236 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6240 /* If the value is negative, compute its negative minus 1. The latter
6241 adjustment is because the absolute value of the largest negative value
6242 is one larger than the largest positive value. This is equivalent to
6243 a bit-wise negation, so use that operation instead. */
6245 if (tree_int_cst_sgn (value
) < 0)
6246 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6248 /* Return the number of bits needed, taking into account the fact
6249 that we need one more bit for a signed than unsigned type. */
6251 if (integer_zerop (value
))
6254 log
= tree_floor_log2 (value
);
6256 return log
+ 1 + !unsignedp
;
6259 /* Compare two constructor-element-type constants. Return 1 if the lists
6260 are known to be equal; otherwise return 0. */
6263 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6265 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6267 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6270 l1
= TREE_CHAIN (l1
);
6271 l2
= TREE_CHAIN (l2
);
6277 /* Return truthvalue of whether T1 is the same tree structure as T2.
6278 Return 1 if they are the same.
6279 Return 0 if they are understandably different.
6280 Return -1 if either contains tree structure not understood by
6284 simple_cst_equal (const_tree t1
, const_tree t2
)
6286 enum tree_code code1
, code2
;
6292 if (t1
== 0 || t2
== 0)
6295 code1
= TREE_CODE (t1
);
6296 code2
= TREE_CODE (t2
);
6298 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6300 if (CONVERT_EXPR_CODE_P (code2
)
6301 || code2
== NON_LVALUE_EXPR
)
6302 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6304 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6307 else if (CONVERT_EXPR_CODE_P (code2
)
6308 || code2
== NON_LVALUE_EXPR
)
6309 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6317 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6318 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6321 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6324 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6327 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6328 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6329 TREE_STRING_LENGTH (t1
)));
6333 unsigned HOST_WIDE_INT idx
;
6334 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6335 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6337 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6340 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6341 /* ??? Should we handle also fields here? */
6342 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6343 VEC_index (constructor_elt
, v2
, idx
)->value
))
6349 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6352 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6355 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6358 const_tree arg1
, arg2
;
6359 const_call_expr_arg_iterator iter1
, iter2
;
6360 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6361 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6363 arg1
= next_const_call_expr_arg (&iter1
),
6364 arg2
= next_const_call_expr_arg (&iter2
))
6366 cmp
= simple_cst_equal (arg1
, arg2
);
6370 return arg1
== arg2
;
6374 /* Special case: if either target is an unallocated VAR_DECL,
6375 it means that it's going to be unified with whatever the
6376 TARGET_EXPR is really supposed to initialize, so treat it
6377 as being equivalent to anything. */
6378 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6379 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6380 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6381 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6382 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6383 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6386 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6391 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6393 case WITH_CLEANUP_EXPR
:
6394 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6398 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6401 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6402 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6416 /* This general rule works for most tree codes. All exceptions should be
6417 handled above. If this is a language-specific tree code, we can't
6418 trust what might be in the operand, so say we don't know
6420 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6423 switch (TREE_CODE_CLASS (code1
))
6427 case tcc_comparison
:
6428 case tcc_expression
:
6432 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6434 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6446 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6447 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6448 than U, respectively. */
6451 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6453 if (tree_int_cst_sgn (t
) < 0)
6455 else if (TREE_INT_CST_HIGH (t
) != 0)
6457 else if (TREE_INT_CST_LOW (t
) == u
)
6459 else if (TREE_INT_CST_LOW (t
) < u
)
6465 /* Return true if CODE represents an associative tree code. Otherwise
6468 associative_tree_code (enum tree_code code
)
6487 /* Return true if CODE represents a commutative tree code. Otherwise
6490 commutative_tree_code (enum tree_code code
)
6503 case UNORDERED_EXPR
:
6507 case TRUTH_AND_EXPR
:
6508 case TRUTH_XOR_EXPR
:
6518 /* Generate a hash value for an expression. This can be used iteratively
6519 by passing a previous result as the VAL argument.
6521 This function is intended to produce the same hash for expressions which
6522 would compare equal using operand_equal_p. */
6525 iterative_hash_expr (const_tree t
, hashval_t val
)
6528 enum tree_code code
;
6532 return iterative_hash_hashval_t (0, val
);
6534 code
= TREE_CODE (t
);
6538 /* Alas, constants aren't shared, so we can't rely on pointer
6541 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6542 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6545 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6547 return iterative_hash_hashval_t (val2
, val
);
6551 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6553 return iterative_hash_hashval_t (val2
, val
);
6556 return iterative_hash (TREE_STRING_POINTER (t
),
6557 TREE_STRING_LENGTH (t
), val
);
6559 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6560 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6562 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6565 /* we can just compare by pointer. */
6566 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6569 /* A list of expressions, for a CALL_EXPR or as the elements of a
6571 for (; t
; t
= TREE_CHAIN (t
))
6572 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6576 unsigned HOST_WIDE_INT idx
;
6578 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6580 val
= iterative_hash_expr (field
, val
);
6581 val
= iterative_hash_expr (value
, val
);
6586 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6587 Otherwise nodes that compare equal according to operand_equal_p might
6588 get different hash codes. However, don't do this for machine specific
6589 or front end builtins, since the function code is overloaded in those
6591 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6592 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6594 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6595 code
= TREE_CODE (t
);
6599 tclass
= TREE_CODE_CLASS (code
);
6601 if (tclass
== tcc_declaration
)
6603 /* DECL's have a unique ID */
6604 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6608 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6610 val
= iterative_hash_object (code
, val
);
6612 /* Don't hash the type, that can lead to having nodes which
6613 compare equal according to operand_equal_p, but which
6614 have different hash codes. */
6615 if (CONVERT_EXPR_CODE_P (code
)
6616 || code
== NON_LVALUE_EXPR
)
6618 /* Make sure to include signness in the hash computation. */
6619 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6620 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6623 else if (commutative_tree_code (code
))
6625 /* It's a commutative expression. We want to hash it the same
6626 however it appears. We do this by first hashing both operands
6627 and then rehashing based on the order of their independent
6629 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6630 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6634 t
= one
, one
= two
, two
= t
;
6636 val
= iterative_hash_hashval_t (one
, val
);
6637 val
= iterative_hash_hashval_t (two
, val
);
6640 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6641 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6648 /* Generate a hash value for a pair of expressions. This can be used
6649 iteratively by passing a previous result as the VAL argument.
6651 The same hash value is always returned for a given pair of expressions,
6652 regardless of the order in which they are presented. This is useful in
6653 hashing the operands of commutative functions. */
6656 iterative_hash_exprs_commutative (const_tree t1
,
6657 const_tree t2
, hashval_t val
)
6659 hashval_t one
= iterative_hash_expr (t1
, 0);
6660 hashval_t two
= iterative_hash_expr (t2
, 0);
6664 t
= one
, one
= two
, two
= t
;
6665 val
= iterative_hash_hashval_t (one
, val
);
6666 val
= iterative_hash_hashval_t (two
, val
);
6671 /* Constructors for pointer, array and function types.
6672 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6673 constructed by language-dependent code, not here.) */
6675 /* Construct, lay out and return the type of pointers to TO_TYPE with
6676 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6677 reference all of memory. If such a type has already been
6678 constructed, reuse it. */
6681 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6686 if (to_type
== error_mark_node
)
6687 return error_mark_node
;
6689 /* If the pointed-to type has the may_alias attribute set, force
6690 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6691 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6692 can_alias_all
= true;
6694 /* In some cases, languages will have things that aren't a POINTER_TYPE
6695 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6696 In that case, return that type without regard to the rest of our
6699 ??? This is a kludge, but consistent with the way this function has
6700 always operated and there doesn't seem to be a good way to avoid this
6702 if (TYPE_POINTER_TO (to_type
) != 0
6703 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6704 return TYPE_POINTER_TO (to_type
);
6706 /* First, if we already have a type for pointers to TO_TYPE and it's
6707 the proper mode, use it. */
6708 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6709 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6712 t
= make_node (POINTER_TYPE
);
6714 TREE_TYPE (t
) = to_type
;
6715 SET_TYPE_MODE (t
, mode
);
6716 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6717 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6718 TYPE_POINTER_TO (to_type
) = t
;
6720 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6721 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6722 else if (TYPE_CANONICAL (to_type
) != to_type
)
6724 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
6725 mode
, can_alias_all
);
6727 /* Lay out the type. This function has many callers that are concerned
6728 with expression-construction, and this simplifies them all. */
6734 /* By default build pointers in ptr_mode. */
6737 build_pointer_type (tree to_type
)
6739 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
6742 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6745 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
6750 if (to_type
== error_mark_node
)
6751 return error_mark_node
;
6753 /* If the pointed-to type has the may_alias attribute set, force
6754 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6755 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6756 can_alias_all
= true;
6758 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6759 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6760 In that case, return that type without regard to the rest of our
6763 ??? This is a kludge, but consistent with the way this function has
6764 always operated and there doesn't seem to be a good way to avoid this
6766 if (TYPE_REFERENCE_TO (to_type
) != 0
6767 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
6768 return TYPE_REFERENCE_TO (to_type
);
6770 /* First, if we already have a type for pointers to TO_TYPE and it's
6771 the proper mode, use it. */
6772 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
6773 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6776 t
= make_node (REFERENCE_TYPE
);
6778 TREE_TYPE (t
) = to_type
;
6779 SET_TYPE_MODE (t
, mode
);
6780 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6781 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
6782 TYPE_REFERENCE_TO (to_type
) = t
;
6784 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6785 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6786 else if (TYPE_CANONICAL (to_type
) != to_type
)
6788 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
6789 mode
, can_alias_all
);
6797 /* Build the node for the type of references-to-TO_TYPE by default
6801 build_reference_type (tree to_type
)
6803 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
6806 /* Build a type that is compatible with t but has no cv quals anywhere
6809 const char *const *const * -> char ***. */
6812 build_type_no_quals (tree t
)
6814 switch (TREE_CODE (t
))
6817 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6819 TYPE_REF_CAN_ALIAS_ALL (t
));
6820 case REFERENCE_TYPE
:
6822 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6824 TYPE_REF_CAN_ALIAS_ALL (t
));
6826 return TYPE_MAIN_VARIANT (t
);
6830 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6831 MAXVAL should be the maximum value in the domain
6832 (one less than the length of the array).
6834 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6835 We don't enforce this limit, that is up to caller (e.g. language front end).
6836 The limit exists because the result is a signed type and we don't handle
6837 sizes that use more than one HOST_WIDE_INT. */
6840 build_index_type (tree maxval
)
6842 tree itype
= make_node (INTEGER_TYPE
);
6844 TREE_TYPE (itype
) = sizetype
;
6845 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
6846 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6847 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
6848 SET_TYPE_MODE (itype
, TYPE_MODE (sizetype
));
6849 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
6850 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
6851 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
6852 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
6854 if (host_integerp (maxval
, 1))
6855 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
6858 /* Since we cannot hash this type, we need to compare it using
6859 structural equality checks. */
6860 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
6865 /* Builds a signed or unsigned integer type of precision PRECISION.
6866 Used for C bitfields whose precision does not match that of
6867 built-in target types. */
6869 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
6872 tree itype
= make_node (INTEGER_TYPE
);
6874 TYPE_PRECISION (itype
) = precision
;
6877 fixup_unsigned_type (itype
);
6879 fixup_signed_type (itype
);
6881 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
6882 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
6887 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
6888 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
6889 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
6892 build_range_type (tree type
, tree lowval
, tree highval
)
6894 tree itype
= make_node (INTEGER_TYPE
);
6896 TREE_TYPE (itype
) = type
;
6897 if (type
== NULL_TREE
)
6900 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
6901 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
6903 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
6904 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
6905 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
6906 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
6907 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
6908 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
6910 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
6911 return type_hash_canon (tree_low_cst (highval
, 0)
6912 - tree_low_cst (lowval
, 0),
6918 /* Return true if the debug information for TYPE, a subtype, should be emitted
6919 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
6920 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
6921 debug info and doesn't reflect the source code. */
6924 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
6926 tree base_type
= TREE_TYPE (type
), low
, high
;
6928 /* Subrange types have a base type which is an integral type. */
6929 if (!INTEGRAL_TYPE_P (base_type
))
6932 /* Get the real bounds of the subtype. */
6933 if (lang_hooks
.types
.get_subrange_bounds
)
6934 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
6937 low
= TYPE_MIN_VALUE (type
);
6938 high
= TYPE_MAX_VALUE (type
);
6941 /* If the type and its base type have the same representation and the same
6942 name, then the type is not a subrange but a copy of the base type. */
6943 if ((TREE_CODE (base_type
) == INTEGER_TYPE
6944 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
6945 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
6946 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
6947 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
6949 tree type_name
= TYPE_NAME (type
);
6950 tree base_type_name
= TYPE_NAME (base_type
);
6952 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
6953 type_name
= DECL_NAME (type_name
);
6955 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
6956 base_type_name
= DECL_NAME (base_type_name
);
6958 if (type_name
== base_type_name
)
6969 /* Just like build_index_type, but takes lowval and highval instead
6970 of just highval (maxval). */
6973 build_index_2_type (tree lowval
, tree highval
)
6975 return build_range_type (sizetype
, lowval
, highval
);
6978 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
6979 and number of elements specified by the range of values of INDEX_TYPE.
6980 If such a type has already been constructed, reuse it. */
6983 build_array_type (tree elt_type
, tree index_type
)
6986 hashval_t hashcode
= 0;
6988 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
6990 error ("arrays of functions are not meaningful");
6991 elt_type
= integer_type_node
;
6994 t
= make_node (ARRAY_TYPE
);
6995 TREE_TYPE (t
) = elt_type
;
6996 TYPE_DOMAIN (t
) = index_type
;
6999 /* If the element type is incomplete at this point we get marked for
7000 structural equality. Do not record these types in the canonical
7002 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7005 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
7007 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7008 t
= type_hash_canon (hashcode
, t
);
7010 if (TYPE_CANONICAL (t
) == t
)
7012 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7013 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7014 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7015 else if (TYPE_CANONICAL (elt_type
) != elt_type
7016 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7018 = build_array_type (TYPE_CANONICAL (elt_type
),
7019 index_type
? TYPE_CANONICAL (index_type
) : NULL
);
7025 /* Recursively examines the array elements of TYPE, until a non-array
7026 element type is found. */
7029 strip_array_types (tree type
)
7031 while (TREE_CODE (type
) == ARRAY_TYPE
)
7032 type
= TREE_TYPE (type
);
7037 /* Computes the canonical argument types from the argument type list
7040 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7041 on entry to this function, or if any of the ARGTYPES are
7044 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7045 true on entry to this function, or if any of the ARGTYPES are
7048 Returns a canonical argument list, which may be ARGTYPES when the
7049 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7050 true) or would not differ from ARGTYPES. */
7053 maybe_canonicalize_argtypes(tree argtypes
,
7054 bool *any_structural_p
,
7055 bool *any_noncanonical_p
)
7058 bool any_noncanonical_argtypes_p
= false;
7060 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7062 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7063 /* Fail gracefully by stating that the type is structural. */
7064 *any_structural_p
= true;
7065 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7066 *any_structural_p
= true;
7067 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7068 || TREE_PURPOSE (arg
))
7069 /* If the argument has a default argument, we consider it
7070 non-canonical even though the type itself is canonical.
7071 That way, different variants of function and method types
7072 with default arguments will all point to the variant with
7073 no defaults as their canonical type. */
7074 any_noncanonical_argtypes_p
= true;
7077 if (*any_structural_p
)
7080 if (any_noncanonical_argtypes_p
)
7082 /* Build the canonical list of argument types. */
7083 tree canon_argtypes
= NULL_TREE
;
7084 bool is_void
= false;
7086 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7088 if (arg
== void_list_node
)
7091 canon_argtypes
= tree_cons (NULL_TREE
,
7092 TYPE_CANONICAL (TREE_VALUE (arg
)),
7096 canon_argtypes
= nreverse (canon_argtypes
);
7098 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7100 /* There is a non-canonical type. */
7101 *any_noncanonical_p
= true;
7102 return canon_argtypes
;
7105 /* The canonical argument types are the same as ARGTYPES. */
7109 /* Construct, lay out and return
7110 the type of functions returning type VALUE_TYPE
7111 given arguments of types ARG_TYPES.
7112 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7113 are data type nodes for the arguments of the function.
7114 If such a type has already been constructed, reuse it. */
7117 build_function_type (tree value_type
, tree arg_types
)
7120 hashval_t hashcode
= 0;
7121 bool any_structural_p
, any_noncanonical_p
;
7122 tree canon_argtypes
;
7124 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7126 error ("function return type cannot be function");
7127 value_type
= integer_type_node
;
7130 /* Make a node of the sort we want. */
7131 t
= make_node (FUNCTION_TYPE
);
7132 TREE_TYPE (t
) = value_type
;
7133 TYPE_ARG_TYPES (t
) = arg_types
;
7135 /* If we already have such a type, use the old one. */
7136 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7137 hashcode
= type_hash_list (arg_types
, hashcode
);
7138 t
= type_hash_canon (hashcode
, t
);
7140 /* Set up the canonical type. */
7141 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7142 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7143 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7145 &any_noncanonical_p
);
7146 if (any_structural_p
)
7147 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7148 else if (any_noncanonical_p
)
7149 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7152 if (!COMPLETE_TYPE_P (t
))
7157 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7160 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7162 tree new_type
= NULL
;
7163 tree args
, new_args
= NULL
, t
;
7167 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7168 args
= TREE_CHAIN (args
), i
++)
7169 if (!bitmap_bit_p (args_to_skip
, i
))
7170 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7172 new_reversed
= nreverse (new_args
);
7176 TREE_CHAIN (new_args
) = void_list_node
;
7178 new_reversed
= void_list_node
;
7181 /* Use copy_node to preserve as much as possible from original type
7182 (debug info, attribute lists etc.)
7183 Exception is METHOD_TYPEs must have THIS argument.
7184 When we are asked to remove it, we need to build new FUNCTION_TYPE
7186 if (TREE_CODE (orig_type
) != METHOD_TYPE
7187 || !bitmap_bit_p (args_to_skip
, 0))
7189 new_type
= copy_node (orig_type
);
7190 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7195 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7197 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7200 /* This is a new type, not a copy of an old type. Need to reassociate
7201 variants. We can handle everything except the main variant lazily. */
7202 t
= TYPE_MAIN_VARIANT (orig_type
);
7205 TYPE_MAIN_VARIANT (new_type
) = t
;
7206 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7207 TYPE_NEXT_VARIANT (t
) = new_type
;
7211 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7212 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7217 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7219 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7220 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
7221 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7224 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7226 tree new_decl
= copy_node (orig_decl
);
7229 new_type
= TREE_TYPE (orig_decl
);
7230 if (prototype_p (new_type
))
7231 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7232 TREE_TYPE (new_decl
) = new_type
;
7234 /* For declarations setting DECL_VINDEX (i.e. methods)
7235 we expect first argument to be THIS pointer. */
7236 if (bitmap_bit_p (args_to_skip
, 0))
7237 DECL_VINDEX (new_decl
) = NULL_TREE
;
7241 /* Build a function type. The RETURN_TYPE is the type returned by the
7242 function. If VAARGS is set, no void_type_node is appended to the
7243 the list. ARGP muse be alway be terminated be a NULL_TREE. */
7246 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7250 t
= va_arg (argp
, tree
);
7251 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7252 args
= tree_cons (NULL_TREE
, t
, args
);
7257 if (args
!= NULL_TREE
)
7258 args
= nreverse (args
);
7259 gcc_assert (args
!= NULL_TREE
&& last
!= void_list_node
);
7261 else if (args
== NULL_TREE
)
7262 args
= void_list_node
;
7266 args
= nreverse (args
);
7267 TREE_CHAIN (last
) = void_list_node
;
7269 args
= build_function_type (return_type
, args
);
7274 /* Build a function type. The RETURN_TYPE is the type returned by the
7275 function. If additional arguments are provided, they are
7276 additional argument types. The list of argument types must always
7277 be terminated by NULL_TREE. */
7280 build_function_type_list (tree return_type
, ...)
7285 va_start (p
, return_type
);
7286 args
= build_function_type_list_1 (false, return_type
, p
);
7291 /* Build a variable argument function type. The RETURN_TYPE is the
7292 type returned by the function. If additional arguments are provided,
7293 they are additional argument types. The list of argument types must
7294 always be terminated by NULL_TREE. */
7297 build_varargs_function_type_list (tree return_type
, ...)
7302 va_start (p
, return_type
);
7303 args
= build_function_type_list_1 (true, return_type
, p
);
7309 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7310 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7311 for the method. An implicit additional parameter (of type
7312 pointer-to-BASETYPE) is added to the ARGTYPES. */
7315 build_method_type_directly (tree basetype
,
7322 bool any_structural_p
, any_noncanonical_p
;
7323 tree canon_argtypes
;
7325 /* Make a node of the sort we want. */
7326 t
= make_node (METHOD_TYPE
);
7328 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7329 TREE_TYPE (t
) = rettype
;
7330 ptype
= build_pointer_type (basetype
);
7332 /* The actual arglist for this function includes a "hidden" argument
7333 which is "this". Put it into the list of argument types. */
7334 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7335 TYPE_ARG_TYPES (t
) = argtypes
;
7337 /* If we already have such a type, use the old one. */
7338 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7339 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7340 hashcode
= type_hash_list (argtypes
, hashcode
);
7341 t
= type_hash_canon (hashcode
, t
);
7343 /* Set up the canonical type. */
7345 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7346 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7348 = (TYPE_CANONICAL (basetype
) != basetype
7349 || TYPE_CANONICAL (rettype
) != rettype
);
7350 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7352 &any_noncanonical_p
);
7353 if (any_structural_p
)
7354 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7355 else if (any_noncanonical_p
)
7357 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7358 TYPE_CANONICAL (rettype
),
7360 if (!COMPLETE_TYPE_P (t
))
7366 /* Construct, lay out and return the type of methods belonging to class
7367 BASETYPE and whose arguments and values are described by TYPE.
7368 If that type exists already, reuse it.
7369 TYPE must be a FUNCTION_TYPE node. */
7372 build_method_type (tree basetype
, tree type
)
7374 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7376 return build_method_type_directly (basetype
,
7378 TYPE_ARG_TYPES (type
));
7381 /* Construct, lay out and return the type of offsets to a value
7382 of type TYPE, within an object of type BASETYPE.
7383 If a suitable offset type exists already, reuse it. */
7386 build_offset_type (tree basetype
, tree type
)
7389 hashval_t hashcode
= 0;
7391 /* Make a node of the sort we want. */
7392 t
= make_node (OFFSET_TYPE
);
7394 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7395 TREE_TYPE (t
) = type
;
7397 /* If we already have such a type, use the old one. */
7398 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7399 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7400 t
= type_hash_canon (hashcode
, t
);
7402 if (!COMPLETE_TYPE_P (t
))
7405 if (TYPE_CANONICAL (t
) == t
)
7407 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7408 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7409 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7410 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7411 || TYPE_CANONICAL (type
) != type
)
7413 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7414 TYPE_CANONICAL (type
));
7420 /* Create a complex type whose components are COMPONENT_TYPE. */
7423 build_complex_type (tree component_type
)
7428 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7429 || SCALAR_FLOAT_TYPE_P (component_type
)
7430 || FIXED_POINT_TYPE_P (component_type
));
7432 /* Make a node of the sort we want. */
7433 t
= make_node (COMPLEX_TYPE
);
7435 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7437 /* If we already have such a type, use the old one. */
7438 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7439 t
= type_hash_canon (hashcode
, t
);
7441 if (!COMPLETE_TYPE_P (t
))
7444 if (TYPE_CANONICAL (t
) == t
)
7446 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7447 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7448 else if (TYPE_CANONICAL (component_type
) != component_type
)
7450 = build_complex_type (TYPE_CANONICAL (component_type
));
7453 /* We need to create a name, since complex is a fundamental type. */
7454 if (! TYPE_NAME (t
))
7457 if (component_type
== char_type_node
)
7458 name
= "complex char";
7459 else if (component_type
== signed_char_type_node
)
7460 name
= "complex signed char";
7461 else if (component_type
== unsigned_char_type_node
)
7462 name
= "complex unsigned char";
7463 else if (component_type
== short_integer_type_node
)
7464 name
= "complex short int";
7465 else if (component_type
== short_unsigned_type_node
)
7466 name
= "complex short unsigned int";
7467 else if (component_type
== integer_type_node
)
7468 name
= "complex int";
7469 else if (component_type
== unsigned_type_node
)
7470 name
= "complex unsigned int";
7471 else if (component_type
== long_integer_type_node
)
7472 name
= "complex long int";
7473 else if (component_type
== long_unsigned_type_node
)
7474 name
= "complex long unsigned int";
7475 else if (component_type
== long_long_integer_type_node
)
7476 name
= "complex long long int";
7477 else if (component_type
== long_long_unsigned_type_node
)
7478 name
= "complex long long unsigned int";
7483 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7484 get_identifier (name
), t
);
7487 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7490 /* If TYPE is a real or complex floating-point type and the target
7491 does not directly support arithmetic on TYPE then return the wider
7492 type to be used for arithmetic on TYPE. Otherwise, return
7496 excess_precision_type (tree type
)
7498 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7500 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7501 switch (TREE_CODE (type
))
7504 switch (flt_eval_method
)
7507 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7508 return double_type_node
;
7511 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7512 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7513 return long_double_type_node
;
7520 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7522 switch (flt_eval_method
)
7525 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7526 return complex_double_type_node
;
7529 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7530 || (TYPE_MODE (TREE_TYPE (type
))
7531 == TYPE_MODE (double_type_node
)))
7532 return complex_long_double_type_node
;
7545 /* Return OP, stripped of any conversions to wider types as much as is safe.
7546 Converting the value back to OP's type makes a value equivalent to OP.
7548 If FOR_TYPE is nonzero, we return a value which, if converted to
7549 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7551 OP must have integer, real or enumeral type. Pointers are not allowed!
7553 There are some cases where the obvious value we could return
7554 would regenerate to OP if converted to OP's type,
7555 but would not extend like OP to wider types.
7556 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7557 For example, if OP is (unsigned short)(signed char)-1,
7558 we avoid returning (signed char)-1 if FOR_TYPE is int,
7559 even though extending that to an unsigned short would regenerate OP,
7560 since the result of extending (signed char)-1 to (int)
7561 is different from (int) OP. */
7564 get_unwidened (tree op
, tree for_type
)
7566 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7567 tree type
= TREE_TYPE (op
);
7569 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7571 = (for_type
!= 0 && for_type
!= type
7572 && final_prec
> TYPE_PRECISION (type
)
7573 && TYPE_UNSIGNED (type
));
7576 while (CONVERT_EXPR_P (op
))
7580 /* TYPE_PRECISION on vector types has different meaning
7581 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7582 so avoid them here. */
7583 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7586 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7587 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7589 /* Truncations are many-one so cannot be removed.
7590 Unless we are later going to truncate down even farther. */
7592 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7595 /* See what's inside this conversion. If we decide to strip it,
7597 op
= TREE_OPERAND (op
, 0);
7599 /* If we have not stripped any zero-extensions (uns is 0),
7600 we can strip any kind of extension.
7601 If we have previously stripped a zero-extension,
7602 only zero-extensions can safely be stripped.
7603 Any extension can be stripped if the bits it would produce
7604 are all going to be discarded later by truncating to FOR_TYPE. */
7608 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7610 /* TYPE_UNSIGNED says whether this is a zero-extension.
7611 Let's avoid computing it if it does not affect WIN
7612 and if UNS will not be needed again. */
7614 || CONVERT_EXPR_P (op
))
7615 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7626 /* Return OP or a simpler expression for a narrower value
7627 which can be sign-extended or zero-extended to give back OP.
7628 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7629 or 0 if the value should be sign-extended. */
7632 get_narrower (tree op
, int *unsignedp_ptr
)
7637 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7639 while (TREE_CODE (op
) == NOP_EXPR
)
7642 = (TYPE_PRECISION (TREE_TYPE (op
))
7643 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
7645 /* Truncations are many-one so cannot be removed. */
7649 /* See what's inside this conversion. If we decide to strip it,
7654 op
= TREE_OPERAND (op
, 0);
7655 /* An extension: the outermost one can be stripped,
7656 but remember whether it is zero or sign extension. */
7658 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7659 /* Otherwise, if a sign extension has been stripped,
7660 only sign extensions can now be stripped;
7661 if a zero extension has been stripped, only zero-extensions. */
7662 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
7666 else /* bitschange == 0 */
7668 /* A change in nominal type can always be stripped, but we must
7669 preserve the unsignedness. */
7671 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7673 op
= TREE_OPERAND (op
, 0);
7674 /* Keep trying to narrow, but don't assign op to win if it
7675 would turn an integral type into something else. */
7676 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
7683 if (TREE_CODE (op
) == COMPONENT_REF
7684 /* Since type_for_size always gives an integer type. */
7685 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
7686 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
7687 /* Ensure field is laid out already. */
7688 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
7689 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
7691 unsigned HOST_WIDE_INT innerprec
7692 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
7693 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
7694 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
7695 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
7697 /* We can get this structure field in a narrower type that fits it,
7698 but the resulting extension to its nominal type (a fullword type)
7699 must satisfy the same conditions as for other extensions.
7701 Do this only for fields that are aligned (not bit-fields),
7702 because when bit-field insns will be used there is no
7703 advantage in doing this. */
7705 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
7706 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
7707 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
7711 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
7712 win
= fold_convert (type
, op
);
7716 *unsignedp_ptr
= uns
;
7720 /* Nonzero if integer constant C has a value that is permissible
7721 for type TYPE (an INTEGER_TYPE). */
7724 int_fits_type_p (const_tree c
, const_tree type
)
7726 tree type_low_bound
, type_high_bound
;
7727 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
7730 dc
= tree_to_double_int (c
);
7731 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
7733 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
7734 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
7736 /* So c is an unsigned integer whose type is sizetype and type is not.
7737 sizetype'd integers are sign extended even though they are
7738 unsigned. If the integer value fits in the lower end word of c,
7739 and if the higher end word has all its bits set to 1, that
7740 means the higher end bits are set to 1 only for sign extension.
7741 So let's convert c into an equivalent zero extended unsigned
7743 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
7746 type_low_bound
= TYPE_MIN_VALUE (type
);
7747 type_high_bound
= TYPE_MAX_VALUE (type
);
7749 /* If at least one bound of the type is a constant integer, we can check
7750 ourselves and maybe make a decision. If no such decision is possible, but
7751 this type is a subtype, try checking against that. Otherwise, use
7752 fit_double_type, which checks against the precision.
7754 Compute the status for each possibly constant bound, and return if we see
7755 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7756 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7757 for "constant known to fit". */
7759 /* Check if c >= type_low_bound. */
7760 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
7762 dd
= tree_to_double_int (type_low_bound
);
7763 if (TREE_CODE (type
) == INTEGER_TYPE
7764 && TYPE_IS_SIZETYPE (type
)
7765 && TYPE_UNSIGNED (type
))
7766 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7767 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
7769 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7770 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7772 if (c_neg
&& !t_neg
)
7774 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
7777 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
7779 ok_for_low_bound
= true;
7782 ok_for_low_bound
= false;
7784 /* Check if c <= type_high_bound. */
7785 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
7787 dd
= tree_to_double_int (type_high_bound
);
7788 if (TREE_CODE (type
) == INTEGER_TYPE
7789 && TYPE_IS_SIZETYPE (type
)
7790 && TYPE_UNSIGNED (type
))
7791 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7792 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
7794 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7795 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7797 if (t_neg
&& !c_neg
)
7799 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
7802 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
7804 ok_for_high_bound
= true;
7807 ok_for_high_bound
= false;
7809 /* If the constant fits both bounds, the result is known. */
7810 if (ok_for_low_bound
&& ok_for_high_bound
)
7813 /* Perform some generic filtering which may allow making a decision
7814 even if the bounds are not constant. First, negative integers
7815 never fit in unsigned types, */
7816 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
7819 /* Second, narrower types always fit in wider ones. */
7820 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
7823 /* Third, unsigned integers with top bit set never fit signed types. */
7824 if (! TYPE_UNSIGNED (type
) && unsc
)
7826 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
7827 if (prec
< HOST_BITS_PER_WIDE_INT
)
7829 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
7832 else if (((((unsigned HOST_WIDE_INT
) 1)
7833 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
7837 /* If we haven't been able to decide at this point, there nothing more we
7838 can check ourselves here. Look at the base type if we have one and it
7839 has the same precision. */
7840 if (TREE_CODE (type
) == INTEGER_TYPE
7841 && TREE_TYPE (type
) != 0
7842 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
7844 type
= TREE_TYPE (type
);
7848 /* Or to fit_double_type, if nothing else. */
7849 return !fit_double_type (dc
.low
, dc
.high
, &dc
.low
, &dc
.high
, type
);
7852 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
7853 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
7854 represented (assuming two's-complement arithmetic) within the bit
7855 precision of the type are returned instead. */
7858 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
7860 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
7861 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
7862 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
7863 TYPE_UNSIGNED (type
));
7866 if (TYPE_UNSIGNED (type
))
7867 mpz_set_ui (min
, 0);
7871 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
7872 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
7873 TYPE_PRECISION (type
));
7874 mpz_set_double_int (min
, mn
, false);
7878 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
7879 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
7880 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
7881 TYPE_UNSIGNED (type
));
7884 if (TYPE_UNSIGNED (type
))
7885 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
7888 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
7893 /* Return true if VAR is an automatic variable defined in function FN. */
7896 auto_var_in_fn_p (const_tree var
, const_tree fn
)
7898 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
7899 && (((TREE_CODE (var
) == VAR_DECL
|| TREE_CODE (var
) == PARM_DECL
)
7900 && ! TREE_STATIC (var
))
7901 || TREE_CODE (var
) == LABEL_DECL
7902 || TREE_CODE (var
) == RESULT_DECL
));
7905 /* Subprogram of following function. Called by walk_tree.
7907 Return *TP if it is an automatic variable or parameter of the
7908 function passed in as DATA. */
7911 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
7913 tree fn
= (tree
) data
;
7918 else if (DECL_P (*tp
)
7919 && auto_var_in_fn_p (*tp
, fn
))
7925 /* Returns true if T is, contains, or refers to a type with variable
7926 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
7927 arguments, but not the return type. If FN is nonzero, only return
7928 true if a modifier of the type or position of FN is a variable or
7929 parameter inside FN.
7931 This concept is more general than that of C99 'variably modified types':
7932 in C99, a struct type is never variably modified because a VLA may not
7933 appear as a structure member. However, in GNU C code like:
7935 struct S { int i[f()]; };
7937 is valid, and other languages may define similar constructs. */
7940 variably_modified_type_p (tree type
, tree fn
)
7944 /* Test if T is either variable (if FN is zero) or an expression containing
7945 a variable in FN. */
7946 #define RETURN_TRUE_IF_VAR(T) \
7947 do { tree _t = (T); \
7948 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
7949 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
7950 return true; } while (0)
7952 if (type
== error_mark_node
)
7955 /* If TYPE itself has variable size, it is variably modified. */
7956 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
7957 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
7959 switch (TREE_CODE (type
))
7962 case REFERENCE_TYPE
:
7964 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
7970 /* If TYPE is a function type, it is variably modified if the
7971 return type is variably modified. */
7972 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
7978 case FIXED_POINT_TYPE
:
7981 /* Scalar types are variably modified if their end points
7983 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
7984 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
7989 case QUAL_UNION_TYPE
:
7990 /* We can't see if any of the fields are variably-modified by the
7991 definition we normally use, since that would produce infinite
7992 recursion via pointers. */
7993 /* This is variably modified if some field's type is. */
7994 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
7995 if (TREE_CODE (t
) == FIELD_DECL
)
7997 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
7998 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
7999 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8001 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8002 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8007 /* Do not call ourselves to avoid infinite recursion. This is
8008 variably modified if the element type is. */
8009 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8010 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8017 /* The current language may have other cases to check, but in general,
8018 all other types are not variably modified. */
8019 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8021 #undef RETURN_TRUE_IF_VAR
8024 /* Given a DECL or TYPE, return the scope in which it was declared, or
8025 NULL_TREE if there is no containing scope. */
8028 get_containing_scope (const_tree t
)
8030 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8033 /* Return the innermost context enclosing DECL that is
8034 a FUNCTION_DECL, or zero if none. */
8037 decl_function_context (const_tree decl
)
8041 if (TREE_CODE (decl
) == ERROR_MARK
)
8044 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8045 where we look up the function at runtime. Such functions always take
8046 a first argument of type 'pointer to real context'.
8048 C++ should really be fixed to use DECL_CONTEXT for the real context,
8049 and use something else for the "virtual context". */
8050 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8053 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8055 context
= DECL_CONTEXT (decl
);
8057 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8059 if (TREE_CODE (context
) == BLOCK
)
8060 context
= BLOCK_SUPERCONTEXT (context
);
8062 context
= get_containing_scope (context
);
8068 /* Return the innermost context enclosing DECL that is
8069 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8070 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8073 decl_type_context (const_tree decl
)
8075 tree context
= DECL_CONTEXT (decl
);
8078 switch (TREE_CODE (context
))
8080 case NAMESPACE_DECL
:
8081 case TRANSLATION_UNIT_DECL
:
8086 case QUAL_UNION_TYPE
:
8091 context
= DECL_CONTEXT (context
);
8095 context
= BLOCK_SUPERCONTEXT (context
);
8105 /* CALL is a CALL_EXPR. Return the declaration for the function
8106 called, or NULL_TREE if the called function cannot be
8110 get_callee_fndecl (const_tree call
)
8114 if (call
== error_mark_node
)
8115 return error_mark_node
;
8117 /* It's invalid to call this function with anything but a
8119 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8121 /* The first operand to the CALL is the address of the function
8123 addr
= CALL_EXPR_FN (call
);
8127 /* If this is a readonly function pointer, extract its initial value. */
8128 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8129 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8130 && DECL_INITIAL (addr
))
8131 addr
= DECL_INITIAL (addr
);
8133 /* If the address is just `&f' for some function `f', then we know
8134 that `f' is being called. */
8135 if (TREE_CODE (addr
) == ADDR_EXPR
8136 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8137 return TREE_OPERAND (addr
, 0);
8139 /* We couldn't figure out what was being called. */
8143 /* Print debugging information about tree nodes generated during the compile,
8144 and any language-specific information. */
8147 dump_tree_statistics (void)
8149 #ifdef GATHER_STATISTICS
8151 int total_nodes
, total_bytes
;
8154 fprintf (stderr
, "\n??? tree nodes created\n\n");
8155 #ifdef GATHER_STATISTICS
8156 fprintf (stderr
, "Kind Nodes Bytes\n");
8157 fprintf (stderr
, "---------------------------------------\n");
8158 total_nodes
= total_bytes
= 0;
8159 for (i
= 0; i
< (int) all_kinds
; i
++)
8161 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8162 tree_node_counts
[i
], tree_node_sizes
[i
]);
8163 total_nodes
+= tree_node_counts
[i
];
8164 total_bytes
+= tree_node_sizes
[i
];
8166 fprintf (stderr
, "---------------------------------------\n");
8167 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8168 fprintf (stderr
, "---------------------------------------\n");
8169 ssanames_print_statistics ();
8170 phinodes_print_statistics ();
8172 fprintf (stderr
, "(No per-node statistics)\n");
8174 print_type_hash_statistics ();
8175 print_debug_expr_statistics ();
8176 print_value_expr_statistics ();
8177 lang_hooks
.print_statistics ();
8180 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8182 /* Generate a crc32 of a string. */
8185 crc32_string (unsigned chksum
, const char *string
)
8189 unsigned value
= *string
<< 24;
8192 for (ix
= 8; ix
--; value
<<= 1)
8196 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8205 /* P is a string that will be used in a symbol. Mask out any characters
8206 that are not valid in that context. */
8209 clean_symbol_name (char *p
)
8213 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8216 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8223 /* Generate a name for a special-purpose function function.
8224 The generated name may need to be unique across the whole link.
8225 TYPE is some string to identify the purpose of this function to the
8226 linker or collect2; it must start with an uppercase letter,
8228 I - for constructors
8230 N - for C++ anonymous namespaces
8231 F - for DWARF unwind frame information. */
8234 get_file_function_name (const char *type
)
8240 /* If we already have a name we know to be unique, just use that. */
8241 if (first_global_object_name
)
8242 p
= q
= ASTRDUP (first_global_object_name
);
8243 /* If the target is handling the constructors/destructors, they
8244 will be local to this file and the name is only necessary for
8245 debugging purposes. */
8246 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8248 const char *file
= main_input_filename
;
8250 file
= input_filename
;
8251 /* Just use the file's basename, because the full pathname
8252 might be quite long. */
8253 p
= strrchr (file
, '/');
8258 p
= q
= ASTRDUP (p
);
8262 /* Otherwise, the name must be unique across the entire link.
8263 We don't have anything that we know to be unique to this translation
8264 unit, so use what we do have and throw in some randomness. */
8266 const char *name
= weak_global_object_name
;
8267 const char *file
= main_input_filename
;
8272 file
= input_filename
;
8274 len
= strlen (file
);
8275 q
= (char *) alloca (9 * 2 + len
+ 1);
8276 memcpy (q
, file
, len
+ 1);
8278 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8279 crc32_string (0, get_random_seed (false)));
8284 clean_symbol_name (q
);
8285 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8288 /* Set up the name of the file-level functions we may need.
8289 Use a global object (which is already required to be unique over
8290 the program) rather than the file name (which imposes extra
8292 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8294 return get_identifier (buf
);
8297 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8299 /* Complain that the tree code of NODE does not match the expected 0
8300 terminated list of trailing codes. The trailing code list can be
8301 empty, for a more vague error message. FILE, LINE, and FUNCTION
8302 are of the caller. */
8305 tree_check_failed (const_tree node
, const char *file
,
8306 int line
, const char *function
, ...)
8310 unsigned length
= 0;
8313 va_start (args
, function
);
8314 while ((code
= va_arg (args
, int)))
8315 length
+= 4 + strlen (tree_code_name
[code
]);
8320 va_start (args
, function
);
8321 length
+= strlen ("expected ");
8322 buffer
= tmp
= (char *) alloca (length
);
8324 while ((code
= va_arg (args
, int)))
8326 const char *prefix
= length
? " or " : "expected ";
8328 strcpy (tmp
+ length
, prefix
);
8329 length
+= strlen (prefix
);
8330 strcpy (tmp
+ length
, tree_code_name
[code
]);
8331 length
+= strlen (tree_code_name
[code
]);
8336 buffer
= "unexpected node";
8338 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8339 buffer
, tree_code_name
[TREE_CODE (node
)],
8340 function
, trim_filename (file
), line
);
8343 /* Complain that the tree code of NODE does match the expected 0
8344 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8348 tree_not_check_failed (const_tree node
, const char *file
,
8349 int line
, const char *function
, ...)
8353 unsigned length
= 0;
8356 va_start (args
, function
);
8357 while ((code
= va_arg (args
, int)))
8358 length
+= 4 + strlen (tree_code_name
[code
]);
8360 va_start (args
, function
);
8361 buffer
= (char *) alloca (length
);
8363 while ((code
= va_arg (args
, int)))
8367 strcpy (buffer
+ length
, " or ");
8370 strcpy (buffer
+ length
, tree_code_name
[code
]);
8371 length
+= strlen (tree_code_name
[code
]);
8375 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8376 buffer
, tree_code_name
[TREE_CODE (node
)],
8377 function
, trim_filename (file
), line
);
8380 /* Similar to tree_check_failed, except that we check for a class of tree
8381 code, given in CL. */
8384 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8385 const char *file
, int line
, const char *function
)
8388 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8389 TREE_CODE_CLASS_STRING (cl
),
8390 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8391 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8394 /* Similar to tree_check_failed, except that instead of specifying a
8395 dozen codes, use the knowledge that they're all sequential. */
8398 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8399 const char *function
, enum tree_code c1
,
8403 unsigned length
= 0;
8406 for (c
= c1
; c
<= c2
; ++c
)
8407 length
+= 4 + strlen (tree_code_name
[c
]);
8409 length
+= strlen ("expected ");
8410 buffer
= (char *) alloca (length
);
8413 for (c
= c1
; c
<= c2
; ++c
)
8415 const char *prefix
= length
? " or " : "expected ";
8417 strcpy (buffer
+ length
, prefix
);
8418 length
+= strlen (prefix
);
8419 strcpy (buffer
+ length
, tree_code_name
[c
]);
8420 length
+= strlen (tree_code_name
[c
]);
8423 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8424 buffer
, tree_code_name
[TREE_CODE (node
)],
8425 function
, trim_filename (file
), line
);
8429 /* Similar to tree_check_failed, except that we check that a tree does
8430 not have the specified code, given in CL. */
8433 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8434 const char *file
, int line
, const char *function
)
8437 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8438 TREE_CODE_CLASS_STRING (cl
),
8439 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8440 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8444 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8447 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8448 const char *function
, enum omp_clause_code code
)
8450 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8451 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8452 function
, trim_filename (file
), line
);
8456 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8459 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8460 const char *function
, enum omp_clause_code c1
,
8461 enum omp_clause_code c2
)
8464 unsigned length
= 0;
8467 for (c
= c1
; c
<= c2
; ++c
)
8468 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8470 length
+= strlen ("expected ");
8471 buffer
= (char *) alloca (length
);
8474 for (c
= c1
; c
<= c2
; ++c
)
8476 const char *prefix
= length
? " or " : "expected ";
8478 strcpy (buffer
+ length
, prefix
);
8479 length
+= strlen (prefix
);
8480 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8481 length
+= strlen (omp_clause_code_name
[c
]);
8484 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8485 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8486 function
, trim_filename (file
), line
);
8490 #undef DEFTREESTRUCT
8491 #define DEFTREESTRUCT(VAL, NAME) NAME,
8493 static const char *ts_enum_names
[] = {
8494 #include "treestruct.def"
8496 #undef DEFTREESTRUCT
8498 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8500 /* Similar to tree_class_check_failed, except that we check for
8501 whether CODE contains the tree structure identified by EN. */
8504 tree_contains_struct_check_failed (const_tree node
,
8505 const enum tree_node_structure_enum en
,
8506 const char *file
, int line
,
8507 const char *function
)
8510 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8512 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8516 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8517 (dynamically sized) vector. */
8520 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8521 const char *function
)
8524 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8525 idx
+ 1, len
, function
, trim_filename (file
), line
);
8528 /* Similar to above, except that the check is for the bounds of the operand
8529 vector of an expression node EXP. */
8532 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8533 int line
, const char *function
)
8535 int code
= TREE_CODE (exp
);
8537 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8538 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8539 function
, trim_filename (file
), line
);
8542 /* Similar to above, except that the check is for the number of
8543 operands of an OMP_CLAUSE node. */
8546 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8547 int line
, const char *function
)
8550 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8551 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8552 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8553 trim_filename (file
), line
);
8555 #endif /* ENABLE_TREE_CHECKING */
8557 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8558 and mapped to the machine mode MODE. Initialize its fields and build
8559 the information necessary for debugging output. */
8562 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8565 hashval_t hashcode
= 0;
8567 t
= make_node (VECTOR_TYPE
);
8568 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8569 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8570 SET_TYPE_MODE (t
, mode
);
8572 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8573 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8574 else if (TYPE_CANONICAL (innertype
) != innertype
8575 || mode
!= VOIDmode
)
8577 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8582 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
8583 tree array
= build_array_type (TYPE_MAIN_VARIANT (innertype
),
8584 build_index_type (index
));
8585 tree rt
= make_node (RECORD_TYPE
);
8587 TYPE_FIELDS (rt
) = build_decl (UNKNOWN_LOCATION
, FIELD_DECL
,
8588 get_identifier ("f"), array
);
8589 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
8591 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
8592 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8593 the representation type, and we want to find that die when looking up
8594 the vector type. This is most easily achieved by making the TYPE_UID
8596 TYPE_UID (rt
) = TYPE_UID (t
);
8599 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8600 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8601 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8602 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8603 t
= type_hash_canon (hashcode
, t
);
8605 /* We have built a main variant, based on the main variant of the
8606 inner type. Use it to build the variant we return. */
8607 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8608 && TREE_TYPE (t
) != innertype
)
8609 return build_type_attribute_qual_variant (t
,
8610 TYPE_ATTRIBUTES (innertype
),
8611 TYPE_QUALS (innertype
));
8617 make_or_reuse_type (unsigned size
, int unsignedp
)
8619 if (size
== INT_TYPE_SIZE
)
8620 return unsignedp
? unsigned_type_node
: integer_type_node
;
8621 if (size
== CHAR_TYPE_SIZE
)
8622 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8623 if (size
== SHORT_TYPE_SIZE
)
8624 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8625 if (size
== LONG_TYPE_SIZE
)
8626 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8627 if (size
== LONG_LONG_TYPE_SIZE
)
8628 return (unsignedp
? long_long_unsigned_type_node
8629 : long_long_integer_type_node
);
8632 return make_unsigned_type (size
);
8634 return make_signed_type (size
);
8637 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8640 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8644 if (size
== SHORT_FRACT_TYPE_SIZE
)
8645 return unsignedp
? sat_unsigned_short_fract_type_node
8646 : sat_short_fract_type_node
;
8647 if (size
== FRACT_TYPE_SIZE
)
8648 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8649 if (size
== LONG_FRACT_TYPE_SIZE
)
8650 return unsignedp
? sat_unsigned_long_fract_type_node
8651 : sat_long_fract_type_node
;
8652 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8653 return unsignedp
? sat_unsigned_long_long_fract_type_node
8654 : sat_long_long_fract_type_node
;
8658 if (size
== SHORT_FRACT_TYPE_SIZE
)
8659 return unsignedp
? unsigned_short_fract_type_node
8660 : short_fract_type_node
;
8661 if (size
== FRACT_TYPE_SIZE
)
8662 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
8663 if (size
== LONG_FRACT_TYPE_SIZE
)
8664 return unsignedp
? unsigned_long_fract_type_node
8665 : long_fract_type_node
;
8666 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8667 return unsignedp
? unsigned_long_long_fract_type_node
8668 : long_long_fract_type_node
;
8671 return make_fract_type (size
, unsignedp
, satp
);
8674 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8677 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
8681 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8682 return unsignedp
? sat_unsigned_short_accum_type_node
8683 : sat_short_accum_type_node
;
8684 if (size
== ACCUM_TYPE_SIZE
)
8685 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
8686 if (size
== LONG_ACCUM_TYPE_SIZE
)
8687 return unsignedp
? sat_unsigned_long_accum_type_node
8688 : sat_long_accum_type_node
;
8689 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8690 return unsignedp
? sat_unsigned_long_long_accum_type_node
8691 : sat_long_long_accum_type_node
;
8695 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8696 return unsignedp
? unsigned_short_accum_type_node
8697 : short_accum_type_node
;
8698 if (size
== ACCUM_TYPE_SIZE
)
8699 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
8700 if (size
== LONG_ACCUM_TYPE_SIZE
)
8701 return unsignedp
? unsigned_long_accum_type_node
8702 : long_accum_type_node
;
8703 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8704 return unsignedp
? unsigned_long_long_accum_type_node
8705 : long_long_accum_type_node
;
8708 return make_accum_type (size
, unsignedp
, satp
);
8711 /* Create nodes for all integer types (and error_mark_node) using the sizes
8712 of C datatypes. The caller should call set_sizetype soon after calling
8713 this function to select one of the types as sizetype. */
8716 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
8718 error_mark_node
= make_node (ERROR_MARK
);
8719 TREE_TYPE (error_mark_node
) = error_mark_node
;
8721 initialize_sizetypes (signed_sizetype
);
8723 /* Define both `signed char' and `unsigned char'. */
8724 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
8725 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
8726 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
8727 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
8729 /* Define `char', which is like either `signed char' or `unsigned char'
8730 but not the same as either. */
8733 ? make_signed_type (CHAR_TYPE_SIZE
)
8734 : make_unsigned_type (CHAR_TYPE_SIZE
));
8735 TYPE_STRING_FLAG (char_type_node
) = 1;
8737 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
8738 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
8739 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
8740 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
8741 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
8742 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
8743 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
8744 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
8746 /* Define a boolean type. This type only represents boolean values but
8747 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8748 Front ends which want to override this size (i.e. Java) can redefine
8749 boolean_type_node before calling build_common_tree_nodes_2. */
8750 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
8751 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
8752 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
8753 TYPE_PRECISION (boolean_type_node
) = 1;
8755 /* Fill in the rest of the sized types. Reuse existing type nodes
8757 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
8758 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
8759 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
8760 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
8761 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
8763 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
8764 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
8765 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
8766 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
8767 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
8769 access_public_node
= get_identifier ("public");
8770 access_protected_node
= get_identifier ("protected");
8771 access_private_node
= get_identifier ("private");
8774 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8775 It will create several other common tree nodes. */
8778 build_common_tree_nodes_2 (int short_double
)
8780 /* Define these next since types below may used them. */
8781 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
8782 integer_one_node
= build_int_cst (NULL_TREE
, 1);
8783 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
8785 size_zero_node
= size_int (0);
8786 size_one_node
= size_int (1);
8787 bitsize_zero_node
= bitsize_int (0);
8788 bitsize_one_node
= bitsize_int (1);
8789 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
8791 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
8792 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
8794 void_type_node
= make_node (VOID_TYPE
);
8795 layout_type (void_type_node
);
8797 /* We are not going to have real types in C with less than byte alignment,
8798 so we might as well not have any types that claim to have it. */
8799 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
8800 TYPE_USER_ALIGN (void_type_node
) = 0;
8802 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
8803 layout_type (TREE_TYPE (null_pointer_node
));
8805 ptr_type_node
= build_pointer_type (void_type_node
);
8807 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
8808 fileptr_type_node
= ptr_type_node
;
8810 float_type_node
= make_node (REAL_TYPE
);
8811 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
8812 layout_type (float_type_node
);
8814 double_type_node
= make_node (REAL_TYPE
);
8816 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
8818 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
8819 layout_type (double_type_node
);
8821 long_double_type_node
= make_node (REAL_TYPE
);
8822 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
8823 layout_type (long_double_type_node
);
8825 float_ptr_type_node
= build_pointer_type (float_type_node
);
8826 double_ptr_type_node
= build_pointer_type (double_type_node
);
8827 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
8828 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
8830 /* Fixed size integer types. */
8831 uint32_type_node
= build_nonstandard_integer_type (32, true);
8832 uint64_type_node
= build_nonstandard_integer_type (64, true);
8834 /* Decimal float types. */
8835 dfloat32_type_node
= make_node (REAL_TYPE
);
8836 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
8837 layout_type (dfloat32_type_node
);
8838 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
8839 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
8841 dfloat64_type_node
= make_node (REAL_TYPE
);
8842 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
8843 layout_type (dfloat64_type_node
);
8844 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
8845 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
8847 dfloat128_type_node
= make_node (REAL_TYPE
);
8848 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
8849 layout_type (dfloat128_type_node
);
8850 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
8851 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
8853 complex_integer_type_node
= build_complex_type (integer_type_node
);
8854 complex_float_type_node
= build_complex_type (float_type_node
);
8855 complex_double_type_node
= build_complex_type (double_type_node
);
8856 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
8858 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
8859 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
8860 sat_ ## KIND ## _type_node = \
8861 make_sat_signed_ ## KIND ## _type (SIZE); \
8862 sat_unsigned_ ## KIND ## _type_node = \
8863 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8864 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8865 unsigned_ ## KIND ## _type_node = \
8866 make_unsigned_ ## KIND ## _type (SIZE);
8868 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
8869 sat_ ## WIDTH ## KIND ## _type_node = \
8870 make_sat_signed_ ## KIND ## _type (SIZE); \
8871 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
8872 make_sat_unsigned_ ## KIND ## _type (SIZE); \
8873 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
8874 unsigned_ ## WIDTH ## KIND ## _type_node = \
8875 make_unsigned_ ## KIND ## _type (SIZE);
8877 /* Make fixed-point type nodes based on four different widths. */
8878 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
8879 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
8880 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
8881 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
8882 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
8884 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
8885 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
8886 NAME ## _type_node = \
8887 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
8888 u ## NAME ## _type_node = \
8889 make_or_reuse_unsigned_ ## KIND ## _type \
8890 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
8891 sat_ ## NAME ## _type_node = \
8892 make_or_reuse_sat_signed_ ## KIND ## _type \
8893 (GET_MODE_BITSIZE (MODE ## mode)); \
8894 sat_u ## NAME ## _type_node = \
8895 make_or_reuse_sat_unsigned_ ## KIND ## _type \
8896 (GET_MODE_BITSIZE (U ## MODE ## mode));
8898 /* Fixed-point type and mode nodes. */
8899 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
8900 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
8901 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
8902 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
8903 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
8904 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
8905 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
8906 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
8907 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
8908 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
8909 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
8912 tree t
= targetm
.build_builtin_va_list ();
8914 /* Many back-ends define record types without setting TYPE_NAME.
8915 If we copied the record type here, we'd keep the original
8916 record type without a name. This breaks name mangling. So,
8917 don't copy record types and let c_common_nodes_and_builtins()
8918 declare the type to be __builtin_va_list. */
8919 if (TREE_CODE (t
) != RECORD_TYPE
)
8920 t
= build_variant_type_copy (t
);
8922 va_list_type_node
= t
;
8926 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
8929 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
8930 const char *library_name
, int ecf_flags
)
8934 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
8935 library_name
, NULL_TREE
);
8936 if (ecf_flags
& ECF_CONST
)
8937 TREE_READONLY (decl
) = 1;
8938 if (ecf_flags
& ECF_PURE
)
8939 DECL_PURE_P (decl
) = 1;
8940 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
8941 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
8942 if (ecf_flags
& ECF_NORETURN
)
8943 TREE_THIS_VOLATILE (decl
) = 1;
8944 if (ecf_flags
& ECF_NOTHROW
)
8945 TREE_NOTHROW (decl
) = 1;
8946 if (ecf_flags
& ECF_MALLOC
)
8947 DECL_IS_MALLOC (decl
) = 1;
8949 built_in_decls
[code
] = decl
;
8950 implicit_built_in_decls
[code
] = decl
;
8953 /* Call this function after instantiating all builtins that the language
8954 front end cares about. This will build the rest of the builtins that
8955 are relied upon by the tree optimizers and the middle-end. */
8958 build_common_builtin_nodes (void)
8960 tree tmp
, tmp2
, ftype
;
8962 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
8963 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
8965 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8966 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
8967 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8968 ftype
= build_function_type (ptr_type_node
, tmp
);
8970 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
8971 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
8972 "memcpy", ECF_NOTHROW
);
8973 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
8974 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
8975 "memmove", ECF_NOTHROW
);
8978 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
8980 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8981 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
8982 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
8983 ftype
= build_function_type (integer_type_node
, tmp
);
8984 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
8985 "memcmp", ECF_PURE
| ECF_NOTHROW
);
8988 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
8990 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
8991 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
8992 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
8993 ftype
= build_function_type (ptr_type_node
, tmp
);
8994 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
8995 "memset", ECF_NOTHROW
);
8998 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9000 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9001 ftype
= build_function_type (ptr_type_node
, tmp
);
9002 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9003 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
9006 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9007 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9008 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9009 ftype
= build_function_type (void_type_node
, tmp
);
9010 local_define_builtin ("__builtin_init_trampoline", ftype
,
9011 BUILT_IN_INIT_TRAMPOLINE
,
9012 "__builtin_init_trampoline", ECF_NOTHROW
);
9014 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9015 ftype
= build_function_type (ptr_type_node
, tmp
);
9016 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9017 BUILT_IN_ADJUST_TRAMPOLINE
,
9018 "__builtin_adjust_trampoline",
9019 ECF_CONST
| ECF_NOTHROW
);
9021 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9022 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9023 ftype
= build_function_type (void_type_node
, tmp
);
9024 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9025 BUILT_IN_NONLOCAL_GOTO
,
9026 "__builtin_nonlocal_goto",
9027 ECF_NORETURN
| ECF_NOTHROW
);
9029 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9030 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9031 ftype
= build_function_type (void_type_node
, tmp
);
9032 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9033 BUILT_IN_SETJMP_SETUP
,
9034 "__builtin_setjmp_setup", ECF_NOTHROW
);
9036 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9037 ftype
= build_function_type (ptr_type_node
, tmp
);
9038 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9039 BUILT_IN_SETJMP_DISPATCHER
,
9040 "__builtin_setjmp_dispatcher",
9041 ECF_PURE
| ECF_NOTHROW
);
9043 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9044 ftype
= build_function_type (void_type_node
, tmp
);
9045 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9046 BUILT_IN_SETJMP_RECEIVER
,
9047 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9049 ftype
= build_function_type (ptr_type_node
, void_list_node
);
9050 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9051 "__builtin_stack_save", ECF_NOTHROW
);
9053 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9054 ftype
= build_function_type (void_type_node
, tmp
);
9055 local_define_builtin ("__builtin_stack_restore", ftype
,
9056 BUILT_IN_STACK_RESTORE
,
9057 "__builtin_stack_restore", ECF_NOTHROW
);
9059 ftype
= build_function_type (void_type_node
, void_list_node
);
9060 local_define_builtin ("__builtin_profile_func_enter", ftype
,
9061 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
9062 local_define_builtin ("__builtin_profile_func_exit", ftype
,
9063 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
9065 /* If there's a possibility that we might use the ARM EABI, build the
9066 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9067 if (targetm
.arm_eabi_unwinder
)
9069 ftype
= build_function_type (void_type_node
, void_list_node
);
9070 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9071 BUILT_IN_CXA_END_CLEANUP
,
9072 "__cxa_end_cleanup", ECF_NORETURN
);
9075 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9076 ftype
= build_function_type (void_type_node
, tmp
);
9077 local_define_builtin ("__builtin_unwind_resume", ftype
,
9078 BUILT_IN_UNWIND_RESUME
,
9079 (USING_SJLJ_EXCEPTIONS
9080 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9083 /* The exception object and filter values from the runtime. The argument
9084 must be zero before exception lowering, i.e. from the front end. After
9085 exception lowering, it will be the region number for the exception
9086 landing pad. These functions are PURE instead of CONST to prevent
9087 them from being hoisted past the exception edge that will initialize
9088 its value in the landing pad. */
9089 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9090 ftype
= build_function_type (ptr_type_node
, tmp
);
9091 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9092 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
);
9094 tmp2
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9095 ftype
= build_function_type (tmp2
, tmp
);
9096 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9097 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
);
9099 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9100 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
9101 ftype
= build_function_type (void_type_node
, tmp
);
9102 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9103 BUILT_IN_EH_COPY_VALUES
,
9104 "__builtin_eh_copy_values", ECF_NOTHROW
);
9106 /* Complex multiplication and division. These are handled as builtins
9107 rather than optabs because emit_library_call_value doesn't support
9108 complex. Further, we can do slightly better with folding these
9109 beasties if the real and complex parts of the arguments are separate. */
9113 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9115 char mode_name_buf
[4], *q
;
9117 enum built_in_function mcode
, dcode
;
9118 tree type
, inner_type
;
9120 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9123 inner_type
= TREE_TYPE (type
);
9125 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
9126 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9127 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9128 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9129 ftype
= build_function_type (type
, tmp
);
9131 mcode
= ((enum built_in_function
)
9132 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9133 dcode
= ((enum built_in_function
)
9134 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9136 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9140 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9141 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9142 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
9144 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9145 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9146 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
9151 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9154 If we requested a pointer to a vector, build up the pointers that
9155 we stripped off while looking for the inner type. Similarly for
9156 return values from functions.
9158 The argument TYPE is the top of the chain, and BOTTOM is the
9159 new type which we will point to. */
9162 reconstruct_complex_type (tree type
, tree bottom
)
9166 if (TREE_CODE (type
) == POINTER_TYPE
)
9168 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9169 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9170 TYPE_REF_CAN_ALIAS_ALL (type
));
9172 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9174 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9175 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9176 TYPE_REF_CAN_ALIAS_ALL (type
));
9178 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9180 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9181 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9183 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9185 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9186 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9188 else if (TREE_CODE (type
) == METHOD_TYPE
)
9190 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9191 /* The build_method_type_directly() routine prepends 'this' to argument list,
9192 so we must compensate by getting rid of it. */
9194 = build_method_type_directly
9195 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9197 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9199 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9201 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9202 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9207 return build_qualified_type (outer
, TYPE_QUALS (type
));
9210 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9213 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9217 switch (GET_MODE_CLASS (mode
))
9219 case MODE_VECTOR_INT
:
9220 case MODE_VECTOR_FLOAT
:
9221 case MODE_VECTOR_FRACT
:
9222 case MODE_VECTOR_UFRACT
:
9223 case MODE_VECTOR_ACCUM
:
9224 case MODE_VECTOR_UACCUM
:
9225 nunits
= GET_MODE_NUNITS (mode
);
9229 /* Check that there are no leftover bits. */
9230 gcc_assert (GET_MODE_BITSIZE (mode
)
9231 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9233 nunits
= GET_MODE_BITSIZE (mode
)
9234 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9241 return make_vector_type (innertype
, nunits
, mode
);
9244 /* Similarly, but takes the inner type and number of units, which must be
9248 build_vector_type (tree innertype
, int nunits
)
9250 return make_vector_type (innertype
, nunits
, VOIDmode
);
9253 /* Similarly, but takes the inner type and number of units, which must be
9257 build_opaque_vector_type (tree innertype
, int nunits
)
9260 innertype
= build_distinct_type_copy (innertype
);
9261 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9262 TYPE_VECTOR_OPAQUE (t
) = true;
9267 /* Given an initializer INIT, return TRUE if INIT is zero or some
9268 aggregate of zeros. Otherwise return FALSE. */
9270 initializer_zerop (const_tree init
)
9276 switch (TREE_CODE (init
))
9279 return integer_zerop (init
);
9282 /* ??? Note that this is not correct for C4X float formats. There,
9283 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9284 negative exponent. */
9285 return real_zerop (init
)
9286 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9289 return fixed_zerop (init
);
9292 return integer_zerop (init
)
9293 || (real_zerop (init
)
9294 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9295 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9298 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9299 if (!initializer_zerop (TREE_VALUE (elt
)))
9305 unsigned HOST_WIDE_INT idx
;
9307 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9308 if (!initializer_zerop (elt
))
9318 /* Build an empty statement at location LOC. */
9321 build_empty_stmt (location_t loc
)
9323 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9324 SET_EXPR_LOCATION (t
, loc
);
9329 /* Build an OpenMP clause with code CODE. LOC is the location of the
9333 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9338 length
= omp_clause_num_ops
[code
];
9339 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9341 t
= GGC_NEWVAR (union tree_node
, size
);
9342 memset (t
, 0, size
);
9343 TREE_SET_CODE (t
, OMP_CLAUSE
);
9344 OMP_CLAUSE_SET_CODE (t
, code
);
9345 OMP_CLAUSE_LOCATION (t
) = loc
;
9347 #ifdef GATHER_STATISTICS
9348 tree_node_counts
[(int) omp_clause_kind
]++;
9349 tree_node_sizes
[(int) omp_clause_kind
] += size
;
9355 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9356 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9357 Except for the CODE and operand count field, other storage for the
9358 object is initialized to zeros. */
9361 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9364 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9366 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9367 gcc_assert (len
>= 1);
9369 #ifdef GATHER_STATISTICS
9370 tree_node_counts
[(int) e_kind
]++;
9371 tree_node_sizes
[(int) e_kind
] += length
;
9374 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
9376 memset (t
, 0, length
);
9378 TREE_SET_CODE (t
, code
);
9380 /* Can't use TREE_OPERAND to store the length because if checking is
9381 enabled, it will try to check the length before we store it. :-P */
9382 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9388 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9389 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9393 build_call_list (tree return_type
, tree fn
, tree arglist
)
9398 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
9399 TREE_TYPE (t
) = return_type
;
9400 CALL_EXPR_FN (t
) = fn
;
9401 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9402 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
9403 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
9404 process_call_operands (t
);
9408 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9409 FN and a null static chain slot. NARGS is the number of call arguments
9410 which are specified as "..." arguments. */
9413 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9417 va_start (args
, nargs
);
9418 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9423 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9424 FN and a null static chain slot. NARGS is the number of call arguments
9425 which are specified as a va_list ARGS. */
9428 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9433 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9434 TREE_TYPE (t
) = return_type
;
9435 CALL_EXPR_FN (t
) = fn
;
9436 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9437 for (i
= 0; i
< nargs
; i
++)
9438 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9439 process_call_operands (t
);
9443 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9444 FN and a null static chain slot. NARGS is the number of call arguments
9445 which are specified as a tree array ARGS. */
9448 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9449 int nargs
, const tree
*args
)
9454 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9455 TREE_TYPE (t
) = return_type
;
9456 CALL_EXPR_FN (t
) = fn
;
9457 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9458 for (i
= 0; i
< nargs
; i
++)
9459 CALL_EXPR_ARG (t
, i
) = args
[i
];
9460 process_call_operands (t
);
9461 SET_EXPR_LOCATION (t
, loc
);
9465 /* Like build_call_array, but takes a VEC. */
9468 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9473 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
9474 TREE_TYPE (ret
) = return_type
;
9475 CALL_EXPR_FN (ret
) = fn
;
9476 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
9477 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
9478 CALL_EXPR_ARG (ret
, ix
) = t
;
9479 process_call_operands (ret
);
9484 /* Returns true if it is possible to prove that the index of
9485 an array access REF (an ARRAY_REF expression) falls into the
9489 in_array_bounds_p (tree ref
)
9491 tree idx
= TREE_OPERAND (ref
, 1);
9494 if (TREE_CODE (idx
) != INTEGER_CST
)
9497 min
= array_ref_low_bound (ref
);
9498 max
= array_ref_up_bound (ref
);
9501 || TREE_CODE (min
) != INTEGER_CST
9502 || TREE_CODE (max
) != INTEGER_CST
)
9505 if (tree_int_cst_lt (idx
, min
)
9506 || tree_int_cst_lt (max
, idx
))
9512 /* Returns true if it is possible to prove that the range of
9513 an array access REF (an ARRAY_RANGE_REF expression) falls
9514 into the array bounds. */
9517 range_in_array_bounds_p (tree ref
)
9519 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9520 tree range_min
, range_max
, min
, max
;
9522 range_min
= TYPE_MIN_VALUE (domain_type
);
9523 range_max
= TYPE_MAX_VALUE (domain_type
);
9526 || TREE_CODE (range_min
) != INTEGER_CST
9527 || TREE_CODE (range_max
) != INTEGER_CST
)
9530 min
= array_ref_low_bound (ref
);
9531 max
= array_ref_up_bound (ref
);
9534 || TREE_CODE (min
) != INTEGER_CST
9535 || TREE_CODE (max
) != INTEGER_CST
)
9538 if (tree_int_cst_lt (range_min
, min
)
9539 || tree_int_cst_lt (max
, range_max
))
9545 /* Return true if T (assumed to be a DECL) must be assigned a memory
9549 needs_to_live_in_memory (const_tree t
)
9551 if (TREE_CODE (t
) == SSA_NAME
)
9552 t
= SSA_NAME_VAR (t
);
9554 return (TREE_ADDRESSABLE (t
)
9555 || is_global_var (t
)
9556 || (TREE_CODE (t
) == RESULT_DECL
9557 && aggregate_value_p (t
, current_function_decl
)));
9560 /* There are situations in which a language considers record types
9561 compatible which have different field lists. Decide if two fields
9562 are compatible. It is assumed that the parent records are compatible. */
9565 fields_compatible_p (const_tree f1
, const_tree f2
)
9567 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9568 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9571 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9572 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9575 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9581 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9584 find_compatible_field (tree record
, tree orig_field
)
9588 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9589 if (TREE_CODE (f
) == FIELD_DECL
9590 && fields_compatible_p (f
, orig_field
))
9593 /* ??? Why isn't this on the main fields list? */
9594 f
= TYPE_VFIELD (record
);
9595 if (f
&& TREE_CODE (f
) == FIELD_DECL
9596 && fields_compatible_p (f
, orig_field
))
9599 /* ??? We should abort here, but Java appears to do Bad Things
9600 with inherited fields. */
9604 /* Return value of a constant X and sign-extend it. */
9607 int_cst_value (const_tree x
)
9609 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9610 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9612 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9613 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9614 || TREE_INT_CST_HIGH (x
) == -1);
9616 if (bits
< HOST_BITS_PER_WIDE_INT
)
9618 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9620 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9622 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9628 /* Return value of a constant X and sign-extend it. */
9631 widest_int_cst_value (const_tree x
)
9633 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9634 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9636 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9637 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9638 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9639 << HOST_BITS_PER_WIDE_INT
);
9641 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9642 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9643 || TREE_INT_CST_HIGH (x
) == -1);
9646 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9648 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9650 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9652 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9658 /* If TYPE is an integral type, return an equivalent type which is
9659 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9660 return TYPE itself. */
9663 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9666 if (POINTER_TYPE_P (type
))
9669 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9672 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9675 /* Returns unsigned variant of TYPE. */
9678 unsigned_type_for (tree type
)
9680 return signed_or_unsigned_type_for (1, type
);
9683 /* Returns signed variant of TYPE. */
9686 signed_type_for (tree type
)
9688 return signed_or_unsigned_type_for (0, type
);
9691 /* Returns the largest value obtainable by casting something in INNER type to
9695 upper_bound_in_type (tree outer
, tree inner
)
9697 unsigned HOST_WIDE_INT lo
, hi
;
9698 unsigned int det
= 0;
9699 unsigned oprec
= TYPE_PRECISION (outer
);
9700 unsigned iprec
= TYPE_PRECISION (inner
);
9703 /* Compute a unique number for every combination. */
9704 det
|= (oprec
> iprec
) ? 4 : 0;
9705 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
9706 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
9708 /* Determine the exponent to use. */
9713 /* oprec <= iprec, outer: signed, inner: don't care. */
9718 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9722 /* oprec > iprec, outer: signed, inner: signed. */
9726 /* oprec > iprec, outer: signed, inner: unsigned. */
9730 /* oprec > iprec, outer: unsigned, inner: signed. */
9734 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9741 /* Compute 2^^prec - 1. */
9742 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9745 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
9746 >> (HOST_BITS_PER_WIDE_INT
- prec
));
9750 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9751 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
9752 lo
= ~(unsigned HOST_WIDE_INT
) 0;
9755 return build_int_cst_wide (outer
, lo
, hi
);
9758 /* Returns the smallest value obtainable by casting something in INNER type to
9762 lower_bound_in_type (tree outer
, tree inner
)
9764 unsigned HOST_WIDE_INT lo
, hi
;
9765 unsigned oprec
= TYPE_PRECISION (outer
);
9766 unsigned iprec
= TYPE_PRECISION (inner
);
9768 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9770 if (TYPE_UNSIGNED (outer
)
9771 /* If we are widening something of an unsigned type, OUTER type
9772 contains all values of INNER type. In particular, both INNER
9773 and OUTER types have zero in common. */
9774 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
9778 /* If we are widening a signed type to another signed type, we
9779 want to obtain -2^^(iprec-1). If we are keeping the
9780 precision or narrowing to a signed type, we want to obtain
9782 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
9784 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9786 hi
= ~(unsigned HOST_WIDE_INT
) 0;
9787 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
9791 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9792 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
9797 return build_int_cst_wide (outer
, lo
, hi
);
9800 /* Return nonzero if two operands that are suitable for PHI nodes are
9801 necessarily equal. Specifically, both ARG0 and ARG1 must be either
9802 SSA_NAME or invariant. Note that this is strictly an optimization.
9803 That is, callers of this function can directly call operand_equal_p
9804 and get the same result, only slower. */
9807 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
9811 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
9813 return operand_equal_p (arg0
, arg1
, 0);
9816 /* Returns number of zeros at the end of binary representation of X.
9818 ??? Use ffs if available? */
9821 num_ending_zeros (const_tree x
)
9823 unsigned HOST_WIDE_INT fr
, nfr
;
9824 unsigned num
, abits
;
9825 tree type
= TREE_TYPE (x
);
9827 if (TREE_INT_CST_LOW (x
) == 0)
9829 num
= HOST_BITS_PER_WIDE_INT
;
9830 fr
= TREE_INT_CST_HIGH (x
);
9835 fr
= TREE_INT_CST_LOW (x
);
9838 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
9841 if (nfr
<< abits
== fr
)
9848 if (num
> TYPE_PRECISION (type
))
9849 num
= TYPE_PRECISION (type
);
9851 return build_int_cst_type (type
, num
);
9855 #define WALK_SUBTREE(NODE) \
9858 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
9864 /* This is a subroutine of walk_tree that walks field of TYPE that are to
9865 be walked whenever a type is seen in the tree. Rest of operands and return
9866 value are as for walk_tree. */
9869 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
9870 struct pointer_set_t
*pset
, walk_tree_lh lh
)
9872 tree result
= NULL_TREE
;
9874 switch (TREE_CODE (type
))
9877 case REFERENCE_TYPE
:
9878 /* We have to worry about mutually recursive pointers. These can't
9879 be written in C. They can in Ada. It's pathological, but
9880 there's an ACATS test (c38102a) that checks it. Deal with this
9881 by checking if we're pointing to another pointer, that one
9882 points to another pointer, that one does too, and we have no htab.
9883 If so, get a hash table. We check three levels deep to avoid
9884 the cost of the hash table if we don't need one. */
9885 if (POINTER_TYPE_P (TREE_TYPE (type
))
9886 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
9887 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
9890 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
9898 /* ... fall through ... */
9901 WALK_SUBTREE (TREE_TYPE (type
));
9905 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
9910 WALK_SUBTREE (TREE_TYPE (type
));
9914 /* We never want to walk into default arguments. */
9915 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
9916 WALK_SUBTREE (TREE_VALUE (arg
));
9921 /* Don't follow this nodes's type if a pointer for fear that
9922 we'll have infinite recursion. If we have a PSET, then we
9925 || (!POINTER_TYPE_P (TREE_TYPE (type
))
9926 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
9927 WALK_SUBTREE (TREE_TYPE (type
));
9928 WALK_SUBTREE (TYPE_DOMAIN (type
));
9932 WALK_SUBTREE (TREE_TYPE (type
));
9933 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
9943 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
9944 called with the DATA and the address of each sub-tree. If FUNC returns a
9945 non-NULL value, the traversal is stopped, and the value returned by FUNC
9946 is returned. If PSET is non-NULL it is used to record the nodes visited,
9947 and to avoid visiting a node more than once. */
9950 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
9951 struct pointer_set_t
*pset
, walk_tree_lh lh
)
9953 enum tree_code code
;
9957 #define WALK_SUBTREE_TAIL(NODE) \
9961 goto tail_recurse; \
9966 /* Skip empty subtrees. */
9970 /* Don't walk the same tree twice, if the user has requested
9971 that we avoid doing so. */
9972 if (pset
&& pointer_set_insert (pset
, *tp
))
9975 /* Call the function. */
9977 result
= (*func
) (tp
, &walk_subtrees
, data
);
9979 /* If we found something, return it. */
9983 code
= TREE_CODE (*tp
);
9985 /* Even if we didn't, FUNC may have decided that there was nothing
9986 interesting below this point in the tree. */
9989 /* But we still need to check our siblings. */
9990 if (code
== TREE_LIST
)
9991 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
9992 else if (code
== OMP_CLAUSE
)
9993 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10000 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10001 if (result
|| !walk_subtrees
)
10008 case IDENTIFIER_NODE
:
10015 case PLACEHOLDER_EXPR
:
10019 /* None of these have subtrees other than those already walked
10024 WALK_SUBTREE (TREE_VALUE (*tp
));
10025 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10030 int len
= TREE_VEC_LENGTH (*tp
);
10035 /* Walk all elements but the first. */
10037 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10039 /* Now walk the first one as a tail call. */
10040 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10044 WALK_SUBTREE (TREE_REALPART (*tp
));
10045 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10049 unsigned HOST_WIDE_INT idx
;
10050 constructor_elt
*ce
;
10053 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10055 WALK_SUBTREE (ce
->value
);
10060 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10065 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
10067 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10068 into declarations that are just mentioned, rather than
10069 declared; they don't really belong to this part of the tree.
10070 And, we can see cycles: the initializer for a declaration
10071 can refer to the declaration itself. */
10072 WALK_SUBTREE (DECL_INITIAL (decl
));
10073 WALK_SUBTREE (DECL_SIZE (decl
));
10074 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10076 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10079 case STATEMENT_LIST
:
10081 tree_stmt_iterator i
;
10082 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10083 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10088 switch (OMP_CLAUSE_CODE (*tp
))
10090 case OMP_CLAUSE_PRIVATE
:
10091 case OMP_CLAUSE_SHARED
:
10092 case OMP_CLAUSE_FIRSTPRIVATE
:
10093 case OMP_CLAUSE_COPYIN
:
10094 case OMP_CLAUSE_COPYPRIVATE
:
10095 case OMP_CLAUSE_IF
:
10096 case OMP_CLAUSE_NUM_THREADS
:
10097 case OMP_CLAUSE_SCHEDULE
:
10098 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10101 case OMP_CLAUSE_NOWAIT
:
10102 case OMP_CLAUSE_ORDERED
:
10103 case OMP_CLAUSE_DEFAULT
:
10104 case OMP_CLAUSE_UNTIED
:
10105 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10107 case OMP_CLAUSE_LASTPRIVATE
:
10108 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10109 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10110 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10112 case OMP_CLAUSE_COLLAPSE
:
10115 for (i
= 0; i
< 3; i
++)
10116 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10117 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10120 case OMP_CLAUSE_REDUCTION
:
10123 for (i
= 0; i
< 4; i
++)
10124 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10125 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10129 gcc_unreachable ();
10137 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10138 But, we only want to walk once. */
10139 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10140 for (i
= 0; i
< len
; ++i
)
10141 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10142 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10146 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10147 defining. We only want to walk into these fields of a type in this
10148 case and not in the general case of a mere reference to the type.
10150 The criterion is as follows: if the field can be an expression, it
10151 must be walked only here. This should be in keeping with the fields
10152 that are directly gimplified in gimplify_type_sizes in order for the
10153 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10154 variable-sized types.
10156 Note that DECLs get walked as part of processing the BIND_EXPR. */
10157 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10159 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10160 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10163 /* Call the function for the type. See if it returns anything or
10164 doesn't want us to continue. If we are to continue, walk both
10165 the normal fields and those for the declaration case. */
10166 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10167 if (result
|| !walk_subtrees
)
10170 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10174 /* If this is a record type, also walk the fields. */
10175 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10179 for (field
= TYPE_FIELDS (*type_p
); field
;
10180 field
= TREE_CHAIN (field
))
10182 /* We'd like to look at the type of the field, but we can
10183 easily get infinite recursion. So assume it's pointed
10184 to elsewhere in the tree. Also, ignore things that
10186 if (TREE_CODE (field
) != FIELD_DECL
)
10189 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10190 WALK_SUBTREE (DECL_SIZE (field
));
10191 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10192 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10193 WALK_SUBTREE (DECL_QUALIFIER (field
));
10197 /* Same for scalar types. */
10198 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10199 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10200 || TREE_CODE (*type_p
) == INTEGER_TYPE
10201 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10202 || TREE_CODE (*type_p
) == REAL_TYPE
)
10204 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10205 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10208 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10209 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10214 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10218 /* Walk over all the sub-trees of this operand. */
10219 len
= TREE_OPERAND_LENGTH (*tp
);
10221 /* Go through the subtrees. We need to do this in forward order so
10222 that the scope of a FOR_EXPR is handled properly. */
10225 for (i
= 0; i
< len
- 1; ++i
)
10226 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10227 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10230 /* If this is a type, walk the needed fields in the type. */
10231 else if (TYPE_P (*tp
))
10232 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10236 /* We didn't find what we were looking for. */
10239 #undef WALK_SUBTREE_TAIL
10241 #undef WALK_SUBTREE
10243 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10246 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10250 struct pointer_set_t
*pset
;
10252 pset
= pointer_set_create ();
10253 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10254 pointer_set_destroy (pset
);
10260 tree_block (tree t
)
10262 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10264 if (IS_EXPR_CODE_CLASS (c
))
10265 return &t
->exp
.block
;
10266 gcc_unreachable ();
10270 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
10271 FIXME: don't use this function. It exists for compatibility with
10272 the old representation of CALL_EXPRs where a list was used to hold the
10273 arguments. Places that currently extract the arglist from a CALL_EXPR
10274 ought to be rewritten to use the CALL_EXPR itself. */
10276 call_expr_arglist (tree exp
)
10278 tree arglist
= NULL_TREE
;
10280 for (i
= call_expr_nargs (exp
) - 1; i
>= 0; i
--)
10281 arglist
= tree_cons (NULL_TREE
, CALL_EXPR_ARG (exp
, i
), arglist
);
10286 /* Create a nameless artificial label and put it in the current
10287 function context. The label has a location of LOC. Returns the
10288 newly created label. */
10291 create_artificial_label (location_t loc
)
10293 tree lab
= build_decl (loc
,
10294 LABEL_DECL
, NULL_TREE
, void_type_node
);
10296 DECL_ARTIFICIAL (lab
) = 1;
10297 DECL_IGNORED_P (lab
) = 1;
10298 DECL_CONTEXT (lab
) = current_function_decl
;
10302 /* Given a tree, try to return a useful variable name that we can use
10303 to prefix a temporary that is being assigned the value of the tree.
10304 I.E. given <temp> = &A, return A. */
10309 tree stripped_decl
;
10312 STRIP_NOPS (stripped_decl
);
10313 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10314 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10317 switch (TREE_CODE (stripped_decl
))
10320 return get_name (TREE_OPERAND (stripped_decl
, 0));
10327 /* Return true if TYPE has a variable argument list. */
10330 stdarg_p (tree fntype
)
10332 function_args_iterator args_iter
;
10333 tree n
= NULL_TREE
, t
;
10338 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10343 return n
!= NULL_TREE
&& n
!= void_type_node
;
10346 /* Return true if TYPE has a prototype. */
10349 prototype_p (tree fntype
)
10353 gcc_assert (fntype
!= NULL_TREE
);
10355 t
= TYPE_ARG_TYPES (fntype
);
10356 return (t
!= NULL_TREE
);
10359 /* If BLOCK is inlined from an __attribute__((__artificial__))
10360 routine, return pointer to location from where it has been
10363 block_nonartificial_location (tree block
)
10365 location_t
*ret
= NULL
;
10367 while (block
&& TREE_CODE (block
) == BLOCK
10368 && BLOCK_ABSTRACT_ORIGIN (block
))
10370 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10372 while (TREE_CODE (ao
) == BLOCK
10373 && BLOCK_ABSTRACT_ORIGIN (ao
)
10374 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10375 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10377 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10379 /* If AO is an artificial inline, point RET to the
10380 call site locus at which it has been inlined and continue
10381 the loop, in case AO's caller is also an artificial
10383 if (DECL_DECLARED_INLINE_P (ao
)
10384 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10385 ret
= &BLOCK_SOURCE_LOCATION (block
);
10389 else if (TREE_CODE (ao
) != BLOCK
)
10392 block
= BLOCK_SUPERCONTEXT (block
);
10398 /* If EXP is inlined from an __attribute__((__artificial__))
10399 function, return the location of the original call expression. */
10402 tree_nonartificial_location (tree exp
)
10404 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10409 return EXPR_LOCATION (exp
);
10413 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10416 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10419 cl_option_hash_hash (const void *x
)
10421 const_tree
const t
= (const_tree
) x
;
10425 hashval_t hash
= 0;
10427 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10429 p
= (const char *)TREE_OPTIMIZATION (t
);
10430 len
= sizeof (struct cl_optimization
);
10433 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10435 p
= (const char *)TREE_TARGET_OPTION (t
);
10436 len
= sizeof (struct cl_target_option
);
10440 gcc_unreachable ();
10442 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10444 for (i
= 0; i
< len
; i
++)
10446 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10451 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10452 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10456 cl_option_hash_eq (const void *x
, const void *y
)
10458 const_tree
const xt
= (const_tree
) x
;
10459 const_tree
const yt
= (const_tree
) y
;
10464 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10467 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10469 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10470 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10471 len
= sizeof (struct cl_optimization
);
10474 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10476 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10477 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10478 len
= sizeof (struct cl_target_option
);
10482 gcc_unreachable ();
10484 return (memcmp (xp
, yp
, len
) == 0);
10487 /* Build an OPTIMIZATION_NODE based on the current options. */
10490 build_optimization_node (void)
10495 /* Use the cache of optimization nodes. */
10497 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
));
10499 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10503 /* Insert this one into the hash table. */
10504 t
= cl_optimization_node
;
10507 /* Make a new node for next time round. */
10508 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10514 /* Build a TARGET_OPTION_NODE based on the current options. */
10517 build_target_option_node (void)
10522 /* Use the cache of optimization nodes. */
10524 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
));
10526 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10530 /* Insert this one into the hash table. */
10531 t
= cl_target_option_node
;
10534 /* Make a new node for next time round. */
10535 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10541 /* Determine the "ultimate origin" of a block. The block may be an inlined
10542 instance of an inlined instance of a block which is local to an inline
10543 function, so we have to trace all of the way back through the origin chain
10544 to find out what sort of node actually served as the original seed for the
10548 block_ultimate_origin (const_tree block
)
10550 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10552 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10553 nodes in the function to point to themselves; ignore that if
10554 we're trying to output the abstract instance of this function. */
10555 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10558 if (immediate_origin
== NULL_TREE
)
10563 tree lookahead
= immediate_origin
;
10567 ret_val
= lookahead
;
10568 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10569 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10571 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10573 /* The block's abstract origin chain may not be the *ultimate* origin of
10574 the block. It could lead to a DECL that has an abstract origin set.
10575 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10576 will give us if it has one). Note that DECL's abstract origins are
10577 supposed to be the most distant ancestor (or so decl_ultimate_origin
10578 claims), so we don't need to loop following the DECL origins. */
10579 if (DECL_P (ret_val
))
10580 return DECL_ORIGIN (ret_val
);
10586 /* Return true if T1 and T2 are equivalent lists. */
10589 list_equal_p (const_tree t1
, const_tree t2
)
10591 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10592 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10597 /* Return true iff conversion in EXP generates no instruction. Mark
10598 it inline so that we fully inline into the stripping functions even
10599 though we have two uses of this function. */
10602 tree_nop_conversion (const_tree exp
)
10604 tree outer_type
, inner_type
;
10606 if (!CONVERT_EXPR_P (exp
)
10607 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10609 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10612 outer_type
= TREE_TYPE (exp
);
10613 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10615 /* Use precision rather then machine mode when we can, which gives
10616 the correct answer even for submode (bit-field) types. */
10617 if ((INTEGRAL_TYPE_P (outer_type
)
10618 || POINTER_TYPE_P (outer_type
)
10619 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10620 && (INTEGRAL_TYPE_P (inner_type
)
10621 || POINTER_TYPE_P (inner_type
)
10622 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10623 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10625 /* Otherwise fall back on comparing machine modes (e.g. for
10626 aggregate types, floats). */
10627 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10630 /* Return true iff conversion in EXP generates no instruction. Don't
10631 consider conversions changing the signedness. */
10634 tree_sign_nop_conversion (const_tree exp
)
10636 tree outer_type
, inner_type
;
10638 if (!tree_nop_conversion (exp
))
10641 outer_type
= TREE_TYPE (exp
);
10642 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10644 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10645 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10648 /* Strip conversions from EXP according to tree_nop_conversion and
10649 return the resulting expression. */
10652 tree_strip_nop_conversions (tree exp
)
10654 while (tree_nop_conversion (exp
))
10655 exp
= TREE_OPERAND (exp
, 0);
10659 /* Strip conversions from EXP according to tree_sign_nop_conversion
10660 and return the resulting expression. */
10663 tree_strip_sign_nop_conversions (tree exp
)
10665 while (tree_sign_nop_conversion (exp
))
10666 exp
= TREE_OPERAND (exp
, 0);
10670 static GTY(()) tree gcc_eh_personality_decl
;
10672 /* Return the GCC personality function decl. */
10675 lhd_gcc_personality (void)
10677 if (!gcc_eh_personality_decl
)
10678 gcc_eh_personality_decl
10679 = build_personality_function (USING_SJLJ_EXCEPTIONS
10680 ? "__gcc_personality_sj0"
10681 : "__gcc_personality_v0");
10683 return gcc_eh_personality_decl
;
10686 #include "gt-tree.h"