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
:
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
== 2 * HOST_BITS_PER_WIDE_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
== 2 * HOST_BITS_PER_WIDE_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
== 2 * HOST_BITS_PER_WIDE_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 (debug_info_level
< DINFO_LEVEL_TERSE
4579 || (TYPE_CONTEXT (type
)
4580 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4581 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4582 TYPE_CONTEXT (type
) = NULL_TREE
;
4586 /* Return true if DECL may need an assembler name to be set. */
4589 need_assembler_name_p (tree decl
)
4591 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4592 if (TREE_CODE (decl
) != FUNCTION_DECL
4593 && TREE_CODE (decl
) != VAR_DECL
)
4596 /* If DECL already has its assembler name set, it does not need a
4598 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4599 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4602 /* Abstract decls do not need an assembler name. */
4603 if (DECL_ABSTRACT (decl
))
4606 /* For VAR_DECLs, only static, public and external symbols need an
4608 if (TREE_CODE (decl
) == VAR_DECL
4609 && !TREE_STATIC (decl
)
4610 && !TREE_PUBLIC (decl
)
4611 && !DECL_EXTERNAL (decl
))
4614 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4616 /* Do not set assembler name on builtins. Allow RTL expansion to
4617 decide whether to expand inline or via a regular call. */
4618 if (DECL_BUILT_IN (decl
)
4619 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4622 /* Functions represented in the callgraph need an assembler name. */
4623 if (cgraph_get_node (decl
) != NULL
)
4626 /* Unused and not public functions don't need an assembler name. */
4627 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4635 /* Reset all language specific information still present in symbol
4639 free_lang_data_in_decl (tree decl
)
4641 gcc_assert (DECL_P (decl
));
4643 /* Give the FE a chance to remove its own data first. */
4644 lang_hooks
.free_lang_data (decl
);
4646 TREE_LANG_FLAG_0 (decl
) = 0;
4647 TREE_LANG_FLAG_1 (decl
) = 0;
4648 TREE_LANG_FLAG_2 (decl
) = 0;
4649 TREE_LANG_FLAG_3 (decl
) = 0;
4650 TREE_LANG_FLAG_4 (decl
) = 0;
4651 TREE_LANG_FLAG_5 (decl
) = 0;
4652 TREE_LANG_FLAG_6 (decl
) = 0;
4654 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4655 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4656 if (TREE_CODE (decl
) == FIELD_DECL
)
4658 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4659 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4660 DECL_QUALIFIER (decl
) = NULL_TREE
;
4663 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4665 if (gimple_has_body_p (decl
))
4669 /* If DECL has a gimple body, then the context for its
4670 arguments must be DECL. Otherwise, it doesn't really
4671 matter, as we will not be emitting any code for DECL. In
4672 general, there may be other instances of DECL created by
4673 the front end and since PARM_DECLs are generally shared,
4674 their DECL_CONTEXT changes as the replicas of DECL are
4675 created. The only time where DECL_CONTEXT is important
4676 is for the FUNCTION_DECLs that have a gimple body (since
4677 the PARM_DECL will be used in the function's body). */
4678 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4679 DECL_CONTEXT (t
) = decl
;
4682 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4683 At this point, it is not needed anymore. */
4684 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4686 /* Clear the abstract origin if it refers to a method. Otherwise
4687 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4688 origin will not be output correctly. */
4689 if (DECL_ABSTRACT_ORIGIN (decl
)
4690 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4691 && RECORD_OR_UNION_TYPE_P
4692 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4693 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4695 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4696 DECL_VINDEX referring to itself into a vtable slot number as it
4697 should. Happens with functions that are copied and then forgotten
4698 about. Just clear it, it won't matter anymore. */
4699 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4700 DECL_VINDEX (decl
) = NULL_TREE
;
4702 else if (TREE_CODE (decl
) == VAR_DECL
)
4704 if ((DECL_EXTERNAL (decl
)
4705 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4706 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4707 DECL_INITIAL (decl
) = NULL_TREE
;
4709 else if (TREE_CODE (decl
) == TYPE_DECL
4710 || TREE_CODE (decl
) == FIELD_DECL
)
4711 DECL_INITIAL (decl
) = NULL_TREE
;
4712 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4713 && DECL_INITIAL (decl
)
4714 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4716 /* Strip builtins from the translation-unit BLOCK. We still have targets
4717 without builtin_decl_explicit support and also builtins are shared
4718 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4719 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4723 if (TREE_CODE (var
) == FUNCTION_DECL
4724 && DECL_BUILT_IN (var
))
4725 *nextp
= TREE_CHAIN (var
);
4727 nextp
= &TREE_CHAIN (var
);
4733 /* Data used when collecting DECLs and TYPEs for language data removal. */
4735 struct free_lang_data_d
4737 /* Worklist to avoid excessive recursion. */
4738 VEC(tree
,heap
) *worklist
;
4740 /* Set of traversed objects. Used to avoid duplicate visits. */
4741 struct pointer_set_t
*pset
;
4743 /* Array of symbols to process with free_lang_data_in_decl. */
4744 VEC(tree
,heap
) *decls
;
4746 /* Array of types to process with free_lang_data_in_type. */
4747 VEC(tree
,heap
) *types
;
4751 /* Save all language fields needed to generate proper debug information
4752 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4755 save_debug_info_for_decl (tree t
)
4757 /*struct saved_debug_info_d *sdi;*/
4759 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4761 /* FIXME. Partial implementation for saving debug info removed. */
4765 /* Save all language fields needed to generate proper debug information
4766 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4769 save_debug_info_for_type (tree t
)
4771 /*struct saved_debug_info_d *sdi;*/
4773 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4775 /* FIXME. Partial implementation for saving debug info removed. */
4779 /* Add type or decl T to one of the list of tree nodes that need their
4780 language data removed. The lists are held inside FLD. */
4783 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4787 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4788 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4789 save_debug_info_for_decl (t
);
4791 else if (TYPE_P (t
))
4793 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4794 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4795 save_debug_info_for_type (t
);
4801 /* Push tree node T into FLD->WORKLIST. */
4804 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4806 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4807 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4811 /* Operand callback helper for free_lang_data_in_node. *TP is the
4812 subtree operand being considered. */
4815 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4818 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4820 if (TREE_CODE (t
) == TREE_LIST
)
4823 /* Language specific nodes will be removed, so there is no need
4824 to gather anything under them. */
4825 if (is_lang_specific (t
))
4833 /* Note that walk_tree does not traverse every possible field in
4834 decls, so we have to do our own traversals here. */
4835 add_tree_to_fld_list (t
, fld
);
4837 fld_worklist_push (DECL_NAME (t
), fld
);
4838 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4839 fld_worklist_push (DECL_SIZE (t
), fld
);
4840 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4842 /* We are going to remove everything under DECL_INITIAL for
4843 TYPE_DECLs. No point walking them. */
4844 if (TREE_CODE (t
) != TYPE_DECL
)
4845 fld_worklist_push (DECL_INITIAL (t
), fld
);
4847 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4848 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4850 if (TREE_CODE (t
) == FUNCTION_DECL
)
4852 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4853 fld_worklist_push (DECL_RESULT (t
), fld
);
4855 else if (TREE_CODE (t
) == TYPE_DECL
)
4857 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4858 fld_worklist_push (DECL_VINDEX (t
), fld
);
4859 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4861 else if (TREE_CODE (t
) == FIELD_DECL
)
4863 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4864 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4865 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4866 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4868 else if (TREE_CODE (t
) == VAR_DECL
)
4870 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4871 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4874 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4875 && DECL_HAS_VALUE_EXPR_P (t
))
4876 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4878 if (TREE_CODE (t
) != FIELD_DECL
4879 && TREE_CODE (t
) != TYPE_DECL
)
4880 fld_worklist_push (TREE_CHAIN (t
), fld
);
4883 else if (TYPE_P (t
))
4885 /* Note that walk_tree does not traverse every possible field in
4886 types, so we have to do our own traversals here. */
4887 add_tree_to_fld_list (t
, fld
);
4889 if (!RECORD_OR_UNION_TYPE_P (t
))
4890 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4891 fld_worklist_push (TYPE_SIZE (t
), fld
);
4892 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4893 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4894 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4895 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4896 fld_worklist_push (TYPE_NAME (t
), fld
);
4897 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4898 them and thus do not and want not to reach unused pointer types
4900 if (!POINTER_TYPE_P (t
))
4901 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4902 if (!RECORD_OR_UNION_TYPE_P (t
))
4903 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4904 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4905 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4906 do not and want not to reach unused variants this way. */
4907 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4908 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4909 and want not to reach unused types this way. */
4911 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4915 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4917 fld_worklist_push (TREE_TYPE (tem
), fld
);
4918 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4920 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4921 && TREE_CODE (tem
) == TREE_LIST
)
4924 fld_worklist_push (TREE_VALUE (tem
), fld
);
4925 tem
= TREE_CHAIN (tem
);
4929 if (RECORD_OR_UNION_TYPE_P (t
))
4932 /* Push all TYPE_FIELDS - there can be interleaving interesting
4933 and non-interesting things. */
4934 tem
= TYPE_FIELDS (t
);
4937 if (TREE_CODE (tem
) == FIELD_DECL
4938 || TREE_CODE (tem
) == TYPE_DECL
)
4939 fld_worklist_push (tem
, fld
);
4940 tem
= TREE_CHAIN (tem
);
4944 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
4947 else if (TREE_CODE (t
) == BLOCK
)
4950 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4951 fld_worklist_push (tem
, fld
);
4952 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4953 fld_worklist_push (tem
, fld
);
4954 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4957 if (TREE_CODE (t
) != IDENTIFIER_NODE
4958 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
4959 fld_worklist_push (TREE_TYPE (t
), fld
);
4965 /* Find decls and types in T. */
4968 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4972 if (!pointer_set_contains (fld
->pset
, t
))
4973 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4974 if (VEC_empty (tree
, fld
->worklist
))
4976 t
= VEC_pop (tree
, fld
->worklist
);
4980 /* Translate all the types in LIST with the corresponding runtime
4984 get_eh_types_for_runtime (tree list
)
4988 if (list
== NULL_TREE
)
4991 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4993 list
= TREE_CHAIN (list
);
4996 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4997 TREE_CHAIN (prev
) = n
;
4998 prev
= TREE_CHAIN (prev
);
4999 list
= TREE_CHAIN (list
);
5006 /* Find decls and types referenced in EH region R and store them in
5007 FLD->DECLS and FLD->TYPES. */
5010 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5021 /* The types referenced in each catch must first be changed to the
5022 EH types used at runtime. This removes references to FE types
5024 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5026 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5027 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5032 case ERT_ALLOWED_EXCEPTIONS
:
5033 r
->u
.allowed
.type_list
5034 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5035 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5038 case ERT_MUST_NOT_THROW
:
5039 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5040 find_decls_types_r
, fld
, fld
->pset
);
5046 /* Find decls and types referenced in cgraph node N and store them in
5047 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5048 look for *every* kind of DECL and TYPE node reachable from N,
5049 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5050 NAMESPACE_DECLs, etc). */
5053 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5056 struct function
*fn
;
5060 find_decls_types (n
->symbol
.decl
, fld
);
5062 if (!gimple_has_body_p (n
->symbol
.decl
))
5065 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5067 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5069 /* Traverse locals. */
5070 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5071 find_decls_types (t
, fld
);
5073 /* Traverse EH regions in FN. */
5076 FOR_ALL_EH_REGION_FN (r
, fn
)
5077 find_decls_types_in_eh_region (r
, fld
);
5080 /* Traverse every statement in FN. */
5081 FOR_EACH_BB_FN (bb
, fn
)
5083 gimple_stmt_iterator si
;
5086 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5088 gimple phi
= gsi_stmt (si
);
5090 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5092 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5093 find_decls_types (*arg_p
, fld
);
5097 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5099 gimple stmt
= gsi_stmt (si
);
5101 if (is_gimple_call (stmt
))
5102 find_decls_types (gimple_call_fntype (stmt
), fld
);
5104 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5106 tree arg
= gimple_op (stmt
, i
);
5107 find_decls_types (arg
, fld
);
5114 /* Find decls and types referenced in varpool node N and store them in
5115 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5116 look for *every* kind of DECL and TYPE node reachable from N,
5117 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5118 NAMESPACE_DECLs, etc). */
5121 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5123 find_decls_types (v
->symbol
.decl
, fld
);
5126 /* If T needs an assembler name, have one created for it. */
5129 assign_assembler_name_if_neeeded (tree t
)
5131 if (need_assembler_name_p (t
))
5133 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5134 diagnostics that use input_location to show locus
5135 information. The problem here is that, at this point,
5136 input_location is generally anchored to the end of the file
5137 (since the parser is long gone), so we don't have a good
5138 position to pin it to.
5140 To alleviate this problem, this uses the location of T's
5141 declaration. Examples of this are
5142 testsuite/g++.dg/template/cond2.C and
5143 testsuite/g++.dg/template/pr35240.C. */
5144 location_t saved_location
= input_location
;
5145 input_location
= DECL_SOURCE_LOCATION (t
);
5147 decl_assembler_name (t
);
5149 input_location
= saved_location
;
5154 /* Free language specific information for every operand and expression
5155 in every node of the call graph. This process operates in three stages:
5157 1- Every callgraph node and varpool node is traversed looking for
5158 decls and types embedded in them. This is a more exhaustive
5159 search than that done by find_referenced_vars, because it will
5160 also collect individual fields, decls embedded in types, etc.
5162 2- All the decls found are sent to free_lang_data_in_decl.
5164 3- All the types found are sent to free_lang_data_in_type.
5166 The ordering between decls and types is important because
5167 free_lang_data_in_decl sets assembler names, which includes
5168 mangling. So types cannot be freed up until assembler names have
5172 free_lang_data_in_cgraph (void)
5174 struct cgraph_node
*n
;
5175 struct varpool_node
*v
;
5176 struct free_lang_data_d fld
;
5181 /* Initialize sets and arrays to store referenced decls and types. */
5182 fld
.pset
= pointer_set_create ();
5183 fld
.worklist
= NULL
;
5184 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5185 fld
.types
= VEC_alloc (tree
, heap
, 100);
5187 /* Find decls and types in the body of every function in the callgraph. */
5188 FOR_EACH_FUNCTION (n
)
5189 find_decls_types_in_node (n
, &fld
);
5191 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5192 find_decls_types (p
->decl
, &fld
);
5194 /* Find decls and types in every varpool symbol. */
5195 FOR_EACH_VARIABLE (v
)
5196 find_decls_types_in_var (v
, &fld
);
5198 /* Set the assembler name on every decl found. We need to do this
5199 now because free_lang_data_in_decl will invalidate data needed
5200 for mangling. This breaks mangling on interdependent decls. */
5201 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5202 assign_assembler_name_if_neeeded (t
);
5204 /* Traverse every decl found freeing its language data. */
5205 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5206 free_lang_data_in_decl (t
);
5208 /* Traverse every type found freeing its language data. */
5209 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5210 free_lang_data_in_type (t
);
5212 pointer_set_destroy (fld
.pset
);
5213 VEC_free (tree
, heap
, fld
.worklist
);
5214 VEC_free (tree
, heap
, fld
.decls
);
5215 VEC_free (tree
, heap
, fld
.types
);
5219 /* Free resources that are used by FE but are not needed once they are done. */
5222 free_lang_data (void)
5226 /* If we are the LTO frontend we have freed lang-specific data already. */
5228 || !flag_generate_lto
)
5231 /* Allocate and assign alias sets to the standard integer types
5232 while the slots are still in the way the frontends generated them. */
5233 for (i
= 0; i
< itk_none
; ++i
)
5234 if (integer_types
[i
])
5235 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5237 /* Traverse the IL resetting language specific information for
5238 operands, expressions, etc. */
5239 free_lang_data_in_cgraph ();
5241 /* Create gimple variants for common types. */
5242 ptrdiff_type_node
= integer_type_node
;
5243 fileptr_type_node
= ptr_type_node
;
5245 /* Reset some langhooks. Do not reset types_compatible_p, it may
5246 still be used indirectly via the get_alias_set langhook. */
5247 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5248 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5249 /* We do not want the default decl_assembler_name implementation,
5250 rather if we have fixed everything we want a wrapper around it
5251 asserting that all non-local symbols already got their assembler
5252 name and only produce assembler names for local symbols. Or rather
5253 make sure we never call decl_assembler_name on local symbols and
5254 devise a separate, middle-end private scheme for it. */
5256 /* Reset diagnostic machinery. */
5257 tree_diagnostics_defaults (global_dc
);
5263 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5267 "*free_lang_data", /* name */
5269 free_lang_data
, /* execute */
5272 0, /* static_pass_number */
5273 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5274 0, /* properties_required */
5275 0, /* properties_provided */
5276 0, /* properties_destroyed */
5277 0, /* todo_flags_start */
5278 TODO_ggc_collect
/* todo_flags_finish */
5282 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5283 ATTR_NAME. Also used internally by remove_attribute(). */
5285 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5287 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5289 if (ident_len
== attr_len
)
5291 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5294 else if (ident_len
== attr_len
+ 4)
5296 /* There is the possibility that ATTR is 'text' and IDENT is
5298 const char *p
= IDENTIFIER_POINTER (ident
);
5299 if (p
[0] == '_' && p
[1] == '_'
5300 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5301 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5308 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5309 of ATTR_NAME, and LIST is not NULL_TREE. */
5311 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5315 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5317 if (ident_len
== attr_len
)
5319 if (strcmp (attr_name
, IDENTIFIER_POINTER (TREE_PURPOSE (list
))) == 0)
5322 /* TODO: If we made sure that attributes were stored in the
5323 canonical form without '__...__' (ie, as in 'text' as opposed
5324 to '__text__') then we could avoid the following case. */
5325 else if (ident_len
== attr_len
+ 4)
5327 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5328 if (p
[0] == '_' && p
[1] == '_'
5329 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5330 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5333 list
= TREE_CHAIN (list
);
5339 /* A variant of lookup_attribute() that can be used with an identifier
5340 as the first argument, and where the identifier can be either
5341 'text' or '__text__'.
5343 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5344 return a pointer to the attribute's list element if the attribute
5345 is part of the list, or NULL_TREE if not found. If the attribute
5346 appears more than once, this only returns the first occurrence; the
5347 TREE_CHAIN of the return value should be passed back in if further
5348 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5349 can be in the form 'text' or '__text__'. */
5351 lookup_ident_attribute (tree attr_identifier
, tree list
)
5353 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5357 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list
)) == IDENTIFIER_NODE
);
5359 /* Identifiers can be compared directly for equality. */
5360 if (attr_identifier
== TREE_PURPOSE (list
))
5363 /* If they are not equal, they may still be one in the form
5364 'text' while the other one is in the form '__text__'. TODO:
5365 If we were storing attributes in normalized 'text' form, then
5366 this could all go away and we could take full advantage of
5367 the fact that we're comparing identifiers. :-) */
5369 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5370 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5372 if (ident_len
== attr_len
+ 4)
5374 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5375 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5376 if (p
[0] == '_' && p
[1] == '_'
5377 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5378 && strncmp (q
, p
+ 2, attr_len
) == 0)
5381 else if (ident_len
+ 4 == attr_len
)
5383 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5384 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5385 if (q
[0] == '_' && q
[1] == '_'
5386 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5387 && strncmp (q
+ 2, p
, ident_len
) == 0)
5391 list
= TREE_CHAIN (list
);
5397 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5401 remove_attribute (const char *attr_name
, tree list
)
5404 size_t attr_len
= strlen (attr_name
);
5406 gcc_checking_assert (attr_name
[0] != '_');
5408 for (p
= &list
; *p
; )
5411 /* TODO: If we were storing attributes in normalized form, here
5412 we could use a simple strcmp(). */
5413 if (private_is_attribute_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5414 *p
= TREE_CHAIN (l
);
5416 p
= &TREE_CHAIN (l
);
5422 /* Return an attribute list that is the union of a1 and a2. */
5425 merge_attributes (tree a1
, tree a2
)
5429 /* Either one unset? Take the set one. */
5431 if ((attributes
= a1
) == 0)
5434 /* One that completely contains the other? Take it. */
5436 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5438 if (attribute_list_contained (a2
, a1
))
5442 /* Pick the longest list, and hang on the other list. */
5444 if (list_length (a1
) < list_length (a2
))
5445 attributes
= a2
, a2
= a1
;
5447 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5450 for (a
= lookup_ident_attribute (TREE_PURPOSE (a2
), attributes
);
5451 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5452 a
= lookup_ident_attribute (TREE_PURPOSE (a2
), TREE_CHAIN (a
)))
5456 a1
= copy_node (a2
);
5457 TREE_CHAIN (a1
) = attributes
;
5466 /* Given types T1 and T2, merge their attributes and return
5470 merge_type_attributes (tree t1
, tree t2
)
5472 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5473 TYPE_ATTRIBUTES (t2
));
5476 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5480 merge_decl_attributes (tree olddecl
, tree newdecl
)
5482 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5483 DECL_ATTRIBUTES (newdecl
));
5486 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5488 /* Specialization of merge_decl_attributes for various Windows targets.
5490 This handles the following situation:
5492 __declspec (dllimport) int foo;
5495 The second instance of `foo' nullifies the dllimport. */
5498 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5501 int delete_dllimport_p
= 1;
5503 /* What we need to do here is remove from `old' dllimport if it doesn't
5504 appear in `new'. dllimport behaves like extern: if a declaration is
5505 marked dllimport and a definition appears later, then the object
5506 is not dllimport'd. We also remove a `new' dllimport if the old list
5507 contains dllexport: dllexport always overrides dllimport, regardless
5508 of the order of declaration. */
5509 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5510 delete_dllimport_p
= 0;
5511 else if (DECL_DLLIMPORT_P (new_tree
)
5512 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5514 DECL_DLLIMPORT_P (new_tree
) = 0;
5515 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5516 "dllimport ignored", new_tree
);
5518 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5520 /* Warn about overriding a symbol that has already been used, e.g.:
5521 extern int __attribute__ ((dllimport)) foo;
5522 int* bar () {return &foo;}
5525 if (TREE_USED (old
))
5527 warning (0, "%q+D redeclared without dllimport attribute "
5528 "after being referenced with dll linkage", new_tree
);
5529 /* If we have used a variable's address with dllimport linkage,
5530 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5531 decl may already have had TREE_CONSTANT computed.
5532 We still remove the attribute so that assembler code refers
5533 to '&foo rather than '_imp__foo'. */
5534 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5535 DECL_DLLIMPORT_P (new_tree
) = 1;
5538 /* Let an inline definition silently override the external reference,
5539 but otherwise warn about attribute inconsistency. */
5540 else if (TREE_CODE (new_tree
) == VAR_DECL
5541 || !DECL_DECLARED_INLINE_P (new_tree
))
5542 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5543 "previous dllimport ignored", new_tree
);
5546 delete_dllimport_p
= 0;
5548 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5550 if (delete_dllimport_p
)
5551 a
= remove_attribute ("dllimport", a
);
5556 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5557 struct attribute_spec.handler. */
5560 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5566 /* These attributes may apply to structure and union types being created,
5567 but otherwise should pass to the declaration involved. */
5570 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5571 | (int) ATTR_FLAG_ARRAY_NEXT
))
5573 *no_add_attrs
= true;
5574 return tree_cons (name
, args
, NULL_TREE
);
5576 if (TREE_CODE (node
) == RECORD_TYPE
5577 || TREE_CODE (node
) == UNION_TYPE
)
5579 node
= TYPE_NAME (node
);
5585 warning (OPT_Wattributes
, "%qE attribute ignored",
5587 *no_add_attrs
= true;
5592 if (TREE_CODE (node
) != FUNCTION_DECL
5593 && TREE_CODE (node
) != VAR_DECL
5594 && TREE_CODE (node
) != TYPE_DECL
)
5596 *no_add_attrs
= true;
5597 warning (OPT_Wattributes
, "%qE attribute ignored",
5602 if (TREE_CODE (node
) == TYPE_DECL
5603 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5604 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5606 *no_add_attrs
= true;
5607 warning (OPT_Wattributes
, "%qE attribute ignored",
5612 is_dllimport
= is_attribute_p ("dllimport", name
);
5614 /* Report error on dllimport ambiguities seen now before they cause
5618 /* Honor any target-specific overrides. */
5619 if (!targetm
.valid_dllimport_attribute_p (node
))
5620 *no_add_attrs
= true;
5622 else if (TREE_CODE (node
) == FUNCTION_DECL
5623 && DECL_DECLARED_INLINE_P (node
))
5625 warning (OPT_Wattributes
, "inline function %q+D declared as "
5626 " dllimport: attribute ignored", node
);
5627 *no_add_attrs
= true;
5629 /* Like MS, treat definition of dllimported variables and
5630 non-inlined functions on declaration as syntax errors. */
5631 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5633 error ("function %q+D definition is marked dllimport", node
);
5634 *no_add_attrs
= true;
5637 else if (TREE_CODE (node
) == VAR_DECL
)
5639 if (DECL_INITIAL (node
))
5641 error ("variable %q+D definition is marked dllimport",
5643 *no_add_attrs
= true;
5646 /* `extern' needn't be specified with dllimport.
5647 Specify `extern' now and hope for the best. Sigh. */
5648 DECL_EXTERNAL (node
) = 1;
5649 /* Also, implicitly give dllimport'd variables declared within
5650 a function global scope, unless declared static. */
5651 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5652 TREE_PUBLIC (node
) = 1;
5655 if (*no_add_attrs
== false)
5656 DECL_DLLIMPORT_P (node
) = 1;
5658 else if (TREE_CODE (node
) == FUNCTION_DECL
5659 && DECL_DECLARED_INLINE_P (node
)
5660 && flag_keep_inline_dllexport
)
5661 /* An exported function, even if inline, must be emitted. */
5662 DECL_EXTERNAL (node
) = 0;
5664 /* Report error if symbol is not accessible at global scope. */
5665 if (!TREE_PUBLIC (node
)
5666 && (TREE_CODE (node
) == VAR_DECL
5667 || TREE_CODE (node
) == FUNCTION_DECL
))
5669 error ("external linkage required for symbol %q+D because of "
5670 "%qE attribute", node
, name
);
5671 *no_add_attrs
= true;
5674 /* A dllexport'd entity must have default visibility so that other
5675 program units (shared libraries or the main executable) can see
5676 it. A dllimport'd entity must have default visibility so that
5677 the linker knows that undefined references within this program
5678 unit can be resolved by the dynamic linker. */
5681 if (DECL_VISIBILITY_SPECIFIED (node
)
5682 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5683 error ("%qE implies default visibility, but %qD has already "
5684 "been declared with a different visibility",
5686 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5687 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5693 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5695 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5696 of the various TYPE_QUAL values. */
5699 set_type_quals (tree type
, int type_quals
)
5701 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5702 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5703 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5704 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5707 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5710 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5712 return (TYPE_QUALS (cand
) == type_quals
5713 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5714 /* Apparently this is needed for Objective-C. */
5715 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5716 /* Check alignment. */
5717 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5718 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5719 TYPE_ATTRIBUTES (base
)));
5722 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5725 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5727 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5728 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5729 /* Apparently this is needed for Objective-C. */
5730 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5731 /* Check alignment. */
5732 && TYPE_ALIGN (cand
) == align
5733 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5734 TYPE_ATTRIBUTES (base
)));
5737 /* Return a version of the TYPE, qualified as indicated by the
5738 TYPE_QUALS, if one exists. If no qualified version exists yet,
5739 return NULL_TREE. */
5742 get_qualified_type (tree type
, int type_quals
)
5746 if (TYPE_QUALS (type
) == type_quals
)
5749 /* Search the chain of variants to see if there is already one there just
5750 like the one we need to have. If so, use that existing one. We must
5751 preserve the TYPE_NAME, since there is code that depends on this. */
5752 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5753 if (check_qualified_type (t
, type
, type_quals
))
5759 /* Like get_qualified_type, but creates the type if it does not
5760 exist. This function never returns NULL_TREE. */
5763 build_qualified_type (tree type
, int type_quals
)
5767 /* See if we already have the appropriate qualified variant. */
5768 t
= get_qualified_type (type
, type_quals
);
5770 /* If not, build it. */
5773 t
= build_variant_type_copy (type
);
5774 set_type_quals (t
, type_quals
);
5776 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5777 /* Propagate structural equality. */
5778 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5779 else if (TYPE_CANONICAL (type
) != type
)
5780 /* Build the underlying canonical type, since it is different
5782 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5785 /* T is its own canonical type. */
5786 TYPE_CANONICAL (t
) = t
;
5793 /* Create a variant of type T with alignment ALIGN. */
5796 build_aligned_type (tree type
, unsigned int align
)
5800 if (TYPE_PACKED (type
)
5801 || TYPE_ALIGN (type
) == align
)
5804 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5805 if (check_aligned_type (t
, type
, align
))
5808 t
= build_variant_type_copy (type
);
5809 TYPE_ALIGN (t
) = align
;
5814 /* Create a new distinct copy of TYPE. The new type is made its own
5815 MAIN_VARIANT. If TYPE requires structural equality checks, the
5816 resulting type requires structural equality checks; otherwise, its
5817 TYPE_CANONICAL points to itself. */
5820 build_distinct_type_copy (tree type
)
5822 tree t
= copy_node (type
);
5824 TYPE_POINTER_TO (t
) = 0;
5825 TYPE_REFERENCE_TO (t
) = 0;
5827 /* Set the canonical type either to a new equivalence class, or
5828 propagate the need for structural equality checks. */
5829 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5830 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5832 TYPE_CANONICAL (t
) = t
;
5834 /* Make it its own variant. */
5835 TYPE_MAIN_VARIANT (t
) = t
;
5836 TYPE_NEXT_VARIANT (t
) = 0;
5838 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5839 whose TREE_TYPE is not t. This can also happen in the Ada
5840 frontend when using subtypes. */
5845 /* Create a new variant of TYPE, equivalent but distinct. This is so
5846 the caller can modify it. TYPE_CANONICAL for the return type will
5847 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5848 are considered equal by the language itself (or that both types
5849 require structural equality checks). */
5852 build_variant_type_copy (tree type
)
5854 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5856 t
= build_distinct_type_copy (type
);
5858 /* Since we're building a variant, assume that it is a non-semantic
5859 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5860 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5862 /* Add the new type to the chain of variants of TYPE. */
5863 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5864 TYPE_NEXT_VARIANT (m
) = t
;
5865 TYPE_MAIN_VARIANT (t
) = m
;
5870 /* Return true if the from tree in both tree maps are equal. */
5873 tree_map_base_eq (const void *va
, const void *vb
)
5875 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5876 *const b
= (const struct tree_map_base
*) vb
;
5877 return (a
->from
== b
->from
);
5880 /* Hash a from tree in a tree_base_map. */
5883 tree_map_base_hash (const void *item
)
5885 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5888 /* Return true if this tree map structure is marked for garbage collection
5889 purposes. We simply return true if the from tree is marked, so that this
5890 structure goes away when the from tree goes away. */
5893 tree_map_base_marked_p (const void *p
)
5895 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5898 /* Hash a from tree in a tree_map. */
5901 tree_map_hash (const void *item
)
5903 return (((const struct tree_map
*) item
)->hash
);
5906 /* Hash a from tree in a tree_decl_map. */
5909 tree_decl_map_hash (const void *item
)
5911 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5914 /* Return the initialization priority for DECL. */
5917 decl_init_priority_lookup (tree decl
)
5919 struct tree_priority_map
*h
;
5920 struct tree_map_base in
;
5922 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5924 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5925 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5928 /* Return the finalization priority for DECL. */
5931 decl_fini_priority_lookup (tree decl
)
5933 struct tree_priority_map
*h
;
5934 struct tree_map_base in
;
5936 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5938 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5939 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5942 /* Return the initialization and finalization priority information for
5943 DECL. If there is no previous priority information, a freshly
5944 allocated structure is returned. */
5946 static struct tree_priority_map
*
5947 decl_priority_info (tree decl
)
5949 struct tree_priority_map in
;
5950 struct tree_priority_map
*h
;
5953 in
.base
.from
= decl
;
5954 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5955 h
= (struct tree_priority_map
*) *loc
;
5958 h
= ggc_alloc_cleared_tree_priority_map ();
5960 h
->base
.from
= decl
;
5961 h
->init
= DEFAULT_INIT_PRIORITY
;
5962 h
->fini
= DEFAULT_INIT_PRIORITY
;
5968 /* Set the initialization priority for DECL to PRIORITY. */
5971 decl_init_priority_insert (tree decl
, priority_type priority
)
5973 struct tree_priority_map
*h
;
5975 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5976 if (priority
== DEFAULT_INIT_PRIORITY
)
5978 h
= decl_priority_info (decl
);
5982 /* Set the finalization priority for DECL to PRIORITY. */
5985 decl_fini_priority_insert (tree decl
, priority_type priority
)
5987 struct tree_priority_map
*h
;
5989 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5990 if (priority
== DEFAULT_INIT_PRIORITY
)
5992 h
= decl_priority_info (decl
);
5996 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5999 print_debug_expr_statistics (void)
6001 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6002 (long) htab_size (debug_expr_for_decl
),
6003 (long) htab_elements (debug_expr_for_decl
),
6004 htab_collisions (debug_expr_for_decl
));
6007 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6010 print_value_expr_statistics (void)
6012 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6013 (long) htab_size (value_expr_for_decl
),
6014 (long) htab_elements (value_expr_for_decl
),
6015 htab_collisions (value_expr_for_decl
));
6018 /* Lookup a debug expression for FROM, and return it if we find one. */
6021 decl_debug_expr_lookup (tree from
)
6023 struct tree_decl_map
*h
, in
;
6024 in
.base
.from
= from
;
6026 h
= (struct tree_decl_map
*)
6027 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6033 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6036 decl_debug_expr_insert (tree from
, tree to
)
6038 struct tree_decl_map
*h
;
6041 h
= ggc_alloc_tree_decl_map ();
6042 h
->base
.from
= from
;
6044 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6046 *(struct tree_decl_map
**) loc
= h
;
6049 /* Lookup a value expression for FROM, and return it if we find one. */
6052 decl_value_expr_lookup (tree from
)
6054 struct tree_decl_map
*h
, in
;
6055 in
.base
.from
= from
;
6057 h
= (struct tree_decl_map
*)
6058 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6064 /* Insert a mapping FROM->TO in the value expression hashtable. */
6067 decl_value_expr_insert (tree from
, tree to
)
6069 struct tree_decl_map
*h
;
6072 h
= ggc_alloc_tree_decl_map ();
6073 h
->base
.from
= from
;
6075 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6077 *(struct tree_decl_map
**) loc
= h
;
6080 /* Lookup a vector of debug arguments for FROM, and return it if we
6084 decl_debug_args_lookup (tree from
)
6086 struct tree_vec_map
*h
, in
;
6088 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6090 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6091 in
.base
.from
= from
;
6092 h
= (struct tree_vec_map
*)
6093 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6099 /* Insert a mapping FROM->empty vector of debug arguments in the value
6100 expression hashtable. */
6103 decl_debug_args_insert (tree from
)
6105 struct tree_vec_map
*h
;
6108 if (DECL_HAS_DEBUG_ARGS_P (from
))
6109 return decl_debug_args_lookup (from
);
6110 if (debug_args_for_decl
== NULL
)
6111 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6112 tree_vec_map_eq
, 0);
6113 h
= ggc_alloc_tree_vec_map ();
6114 h
->base
.from
= from
;
6116 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6118 *(struct tree_vec_map
**) loc
= h
;
6119 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6123 /* Hashing of types so that we don't make duplicates.
6124 The entry point is `type_hash_canon'. */
6126 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6127 with types in the TREE_VALUE slots), by adding the hash codes
6128 of the individual types. */
6131 type_hash_list (const_tree list
, hashval_t hashcode
)
6135 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6136 if (TREE_VALUE (tail
) != error_mark_node
)
6137 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6143 /* These are the Hashtable callback functions. */
6145 /* Returns true iff the types are equivalent. */
6148 type_hash_eq (const void *va
, const void *vb
)
6150 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6151 *const b
= (const struct type_hash
*) vb
;
6153 /* First test the things that are the same for all types. */
6154 if (a
->hash
!= b
->hash
6155 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6156 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6157 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6158 TYPE_ATTRIBUTES (b
->type
))
6159 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6160 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6163 /* Be careful about comparing arrays before and after the element type
6164 has been completed; don't compare TYPE_ALIGN unless both types are
6166 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6167 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6168 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6171 switch (TREE_CODE (a
->type
))
6176 case REFERENCE_TYPE
:
6180 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6183 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6184 && !(TYPE_VALUES (a
->type
)
6185 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6186 && TYPE_VALUES (b
->type
)
6187 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6188 && type_list_equal (TYPE_VALUES (a
->type
),
6189 TYPE_VALUES (b
->type
))))
6192 /* ... fall through ... */
6197 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6198 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6199 TYPE_MAX_VALUE (b
->type
)))
6200 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6201 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6202 TYPE_MIN_VALUE (b
->type
))));
6204 case FIXED_POINT_TYPE
:
6205 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6208 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6211 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6212 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6213 || (TYPE_ARG_TYPES (a
->type
)
6214 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6215 && TYPE_ARG_TYPES (b
->type
)
6216 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6217 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6218 TYPE_ARG_TYPES (b
->type
)))))
6222 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6226 case QUAL_UNION_TYPE
:
6227 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6228 || (TYPE_FIELDS (a
->type
)
6229 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6230 && TYPE_FIELDS (b
->type
)
6231 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6232 && type_list_equal (TYPE_FIELDS (a
->type
),
6233 TYPE_FIELDS (b
->type
))));
6236 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6237 || (TYPE_ARG_TYPES (a
->type
)
6238 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6239 && TYPE_ARG_TYPES (b
->type
)
6240 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6241 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6242 TYPE_ARG_TYPES (b
->type
))))
6250 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6251 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6256 /* Return the cached hash value. */
6259 type_hash_hash (const void *item
)
6261 return ((const struct type_hash
*) item
)->hash
;
6264 /* Look in the type hash table for a type isomorphic to TYPE.
6265 If one is found, return it. Otherwise return 0. */
6268 type_hash_lookup (hashval_t hashcode
, tree type
)
6270 struct type_hash
*h
, in
;
6272 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6273 must call that routine before comparing TYPE_ALIGNs. */
6279 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6286 /* Add an entry to the type-hash-table
6287 for a type TYPE whose hash code is HASHCODE. */
6290 type_hash_add (hashval_t hashcode
, tree type
)
6292 struct type_hash
*h
;
6295 h
= ggc_alloc_type_hash ();
6298 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6302 /* Given TYPE, and HASHCODE its hash code, return the canonical
6303 object for an identical type if one already exists.
6304 Otherwise, return TYPE, and record it as the canonical object.
6306 To use this function, first create a type of the sort you want.
6307 Then compute its hash code from the fields of the type that
6308 make it different from other similar types.
6309 Then call this function and use the value. */
6312 type_hash_canon (unsigned int hashcode
, tree type
)
6316 /* The hash table only contains main variants, so ensure that's what we're
6318 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6320 /* See if the type is in the hash table already. If so, return it.
6321 Otherwise, add the type. */
6322 t1
= type_hash_lookup (hashcode
, type
);
6325 #ifdef GATHER_STATISTICS
6326 tree_code_counts
[(int) TREE_CODE (type
)]--;
6327 tree_node_counts
[(int) t_kind
]--;
6328 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6334 type_hash_add (hashcode
, type
);
6339 /* See if the data pointed to by the type hash table is marked. We consider
6340 it marked if the type is marked or if a debug type number or symbol
6341 table entry has been made for the type. */
6344 type_hash_marked_p (const void *p
)
6346 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6348 return ggc_marked_p (type
);
6352 print_type_hash_statistics (void)
6354 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6355 (long) htab_size (type_hash_table
),
6356 (long) htab_elements (type_hash_table
),
6357 htab_collisions (type_hash_table
));
6360 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6361 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6362 by adding the hash codes of the individual attributes. */
6365 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6369 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6370 /* ??? Do we want to add in TREE_VALUE too? */
6371 hashcode
= iterative_hash_object
6372 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6376 /* Given two lists of attributes, return true if list l2 is
6377 equivalent to l1. */
6380 attribute_list_equal (const_tree l1
, const_tree l2
)
6385 return attribute_list_contained (l1
, l2
)
6386 && attribute_list_contained (l2
, l1
);
6389 /* Given two lists of attributes, return true if list L2 is
6390 completely contained within L1. */
6391 /* ??? This would be faster if attribute names were stored in a canonicalized
6392 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6393 must be used to show these elements are equivalent (which they are). */
6394 /* ??? It's not clear that attributes with arguments will always be handled
6398 attribute_list_contained (const_tree l1
, const_tree l2
)
6402 /* First check the obvious, maybe the lists are identical. */
6406 /* Maybe the lists are similar. */
6407 for (t1
= l1
, t2
= l2
;
6409 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6410 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6411 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6414 /* Maybe the lists are equal. */
6415 if (t1
== 0 && t2
== 0)
6418 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6421 /* This CONST_CAST is okay because lookup_attribute does not
6422 modify its argument and the return value is assigned to a
6424 for (attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), CONST_CAST_TREE(l1
));
6425 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6426 attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), TREE_CHAIN (attr
)))
6429 if (attr
== NULL_TREE
)
6436 /* Given two lists of types
6437 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6438 return 1 if the lists contain the same types in the same order.
6439 Also, the TREE_PURPOSEs must match. */
6442 type_list_equal (const_tree l1
, const_tree l2
)
6446 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6447 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6448 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6449 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6450 && (TREE_TYPE (TREE_PURPOSE (t1
))
6451 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6457 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6458 given by TYPE. If the argument list accepts variable arguments,
6459 then this function counts only the ordinary arguments. */
6462 type_num_arguments (const_tree type
)
6467 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6468 /* If the function does not take a variable number of arguments,
6469 the last element in the list will have type `void'. */
6470 if (VOID_TYPE_P (TREE_VALUE (t
)))
6478 /* Nonzero if integer constants T1 and T2
6479 represent the same constant value. */
6482 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6487 if (t1
== 0 || t2
== 0)
6490 if (TREE_CODE (t1
) == INTEGER_CST
6491 && TREE_CODE (t2
) == INTEGER_CST
6492 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6493 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6499 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6500 The precise way of comparison depends on their data type. */
6503 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6508 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6510 int t1_sgn
= tree_int_cst_sgn (t1
);
6511 int t2_sgn
= tree_int_cst_sgn (t2
);
6513 if (t1_sgn
< t2_sgn
)
6515 else if (t1_sgn
> t2_sgn
)
6517 /* Otherwise, both are non-negative, so we compare them as
6518 unsigned just in case one of them would overflow a signed
6521 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6522 return INT_CST_LT (t1
, t2
);
6524 return INT_CST_LT_UNSIGNED (t1
, t2
);
6527 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6530 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6532 if (tree_int_cst_lt (t1
, t2
))
6534 else if (tree_int_cst_lt (t2
, t1
))
6540 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6541 the host. If POS is zero, the value can be represented in a single
6542 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6543 be represented in a single unsigned HOST_WIDE_INT. */
6546 host_integerp (const_tree t
, int pos
)
6551 return (TREE_CODE (t
) == INTEGER_CST
6552 && ((TREE_INT_CST_HIGH (t
) == 0
6553 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6554 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6555 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6556 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6557 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6560 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6561 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6562 be non-negative. We must be able to satisfy the above conditions. */
6565 tree_low_cst (const_tree t
, int pos
)
6567 gcc_assert (host_integerp (t
, pos
));
6568 return TREE_INT_CST_LOW (t
);
6571 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6572 kind INTEGER_CST. This makes sure to properly sign-extend the
6576 size_low_cst (const_tree t
)
6578 double_int d
= tree_to_double_int (t
);
6579 return double_int_sext (d
, TYPE_PRECISION (TREE_TYPE (t
))).low
;
6582 /* Return the most significant (sign) bit of T. */
6585 tree_int_cst_sign_bit (const_tree t
)
6587 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6588 unsigned HOST_WIDE_INT w
;
6590 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6591 w
= TREE_INT_CST_LOW (t
);
6594 w
= TREE_INT_CST_HIGH (t
);
6595 bitno
-= HOST_BITS_PER_WIDE_INT
;
6598 return (w
>> bitno
) & 1;
6601 /* Return an indication of the sign of the integer constant T.
6602 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6603 Note that -1 will never be returned if T's type is unsigned. */
6606 tree_int_cst_sgn (const_tree t
)
6608 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6610 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6612 else if (TREE_INT_CST_HIGH (t
) < 0)
6618 /* Return the minimum number of bits needed to represent VALUE in a
6619 signed or unsigned type, UNSIGNEDP says which. */
6622 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6626 /* If the value is negative, compute its negative minus 1. The latter
6627 adjustment is because the absolute value of the largest negative value
6628 is one larger than the largest positive value. This is equivalent to
6629 a bit-wise negation, so use that operation instead. */
6631 if (tree_int_cst_sgn (value
) < 0)
6632 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6634 /* Return the number of bits needed, taking into account the fact
6635 that we need one more bit for a signed than unsigned type. */
6637 if (integer_zerop (value
))
6640 log
= tree_floor_log2 (value
);
6642 return log
+ 1 + !unsignedp
;
6645 /* Compare two constructor-element-type constants. Return 1 if the lists
6646 are known to be equal; otherwise return 0. */
6649 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6651 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6653 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6656 l1
= TREE_CHAIN (l1
);
6657 l2
= TREE_CHAIN (l2
);
6663 /* Return truthvalue of whether T1 is the same tree structure as T2.
6664 Return 1 if they are the same.
6665 Return 0 if they are understandably different.
6666 Return -1 if either contains tree structure not understood by
6670 simple_cst_equal (const_tree t1
, const_tree t2
)
6672 enum tree_code code1
, code2
;
6678 if (t1
== 0 || t2
== 0)
6681 code1
= TREE_CODE (t1
);
6682 code2
= TREE_CODE (t2
);
6684 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6686 if (CONVERT_EXPR_CODE_P (code2
)
6687 || code2
== NON_LVALUE_EXPR
)
6688 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6690 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6693 else if (CONVERT_EXPR_CODE_P (code2
)
6694 || code2
== NON_LVALUE_EXPR
)
6695 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6703 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6704 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6707 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6710 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6713 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6714 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6715 TREE_STRING_LENGTH (t1
)));
6719 unsigned HOST_WIDE_INT idx
;
6720 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6721 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6723 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6726 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6727 /* ??? Should we handle also fields here? */
6728 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6729 VEC_index (constructor_elt
, v2
, idx
)->value
))
6735 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6738 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6741 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6744 const_tree arg1
, arg2
;
6745 const_call_expr_arg_iterator iter1
, iter2
;
6746 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6747 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6749 arg1
= next_const_call_expr_arg (&iter1
),
6750 arg2
= next_const_call_expr_arg (&iter2
))
6752 cmp
= simple_cst_equal (arg1
, arg2
);
6756 return arg1
== arg2
;
6760 /* Special case: if either target is an unallocated VAR_DECL,
6761 it means that it's going to be unified with whatever the
6762 TARGET_EXPR is really supposed to initialize, so treat it
6763 as being equivalent to anything. */
6764 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6765 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6766 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6767 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6768 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6769 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6772 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6777 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6779 case WITH_CLEANUP_EXPR
:
6780 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6784 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6787 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6788 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6802 /* This general rule works for most tree codes. All exceptions should be
6803 handled above. If this is a language-specific tree code, we can't
6804 trust what might be in the operand, so say we don't know
6806 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6809 switch (TREE_CODE_CLASS (code1
))
6813 case tcc_comparison
:
6814 case tcc_expression
:
6818 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6820 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6832 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6833 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6834 than U, respectively. */
6837 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6839 if (tree_int_cst_sgn (t
) < 0)
6841 else if (TREE_INT_CST_HIGH (t
) != 0)
6843 else if (TREE_INT_CST_LOW (t
) == u
)
6845 else if (TREE_INT_CST_LOW (t
) < u
)
6851 /* Return true if SIZE represents a constant size that is in bounds of
6852 what the middle-end and the backend accepts (covering not more than
6853 half of the address-space). */
6856 valid_constant_size_p (const_tree size
)
6858 if (! host_integerp (size
, 1)
6859 || TREE_OVERFLOW (size
)
6860 || tree_int_cst_sign_bit (size
) != 0)
6865 /* Return true if CODE represents an associative tree code. Otherwise
6868 associative_tree_code (enum tree_code code
)
6887 /* Return true if CODE represents a commutative tree code. Otherwise
6890 commutative_tree_code (enum tree_code code
)
6903 case UNORDERED_EXPR
:
6907 case TRUTH_AND_EXPR
:
6908 case TRUTH_XOR_EXPR
:
6918 /* Return true if CODE represents a ternary tree code for which the
6919 first two operands are commutative. Otherwise return false. */
6921 commutative_ternary_tree_code (enum tree_code code
)
6925 case WIDEN_MULT_PLUS_EXPR
:
6926 case WIDEN_MULT_MINUS_EXPR
:
6935 /* Generate a hash value for an expression. This can be used iteratively
6936 by passing a previous result as the VAL argument.
6938 This function is intended to produce the same hash for expressions which
6939 would compare equal using operand_equal_p. */
6942 iterative_hash_expr (const_tree t
, hashval_t val
)
6945 enum tree_code code
;
6949 return iterative_hash_hashval_t (0, val
);
6951 code
= TREE_CODE (t
);
6955 /* Alas, constants aren't shared, so we can't rely on pointer
6958 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6959 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6962 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6964 return iterative_hash_hashval_t (val2
, val
);
6968 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6970 return iterative_hash_hashval_t (val2
, val
);
6973 return iterative_hash (TREE_STRING_POINTER (t
),
6974 TREE_STRING_LENGTH (t
), val
);
6976 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6977 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6981 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
6982 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
6986 /* We can just compare by pointer. */
6987 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6988 case PLACEHOLDER_EXPR
:
6989 /* The node itself doesn't matter. */
6992 /* A list of expressions, for a CALL_EXPR or as the elements of a
6994 for (; t
; t
= TREE_CHAIN (t
))
6995 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6999 unsigned HOST_WIDE_INT idx
;
7001 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7003 val
= iterative_hash_expr (field
, val
);
7004 val
= iterative_hash_expr (value
, val
);
7010 /* The type of the second operand is relevant, except for
7011 its top-level qualifiers. */
7012 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7014 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7016 /* We could use the standard hash computation from this point
7018 val
= iterative_hash_object (code
, val
);
7019 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7020 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7024 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7025 Otherwise nodes that compare equal according to operand_equal_p might
7026 get different hash codes. However, don't do this for machine specific
7027 or front end builtins, since the function code is overloaded in those
7029 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7030 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7032 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7033 code
= TREE_CODE (t
);
7037 tclass
= TREE_CODE_CLASS (code
);
7039 if (tclass
== tcc_declaration
)
7041 /* DECL's have a unique ID */
7042 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7046 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7048 val
= iterative_hash_object (code
, val
);
7050 /* Don't hash the type, that can lead to having nodes which
7051 compare equal according to operand_equal_p, but which
7052 have different hash codes. */
7053 if (CONVERT_EXPR_CODE_P (code
)
7054 || code
== NON_LVALUE_EXPR
)
7056 /* Make sure to include signness in the hash computation. */
7057 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7058 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7061 else if (commutative_tree_code (code
))
7063 /* It's a commutative expression. We want to hash it the same
7064 however it appears. We do this by first hashing both operands
7065 and then rehashing based on the order of their independent
7067 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7068 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7072 t
= one
, one
= two
, two
= t
;
7074 val
= iterative_hash_hashval_t (one
, val
);
7075 val
= iterative_hash_hashval_t (two
, val
);
7078 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7079 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7085 /* Generate a hash value for a pair of expressions. This can be used
7086 iteratively by passing a previous result as the VAL argument.
7088 The same hash value is always returned for a given pair of expressions,
7089 regardless of the order in which they are presented. This is useful in
7090 hashing the operands of commutative functions. */
7093 iterative_hash_exprs_commutative (const_tree t1
,
7094 const_tree t2
, hashval_t val
)
7096 hashval_t one
= iterative_hash_expr (t1
, 0);
7097 hashval_t two
= iterative_hash_expr (t2
, 0);
7101 t
= one
, one
= two
, two
= t
;
7102 val
= iterative_hash_hashval_t (one
, val
);
7103 val
= iterative_hash_hashval_t (two
, val
);
7108 /* Constructors for pointer, array and function types.
7109 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7110 constructed by language-dependent code, not here.) */
7112 /* Construct, lay out and return the type of pointers to TO_TYPE with
7113 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7114 reference all of memory. If such a type has already been
7115 constructed, reuse it. */
7118 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7123 if (to_type
== error_mark_node
)
7124 return error_mark_node
;
7126 /* If the pointed-to type has the may_alias attribute set, force
7127 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7128 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7129 can_alias_all
= true;
7131 /* In some cases, languages will have things that aren't a POINTER_TYPE
7132 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7133 In that case, return that type without regard to the rest of our
7136 ??? This is a kludge, but consistent with the way this function has
7137 always operated and there doesn't seem to be a good way to avoid this
7139 if (TYPE_POINTER_TO (to_type
) != 0
7140 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7141 return TYPE_POINTER_TO (to_type
);
7143 /* First, if we already have a type for pointers to TO_TYPE and it's
7144 the proper mode, use it. */
7145 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7146 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7149 t
= make_node (POINTER_TYPE
);
7151 TREE_TYPE (t
) = to_type
;
7152 SET_TYPE_MODE (t
, mode
);
7153 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7154 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7155 TYPE_POINTER_TO (to_type
) = t
;
7157 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7158 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7159 else if (TYPE_CANONICAL (to_type
) != to_type
)
7161 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7162 mode
, can_alias_all
);
7164 /* Lay out the type. This function has many callers that are concerned
7165 with expression-construction, and this simplifies them all. */
7171 /* By default build pointers in ptr_mode. */
7174 build_pointer_type (tree to_type
)
7176 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7177 : TYPE_ADDR_SPACE (to_type
);
7178 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7179 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7182 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7185 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7190 if (to_type
== error_mark_node
)
7191 return error_mark_node
;
7193 /* If the pointed-to type has the may_alias attribute set, force
7194 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7195 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7196 can_alias_all
= true;
7198 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7199 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7200 In that case, return that type without regard to the rest of our
7203 ??? This is a kludge, but consistent with the way this function has
7204 always operated and there doesn't seem to be a good way to avoid this
7206 if (TYPE_REFERENCE_TO (to_type
) != 0
7207 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7208 return TYPE_REFERENCE_TO (to_type
);
7210 /* First, if we already have a type for pointers to TO_TYPE and it's
7211 the proper mode, use it. */
7212 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7213 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7216 t
= make_node (REFERENCE_TYPE
);
7218 TREE_TYPE (t
) = to_type
;
7219 SET_TYPE_MODE (t
, mode
);
7220 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7221 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7222 TYPE_REFERENCE_TO (to_type
) = t
;
7224 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7225 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7226 else if (TYPE_CANONICAL (to_type
) != to_type
)
7228 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7229 mode
, can_alias_all
);
7237 /* Build the node for the type of references-to-TO_TYPE by default
7241 build_reference_type (tree to_type
)
7243 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7244 : TYPE_ADDR_SPACE (to_type
);
7245 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7246 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7249 /* Build a type that is compatible with t but has no cv quals anywhere
7252 const char *const *const * -> char ***. */
7255 build_type_no_quals (tree t
)
7257 switch (TREE_CODE (t
))
7260 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7262 TYPE_REF_CAN_ALIAS_ALL (t
));
7263 case REFERENCE_TYPE
:
7265 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7267 TYPE_REF_CAN_ALIAS_ALL (t
));
7269 return TYPE_MAIN_VARIANT (t
);
7273 #define MAX_INT_CACHED_PREC \
7274 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7275 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7277 /* Builds a signed or unsigned integer type of precision PRECISION.
7278 Used for C bitfields whose precision does not match that of
7279 built-in target types. */
7281 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7287 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7289 if (precision
<= MAX_INT_CACHED_PREC
)
7291 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7296 itype
= make_node (INTEGER_TYPE
);
7297 TYPE_PRECISION (itype
) = precision
;
7300 fixup_unsigned_type (itype
);
7302 fixup_signed_type (itype
);
7305 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7306 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7307 if (precision
<= MAX_INT_CACHED_PREC
)
7308 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7313 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7314 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7315 is true, reuse such a type that has already been constructed. */
7318 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7320 tree itype
= make_node (INTEGER_TYPE
);
7321 hashval_t hashcode
= 0;
7323 TREE_TYPE (itype
) = type
;
7325 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7326 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7328 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7329 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7330 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7331 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7332 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7333 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7338 if ((TYPE_MIN_VALUE (itype
)
7339 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7340 || (TYPE_MAX_VALUE (itype
)
7341 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7343 /* Since we cannot reliably merge this type, we need to compare it using
7344 structural equality checks. */
7345 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7349 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7350 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7351 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7352 itype
= type_hash_canon (hashcode
, itype
);
7357 /* Wrapper around build_range_type_1 with SHARED set to true. */
7360 build_range_type (tree type
, tree lowval
, tree highval
)
7362 return build_range_type_1 (type
, lowval
, highval
, true);
7365 /* Wrapper around build_range_type_1 with SHARED set to false. */
7368 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7370 return build_range_type_1 (type
, lowval
, highval
, false);
7373 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7374 MAXVAL should be the maximum value in the domain
7375 (one less than the length of the array).
7377 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7378 We don't enforce this limit, that is up to caller (e.g. language front end).
7379 The limit exists because the result is a signed type and we don't handle
7380 sizes that use more than one HOST_WIDE_INT. */
7383 build_index_type (tree maxval
)
7385 return build_range_type (sizetype
, size_zero_node
, maxval
);
7388 /* Return true if the debug information for TYPE, a subtype, should be emitted
7389 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7390 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7391 debug info and doesn't reflect the source code. */
7394 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7396 tree base_type
= TREE_TYPE (type
), low
, high
;
7398 /* Subrange types have a base type which is an integral type. */
7399 if (!INTEGRAL_TYPE_P (base_type
))
7402 /* Get the real bounds of the subtype. */
7403 if (lang_hooks
.types
.get_subrange_bounds
)
7404 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7407 low
= TYPE_MIN_VALUE (type
);
7408 high
= TYPE_MAX_VALUE (type
);
7411 /* If the type and its base type have the same representation and the same
7412 name, then the type is not a subrange but a copy of the base type. */
7413 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7414 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7415 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7416 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7417 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7419 tree type_name
= TYPE_NAME (type
);
7420 tree base_type_name
= TYPE_NAME (base_type
);
7422 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7423 type_name
= DECL_NAME (type_name
);
7425 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7426 base_type_name
= DECL_NAME (base_type_name
);
7428 if (type_name
== base_type_name
)
7439 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7440 and number of elements specified by the range of values of INDEX_TYPE.
7441 If SHARED is true, reuse such a type that has already been constructed. */
7444 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7448 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7450 error ("arrays of functions are not meaningful");
7451 elt_type
= integer_type_node
;
7454 t
= make_node (ARRAY_TYPE
);
7455 TREE_TYPE (t
) = elt_type
;
7456 TYPE_DOMAIN (t
) = index_type
;
7457 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7460 /* If the element type is incomplete at this point we get marked for
7461 structural equality. Do not record these types in the canonical
7463 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7468 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7470 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7471 t
= type_hash_canon (hashcode
, t
);
7474 if (TYPE_CANONICAL (t
) == t
)
7476 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7477 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7478 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7479 else if (TYPE_CANONICAL (elt_type
) != elt_type
7480 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7482 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7484 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7491 /* Wrapper around build_array_type_1 with SHARED set to true. */
7494 build_array_type (tree elt_type
, tree index_type
)
7496 return build_array_type_1 (elt_type
, index_type
, true);
7499 /* Wrapper around build_array_type_1 with SHARED set to false. */
7502 build_nonshared_array_type (tree elt_type
, tree index_type
)
7504 return build_array_type_1 (elt_type
, index_type
, false);
7507 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7511 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7513 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7516 /* Recursively examines the array elements of TYPE, until a non-array
7517 element type is found. */
7520 strip_array_types (tree type
)
7522 while (TREE_CODE (type
) == ARRAY_TYPE
)
7523 type
= TREE_TYPE (type
);
7528 /* Computes the canonical argument types from the argument type list
7531 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7532 on entry to this function, or if any of the ARGTYPES are
7535 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7536 true on entry to this function, or if any of the ARGTYPES are
7539 Returns a canonical argument list, which may be ARGTYPES when the
7540 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7541 true) or would not differ from ARGTYPES. */
7544 maybe_canonicalize_argtypes(tree argtypes
,
7545 bool *any_structural_p
,
7546 bool *any_noncanonical_p
)
7549 bool any_noncanonical_argtypes_p
= false;
7551 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7553 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7554 /* Fail gracefully by stating that the type is structural. */
7555 *any_structural_p
= true;
7556 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7557 *any_structural_p
= true;
7558 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7559 || TREE_PURPOSE (arg
))
7560 /* If the argument has a default argument, we consider it
7561 non-canonical even though the type itself is canonical.
7562 That way, different variants of function and method types
7563 with default arguments will all point to the variant with
7564 no defaults as their canonical type. */
7565 any_noncanonical_argtypes_p
= true;
7568 if (*any_structural_p
)
7571 if (any_noncanonical_argtypes_p
)
7573 /* Build the canonical list of argument types. */
7574 tree canon_argtypes
= NULL_TREE
;
7575 bool is_void
= false;
7577 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7579 if (arg
== void_list_node
)
7582 canon_argtypes
= tree_cons (NULL_TREE
,
7583 TYPE_CANONICAL (TREE_VALUE (arg
)),
7587 canon_argtypes
= nreverse (canon_argtypes
);
7589 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7591 /* There is a non-canonical type. */
7592 *any_noncanonical_p
= true;
7593 return canon_argtypes
;
7596 /* The canonical argument types are the same as ARGTYPES. */
7600 /* Construct, lay out and return
7601 the type of functions returning type VALUE_TYPE
7602 given arguments of types ARG_TYPES.
7603 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7604 are data type nodes for the arguments of the function.
7605 If such a type has already been constructed, reuse it. */
7608 build_function_type (tree value_type
, tree arg_types
)
7611 hashval_t hashcode
= 0;
7612 bool any_structural_p
, any_noncanonical_p
;
7613 tree canon_argtypes
;
7615 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7617 error ("function return type cannot be function");
7618 value_type
= integer_type_node
;
7621 /* Make a node of the sort we want. */
7622 t
= make_node (FUNCTION_TYPE
);
7623 TREE_TYPE (t
) = value_type
;
7624 TYPE_ARG_TYPES (t
) = arg_types
;
7626 /* If we already have such a type, use the old one. */
7627 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7628 hashcode
= type_hash_list (arg_types
, hashcode
);
7629 t
= type_hash_canon (hashcode
, t
);
7631 /* Set up the canonical type. */
7632 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7633 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7634 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7636 &any_noncanonical_p
);
7637 if (any_structural_p
)
7638 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7639 else if (any_noncanonical_p
)
7640 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7643 if (!COMPLETE_TYPE_P (t
))
7648 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7649 return value if SKIP_RETURN is true. */
7652 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7655 tree new_type
= NULL
;
7656 tree args
, new_args
= NULL
, t
;
7660 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7661 args
= TREE_CHAIN (args
), i
++)
7662 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7663 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7665 new_reversed
= nreverse (new_args
);
7669 TREE_CHAIN (new_args
) = void_list_node
;
7671 new_reversed
= void_list_node
;
7674 /* Use copy_node to preserve as much as possible from original type
7675 (debug info, attribute lists etc.)
7676 Exception is METHOD_TYPEs must have THIS argument.
7677 When we are asked to remove it, we need to build new FUNCTION_TYPE
7679 if (TREE_CODE (orig_type
) != METHOD_TYPE
7681 || !bitmap_bit_p (args_to_skip
, 0))
7683 new_type
= build_distinct_type_copy (orig_type
);
7684 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7689 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7691 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7695 TREE_TYPE (new_type
) = void_type_node
;
7697 /* This is a new type, not a copy of an old type. Need to reassociate
7698 variants. We can handle everything except the main variant lazily. */
7699 t
= TYPE_MAIN_VARIANT (orig_type
);
7702 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7703 TYPE_MAIN_VARIANT (new_type
) = t
;
7704 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7705 TYPE_NEXT_VARIANT (t
) = new_type
;
7709 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7710 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7716 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7717 return value if SKIP_RETURN is true.
7719 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7720 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7721 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7724 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7727 tree new_decl
= copy_node (orig_decl
);
7730 new_type
= TREE_TYPE (orig_decl
);
7731 if (prototype_p (new_type
)
7732 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7734 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7735 TREE_TYPE (new_decl
) = new_type
;
7737 /* For declarations setting DECL_VINDEX (i.e. methods)
7738 we expect first argument to be THIS pointer. */
7739 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
7740 DECL_VINDEX (new_decl
) = NULL_TREE
;
7742 /* When signature changes, we need to clear builtin info. */
7743 if (DECL_BUILT_IN (new_decl
)
7745 && !bitmap_empty_p (args_to_skip
))
7747 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7748 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7753 /* Build a function type. The RETURN_TYPE is the type returned by the
7754 function. If VAARGS is set, no void_type_node is appended to the
7755 the list. ARGP must be always be terminated be a NULL_TREE. */
7758 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7762 t
= va_arg (argp
, tree
);
7763 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7764 args
= tree_cons (NULL_TREE
, t
, args
);
7769 if (args
!= NULL_TREE
)
7770 args
= nreverse (args
);
7771 gcc_assert (last
!= void_list_node
);
7773 else if (args
== NULL_TREE
)
7774 args
= void_list_node
;
7778 args
= nreverse (args
);
7779 TREE_CHAIN (last
) = void_list_node
;
7781 args
= build_function_type (return_type
, args
);
7786 /* Build a function type. The RETURN_TYPE is the type returned by the
7787 function. If additional arguments are provided, they are
7788 additional argument types. The list of argument types must always
7789 be terminated by NULL_TREE. */
7792 build_function_type_list (tree return_type
, ...)
7797 va_start (p
, return_type
);
7798 args
= build_function_type_list_1 (false, return_type
, p
);
7803 /* Build a variable argument function type. The RETURN_TYPE is the
7804 type returned by the function. If additional arguments are provided,
7805 they are additional argument types. The list of argument types must
7806 always be terminated by NULL_TREE. */
7809 build_varargs_function_type_list (tree return_type
, ...)
7814 va_start (p
, return_type
);
7815 args
= build_function_type_list_1 (true, return_type
, p
);
7821 /* Build a function type. RETURN_TYPE is the type returned by the
7822 function; VAARGS indicates whether the function takes varargs. The
7823 function takes N named arguments, the types of which are provided in
7827 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7831 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7833 for (i
= n
- 1; i
>= 0; i
--)
7834 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7836 return build_function_type (return_type
, t
);
7839 /* Build a function type. RETURN_TYPE is the type returned by the
7840 function. The function takes N named arguments, the types of which
7841 are provided in ARG_TYPES. */
7844 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7846 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7849 /* Build a variable argument function type. RETURN_TYPE is the type
7850 returned by the function. The function takes N named arguments, the
7851 types of which are provided in ARG_TYPES. */
7854 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7856 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7859 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7860 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7861 for the method. An implicit additional parameter (of type
7862 pointer-to-BASETYPE) is added to the ARGTYPES. */
7865 build_method_type_directly (tree basetype
,
7872 bool any_structural_p
, any_noncanonical_p
;
7873 tree canon_argtypes
;
7875 /* Make a node of the sort we want. */
7876 t
= make_node (METHOD_TYPE
);
7878 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7879 TREE_TYPE (t
) = rettype
;
7880 ptype
= build_pointer_type (basetype
);
7882 /* The actual arglist for this function includes a "hidden" argument
7883 which is "this". Put it into the list of argument types. */
7884 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7885 TYPE_ARG_TYPES (t
) = argtypes
;
7887 /* If we already have such a type, use the old one. */
7888 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7889 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7890 hashcode
= type_hash_list (argtypes
, hashcode
);
7891 t
= type_hash_canon (hashcode
, t
);
7893 /* Set up the canonical type. */
7895 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7896 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7898 = (TYPE_CANONICAL (basetype
) != basetype
7899 || TYPE_CANONICAL (rettype
) != rettype
);
7900 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7902 &any_noncanonical_p
);
7903 if (any_structural_p
)
7904 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7905 else if (any_noncanonical_p
)
7907 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7908 TYPE_CANONICAL (rettype
),
7910 if (!COMPLETE_TYPE_P (t
))
7916 /* Construct, lay out and return the type of methods belonging to class
7917 BASETYPE and whose arguments and values are described by TYPE.
7918 If that type exists already, reuse it.
7919 TYPE must be a FUNCTION_TYPE node. */
7922 build_method_type (tree basetype
, tree type
)
7924 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7926 return build_method_type_directly (basetype
,
7928 TYPE_ARG_TYPES (type
));
7931 /* Construct, lay out and return the type of offsets to a value
7932 of type TYPE, within an object of type BASETYPE.
7933 If a suitable offset type exists already, reuse it. */
7936 build_offset_type (tree basetype
, tree type
)
7939 hashval_t hashcode
= 0;
7941 /* Make a node of the sort we want. */
7942 t
= make_node (OFFSET_TYPE
);
7944 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7945 TREE_TYPE (t
) = type
;
7947 /* If we already have such a type, use the old one. */
7948 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7949 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7950 t
= type_hash_canon (hashcode
, t
);
7952 if (!COMPLETE_TYPE_P (t
))
7955 if (TYPE_CANONICAL (t
) == t
)
7957 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7958 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7959 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7960 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7961 || TYPE_CANONICAL (type
) != type
)
7963 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7964 TYPE_CANONICAL (type
));
7970 /* Create a complex type whose components are COMPONENT_TYPE. */
7973 build_complex_type (tree component_type
)
7978 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7979 || SCALAR_FLOAT_TYPE_P (component_type
)
7980 || FIXED_POINT_TYPE_P (component_type
));
7982 /* Make a node of the sort we want. */
7983 t
= make_node (COMPLEX_TYPE
);
7985 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7987 /* If we already have such a type, use the old one. */
7988 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7989 t
= type_hash_canon (hashcode
, t
);
7991 if (!COMPLETE_TYPE_P (t
))
7994 if (TYPE_CANONICAL (t
) == t
)
7996 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7997 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7998 else if (TYPE_CANONICAL (component_type
) != component_type
)
8000 = build_complex_type (TYPE_CANONICAL (component_type
));
8003 /* We need to create a name, since complex is a fundamental type. */
8004 if (! TYPE_NAME (t
))
8007 if (component_type
== char_type_node
)
8008 name
= "complex char";
8009 else if (component_type
== signed_char_type_node
)
8010 name
= "complex signed char";
8011 else if (component_type
== unsigned_char_type_node
)
8012 name
= "complex unsigned char";
8013 else if (component_type
== short_integer_type_node
)
8014 name
= "complex short int";
8015 else if (component_type
== short_unsigned_type_node
)
8016 name
= "complex short unsigned int";
8017 else if (component_type
== integer_type_node
)
8018 name
= "complex int";
8019 else if (component_type
== unsigned_type_node
)
8020 name
= "complex unsigned int";
8021 else if (component_type
== long_integer_type_node
)
8022 name
= "complex long int";
8023 else if (component_type
== long_unsigned_type_node
)
8024 name
= "complex long unsigned int";
8025 else if (component_type
== long_long_integer_type_node
)
8026 name
= "complex long long int";
8027 else if (component_type
== long_long_unsigned_type_node
)
8028 name
= "complex long long unsigned int";
8033 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8034 get_identifier (name
), t
);
8037 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8040 /* If TYPE is a real or complex floating-point type and the target
8041 does not directly support arithmetic on TYPE then return the wider
8042 type to be used for arithmetic on TYPE. Otherwise, return
8046 excess_precision_type (tree type
)
8048 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8050 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8051 switch (TREE_CODE (type
))
8054 switch (flt_eval_method
)
8057 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8058 return double_type_node
;
8061 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8062 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8063 return long_double_type_node
;
8070 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8072 switch (flt_eval_method
)
8075 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8076 return complex_double_type_node
;
8079 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8080 || (TYPE_MODE (TREE_TYPE (type
))
8081 == TYPE_MODE (double_type_node
)))
8082 return complex_long_double_type_node
;
8095 /* Return OP, stripped of any conversions to wider types as much as is safe.
8096 Converting the value back to OP's type makes a value equivalent to OP.
8098 If FOR_TYPE is nonzero, we return a value which, if converted to
8099 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8101 OP must have integer, real or enumeral type. Pointers are not allowed!
8103 There are some cases where the obvious value we could return
8104 would regenerate to OP if converted to OP's type,
8105 but would not extend like OP to wider types.
8106 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8107 For example, if OP is (unsigned short)(signed char)-1,
8108 we avoid returning (signed char)-1 if FOR_TYPE is int,
8109 even though extending that to an unsigned short would regenerate OP,
8110 since the result of extending (signed char)-1 to (int)
8111 is different from (int) OP. */
8114 get_unwidened (tree op
, tree for_type
)
8116 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8117 tree type
= TREE_TYPE (op
);
8119 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8121 = (for_type
!= 0 && for_type
!= type
8122 && final_prec
> TYPE_PRECISION (type
)
8123 && TYPE_UNSIGNED (type
));
8126 while (CONVERT_EXPR_P (op
))
8130 /* TYPE_PRECISION on vector types has different meaning
8131 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8132 so avoid them here. */
8133 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8136 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8137 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8139 /* Truncations are many-one so cannot be removed.
8140 Unless we are later going to truncate down even farther. */
8142 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8145 /* See what's inside this conversion. If we decide to strip it,
8147 op
= TREE_OPERAND (op
, 0);
8149 /* If we have not stripped any zero-extensions (uns is 0),
8150 we can strip any kind of extension.
8151 If we have previously stripped a zero-extension,
8152 only zero-extensions can safely be stripped.
8153 Any extension can be stripped if the bits it would produce
8154 are all going to be discarded later by truncating to FOR_TYPE. */
8158 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8160 /* TYPE_UNSIGNED says whether this is a zero-extension.
8161 Let's avoid computing it if it does not affect WIN
8162 and if UNS will not be needed again. */
8164 || CONVERT_EXPR_P (op
))
8165 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8173 /* If we finally reach a constant see if it fits in for_type and
8174 in that case convert it. */
8176 && TREE_CODE (win
) == INTEGER_CST
8177 && TREE_TYPE (win
) != for_type
8178 && int_fits_type_p (win
, for_type
))
8179 win
= fold_convert (for_type
, win
);
8184 /* Return OP or a simpler expression for a narrower value
8185 which can be sign-extended or zero-extended to give back OP.
8186 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8187 or 0 if the value should be sign-extended. */
8190 get_narrower (tree op
, int *unsignedp_ptr
)
8195 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8197 while (TREE_CODE (op
) == NOP_EXPR
)
8200 = (TYPE_PRECISION (TREE_TYPE (op
))
8201 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8203 /* Truncations are many-one so cannot be removed. */
8207 /* See what's inside this conversion. If we decide to strip it,
8212 op
= TREE_OPERAND (op
, 0);
8213 /* An extension: the outermost one can be stripped,
8214 but remember whether it is zero or sign extension. */
8216 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8217 /* Otherwise, if a sign extension has been stripped,
8218 only sign extensions can now be stripped;
8219 if a zero extension has been stripped, only zero-extensions. */
8220 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8224 else /* bitschange == 0 */
8226 /* A change in nominal type can always be stripped, but we must
8227 preserve the unsignedness. */
8229 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8231 op
= TREE_OPERAND (op
, 0);
8232 /* Keep trying to narrow, but don't assign op to win if it
8233 would turn an integral type into something else. */
8234 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8241 if (TREE_CODE (op
) == COMPONENT_REF
8242 /* Since type_for_size always gives an integer type. */
8243 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8244 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8245 /* Ensure field is laid out already. */
8246 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8247 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8249 unsigned HOST_WIDE_INT innerprec
8250 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8251 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8252 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8253 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8255 /* We can get this structure field in a narrower type that fits it,
8256 but the resulting extension to its nominal type (a fullword type)
8257 must satisfy the same conditions as for other extensions.
8259 Do this only for fields that are aligned (not bit-fields),
8260 because when bit-field insns will be used there is no
8261 advantage in doing this. */
8263 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8264 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8265 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8269 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8270 win
= fold_convert (type
, op
);
8274 *unsignedp_ptr
= uns
;
8278 /* Returns true if integer constant C has a value that is permissible
8279 for type TYPE (an INTEGER_TYPE). */
8282 int_fits_type_p (const_tree c
, const_tree type
)
8284 tree type_low_bound
, type_high_bound
;
8285 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8288 dc
= tree_to_double_int (c
);
8289 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8292 type_low_bound
= TYPE_MIN_VALUE (type
);
8293 type_high_bound
= TYPE_MAX_VALUE (type
);
8295 /* If at least one bound of the type is a constant integer, we can check
8296 ourselves and maybe make a decision. If no such decision is possible, but
8297 this type is a subtype, try checking against that. Otherwise, use
8298 double_int_fits_to_tree_p, which checks against the precision.
8300 Compute the status for each possibly constant bound, and return if we see
8301 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8302 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8303 for "constant known to fit". */
8305 /* Check if c >= type_low_bound. */
8306 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8308 dd
= tree_to_double_int (type_low_bound
);
8309 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8311 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8312 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8314 if (c_neg
&& !t_neg
)
8316 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8319 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8321 ok_for_low_bound
= true;
8324 ok_for_low_bound
= false;
8326 /* Check if c <= type_high_bound. */
8327 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8329 dd
= tree_to_double_int (type_high_bound
);
8330 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8332 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8333 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8335 if (t_neg
&& !c_neg
)
8337 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8340 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8342 ok_for_high_bound
= true;
8345 ok_for_high_bound
= false;
8347 /* If the constant fits both bounds, the result is known. */
8348 if (ok_for_low_bound
&& ok_for_high_bound
)
8351 /* Perform some generic filtering which may allow making a decision
8352 even if the bounds are not constant. First, negative integers
8353 never fit in unsigned types, */
8354 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8357 /* Second, narrower types always fit in wider ones. */
8358 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8361 /* Third, unsigned integers with top bit set never fit signed types. */
8362 if (! TYPE_UNSIGNED (type
) && unsc
)
8364 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8365 if (prec
< HOST_BITS_PER_WIDE_INT
)
8367 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8370 else if (((((unsigned HOST_WIDE_INT
) 1)
8371 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8375 /* If we haven't been able to decide at this point, there nothing more we
8376 can check ourselves here. Look at the base type if we have one and it
8377 has the same precision. */
8378 if (TREE_CODE (type
) == INTEGER_TYPE
8379 && TREE_TYPE (type
) != 0
8380 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8382 type
= TREE_TYPE (type
);
8386 /* Or to double_int_fits_to_tree_p, if nothing else. */
8387 return double_int_fits_to_tree_p (type
, dc
);
8390 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8391 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8392 represented (assuming two's-complement arithmetic) within the bit
8393 precision of the type are returned instead. */
8396 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8398 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8399 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8400 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8401 TYPE_UNSIGNED (type
));
8404 if (TYPE_UNSIGNED (type
))
8405 mpz_set_ui (min
, 0);
8409 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8410 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8411 TYPE_PRECISION (type
));
8412 mpz_set_double_int (min
, mn
, false);
8416 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8417 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8418 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8419 TYPE_UNSIGNED (type
));
8422 if (TYPE_UNSIGNED (type
))
8423 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8426 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8431 /* Return true if VAR is an automatic variable defined in function FN. */
8434 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8436 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8437 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8438 || TREE_CODE (var
) == PARM_DECL
)
8439 && ! TREE_STATIC (var
))
8440 || TREE_CODE (var
) == LABEL_DECL
8441 || TREE_CODE (var
) == RESULT_DECL
));
8444 /* Subprogram of following function. Called by walk_tree.
8446 Return *TP if it is an automatic variable or parameter of the
8447 function passed in as DATA. */
8450 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8452 tree fn
= (tree
) data
;
8457 else if (DECL_P (*tp
)
8458 && auto_var_in_fn_p (*tp
, fn
))
8464 /* Returns true if T is, contains, or refers to a type with variable
8465 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8466 arguments, but not the return type. If FN is nonzero, only return
8467 true if a modifier of the type or position of FN is a variable or
8468 parameter inside FN.
8470 This concept is more general than that of C99 'variably modified types':
8471 in C99, a struct type is never variably modified because a VLA may not
8472 appear as a structure member. However, in GNU C code like:
8474 struct S { int i[f()]; };
8476 is valid, and other languages may define similar constructs. */
8479 variably_modified_type_p (tree type
, tree fn
)
8483 /* Test if T is either variable (if FN is zero) or an expression containing
8484 a variable in FN. */
8485 #define RETURN_TRUE_IF_VAR(T) \
8486 do { tree _t = (T); \
8487 if (_t != NULL_TREE \
8488 && _t != error_mark_node \
8489 && TREE_CODE (_t) != INTEGER_CST \
8490 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8491 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8492 return true; } while (0)
8494 if (type
== error_mark_node
)
8497 /* If TYPE itself has variable size, it is variably modified. */
8498 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8499 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8501 switch (TREE_CODE (type
))
8504 case REFERENCE_TYPE
:
8506 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8512 /* If TYPE is a function type, it is variably modified if the
8513 return type is variably modified. */
8514 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8520 case FIXED_POINT_TYPE
:
8523 /* Scalar types are variably modified if their end points
8525 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8526 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8531 case QUAL_UNION_TYPE
:
8532 /* We can't see if any of the fields are variably-modified by the
8533 definition we normally use, since that would produce infinite
8534 recursion via pointers. */
8535 /* This is variably modified if some field's type is. */
8536 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8537 if (TREE_CODE (t
) == FIELD_DECL
)
8539 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8540 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8541 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8543 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8544 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8549 /* Do not call ourselves to avoid infinite recursion. This is
8550 variably modified if the element type is. */
8551 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8552 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8559 /* The current language may have other cases to check, but in general,
8560 all other types are not variably modified. */
8561 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8563 #undef RETURN_TRUE_IF_VAR
8566 /* Given a DECL or TYPE, return the scope in which it was declared, or
8567 NULL_TREE if there is no containing scope. */
8570 get_containing_scope (const_tree t
)
8572 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8575 /* Return the innermost context enclosing DECL that is
8576 a FUNCTION_DECL, or zero if none. */
8579 decl_function_context (const_tree decl
)
8583 if (TREE_CODE (decl
) == ERROR_MARK
)
8586 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8587 where we look up the function at runtime. Such functions always take
8588 a first argument of type 'pointer to real context'.
8590 C++ should really be fixed to use DECL_CONTEXT for the real context,
8591 and use something else for the "virtual context". */
8592 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8595 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8597 context
= DECL_CONTEXT (decl
);
8599 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8601 if (TREE_CODE (context
) == BLOCK
)
8602 context
= BLOCK_SUPERCONTEXT (context
);
8604 context
= get_containing_scope (context
);
8610 /* Return the innermost context enclosing DECL that is
8611 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8612 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8615 decl_type_context (const_tree decl
)
8617 tree context
= DECL_CONTEXT (decl
);
8620 switch (TREE_CODE (context
))
8622 case NAMESPACE_DECL
:
8623 case TRANSLATION_UNIT_DECL
:
8628 case QUAL_UNION_TYPE
:
8633 context
= DECL_CONTEXT (context
);
8637 context
= BLOCK_SUPERCONTEXT (context
);
8647 /* CALL is a CALL_EXPR. Return the declaration for the function
8648 called, or NULL_TREE if the called function cannot be
8652 get_callee_fndecl (const_tree call
)
8656 if (call
== error_mark_node
)
8657 return error_mark_node
;
8659 /* It's invalid to call this function with anything but a
8661 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8663 /* The first operand to the CALL is the address of the function
8665 addr
= CALL_EXPR_FN (call
);
8669 /* If this is a readonly function pointer, extract its initial value. */
8670 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8671 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8672 && DECL_INITIAL (addr
))
8673 addr
= DECL_INITIAL (addr
);
8675 /* If the address is just `&f' for some function `f', then we know
8676 that `f' is being called. */
8677 if (TREE_CODE (addr
) == ADDR_EXPR
8678 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8679 return TREE_OPERAND (addr
, 0);
8681 /* We couldn't figure out what was being called. */
8685 /* Print debugging information about tree nodes generated during the compile,
8686 and any language-specific information. */
8689 dump_tree_statistics (void)
8691 #ifdef GATHER_STATISTICS
8693 int total_nodes
, total_bytes
;
8696 fprintf (stderr
, "\n??? tree nodes created\n\n");
8697 #ifdef GATHER_STATISTICS
8698 fprintf (stderr
, "Kind Nodes Bytes\n");
8699 fprintf (stderr
, "---------------------------------------\n");
8700 total_nodes
= total_bytes
= 0;
8701 for (i
= 0; i
< (int) all_kinds
; i
++)
8703 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8704 tree_node_counts
[i
], tree_node_sizes
[i
]);
8705 total_nodes
+= tree_node_counts
[i
];
8706 total_bytes
+= tree_node_sizes
[i
];
8708 fprintf (stderr
, "---------------------------------------\n");
8709 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8710 fprintf (stderr
, "---------------------------------------\n");
8711 fprintf (stderr
, "Code Nodes\n");
8712 fprintf (stderr
, "----------------------------\n");
8713 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8714 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8715 fprintf (stderr
, "----------------------------\n");
8716 ssanames_print_statistics ();
8717 phinodes_print_statistics ();
8719 fprintf (stderr
, "(No per-node statistics)\n");
8721 print_type_hash_statistics ();
8722 print_debug_expr_statistics ();
8723 print_value_expr_statistics ();
8724 lang_hooks
.print_statistics ();
8727 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8729 /* Generate a crc32 of a byte. */
8732 crc32_byte (unsigned chksum
, char byte
)
8734 unsigned value
= (unsigned) byte
<< 24;
8737 for (ix
= 8; ix
--; value
<<= 1)
8741 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8749 /* Generate a crc32 of a string. */
8752 crc32_string (unsigned chksum
, const char *string
)
8756 chksum
= crc32_byte (chksum
, *string
);
8762 /* P is a string that will be used in a symbol. Mask out any characters
8763 that are not valid in that context. */
8766 clean_symbol_name (char *p
)
8770 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8773 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8780 /* Generate a name for a special-purpose function.
8781 The generated name may need to be unique across the whole link.
8782 Changes to this function may also require corresponding changes to
8783 xstrdup_mask_random.
8784 TYPE is some string to identify the purpose of this function to the
8785 linker or collect2; it must start with an uppercase letter,
8787 I - for constructors
8789 N - for C++ anonymous namespaces
8790 F - for DWARF unwind frame information. */
8793 get_file_function_name (const char *type
)
8799 /* If we already have a name we know to be unique, just use that. */
8800 if (first_global_object_name
)
8801 p
= q
= ASTRDUP (first_global_object_name
);
8802 /* If the target is handling the constructors/destructors, they
8803 will be local to this file and the name is only necessary for
8805 We also assign sub_I and sub_D sufixes to constructors called from
8806 the global static constructors. These are always local. */
8807 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8808 || (strncmp (type
, "sub_", 4) == 0
8809 && (type
[4] == 'I' || type
[4] == 'D')))
8811 const char *file
= main_input_filename
;
8813 file
= input_filename
;
8814 /* Just use the file's basename, because the full pathname
8815 might be quite long. */
8816 p
= q
= ASTRDUP (lbasename (file
));
8820 /* Otherwise, the name must be unique across the entire link.
8821 We don't have anything that we know to be unique to this translation
8822 unit, so use what we do have and throw in some randomness. */
8824 const char *name
= weak_global_object_name
;
8825 const char *file
= main_input_filename
;
8830 file
= input_filename
;
8832 len
= strlen (file
);
8833 q
= (char *) alloca (9 + 17 + len
+ 1);
8834 memcpy (q
, file
, len
+ 1);
8836 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8837 crc32_string (0, name
), get_random_seed (false));
8842 clean_symbol_name (q
);
8843 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8846 /* Set up the name of the file-level functions we may need.
8847 Use a global object (which is already required to be unique over
8848 the program) rather than the file name (which imposes extra
8850 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8852 return get_identifier (buf
);
8855 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8857 /* Complain that the tree code of NODE does not match the expected 0
8858 terminated list of trailing codes. The trailing code list can be
8859 empty, for a more vague error message. FILE, LINE, and FUNCTION
8860 are of the caller. */
8863 tree_check_failed (const_tree node
, const char *file
,
8864 int line
, const char *function
, ...)
8868 unsigned length
= 0;
8871 va_start (args
, function
);
8872 while ((code
= va_arg (args
, int)))
8873 length
+= 4 + strlen (tree_code_name
[code
]);
8878 va_start (args
, function
);
8879 length
+= strlen ("expected ");
8880 buffer
= tmp
= (char *) alloca (length
);
8882 while ((code
= va_arg (args
, int)))
8884 const char *prefix
= length
? " or " : "expected ";
8886 strcpy (tmp
+ length
, prefix
);
8887 length
+= strlen (prefix
);
8888 strcpy (tmp
+ length
, tree_code_name
[code
]);
8889 length
+= strlen (tree_code_name
[code
]);
8894 buffer
= "unexpected node";
8896 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8897 buffer
, tree_code_name
[TREE_CODE (node
)],
8898 function
, trim_filename (file
), line
);
8901 /* Complain that the tree code of NODE does match the expected 0
8902 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8906 tree_not_check_failed (const_tree node
, const char *file
,
8907 int line
, const char *function
, ...)
8911 unsigned length
= 0;
8914 va_start (args
, function
);
8915 while ((code
= va_arg (args
, int)))
8916 length
+= 4 + strlen (tree_code_name
[code
]);
8918 va_start (args
, function
);
8919 buffer
= (char *) alloca (length
);
8921 while ((code
= va_arg (args
, int)))
8925 strcpy (buffer
+ length
, " or ");
8928 strcpy (buffer
+ length
, tree_code_name
[code
]);
8929 length
+= strlen (tree_code_name
[code
]);
8933 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8934 buffer
, tree_code_name
[TREE_CODE (node
)],
8935 function
, trim_filename (file
), line
);
8938 /* Similar to tree_check_failed, except that we check for a class of tree
8939 code, given in CL. */
8942 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8943 const char *file
, int line
, const char *function
)
8946 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8947 TREE_CODE_CLASS_STRING (cl
),
8948 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8949 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8952 /* Similar to tree_check_failed, except that instead of specifying a
8953 dozen codes, use the knowledge that they're all sequential. */
8956 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8957 const char *function
, enum tree_code c1
,
8961 unsigned length
= 0;
8964 for (c
= c1
; c
<= c2
; ++c
)
8965 length
+= 4 + strlen (tree_code_name
[c
]);
8967 length
+= strlen ("expected ");
8968 buffer
= (char *) alloca (length
);
8971 for (c
= c1
; c
<= c2
; ++c
)
8973 const char *prefix
= length
? " or " : "expected ";
8975 strcpy (buffer
+ length
, prefix
);
8976 length
+= strlen (prefix
);
8977 strcpy (buffer
+ length
, tree_code_name
[c
]);
8978 length
+= strlen (tree_code_name
[c
]);
8981 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8982 buffer
, tree_code_name
[TREE_CODE (node
)],
8983 function
, trim_filename (file
), line
);
8987 /* Similar to tree_check_failed, except that we check that a tree does
8988 not have the specified code, given in CL. */
8991 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8992 const char *file
, int line
, const char *function
)
8995 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8996 TREE_CODE_CLASS_STRING (cl
),
8997 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8998 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9002 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9005 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9006 const char *function
, enum omp_clause_code code
)
9008 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9009 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9010 function
, trim_filename (file
), line
);
9014 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9017 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9018 const char *function
, enum omp_clause_code c1
,
9019 enum omp_clause_code c2
)
9022 unsigned length
= 0;
9025 for (c
= c1
; c
<= c2
; ++c
)
9026 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9028 length
+= strlen ("expected ");
9029 buffer
= (char *) alloca (length
);
9032 for (c
= c1
; c
<= c2
; ++c
)
9034 const char *prefix
= length
? " or " : "expected ";
9036 strcpy (buffer
+ length
, prefix
);
9037 length
+= strlen (prefix
);
9038 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9039 length
+= strlen (omp_clause_code_name
[c
]);
9042 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9043 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9044 function
, trim_filename (file
), line
);
9048 #undef DEFTREESTRUCT
9049 #define DEFTREESTRUCT(VAL, NAME) NAME,
9051 static const char *ts_enum_names
[] = {
9052 #include "treestruct.def"
9054 #undef DEFTREESTRUCT
9056 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9058 /* Similar to tree_class_check_failed, except that we check for
9059 whether CODE contains the tree structure identified by EN. */
9062 tree_contains_struct_check_failed (const_tree node
,
9063 const enum tree_node_structure_enum en
,
9064 const char *file
, int line
,
9065 const char *function
)
9068 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9070 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9074 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9075 (dynamically sized) vector. */
9078 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9079 const char *function
)
9082 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9083 idx
+ 1, len
, function
, trim_filename (file
), line
);
9086 /* Similar to above, except that the check is for the bounds of the operand
9087 vector of an expression node EXP. */
9090 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9091 int line
, const char *function
)
9093 int code
= TREE_CODE (exp
);
9095 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9096 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9097 function
, trim_filename (file
), line
);
9100 /* Similar to above, except that the check is for the number of
9101 operands of an OMP_CLAUSE node. */
9104 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9105 int line
, const char *function
)
9108 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9109 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9110 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9111 trim_filename (file
), line
);
9113 #endif /* ENABLE_TREE_CHECKING */
9115 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9116 and mapped to the machine mode MODE. Initialize its fields and build
9117 the information necessary for debugging output. */
9120 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9123 hashval_t hashcode
= 0;
9125 t
= make_node (VECTOR_TYPE
);
9126 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9127 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9128 SET_TYPE_MODE (t
, mode
);
9130 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9131 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9132 else if (TYPE_CANONICAL (innertype
) != innertype
9133 || mode
!= VOIDmode
)
9135 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9139 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9140 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9141 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9142 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9143 t
= type_hash_canon (hashcode
, t
);
9145 /* We have built a main variant, based on the main variant of the
9146 inner type. Use it to build the variant we return. */
9147 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9148 && TREE_TYPE (t
) != innertype
)
9149 return build_type_attribute_qual_variant (t
,
9150 TYPE_ATTRIBUTES (innertype
),
9151 TYPE_QUALS (innertype
));
9157 make_or_reuse_type (unsigned size
, int unsignedp
)
9159 if (size
== INT_TYPE_SIZE
)
9160 return unsignedp
? unsigned_type_node
: integer_type_node
;
9161 if (size
== CHAR_TYPE_SIZE
)
9162 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9163 if (size
== SHORT_TYPE_SIZE
)
9164 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9165 if (size
== LONG_TYPE_SIZE
)
9166 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9167 if (size
== LONG_LONG_TYPE_SIZE
)
9168 return (unsignedp
? long_long_unsigned_type_node
9169 : long_long_integer_type_node
);
9170 if (size
== 128 && int128_integer_type_node
)
9171 return (unsignedp
? int128_unsigned_type_node
9172 : int128_integer_type_node
);
9175 return make_unsigned_type (size
);
9177 return make_signed_type (size
);
9180 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9183 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9187 if (size
== SHORT_FRACT_TYPE_SIZE
)
9188 return unsignedp
? sat_unsigned_short_fract_type_node
9189 : sat_short_fract_type_node
;
9190 if (size
== FRACT_TYPE_SIZE
)
9191 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9192 if (size
== LONG_FRACT_TYPE_SIZE
)
9193 return unsignedp
? sat_unsigned_long_fract_type_node
9194 : sat_long_fract_type_node
;
9195 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9196 return unsignedp
? sat_unsigned_long_long_fract_type_node
9197 : sat_long_long_fract_type_node
;
9201 if (size
== SHORT_FRACT_TYPE_SIZE
)
9202 return unsignedp
? unsigned_short_fract_type_node
9203 : short_fract_type_node
;
9204 if (size
== FRACT_TYPE_SIZE
)
9205 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9206 if (size
== LONG_FRACT_TYPE_SIZE
)
9207 return unsignedp
? unsigned_long_fract_type_node
9208 : long_fract_type_node
;
9209 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9210 return unsignedp
? unsigned_long_long_fract_type_node
9211 : long_long_fract_type_node
;
9214 return make_fract_type (size
, unsignedp
, satp
);
9217 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9220 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9224 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9225 return unsignedp
? sat_unsigned_short_accum_type_node
9226 : sat_short_accum_type_node
;
9227 if (size
== ACCUM_TYPE_SIZE
)
9228 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9229 if (size
== LONG_ACCUM_TYPE_SIZE
)
9230 return unsignedp
? sat_unsigned_long_accum_type_node
9231 : sat_long_accum_type_node
;
9232 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9233 return unsignedp
? sat_unsigned_long_long_accum_type_node
9234 : sat_long_long_accum_type_node
;
9238 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9239 return unsignedp
? unsigned_short_accum_type_node
9240 : short_accum_type_node
;
9241 if (size
== ACCUM_TYPE_SIZE
)
9242 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9243 if (size
== LONG_ACCUM_TYPE_SIZE
)
9244 return unsignedp
? unsigned_long_accum_type_node
9245 : long_accum_type_node
;
9246 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9247 return unsignedp
? unsigned_long_long_accum_type_node
9248 : long_long_accum_type_node
;
9251 return make_accum_type (size
, unsignedp
, satp
);
9254 /* Create nodes for all integer types (and error_mark_node) using the sizes
9255 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9256 SHORT_DOUBLE specifies whether double should be of the same precision
9260 build_common_tree_nodes (bool signed_char
, bool short_double
)
9262 error_mark_node
= make_node (ERROR_MARK
);
9263 TREE_TYPE (error_mark_node
) = error_mark_node
;
9265 initialize_sizetypes ();
9267 /* Define both `signed char' and `unsigned char'. */
9268 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9269 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9270 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9271 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9273 /* Define `char', which is like either `signed char' or `unsigned char'
9274 but not the same as either. */
9277 ? make_signed_type (CHAR_TYPE_SIZE
)
9278 : make_unsigned_type (CHAR_TYPE_SIZE
));
9279 TYPE_STRING_FLAG (char_type_node
) = 1;
9281 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9282 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9283 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9284 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9285 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9286 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9287 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9288 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9289 #if HOST_BITS_PER_WIDE_INT >= 64
9290 /* TODO: This isn't correct, but as logic depends at the moment on
9291 host's instead of target's wide-integer.
9292 If there is a target not supporting TImode, but has an 128-bit
9293 integer-scalar register, this target check needs to be adjusted. */
9294 if (targetm
.scalar_mode_supported_p (TImode
))
9296 int128_integer_type_node
= make_signed_type (128);
9297 int128_unsigned_type_node
= make_unsigned_type (128);
9301 /* Define a boolean type. This type only represents boolean values but
9302 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9303 Front ends which want to override this size (i.e. Java) can redefine
9304 boolean_type_node before calling build_common_tree_nodes_2. */
9305 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9306 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9307 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9308 TYPE_PRECISION (boolean_type_node
) = 1;
9310 /* Define what type to use for size_t. */
9311 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9312 size_type_node
= unsigned_type_node
;
9313 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9314 size_type_node
= long_unsigned_type_node
;
9315 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9316 size_type_node
= long_long_unsigned_type_node
;
9317 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9318 size_type_node
= short_unsigned_type_node
;
9322 /* Fill in the rest of the sized types. Reuse existing type nodes
9324 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9325 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9326 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9327 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9328 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9330 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9331 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9332 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9333 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9334 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9336 access_public_node
= get_identifier ("public");
9337 access_protected_node
= get_identifier ("protected");
9338 access_private_node
= get_identifier ("private");
9340 /* Define these next since types below may used them. */
9341 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9342 integer_one_node
= build_int_cst (integer_type_node
, 1);
9343 integer_three_node
= build_int_cst (integer_type_node
, 3);
9344 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9346 size_zero_node
= size_int (0);
9347 size_one_node
= size_int (1);
9348 bitsize_zero_node
= bitsize_int (0);
9349 bitsize_one_node
= bitsize_int (1);
9350 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9352 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9353 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9355 void_type_node
= make_node (VOID_TYPE
);
9356 layout_type (void_type_node
);
9358 /* We are not going to have real types in C with less than byte alignment,
9359 so we might as well not have any types that claim to have it. */
9360 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9361 TYPE_USER_ALIGN (void_type_node
) = 0;
9363 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9364 layout_type (TREE_TYPE (null_pointer_node
));
9366 ptr_type_node
= build_pointer_type (void_type_node
);
9368 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9369 fileptr_type_node
= ptr_type_node
;
9371 float_type_node
= make_node (REAL_TYPE
);
9372 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9373 layout_type (float_type_node
);
9375 double_type_node
= make_node (REAL_TYPE
);
9377 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9379 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9380 layout_type (double_type_node
);
9382 long_double_type_node
= make_node (REAL_TYPE
);
9383 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9384 layout_type (long_double_type_node
);
9386 float_ptr_type_node
= build_pointer_type (float_type_node
);
9387 double_ptr_type_node
= build_pointer_type (double_type_node
);
9388 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9389 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9391 /* Fixed size integer types. */
9392 uint16_type_node
= build_nonstandard_integer_type (16, true);
9393 uint32_type_node
= build_nonstandard_integer_type (32, true);
9394 uint64_type_node
= build_nonstandard_integer_type (64, true);
9396 /* Decimal float types. */
9397 dfloat32_type_node
= make_node (REAL_TYPE
);
9398 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9399 layout_type (dfloat32_type_node
);
9400 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9401 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9403 dfloat64_type_node
= make_node (REAL_TYPE
);
9404 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9405 layout_type (dfloat64_type_node
);
9406 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9407 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9409 dfloat128_type_node
= make_node (REAL_TYPE
);
9410 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9411 layout_type (dfloat128_type_node
);
9412 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9413 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9415 complex_integer_type_node
= build_complex_type (integer_type_node
);
9416 complex_float_type_node
= build_complex_type (float_type_node
);
9417 complex_double_type_node
= build_complex_type (double_type_node
);
9418 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9420 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9421 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9422 sat_ ## KIND ## _type_node = \
9423 make_sat_signed_ ## KIND ## _type (SIZE); \
9424 sat_unsigned_ ## KIND ## _type_node = \
9425 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9426 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9427 unsigned_ ## KIND ## _type_node = \
9428 make_unsigned_ ## KIND ## _type (SIZE);
9430 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9431 sat_ ## WIDTH ## KIND ## _type_node = \
9432 make_sat_signed_ ## KIND ## _type (SIZE); \
9433 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9434 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9435 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9436 unsigned_ ## WIDTH ## KIND ## _type_node = \
9437 make_unsigned_ ## KIND ## _type (SIZE);
9439 /* Make fixed-point type nodes based on four different widths. */
9440 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9441 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9442 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9443 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9444 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9446 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9447 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9448 NAME ## _type_node = \
9449 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9450 u ## NAME ## _type_node = \
9451 make_or_reuse_unsigned_ ## KIND ## _type \
9452 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9453 sat_ ## NAME ## _type_node = \
9454 make_or_reuse_sat_signed_ ## KIND ## _type \
9455 (GET_MODE_BITSIZE (MODE ## mode)); \
9456 sat_u ## NAME ## _type_node = \
9457 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9458 (GET_MODE_BITSIZE (U ## MODE ## mode));
9460 /* Fixed-point type and mode nodes. */
9461 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9462 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9463 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9464 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9465 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9466 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9467 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9468 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9469 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9470 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9471 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9474 tree t
= targetm
.build_builtin_va_list ();
9476 /* Many back-ends define record types without setting TYPE_NAME.
9477 If we copied the record type here, we'd keep the original
9478 record type without a name. This breaks name mangling. So,
9479 don't copy record types and let c_common_nodes_and_builtins()
9480 declare the type to be __builtin_va_list. */
9481 if (TREE_CODE (t
) != RECORD_TYPE
)
9482 t
= build_variant_type_copy (t
);
9484 va_list_type_node
= t
;
9488 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9491 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9492 const char *library_name
, int ecf_flags
)
9496 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9497 library_name
, NULL_TREE
);
9498 if (ecf_flags
& ECF_CONST
)
9499 TREE_READONLY (decl
) = 1;
9500 if (ecf_flags
& ECF_PURE
)
9501 DECL_PURE_P (decl
) = 1;
9502 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9503 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9504 if (ecf_flags
& ECF_NORETURN
)
9505 TREE_THIS_VOLATILE (decl
) = 1;
9506 if (ecf_flags
& ECF_NOTHROW
)
9507 TREE_NOTHROW (decl
) = 1;
9508 if (ecf_flags
& ECF_MALLOC
)
9509 DECL_IS_MALLOC (decl
) = 1;
9510 if (ecf_flags
& ECF_LEAF
)
9511 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9512 NULL
, DECL_ATTRIBUTES (decl
));
9513 if ((ecf_flags
& ECF_TM_PURE
) && flag_tm
)
9514 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9516 set_builtin_decl (code
, decl
, true);
9519 /* Call this function after instantiating all builtins that the language
9520 front end cares about. This will build the rest of the builtins that
9521 are relied upon by the tree optimizers and the middle-end. */
9524 build_common_builtin_nodes (void)
9529 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9530 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9532 ftype
= build_function_type_list (ptr_type_node
,
9533 ptr_type_node
, const_ptr_type_node
,
9534 size_type_node
, NULL_TREE
);
9536 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9537 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9538 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9539 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9540 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9541 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9544 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9546 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9547 const_ptr_type_node
, size_type_node
,
9549 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9550 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9553 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9555 ftype
= build_function_type_list (ptr_type_node
,
9556 ptr_type_node
, integer_type_node
,
9557 size_type_node
, NULL_TREE
);
9558 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9559 "memset", ECF_NOTHROW
| ECF_LEAF
);
9562 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9564 ftype
= build_function_type_list (ptr_type_node
,
9565 size_type_node
, NULL_TREE
);
9566 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9567 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9570 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9571 size_type_node
, NULL_TREE
);
9572 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9573 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9574 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9576 /* If we're checking the stack, `alloca' can throw. */
9577 if (flag_stack_check
)
9579 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9580 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9583 ftype
= build_function_type_list (void_type_node
,
9584 ptr_type_node
, ptr_type_node
,
9585 ptr_type_node
, NULL_TREE
);
9586 local_define_builtin ("__builtin_init_trampoline", ftype
,
9587 BUILT_IN_INIT_TRAMPOLINE
,
9588 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9589 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9590 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9591 "__builtin_init_heap_trampoline",
9592 ECF_NOTHROW
| ECF_LEAF
);
9594 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9595 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9596 BUILT_IN_ADJUST_TRAMPOLINE
,
9597 "__builtin_adjust_trampoline",
9598 ECF_CONST
| ECF_NOTHROW
);
9600 ftype
= build_function_type_list (void_type_node
,
9601 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9602 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9603 BUILT_IN_NONLOCAL_GOTO
,
9604 "__builtin_nonlocal_goto",
9605 ECF_NORETURN
| ECF_NOTHROW
);
9607 ftype
= build_function_type_list (void_type_node
,
9608 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9609 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9610 BUILT_IN_SETJMP_SETUP
,
9611 "__builtin_setjmp_setup", ECF_NOTHROW
);
9613 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9614 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9615 BUILT_IN_SETJMP_DISPATCHER
,
9616 "__builtin_setjmp_dispatcher",
9617 ECF_PURE
| ECF_NOTHROW
);
9619 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9620 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9621 BUILT_IN_SETJMP_RECEIVER
,
9622 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9624 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9625 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9626 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9628 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9629 local_define_builtin ("__builtin_stack_restore", ftype
,
9630 BUILT_IN_STACK_RESTORE
,
9631 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9633 /* If there's a possibility that we might use the ARM EABI, build the
9634 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9635 if (targetm
.arm_eabi_unwinder
)
9637 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9638 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9639 BUILT_IN_CXA_END_CLEANUP
,
9640 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9643 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9644 local_define_builtin ("__builtin_unwind_resume", ftype
,
9645 BUILT_IN_UNWIND_RESUME
,
9646 ((targetm_common
.except_unwind_info (&global_options
)
9648 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9651 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9653 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9655 local_define_builtin ("__builtin_return_address", ftype
,
9656 BUILT_IN_RETURN_ADDRESS
,
9657 "__builtin_return_address",
9661 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9662 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9664 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9665 ptr_type_node
, NULL_TREE
);
9666 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9667 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9668 BUILT_IN_PROFILE_FUNC_ENTER
,
9669 "__cyg_profile_func_enter", 0);
9670 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9671 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9672 BUILT_IN_PROFILE_FUNC_EXIT
,
9673 "__cyg_profile_func_exit", 0);
9676 /* The exception object and filter values from the runtime. The argument
9677 must be zero before exception lowering, i.e. from the front end. After
9678 exception lowering, it will be the region number for the exception
9679 landing pad. These functions are PURE instead of CONST to prevent
9680 them from being hoisted past the exception edge that will initialize
9681 its value in the landing pad. */
9682 ftype
= build_function_type_list (ptr_type_node
,
9683 integer_type_node
, NULL_TREE
);
9684 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9685 /* Only use TM_PURE if we we have TM language support. */
9686 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9687 ecf_flags
|= ECF_TM_PURE
;
9688 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9689 "__builtin_eh_pointer", ecf_flags
);
9691 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9692 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9693 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9694 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9696 ftype
= build_function_type_list (void_type_node
,
9697 integer_type_node
, integer_type_node
,
9699 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9700 BUILT_IN_EH_COPY_VALUES
,
9701 "__builtin_eh_copy_values", ECF_NOTHROW
);
9703 /* Complex multiplication and division. These are handled as builtins
9704 rather than optabs because emit_library_call_value doesn't support
9705 complex. Further, we can do slightly better with folding these
9706 beasties if the real and complex parts of the arguments are separate. */
9710 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9712 char mode_name_buf
[4], *q
;
9714 enum built_in_function mcode
, dcode
;
9715 tree type
, inner_type
;
9716 const char *prefix
= "__";
9718 if (targetm
.libfunc_gnu_prefix
)
9721 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9724 inner_type
= TREE_TYPE (type
);
9726 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9727 inner_type
, inner_type
, NULL_TREE
);
9729 mcode
= ((enum built_in_function
)
9730 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9731 dcode
= ((enum built_in_function
)
9732 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9734 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9738 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9740 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9741 built_in_names
[mcode
],
9742 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9744 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9746 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9747 built_in_names
[dcode
],
9748 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9753 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9756 If we requested a pointer to a vector, build up the pointers that
9757 we stripped off while looking for the inner type. Similarly for
9758 return values from functions.
9760 The argument TYPE is the top of the chain, and BOTTOM is the
9761 new type which we will point to. */
9764 reconstruct_complex_type (tree type
, tree bottom
)
9768 if (TREE_CODE (type
) == POINTER_TYPE
)
9770 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9771 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9772 TYPE_REF_CAN_ALIAS_ALL (type
));
9774 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9776 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9777 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9778 TYPE_REF_CAN_ALIAS_ALL (type
));
9780 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9782 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9783 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9785 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9787 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9788 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9790 else if (TREE_CODE (type
) == METHOD_TYPE
)
9792 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9793 /* The build_method_type_directly() routine prepends 'this' to argument list,
9794 so we must compensate by getting rid of it. */
9796 = build_method_type_directly
9797 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9799 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9801 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9803 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9804 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9809 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9813 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9816 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9820 switch (GET_MODE_CLASS (mode
))
9822 case MODE_VECTOR_INT
:
9823 case MODE_VECTOR_FLOAT
:
9824 case MODE_VECTOR_FRACT
:
9825 case MODE_VECTOR_UFRACT
:
9826 case MODE_VECTOR_ACCUM
:
9827 case MODE_VECTOR_UACCUM
:
9828 nunits
= GET_MODE_NUNITS (mode
);
9832 /* Check that there are no leftover bits. */
9833 gcc_assert (GET_MODE_BITSIZE (mode
)
9834 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9836 nunits
= GET_MODE_BITSIZE (mode
)
9837 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9844 return make_vector_type (innertype
, nunits
, mode
);
9847 /* Similarly, but takes the inner type and number of units, which must be
9851 build_vector_type (tree innertype
, int nunits
)
9853 return make_vector_type (innertype
, nunits
, VOIDmode
);
9856 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9859 build_opaque_vector_type (tree innertype
, int nunits
)
9861 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9863 /* We always build the non-opaque variant before the opaque one,
9864 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9865 cand
= TYPE_NEXT_VARIANT (t
);
9867 && TYPE_VECTOR_OPAQUE (cand
)
9868 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9870 /* Othewise build a variant type and make sure to queue it after
9871 the non-opaque type. */
9872 cand
= build_distinct_type_copy (t
);
9873 TYPE_VECTOR_OPAQUE (cand
) = true;
9874 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9875 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9876 TYPE_NEXT_VARIANT (t
) = cand
;
9877 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9882 /* Given an initializer INIT, return TRUE if INIT is zero or some
9883 aggregate of zeros. Otherwise return FALSE. */
9885 initializer_zerop (const_tree init
)
9891 switch (TREE_CODE (init
))
9894 return integer_zerop (init
);
9897 /* ??? Note that this is not correct for C4X float formats. There,
9898 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9899 negative exponent. */
9900 return real_zerop (init
)
9901 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9904 return fixed_zerop (init
);
9907 return integer_zerop (init
)
9908 || (real_zerop (init
)
9909 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9910 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9915 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
9916 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
9923 unsigned HOST_WIDE_INT idx
;
9925 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9926 if (!initializer_zerop (elt
))
9935 /* We need to loop through all elements to handle cases like
9936 "\0" and "\0foobar". */
9937 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9938 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9949 /* Build an empty statement at location LOC. */
9952 build_empty_stmt (location_t loc
)
9954 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9955 SET_EXPR_LOCATION (t
, loc
);
9960 /* Build an OpenMP clause with code CODE. LOC is the location of the
9964 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9969 length
= omp_clause_num_ops
[code
];
9970 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9972 record_node_allocation_statistics (OMP_CLAUSE
, size
);
9974 t
= ggc_alloc_tree_node (size
);
9975 memset (t
, 0, size
);
9976 TREE_SET_CODE (t
, OMP_CLAUSE
);
9977 OMP_CLAUSE_SET_CODE (t
, code
);
9978 OMP_CLAUSE_LOCATION (t
) = loc
;
9983 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9984 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9985 Except for the CODE and operand count field, other storage for the
9986 object is initialized to zeros. */
9989 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9992 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9994 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9995 gcc_assert (len
>= 1);
9997 record_node_allocation_statistics (code
, length
);
9999 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
10001 TREE_SET_CODE (t
, code
);
10003 /* Can't use TREE_OPERAND to store the length because if checking is
10004 enabled, it will try to check the length before we store it. :-P */
10005 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10010 /* Helper function for build_call_* functions; build a CALL_EXPR with
10011 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10012 the argument slots. */
10015 build_call_1 (tree return_type
, tree fn
, int nargs
)
10019 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10020 TREE_TYPE (t
) = return_type
;
10021 CALL_EXPR_FN (t
) = fn
;
10022 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10027 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10028 FN and a null static chain slot. NARGS is the number of call arguments
10029 which are specified as "..." arguments. */
10032 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10036 va_start (args
, nargs
);
10037 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10042 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10043 FN and a null static chain slot. NARGS is the number of call arguments
10044 which are specified as a va_list ARGS. */
10047 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10052 t
= build_call_1 (return_type
, fn
, nargs
);
10053 for (i
= 0; i
< nargs
; i
++)
10054 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10055 process_call_operands (t
);
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 a tree array ARGS. */
10064 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10065 int nargs
, const tree
*args
)
10070 t
= build_call_1 (return_type
, fn
, nargs
);
10071 for (i
= 0; i
< nargs
; i
++)
10072 CALL_EXPR_ARG (t
, i
) = args
[i
];
10073 process_call_operands (t
);
10074 SET_EXPR_LOCATION (t
, loc
);
10078 /* Like build_call_array, but takes a VEC. */
10081 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
10086 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
10087 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
10088 CALL_EXPR_ARG (ret
, ix
) = t
;
10089 process_call_operands (ret
);
10094 /* Returns true if it is possible to prove that the index of
10095 an array access REF (an ARRAY_REF expression) falls into the
10099 in_array_bounds_p (tree ref
)
10101 tree idx
= TREE_OPERAND (ref
, 1);
10104 if (TREE_CODE (idx
) != INTEGER_CST
)
10107 min
= array_ref_low_bound (ref
);
10108 max
= array_ref_up_bound (ref
);
10111 || TREE_CODE (min
) != INTEGER_CST
10112 || TREE_CODE (max
) != INTEGER_CST
)
10115 if (tree_int_cst_lt (idx
, min
)
10116 || tree_int_cst_lt (max
, idx
))
10122 /* Returns true if it is possible to prove that the range of
10123 an array access REF (an ARRAY_RANGE_REF expression) falls
10124 into the array bounds. */
10127 range_in_array_bounds_p (tree ref
)
10129 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10130 tree range_min
, range_max
, min
, max
;
10132 range_min
= TYPE_MIN_VALUE (domain_type
);
10133 range_max
= TYPE_MAX_VALUE (domain_type
);
10136 || TREE_CODE (range_min
) != INTEGER_CST
10137 || TREE_CODE (range_max
) != INTEGER_CST
)
10140 min
= array_ref_low_bound (ref
);
10141 max
= array_ref_up_bound (ref
);
10144 || TREE_CODE (min
) != INTEGER_CST
10145 || TREE_CODE (max
) != INTEGER_CST
)
10148 if (tree_int_cst_lt (range_min
, min
)
10149 || tree_int_cst_lt (max
, range_max
))
10155 /* Return true if T (assumed to be a DECL) must be assigned a memory
10159 needs_to_live_in_memory (const_tree t
)
10161 if (TREE_CODE (t
) == SSA_NAME
)
10162 t
= SSA_NAME_VAR (t
);
10164 return (TREE_ADDRESSABLE (t
)
10165 || is_global_var (t
)
10166 || (TREE_CODE (t
) == RESULT_DECL
10167 && !DECL_BY_REFERENCE (t
)
10168 && aggregate_value_p (t
, current_function_decl
)));
10171 /* Return value of a constant X and sign-extend it. */
10174 int_cst_value (const_tree x
)
10176 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10177 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10179 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10180 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10181 || TREE_INT_CST_HIGH (x
) == -1);
10183 if (bits
< HOST_BITS_PER_WIDE_INT
)
10185 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10187 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10189 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10195 /* Return value of a constant X and sign-extend it. */
10198 widest_int_cst_value (const_tree x
)
10200 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10201 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10203 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10204 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
10205 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10206 << HOST_BITS_PER_WIDE_INT
);
10208 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10209 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10210 || TREE_INT_CST_HIGH (x
) == -1);
10213 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10215 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10217 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10219 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10225 /* If TYPE is an integral or pointer type, return an integer type with
10226 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10227 if TYPE is already an integer type of signedness UNSIGNEDP. */
10230 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10232 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10235 if (!INTEGRAL_TYPE_P (type
)
10236 && !POINTER_TYPE_P (type
))
10239 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10242 /* If TYPE is an integral or pointer type, return an integer type with
10243 the same precision which is unsigned, or itself if TYPE is already an
10244 unsigned integer type. */
10247 unsigned_type_for (tree type
)
10249 return signed_or_unsigned_type_for (1, type
);
10252 /* If TYPE is an integral or pointer type, return an integer type with
10253 the same precision which is signed, or itself if TYPE is already a
10254 signed integer type. */
10257 signed_type_for (tree type
)
10259 return signed_or_unsigned_type_for (0, type
);
10262 /* Returns the largest value obtainable by casting something in INNER type to
10266 upper_bound_in_type (tree outer
, tree inner
)
10269 unsigned int det
= 0;
10270 unsigned oprec
= TYPE_PRECISION (outer
);
10271 unsigned iprec
= TYPE_PRECISION (inner
);
10274 /* Compute a unique number for every combination. */
10275 det
|= (oprec
> iprec
) ? 4 : 0;
10276 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10277 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10279 /* Determine the exponent to use. */
10284 /* oprec <= iprec, outer: signed, inner: don't care. */
10289 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10293 /* oprec > iprec, outer: signed, inner: signed. */
10297 /* oprec > iprec, outer: signed, inner: unsigned. */
10301 /* oprec > iprec, outer: unsigned, inner: signed. */
10305 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10309 gcc_unreachable ();
10312 /* Compute 2^^prec - 1. */
10313 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10316 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10317 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10321 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10322 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
10323 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10326 return double_int_to_tree (outer
, high
);
10329 /* Returns the smallest value obtainable by casting something in INNER type to
10333 lower_bound_in_type (tree outer
, tree inner
)
10336 unsigned oprec
= TYPE_PRECISION (outer
);
10337 unsigned iprec
= TYPE_PRECISION (inner
);
10339 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10341 if (TYPE_UNSIGNED (outer
)
10342 /* If we are widening something of an unsigned type, OUTER type
10343 contains all values of INNER type. In particular, both INNER
10344 and OUTER types have zero in common. */
10345 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10346 low
.low
= low
.high
= 0;
10349 /* If we are widening a signed type to another signed type, we
10350 want to obtain -2^^(iprec-1). If we are keeping the
10351 precision or narrowing to a signed type, we want to obtain
10353 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10355 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10357 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10358 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10362 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10363 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10368 return double_int_to_tree (outer
, low
);
10371 /* Return nonzero if two operands that are suitable for PHI nodes are
10372 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10373 SSA_NAME or invariant. Note that this is strictly an optimization.
10374 That is, callers of this function can directly call operand_equal_p
10375 and get the same result, only slower. */
10378 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10382 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10384 return operand_equal_p (arg0
, arg1
, 0);
10387 /* Returns number of zeros at the end of binary representation of X.
10389 ??? Use ffs if available? */
10392 num_ending_zeros (const_tree x
)
10394 unsigned HOST_WIDE_INT fr
, nfr
;
10395 unsigned num
, abits
;
10396 tree type
= TREE_TYPE (x
);
10398 if (TREE_INT_CST_LOW (x
) == 0)
10400 num
= HOST_BITS_PER_WIDE_INT
;
10401 fr
= TREE_INT_CST_HIGH (x
);
10406 fr
= TREE_INT_CST_LOW (x
);
10409 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10412 if (nfr
<< abits
== fr
)
10419 if (num
> TYPE_PRECISION (type
))
10420 num
= TYPE_PRECISION (type
);
10422 return build_int_cst_type (type
, num
);
10426 #define WALK_SUBTREE(NODE) \
10429 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10435 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10436 be walked whenever a type is seen in the tree. Rest of operands and return
10437 value are as for walk_tree. */
10440 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10441 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10443 tree result
= NULL_TREE
;
10445 switch (TREE_CODE (type
))
10448 case REFERENCE_TYPE
:
10449 /* We have to worry about mutually recursive pointers. These can't
10450 be written in C. They can in Ada. It's pathological, but
10451 there's an ACATS test (c38102a) that checks it. Deal with this
10452 by checking if we're pointing to another pointer, that one
10453 points to another pointer, that one does too, and we have no htab.
10454 If so, get a hash table. We check three levels deep to avoid
10455 the cost of the hash table if we don't need one. */
10456 if (POINTER_TYPE_P (TREE_TYPE (type
))
10457 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10458 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10461 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10469 /* ... fall through ... */
10472 WALK_SUBTREE (TREE_TYPE (type
));
10476 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10478 /* Fall through. */
10480 case FUNCTION_TYPE
:
10481 WALK_SUBTREE (TREE_TYPE (type
));
10485 /* We never want to walk into default arguments. */
10486 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10487 WALK_SUBTREE (TREE_VALUE (arg
));
10492 /* Don't follow this nodes's type if a pointer for fear that
10493 we'll have infinite recursion. If we have a PSET, then we
10496 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10497 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10498 WALK_SUBTREE (TREE_TYPE (type
));
10499 WALK_SUBTREE (TYPE_DOMAIN (type
));
10503 WALK_SUBTREE (TREE_TYPE (type
));
10504 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10514 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10515 called with the DATA and the address of each sub-tree. If FUNC returns a
10516 non-NULL value, the traversal is stopped, and the value returned by FUNC
10517 is returned. If PSET is non-NULL it is used to record the nodes visited,
10518 and to avoid visiting a node more than once. */
10521 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10522 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10524 enum tree_code code
;
10528 #define WALK_SUBTREE_TAIL(NODE) \
10532 goto tail_recurse; \
10537 /* Skip empty subtrees. */
10541 /* Don't walk the same tree twice, if the user has requested
10542 that we avoid doing so. */
10543 if (pset
&& pointer_set_insert (pset
, *tp
))
10546 /* Call the function. */
10548 result
= (*func
) (tp
, &walk_subtrees
, data
);
10550 /* If we found something, return it. */
10554 code
= TREE_CODE (*tp
);
10556 /* Even if we didn't, FUNC may have decided that there was nothing
10557 interesting below this point in the tree. */
10558 if (!walk_subtrees
)
10560 /* But we still need to check our siblings. */
10561 if (code
== TREE_LIST
)
10562 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10563 else if (code
== OMP_CLAUSE
)
10564 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10571 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10572 if (result
|| !walk_subtrees
)
10579 case IDENTIFIER_NODE
:
10586 case PLACEHOLDER_EXPR
:
10590 /* None of these have subtrees other than those already walked
10595 WALK_SUBTREE (TREE_VALUE (*tp
));
10596 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10601 int len
= TREE_VEC_LENGTH (*tp
);
10606 /* Walk all elements but the first. */
10608 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10610 /* Now walk the first one as a tail call. */
10611 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10615 WALK_SUBTREE (TREE_REALPART (*tp
));
10616 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10620 unsigned HOST_WIDE_INT idx
;
10621 constructor_elt
*ce
;
10624 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10626 WALK_SUBTREE (ce
->value
);
10631 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10636 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10638 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10639 into declarations that are just mentioned, rather than
10640 declared; they don't really belong to this part of the tree.
10641 And, we can see cycles: the initializer for a declaration
10642 can refer to the declaration itself. */
10643 WALK_SUBTREE (DECL_INITIAL (decl
));
10644 WALK_SUBTREE (DECL_SIZE (decl
));
10645 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10647 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10650 case STATEMENT_LIST
:
10652 tree_stmt_iterator i
;
10653 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10654 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10659 switch (OMP_CLAUSE_CODE (*tp
))
10661 case OMP_CLAUSE_PRIVATE
:
10662 case OMP_CLAUSE_SHARED
:
10663 case OMP_CLAUSE_FIRSTPRIVATE
:
10664 case OMP_CLAUSE_COPYIN
:
10665 case OMP_CLAUSE_COPYPRIVATE
:
10666 case OMP_CLAUSE_FINAL
:
10667 case OMP_CLAUSE_IF
:
10668 case OMP_CLAUSE_NUM_THREADS
:
10669 case OMP_CLAUSE_SCHEDULE
:
10670 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10673 case OMP_CLAUSE_NOWAIT
:
10674 case OMP_CLAUSE_ORDERED
:
10675 case OMP_CLAUSE_DEFAULT
:
10676 case OMP_CLAUSE_UNTIED
:
10677 case OMP_CLAUSE_MERGEABLE
:
10678 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10680 case OMP_CLAUSE_LASTPRIVATE
:
10681 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10682 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10683 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10685 case OMP_CLAUSE_COLLAPSE
:
10688 for (i
= 0; i
< 3; i
++)
10689 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10690 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10693 case OMP_CLAUSE_REDUCTION
:
10696 for (i
= 0; i
< 4; i
++)
10697 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10698 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10702 gcc_unreachable ();
10710 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10711 But, we only want to walk once. */
10712 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10713 for (i
= 0; i
< len
; ++i
)
10714 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10715 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10719 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10720 defining. We only want to walk into these fields of a type in this
10721 case and not in the general case of a mere reference to the type.
10723 The criterion is as follows: if the field can be an expression, it
10724 must be walked only here. This should be in keeping with the fields
10725 that are directly gimplified in gimplify_type_sizes in order for the
10726 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10727 variable-sized types.
10729 Note that DECLs get walked as part of processing the BIND_EXPR. */
10730 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10732 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10733 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10736 /* Call the function for the type. See if it returns anything or
10737 doesn't want us to continue. If we are to continue, walk both
10738 the normal fields and those for the declaration case. */
10739 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10740 if (result
|| !walk_subtrees
)
10743 /* But do not walk a pointed-to type since it may itself need to
10744 be walked in the declaration case if it isn't anonymous. */
10745 if (!POINTER_TYPE_P (*type_p
))
10747 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10752 /* If this is a record type, also walk the fields. */
10753 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10757 for (field
= TYPE_FIELDS (*type_p
); field
;
10758 field
= DECL_CHAIN (field
))
10760 /* We'd like to look at the type of the field, but we can
10761 easily get infinite recursion. So assume it's pointed
10762 to elsewhere in the tree. Also, ignore things that
10764 if (TREE_CODE (field
) != FIELD_DECL
)
10767 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10768 WALK_SUBTREE (DECL_SIZE (field
));
10769 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10770 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10771 WALK_SUBTREE (DECL_QUALIFIER (field
));
10775 /* Same for scalar types. */
10776 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10777 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10778 || TREE_CODE (*type_p
) == INTEGER_TYPE
10779 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10780 || TREE_CODE (*type_p
) == REAL_TYPE
)
10782 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10783 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10786 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10787 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10792 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10796 /* Walk over all the sub-trees of this operand. */
10797 len
= TREE_OPERAND_LENGTH (*tp
);
10799 /* Go through the subtrees. We need to do this in forward order so
10800 that the scope of a FOR_EXPR is handled properly. */
10803 for (i
= 0; i
< len
- 1; ++i
)
10804 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10805 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10808 /* If this is a type, walk the needed fields in the type. */
10809 else if (TYPE_P (*tp
))
10810 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10814 /* We didn't find what we were looking for. */
10817 #undef WALK_SUBTREE_TAIL
10819 #undef WALK_SUBTREE
10821 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10824 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10828 struct pointer_set_t
*pset
;
10830 pset
= pointer_set_create ();
10831 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10832 pointer_set_destroy (pset
);
10838 tree_block (tree t
)
10840 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10842 if (IS_EXPR_CODE_CLASS (c
))
10843 return &t
->exp
.block
;
10844 gcc_unreachable ();
10848 /* Create a nameless artificial label and put it in the current
10849 function context. The label has a location of LOC. Returns the
10850 newly created label. */
10853 create_artificial_label (location_t loc
)
10855 tree lab
= build_decl (loc
,
10856 LABEL_DECL
, NULL_TREE
, void_type_node
);
10858 DECL_ARTIFICIAL (lab
) = 1;
10859 DECL_IGNORED_P (lab
) = 1;
10860 DECL_CONTEXT (lab
) = current_function_decl
;
10864 /* Given a tree, try to return a useful variable name that we can use
10865 to prefix a temporary that is being assigned the value of the tree.
10866 I.E. given <temp> = &A, return A. */
10871 tree stripped_decl
;
10874 STRIP_NOPS (stripped_decl
);
10875 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10876 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10879 switch (TREE_CODE (stripped_decl
))
10882 return get_name (TREE_OPERAND (stripped_decl
, 0));
10889 /* Return true if TYPE has a variable argument list. */
10892 stdarg_p (const_tree fntype
)
10894 function_args_iterator args_iter
;
10895 tree n
= NULL_TREE
, t
;
10900 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10905 return n
!= NULL_TREE
&& n
!= void_type_node
;
10908 /* Return true if TYPE has a prototype. */
10911 prototype_p (tree fntype
)
10915 gcc_assert (fntype
!= NULL_TREE
);
10917 t
= TYPE_ARG_TYPES (fntype
);
10918 return (t
!= NULL_TREE
);
10921 /* If BLOCK is inlined from an __attribute__((__artificial__))
10922 routine, return pointer to location from where it has been
10925 block_nonartificial_location (tree block
)
10927 location_t
*ret
= NULL
;
10929 while (block
&& TREE_CODE (block
) == BLOCK
10930 && BLOCK_ABSTRACT_ORIGIN (block
))
10932 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10934 while (TREE_CODE (ao
) == BLOCK
10935 && BLOCK_ABSTRACT_ORIGIN (ao
)
10936 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10937 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10939 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10941 /* If AO is an artificial inline, point RET to the
10942 call site locus at which it has been inlined and continue
10943 the loop, in case AO's caller is also an artificial
10945 if (DECL_DECLARED_INLINE_P (ao
)
10946 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10947 ret
= &BLOCK_SOURCE_LOCATION (block
);
10951 else if (TREE_CODE (ao
) != BLOCK
)
10954 block
= BLOCK_SUPERCONTEXT (block
);
10960 /* If EXP is inlined from an __attribute__((__artificial__))
10961 function, return the location of the original call expression. */
10964 tree_nonartificial_location (tree exp
)
10966 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10971 return EXPR_LOCATION (exp
);
10975 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10978 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10981 cl_option_hash_hash (const void *x
)
10983 const_tree
const t
= (const_tree
) x
;
10987 hashval_t hash
= 0;
10989 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10991 p
= (const char *)TREE_OPTIMIZATION (t
);
10992 len
= sizeof (struct cl_optimization
);
10995 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10997 p
= (const char *)TREE_TARGET_OPTION (t
);
10998 len
= sizeof (struct cl_target_option
);
11002 gcc_unreachable ();
11004 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11006 for (i
= 0; i
< len
; i
++)
11008 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11013 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11014 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11018 cl_option_hash_eq (const void *x
, const void *y
)
11020 const_tree
const xt
= (const_tree
) x
;
11021 const_tree
const yt
= (const_tree
) y
;
11026 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11029 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11031 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11032 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11033 len
= sizeof (struct cl_optimization
);
11036 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11038 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11039 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11040 len
= sizeof (struct cl_target_option
);
11044 gcc_unreachable ();
11046 return (memcmp (xp
, yp
, len
) == 0);
11049 /* Build an OPTIMIZATION_NODE based on the current options. */
11052 build_optimization_node (void)
11057 /* Use the cache of optimization nodes. */
11059 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11062 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11066 /* Insert this one into the hash table. */
11067 t
= cl_optimization_node
;
11070 /* Make a new node for next time round. */
11071 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11077 /* Build a TARGET_OPTION_NODE based on the current options. */
11080 build_target_option_node (void)
11085 /* Use the cache of optimization nodes. */
11087 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11090 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11094 /* Insert this one into the hash table. */
11095 t
= cl_target_option_node
;
11098 /* Make a new node for next time round. */
11099 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11105 /* Determine the "ultimate origin" of a block. The block may be an inlined
11106 instance of an inlined instance of a block which is local to an inline
11107 function, so we have to trace all of the way back through the origin chain
11108 to find out what sort of node actually served as the original seed for the
11112 block_ultimate_origin (const_tree block
)
11114 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11116 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11117 nodes in the function to point to themselves; ignore that if
11118 we're trying to output the abstract instance of this function. */
11119 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11122 if (immediate_origin
== NULL_TREE
)
11127 tree lookahead
= immediate_origin
;
11131 ret_val
= lookahead
;
11132 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11133 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11135 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11137 /* The block's abstract origin chain may not be the *ultimate* origin of
11138 the block. It could lead to a DECL that has an abstract origin set.
11139 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11140 will give us if it has one). Note that DECL's abstract origins are
11141 supposed to be the most distant ancestor (or so decl_ultimate_origin
11142 claims), so we don't need to loop following the DECL origins. */
11143 if (DECL_P (ret_val
))
11144 return DECL_ORIGIN (ret_val
);
11150 /* Return true if T1 and T2 are equivalent lists. */
11153 list_equal_p (const_tree t1
, const_tree t2
)
11155 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11156 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11161 /* Return true iff conversion in EXP generates no instruction. Mark
11162 it inline so that we fully inline into the stripping functions even
11163 though we have two uses of this function. */
11166 tree_nop_conversion (const_tree exp
)
11168 tree outer_type
, inner_type
;
11170 if (!CONVERT_EXPR_P (exp
)
11171 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11173 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11176 outer_type
= TREE_TYPE (exp
);
11177 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11182 /* Use precision rather then machine mode when we can, which gives
11183 the correct answer even for submode (bit-field) types. */
11184 if ((INTEGRAL_TYPE_P (outer_type
)
11185 || POINTER_TYPE_P (outer_type
)
11186 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11187 && (INTEGRAL_TYPE_P (inner_type
)
11188 || POINTER_TYPE_P (inner_type
)
11189 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11190 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11192 /* Otherwise fall back on comparing machine modes (e.g. for
11193 aggregate types, floats). */
11194 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11197 /* Return true iff conversion in EXP generates no instruction. Don't
11198 consider conversions changing the signedness. */
11201 tree_sign_nop_conversion (const_tree exp
)
11203 tree outer_type
, inner_type
;
11205 if (!tree_nop_conversion (exp
))
11208 outer_type
= TREE_TYPE (exp
);
11209 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11211 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11212 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11215 /* Strip conversions from EXP according to tree_nop_conversion and
11216 return the resulting expression. */
11219 tree_strip_nop_conversions (tree exp
)
11221 while (tree_nop_conversion (exp
))
11222 exp
= TREE_OPERAND (exp
, 0);
11226 /* Strip conversions from EXP according to tree_sign_nop_conversion
11227 and return the resulting expression. */
11230 tree_strip_sign_nop_conversions (tree exp
)
11232 while (tree_sign_nop_conversion (exp
))
11233 exp
= TREE_OPERAND (exp
, 0);
11237 /* Avoid any floating point extensions from EXP. */
11239 strip_float_extensions (tree exp
)
11241 tree sub
, expt
, subt
;
11243 /* For floating point constant look up the narrowest type that can hold
11244 it properly and handle it like (type)(narrowest_type)constant.
11245 This way we can optimize for instance a=a*2.0 where "a" is float
11246 but 2.0 is double constant. */
11247 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11249 REAL_VALUE_TYPE orig
;
11252 orig
= TREE_REAL_CST (exp
);
11253 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11254 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11255 type
= float_type_node
;
11256 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11257 > TYPE_PRECISION (double_type_node
)
11258 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11259 type
= double_type_node
;
11261 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11264 if (!CONVERT_EXPR_P (exp
))
11267 sub
= TREE_OPERAND (exp
, 0);
11268 subt
= TREE_TYPE (sub
);
11269 expt
= TREE_TYPE (exp
);
11271 if (!FLOAT_TYPE_P (subt
))
11274 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11277 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11280 return strip_float_extensions (sub
);
11283 /* Strip out all handled components that produce invariant
11287 strip_invariant_refs (const_tree op
)
11289 while (handled_component_p (op
))
11291 switch (TREE_CODE (op
))
11294 case ARRAY_RANGE_REF
:
11295 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11296 || TREE_OPERAND (op
, 2) != NULL_TREE
11297 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11301 case COMPONENT_REF
:
11302 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11308 op
= TREE_OPERAND (op
, 0);
11314 static GTY(()) tree gcc_eh_personality_decl
;
11316 /* Return the GCC personality function decl. */
11319 lhd_gcc_personality (void)
11321 if (!gcc_eh_personality_decl
)
11322 gcc_eh_personality_decl
= build_personality_function ("gcc");
11323 return gcc_eh_personality_decl
;
11326 /* Try to find a base info of BINFO that would have its field decl at offset
11327 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11328 found, return, otherwise return NULL_TREE. */
11331 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11333 tree type
= BINFO_TYPE (binfo
);
11337 HOST_WIDE_INT pos
, size
;
11341 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11346 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11348 if (TREE_CODE (fld
) != FIELD_DECL
)
11351 pos
= int_bit_position (fld
);
11352 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11353 if (pos
<= offset
&& (pos
+ size
) > offset
)
11356 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11359 if (!DECL_ARTIFICIAL (fld
))
11361 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11365 /* Offset 0 indicates the primary base, whose vtable contents are
11366 represented in the binfo for the derived class. */
11367 else if (offset
!= 0)
11369 tree base_binfo
, found_binfo
= NULL_TREE
;
11370 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11371 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11373 found_binfo
= base_binfo
;
11378 binfo
= found_binfo
;
11381 type
= TREE_TYPE (fld
);
11386 /* Returns true if X is a typedef decl. */
11389 is_typedef_decl (tree x
)
11391 return (x
&& TREE_CODE (x
) == TYPE_DECL
11392 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11395 /* Returns true iff TYPE is a type variant created for a typedef. */
11398 typedef_variant_p (tree type
)
11400 return is_typedef_decl (TYPE_NAME (type
));
11403 /* Warn about a use of an identifier which was marked deprecated. */
11405 warn_deprecated_use (tree node
, tree attr
)
11409 if (node
== 0 || !warn_deprecated_decl
)
11415 attr
= DECL_ATTRIBUTES (node
);
11416 else if (TYPE_P (node
))
11418 tree decl
= TYPE_STUB_DECL (node
);
11420 attr
= lookup_attribute ("deprecated",
11421 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11426 attr
= lookup_attribute ("deprecated", attr
);
11429 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11435 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11437 warning (OPT_Wdeprecated_declarations
,
11438 "%qD is deprecated (declared at %s:%d): %s",
11439 node
, xloc
.file
, xloc
.line
, msg
);
11441 warning (OPT_Wdeprecated_declarations
,
11442 "%qD is deprecated (declared at %s:%d)",
11443 node
, xloc
.file
, xloc
.line
);
11445 else if (TYPE_P (node
))
11447 tree what
= NULL_TREE
;
11448 tree decl
= TYPE_STUB_DECL (node
);
11450 if (TYPE_NAME (node
))
11452 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11453 what
= TYPE_NAME (node
);
11454 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11455 && DECL_NAME (TYPE_NAME (node
)))
11456 what
= DECL_NAME (TYPE_NAME (node
));
11461 expanded_location xloc
11462 = expand_location (DECL_SOURCE_LOCATION (decl
));
11466 warning (OPT_Wdeprecated_declarations
,
11467 "%qE is deprecated (declared at %s:%d): %s",
11468 what
, xloc
.file
, xloc
.line
, msg
);
11470 warning (OPT_Wdeprecated_declarations
,
11471 "%qE is deprecated (declared at %s:%d)", what
,
11472 xloc
.file
, xloc
.line
);
11477 warning (OPT_Wdeprecated_declarations
,
11478 "type is deprecated (declared at %s:%d): %s",
11479 xloc
.file
, xloc
.line
, msg
);
11481 warning (OPT_Wdeprecated_declarations
,
11482 "type is deprecated (declared at %s:%d)",
11483 xloc
.file
, xloc
.line
);
11491 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11494 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11499 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11502 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11508 #include "gt-tree.h"