1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011, 2012 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"
41 #include "toplev.h" /* get_random_seed */
44 #include "filenames.h"
47 #include "common/common-target.h"
48 #include "langhooks.h"
49 #include "tree-inline.h"
50 #include "tree-iterator.h"
51 #include "basic-block.h"
52 #include "tree-flow.h"
54 #include "pointer-set.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
58 #include "tree-diagnostic.h"
59 #include "tree-pretty-print.h"
66 /* Tree code classes. */
68 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
69 #define END_OF_BASE_TREE_CODES tcc_exceptional,
71 const enum tree_code_class tree_code_type
[] = {
72 #include "all-tree.def"
76 #undef END_OF_BASE_TREE_CODES
78 /* Table indexed by tree code giving number of expression
79 operands beyond the fixed part of the node structure.
80 Not used for types or decls. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
83 #define END_OF_BASE_TREE_CODES 0,
85 const unsigned char tree_code_length
[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Names of tree components.
93 Used for printing out the tree and error messages. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
95 #define END_OF_BASE_TREE_CODES "@dummy",
97 const char *const tree_code_name
[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Each tree code class has an associated string representation.
105 These must correspond to the tree_code_class entries. */
107 const char *const tree_code_class_strings
[] =
122 /* obstack.[ch] explicitly declined to prototype this. */
123 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
125 #ifdef GATHER_STATISTICS
126 /* Statistics-gathering stuff. */
128 static int tree_code_counts
[MAX_TREE_CODES
];
129 int tree_node_counts
[(int) all_kinds
];
130 int tree_node_sizes
[(int) all_kinds
];
132 /* Keep in sync with tree.h:enum tree_node_kind. */
133 static const char * const tree_node_kind_names
[] = {
151 #endif /* GATHER_STATISTICS */
153 /* Unique id for next decl created. */
154 static GTY(()) int next_decl_uid
;
155 /* Unique id for next type created. */
156 static GTY(()) int next_type_uid
= 1;
157 /* Unique id for next debug decl created. Use negative numbers,
158 to catch erroneous uses. */
159 static GTY(()) int next_debug_decl_uid
;
161 /* Since we cannot rehash a type after it is in the table, we have to
162 keep the hash code. */
164 struct GTY(()) type_hash
{
169 /* Initial size of the hash table (rounded to next prime). */
170 #define TYPE_HASH_INITIAL_SIZE 1000
172 /* Now here is the hash table. When recording a type, it is added to
173 the slot whose index is the hash code. Note that the hash table is
174 used for several kinds of types (function types, array types and
175 array index range types, for now). While all these live in the
176 same table, they are completely independent, and the hash code is
177 computed differently for each of these. */
179 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
180 htab_t type_hash_table
;
182 /* Hash table and temporary node for larger integer const values. */
183 static GTY (()) tree int_cst_node
;
184 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
185 htab_t int_cst_hash_table
;
187 /* Hash table for optimization flags and target option flags. Use the same
188 hash table for both sets of options. Nodes for building the current
189 optimization and target option nodes. The assumption is most of the time
190 the options created will already be in the hash table, so we avoid
191 allocating and freeing up a node repeatably. */
192 static GTY (()) tree cl_optimization_node
;
193 static GTY (()) tree cl_target_option_node
;
194 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
195 htab_t cl_option_hash_table
;
197 /* General tree->tree mapping structure for use in hash tables. */
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
201 htab_t debug_expr_for_decl
;
203 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
204 htab_t value_expr_for_decl
;
206 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
207 htab_t debug_args_for_decl
;
209 static GTY ((if_marked ("tree_priority_map_marked_p"),
210 param_is (struct tree_priority_map
)))
211 htab_t init_priority_for_decl
;
213 static void set_type_quals (tree
, int);
214 static int type_hash_eq (const void *, const void *);
215 static hashval_t
type_hash_hash (const void *);
216 static hashval_t
int_cst_hash_hash (const void *);
217 static int int_cst_hash_eq (const void *, const void *);
218 static hashval_t
cl_option_hash_hash (const void *);
219 static int cl_option_hash_eq (const void *, const void *);
220 static void print_type_hash_statistics (void);
221 static void print_debug_expr_statistics (void);
222 static void print_value_expr_statistics (void);
223 static int type_hash_marked_p (const void *);
224 static unsigned int type_hash_list (const_tree
, hashval_t
);
225 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
227 tree global_trees
[TI_MAX
];
228 tree integer_types
[itk_none
];
230 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
232 /* Number of operands for each OpenMP clause. */
233 unsigned const char omp_clause_num_ops
[] =
235 0, /* OMP_CLAUSE_ERROR */
236 1, /* OMP_CLAUSE_PRIVATE */
237 1, /* OMP_CLAUSE_SHARED */
238 1, /* OMP_CLAUSE_FIRSTPRIVATE */
239 2, /* OMP_CLAUSE_LASTPRIVATE */
240 4, /* OMP_CLAUSE_REDUCTION */
241 1, /* OMP_CLAUSE_COPYIN */
242 1, /* OMP_CLAUSE_COPYPRIVATE */
243 1, /* OMP_CLAUSE_IF */
244 1, /* OMP_CLAUSE_NUM_THREADS */
245 1, /* OMP_CLAUSE_SCHEDULE */
246 0, /* OMP_CLAUSE_NOWAIT */
247 0, /* OMP_CLAUSE_ORDERED */
248 0, /* OMP_CLAUSE_DEFAULT */
249 3, /* OMP_CLAUSE_COLLAPSE */
250 0, /* OMP_CLAUSE_UNTIED */
251 1, /* OMP_CLAUSE_FINAL */
252 0 /* OMP_CLAUSE_MERGEABLE */
255 const char * const omp_clause_code_name
[] =
278 /* Return the tree node structure used by tree code CODE. */
280 static inline enum tree_node_structure_enum
281 tree_node_structure_for_code (enum tree_code code
)
283 switch (TREE_CODE_CLASS (code
))
285 case tcc_declaration
:
290 return TS_FIELD_DECL
;
296 return TS_LABEL_DECL
;
298 return TS_RESULT_DECL
;
299 case DEBUG_EXPR_DECL
:
302 return TS_CONST_DECL
;
306 return TS_FUNCTION_DECL
;
307 case TRANSLATION_UNIT_DECL
:
308 return TS_TRANSLATION_UNIT_DECL
;
310 return TS_DECL_NON_COMMON
;
314 return TS_TYPE_NON_COMMON
;
323 default: /* tcc_constant and tcc_exceptional */
328 /* tcc_constant cases. */
329 case INTEGER_CST
: return TS_INT_CST
;
330 case REAL_CST
: return TS_REAL_CST
;
331 case FIXED_CST
: return TS_FIXED_CST
;
332 case COMPLEX_CST
: return TS_COMPLEX
;
333 case VECTOR_CST
: return TS_VECTOR
;
334 case STRING_CST
: return TS_STRING
;
335 /* tcc_exceptional cases. */
336 case ERROR_MARK
: return TS_COMMON
;
337 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
338 case TREE_LIST
: return TS_LIST
;
339 case TREE_VEC
: return TS_VEC
;
340 case SSA_NAME
: return TS_SSA_NAME
;
341 case PLACEHOLDER_EXPR
: return TS_COMMON
;
342 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
343 case BLOCK
: return TS_BLOCK
;
344 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
345 case TREE_BINFO
: return TS_BINFO
;
346 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
347 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
348 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
356 /* Initialize tree_contains_struct to describe the hierarchy of tree
360 initialize_tree_contains_struct (void)
364 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
367 enum tree_node_structure_enum ts_code
;
369 code
= (enum tree_code
) i
;
370 ts_code
= tree_node_structure_for_code (code
);
372 /* Mark the TS structure itself. */
373 tree_contains_struct
[code
][ts_code
] = 1;
375 /* Mark all the structures that TS is derived from. */
393 case TS_STATEMENT_LIST
:
394 MARK_TS_TYPED (code
);
398 case TS_DECL_MINIMAL
:
404 case TS_OPTIMIZATION
:
405 case TS_TARGET_OPTION
:
406 MARK_TS_COMMON (code
);
409 case TS_TYPE_WITH_LANG_SPECIFIC
:
410 MARK_TS_TYPE_COMMON (code
);
413 case TS_TYPE_NON_COMMON
:
414 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
418 MARK_TS_DECL_MINIMAL (code
);
423 MARK_TS_DECL_COMMON (code
);
426 case TS_DECL_NON_COMMON
:
427 MARK_TS_DECL_WITH_VIS (code
);
430 case TS_DECL_WITH_VIS
:
434 MARK_TS_DECL_WRTL (code
);
438 MARK_TS_DECL_COMMON (code
);
442 MARK_TS_DECL_WITH_VIS (code
);
446 case TS_FUNCTION_DECL
:
447 MARK_TS_DECL_NON_COMMON (code
);
450 case TS_TRANSLATION_UNIT_DECL
:
451 MARK_TS_DECL_COMMON (code
);
459 /* Basic consistency checks for attributes used in fold. */
460 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
461 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
462 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
463 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
464 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
465 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
466 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
468 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
469 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
470 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
471 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
472 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
473 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
474 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
475 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
476 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
477 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
478 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
479 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
480 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
482 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
483 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
484 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
485 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
486 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
487 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
488 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
489 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
490 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
491 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
492 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
493 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
494 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
495 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
496 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
506 /* Initialize the hash table of types. */
507 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
510 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
511 tree_decl_map_eq
, 0);
513 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
514 tree_decl_map_eq
, 0);
515 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
516 tree_priority_map_eq
, 0);
518 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
519 int_cst_hash_eq
, NULL
);
521 int_cst_node
= make_node (INTEGER_CST
);
523 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
524 cl_option_hash_eq
, NULL
);
526 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
527 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
529 /* Initialize the tree_contains_struct array. */
530 initialize_tree_contains_struct ();
531 lang_hooks
.init_ts ();
535 /* The name of the object as the assembler will see it (but before any
536 translations made by ASM_OUTPUT_LABELREF). Often this is the same
537 as DECL_NAME. It is an IDENTIFIER_NODE. */
539 decl_assembler_name (tree decl
)
541 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
542 lang_hooks
.set_decl_assembler_name (decl
);
543 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
546 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
549 decl_assembler_name_equal (tree decl
, const_tree asmname
)
551 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
552 const char *decl_str
;
553 const char *asmname_str
;
556 if (decl_asmname
== asmname
)
559 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
560 asmname_str
= IDENTIFIER_POINTER (asmname
);
563 /* If the target assembler name was set by the user, things are trickier.
564 We have a leading '*' to begin with. After that, it's arguable what
565 is the correct thing to do with -fleading-underscore. Arguably, we've
566 historically been doing the wrong thing in assemble_alias by always
567 printing the leading underscore. Since we're not changing that, make
568 sure user_label_prefix follows the '*' before matching. */
569 if (decl_str
[0] == '*')
571 size_t ulp_len
= strlen (user_label_prefix
);
577 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
578 decl_str
+= ulp_len
, test
=true;
582 if (asmname_str
[0] == '*')
584 size_t ulp_len
= strlen (user_label_prefix
);
590 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
591 asmname_str
+= ulp_len
, test
=true;
598 return strcmp (decl_str
, asmname_str
) == 0;
601 /* Hash asmnames ignoring the user specified marks. */
604 decl_assembler_name_hash (const_tree asmname
)
606 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
608 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
609 size_t ulp_len
= strlen (user_label_prefix
);
613 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
616 return htab_hash_string (decl_str
);
619 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
622 /* Compute the number of bytes occupied by a tree with code CODE.
623 This function cannot be used for nodes that have variable sizes,
624 including TREE_VEC, STRING_CST, and CALL_EXPR. */
626 tree_code_size (enum tree_code code
)
628 switch (TREE_CODE_CLASS (code
))
630 case tcc_declaration
: /* A decl node */
635 return sizeof (struct tree_field_decl
);
637 return sizeof (struct tree_parm_decl
);
639 return sizeof (struct tree_var_decl
);
641 return sizeof (struct tree_label_decl
);
643 return sizeof (struct tree_result_decl
);
645 return sizeof (struct tree_const_decl
);
647 return sizeof (struct tree_type_decl
);
649 return sizeof (struct tree_function_decl
);
650 case DEBUG_EXPR_DECL
:
651 return sizeof (struct tree_decl_with_rtl
);
653 return sizeof (struct tree_decl_non_common
);
657 case tcc_type
: /* a type node */
658 return sizeof (struct tree_type_non_common
);
660 case tcc_reference
: /* a reference */
661 case tcc_expression
: /* an expression */
662 case tcc_statement
: /* an expression with side effects */
663 case tcc_comparison
: /* a comparison expression */
664 case tcc_unary
: /* a unary arithmetic expression */
665 case tcc_binary
: /* a binary arithmetic expression */
666 return (sizeof (struct tree_exp
)
667 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
669 case tcc_constant
: /* a constant */
672 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
673 case REAL_CST
: return sizeof (struct tree_real_cst
);
674 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
675 case COMPLEX_CST
: return sizeof (struct tree_complex
);
676 case VECTOR_CST
: return sizeof (struct tree_vector
);
677 case STRING_CST
: gcc_unreachable ();
679 return lang_hooks
.tree_size (code
);
682 case tcc_exceptional
: /* something random, like an identifier. */
685 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
686 case TREE_LIST
: return sizeof (struct tree_list
);
689 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
692 case OMP_CLAUSE
: gcc_unreachable ();
694 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
696 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
697 case BLOCK
: return sizeof (struct tree_block
);
698 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
699 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
700 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
703 return lang_hooks
.tree_size (code
);
711 /* Compute the number of bytes occupied by NODE. This routine only
712 looks at TREE_CODE, except for those nodes that have variable sizes. */
714 tree_size (const_tree node
)
716 const enum tree_code code
= TREE_CODE (node
);
720 return (offsetof (struct tree_binfo
, base_binfos
)
721 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
724 return (sizeof (struct tree_vec
)
725 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
728 return (sizeof (struct tree_vector
)
729 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
732 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
735 return (sizeof (struct tree_omp_clause
)
736 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
740 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
741 return (sizeof (struct tree_exp
)
742 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
744 return tree_code_size (code
);
748 /* Record interesting allocation statistics for a tree node with CODE
752 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
753 size_t length ATTRIBUTE_UNUSED
)
755 #ifdef GATHER_STATISTICS
756 enum tree_code_class type
= TREE_CODE_CLASS (code
);
761 case tcc_declaration
: /* A decl node */
765 case tcc_type
: /* a type node */
769 case tcc_statement
: /* an expression with side effects */
773 case tcc_reference
: /* a reference */
777 case tcc_expression
: /* an expression */
778 case tcc_comparison
: /* a comparison expression */
779 case tcc_unary
: /* a unary arithmetic expression */
780 case tcc_binary
: /* a binary arithmetic expression */
784 case tcc_constant
: /* a constant */
788 case tcc_exceptional
: /* something random, like an identifier. */
791 case IDENTIFIER_NODE
:
804 kind
= ssa_name_kind
;
816 kind
= omp_clause_kind
;
833 tree_code_counts
[(int) code
]++;
834 tree_node_counts
[(int) kind
]++;
835 tree_node_sizes
[(int) kind
] += length
;
839 /* Allocate and return a new UID from the DECL_UID namespace. */
842 allocate_decl_uid (void)
844 return next_decl_uid
++;
847 /* Return a newly allocated node of code CODE. For decl and type
848 nodes, some other fields are initialized. The rest of the node is
849 initialized to zero. This function cannot be used for TREE_VEC or
850 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
852 Achoo! I got a code in the node. */
855 make_node_stat (enum tree_code code MEM_STAT_DECL
)
858 enum tree_code_class type
= TREE_CODE_CLASS (code
);
859 size_t length
= tree_code_size (code
);
861 record_node_allocation_statistics (code
, length
);
863 t
= ggc_alloc_zone_cleared_tree_node_stat (
864 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
865 length PASS_MEM_STAT
);
866 TREE_SET_CODE (t
, code
);
871 TREE_SIDE_EFFECTS (t
) = 1;
874 case tcc_declaration
:
875 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
877 if (code
== FUNCTION_DECL
)
879 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
880 DECL_MODE (t
) = FUNCTION_MODE
;
885 DECL_SOURCE_LOCATION (t
) = input_location
;
886 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
887 DECL_UID (t
) = --next_debug_decl_uid
;
890 DECL_UID (t
) = allocate_decl_uid ();
891 SET_DECL_PT_UID (t
, -1);
893 if (TREE_CODE (t
) == LABEL_DECL
)
894 LABEL_DECL_UID (t
) = -1;
899 TYPE_UID (t
) = next_type_uid
++;
900 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
901 TYPE_USER_ALIGN (t
) = 0;
902 TYPE_MAIN_VARIANT (t
) = t
;
903 TYPE_CANONICAL (t
) = t
;
905 /* Default to no attributes for type, but let target change that. */
906 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
907 targetm
.set_default_type_attributes (t
);
909 /* We have not yet computed the alias set for this type. */
910 TYPE_ALIAS_SET (t
) = -1;
914 TREE_CONSTANT (t
) = 1;
923 case PREDECREMENT_EXPR
:
924 case PREINCREMENT_EXPR
:
925 case POSTDECREMENT_EXPR
:
926 case POSTINCREMENT_EXPR
:
927 /* All of these have side-effects, no matter what their
929 TREE_SIDE_EFFECTS (t
) = 1;
938 /* Other classes need no special treatment. */
945 /* Return a new node with the same contents as NODE except that its
946 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
949 copy_node_stat (tree node MEM_STAT_DECL
)
952 enum tree_code code
= TREE_CODE (node
);
955 gcc_assert (code
!= STATEMENT_LIST
);
957 length
= tree_size (node
);
958 record_node_allocation_statistics (code
, length
);
959 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
960 memcpy (t
, node
, length
);
962 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
964 TREE_ASM_WRITTEN (t
) = 0;
965 TREE_VISITED (t
) = 0;
966 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
967 *DECL_VAR_ANN_PTR (t
) = 0;
969 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
971 if (code
== DEBUG_EXPR_DECL
)
972 DECL_UID (t
) = --next_debug_decl_uid
;
975 DECL_UID (t
) = allocate_decl_uid ();
976 if (DECL_PT_UID_SET_P (node
))
977 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
979 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
980 && DECL_HAS_VALUE_EXPR_P (node
))
982 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
983 DECL_HAS_VALUE_EXPR_P (t
) = 1;
985 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
987 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
988 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
991 else if (TREE_CODE_CLASS (code
) == tcc_type
)
993 TYPE_UID (t
) = next_type_uid
++;
994 /* The following is so that the debug code for
995 the copy is different from the original type.
996 The two statements usually duplicate each other
997 (because they clear fields of the same union),
998 but the optimizer should catch that. */
999 TYPE_SYMTAB_POINTER (t
) = 0;
1000 TYPE_SYMTAB_ADDRESS (t
) = 0;
1002 /* Do not copy the values cache. */
1003 if (TYPE_CACHED_VALUES_P(t
))
1005 TYPE_CACHED_VALUES_P (t
) = 0;
1006 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1013 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1014 For example, this can copy a list made of TREE_LIST nodes. */
1017 copy_list (tree list
)
1025 head
= prev
= copy_node (list
);
1026 next
= TREE_CHAIN (list
);
1029 TREE_CHAIN (prev
) = copy_node (next
);
1030 prev
= TREE_CHAIN (prev
);
1031 next
= TREE_CHAIN (next
);
1037 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1040 build_int_cst (tree type
, HOST_WIDE_INT low
)
1042 /* Support legacy code. */
1044 type
= integer_type_node
;
1046 return double_int_to_tree (type
, shwi_to_double_int (low
));
1049 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1052 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1056 return double_int_to_tree (type
, shwi_to_double_int (low
));
1059 /* Constructs tree in type TYPE from with value given by CST. Signedness
1060 of CST is assumed to be the same as the signedness of TYPE. */
1063 double_int_to_tree (tree type
, double_int cst
)
1065 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1067 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1069 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1072 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1073 to be the same as the signedness of TYPE. */
1076 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1078 /* Size types *are* sign extended. */
1079 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1082 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1084 return double_int_equal_p (cst
, ext
);
1087 /* We force the double_int CST to the range of the type TYPE by sign or
1088 zero extending it. OVERFLOWABLE indicates if we are interested in
1089 overflow of the value, when >0 we are only interested in signed
1090 overflow, for <0 we are interested in any overflow. OVERFLOWED
1091 indicates whether overflow has already occurred. CONST_OVERFLOWED
1092 indicates whether constant overflow has already occurred. We force
1093 T's value to be within range of T's type (by setting to 0 or 1 all
1094 the bits outside the type's range). We set TREE_OVERFLOWED if,
1095 OVERFLOWED is nonzero,
1096 or OVERFLOWABLE is >0 and signed overflow occurs
1097 or OVERFLOWABLE is <0 and any overflow occurs
1098 We return a new tree node for the extended double_int. The node
1099 is shared if no overflow flags are set. */
1103 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1106 bool sign_extended_type
;
1108 /* Size types *are* sign extended. */
1109 sign_extended_type
= !TYPE_UNSIGNED (type
);
1111 /* If we need to set overflow flags, return a new unshared node. */
1112 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1116 || (overflowable
> 0 && sign_extended_type
))
1118 tree t
= make_node (INTEGER_CST
);
1119 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1120 !sign_extended_type
);
1121 TREE_TYPE (t
) = type
;
1122 TREE_OVERFLOW (t
) = 1;
1127 /* Else build a shared node. */
1128 return double_int_to_tree (type
, cst
);
1131 /* These are the hash table functions for the hash table of INTEGER_CST
1132 nodes of a sizetype. */
1134 /* Return the hash code code X, an INTEGER_CST. */
1137 int_cst_hash_hash (const void *x
)
1139 const_tree
const t
= (const_tree
) x
;
1141 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1142 ^ htab_hash_pointer (TREE_TYPE (t
)));
1145 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1146 is the same as that given by *Y, which is the same. */
1149 int_cst_hash_eq (const void *x
, const void *y
)
1151 const_tree
const xt
= (const_tree
) x
;
1152 const_tree
const yt
= (const_tree
) y
;
1154 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1155 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1156 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1159 /* Create an INT_CST node of TYPE and value HI:LOW.
1160 The returned node is always shared. For small integers we use a
1161 per-type vector cache, for larger ones we use a single hash table. */
1164 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1172 switch (TREE_CODE (type
))
1175 gcc_assert (hi
== 0 && low
== 0);
1179 case REFERENCE_TYPE
:
1180 /* Cache NULL pointer. */
1189 /* Cache false or true. */
1197 if (TYPE_UNSIGNED (type
))
1200 limit
= INTEGER_SHARE_LIMIT
;
1201 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1207 limit
= INTEGER_SHARE_LIMIT
+ 1;
1208 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1210 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1224 /* Look for it in the type's vector of small shared ints. */
1225 if (!TYPE_CACHED_VALUES_P (type
))
1227 TYPE_CACHED_VALUES_P (type
) = 1;
1228 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1231 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1234 /* Make sure no one is clobbering the shared constant. */
1235 gcc_assert (TREE_TYPE (t
) == type
);
1236 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1237 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1241 /* Create a new shared int. */
1242 t
= make_node (INTEGER_CST
);
1244 TREE_INT_CST_LOW (t
) = low
;
1245 TREE_INT_CST_HIGH (t
) = hi
;
1246 TREE_TYPE (t
) = type
;
1248 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1253 /* Use the cache of larger shared ints. */
1256 TREE_INT_CST_LOW (int_cst_node
) = low
;
1257 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1258 TREE_TYPE (int_cst_node
) = type
;
1260 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1264 /* Insert this one into the hash table. */
1267 /* Make a new node for next time round. */
1268 int_cst_node
= make_node (INTEGER_CST
);
1275 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1276 and the rest are zeros. */
1279 build_low_bits_mask (tree type
, unsigned bits
)
1283 gcc_assert (bits
<= TYPE_PRECISION (type
));
1285 if (bits
== TYPE_PRECISION (type
)
1286 && !TYPE_UNSIGNED (type
))
1287 /* Sign extended all-ones mask. */
1288 mask
= double_int_minus_one
;
1290 mask
= double_int_mask (bits
);
1292 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1295 /* Checks that X is integer constant that can be expressed in (unsigned)
1296 HOST_WIDE_INT without loss of precision. */
1299 cst_and_fits_in_hwi (const_tree x
)
1301 if (TREE_CODE (x
) != INTEGER_CST
)
1304 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1307 return (TREE_INT_CST_HIGH (x
) == 0
1308 || TREE_INT_CST_HIGH (x
) == -1);
1311 /* Build a newly constructed TREE_VEC node of length LEN. */
1314 make_vector_stat (unsigned len MEM_STAT_DECL
)
1317 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1319 record_node_allocation_statistics (VECTOR_CST
, length
);
1321 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1323 TREE_SET_CODE (t
, VECTOR_CST
);
1324 TREE_CONSTANT (t
) = 1;
1329 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1330 are in a list pointed to by VALS. */
1333 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1337 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1338 TREE_TYPE (v
) = type
;
1340 /* Iterate through elements and check for overflow. */
1341 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1343 tree value
= vals
[cnt
];
1345 VECTOR_CST_ELT (v
, cnt
) = value
;
1347 /* Don't crash if we get an address constant. */
1348 if (!CONSTANT_CLASS_P (value
))
1351 over
|= TREE_OVERFLOW (value
);
1354 TREE_OVERFLOW (v
) = over
;
1358 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1359 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1362 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1364 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1365 unsigned HOST_WIDE_INT idx
;
1368 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1370 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1371 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1373 return build_vector (type
, vec
);
1376 /* Build a vector of type VECTYPE where all the elements are SCs. */
1378 build_vector_from_val (tree vectype
, tree sc
)
1380 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1382 if (sc
== error_mark_node
)
1385 /* Verify that the vector type is suitable for SC. Note that there
1386 is some inconsistency in the type-system with respect to restrict
1387 qualifications of pointers. Vector types always have a main-variant
1388 element type and the qualification is applied to the vector-type.
1389 So TREE_TYPE (vector-type) does not return a properly qualified
1390 vector element-type. */
1391 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1392 TREE_TYPE (vectype
)));
1394 if (CONSTANT_CLASS_P (sc
))
1396 tree
*v
= XALLOCAVEC (tree
, nunits
);
1397 for (i
= 0; i
< nunits
; ++i
)
1399 return build_vector (vectype
, v
);
1403 VEC(constructor_elt
, gc
) *v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1404 for (i
= 0; i
< nunits
; ++i
)
1405 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1406 return build_constructor (vectype
, v
);
1410 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1411 are in the VEC pointed to by VALS. */
1413 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1415 tree c
= make_node (CONSTRUCTOR
);
1417 constructor_elt
*elt
;
1418 bool constant_p
= true;
1419 bool side_effects_p
= false;
1421 TREE_TYPE (c
) = type
;
1422 CONSTRUCTOR_ELTS (c
) = vals
;
1424 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1426 /* Mostly ctors will have elts that don't have side-effects, so
1427 the usual case is to scan all the elements. Hence a single
1428 loop for both const and side effects, rather than one loop
1429 each (with early outs). */
1430 if (!TREE_CONSTANT (elt
->value
))
1432 if (TREE_SIDE_EFFECTS (elt
->value
))
1433 side_effects_p
= true;
1436 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1437 TREE_CONSTANT (c
) = constant_p
;
1442 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1445 build_constructor_single (tree type
, tree index
, tree value
)
1447 VEC(constructor_elt
,gc
) *v
;
1448 constructor_elt
*elt
;
1450 v
= VEC_alloc (constructor_elt
, gc
, 1);
1451 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1455 return build_constructor (type
, v
);
1459 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1460 are in a list pointed to by VALS. */
1462 build_constructor_from_list (tree type
, tree vals
)
1465 VEC(constructor_elt
,gc
) *v
= NULL
;
1469 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1470 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1471 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1474 return build_constructor (type
, v
);
1477 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1480 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1483 FIXED_VALUE_TYPE
*fp
;
1485 v
= make_node (FIXED_CST
);
1486 fp
= ggc_alloc_fixed_value ();
1487 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1489 TREE_TYPE (v
) = type
;
1490 TREE_FIXED_CST_PTR (v
) = fp
;
1494 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1497 build_real (tree type
, REAL_VALUE_TYPE d
)
1500 REAL_VALUE_TYPE
*dp
;
1503 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1504 Consider doing it via real_convert now. */
1506 v
= make_node (REAL_CST
);
1507 dp
= ggc_alloc_real_value ();
1508 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1510 TREE_TYPE (v
) = type
;
1511 TREE_REAL_CST_PTR (v
) = dp
;
1512 TREE_OVERFLOW (v
) = overflow
;
1516 /* Return a new REAL_CST node whose type is TYPE
1517 and whose value is the integer value of the INTEGER_CST node I. */
1520 real_value_from_int_cst (const_tree type
, const_tree i
)
1524 /* Clear all bits of the real value type so that we can later do
1525 bitwise comparisons to see if two values are the same. */
1526 memset (&d
, 0, sizeof d
);
1528 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1529 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1530 TYPE_UNSIGNED (TREE_TYPE (i
)));
1534 /* Given a tree representing an integer constant I, return a tree
1535 representing the same value as a floating-point constant of type TYPE. */
1538 build_real_from_int_cst (tree type
, const_tree i
)
1541 int overflow
= TREE_OVERFLOW (i
);
1543 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1545 TREE_OVERFLOW (v
) |= overflow
;
1549 /* Return a newly constructed STRING_CST node whose value is
1550 the LEN characters at STR.
1551 Note that for a C string literal, LEN should include the trailing NUL.
1552 The TREE_TYPE is not initialized. */
1555 build_string (int len
, const char *str
)
1560 /* Do not waste bytes provided by padding of struct tree_string. */
1561 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1563 record_node_allocation_statistics (STRING_CST
, length
);
1565 s
= ggc_alloc_tree_node (length
);
1567 memset (s
, 0, sizeof (struct tree_typed
));
1568 TREE_SET_CODE (s
, STRING_CST
);
1569 TREE_CONSTANT (s
) = 1;
1570 TREE_STRING_LENGTH (s
) = len
;
1571 memcpy (s
->string
.str
, str
, len
);
1572 s
->string
.str
[len
] = '\0';
1577 /* Return a newly constructed COMPLEX_CST node whose value is
1578 specified by the real and imaginary parts REAL and IMAG.
1579 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1580 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1583 build_complex (tree type
, tree real
, tree imag
)
1585 tree t
= make_node (COMPLEX_CST
);
1587 TREE_REALPART (t
) = real
;
1588 TREE_IMAGPART (t
) = imag
;
1589 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1590 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1594 /* Return a constant of arithmetic type TYPE which is the
1595 multiplicative identity of the set TYPE. */
1598 build_one_cst (tree type
)
1600 switch (TREE_CODE (type
))
1602 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1603 case POINTER_TYPE
: case REFERENCE_TYPE
:
1605 return build_int_cst (type
, 1);
1608 return build_real (type
, dconst1
);
1610 case FIXED_POINT_TYPE
:
1611 /* We can only generate 1 for accum types. */
1612 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1613 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1617 tree scalar
= build_one_cst (TREE_TYPE (type
));
1619 return build_vector_from_val (type
, scalar
);
1623 return build_complex (type
,
1624 build_one_cst (TREE_TYPE (type
)),
1625 build_zero_cst (TREE_TYPE (type
)));
1632 /* Build 0 constant of type TYPE. This is used by constructor folding
1633 and thus the constant should be represented in memory by
1637 build_zero_cst (tree type
)
1639 switch (TREE_CODE (type
))
1641 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1642 case POINTER_TYPE
: case REFERENCE_TYPE
:
1643 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1644 return build_int_cst (type
, 0);
1647 return build_real (type
, dconst0
);
1649 case FIXED_POINT_TYPE
:
1650 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1654 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1656 return build_vector_from_val (type
, scalar
);
1661 tree zero
= build_zero_cst (TREE_TYPE (type
));
1663 return build_complex (type
, zero
, zero
);
1667 if (!AGGREGATE_TYPE_P (type
))
1668 return fold_convert (type
, integer_zero_node
);
1669 return build_constructor (type
, NULL
);
1674 /* Build a BINFO with LEN language slots. */
1677 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1680 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1681 + VEC_embedded_size (tree
, base_binfos
));
1683 record_node_allocation_statistics (TREE_BINFO
, length
);
1685 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1687 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1689 TREE_SET_CODE (t
, TREE_BINFO
);
1691 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1696 /* Create a CASE_LABEL_EXPR tree node and return it. */
1699 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1701 tree t
= make_node (CASE_LABEL_EXPR
);
1703 TREE_TYPE (t
) = void_type_node
;
1704 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1706 CASE_LOW (t
) = low_value
;
1707 CASE_HIGH (t
) = high_value
;
1708 CASE_LABEL (t
) = label_decl
;
1709 CASE_CHAIN (t
) = NULL_TREE
;
1714 /* Build a newly constructed TREE_VEC node of length LEN. */
1717 make_tree_vec_stat (int len MEM_STAT_DECL
)
1720 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1722 record_node_allocation_statistics (TREE_VEC
, length
);
1724 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1726 TREE_SET_CODE (t
, TREE_VEC
);
1727 TREE_VEC_LENGTH (t
) = len
;
1732 /* Return 1 if EXPR is the integer constant zero or a complex constant
1736 integer_zerop (const_tree expr
)
1740 switch (TREE_CODE (expr
))
1743 return (TREE_INT_CST_LOW (expr
) == 0
1744 && TREE_INT_CST_HIGH (expr
) == 0);
1746 return (integer_zerop (TREE_REALPART (expr
))
1747 && integer_zerop (TREE_IMAGPART (expr
)));
1751 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1752 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1761 /* Return 1 if EXPR is the integer constant one or the corresponding
1762 complex constant. */
1765 integer_onep (const_tree expr
)
1769 switch (TREE_CODE (expr
))
1772 return (TREE_INT_CST_LOW (expr
) == 1
1773 && TREE_INT_CST_HIGH (expr
) == 0);
1775 return (integer_onep (TREE_REALPART (expr
))
1776 && integer_zerop (TREE_IMAGPART (expr
)));
1780 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1781 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1790 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1791 it contains. Likewise for the corresponding complex constant. */
1794 integer_all_onesp (const_tree expr
)
1801 if (TREE_CODE (expr
) == COMPLEX_CST
1802 && integer_all_onesp (TREE_REALPART (expr
))
1803 && integer_zerop (TREE_IMAGPART (expr
)))
1806 else if (TREE_CODE (expr
) == VECTOR_CST
)
1809 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1810 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1815 else if (TREE_CODE (expr
) != INTEGER_CST
)
1818 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1819 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1820 && TREE_INT_CST_HIGH (expr
) == -1)
1825 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1826 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1828 HOST_WIDE_INT high_value
;
1831 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1833 /* Can not handle precisions greater than twice the host int size. */
1834 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1835 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1836 /* Shifting by the host word size is undefined according to the ANSI
1837 standard, so we must handle this as a special case. */
1840 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1842 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1843 && TREE_INT_CST_HIGH (expr
) == high_value
);
1846 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1849 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1853 integer_pow2p (const_tree expr
)
1856 HOST_WIDE_INT high
, low
;
1860 if (TREE_CODE (expr
) == COMPLEX_CST
1861 && integer_pow2p (TREE_REALPART (expr
))
1862 && integer_zerop (TREE_IMAGPART (expr
)))
1865 if (TREE_CODE (expr
) != INTEGER_CST
)
1868 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1869 high
= TREE_INT_CST_HIGH (expr
);
1870 low
= TREE_INT_CST_LOW (expr
);
1872 /* First clear all bits that are beyond the type's precision in case
1873 we've been sign extended. */
1875 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1877 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1878 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1882 if (prec
< HOST_BITS_PER_WIDE_INT
)
1883 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1886 if (high
== 0 && low
== 0)
1889 return ((high
== 0 && (low
& (low
- 1)) == 0)
1890 || (low
== 0 && (high
& (high
- 1)) == 0));
1893 /* Return 1 if EXPR is an integer constant other than zero or a
1894 complex constant other than zero. */
1897 integer_nonzerop (const_tree expr
)
1901 return ((TREE_CODE (expr
) == INTEGER_CST
1902 && (TREE_INT_CST_LOW (expr
) != 0
1903 || TREE_INT_CST_HIGH (expr
) != 0))
1904 || (TREE_CODE (expr
) == COMPLEX_CST
1905 && (integer_nonzerop (TREE_REALPART (expr
))
1906 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1909 /* Return 1 if EXPR is the fixed-point constant zero. */
1912 fixed_zerop (const_tree expr
)
1914 return (TREE_CODE (expr
) == FIXED_CST
1915 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1918 /* Return the power of two represented by a tree node known to be a
1922 tree_log2 (const_tree expr
)
1925 HOST_WIDE_INT high
, low
;
1929 if (TREE_CODE (expr
) == COMPLEX_CST
)
1930 return tree_log2 (TREE_REALPART (expr
));
1932 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1933 high
= TREE_INT_CST_HIGH (expr
);
1934 low
= TREE_INT_CST_LOW (expr
);
1936 /* First clear all bits that are beyond the type's precision in case
1937 we've been sign extended. */
1939 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1941 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1942 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1946 if (prec
< HOST_BITS_PER_WIDE_INT
)
1947 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1950 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1951 : exact_log2 (low
));
1954 /* Similar, but return the largest integer Y such that 2 ** Y is less
1955 than or equal to EXPR. */
1958 tree_floor_log2 (const_tree expr
)
1961 HOST_WIDE_INT high
, low
;
1965 if (TREE_CODE (expr
) == COMPLEX_CST
)
1966 return tree_log2 (TREE_REALPART (expr
));
1968 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1969 high
= TREE_INT_CST_HIGH (expr
);
1970 low
= TREE_INT_CST_LOW (expr
);
1972 /* First clear all bits that are beyond the type's precision in case
1973 we've been sign extended. Ignore if type's precision hasn't been set
1974 since what we are doing is setting it. */
1976 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
1978 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1979 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1983 if (prec
< HOST_BITS_PER_WIDE_INT
)
1984 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1987 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1988 : floor_log2 (low
));
1991 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1992 decimal float constants, so don't return 1 for them. */
1995 real_zerop (const_tree expr
)
1999 return ((TREE_CODE (expr
) == REAL_CST
2000 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2001 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2002 || (TREE_CODE (expr
) == COMPLEX_CST
2003 && real_zerop (TREE_REALPART (expr
))
2004 && real_zerop (TREE_IMAGPART (expr
))));
2007 /* Return 1 if EXPR is the real constant one in real or complex form.
2008 Trailing zeroes matter for decimal float constants, so don't return
2012 real_onep (const_tree expr
)
2016 return ((TREE_CODE (expr
) == REAL_CST
2017 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2018 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2019 || (TREE_CODE (expr
) == COMPLEX_CST
2020 && real_onep (TREE_REALPART (expr
))
2021 && real_zerop (TREE_IMAGPART (expr
))));
2024 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2025 for decimal float constants, so don't return 1 for them. */
2028 real_twop (const_tree expr
)
2032 return ((TREE_CODE (expr
) == REAL_CST
2033 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2034 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2035 || (TREE_CODE (expr
) == COMPLEX_CST
2036 && real_twop (TREE_REALPART (expr
))
2037 && real_zerop (TREE_IMAGPART (expr
))));
2040 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2041 matter for decimal float constants, so don't return 1 for them. */
2044 real_minus_onep (const_tree expr
)
2048 return ((TREE_CODE (expr
) == REAL_CST
2049 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2050 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2051 || (TREE_CODE (expr
) == COMPLEX_CST
2052 && real_minus_onep (TREE_REALPART (expr
))
2053 && real_zerop (TREE_IMAGPART (expr
))));
2056 /* Nonzero if EXP is a constant or a cast of a constant. */
2059 really_constant_p (const_tree exp
)
2061 /* This is not quite the same as STRIP_NOPS. It does more. */
2062 while (CONVERT_EXPR_P (exp
)
2063 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2064 exp
= TREE_OPERAND (exp
, 0);
2065 return TREE_CONSTANT (exp
);
2068 /* Return first list element whose TREE_VALUE is ELEM.
2069 Return 0 if ELEM is not in LIST. */
2072 value_member (tree elem
, tree list
)
2076 if (elem
== TREE_VALUE (list
))
2078 list
= TREE_CHAIN (list
);
2083 /* Return first list element whose TREE_PURPOSE is ELEM.
2084 Return 0 if ELEM is not in LIST. */
2087 purpose_member (const_tree elem
, tree list
)
2091 if (elem
== TREE_PURPOSE (list
))
2093 list
= TREE_CHAIN (list
);
2098 /* Return true if ELEM is in V. */
2101 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2105 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2111 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2115 chain_index (int idx
, tree chain
)
2117 for (; chain
&& idx
> 0; --idx
)
2118 chain
= TREE_CHAIN (chain
);
2122 /* Return nonzero if ELEM is part of the chain CHAIN. */
2125 chain_member (const_tree elem
, const_tree chain
)
2131 chain
= DECL_CHAIN (chain
);
2137 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2138 We expect a null pointer to mark the end of the chain.
2139 This is the Lisp primitive `length'. */
2142 list_length (const_tree t
)
2145 #ifdef ENABLE_TREE_CHECKING
2153 #ifdef ENABLE_TREE_CHECKING
2156 gcc_assert (p
!= q
);
2164 /* Returns the number of FIELD_DECLs in TYPE. */
2167 fields_length (const_tree type
)
2169 tree t
= TYPE_FIELDS (type
);
2172 for (; t
; t
= DECL_CHAIN (t
))
2173 if (TREE_CODE (t
) == FIELD_DECL
)
2179 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2180 UNION_TYPE TYPE, or NULL_TREE if none. */
2183 first_field (const_tree type
)
2185 tree t
= TYPE_FIELDS (type
);
2186 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2191 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2192 by modifying the last node in chain 1 to point to chain 2.
2193 This is the Lisp primitive `nconc'. */
2196 chainon (tree op1
, tree op2
)
2205 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2207 TREE_CHAIN (t1
) = op2
;
2209 #ifdef ENABLE_TREE_CHECKING
2212 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2213 gcc_assert (t2
!= t1
);
2220 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2223 tree_last (tree chain
)
2227 while ((next
= TREE_CHAIN (chain
)))
2232 /* Reverse the order of elements in the chain T,
2233 and return the new head of the chain (old last element). */
2238 tree prev
= 0, decl
, next
;
2239 for (decl
= t
; decl
; decl
= next
)
2241 /* We shouldn't be using this function to reverse BLOCK chains; we
2242 have blocks_nreverse for that. */
2243 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2244 next
= TREE_CHAIN (decl
);
2245 TREE_CHAIN (decl
) = prev
;
2251 /* Return a newly created TREE_LIST node whose
2252 purpose and value fields are PARM and VALUE. */
2255 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2257 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2258 TREE_PURPOSE (t
) = parm
;
2259 TREE_VALUE (t
) = value
;
2263 /* Build a chain of TREE_LIST nodes from a vector. */
2266 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2268 tree ret
= NULL_TREE
;
2272 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2274 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2275 pp
= &TREE_CHAIN (*pp
);
2280 /* Return a newly created TREE_LIST node whose
2281 purpose and value fields are PURPOSE and VALUE
2282 and whose TREE_CHAIN is CHAIN. */
2285 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2289 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2291 memset (node
, 0, sizeof (struct tree_common
));
2293 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2295 TREE_SET_CODE (node
, TREE_LIST
);
2296 TREE_CHAIN (node
) = chain
;
2297 TREE_PURPOSE (node
) = purpose
;
2298 TREE_VALUE (node
) = value
;
2302 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2306 ctor_to_vec (tree ctor
)
2308 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2312 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2313 VEC_quick_push (tree
, vec
, val
);
2318 /* Return the size nominally occupied by an object of type TYPE
2319 when it resides in memory. The value is measured in units of bytes,
2320 and its data type is that normally used for type sizes
2321 (which is the first type created by make_signed_type or
2322 make_unsigned_type). */
2325 size_in_bytes (const_tree type
)
2329 if (type
== error_mark_node
)
2330 return integer_zero_node
;
2332 type
= TYPE_MAIN_VARIANT (type
);
2333 t
= TYPE_SIZE_UNIT (type
);
2337 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2338 return size_zero_node
;
2344 /* Return the size of TYPE (in bytes) as a wide integer
2345 or return -1 if the size can vary or is larger than an integer. */
2348 int_size_in_bytes (const_tree type
)
2352 if (type
== error_mark_node
)
2355 type
= TYPE_MAIN_VARIANT (type
);
2356 t
= TYPE_SIZE_UNIT (type
);
2358 || TREE_CODE (t
) != INTEGER_CST
2359 || TREE_INT_CST_HIGH (t
) != 0
2360 /* If the result would appear negative, it's too big to represent. */
2361 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2364 return TREE_INT_CST_LOW (t
);
2367 /* Return the maximum size of TYPE (in bytes) as a wide integer
2368 or return -1 if the size can vary or is larger than an integer. */
2371 max_int_size_in_bytes (const_tree type
)
2373 HOST_WIDE_INT size
= -1;
2376 /* If this is an array type, check for a possible MAX_SIZE attached. */
2378 if (TREE_CODE (type
) == ARRAY_TYPE
)
2380 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2382 if (size_tree
&& host_integerp (size_tree
, 1))
2383 size
= tree_low_cst (size_tree
, 1);
2386 /* If we still haven't been able to get a size, see if the language
2387 can compute a maximum size. */
2391 size_tree
= lang_hooks
.types
.max_size (type
);
2393 if (size_tree
&& host_integerp (size_tree
, 1))
2394 size
= tree_low_cst (size_tree
, 1);
2400 /* Returns a tree for the size of EXP in bytes. */
2403 tree_expr_size (const_tree exp
)
2406 && DECL_SIZE_UNIT (exp
) != 0)
2407 return DECL_SIZE_UNIT (exp
);
2409 return size_in_bytes (TREE_TYPE (exp
));
2412 /* Return the bit position of FIELD, in bits from the start of the record.
2413 This is a tree of type bitsizetype. */
2416 bit_position (const_tree field
)
2418 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2419 DECL_FIELD_BIT_OFFSET (field
));
2422 /* Likewise, but return as an integer. It must be representable in
2423 that way (since it could be a signed value, we don't have the
2424 option of returning -1 like int_size_in_byte can. */
2427 int_bit_position (const_tree field
)
2429 return tree_low_cst (bit_position (field
), 0);
2432 /* Return the byte position of FIELD, in bytes from the start of the record.
2433 This is a tree of type sizetype. */
2436 byte_position (const_tree field
)
2438 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2439 DECL_FIELD_BIT_OFFSET (field
));
2442 /* Likewise, but return as an integer. It must be representable in
2443 that way (since it could be a signed value, we don't have the
2444 option of returning -1 like int_size_in_byte can. */
2447 int_byte_position (const_tree field
)
2449 return tree_low_cst (byte_position (field
), 0);
2452 /* Return the strictest alignment, in bits, that T is known to have. */
2455 expr_align (const_tree t
)
2457 unsigned int align0
, align1
;
2459 switch (TREE_CODE (t
))
2461 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2462 /* If we have conversions, we know that the alignment of the
2463 object must meet each of the alignments of the types. */
2464 align0
= expr_align (TREE_OPERAND (t
, 0));
2465 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2466 return MAX (align0
, align1
);
2468 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2469 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2470 case CLEANUP_POINT_EXPR
:
2471 /* These don't change the alignment of an object. */
2472 return expr_align (TREE_OPERAND (t
, 0));
2475 /* The best we can do is say that the alignment is the least aligned
2477 align0
= expr_align (TREE_OPERAND (t
, 1));
2478 align1
= expr_align (TREE_OPERAND (t
, 2));
2479 return MIN (align0
, align1
);
2481 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2482 meaningfully, it's always 1. */
2483 case LABEL_DECL
: case CONST_DECL
:
2484 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2486 gcc_assert (DECL_ALIGN (t
) != 0);
2487 return DECL_ALIGN (t
);
2493 /* Otherwise take the alignment from that of the type. */
2494 return TYPE_ALIGN (TREE_TYPE (t
));
2497 /* Return, as a tree node, the number of elements for TYPE (which is an
2498 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2501 array_type_nelts (const_tree type
)
2503 tree index_type
, min
, max
;
2505 /* If they did it with unspecified bounds, then we should have already
2506 given an error about it before we got here. */
2507 if (! TYPE_DOMAIN (type
))
2508 return error_mark_node
;
2510 index_type
= TYPE_DOMAIN (type
);
2511 min
= TYPE_MIN_VALUE (index_type
);
2512 max
= TYPE_MAX_VALUE (index_type
);
2514 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2516 return error_mark_node
;
2518 return (integer_zerop (min
)
2520 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2523 /* If arg is static -- a reference to an object in static storage -- then
2524 return the object. This is not the same as the C meaning of `static'.
2525 If arg isn't static, return NULL. */
2530 switch (TREE_CODE (arg
))
2533 /* Nested functions are static, even though taking their address will
2534 involve a trampoline as we unnest the nested function and create
2535 the trampoline on the tree level. */
2539 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2540 && ! DECL_THREAD_LOCAL_P (arg
)
2541 && ! DECL_DLLIMPORT_P (arg
)
2545 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2549 return TREE_STATIC (arg
) ? arg
: NULL
;
2556 /* If the thing being referenced is not a field, then it is
2557 something language specific. */
2558 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2560 /* If we are referencing a bitfield, we can't evaluate an
2561 ADDR_EXPR at compile time and so it isn't a constant. */
2562 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2565 return staticp (TREE_OPERAND (arg
, 0));
2571 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2574 case ARRAY_RANGE_REF
:
2575 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2576 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2577 return staticp (TREE_OPERAND (arg
, 0));
2581 case COMPOUND_LITERAL_EXPR
:
2582 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2592 /* Return whether OP is a DECL whose address is function-invariant. */
2595 decl_address_invariant_p (const_tree op
)
2597 /* The conditions below are slightly less strict than the one in
2600 switch (TREE_CODE (op
))
2609 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2610 || DECL_THREAD_LOCAL_P (op
)
2611 || DECL_CONTEXT (op
) == current_function_decl
2612 || decl_function_context (op
) == current_function_decl
)
2617 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2618 || decl_function_context (op
) == current_function_decl
)
2629 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2632 decl_address_ip_invariant_p (const_tree op
)
2634 /* The conditions below are slightly less strict than the one in
2637 switch (TREE_CODE (op
))
2645 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2646 && !DECL_DLLIMPORT_P (op
))
2647 || DECL_THREAD_LOCAL_P (op
))
2652 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2664 /* Return true if T is function-invariant (internal function, does
2665 not handle arithmetic; that's handled in skip_simple_arithmetic and
2666 tree_invariant_p). */
2668 static bool tree_invariant_p (tree t
);
2671 tree_invariant_p_1 (tree t
)
2675 if (TREE_CONSTANT (t
)
2676 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2679 switch (TREE_CODE (t
))
2685 op
= TREE_OPERAND (t
, 0);
2686 while (handled_component_p (op
))
2688 switch (TREE_CODE (op
))
2691 case ARRAY_RANGE_REF
:
2692 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2693 || TREE_OPERAND (op
, 2) != NULL_TREE
2694 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2699 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2705 op
= TREE_OPERAND (op
, 0);
2708 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2717 /* Return true if T is function-invariant. */
2720 tree_invariant_p (tree t
)
2722 tree inner
= skip_simple_arithmetic (t
);
2723 return tree_invariant_p_1 (inner
);
2726 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2727 Do this to any expression which may be used in more than one place,
2728 but must be evaluated only once.
2730 Normally, expand_expr would reevaluate the expression each time.
2731 Calling save_expr produces something that is evaluated and recorded
2732 the first time expand_expr is called on it. Subsequent calls to
2733 expand_expr just reuse the recorded value.
2735 The call to expand_expr that generates code that actually computes
2736 the value is the first call *at compile time*. Subsequent calls
2737 *at compile time* generate code to use the saved value.
2738 This produces correct result provided that *at run time* control
2739 always flows through the insns made by the first expand_expr
2740 before reaching the other places where the save_expr was evaluated.
2741 You, the caller of save_expr, must make sure this is so.
2743 Constants, and certain read-only nodes, are returned with no
2744 SAVE_EXPR because that is safe. Expressions containing placeholders
2745 are not touched; see tree.def for an explanation of what these
2749 save_expr (tree expr
)
2751 tree t
= fold (expr
);
2754 /* If the tree evaluates to a constant, then we don't want to hide that
2755 fact (i.e. this allows further folding, and direct checks for constants).
2756 However, a read-only object that has side effects cannot be bypassed.
2757 Since it is no problem to reevaluate literals, we just return the
2759 inner
= skip_simple_arithmetic (t
);
2760 if (TREE_CODE (inner
) == ERROR_MARK
)
2763 if (tree_invariant_p_1 (inner
))
2766 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2767 it means that the size or offset of some field of an object depends on
2768 the value within another field.
2770 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2771 and some variable since it would then need to be both evaluated once and
2772 evaluated more than once. Front-ends must assure this case cannot
2773 happen by surrounding any such subexpressions in their own SAVE_EXPR
2774 and forcing evaluation at the proper time. */
2775 if (contains_placeholder_p (inner
))
2778 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2779 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2781 /* This expression might be placed ahead of a jump to ensure that the
2782 value was computed on both sides of the jump. So make sure it isn't
2783 eliminated as dead. */
2784 TREE_SIDE_EFFECTS (t
) = 1;
2788 /* Look inside EXPR and into any simple arithmetic operations. Return
2789 the innermost non-arithmetic node. */
2792 skip_simple_arithmetic (tree expr
)
2796 /* We don't care about whether this can be used as an lvalue in this
2798 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2799 expr
= TREE_OPERAND (expr
, 0);
2801 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2802 a constant, it will be more efficient to not make another SAVE_EXPR since
2803 it will allow better simplification and GCSE will be able to merge the
2804 computations if they actually occur. */
2808 if (UNARY_CLASS_P (inner
))
2809 inner
= TREE_OPERAND (inner
, 0);
2810 else if (BINARY_CLASS_P (inner
))
2812 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2813 inner
= TREE_OPERAND (inner
, 0);
2814 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2815 inner
= TREE_OPERAND (inner
, 1);
2827 /* Return which tree structure is used by T. */
2829 enum tree_node_structure_enum
2830 tree_node_structure (const_tree t
)
2832 const enum tree_code code
= TREE_CODE (t
);
2833 return tree_node_structure_for_code (code
);
2836 /* Set various status flags when building a CALL_EXPR object T. */
2839 process_call_operands (tree t
)
2841 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2842 bool read_only
= false;
2843 int i
= call_expr_flags (t
);
2845 /* Calls have side-effects, except those to const or pure functions. */
2846 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2847 side_effects
= true;
2848 /* Propagate TREE_READONLY of arguments for const functions. */
2852 if (!side_effects
|| read_only
)
2853 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2855 tree op
= TREE_OPERAND (t
, i
);
2856 if (op
&& TREE_SIDE_EFFECTS (op
))
2857 side_effects
= true;
2858 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2862 TREE_SIDE_EFFECTS (t
) = side_effects
;
2863 TREE_READONLY (t
) = read_only
;
2866 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2867 size or offset that depends on a field within a record. */
2870 contains_placeholder_p (const_tree exp
)
2872 enum tree_code code
;
2877 code
= TREE_CODE (exp
);
2878 if (code
== PLACEHOLDER_EXPR
)
2881 switch (TREE_CODE_CLASS (code
))
2884 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2885 position computations since they will be converted into a
2886 WITH_RECORD_EXPR involving the reference, which will assume
2887 here will be valid. */
2888 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2890 case tcc_exceptional
:
2891 if (code
== TREE_LIST
)
2892 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2893 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2898 case tcc_comparison
:
2899 case tcc_expression
:
2903 /* Ignoring the first operand isn't quite right, but works best. */
2904 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2907 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2908 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2909 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2912 /* The save_expr function never wraps anything containing
2913 a PLACEHOLDER_EXPR. */
2920 switch (TREE_CODE_LENGTH (code
))
2923 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2925 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2926 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2937 const_call_expr_arg_iterator iter
;
2938 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2939 if (CONTAINS_PLACEHOLDER_P (arg
))
2953 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2954 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2958 type_contains_placeholder_1 (const_tree type
)
2960 /* If the size contains a placeholder or the parent type (component type in
2961 the case of arrays) type involves a placeholder, this type does. */
2962 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2963 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2964 || (!POINTER_TYPE_P (type
)
2966 && type_contains_placeholder_p (TREE_TYPE (type
))))
2969 /* Now do type-specific checks. Note that the last part of the check above
2970 greatly limits what we have to do below. */
2971 switch (TREE_CODE (type
))
2979 case REFERENCE_TYPE
:
2988 case FIXED_POINT_TYPE
:
2989 /* Here we just check the bounds. */
2990 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2991 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2994 /* We have already checked the component type above, so just check the
2996 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3000 case QUAL_UNION_TYPE
:
3004 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3005 if (TREE_CODE (field
) == FIELD_DECL
3006 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3007 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3008 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3009 || type_contains_placeholder_p (TREE_TYPE (field
))))
3020 /* Wrapper around above function used to cache its result. */
3023 type_contains_placeholder_p (tree type
)
3027 /* If the contains_placeholder_bits field has been initialized,
3028 then we know the answer. */
3029 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3030 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3032 /* Indicate that we've seen this type node, and the answer is false.
3033 This is what we want to return if we run into recursion via fields. */
3034 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3036 /* Compute the real value. */
3037 result
= type_contains_placeholder_1 (type
);
3039 /* Store the real value. */
3040 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3045 /* Push tree EXP onto vector QUEUE if it is not already present. */
3048 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
3053 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
3054 if (simple_cst_equal (iter
, exp
) == 1)
3058 VEC_safe_push (tree
, heap
, *queue
, exp
);
3061 /* Given a tree EXP, find all occurrences of references to fields
3062 in a PLACEHOLDER_EXPR and place them in vector REFS without
3063 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3064 we assume here that EXP contains only arithmetic expressions
3065 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3069 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3071 enum tree_code code
= TREE_CODE (exp
);
3075 /* We handle TREE_LIST and COMPONENT_REF separately. */
3076 if (code
== TREE_LIST
)
3078 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3079 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3081 else if (code
== COMPONENT_REF
)
3083 for (inner
= TREE_OPERAND (exp
, 0);
3084 REFERENCE_CLASS_P (inner
);
3085 inner
= TREE_OPERAND (inner
, 0))
3088 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3089 push_without_duplicates (exp
, refs
);
3091 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3094 switch (TREE_CODE_CLASS (code
))
3099 case tcc_declaration
:
3100 /* Variables allocated to static storage can stay. */
3101 if (!TREE_STATIC (exp
))
3102 push_without_duplicates (exp
, refs
);
3105 case tcc_expression
:
3106 /* This is the pattern built in ada/make_aligning_type. */
3107 if (code
== ADDR_EXPR
3108 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3110 push_without_duplicates (exp
, refs
);
3114 /* Fall through... */
3116 case tcc_exceptional
:
3119 case tcc_comparison
:
3121 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3122 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3126 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3127 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3135 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3136 return a tree with all occurrences of references to F in a
3137 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3138 CONST_DECLs. Note that we assume here that EXP contains only
3139 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3140 occurring only in their argument list. */
3143 substitute_in_expr (tree exp
, tree f
, tree r
)
3145 enum tree_code code
= TREE_CODE (exp
);
3146 tree op0
, op1
, op2
, op3
;
3149 /* We handle TREE_LIST and COMPONENT_REF separately. */
3150 if (code
== TREE_LIST
)
3152 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3153 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3154 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3157 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3159 else if (code
== COMPONENT_REF
)
3163 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3164 and it is the right field, replace it with R. */
3165 for (inner
= TREE_OPERAND (exp
, 0);
3166 REFERENCE_CLASS_P (inner
);
3167 inner
= TREE_OPERAND (inner
, 0))
3171 op1
= TREE_OPERAND (exp
, 1);
3173 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3176 /* If this expression hasn't been completed let, leave it alone. */
3177 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3180 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3181 if (op0
== TREE_OPERAND (exp
, 0))
3185 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3188 switch (TREE_CODE_CLASS (code
))
3193 case tcc_declaration
:
3199 case tcc_expression
:
3203 /* Fall through... */
3205 case tcc_exceptional
:
3208 case tcc_comparison
:
3210 switch (TREE_CODE_LENGTH (code
))
3216 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3217 if (op0
== TREE_OPERAND (exp
, 0))
3220 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3224 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3225 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3227 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3230 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3234 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3235 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3236 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3238 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3239 && op2
== TREE_OPERAND (exp
, 2))
3242 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3246 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3247 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3248 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3249 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3251 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3252 && op2
== TREE_OPERAND (exp
, 2)
3253 && op3
== TREE_OPERAND (exp
, 3))
3257 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3269 new_tree
= NULL_TREE
;
3271 /* If we are trying to replace F with a constant, inline back
3272 functions which do nothing else than computing a value from
3273 the arguments they are passed. This makes it possible to
3274 fold partially or entirely the replacement expression. */
3275 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3277 tree t
= maybe_inline_call_in_expr (exp
);
3279 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3282 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3284 tree op
= TREE_OPERAND (exp
, i
);
3285 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3289 new_tree
= copy_node (exp
);
3290 TREE_OPERAND (new_tree
, i
) = new_op
;
3296 new_tree
= fold (new_tree
);
3297 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3298 process_call_operands (new_tree
);
3309 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3311 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3312 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3317 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3318 for it within OBJ, a tree that is an object or a chain of references. */
3321 substitute_placeholder_in_expr (tree exp
, tree obj
)
3323 enum tree_code code
= TREE_CODE (exp
);
3324 tree op0
, op1
, op2
, op3
;
3327 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3328 in the chain of OBJ. */
3329 if (code
== PLACEHOLDER_EXPR
)
3331 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3334 for (elt
= obj
; elt
!= 0;
3335 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3336 || TREE_CODE (elt
) == COND_EXPR
)
3337 ? TREE_OPERAND (elt
, 1)
3338 : (REFERENCE_CLASS_P (elt
)
3339 || UNARY_CLASS_P (elt
)
3340 || BINARY_CLASS_P (elt
)
3341 || VL_EXP_CLASS_P (elt
)
3342 || EXPRESSION_CLASS_P (elt
))
3343 ? TREE_OPERAND (elt
, 0) : 0))
3344 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3347 for (elt
= obj
; elt
!= 0;
3348 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3349 || TREE_CODE (elt
) == COND_EXPR
)
3350 ? TREE_OPERAND (elt
, 1)
3351 : (REFERENCE_CLASS_P (elt
)
3352 || UNARY_CLASS_P (elt
)
3353 || BINARY_CLASS_P (elt
)
3354 || VL_EXP_CLASS_P (elt
)
3355 || EXPRESSION_CLASS_P (elt
))
3356 ? TREE_OPERAND (elt
, 0) : 0))
3357 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3358 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3360 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3362 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3363 survives until RTL generation, there will be an error. */
3367 /* TREE_LIST is special because we need to look at TREE_VALUE
3368 and TREE_CHAIN, not TREE_OPERANDS. */
3369 else if (code
== TREE_LIST
)
3371 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3372 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3373 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3376 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3379 switch (TREE_CODE_CLASS (code
))
3382 case tcc_declaration
:
3385 case tcc_exceptional
:
3388 case tcc_comparison
:
3389 case tcc_expression
:
3392 switch (TREE_CODE_LENGTH (code
))
3398 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3399 if (op0
== TREE_OPERAND (exp
, 0))
3402 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3406 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3407 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3409 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3412 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3416 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3417 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3418 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3420 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3421 && op2
== TREE_OPERAND (exp
, 2))
3424 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3428 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3429 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3430 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3431 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3433 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3434 && op2
== TREE_OPERAND (exp
, 2)
3435 && op3
== TREE_OPERAND (exp
, 3))
3439 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3451 new_tree
= NULL_TREE
;
3453 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3455 tree op
= TREE_OPERAND (exp
, i
);
3456 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3460 new_tree
= copy_node (exp
);
3461 TREE_OPERAND (new_tree
, i
) = new_op
;
3467 new_tree
= fold (new_tree
);
3468 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3469 process_call_operands (new_tree
);
3480 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3482 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3483 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3488 /* Stabilize a reference so that we can use it any number of times
3489 without causing its operands to be evaluated more than once.
3490 Returns the stabilized reference. This works by means of save_expr,
3491 so see the caveats in the comments about save_expr.
3493 Also allows conversion expressions whose operands are references.
3494 Any other kind of expression is returned unchanged. */
3497 stabilize_reference (tree ref
)
3500 enum tree_code code
= TREE_CODE (ref
);
3507 /* No action is needed in this case. */
3512 case FIX_TRUNC_EXPR
:
3513 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3517 result
= build_nt (INDIRECT_REF
,
3518 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3522 result
= build_nt (COMPONENT_REF
,
3523 stabilize_reference (TREE_OPERAND (ref
, 0)),
3524 TREE_OPERAND (ref
, 1), NULL_TREE
);
3528 result
= build_nt (BIT_FIELD_REF
,
3529 stabilize_reference (TREE_OPERAND (ref
, 0)),
3530 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3531 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3535 result
= build_nt (ARRAY_REF
,
3536 stabilize_reference (TREE_OPERAND (ref
, 0)),
3537 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3538 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3541 case ARRAY_RANGE_REF
:
3542 result
= build_nt (ARRAY_RANGE_REF
,
3543 stabilize_reference (TREE_OPERAND (ref
, 0)),
3544 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3545 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3549 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3550 it wouldn't be ignored. This matters when dealing with
3552 return stabilize_reference_1 (ref
);
3554 /* If arg isn't a kind of lvalue we recognize, make no change.
3555 Caller should recognize the error for an invalid lvalue. */
3560 return error_mark_node
;
3563 TREE_TYPE (result
) = TREE_TYPE (ref
);
3564 TREE_READONLY (result
) = TREE_READONLY (ref
);
3565 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3566 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3571 /* Subroutine of stabilize_reference; this is called for subtrees of
3572 references. Any expression with side-effects must be put in a SAVE_EXPR
3573 to ensure that it is only evaluated once.
3575 We don't put SAVE_EXPR nodes around everything, because assigning very
3576 simple expressions to temporaries causes us to miss good opportunities
3577 for optimizations. Among other things, the opportunity to fold in the
3578 addition of a constant into an addressing mode often gets lost, e.g.
3579 "y[i+1] += x;". In general, we take the approach that we should not make
3580 an assignment unless we are forced into it - i.e., that any non-side effect
3581 operator should be allowed, and that cse should take care of coalescing
3582 multiple utterances of the same expression should that prove fruitful. */
3585 stabilize_reference_1 (tree e
)
3588 enum tree_code code
= TREE_CODE (e
);
3590 /* We cannot ignore const expressions because it might be a reference
3591 to a const array but whose index contains side-effects. But we can
3592 ignore things that are actual constant or that already have been
3593 handled by this function. */
3595 if (tree_invariant_p (e
))
3598 switch (TREE_CODE_CLASS (code
))
3600 case tcc_exceptional
:
3602 case tcc_declaration
:
3603 case tcc_comparison
:
3605 case tcc_expression
:
3608 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3609 so that it will only be evaluated once. */
3610 /* The reference (r) and comparison (<) classes could be handled as
3611 below, but it is generally faster to only evaluate them once. */
3612 if (TREE_SIDE_EFFECTS (e
))
3613 return save_expr (e
);
3617 /* Constants need no processing. In fact, we should never reach
3622 /* Division is slow and tends to be compiled with jumps,
3623 especially the division by powers of 2 that is often
3624 found inside of an array reference. So do it just once. */
3625 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3626 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3627 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3628 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3629 return save_expr (e
);
3630 /* Recursively stabilize each operand. */
3631 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3632 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3636 /* Recursively stabilize each operand. */
3637 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3644 TREE_TYPE (result
) = TREE_TYPE (e
);
3645 TREE_READONLY (result
) = TREE_READONLY (e
);
3646 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3647 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3652 /* Low-level constructors for expressions. */
3654 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3655 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3658 recompute_tree_invariant_for_addr_expr (tree t
)
3661 bool tc
= true, se
= false;
3663 /* We started out assuming this address is both invariant and constant, but
3664 does not have side effects. Now go down any handled components and see if
3665 any of them involve offsets that are either non-constant or non-invariant.
3666 Also check for side-effects.
3668 ??? Note that this code makes no attempt to deal with the case where
3669 taking the address of something causes a copy due to misalignment. */
3671 #define UPDATE_FLAGS(NODE) \
3672 do { tree _node = (NODE); \
3673 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3674 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3676 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3677 node
= TREE_OPERAND (node
, 0))
3679 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3680 array reference (probably made temporarily by the G++ front end),
3681 so ignore all the operands. */
3682 if ((TREE_CODE (node
) == ARRAY_REF
3683 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3684 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3686 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3687 if (TREE_OPERAND (node
, 2))
3688 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3689 if (TREE_OPERAND (node
, 3))
3690 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3692 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3693 FIELD_DECL, apparently. The G++ front end can put something else
3694 there, at least temporarily. */
3695 else if (TREE_CODE (node
) == COMPONENT_REF
3696 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3698 if (TREE_OPERAND (node
, 2))
3699 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3701 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3702 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3705 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3707 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3708 the address, since &(*a)->b is a form of addition. If it's a constant, the
3709 address is constant too. If it's a decl, its address is constant if the
3710 decl is static. Everything else is not constant and, furthermore,
3711 taking the address of a volatile variable is not volatile. */
3712 if (TREE_CODE (node
) == INDIRECT_REF
3713 || TREE_CODE (node
) == MEM_REF
)
3714 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3715 else if (CONSTANT_CLASS_P (node
))
3717 else if (DECL_P (node
))
3718 tc
&= (staticp (node
) != NULL_TREE
);
3722 se
|= TREE_SIDE_EFFECTS (node
);
3726 TREE_CONSTANT (t
) = tc
;
3727 TREE_SIDE_EFFECTS (t
) = se
;
3731 /* Build an expression of code CODE, data type TYPE, and operands as
3732 specified. Expressions and reference nodes can be created this way.
3733 Constants, decls, types and misc nodes cannot be.
3735 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3736 enough for all extant tree codes. */
3739 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3743 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3745 t
= make_node_stat (code PASS_MEM_STAT
);
3752 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3754 int length
= sizeof (struct tree_exp
);
3757 record_node_allocation_statistics (code
, length
);
3759 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3761 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3763 memset (t
, 0, sizeof (struct tree_common
));
3765 TREE_SET_CODE (t
, code
);
3767 TREE_TYPE (t
) = type
;
3768 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3769 TREE_OPERAND (t
, 0) = node
;
3770 TREE_BLOCK (t
) = NULL_TREE
;
3771 if (node
&& !TYPE_P (node
))
3773 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3774 TREE_READONLY (t
) = TREE_READONLY (node
);
3777 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3778 TREE_SIDE_EFFECTS (t
) = 1;
3782 /* All of these have side-effects, no matter what their
3784 TREE_SIDE_EFFECTS (t
) = 1;
3785 TREE_READONLY (t
) = 0;
3789 /* Whether a dereference is readonly has nothing to do with whether
3790 its operand is readonly. */
3791 TREE_READONLY (t
) = 0;
3796 recompute_tree_invariant_for_addr_expr (t
);
3800 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3801 && node
&& !TYPE_P (node
)
3802 && TREE_CONSTANT (node
))
3803 TREE_CONSTANT (t
) = 1;
3804 if (TREE_CODE_CLASS (code
) == tcc_reference
3805 && node
&& TREE_THIS_VOLATILE (node
))
3806 TREE_THIS_VOLATILE (t
) = 1;
3813 #define PROCESS_ARG(N) \
3815 TREE_OPERAND (t, N) = arg##N; \
3816 if (arg##N &&!TYPE_P (arg##N)) \
3818 if (TREE_SIDE_EFFECTS (arg##N)) \
3820 if (!TREE_READONLY (arg##N) \
3821 && !CONSTANT_CLASS_P (arg##N)) \
3822 (void) (read_only = 0); \
3823 if (!TREE_CONSTANT (arg##N)) \
3824 (void) (constant = 0); \
3829 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3831 bool constant
, read_only
, side_effects
;
3834 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3836 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3837 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3838 /* When sizetype precision doesn't match that of pointers
3839 we need to be able to build explicit extensions or truncations
3840 of the offset argument. */
3841 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3842 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3843 && TREE_CODE (arg1
) == INTEGER_CST
);
3845 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3846 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3847 && ptrofftype_p (TREE_TYPE (arg1
)));
3849 t
= make_node_stat (code PASS_MEM_STAT
);
3852 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3853 result based on those same flags for the arguments. But if the
3854 arguments aren't really even `tree' expressions, we shouldn't be trying
3857 /* Expressions without side effects may be constant if their
3858 arguments are as well. */
3859 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3860 || TREE_CODE_CLASS (code
) == tcc_binary
);
3862 side_effects
= TREE_SIDE_EFFECTS (t
);
3867 TREE_READONLY (t
) = read_only
;
3868 TREE_CONSTANT (t
) = constant
;
3869 TREE_SIDE_EFFECTS (t
) = side_effects
;
3870 TREE_THIS_VOLATILE (t
)
3871 = (TREE_CODE_CLASS (code
) == tcc_reference
3872 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3879 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3880 tree arg2 MEM_STAT_DECL
)
3882 bool constant
, read_only
, side_effects
;
3885 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3886 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3888 t
= make_node_stat (code PASS_MEM_STAT
);
3893 /* As a special exception, if COND_EXPR has NULL branches, we
3894 assume that it is a gimple statement and always consider
3895 it to have side effects. */
3896 if (code
== COND_EXPR
3897 && tt
== void_type_node
3898 && arg1
== NULL_TREE
3899 && arg2
== NULL_TREE
)
3900 side_effects
= true;
3902 side_effects
= TREE_SIDE_EFFECTS (t
);
3908 if (code
== COND_EXPR
)
3909 TREE_READONLY (t
) = read_only
;
3911 TREE_SIDE_EFFECTS (t
) = side_effects
;
3912 TREE_THIS_VOLATILE (t
)
3913 = (TREE_CODE_CLASS (code
) == tcc_reference
3914 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3920 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3921 tree arg2
, tree arg3 MEM_STAT_DECL
)
3923 bool constant
, read_only
, side_effects
;
3926 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3928 t
= make_node_stat (code PASS_MEM_STAT
);
3931 side_effects
= TREE_SIDE_EFFECTS (t
);
3938 TREE_SIDE_EFFECTS (t
) = side_effects
;
3939 TREE_THIS_VOLATILE (t
)
3940 = (TREE_CODE_CLASS (code
) == tcc_reference
3941 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3947 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3948 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3950 bool constant
, read_only
, side_effects
;
3953 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3955 t
= make_node_stat (code PASS_MEM_STAT
);
3958 side_effects
= TREE_SIDE_EFFECTS (t
);
3966 TREE_SIDE_EFFECTS (t
) = side_effects
;
3967 TREE_THIS_VOLATILE (t
)
3968 = (TREE_CODE_CLASS (code
) == tcc_reference
3969 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3975 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3976 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3978 bool constant
, read_only
, side_effects
;
3981 gcc_assert (code
== TARGET_MEM_REF
);
3983 t
= make_node_stat (code PASS_MEM_STAT
);
3986 side_effects
= TREE_SIDE_EFFECTS (t
);
3993 if (code
== TARGET_MEM_REF
)
3997 TREE_SIDE_EFFECTS (t
) = side_effects
;
3998 TREE_THIS_VOLATILE (t
)
3999 = (code
== TARGET_MEM_REF
4000 && arg5
&& TREE_THIS_VOLATILE (arg5
));
4005 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4006 on the pointer PTR. */
4009 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4011 HOST_WIDE_INT offset
= 0;
4012 tree ptype
= TREE_TYPE (ptr
);
4014 /* For convenience allow addresses that collapse to a simple base
4016 if (TREE_CODE (ptr
) == ADDR_EXPR
4017 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4018 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4020 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4022 ptr
= build_fold_addr_expr (ptr
);
4023 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4025 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4026 ptr
, build_int_cst (ptype
, offset
));
4027 SET_EXPR_LOCATION (tem
, loc
);
4031 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4034 mem_ref_offset (const_tree t
)
4036 tree toff
= TREE_OPERAND (t
, 1);
4037 return double_int_sext (tree_to_double_int (toff
),
4038 TYPE_PRECISION (TREE_TYPE (toff
)));
4041 /* Return the pointer-type relevant for TBAA purposes from the
4042 gimple memory reference tree T. This is the type to be used for
4043 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4046 reference_alias_ptr_type (const_tree t
)
4048 const_tree base
= t
;
4049 while (handled_component_p (base
))
4050 base
= TREE_OPERAND (base
, 0);
4051 if (TREE_CODE (base
) == MEM_REF
)
4052 return TREE_TYPE (TREE_OPERAND (base
, 1));
4053 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4054 return TREE_TYPE (TMR_OFFSET (base
));
4056 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4059 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4060 offsetted by OFFSET units. */
4063 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4065 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4066 build_fold_addr_expr (base
),
4067 build_int_cst (ptr_type_node
, offset
));
4068 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4069 recompute_tree_invariant_for_addr_expr (addr
);
4073 /* Similar except don't specify the TREE_TYPE
4074 and leave the TREE_SIDE_EFFECTS as 0.
4075 It is permissible for arguments to be null,
4076 or even garbage if their values do not matter. */
4079 build_nt (enum tree_code code
, ...)
4086 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4090 t
= make_node (code
);
4091 length
= TREE_CODE_LENGTH (code
);
4093 for (i
= 0; i
< length
; i
++)
4094 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4100 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4104 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4109 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4110 CALL_EXPR_FN (ret
) = fn
;
4111 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4112 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4113 CALL_EXPR_ARG (ret
, ix
) = t
;
4117 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4118 We do NOT enter this node in any sort of symbol table.
4120 LOC is the location of the decl.
4122 layout_decl is used to set up the decl's storage layout.
4123 Other slots are initialized to 0 or null pointers. */
4126 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4127 tree type MEM_STAT_DECL
)
4131 t
= make_node_stat (code PASS_MEM_STAT
);
4132 DECL_SOURCE_LOCATION (t
) = loc
;
4134 /* if (type == error_mark_node)
4135 type = integer_type_node; */
4136 /* That is not done, deliberately, so that having error_mark_node
4137 as the type can suppress useless errors in the use of this variable. */
4139 DECL_NAME (t
) = name
;
4140 TREE_TYPE (t
) = type
;
4142 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4148 /* Builds and returns function declaration with NAME and TYPE. */
4151 build_fn_decl (const char *name
, tree type
)
4153 tree id
= get_identifier (name
);
4154 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4156 DECL_EXTERNAL (decl
) = 1;
4157 TREE_PUBLIC (decl
) = 1;
4158 DECL_ARTIFICIAL (decl
) = 1;
4159 TREE_NOTHROW (decl
) = 1;
4164 VEC(tree
,gc
) *all_translation_units
;
4166 /* Builds a new translation-unit decl with name NAME, queues it in the
4167 global list of translation-unit decls and returns it. */
4170 build_translation_unit_decl (tree name
)
4172 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4174 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4175 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4180 /* BLOCK nodes are used to represent the structure of binding contours
4181 and declarations, once those contours have been exited and their contents
4182 compiled. This information is used for outputting debugging info. */
4185 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4187 tree block
= make_node (BLOCK
);
4189 BLOCK_VARS (block
) = vars
;
4190 BLOCK_SUBBLOCKS (block
) = subblocks
;
4191 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4192 BLOCK_CHAIN (block
) = chain
;
4197 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4199 LOC is the location to use in tree T. */
4202 protected_set_expr_location (tree t
, location_t loc
)
4204 if (t
&& CAN_HAVE_LOCATION_P (t
))
4205 SET_EXPR_LOCATION (t
, loc
);
4208 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4212 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4214 DECL_ATTRIBUTES (ddecl
) = attribute
;
4218 /* Borrowed from hashtab.c iterative_hash implementation. */
4219 #define mix(a,b,c) \
4221 a -= b; a -= c; a ^= (c>>13); \
4222 b -= c; b -= a; b ^= (a<< 8); \
4223 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4224 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4225 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4226 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4227 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4228 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4229 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4233 /* Produce good hash value combining VAL and VAL2. */
4235 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4237 /* the golden ratio; an arbitrary value. */
4238 hashval_t a
= 0x9e3779b9;
4244 /* Produce good hash value combining VAL and VAL2. */
4246 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4248 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4249 return iterative_hash_hashval_t (val
, val2
);
4252 hashval_t a
= (hashval_t
) val
;
4253 /* Avoid warnings about shifting of more than the width of the type on
4254 hosts that won't execute this path. */
4256 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4258 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4260 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4261 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4268 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4269 is ATTRIBUTE and its qualifiers are QUALS.
4271 Record such modified types already made so we don't make duplicates. */
4274 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4276 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4278 hashval_t hashcode
= 0;
4280 enum tree_code code
= TREE_CODE (ttype
);
4282 /* Building a distinct copy of a tagged type is inappropriate; it
4283 causes breakage in code that expects there to be a one-to-one
4284 relationship between a struct and its fields.
4285 build_duplicate_type is another solution (as used in
4286 handle_transparent_union_attribute), but that doesn't play well
4287 with the stronger C++ type identity model. */
4288 if (TREE_CODE (ttype
) == RECORD_TYPE
4289 || TREE_CODE (ttype
) == UNION_TYPE
4290 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4291 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4293 warning (OPT_Wattributes
,
4294 "ignoring attributes applied to %qT after definition",
4295 TYPE_MAIN_VARIANT (ttype
));
4296 return build_qualified_type (ttype
, quals
);
4299 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4300 ntype
= build_distinct_type_copy (ttype
);
4302 TYPE_ATTRIBUTES (ntype
) = attribute
;
4304 hashcode
= iterative_hash_object (code
, hashcode
);
4305 if (TREE_TYPE (ntype
))
4306 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4308 hashcode
= attribute_hash_list (attribute
, hashcode
);
4310 switch (TREE_CODE (ntype
))
4313 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4316 if (TYPE_DOMAIN (ntype
))
4317 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4321 hashcode
= iterative_hash_object
4322 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4323 hashcode
= iterative_hash_object
4324 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4327 case FIXED_POINT_TYPE
:
4329 unsigned int precision
= TYPE_PRECISION (ntype
);
4330 hashcode
= iterative_hash_object (precision
, hashcode
);
4337 ntype
= type_hash_canon (hashcode
, ntype
);
4339 /* If the target-dependent attributes make NTYPE different from
4340 its canonical type, we will need to use structural equality
4341 checks for this type. */
4342 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4343 || !comp_type_attributes (ntype
, ttype
))
4344 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4345 else if (TYPE_CANONICAL (ntype
) == ntype
)
4346 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4348 ttype
= build_qualified_type (ntype
, quals
);
4350 else if (TYPE_QUALS (ttype
) != quals
)
4351 ttype
= build_qualified_type (ttype
, quals
);
4356 /* Compare two attributes for their value identity. Return true if the
4357 attribute values are known to be equal; otherwise return false.
4361 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4363 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4366 if (TREE_VALUE (attr1
) != NULL_TREE
4367 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4368 && TREE_VALUE (attr2
) != NULL
4369 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4370 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4371 TREE_VALUE (attr2
)) == 1);
4373 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4376 /* Return 0 if the attributes for two types are incompatible, 1 if they
4377 are compatible, and 2 if they are nearly compatible (which causes a
4378 warning to be generated). */
4380 comp_type_attributes (const_tree type1
, const_tree type2
)
4382 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4383 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4388 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4390 const struct attribute_spec
*as
;
4393 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4394 if (!as
|| as
->affects_type_identity
== false)
4397 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4398 if (!attr
|| !attribute_value_equal (a
, attr
))
4403 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4405 const struct attribute_spec
*as
;
4407 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4408 if (!as
|| as
->affects_type_identity
== false)
4411 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4413 /* We don't need to compare trees again, as we did this
4414 already in first loop. */
4416 /* All types - affecting identity - are equal, so
4417 there is no need to call target hook for comparison. */
4421 /* As some type combinations - like default calling-convention - might
4422 be compatible, we have to call the target hook to get the final result. */
4423 return targetm
.comp_type_attributes (type1
, type2
);
4426 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4429 Record such modified types already made so we don't make duplicates. */
4432 build_type_attribute_variant (tree ttype
, tree attribute
)
4434 return build_type_attribute_qual_variant (ttype
, attribute
,
4435 TYPE_QUALS (ttype
));
4439 /* Reset the expression *EXPR_P, a size or position.
4441 ??? We could reset all non-constant sizes or positions. But it's cheap
4442 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4444 We need to reset self-referential sizes or positions because they cannot
4445 be gimplified and thus can contain a CALL_EXPR after the gimplification
4446 is finished, which will run afoul of LTO streaming. And they need to be
4447 reset to something essentially dummy but not constant, so as to preserve
4448 the properties of the object they are attached to. */
4451 free_lang_data_in_one_sizepos (tree
*expr_p
)
4453 tree expr
= *expr_p
;
4454 if (CONTAINS_PLACEHOLDER_P (expr
))
4455 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4459 /* Reset all the fields in a binfo node BINFO. We only keep
4460 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4463 free_lang_data_in_binfo (tree binfo
)
4468 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4470 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4471 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4472 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4473 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4475 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4476 free_lang_data_in_binfo (t
);
4480 /* Reset all language specific information still present in TYPE. */
4483 free_lang_data_in_type (tree type
)
4485 gcc_assert (TYPE_P (type
));
4487 /* Give the FE a chance to remove its own data first. */
4488 lang_hooks
.free_lang_data (type
);
4490 TREE_LANG_FLAG_0 (type
) = 0;
4491 TREE_LANG_FLAG_1 (type
) = 0;
4492 TREE_LANG_FLAG_2 (type
) = 0;
4493 TREE_LANG_FLAG_3 (type
) = 0;
4494 TREE_LANG_FLAG_4 (type
) = 0;
4495 TREE_LANG_FLAG_5 (type
) = 0;
4496 TREE_LANG_FLAG_6 (type
) = 0;
4498 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4500 /* Remove the const and volatile qualifiers from arguments. The
4501 C++ front end removes them, but the C front end does not,
4502 leading to false ODR violation errors when merging two
4503 instances of the same function signature compiled by
4504 different front ends. */
4507 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4509 tree arg_type
= TREE_VALUE (p
);
4511 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4513 int quals
= TYPE_QUALS (arg_type
)
4515 & ~TYPE_QUAL_VOLATILE
;
4516 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4517 free_lang_data_in_type (TREE_VALUE (p
));
4522 /* Remove members that are not actually FIELD_DECLs from the field
4523 list of an aggregate. These occur in C++. */
4524 if (RECORD_OR_UNION_TYPE_P (type
))
4528 /* Note that TYPE_FIELDS can be shared across distinct
4529 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4530 to be removed, we cannot set its TREE_CHAIN to NULL.
4531 Otherwise, we would not be able to find all the other fields
4532 in the other instances of this TREE_TYPE.
4534 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4536 member
= TYPE_FIELDS (type
);
4539 if (TREE_CODE (member
) == FIELD_DECL
4540 || TREE_CODE (member
) == TYPE_DECL
)
4543 TREE_CHAIN (prev
) = member
;
4545 TYPE_FIELDS (type
) = member
;
4549 member
= TREE_CHAIN (member
);
4553 TREE_CHAIN (prev
) = NULL_TREE
;
4555 TYPE_FIELDS (type
) = NULL_TREE
;
4557 TYPE_METHODS (type
) = NULL_TREE
;
4558 if (TYPE_BINFO (type
))
4559 free_lang_data_in_binfo (TYPE_BINFO (type
));
4563 /* For non-aggregate types, clear out the language slot (which
4564 overloads TYPE_BINFO). */
4565 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4567 if (INTEGRAL_TYPE_P (type
)
4568 || SCALAR_FLOAT_TYPE_P (type
)
4569 || FIXED_POINT_TYPE_P (type
))
4571 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4572 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4576 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4577 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4579 if (TYPE_CONTEXT (type
)
4580 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4582 tree ctx
= TYPE_CONTEXT (type
);
4585 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4587 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4588 TYPE_CONTEXT (type
) = ctx
;
4593 /* Return true if DECL may need an assembler name to be set. */
4596 need_assembler_name_p (tree decl
)
4598 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4599 if (TREE_CODE (decl
) != FUNCTION_DECL
4600 && TREE_CODE (decl
) != VAR_DECL
)
4603 /* If DECL already has its assembler name set, it does not need a
4605 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4606 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4609 /* Abstract decls do not need an assembler name. */
4610 if (DECL_ABSTRACT (decl
))
4613 /* For VAR_DECLs, only static, public and external symbols need an
4615 if (TREE_CODE (decl
) == VAR_DECL
4616 && !TREE_STATIC (decl
)
4617 && !TREE_PUBLIC (decl
)
4618 && !DECL_EXTERNAL (decl
))
4621 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4623 /* Do not set assembler name on builtins. Allow RTL expansion to
4624 decide whether to expand inline or via a regular call. */
4625 if (DECL_BUILT_IN (decl
)
4626 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4629 /* Functions represented in the callgraph need an assembler name. */
4630 if (cgraph_get_node (decl
) != NULL
)
4633 /* Unused and not public functions don't need an assembler name. */
4634 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4642 /* Reset all language specific information still present in symbol
4646 free_lang_data_in_decl (tree decl
)
4648 gcc_assert (DECL_P (decl
));
4650 /* Give the FE a chance to remove its own data first. */
4651 lang_hooks
.free_lang_data (decl
);
4653 TREE_LANG_FLAG_0 (decl
) = 0;
4654 TREE_LANG_FLAG_1 (decl
) = 0;
4655 TREE_LANG_FLAG_2 (decl
) = 0;
4656 TREE_LANG_FLAG_3 (decl
) = 0;
4657 TREE_LANG_FLAG_4 (decl
) = 0;
4658 TREE_LANG_FLAG_5 (decl
) = 0;
4659 TREE_LANG_FLAG_6 (decl
) = 0;
4661 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4662 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4663 if (TREE_CODE (decl
) == FIELD_DECL
)
4665 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4666 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4667 DECL_QUALIFIER (decl
) = NULL_TREE
;
4670 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4672 if (gimple_has_body_p (decl
))
4676 /* If DECL has a gimple body, then the context for its
4677 arguments must be DECL. Otherwise, it doesn't really
4678 matter, as we will not be emitting any code for DECL. In
4679 general, there may be other instances of DECL created by
4680 the front end and since PARM_DECLs are generally shared,
4681 their DECL_CONTEXT changes as the replicas of DECL are
4682 created. The only time where DECL_CONTEXT is important
4683 is for the FUNCTION_DECLs that have a gimple body (since
4684 the PARM_DECL will be used in the function's body). */
4685 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4686 DECL_CONTEXT (t
) = decl
;
4689 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4690 At this point, it is not needed anymore. */
4691 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4693 /* Clear the abstract origin if it refers to a method. Otherwise
4694 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4695 origin will not be output correctly. */
4696 if (DECL_ABSTRACT_ORIGIN (decl
)
4697 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4698 && RECORD_OR_UNION_TYPE_P
4699 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4700 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4702 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4703 DECL_VINDEX referring to itself into a vtable slot number as it
4704 should. Happens with functions that are copied and then forgotten
4705 about. Just clear it, it won't matter anymore. */
4706 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4707 DECL_VINDEX (decl
) = NULL_TREE
;
4709 else if (TREE_CODE (decl
) == VAR_DECL
)
4711 if ((DECL_EXTERNAL (decl
)
4712 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4713 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4714 DECL_INITIAL (decl
) = NULL_TREE
;
4716 else if (TREE_CODE (decl
) == TYPE_DECL
4717 || TREE_CODE (decl
) == FIELD_DECL
)
4718 DECL_INITIAL (decl
) = NULL_TREE
;
4719 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4720 && DECL_INITIAL (decl
)
4721 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4723 /* Strip builtins from the translation-unit BLOCK. We still have targets
4724 without builtin_decl_explicit support and also builtins are shared
4725 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4726 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4730 if (TREE_CODE (var
) == FUNCTION_DECL
4731 && DECL_BUILT_IN (var
))
4732 *nextp
= TREE_CHAIN (var
);
4734 nextp
= &TREE_CHAIN (var
);
4740 /* Data used when collecting DECLs and TYPEs for language data removal. */
4742 struct free_lang_data_d
4744 /* Worklist to avoid excessive recursion. */
4745 VEC(tree
,heap
) *worklist
;
4747 /* Set of traversed objects. Used to avoid duplicate visits. */
4748 struct pointer_set_t
*pset
;
4750 /* Array of symbols to process with free_lang_data_in_decl. */
4751 VEC(tree
,heap
) *decls
;
4753 /* Array of types to process with free_lang_data_in_type. */
4754 VEC(tree
,heap
) *types
;
4758 /* Save all language fields needed to generate proper debug information
4759 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4762 save_debug_info_for_decl (tree t
)
4764 /*struct saved_debug_info_d *sdi;*/
4766 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4768 /* FIXME. Partial implementation for saving debug info removed. */
4772 /* Save all language fields needed to generate proper debug information
4773 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4776 save_debug_info_for_type (tree t
)
4778 /*struct saved_debug_info_d *sdi;*/
4780 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4782 /* FIXME. Partial implementation for saving debug info removed. */
4786 /* Add type or decl T to one of the list of tree nodes that need their
4787 language data removed. The lists are held inside FLD. */
4790 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4794 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4795 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4796 save_debug_info_for_decl (t
);
4798 else if (TYPE_P (t
))
4800 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4801 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4802 save_debug_info_for_type (t
);
4808 /* Push tree node T into FLD->WORKLIST. */
4811 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4813 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4814 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4818 /* Operand callback helper for free_lang_data_in_node. *TP is the
4819 subtree operand being considered. */
4822 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4825 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4827 if (TREE_CODE (t
) == TREE_LIST
)
4830 /* Language specific nodes will be removed, so there is no need
4831 to gather anything under them. */
4832 if (is_lang_specific (t
))
4840 /* Note that walk_tree does not traverse every possible field in
4841 decls, so we have to do our own traversals here. */
4842 add_tree_to_fld_list (t
, fld
);
4844 fld_worklist_push (DECL_NAME (t
), fld
);
4845 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4846 fld_worklist_push (DECL_SIZE (t
), fld
);
4847 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4849 /* We are going to remove everything under DECL_INITIAL for
4850 TYPE_DECLs. No point walking them. */
4851 if (TREE_CODE (t
) != TYPE_DECL
)
4852 fld_worklist_push (DECL_INITIAL (t
), fld
);
4854 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4855 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4857 if (TREE_CODE (t
) == FUNCTION_DECL
)
4859 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4860 fld_worklist_push (DECL_RESULT (t
), fld
);
4862 else if (TREE_CODE (t
) == TYPE_DECL
)
4864 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4865 fld_worklist_push (DECL_VINDEX (t
), fld
);
4866 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4868 else if (TREE_CODE (t
) == FIELD_DECL
)
4870 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4871 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4872 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4873 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4875 else if (TREE_CODE (t
) == VAR_DECL
)
4877 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4878 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4881 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4882 && DECL_HAS_VALUE_EXPR_P (t
))
4883 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4885 if (TREE_CODE (t
) != FIELD_DECL
4886 && TREE_CODE (t
) != TYPE_DECL
)
4887 fld_worklist_push (TREE_CHAIN (t
), fld
);
4890 else if (TYPE_P (t
))
4892 /* Note that walk_tree does not traverse every possible field in
4893 types, so we have to do our own traversals here. */
4894 add_tree_to_fld_list (t
, fld
);
4896 if (!RECORD_OR_UNION_TYPE_P (t
))
4897 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4898 fld_worklist_push (TYPE_SIZE (t
), fld
);
4899 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4900 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4901 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4902 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4903 fld_worklist_push (TYPE_NAME (t
), fld
);
4904 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4905 them and thus do not and want not to reach unused pointer types
4907 if (!POINTER_TYPE_P (t
))
4908 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4909 if (!RECORD_OR_UNION_TYPE_P (t
))
4910 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4911 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4912 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4913 do not and want not to reach unused variants this way. */
4914 if (TYPE_CONTEXT (t
))
4916 tree ctx
= TYPE_CONTEXT (t
);
4917 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
4918 So push that instead. */
4919 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
4920 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4921 fld_worklist_push (ctx
, fld
);
4923 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4924 and want not to reach unused types this way. */
4926 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4930 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4932 fld_worklist_push (TREE_TYPE (tem
), fld
);
4933 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4935 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4936 && TREE_CODE (tem
) == TREE_LIST
)
4939 fld_worklist_push (TREE_VALUE (tem
), fld
);
4940 tem
= TREE_CHAIN (tem
);
4944 if (RECORD_OR_UNION_TYPE_P (t
))
4947 /* Push all TYPE_FIELDS - there can be interleaving interesting
4948 and non-interesting things. */
4949 tem
= TYPE_FIELDS (t
);
4952 if (TREE_CODE (tem
) == FIELD_DECL
4953 || TREE_CODE (tem
) == TYPE_DECL
)
4954 fld_worklist_push (tem
, fld
);
4955 tem
= TREE_CHAIN (tem
);
4959 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
4962 else if (TREE_CODE (t
) == BLOCK
)
4965 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4966 fld_worklist_push (tem
, fld
);
4967 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4968 fld_worklist_push (tem
, fld
);
4969 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4972 if (TREE_CODE (t
) != IDENTIFIER_NODE
4973 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
4974 fld_worklist_push (TREE_TYPE (t
), fld
);
4980 /* Find decls and types in T. */
4983 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4987 if (!pointer_set_contains (fld
->pset
, t
))
4988 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4989 if (VEC_empty (tree
, fld
->worklist
))
4991 t
= VEC_pop (tree
, fld
->worklist
);
4995 /* Translate all the types in LIST with the corresponding runtime
4999 get_eh_types_for_runtime (tree list
)
5003 if (list
== NULL_TREE
)
5006 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5008 list
= TREE_CHAIN (list
);
5011 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5012 TREE_CHAIN (prev
) = n
;
5013 prev
= TREE_CHAIN (prev
);
5014 list
= TREE_CHAIN (list
);
5021 /* Find decls and types referenced in EH region R and store them in
5022 FLD->DECLS and FLD->TYPES. */
5025 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5036 /* The types referenced in each catch must first be changed to the
5037 EH types used at runtime. This removes references to FE types
5039 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5041 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5042 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5047 case ERT_ALLOWED_EXCEPTIONS
:
5048 r
->u
.allowed
.type_list
5049 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5050 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5053 case ERT_MUST_NOT_THROW
:
5054 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5055 find_decls_types_r
, fld
, fld
->pset
);
5061 /* Find decls and types referenced in cgraph node N and store them in
5062 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5063 look for *every* kind of DECL and TYPE node reachable from N,
5064 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5065 NAMESPACE_DECLs, etc). */
5068 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5071 struct function
*fn
;
5075 find_decls_types (n
->symbol
.decl
, fld
);
5077 if (!gimple_has_body_p (n
->symbol
.decl
))
5080 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5082 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5084 /* Traverse locals. */
5085 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5086 find_decls_types (t
, fld
);
5088 /* Traverse EH regions in FN. */
5091 FOR_ALL_EH_REGION_FN (r
, fn
)
5092 find_decls_types_in_eh_region (r
, fld
);
5095 /* Traverse every statement in FN. */
5096 FOR_EACH_BB_FN (bb
, fn
)
5098 gimple_stmt_iterator si
;
5101 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5103 gimple phi
= gsi_stmt (si
);
5105 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5107 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5108 find_decls_types (*arg_p
, fld
);
5112 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5114 gimple stmt
= gsi_stmt (si
);
5116 if (is_gimple_call (stmt
))
5117 find_decls_types (gimple_call_fntype (stmt
), fld
);
5119 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5121 tree arg
= gimple_op (stmt
, i
);
5122 find_decls_types (arg
, fld
);
5129 /* Find decls and types referenced in varpool node N and store them in
5130 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5131 look for *every* kind of DECL and TYPE node reachable from N,
5132 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5133 NAMESPACE_DECLs, etc). */
5136 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5138 find_decls_types (v
->symbol
.decl
, fld
);
5141 /* If T needs an assembler name, have one created for it. */
5144 assign_assembler_name_if_neeeded (tree t
)
5146 if (need_assembler_name_p (t
))
5148 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5149 diagnostics that use input_location to show locus
5150 information. The problem here is that, at this point,
5151 input_location is generally anchored to the end of the file
5152 (since the parser is long gone), so we don't have a good
5153 position to pin it to.
5155 To alleviate this problem, this uses the location of T's
5156 declaration. Examples of this are
5157 testsuite/g++.dg/template/cond2.C and
5158 testsuite/g++.dg/template/pr35240.C. */
5159 location_t saved_location
= input_location
;
5160 input_location
= DECL_SOURCE_LOCATION (t
);
5162 decl_assembler_name (t
);
5164 input_location
= saved_location
;
5169 /* Free language specific information for every operand and expression
5170 in every node of the call graph. This process operates in three stages:
5172 1- Every callgraph node and varpool node is traversed looking for
5173 decls and types embedded in them. This is a more exhaustive
5174 search than that done by find_referenced_vars, because it will
5175 also collect individual fields, decls embedded in types, etc.
5177 2- All the decls found are sent to free_lang_data_in_decl.
5179 3- All the types found are sent to free_lang_data_in_type.
5181 The ordering between decls and types is important because
5182 free_lang_data_in_decl sets assembler names, which includes
5183 mangling. So types cannot be freed up until assembler names have
5187 free_lang_data_in_cgraph (void)
5189 struct cgraph_node
*n
;
5190 struct varpool_node
*v
;
5191 struct free_lang_data_d fld
;
5196 /* Initialize sets and arrays to store referenced decls and types. */
5197 fld
.pset
= pointer_set_create ();
5198 fld
.worklist
= NULL
;
5199 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5200 fld
.types
= VEC_alloc (tree
, heap
, 100);
5202 /* Find decls and types in the body of every function in the callgraph. */
5203 FOR_EACH_FUNCTION (n
)
5204 find_decls_types_in_node (n
, &fld
);
5206 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5207 find_decls_types (p
->decl
, &fld
);
5209 /* Find decls and types in every varpool symbol. */
5210 FOR_EACH_VARIABLE (v
)
5211 find_decls_types_in_var (v
, &fld
);
5213 /* Set the assembler name on every decl found. We need to do this
5214 now because free_lang_data_in_decl will invalidate data needed
5215 for mangling. This breaks mangling on interdependent decls. */
5216 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5217 assign_assembler_name_if_neeeded (t
);
5219 /* Traverse every decl found freeing its language data. */
5220 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5221 free_lang_data_in_decl (t
);
5223 /* Traverse every type found freeing its language data. */
5224 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5225 free_lang_data_in_type (t
);
5227 pointer_set_destroy (fld
.pset
);
5228 VEC_free (tree
, heap
, fld
.worklist
);
5229 VEC_free (tree
, heap
, fld
.decls
);
5230 VEC_free (tree
, heap
, fld
.types
);
5234 /* Free resources that are used by FE but are not needed once they are done. */
5237 free_lang_data (void)
5241 /* If we are the LTO frontend we have freed lang-specific data already. */
5243 || !flag_generate_lto
)
5246 /* Allocate and assign alias sets to the standard integer types
5247 while the slots are still in the way the frontends generated them. */
5248 for (i
= 0; i
< itk_none
; ++i
)
5249 if (integer_types
[i
])
5250 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5252 /* Traverse the IL resetting language specific information for
5253 operands, expressions, etc. */
5254 free_lang_data_in_cgraph ();
5256 /* Create gimple variants for common types. */
5257 ptrdiff_type_node
= integer_type_node
;
5258 fileptr_type_node
= ptr_type_node
;
5260 /* Reset some langhooks. Do not reset types_compatible_p, it may
5261 still be used indirectly via the get_alias_set langhook. */
5262 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5263 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5264 /* We do not want the default decl_assembler_name implementation,
5265 rather if we have fixed everything we want a wrapper around it
5266 asserting that all non-local symbols already got their assembler
5267 name and only produce assembler names for local symbols. Or rather
5268 make sure we never call decl_assembler_name on local symbols and
5269 devise a separate, middle-end private scheme for it. */
5271 /* Reset diagnostic machinery. */
5272 tree_diagnostics_defaults (global_dc
);
5278 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5282 "*free_lang_data", /* name */
5284 free_lang_data
, /* execute */
5287 0, /* static_pass_number */
5288 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5289 0, /* properties_required */
5290 0, /* properties_provided */
5291 0, /* properties_destroyed */
5292 0, /* todo_flags_start */
5293 TODO_ggc_collect
/* todo_flags_finish */
5297 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5298 ATTR_NAME. Also used internally by remove_attribute(). */
5300 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5302 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5304 if (ident_len
== attr_len
)
5306 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5309 else if (ident_len
== attr_len
+ 4)
5311 /* There is the possibility that ATTR is 'text' and IDENT is
5313 const char *p
= IDENTIFIER_POINTER (ident
);
5314 if (p
[0] == '_' && p
[1] == '_'
5315 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5316 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5323 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5324 of ATTR_NAME, and LIST is not NULL_TREE. */
5326 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5330 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5332 if (ident_len
== attr_len
)
5334 if (strcmp (attr_name
, IDENTIFIER_POINTER (TREE_PURPOSE (list
))) == 0)
5337 /* TODO: If we made sure that attributes were stored in the
5338 canonical form without '__...__' (ie, as in 'text' as opposed
5339 to '__text__') then we could avoid the following case. */
5340 else if (ident_len
== attr_len
+ 4)
5342 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5343 if (p
[0] == '_' && p
[1] == '_'
5344 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5345 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5348 list
= TREE_CHAIN (list
);
5354 /* A variant of lookup_attribute() that can be used with an identifier
5355 as the first argument, and where the identifier can be either
5356 'text' or '__text__'.
5358 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5359 return a pointer to the attribute's list element if the attribute
5360 is part of the list, or NULL_TREE if not found. If the attribute
5361 appears more than once, this only returns the first occurrence; the
5362 TREE_CHAIN of the return value should be passed back in if further
5363 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5364 can be in the form 'text' or '__text__'. */
5366 lookup_ident_attribute (tree attr_identifier
, tree list
)
5368 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5372 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list
)) == IDENTIFIER_NODE
);
5374 /* Identifiers can be compared directly for equality. */
5375 if (attr_identifier
== TREE_PURPOSE (list
))
5378 /* If they are not equal, they may still be one in the form
5379 'text' while the other one is in the form '__text__'. TODO:
5380 If we were storing attributes in normalized 'text' form, then
5381 this could all go away and we could take full advantage of
5382 the fact that we're comparing identifiers. :-) */
5384 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5385 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5387 if (ident_len
== attr_len
+ 4)
5389 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5390 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5391 if (p
[0] == '_' && p
[1] == '_'
5392 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5393 && strncmp (q
, p
+ 2, attr_len
) == 0)
5396 else if (ident_len
+ 4 == attr_len
)
5398 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5399 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5400 if (q
[0] == '_' && q
[1] == '_'
5401 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5402 && strncmp (q
+ 2, p
, ident_len
) == 0)
5406 list
= TREE_CHAIN (list
);
5412 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5416 remove_attribute (const char *attr_name
, tree list
)
5419 size_t attr_len
= strlen (attr_name
);
5421 gcc_checking_assert (attr_name
[0] != '_');
5423 for (p
= &list
; *p
; )
5426 /* TODO: If we were storing attributes in normalized form, here
5427 we could use a simple strcmp(). */
5428 if (private_is_attribute_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5429 *p
= TREE_CHAIN (l
);
5431 p
= &TREE_CHAIN (l
);
5437 /* Return an attribute list that is the union of a1 and a2. */
5440 merge_attributes (tree a1
, tree a2
)
5444 /* Either one unset? Take the set one. */
5446 if ((attributes
= a1
) == 0)
5449 /* One that completely contains the other? Take it. */
5451 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5453 if (attribute_list_contained (a2
, a1
))
5457 /* Pick the longest list, and hang on the other list. */
5459 if (list_length (a1
) < list_length (a2
))
5460 attributes
= a2
, a2
= a1
;
5462 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5465 for (a
= lookup_ident_attribute (TREE_PURPOSE (a2
), attributes
);
5466 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5467 a
= lookup_ident_attribute (TREE_PURPOSE (a2
), TREE_CHAIN (a
)))
5471 a1
= copy_node (a2
);
5472 TREE_CHAIN (a1
) = attributes
;
5481 /* Given types T1 and T2, merge their attributes and return
5485 merge_type_attributes (tree t1
, tree t2
)
5487 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5488 TYPE_ATTRIBUTES (t2
));
5491 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5495 merge_decl_attributes (tree olddecl
, tree newdecl
)
5497 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5498 DECL_ATTRIBUTES (newdecl
));
5501 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5503 /* Specialization of merge_decl_attributes for various Windows targets.
5505 This handles the following situation:
5507 __declspec (dllimport) int foo;
5510 The second instance of `foo' nullifies the dllimport. */
5513 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5516 int delete_dllimport_p
= 1;
5518 /* What we need to do here is remove from `old' dllimport if it doesn't
5519 appear in `new'. dllimport behaves like extern: if a declaration is
5520 marked dllimport and a definition appears later, then the object
5521 is not dllimport'd. We also remove a `new' dllimport if the old list
5522 contains dllexport: dllexport always overrides dllimport, regardless
5523 of the order of declaration. */
5524 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5525 delete_dllimport_p
= 0;
5526 else if (DECL_DLLIMPORT_P (new_tree
)
5527 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5529 DECL_DLLIMPORT_P (new_tree
) = 0;
5530 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5531 "dllimport ignored", new_tree
);
5533 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5535 /* Warn about overriding a symbol that has already been used, e.g.:
5536 extern int __attribute__ ((dllimport)) foo;
5537 int* bar () {return &foo;}
5540 if (TREE_USED (old
))
5542 warning (0, "%q+D redeclared without dllimport attribute "
5543 "after being referenced with dll linkage", new_tree
);
5544 /* If we have used a variable's address with dllimport linkage,
5545 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5546 decl may already have had TREE_CONSTANT computed.
5547 We still remove the attribute so that assembler code refers
5548 to '&foo rather than '_imp__foo'. */
5549 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5550 DECL_DLLIMPORT_P (new_tree
) = 1;
5553 /* Let an inline definition silently override the external reference,
5554 but otherwise warn about attribute inconsistency. */
5555 else if (TREE_CODE (new_tree
) == VAR_DECL
5556 || !DECL_DECLARED_INLINE_P (new_tree
))
5557 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5558 "previous dllimport ignored", new_tree
);
5561 delete_dllimport_p
= 0;
5563 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5565 if (delete_dllimport_p
)
5566 a
= remove_attribute ("dllimport", a
);
5571 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5572 struct attribute_spec.handler. */
5575 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5581 /* These attributes may apply to structure and union types being created,
5582 but otherwise should pass to the declaration involved. */
5585 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5586 | (int) ATTR_FLAG_ARRAY_NEXT
))
5588 *no_add_attrs
= true;
5589 return tree_cons (name
, args
, NULL_TREE
);
5591 if (TREE_CODE (node
) == RECORD_TYPE
5592 || TREE_CODE (node
) == UNION_TYPE
)
5594 node
= TYPE_NAME (node
);
5600 warning (OPT_Wattributes
, "%qE attribute ignored",
5602 *no_add_attrs
= true;
5607 if (TREE_CODE (node
) != FUNCTION_DECL
5608 && TREE_CODE (node
) != VAR_DECL
5609 && TREE_CODE (node
) != TYPE_DECL
)
5611 *no_add_attrs
= true;
5612 warning (OPT_Wattributes
, "%qE attribute ignored",
5617 if (TREE_CODE (node
) == TYPE_DECL
5618 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5619 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5621 *no_add_attrs
= true;
5622 warning (OPT_Wattributes
, "%qE attribute ignored",
5627 is_dllimport
= is_attribute_p ("dllimport", name
);
5629 /* Report error on dllimport ambiguities seen now before they cause
5633 /* Honor any target-specific overrides. */
5634 if (!targetm
.valid_dllimport_attribute_p (node
))
5635 *no_add_attrs
= true;
5637 else if (TREE_CODE (node
) == FUNCTION_DECL
5638 && DECL_DECLARED_INLINE_P (node
))
5640 warning (OPT_Wattributes
, "inline function %q+D declared as "
5641 " dllimport: attribute ignored", node
);
5642 *no_add_attrs
= true;
5644 /* Like MS, treat definition of dllimported variables and
5645 non-inlined functions on declaration as syntax errors. */
5646 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5648 error ("function %q+D definition is marked dllimport", node
);
5649 *no_add_attrs
= true;
5652 else if (TREE_CODE (node
) == VAR_DECL
)
5654 if (DECL_INITIAL (node
))
5656 error ("variable %q+D definition is marked dllimport",
5658 *no_add_attrs
= true;
5661 /* `extern' needn't be specified with dllimport.
5662 Specify `extern' now and hope for the best. Sigh. */
5663 DECL_EXTERNAL (node
) = 1;
5664 /* Also, implicitly give dllimport'd variables declared within
5665 a function global scope, unless declared static. */
5666 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5667 TREE_PUBLIC (node
) = 1;
5670 if (*no_add_attrs
== false)
5671 DECL_DLLIMPORT_P (node
) = 1;
5673 else if (TREE_CODE (node
) == FUNCTION_DECL
5674 && DECL_DECLARED_INLINE_P (node
)
5675 && flag_keep_inline_dllexport
)
5676 /* An exported function, even if inline, must be emitted. */
5677 DECL_EXTERNAL (node
) = 0;
5679 /* Report error if symbol is not accessible at global scope. */
5680 if (!TREE_PUBLIC (node
)
5681 && (TREE_CODE (node
) == VAR_DECL
5682 || TREE_CODE (node
) == FUNCTION_DECL
))
5684 error ("external linkage required for symbol %q+D because of "
5685 "%qE attribute", node
, name
);
5686 *no_add_attrs
= true;
5689 /* A dllexport'd entity must have default visibility so that other
5690 program units (shared libraries or the main executable) can see
5691 it. A dllimport'd entity must have default visibility so that
5692 the linker knows that undefined references within this program
5693 unit can be resolved by the dynamic linker. */
5696 if (DECL_VISIBILITY_SPECIFIED (node
)
5697 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5698 error ("%qE implies default visibility, but %qD has already "
5699 "been declared with a different visibility",
5701 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5702 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5708 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5710 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5711 of the various TYPE_QUAL values. */
5714 set_type_quals (tree type
, int type_quals
)
5716 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5717 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5718 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5719 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5722 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5725 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5727 return (TYPE_QUALS (cand
) == type_quals
5728 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5729 /* Apparently this is needed for Objective-C. */
5730 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5731 /* Check alignment. */
5732 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5733 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5734 TYPE_ATTRIBUTES (base
)));
5737 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5740 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5742 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5743 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5744 /* Apparently this is needed for Objective-C. */
5745 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5746 /* Check alignment. */
5747 && TYPE_ALIGN (cand
) == align
5748 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5749 TYPE_ATTRIBUTES (base
)));
5752 /* Return a version of the TYPE, qualified as indicated by the
5753 TYPE_QUALS, if one exists. If no qualified version exists yet,
5754 return NULL_TREE. */
5757 get_qualified_type (tree type
, int type_quals
)
5761 if (TYPE_QUALS (type
) == type_quals
)
5764 /* Search the chain of variants to see if there is already one there just
5765 like the one we need to have. If so, use that existing one. We must
5766 preserve the TYPE_NAME, since there is code that depends on this. */
5767 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5768 if (check_qualified_type (t
, type
, type_quals
))
5774 /* Like get_qualified_type, but creates the type if it does not
5775 exist. This function never returns NULL_TREE. */
5778 build_qualified_type (tree type
, int type_quals
)
5782 /* See if we already have the appropriate qualified variant. */
5783 t
= get_qualified_type (type
, type_quals
);
5785 /* If not, build it. */
5788 t
= build_variant_type_copy (type
);
5789 set_type_quals (t
, type_quals
);
5791 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5792 /* Propagate structural equality. */
5793 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5794 else if (TYPE_CANONICAL (type
) != type
)
5795 /* Build the underlying canonical type, since it is different
5797 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5800 /* T is its own canonical type. */
5801 TYPE_CANONICAL (t
) = t
;
5808 /* Create a variant of type T with alignment ALIGN. */
5811 build_aligned_type (tree type
, unsigned int align
)
5815 if (TYPE_PACKED (type
)
5816 || TYPE_ALIGN (type
) == align
)
5819 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5820 if (check_aligned_type (t
, type
, align
))
5823 t
= build_variant_type_copy (type
);
5824 TYPE_ALIGN (t
) = align
;
5829 /* Create a new distinct copy of TYPE. The new type is made its own
5830 MAIN_VARIANT. If TYPE requires structural equality checks, the
5831 resulting type requires structural equality checks; otherwise, its
5832 TYPE_CANONICAL points to itself. */
5835 build_distinct_type_copy (tree type
)
5837 tree t
= copy_node (type
);
5839 TYPE_POINTER_TO (t
) = 0;
5840 TYPE_REFERENCE_TO (t
) = 0;
5842 /* Set the canonical type either to a new equivalence class, or
5843 propagate the need for structural equality checks. */
5844 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5845 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5847 TYPE_CANONICAL (t
) = t
;
5849 /* Make it its own variant. */
5850 TYPE_MAIN_VARIANT (t
) = t
;
5851 TYPE_NEXT_VARIANT (t
) = 0;
5853 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5854 whose TREE_TYPE is not t. This can also happen in the Ada
5855 frontend when using subtypes. */
5860 /* Create a new variant of TYPE, equivalent but distinct. This is so
5861 the caller can modify it. TYPE_CANONICAL for the return type will
5862 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5863 are considered equal by the language itself (or that both types
5864 require structural equality checks). */
5867 build_variant_type_copy (tree type
)
5869 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5871 t
= build_distinct_type_copy (type
);
5873 /* Since we're building a variant, assume that it is a non-semantic
5874 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5875 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5877 /* Add the new type to the chain of variants of TYPE. */
5878 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5879 TYPE_NEXT_VARIANT (m
) = t
;
5880 TYPE_MAIN_VARIANT (t
) = m
;
5885 /* Return true if the from tree in both tree maps are equal. */
5888 tree_map_base_eq (const void *va
, const void *vb
)
5890 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5891 *const b
= (const struct tree_map_base
*) vb
;
5892 return (a
->from
== b
->from
);
5895 /* Hash a from tree in a tree_base_map. */
5898 tree_map_base_hash (const void *item
)
5900 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5903 /* Return true if this tree map structure is marked for garbage collection
5904 purposes. We simply return true if the from tree is marked, so that this
5905 structure goes away when the from tree goes away. */
5908 tree_map_base_marked_p (const void *p
)
5910 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5913 /* Hash a from tree in a tree_map. */
5916 tree_map_hash (const void *item
)
5918 return (((const struct tree_map
*) item
)->hash
);
5921 /* Hash a from tree in a tree_decl_map. */
5924 tree_decl_map_hash (const void *item
)
5926 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5929 /* Return the initialization priority for DECL. */
5932 decl_init_priority_lookup (tree decl
)
5934 struct tree_priority_map
*h
;
5935 struct tree_map_base in
;
5937 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5939 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5940 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5943 /* Return the finalization priority for DECL. */
5946 decl_fini_priority_lookup (tree decl
)
5948 struct tree_priority_map
*h
;
5949 struct tree_map_base in
;
5951 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5953 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5954 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5957 /* Return the initialization and finalization priority information for
5958 DECL. If there is no previous priority information, a freshly
5959 allocated structure is returned. */
5961 static struct tree_priority_map
*
5962 decl_priority_info (tree decl
)
5964 struct tree_priority_map in
;
5965 struct tree_priority_map
*h
;
5968 in
.base
.from
= decl
;
5969 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5970 h
= (struct tree_priority_map
*) *loc
;
5973 h
= ggc_alloc_cleared_tree_priority_map ();
5975 h
->base
.from
= decl
;
5976 h
->init
= DEFAULT_INIT_PRIORITY
;
5977 h
->fini
= DEFAULT_INIT_PRIORITY
;
5983 /* Set the initialization priority for DECL to PRIORITY. */
5986 decl_init_priority_insert (tree decl
, priority_type priority
)
5988 struct tree_priority_map
*h
;
5990 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5991 if (priority
== DEFAULT_INIT_PRIORITY
)
5993 h
= decl_priority_info (decl
);
5997 /* Set the finalization priority for DECL to PRIORITY. */
6000 decl_fini_priority_insert (tree decl
, priority_type priority
)
6002 struct tree_priority_map
*h
;
6004 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6005 if (priority
== DEFAULT_INIT_PRIORITY
)
6007 h
= decl_priority_info (decl
);
6011 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6014 print_debug_expr_statistics (void)
6016 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6017 (long) htab_size (debug_expr_for_decl
),
6018 (long) htab_elements (debug_expr_for_decl
),
6019 htab_collisions (debug_expr_for_decl
));
6022 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6025 print_value_expr_statistics (void)
6027 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6028 (long) htab_size (value_expr_for_decl
),
6029 (long) htab_elements (value_expr_for_decl
),
6030 htab_collisions (value_expr_for_decl
));
6033 /* Lookup a debug expression for FROM, and return it if we find one. */
6036 decl_debug_expr_lookup (tree from
)
6038 struct tree_decl_map
*h
, in
;
6039 in
.base
.from
= from
;
6041 h
= (struct tree_decl_map
*)
6042 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6048 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6051 decl_debug_expr_insert (tree from
, tree to
)
6053 struct tree_decl_map
*h
;
6056 h
= ggc_alloc_tree_decl_map ();
6057 h
->base
.from
= from
;
6059 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6061 *(struct tree_decl_map
**) loc
= h
;
6064 /* Lookup a value expression for FROM, and return it if we find one. */
6067 decl_value_expr_lookup (tree from
)
6069 struct tree_decl_map
*h
, in
;
6070 in
.base
.from
= from
;
6072 h
= (struct tree_decl_map
*)
6073 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6079 /* Insert a mapping FROM->TO in the value expression hashtable. */
6082 decl_value_expr_insert (tree from
, tree to
)
6084 struct tree_decl_map
*h
;
6087 h
= ggc_alloc_tree_decl_map ();
6088 h
->base
.from
= from
;
6090 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6092 *(struct tree_decl_map
**) loc
= h
;
6095 /* Lookup a vector of debug arguments for FROM, and return it if we
6099 decl_debug_args_lookup (tree from
)
6101 struct tree_vec_map
*h
, in
;
6103 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6105 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6106 in
.base
.from
= from
;
6107 h
= (struct tree_vec_map
*)
6108 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6114 /* Insert a mapping FROM->empty vector of debug arguments in the value
6115 expression hashtable. */
6118 decl_debug_args_insert (tree from
)
6120 struct tree_vec_map
*h
;
6123 if (DECL_HAS_DEBUG_ARGS_P (from
))
6124 return decl_debug_args_lookup (from
);
6125 if (debug_args_for_decl
== NULL
)
6126 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6127 tree_vec_map_eq
, 0);
6128 h
= ggc_alloc_tree_vec_map ();
6129 h
->base
.from
= from
;
6131 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6133 *(struct tree_vec_map
**) loc
= h
;
6134 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6138 /* Hashing of types so that we don't make duplicates.
6139 The entry point is `type_hash_canon'. */
6141 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6142 with types in the TREE_VALUE slots), by adding the hash codes
6143 of the individual types. */
6146 type_hash_list (const_tree list
, hashval_t hashcode
)
6150 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6151 if (TREE_VALUE (tail
) != error_mark_node
)
6152 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6158 /* These are the Hashtable callback functions. */
6160 /* Returns true iff the types are equivalent. */
6163 type_hash_eq (const void *va
, const void *vb
)
6165 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6166 *const b
= (const struct type_hash
*) vb
;
6168 /* First test the things that are the same for all types. */
6169 if (a
->hash
!= b
->hash
6170 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6171 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6172 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6173 TYPE_ATTRIBUTES (b
->type
))
6174 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6175 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6178 /* Be careful about comparing arrays before and after the element type
6179 has been completed; don't compare TYPE_ALIGN unless both types are
6181 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6182 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6183 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6186 switch (TREE_CODE (a
->type
))
6191 case REFERENCE_TYPE
:
6196 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6199 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6200 && !(TYPE_VALUES (a
->type
)
6201 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6202 && TYPE_VALUES (b
->type
)
6203 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6204 && type_list_equal (TYPE_VALUES (a
->type
),
6205 TYPE_VALUES (b
->type
))))
6208 /* ... fall through ... */
6213 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6214 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6215 TYPE_MAX_VALUE (b
->type
)))
6216 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6217 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6218 TYPE_MIN_VALUE (b
->type
))));
6220 case FIXED_POINT_TYPE
:
6221 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6224 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6227 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6228 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6229 || (TYPE_ARG_TYPES (a
->type
)
6230 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6231 && TYPE_ARG_TYPES (b
->type
)
6232 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6233 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6234 TYPE_ARG_TYPES (b
->type
)))))
6238 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6242 case QUAL_UNION_TYPE
:
6243 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6244 || (TYPE_FIELDS (a
->type
)
6245 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6246 && TYPE_FIELDS (b
->type
)
6247 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6248 && type_list_equal (TYPE_FIELDS (a
->type
),
6249 TYPE_FIELDS (b
->type
))));
6252 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6253 || (TYPE_ARG_TYPES (a
->type
)
6254 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6255 && TYPE_ARG_TYPES (b
->type
)
6256 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6257 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6258 TYPE_ARG_TYPES (b
->type
))))
6266 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6267 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6272 /* Return the cached hash value. */
6275 type_hash_hash (const void *item
)
6277 return ((const struct type_hash
*) item
)->hash
;
6280 /* Look in the type hash table for a type isomorphic to TYPE.
6281 If one is found, return it. Otherwise return 0. */
6284 type_hash_lookup (hashval_t hashcode
, tree type
)
6286 struct type_hash
*h
, in
;
6288 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6289 must call that routine before comparing TYPE_ALIGNs. */
6295 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6302 /* Add an entry to the type-hash-table
6303 for a type TYPE whose hash code is HASHCODE. */
6306 type_hash_add (hashval_t hashcode
, tree type
)
6308 struct type_hash
*h
;
6311 h
= ggc_alloc_type_hash ();
6314 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6318 /* Given TYPE, and HASHCODE its hash code, return the canonical
6319 object for an identical type if one already exists.
6320 Otherwise, return TYPE, and record it as the canonical object.
6322 To use this function, first create a type of the sort you want.
6323 Then compute its hash code from the fields of the type that
6324 make it different from other similar types.
6325 Then call this function and use the value. */
6328 type_hash_canon (unsigned int hashcode
, tree type
)
6332 /* The hash table only contains main variants, so ensure that's what we're
6334 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6336 /* See if the type is in the hash table already. If so, return it.
6337 Otherwise, add the type. */
6338 t1
= type_hash_lookup (hashcode
, type
);
6341 #ifdef GATHER_STATISTICS
6342 tree_code_counts
[(int) TREE_CODE (type
)]--;
6343 tree_node_counts
[(int) t_kind
]--;
6344 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6350 type_hash_add (hashcode
, type
);
6355 /* See if the data pointed to by the type hash table is marked. We consider
6356 it marked if the type is marked or if a debug type number or symbol
6357 table entry has been made for the type. */
6360 type_hash_marked_p (const void *p
)
6362 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6364 return ggc_marked_p (type
);
6368 print_type_hash_statistics (void)
6370 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6371 (long) htab_size (type_hash_table
),
6372 (long) htab_elements (type_hash_table
),
6373 htab_collisions (type_hash_table
));
6376 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6377 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6378 by adding the hash codes of the individual attributes. */
6381 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6385 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6386 /* ??? Do we want to add in TREE_VALUE too? */
6387 hashcode
= iterative_hash_object
6388 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6392 /* Given two lists of attributes, return true if list l2 is
6393 equivalent to l1. */
6396 attribute_list_equal (const_tree l1
, const_tree l2
)
6401 return attribute_list_contained (l1
, l2
)
6402 && attribute_list_contained (l2
, l1
);
6405 /* Given two lists of attributes, return true if list L2 is
6406 completely contained within L1. */
6407 /* ??? This would be faster if attribute names were stored in a canonicalized
6408 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6409 must be used to show these elements are equivalent (which they are). */
6410 /* ??? It's not clear that attributes with arguments will always be handled
6414 attribute_list_contained (const_tree l1
, const_tree l2
)
6418 /* First check the obvious, maybe the lists are identical. */
6422 /* Maybe the lists are similar. */
6423 for (t1
= l1
, t2
= l2
;
6425 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6426 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6427 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6430 /* Maybe the lists are equal. */
6431 if (t1
== 0 && t2
== 0)
6434 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6437 /* This CONST_CAST is okay because lookup_attribute does not
6438 modify its argument and the return value is assigned to a
6440 for (attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), CONST_CAST_TREE(l1
));
6441 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6442 attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), TREE_CHAIN (attr
)))
6445 if (attr
== NULL_TREE
)
6452 /* Given two lists of types
6453 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6454 return 1 if the lists contain the same types in the same order.
6455 Also, the TREE_PURPOSEs must match. */
6458 type_list_equal (const_tree l1
, const_tree l2
)
6462 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6463 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6464 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6465 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6466 && (TREE_TYPE (TREE_PURPOSE (t1
))
6467 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6473 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6474 given by TYPE. If the argument list accepts variable arguments,
6475 then this function counts only the ordinary arguments. */
6478 type_num_arguments (const_tree type
)
6483 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6484 /* If the function does not take a variable number of arguments,
6485 the last element in the list will have type `void'. */
6486 if (VOID_TYPE_P (TREE_VALUE (t
)))
6494 /* Nonzero if integer constants T1 and T2
6495 represent the same constant value. */
6498 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6503 if (t1
== 0 || t2
== 0)
6506 if (TREE_CODE (t1
) == INTEGER_CST
6507 && TREE_CODE (t2
) == INTEGER_CST
6508 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6509 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6515 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6516 The precise way of comparison depends on their data type. */
6519 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6524 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6526 int t1_sgn
= tree_int_cst_sgn (t1
);
6527 int t2_sgn
= tree_int_cst_sgn (t2
);
6529 if (t1_sgn
< t2_sgn
)
6531 else if (t1_sgn
> t2_sgn
)
6533 /* Otherwise, both are non-negative, so we compare them as
6534 unsigned just in case one of them would overflow a signed
6537 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6538 return INT_CST_LT (t1
, t2
);
6540 return INT_CST_LT_UNSIGNED (t1
, t2
);
6543 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6546 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6548 if (tree_int_cst_lt (t1
, t2
))
6550 else if (tree_int_cst_lt (t2
, t1
))
6556 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6557 the host. If POS is zero, the value can be represented in a single
6558 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6559 be represented in a single unsigned HOST_WIDE_INT. */
6562 host_integerp (const_tree t
, int pos
)
6567 return (TREE_CODE (t
) == INTEGER_CST
6568 && ((TREE_INT_CST_HIGH (t
) == 0
6569 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6570 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6571 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6572 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6573 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6576 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6577 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6578 be non-negative. We must be able to satisfy the above conditions. */
6581 tree_low_cst (const_tree t
, int pos
)
6583 gcc_assert (host_integerp (t
, pos
));
6584 return TREE_INT_CST_LOW (t
);
6587 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6588 kind INTEGER_CST. This makes sure to properly sign-extend the
6592 size_low_cst (const_tree t
)
6594 double_int d
= tree_to_double_int (t
);
6595 return double_int_sext (d
, TYPE_PRECISION (TREE_TYPE (t
))).low
;
6598 /* Return the most significant (sign) bit of T. */
6601 tree_int_cst_sign_bit (const_tree t
)
6603 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6604 unsigned HOST_WIDE_INT w
;
6606 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6607 w
= TREE_INT_CST_LOW (t
);
6610 w
= TREE_INT_CST_HIGH (t
);
6611 bitno
-= HOST_BITS_PER_WIDE_INT
;
6614 return (w
>> bitno
) & 1;
6617 /* Return an indication of the sign of the integer constant T.
6618 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6619 Note that -1 will never be returned if T's type is unsigned. */
6622 tree_int_cst_sgn (const_tree t
)
6624 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6626 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6628 else if (TREE_INT_CST_HIGH (t
) < 0)
6634 /* Return the minimum number of bits needed to represent VALUE in a
6635 signed or unsigned type, UNSIGNEDP says which. */
6638 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6642 /* If the value is negative, compute its negative minus 1. The latter
6643 adjustment is because the absolute value of the largest negative value
6644 is one larger than the largest positive value. This is equivalent to
6645 a bit-wise negation, so use that operation instead. */
6647 if (tree_int_cst_sgn (value
) < 0)
6648 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6650 /* Return the number of bits needed, taking into account the fact
6651 that we need one more bit for a signed than unsigned type. */
6653 if (integer_zerop (value
))
6656 log
= tree_floor_log2 (value
);
6658 return log
+ 1 + !unsignedp
;
6661 /* Compare two constructor-element-type constants. Return 1 if the lists
6662 are known to be equal; otherwise return 0. */
6665 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6667 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6669 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6672 l1
= TREE_CHAIN (l1
);
6673 l2
= TREE_CHAIN (l2
);
6679 /* Return truthvalue of whether T1 is the same tree structure as T2.
6680 Return 1 if they are the same.
6681 Return 0 if they are understandably different.
6682 Return -1 if either contains tree structure not understood by
6686 simple_cst_equal (const_tree t1
, const_tree t2
)
6688 enum tree_code code1
, code2
;
6694 if (t1
== 0 || t2
== 0)
6697 code1
= TREE_CODE (t1
);
6698 code2
= TREE_CODE (t2
);
6700 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6702 if (CONVERT_EXPR_CODE_P (code2
)
6703 || code2
== NON_LVALUE_EXPR
)
6704 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6706 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6709 else if (CONVERT_EXPR_CODE_P (code2
)
6710 || code2
== NON_LVALUE_EXPR
)
6711 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6719 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6720 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6723 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6726 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6729 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6730 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6731 TREE_STRING_LENGTH (t1
)));
6735 unsigned HOST_WIDE_INT idx
;
6736 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6737 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6739 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6742 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6743 /* ??? Should we handle also fields here? */
6744 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6745 VEC_index (constructor_elt
, v2
, idx
)->value
))
6751 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6754 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6757 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6760 const_tree arg1
, arg2
;
6761 const_call_expr_arg_iterator iter1
, iter2
;
6762 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6763 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6765 arg1
= next_const_call_expr_arg (&iter1
),
6766 arg2
= next_const_call_expr_arg (&iter2
))
6768 cmp
= simple_cst_equal (arg1
, arg2
);
6772 return arg1
== arg2
;
6776 /* Special case: if either target is an unallocated VAR_DECL,
6777 it means that it's going to be unified with whatever the
6778 TARGET_EXPR is really supposed to initialize, so treat it
6779 as being equivalent to anything. */
6780 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6781 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6782 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6783 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6784 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6785 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6788 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6793 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6795 case WITH_CLEANUP_EXPR
:
6796 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6800 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6803 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6804 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6818 /* This general rule works for most tree codes. All exceptions should be
6819 handled above. If this is a language-specific tree code, we can't
6820 trust what might be in the operand, so say we don't know
6822 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6825 switch (TREE_CODE_CLASS (code1
))
6829 case tcc_comparison
:
6830 case tcc_expression
:
6834 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6836 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6848 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6849 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6850 than U, respectively. */
6853 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6855 if (tree_int_cst_sgn (t
) < 0)
6857 else if (TREE_INT_CST_HIGH (t
) != 0)
6859 else if (TREE_INT_CST_LOW (t
) == u
)
6861 else if (TREE_INT_CST_LOW (t
) < u
)
6867 /* Return true if SIZE represents a constant size that is in bounds of
6868 what the middle-end and the backend accepts (covering not more than
6869 half of the address-space). */
6872 valid_constant_size_p (const_tree size
)
6874 if (! host_integerp (size
, 1)
6875 || TREE_OVERFLOW (size
)
6876 || tree_int_cst_sign_bit (size
) != 0)
6881 /* Return true if CODE represents an associative tree code. Otherwise
6884 associative_tree_code (enum tree_code code
)
6903 /* Return true if CODE represents a commutative tree code. Otherwise
6906 commutative_tree_code (enum tree_code code
)
6912 case MULT_HIGHPART_EXPR
:
6920 case UNORDERED_EXPR
:
6924 case TRUTH_AND_EXPR
:
6925 case TRUTH_XOR_EXPR
:
6927 case WIDEN_MULT_EXPR
:
6928 case VEC_WIDEN_MULT_HI_EXPR
:
6929 case VEC_WIDEN_MULT_LO_EXPR
:
6938 /* Return true if CODE represents a ternary tree code for which the
6939 first two operands are commutative. Otherwise return false. */
6941 commutative_ternary_tree_code (enum tree_code code
)
6945 case WIDEN_MULT_PLUS_EXPR
:
6946 case WIDEN_MULT_MINUS_EXPR
:
6955 /* Generate a hash value for an expression. This can be used iteratively
6956 by passing a previous result as the VAL argument.
6958 This function is intended to produce the same hash for expressions which
6959 would compare equal using operand_equal_p. */
6962 iterative_hash_expr (const_tree t
, hashval_t val
)
6965 enum tree_code code
;
6969 return iterative_hash_hashval_t (0, val
);
6971 code
= TREE_CODE (t
);
6975 /* Alas, constants aren't shared, so we can't rely on pointer
6978 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6979 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6982 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6984 return iterative_hash_hashval_t (val2
, val
);
6988 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6990 return iterative_hash_hashval_t (val2
, val
);
6993 return iterative_hash (TREE_STRING_POINTER (t
),
6994 TREE_STRING_LENGTH (t
), val
);
6996 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6997 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7001 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7002 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7006 /* We can just compare by pointer. */
7007 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7008 case PLACEHOLDER_EXPR
:
7009 /* The node itself doesn't matter. */
7012 /* A list of expressions, for a CALL_EXPR or as the elements of a
7014 for (; t
; t
= TREE_CHAIN (t
))
7015 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7019 unsigned HOST_WIDE_INT idx
;
7021 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7023 val
= iterative_hash_expr (field
, val
);
7024 val
= iterative_hash_expr (value
, val
);
7030 /* The type of the second operand is relevant, except for
7031 its top-level qualifiers. */
7032 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7034 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7036 /* We could use the standard hash computation from this point
7038 val
= iterative_hash_object (code
, val
);
7039 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7040 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7044 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7045 Otherwise nodes that compare equal according to operand_equal_p might
7046 get different hash codes. However, don't do this for machine specific
7047 or front end builtins, since the function code is overloaded in those
7049 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7050 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7052 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7053 code
= TREE_CODE (t
);
7057 tclass
= TREE_CODE_CLASS (code
);
7059 if (tclass
== tcc_declaration
)
7061 /* DECL's have a unique ID */
7062 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7066 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7068 val
= iterative_hash_object (code
, val
);
7070 /* Don't hash the type, that can lead to having nodes which
7071 compare equal according to operand_equal_p, but which
7072 have different hash codes. */
7073 if (CONVERT_EXPR_CODE_P (code
)
7074 || code
== NON_LVALUE_EXPR
)
7076 /* Make sure to include signness in the hash computation. */
7077 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7078 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7081 else if (commutative_tree_code (code
))
7083 /* It's a commutative expression. We want to hash it the same
7084 however it appears. We do this by first hashing both operands
7085 and then rehashing based on the order of their independent
7087 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7088 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7092 t
= one
, one
= two
, two
= t
;
7094 val
= iterative_hash_hashval_t (one
, val
);
7095 val
= iterative_hash_hashval_t (two
, val
);
7098 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7099 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7105 /* Generate a hash value for a pair of expressions. This can be used
7106 iteratively by passing a previous result as the VAL argument.
7108 The same hash value is always returned for a given pair of expressions,
7109 regardless of the order in which they are presented. This is useful in
7110 hashing the operands of commutative functions. */
7113 iterative_hash_exprs_commutative (const_tree t1
,
7114 const_tree t2
, hashval_t val
)
7116 hashval_t one
= iterative_hash_expr (t1
, 0);
7117 hashval_t two
= iterative_hash_expr (t2
, 0);
7121 t
= one
, one
= two
, two
= t
;
7122 val
= iterative_hash_hashval_t (one
, val
);
7123 val
= iterative_hash_hashval_t (two
, val
);
7128 /* Constructors for pointer, array and function types.
7129 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7130 constructed by language-dependent code, not here.) */
7132 /* Construct, lay out and return the type of pointers to TO_TYPE with
7133 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7134 reference all of memory. If such a type has already been
7135 constructed, reuse it. */
7138 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7143 if (to_type
== error_mark_node
)
7144 return error_mark_node
;
7146 /* If the pointed-to type has the may_alias attribute set, force
7147 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7148 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7149 can_alias_all
= true;
7151 /* In some cases, languages will have things that aren't a POINTER_TYPE
7152 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7153 In that case, return that type without regard to the rest of our
7156 ??? This is a kludge, but consistent with the way this function has
7157 always operated and there doesn't seem to be a good way to avoid this
7159 if (TYPE_POINTER_TO (to_type
) != 0
7160 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7161 return TYPE_POINTER_TO (to_type
);
7163 /* First, if we already have a type for pointers to TO_TYPE and it's
7164 the proper mode, use it. */
7165 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7166 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7169 t
= make_node (POINTER_TYPE
);
7171 TREE_TYPE (t
) = to_type
;
7172 SET_TYPE_MODE (t
, mode
);
7173 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7174 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7175 TYPE_POINTER_TO (to_type
) = t
;
7177 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7178 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7179 else if (TYPE_CANONICAL (to_type
) != to_type
)
7181 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7182 mode
, can_alias_all
);
7184 /* Lay out the type. This function has many callers that are concerned
7185 with expression-construction, and this simplifies them all. */
7191 /* By default build pointers in ptr_mode. */
7194 build_pointer_type (tree to_type
)
7196 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7197 : TYPE_ADDR_SPACE (to_type
);
7198 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7199 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7202 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7205 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7210 if (to_type
== error_mark_node
)
7211 return error_mark_node
;
7213 /* If the pointed-to type has the may_alias attribute set, force
7214 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7215 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7216 can_alias_all
= true;
7218 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7219 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7220 In that case, return that type without regard to the rest of our
7223 ??? This is a kludge, but consistent with the way this function has
7224 always operated and there doesn't seem to be a good way to avoid this
7226 if (TYPE_REFERENCE_TO (to_type
) != 0
7227 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7228 return TYPE_REFERENCE_TO (to_type
);
7230 /* First, if we already have a type for pointers to TO_TYPE and it's
7231 the proper mode, use it. */
7232 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7233 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7236 t
= make_node (REFERENCE_TYPE
);
7238 TREE_TYPE (t
) = to_type
;
7239 SET_TYPE_MODE (t
, mode
);
7240 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7241 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7242 TYPE_REFERENCE_TO (to_type
) = t
;
7244 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7245 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7246 else if (TYPE_CANONICAL (to_type
) != to_type
)
7248 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7249 mode
, can_alias_all
);
7257 /* Build the node for the type of references-to-TO_TYPE by default
7261 build_reference_type (tree to_type
)
7263 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7264 : TYPE_ADDR_SPACE (to_type
);
7265 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7266 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7269 /* Build a type that is compatible with t but has no cv quals anywhere
7272 const char *const *const * -> char ***. */
7275 build_type_no_quals (tree t
)
7277 switch (TREE_CODE (t
))
7280 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7282 TYPE_REF_CAN_ALIAS_ALL (t
));
7283 case REFERENCE_TYPE
:
7285 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7287 TYPE_REF_CAN_ALIAS_ALL (t
));
7289 return TYPE_MAIN_VARIANT (t
);
7293 #define MAX_INT_CACHED_PREC \
7294 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7295 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7297 /* Builds a signed or unsigned integer type of precision PRECISION.
7298 Used for C bitfields whose precision does not match that of
7299 built-in target types. */
7301 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7307 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7309 if (precision
<= MAX_INT_CACHED_PREC
)
7311 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7316 itype
= make_node (INTEGER_TYPE
);
7317 TYPE_PRECISION (itype
) = precision
;
7320 fixup_unsigned_type (itype
);
7322 fixup_signed_type (itype
);
7325 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7326 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7327 if (precision
<= MAX_INT_CACHED_PREC
)
7328 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7333 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7334 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7335 is true, reuse such a type that has already been constructed. */
7338 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7340 tree itype
= make_node (INTEGER_TYPE
);
7341 hashval_t hashcode
= 0;
7343 TREE_TYPE (itype
) = type
;
7345 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7346 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7348 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7349 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7350 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7351 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7352 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7353 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7358 if ((TYPE_MIN_VALUE (itype
)
7359 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7360 || (TYPE_MAX_VALUE (itype
)
7361 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7363 /* Since we cannot reliably merge this type, we need to compare it using
7364 structural equality checks. */
7365 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7369 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7370 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7371 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7372 itype
= type_hash_canon (hashcode
, itype
);
7377 /* Wrapper around build_range_type_1 with SHARED set to true. */
7380 build_range_type (tree type
, tree lowval
, tree highval
)
7382 return build_range_type_1 (type
, lowval
, highval
, true);
7385 /* Wrapper around build_range_type_1 with SHARED set to false. */
7388 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7390 return build_range_type_1 (type
, lowval
, highval
, false);
7393 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7394 MAXVAL should be the maximum value in the domain
7395 (one less than the length of the array).
7397 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7398 We don't enforce this limit, that is up to caller (e.g. language front end).
7399 The limit exists because the result is a signed type and we don't handle
7400 sizes that use more than one HOST_WIDE_INT. */
7403 build_index_type (tree maxval
)
7405 return build_range_type (sizetype
, size_zero_node
, maxval
);
7408 /* Return true if the debug information for TYPE, a subtype, should be emitted
7409 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7410 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7411 debug info and doesn't reflect the source code. */
7414 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7416 tree base_type
= TREE_TYPE (type
), low
, high
;
7418 /* Subrange types have a base type which is an integral type. */
7419 if (!INTEGRAL_TYPE_P (base_type
))
7422 /* Get the real bounds of the subtype. */
7423 if (lang_hooks
.types
.get_subrange_bounds
)
7424 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7427 low
= TYPE_MIN_VALUE (type
);
7428 high
= TYPE_MAX_VALUE (type
);
7431 /* If the type and its base type have the same representation and the same
7432 name, then the type is not a subrange but a copy of the base type. */
7433 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7434 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7435 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7436 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7437 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7439 tree type_name
= TYPE_NAME (type
);
7440 tree base_type_name
= TYPE_NAME (base_type
);
7442 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7443 type_name
= DECL_NAME (type_name
);
7445 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7446 base_type_name
= DECL_NAME (base_type_name
);
7448 if (type_name
== base_type_name
)
7459 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7460 and number of elements specified by the range of values of INDEX_TYPE.
7461 If SHARED is true, reuse such a type that has already been constructed. */
7464 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7468 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7470 error ("arrays of functions are not meaningful");
7471 elt_type
= integer_type_node
;
7474 t
= make_node (ARRAY_TYPE
);
7475 TREE_TYPE (t
) = elt_type
;
7476 TYPE_DOMAIN (t
) = index_type
;
7477 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7480 /* If the element type is incomplete at this point we get marked for
7481 structural equality. Do not record these types in the canonical
7483 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7488 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7490 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7491 t
= type_hash_canon (hashcode
, t
);
7494 if (TYPE_CANONICAL (t
) == t
)
7496 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7497 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7498 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7499 else if (TYPE_CANONICAL (elt_type
) != elt_type
7500 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7502 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7504 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7511 /* Wrapper around build_array_type_1 with SHARED set to true. */
7514 build_array_type (tree elt_type
, tree index_type
)
7516 return build_array_type_1 (elt_type
, index_type
, true);
7519 /* Wrapper around build_array_type_1 with SHARED set to false. */
7522 build_nonshared_array_type (tree elt_type
, tree index_type
)
7524 return build_array_type_1 (elt_type
, index_type
, false);
7527 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7531 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7533 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7536 /* Recursively examines the array elements of TYPE, until a non-array
7537 element type is found. */
7540 strip_array_types (tree type
)
7542 while (TREE_CODE (type
) == ARRAY_TYPE
)
7543 type
= TREE_TYPE (type
);
7548 /* Computes the canonical argument types from the argument type list
7551 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7552 on entry to this function, or if any of the ARGTYPES are
7555 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7556 true on entry to this function, or if any of the ARGTYPES are
7559 Returns a canonical argument list, which may be ARGTYPES when the
7560 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7561 true) or would not differ from ARGTYPES. */
7564 maybe_canonicalize_argtypes(tree argtypes
,
7565 bool *any_structural_p
,
7566 bool *any_noncanonical_p
)
7569 bool any_noncanonical_argtypes_p
= false;
7571 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7573 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7574 /* Fail gracefully by stating that the type is structural. */
7575 *any_structural_p
= true;
7576 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7577 *any_structural_p
= true;
7578 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7579 || TREE_PURPOSE (arg
))
7580 /* If the argument has a default argument, we consider it
7581 non-canonical even though the type itself is canonical.
7582 That way, different variants of function and method types
7583 with default arguments will all point to the variant with
7584 no defaults as their canonical type. */
7585 any_noncanonical_argtypes_p
= true;
7588 if (*any_structural_p
)
7591 if (any_noncanonical_argtypes_p
)
7593 /* Build the canonical list of argument types. */
7594 tree canon_argtypes
= NULL_TREE
;
7595 bool is_void
= false;
7597 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7599 if (arg
== void_list_node
)
7602 canon_argtypes
= tree_cons (NULL_TREE
,
7603 TYPE_CANONICAL (TREE_VALUE (arg
)),
7607 canon_argtypes
= nreverse (canon_argtypes
);
7609 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7611 /* There is a non-canonical type. */
7612 *any_noncanonical_p
= true;
7613 return canon_argtypes
;
7616 /* The canonical argument types are the same as ARGTYPES. */
7620 /* Construct, lay out and return
7621 the type of functions returning type VALUE_TYPE
7622 given arguments of types ARG_TYPES.
7623 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7624 are data type nodes for the arguments of the function.
7625 If such a type has already been constructed, reuse it. */
7628 build_function_type (tree value_type
, tree arg_types
)
7631 hashval_t hashcode
= 0;
7632 bool any_structural_p
, any_noncanonical_p
;
7633 tree canon_argtypes
;
7635 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7637 error ("function return type cannot be function");
7638 value_type
= integer_type_node
;
7641 /* Make a node of the sort we want. */
7642 t
= make_node (FUNCTION_TYPE
);
7643 TREE_TYPE (t
) = value_type
;
7644 TYPE_ARG_TYPES (t
) = arg_types
;
7646 /* If we already have such a type, use the old one. */
7647 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7648 hashcode
= type_hash_list (arg_types
, hashcode
);
7649 t
= type_hash_canon (hashcode
, t
);
7651 /* Set up the canonical type. */
7652 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7653 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7654 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7656 &any_noncanonical_p
);
7657 if (any_structural_p
)
7658 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7659 else if (any_noncanonical_p
)
7660 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7663 if (!COMPLETE_TYPE_P (t
))
7668 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7669 return value if SKIP_RETURN is true. */
7672 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7675 tree new_type
= NULL
;
7676 tree args
, new_args
= NULL
, t
;
7680 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7681 args
= TREE_CHAIN (args
), i
++)
7682 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7683 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7685 new_reversed
= nreverse (new_args
);
7689 TREE_CHAIN (new_args
) = void_list_node
;
7691 new_reversed
= void_list_node
;
7694 /* Use copy_node to preserve as much as possible from original type
7695 (debug info, attribute lists etc.)
7696 Exception is METHOD_TYPEs must have THIS argument.
7697 When we are asked to remove it, we need to build new FUNCTION_TYPE
7699 if (TREE_CODE (orig_type
) != METHOD_TYPE
7701 || !bitmap_bit_p (args_to_skip
, 0))
7703 new_type
= build_distinct_type_copy (orig_type
);
7704 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7709 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7711 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7715 TREE_TYPE (new_type
) = void_type_node
;
7717 /* This is a new type, not a copy of an old type. Need to reassociate
7718 variants. We can handle everything except the main variant lazily. */
7719 t
= TYPE_MAIN_VARIANT (orig_type
);
7722 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7723 TYPE_MAIN_VARIANT (new_type
) = t
;
7724 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7725 TYPE_NEXT_VARIANT (t
) = new_type
;
7729 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7730 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7736 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7737 return value if SKIP_RETURN is true.
7739 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7740 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7741 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7744 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7747 tree new_decl
= copy_node (orig_decl
);
7750 new_type
= TREE_TYPE (orig_decl
);
7751 if (prototype_p (new_type
)
7752 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7754 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7755 TREE_TYPE (new_decl
) = new_type
;
7757 /* For declarations setting DECL_VINDEX (i.e. methods)
7758 we expect first argument to be THIS pointer. */
7759 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
7760 DECL_VINDEX (new_decl
) = NULL_TREE
;
7762 /* When signature changes, we need to clear builtin info. */
7763 if (DECL_BUILT_IN (new_decl
)
7765 && !bitmap_empty_p (args_to_skip
))
7767 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7768 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7773 /* Build a function type. The RETURN_TYPE is the type returned by the
7774 function. If VAARGS is set, no void_type_node is appended to the
7775 the list. ARGP must be always be terminated be a NULL_TREE. */
7778 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7782 t
= va_arg (argp
, tree
);
7783 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7784 args
= tree_cons (NULL_TREE
, t
, args
);
7789 if (args
!= NULL_TREE
)
7790 args
= nreverse (args
);
7791 gcc_assert (last
!= void_list_node
);
7793 else if (args
== NULL_TREE
)
7794 args
= void_list_node
;
7798 args
= nreverse (args
);
7799 TREE_CHAIN (last
) = void_list_node
;
7801 args
= build_function_type (return_type
, args
);
7806 /* Build a function type. The RETURN_TYPE is the type returned by the
7807 function. If additional arguments are provided, they are
7808 additional argument types. The list of argument types must always
7809 be terminated by NULL_TREE. */
7812 build_function_type_list (tree return_type
, ...)
7817 va_start (p
, return_type
);
7818 args
= build_function_type_list_1 (false, return_type
, p
);
7823 /* Build a variable argument function type. The RETURN_TYPE is the
7824 type returned by the function. If additional arguments are provided,
7825 they are additional argument types. The list of argument types must
7826 always be terminated by NULL_TREE. */
7829 build_varargs_function_type_list (tree return_type
, ...)
7834 va_start (p
, return_type
);
7835 args
= build_function_type_list_1 (true, return_type
, p
);
7841 /* Build a function type. RETURN_TYPE is the type returned by the
7842 function; VAARGS indicates whether the function takes varargs. The
7843 function takes N named arguments, the types of which are provided in
7847 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7851 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7853 for (i
= n
- 1; i
>= 0; i
--)
7854 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7856 return build_function_type (return_type
, t
);
7859 /* Build a function type. RETURN_TYPE is the type returned by the
7860 function. The function takes N named arguments, the types of which
7861 are provided in ARG_TYPES. */
7864 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7866 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7869 /* Build a variable argument function type. RETURN_TYPE is the type
7870 returned by the function. The function takes N named arguments, the
7871 types of which are provided in ARG_TYPES. */
7874 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7876 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7879 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7880 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7881 for the method. An implicit additional parameter (of type
7882 pointer-to-BASETYPE) is added to the ARGTYPES. */
7885 build_method_type_directly (tree basetype
,
7892 bool any_structural_p
, any_noncanonical_p
;
7893 tree canon_argtypes
;
7895 /* Make a node of the sort we want. */
7896 t
= make_node (METHOD_TYPE
);
7898 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7899 TREE_TYPE (t
) = rettype
;
7900 ptype
= build_pointer_type (basetype
);
7902 /* The actual arglist for this function includes a "hidden" argument
7903 which is "this". Put it into the list of argument types. */
7904 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7905 TYPE_ARG_TYPES (t
) = argtypes
;
7907 /* If we already have such a type, use the old one. */
7908 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7909 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7910 hashcode
= type_hash_list (argtypes
, hashcode
);
7911 t
= type_hash_canon (hashcode
, t
);
7913 /* Set up the canonical type. */
7915 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7916 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7918 = (TYPE_CANONICAL (basetype
) != basetype
7919 || TYPE_CANONICAL (rettype
) != rettype
);
7920 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7922 &any_noncanonical_p
);
7923 if (any_structural_p
)
7924 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7925 else if (any_noncanonical_p
)
7927 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7928 TYPE_CANONICAL (rettype
),
7930 if (!COMPLETE_TYPE_P (t
))
7936 /* Construct, lay out and return the type of methods belonging to class
7937 BASETYPE and whose arguments and values are described by TYPE.
7938 If that type exists already, reuse it.
7939 TYPE must be a FUNCTION_TYPE node. */
7942 build_method_type (tree basetype
, tree type
)
7944 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7946 return build_method_type_directly (basetype
,
7948 TYPE_ARG_TYPES (type
));
7951 /* Construct, lay out and return the type of offsets to a value
7952 of type TYPE, within an object of type BASETYPE.
7953 If a suitable offset type exists already, reuse it. */
7956 build_offset_type (tree basetype
, tree type
)
7959 hashval_t hashcode
= 0;
7961 /* Make a node of the sort we want. */
7962 t
= make_node (OFFSET_TYPE
);
7964 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7965 TREE_TYPE (t
) = type
;
7967 /* If we already have such a type, use the old one. */
7968 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7969 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7970 t
= type_hash_canon (hashcode
, t
);
7972 if (!COMPLETE_TYPE_P (t
))
7975 if (TYPE_CANONICAL (t
) == t
)
7977 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7978 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7979 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7980 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7981 || TYPE_CANONICAL (type
) != type
)
7983 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7984 TYPE_CANONICAL (type
));
7990 /* Create a complex type whose components are COMPONENT_TYPE. */
7993 build_complex_type (tree component_type
)
7998 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7999 || SCALAR_FLOAT_TYPE_P (component_type
)
8000 || FIXED_POINT_TYPE_P (component_type
));
8002 /* Make a node of the sort we want. */
8003 t
= make_node (COMPLEX_TYPE
);
8005 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8007 /* If we already have such a type, use the old one. */
8008 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8009 t
= type_hash_canon (hashcode
, t
);
8011 if (!COMPLETE_TYPE_P (t
))
8014 if (TYPE_CANONICAL (t
) == t
)
8016 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8017 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8018 else if (TYPE_CANONICAL (component_type
) != component_type
)
8020 = build_complex_type (TYPE_CANONICAL (component_type
));
8023 /* We need to create a name, since complex is a fundamental type. */
8024 if (! TYPE_NAME (t
))
8027 if (component_type
== char_type_node
)
8028 name
= "complex char";
8029 else if (component_type
== signed_char_type_node
)
8030 name
= "complex signed char";
8031 else if (component_type
== unsigned_char_type_node
)
8032 name
= "complex unsigned char";
8033 else if (component_type
== short_integer_type_node
)
8034 name
= "complex short int";
8035 else if (component_type
== short_unsigned_type_node
)
8036 name
= "complex short unsigned int";
8037 else if (component_type
== integer_type_node
)
8038 name
= "complex int";
8039 else if (component_type
== unsigned_type_node
)
8040 name
= "complex unsigned int";
8041 else if (component_type
== long_integer_type_node
)
8042 name
= "complex long int";
8043 else if (component_type
== long_unsigned_type_node
)
8044 name
= "complex long unsigned int";
8045 else if (component_type
== long_long_integer_type_node
)
8046 name
= "complex long long int";
8047 else if (component_type
== long_long_unsigned_type_node
)
8048 name
= "complex long long unsigned int";
8053 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8054 get_identifier (name
), t
);
8057 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8060 /* If TYPE is a real or complex floating-point type and the target
8061 does not directly support arithmetic on TYPE then return the wider
8062 type to be used for arithmetic on TYPE. Otherwise, return
8066 excess_precision_type (tree type
)
8068 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8070 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8071 switch (TREE_CODE (type
))
8074 switch (flt_eval_method
)
8077 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8078 return double_type_node
;
8081 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8082 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8083 return long_double_type_node
;
8090 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8092 switch (flt_eval_method
)
8095 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8096 return complex_double_type_node
;
8099 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8100 || (TYPE_MODE (TREE_TYPE (type
))
8101 == TYPE_MODE (double_type_node
)))
8102 return complex_long_double_type_node
;
8115 /* Return OP, stripped of any conversions to wider types as much as is safe.
8116 Converting the value back to OP's type makes a value equivalent to OP.
8118 If FOR_TYPE is nonzero, we return a value which, if converted to
8119 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8121 OP must have integer, real or enumeral type. Pointers are not allowed!
8123 There are some cases where the obvious value we could return
8124 would regenerate to OP if converted to OP's type,
8125 but would not extend like OP to wider types.
8126 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8127 For example, if OP is (unsigned short)(signed char)-1,
8128 we avoid returning (signed char)-1 if FOR_TYPE is int,
8129 even though extending that to an unsigned short would regenerate OP,
8130 since the result of extending (signed char)-1 to (int)
8131 is different from (int) OP. */
8134 get_unwidened (tree op
, tree for_type
)
8136 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8137 tree type
= TREE_TYPE (op
);
8139 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8141 = (for_type
!= 0 && for_type
!= type
8142 && final_prec
> TYPE_PRECISION (type
)
8143 && TYPE_UNSIGNED (type
));
8146 while (CONVERT_EXPR_P (op
))
8150 /* TYPE_PRECISION on vector types has different meaning
8151 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8152 so avoid them here. */
8153 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8156 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8157 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8159 /* Truncations are many-one so cannot be removed.
8160 Unless we are later going to truncate down even farther. */
8162 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8165 /* See what's inside this conversion. If we decide to strip it,
8167 op
= TREE_OPERAND (op
, 0);
8169 /* If we have not stripped any zero-extensions (uns is 0),
8170 we can strip any kind of extension.
8171 If we have previously stripped a zero-extension,
8172 only zero-extensions can safely be stripped.
8173 Any extension can be stripped if the bits it would produce
8174 are all going to be discarded later by truncating to FOR_TYPE. */
8178 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8180 /* TYPE_UNSIGNED says whether this is a zero-extension.
8181 Let's avoid computing it if it does not affect WIN
8182 and if UNS will not be needed again. */
8184 || CONVERT_EXPR_P (op
))
8185 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8193 /* If we finally reach a constant see if it fits in for_type and
8194 in that case convert it. */
8196 && TREE_CODE (win
) == INTEGER_CST
8197 && TREE_TYPE (win
) != for_type
8198 && int_fits_type_p (win
, for_type
))
8199 win
= fold_convert (for_type
, win
);
8204 /* Return OP or a simpler expression for a narrower value
8205 which can be sign-extended or zero-extended to give back OP.
8206 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8207 or 0 if the value should be sign-extended. */
8210 get_narrower (tree op
, int *unsignedp_ptr
)
8215 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8217 while (TREE_CODE (op
) == NOP_EXPR
)
8220 = (TYPE_PRECISION (TREE_TYPE (op
))
8221 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8223 /* Truncations are many-one so cannot be removed. */
8227 /* See what's inside this conversion. If we decide to strip it,
8232 op
= TREE_OPERAND (op
, 0);
8233 /* An extension: the outermost one can be stripped,
8234 but remember whether it is zero or sign extension. */
8236 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8237 /* Otherwise, if a sign extension has been stripped,
8238 only sign extensions can now be stripped;
8239 if a zero extension has been stripped, only zero-extensions. */
8240 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8244 else /* bitschange == 0 */
8246 /* A change in nominal type can always be stripped, but we must
8247 preserve the unsignedness. */
8249 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8251 op
= TREE_OPERAND (op
, 0);
8252 /* Keep trying to narrow, but don't assign op to win if it
8253 would turn an integral type into something else. */
8254 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8261 if (TREE_CODE (op
) == COMPONENT_REF
8262 /* Since type_for_size always gives an integer type. */
8263 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8264 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8265 /* Ensure field is laid out already. */
8266 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8267 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8269 unsigned HOST_WIDE_INT innerprec
8270 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8271 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8272 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8273 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8275 /* We can get this structure field in a narrower type that fits it,
8276 but the resulting extension to its nominal type (a fullword type)
8277 must satisfy the same conditions as for other extensions.
8279 Do this only for fields that are aligned (not bit-fields),
8280 because when bit-field insns will be used there is no
8281 advantage in doing this. */
8283 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8284 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8285 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8289 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8290 win
= fold_convert (type
, op
);
8294 *unsignedp_ptr
= uns
;
8298 /* Returns true if integer constant C has a value that is permissible
8299 for type TYPE (an INTEGER_TYPE). */
8302 int_fits_type_p (const_tree c
, const_tree type
)
8304 tree type_low_bound
, type_high_bound
;
8305 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8308 dc
= tree_to_double_int (c
);
8309 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8312 type_low_bound
= TYPE_MIN_VALUE (type
);
8313 type_high_bound
= TYPE_MAX_VALUE (type
);
8315 /* If at least one bound of the type is a constant integer, we can check
8316 ourselves and maybe make a decision. If no such decision is possible, but
8317 this type is a subtype, try checking against that. Otherwise, use
8318 double_int_fits_to_tree_p, which checks against the precision.
8320 Compute the status for each possibly constant bound, and return if we see
8321 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8322 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8323 for "constant known to fit". */
8325 /* Check if c >= type_low_bound. */
8326 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8328 dd
= tree_to_double_int (type_low_bound
);
8329 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8331 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8332 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8334 if (c_neg
&& !t_neg
)
8336 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8339 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8341 ok_for_low_bound
= true;
8344 ok_for_low_bound
= false;
8346 /* Check if c <= type_high_bound. */
8347 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8349 dd
= tree_to_double_int (type_high_bound
);
8350 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8352 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8353 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8355 if (t_neg
&& !c_neg
)
8357 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8360 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8362 ok_for_high_bound
= true;
8365 ok_for_high_bound
= false;
8367 /* If the constant fits both bounds, the result is known. */
8368 if (ok_for_low_bound
&& ok_for_high_bound
)
8371 /* Perform some generic filtering which may allow making a decision
8372 even if the bounds are not constant. First, negative integers
8373 never fit in unsigned types, */
8374 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8377 /* Second, narrower types always fit in wider ones. */
8378 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8381 /* Third, unsigned integers with top bit set never fit signed types. */
8382 if (! TYPE_UNSIGNED (type
) && unsc
)
8384 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8385 if (prec
< HOST_BITS_PER_WIDE_INT
)
8387 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8390 else if (((((unsigned HOST_WIDE_INT
) 1)
8391 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8395 /* If we haven't been able to decide at this point, there nothing more we
8396 can check ourselves here. Look at the base type if we have one and it
8397 has the same precision. */
8398 if (TREE_CODE (type
) == INTEGER_TYPE
8399 && TREE_TYPE (type
) != 0
8400 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8402 type
= TREE_TYPE (type
);
8406 /* Or to double_int_fits_to_tree_p, if nothing else. */
8407 return double_int_fits_to_tree_p (type
, dc
);
8410 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8411 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8412 represented (assuming two's-complement arithmetic) within the bit
8413 precision of the type are returned instead. */
8416 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8418 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8419 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8420 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8421 TYPE_UNSIGNED (type
));
8424 if (TYPE_UNSIGNED (type
))
8425 mpz_set_ui (min
, 0);
8429 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8430 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8431 TYPE_PRECISION (type
));
8432 mpz_set_double_int (min
, mn
, false);
8436 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8437 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8438 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8439 TYPE_UNSIGNED (type
));
8442 if (TYPE_UNSIGNED (type
))
8443 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8446 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8451 /* Return true if VAR is an automatic variable defined in function FN. */
8454 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8456 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8457 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8458 || TREE_CODE (var
) == PARM_DECL
)
8459 && ! TREE_STATIC (var
))
8460 || TREE_CODE (var
) == LABEL_DECL
8461 || TREE_CODE (var
) == RESULT_DECL
));
8464 /* Subprogram of following function. Called by walk_tree.
8466 Return *TP if it is an automatic variable or parameter of the
8467 function passed in as DATA. */
8470 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8472 tree fn
= (tree
) data
;
8477 else if (DECL_P (*tp
)
8478 && auto_var_in_fn_p (*tp
, fn
))
8484 /* Returns true if T is, contains, or refers to a type with variable
8485 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8486 arguments, but not the return type. If FN is nonzero, only return
8487 true if a modifier of the type or position of FN is a variable or
8488 parameter inside FN.
8490 This concept is more general than that of C99 'variably modified types':
8491 in C99, a struct type is never variably modified because a VLA may not
8492 appear as a structure member. However, in GNU C code like:
8494 struct S { int i[f()]; };
8496 is valid, and other languages may define similar constructs. */
8499 variably_modified_type_p (tree type
, tree fn
)
8503 /* Test if T is either variable (if FN is zero) or an expression containing
8504 a variable in FN. */
8505 #define RETURN_TRUE_IF_VAR(T) \
8506 do { tree _t = (T); \
8507 if (_t != NULL_TREE \
8508 && _t != error_mark_node \
8509 && TREE_CODE (_t) != INTEGER_CST \
8510 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8511 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8512 return true; } while (0)
8514 if (type
== error_mark_node
)
8517 /* If TYPE itself has variable size, it is variably modified. */
8518 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8519 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8521 switch (TREE_CODE (type
))
8524 case REFERENCE_TYPE
:
8526 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8532 /* If TYPE is a function type, it is variably modified if the
8533 return type is variably modified. */
8534 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8540 case FIXED_POINT_TYPE
:
8543 /* Scalar types are variably modified if their end points
8545 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8546 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8551 case QUAL_UNION_TYPE
:
8552 /* We can't see if any of the fields are variably-modified by the
8553 definition we normally use, since that would produce infinite
8554 recursion via pointers. */
8555 /* This is variably modified if some field's type is. */
8556 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8557 if (TREE_CODE (t
) == FIELD_DECL
)
8559 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8560 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8561 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8563 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8564 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8569 /* Do not call ourselves to avoid infinite recursion. This is
8570 variably modified if the element type is. */
8571 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8572 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8579 /* The current language may have other cases to check, but in general,
8580 all other types are not variably modified. */
8581 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8583 #undef RETURN_TRUE_IF_VAR
8586 /* Given a DECL or TYPE, return the scope in which it was declared, or
8587 NULL_TREE if there is no containing scope. */
8590 get_containing_scope (const_tree t
)
8592 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8595 /* Return the innermost context enclosing DECL that is
8596 a FUNCTION_DECL, or zero if none. */
8599 decl_function_context (const_tree decl
)
8603 if (TREE_CODE (decl
) == ERROR_MARK
)
8606 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8607 where we look up the function at runtime. Such functions always take
8608 a first argument of type 'pointer to real context'.
8610 C++ should really be fixed to use DECL_CONTEXT for the real context,
8611 and use something else for the "virtual context". */
8612 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8615 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8617 context
= DECL_CONTEXT (decl
);
8619 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8621 if (TREE_CODE (context
) == BLOCK
)
8622 context
= BLOCK_SUPERCONTEXT (context
);
8624 context
= get_containing_scope (context
);
8630 /* Return the innermost context enclosing DECL that is
8631 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8632 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8635 decl_type_context (const_tree decl
)
8637 tree context
= DECL_CONTEXT (decl
);
8640 switch (TREE_CODE (context
))
8642 case NAMESPACE_DECL
:
8643 case TRANSLATION_UNIT_DECL
:
8648 case QUAL_UNION_TYPE
:
8653 context
= DECL_CONTEXT (context
);
8657 context
= BLOCK_SUPERCONTEXT (context
);
8667 /* CALL is a CALL_EXPR. Return the declaration for the function
8668 called, or NULL_TREE if the called function cannot be
8672 get_callee_fndecl (const_tree call
)
8676 if (call
== error_mark_node
)
8677 return error_mark_node
;
8679 /* It's invalid to call this function with anything but a
8681 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8683 /* The first operand to the CALL is the address of the function
8685 addr
= CALL_EXPR_FN (call
);
8689 /* If this is a readonly function pointer, extract its initial value. */
8690 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8691 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8692 && DECL_INITIAL (addr
))
8693 addr
= DECL_INITIAL (addr
);
8695 /* If the address is just `&f' for some function `f', then we know
8696 that `f' is being called. */
8697 if (TREE_CODE (addr
) == ADDR_EXPR
8698 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8699 return TREE_OPERAND (addr
, 0);
8701 /* We couldn't figure out what was being called. */
8705 /* Print debugging information about tree nodes generated during the compile,
8706 and any language-specific information. */
8709 dump_tree_statistics (void)
8711 #ifdef GATHER_STATISTICS
8713 int total_nodes
, total_bytes
;
8716 fprintf (stderr
, "\n??? tree nodes created\n\n");
8717 #ifdef GATHER_STATISTICS
8718 fprintf (stderr
, "Kind Nodes Bytes\n");
8719 fprintf (stderr
, "---------------------------------------\n");
8720 total_nodes
= total_bytes
= 0;
8721 for (i
= 0; i
< (int) all_kinds
; i
++)
8723 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8724 tree_node_counts
[i
], tree_node_sizes
[i
]);
8725 total_nodes
+= tree_node_counts
[i
];
8726 total_bytes
+= tree_node_sizes
[i
];
8728 fprintf (stderr
, "---------------------------------------\n");
8729 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8730 fprintf (stderr
, "---------------------------------------\n");
8731 fprintf (stderr
, "Code Nodes\n");
8732 fprintf (stderr
, "----------------------------\n");
8733 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8734 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8735 fprintf (stderr
, "----------------------------\n");
8736 ssanames_print_statistics ();
8737 phinodes_print_statistics ();
8739 fprintf (stderr
, "(No per-node statistics)\n");
8741 print_type_hash_statistics ();
8742 print_debug_expr_statistics ();
8743 print_value_expr_statistics ();
8744 lang_hooks
.print_statistics ();
8747 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8749 /* Generate a crc32 of a byte. */
8752 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8756 for (ix
= bits
; ix
--; value
<<= 1)
8760 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8767 /* Generate a crc32 of a 32-bit unsigned. */
8770 crc32_unsigned (unsigned chksum
, unsigned value
)
8772 return crc32_unsigned_bits (chksum
, value
, 32);
8775 /* Generate a crc32 of a byte. */
8778 crc32_byte (unsigned chksum
, char byte
)
8780 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8783 /* Generate a crc32 of a string. */
8786 crc32_string (unsigned chksum
, const char *string
)
8790 chksum
= crc32_byte (chksum
, *string
);
8796 /* P is a string that will be used in a symbol. Mask out any characters
8797 that are not valid in that context. */
8800 clean_symbol_name (char *p
)
8804 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8807 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8814 /* Generate a name for a special-purpose function.
8815 The generated name may need to be unique across the whole link.
8816 Changes to this function may also require corresponding changes to
8817 xstrdup_mask_random.
8818 TYPE is some string to identify the purpose of this function to the
8819 linker or collect2; it must start with an uppercase letter,
8821 I - for constructors
8823 N - for C++ anonymous namespaces
8824 F - for DWARF unwind frame information. */
8827 get_file_function_name (const char *type
)
8833 /* If we already have a name we know to be unique, just use that. */
8834 if (first_global_object_name
)
8835 p
= q
= ASTRDUP (first_global_object_name
);
8836 /* If the target is handling the constructors/destructors, they
8837 will be local to this file and the name is only necessary for
8839 We also assign sub_I and sub_D sufixes to constructors called from
8840 the global static constructors. These are always local. */
8841 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8842 || (strncmp (type
, "sub_", 4) == 0
8843 && (type
[4] == 'I' || type
[4] == 'D')))
8845 const char *file
= main_input_filename
;
8847 file
= input_filename
;
8848 /* Just use the file's basename, because the full pathname
8849 might be quite long. */
8850 p
= q
= ASTRDUP (lbasename (file
));
8854 /* Otherwise, the name must be unique across the entire link.
8855 We don't have anything that we know to be unique to this translation
8856 unit, so use what we do have and throw in some randomness. */
8858 const char *name
= weak_global_object_name
;
8859 const char *file
= main_input_filename
;
8864 file
= input_filename
;
8866 len
= strlen (file
);
8867 q
= (char *) alloca (9 + 17 + len
+ 1);
8868 memcpy (q
, file
, len
+ 1);
8870 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8871 crc32_string (0, name
), get_random_seed (false));
8876 clean_symbol_name (q
);
8877 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8880 /* Set up the name of the file-level functions we may need.
8881 Use a global object (which is already required to be unique over
8882 the program) rather than the file name (which imposes extra
8884 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8886 return get_identifier (buf
);
8889 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8891 /* Complain that the tree code of NODE does not match the expected 0
8892 terminated list of trailing codes. The trailing code list can be
8893 empty, for a more vague error message. FILE, LINE, and FUNCTION
8894 are of the caller. */
8897 tree_check_failed (const_tree node
, const char *file
,
8898 int line
, const char *function
, ...)
8902 unsigned length
= 0;
8905 va_start (args
, function
);
8906 while ((code
= va_arg (args
, int)))
8907 length
+= 4 + strlen (tree_code_name
[code
]);
8912 va_start (args
, function
);
8913 length
+= strlen ("expected ");
8914 buffer
= tmp
= (char *) alloca (length
);
8916 while ((code
= va_arg (args
, int)))
8918 const char *prefix
= length
? " or " : "expected ";
8920 strcpy (tmp
+ length
, prefix
);
8921 length
+= strlen (prefix
);
8922 strcpy (tmp
+ length
, tree_code_name
[code
]);
8923 length
+= strlen (tree_code_name
[code
]);
8928 buffer
= "unexpected node";
8930 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8931 buffer
, tree_code_name
[TREE_CODE (node
)],
8932 function
, trim_filename (file
), line
);
8935 /* Complain that the tree code of NODE does match the expected 0
8936 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8940 tree_not_check_failed (const_tree node
, const char *file
,
8941 int line
, const char *function
, ...)
8945 unsigned length
= 0;
8948 va_start (args
, function
);
8949 while ((code
= va_arg (args
, int)))
8950 length
+= 4 + strlen (tree_code_name
[code
]);
8952 va_start (args
, function
);
8953 buffer
= (char *) alloca (length
);
8955 while ((code
= va_arg (args
, int)))
8959 strcpy (buffer
+ length
, " or ");
8962 strcpy (buffer
+ length
, tree_code_name
[code
]);
8963 length
+= strlen (tree_code_name
[code
]);
8967 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8968 buffer
, tree_code_name
[TREE_CODE (node
)],
8969 function
, trim_filename (file
), line
);
8972 /* Similar to tree_check_failed, except that we check for a class of tree
8973 code, given in CL. */
8976 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8977 const char *file
, int line
, const char *function
)
8980 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8981 TREE_CODE_CLASS_STRING (cl
),
8982 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8983 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8986 /* Similar to tree_check_failed, except that instead of specifying a
8987 dozen codes, use the knowledge that they're all sequential. */
8990 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8991 const char *function
, enum tree_code c1
,
8995 unsigned length
= 0;
8998 for (c
= c1
; c
<= c2
; ++c
)
8999 length
+= 4 + strlen (tree_code_name
[c
]);
9001 length
+= strlen ("expected ");
9002 buffer
= (char *) alloca (length
);
9005 for (c
= c1
; c
<= c2
; ++c
)
9007 const char *prefix
= length
? " or " : "expected ";
9009 strcpy (buffer
+ length
, prefix
);
9010 length
+= strlen (prefix
);
9011 strcpy (buffer
+ length
, tree_code_name
[c
]);
9012 length
+= strlen (tree_code_name
[c
]);
9015 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9016 buffer
, tree_code_name
[TREE_CODE (node
)],
9017 function
, trim_filename (file
), line
);
9021 /* Similar to tree_check_failed, except that we check that a tree does
9022 not have the specified code, given in CL. */
9025 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9026 const char *file
, int line
, const char *function
)
9029 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9030 TREE_CODE_CLASS_STRING (cl
),
9031 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9032 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9036 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9039 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9040 const char *function
, enum omp_clause_code code
)
9042 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9043 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9044 function
, trim_filename (file
), line
);
9048 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9051 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9052 const char *function
, enum omp_clause_code c1
,
9053 enum omp_clause_code c2
)
9056 unsigned length
= 0;
9059 for (c
= c1
; c
<= c2
; ++c
)
9060 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9062 length
+= strlen ("expected ");
9063 buffer
= (char *) alloca (length
);
9066 for (c
= c1
; c
<= c2
; ++c
)
9068 const char *prefix
= length
? " or " : "expected ";
9070 strcpy (buffer
+ length
, prefix
);
9071 length
+= strlen (prefix
);
9072 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9073 length
+= strlen (omp_clause_code_name
[c
]);
9076 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9077 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9078 function
, trim_filename (file
), line
);
9082 #undef DEFTREESTRUCT
9083 #define DEFTREESTRUCT(VAL, NAME) NAME,
9085 static const char *ts_enum_names
[] = {
9086 #include "treestruct.def"
9088 #undef DEFTREESTRUCT
9090 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9092 /* Similar to tree_class_check_failed, except that we check for
9093 whether CODE contains the tree structure identified by EN. */
9096 tree_contains_struct_check_failed (const_tree node
,
9097 const enum tree_node_structure_enum en
,
9098 const char *file
, int line
,
9099 const char *function
)
9102 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9104 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9108 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9109 (dynamically sized) vector. */
9112 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9113 const char *function
)
9116 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9117 idx
+ 1, len
, function
, trim_filename (file
), line
);
9120 /* Similar to above, except that the check is for the bounds of the operand
9121 vector of an expression node EXP. */
9124 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9125 int line
, const char *function
)
9127 int code
= TREE_CODE (exp
);
9129 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9130 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9131 function
, trim_filename (file
), line
);
9134 /* Similar to above, except that the check is for the number of
9135 operands of an OMP_CLAUSE node. */
9138 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9139 int line
, const char *function
)
9142 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9143 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9144 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9145 trim_filename (file
), line
);
9147 #endif /* ENABLE_TREE_CHECKING */
9149 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9150 and mapped to the machine mode MODE. Initialize its fields and build
9151 the information necessary for debugging output. */
9154 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9157 hashval_t hashcode
= 0;
9159 t
= make_node (VECTOR_TYPE
);
9160 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9161 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9162 SET_TYPE_MODE (t
, mode
);
9164 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9165 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9166 else if (TYPE_CANONICAL (innertype
) != innertype
9167 || mode
!= VOIDmode
)
9169 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9173 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9174 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9175 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9176 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9177 t
= type_hash_canon (hashcode
, t
);
9179 /* We have built a main variant, based on the main variant of the
9180 inner type. Use it to build the variant we return. */
9181 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9182 && TREE_TYPE (t
) != innertype
)
9183 return build_type_attribute_qual_variant (t
,
9184 TYPE_ATTRIBUTES (innertype
),
9185 TYPE_QUALS (innertype
));
9191 make_or_reuse_type (unsigned size
, int unsignedp
)
9193 if (size
== INT_TYPE_SIZE
)
9194 return unsignedp
? unsigned_type_node
: integer_type_node
;
9195 if (size
== CHAR_TYPE_SIZE
)
9196 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9197 if (size
== SHORT_TYPE_SIZE
)
9198 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9199 if (size
== LONG_TYPE_SIZE
)
9200 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9201 if (size
== LONG_LONG_TYPE_SIZE
)
9202 return (unsignedp
? long_long_unsigned_type_node
9203 : long_long_integer_type_node
);
9204 if (size
== 128 && int128_integer_type_node
)
9205 return (unsignedp
? int128_unsigned_type_node
9206 : int128_integer_type_node
);
9209 return make_unsigned_type (size
);
9211 return make_signed_type (size
);
9214 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9217 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9221 if (size
== SHORT_FRACT_TYPE_SIZE
)
9222 return unsignedp
? sat_unsigned_short_fract_type_node
9223 : sat_short_fract_type_node
;
9224 if (size
== FRACT_TYPE_SIZE
)
9225 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9226 if (size
== LONG_FRACT_TYPE_SIZE
)
9227 return unsignedp
? sat_unsigned_long_fract_type_node
9228 : sat_long_fract_type_node
;
9229 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9230 return unsignedp
? sat_unsigned_long_long_fract_type_node
9231 : sat_long_long_fract_type_node
;
9235 if (size
== SHORT_FRACT_TYPE_SIZE
)
9236 return unsignedp
? unsigned_short_fract_type_node
9237 : short_fract_type_node
;
9238 if (size
== FRACT_TYPE_SIZE
)
9239 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9240 if (size
== LONG_FRACT_TYPE_SIZE
)
9241 return unsignedp
? unsigned_long_fract_type_node
9242 : long_fract_type_node
;
9243 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9244 return unsignedp
? unsigned_long_long_fract_type_node
9245 : long_long_fract_type_node
;
9248 return make_fract_type (size
, unsignedp
, satp
);
9251 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9254 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9258 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9259 return unsignedp
? sat_unsigned_short_accum_type_node
9260 : sat_short_accum_type_node
;
9261 if (size
== ACCUM_TYPE_SIZE
)
9262 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9263 if (size
== LONG_ACCUM_TYPE_SIZE
)
9264 return unsignedp
? sat_unsigned_long_accum_type_node
9265 : sat_long_accum_type_node
;
9266 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9267 return unsignedp
? sat_unsigned_long_long_accum_type_node
9268 : sat_long_long_accum_type_node
;
9272 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9273 return unsignedp
? unsigned_short_accum_type_node
9274 : short_accum_type_node
;
9275 if (size
== ACCUM_TYPE_SIZE
)
9276 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9277 if (size
== LONG_ACCUM_TYPE_SIZE
)
9278 return unsignedp
? unsigned_long_accum_type_node
9279 : long_accum_type_node
;
9280 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9281 return unsignedp
? unsigned_long_long_accum_type_node
9282 : long_long_accum_type_node
;
9285 return make_accum_type (size
, unsignedp
, satp
);
9288 /* Create nodes for all integer types (and error_mark_node) using the sizes
9289 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9290 SHORT_DOUBLE specifies whether double should be of the same precision
9294 build_common_tree_nodes (bool signed_char
, bool short_double
)
9296 error_mark_node
= make_node (ERROR_MARK
);
9297 TREE_TYPE (error_mark_node
) = error_mark_node
;
9299 initialize_sizetypes ();
9301 /* Define both `signed char' and `unsigned char'. */
9302 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9303 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9304 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9305 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9307 /* Define `char', which is like either `signed char' or `unsigned char'
9308 but not the same as either. */
9311 ? make_signed_type (CHAR_TYPE_SIZE
)
9312 : make_unsigned_type (CHAR_TYPE_SIZE
));
9313 TYPE_STRING_FLAG (char_type_node
) = 1;
9315 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9316 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9317 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9318 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9319 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9320 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9321 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9322 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9323 #if HOST_BITS_PER_WIDE_INT >= 64
9324 /* TODO: This isn't correct, but as logic depends at the moment on
9325 host's instead of target's wide-integer.
9326 If there is a target not supporting TImode, but has an 128-bit
9327 integer-scalar register, this target check needs to be adjusted. */
9328 if (targetm
.scalar_mode_supported_p (TImode
))
9330 int128_integer_type_node
= make_signed_type (128);
9331 int128_unsigned_type_node
= make_unsigned_type (128);
9335 /* Define a boolean type. This type only represents boolean values but
9336 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9337 Front ends which want to override this size (i.e. Java) can redefine
9338 boolean_type_node before calling build_common_tree_nodes_2. */
9339 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9340 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9341 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9342 TYPE_PRECISION (boolean_type_node
) = 1;
9344 /* Define what type to use for size_t. */
9345 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9346 size_type_node
= unsigned_type_node
;
9347 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9348 size_type_node
= long_unsigned_type_node
;
9349 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9350 size_type_node
= long_long_unsigned_type_node
;
9351 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9352 size_type_node
= short_unsigned_type_node
;
9356 /* Fill in the rest of the sized types. Reuse existing type nodes
9358 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9359 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9360 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9361 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9362 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9364 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9365 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9366 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9367 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9368 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9370 access_public_node
= get_identifier ("public");
9371 access_protected_node
= get_identifier ("protected");
9372 access_private_node
= get_identifier ("private");
9374 /* Define these next since types below may used them. */
9375 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9376 integer_one_node
= build_int_cst (integer_type_node
, 1);
9377 integer_three_node
= build_int_cst (integer_type_node
, 3);
9378 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9380 size_zero_node
= size_int (0);
9381 size_one_node
= size_int (1);
9382 bitsize_zero_node
= bitsize_int (0);
9383 bitsize_one_node
= bitsize_int (1);
9384 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9386 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9387 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9389 void_type_node
= make_node (VOID_TYPE
);
9390 layout_type (void_type_node
);
9392 /* We are not going to have real types in C with less than byte alignment,
9393 so we might as well not have any types that claim to have it. */
9394 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9395 TYPE_USER_ALIGN (void_type_node
) = 0;
9397 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9398 layout_type (TREE_TYPE (null_pointer_node
));
9400 ptr_type_node
= build_pointer_type (void_type_node
);
9402 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9403 fileptr_type_node
= ptr_type_node
;
9405 float_type_node
= make_node (REAL_TYPE
);
9406 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9407 layout_type (float_type_node
);
9409 double_type_node
= make_node (REAL_TYPE
);
9411 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9413 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9414 layout_type (double_type_node
);
9416 long_double_type_node
= make_node (REAL_TYPE
);
9417 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9418 layout_type (long_double_type_node
);
9420 float_ptr_type_node
= build_pointer_type (float_type_node
);
9421 double_ptr_type_node
= build_pointer_type (double_type_node
);
9422 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9423 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9425 /* Fixed size integer types. */
9426 uint16_type_node
= build_nonstandard_integer_type (16, true);
9427 uint32_type_node
= build_nonstandard_integer_type (32, true);
9428 uint64_type_node
= build_nonstandard_integer_type (64, true);
9430 /* Decimal float types. */
9431 dfloat32_type_node
= make_node (REAL_TYPE
);
9432 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9433 layout_type (dfloat32_type_node
);
9434 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9435 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9437 dfloat64_type_node
= make_node (REAL_TYPE
);
9438 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9439 layout_type (dfloat64_type_node
);
9440 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9441 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9443 dfloat128_type_node
= make_node (REAL_TYPE
);
9444 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9445 layout_type (dfloat128_type_node
);
9446 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9447 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9449 complex_integer_type_node
= build_complex_type (integer_type_node
);
9450 complex_float_type_node
= build_complex_type (float_type_node
);
9451 complex_double_type_node
= build_complex_type (double_type_node
);
9452 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9454 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9455 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9456 sat_ ## KIND ## _type_node = \
9457 make_sat_signed_ ## KIND ## _type (SIZE); \
9458 sat_unsigned_ ## KIND ## _type_node = \
9459 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9460 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9461 unsigned_ ## KIND ## _type_node = \
9462 make_unsigned_ ## KIND ## _type (SIZE);
9464 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9465 sat_ ## WIDTH ## KIND ## _type_node = \
9466 make_sat_signed_ ## KIND ## _type (SIZE); \
9467 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9468 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9469 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9470 unsigned_ ## WIDTH ## KIND ## _type_node = \
9471 make_unsigned_ ## KIND ## _type (SIZE);
9473 /* Make fixed-point type nodes based on four different widths. */
9474 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9475 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9476 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9477 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9478 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9480 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9481 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9482 NAME ## _type_node = \
9483 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9484 u ## NAME ## _type_node = \
9485 make_or_reuse_unsigned_ ## KIND ## _type \
9486 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9487 sat_ ## NAME ## _type_node = \
9488 make_or_reuse_sat_signed_ ## KIND ## _type \
9489 (GET_MODE_BITSIZE (MODE ## mode)); \
9490 sat_u ## NAME ## _type_node = \
9491 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9492 (GET_MODE_BITSIZE (U ## MODE ## mode));
9494 /* Fixed-point type and mode nodes. */
9495 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9496 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9497 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9498 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9499 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9500 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9501 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9502 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9503 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9504 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9505 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9508 tree t
= targetm
.build_builtin_va_list ();
9510 /* Many back-ends define record types without setting TYPE_NAME.
9511 If we copied the record type here, we'd keep the original
9512 record type without a name. This breaks name mangling. So,
9513 don't copy record types and let c_common_nodes_and_builtins()
9514 declare the type to be __builtin_va_list. */
9515 if (TREE_CODE (t
) != RECORD_TYPE
)
9516 t
= build_variant_type_copy (t
);
9518 va_list_type_node
= t
;
9522 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9525 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9526 const char *library_name
, int ecf_flags
)
9530 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9531 library_name
, NULL_TREE
);
9532 if (ecf_flags
& ECF_CONST
)
9533 TREE_READONLY (decl
) = 1;
9534 if (ecf_flags
& ECF_PURE
)
9535 DECL_PURE_P (decl
) = 1;
9536 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9537 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9538 if (ecf_flags
& ECF_NORETURN
)
9539 TREE_THIS_VOLATILE (decl
) = 1;
9540 if (ecf_flags
& ECF_NOTHROW
)
9541 TREE_NOTHROW (decl
) = 1;
9542 if (ecf_flags
& ECF_MALLOC
)
9543 DECL_IS_MALLOC (decl
) = 1;
9544 if (ecf_flags
& ECF_LEAF
)
9545 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9546 NULL
, DECL_ATTRIBUTES (decl
));
9547 if ((ecf_flags
& ECF_TM_PURE
) && flag_tm
)
9548 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9550 set_builtin_decl (code
, decl
, true);
9553 /* Call this function after instantiating all builtins that the language
9554 front end cares about. This will build the rest of the builtins that
9555 are relied upon by the tree optimizers and the middle-end. */
9558 build_common_builtin_nodes (void)
9563 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9564 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9566 ftype
= build_function_type_list (ptr_type_node
,
9567 ptr_type_node
, const_ptr_type_node
,
9568 size_type_node
, NULL_TREE
);
9570 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9571 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9572 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9573 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9574 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9575 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9578 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9580 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9581 const_ptr_type_node
, size_type_node
,
9583 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9584 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9587 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9589 ftype
= build_function_type_list (ptr_type_node
,
9590 ptr_type_node
, integer_type_node
,
9591 size_type_node
, NULL_TREE
);
9592 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9593 "memset", ECF_NOTHROW
| ECF_LEAF
);
9596 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9598 ftype
= build_function_type_list (ptr_type_node
,
9599 size_type_node
, NULL_TREE
);
9600 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9601 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9604 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9605 size_type_node
, NULL_TREE
);
9606 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9607 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9608 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9610 /* If we're checking the stack, `alloca' can throw. */
9611 if (flag_stack_check
)
9613 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9614 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9617 ftype
= build_function_type_list (void_type_node
,
9618 ptr_type_node
, ptr_type_node
,
9619 ptr_type_node
, NULL_TREE
);
9620 local_define_builtin ("__builtin_init_trampoline", ftype
,
9621 BUILT_IN_INIT_TRAMPOLINE
,
9622 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9623 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9624 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9625 "__builtin_init_heap_trampoline",
9626 ECF_NOTHROW
| ECF_LEAF
);
9628 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9629 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9630 BUILT_IN_ADJUST_TRAMPOLINE
,
9631 "__builtin_adjust_trampoline",
9632 ECF_CONST
| ECF_NOTHROW
);
9634 ftype
= build_function_type_list (void_type_node
,
9635 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9636 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9637 BUILT_IN_NONLOCAL_GOTO
,
9638 "__builtin_nonlocal_goto",
9639 ECF_NORETURN
| ECF_NOTHROW
);
9641 ftype
= build_function_type_list (void_type_node
,
9642 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9643 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9644 BUILT_IN_SETJMP_SETUP
,
9645 "__builtin_setjmp_setup", ECF_NOTHROW
);
9647 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9648 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9649 BUILT_IN_SETJMP_DISPATCHER
,
9650 "__builtin_setjmp_dispatcher",
9651 ECF_PURE
| ECF_NOTHROW
);
9653 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9654 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9655 BUILT_IN_SETJMP_RECEIVER
,
9656 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9658 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9659 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9660 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9662 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9663 local_define_builtin ("__builtin_stack_restore", ftype
,
9664 BUILT_IN_STACK_RESTORE
,
9665 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9667 /* If there's a possibility that we might use the ARM EABI, build the
9668 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9669 if (targetm
.arm_eabi_unwinder
)
9671 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9672 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9673 BUILT_IN_CXA_END_CLEANUP
,
9674 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9677 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9678 local_define_builtin ("__builtin_unwind_resume", ftype
,
9679 BUILT_IN_UNWIND_RESUME
,
9680 ((targetm_common
.except_unwind_info (&global_options
)
9682 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9685 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9687 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9689 local_define_builtin ("__builtin_return_address", ftype
,
9690 BUILT_IN_RETURN_ADDRESS
,
9691 "__builtin_return_address",
9695 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9696 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9698 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9699 ptr_type_node
, NULL_TREE
);
9700 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9701 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9702 BUILT_IN_PROFILE_FUNC_ENTER
,
9703 "__cyg_profile_func_enter", 0);
9704 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9705 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9706 BUILT_IN_PROFILE_FUNC_EXIT
,
9707 "__cyg_profile_func_exit", 0);
9710 /* The exception object and filter values from the runtime. The argument
9711 must be zero before exception lowering, i.e. from the front end. After
9712 exception lowering, it will be the region number for the exception
9713 landing pad. These functions are PURE instead of CONST to prevent
9714 them from being hoisted past the exception edge that will initialize
9715 its value in the landing pad. */
9716 ftype
= build_function_type_list (ptr_type_node
,
9717 integer_type_node
, NULL_TREE
);
9718 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9719 /* Only use TM_PURE if we we have TM language support. */
9720 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9721 ecf_flags
|= ECF_TM_PURE
;
9722 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9723 "__builtin_eh_pointer", ecf_flags
);
9725 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9726 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9727 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9728 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9730 ftype
= build_function_type_list (void_type_node
,
9731 integer_type_node
, integer_type_node
,
9733 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9734 BUILT_IN_EH_COPY_VALUES
,
9735 "__builtin_eh_copy_values", ECF_NOTHROW
);
9737 /* Complex multiplication and division. These are handled as builtins
9738 rather than optabs because emit_library_call_value doesn't support
9739 complex. Further, we can do slightly better with folding these
9740 beasties if the real and complex parts of the arguments are separate. */
9744 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9746 char mode_name_buf
[4], *q
;
9748 enum built_in_function mcode
, dcode
;
9749 tree type
, inner_type
;
9750 const char *prefix
= "__";
9752 if (targetm
.libfunc_gnu_prefix
)
9755 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9758 inner_type
= TREE_TYPE (type
);
9760 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9761 inner_type
, inner_type
, NULL_TREE
);
9763 mcode
= ((enum built_in_function
)
9764 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9765 dcode
= ((enum built_in_function
)
9766 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9768 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9772 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9774 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9775 built_in_names
[mcode
],
9776 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9778 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9780 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9781 built_in_names
[dcode
],
9782 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9787 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9790 If we requested a pointer to a vector, build up the pointers that
9791 we stripped off while looking for the inner type. Similarly for
9792 return values from functions.
9794 The argument TYPE is the top of the chain, and BOTTOM is the
9795 new type which we will point to. */
9798 reconstruct_complex_type (tree type
, tree bottom
)
9802 if (TREE_CODE (type
) == POINTER_TYPE
)
9804 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9805 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9806 TYPE_REF_CAN_ALIAS_ALL (type
));
9808 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9810 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9811 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9812 TYPE_REF_CAN_ALIAS_ALL (type
));
9814 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9816 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9817 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9819 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9821 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9822 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9824 else if (TREE_CODE (type
) == METHOD_TYPE
)
9826 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9827 /* The build_method_type_directly() routine prepends 'this' to argument list,
9828 so we must compensate by getting rid of it. */
9830 = build_method_type_directly
9831 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9833 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9835 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9837 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9838 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9843 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9847 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9850 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9854 switch (GET_MODE_CLASS (mode
))
9856 case MODE_VECTOR_INT
:
9857 case MODE_VECTOR_FLOAT
:
9858 case MODE_VECTOR_FRACT
:
9859 case MODE_VECTOR_UFRACT
:
9860 case MODE_VECTOR_ACCUM
:
9861 case MODE_VECTOR_UACCUM
:
9862 nunits
= GET_MODE_NUNITS (mode
);
9866 /* Check that there are no leftover bits. */
9867 gcc_assert (GET_MODE_BITSIZE (mode
)
9868 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9870 nunits
= GET_MODE_BITSIZE (mode
)
9871 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9878 return make_vector_type (innertype
, nunits
, mode
);
9881 /* Similarly, but takes the inner type and number of units, which must be
9885 build_vector_type (tree innertype
, int nunits
)
9887 return make_vector_type (innertype
, nunits
, VOIDmode
);
9890 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9893 build_opaque_vector_type (tree innertype
, int nunits
)
9895 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9897 /* We always build the non-opaque variant before the opaque one,
9898 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9899 cand
= TYPE_NEXT_VARIANT (t
);
9901 && TYPE_VECTOR_OPAQUE (cand
)
9902 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9904 /* Othewise build a variant type and make sure to queue it after
9905 the non-opaque type. */
9906 cand
= build_distinct_type_copy (t
);
9907 TYPE_VECTOR_OPAQUE (cand
) = true;
9908 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9909 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9910 TYPE_NEXT_VARIANT (t
) = cand
;
9911 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9916 /* Given an initializer INIT, return TRUE if INIT is zero or some
9917 aggregate of zeros. Otherwise return FALSE. */
9919 initializer_zerop (const_tree init
)
9925 switch (TREE_CODE (init
))
9928 return integer_zerop (init
);
9931 /* ??? Note that this is not correct for C4X float formats. There,
9932 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9933 negative exponent. */
9934 return real_zerop (init
)
9935 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9938 return fixed_zerop (init
);
9941 return integer_zerop (init
)
9942 || (real_zerop (init
)
9943 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9944 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9949 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
9950 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
9957 unsigned HOST_WIDE_INT idx
;
9959 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9960 if (!initializer_zerop (elt
))
9969 /* We need to loop through all elements to handle cases like
9970 "\0" and "\0foobar". */
9971 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9972 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9983 /* Build an empty statement at location LOC. */
9986 build_empty_stmt (location_t loc
)
9988 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9989 SET_EXPR_LOCATION (t
, loc
);
9994 /* Build an OpenMP clause with code CODE. LOC is the location of the
9998 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10003 length
= omp_clause_num_ops
[code
];
10004 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10006 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10008 t
= ggc_alloc_tree_node (size
);
10009 memset (t
, 0, size
);
10010 TREE_SET_CODE (t
, OMP_CLAUSE
);
10011 OMP_CLAUSE_SET_CODE (t
, code
);
10012 OMP_CLAUSE_LOCATION (t
) = loc
;
10017 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10018 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10019 Except for the CODE and operand count field, other storage for the
10020 object is initialized to zeros. */
10023 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10026 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10028 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10029 gcc_assert (len
>= 1);
10031 record_node_allocation_statistics (code
, length
);
10033 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
10035 TREE_SET_CODE (t
, code
);
10037 /* Can't use TREE_OPERAND to store the length because if checking is
10038 enabled, it will try to check the length before we store it. :-P */
10039 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10044 /* Helper function for build_call_* functions; build a CALL_EXPR with
10045 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10046 the argument slots. */
10049 build_call_1 (tree return_type
, tree fn
, int nargs
)
10053 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10054 TREE_TYPE (t
) = return_type
;
10055 CALL_EXPR_FN (t
) = fn
;
10056 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10061 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10062 FN and a null static chain slot. NARGS is the number of call arguments
10063 which are specified as "..." arguments. */
10066 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10070 va_start (args
, nargs
);
10071 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10076 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10077 FN and a null static chain slot. NARGS is the number of call arguments
10078 which are specified as a va_list ARGS. */
10081 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10086 t
= build_call_1 (return_type
, fn
, nargs
);
10087 for (i
= 0; i
< nargs
; i
++)
10088 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10089 process_call_operands (t
);
10093 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10094 FN and a null static chain slot. NARGS is the number of call arguments
10095 which are specified as a tree array ARGS. */
10098 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10099 int nargs
, const tree
*args
)
10104 t
= build_call_1 (return_type
, fn
, nargs
);
10105 for (i
= 0; i
< nargs
; i
++)
10106 CALL_EXPR_ARG (t
, i
) = args
[i
];
10107 process_call_operands (t
);
10108 SET_EXPR_LOCATION (t
, loc
);
10112 /* Like build_call_array, but takes a VEC. */
10115 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
10120 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
10121 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
10122 CALL_EXPR_ARG (ret
, ix
) = t
;
10123 process_call_operands (ret
);
10128 /* Returns true if it is possible to prove that the index of
10129 an array access REF (an ARRAY_REF expression) falls into the
10133 in_array_bounds_p (tree ref
)
10135 tree idx
= TREE_OPERAND (ref
, 1);
10138 if (TREE_CODE (idx
) != INTEGER_CST
)
10141 min
= array_ref_low_bound (ref
);
10142 max
= array_ref_up_bound (ref
);
10145 || TREE_CODE (min
) != INTEGER_CST
10146 || TREE_CODE (max
) != INTEGER_CST
)
10149 if (tree_int_cst_lt (idx
, min
)
10150 || tree_int_cst_lt (max
, idx
))
10156 /* Returns true if it is possible to prove that the range of
10157 an array access REF (an ARRAY_RANGE_REF expression) falls
10158 into the array bounds. */
10161 range_in_array_bounds_p (tree ref
)
10163 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10164 tree range_min
, range_max
, min
, max
;
10166 range_min
= TYPE_MIN_VALUE (domain_type
);
10167 range_max
= TYPE_MAX_VALUE (domain_type
);
10170 || TREE_CODE (range_min
) != INTEGER_CST
10171 || TREE_CODE (range_max
) != INTEGER_CST
)
10174 min
= array_ref_low_bound (ref
);
10175 max
= array_ref_up_bound (ref
);
10178 || TREE_CODE (min
) != INTEGER_CST
10179 || TREE_CODE (max
) != INTEGER_CST
)
10182 if (tree_int_cst_lt (range_min
, min
)
10183 || tree_int_cst_lt (max
, range_max
))
10189 /* Return true if T (assumed to be a DECL) must be assigned a memory
10193 needs_to_live_in_memory (const_tree t
)
10195 if (TREE_CODE (t
) == SSA_NAME
)
10196 t
= SSA_NAME_VAR (t
);
10198 return (TREE_ADDRESSABLE (t
)
10199 || is_global_var (t
)
10200 || (TREE_CODE (t
) == RESULT_DECL
10201 && !DECL_BY_REFERENCE (t
)
10202 && aggregate_value_p (t
, current_function_decl
)));
10205 /* Return value of a constant X and sign-extend it. */
10208 int_cst_value (const_tree x
)
10210 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10211 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10213 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10214 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10215 || TREE_INT_CST_HIGH (x
) == -1);
10217 if (bits
< HOST_BITS_PER_WIDE_INT
)
10219 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10221 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10223 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10229 /* Return value of a constant X and sign-extend it. */
10232 widest_int_cst_value (const_tree x
)
10234 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10235 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10237 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10238 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10239 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10240 << HOST_BITS_PER_WIDE_INT
);
10242 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10243 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10244 || TREE_INT_CST_HIGH (x
) == -1);
10247 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10249 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10251 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10253 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10259 /* If TYPE is an integral or pointer type, return an integer type with
10260 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10261 if TYPE is already an integer type of signedness UNSIGNEDP. */
10264 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10266 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10269 if (!INTEGRAL_TYPE_P (type
)
10270 && !POINTER_TYPE_P (type
))
10273 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10276 /* If TYPE is an integral or pointer type, return an integer type with
10277 the same precision which is unsigned, or itself if TYPE is already an
10278 unsigned integer type. */
10281 unsigned_type_for (tree type
)
10283 return signed_or_unsigned_type_for (1, type
);
10286 /* If TYPE is an integral or pointer type, return an integer type with
10287 the same precision which is signed, or itself if TYPE is already a
10288 signed integer type. */
10291 signed_type_for (tree type
)
10293 return signed_or_unsigned_type_for (0, type
);
10296 /* Returns the largest value obtainable by casting something in INNER type to
10300 upper_bound_in_type (tree outer
, tree inner
)
10303 unsigned int det
= 0;
10304 unsigned oprec
= TYPE_PRECISION (outer
);
10305 unsigned iprec
= TYPE_PRECISION (inner
);
10308 /* Compute a unique number for every combination. */
10309 det
|= (oprec
> iprec
) ? 4 : 0;
10310 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10311 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10313 /* Determine the exponent to use. */
10318 /* oprec <= iprec, outer: signed, inner: don't care. */
10323 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10327 /* oprec > iprec, outer: signed, inner: signed. */
10331 /* oprec > iprec, outer: signed, inner: unsigned. */
10335 /* oprec > iprec, outer: unsigned, inner: signed. */
10339 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10343 gcc_unreachable ();
10346 /* Compute 2^^prec - 1. */
10347 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10350 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10351 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10355 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10356 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10357 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10360 return double_int_to_tree (outer
, high
);
10363 /* Returns the smallest value obtainable by casting something in INNER type to
10367 lower_bound_in_type (tree outer
, tree inner
)
10370 unsigned oprec
= TYPE_PRECISION (outer
);
10371 unsigned iprec
= TYPE_PRECISION (inner
);
10373 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10375 if (TYPE_UNSIGNED (outer
)
10376 /* If we are widening something of an unsigned type, OUTER type
10377 contains all values of INNER type. In particular, both INNER
10378 and OUTER types have zero in common. */
10379 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10380 low
.low
= low
.high
= 0;
10383 /* If we are widening a signed type to another signed type, we
10384 want to obtain -2^^(iprec-1). If we are keeping the
10385 precision or narrowing to a signed type, we want to obtain
10387 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10389 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10391 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10392 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10396 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10397 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10402 return double_int_to_tree (outer
, low
);
10405 /* Return nonzero if two operands that are suitable for PHI nodes are
10406 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10407 SSA_NAME or invariant. Note that this is strictly an optimization.
10408 That is, callers of this function can directly call operand_equal_p
10409 and get the same result, only slower. */
10412 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10416 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10418 return operand_equal_p (arg0
, arg1
, 0);
10421 /* Returns number of zeros at the end of binary representation of X.
10423 ??? Use ffs if available? */
10426 num_ending_zeros (const_tree x
)
10428 unsigned HOST_WIDE_INT fr
, nfr
;
10429 unsigned num
, abits
;
10430 tree type
= TREE_TYPE (x
);
10432 if (TREE_INT_CST_LOW (x
) == 0)
10434 num
= HOST_BITS_PER_WIDE_INT
;
10435 fr
= TREE_INT_CST_HIGH (x
);
10440 fr
= TREE_INT_CST_LOW (x
);
10443 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10446 if (nfr
<< abits
== fr
)
10453 if (num
> TYPE_PRECISION (type
))
10454 num
= TYPE_PRECISION (type
);
10456 return build_int_cst_type (type
, num
);
10460 #define WALK_SUBTREE(NODE) \
10463 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10469 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10470 be walked whenever a type is seen in the tree. Rest of operands and return
10471 value are as for walk_tree. */
10474 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10475 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10477 tree result
= NULL_TREE
;
10479 switch (TREE_CODE (type
))
10482 case REFERENCE_TYPE
:
10483 /* We have to worry about mutually recursive pointers. These can't
10484 be written in C. They can in Ada. It's pathological, but
10485 there's an ACATS test (c38102a) that checks it. Deal with this
10486 by checking if we're pointing to another pointer, that one
10487 points to another pointer, that one does too, and we have no htab.
10488 If so, get a hash table. We check three levels deep to avoid
10489 the cost of the hash table if we don't need one. */
10490 if (POINTER_TYPE_P (TREE_TYPE (type
))
10491 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10492 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10495 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10503 /* ... fall through ... */
10506 WALK_SUBTREE (TREE_TYPE (type
));
10510 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10512 /* Fall through. */
10514 case FUNCTION_TYPE
:
10515 WALK_SUBTREE (TREE_TYPE (type
));
10519 /* We never want to walk into default arguments. */
10520 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10521 WALK_SUBTREE (TREE_VALUE (arg
));
10526 /* Don't follow this nodes's type if a pointer for fear that
10527 we'll have infinite recursion. If we have a PSET, then we
10530 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10531 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10532 WALK_SUBTREE (TREE_TYPE (type
));
10533 WALK_SUBTREE (TYPE_DOMAIN (type
));
10537 WALK_SUBTREE (TREE_TYPE (type
));
10538 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10548 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10549 called with the DATA and the address of each sub-tree. If FUNC returns a
10550 non-NULL value, the traversal is stopped, and the value returned by FUNC
10551 is returned. If PSET is non-NULL it is used to record the nodes visited,
10552 and to avoid visiting a node more than once. */
10555 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10556 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10558 enum tree_code code
;
10562 #define WALK_SUBTREE_TAIL(NODE) \
10566 goto tail_recurse; \
10571 /* Skip empty subtrees. */
10575 /* Don't walk the same tree twice, if the user has requested
10576 that we avoid doing so. */
10577 if (pset
&& pointer_set_insert (pset
, *tp
))
10580 /* Call the function. */
10582 result
= (*func
) (tp
, &walk_subtrees
, data
);
10584 /* If we found something, return it. */
10588 code
= TREE_CODE (*tp
);
10590 /* Even if we didn't, FUNC may have decided that there was nothing
10591 interesting below this point in the tree. */
10592 if (!walk_subtrees
)
10594 /* But we still need to check our siblings. */
10595 if (code
== TREE_LIST
)
10596 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10597 else if (code
== OMP_CLAUSE
)
10598 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10605 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10606 if (result
|| !walk_subtrees
)
10613 case IDENTIFIER_NODE
:
10620 case PLACEHOLDER_EXPR
:
10624 /* None of these have subtrees other than those already walked
10629 WALK_SUBTREE (TREE_VALUE (*tp
));
10630 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10635 int len
= TREE_VEC_LENGTH (*tp
);
10640 /* Walk all elements but the first. */
10642 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10644 /* Now walk the first one as a tail call. */
10645 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10649 WALK_SUBTREE (TREE_REALPART (*tp
));
10650 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10654 unsigned HOST_WIDE_INT idx
;
10655 constructor_elt
*ce
;
10658 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10660 WALK_SUBTREE (ce
->value
);
10665 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10670 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10672 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10673 into declarations that are just mentioned, rather than
10674 declared; they don't really belong to this part of the tree.
10675 And, we can see cycles: the initializer for a declaration
10676 can refer to the declaration itself. */
10677 WALK_SUBTREE (DECL_INITIAL (decl
));
10678 WALK_SUBTREE (DECL_SIZE (decl
));
10679 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10681 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10684 case STATEMENT_LIST
:
10686 tree_stmt_iterator i
;
10687 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10688 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10693 switch (OMP_CLAUSE_CODE (*tp
))
10695 case OMP_CLAUSE_PRIVATE
:
10696 case OMP_CLAUSE_SHARED
:
10697 case OMP_CLAUSE_FIRSTPRIVATE
:
10698 case OMP_CLAUSE_COPYIN
:
10699 case OMP_CLAUSE_COPYPRIVATE
:
10700 case OMP_CLAUSE_FINAL
:
10701 case OMP_CLAUSE_IF
:
10702 case OMP_CLAUSE_NUM_THREADS
:
10703 case OMP_CLAUSE_SCHEDULE
:
10704 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10707 case OMP_CLAUSE_NOWAIT
:
10708 case OMP_CLAUSE_ORDERED
:
10709 case OMP_CLAUSE_DEFAULT
:
10710 case OMP_CLAUSE_UNTIED
:
10711 case OMP_CLAUSE_MERGEABLE
:
10712 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10714 case OMP_CLAUSE_LASTPRIVATE
:
10715 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10716 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10717 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10719 case OMP_CLAUSE_COLLAPSE
:
10722 for (i
= 0; i
< 3; i
++)
10723 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10724 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10727 case OMP_CLAUSE_REDUCTION
:
10730 for (i
= 0; i
< 4; i
++)
10731 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10732 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10736 gcc_unreachable ();
10744 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10745 But, we only want to walk once. */
10746 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10747 for (i
= 0; i
< len
; ++i
)
10748 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10749 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10753 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10754 defining. We only want to walk into these fields of a type in this
10755 case and not in the general case of a mere reference to the type.
10757 The criterion is as follows: if the field can be an expression, it
10758 must be walked only here. This should be in keeping with the fields
10759 that are directly gimplified in gimplify_type_sizes in order for the
10760 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10761 variable-sized types.
10763 Note that DECLs get walked as part of processing the BIND_EXPR. */
10764 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10766 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10767 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10770 /* Call the function for the type. See if it returns anything or
10771 doesn't want us to continue. If we are to continue, walk both
10772 the normal fields and those for the declaration case. */
10773 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10774 if (result
|| !walk_subtrees
)
10777 /* But do not walk a pointed-to type since it may itself need to
10778 be walked in the declaration case if it isn't anonymous. */
10779 if (!POINTER_TYPE_P (*type_p
))
10781 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10786 /* If this is a record type, also walk the fields. */
10787 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10791 for (field
= TYPE_FIELDS (*type_p
); field
;
10792 field
= DECL_CHAIN (field
))
10794 /* We'd like to look at the type of the field, but we can
10795 easily get infinite recursion. So assume it's pointed
10796 to elsewhere in the tree. Also, ignore things that
10798 if (TREE_CODE (field
) != FIELD_DECL
)
10801 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10802 WALK_SUBTREE (DECL_SIZE (field
));
10803 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10804 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10805 WALK_SUBTREE (DECL_QUALIFIER (field
));
10809 /* Same for scalar types. */
10810 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10811 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10812 || TREE_CODE (*type_p
) == INTEGER_TYPE
10813 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10814 || TREE_CODE (*type_p
) == REAL_TYPE
)
10816 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10817 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10820 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10821 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10826 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10830 /* Walk over all the sub-trees of this operand. */
10831 len
= TREE_OPERAND_LENGTH (*tp
);
10833 /* Go through the subtrees. We need to do this in forward order so
10834 that the scope of a FOR_EXPR is handled properly. */
10837 for (i
= 0; i
< len
- 1; ++i
)
10838 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10839 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10842 /* If this is a type, walk the needed fields in the type. */
10843 else if (TYPE_P (*tp
))
10844 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10848 /* We didn't find what we were looking for. */
10851 #undef WALK_SUBTREE_TAIL
10853 #undef WALK_SUBTREE
10855 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10858 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10862 struct pointer_set_t
*pset
;
10864 pset
= pointer_set_create ();
10865 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10866 pointer_set_destroy (pset
);
10872 tree_block (tree t
)
10874 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10876 if (IS_EXPR_CODE_CLASS (c
))
10877 return &t
->exp
.block
;
10878 gcc_unreachable ();
10882 /* Create a nameless artificial label and put it in the current
10883 function context. The label has a location of LOC. Returns the
10884 newly created label. */
10887 create_artificial_label (location_t loc
)
10889 tree lab
= build_decl (loc
,
10890 LABEL_DECL
, NULL_TREE
, void_type_node
);
10892 DECL_ARTIFICIAL (lab
) = 1;
10893 DECL_IGNORED_P (lab
) = 1;
10894 DECL_CONTEXT (lab
) = current_function_decl
;
10898 /* Given a tree, try to return a useful variable name that we can use
10899 to prefix a temporary that is being assigned the value of the tree.
10900 I.E. given <temp> = &A, return A. */
10905 tree stripped_decl
;
10908 STRIP_NOPS (stripped_decl
);
10909 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10910 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10913 switch (TREE_CODE (stripped_decl
))
10916 return get_name (TREE_OPERAND (stripped_decl
, 0));
10923 /* Return true if TYPE has a variable argument list. */
10926 stdarg_p (const_tree fntype
)
10928 function_args_iterator args_iter
;
10929 tree n
= NULL_TREE
, t
;
10934 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10939 return n
!= NULL_TREE
&& n
!= void_type_node
;
10942 /* Return true if TYPE has a prototype. */
10945 prototype_p (tree fntype
)
10949 gcc_assert (fntype
!= NULL_TREE
);
10951 t
= TYPE_ARG_TYPES (fntype
);
10952 return (t
!= NULL_TREE
);
10955 /* If BLOCK is inlined from an __attribute__((__artificial__))
10956 routine, return pointer to location from where it has been
10959 block_nonartificial_location (tree block
)
10961 location_t
*ret
= NULL
;
10963 while (block
&& TREE_CODE (block
) == BLOCK
10964 && BLOCK_ABSTRACT_ORIGIN (block
))
10966 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10968 while (TREE_CODE (ao
) == BLOCK
10969 && BLOCK_ABSTRACT_ORIGIN (ao
)
10970 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10971 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10973 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10975 /* If AO is an artificial inline, point RET to the
10976 call site locus at which it has been inlined and continue
10977 the loop, in case AO's caller is also an artificial
10979 if (DECL_DECLARED_INLINE_P (ao
)
10980 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10981 ret
= &BLOCK_SOURCE_LOCATION (block
);
10985 else if (TREE_CODE (ao
) != BLOCK
)
10988 block
= BLOCK_SUPERCONTEXT (block
);
10994 /* If EXP is inlined from an __attribute__((__artificial__))
10995 function, return the location of the original call expression. */
10998 tree_nonartificial_location (tree exp
)
11000 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11005 return EXPR_LOCATION (exp
);
11009 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11012 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11015 cl_option_hash_hash (const void *x
)
11017 const_tree
const t
= (const_tree
) x
;
11021 hashval_t hash
= 0;
11023 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11025 p
= (const char *)TREE_OPTIMIZATION (t
);
11026 len
= sizeof (struct cl_optimization
);
11029 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11031 p
= (const char *)TREE_TARGET_OPTION (t
);
11032 len
= sizeof (struct cl_target_option
);
11036 gcc_unreachable ();
11038 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11040 for (i
= 0; i
< len
; i
++)
11042 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11047 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11048 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11052 cl_option_hash_eq (const void *x
, const void *y
)
11054 const_tree
const xt
= (const_tree
) x
;
11055 const_tree
const yt
= (const_tree
) y
;
11060 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11063 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11065 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11066 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11067 len
= sizeof (struct cl_optimization
);
11070 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11072 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11073 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11074 len
= sizeof (struct cl_target_option
);
11078 gcc_unreachable ();
11080 return (memcmp (xp
, yp
, len
) == 0);
11083 /* Build an OPTIMIZATION_NODE based on the current options. */
11086 build_optimization_node (void)
11091 /* Use the cache of optimization nodes. */
11093 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11096 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11100 /* Insert this one into the hash table. */
11101 t
= cl_optimization_node
;
11104 /* Make a new node for next time round. */
11105 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11111 /* Build a TARGET_OPTION_NODE based on the current options. */
11114 build_target_option_node (void)
11119 /* Use the cache of optimization nodes. */
11121 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11124 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11128 /* Insert this one into the hash table. */
11129 t
= cl_target_option_node
;
11132 /* Make a new node for next time round. */
11133 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11139 /* Determine the "ultimate origin" of a block. The block may be an inlined
11140 instance of an inlined instance of a block which is local to an inline
11141 function, so we have to trace all of the way back through the origin chain
11142 to find out what sort of node actually served as the original seed for the
11146 block_ultimate_origin (const_tree block
)
11148 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11150 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11151 nodes in the function to point to themselves; ignore that if
11152 we're trying to output the abstract instance of this function. */
11153 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11156 if (immediate_origin
== NULL_TREE
)
11161 tree lookahead
= immediate_origin
;
11165 ret_val
= lookahead
;
11166 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11167 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11169 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11171 /* The block's abstract origin chain may not be the *ultimate* origin of
11172 the block. It could lead to a DECL that has an abstract origin set.
11173 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11174 will give us if it has one). Note that DECL's abstract origins are
11175 supposed to be the most distant ancestor (or so decl_ultimate_origin
11176 claims), so we don't need to loop following the DECL origins. */
11177 if (DECL_P (ret_val
))
11178 return DECL_ORIGIN (ret_val
);
11184 /* Return true if T1 and T2 are equivalent lists. */
11187 list_equal_p (const_tree t1
, const_tree t2
)
11189 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11190 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11195 /* Return true iff conversion in EXP generates no instruction. Mark
11196 it inline so that we fully inline into the stripping functions even
11197 though we have two uses of this function. */
11200 tree_nop_conversion (const_tree exp
)
11202 tree outer_type
, inner_type
;
11204 if (!CONVERT_EXPR_P (exp
)
11205 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11207 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11210 outer_type
= TREE_TYPE (exp
);
11211 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11216 /* Use precision rather then machine mode when we can, which gives
11217 the correct answer even for submode (bit-field) types. */
11218 if ((INTEGRAL_TYPE_P (outer_type
)
11219 || POINTER_TYPE_P (outer_type
)
11220 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11221 && (INTEGRAL_TYPE_P (inner_type
)
11222 || POINTER_TYPE_P (inner_type
)
11223 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11224 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11226 /* Otherwise fall back on comparing machine modes (e.g. for
11227 aggregate types, floats). */
11228 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11231 /* Return true iff conversion in EXP generates no instruction. Don't
11232 consider conversions changing the signedness. */
11235 tree_sign_nop_conversion (const_tree exp
)
11237 tree outer_type
, inner_type
;
11239 if (!tree_nop_conversion (exp
))
11242 outer_type
= TREE_TYPE (exp
);
11243 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11245 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11246 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11249 /* Strip conversions from EXP according to tree_nop_conversion and
11250 return the resulting expression. */
11253 tree_strip_nop_conversions (tree exp
)
11255 while (tree_nop_conversion (exp
))
11256 exp
= TREE_OPERAND (exp
, 0);
11260 /* Strip conversions from EXP according to tree_sign_nop_conversion
11261 and return the resulting expression. */
11264 tree_strip_sign_nop_conversions (tree exp
)
11266 while (tree_sign_nop_conversion (exp
))
11267 exp
= TREE_OPERAND (exp
, 0);
11271 /* Avoid any floating point extensions from EXP. */
11273 strip_float_extensions (tree exp
)
11275 tree sub
, expt
, subt
;
11277 /* For floating point constant look up the narrowest type that can hold
11278 it properly and handle it like (type)(narrowest_type)constant.
11279 This way we can optimize for instance a=a*2.0 where "a" is float
11280 but 2.0 is double constant. */
11281 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11283 REAL_VALUE_TYPE orig
;
11286 orig
= TREE_REAL_CST (exp
);
11287 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11288 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11289 type
= float_type_node
;
11290 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11291 > TYPE_PRECISION (double_type_node
)
11292 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11293 type
= double_type_node
;
11295 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11298 if (!CONVERT_EXPR_P (exp
))
11301 sub
= TREE_OPERAND (exp
, 0);
11302 subt
= TREE_TYPE (sub
);
11303 expt
= TREE_TYPE (exp
);
11305 if (!FLOAT_TYPE_P (subt
))
11308 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11311 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11314 return strip_float_extensions (sub
);
11317 /* Strip out all handled components that produce invariant
11321 strip_invariant_refs (const_tree op
)
11323 while (handled_component_p (op
))
11325 switch (TREE_CODE (op
))
11328 case ARRAY_RANGE_REF
:
11329 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11330 || TREE_OPERAND (op
, 2) != NULL_TREE
11331 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11335 case COMPONENT_REF
:
11336 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11342 op
= TREE_OPERAND (op
, 0);
11348 static GTY(()) tree gcc_eh_personality_decl
;
11350 /* Return the GCC personality function decl. */
11353 lhd_gcc_personality (void)
11355 if (!gcc_eh_personality_decl
)
11356 gcc_eh_personality_decl
= build_personality_function ("gcc");
11357 return gcc_eh_personality_decl
;
11360 /* Try to find a base info of BINFO that would have its field decl at offset
11361 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11362 found, return, otherwise return NULL_TREE. */
11365 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11367 tree type
= BINFO_TYPE (binfo
);
11371 HOST_WIDE_INT pos
, size
;
11375 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11380 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11382 if (TREE_CODE (fld
) != FIELD_DECL
)
11385 pos
= int_bit_position (fld
);
11386 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11387 if (pos
<= offset
&& (pos
+ size
) > offset
)
11390 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11393 if (!DECL_ARTIFICIAL (fld
))
11395 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11399 /* Offset 0 indicates the primary base, whose vtable contents are
11400 represented in the binfo for the derived class. */
11401 else if (offset
!= 0)
11403 tree base_binfo
, found_binfo
= NULL_TREE
;
11404 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11405 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11407 found_binfo
= base_binfo
;
11412 binfo
= found_binfo
;
11415 type
= TREE_TYPE (fld
);
11420 /* Returns true if X is a typedef decl. */
11423 is_typedef_decl (tree x
)
11425 return (x
&& TREE_CODE (x
) == TYPE_DECL
11426 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11429 /* Returns true iff TYPE is a type variant created for a typedef. */
11432 typedef_variant_p (tree type
)
11434 return is_typedef_decl (TYPE_NAME (type
));
11437 /* Warn about a use of an identifier which was marked deprecated. */
11439 warn_deprecated_use (tree node
, tree attr
)
11443 if (node
== 0 || !warn_deprecated_decl
)
11449 attr
= DECL_ATTRIBUTES (node
);
11450 else if (TYPE_P (node
))
11452 tree decl
= TYPE_STUB_DECL (node
);
11454 attr
= lookup_attribute ("deprecated",
11455 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11460 attr
= lookup_attribute ("deprecated", attr
);
11463 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11469 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11471 warning (OPT_Wdeprecated_declarations
,
11472 "%qD is deprecated (declared at %s:%d): %s",
11473 node
, xloc
.file
, xloc
.line
, msg
);
11475 warning (OPT_Wdeprecated_declarations
,
11476 "%qD is deprecated (declared at %s:%d)",
11477 node
, xloc
.file
, xloc
.line
);
11479 else if (TYPE_P (node
))
11481 tree what
= NULL_TREE
;
11482 tree decl
= TYPE_STUB_DECL (node
);
11484 if (TYPE_NAME (node
))
11486 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11487 what
= TYPE_NAME (node
);
11488 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11489 && DECL_NAME (TYPE_NAME (node
)))
11490 what
= DECL_NAME (TYPE_NAME (node
));
11495 expanded_location xloc
11496 = expand_location (DECL_SOURCE_LOCATION (decl
));
11500 warning (OPT_Wdeprecated_declarations
,
11501 "%qE is deprecated (declared at %s:%d): %s",
11502 what
, xloc
.file
, xloc
.line
, msg
);
11504 warning (OPT_Wdeprecated_declarations
,
11505 "%qE is deprecated (declared at %s:%d)", what
,
11506 xloc
.file
, xloc
.line
);
11511 warning (OPT_Wdeprecated_declarations
,
11512 "type is deprecated (declared at %s:%d): %s",
11513 xloc
.file
, xloc
.line
, msg
);
11515 warning (OPT_Wdeprecated_declarations
,
11516 "type is deprecated (declared at %s:%d)",
11517 xloc
.file
, xloc
.line
);
11525 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11528 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11533 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11536 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11542 #include "gt-tree.h"