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
:
2987 case FIXED_POINT_TYPE
:
2988 /* Here we just check the bounds. */
2989 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2990 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2993 /* We have already checked the component type above, so just check the
2995 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2999 case QUAL_UNION_TYPE
:
3003 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3004 if (TREE_CODE (field
) == FIELD_DECL
3005 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3006 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3007 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3008 || type_contains_placeholder_p (TREE_TYPE (field
))))
3019 /* Wrapper around above function used to cache its result. */
3022 type_contains_placeholder_p (tree type
)
3026 /* If the contains_placeholder_bits field has been initialized,
3027 then we know the answer. */
3028 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3029 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3031 /* Indicate that we've seen this type node, and the answer is false.
3032 This is what we want to return if we run into recursion via fields. */
3033 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3035 /* Compute the real value. */
3036 result
= type_contains_placeholder_1 (type
);
3038 /* Store the real value. */
3039 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3044 /* Push tree EXP onto vector QUEUE if it is not already present. */
3047 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
3052 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
3053 if (simple_cst_equal (iter
, exp
) == 1)
3057 VEC_safe_push (tree
, heap
, *queue
, exp
);
3060 /* Given a tree EXP, find all occurrences of references to fields
3061 in a PLACEHOLDER_EXPR and place them in vector REFS without
3062 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3063 we assume here that EXP contains only arithmetic expressions
3064 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3068 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3070 enum tree_code code
= TREE_CODE (exp
);
3074 /* We handle TREE_LIST and COMPONENT_REF separately. */
3075 if (code
== TREE_LIST
)
3077 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3078 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3080 else if (code
== COMPONENT_REF
)
3082 for (inner
= TREE_OPERAND (exp
, 0);
3083 REFERENCE_CLASS_P (inner
);
3084 inner
= TREE_OPERAND (inner
, 0))
3087 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3088 push_without_duplicates (exp
, refs
);
3090 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3093 switch (TREE_CODE_CLASS (code
))
3098 case tcc_declaration
:
3099 /* Variables allocated to static storage can stay. */
3100 if (!TREE_STATIC (exp
))
3101 push_without_duplicates (exp
, refs
);
3104 case tcc_expression
:
3105 /* This is the pattern built in ada/make_aligning_type. */
3106 if (code
== ADDR_EXPR
3107 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3109 push_without_duplicates (exp
, refs
);
3113 /* Fall through... */
3115 case tcc_exceptional
:
3118 case tcc_comparison
:
3120 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3121 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3125 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3126 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3134 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3135 return a tree with all occurrences of references to F in a
3136 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3137 CONST_DECLs. Note that we assume here that EXP contains only
3138 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3139 occurring only in their argument list. */
3142 substitute_in_expr (tree exp
, tree f
, tree r
)
3144 enum tree_code code
= TREE_CODE (exp
);
3145 tree op0
, op1
, op2
, op3
;
3148 /* We handle TREE_LIST and COMPONENT_REF separately. */
3149 if (code
== TREE_LIST
)
3151 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3152 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3153 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3156 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3158 else if (code
== COMPONENT_REF
)
3162 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3163 and it is the right field, replace it with R. */
3164 for (inner
= TREE_OPERAND (exp
, 0);
3165 REFERENCE_CLASS_P (inner
);
3166 inner
= TREE_OPERAND (inner
, 0))
3170 op1
= TREE_OPERAND (exp
, 1);
3172 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3175 /* If this expression hasn't been completed let, leave it alone. */
3176 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3179 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3180 if (op0
== TREE_OPERAND (exp
, 0))
3184 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3187 switch (TREE_CODE_CLASS (code
))
3192 case tcc_declaration
:
3198 case tcc_expression
:
3202 /* Fall through... */
3204 case tcc_exceptional
:
3207 case tcc_comparison
:
3209 switch (TREE_CODE_LENGTH (code
))
3215 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3216 if (op0
== TREE_OPERAND (exp
, 0))
3219 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3223 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3224 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3226 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3229 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3233 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3234 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3235 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3237 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3238 && op2
== TREE_OPERAND (exp
, 2))
3241 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3245 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3246 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3247 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3248 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3250 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3251 && op2
== TREE_OPERAND (exp
, 2)
3252 && op3
== TREE_OPERAND (exp
, 3))
3256 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3268 new_tree
= NULL_TREE
;
3270 /* If we are trying to replace F with a constant, inline back
3271 functions which do nothing else than computing a value from
3272 the arguments they are passed. This makes it possible to
3273 fold partially or entirely the replacement expression. */
3274 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3276 tree t
= maybe_inline_call_in_expr (exp
);
3278 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3281 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3283 tree op
= TREE_OPERAND (exp
, i
);
3284 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3288 new_tree
= copy_node (exp
);
3289 TREE_OPERAND (new_tree
, i
) = new_op
;
3295 new_tree
= fold (new_tree
);
3296 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3297 process_call_operands (new_tree
);
3308 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3310 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3311 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3316 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3317 for it within OBJ, a tree that is an object or a chain of references. */
3320 substitute_placeholder_in_expr (tree exp
, tree obj
)
3322 enum tree_code code
= TREE_CODE (exp
);
3323 tree op0
, op1
, op2
, op3
;
3326 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3327 in the chain of OBJ. */
3328 if (code
== PLACEHOLDER_EXPR
)
3330 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3333 for (elt
= obj
; elt
!= 0;
3334 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3335 || TREE_CODE (elt
) == COND_EXPR
)
3336 ? TREE_OPERAND (elt
, 1)
3337 : (REFERENCE_CLASS_P (elt
)
3338 || UNARY_CLASS_P (elt
)
3339 || BINARY_CLASS_P (elt
)
3340 || VL_EXP_CLASS_P (elt
)
3341 || EXPRESSION_CLASS_P (elt
))
3342 ? TREE_OPERAND (elt
, 0) : 0))
3343 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3346 for (elt
= obj
; elt
!= 0;
3347 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3348 || TREE_CODE (elt
) == COND_EXPR
)
3349 ? TREE_OPERAND (elt
, 1)
3350 : (REFERENCE_CLASS_P (elt
)
3351 || UNARY_CLASS_P (elt
)
3352 || BINARY_CLASS_P (elt
)
3353 || VL_EXP_CLASS_P (elt
)
3354 || EXPRESSION_CLASS_P (elt
))
3355 ? TREE_OPERAND (elt
, 0) : 0))
3356 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3357 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3359 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3361 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3362 survives until RTL generation, there will be an error. */
3366 /* TREE_LIST is special because we need to look at TREE_VALUE
3367 and TREE_CHAIN, not TREE_OPERANDS. */
3368 else if (code
== TREE_LIST
)
3370 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3371 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3372 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3375 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3378 switch (TREE_CODE_CLASS (code
))
3381 case tcc_declaration
:
3384 case tcc_exceptional
:
3387 case tcc_comparison
:
3388 case tcc_expression
:
3391 switch (TREE_CODE_LENGTH (code
))
3397 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3398 if (op0
== TREE_OPERAND (exp
, 0))
3401 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3405 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3406 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3408 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3411 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3415 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3416 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3417 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3419 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3420 && op2
== TREE_OPERAND (exp
, 2))
3423 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3427 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3428 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3429 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3430 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3432 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3433 && op2
== TREE_OPERAND (exp
, 2)
3434 && op3
== TREE_OPERAND (exp
, 3))
3438 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3450 new_tree
= NULL_TREE
;
3452 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3454 tree op
= TREE_OPERAND (exp
, i
);
3455 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3459 new_tree
= copy_node (exp
);
3460 TREE_OPERAND (new_tree
, i
) = new_op
;
3466 new_tree
= fold (new_tree
);
3467 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3468 process_call_operands (new_tree
);
3479 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3481 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3482 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3487 /* Stabilize a reference so that we can use it any number of times
3488 without causing its operands to be evaluated more than once.
3489 Returns the stabilized reference. This works by means of save_expr,
3490 so see the caveats in the comments about save_expr.
3492 Also allows conversion expressions whose operands are references.
3493 Any other kind of expression is returned unchanged. */
3496 stabilize_reference (tree ref
)
3499 enum tree_code code
= TREE_CODE (ref
);
3506 /* No action is needed in this case. */
3511 case FIX_TRUNC_EXPR
:
3512 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3516 result
= build_nt (INDIRECT_REF
,
3517 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3521 result
= build_nt (COMPONENT_REF
,
3522 stabilize_reference (TREE_OPERAND (ref
, 0)),
3523 TREE_OPERAND (ref
, 1), NULL_TREE
);
3527 result
= build_nt (BIT_FIELD_REF
,
3528 stabilize_reference (TREE_OPERAND (ref
, 0)),
3529 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3530 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3534 result
= build_nt (ARRAY_REF
,
3535 stabilize_reference (TREE_OPERAND (ref
, 0)),
3536 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3537 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3540 case ARRAY_RANGE_REF
:
3541 result
= build_nt (ARRAY_RANGE_REF
,
3542 stabilize_reference (TREE_OPERAND (ref
, 0)),
3543 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3544 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3548 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3549 it wouldn't be ignored. This matters when dealing with
3551 return stabilize_reference_1 (ref
);
3553 /* If arg isn't a kind of lvalue we recognize, make no change.
3554 Caller should recognize the error for an invalid lvalue. */
3559 return error_mark_node
;
3562 TREE_TYPE (result
) = TREE_TYPE (ref
);
3563 TREE_READONLY (result
) = TREE_READONLY (ref
);
3564 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3565 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3570 /* Subroutine of stabilize_reference; this is called for subtrees of
3571 references. Any expression with side-effects must be put in a SAVE_EXPR
3572 to ensure that it is only evaluated once.
3574 We don't put SAVE_EXPR nodes around everything, because assigning very
3575 simple expressions to temporaries causes us to miss good opportunities
3576 for optimizations. Among other things, the opportunity to fold in the
3577 addition of a constant into an addressing mode often gets lost, e.g.
3578 "y[i+1] += x;". In general, we take the approach that we should not make
3579 an assignment unless we are forced into it - i.e., that any non-side effect
3580 operator should be allowed, and that cse should take care of coalescing
3581 multiple utterances of the same expression should that prove fruitful. */
3584 stabilize_reference_1 (tree e
)
3587 enum tree_code code
= TREE_CODE (e
);
3589 /* We cannot ignore const expressions because it might be a reference
3590 to a const array but whose index contains side-effects. But we can
3591 ignore things that are actual constant or that already have been
3592 handled by this function. */
3594 if (tree_invariant_p (e
))
3597 switch (TREE_CODE_CLASS (code
))
3599 case tcc_exceptional
:
3601 case tcc_declaration
:
3602 case tcc_comparison
:
3604 case tcc_expression
:
3607 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3608 so that it will only be evaluated once. */
3609 /* The reference (r) and comparison (<) classes could be handled as
3610 below, but it is generally faster to only evaluate them once. */
3611 if (TREE_SIDE_EFFECTS (e
))
3612 return save_expr (e
);
3616 /* Constants need no processing. In fact, we should never reach
3621 /* Division is slow and tends to be compiled with jumps,
3622 especially the division by powers of 2 that is often
3623 found inside of an array reference. So do it just once. */
3624 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3625 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3626 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3627 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3628 return save_expr (e
);
3629 /* Recursively stabilize each operand. */
3630 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3631 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3635 /* Recursively stabilize each operand. */
3636 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3643 TREE_TYPE (result
) = TREE_TYPE (e
);
3644 TREE_READONLY (result
) = TREE_READONLY (e
);
3645 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3646 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3651 /* Low-level constructors for expressions. */
3653 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3654 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3657 recompute_tree_invariant_for_addr_expr (tree t
)
3660 bool tc
= true, se
= false;
3662 /* We started out assuming this address is both invariant and constant, but
3663 does not have side effects. Now go down any handled components and see if
3664 any of them involve offsets that are either non-constant or non-invariant.
3665 Also check for side-effects.
3667 ??? Note that this code makes no attempt to deal with the case where
3668 taking the address of something causes a copy due to misalignment. */
3670 #define UPDATE_FLAGS(NODE) \
3671 do { tree _node = (NODE); \
3672 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3673 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3675 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3676 node
= TREE_OPERAND (node
, 0))
3678 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3679 array reference (probably made temporarily by the G++ front end),
3680 so ignore all the operands. */
3681 if ((TREE_CODE (node
) == ARRAY_REF
3682 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3683 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3685 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3686 if (TREE_OPERAND (node
, 2))
3687 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3688 if (TREE_OPERAND (node
, 3))
3689 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3691 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3692 FIELD_DECL, apparently. The G++ front end can put something else
3693 there, at least temporarily. */
3694 else if (TREE_CODE (node
) == COMPONENT_REF
3695 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3697 if (TREE_OPERAND (node
, 2))
3698 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3700 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3701 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3704 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3706 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3707 the address, since &(*a)->b is a form of addition. If it's a constant, the
3708 address is constant too. If it's a decl, its address is constant if the
3709 decl is static. Everything else is not constant and, furthermore,
3710 taking the address of a volatile variable is not volatile. */
3711 if (TREE_CODE (node
) == INDIRECT_REF
3712 || TREE_CODE (node
) == MEM_REF
)
3713 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3714 else if (CONSTANT_CLASS_P (node
))
3716 else if (DECL_P (node
))
3717 tc
&= (staticp (node
) != NULL_TREE
);
3721 se
|= TREE_SIDE_EFFECTS (node
);
3725 TREE_CONSTANT (t
) = tc
;
3726 TREE_SIDE_EFFECTS (t
) = se
;
3730 /* Build an expression of code CODE, data type TYPE, and operands as
3731 specified. Expressions and reference nodes can be created this way.
3732 Constants, decls, types and misc nodes cannot be.
3734 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3735 enough for all extant tree codes. */
3738 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3742 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3744 t
= make_node_stat (code PASS_MEM_STAT
);
3751 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3753 int length
= sizeof (struct tree_exp
);
3756 record_node_allocation_statistics (code
, length
);
3758 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3760 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3762 memset (t
, 0, sizeof (struct tree_common
));
3764 TREE_SET_CODE (t
, code
);
3766 TREE_TYPE (t
) = type
;
3767 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3768 TREE_OPERAND (t
, 0) = node
;
3769 TREE_BLOCK (t
) = NULL_TREE
;
3770 if (node
&& !TYPE_P (node
))
3772 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3773 TREE_READONLY (t
) = TREE_READONLY (node
);
3776 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3777 TREE_SIDE_EFFECTS (t
) = 1;
3781 /* All of these have side-effects, no matter what their
3783 TREE_SIDE_EFFECTS (t
) = 1;
3784 TREE_READONLY (t
) = 0;
3788 /* Whether a dereference is readonly has nothing to do with whether
3789 its operand is readonly. */
3790 TREE_READONLY (t
) = 0;
3795 recompute_tree_invariant_for_addr_expr (t
);
3799 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3800 && node
&& !TYPE_P (node
)
3801 && TREE_CONSTANT (node
))
3802 TREE_CONSTANT (t
) = 1;
3803 if (TREE_CODE_CLASS (code
) == tcc_reference
3804 && node
&& TREE_THIS_VOLATILE (node
))
3805 TREE_THIS_VOLATILE (t
) = 1;
3812 #define PROCESS_ARG(N) \
3814 TREE_OPERAND (t, N) = arg##N; \
3815 if (arg##N &&!TYPE_P (arg##N)) \
3817 if (TREE_SIDE_EFFECTS (arg##N)) \
3819 if (!TREE_READONLY (arg##N) \
3820 && !CONSTANT_CLASS_P (arg##N)) \
3821 (void) (read_only = 0); \
3822 if (!TREE_CONSTANT (arg##N)) \
3823 (void) (constant = 0); \
3828 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3830 bool constant
, read_only
, side_effects
;
3833 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3835 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3836 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3837 /* When sizetype precision doesn't match that of pointers
3838 we need to be able to build explicit extensions or truncations
3839 of the offset argument. */
3840 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3841 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3842 && TREE_CODE (arg1
) == INTEGER_CST
);
3844 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3845 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3846 && ptrofftype_p (TREE_TYPE (arg1
)));
3848 t
= make_node_stat (code PASS_MEM_STAT
);
3851 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3852 result based on those same flags for the arguments. But if the
3853 arguments aren't really even `tree' expressions, we shouldn't be trying
3856 /* Expressions without side effects may be constant if their
3857 arguments are as well. */
3858 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3859 || TREE_CODE_CLASS (code
) == tcc_binary
);
3861 side_effects
= TREE_SIDE_EFFECTS (t
);
3866 TREE_READONLY (t
) = read_only
;
3867 TREE_CONSTANT (t
) = constant
;
3868 TREE_SIDE_EFFECTS (t
) = side_effects
;
3869 TREE_THIS_VOLATILE (t
)
3870 = (TREE_CODE_CLASS (code
) == tcc_reference
3871 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3878 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3879 tree arg2 MEM_STAT_DECL
)
3881 bool constant
, read_only
, side_effects
;
3884 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3885 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3887 t
= make_node_stat (code PASS_MEM_STAT
);
3892 /* As a special exception, if COND_EXPR has NULL branches, we
3893 assume that it is a gimple statement and always consider
3894 it to have side effects. */
3895 if (code
== COND_EXPR
3896 && tt
== void_type_node
3897 && arg1
== NULL_TREE
3898 && arg2
== NULL_TREE
)
3899 side_effects
= true;
3901 side_effects
= TREE_SIDE_EFFECTS (t
);
3907 if (code
== COND_EXPR
)
3908 TREE_READONLY (t
) = read_only
;
3910 TREE_SIDE_EFFECTS (t
) = side_effects
;
3911 TREE_THIS_VOLATILE (t
)
3912 = (TREE_CODE_CLASS (code
) == tcc_reference
3913 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3919 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3920 tree arg2
, tree arg3 MEM_STAT_DECL
)
3922 bool constant
, read_only
, side_effects
;
3925 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3927 t
= make_node_stat (code PASS_MEM_STAT
);
3930 side_effects
= TREE_SIDE_EFFECTS (t
);
3937 TREE_SIDE_EFFECTS (t
) = side_effects
;
3938 TREE_THIS_VOLATILE (t
)
3939 = (TREE_CODE_CLASS (code
) == tcc_reference
3940 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3946 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3947 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3949 bool constant
, read_only
, side_effects
;
3952 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3954 t
= make_node_stat (code PASS_MEM_STAT
);
3957 side_effects
= TREE_SIDE_EFFECTS (t
);
3965 TREE_SIDE_EFFECTS (t
) = side_effects
;
3966 TREE_THIS_VOLATILE (t
)
3967 = (TREE_CODE_CLASS (code
) == tcc_reference
3968 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3974 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3975 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3977 bool constant
, read_only
, side_effects
;
3980 gcc_assert (code
== TARGET_MEM_REF
);
3982 t
= make_node_stat (code PASS_MEM_STAT
);
3985 side_effects
= TREE_SIDE_EFFECTS (t
);
3992 if (code
== TARGET_MEM_REF
)
3996 TREE_SIDE_EFFECTS (t
) = side_effects
;
3997 TREE_THIS_VOLATILE (t
)
3998 = (code
== TARGET_MEM_REF
3999 && arg5
&& TREE_THIS_VOLATILE (arg5
));
4004 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4005 on the pointer PTR. */
4008 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4010 HOST_WIDE_INT offset
= 0;
4011 tree ptype
= TREE_TYPE (ptr
);
4013 /* For convenience allow addresses that collapse to a simple base
4015 if (TREE_CODE (ptr
) == ADDR_EXPR
4016 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4017 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4019 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4021 ptr
= build_fold_addr_expr (ptr
);
4022 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4024 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4025 ptr
, build_int_cst (ptype
, offset
));
4026 SET_EXPR_LOCATION (tem
, loc
);
4030 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4033 mem_ref_offset (const_tree t
)
4035 tree toff
= TREE_OPERAND (t
, 1);
4036 return double_int_sext (tree_to_double_int (toff
),
4037 TYPE_PRECISION (TREE_TYPE (toff
)));
4040 /* Return the pointer-type relevant for TBAA purposes from the
4041 gimple memory reference tree T. This is the type to be used for
4042 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4045 reference_alias_ptr_type (const_tree t
)
4047 const_tree base
= t
;
4048 while (handled_component_p (base
))
4049 base
= TREE_OPERAND (base
, 0);
4050 if (TREE_CODE (base
) == MEM_REF
)
4051 return TREE_TYPE (TREE_OPERAND (base
, 1));
4052 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4053 return TREE_TYPE (TMR_OFFSET (base
));
4055 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4058 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4059 offsetted by OFFSET units. */
4062 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4064 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4065 build_fold_addr_expr (base
),
4066 build_int_cst (ptr_type_node
, offset
));
4067 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4068 recompute_tree_invariant_for_addr_expr (addr
);
4072 /* Similar except don't specify the TREE_TYPE
4073 and leave the TREE_SIDE_EFFECTS as 0.
4074 It is permissible for arguments to be null,
4075 or even garbage if their values do not matter. */
4078 build_nt (enum tree_code code
, ...)
4085 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4089 t
= make_node (code
);
4090 length
= TREE_CODE_LENGTH (code
);
4092 for (i
= 0; i
< length
; i
++)
4093 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4099 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4103 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4108 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4109 CALL_EXPR_FN (ret
) = fn
;
4110 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4111 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4112 CALL_EXPR_ARG (ret
, ix
) = t
;
4116 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4117 We do NOT enter this node in any sort of symbol table.
4119 LOC is the location of the decl.
4121 layout_decl is used to set up the decl's storage layout.
4122 Other slots are initialized to 0 or null pointers. */
4125 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4126 tree type MEM_STAT_DECL
)
4130 t
= make_node_stat (code PASS_MEM_STAT
);
4131 DECL_SOURCE_LOCATION (t
) = loc
;
4133 /* if (type == error_mark_node)
4134 type = integer_type_node; */
4135 /* That is not done, deliberately, so that having error_mark_node
4136 as the type can suppress useless errors in the use of this variable. */
4138 DECL_NAME (t
) = name
;
4139 TREE_TYPE (t
) = type
;
4141 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4147 /* Builds and returns function declaration with NAME and TYPE. */
4150 build_fn_decl (const char *name
, tree type
)
4152 tree id
= get_identifier (name
);
4153 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4155 DECL_EXTERNAL (decl
) = 1;
4156 TREE_PUBLIC (decl
) = 1;
4157 DECL_ARTIFICIAL (decl
) = 1;
4158 TREE_NOTHROW (decl
) = 1;
4163 VEC(tree
,gc
) *all_translation_units
;
4165 /* Builds a new translation-unit decl with name NAME, queues it in the
4166 global list of translation-unit decls and returns it. */
4169 build_translation_unit_decl (tree name
)
4171 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4173 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4174 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4179 /* BLOCK nodes are used to represent the structure of binding contours
4180 and declarations, once those contours have been exited and their contents
4181 compiled. This information is used for outputting debugging info. */
4184 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4186 tree block
= make_node (BLOCK
);
4188 BLOCK_VARS (block
) = vars
;
4189 BLOCK_SUBBLOCKS (block
) = subblocks
;
4190 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4191 BLOCK_CHAIN (block
) = chain
;
4196 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4198 LOC is the location to use in tree T. */
4201 protected_set_expr_location (tree t
, location_t loc
)
4203 if (t
&& CAN_HAVE_LOCATION_P (t
))
4204 SET_EXPR_LOCATION (t
, loc
);
4207 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4211 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4213 DECL_ATTRIBUTES (ddecl
) = attribute
;
4217 /* Borrowed from hashtab.c iterative_hash implementation. */
4218 #define mix(a,b,c) \
4220 a -= b; a -= c; a ^= (c>>13); \
4221 b -= c; b -= a; b ^= (a<< 8); \
4222 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4223 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4224 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4225 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4226 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4227 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4228 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4232 /* Produce good hash value combining VAL and VAL2. */
4234 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4236 /* the golden ratio; an arbitrary value. */
4237 hashval_t a
= 0x9e3779b9;
4243 /* Produce good hash value combining VAL and VAL2. */
4245 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4247 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4248 return iterative_hash_hashval_t (val
, val2
);
4251 hashval_t a
= (hashval_t
) val
;
4252 /* Avoid warnings about shifting of more than the width of the type on
4253 hosts that won't execute this path. */
4255 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4257 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4259 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4260 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4267 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4268 is ATTRIBUTE and its qualifiers are QUALS.
4270 Record such modified types already made so we don't make duplicates. */
4273 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4275 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4277 hashval_t hashcode
= 0;
4279 enum tree_code code
= TREE_CODE (ttype
);
4281 /* Building a distinct copy of a tagged type is inappropriate; it
4282 causes breakage in code that expects there to be a one-to-one
4283 relationship between a struct and its fields.
4284 build_duplicate_type is another solution (as used in
4285 handle_transparent_union_attribute), but that doesn't play well
4286 with the stronger C++ type identity model. */
4287 if (TREE_CODE (ttype
) == RECORD_TYPE
4288 || TREE_CODE (ttype
) == UNION_TYPE
4289 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4290 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4292 warning (OPT_Wattributes
,
4293 "ignoring attributes applied to %qT after definition",
4294 TYPE_MAIN_VARIANT (ttype
));
4295 return build_qualified_type (ttype
, quals
);
4298 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4299 ntype
= build_distinct_type_copy (ttype
);
4301 TYPE_ATTRIBUTES (ntype
) = attribute
;
4303 hashcode
= iterative_hash_object (code
, hashcode
);
4304 if (TREE_TYPE (ntype
))
4305 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4307 hashcode
= attribute_hash_list (attribute
, hashcode
);
4309 switch (TREE_CODE (ntype
))
4312 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4315 if (TYPE_DOMAIN (ntype
))
4316 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4320 hashcode
= iterative_hash_object
4321 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4322 hashcode
= iterative_hash_object
4323 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4326 case FIXED_POINT_TYPE
:
4328 unsigned int precision
= TYPE_PRECISION (ntype
);
4329 hashcode
= iterative_hash_object (precision
, hashcode
);
4336 ntype
= type_hash_canon (hashcode
, ntype
);
4338 /* If the target-dependent attributes make NTYPE different from
4339 its canonical type, we will need to use structural equality
4340 checks for this type. */
4341 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4342 || !comp_type_attributes (ntype
, ttype
))
4343 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4344 else if (TYPE_CANONICAL (ntype
) == ntype
)
4345 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4347 ttype
= build_qualified_type (ntype
, quals
);
4349 else if (TYPE_QUALS (ttype
) != quals
)
4350 ttype
= build_qualified_type (ttype
, quals
);
4355 /* Compare two attributes for their value identity. Return true if the
4356 attribute values are known to be equal; otherwise return false.
4360 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4362 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4365 if (TREE_VALUE (attr1
) != NULL_TREE
4366 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4367 && TREE_VALUE (attr2
) != NULL
4368 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4369 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4370 TREE_VALUE (attr2
)) == 1);
4372 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4375 /* Return 0 if the attributes for two types are incompatible, 1 if they
4376 are compatible, and 2 if they are nearly compatible (which causes a
4377 warning to be generated). */
4379 comp_type_attributes (const_tree type1
, const_tree type2
)
4381 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4382 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4387 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4389 const struct attribute_spec
*as
;
4392 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4393 if (!as
|| as
->affects_type_identity
== false)
4396 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4397 if (!attr
|| !attribute_value_equal (a
, attr
))
4402 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4404 const struct attribute_spec
*as
;
4406 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4407 if (!as
|| as
->affects_type_identity
== false)
4410 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4412 /* We don't need to compare trees again, as we did this
4413 already in first loop. */
4415 /* All types - affecting identity - are equal, so
4416 there is no need to call target hook for comparison. */
4420 /* As some type combinations - like default calling-convention - might
4421 be compatible, we have to call the target hook to get the final result. */
4422 return targetm
.comp_type_attributes (type1
, type2
);
4425 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4428 Record such modified types already made so we don't make duplicates. */
4431 build_type_attribute_variant (tree ttype
, tree attribute
)
4433 return build_type_attribute_qual_variant (ttype
, attribute
,
4434 TYPE_QUALS (ttype
));
4438 /* Reset the expression *EXPR_P, a size or position.
4440 ??? We could reset all non-constant sizes or positions. But it's cheap
4441 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4443 We need to reset self-referential sizes or positions because they cannot
4444 be gimplified and thus can contain a CALL_EXPR after the gimplification
4445 is finished, which will run afoul of LTO streaming. And they need to be
4446 reset to something essentially dummy but not constant, so as to preserve
4447 the properties of the object they are attached to. */
4450 free_lang_data_in_one_sizepos (tree
*expr_p
)
4452 tree expr
= *expr_p
;
4453 if (CONTAINS_PLACEHOLDER_P (expr
))
4454 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4458 /* Reset all the fields in a binfo node BINFO. We only keep
4459 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4462 free_lang_data_in_binfo (tree binfo
)
4467 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4469 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4470 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4471 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4472 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4474 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4475 free_lang_data_in_binfo (t
);
4479 /* Reset all language specific information still present in TYPE. */
4482 free_lang_data_in_type (tree type
)
4484 gcc_assert (TYPE_P (type
));
4486 /* Give the FE a chance to remove its own data first. */
4487 lang_hooks
.free_lang_data (type
);
4489 TREE_LANG_FLAG_0 (type
) = 0;
4490 TREE_LANG_FLAG_1 (type
) = 0;
4491 TREE_LANG_FLAG_2 (type
) = 0;
4492 TREE_LANG_FLAG_3 (type
) = 0;
4493 TREE_LANG_FLAG_4 (type
) = 0;
4494 TREE_LANG_FLAG_5 (type
) = 0;
4495 TREE_LANG_FLAG_6 (type
) = 0;
4497 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4499 /* Remove the const and volatile qualifiers from arguments. The
4500 C++ front end removes them, but the C front end does not,
4501 leading to false ODR violation errors when merging two
4502 instances of the same function signature compiled by
4503 different front ends. */
4506 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4508 tree arg_type
= TREE_VALUE (p
);
4510 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4512 int quals
= TYPE_QUALS (arg_type
)
4514 & ~TYPE_QUAL_VOLATILE
;
4515 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4516 free_lang_data_in_type (TREE_VALUE (p
));
4521 /* Remove members that are not actually FIELD_DECLs from the field
4522 list of an aggregate. These occur in C++. */
4523 if (RECORD_OR_UNION_TYPE_P (type
))
4527 /* Note that TYPE_FIELDS can be shared across distinct
4528 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4529 to be removed, we cannot set its TREE_CHAIN to NULL.
4530 Otherwise, we would not be able to find all the other fields
4531 in the other instances of this TREE_TYPE.
4533 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4535 member
= TYPE_FIELDS (type
);
4538 if (TREE_CODE (member
) == FIELD_DECL
4539 || TREE_CODE (member
) == TYPE_DECL
)
4542 TREE_CHAIN (prev
) = member
;
4544 TYPE_FIELDS (type
) = member
;
4548 member
= TREE_CHAIN (member
);
4552 TREE_CHAIN (prev
) = NULL_TREE
;
4554 TYPE_FIELDS (type
) = NULL_TREE
;
4556 TYPE_METHODS (type
) = NULL_TREE
;
4557 if (TYPE_BINFO (type
))
4558 free_lang_data_in_binfo (TYPE_BINFO (type
));
4562 /* For non-aggregate types, clear out the language slot (which
4563 overloads TYPE_BINFO). */
4564 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4566 if (INTEGRAL_TYPE_P (type
)
4567 || SCALAR_FLOAT_TYPE_P (type
)
4568 || FIXED_POINT_TYPE_P (type
))
4570 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4571 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4575 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4576 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4578 if (TYPE_CONTEXT (type
)
4579 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4581 tree ctx
= TYPE_CONTEXT (type
);
4584 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4586 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4587 TYPE_CONTEXT (type
) = ctx
;
4592 /* Return true if DECL may need an assembler name to be set. */
4595 need_assembler_name_p (tree decl
)
4597 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4598 if (TREE_CODE (decl
) != FUNCTION_DECL
4599 && TREE_CODE (decl
) != VAR_DECL
)
4602 /* If DECL already has its assembler name set, it does not need a
4604 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4605 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4608 /* Abstract decls do not need an assembler name. */
4609 if (DECL_ABSTRACT (decl
))
4612 /* For VAR_DECLs, only static, public and external symbols need an
4614 if (TREE_CODE (decl
) == VAR_DECL
4615 && !TREE_STATIC (decl
)
4616 && !TREE_PUBLIC (decl
)
4617 && !DECL_EXTERNAL (decl
))
4620 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4622 /* Do not set assembler name on builtins. Allow RTL expansion to
4623 decide whether to expand inline or via a regular call. */
4624 if (DECL_BUILT_IN (decl
)
4625 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4628 /* Functions represented in the callgraph need an assembler name. */
4629 if (cgraph_get_node (decl
) != NULL
)
4632 /* Unused and not public functions don't need an assembler name. */
4633 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4641 /* Reset all language specific information still present in symbol
4645 free_lang_data_in_decl (tree decl
)
4647 gcc_assert (DECL_P (decl
));
4649 /* Give the FE a chance to remove its own data first. */
4650 lang_hooks
.free_lang_data (decl
);
4652 TREE_LANG_FLAG_0 (decl
) = 0;
4653 TREE_LANG_FLAG_1 (decl
) = 0;
4654 TREE_LANG_FLAG_2 (decl
) = 0;
4655 TREE_LANG_FLAG_3 (decl
) = 0;
4656 TREE_LANG_FLAG_4 (decl
) = 0;
4657 TREE_LANG_FLAG_5 (decl
) = 0;
4658 TREE_LANG_FLAG_6 (decl
) = 0;
4660 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4661 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4662 if (TREE_CODE (decl
) == FIELD_DECL
)
4664 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4665 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4666 DECL_QUALIFIER (decl
) = NULL_TREE
;
4669 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4671 if (gimple_has_body_p (decl
))
4675 /* If DECL has a gimple body, then the context for its
4676 arguments must be DECL. Otherwise, it doesn't really
4677 matter, as we will not be emitting any code for DECL. In
4678 general, there may be other instances of DECL created by
4679 the front end and since PARM_DECLs are generally shared,
4680 their DECL_CONTEXT changes as the replicas of DECL are
4681 created. The only time where DECL_CONTEXT is important
4682 is for the FUNCTION_DECLs that have a gimple body (since
4683 the PARM_DECL will be used in the function's body). */
4684 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4685 DECL_CONTEXT (t
) = decl
;
4688 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4689 At this point, it is not needed anymore. */
4690 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4692 /* Clear the abstract origin if it refers to a method. Otherwise
4693 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4694 origin will not be output correctly. */
4695 if (DECL_ABSTRACT_ORIGIN (decl
)
4696 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4697 && RECORD_OR_UNION_TYPE_P
4698 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4699 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4701 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4702 DECL_VINDEX referring to itself into a vtable slot number as it
4703 should. Happens with functions that are copied and then forgotten
4704 about. Just clear it, it won't matter anymore. */
4705 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4706 DECL_VINDEX (decl
) = NULL_TREE
;
4708 else if (TREE_CODE (decl
) == VAR_DECL
)
4710 if ((DECL_EXTERNAL (decl
)
4711 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4712 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4713 DECL_INITIAL (decl
) = NULL_TREE
;
4715 else if (TREE_CODE (decl
) == TYPE_DECL
4716 || TREE_CODE (decl
) == FIELD_DECL
)
4717 DECL_INITIAL (decl
) = NULL_TREE
;
4718 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4719 && DECL_INITIAL (decl
)
4720 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4722 /* Strip builtins from the translation-unit BLOCK. We still have targets
4723 without builtin_decl_explicit support and also builtins are shared
4724 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4725 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4729 if (TREE_CODE (var
) == FUNCTION_DECL
4730 && DECL_BUILT_IN (var
))
4731 *nextp
= TREE_CHAIN (var
);
4733 nextp
= &TREE_CHAIN (var
);
4739 /* Data used when collecting DECLs and TYPEs for language data removal. */
4741 struct free_lang_data_d
4743 /* Worklist to avoid excessive recursion. */
4744 VEC(tree
,heap
) *worklist
;
4746 /* Set of traversed objects. Used to avoid duplicate visits. */
4747 struct pointer_set_t
*pset
;
4749 /* Array of symbols to process with free_lang_data_in_decl. */
4750 VEC(tree
,heap
) *decls
;
4752 /* Array of types to process with free_lang_data_in_type. */
4753 VEC(tree
,heap
) *types
;
4757 /* Save all language fields needed to generate proper debug information
4758 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4761 save_debug_info_for_decl (tree t
)
4763 /*struct saved_debug_info_d *sdi;*/
4765 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4767 /* FIXME. Partial implementation for saving debug info removed. */
4771 /* Save all language fields needed to generate proper debug information
4772 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4775 save_debug_info_for_type (tree t
)
4777 /*struct saved_debug_info_d *sdi;*/
4779 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4781 /* FIXME. Partial implementation for saving debug info removed. */
4785 /* Add type or decl T to one of the list of tree nodes that need their
4786 language data removed. The lists are held inside FLD. */
4789 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4793 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4794 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4795 save_debug_info_for_decl (t
);
4797 else if (TYPE_P (t
))
4799 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4800 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4801 save_debug_info_for_type (t
);
4807 /* Push tree node T into FLD->WORKLIST. */
4810 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4812 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4813 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4817 /* Operand callback helper for free_lang_data_in_node. *TP is the
4818 subtree operand being considered. */
4821 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4824 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4826 if (TREE_CODE (t
) == TREE_LIST
)
4829 /* Language specific nodes will be removed, so there is no need
4830 to gather anything under them. */
4831 if (is_lang_specific (t
))
4839 /* Note that walk_tree does not traverse every possible field in
4840 decls, so we have to do our own traversals here. */
4841 add_tree_to_fld_list (t
, fld
);
4843 fld_worklist_push (DECL_NAME (t
), fld
);
4844 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4845 fld_worklist_push (DECL_SIZE (t
), fld
);
4846 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4848 /* We are going to remove everything under DECL_INITIAL for
4849 TYPE_DECLs. No point walking them. */
4850 if (TREE_CODE (t
) != TYPE_DECL
)
4851 fld_worklist_push (DECL_INITIAL (t
), fld
);
4853 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4854 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4856 if (TREE_CODE (t
) == FUNCTION_DECL
)
4858 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4859 fld_worklist_push (DECL_RESULT (t
), fld
);
4861 else if (TREE_CODE (t
) == TYPE_DECL
)
4863 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4864 fld_worklist_push (DECL_VINDEX (t
), fld
);
4865 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4867 else if (TREE_CODE (t
) == FIELD_DECL
)
4869 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4870 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4871 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4872 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4874 else if (TREE_CODE (t
) == VAR_DECL
)
4876 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4877 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4880 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4881 && DECL_HAS_VALUE_EXPR_P (t
))
4882 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4884 if (TREE_CODE (t
) != FIELD_DECL
4885 && TREE_CODE (t
) != TYPE_DECL
)
4886 fld_worklist_push (TREE_CHAIN (t
), fld
);
4889 else if (TYPE_P (t
))
4891 /* Note that walk_tree does not traverse every possible field in
4892 types, so we have to do our own traversals here. */
4893 add_tree_to_fld_list (t
, fld
);
4895 if (!RECORD_OR_UNION_TYPE_P (t
))
4896 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4897 fld_worklist_push (TYPE_SIZE (t
), fld
);
4898 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4899 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4900 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4901 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4902 fld_worklist_push (TYPE_NAME (t
), fld
);
4903 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4904 them and thus do not and want not to reach unused pointer types
4906 if (!POINTER_TYPE_P (t
))
4907 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4908 if (!RECORD_OR_UNION_TYPE_P (t
))
4909 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4910 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4911 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4912 do not and want not to reach unused variants this way. */
4913 if (TYPE_CONTEXT (t
))
4915 tree ctx
= TYPE_CONTEXT (t
);
4916 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
4917 So push that instead. */
4918 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
4919 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4920 fld_worklist_push (ctx
, fld
);
4922 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4923 and want not to reach unused types this way. */
4925 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4929 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4931 fld_worklist_push (TREE_TYPE (tem
), fld
);
4932 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4934 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4935 && TREE_CODE (tem
) == TREE_LIST
)
4938 fld_worklist_push (TREE_VALUE (tem
), fld
);
4939 tem
= TREE_CHAIN (tem
);
4943 if (RECORD_OR_UNION_TYPE_P (t
))
4946 /* Push all TYPE_FIELDS - there can be interleaving interesting
4947 and non-interesting things. */
4948 tem
= TYPE_FIELDS (t
);
4951 if (TREE_CODE (tem
) == FIELD_DECL
4952 || TREE_CODE (tem
) == TYPE_DECL
)
4953 fld_worklist_push (tem
, fld
);
4954 tem
= TREE_CHAIN (tem
);
4958 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
4961 else if (TREE_CODE (t
) == BLOCK
)
4964 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4965 fld_worklist_push (tem
, fld
);
4966 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4967 fld_worklist_push (tem
, fld
);
4968 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4971 if (TREE_CODE (t
) != IDENTIFIER_NODE
4972 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
4973 fld_worklist_push (TREE_TYPE (t
), fld
);
4979 /* Find decls and types in T. */
4982 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4986 if (!pointer_set_contains (fld
->pset
, t
))
4987 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4988 if (VEC_empty (tree
, fld
->worklist
))
4990 t
= VEC_pop (tree
, fld
->worklist
);
4994 /* Translate all the types in LIST with the corresponding runtime
4998 get_eh_types_for_runtime (tree list
)
5002 if (list
== NULL_TREE
)
5005 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5007 list
= TREE_CHAIN (list
);
5010 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5011 TREE_CHAIN (prev
) = n
;
5012 prev
= TREE_CHAIN (prev
);
5013 list
= TREE_CHAIN (list
);
5020 /* Find decls and types referenced in EH region R and store them in
5021 FLD->DECLS and FLD->TYPES. */
5024 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5035 /* The types referenced in each catch must first be changed to the
5036 EH types used at runtime. This removes references to FE types
5038 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5040 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5041 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5046 case ERT_ALLOWED_EXCEPTIONS
:
5047 r
->u
.allowed
.type_list
5048 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5049 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5052 case ERT_MUST_NOT_THROW
:
5053 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5054 find_decls_types_r
, fld
, fld
->pset
);
5060 /* Find decls and types referenced in cgraph node N and store them in
5061 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5062 look for *every* kind of DECL and TYPE node reachable from N,
5063 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5064 NAMESPACE_DECLs, etc). */
5067 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5070 struct function
*fn
;
5074 find_decls_types (n
->symbol
.decl
, fld
);
5076 if (!gimple_has_body_p (n
->symbol
.decl
))
5079 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5081 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5083 /* Traverse locals. */
5084 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5085 find_decls_types (t
, fld
);
5087 /* Traverse EH regions in FN. */
5090 FOR_ALL_EH_REGION_FN (r
, fn
)
5091 find_decls_types_in_eh_region (r
, fld
);
5094 /* Traverse every statement in FN. */
5095 FOR_EACH_BB_FN (bb
, fn
)
5097 gimple_stmt_iterator si
;
5100 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5102 gimple phi
= gsi_stmt (si
);
5104 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5106 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5107 find_decls_types (*arg_p
, fld
);
5111 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5113 gimple stmt
= gsi_stmt (si
);
5115 if (is_gimple_call (stmt
))
5116 find_decls_types (gimple_call_fntype (stmt
), fld
);
5118 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5120 tree arg
= gimple_op (stmt
, i
);
5121 find_decls_types (arg
, fld
);
5128 /* Find decls and types referenced in varpool node N and store them in
5129 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5130 look for *every* kind of DECL and TYPE node reachable from N,
5131 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5132 NAMESPACE_DECLs, etc). */
5135 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5137 find_decls_types (v
->symbol
.decl
, fld
);
5140 /* If T needs an assembler name, have one created for it. */
5143 assign_assembler_name_if_neeeded (tree t
)
5145 if (need_assembler_name_p (t
))
5147 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5148 diagnostics that use input_location to show locus
5149 information. The problem here is that, at this point,
5150 input_location is generally anchored to the end of the file
5151 (since the parser is long gone), so we don't have a good
5152 position to pin it to.
5154 To alleviate this problem, this uses the location of T's
5155 declaration. Examples of this are
5156 testsuite/g++.dg/template/cond2.C and
5157 testsuite/g++.dg/template/pr35240.C. */
5158 location_t saved_location
= input_location
;
5159 input_location
= DECL_SOURCE_LOCATION (t
);
5161 decl_assembler_name (t
);
5163 input_location
= saved_location
;
5168 /* Free language specific information for every operand and expression
5169 in every node of the call graph. This process operates in three stages:
5171 1- Every callgraph node and varpool node is traversed looking for
5172 decls and types embedded in them. This is a more exhaustive
5173 search than that done by find_referenced_vars, because it will
5174 also collect individual fields, decls embedded in types, etc.
5176 2- All the decls found are sent to free_lang_data_in_decl.
5178 3- All the types found are sent to free_lang_data_in_type.
5180 The ordering between decls and types is important because
5181 free_lang_data_in_decl sets assembler names, which includes
5182 mangling. So types cannot be freed up until assembler names have
5186 free_lang_data_in_cgraph (void)
5188 struct cgraph_node
*n
;
5189 struct varpool_node
*v
;
5190 struct free_lang_data_d fld
;
5195 /* Initialize sets and arrays to store referenced decls and types. */
5196 fld
.pset
= pointer_set_create ();
5197 fld
.worklist
= NULL
;
5198 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5199 fld
.types
= VEC_alloc (tree
, heap
, 100);
5201 /* Find decls and types in the body of every function in the callgraph. */
5202 FOR_EACH_FUNCTION (n
)
5203 find_decls_types_in_node (n
, &fld
);
5205 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5206 find_decls_types (p
->decl
, &fld
);
5208 /* Find decls and types in every varpool symbol. */
5209 FOR_EACH_VARIABLE (v
)
5210 find_decls_types_in_var (v
, &fld
);
5212 /* Set the assembler name on every decl found. We need to do this
5213 now because free_lang_data_in_decl will invalidate data needed
5214 for mangling. This breaks mangling on interdependent decls. */
5215 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5216 assign_assembler_name_if_neeeded (t
);
5218 /* Traverse every decl found freeing its language data. */
5219 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5220 free_lang_data_in_decl (t
);
5222 /* Traverse every type found freeing its language data. */
5223 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5224 free_lang_data_in_type (t
);
5226 pointer_set_destroy (fld
.pset
);
5227 VEC_free (tree
, heap
, fld
.worklist
);
5228 VEC_free (tree
, heap
, fld
.decls
);
5229 VEC_free (tree
, heap
, fld
.types
);
5233 /* Free resources that are used by FE but are not needed once they are done. */
5236 free_lang_data (void)
5240 /* If we are the LTO frontend we have freed lang-specific data already. */
5242 || !flag_generate_lto
)
5245 /* Allocate and assign alias sets to the standard integer types
5246 while the slots are still in the way the frontends generated them. */
5247 for (i
= 0; i
< itk_none
; ++i
)
5248 if (integer_types
[i
])
5249 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5251 /* Traverse the IL resetting language specific information for
5252 operands, expressions, etc. */
5253 free_lang_data_in_cgraph ();
5255 /* Create gimple variants for common types. */
5256 ptrdiff_type_node
= integer_type_node
;
5257 fileptr_type_node
= ptr_type_node
;
5259 /* Reset some langhooks. Do not reset types_compatible_p, it may
5260 still be used indirectly via the get_alias_set langhook. */
5261 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5262 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5263 /* We do not want the default decl_assembler_name implementation,
5264 rather if we have fixed everything we want a wrapper around it
5265 asserting that all non-local symbols already got their assembler
5266 name and only produce assembler names for local symbols. Or rather
5267 make sure we never call decl_assembler_name on local symbols and
5268 devise a separate, middle-end private scheme for it. */
5270 /* Reset diagnostic machinery. */
5271 tree_diagnostics_defaults (global_dc
);
5277 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5281 "*free_lang_data", /* name */
5283 free_lang_data
, /* execute */
5286 0, /* static_pass_number */
5287 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5288 0, /* properties_required */
5289 0, /* properties_provided */
5290 0, /* properties_destroyed */
5291 0, /* todo_flags_start */
5292 TODO_ggc_collect
/* todo_flags_finish */
5296 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5297 ATTR_NAME. Also used internally by remove_attribute(). */
5299 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5301 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5303 if (ident_len
== attr_len
)
5305 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5308 else if (ident_len
== attr_len
+ 4)
5310 /* There is the possibility that ATTR is 'text' and IDENT is
5312 const char *p
= IDENTIFIER_POINTER (ident
);
5313 if (p
[0] == '_' && p
[1] == '_'
5314 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5315 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5322 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5323 of ATTR_NAME, and LIST is not NULL_TREE. */
5325 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5329 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5331 if (ident_len
== attr_len
)
5333 if (strcmp (attr_name
, IDENTIFIER_POINTER (TREE_PURPOSE (list
))) == 0)
5336 /* TODO: If we made sure that attributes were stored in the
5337 canonical form without '__...__' (ie, as in 'text' as opposed
5338 to '__text__') then we could avoid the following case. */
5339 else if (ident_len
== attr_len
+ 4)
5341 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5342 if (p
[0] == '_' && p
[1] == '_'
5343 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5344 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5347 list
= TREE_CHAIN (list
);
5353 /* A variant of lookup_attribute() that can be used with an identifier
5354 as the first argument, and where the identifier can be either
5355 'text' or '__text__'.
5357 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5358 return a pointer to the attribute's list element if the attribute
5359 is part of the list, or NULL_TREE if not found. If the attribute
5360 appears more than once, this only returns the first occurrence; the
5361 TREE_CHAIN of the return value should be passed back in if further
5362 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5363 can be in the form 'text' or '__text__'. */
5365 lookup_ident_attribute (tree attr_identifier
, tree list
)
5367 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5371 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list
)) == IDENTIFIER_NODE
);
5373 /* Identifiers can be compared directly for equality. */
5374 if (attr_identifier
== TREE_PURPOSE (list
))
5377 /* If they are not equal, they may still be one in the form
5378 'text' while the other one is in the form '__text__'. TODO:
5379 If we were storing attributes in normalized 'text' form, then
5380 this could all go away and we could take full advantage of
5381 the fact that we're comparing identifiers. :-) */
5383 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5384 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5386 if (ident_len
== attr_len
+ 4)
5388 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5389 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5390 if (p
[0] == '_' && p
[1] == '_'
5391 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5392 && strncmp (q
, p
+ 2, attr_len
) == 0)
5395 else if (ident_len
+ 4 == attr_len
)
5397 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5398 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5399 if (q
[0] == '_' && q
[1] == '_'
5400 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5401 && strncmp (q
+ 2, p
, ident_len
) == 0)
5405 list
= TREE_CHAIN (list
);
5411 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5415 remove_attribute (const char *attr_name
, tree list
)
5418 size_t attr_len
= strlen (attr_name
);
5420 gcc_checking_assert (attr_name
[0] != '_');
5422 for (p
= &list
; *p
; )
5425 /* TODO: If we were storing attributes in normalized form, here
5426 we could use a simple strcmp(). */
5427 if (private_is_attribute_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5428 *p
= TREE_CHAIN (l
);
5430 p
= &TREE_CHAIN (l
);
5436 /* Return an attribute list that is the union of a1 and a2. */
5439 merge_attributes (tree a1
, tree a2
)
5443 /* Either one unset? Take the set one. */
5445 if ((attributes
= a1
) == 0)
5448 /* One that completely contains the other? Take it. */
5450 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5452 if (attribute_list_contained (a2
, a1
))
5456 /* Pick the longest list, and hang on the other list. */
5458 if (list_length (a1
) < list_length (a2
))
5459 attributes
= a2
, a2
= a1
;
5461 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5464 for (a
= lookup_ident_attribute (TREE_PURPOSE (a2
), attributes
);
5465 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5466 a
= lookup_ident_attribute (TREE_PURPOSE (a2
), TREE_CHAIN (a
)))
5470 a1
= copy_node (a2
);
5471 TREE_CHAIN (a1
) = attributes
;
5480 /* Given types T1 and T2, merge their attributes and return
5484 merge_type_attributes (tree t1
, tree t2
)
5486 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5487 TYPE_ATTRIBUTES (t2
));
5490 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5494 merge_decl_attributes (tree olddecl
, tree newdecl
)
5496 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5497 DECL_ATTRIBUTES (newdecl
));
5500 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5502 /* Specialization of merge_decl_attributes for various Windows targets.
5504 This handles the following situation:
5506 __declspec (dllimport) int foo;
5509 The second instance of `foo' nullifies the dllimport. */
5512 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5515 int delete_dllimport_p
= 1;
5517 /* What we need to do here is remove from `old' dllimport if it doesn't
5518 appear in `new'. dllimport behaves like extern: if a declaration is
5519 marked dllimport and a definition appears later, then the object
5520 is not dllimport'd. We also remove a `new' dllimport if the old list
5521 contains dllexport: dllexport always overrides dllimport, regardless
5522 of the order of declaration. */
5523 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5524 delete_dllimport_p
= 0;
5525 else if (DECL_DLLIMPORT_P (new_tree
)
5526 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5528 DECL_DLLIMPORT_P (new_tree
) = 0;
5529 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5530 "dllimport ignored", new_tree
);
5532 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5534 /* Warn about overriding a symbol that has already been used, e.g.:
5535 extern int __attribute__ ((dllimport)) foo;
5536 int* bar () {return &foo;}
5539 if (TREE_USED (old
))
5541 warning (0, "%q+D redeclared without dllimport attribute "
5542 "after being referenced with dll linkage", new_tree
);
5543 /* If we have used a variable's address with dllimport linkage,
5544 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5545 decl may already have had TREE_CONSTANT computed.
5546 We still remove the attribute so that assembler code refers
5547 to '&foo rather than '_imp__foo'. */
5548 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5549 DECL_DLLIMPORT_P (new_tree
) = 1;
5552 /* Let an inline definition silently override the external reference,
5553 but otherwise warn about attribute inconsistency. */
5554 else if (TREE_CODE (new_tree
) == VAR_DECL
5555 || !DECL_DECLARED_INLINE_P (new_tree
))
5556 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5557 "previous dllimport ignored", new_tree
);
5560 delete_dllimport_p
= 0;
5562 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5564 if (delete_dllimport_p
)
5565 a
= remove_attribute ("dllimport", a
);
5570 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5571 struct attribute_spec.handler. */
5574 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5580 /* These attributes may apply to structure and union types being created,
5581 but otherwise should pass to the declaration involved. */
5584 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5585 | (int) ATTR_FLAG_ARRAY_NEXT
))
5587 *no_add_attrs
= true;
5588 return tree_cons (name
, args
, NULL_TREE
);
5590 if (TREE_CODE (node
) == RECORD_TYPE
5591 || TREE_CODE (node
) == UNION_TYPE
)
5593 node
= TYPE_NAME (node
);
5599 warning (OPT_Wattributes
, "%qE attribute ignored",
5601 *no_add_attrs
= true;
5606 if (TREE_CODE (node
) != FUNCTION_DECL
5607 && TREE_CODE (node
) != VAR_DECL
5608 && TREE_CODE (node
) != TYPE_DECL
)
5610 *no_add_attrs
= true;
5611 warning (OPT_Wattributes
, "%qE attribute ignored",
5616 if (TREE_CODE (node
) == TYPE_DECL
5617 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5618 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5620 *no_add_attrs
= true;
5621 warning (OPT_Wattributes
, "%qE attribute ignored",
5626 is_dllimport
= is_attribute_p ("dllimport", name
);
5628 /* Report error on dllimport ambiguities seen now before they cause
5632 /* Honor any target-specific overrides. */
5633 if (!targetm
.valid_dllimport_attribute_p (node
))
5634 *no_add_attrs
= true;
5636 else if (TREE_CODE (node
) == FUNCTION_DECL
5637 && DECL_DECLARED_INLINE_P (node
))
5639 warning (OPT_Wattributes
, "inline function %q+D declared as "
5640 " dllimport: attribute ignored", node
);
5641 *no_add_attrs
= true;
5643 /* Like MS, treat definition of dllimported variables and
5644 non-inlined functions on declaration as syntax errors. */
5645 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5647 error ("function %q+D definition is marked dllimport", node
);
5648 *no_add_attrs
= true;
5651 else if (TREE_CODE (node
) == VAR_DECL
)
5653 if (DECL_INITIAL (node
))
5655 error ("variable %q+D definition is marked dllimport",
5657 *no_add_attrs
= true;
5660 /* `extern' needn't be specified with dllimport.
5661 Specify `extern' now and hope for the best. Sigh. */
5662 DECL_EXTERNAL (node
) = 1;
5663 /* Also, implicitly give dllimport'd variables declared within
5664 a function global scope, unless declared static. */
5665 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5666 TREE_PUBLIC (node
) = 1;
5669 if (*no_add_attrs
== false)
5670 DECL_DLLIMPORT_P (node
) = 1;
5672 else if (TREE_CODE (node
) == FUNCTION_DECL
5673 && DECL_DECLARED_INLINE_P (node
)
5674 && flag_keep_inline_dllexport
)
5675 /* An exported function, even if inline, must be emitted. */
5676 DECL_EXTERNAL (node
) = 0;
5678 /* Report error if symbol is not accessible at global scope. */
5679 if (!TREE_PUBLIC (node
)
5680 && (TREE_CODE (node
) == VAR_DECL
5681 || TREE_CODE (node
) == FUNCTION_DECL
))
5683 error ("external linkage required for symbol %q+D because of "
5684 "%qE attribute", node
, name
);
5685 *no_add_attrs
= true;
5688 /* A dllexport'd entity must have default visibility so that other
5689 program units (shared libraries or the main executable) can see
5690 it. A dllimport'd entity must have default visibility so that
5691 the linker knows that undefined references within this program
5692 unit can be resolved by the dynamic linker. */
5695 if (DECL_VISIBILITY_SPECIFIED (node
)
5696 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5697 error ("%qE implies default visibility, but %qD has already "
5698 "been declared with a different visibility",
5700 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5701 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5707 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5709 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5710 of the various TYPE_QUAL values. */
5713 set_type_quals (tree type
, int type_quals
)
5715 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5716 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5717 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5718 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5721 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5724 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5726 return (TYPE_QUALS (cand
) == type_quals
5727 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5728 /* Apparently this is needed for Objective-C. */
5729 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5730 /* Check alignment. */
5731 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5732 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5733 TYPE_ATTRIBUTES (base
)));
5736 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5739 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5741 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5742 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5743 /* Apparently this is needed for Objective-C. */
5744 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5745 /* Check alignment. */
5746 && TYPE_ALIGN (cand
) == align
5747 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5748 TYPE_ATTRIBUTES (base
)));
5751 /* Return a version of the TYPE, qualified as indicated by the
5752 TYPE_QUALS, if one exists. If no qualified version exists yet,
5753 return NULL_TREE. */
5756 get_qualified_type (tree type
, int type_quals
)
5760 if (TYPE_QUALS (type
) == type_quals
)
5763 /* Search the chain of variants to see if there is already one there just
5764 like the one we need to have. If so, use that existing one. We must
5765 preserve the TYPE_NAME, since there is code that depends on this. */
5766 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5767 if (check_qualified_type (t
, type
, type_quals
))
5773 /* Like get_qualified_type, but creates the type if it does not
5774 exist. This function never returns NULL_TREE. */
5777 build_qualified_type (tree type
, int type_quals
)
5781 /* See if we already have the appropriate qualified variant. */
5782 t
= get_qualified_type (type
, type_quals
);
5784 /* If not, build it. */
5787 t
= build_variant_type_copy (type
);
5788 set_type_quals (t
, type_quals
);
5790 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5791 /* Propagate structural equality. */
5792 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5793 else if (TYPE_CANONICAL (type
) != type
)
5794 /* Build the underlying canonical type, since it is different
5796 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5799 /* T is its own canonical type. */
5800 TYPE_CANONICAL (t
) = t
;
5807 /* Create a variant of type T with alignment ALIGN. */
5810 build_aligned_type (tree type
, unsigned int align
)
5814 if (TYPE_PACKED (type
)
5815 || TYPE_ALIGN (type
) == align
)
5818 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5819 if (check_aligned_type (t
, type
, align
))
5822 t
= build_variant_type_copy (type
);
5823 TYPE_ALIGN (t
) = align
;
5828 /* Create a new distinct copy of TYPE. The new type is made its own
5829 MAIN_VARIANT. If TYPE requires structural equality checks, the
5830 resulting type requires structural equality checks; otherwise, its
5831 TYPE_CANONICAL points to itself. */
5834 build_distinct_type_copy (tree type
)
5836 tree t
= copy_node (type
);
5838 TYPE_POINTER_TO (t
) = 0;
5839 TYPE_REFERENCE_TO (t
) = 0;
5841 /* Set the canonical type either to a new equivalence class, or
5842 propagate the need for structural equality checks. */
5843 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5844 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5846 TYPE_CANONICAL (t
) = t
;
5848 /* Make it its own variant. */
5849 TYPE_MAIN_VARIANT (t
) = t
;
5850 TYPE_NEXT_VARIANT (t
) = 0;
5852 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5853 whose TREE_TYPE is not t. This can also happen in the Ada
5854 frontend when using subtypes. */
5859 /* Create a new variant of TYPE, equivalent but distinct. This is so
5860 the caller can modify it. TYPE_CANONICAL for the return type will
5861 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5862 are considered equal by the language itself (or that both types
5863 require structural equality checks). */
5866 build_variant_type_copy (tree type
)
5868 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5870 t
= build_distinct_type_copy (type
);
5872 /* Since we're building a variant, assume that it is a non-semantic
5873 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5874 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5876 /* Add the new type to the chain of variants of TYPE. */
5877 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5878 TYPE_NEXT_VARIANT (m
) = t
;
5879 TYPE_MAIN_VARIANT (t
) = m
;
5884 /* Return true if the from tree in both tree maps are equal. */
5887 tree_map_base_eq (const void *va
, const void *vb
)
5889 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5890 *const b
= (const struct tree_map_base
*) vb
;
5891 return (a
->from
== b
->from
);
5894 /* Hash a from tree in a tree_base_map. */
5897 tree_map_base_hash (const void *item
)
5899 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5902 /* Return true if this tree map structure is marked for garbage collection
5903 purposes. We simply return true if the from tree is marked, so that this
5904 structure goes away when the from tree goes away. */
5907 tree_map_base_marked_p (const void *p
)
5909 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5912 /* Hash a from tree in a tree_map. */
5915 tree_map_hash (const void *item
)
5917 return (((const struct tree_map
*) item
)->hash
);
5920 /* Hash a from tree in a tree_decl_map. */
5923 tree_decl_map_hash (const void *item
)
5925 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5928 /* Return the initialization priority for DECL. */
5931 decl_init_priority_lookup (tree decl
)
5933 struct tree_priority_map
*h
;
5934 struct tree_map_base in
;
5936 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5938 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5939 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5942 /* Return the finalization priority for DECL. */
5945 decl_fini_priority_lookup (tree decl
)
5947 struct tree_priority_map
*h
;
5948 struct tree_map_base in
;
5950 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5952 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5953 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5956 /* Return the initialization and finalization priority information for
5957 DECL. If there is no previous priority information, a freshly
5958 allocated structure is returned. */
5960 static struct tree_priority_map
*
5961 decl_priority_info (tree decl
)
5963 struct tree_priority_map in
;
5964 struct tree_priority_map
*h
;
5967 in
.base
.from
= decl
;
5968 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5969 h
= (struct tree_priority_map
*) *loc
;
5972 h
= ggc_alloc_cleared_tree_priority_map ();
5974 h
->base
.from
= decl
;
5975 h
->init
= DEFAULT_INIT_PRIORITY
;
5976 h
->fini
= DEFAULT_INIT_PRIORITY
;
5982 /* Set the initialization priority for DECL to PRIORITY. */
5985 decl_init_priority_insert (tree decl
, priority_type priority
)
5987 struct tree_priority_map
*h
;
5989 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5990 if (priority
== DEFAULT_INIT_PRIORITY
)
5992 h
= decl_priority_info (decl
);
5996 /* Set the finalization priority for DECL to PRIORITY. */
5999 decl_fini_priority_insert (tree decl
, priority_type priority
)
6001 struct tree_priority_map
*h
;
6003 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6004 if (priority
== DEFAULT_INIT_PRIORITY
)
6006 h
= decl_priority_info (decl
);
6010 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6013 print_debug_expr_statistics (void)
6015 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6016 (long) htab_size (debug_expr_for_decl
),
6017 (long) htab_elements (debug_expr_for_decl
),
6018 htab_collisions (debug_expr_for_decl
));
6021 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6024 print_value_expr_statistics (void)
6026 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6027 (long) htab_size (value_expr_for_decl
),
6028 (long) htab_elements (value_expr_for_decl
),
6029 htab_collisions (value_expr_for_decl
));
6032 /* Lookup a debug expression for FROM, and return it if we find one. */
6035 decl_debug_expr_lookup (tree from
)
6037 struct tree_decl_map
*h
, in
;
6038 in
.base
.from
= from
;
6040 h
= (struct tree_decl_map
*)
6041 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6047 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6050 decl_debug_expr_insert (tree from
, tree to
)
6052 struct tree_decl_map
*h
;
6055 h
= ggc_alloc_tree_decl_map ();
6056 h
->base
.from
= from
;
6058 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6060 *(struct tree_decl_map
**) loc
= h
;
6063 /* Lookup a value expression for FROM, and return it if we find one. */
6066 decl_value_expr_lookup (tree from
)
6068 struct tree_decl_map
*h
, in
;
6069 in
.base
.from
= from
;
6071 h
= (struct tree_decl_map
*)
6072 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6078 /* Insert a mapping FROM->TO in the value expression hashtable. */
6081 decl_value_expr_insert (tree from
, tree to
)
6083 struct tree_decl_map
*h
;
6086 h
= ggc_alloc_tree_decl_map ();
6087 h
->base
.from
= from
;
6089 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6091 *(struct tree_decl_map
**) loc
= h
;
6094 /* Lookup a vector of debug arguments for FROM, and return it if we
6098 decl_debug_args_lookup (tree from
)
6100 struct tree_vec_map
*h
, in
;
6102 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6104 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6105 in
.base
.from
= from
;
6106 h
= (struct tree_vec_map
*)
6107 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6113 /* Insert a mapping FROM->empty vector of debug arguments in the value
6114 expression hashtable. */
6117 decl_debug_args_insert (tree from
)
6119 struct tree_vec_map
*h
;
6122 if (DECL_HAS_DEBUG_ARGS_P (from
))
6123 return decl_debug_args_lookup (from
);
6124 if (debug_args_for_decl
== NULL
)
6125 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6126 tree_vec_map_eq
, 0);
6127 h
= ggc_alloc_tree_vec_map ();
6128 h
->base
.from
= from
;
6130 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6132 *(struct tree_vec_map
**) loc
= h
;
6133 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6137 /* Hashing of types so that we don't make duplicates.
6138 The entry point is `type_hash_canon'. */
6140 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6141 with types in the TREE_VALUE slots), by adding the hash codes
6142 of the individual types. */
6145 type_hash_list (const_tree list
, hashval_t hashcode
)
6149 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6150 if (TREE_VALUE (tail
) != error_mark_node
)
6151 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6157 /* These are the Hashtable callback functions. */
6159 /* Returns true iff the types are equivalent. */
6162 type_hash_eq (const void *va
, const void *vb
)
6164 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6165 *const b
= (const struct type_hash
*) vb
;
6167 /* First test the things that are the same for all types. */
6168 if (a
->hash
!= b
->hash
6169 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6170 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6171 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6172 TYPE_ATTRIBUTES (b
->type
))
6173 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6174 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6177 /* Be careful about comparing arrays before and after the element type
6178 has been completed; don't compare TYPE_ALIGN unless both types are
6180 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6181 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6182 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6185 switch (TREE_CODE (a
->type
))
6190 case REFERENCE_TYPE
:
6194 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6197 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6198 && !(TYPE_VALUES (a
->type
)
6199 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6200 && TYPE_VALUES (b
->type
)
6201 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6202 && type_list_equal (TYPE_VALUES (a
->type
),
6203 TYPE_VALUES (b
->type
))))
6206 /* ... fall through ... */
6211 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6212 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6213 TYPE_MAX_VALUE (b
->type
)))
6214 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6215 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6216 TYPE_MIN_VALUE (b
->type
))));
6218 case FIXED_POINT_TYPE
:
6219 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6222 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6225 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6226 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6227 || (TYPE_ARG_TYPES (a
->type
)
6228 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6229 && TYPE_ARG_TYPES (b
->type
)
6230 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6231 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6232 TYPE_ARG_TYPES (b
->type
)))))
6236 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6240 case QUAL_UNION_TYPE
:
6241 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6242 || (TYPE_FIELDS (a
->type
)
6243 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6244 && TYPE_FIELDS (b
->type
)
6245 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6246 && type_list_equal (TYPE_FIELDS (a
->type
),
6247 TYPE_FIELDS (b
->type
))));
6250 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6251 || (TYPE_ARG_TYPES (a
->type
)
6252 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6253 && TYPE_ARG_TYPES (b
->type
)
6254 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6255 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6256 TYPE_ARG_TYPES (b
->type
))))
6264 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6265 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6270 /* Return the cached hash value. */
6273 type_hash_hash (const void *item
)
6275 return ((const struct type_hash
*) item
)->hash
;
6278 /* Look in the type hash table for a type isomorphic to TYPE.
6279 If one is found, return it. Otherwise return 0. */
6282 type_hash_lookup (hashval_t hashcode
, tree type
)
6284 struct type_hash
*h
, in
;
6286 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6287 must call that routine before comparing TYPE_ALIGNs. */
6293 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6300 /* Add an entry to the type-hash-table
6301 for a type TYPE whose hash code is HASHCODE. */
6304 type_hash_add (hashval_t hashcode
, tree type
)
6306 struct type_hash
*h
;
6309 h
= ggc_alloc_type_hash ();
6312 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6316 /* Given TYPE, and HASHCODE its hash code, return the canonical
6317 object for an identical type if one already exists.
6318 Otherwise, return TYPE, and record it as the canonical object.
6320 To use this function, first create a type of the sort you want.
6321 Then compute its hash code from the fields of the type that
6322 make it different from other similar types.
6323 Then call this function and use the value. */
6326 type_hash_canon (unsigned int hashcode
, tree type
)
6330 /* The hash table only contains main variants, so ensure that's what we're
6332 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6334 /* See if the type is in the hash table already. If so, return it.
6335 Otherwise, add the type. */
6336 t1
= type_hash_lookup (hashcode
, type
);
6339 #ifdef GATHER_STATISTICS
6340 tree_code_counts
[(int) TREE_CODE (type
)]--;
6341 tree_node_counts
[(int) t_kind
]--;
6342 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6348 type_hash_add (hashcode
, type
);
6353 /* See if the data pointed to by the type hash table is marked. We consider
6354 it marked if the type is marked or if a debug type number or symbol
6355 table entry has been made for the type. */
6358 type_hash_marked_p (const void *p
)
6360 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6362 return ggc_marked_p (type
);
6366 print_type_hash_statistics (void)
6368 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6369 (long) htab_size (type_hash_table
),
6370 (long) htab_elements (type_hash_table
),
6371 htab_collisions (type_hash_table
));
6374 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6375 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6376 by adding the hash codes of the individual attributes. */
6379 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6383 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6384 /* ??? Do we want to add in TREE_VALUE too? */
6385 hashcode
= iterative_hash_object
6386 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6390 /* Given two lists of attributes, return true if list l2 is
6391 equivalent to l1. */
6394 attribute_list_equal (const_tree l1
, const_tree l2
)
6399 return attribute_list_contained (l1
, l2
)
6400 && attribute_list_contained (l2
, l1
);
6403 /* Given two lists of attributes, return true if list L2 is
6404 completely contained within L1. */
6405 /* ??? This would be faster if attribute names were stored in a canonicalized
6406 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6407 must be used to show these elements are equivalent (which they are). */
6408 /* ??? It's not clear that attributes with arguments will always be handled
6412 attribute_list_contained (const_tree l1
, const_tree l2
)
6416 /* First check the obvious, maybe the lists are identical. */
6420 /* Maybe the lists are similar. */
6421 for (t1
= l1
, t2
= l2
;
6423 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6424 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6425 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6428 /* Maybe the lists are equal. */
6429 if (t1
== 0 && t2
== 0)
6432 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6435 /* This CONST_CAST is okay because lookup_attribute does not
6436 modify its argument and the return value is assigned to a
6438 for (attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), CONST_CAST_TREE(l1
));
6439 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6440 attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), TREE_CHAIN (attr
)))
6443 if (attr
== NULL_TREE
)
6450 /* Given two lists of types
6451 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6452 return 1 if the lists contain the same types in the same order.
6453 Also, the TREE_PURPOSEs must match. */
6456 type_list_equal (const_tree l1
, const_tree l2
)
6460 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6461 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6462 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6463 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6464 && (TREE_TYPE (TREE_PURPOSE (t1
))
6465 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6471 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6472 given by TYPE. If the argument list accepts variable arguments,
6473 then this function counts only the ordinary arguments. */
6476 type_num_arguments (const_tree type
)
6481 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6482 /* If the function does not take a variable number of arguments,
6483 the last element in the list will have type `void'. */
6484 if (VOID_TYPE_P (TREE_VALUE (t
)))
6492 /* Nonzero if integer constants T1 and T2
6493 represent the same constant value. */
6496 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6501 if (t1
== 0 || t2
== 0)
6504 if (TREE_CODE (t1
) == INTEGER_CST
6505 && TREE_CODE (t2
) == INTEGER_CST
6506 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6507 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6513 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6514 The precise way of comparison depends on their data type. */
6517 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6522 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6524 int t1_sgn
= tree_int_cst_sgn (t1
);
6525 int t2_sgn
= tree_int_cst_sgn (t2
);
6527 if (t1_sgn
< t2_sgn
)
6529 else if (t1_sgn
> t2_sgn
)
6531 /* Otherwise, both are non-negative, so we compare them as
6532 unsigned just in case one of them would overflow a signed
6535 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6536 return INT_CST_LT (t1
, t2
);
6538 return INT_CST_LT_UNSIGNED (t1
, t2
);
6541 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6544 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6546 if (tree_int_cst_lt (t1
, t2
))
6548 else if (tree_int_cst_lt (t2
, t1
))
6554 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6555 the host. If POS is zero, the value can be represented in a single
6556 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6557 be represented in a single unsigned HOST_WIDE_INT. */
6560 host_integerp (const_tree t
, int pos
)
6565 return (TREE_CODE (t
) == INTEGER_CST
6566 && ((TREE_INT_CST_HIGH (t
) == 0
6567 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6568 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6569 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6570 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6571 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6574 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6575 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6576 be non-negative. We must be able to satisfy the above conditions. */
6579 tree_low_cst (const_tree t
, int pos
)
6581 gcc_assert (host_integerp (t
, pos
));
6582 return TREE_INT_CST_LOW (t
);
6585 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6586 kind INTEGER_CST. This makes sure to properly sign-extend the
6590 size_low_cst (const_tree t
)
6592 double_int d
= tree_to_double_int (t
);
6593 return double_int_sext (d
, TYPE_PRECISION (TREE_TYPE (t
))).low
;
6596 /* Return the most significant (sign) bit of T. */
6599 tree_int_cst_sign_bit (const_tree t
)
6601 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6602 unsigned HOST_WIDE_INT w
;
6604 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6605 w
= TREE_INT_CST_LOW (t
);
6608 w
= TREE_INT_CST_HIGH (t
);
6609 bitno
-= HOST_BITS_PER_WIDE_INT
;
6612 return (w
>> bitno
) & 1;
6615 /* Return an indication of the sign of the integer constant T.
6616 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6617 Note that -1 will never be returned if T's type is unsigned. */
6620 tree_int_cst_sgn (const_tree t
)
6622 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6624 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6626 else if (TREE_INT_CST_HIGH (t
) < 0)
6632 /* Return the minimum number of bits needed to represent VALUE in a
6633 signed or unsigned type, UNSIGNEDP says which. */
6636 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6640 /* If the value is negative, compute its negative minus 1. The latter
6641 adjustment is because the absolute value of the largest negative value
6642 is one larger than the largest positive value. This is equivalent to
6643 a bit-wise negation, so use that operation instead. */
6645 if (tree_int_cst_sgn (value
) < 0)
6646 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6648 /* Return the number of bits needed, taking into account the fact
6649 that we need one more bit for a signed than unsigned type. */
6651 if (integer_zerop (value
))
6654 log
= tree_floor_log2 (value
);
6656 return log
+ 1 + !unsignedp
;
6659 /* Compare two constructor-element-type constants. Return 1 if the lists
6660 are known to be equal; otherwise return 0. */
6663 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6665 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6667 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6670 l1
= TREE_CHAIN (l1
);
6671 l2
= TREE_CHAIN (l2
);
6677 /* Return truthvalue of whether T1 is the same tree structure as T2.
6678 Return 1 if they are the same.
6679 Return 0 if they are understandably different.
6680 Return -1 if either contains tree structure not understood by
6684 simple_cst_equal (const_tree t1
, const_tree t2
)
6686 enum tree_code code1
, code2
;
6692 if (t1
== 0 || t2
== 0)
6695 code1
= TREE_CODE (t1
);
6696 code2
= TREE_CODE (t2
);
6698 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6700 if (CONVERT_EXPR_CODE_P (code2
)
6701 || code2
== NON_LVALUE_EXPR
)
6702 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6704 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6707 else if (CONVERT_EXPR_CODE_P (code2
)
6708 || code2
== NON_LVALUE_EXPR
)
6709 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6717 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6718 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6721 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6724 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6727 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6728 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6729 TREE_STRING_LENGTH (t1
)));
6733 unsigned HOST_WIDE_INT idx
;
6734 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6735 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6737 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6740 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6741 /* ??? Should we handle also fields here? */
6742 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6743 VEC_index (constructor_elt
, v2
, idx
)->value
))
6749 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6752 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6755 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6758 const_tree arg1
, arg2
;
6759 const_call_expr_arg_iterator iter1
, iter2
;
6760 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6761 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6763 arg1
= next_const_call_expr_arg (&iter1
),
6764 arg2
= next_const_call_expr_arg (&iter2
))
6766 cmp
= simple_cst_equal (arg1
, arg2
);
6770 return arg1
== arg2
;
6774 /* Special case: if either target is an unallocated VAR_DECL,
6775 it means that it's going to be unified with whatever the
6776 TARGET_EXPR is really supposed to initialize, so treat it
6777 as being equivalent to anything. */
6778 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6779 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6780 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6781 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6782 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6783 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6786 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6791 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6793 case WITH_CLEANUP_EXPR
:
6794 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6798 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6801 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6802 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6816 /* This general rule works for most tree codes. All exceptions should be
6817 handled above. If this is a language-specific tree code, we can't
6818 trust what might be in the operand, so say we don't know
6820 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6823 switch (TREE_CODE_CLASS (code1
))
6827 case tcc_comparison
:
6828 case tcc_expression
:
6832 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6834 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6846 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6847 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6848 than U, respectively. */
6851 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6853 if (tree_int_cst_sgn (t
) < 0)
6855 else if (TREE_INT_CST_HIGH (t
) != 0)
6857 else if (TREE_INT_CST_LOW (t
) == u
)
6859 else if (TREE_INT_CST_LOW (t
) < u
)
6865 /* Return true if SIZE represents a constant size that is in bounds of
6866 what the middle-end and the backend accepts (covering not more than
6867 half of the address-space). */
6870 valid_constant_size_p (const_tree size
)
6872 if (! host_integerp (size
, 1)
6873 || TREE_OVERFLOW (size
)
6874 || tree_int_cst_sign_bit (size
) != 0)
6879 /* Return true if CODE represents an associative tree code. Otherwise
6882 associative_tree_code (enum tree_code code
)
6901 /* Return true if CODE represents a commutative tree code. Otherwise
6904 commutative_tree_code (enum tree_code code
)
6910 case MULT_HIGHPART_EXPR
:
6918 case UNORDERED_EXPR
:
6922 case TRUTH_AND_EXPR
:
6923 case TRUTH_XOR_EXPR
:
6925 case WIDEN_MULT_EXPR
:
6926 case VEC_WIDEN_MULT_HI_EXPR
:
6927 case VEC_WIDEN_MULT_LO_EXPR
:
6936 /* Return true if CODE represents a ternary tree code for which the
6937 first two operands are commutative. Otherwise return false. */
6939 commutative_ternary_tree_code (enum tree_code code
)
6943 case WIDEN_MULT_PLUS_EXPR
:
6944 case WIDEN_MULT_MINUS_EXPR
:
6953 /* Generate a hash value for an expression. This can be used iteratively
6954 by passing a previous result as the VAL argument.
6956 This function is intended to produce the same hash for expressions which
6957 would compare equal using operand_equal_p. */
6960 iterative_hash_expr (const_tree t
, hashval_t val
)
6963 enum tree_code code
;
6967 return iterative_hash_hashval_t (0, val
);
6969 code
= TREE_CODE (t
);
6973 /* Alas, constants aren't shared, so we can't rely on pointer
6976 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6977 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6980 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6982 return iterative_hash_hashval_t (val2
, val
);
6986 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6988 return iterative_hash_hashval_t (val2
, val
);
6991 return iterative_hash (TREE_STRING_POINTER (t
),
6992 TREE_STRING_LENGTH (t
), val
);
6994 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6995 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6999 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7000 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7004 /* We can just compare by pointer. */
7005 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7006 case PLACEHOLDER_EXPR
:
7007 /* The node itself doesn't matter. */
7010 /* A list of expressions, for a CALL_EXPR or as the elements of a
7012 for (; t
; t
= TREE_CHAIN (t
))
7013 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7017 unsigned HOST_WIDE_INT idx
;
7019 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7021 val
= iterative_hash_expr (field
, val
);
7022 val
= iterative_hash_expr (value
, val
);
7028 /* The type of the second operand is relevant, except for
7029 its top-level qualifiers. */
7030 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7032 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7034 /* We could use the standard hash computation from this point
7036 val
= iterative_hash_object (code
, val
);
7037 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7038 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7042 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7043 Otherwise nodes that compare equal according to operand_equal_p might
7044 get different hash codes. However, don't do this for machine specific
7045 or front end builtins, since the function code is overloaded in those
7047 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7048 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7050 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7051 code
= TREE_CODE (t
);
7055 tclass
= TREE_CODE_CLASS (code
);
7057 if (tclass
== tcc_declaration
)
7059 /* DECL's have a unique ID */
7060 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7064 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7066 val
= iterative_hash_object (code
, val
);
7068 /* Don't hash the type, that can lead to having nodes which
7069 compare equal according to operand_equal_p, but which
7070 have different hash codes. */
7071 if (CONVERT_EXPR_CODE_P (code
)
7072 || code
== NON_LVALUE_EXPR
)
7074 /* Make sure to include signness in the hash computation. */
7075 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7076 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7079 else if (commutative_tree_code (code
))
7081 /* It's a commutative expression. We want to hash it the same
7082 however it appears. We do this by first hashing both operands
7083 and then rehashing based on the order of their independent
7085 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7086 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7090 t
= one
, one
= two
, two
= t
;
7092 val
= iterative_hash_hashval_t (one
, val
);
7093 val
= iterative_hash_hashval_t (two
, val
);
7096 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7097 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7103 /* Generate a hash value for a pair of expressions. This can be used
7104 iteratively by passing a previous result as the VAL argument.
7106 The same hash value is always returned for a given pair of expressions,
7107 regardless of the order in which they are presented. This is useful in
7108 hashing the operands of commutative functions. */
7111 iterative_hash_exprs_commutative (const_tree t1
,
7112 const_tree t2
, hashval_t val
)
7114 hashval_t one
= iterative_hash_expr (t1
, 0);
7115 hashval_t two
= iterative_hash_expr (t2
, 0);
7119 t
= one
, one
= two
, two
= t
;
7120 val
= iterative_hash_hashval_t (one
, val
);
7121 val
= iterative_hash_hashval_t (two
, val
);
7126 /* Constructors for pointer, array and function types.
7127 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7128 constructed by language-dependent code, not here.) */
7130 /* Construct, lay out and return the type of pointers to TO_TYPE with
7131 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7132 reference all of memory. If such a type has already been
7133 constructed, reuse it. */
7136 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7141 if (to_type
== error_mark_node
)
7142 return error_mark_node
;
7144 /* If the pointed-to type has the may_alias attribute set, force
7145 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7146 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7147 can_alias_all
= true;
7149 /* In some cases, languages will have things that aren't a POINTER_TYPE
7150 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7151 In that case, return that type without regard to the rest of our
7154 ??? This is a kludge, but consistent with the way this function has
7155 always operated and there doesn't seem to be a good way to avoid this
7157 if (TYPE_POINTER_TO (to_type
) != 0
7158 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7159 return TYPE_POINTER_TO (to_type
);
7161 /* First, if we already have a type for pointers to TO_TYPE and it's
7162 the proper mode, use it. */
7163 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7164 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7167 t
= make_node (POINTER_TYPE
);
7169 TREE_TYPE (t
) = to_type
;
7170 SET_TYPE_MODE (t
, mode
);
7171 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7172 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7173 TYPE_POINTER_TO (to_type
) = t
;
7175 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7176 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7177 else if (TYPE_CANONICAL (to_type
) != to_type
)
7179 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7180 mode
, can_alias_all
);
7182 /* Lay out the type. This function has many callers that are concerned
7183 with expression-construction, and this simplifies them all. */
7189 /* By default build pointers in ptr_mode. */
7192 build_pointer_type (tree to_type
)
7194 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7195 : TYPE_ADDR_SPACE (to_type
);
7196 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7197 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7200 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7203 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7208 if (to_type
== error_mark_node
)
7209 return error_mark_node
;
7211 /* If the pointed-to type has the may_alias attribute set, force
7212 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7213 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7214 can_alias_all
= true;
7216 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7217 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7218 In that case, return that type without regard to the rest of our
7221 ??? This is a kludge, but consistent with the way this function has
7222 always operated and there doesn't seem to be a good way to avoid this
7224 if (TYPE_REFERENCE_TO (to_type
) != 0
7225 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7226 return TYPE_REFERENCE_TO (to_type
);
7228 /* First, if we already have a type for pointers to TO_TYPE and it's
7229 the proper mode, use it. */
7230 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7231 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7234 t
= make_node (REFERENCE_TYPE
);
7236 TREE_TYPE (t
) = to_type
;
7237 SET_TYPE_MODE (t
, mode
);
7238 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7239 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7240 TYPE_REFERENCE_TO (to_type
) = t
;
7242 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7243 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7244 else if (TYPE_CANONICAL (to_type
) != to_type
)
7246 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7247 mode
, can_alias_all
);
7255 /* Build the node for the type of references-to-TO_TYPE by default
7259 build_reference_type (tree to_type
)
7261 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7262 : TYPE_ADDR_SPACE (to_type
);
7263 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7264 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7267 /* Build a type that is compatible with t but has no cv quals anywhere
7270 const char *const *const * -> char ***. */
7273 build_type_no_quals (tree t
)
7275 switch (TREE_CODE (t
))
7278 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7280 TYPE_REF_CAN_ALIAS_ALL (t
));
7281 case REFERENCE_TYPE
:
7283 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7285 TYPE_REF_CAN_ALIAS_ALL (t
));
7287 return TYPE_MAIN_VARIANT (t
);
7291 #define MAX_INT_CACHED_PREC \
7292 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7293 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7295 /* Builds a signed or unsigned integer type of precision PRECISION.
7296 Used for C bitfields whose precision does not match that of
7297 built-in target types. */
7299 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7305 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7307 if (precision
<= MAX_INT_CACHED_PREC
)
7309 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7314 itype
= make_node (INTEGER_TYPE
);
7315 TYPE_PRECISION (itype
) = precision
;
7318 fixup_unsigned_type (itype
);
7320 fixup_signed_type (itype
);
7323 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7324 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7325 if (precision
<= MAX_INT_CACHED_PREC
)
7326 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7331 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7332 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7333 is true, reuse such a type that has already been constructed. */
7336 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7338 tree itype
= make_node (INTEGER_TYPE
);
7339 hashval_t hashcode
= 0;
7341 TREE_TYPE (itype
) = type
;
7343 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7344 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7346 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7347 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7348 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7349 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7350 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7351 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7356 if ((TYPE_MIN_VALUE (itype
)
7357 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7358 || (TYPE_MAX_VALUE (itype
)
7359 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7361 /* Since we cannot reliably merge this type, we need to compare it using
7362 structural equality checks. */
7363 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7367 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7368 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7369 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7370 itype
= type_hash_canon (hashcode
, itype
);
7375 /* Wrapper around build_range_type_1 with SHARED set to true. */
7378 build_range_type (tree type
, tree lowval
, tree highval
)
7380 return build_range_type_1 (type
, lowval
, highval
, true);
7383 /* Wrapper around build_range_type_1 with SHARED set to false. */
7386 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7388 return build_range_type_1 (type
, lowval
, highval
, false);
7391 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7392 MAXVAL should be the maximum value in the domain
7393 (one less than the length of the array).
7395 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7396 We don't enforce this limit, that is up to caller (e.g. language front end).
7397 The limit exists because the result is a signed type and we don't handle
7398 sizes that use more than one HOST_WIDE_INT. */
7401 build_index_type (tree maxval
)
7403 return build_range_type (sizetype
, size_zero_node
, maxval
);
7406 /* Return true if the debug information for TYPE, a subtype, should be emitted
7407 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7408 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7409 debug info and doesn't reflect the source code. */
7412 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7414 tree base_type
= TREE_TYPE (type
), low
, high
;
7416 /* Subrange types have a base type which is an integral type. */
7417 if (!INTEGRAL_TYPE_P (base_type
))
7420 /* Get the real bounds of the subtype. */
7421 if (lang_hooks
.types
.get_subrange_bounds
)
7422 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7425 low
= TYPE_MIN_VALUE (type
);
7426 high
= TYPE_MAX_VALUE (type
);
7429 /* If the type and its base type have the same representation and the same
7430 name, then the type is not a subrange but a copy of the base type. */
7431 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7432 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7433 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7434 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7435 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7437 tree type_name
= TYPE_NAME (type
);
7438 tree base_type_name
= TYPE_NAME (base_type
);
7440 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7441 type_name
= DECL_NAME (type_name
);
7443 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7444 base_type_name
= DECL_NAME (base_type_name
);
7446 if (type_name
== base_type_name
)
7457 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7458 and number of elements specified by the range of values of INDEX_TYPE.
7459 If SHARED is true, reuse such a type that has already been constructed. */
7462 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7466 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7468 error ("arrays of functions are not meaningful");
7469 elt_type
= integer_type_node
;
7472 t
= make_node (ARRAY_TYPE
);
7473 TREE_TYPE (t
) = elt_type
;
7474 TYPE_DOMAIN (t
) = index_type
;
7475 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7478 /* If the element type is incomplete at this point we get marked for
7479 structural equality. Do not record these types in the canonical
7481 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7486 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7488 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7489 t
= type_hash_canon (hashcode
, t
);
7492 if (TYPE_CANONICAL (t
) == t
)
7494 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7495 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7496 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7497 else if (TYPE_CANONICAL (elt_type
) != elt_type
7498 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7500 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7502 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7509 /* Wrapper around build_array_type_1 with SHARED set to true. */
7512 build_array_type (tree elt_type
, tree index_type
)
7514 return build_array_type_1 (elt_type
, index_type
, true);
7517 /* Wrapper around build_array_type_1 with SHARED set to false. */
7520 build_nonshared_array_type (tree elt_type
, tree index_type
)
7522 return build_array_type_1 (elt_type
, index_type
, false);
7525 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7529 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7531 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7534 /* Recursively examines the array elements of TYPE, until a non-array
7535 element type is found. */
7538 strip_array_types (tree type
)
7540 while (TREE_CODE (type
) == ARRAY_TYPE
)
7541 type
= TREE_TYPE (type
);
7546 /* Computes the canonical argument types from the argument type list
7549 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7550 on entry to this function, or if any of the ARGTYPES are
7553 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7554 true on entry to this function, or if any of the ARGTYPES are
7557 Returns a canonical argument list, which may be ARGTYPES when the
7558 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7559 true) or would not differ from ARGTYPES. */
7562 maybe_canonicalize_argtypes(tree argtypes
,
7563 bool *any_structural_p
,
7564 bool *any_noncanonical_p
)
7567 bool any_noncanonical_argtypes_p
= false;
7569 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7571 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7572 /* Fail gracefully by stating that the type is structural. */
7573 *any_structural_p
= true;
7574 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7575 *any_structural_p
= true;
7576 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7577 || TREE_PURPOSE (arg
))
7578 /* If the argument has a default argument, we consider it
7579 non-canonical even though the type itself is canonical.
7580 That way, different variants of function and method types
7581 with default arguments will all point to the variant with
7582 no defaults as their canonical type. */
7583 any_noncanonical_argtypes_p
= true;
7586 if (*any_structural_p
)
7589 if (any_noncanonical_argtypes_p
)
7591 /* Build the canonical list of argument types. */
7592 tree canon_argtypes
= NULL_TREE
;
7593 bool is_void
= false;
7595 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7597 if (arg
== void_list_node
)
7600 canon_argtypes
= tree_cons (NULL_TREE
,
7601 TYPE_CANONICAL (TREE_VALUE (arg
)),
7605 canon_argtypes
= nreverse (canon_argtypes
);
7607 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7609 /* There is a non-canonical type. */
7610 *any_noncanonical_p
= true;
7611 return canon_argtypes
;
7614 /* The canonical argument types are the same as ARGTYPES. */
7618 /* Construct, lay out and return
7619 the type of functions returning type VALUE_TYPE
7620 given arguments of types ARG_TYPES.
7621 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7622 are data type nodes for the arguments of the function.
7623 If such a type has already been constructed, reuse it. */
7626 build_function_type (tree value_type
, tree arg_types
)
7629 hashval_t hashcode
= 0;
7630 bool any_structural_p
, any_noncanonical_p
;
7631 tree canon_argtypes
;
7633 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7635 error ("function return type cannot be function");
7636 value_type
= integer_type_node
;
7639 /* Make a node of the sort we want. */
7640 t
= make_node (FUNCTION_TYPE
);
7641 TREE_TYPE (t
) = value_type
;
7642 TYPE_ARG_TYPES (t
) = arg_types
;
7644 /* If we already have such a type, use the old one. */
7645 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7646 hashcode
= type_hash_list (arg_types
, hashcode
);
7647 t
= type_hash_canon (hashcode
, t
);
7649 /* Set up the canonical type. */
7650 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7651 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7652 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7654 &any_noncanonical_p
);
7655 if (any_structural_p
)
7656 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7657 else if (any_noncanonical_p
)
7658 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7661 if (!COMPLETE_TYPE_P (t
))
7666 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7667 return value if SKIP_RETURN is true. */
7670 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7673 tree new_type
= NULL
;
7674 tree args
, new_args
= NULL
, t
;
7678 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7679 args
= TREE_CHAIN (args
), i
++)
7680 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7681 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7683 new_reversed
= nreverse (new_args
);
7687 TREE_CHAIN (new_args
) = void_list_node
;
7689 new_reversed
= void_list_node
;
7692 /* Use copy_node to preserve as much as possible from original type
7693 (debug info, attribute lists etc.)
7694 Exception is METHOD_TYPEs must have THIS argument.
7695 When we are asked to remove it, we need to build new FUNCTION_TYPE
7697 if (TREE_CODE (orig_type
) != METHOD_TYPE
7699 || !bitmap_bit_p (args_to_skip
, 0))
7701 new_type
= build_distinct_type_copy (orig_type
);
7702 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7707 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7709 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7713 TREE_TYPE (new_type
) = void_type_node
;
7715 /* This is a new type, not a copy of an old type. Need to reassociate
7716 variants. We can handle everything except the main variant lazily. */
7717 t
= TYPE_MAIN_VARIANT (orig_type
);
7720 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7721 TYPE_MAIN_VARIANT (new_type
) = t
;
7722 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7723 TYPE_NEXT_VARIANT (t
) = new_type
;
7727 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7728 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7734 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7735 return value if SKIP_RETURN is true.
7737 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7738 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7739 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7742 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7745 tree new_decl
= copy_node (orig_decl
);
7748 new_type
= TREE_TYPE (orig_decl
);
7749 if (prototype_p (new_type
)
7750 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7752 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7753 TREE_TYPE (new_decl
) = new_type
;
7755 /* For declarations setting DECL_VINDEX (i.e. methods)
7756 we expect first argument to be THIS pointer. */
7757 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
7758 DECL_VINDEX (new_decl
) = NULL_TREE
;
7760 /* When signature changes, we need to clear builtin info. */
7761 if (DECL_BUILT_IN (new_decl
)
7763 && !bitmap_empty_p (args_to_skip
))
7765 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7766 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7771 /* Build a function type. The RETURN_TYPE is the type returned by the
7772 function. If VAARGS is set, no void_type_node is appended to the
7773 the list. ARGP must be always be terminated be a NULL_TREE. */
7776 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7780 t
= va_arg (argp
, tree
);
7781 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7782 args
= tree_cons (NULL_TREE
, t
, args
);
7787 if (args
!= NULL_TREE
)
7788 args
= nreverse (args
);
7789 gcc_assert (last
!= void_list_node
);
7791 else if (args
== NULL_TREE
)
7792 args
= void_list_node
;
7796 args
= nreverse (args
);
7797 TREE_CHAIN (last
) = void_list_node
;
7799 args
= build_function_type (return_type
, args
);
7804 /* Build a function type. The RETURN_TYPE is the type returned by the
7805 function. If additional arguments are provided, they are
7806 additional argument types. The list of argument types must always
7807 be terminated by NULL_TREE. */
7810 build_function_type_list (tree return_type
, ...)
7815 va_start (p
, return_type
);
7816 args
= build_function_type_list_1 (false, return_type
, p
);
7821 /* Build a variable argument function type. The RETURN_TYPE is the
7822 type returned by the function. If additional arguments are provided,
7823 they are additional argument types. The list of argument types must
7824 always be terminated by NULL_TREE. */
7827 build_varargs_function_type_list (tree return_type
, ...)
7832 va_start (p
, return_type
);
7833 args
= build_function_type_list_1 (true, return_type
, p
);
7839 /* Build a function type. RETURN_TYPE is the type returned by the
7840 function; VAARGS indicates whether the function takes varargs. The
7841 function takes N named arguments, the types of which are provided in
7845 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7849 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7851 for (i
= n
- 1; i
>= 0; i
--)
7852 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7854 return build_function_type (return_type
, t
);
7857 /* Build a function type. RETURN_TYPE is the type returned by the
7858 function. The function takes N named arguments, the types of which
7859 are provided in ARG_TYPES. */
7862 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7864 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7867 /* Build a variable argument function type. RETURN_TYPE is the type
7868 returned by the function. The function takes N named arguments, the
7869 types of which are provided in ARG_TYPES. */
7872 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7874 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7877 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7878 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7879 for the method. An implicit additional parameter (of type
7880 pointer-to-BASETYPE) is added to the ARGTYPES. */
7883 build_method_type_directly (tree basetype
,
7890 bool any_structural_p
, any_noncanonical_p
;
7891 tree canon_argtypes
;
7893 /* Make a node of the sort we want. */
7894 t
= make_node (METHOD_TYPE
);
7896 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7897 TREE_TYPE (t
) = rettype
;
7898 ptype
= build_pointer_type (basetype
);
7900 /* The actual arglist for this function includes a "hidden" argument
7901 which is "this". Put it into the list of argument types. */
7902 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7903 TYPE_ARG_TYPES (t
) = argtypes
;
7905 /* If we already have such a type, use the old one. */
7906 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7907 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7908 hashcode
= type_hash_list (argtypes
, hashcode
);
7909 t
= type_hash_canon (hashcode
, t
);
7911 /* Set up the canonical type. */
7913 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7914 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7916 = (TYPE_CANONICAL (basetype
) != basetype
7917 || TYPE_CANONICAL (rettype
) != rettype
);
7918 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7920 &any_noncanonical_p
);
7921 if (any_structural_p
)
7922 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7923 else if (any_noncanonical_p
)
7925 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7926 TYPE_CANONICAL (rettype
),
7928 if (!COMPLETE_TYPE_P (t
))
7934 /* Construct, lay out and return the type of methods belonging to class
7935 BASETYPE and whose arguments and values are described by TYPE.
7936 If that type exists already, reuse it.
7937 TYPE must be a FUNCTION_TYPE node. */
7940 build_method_type (tree basetype
, tree type
)
7942 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7944 return build_method_type_directly (basetype
,
7946 TYPE_ARG_TYPES (type
));
7949 /* Construct, lay out and return the type of offsets to a value
7950 of type TYPE, within an object of type BASETYPE.
7951 If a suitable offset type exists already, reuse it. */
7954 build_offset_type (tree basetype
, tree type
)
7957 hashval_t hashcode
= 0;
7959 /* Make a node of the sort we want. */
7960 t
= make_node (OFFSET_TYPE
);
7962 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7963 TREE_TYPE (t
) = type
;
7965 /* If we already have such a type, use the old one. */
7966 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7967 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7968 t
= type_hash_canon (hashcode
, t
);
7970 if (!COMPLETE_TYPE_P (t
))
7973 if (TYPE_CANONICAL (t
) == t
)
7975 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7976 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7977 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7978 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7979 || TYPE_CANONICAL (type
) != type
)
7981 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7982 TYPE_CANONICAL (type
));
7988 /* Create a complex type whose components are COMPONENT_TYPE. */
7991 build_complex_type (tree component_type
)
7996 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7997 || SCALAR_FLOAT_TYPE_P (component_type
)
7998 || FIXED_POINT_TYPE_P (component_type
));
8000 /* Make a node of the sort we want. */
8001 t
= make_node (COMPLEX_TYPE
);
8003 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8005 /* If we already have such a type, use the old one. */
8006 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8007 t
= type_hash_canon (hashcode
, t
);
8009 if (!COMPLETE_TYPE_P (t
))
8012 if (TYPE_CANONICAL (t
) == t
)
8014 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8015 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8016 else if (TYPE_CANONICAL (component_type
) != component_type
)
8018 = build_complex_type (TYPE_CANONICAL (component_type
));
8021 /* We need to create a name, since complex is a fundamental type. */
8022 if (! TYPE_NAME (t
))
8025 if (component_type
== char_type_node
)
8026 name
= "complex char";
8027 else if (component_type
== signed_char_type_node
)
8028 name
= "complex signed char";
8029 else if (component_type
== unsigned_char_type_node
)
8030 name
= "complex unsigned char";
8031 else if (component_type
== short_integer_type_node
)
8032 name
= "complex short int";
8033 else if (component_type
== short_unsigned_type_node
)
8034 name
= "complex short unsigned int";
8035 else if (component_type
== integer_type_node
)
8036 name
= "complex int";
8037 else if (component_type
== unsigned_type_node
)
8038 name
= "complex unsigned int";
8039 else if (component_type
== long_integer_type_node
)
8040 name
= "complex long int";
8041 else if (component_type
== long_unsigned_type_node
)
8042 name
= "complex long unsigned int";
8043 else if (component_type
== long_long_integer_type_node
)
8044 name
= "complex long long int";
8045 else if (component_type
== long_long_unsigned_type_node
)
8046 name
= "complex long long unsigned int";
8051 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8052 get_identifier (name
), t
);
8055 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8058 /* If TYPE is a real or complex floating-point type and the target
8059 does not directly support arithmetic on TYPE then return the wider
8060 type to be used for arithmetic on TYPE. Otherwise, return
8064 excess_precision_type (tree type
)
8066 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8068 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8069 switch (TREE_CODE (type
))
8072 switch (flt_eval_method
)
8075 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8076 return double_type_node
;
8079 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8080 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8081 return long_double_type_node
;
8088 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8090 switch (flt_eval_method
)
8093 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8094 return complex_double_type_node
;
8097 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8098 || (TYPE_MODE (TREE_TYPE (type
))
8099 == TYPE_MODE (double_type_node
)))
8100 return complex_long_double_type_node
;
8113 /* Return OP, stripped of any conversions to wider types as much as is safe.
8114 Converting the value back to OP's type makes a value equivalent to OP.
8116 If FOR_TYPE is nonzero, we return a value which, if converted to
8117 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8119 OP must have integer, real or enumeral type. Pointers are not allowed!
8121 There are some cases where the obvious value we could return
8122 would regenerate to OP if converted to OP's type,
8123 but would not extend like OP to wider types.
8124 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8125 For example, if OP is (unsigned short)(signed char)-1,
8126 we avoid returning (signed char)-1 if FOR_TYPE is int,
8127 even though extending that to an unsigned short would regenerate OP,
8128 since the result of extending (signed char)-1 to (int)
8129 is different from (int) OP. */
8132 get_unwidened (tree op
, tree for_type
)
8134 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8135 tree type
= TREE_TYPE (op
);
8137 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8139 = (for_type
!= 0 && for_type
!= type
8140 && final_prec
> TYPE_PRECISION (type
)
8141 && TYPE_UNSIGNED (type
));
8144 while (CONVERT_EXPR_P (op
))
8148 /* TYPE_PRECISION on vector types has different meaning
8149 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8150 so avoid them here. */
8151 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8154 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8155 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8157 /* Truncations are many-one so cannot be removed.
8158 Unless we are later going to truncate down even farther. */
8160 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8163 /* See what's inside this conversion. If we decide to strip it,
8165 op
= TREE_OPERAND (op
, 0);
8167 /* If we have not stripped any zero-extensions (uns is 0),
8168 we can strip any kind of extension.
8169 If we have previously stripped a zero-extension,
8170 only zero-extensions can safely be stripped.
8171 Any extension can be stripped if the bits it would produce
8172 are all going to be discarded later by truncating to FOR_TYPE. */
8176 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8178 /* TYPE_UNSIGNED says whether this is a zero-extension.
8179 Let's avoid computing it if it does not affect WIN
8180 and if UNS will not be needed again. */
8182 || CONVERT_EXPR_P (op
))
8183 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8191 /* If we finally reach a constant see if it fits in for_type and
8192 in that case convert it. */
8194 && TREE_CODE (win
) == INTEGER_CST
8195 && TREE_TYPE (win
) != for_type
8196 && int_fits_type_p (win
, for_type
))
8197 win
= fold_convert (for_type
, win
);
8202 /* Return OP or a simpler expression for a narrower value
8203 which can be sign-extended or zero-extended to give back OP.
8204 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8205 or 0 if the value should be sign-extended. */
8208 get_narrower (tree op
, int *unsignedp_ptr
)
8213 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8215 while (TREE_CODE (op
) == NOP_EXPR
)
8218 = (TYPE_PRECISION (TREE_TYPE (op
))
8219 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8221 /* Truncations are many-one so cannot be removed. */
8225 /* See what's inside this conversion. If we decide to strip it,
8230 op
= TREE_OPERAND (op
, 0);
8231 /* An extension: the outermost one can be stripped,
8232 but remember whether it is zero or sign extension. */
8234 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8235 /* Otherwise, if a sign extension has been stripped,
8236 only sign extensions can now be stripped;
8237 if a zero extension has been stripped, only zero-extensions. */
8238 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8242 else /* bitschange == 0 */
8244 /* A change in nominal type can always be stripped, but we must
8245 preserve the unsignedness. */
8247 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8249 op
= TREE_OPERAND (op
, 0);
8250 /* Keep trying to narrow, but don't assign op to win if it
8251 would turn an integral type into something else. */
8252 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8259 if (TREE_CODE (op
) == COMPONENT_REF
8260 /* Since type_for_size always gives an integer type. */
8261 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8262 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8263 /* Ensure field is laid out already. */
8264 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8265 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8267 unsigned HOST_WIDE_INT innerprec
8268 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8269 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8270 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8271 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8273 /* We can get this structure field in a narrower type that fits it,
8274 but the resulting extension to its nominal type (a fullword type)
8275 must satisfy the same conditions as for other extensions.
8277 Do this only for fields that are aligned (not bit-fields),
8278 because when bit-field insns will be used there is no
8279 advantage in doing this. */
8281 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8282 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8283 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8287 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8288 win
= fold_convert (type
, op
);
8292 *unsignedp_ptr
= uns
;
8296 /* Returns true if integer constant C has a value that is permissible
8297 for type TYPE (an INTEGER_TYPE). */
8300 int_fits_type_p (const_tree c
, const_tree type
)
8302 tree type_low_bound
, type_high_bound
;
8303 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8306 dc
= tree_to_double_int (c
);
8307 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8310 type_low_bound
= TYPE_MIN_VALUE (type
);
8311 type_high_bound
= TYPE_MAX_VALUE (type
);
8313 /* If at least one bound of the type is a constant integer, we can check
8314 ourselves and maybe make a decision. If no such decision is possible, but
8315 this type is a subtype, try checking against that. Otherwise, use
8316 double_int_fits_to_tree_p, which checks against the precision.
8318 Compute the status for each possibly constant bound, and return if we see
8319 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8320 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8321 for "constant known to fit". */
8323 /* Check if c >= type_low_bound. */
8324 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8326 dd
= tree_to_double_int (type_low_bound
);
8327 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8329 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8330 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8332 if (c_neg
&& !t_neg
)
8334 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8337 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8339 ok_for_low_bound
= true;
8342 ok_for_low_bound
= false;
8344 /* Check if c <= type_high_bound. */
8345 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8347 dd
= tree_to_double_int (type_high_bound
);
8348 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8350 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8351 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8353 if (t_neg
&& !c_neg
)
8355 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8358 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8360 ok_for_high_bound
= true;
8363 ok_for_high_bound
= false;
8365 /* If the constant fits both bounds, the result is known. */
8366 if (ok_for_low_bound
&& ok_for_high_bound
)
8369 /* Perform some generic filtering which may allow making a decision
8370 even if the bounds are not constant. First, negative integers
8371 never fit in unsigned types, */
8372 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8375 /* Second, narrower types always fit in wider ones. */
8376 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8379 /* Third, unsigned integers with top bit set never fit signed types. */
8380 if (! TYPE_UNSIGNED (type
) && unsc
)
8382 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8383 if (prec
< HOST_BITS_PER_WIDE_INT
)
8385 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8388 else if (((((unsigned HOST_WIDE_INT
) 1)
8389 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8393 /* If we haven't been able to decide at this point, there nothing more we
8394 can check ourselves here. Look at the base type if we have one and it
8395 has the same precision. */
8396 if (TREE_CODE (type
) == INTEGER_TYPE
8397 && TREE_TYPE (type
) != 0
8398 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8400 type
= TREE_TYPE (type
);
8404 /* Or to double_int_fits_to_tree_p, if nothing else. */
8405 return double_int_fits_to_tree_p (type
, dc
);
8408 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8409 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8410 represented (assuming two's-complement arithmetic) within the bit
8411 precision of the type are returned instead. */
8414 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8416 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8417 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8418 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8419 TYPE_UNSIGNED (type
));
8422 if (TYPE_UNSIGNED (type
))
8423 mpz_set_ui (min
, 0);
8427 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8428 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8429 TYPE_PRECISION (type
));
8430 mpz_set_double_int (min
, mn
, false);
8434 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8435 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8436 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8437 TYPE_UNSIGNED (type
));
8440 if (TYPE_UNSIGNED (type
))
8441 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8444 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8449 /* Return true if VAR is an automatic variable defined in function FN. */
8452 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8454 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8455 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8456 || TREE_CODE (var
) == PARM_DECL
)
8457 && ! TREE_STATIC (var
))
8458 || TREE_CODE (var
) == LABEL_DECL
8459 || TREE_CODE (var
) == RESULT_DECL
));
8462 /* Subprogram of following function. Called by walk_tree.
8464 Return *TP if it is an automatic variable or parameter of the
8465 function passed in as DATA. */
8468 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8470 tree fn
= (tree
) data
;
8475 else if (DECL_P (*tp
)
8476 && auto_var_in_fn_p (*tp
, fn
))
8482 /* Returns true if T is, contains, or refers to a type with variable
8483 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8484 arguments, but not the return type. If FN is nonzero, only return
8485 true if a modifier of the type or position of FN is a variable or
8486 parameter inside FN.
8488 This concept is more general than that of C99 'variably modified types':
8489 in C99, a struct type is never variably modified because a VLA may not
8490 appear as a structure member. However, in GNU C code like:
8492 struct S { int i[f()]; };
8494 is valid, and other languages may define similar constructs. */
8497 variably_modified_type_p (tree type
, tree fn
)
8501 /* Test if T is either variable (if FN is zero) or an expression containing
8502 a variable in FN. */
8503 #define RETURN_TRUE_IF_VAR(T) \
8504 do { tree _t = (T); \
8505 if (_t != NULL_TREE \
8506 && _t != error_mark_node \
8507 && TREE_CODE (_t) != INTEGER_CST \
8508 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8509 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8510 return true; } while (0)
8512 if (type
== error_mark_node
)
8515 /* If TYPE itself has variable size, it is variably modified. */
8516 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8517 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8519 switch (TREE_CODE (type
))
8522 case REFERENCE_TYPE
:
8524 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8530 /* If TYPE is a function type, it is variably modified if the
8531 return type is variably modified. */
8532 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8538 case FIXED_POINT_TYPE
:
8541 /* Scalar types are variably modified if their end points
8543 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8544 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8549 case QUAL_UNION_TYPE
:
8550 /* We can't see if any of the fields are variably-modified by the
8551 definition we normally use, since that would produce infinite
8552 recursion via pointers. */
8553 /* This is variably modified if some field's type is. */
8554 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8555 if (TREE_CODE (t
) == FIELD_DECL
)
8557 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8558 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8559 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8561 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8562 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8567 /* Do not call ourselves to avoid infinite recursion. This is
8568 variably modified if the element type is. */
8569 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8570 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8577 /* The current language may have other cases to check, but in general,
8578 all other types are not variably modified. */
8579 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8581 #undef RETURN_TRUE_IF_VAR
8584 /* Given a DECL or TYPE, return the scope in which it was declared, or
8585 NULL_TREE if there is no containing scope. */
8588 get_containing_scope (const_tree t
)
8590 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8593 /* Return the innermost context enclosing DECL that is
8594 a FUNCTION_DECL, or zero if none. */
8597 decl_function_context (const_tree decl
)
8601 if (TREE_CODE (decl
) == ERROR_MARK
)
8604 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8605 where we look up the function at runtime. Such functions always take
8606 a first argument of type 'pointer to real context'.
8608 C++ should really be fixed to use DECL_CONTEXT for the real context,
8609 and use something else for the "virtual context". */
8610 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8613 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8615 context
= DECL_CONTEXT (decl
);
8617 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8619 if (TREE_CODE (context
) == BLOCK
)
8620 context
= BLOCK_SUPERCONTEXT (context
);
8622 context
= get_containing_scope (context
);
8628 /* Return the innermost context enclosing DECL that is
8629 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8630 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8633 decl_type_context (const_tree decl
)
8635 tree context
= DECL_CONTEXT (decl
);
8638 switch (TREE_CODE (context
))
8640 case NAMESPACE_DECL
:
8641 case TRANSLATION_UNIT_DECL
:
8646 case QUAL_UNION_TYPE
:
8651 context
= DECL_CONTEXT (context
);
8655 context
= BLOCK_SUPERCONTEXT (context
);
8665 /* CALL is a CALL_EXPR. Return the declaration for the function
8666 called, or NULL_TREE if the called function cannot be
8670 get_callee_fndecl (const_tree call
)
8674 if (call
== error_mark_node
)
8675 return error_mark_node
;
8677 /* It's invalid to call this function with anything but a
8679 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8681 /* The first operand to the CALL is the address of the function
8683 addr
= CALL_EXPR_FN (call
);
8687 /* If this is a readonly function pointer, extract its initial value. */
8688 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8689 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8690 && DECL_INITIAL (addr
))
8691 addr
= DECL_INITIAL (addr
);
8693 /* If the address is just `&f' for some function `f', then we know
8694 that `f' is being called. */
8695 if (TREE_CODE (addr
) == ADDR_EXPR
8696 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8697 return TREE_OPERAND (addr
, 0);
8699 /* We couldn't figure out what was being called. */
8703 /* Print debugging information about tree nodes generated during the compile,
8704 and any language-specific information. */
8707 dump_tree_statistics (void)
8709 #ifdef GATHER_STATISTICS
8711 int total_nodes
, total_bytes
;
8714 fprintf (stderr
, "\n??? tree nodes created\n\n");
8715 #ifdef GATHER_STATISTICS
8716 fprintf (stderr
, "Kind Nodes Bytes\n");
8717 fprintf (stderr
, "---------------------------------------\n");
8718 total_nodes
= total_bytes
= 0;
8719 for (i
= 0; i
< (int) all_kinds
; i
++)
8721 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8722 tree_node_counts
[i
], tree_node_sizes
[i
]);
8723 total_nodes
+= tree_node_counts
[i
];
8724 total_bytes
+= tree_node_sizes
[i
];
8726 fprintf (stderr
, "---------------------------------------\n");
8727 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8728 fprintf (stderr
, "---------------------------------------\n");
8729 fprintf (stderr
, "Code Nodes\n");
8730 fprintf (stderr
, "----------------------------\n");
8731 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8732 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8733 fprintf (stderr
, "----------------------------\n");
8734 ssanames_print_statistics ();
8735 phinodes_print_statistics ();
8737 fprintf (stderr
, "(No per-node statistics)\n");
8739 print_type_hash_statistics ();
8740 print_debug_expr_statistics ();
8741 print_value_expr_statistics ();
8742 lang_hooks
.print_statistics ();
8745 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8747 /* Generate a crc32 of a byte. */
8750 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8754 for (ix
= bits
; ix
--; value
<<= 1)
8758 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8765 /* Generate a crc32 of a 32-bit unsigned. */
8768 crc32_unsigned (unsigned chksum
, unsigned value
)
8770 return crc32_unsigned_bits (chksum
, value
, 32);
8773 /* Generate a crc32 of a byte. */
8776 crc32_byte (unsigned chksum
, char byte
)
8778 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8781 /* Generate a crc32 of a string. */
8784 crc32_string (unsigned chksum
, const char *string
)
8788 chksum
= crc32_byte (chksum
, *string
);
8794 /* P is a string that will be used in a symbol. Mask out any characters
8795 that are not valid in that context. */
8798 clean_symbol_name (char *p
)
8802 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8805 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8812 /* Generate a name for a special-purpose function.
8813 The generated name may need to be unique across the whole link.
8814 Changes to this function may also require corresponding changes to
8815 xstrdup_mask_random.
8816 TYPE is some string to identify the purpose of this function to the
8817 linker or collect2; it must start with an uppercase letter,
8819 I - for constructors
8821 N - for C++ anonymous namespaces
8822 F - for DWARF unwind frame information. */
8825 get_file_function_name (const char *type
)
8831 /* If we already have a name we know to be unique, just use that. */
8832 if (first_global_object_name
)
8833 p
= q
= ASTRDUP (first_global_object_name
);
8834 /* If the target is handling the constructors/destructors, they
8835 will be local to this file and the name is only necessary for
8837 We also assign sub_I and sub_D sufixes to constructors called from
8838 the global static constructors. These are always local. */
8839 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8840 || (strncmp (type
, "sub_", 4) == 0
8841 && (type
[4] == 'I' || type
[4] == 'D')))
8843 const char *file
= main_input_filename
;
8845 file
= input_filename
;
8846 /* Just use the file's basename, because the full pathname
8847 might be quite long. */
8848 p
= q
= ASTRDUP (lbasename (file
));
8852 /* Otherwise, the name must be unique across the entire link.
8853 We don't have anything that we know to be unique to this translation
8854 unit, so use what we do have and throw in some randomness. */
8856 const char *name
= weak_global_object_name
;
8857 const char *file
= main_input_filename
;
8862 file
= input_filename
;
8864 len
= strlen (file
);
8865 q
= (char *) alloca (9 + 17 + len
+ 1);
8866 memcpy (q
, file
, len
+ 1);
8868 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8869 crc32_string (0, name
), get_random_seed (false));
8874 clean_symbol_name (q
);
8875 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8878 /* Set up the name of the file-level functions we may need.
8879 Use a global object (which is already required to be unique over
8880 the program) rather than the file name (which imposes extra
8882 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8884 return get_identifier (buf
);
8887 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8889 /* Complain that the tree code of NODE does not match the expected 0
8890 terminated list of trailing codes. The trailing code list can be
8891 empty, for a more vague error message. FILE, LINE, and FUNCTION
8892 are of the caller. */
8895 tree_check_failed (const_tree node
, const char *file
,
8896 int line
, const char *function
, ...)
8900 unsigned length
= 0;
8903 va_start (args
, function
);
8904 while ((code
= va_arg (args
, int)))
8905 length
+= 4 + strlen (tree_code_name
[code
]);
8910 va_start (args
, function
);
8911 length
+= strlen ("expected ");
8912 buffer
= tmp
= (char *) alloca (length
);
8914 while ((code
= va_arg (args
, int)))
8916 const char *prefix
= length
? " or " : "expected ";
8918 strcpy (tmp
+ length
, prefix
);
8919 length
+= strlen (prefix
);
8920 strcpy (tmp
+ length
, tree_code_name
[code
]);
8921 length
+= strlen (tree_code_name
[code
]);
8926 buffer
= "unexpected node";
8928 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8929 buffer
, tree_code_name
[TREE_CODE (node
)],
8930 function
, trim_filename (file
), line
);
8933 /* Complain that the tree code of NODE does match the expected 0
8934 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8938 tree_not_check_failed (const_tree node
, const char *file
,
8939 int line
, const char *function
, ...)
8943 unsigned length
= 0;
8946 va_start (args
, function
);
8947 while ((code
= va_arg (args
, int)))
8948 length
+= 4 + strlen (tree_code_name
[code
]);
8950 va_start (args
, function
);
8951 buffer
= (char *) alloca (length
);
8953 while ((code
= va_arg (args
, int)))
8957 strcpy (buffer
+ length
, " or ");
8960 strcpy (buffer
+ length
, tree_code_name
[code
]);
8961 length
+= strlen (tree_code_name
[code
]);
8965 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8966 buffer
, tree_code_name
[TREE_CODE (node
)],
8967 function
, trim_filename (file
), line
);
8970 /* Similar to tree_check_failed, except that we check for a class of tree
8971 code, given in CL. */
8974 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8975 const char *file
, int line
, const char *function
)
8978 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8979 TREE_CODE_CLASS_STRING (cl
),
8980 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8981 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8984 /* Similar to tree_check_failed, except that instead of specifying a
8985 dozen codes, use the knowledge that they're all sequential. */
8988 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8989 const char *function
, enum tree_code c1
,
8993 unsigned length
= 0;
8996 for (c
= c1
; c
<= c2
; ++c
)
8997 length
+= 4 + strlen (tree_code_name
[c
]);
8999 length
+= strlen ("expected ");
9000 buffer
= (char *) alloca (length
);
9003 for (c
= c1
; c
<= c2
; ++c
)
9005 const char *prefix
= length
? " or " : "expected ";
9007 strcpy (buffer
+ length
, prefix
);
9008 length
+= strlen (prefix
);
9009 strcpy (buffer
+ length
, tree_code_name
[c
]);
9010 length
+= strlen (tree_code_name
[c
]);
9013 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9014 buffer
, tree_code_name
[TREE_CODE (node
)],
9015 function
, trim_filename (file
), line
);
9019 /* Similar to tree_check_failed, except that we check that a tree does
9020 not have the specified code, given in CL. */
9023 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9024 const char *file
, int line
, const char *function
)
9027 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9028 TREE_CODE_CLASS_STRING (cl
),
9029 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9030 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9034 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9037 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9038 const char *function
, enum omp_clause_code code
)
9040 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9041 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9042 function
, trim_filename (file
), line
);
9046 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9049 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9050 const char *function
, enum omp_clause_code c1
,
9051 enum omp_clause_code c2
)
9054 unsigned length
= 0;
9057 for (c
= c1
; c
<= c2
; ++c
)
9058 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9060 length
+= strlen ("expected ");
9061 buffer
= (char *) alloca (length
);
9064 for (c
= c1
; c
<= c2
; ++c
)
9066 const char *prefix
= length
? " or " : "expected ";
9068 strcpy (buffer
+ length
, prefix
);
9069 length
+= strlen (prefix
);
9070 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9071 length
+= strlen (omp_clause_code_name
[c
]);
9074 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9075 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9076 function
, trim_filename (file
), line
);
9080 #undef DEFTREESTRUCT
9081 #define DEFTREESTRUCT(VAL, NAME) NAME,
9083 static const char *ts_enum_names
[] = {
9084 #include "treestruct.def"
9086 #undef DEFTREESTRUCT
9088 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9090 /* Similar to tree_class_check_failed, except that we check for
9091 whether CODE contains the tree structure identified by EN. */
9094 tree_contains_struct_check_failed (const_tree node
,
9095 const enum tree_node_structure_enum en
,
9096 const char *file
, int line
,
9097 const char *function
)
9100 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9102 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9106 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9107 (dynamically sized) vector. */
9110 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9111 const char *function
)
9114 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9115 idx
+ 1, len
, function
, trim_filename (file
), line
);
9118 /* Similar to above, except that the check is for the bounds of the operand
9119 vector of an expression node EXP. */
9122 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9123 int line
, const char *function
)
9125 int code
= TREE_CODE (exp
);
9127 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9128 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9129 function
, trim_filename (file
), line
);
9132 /* Similar to above, except that the check is for the number of
9133 operands of an OMP_CLAUSE node. */
9136 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9137 int line
, const char *function
)
9140 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9141 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9142 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9143 trim_filename (file
), line
);
9145 #endif /* ENABLE_TREE_CHECKING */
9147 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9148 and mapped to the machine mode MODE. Initialize its fields and build
9149 the information necessary for debugging output. */
9152 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9155 hashval_t hashcode
= 0;
9157 t
= make_node (VECTOR_TYPE
);
9158 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9159 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9160 SET_TYPE_MODE (t
, mode
);
9162 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9163 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9164 else if (TYPE_CANONICAL (innertype
) != innertype
9165 || mode
!= VOIDmode
)
9167 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9171 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9172 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9173 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9174 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9175 t
= type_hash_canon (hashcode
, t
);
9177 /* We have built a main variant, based on the main variant of the
9178 inner type. Use it to build the variant we return. */
9179 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9180 && TREE_TYPE (t
) != innertype
)
9181 return build_type_attribute_qual_variant (t
,
9182 TYPE_ATTRIBUTES (innertype
),
9183 TYPE_QUALS (innertype
));
9189 make_or_reuse_type (unsigned size
, int unsignedp
)
9191 if (size
== INT_TYPE_SIZE
)
9192 return unsignedp
? unsigned_type_node
: integer_type_node
;
9193 if (size
== CHAR_TYPE_SIZE
)
9194 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9195 if (size
== SHORT_TYPE_SIZE
)
9196 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9197 if (size
== LONG_TYPE_SIZE
)
9198 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9199 if (size
== LONG_LONG_TYPE_SIZE
)
9200 return (unsignedp
? long_long_unsigned_type_node
9201 : long_long_integer_type_node
);
9202 if (size
== 128 && int128_integer_type_node
)
9203 return (unsignedp
? int128_unsigned_type_node
9204 : int128_integer_type_node
);
9207 return make_unsigned_type (size
);
9209 return make_signed_type (size
);
9212 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9215 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9219 if (size
== SHORT_FRACT_TYPE_SIZE
)
9220 return unsignedp
? sat_unsigned_short_fract_type_node
9221 : sat_short_fract_type_node
;
9222 if (size
== FRACT_TYPE_SIZE
)
9223 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9224 if (size
== LONG_FRACT_TYPE_SIZE
)
9225 return unsignedp
? sat_unsigned_long_fract_type_node
9226 : sat_long_fract_type_node
;
9227 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9228 return unsignedp
? sat_unsigned_long_long_fract_type_node
9229 : sat_long_long_fract_type_node
;
9233 if (size
== SHORT_FRACT_TYPE_SIZE
)
9234 return unsignedp
? unsigned_short_fract_type_node
9235 : short_fract_type_node
;
9236 if (size
== FRACT_TYPE_SIZE
)
9237 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9238 if (size
== LONG_FRACT_TYPE_SIZE
)
9239 return unsignedp
? unsigned_long_fract_type_node
9240 : long_fract_type_node
;
9241 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9242 return unsignedp
? unsigned_long_long_fract_type_node
9243 : long_long_fract_type_node
;
9246 return make_fract_type (size
, unsignedp
, satp
);
9249 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9252 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9256 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9257 return unsignedp
? sat_unsigned_short_accum_type_node
9258 : sat_short_accum_type_node
;
9259 if (size
== ACCUM_TYPE_SIZE
)
9260 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9261 if (size
== LONG_ACCUM_TYPE_SIZE
)
9262 return unsignedp
? sat_unsigned_long_accum_type_node
9263 : sat_long_accum_type_node
;
9264 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9265 return unsignedp
? sat_unsigned_long_long_accum_type_node
9266 : sat_long_long_accum_type_node
;
9270 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9271 return unsignedp
? unsigned_short_accum_type_node
9272 : short_accum_type_node
;
9273 if (size
== ACCUM_TYPE_SIZE
)
9274 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9275 if (size
== LONG_ACCUM_TYPE_SIZE
)
9276 return unsignedp
? unsigned_long_accum_type_node
9277 : long_accum_type_node
;
9278 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9279 return unsignedp
? unsigned_long_long_accum_type_node
9280 : long_long_accum_type_node
;
9283 return make_accum_type (size
, unsignedp
, satp
);
9286 /* Create nodes for all integer types (and error_mark_node) using the sizes
9287 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9288 SHORT_DOUBLE specifies whether double should be of the same precision
9292 build_common_tree_nodes (bool signed_char
, bool short_double
)
9294 error_mark_node
= make_node (ERROR_MARK
);
9295 TREE_TYPE (error_mark_node
) = error_mark_node
;
9297 initialize_sizetypes ();
9299 /* Define both `signed char' and `unsigned char'. */
9300 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9301 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9302 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9303 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9305 /* Define `char', which is like either `signed char' or `unsigned char'
9306 but not the same as either. */
9309 ? make_signed_type (CHAR_TYPE_SIZE
)
9310 : make_unsigned_type (CHAR_TYPE_SIZE
));
9311 TYPE_STRING_FLAG (char_type_node
) = 1;
9313 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9314 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9315 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9316 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9317 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9318 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9319 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9320 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9321 #if HOST_BITS_PER_WIDE_INT >= 64
9322 /* TODO: This isn't correct, but as logic depends at the moment on
9323 host's instead of target's wide-integer.
9324 If there is a target not supporting TImode, but has an 128-bit
9325 integer-scalar register, this target check needs to be adjusted. */
9326 if (targetm
.scalar_mode_supported_p (TImode
))
9328 int128_integer_type_node
= make_signed_type (128);
9329 int128_unsigned_type_node
= make_unsigned_type (128);
9333 /* Define a boolean type. This type only represents boolean values but
9334 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9335 Front ends which want to override this size (i.e. Java) can redefine
9336 boolean_type_node before calling build_common_tree_nodes_2. */
9337 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9338 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9339 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9340 TYPE_PRECISION (boolean_type_node
) = 1;
9342 /* Define what type to use for size_t. */
9343 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9344 size_type_node
= unsigned_type_node
;
9345 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9346 size_type_node
= long_unsigned_type_node
;
9347 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9348 size_type_node
= long_long_unsigned_type_node
;
9349 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9350 size_type_node
= short_unsigned_type_node
;
9354 /* Fill in the rest of the sized types. Reuse existing type nodes
9356 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9357 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9358 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9359 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9360 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9362 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9363 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9364 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9365 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9366 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9368 access_public_node
= get_identifier ("public");
9369 access_protected_node
= get_identifier ("protected");
9370 access_private_node
= get_identifier ("private");
9372 /* Define these next since types below may used them. */
9373 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9374 integer_one_node
= build_int_cst (integer_type_node
, 1);
9375 integer_three_node
= build_int_cst (integer_type_node
, 3);
9376 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9378 size_zero_node
= size_int (0);
9379 size_one_node
= size_int (1);
9380 bitsize_zero_node
= bitsize_int (0);
9381 bitsize_one_node
= bitsize_int (1);
9382 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9384 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9385 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9387 void_type_node
= make_node (VOID_TYPE
);
9388 layout_type (void_type_node
);
9390 /* We are not going to have real types in C with less than byte alignment,
9391 so we might as well not have any types that claim to have it. */
9392 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9393 TYPE_USER_ALIGN (void_type_node
) = 0;
9395 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9396 layout_type (TREE_TYPE (null_pointer_node
));
9398 ptr_type_node
= build_pointer_type (void_type_node
);
9400 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9401 fileptr_type_node
= ptr_type_node
;
9403 float_type_node
= make_node (REAL_TYPE
);
9404 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9405 layout_type (float_type_node
);
9407 double_type_node
= make_node (REAL_TYPE
);
9409 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9411 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9412 layout_type (double_type_node
);
9414 long_double_type_node
= make_node (REAL_TYPE
);
9415 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9416 layout_type (long_double_type_node
);
9418 float_ptr_type_node
= build_pointer_type (float_type_node
);
9419 double_ptr_type_node
= build_pointer_type (double_type_node
);
9420 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9421 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9423 /* Fixed size integer types. */
9424 uint16_type_node
= build_nonstandard_integer_type (16, true);
9425 uint32_type_node
= build_nonstandard_integer_type (32, true);
9426 uint64_type_node
= build_nonstandard_integer_type (64, true);
9428 /* Decimal float types. */
9429 dfloat32_type_node
= make_node (REAL_TYPE
);
9430 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9431 layout_type (dfloat32_type_node
);
9432 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9433 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9435 dfloat64_type_node
= make_node (REAL_TYPE
);
9436 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9437 layout_type (dfloat64_type_node
);
9438 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9439 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9441 dfloat128_type_node
= make_node (REAL_TYPE
);
9442 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9443 layout_type (dfloat128_type_node
);
9444 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9445 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9447 complex_integer_type_node
= build_complex_type (integer_type_node
);
9448 complex_float_type_node
= build_complex_type (float_type_node
);
9449 complex_double_type_node
= build_complex_type (double_type_node
);
9450 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9452 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9453 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9454 sat_ ## KIND ## _type_node = \
9455 make_sat_signed_ ## KIND ## _type (SIZE); \
9456 sat_unsigned_ ## KIND ## _type_node = \
9457 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9458 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9459 unsigned_ ## KIND ## _type_node = \
9460 make_unsigned_ ## KIND ## _type (SIZE);
9462 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9463 sat_ ## WIDTH ## KIND ## _type_node = \
9464 make_sat_signed_ ## KIND ## _type (SIZE); \
9465 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9466 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9467 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9468 unsigned_ ## WIDTH ## KIND ## _type_node = \
9469 make_unsigned_ ## KIND ## _type (SIZE);
9471 /* Make fixed-point type nodes based on four different widths. */
9472 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9473 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9474 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9475 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9476 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9478 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9479 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9480 NAME ## _type_node = \
9481 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9482 u ## NAME ## _type_node = \
9483 make_or_reuse_unsigned_ ## KIND ## _type \
9484 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9485 sat_ ## NAME ## _type_node = \
9486 make_or_reuse_sat_signed_ ## KIND ## _type \
9487 (GET_MODE_BITSIZE (MODE ## mode)); \
9488 sat_u ## NAME ## _type_node = \
9489 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9490 (GET_MODE_BITSIZE (U ## MODE ## mode));
9492 /* Fixed-point type and mode nodes. */
9493 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9494 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9495 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9496 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9497 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9498 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9499 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9500 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9501 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9502 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9503 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9506 tree t
= targetm
.build_builtin_va_list ();
9508 /* Many back-ends define record types without setting TYPE_NAME.
9509 If we copied the record type here, we'd keep the original
9510 record type without a name. This breaks name mangling. So,
9511 don't copy record types and let c_common_nodes_and_builtins()
9512 declare the type to be __builtin_va_list. */
9513 if (TREE_CODE (t
) != RECORD_TYPE
)
9514 t
= build_variant_type_copy (t
);
9516 va_list_type_node
= t
;
9520 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9523 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9524 const char *library_name
, int ecf_flags
)
9528 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9529 library_name
, NULL_TREE
);
9530 if (ecf_flags
& ECF_CONST
)
9531 TREE_READONLY (decl
) = 1;
9532 if (ecf_flags
& ECF_PURE
)
9533 DECL_PURE_P (decl
) = 1;
9534 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9535 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9536 if (ecf_flags
& ECF_NORETURN
)
9537 TREE_THIS_VOLATILE (decl
) = 1;
9538 if (ecf_flags
& ECF_NOTHROW
)
9539 TREE_NOTHROW (decl
) = 1;
9540 if (ecf_flags
& ECF_MALLOC
)
9541 DECL_IS_MALLOC (decl
) = 1;
9542 if (ecf_flags
& ECF_LEAF
)
9543 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9544 NULL
, DECL_ATTRIBUTES (decl
));
9545 if ((ecf_flags
& ECF_TM_PURE
) && flag_tm
)
9546 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9548 set_builtin_decl (code
, decl
, true);
9551 /* Call this function after instantiating all builtins that the language
9552 front end cares about. This will build the rest of the builtins that
9553 are relied upon by the tree optimizers and the middle-end. */
9556 build_common_builtin_nodes (void)
9561 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9562 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9564 ftype
= build_function_type_list (ptr_type_node
,
9565 ptr_type_node
, const_ptr_type_node
,
9566 size_type_node
, NULL_TREE
);
9568 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9569 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9570 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9571 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9572 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9573 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9576 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9578 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9579 const_ptr_type_node
, size_type_node
,
9581 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9582 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9585 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9587 ftype
= build_function_type_list (ptr_type_node
,
9588 ptr_type_node
, integer_type_node
,
9589 size_type_node
, NULL_TREE
);
9590 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9591 "memset", ECF_NOTHROW
| ECF_LEAF
);
9594 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9596 ftype
= build_function_type_list (ptr_type_node
,
9597 size_type_node
, NULL_TREE
);
9598 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9599 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9602 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9603 size_type_node
, NULL_TREE
);
9604 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9605 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9606 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9608 /* If we're checking the stack, `alloca' can throw. */
9609 if (flag_stack_check
)
9611 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9612 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9615 ftype
= build_function_type_list (void_type_node
,
9616 ptr_type_node
, ptr_type_node
,
9617 ptr_type_node
, NULL_TREE
);
9618 local_define_builtin ("__builtin_init_trampoline", ftype
,
9619 BUILT_IN_INIT_TRAMPOLINE
,
9620 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9621 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9622 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9623 "__builtin_init_heap_trampoline",
9624 ECF_NOTHROW
| ECF_LEAF
);
9626 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9627 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9628 BUILT_IN_ADJUST_TRAMPOLINE
,
9629 "__builtin_adjust_trampoline",
9630 ECF_CONST
| ECF_NOTHROW
);
9632 ftype
= build_function_type_list (void_type_node
,
9633 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9634 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9635 BUILT_IN_NONLOCAL_GOTO
,
9636 "__builtin_nonlocal_goto",
9637 ECF_NORETURN
| ECF_NOTHROW
);
9639 ftype
= build_function_type_list (void_type_node
,
9640 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9641 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9642 BUILT_IN_SETJMP_SETUP
,
9643 "__builtin_setjmp_setup", ECF_NOTHROW
);
9645 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9646 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9647 BUILT_IN_SETJMP_DISPATCHER
,
9648 "__builtin_setjmp_dispatcher",
9649 ECF_PURE
| ECF_NOTHROW
);
9651 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9652 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9653 BUILT_IN_SETJMP_RECEIVER
,
9654 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9656 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9657 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9658 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9660 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9661 local_define_builtin ("__builtin_stack_restore", ftype
,
9662 BUILT_IN_STACK_RESTORE
,
9663 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9665 /* If there's a possibility that we might use the ARM EABI, build the
9666 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9667 if (targetm
.arm_eabi_unwinder
)
9669 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9670 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9671 BUILT_IN_CXA_END_CLEANUP
,
9672 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9675 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9676 local_define_builtin ("__builtin_unwind_resume", ftype
,
9677 BUILT_IN_UNWIND_RESUME
,
9678 ((targetm_common
.except_unwind_info (&global_options
)
9680 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9683 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9685 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9687 local_define_builtin ("__builtin_return_address", ftype
,
9688 BUILT_IN_RETURN_ADDRESS
,
9689 "__builtin_return_address",
9693 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9694 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9696 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9697 ptr_type_node
, NULL_TREE
);
9698 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9699 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9700 BUILT_IN_PROFILE_FUNC_ENTER
,
9701 "__cyg_profile_func_enter", 0);
9702 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9703 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9704 BUILT_IN_PROFILE_FUNC_EXIT
,
9705 "__cyg_profile_func_exit", 0);
9708 /* The exception object and filter values from the runtime. The argument
9709 must be zero before exception lowering, i.e. from the front end. After
9710 exception lowering, it will be the region number for the exception
9711 landing pad. These functions are PURE instead of CONST to prevent
9712 them from being hoisted past the exception edge that will initialize
9713 its value in the landing pad. */
9714 ftype
= build_function_type_list (ptr_type_node
,
9715 integer_type_node
, NULL_TREE
);
9716 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9717 /* Only use TM_PURE if we we have TM language support. */
9718 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9719 ecf_flags
|= ECF_TM_PURE
;
9720 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9721 "__builtin_eh_pointer", ecf_flags
);
9723 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9724 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9725 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9726 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9728 ftype
= build_function_type_list (void_type_node
,
9729 integer_type_node
, integer_type_node
,
9731 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9732 BUILT_IN_EH_COPY_VALUES
,
9733 "__builtin_eh_copy_values", ECF_NOTHROW
);
9735 /* Complex multiplication and division. These are handled as builtins
9736 rather than optabs because emit_library_call_value doesn't support
9737 complex. Further, we can do slightly better with folding these
9738 beasties if the real and complex parts of the arguments are separate. */
9742 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9744 char mode_name_buf
[4], *q
;
9746 enum built_in_function mcode
, dcode
;
9747 tree type
, inner_type
;
9748 const char *prefix
= "__";
9750 if (targetm
.libfunc_gnu_prefix
)
9753 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9756 inner_type
= TREE_TYPE (type
);
9758 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9759 inner_type
, inner_type
, NULL_TREE
);
9761 mcode
= ((enum built_in_function
)
9762 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9763 dcode
= ((enum built_in_function
)
9764 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9766 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9770 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9772 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9773 built_in_names
[mcode
],
9774 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9776 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9778 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9779 built_in_names
[dcode
],
9780 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9785 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9788 If we requested a pointer to a vector, build up the pointers that
9789 we stripped off while looking for the inner type. Similarly for
9790 return values from functions.
9792 The argument TYPE is the top of the chain, and BOTTOM is the
9793 new type which we will point to. */
9796 reconstruct_complex_type (tree type
, tree bottom
)
9800 if (TREE_CODE (type
) == POINTER_TYPE
)
9802 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9803 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9804 TYPE_REF_CAN_ALIAS_ALL (type
));
9806 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9808 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9809 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9810 TYPE_REF_CAN_ALIAS_ALL (type
));
9812 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9814 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9815 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9817 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9819 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9820 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9822 else if (TREE_CODE (type
) == METHOD_TYPE
)
9824 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9825 /* The build_method_type_directly() routine prepends 'this' to argument list,
9826 so we must compensate by getting rid of it. */
9828 = build_method_type_directly
9829 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9831 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9833 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9835 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9836 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9841 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9845 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9848 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9852 switch (GET_MODE_CLASS (mode
))
9854 case MODE_VECTOR_INT
:
9855 case MODE_VECTOR_FLOAT
:
9856 case MODE_VECTOR_FRACT
:
9857 case MODE_VECTOR_UFRACT
:
9858 case MODE_VECTOR_ACCUM
:
9859 case MODE_VECTOR_UACCUM
:
9860 nunits
= GET_MODE_NUNITS (mode
);
9864 /* Check that there are no leftover bits. */
9865 gcc_assert (GET_MODE_BITSIZE (mode
)
9866 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9868 nunits
= GET_MODE_BITSIZE (mode
)
9869 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9876 return make_vector_type (innertype
, nunits
, mode
);
9879 /* Similarly, but takes the inner type and number of units, which must be
9883 build_vector_type (tree innertype
, int nunits
)
9885 return make_vector_type (innertype
, nunits
, VOIDmode
);
9888 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9891 build_opaque_vector_type (tree innertype
, int nunits
)
9893 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9895 /* We always build the non-opaque variant before the opaque one,
9896 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9897 cand
= TYPE_NEXT_VARIANT (t
);
9899 && TYPE_VECTOR_OPAQUE (cand
)
9900 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9902 /* Othewise build a variant type and make sure to queue it after
9903 the non-opaque type. */
9904 cand
= build_distinct_type_copy (t
);
9905 TYPE_VECTOR_OPAQUE (cand
) = true;
9906 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9907 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9908 TYPE_NEXT_VARIANT (t
) = cand
;
9909 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9914 /* Given an initializer INIT, return TRUE if INIT is zero or some
9915 aggregate of zeros. Otherwise return FALSE. */
9917 initializer_zerop (const_tree init
)
9923 switch (TREE_CODE (init
))
9926 return integer_zerop (init
);
9929 /* ??? Note that this is not correct for C4X float formats. There,
9930 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9931 negative exponent. */
9932 return real_zerop (init
)
9933 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9936 return fixed_zerop (init
);
9939 return integer_zerop (init
)
9940 || (real_zerop (init
)
9941 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9942 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9947 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
9948 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
9955 unsigned HOST_WIDE_INT idx
;
9957 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9958 if (!initializer_zerop (elt
))
9967 /* We need to loop through all elements to handle cases like
9968 "\0" and "\0foobar". */
9969 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9970 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9981 /* Build an empty statement at location LOC. */
9984 build_empty_stmt (location_t loc
)
9986 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9987 SET_EXPR_LOCATION (t
, loc
);
9992 /* Build an OpenMP clause with code CODE. LOC is the location of the
9996 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10001 length
= omp_clause_num_ops
[code
];
10002 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10004 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10006 t
= ggc_alloc_tree_node (size
);
10007 memset (t
, 0, size
);
10008 TREE_SET_CODE (t
, OMP_CLAUSE
);
10009 OMP_CLAUSE_SET_CODE (t
, code
);
10010 OMP_CLAUSE_LOCATION (t
) = loc
;
10015 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10016 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10017 Except for the CODE and operand count field, other storage for the
10018 object is initialized to zeros. */
10021 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10024 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10026 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10027 gcc_assert (len
>= 1);
10029 record_node_allocation_statistics (code
, length
);
10031 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
10033 TREE_SET_CODE (t
, code
);
10035 /* Can't use TREE_OPERAND to store the length because if checking is
10036 enabled, it will try to check the length before we store it. :-P */
10037 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10042 /* Helper function for build_call_* functions; build a CALL_EXPR with
10043 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10044 the argument slots. */
10047 build_call_1 (tree return_type
, tree fn
, int nargs
)
10051 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10052 TREE_TYPE (t
) = return_type
;
10053 CALL_EXPR_FN (t
) = fn
;
10054 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10059 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10060 FN and a null static chain slot. NARGS is the number of call arguments
10061 which are specified as "..." arguments. */
10064 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10068 va_start (args
, nargs
);
10069 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10074 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10075 FN and a null static chain slot. NARGS is the number of call arguments
10076 which are specified as a va_list ARGS. */
10079 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10084 t
= build_call_1 (return_type
, fn
, nargs
);
10085 for (i
= 0; i
< nargs
; i
++)
10086 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10087 process_call_operands (t
);
10091 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10092 FN and a null static chain slot. NARGS is the number of call arguments
10093 which are specified as a tree array ARGS. */
10096 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10097 int nargs
, const tree
*args
)
10102 t
= build_call_1 (return_type
, fn
, nargs
);
10103 for (i
= 0; i
< nargs
; i
++)
10104 CALL_EXPR_ARG (t
, i
) = args
[i
];
10105 process_call_operands (t
);
10106 SET_EXPR_LOCATION (t
, loc
);
10110 /* Like build_call_array, but takes a VEC. */
10113 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
10118 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
10119 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
10120 CALL_EXPR_ARG (ret
, ix
) = t
;
10121 process_call_operands (ret
);
10126 /* Returns true if it is possible to prove that the index of
10127 an array access REF (an ARRAY_REF expression) falls into the
10131 in_array_bounds_p (tree ref
)
10133 tree idx
= TREE_OPERAND (ref
, 1);
10136 if (TREE_CODE (idx
) != INTEGER_CST
)
10139 min
= array_ref_low_bound (ref
);
10140 max
= array_ref_up_bound (ref
);
10143 || TREE_CODE (min
) != INTEGER_CST
10144 || TREE_CODE (max
) != INTEGER_CST
)
10147 if (tree_int_cst_lt (idx
, min
)
10148 || tree_int_cst_lt (max
, idx
))
10154 /* Returns true if it is possible to prove that the range of
10155 an array access REF (an ARRAY_RANGE_REF expression) falls
10156 into the array bounds. */
10159 range_in_array_bounds_p (tree ref
)
10161 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10162 tree range_min
, range_max
, min
, max
;
10164 range_min
= TYPE_MIN_VALUE (domain_type
);
10165 range_max
= TYPE_MAX_VALUE (domain_type
);
10168 || TREE_CODE (range_min
) != INTEGER_CST
10169 || TREE_CODE (range_max
) != INTEGER_CST
)
10172 min
= array_ref_low_bound (ref
);
10173 max
= array_ref_up_bound (ref
);
10176 || TREE_CODE (min
) != INTEGER_CST
10177 || TREE_CODE (max
) != INTEGER_CST
)
10180 if (tree_int_cst_lt (range_min
, min
)
10181 || tree_int_cst_lt (max
, range_max
))
10187 /* Return true if T (assumed to be a DECL) must be assigned a memory
10191 needs_to_live_in_memory (const_tree t
)
10193 if (TREE_CODE (t
) == SSA_NAME
)
10194 t
= SSA_NAME_VAR (t
);
10196 return (TREE_ADDRESSABLE (t
)
10197 || is_global_var (t
)
10198 || (TREE_CODE (t
) == RESULT_DECL
10199 && !DECL_BY_REFERENCE (t
)
10200 && aggregate_value_p (t
, current_function_decl
)));
10203 /* Return value of a constant X and sign-extend it. */
10206 int_cst_value (const_tree x
)
10208 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10209 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10211 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10212 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10213 || TREE_INT_CST_HIGH (x
) == -1);
10215 if (bits
< HOST_BITS_PER_WIDE_INT
)
10217 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10219 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10221 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10227 /* Return value of a constant X and sign-extend it. */
10230 widest_int_cst_value (const_tree x
)
10232 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10233 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10235 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10236 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10237 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10238 << HOST_BITS_PER_WIDE_INT
);
10240 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10241 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10242 || TREE_INT_CST_HIGH (x
) == -1);
10245 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10247 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10249 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10251 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10257 /* If TYPE is an integral or pointer type, return an integer type with
10258 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10259 if TYPE is already an integer type of signedness UNSIGNEDP. */
10262 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10264 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10267 if (!INTEGRAL_TYPE_P (type
)
10268 && !POINTER_TYPE_P (type
))
10271 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10274 /* If TYPE is an integral or pointer type, return an integer type with
10275 the same precision which is unsigned, or itself if TYPE is already an
10276 unsigned integer type. */
10279 unsigned_type_for (tree type
)
10281 return signed_or_unsigned_type_for (1, type
);
10284 /* If TYPE is an integral or pointer type, return an integer type with
10285 the same precision which is signed, or itself if TYPE is already a
10286 signed integer type. */
10289 signed_type_for (tree type
)
10291 return signed_or_unsigned_type_for (0, type
);
10294 /* Returns the largest value obtainable by casting something in INNER type to
10298 upper_bound_in_type (tree outer
, tree inner
)
10301 unsigned int det
= 0;
10302 unsigned oprec
= TYPE_PRECISION (outer
);
10303 unsigned iprec
= TYPE_PRECISION (inner
);
10306 /* Compute a unique number for every combination. */
10307 det
|= (oprec
> iprec
) ? 4 : 0;
10308 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10309 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10311 /* Determine the exponent to use. */
10316 /* oprec <= iprec, outer: signed, inner: don't care. */
10321 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10325 /* oprec > iprec, outer: signed, inner: signed. */
10329 /* oprec > iprec, outer: signed, inner: unsigned. */
10333 /* oprec > iprec, outer: unsigned, inner: signed. */
10337 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10341 gcc_unreachable ();
10344 /* Compute 2^^prec - 1. */
10345 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10348 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10349 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10353 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10354 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10355 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10358 return double_int_to_tree (outer
, high
);
10361 /* Returns the smallest value obtainable by casting something in INNER type to
10365 lower_bound_in_type (tree outer
, tree inner
)
10368 unsigned oprec
= TYPE_PRECISION (outer
);
10369 unsigned iprec
= TYPE_PRECISION (inner
);
10371 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10373 if (TYPE_UNSIGNED (outer
)
10374 /* If we are widening something of an unsigned type, OUTER type
10375 contains all values of INNER type. In particular, both INNER
10376 and OUTER types have zero in common. */
10377 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10378 low
.low
= low
.high
= 0;
10381 /* If we are widening a signed type to another signed type, we
10382 want to obtain -2^^(iprec-1). If we are keeping the
10383 precision or narrowing to a signed type, we want to obtain
10385 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10387 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10389 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10390 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10394 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10395 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10400 return double_int_to_tree (outer
, low
);
10403 /* Return nonzero if two operands that are suitable for PHI nodes are
10404 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10405 SSA_NAME or invariant. Note that this is strictly an optimization.
10406 That is, callers of this function can directly call operand_equal_p
10407 and get the same result, only slower. */
10410 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10414 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10416 return operand_equal_p (arg0
, arg1
, 0);
10419 /* Returns number of zeros at the end of binary representation of X.
10421 ??? Use ffs if available? */
10424 num_ending_zeros (const_tree x
)
10426 unsigned HOST_WIDE_INT fr
, nfr
;
10427 unsigned num
, abits
;
10428 tree type
= TREE_TYPE (x
);
10430 if (TREE_INT_CST_LOW (x
) == 0)
10432 num
= HOST_BITS_PER_WIDE_INT
;
10433 fr
= TREE_INT_CST_HIGH (x
);
10438 fr
= TREE_INT_CST_LOW (x
);
10441 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10444 if (nfr
<< abits
== fr
)
10451 if (num
> TYPE_PRECISION (type
))
10452 num
= TYPE_PRECISION (type
);
10454 return build_int_cst_type (type
, num
);
10458 #define WALK_SUBTREE(NODE) \
10461 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10467 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10468 be walked whenever a type is seen in the tree. Rest of operands and return
10469 value are as for walk_tree. */
10472 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10473 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10475 tree result
= NULL_TREE
;
10477 switch (TREE_CODE (type
))
10480 case REFERENCE_TYPE
:
10481 /* We have to worry about mutually recursive pointers. These can't
10482 be written in C. They can in Ada. It's pathological, but
10483 there's an ACATS test (c38102a) that checks it. Deal with this
10484 by checking if we're pointing to another pointer, that one
10485 points to another pointer, that one does too, and we have no htab.
10486 If so, get a hash table. We check three levels deep to avoid
10487 the cost of the hash table if we don't need one. */
10488 if (POINTER_TYPE_P (TREE_TYPE (type
))
10489 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10490 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10493 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10501 /* ... fall through ... */
10504 WALK_SUBTREE (TREE_TYPE (type
));
10508 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10510 /* Fall through. */
10512 case FUNCTION_TYPE
:
10513 WALK_SUBTREE (TREE_TYPE (type
));
10517 /* We never want to walk into default arguments. */
10518 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10519 WALK_SUBTREE (TREE_VALUE (arg
));
10524 /* Don't follow this nodes's type if a pointer for fear that
10525 we'll have infinite recursion. If we have a PSET, then we
10528 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10529 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10530 WALK_SUBTREE (TREE_TYPE (type
));
10531 WALK_SUBTREE (TYPE_DOMAIN (type
));
10535 WALK_SUBTREE (TREE_TYPE (type
));
10536 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10546 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10547 called with the DATA and the address of each sub-tree. If FUNC returns a
10548 non-NULL value, the traversal is stopped, and the value returned by FUNC
10549 is returned. If PSET is non-NULL it is used to record the nodes visited,
10550 and to avoid visiting a node more than once. */
10553 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10554 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10556 enum tree_code code
;
10560 #define WALK_SUBTREE_TAIL(NODE) \
10564 goto tail_recurse; \
10569 /* Skip empty subtrees. */
10573 /* Don't walk the same tree twice, if the user has requested
10574 that we avoid doing so. */
10575 if (pset
&& pointer_set_insert (pset
, *tp
))
10578 /* Call the function. */
10580 result
= (*func
) (tp
, &walk_subtrees
, data
);
10582 /* If we found something, return it. */
10586 code
= TREE_CODE (*tp
);
10588 /* Even if we didn't, FUNC may have decided that there was nothing
10589 interesting below this point in the tree. */
10590 if (!walk_subtrees
)
10592 /* But we still need to check our siblings. */
10593 if (code
== TREE_LIST
)
10594 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10595 else if (code
== OMP_CLAUSE
)
10596 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10603 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10604 if (result
|| !walk_subtrees
)
10611 case IDENTIFIER_NODE
:
10618 case PLACEHOLDER_EXPR
:
10622 /* None of these have subtrees other than those already walked
10627 WALK_SUBTREE (TREE_VALUE (*tp
));
10628 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10633 int len
= TREE_VEC_LENGTH (*tp
);
10638 /* Walk all elements but the first. */
10640 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10642 /* Now walk the first one as a tail call. */
10643 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10647 WALK_SUBTREE (TREE_REALPART (*tp
));
10648 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10652 unsigned HOST_WIDE_INT idx
;
10653 constructor_elt
*ce
;
10656 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10658 WALK_SUBTREE (ce
->value
);
10663 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10668 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10670 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10671 into declarations that are just mentioned, rather than
10672 declared; they don't really belong to this part of the tree.
10673 And, we can see cycles: the initializer for a declaration
10674 can refer to the declaration itself. */
10675 WALK_SUBTREE (DECL_INITIAL (decl
));
10676 WALK_SUBTREE (DECL_SIZE (decl
));
10677 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10679 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10682 case STATEMENT_LIST
:
10684 tree_stmt_iterator i
;
10685 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10686 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10691 switch (OMP_CLAUSE_CODE (*tp
))
10693 case OMP_CLAUSE_PRIVATE
:
10694 case OMP_CLAUSE_SHARED
:
10695 case OMP_CLAUSE_FIRSTPRIVATE
:
10696 case OMP_CLAUSE_COPYIN
:
10697 case OMP_CLAUSE_COPYPRIVATE
:
10698 case OMP_CLAUSE_FINAL
:
10699 case OMP_CLAUSE_IF
:
10700 case OMP_CLAUSE_NUM_THREADS
:
10701 case OMP_CLAUSE_SCHEDULE
:
10702 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10705 case OMP_CLAUSE_NOWAIT
:
10706 case OMP_CLAUSE_ORDERED
:
10707 case OMP_CLAUSE_DEFAULT
:
10708 case OMP_CLAUSE_UNTIED
:
10709 case OMP_CLAUSE_MERGEABLE
:
10710 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10712 case OMP_CLAUSE_LASTPRIVATE
:
10713 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10714 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10715 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10717 case OMP_CLAUSE_COLLAPSE
:
10720 for (i
= 0; i
< 3; i
++)
10721 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10722 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10725 case OMP_CLAUSE_REDUCTION
:
10728 for (i
= 0; i
< 4; i
++)
10729 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10730 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10734 gcc_unreachable ();
10742 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10743 But, we only want to walk once. */
10744 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10745 for (i
= 0; i
< len
; ++i
)
10746 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10747 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10751 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10752 defining. We only want to walk into these fields of a type in this
10753 case and not in the general case of a mere reference to the type.
10755 The criterion is as follows: if the field can be an expression, it
10756 must be walked only here. This should be in keeping with the fields
10757 that are directly gimplified in gimplify_type_sizes in order for the
10758 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10759 variable-sized types.
10761 Note that DECLs get walked as part of processing the BIND_EXPR. */
10762 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10764 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10765 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10768 /* Call the function for the type. See if it returns anything or
10769 doesn't want us to continue. If we are to continue, walk both
10770 the normal fields and those for the declaration case. */
10771 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10772 if (result
|| !walk_subtrees
)
10775 /* But do not walk a pointed-to type since it may itself need to
10776 be walked in the declaration case if it isn't anonymous. */
10777 if (!POINTER_TYPE_P (*type_p
))
10779 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10784 /* If this is a record type, also walk the fields. */
10785 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10789 for (field
= TYPE_FIELDS (*type_p
); field
;
10790 field
= DECL_CHAIN (field
))
10792 /* We'd like to look at the type of the field, but we can
10793 easily get infinite recursion. So assume it's pointed
10794 to elsewhere in the tree. Also, ignore things that
10796 if (TREE_CODE (field
) != FIELD_DECL
)
10799 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10800 WALK_SUBTREE (DECL_SIZE (field
));
10801 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10802 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10803 WALK_SUBTREE (DECL_QUALIFIER (field
));
10807 /* Same for scalar types. */
10808 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10809 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10810 || TREE_CODE (*type_p
) == INTEGER_TYPE
10811 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10812 || TREE_CODE (*type_p
) == REAL_TYPE
)
10814 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10815 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10818 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10819 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10824 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10828 /* Walk over all the sub-trees of this operand. */
10829 len
= TREE_OPERAND_LENGTH (*tp
);
10831 /* Go through the subtrees. We need to do this in forward order so
10832 that the scope of a FOR_EXPR is handled properly. */
10835 for (i
= 0; i
< len
- 1; ++i
)
10836 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10837 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10840 /* If this is a type, walk the needed fields in the type. */
10841 else if (TYPE_P (*tp
))
10842 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10846 /* We didn't find what we were looking for. */
10849 #undef WALK_SUBTREE_TAIL
10851 #undef WALK_SUBTREE
10853 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10856 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10860 struct pointer_set_t
*pset
;
10862 pset
= pointer_set_create ();
10863 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10864 pointer_set_destroy (pset
);
10870 tree_block (tree t
)
10872 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10874 if (IS_EXPR_CODE_CLASS (c
))
10875 return &t
->exp
.block
;
10876 gcc_unreachable ();
10880 /* Create a nameless artificial label and put it in the current
10881 function context. The label has a location of LOC. Returns the
10882 newly created label. */
10885 create_artificial_label (location_t loc
)
10887 tree lab
= build_decl (loc
,
10888 LABEL_DECL
, NULL_TREE
, void_type_node
);
10890 DECL_ARTIFICIAL (lab
) = 1;
10891 DECL_IGNORED_P (lab
) = 1;
10892 DECL_CONTEXT (lab
) = current_function_decl
;
10896 /* Given a tree, try to return a useful variable name that we can use
10897 to prefix a temporary that is being assigned the value of the tree.
10898 I.E. given <temp> = &A, return A. */
10903 tree stripped_decl
;
10906 STRIP_NOPS (stripped_decl
);
10907 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10908 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10911 switch (TREE_CODE (stripped_decl
))
10914 return get_name (TREE_OPERAND (stripped_decl
, 0));
10921 /* Return true if TYPE has a variable argument list. */
10924 stdarg_p (const_tree fntype
)
10926 function_args_iterator args_iter
;
10927 tree n
= NULL_TREE
, t
;
10932 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10937 return n
!= NULL_TREE
&& n
!= void_type_node
;
10940 /* Return true if TYPE has a prototype. */
10943 prototype_p (tree fntype
)
10947 gcc_assert (fntype
!= NULL_TREE
);
10949 t
= TYPE_ARG_TYPES (fntype
);
10950 return (t
!= NULL_TREE
);
10953 /* If BLOCK is inlined from an __attribute__((__artificial__))
10954 routine, return pointer to location from where it has been
10957 block_nonartificial_location (tree block
)
10959 location_t
*ret
= NULL
;
10961 while (block
&& TREE_CODE (block
) == BLOCK
10962 && BLOCK_ABSTRACT_ORIGIN (block
))
10964 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10966 while (TREE_CODE (ao
) == BLOCK
10967 && BLOCK_ABSTRACT_ORIGIN (ao
)
10968 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10969 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10971 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10973 /* If AO is an artificial inline, point RET to the
10974 call site locus at which it has been inlined and continue
10975 the loop, in case AO's caller is also an artificial
10977 if (DECL_DECLARED_INLINE_P (ao
)
10978 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10979 ret
= &BLOCK_SOURCE_LOCATION (block
);
10983 else if (TREE_CODE (ao
) != BLOCK
)
10986 block
= BLOCK_SUPERCONTEXT (block
);
10992 /* If EXP is inlined from an __attribute__((__artificial__))
10993 function, return the location of the original call expression. */
10996 tree_nonartificial_location (tree exp
)
10998 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11003 return EXPR_LOCATION (exp
);
11007 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11010 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11013 cl_option_hash_hash (const void *x
)
11015 const_tree
const t
= (const_tree
) x
;
11019 hashval_t hash
= 0;
11021 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11023 p
= (const char *)TREE_OPTIMIZATION (t
);
11024 len
= sizeof (struct cl_optimization
);
11027 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11029 p
= (const char *)TREE_TARGET_OPTION (t
);
11030 len
= sizeof (struct cl_target_option
);
11034 gcc_unreachable ();
11036 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11038 for (i
= 0; i
< len
; i
++)
11040 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11045 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11046 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11050 cl_option_hash_eq (const void *x
, const void *y
)
11052 const_tree
const xt
= (const_tree
) x
;
11053 const_tree
const yt
= (const_tree
) y
;
11058 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11061 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11063 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11064 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11065 len
= sizeof (struct cl_optimization
);
11068 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11070 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11071 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11072 len
= sizeof (struct cl_target_option
);
11076 gcc_unreachable ();
11078 return (memcmp (xp
, yp
, len
) == 0);
11081 /* Build an OPTIMIZATION_NODE based on the current options. */
11084 build_optimization_node (void)
11089 /* Use the cache of optimization nodes. */
11091 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11094 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11098 /* Insert this one into the hash table. */
11099 t
= cl_optimization_node
;
11102 /* Make a new node for next time round. */
11103 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11109 /* Build a TARGET_OPTION_NODE based on the current options. */
11112 build_target_option_node (void)
11117 /* Use the cache of optimization nodes. */
11119 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11122 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11126 /* Insert this one into the hash table. */
11127 t
= cl_target_option_node
;
11130 /* Make a new node for next time round. */
11131 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11137 /* Determine the "ultimate origin" of a block. The block may be an inlined
11138 instance of an inlined instance of a block which is local to an inline
11139 function, so we have to trace all of the way back through the origin chain
11140 to find out what sort of node actually served as the original seed for the
11144 block_ultimate_origin (const_tree block
)
11146 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11148 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11149 nodes in the function to point to themselves; ignore that if
11150 we're trying to output the abstract instance of this function. */
11151 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11154 if (immediate_origin
== NULL_TREE
)
11159 tree lookahead
= immediate_origin
;
11163 ret_val
= lookahead
;
11164 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11165 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11167 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11169 /* The block's abstract origin chain may not be the *ultimate* origin of
11170 the block. It could lead to a DECL that has an abstract origin set.
11171 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11172 will give us if it has one). Note that DECL's abstract origins are
11173 supposed to be the most distant ancestor (or so decl_ultimate_origin
11174 claims), so we don't need to loop following the DECL origins. */
11175 if (DECL_P (ret_val
))
11176 return DECL_ORIGIN (ret_val
);
11182 /* Return true if T1 and T2 are equivalent lists. */
11185 list_equal_p (const_tree t1
, const_tree t2
)
11187 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11188 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11193 /* Return true iff conversion in EXP generates no instruction. Mark
11194 it inline so that we fully inline into the stripping functions even
11195 though we have two uses of this function. */
11198 tree_nop_conversion (const_tree exp
)
11200 tree outer_type
, inner_type
;
11202 if (!CONVERT_EXPR_P (exp
)
11203 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11205 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11208 outer_type
= TREE_TYPE (exp
);
11209 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11214 /* Use precision rather then machine mode when we can, which gives
11215 the correct answer even for submode (bit-field) types. */
11216 if ((INTEGRAL_TYPE_P (outer_type
)
11217 || POINTER_TYPE_P (outer_type
)
11218 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11219 && (INTEGRAL_TYPE_P (inner_type
)
11220 || POINTER_TYPE_P (inner_type
)
11221 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11222 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11224 /* Otherwise fall back on comparing machine modes (e.g. for
11225 aggregate types, floats). */
11226 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11229 /* Return true iff conversion in EXP generates no instruction. Don't
11230 consider conversions changing the signedness. */
11233 tree_sign_nop_conversion (const_tree exp
)
11235 tree outer_type
, inner_type
;
11237 if (!tree_nop_conversion (exp
))
11240 outer_type
= TREE_TYPE (exp
);
11241 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11243 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11244 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11247 /* Strip conversions from EXP according to tree_nop_conversion and
11248 return the resulting expression. */
11251 tree_strip_nop_conversions (tree exp
)
11253 while (tree_nop_conversion (exp
))
11254 exp
= TREE_OPERAND (exp
, 0);
11258 /* Strip conversions from EXP according to tree_sign_nop_conversion
11259 and return the resulting expression. */
11262 tree_strip_sign_nop_conversions (tree exp
)
11264 while (tree_sign_nop_conversion (exp
))
11265 exp
= TREE_OPERAND (exp
, 0);
11269 /* Avoid any floating point extensions from EXP. */
11271 strip_float_extensions (tree exp
)
11273 tree sub
, expt
, subt
;
11275 /* For floating point constant look up the narrowest type that can hold
11276 it properly and handle it like (type)(narrowest_type)constant.
11277 This way we can optimize for instance a=a*2.0 where "a" is float
11278 but 2.0 is double constant. */
11279 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11281 REAL_VALUE_TYPE orig
;
11284 orig
= TREE_REAL_CST (exp
);
11285 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11286 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11287 type
= float_type_node
;
11288 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11289 > TYPE_PRECISION (double_type_node
)
11290 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11291 type
= double_type_node
;
11293 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11296 if (!CONVERT_EXPR_P (exp
))
11299 sub
= TREE_OPERAND (exp
, 0);
11300 subt
= TREE_TYPE (sub
);
11301 expt
= TREE_TYPE (exp
);
11303 if (!FLOAT_TYPE_P (subt
))
11306 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11309 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11312 return strip_float_extensions (sub
);
11315 /* Strip out all handled components that produce invariant
11319 strip_invariant_refs (const_tree op
)
11321 while (handled_component_p (op
))
11323 switch (TREE_CODE (op
))
11326 case ARRAY_RANGE_REF
:
11327 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11328 || TREE_OPERAND (op
, 2) != NULL_TREE
11329 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11333 case COMPONENT_REF
:
11334 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11340 op
= TREE_OPERAND (op
, 0);
11346 static GTY(()) tree gcc_eh_personality_decl
;
11348 /* Return the GCC personality function decl. */
11351 lhd_gcc_personality (void)
11353 if (!gcc_eh_personality_decl
)
11354 gcc_eh_personality_decl
= build_personality_function ("gcc");
11355 return gcc_eh_personality_decl
;
11358 /* Try to find a base info of BINFO that would have its field decl at offset
11359 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11360 found, return, otherwise return NULL_TREE. */
11363 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11365 tree type
= BINFO_TYPE (binfo
);
11369 HOST_WIDE_INT pos
, size
;
11373 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11378 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11380 if (TREE_CODE (fld
) != FIELD_DECL
)
11383 pos
= int_bit_position (fld
);
11384 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11385 if (pos
<= offset
&& (pos
+ size
) > offset
)
11388 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11391 if (!DECL_ARTIFICIAL (fld
))
11393 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11397 /* Offset 0 indicates the primary base, whose vtable contents are
11398 represented in the binfo for the derived class. */
11399 else if (offset
!= 0)
11401 tree base_binfo
, found_binfo
= NULL_TREE
;
11402 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11403 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11405 found_binfo
= base_binfo
;
11410 binfo
= found_binfo
;
11413 type
= TREE_TYPE (fld
);
11418 /* Returns true if X is a typedef decl. */
11421 is_typedef_decl (tree x
)
11423 return (x
&& TREE_CODE (x
) == TYPE_DECL
11424 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11427 /* Returns true iff TYPE is a type variant created for a typedef. */
11430 typedef_variant_p (tree type
)
11432 return is_typedef_decl (TYPE_NAME (type
));
11435 /* Warn about a use of an identifier which was marked deprecated. */
11437 warn_deprecated_use (tree node
, tree attr
)
11441 if (node
== 0 || !warn_deprecated_decl
)
11447 attr
= DECL_ATTRIBUTES (node
);
11448 else if (TYPE_P (node
))
11450 tree decl
= TYPE_STUB_DECL (node
);
11452 attr
= lookup_attribute ("deprecated",
11453 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11458 attr
= lookup_attribute ("deprecated", attr
);
11461 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11467 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11469 warning (OPT_Wdeprecated_declarations
,
11470 "%qD is deprecated (declared at %s:%d): %s",
11471 node
, xloc
.file
, xloc
.line
, msg
);
11473 warning (OPT_Wdeprecated_declarations
,
11474 "%qD is deprecated (declared at %s:%d)",
11475 node
, xloc
.file
, xloc
.line
);
11477 else if (TYPE_P (node
))
11479 tree what
= NULL_TREE
;
11480 tree decl
= TYPE_STUB_DECL (node
);
11482 if (TYPE_NAME (node
))
11484 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11485 what
= TYPE_NAME (node
);
11486 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11487 && DECL_NAME (TYPE_NAME (node
)))
11488 what
= DECL_NAME (TYPE_NAME (node
));
11493 expanded_location xloc
11494 = expand_location (DECL_SOURCE_LOCATION (decl
));
11498 warning (OPT_Wdeprecated_declarations
,
11499 "%qE is deprecated (declared at %s:%d): %s",
11500 what
, xloc
.file
, xloc
.line
, msg
);
11502 warning (OPT_Wdeprecated_declarations
,
11503 "%qE is deprecated (declared at %s:%d)", what
,
11504 xloc
.file
, xloc
.line
);
11509 warning (OPT_Wdeprecated_declarations
,
11510 "type is deprecated (declared at %s:%d): %s",
11511 xloc
.file
, xloc
.line
, msg
);
11513 warning (OPT_Wdeprecated_declarations
,
11514 "type is deprecated (declared at %s:%d)",
11515 xloc
.file
, xloc
.line
);
11523 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11526 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11531 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11534 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11540 #include "gt-tree.h"