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 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"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
64 /* Tree code classes. */
66 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 #define END_OF_BASE_TREE_CODES tcc_exceptional,
69 const enum tree_code_class tree_code_type
[] = {
70 #include "all-tree.def"
74 #undef END_OF_BASE_TREE_CODES
76 /* Table indexed by tree code giving number of expression
77 operands beyond the fixed part of the node structure.
78 Not used for types or decls. */
80 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
81 #define END_OF_BASE_TREE_CODES 0,
83 const unsigned char tree_code_length
[] = {
84 #include "all-tree.def"
88 #undef END_OF_BASE_TREE_CODES
90 /* Names of tree components.
91 Used for printing out the tree and error messages. */
92 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
93 #define END_OF_BASE_TREE_CODES "@dummy",
95 const char *const tree_code_name
[] = {
96 #include "all-tree.def"
100 #undef END_OF_BASE_TREE_CODES
102 /* Each tree code class has an associated string representation.
103 These must correspond to the tree_code_class entries. */
105 const char *const tree_code_class_strings
[] =
120 /* obstack.[ch] explicitly declined to prototype this. */
121 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
123 #ifdef GATHER_STATISTICS
124 /* Statistics-gathering stuff. */
126 int tree_node_counts
[(int) all_kinds
];
127 int tree_node_sizes
[(int) all_kinds
];
129 /* Keep in sync with tree.h:enum tree_node_kind. */
130 static const char * const tree_node_kind_names
[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid
;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid
= 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid
;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash
{
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
179 htab_t type_hash_table
;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node
;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
184 htab_t int_cst_hash_table
;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node
;
192 static GTY (()) tree cl_target_option_node
;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
194 htab_t cl_option_hash_table
;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
200 htab_t debug_expr_for_decl
;
202 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
203 htab_t value_expr_for_decl
;
205 static GTY ((if_marked ("tree_priority_map_marked_p"),
206 param_is (struct tree_priority_map
)))
207 htab_t init_priority_for_decl
;
209 static void set_type_quals (tree
, int);
210 static int type_hash_eq (const void *, const void *);
211 static hashval_t
type_hash_hash (const void *);
212 static hashval_t
int_cst_hash_hash (const void *);
213 static int int_cst_hash_eq (const void *, const void *);
214 static hashval_t
cl_option_hash_hash (const void *);
215 static int cl_option_hash_eq (const void *, const void *);
216 static void print_type_hash_statistics (void);
217 static void print_debug_expr_statistics (void);
218 static void print_value_expr_statistics (void);
219 static int type_hash_marked_p (const void *);
220 static unsigned int type_hash_list (const_tree
, hashval_t
);
221 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
223 tree global_trees
[TI_MAX
];
224 tree integer_types
[itk_none
];
226 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops
[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 1, /* OMP_CLAUSE_IF */
240 1, /* OMP_CLAUSE_NUM_THREADS */
241 1, /* OMP_CLAUSE_SCHEDULE */
242 0, /* OMP_CLAUSE_NOWAIT */
243 0, /* OMP_CLAUSE_ORDERED */
244 0, /* OMP_CLAUSE_DEFAULT */
245 3, /* OMP_CLAUSE_COLLAPSE */
246 0 /* OMP_CLAUSE_UNTIED */
249 const char * const omp_clause_code_name
[] =
270 /* Return the tree node structure used by tree code CODE. */
272 static inline enum tree_node_structure_enum
273 tree_node_structure_for_code (enum tree_code code
)
275 switch (TREE_CODE_CLASS (code
))
277 case tcc_declaration
:
282 return TS_FIELD_DECL
;
288 return TS_LABEL_DECL
;
290 return TS_RESULT_DECL
;
291 case DEBUG_EXPR_DECL
:
294 return TS_CONST_DECL
;
298 return TS_FUNCTION_DECL
;
300 return TS_DECL_NON_COMMON
;
313 default: /* tcc_constant and tcc_exceptional */
318 /* tcc_constant cases. */
319 case INTEGER_CST
: return TS_INT_CST
;
320 case REAL_CST
: return TS_REAL_CST
;
321 case FIXED_CST
: return TS_FIXED_CST
;
322 case COMPLEX_CST
: return TS_COMPLEX
;
323 case VECTOR_CST
: return TS_VECTOR
;
324 case STRING_CST
: return TS_STRING
;
325 /* tcc_exceptional cases. */
326 case ERROR_MARK
: return TS_COMMON
;
327 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
328 case TREE_LIST
: return TS_LIST
;
329 case TREE_VEC
: return TS_VEC
;
330 case SSA_NAME
: return TS_SSA_NAME
;
331 case PLACEHOLDER_EXPR
: return TS_COMMON
;
332 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
333 case BLOCK
: return TS_BLOCK
;
334 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
335 case TREE_BINFO
: return TS_BINFO
;
336 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
337 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
338 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
346 /* Initialize tree_contains_struct to describe the hierarchy of tree
350 initialize_tree_contains_struct (void)
354 #define MARK_TS_BASE(C) \
356 tree_contains_struct[C][TS_BASE] = 1; \
359 #define MARK_TS_COMMON(C) \
362 tree_contains_struct[C][TS_COMMON] = 1; \
365 #define MARK_TS_DECL_MINIMAL(C) \
367 MARK_TS_COMMON (C); \
368 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
371 #define MARK_TS_DECL_COMMON(C) \
373 MARK_TS_DECL_MINIMAL (C); \
374 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
377 #define MARK_TS_DECL_WRTL(C) \
379 MARK_TS_DECL_COMMON (C); \
380 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
383 #define MARK_TS_DECL_WITH_VIS(C) \
385 MARK_TS_DECL_WRTL (C); \
386 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
389 #define MARK_TS_DECL_NON_COMMON(C) \
391 MARK_TS_DECL_WITH_VIS (C); \
392 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
395 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
398 enum tree_node_structure_enum ts_code
;
400 code
= (enum tree_code
) i
;
401 ts_code
= tree_node_structure_for_code (code
);
403 /* Mark the TS structure itself. */
404 tree_contains_struct
[code
][ts_code
] = 1;
406 /* Mark all the structures that TS is derived from. */
420 case TS_DECL_MINIMAL
:
428 case TS_STATEMENT_LIST
:
431 case TS_OPTIMIZATION
:
432 case TS_TARGET_OPTION
:
433 MARK_TS_COMMON (code
);
437 MARK_TS_DECL_MINIMAL (code
);
441 MARK_TS_DECL_COMMON (code
);
444 case TS_DECL_NON_COMMON
:
445 MARK_TS_DECL_WITH_VIS (code
);
448 case TS_DECL_WITH_VIS
:
453 MARK_TS_DECL_WRTL (code
);
457 MARK_TS_DECL_COMMON (code
);
461 MARK_TS_DECL_WITH_VIS (code
);
465 case TS_FUNCTION_DECL
:
466 MARK_TS_DECL_NON_COMMON (code
);
474 /* Basic consistency checks for attributes used in fold. */
475 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
476 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
]);
477 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
478 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
479 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
480 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
481 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
482 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
483 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
484 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
485 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
486 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
487 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
]);
488 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
489 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
490 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
491 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
492 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
493 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
494 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
495 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
496 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
498 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
499 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
500 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
502 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
503 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
504 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
505 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
]);
506 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
507 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
508 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
509 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
510 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
511 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
512 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
513 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
514 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
515 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
518 #undef MARK_TS_COMMON
519 #undef MARK_TS_DECL_MINIMAL
520 #undef MARK_TS_DECL_COMMON
521 #undef MARK_TS_DECL_WRTL
522 #undef MARK_TS_DECL_WITH_VIS
523 #undef MARK_TS_DECL_NON_COMMON
532 /* Initialize the hash table of types. */
533 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
536 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
537 tree_decl_map_eq
, 0);
539 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
540 tree_decl_map_eq
, 0);
541 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
542 tree_priority_map_eq
, 0);
544 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
545 int_cst_hash_eq
, NULL
);
547 int_cst_node
= make_node (INTEGER_CST
);
549 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
550 cl_option_hash_eq
, NULL
);
552 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
553 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
555 /* Initialize the tree_contains_struct array. */
556 initialize_tree_contains_struct ();
557 lang_hooks
.init_ts ();
561 /* The name of the object as the assembler will see it (but before any
562 translations made by ASM_OUTPUT_LABELREF). Often this is the same
563 as DECL_NAME. It is an IDENTIFIER_NODE. */
565 decl_assembler_name (tree decl
)
567 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
568 lang_hooks
.set_decl_assembler_name (decl
);
569 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
572 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
575 decl_assembler_name_equal (tree decl
, const_tree asmname
)
577 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
578 const char *decl_str
;
579 const char *asmname_str
;
582 if (decl_asmname
== asmname
)
585 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
586 asmname_str
= IDENTIFIER_POINTER (asmname
);
589 /* If the target assembler name was set by the user, things are trickier.
590 We have a leading '*' to begin with. After that, it's arguable what
591 is the correct thing to do with -fleading-underscore. Arguably, we've
592 historically been doing the wrong thing in assemble_alias by always
593 printing the leading underscore. Since we're not changing that, make
594 sure user_label_prefix follows the '*' before matching. */
595 if (decl_str
[0] == '*')
597 size_t ulp_len
= strlen (user_label_prefix
);
603 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
604 decl_str
+= ulp_len
, test
=true;
608 if (asmname_str
[0] == '*')
610 size_t ulp_len
= strlen (user_label_prefix
);
616 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
617 asmname_str
+= ulp_len
, test
=true;
624 return strcmp (decl_str
, asmname_str
) == 0;
627 /* Hash asmnames ignoring the user specified marks. */
630 decl_assembler_name_hash (const_tree asmname
)
632 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
634 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
635 size_t ulp_len
= strlen (user_label_prefix
);
639 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
642 return htab_hash_string (decl_str
);
645 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
648 /* Compute the number of bytes occupied by a tree with code CODE.
649 This function cannot be used for nodes that have variable sizes,
650 including TREE_VEC, STRING_CST, and CALL_EXPR. */
652 tree_code_size (enum tree_code code
)
654 switch (TREE_CODE_CLASS (code
))
656 case tcc_declaration
: /* A decl node */
661 return sizeof (struct tree_field_decl
);
663 return sizeof (struct tree_parm_decl
);
665 return sizeof (struct tree_var_decl
);
667 return sizeof (struct tree_label_decl
);
669 return sizeof (struct tree_result_decl
);
671 return sizeof (struct tree_const_decl
);
673 return sizeof (struct tree_type_decl
);
675 return sizeof (struct tree_function_decl
);
676 case DEBUG_EXPR_DECL
:
677 return sizeof (struct tree_decl_with_rtl
);
679 return sizeof (struct tree_decl_non_common
);
683 case tcc_type
: /* a type node */
684 return sizeof (struct tree_type
);
686 case tcc_reference
: /* a reference */
687 case tcc_expression
: /* an expression */
688 case tcc_statement
: /* an expression with side effects */
689 case tcc_comparison
: /* a comparison expression */
690 case tcc_unary
: /* a unary arithmetic expression */
691 case tcc_binary
: /* a binary arithmetic expression */
692 return (sizeof (struct tree_exp
)
693 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
695 case tcc_constant
: /* a constant */
698 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
699 case REAL_CST
: return sizeof (struct tree_real_cst
);
700 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
701 case COMPLEX_CST
: return sizeof (struct tree_complex
);
702 case VECTOR_CST
: return sizeof (struct tree_vector
);
703 case STRING_CST
: gcc_unreachable ();
705 return lang_hooks
.tree_size (code
);
708 case tcc_exceptional
: /* something random, like an identifier. */
711 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
712 case TREE_LIST
: return sizeof (struct tree_list
);
715 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
718 case OMP_CLAUSE
: gcc_unreachable ();
720 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
722 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
723 case BLOCK
: return sizeof (struct tree_block
);
724 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
725 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
726 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
729 return lang_hooks
.tree_size (code
);
737 /* Compute the number of bytes occupied by NODE. This routine only
738 looks at TREE_CODE, except for those nodes that have variable sizes. */
740 tree_size (const_tree node
)
742 const enum tree_code code
= TREE_CODE (node
);
746 return (offsetof (struct tree_binfo
, base_binfos
)
747 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
750 return (sizeof (struct tree_vec
)
751 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
754 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
757 return (sizeof (struct tree_omp_clause
)
758 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
762 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
763 return (sizeof (struct tree_exp
)
764 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
766 return tree_code_size (code
);
770 /* Return a newly allocated node of code CODE. For decl and type
771 nodes, some other fields are initialized. The rest of the node is
772 initialized to zero. This function cannot be used for TREE_VEC or
773 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
775 Achoo! I got a code in the node. */
778 make_node_stat (enum tree_code code MEM_STAT_DECL
)
781 enum tree_code_class type
= TREE_CODE_CLASS (code
);
782 size_t length
= tree_code_size (code
);
783 #ifdef GATHER_STATISTICS
788 case tcc_declaration
: /* A decl node */
792 case tcc_type
: /* a type node */
796 case tcc_statement
: /* an expression with side effects */
800 case tcc_reference
: /* a reference */
804 case tcc_expression
: /* an expression */
805 case tcc_comparison
: /* a comparison expression */
806 case tcc_unary
: /* a unary arithmetic expression */
807 case tcc_binary
: /* a binary arithmetic expression */
811 case tcc_constant
: /* a constant */
815 case tcc_exceptional
: /* something random, like an identifier. */
818 case IDENTIFIER_NODE
:
831 kind
= ssa_name_kind
;
852 tree_node_counts
[(int) kind
]++;
853 tree_node_sizes
[(int) kind
] += length
;
856 t
= ggc_alloc_zone_cleared_tree_node_stat (
857 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
858 length PASS_MEM_STAT
);
859 TREE_SET_CODE (t
, code
);
864 TREE_SIDE_EFFECTS (t
) = 1;
867 case tcc_declaration
:
868 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
870 if (code
== FUNCTION_DECL
)
872 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
873 DECL_MODE (t
) = FUNCTION_MODE
;
878 DECL_SOURCE_LOCATION (t
) = input_location
;
879 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
880 DECL_UID (t
) = --next_debug_decl_uid
;
883 DECL_UID (t
) = next_decl_uid
++;
884 SET_DECL_PT_UID (t
, -1);
886 if (TREE_CODE (t
) == LABEL_DECL
)
887 LABEL_DECL_UID (t
) = -1;
892 TYPE_UID (t
) = next_type_uid
++;
893 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
894 TYPE_USER_ALIGN (t
) = 0;
895 TYPE_MAIN_VARIANT (t
) = t
;
896 TYPE_CANONICAL (t
) = t
;
898 /* Default to no attributes for type, but let target change that. */
899 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
900 targetm
.set_default_type_attributes (t
);
902 /* We have not yet computed the alias set for this type. */
903 TYPE_ALIAS_SET (t
) = -1;
907 TREE_CONSTANT (t
) = 1;
916 case PREDECREMENT_EXPR
:
917 case PREINCREMENT_EXPR
:
918 case POSTDECREMENT_EXPR
:
919 case POSTINCREMENT_EXPR
:
920 /* All of these have side-effects, no matter what their
922 TREE_SIDE_EFFECTS (t
) = 1;
931 /* Other classes need no special treatment. */
938 /* Return a new node with the same contents as NODE except that its
939 TREE_CHAIN is zero and it has a fresh uid. */
942 copy_node_stat (tree node MEM_STAT_DECL
)
945 enum tree_code code
= TREE_CODE (node
);
948 gcc_assert (code
!= STATEMENT_LIST
);
950 length
= tree_size (node
);
951 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
952 memcpy (t
, node
, length
);
955 TREE_ASM_WRITTEN (t
) = 0;
956 TREE_VISITED (t
) = 0;
957 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
958 *DECL_VAR_ANN_PTR (t
) = 0;
960 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
962 if (code
== DEBUG_EXPR_DECL
)
963 DECL_UID (t
) = --next_debug_decl_uid
;
966 DECL_UID (t
) = next_decl_uid
++;
967 if (DECL_PT_UID_SET_P (node
))
968 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
970 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
971 && DECL_HAS_VALUE_EXPR_P (node
))
973 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
974 DECL_HAS_VALUE_EXPR_P (t
) = 1;
976 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
978 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
979 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
982 else if (TREE_CODE_CLASS (code
) == tcc_type
)
984 TYPE_UID (t
) = next_type_uid
++;
985 /* The following is so that the debug code for
986 the copy is different from the original type.
987 The two statements usually duplicate each other
988 (because they clear fields of the same union),
989 but the optimizer should catch that. */
990 TYPE_SYMTAB_POINTER (t
) = 0;
991 TYPE_SYMTAB_ADDRESS (t
) = 0;
993 /* Do not copy the values cache. */
994 if (TYPE_CACHED_VALUES_P(t
))
996 TYPE_CACHED_VALUES_P (t
) = 0;
997 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1004 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1005 For example, this can copy a list made of TREE_LIST nodes. */
1008 copy_list (tree list
)
1016 head
= prev
= copy_node (list
);
1017 next
= TREE_CHAIN (list
);
1020 TREE_CHAIN (prev
) = copy_node (next
);
1021 prev
= TREE_CHAIN (prev
);
1022 next
= TREE_CHAIN (next
);
1028 /* Create an INT_CST node with a LOW value sign extended. */
1031 build_int_cst (tree type
, HOST_WIDE_INT low
)
1033 /* Support legacy code. */
1035 type
= integer_type_node
;
1037 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1040 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1041 if it is negative. This function is similar to build_int_cst, but
1042 the extra bits outside of the type precision are cleared. Constants
1043 with these extra bits may confuse the fold so that it detects overflows
1044 even in cases when they do not occur, and in general should be avoided.
1045 We cannot however make this a default behavior of build_int_cst without
1046 more intrusive changes, since there are parts of gcc that rely on the extra
1047 precision of the integer constants. */
1050 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1052 unsigned HOST_WIDE_INT low1
;
1057 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
1059 return build_int_cst_wide (type
, low1
, hi
);
1062 /* Constructs tree in type TYPE from with value given by CST. Signedness
1063 of CST is assumed to be the same as the signedness of TYPE. */
1066 double_int_to_tree (tree type
, double_int cst
)
1068 /* Size types *are* sign extended. */
1069 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1070 || (TREE_CODE (type
) == INTEGER_TYPE
1071 && TYPE_IS_SIZETYPE (type
)));
1073 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1075 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1078 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1079 to be the same as the signedness of TYPE. */
1082 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1084 /* Size types *are* sign extended. */
1085 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1086 || (TREE_CODE (type
) == INTEGER_TYPE
1087 && TYPE_IS_SIZETYPE (type
)));
1090 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1092 return double_int_equal_p (cst
, ext
);
1095 /* We force the double_int CST to the range of the type TYPE by sign or
1096 zero extending it. OVERFLOWABLE indicates if we are interested in
1097 overflow of the value, when >0 we are only interested in signed
1098 overflow, for <0 we are interested in any overflow. OVERFLOWED
1099 indicates whether overflow has already occurred. CONST_OVERFLOWED
1100 indicates whether constant overflow has already occurred. We force
1101 T's value to be within range of T's type (by setting to 0 or 1 all
1102 the bits outside the type's range). We set TREE_OVERFLOWED if,
1103 OVERFLOWED is nonzero,
1104 or OVERFLOWABLE is >0 and signed overflow occurs
1105 or OVERFLOWABLE is <0 and any overflow occurs
1106 We return a new tree node for the extended double_int. The node
1107 is shared if no overflow flags are set. */
1111 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1114 bool sign_extended_type
;
1116 /* Size types *are* sign extended. */
1117 sign_extended_type
= (!TYPE_UNSIGNED (type
)
1118 || (TREE_CODE (type
) == INTEGER_TYPE
1119 && TYPE_IS_SIZETYPE (type
)));
1121 /* If we need to set overflow flags, return a new unshared node. */
1122 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1126 || (overflowable
> 0 && sign_extended_type
))
1128 tree t
= make_node (INTEGER_CST
);
1129 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1130 !sign_extended_type
);
1131 TREE_TYPE (t
) = type
;
1132 TREE_OVERFLOW (t
) = 1;
1137 /* Else build a shared node. */
1138 return double_int_to_tree (type
, cst
);
1141 /* These are the hash table functions for the hash table of INTEGER_CST
1142 nodes of a sizetype. */
1144 /* Return the hash code code X, an INTEGER_CST. */
1147 int_cst_hash_hash (const void *x
)
1149 const_tree
const t
= (const_tree
) x
;
1151 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1152 ^ htab_hash_pointer (TREE_TYPE (t
)));
1155 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1156 is the same as that given by *Y, which is the same. */
1159 int_cst_hash_eq (const void *x
, const void *y
)
1161 const_tree
const xt
= (const_tree
) x
;
1162 const_tree
const yt
= (const_tree
) y
;
1164 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1165 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1166 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1169 /* Create an INT_CST node of TYPE and value HI:LOW.
1170 The returned node is always shared. For small integers we use a
1171 per-type vector cache, for larger ones we use a single hash table. */
1174 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1182 switch (TREE_CODE (type
))
1185 case REFERENCE_TYPE
:
1186 /* Cache NULL pointer. */
1195 /* Cache false or true. */
1203 if (TYPE_UNSIGNED (type
))
1206 limit
= INTEGER_SHARE_LIMIT
;
1207 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1213 limit
= INTEGER_SHARE_LIMIT
+ 1;
1214 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1216 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1230 /* Look for it in the type's vector of small shared ints. */
1231 if (!TYPE_CACHED_VALUES_P (type
))
1233 TYPE_CACHED_VALUES_P (type
) = 1;
1234 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1237 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1240 /* Make sure no one is clobbering the shared constant. */
1241 gcc_assert (TREE_TYPE (t
) == type
);
1242 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1243 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1247 /* Create a new shared int. */
1248 t
= make_node (INTEGER_CST
);
1250 TREE_INT_CST_LOW (t
) = low
;
1251 TREE_INT_CST_HIGH (t
) = hi
;
1252 TREE_TYPE (t
) = type
;
1254 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1259 /* Use the cache of larger shared ints. */
1262 TREE_INT_CST_LOW (int_cst_node
) = low
;
1263 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1264 TREE_TYPE (int_cst_node
) = type
;
1266 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1270 /* Insert this one into the hash table. */
1273 /* Make a new node for next time round. */
1274 int_cst_node
= make_node (INTEGER_CST
);
1281 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1282 and the rest are zeros. */
1285 build_low_bits_mask (tree type
, unsigned bits
)
1289 gcc_assert (bits
<= TYPE_PRECISION (type
));
1291 if (bits
== TYPE_PRECISION (type
)
1292 && !TYPE_UNSIGNED (type
))
1293 /* Sign extended all-ones mask. */
1294 mask
= double_int_minus_one
;
1296 mask
= double_int_mask (bits
);
1298 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1301 /* Checks that X is integer constant that can be expressed in (unsigned)
1302 HOST_WIDE_INT without loss of precision. */
1305 cst_and_fits_in_hwi (const_tree x
)
1307 if (TREE_CODE (x
) != INTEGER_CST
)
1310 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1313 return (TREE_INT_CST_HIGH (x
) == 0
1314 || TREE_INT_CST_HIGH (x
) == -1);
1317 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1318 are in a list pointed to by VALS. */
1321 build_vector (tree type
, tree vals
)
1323 tree v
= make_node (VECTOR_CST
);
1327 TREE_VECTOR_CST_ELTS (v
) = vals
;
1328 TREE_TYPE (v
) = type
;
1330 /* Iterate through elements and check for overflow. */
1331 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1333 tree value
= TREE_VALUE (link
);
1335 /* Don't crash if we get an address constant. */
1336 if (!CONSTANT_CLASS_P (value
))
1339 over
|= TREE_OVERFLOW (value
);
1342 TREE_OVERFLOW (v
) = over
;
1346 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1347 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1350 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1352 tree list
= NULL_TREE
;
1353 unsigned HOST_WIDE_INT idx
;
1356 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1357 list
= tree_cons (NULL_TREE
, value
, list
);
1358 return build_vector (type
, nreverse (list
));
1361 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1362 are in the VEC pointed to by VALS. */
1364 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1366 tree c
= make_node (CONSTRUCTOR
);
1368 constructor_elt
*elt
;
1369 bool constant_p
= true;
1371 TREE_TYPE (c
) = type
;
1372 CONSTRUCTOR_ELTS (c
) = vals
;
1374 for (i
= 0; VEC_iterate (constructor_elt
, vals
, i
, elt
); i
++)
1375 if (!TREE_CONSTANT (elt
->value
))
1381 TREE_CONSTANT (c
) = constant_p
;
1386 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1389 build_constructor_single (tree type
, tree index
, tree value
)
1391 VEC(constructor_elt
,gc
) *v
;
1392 constructor_elt
*elt
;
1394 v
= VEC_alloc (constructor_elt
, gc
, 1);
1395 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1399 return build_constructor (type
, v
);
1403 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1404 are in a list pointed to by VALS. */
1406 build_constructor_from_list (tree type
, tree vals
)
1409 VEC(constructor_elt
,gc
) *v
= NULL
;
1413 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1414 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1415 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1418 return build_constructor (type
, v
);
1421 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1424 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1427 FIXED_VALUE_TYPE
*fp
;
1429 v
= make_node (FIXED_CST
);
1430 fp
= ggc_alloc_fixed_value ();
1431 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1433 TREE_TYPE (v
) = type
;
1434 TREE_FIXED_CST_PTR (v
) = fp
;
1438 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1441 build_real (tree type
, REAL_VALUE_TYPE d
)
1444 REAL_VALUE_TYPE
*dp
;
1447 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1448 Consider doing it via real_convert now. */
1450 v
= make_node (REAL_CST
);
1451 dp
= ggc_alloc_real_value ();
1452 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1454 TREE_TYPE (v
) = type
;
1455 TREE_REAL_CST_PTR (v
) = dp
;
1456 TREE_OVERFLOW (v
) = overflow
;
1460 /* Return a new REAL_CST node whose type is TYPE
1461 and whose value is the integer value of the INTEGER_CST node I. */
1464 real_value_from_int_cst (const_tree type
, const_tree i
)
1468 /* Clear all bits of the real value type so that we can later do
1469 bitwise comparisons to see if two values are the same. */
1470 memset (&d
, 0, sizeof d
);
1472 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1473 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1474 TYPE_UNSIGNED (TREE_TYPE (i
)));
1478 /* Given a tree representing an integer constant I, return a tree
1479 representing the same value as a floating-point constant of type TYPE. */
1482 build_real_from_int_cst (tree type
, const_tree i
)
1485 int overflow
= TREE_OVERFLOW (i
);
1487 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1489 TREE_OVERFLOW (v
) |= overflow
;
1493 /* Return a newly constructed STRING_CST node whose value is
1494 the LEN characters at STR.
1495 The TREE_TYPE is not initialized. */
1498 build_string (int len
, const char *str
)
1503 /* Do not waste bytes provided by padding of struct tree_string. */
1504 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1506 #ifdef GATHER_STATISTICS
1507 tree_node_counts
[(int) c_kind
]++;
1508 tree_node_sizes
[(int) c_kind
] += length
;
1511 s
= ggc_alloc_tree_node (length
);
1513 memset (s
, 0, sizeof (struct tree_common
));
1514 TREE_SET_CODE (s
, STRING_CST
);
1515 TREE_CONSTANT (s
) = 1;
1516 TREE_STRING_LENGTH (s
) = len
;
1517 memcpy (s
->string
.str
, str
, len
);
1518 s
->string
.str
[len
] = '\0';
1523 /* Return a newly constructed COMPLEX_CST node whose value is
1524 specified by the real and imaginary parts REAL and IMAG.
1525 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1526 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1529 build_complex (tree type
, tree real
, tree imag
)
1531 tree t
= make_node (COMPLEX_CST
);
1533 TREE_REALPART (t
) = real
;
1534 TREE_IMAGPART (t
) = imag
;
1535 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1536 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1540 /* Return a constant of arithmetic type TYPE which is the
1541 multiplicative identity of the set TYPE. */
1544 build_one_cst (tree type
)
1546 switch (TREE_CODE (type
))
1548 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1549 case POINTER_TYPE
: case REFERENCE_TYPE
:
1551 return build_int_cst (type
, 1);
1554 return build_real (type
, dconst1
);
1556 case FIXED_POINT_TYPE
:
1557 /* We can only generate 1 for accum types. */
1558 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1559 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1566 scalar
= build_one_cst (TREE_TYPE (type
));
1568 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1570 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1571 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1573 return build_vector (type
, cst
);
1577 return build_complex (type
,
1578 build_one_cst (TREE_TYPE (type
)),
1579 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1586 /* Build a BINFO with LEN language slots. */
1589 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1592 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1593 + VEC_embedded_size (tree
, base_binfos
));
1595 #ifdef GATHER_STATISTICS
1596 tree_node_counts
[(int) binfo_kind
]++;
1597 tree_node_sizes
[(int) binfo_kind
] += length
;
1600 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1602 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1604 TREE_SET_CODE (t
, TREE_BINFO
);
1606 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1612 /* Build a newly constructed TREE_VEC node of length LEN. */
1615 make_tree_vec_stat (int len MEM_STAT_DECL
)
1618 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1620 #ifdef GATHER_STATISTICS
1621 tree_node_counts
[(int) vec_kind
]++;
1622 tree_node_sizes
[(int) vec_kind
] += length
;
1625 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1627 TREE_SET_CODE (t
, TREE_VEC
);
1628 TREE_VEC_LENGTH (t
) = len
;
1633 /* Return 1 if EXPR is the integer constant zero or a complex constant
1637 integer_zerop (const_tree expr
)
1641 return ((TREE_CODE (expr
) == INTEGER_CST
1642 && TREE_INT_CST_LOW (expr
) == 0
1643 && TREE_INT_CST_HIGH (expr
) == 0)
1644 || (TREE_CODE (expr
) == COMPLEX_CST
1645 && integer_zerop (TREE_REALPART (expr
))
1646 && integer_zerop (TREE_IMAGPART (expr
))));
1649 /* Return 1 if EXPR is the integer constant one or the corresponding
1650 complex constant. */
1653 integer_onep (const_tree expr
)
1657 return ((TREE_CODE (expr
) == INTEGER_CST
1658 && TREE_INT_CST_LOW (expr
) == 1
1659 && TREE_INT_CST_HIGH (expr
) == 0)
1660 || (TREE_CODE (expr
) == COMPLEX_CST
1661 && integer_onep (TREE_REALPART (expr
))
1662 && integer_zerop (TREE_IMAGPART (expr
))));
1665 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1666 it contains. Likewise for the corresponding complex constant. */
1669 integer_all_onesp (const_tree expr
)
1676 if (TREE_CODE (expr
) == COMPLEX_CST
1677 && integer_all_onesp (TREE_REALPART (expr
))
1678 && integer_zerop (TREE_IMAGPART (expr
)))
1681 else if (TREE_CODE (expr
) != INTEGER_CST
)
1684 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1685 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1686 && TREE_INT_CST_HIGH (expr
) == -1)
1691 /* Note that using TYPE_PRECISION here is wrong. We care about the
1692 actual bits, not the (arbitrary) range of the type. */
1693 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1694 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1696 HOST_WIDE_INT high_value
;
1699 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1701 /* Can not handle precisions greater than twice the host int size. */
1702 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1703 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1704 /* Shifting by the host word size is undefined according to the ANSI
1705 standard, so we must handle this as a special case. */
1708 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1710 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1711 && TREE_INT_CST_HIGH (expr
) == high_value
);
1714 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1717 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1721 integer_pow2p (const_tree expr
)
1724 HOST_WIDE_INT high
, low
;
1728 if (TREE_CODE (expr
) == COMPLEX_CST
1729 && integer_pow2p (TREE_REALPART (expr
))
1730 && integer_zerop (TREE_IMAGPART (expr
)))
1733 if (TREE_CODE (expr
) != INTEGER_CST
)
1736 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1737 high
= TREE_INT_CST_HIGH (expr
);
1738 low
= TREE_INT_CST_LOW (expr
);
1740 /* First clear all bits that are beyond the type's precision in case
1741 we've been sign extended. */
1743 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1745 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1746 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1750 if (prec
< HOST_BITS_PER_WIDE_INT
)
1751 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1754 if (high
== 0 && low
== 0)
1757 return ((high
== 0 && (low
& (low
- 1)) == 0)
1758 || (low
== 0 && (high
& (high
- 1)) == 0));
1761 /* Return 1 if EXPR is an integer constant other than zero or a
1762 complex constant other than zero. */
1765 integer_nonzerop (const_tree expr
)
1769 return ((TREE_CODE (expr
) == INTEGER_CST
1770 && (TREE_INT_CST_LOW (expr
) != 0
1771 || TREE_INT_CST_HIGH (expr
) != 0))
1772 || (TREE_CODE (expr
) == COMPLEX_CST
1773 && (integer_nonzerop (TREE_REALPART (expr
))
1774 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1777 /* Return 1 if EXPR is the fixed-point constant zero. */
1780 fixed_zerop (const_tree expr
)
1782 return (TREE_CODE (expr
) == FIXED_CST
1783 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1786 /* Return the power of two represented by a tree node known to be a
1790 tree_log2 (const_tree expr
)
1793 HOST_WIDE_INT high
, low
;
1797 if (TREE_CODE (expr
) == COMPLEX_CST
)
1798 return tree_log2 (TREE_REALPART (expr
));
1800 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1801 high
= TREE_INT_CST_HIGH (expr
);
1802 low
= TREE_INT_CST_LOW (expr
);
1804 /* First clear all bits that are beyond the type's precision in case
1805 we've been sign extended. */
1807 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1809 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1810 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1814 if (prec
< HOST_BITS_PER_WIDE_INT
)
1815 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1818 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1819 : exact_log2 (low
));
1822 /* Similar, but return the largest integer Y such that 2 ** Y is less
1823 than or equal to EXPR. */
1826 tree_floor_log2 (const_tree expr
)
1829 HOST_WIDE_INT high
, low
;
1833 if (TREE_CODE (expr
) == COMPLEX_CST
)
1834 return tree_log2 (TREE_REALPART (expr
));
1836 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1837 high
= TREE_INT_CST_HIGH (expr
);
1838 low
= TREE_INT_CST_LOW (expr
);
1840 /* First clear all bits that are beyond the type's precision in case
1841 we've been sign extended. Ignore if type's precision hasn't been set
1842 since what we are doing is setting it. */
1844 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1846 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1847 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1851 if (prec
< HOST_BITS_PER_WIDE_INT
)
1852 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1855 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1856 : floor_log2 (low
));
1859 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1860 decimal float constants, so don't return 1 for them. */
1863 real_zerop (const_tree expr
)
1867 return ((TREE_CODE (expr
) == REAL_CST
1868 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1869 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1870 || (TREE_CODE (expr
) == COMPLEX_CST
1871 && real_zerop (TREE_REALPART (expr
))
1872 && real_zerop (TREE_IMAGPART (expr
))));
1875 /* Return 1 if EXPR is the real constant one in real or complex form.
1876 Trailing zeroes matter for decimal float constants, so don't return
1880 real_onep (const_tree expr
)
1884 return ((TREE_CODE (expr
) == REAL_CST
1885 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1886 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1887 || (TREE_CODE (expr
) == COMPLEX_CST
1888 && real_onep (TREE_REALPART (expr
))
1889 && real_zerop (TREE_IMAGPART (expr
))));
1892 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1893 for decimal float constants, so don't return 1 for them. */
1896 real_twop (const_tree expr
)
1900 return ((TREE_CODE (expr
) == REAL_CST
1901 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1902 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1903 || (TREE_CODE (expr
) == COMPLEX_CST
1904 && real_twop (TREE_REALPART (expr
))
1905 && real_zerop (TREE_IMAGPART (expr
))));
1908 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1909 matter for decimal float constants, so don't return 1 for them. */
1912 real_minus_onep (const_tree expr
)
1916 return ((TREE_CODE (expr
) == REAL_CST
1917 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
1918 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1919 || (TREE_CODE (expr
) == COMPLEX_CST
1920 && real_minus_onep (TREE_REALPART (expr
))
1921 && real_zerop (TREE_IMAGPART (expr
))));
1924 /* Nonzero if EXP is a constant or a cast of a constant. */
1927 really_constant_p (const_tree exp
)
1929 /* This is not quite the same as STRIP_NOPS. It does more. */
1930 while (CONVERT_EXPR_P (exp
)
1931 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1932 exp
= TREE_OPERAND (exp
, 0);
1933 return TREE_CONSTANT (exp
);
1936 /* Return first list element whose TREE_VALUE is ELEM.
1937 Return 0 if ELEM is not in LIST. */
1940 value_member (tree elem
, tree list
)
1944 if (elem
== TREE_VALUE (list
))
1946 list
= TREE_CHAIN (list
);
1951 /* Return first list element whose TREE_PURPOSE is ELEM.
1952 Return 0 if ELEM is not in LIST. */
1955 purpose_member (const_tree elem
, tree list
)
1959 if (elem
== TREE_PURPOSE (list
))
1961 list
= TREE_CHAIN (list
);
1966 /* Return true if ELEM is in V. */
1969 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
1973 for (ix
= 0; VEC_iterate (tree
, v
, ix
, t
); ix
++)
1979 /* Returns element number IDX (zero-origin) of chain CHAIN, or
1983 chain_index (int idx
, tree chain
)
1985 for (; chain
&& idx
> 0; --idx
)
1986 chain
= TREE_CHAIN (chain
);
1990 /* Return nonzero if ELEM is part of the chain CHAIN. */
1993 chain_member (const_tree elem
, const_tree chain
)
1999 chain
= TREE_CHAIN (chain
);
2005 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2006 We expect a null pointer to mark the end of the chain.
2007 This is the Lisp primitive `length'. */
2010 list_length (const_tree t
)
2013 #ifdef ENABLE_TREE_CHECKING
2021 #ifdef ENABLE_TREE_CHECKING
2024 gcc_assert (p
!= q
);
2032 /* Returns the number of FIELD_DECLs in TYPE. */
2035 fields_length (const_tree type
)
2037 tree t
= TYPE_FIELDS (type
);
2040 for (; t
; t
= TREE_CHAIN (t
))
2041 if (TREE_CODE (t
) == FIELD_DECL
)
2047 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2048 UNION_TYPE TYPE, or NULL_TREE if none. */
2051 first_field (const_tree type
)
2053 tree t
= TYPE_FIELDS (type
);
2054 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2059 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2060 by modifying the last node in chain 1 to point to chain 2.
2061 This is the Lisp primitive `nconc'. */
2064 chainon (tree op1
, tree op2
)
2073 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2075 TREE_CHAIN (t1
) = op2
;
2077 #ifdef ENABLE_TREE_CHECKING
2080 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2081 gcc_assert (t2
!= t1
);
2088 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2091 tree_last (tree chain
)
2095 while ((next
= TREE_CHAIN (chain
)))
2100 /* Reverse the order of elements in the chain T,
2101 and return the new head of the chain (old last element). */
2106 tree prev
= 0, decl
, next
;
2107 for (decl
= t
; decl
; decl
= next
)
2109 next
= TREE_CHAIN (decl
);
2110 TREE_CHAIN (decl
) = prev
;
2116 /* Return a newly created TREE_LIST node whose
2117 purpose and value fields are PARM and VALUE. */
2120 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2122 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2123 TREE_PURPOSE (t
) = parm
;
2124 TREE_VALUE (t
) = value
;
2128 /* Build a chain of TREE_LIST nodes from a vector. */
2131 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2133 tree ret
= NULL_TREE
;
2137 for (i
= 0; VEC_iterate (tree
, vec
, i
, t
); ++i
)
2139 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2140 pp
= &TREE_CHAIN (*pp
);
2145 /* Return a newly created TREE_LIST node whose
2146 purpose and value fields are PURPOSE and VALUE
2147 and whose TREE_CHAIN is CHAIN. */
2150 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2154 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2156 memset (node
, 0, sizeof (struct tree_common
));
2158 #ifdef GATHER_STATISTICS
2159 tree_node_counts
[(int) x_kind
]++;
2160 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
2163 TREE_SET_CODE (node
, TREE_LIST
);
2164 TREE_CHAIN (node
) = chain
;
2165 TREE_PURPOSE (node
) = purpose
;
2166 TREE_VALUE (node
) = value
;
2170 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2174 ctor_to_vec (tree ctor
)
2176 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2180 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2181 VEC_quick_push (tree
, vec
, val
);
2186 /* Return the size nominally occupied by an object of type TYPE
2187 when it resides in memory. The value is measured in units of bytes,
2188 and its data type is that normally used for type sizes
2189 (which is the first type created by make_signed_type or
2190 make_unsigned_type). */
2193 size_in_bytes (const_tree type
)
2197 if (type
== error_mark_node
)
2198 return integer_zero_node
;
2200 type
= TYPE_MAIN_VARIANT (type
);
2201 t
= TYPE_SIZE_UNIT (type
);
2205 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2206 return size_zero_node
;
2212 /* Return the size of TYPE (in bytes) as a wide integer
2213 or return -1 if the size can vary or is larger than an integer. */
2216 int_size_in_bytes (const_tree type
)
2220 if (type
== error_mark_node
)
2223 type
= TYPE_MAIN_VARIANT (type
);
2224 t
= TYPE_SIZE_UNIT (type
);
2226 || TREE_CODE (t
) != INTEGER_CST
2227 || TREE_INT_CST_HIGH (t
) != 0
2228 /* If the result would appear negative, it's too big to represent. */
2229 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2232 return TREE_INT_CST_LOW (t
);
2235 /* Return the maximum size of TYPE (in bytes) as a wide integer
2236 or return -1 if the size can vary or is larger than an integer. */
2239 max_int_size_in_bytes (const_tree type
)
2241 HOST_WIDE_INT size
= -1;
2244 /* If this is an array type, check for a possible MAX_SIZE attached. */
2246 if (TREE_CODE (type
) == ARRAY_TYPE
)
2248 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2250 if (size_tree
&& host_integerp (size_tree
, 1))
2251 size
= tree_low_cst (size_tree
, 1);
2254 /* If we still haven't been able to get a size, see if the language
2255 can compute a maximum size. */
2259 size_tree
= lang_hooks
.types
.max_size (type
);
2261 if (size_tree
&& host_integerp (size_tree
, 1))
2262 size
= tree_low_cst (size_tree
, 1);
2268 /* Returns a tree for the size of EXP in bytes. */
2271 tree_expr_size (const_tree exp
)
2274 && DECL_SIZE_UNIT (exp
) != 0)
2275 return DECL_SIZE_UNIT (exp
);
2277 return size_in_bytes (TREE_TYPE (exp
));
2280 /* Return the bit position of FIELD, in bits from the start of the record.
2281 This is a tree of type bitsizetype. */
2284 bit_position (const_tree field
)
2286 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2287 DECL_FIELD_BIT_OFFSET (field
));
2290 /* Likewise, but return as an integer. It must be representable in
2291 that way (since it could be a signed value, we don't have the
2292 option of returning -1 like int_size_in_byte can. */
2295 int_bit_position (const_tree field
)
2297 return tree_low_cst (bit_position (field
), 0);
2300 /* Return the byte position of FIELD, in bytes from the start of the record.
2301 This is a tree of type sizetype. */
2304 byte_position (const_tree field
)
2306 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2307 DECL_FIELD_BIT_OFFSET (field
));
2310 /* Likewise, but return as an integer. It must be representable in
2311 that way (since it could be a signed value, we don't have the
2312 option of returning -1 like int_size_in_byte can. */
2315 int_byte_position (const_tree field
)
2317 return tree_low_cst (byte_position (field
), 0);
2320 /* Return the strictest alignment, in bits, that T is known to have. */
2323 expr_align (const_tree t
)
2325 unsigned int align0
, align1
;
2327 switch (TREE_CODE (t
))
2329 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2330 /* If we have conversions, we know that the alignment of the
2331 object must meet each of the alignments of the types. */
2332 align0
= expr_align (TREE_OPERAND (t
, 0));
2333 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2334 return MAX (align0
, align1
);
2336 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2337 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2338 case CLEANUP_POINT_EXPR
:
2339 /* These don't change the alignment of an object. */
2340 return expr_align (TREE_OPERAND (t
, 0));
2343 /* The best we can do is say that the alignment is the least aligned
2345 align0
= expr_align (TREE_OPERAND (t
, 1));
2346 align1
= expr_align (TREE_OPERAND (t
, 2));
2347 return MIN (align0
, align1
);
2349 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2350 meaningfully, it's always 1. */
2351 case LABEL_DECL
: case CONST_DECL
:
2352 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2354 gcc_assert (DECL_ALIGN (t
) != 0);
2355 return DECL_ALIGN (t
);
2361 /* Otherwise take the alignment from that of the type. */
2362 return TYPE_ALIGN (TREE_TYPE (t
));
2365 /* Return, as a tree node, the number of elements for TYPE (which is an
2366 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2369 array_type_nelts (const_tree type
)
2371 tree index_type
, min
, max
;
2373 /* If they did it with unspecified bounds, then we should have already
2374 given an error about it before we got here. */
2375 if (! TYPE_DOMAIN (type
))
2376 return error_mark_node
;
2378 index_type
= TYPE_DOMAIN (type
);
2379 min
= TYPE_MIN_VALUE (index_type
);
2380 max
= TYPE_MAX_VALUE (index_type
);
2382 return (integer_zerop (min
)
2384 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2387 /* If arg is static -- a reference to an object in static storage -- then
2388 return the object. This is not the same as the C meaning of `static'.
2389 If arg isn't static, return NULL. */
2394 switch (TREE_CODE (arg
))
2397 /* Nested functions are static, even though taking their address will
2398 involve a trampoline as we unnest the nested function and create
2399 the trampoline on the tree level. */
2403 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2404 && ! DECL_THREAD_LOCAL_P (arg
)
2405 && ! DECL_DLLIMPORT_P (arg
)
2409 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2413 return TREE_STATIC (arg
) ? arg
: NULL
;
2420 /* If the thing being referenced is not a field, then it is
2421 something language specific. */
2422 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2424 /* If we are referencing a bitfield, we can't evaluate an
2425 ADDR_EXPR at compile time and so it isn't a constant. */
2426 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2429 return staticp (TREE_OPERAND (arg
, 0));
2434 case MISALIGNED_INDIRECT_REF
:
2435 case ALIGN_INDIRECT_REF
:
2437 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2440 case ARRAY_RANGE_REF
:
2441 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2442 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2443 return staticp (TREE_OPERAND (arg
, 0));
2447 case COMPOUND_LITERAL_EXPR
:
2448 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2458 /* Return whether OP is a DECL whose address is function-invariant. */
2461 decl_address_invariant_p (const_tree op
)
2463 /* The conditions below are slightly less strict than the one in
2466 switch (TREE_CODE (op
))
2475 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2476 && !DECL_DLLIMPORT_P (op
))
2477 || DECL_THREAD_LOCAL_P (op
)
2478 || DECL_CONTEXT (op
) == current_function_decl
2479 || decl_function_context (op
) == current_function_decl
)
2484 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2485 || decl_function_context (op
) == current_function_decl
)
2496 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2499 decl_address_ip_invariant_p (const_tree op
)
2501 /* The conditions below are slightly less strict than the one in
2504 switch (TREE_CODE (op
))
2512 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2513 && !DECL_DLLIMPORT_P (op
))
2514 || DECL_THREAD_LOCAL_P (op
))
2519 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2531 /* Return true if T is function-invariant (internal function, does
2532 not handle arithmetic; that's handled in skip_simple_arithmetic and
2533 tree_invariant_p). */
2535 static bool tree_invariant_p (tree t
);
2538 tree_invariant_p_1 (tree t
)
2542 if (TREE_CONSTANT (t
)
2543 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2546 switch (TREE_CODE (t
))
2552 op
= TREE_OPERAND (t
, 0);
2553 while (handled_component_p (op
))
2555 switch (TREE_CODE (op
))
2558 case ARRAY_RANGE_REF
:
2559 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2560 || TREE_OPERAND (op
, 2) != NULL_TREE
2561 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2566 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2572 op
= TREE_OPERAND (op
, 0);
2575 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2584 /* Return true if T is function-invariant. */
2587 tree_invariant_p (tree t
)
2589 tree inner
= skip_simple_arithmetic (t
);
2590 return tree_invariant_p_1 (inner
);
2593 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2594 Do this to any expression which may be used in more than one place,
2595 but must be evaluated only once.
2597 Normally, expand_expr would reevaluate the expression each time.
2598 Calling save_expr produces something that is evaluated and recorded
2599 the first time expand_expr is called on it. Subsequent calls to
2600 expand_expr just reuse the recorded value.
2602 The call to expand_expr that generates code that actually computes
2603 the value is the first call *at compile time*. Subsequent calls
2604 *at compile time* generate code to use the saved value.
2605 This produces correct result provided that *at run time* control
2606 always flows through the insns made by the first expand_expr
2607 before reaching the other places where the save_expr was evaluated.
2608 You, the caller of save_expr, must make sure this is so.
2610 Constants, and certain read-only nodes, are returned with no
2611 SAVE_EXPR because that is safe. Expressions containing placeholders
2612 are not touched; see tree.def for an explanation of what these
2616 save_expr (tree expr
)
2618 tree t
= fold (expr
);
2621 /* If the tree evaluates to a constant, then we don't want to hide that
2622 fact (i.e. this allows further folding, and direct checks for constants).
2623 However, a read-only object that has side effects cannot be bypassed.
2624 Since it is no problem to reevaluate literals, we just return the
2626 inner
= skip_simple_arithmetic (t
);
2627 if (TREE_CODE (inner
) == ERROR_MARK
)
2630 if (tree_invariant_p_1 (inner
))
2633 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2634 it means that the size or offset of some field of an object depends on
2635 the value within another field.
2637 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2638 and some variable since it would then need to be both evaluated once and
2639 evaluated more than once. Front-ends must assure this case cannot
2640 happen by surrounding any such subexpressions in their own SAVE_EXPR
2641 and forcing evaluation at the proper time. */
2642 if (contains_placeholder_p (inner
))
2645 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2646 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2648 /* This expression might be placed ahead of a jump to ensure that the
2649 value was computed on both sides of the jump. So make sure it isn't
2650 eliminated as dead. */
2651 TREE_SIDE_EFFECTS (t
) = 1;
2655 /* Look inside EXPR and into any simple arithmetic operations. Return
2656 the innermost non-arithmetic node. */
2659 skip_simple_arithmetic (tree expr
)
2663 /* We don't care about whether this can be used as an lvalue in this
2665 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2666 expr
= TREE_OPERAND (expr
, 0);
2668 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2669 a constant, it will be more efficient to not make another SAVE_EXPR since
2670 it will allow better simplification and GCSE will be able to merge the
2671 computations if they actually occur. */
2675 if (UNARY_CLASS_P (inner
))
2676 inner
= TREE_OPERAND (inner
, 0);
2677 else if (BINARY_CLASS_P (inner
))
2679 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2680 inner
= TREE_OPERAND (inner
, 0);
2681 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2682 inner
= TREE_OPERAND (inner
, 1);
2694 /* Return which tree structure is used by T. */
2696 enum tree_node_structure_enum
2697 tree_node_structure (const_tree t
)
2699 const enum tree_code code
= TREE_CODE (t
);
2700 return tree_node_structure_for_code (code
);
2703 /* Set various status flags when building a CALL_EXPR object T. */
2706 process_call_operands (tree t
)
2708 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2709 bool read_only
= false;
2710 int i
= call_expr_flags (t
);
2712 /* Calls have side-effects, except those to const or pure functions. */
2713 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2714 side_effects
= true;
2715 /* Propagate TREE_READONLY of arguments for const functions. */
2719 if (!side_effects
|| read_only
)
2720 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2722 tree op
= TREE_OPERAND (t
, i
);
2723 if (op
&& TREE_SIDE_EFFECTS (op
))
2724 side_effects
= true;
2725 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2729 TREE_SIDE_EFFECTS (t
) = side_effects
;
2730 TREE_READONLY (t
) = read_only
;
2733 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2734 or offset that depends on a field within a record. */
2737 contains_placeholder_p (const_tree exp
)
2739 enum tree_code code
;
2744 code
= TREE_CODE (exp
);
2745 if (code
== PLACEHOLDER_EXPR
)
2748 switch (TREE_CODE_CLASS (code
))
2751 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2752 position computations since they will be converted into a
2753 WITH_RECORD_EXPR involving the reference, which will assume
2754 here will be valid. */
2755 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2757 case tcc_exceptional
:
2758 if (code
== TREE_LIST
)
2759 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2760 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2765 case tcc_comparison
:
2766 case tcc_expression
:
2770 /* Ignoring the first operand isn't quite right, but works best. */
2771 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2774 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2775 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2776 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2779 /* The save_expr function never wraps anything containing
2780 a PLACEHOLDER_EXPR. */
2787 switch (TREE_CODE_LENGTH (code
))
2790 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2792 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2793 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2804 const_call_expr_arg_iterator iter
;
2805 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2806 if (CONTAINS_PLACEHOLDER_P (arg
))
2820 /* Return true if any part of the computation of TYPE involves a
2821 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2822 (for QUAL_UNION_TYPE) and field positions. */
2825 type_contains_placeholder_1 (const_tree type
)
2827 /* If the size contains a placeholder or the parent type (component type in
2828 the case of arrays) type involves a placeholder, this type does. */
2829 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2830 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2831 || (TREE_TYPE (type
) != 0
2832 && type_contains_placeholder_p (TREE_TYPE (type
))))
2835 /* Now do type-specific checks. Note that the last part of the check above
2836 greatly limits what we have to do below. */
2837 switch (TREE_CODE (type
))
2845 case REFERENCE_TYPE
:
2853 case FIXED_POINT_TYPE
:
2854 /* Here we just check the bounds. */
2855 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2856 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2859 /* We're already checked the component type (TREE_TYPE), so just check
2861 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2865 case QUAL_UNION_TYPE
:
2869 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2870 if (TREE_CODE (field
) == FIELD_DECL
2871 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2872 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2873 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2874 || type_contains_placeholder_p (TREE_TYPE (field
))))
2886 type_contains_placeholder_p (tree type
)
2890 /* If the contains_placeholder_bits field has been initialized,
2891 then we know the answer. */
2892 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2893 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2895 /* Indicate that we've seen this type node, and the answer is false.
2896 This is what we want to return if we run into recursion via fields. */
2897 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2899 /* Compute the real value. */
2900 result
= type_contains_placeholder_1 (type
);
2902 /* Store the real value. */
2903 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2908 /* Push tree EXP onto vector QUEUE if it is not already present. */
2911 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2916 for (i
= 0; VEC_iterate (tree
, *queue
, i
, iter
); i
++)
2917 if (simple_cst_equal (iter
, exp
) == 1)
2921 VEC_safe_push (tree
, heap
, *queue
, exp
);
2924 /* Given a tree EXP, find all occurences of references to fields
2925 in a PLACEHOLDER_EXPR and place them in vector REFS without
2926 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
2927 we assume here that EXP contains only arithmetic expressions
2928 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
2932 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
2934 enum tree_code code
= TREE_CODE (exp
);
2938 /* We handle TREE_LIST and COMPONENT_REF separately. */
2939 if (code
== TREE_LIST
)
2941 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
2942 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
2944 else if (code
== COMPONENT_REF
)
2946 for (inner
= TREE_OPERAND (exp
, 0);
2947 REFERENCE_CLASS_P (inner
);
2948 inner
= TREE_OPERAND (inner
, 0))
2951 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
2952 push_without_duplicates (exp
, refs
);
2954 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
2957 switch (TREE_CODE_CLASS (code
))
2962 case tcc_declaration
:
2963 /* Variables allocated to static storage can stay. */
2964 if (!TREE_STATIC (exp
))
2965 push_without_duplicates (exp
, refs
);
2968 case tcc_expression
:
2969 /* This is the pattern built in ada/make_aligning_type. */
2970 if (code
== ADDR_EXPR
2971 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
2973 push_without_duplicates (exp
, refs
);
2977 /* Fall through... */
2979 case tcc_exceptional
:
2982 case tcc_comparison
:
2984 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
2985 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2989 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2990 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
2998 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2999 return a tree with all occurrences of references to F in a
3000 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3001 CONST_DECLs. Note that we assume here that EXP contains only
3002 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3003 occurring only in their argument list. */
3006 substitute_in_expr (tree exp
, tree f
, tree r
)
3008 enum tree_code code
= TREE_CODE (exp
);
3009 tree op0
, op1
, op2
, op3
;
3012 /* We handle TREE_LIST and COMPONENT_REF separately. */
3013 if (code
== TREE_LIST
)
3015 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3016 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3017 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3020 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3022 else if (code
== COMPONENT_REF
)
3026 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3027 and it is the right field, replace it with R. */
3028 for (inner
= TREE_OPERAND (exp
, 0);
3029 REFERENCE_CLASS_P (inner
);
3030 inner
= TREE_OPERAND (inner
, 0))
3034 op1
= TREE_OPERAND (exp
, 1);
3036 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3039 /* If this expression hasn't been completed let, leave it alone. */
3040 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3043 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3044 if (op0
== TREE_OPERAND (exp
, 0))
3048 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3051 switch (TREE_CODE_CLASS (code
))
3056 case tcc_declaration
:
3062 case tcc_expression
:
3066 /* Fall through... */
3068 case tcc_exceptional
:
3071 case tcc_comparison
:
3073 switch (TREE_CODE_LENGTH (code
))
3079 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3080 if (op0
== TREE_OPERAND (exp
, 0))
3083 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3087 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3088 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3090 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3093 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3097 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3098 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3099 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3101 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3102 && op2
== TREE_OPERAND (exp
, 2))
3105 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3109 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3110 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3111 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3112 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3114 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3115 && op2
== TREE_OPERAND (exp
, 2)
3116 && op3
== TREE_OPERAND (exp
, 3))
3120 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3132 new_tree
= NULL_TREE
;
3134 /* If we are trying to replace F with a constant, inline back
3135 functions which do nothing else than computing a value from
3136 the arguments they are passed. This makes it possible to
3137 fold partially or entirely the replacement expression. */
3138 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3140 tree t
= maybe_inline_call_in_expr (exp
);
3142 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3145 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3147 tree op
= TREE_OPERAND (exp
, i
);
3148 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3152 new_tree
= copy_node (exp
);
3153 TREE_OPERAND (new_tree
, i
) = new_op
;
3159 new_tree
= fold (new_tree
);
3160 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3161 process_call_operands (new_tree
);
3172 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3176 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3177 for it within OBJ, a tree that is an object or a chain of references. */
3180 substitute_placeholder_in_expr (tree exp
, tree obj
)
3182 enum tree_code code
= TREE_CODE (exp
);
3183 tree op0
, op1
, op2
, op3
;
3186 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3187 in the chain of OBJ. */
3188 if (code
== PLACEHOLDER_EXPR
)
3190 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3193 for (elt
= obj
; elt
!= 0;
3194 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3195 || TREE_CODE (elt
) == COND_EXPR
)
3196 ? TREE_OPERAND (elt
, 1)
3197 : (REFERENCE_CLASS_P (elt
)
3198 || UNARY_CLASS_P (elt
)
3199 || BINARY_CLASS_P (elt
)
3200 || VL_EXP_CLASS_P (elt
)
3201 || EXPRESSION_CLASS_P (elt
))
3202 ? TREE_OPERAND (elt
, 0) : 0))
3203 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3206 for (elt
= obj
; elt
!= 0;
3207 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3208 || TREE_CODE (elt
) == COND_EXPR
)
3209 ? TREE_OPERAND (elt
, 1)
3210 : (REFERENCE_CLASS_P (elt
)
3211 || UNARY_CLASS_P (elt
)
3212 || BINARY_CLASS_P (elt
)
3213 || VL_EXP_CLASS_P (elt
)
3214 || EXPRESSION_CLASS_P (elt
))
3215 ? TREE_OPERAND (elt
, 0) : 0))
3216 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3217 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3219 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3221 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3222 survives until RTL generation, there will be an error. */
3226 /* TREE_LIST is special because we need to look at TREE_VALUE
3227 and TREE_CHAIN, not TREE_OPERANDS. */
3228 else if (code
== TREE_LIST
)
3230 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3231 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3232 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3235 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3238 switch (TREE_CODE_CLASS (code
))
3241 case tcc_declaration
:
3244 case tcc_exceptional
:
3247 case tcc_comparison
:
3248 case tcc_expression
:
3251 switch (TREE_CODE_LENGTH (code
))
3257 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3258 if (op0
== TREE_OPERAND (exp
, 0))
3261 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3265 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3266 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3268 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3271 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3275 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3276 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3277 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3279 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3280 && op2
== TREE_OPERAND (exp
, 2))
3283 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3287 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3288 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3289 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3290 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3292 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3293 && op2
== TREE_OPERAND (exp
, 2)
3294 && op3
== TREE_OPERAND (exp
, 3))
3298 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3310 new_tree
= NULL_TREE
;
3312 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3314 tree op
= TREE_OPERAND (exp
, i
);
3315 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3319 new_tree
= copy_node (exp
);
3320 TREE_OPERAND (new_tree
, i
) = new_op
;
3326 new_tree
= fold (new_tree
);
3327 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3328 process_call_operands (new_tree
);
3339 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3343 /* Stabilize a reference so that we can use it any number of times
3344 without causing its operands to be evaluated more than once.
3345 Returns the stabilized reference. This works by means of save_expr,
3346 so see the caveats in the comments about save_expr.
3348 Also allows conversion expressions whose operands are references.
3349 Any other kind of expression is returned unchanged. */
3352 stabilize_reference (tree ref
)
3355 enum tree_code code
= TREE_CODE (ref
);
3362 /* No action is needed in this case. */
3367 case FIX_TRUNC_EXPR
:
3368 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3372 result
= build_nt (INDIRECT_REF
,
3373 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3377 result
= build_nt (COMPONENT_REF
,
3378 stabilize_reference (TREE_OPERAND (ref
, 0)),
3379 TREE_OPERAND (ref
, 1), NULL_TREE
);
3383 result
= build_nt (BIT_FIELD_REF
,
3384 stabilize_reference (TREE_OPERAND (ref
, 0)),
3385 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3386 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3390 result
= build_nt (ARRAY_REF
,
3391 stabilize_reference (TREE_OPERAND (ref
, 0)),
3392 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3393 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3396 case ARRAY_RANGE_REF
:
3397 result
= build_nt (ARRAY_RANGE_REF
,
3398 stabilize_reference (TREE_OPERAND (ref
, 0)),
3399 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3400 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3404 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3405 it wouldn't be ignored. This matters when dealing with
3407 return stabilize_reference_1 (ref
);
3409 /* If arg isn't a kind of lvalue we recognize, make no change.
3410 Caller should recognize the error for an invalid lvalue. */
3415 return error_mark_node
;
3418 TREE_TYPE (result
) = TREE_TYPE (ref
);
3419 TREE_READONLY (result
) = TREE_READONLY (ref
);
3420 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3421 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3426 /* Subroutine of stabilize_reference; this is called for subtrees of
3427 references. Any expression with side-effects must be put in a SAVE_EXPR
3428 to ensure that it is only evaluated once.
3430 We don't put SAVE_EXPR nodes around everything, because assigning very
3431 simple expressions to temporaries causes us to miss good opportunities
3432 for optimizations. Among other things, the opportunity to fold in the
3433 addition of a constant into an addressing mode often gets lost, e.g.
3434 "y[i+1] += x;". In general, we take the approach that we should not make
3435 an assignment unless we are forced into it - i.e., that any non-side effect
3436 operator should be allowed, and that cse should take care of coalescing
3437 multiple utterances of the same expression should that prove fruitful. */
3440 stabilize_reference_1 (tree e
)
3443 enum tree_code code
= TREE_CODE (e
);
3445 /* We cannot ignore const expressions because it might be a reference
3446 to a const array but whose index contains side-effects. But we can
3447 ignore things that are actual constant or that already have been
3448 handled by this function. */
3450 if (tree_invariant_p (e
))
3453 switch (TREE_CODE_CLASS (code
))
3455 case tcc_exceptional
:
3457 case tcc_declaration
:
3458 case tcc_comparison
:
3460 case tcc_expression
:
3463 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3464 so that it will only be evaluated once. */
3465 /* The reference (r) and comparison (<) classes could be handled as
3466 below, but it is generally faster to only evaluate them once. */
3467 if (TREE_SIDE_EFFECTS (e
))
3468 return save_expr (e
);
3472 /* Constants need no processing. In fact, we should never reach
3477 /* Division is slow and tends to be compiled with jumps,
3478 especially the division by powers of 2 that is often
3479 found inside of an array reference. So do it just once. */
3480 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3481 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3482 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3483 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3484 return save_expr (e
);
3485 /* Recursively stabilize each operand. */
3486 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3487 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3491 /* Recursively stabilize each operand. */
3492 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3499 TREE_TYPE (result
) = TREE_TYPE (e
);
3500 TREE_READONLY (result
) = TREE_READONLY (e
);
3501 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3502 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3507 /* Low-level constructors for expressions. */
3509 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3510 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3513 recompute_tree_invariant_for_addr_expr (tree t
)
3516 bool tc
= true, se
= false;
3518 /* We started out assuming this address is both invariant and constant, but
3519 does not have side effects. Now go down any handled components and see if
3520 any of them involve offsets that are either non-constant or non-invariant.
3521 Also check for side-effects.
3523 ??? Note that this code makes no attempt to deal with the case where
3524 taking the address of something causes a copy due to misalignment. */
3526 #define UPDATE_FLAGS(NODE) \
3527 do { tree _node = (NODE); \
3528 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3529 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3531 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3532 node
= TREE_OPERAND (node
, 0))
3534 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3535 array reference (probably made temporarily by the G++ front end),
3536 so ignore all the operands. */
3537 if ((TREE_CODE (node
) == ARRAY_REF
3538 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3539 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3541 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3542 if (TREE_OPERAND (node
, 2))
3543 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3544 if (TREE_OPERAND (node
, 3))
3545 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3547 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3548 FIELD_DECL, apparently. The G++ front end can put something else
3549 there, at least temporarily. */
3550 else if (TREE_CODE (node
) == COMPONENT_REF
3551 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3553 if (TREE_OPERAND (node
, 2))
3554 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3556 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3557 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3560 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3562 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3563 the address, since &(*a)->b is a form of addition. If it's a constant, the
3564 address is constant too. If it's a decl, its address is constant if the
3565 decl is static. Everything else is not constant and, furthermore,
3566 taking the address of a volatile variable is not volatile. */
3567 if (TREE_CODE (node
) == INDIRECT_REF
3568 || TREE_CODE (node
) == MEM_REF
)
3569 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3570 else if (CONSTANT_CLASS_P (node
))
3572 else if (DECL_P (node
))
3573 tc
&= (staticp (node
) != NULL_TREE
);
3577 se
|= TREE_SIDE_EFFECTS (node
);
3581 TREE_CONSTANT (t
) = tc
;
3582 TREE_SIDE_EFFECTS (t
) = se
;
3586 /* Build an expression of code CODE, data type TYPE, and operands as
3587 specified. Expressions and reference nodes can be created this way.
3588 Constants, decls, types and misc nodes cannot be.
3590 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3591 enough for all extant tree codes. */
3594 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3598 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3600 t
= make_node_stat (code PASS_MEM_STAT
);
3607 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3609 int length
= sizeof (struct tree_exp
);
3610 #ifdef GATHER_STATISTICS
3611 tree_node_kind kind
;
3615 #ifdef GATHER_STATISTICS
3616 switch (TREE_CODE_CLASS (code
))
3618 case tcc_statement
: /* an expression with side effects */
3621 case tcc_reference
: /* a reference */
3629 tree_node_counts
[(int) kind
]++;
3630 tree_node_sizes
[(int) kind
] += length
;
3633 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3635 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3637 memset (t
, 0, sizeof (struct tree_common
));
3639 TREE_SET_CODE (t
, code
);
3641 TREE_TYPE (t
) = type
;
3642 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3643 TREE_OPERAND (t
, 0) = node
;
3644 TREE_BLOCK (t
) = NULL_TREE
;
3645 if (node
&& !TYPE_P (node
))
3647 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3648 TREE_READONLY (t
) = TREE_READONLY (node
);
3651 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3652 TREE_SIDE_EFFECTS (t
) = 1;
3656 /* All of these have side-effects, no matter what their
3658 TREE_SIDE_EFFECTS (t
) = 1;
3659 TREE_READONLY (t
) = 0;
3662 case MISALIGNED_INDIRECT_REF
:
3663 case ALIGN_INDIRECT_REF
:
3665 /* Whether a dereference is readonly has nothing to do with whether
3666 its operand is readonly. */
3667 TREE_READONLY (t
) = 0;
3672 recompute_tree_invariant_for_addr_expr (t
);
3676 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3677 && node
&& !TYPE_P (node
)
3678 && TREE_CONSTANT (node
))
3679 TREE_CONSTANT (t
) = 1;
3680 if (TREE_CODE_CLASS (code
) == tcc_reference
3681 && node
&& TREE_THIS_VOLATILE (node
))
3682 TREE_THIS_VOLATILE (t
) = 1;
3689 #define PROCESS_ARG(N) \
3691 TREE_OPERAND (t, N) = arg##N; \
3692 if (arg##N &&!TYPE_P (arg##N)) \
3694 if (TREE_SIDE_EFFECTS (arg##N)) \
3696 if (!TREE_READONLY (arg##N) \
3697 && !CONSTANT_CLASS_P (arg##N)) \
3698 (void) (read_only = 0); \
3699 if (!TREE_CONSTANT (arg##N)) \
3700 (void) (constant = 0); \
3705 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3707 bool constant
, read_only
, side_effects
;
3710 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3712 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3713 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3714 /* When sizetype precision doesn't match that of pointers
3715 we need to be able to build explicit extensions or truncations
3716 of the offset argument. */
3717 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3718 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3719 && TREE_CODE (arg1
) == INTEGER_CST
);
3721 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3722 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3723 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3724 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3726 t
= make_node_stat (code PASS_MEM_STAT
);
3729 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3730 result based on those same flags for the arguments. But if the
3731 arguments aren't really even `tree' expressions, we shouldn't be trying
3734 /* Expressions without side effects may be constant if their
3735 arguments are as well. */
3736 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3737 || TREE_CODE_CLASS (code
) == tcc_binary
);
3739 side_effects
= TREE_SIDE_EFFECTS (t
);
3744 TREE_READONLY (t
) = read_only
;
3745 TREE_CONSTANT (t
) = constant
;
3746 TREE_SIDE_EFFECTS (t
) = side_effects
;
3747 TREE_THIS_VOLATILE (t
)
3748 = (TREE_CODE_CLASS (code
) == tcc_reference
3749 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3756 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3757 tree arg2 MEM_STAT_DECL
)
3759 bool constant
, read_only
, side_effects
;
3762 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3763 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3765 t
= make_node_stat (code PASS_MEM_STAT
);
3770 /* As a special exception, if COND_EXPR has NULL branches, we
3771 assume that it is a gimple statement and always consider
3772 it to have side effects. */
3773 if (code
== COND_EXPR
3774 && tt
== void_type_node
3775 && arg1
== NULL_TREE
3776 && arg2
== NULL_TREE
)
3777 side_effects
= true;
3779 side_effects
= TREE_SIDE_EFFECTS (t
);
3785 if (code
== COND_EXPR
)
3786 TREE_READONLY (t
) = read_only
;
3788 TREE_SIDE_EFFECTS (t
) = side_effects
;
3789 TREE_THIS_VOLATILE (t
)
3790 = (TREE_CODE_CLASS (code
) == tcc_reference
3791 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3797 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3798 tree arg2
, tree arg3 MEM_STAT_DECL
)
3800 bool constant
, read_only
, side_effects
;
3803 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3805 t
= make_node_stat (code PASS_MEM_STAT
);
3808 side_effects
= TREE_SIDE_EFFECTS (t
);
3815 TREE_SIDE_EFFECTS (t
) = side_effects
;
3816 TREE_THIS_VOLATILE (t
)
3817 = (TREE_CODE_CLASS (code
) == tcc_reference
3818 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3824 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3825 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3827 bool constant
, read_only
, side_effects
;
3830 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3832 t
= make_node_stat (code PASS_MEM_STAT
);
3835 side_effects
= TREE_SIDE_EFFECTS (t
);
3843 TREE_SIDE_EFFECTS (t
) = side_effects
;
3844 TREE_THIS_VOLATILE (t
)
3845 = (TREE_CODE_CLASS (code
) == tcc_reference
3846 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3852 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3853 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3855 bool constant
, read_only
, side_effects
;
3858 gcc_assert (code
== TARGET_MEM_REF
);
3860 t
= make_node_stat (code PASS_MEM_STAT
);
3863 side_effects
= TREE_SIDE_EFFECTS (t
);
3870 if (code
== TARGET_MEM_REF
)
3874 TREE_SIDE_EFFECTS (t
) = side_effects
;
3875 TREE_THIS_VOLATILE (t
)
3876 = (code
== TARGET_MEM_REF
3877 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3882 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3883 on the pointer PTR. */
3886 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3888 HOST_WIDE_INT offset
= 0;
3889 tree ptype
= TREE_TYPE (ptr
);
3891 /* For convenience allow addresses that collapse to a simple base
3893 if (TREE_CODE (ptr
) == ADDR_EXPR
3894 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3895 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3897 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3899 ptr
= build_fold_addr_expr (ptr
);
3900 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3902 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3903 ptr
, build_int_cst (ptype
, offset
));
3904 SET_EXPR_LOCATION (tem
, loc
);
3908 /* Return the constant offset of a MEM_REF tree T. */
3911 mem_ref_offset (const_tree t
)
3913 tree toff
= TREE_OPERAND (t
, 1);
3914 return double_int_sext (tree_to_double_int (toff
),
3915 TYPE_PRECISION (TREE_TYPE (toff
)));
3918 /* Similar except don't specify the TREE_TYPE
3919 and leave the TREE_SIDE_EFFECTS as 0.
3920 It is permissible for arguments to be null,
3921 or even garbage if their values do not matter. */
3924 build_nt (enum tree_code code
, ...)
3931 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3935 t
= make_node (code
);
3936 length
= TREE_CODE_LENGTH (code
);
3938 for (i
= 0; i
< length
; i
++)
3939 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3945 /* Similar to build_nt, but for creating a CALL_EXPR object with a
3949 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
3954 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
3955 CALL_EXPR_FN (ret
) = fn
;
3956 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
3957 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
3958 CALL_EXPR_ARG (ret
, ix
) = t
;
3962 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3963 We do NOT enter this node in any sort of symbol table.
3965 LOC is the location of the decl.
3967 layout_decl is used to set up the decl's storage layout.
3968 Other slots are initialized to 0 or null pointers. */
3971 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
3972 tree type MEM_STAT_DECL
)
3976 t
= make_node_stat (code PASS_MEM_STAT
);
3977 DECL_SOURCE_LOCATION (t
) = loc
;
3979 /* if (type == error_mark_node)
3980 type = integer_type_node; */
3981 /* That is not done, deliberately, so that having error_mark_node
3982 as the type can suppress useless errors in the use of this variable. */
3984 DECL_NAME (t
) = name
;
3985 TREE_TYPE (t
) = type
;
3987 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3993 /* Builds and returns function declaration with NAME and TYPE. */
3996 build_fn_decl (const char *name
, tree type
)
3998 tree id
= get_identifier (name
);
3999 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4001 DECL_EXTERNAL (decl
) = 1;
4002 TREE_PUBLIC (decl
) = 1;
4003 DECL_ARTIFICIAL (decl
) = 1;
4004 TREE_NOTHROW (decl
) = 1;
4010 /* BLOCK nodes are used to represent the structure of binding contours
4011 and declarations, once those contours have been exited and their contents
4012 compiled. This information is used for outputting debugging info. */
4015 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4017 tree block
= make_node (BLOCK
);
4019 BLOCK_VARS (block
) = vars
;
4020 BLOCK_SUBBLOCKS (block
) = subblocks
;
4021 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4022 BLOCK_CHAIN (block
) = chain
;
4027 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4029 LOC is the location to use in tree T. */
4032 protected_set_expr_location (tree t
, location_t loc
)
4034 if (t
&& CAN_HAVE_LOCATION_P (t
))
4035 SET_EXPR_LOCATION (t
, loc
);
4038 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4042 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4044 DECL_ATTRIBUTES (ddecl
) = attribute
;
4048 /* Borrowed from hashtab.c iterative_hash implementation. */
4049 #define mix(a,b,c) \
4051 a -= b; a -= c; a ^= (c>>13); \
4052 b -= c; b -= a; b ^= (a<< 8); \
4053 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4054 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4055 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4056 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4057 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4058 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4059 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4063 /* Produce good hash value combining VAL and VAL2. */
4065 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4067 /* the golden ratio; an arbitrary value. */
4068 hashval_t a
= 0x9e3779b9;
4074 /* Produce good hash value combining VAL and VAL2. */
4076 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4078 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4079 return iterative_hash_hashval_t (val
, val2
);
4082 hashval_t a
= (hashval_t
) val
;
4083 /* Avoid warnings about shifting of more than the width of the type on
4084 hosts that won't execute this path. */
4086 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4088 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4090 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4091 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4098 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4099 is ATTRIBUTE and its qualifiers are QUALS.
4101 Record such modified types already made so we don't make duplicates. */
4104 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4106 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4108 hashval_t hashcode
= 0;
4110 enum tree_code code
= TREE_CODE (ttype
);
4112 /* Building a distinct copy of a tagged type is inappropriate; it
4113 causes breakage in code that expects there to be a one-to-one
4114 relationship between a struct and its fields.
4115 build_duplicate_type is another solution (as used in
4116 handle_transparent_union_attribute), but that doesn't play well
4117 with the stronger C++ type identity model. */
4118 if (TREE_CODE (ttype
) == RECORD_TYPE
4119 || TREE_CODE (ttype
) == UNION_TYPE
4120 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4121 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4123 warning (OPT_Wattributes
,
4124 "ignoring attributes applied to %qT after definition",
4125 TYPE_MAIN_VARIANT (ttype
));
4126 return build_qualified_type (ttype
, quals
);
4129 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4130 ntype
= build_distinct_type_copy (ttype
);
4132 TYPE_ATTRIBUTES (ntype
) = attribute
;
4134 hashcode
= iterative_hash_object (code
, hashcode
);
4135 if (TREE_TYPE (ntype
))
4136 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4138 hashcode
= attribute_hash_list (attribute
, hashcode
);
4140 switch (TREE_CODE (ntype
))
4143 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4146 if (TYPE_DOMAIN (ntype
))
4147 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4151 hashcode
= iterative_hash_object
4152 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4153 hashcode
= iterative_hash_object
4154 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4157 case FIXED_POINT_TYPE
:
4159 unsigned int precision
= TYPE_PRECISION (ntype
);
4160 hashcode
= iterative_hash_object (precision
, hashcode
);
4167 ntype
= type_hash_canon (hashcode
, ntype
);
4169 /* If the target-dependent attributes make NTYPE different from
4170 its canonical type, we will need to use structural equality
4171 checks for this type. */
4172 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4173 || !targetm
.comp_type_attributes (ntype
, ttype
))
4174 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4175 else if (TYPE_CANONICAL (ntype
) == ntype
)
4176 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4178 ttype
= build_qualified_type (ntype
, quals
);
4180 else if (TYPE_QUALS (ttype
) != quals
)
4181 ttype
= build_qualified_type (ttype
, quals
);
4187 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4190 Record such modified types already made so we don't make duplicates. */
4193 build_type_attribute_variant (tree ttype
, tree attribute
)
4195 return build_type_attribute_qual_variant (ttype
, attribute
,
4196 TYPE_QUALS (ttype
));
4200 /* Reset the expression *EXPR_P, a size or position.
4202 ??? We could reset all non-constant sizes or positions. But it's cheap
4203 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4205 We need to reset self-referential sizes or positions because they cannot
4206 be gimplified and thus can contain a CALL_EXPR after the gimplification
4207 is finished, which will run afoul of LTO streaming. And they need to be
4208 reset to something essentially dummy but not constant, so as to preserve
4209 the properties of the object they are attached to. */
4212 free_lang_data_in_one_sizepos (tree
*expr_p
)
4214 tree expr
= *expr_p
;
4215 if (CONTAINS_PLACEHOLDER_P (expr
))
4216 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4220 /* Reset all the fields in a binfo node BINFO. We only keep
4221 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4224 free_lang_data_in_binfo (tree binfo
)
4229 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4231 BINFO_VTABLE (binfo
) = NULL_TREE
;
4232 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4233 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4234 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4236 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
); i
++)
4237 free_lang_data_in_binfo (t
);
4241 /* Reset all language specific information still present in TYPE. */
4244 free_lang_data_in_type (tree type
)
4246 gcc_assert (TYPE_P (type
));
4248 /* Give the FE a chance to remove its own data first. */
4249 lang_hooks
.free_lang_data (type
);
4251 TREE_LANG_FLAG_0 (type
) = 0;
4252 TREE_LANG_FLAG_1 (type
) = 0;
4253 TREE_LANG_FLAG_2 (type
) = 0;
4254 TREE_LANG_FLAG_3 (type
) = 0;
4255 TREE_LANG_FLAG_4 (type
) = 0;
4256 TREE_LANG_FLAG_5 (type
) = 0;
4257 TREE_LANG_FLAG_6 (type
) = 0;
4259 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4261 /* Remove the const and volatile qualifiers from arguments. The
4262 C++ front end removes them, but the C front end does not,
4263 leading to false ODR violation errors when merging two
4264 instances of the same function signature compiled by
4265 different front ends. */
4268 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4270 tree arg_type
= TREE_VALUE (p
);
4272 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4274 int quals
= TYPE_QUALS (arg_type
)
4276 & ~TYPE_QUAL_VOLATILE
;
4277 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4278 free_lang_data_in_type (TREE_VALUE (p
));
4283 /* Remove members that are not actually FIELD_DECLs from the field
4284 list of an aggregate. These occur in C++. */
4285 if (RECORD_OR_UNION_TYPE_P (type
))
4289 /* Note that TYPE_FIELDS can be shared across distinct
4290 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4291 to be removed, we cannot set its TREE_CHAIN to NULL.
4292 Otherwise, we would not be able to find all the other fields
4293 in the other instances of this TREE_TYPE.
4295 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4297 member
= TYPE_FIELDS (type
);
4300 if (TREE_CODE (member
) == FIELD_DECL
)
4303 TREE_CHAIN (prev
) = member
;
4305 TYPE_FIELDS (type
) = member
;
4309 member
= TREE_CHAIN (member
);
4313 TREE_CHAIN (prev
) = NULL_TREE
;
4315 TYPE_FIELDS (type
) = NULL_TREE
;
4317 TYPE_METHODS (type
) = NULL_TREE
;
4318 if (TYPE_BINFO (type
))
4319 free_lang_data_in_binfo (TYPE_BINFO (type
));
4323 /* For non-aggregate types, clear out the language slot (which
4324 overloads TYPE_BINFO). */
4325 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4327 if (INTEGRAL_TYPE_P (type
)
4328 || SCALAR_FLOAT_TYPE_P (type
)
4329 || FIXED_POINT_TYPE_P (type
))
4331 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4332 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4336 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4337 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4339 if (debug_info_level
< DINFO_LEVEL_TERSE
4340 || (TYPE_CONTEXT (type
)
4341 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4342 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4343 TYPE_CONTEXT (type
) = NULL_TREE
;
4345 if (debug_info_level
< DINFO_LEVEL_TERSE
)
4346 TYPE_STUB_DECL (type
) = NULL_TREE
;
4350 /* Return true if DECL may need an assembler name to be set. */
4353 need_assembler_name_p (tree decl
)
4355 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4356 if (TREE_CODE (decl
) != FUNCTION_DECL
4357 && TREE_CODE (decl
) != VAR_DECL
)
4360 /* If DECL already has its assembler name set, it does not need a
4362 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4363 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4366 /* Abstract decls do not need an assembler name. */
4367 if (DECL_ABSTRACT (decl
))
4370 /* For VAR_DECLs, only static, public and external symbols need an
4372 if (TREE_CODE (decl
) == VAR_DECL
4373 && !TREE_STATIC (decl
)
4374 && !TREE_PUBLIC (decl
)
4375 && !DECL_EXTERNAL (decl
))
4378 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4380 /* Do not set assembler name on builtins. Allow RTL expansion to
4381 decide whether to expand inline or via a regular call. */
4382 if (DECL_BUILT_IN (decl
)
4383 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4386 /* Functions represented in the callgraph need an assembler name. */
4387 if (cgraph_get_node (decl
) != NULL
)
4390 /* Unused and not public functions don't need an assembler name. */
4391 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4399 /* Remove all the non-variable decls from BLOCK. LOCALS is the set of
4400 variables in DECL_STRUCT_FUNCTION (FN)->local_decls. Every decl
4401 in BLOCK that is not in LOCALS is removed. */
4404 free_lang_data_in_block (tree fn
, tree block
, struct pointer_set_t
*locals
)
4408 tp
= &BLOCK_VARS (block
);
4411 if (!pointer_set_contains (locals
, *tp
))
4412 *tp
= TREE_CHAIN (*tp
);
4414 tp
= &TREE_CHAIN (*tp
);
4417 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4418 free_lang_data_in_block (fn
, t
, locals
);
4422 /* Reset all language specific information still present in symbol
4426 free_lang_data_in_decl (tree decl
)
4428 gcc_assert (DECL_P (decl
));
4430 /* Give the FE a chance to remove its own data first. */
4431 lang_hooks
.free_lang_data (decl
);
4433 TREE_LANG_FLAG_0 (decl
) = 0;
4434 TREE_LANG_FLAG_1 (decl
) = 0;
4435 TREE_LANG_FLAG_2 (decl
) = 0;
4436 TREE_LANG_FLAG_3 (decl
) = 0;
4437 TREE_LANG_FLAG_4 (decl
) = 0;
4438 TREE_LANG_FLAG_5 (decl
) = 0;
4439 TREE_LANG_FLAG_6 (decl
) = 0;
4441 /* Identifiers need not have a type. */
4442 if (DECL_NAME (decl
))
4443 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4445 /* Ignore any intervening types, because we are going to clear their
4446 TYPE_CONTEXT fields. */
4447 if (TREE_CODE (decl
) != FIELD_DECL
4448 && TREE_CODE (decl
) != FUNCTION_DECL
)
4449 DECL_CONTEXT (decl
) = decl_function_context (decl
);
4451 if (DECL_CONTEXT (decl
)
4452 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
)
4453 DECL_CONTEXT (decl
) = NULL_TREE
;
4455 if (TREE_CODE (decl
) == VAR_DECL
)
4457 tree context
= DECL_CONTEXT (decl
);
4461 enum tree_code code
= TREE_CODE (context
);
4462 if (code
== FUNCTION_DECL
&& DECL_ABSTRACT (context
))
4464 /* Do not clear the decl context here, that will promote
4465 all vars to global ones. */
4466 DECL_INITIAL (decl
) = NULL_TREE
;
4469 if (TREE_STATIC (decl
))
4470 DECL_CONTEXT (decl
) = NULL_TREE
;
4474 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4475 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4476 if (TREE_CODE (decl
) == FIELD_DECL
)
4477 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4479 /* DECL_FCONTEXT is only used for debug info generation. */
4480 if (TREE_CODE (decl
) == FIELD_DECL
4481 && debug_info_level
< DINFO_LEVEL_TERSE
)
4482 DECL_FCONTEXT (decl
) = NULL_TREE
;
4484 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4486 if (gimple_has_body_p (decl
))
4489 struct pointer_set_t
*locals
;
4491 /* If DECL has a gimple body, then the context for its
4492 arguments must be DECL. Otherwise, it doesn't really
4493 matter, as we will not be emitting any code for DECL. In
4494 general, there may be other instances of DECL created by
4495 the front end and since PARM_DECLs are generally shared,
4496 their DECL_CONTEXT changes as the replicas of DECL are
4497 created. The only time where DECL_CONTEXT is important
4498 is for the FUNCTION_DECLs that have a gimple body (since
4499 the PARM_DECL will be used in the function's body). */
4500 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4501 DECL_CONTEXT (t
) = decl
;
4503 /* Collect all the symbols declared in DECL. */
4504 locals
= pointer_set_create ();
4505 t
= DECL_STRUCT_FUNCTION (decl
)->local_decls
;
4506 for (; t
; t
= TREE_CHAIN (t
))
4508 pointer_set_insert (locals
, TREE_VALUE (t
));
4510 /* All the local symbols should have DECL as their
4512 DECL_CONTEXT (TREE_VALUE (t
)) = decl
;
4515 /* Get rid of any decl not in local_decls. */
4516 free_lang_data_in_block (decl
, DECL_INITIAL (decl
), locals
);
4518 pointer_set_destroy (locals
);
4521 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4522 At this point, it is not needed anymore. */
4523 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4525 else if (TREE_CODE (decl
) == VAR_DECL
)
4527 tree expr
= DECL_DEBUG_EXPR (decl
);
4529 && TREE_CODE (expr
) == VAR_DECL
4530 && !TREE_STATIC (expr
) && !DECL_EXTERNAL (expr
))
4531 SET_DECL_DEBUG_EXPR (decl
, NULL_TREE
);
4533 if (DECL_EXTERNAL (decl
)
4534 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4535 DECL_INITIAL (decl
) = NULL_TREE
;
4537 else if (TREE_CODE (decl
) == TYPE_DECL
)
4539 DECL_INITIAL (decl
) = NULL_TREE
;
4541 /* DECL_CONTEXT is overloaded as DECL_FIELD_CONTEXT for
4542 FIELD_DECLs, which should be preserved. Otherwise,
4543 we shouldn't be concerned with source-level lexical
4544 nesting beyond this point. */
4545 DECL_CONTEXT (decl
) = NULL_TREE
;
4550 /* Data used when collecting DECLs and TYPEs for language data removal. */
4552 struct free_lang_data_d
4554 /* Worklist to avoid excessive recursion. */
4555 VEC(tree
,heap
) *worklist
;
4557 /* Set of traversed objects. Used to avoid duplicate visits. */
4558 struct pointer_set_t
*pset
;
4560 /* Array of symbols to process with free_lang_data_in_decl. */
4561 VEC(tree
,heap
) *decls
;
4563 /* Array of types to process with free_lang_data_in_type. */
4564 VEC(tree
,heap
) *types
;
4568 /* Save all language fields needed to generate proper debug information
4569 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4572 save_debug_info_for_decl (tree t
)
4574 /*struct saved_debug_info_d *sdi;*/
4576 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4578 /* FIXME. Partial implementation for saving debug info removed. */
4582 /* Save all language fields needed to generate proper debug information
4583 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4586 save_debug_info_for_type (tree t
)
4588 /*struct saved_debug_info_d *sdi;*/
4590 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4592 /* FIXME. Partial implementation for saving debug info removed. */
4596 /* Add type or decl T to one of the list of tree nodes that need their
4597 language data removed. The lists are held inside FLD. */
4600 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4604 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4605 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4606 save_debug_info_for_decl (t
);
4608 else if (TYPE_P (t
))
4610 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4611 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4612 save_debug_info_for_type (t
);
4618 /* Push tree node T into FLD->WORKLIST. */
4621 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4623 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4624 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4628 /* Operand callback helper for free_lang_data_in_node. *TP is the
4629 subtree operand being considered. */
4632 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4635 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4637 if (TREE_CODE (t
) == TREE_LIST
)
4640 /* Language specific nodes will be removed, so there is no need
4641 to gather anything under them. */
4642 if (is_lang_specific (t
))
4650 /* Note that walk_tree does not traverse every possible field in
4651 decls, so we have to do our own traversals here. */
4652 add_tree_to_fld_list (t
, fld
);
4654 fld_worklist_push (DECL_NAME (t
), fld
);
4655 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4656 fld_worklist_push (DECL_SIZE (t
), fld
);
4657 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4659 /* We are going to remove everything under DECL_INITIAL for
4660 TYPE_DECLs. No point walking them. */
4661 if (TREE_CODE (t
) != TYPE_DECL
)
4662 fld_worklist_push (DECL_INITIAL (t
), fld
);
4664 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4665 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4667 if (TREE_CODE (t
) == FUNCTION_DECL
)
4669 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4670 fld_worklist_push (DECL_RESULT (t
), fld
);
4672 else if (TREE_CODE (t
) == TYPE_DECL
)
4674 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4675 fld_worklist_push (DECL_VINDEX (t
), fld
);
4677 else if (TREE_CODE (t
) == FIELD_DECL
)
4679 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4680 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4681 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4682 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4683 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4685 else if (TREE_CODE (t
) == VAR_DECL
)
4687 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4688 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4691 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4692 && DECL_HAS_VALUE_EXPR_P (t
))
4693 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4695 if (TREE_CODE (t
) != FIELD_DECL
)
4696 fld_worklist_push (TREE_CHAIN (t
), fld
);
4699 else if (TYPE_P (t
))
4701 /* Note that walk_tree does not traverse every possible field in
4702 types, so we have to do our own traversals here. */
4703 add_tree_to_fld_list (t
, fld
);
4705 if (!RECORD_OR_UNION_TYPE_P (t
))
4706 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4707 fld_worklist_push (TYPE_SIZE (t
), fld
);
4708 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4709 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4710 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4711 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4712 fld_worklist_push (TYPE_NAME (t
), fld
);
4713 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4714 if (!RECORD_OR_UNION_TYPE_P (t
))
4715 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4716 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4717 fld_worklist_push (TYPE_NEXT_VARIANT (t
), fld
);
4718 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4719 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
4721 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4725 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4727 fld_worklist_push (TREE_TYPE (tem
), fld
);
4728 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4730 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4731 && TREE_CODE (tem
) == TREE_LIST
)
4734 fld_worklist_push (TREE_VALUE (tem
), fld
);
4735 tem
= TREE_CHAIN (tem
);
4739 if (RECORD_OR_UNION_TYPE_P (t
))
4742 /* Push all TYPE_FIELDS - there can be interleaving interesting
4743 and non-interesting things. */
4744 tem
= TYPE_FIELDS (t
);
4747 if (TREE_CODE (tem
) == FIELD_DECL
)
4748 fld_worklist_push (tem
, fld
);
4749 tem
= TREE_CHAIN (tem
);
4753 fld_worklist_push (TREE_CHAIN (t
), fld
);
4756 else if (TREE_CODE (t
) == BLOCK
)
4759 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4760 fld_worklist_push (tem
, fld
);
4761 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4762 fld_worklist_push (tem
, fld
);
4763 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4766 fld_worklist_push (TREE_TYPE (t
), fld
);
4772 /* Find decls and types in T. */
4775 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4779 if (!pointer_set_contains (fld
->pset
, t
))
4780 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4781 if (VEC_empty (tree
, fld
->worklist
))
4783 t
= VEC_pop (tree
, fld
->worklist
);
4787 /* Translate all the types in LIST with the corresponding runtime
4791 get_eh_types_for_runtime (tree list
)
4795 if (list
== NULL_TREE
)
4798 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4800 list
= TREE_CHAIN (list
);
4803 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4804 TREE_CHAIN (prev
) = n
;
4805 prev
= TREE_CHAIN (prev
);
4806 list
= TREE_CHAIN (list
);
4813 /* Find decls and types referenced in EH region R and store them in
4814 FLD->DECLS and FLD->TYPES. */
4817 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4828 /* The types referenced in each catch must first be changed to the
4829 EH types used at runtime. This removes references to FE types
4831 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4833 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4834 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4839 case ERT_ALLOWED_EXCEPTIONS
:
4840 r
->u
.allowed
.type_list
4841 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4842 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4845 case ERT_MUST_NOT_THROW
:
4846 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4847 find_decls_types_r
, fld
, fld
->pset
);
4853 /* Find decls and types referenced in cgraph node N and store them in
4854 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4855 look for *every* kind of DECL and TYPE node reachable from N,
4856 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4857 NAMESPACE_DECLs, etc). */
4860 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4863 struct function
*fn
;
4866 find_decls_types (n
->decl
, fld
);
4868 if (!gimple_has_body_p (n
->decl
))
4871 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
4873 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
4875 /* Traverse locals. */
4876 for (t
= fn
->local_decls
; t
; t
= TREE_CHAIN (t
))
4877 find_decls_types (TREE_VALUE (t
), fld
);
4879 /* Traverse EH regions in FN. */
4882 FOR_ALL_EH_REGION_FN (r
, fn
)
4883 find_decls_types_in_eh_region (r
, fld
);
4886 /* Traverse every statement in FN. */
4887 FOR_EACH_BB_FN (bb
, fn
)
4889 gimple_stmt_iterator si
;
4892 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
4894 gimple phi
= gsi_stmt (si
);
4896 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4898 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
4899 find_decls_types (*arg_p
, fld
);
4903 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
4905 gimple stmt
= gsi_stmt (si
);
4907 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
4909 tree arg
= gimple_op (stmt
, i
);
4910 find_decls_types (arg
, fld
);
4917 /* Find decls and types referenced in varpool node N and store them in
4918 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4919 look for *every* kind of DECL and TYPE node reachable from N,
4920 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4921 NAMESPACE_DECLs, etc). */
4924 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
4926 find_decls_types (v
->decl
, fld
);
4929 /* If T needs an assembler name, have one created for it. */
4932 assign_assembler_name_if_neeeded (tree t
)
4934 if (need_assembler_name_p (t
))
4936 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
4937 diagnostics that use input_location to show locus
4938 information. The problem here is that, at this point,
4939 input_location is generally anchored to the end of the file
4940 (since the parser is long gone), so we don't have a good
4941 position to pin it to.
4943 To alleviate this problem, this uses the location of T's
4944 declaration. Examples of this are
4945 testsuite/g++.dg/template/cond2.C and
4946 testsuite/g++.dg/template/pr35240.C. */
4947 location_t saved_location
= input_location
;
4948 input_location
= DECL_SOURCE_LOCATION (t
);
4950 decl_assembler_name (t
);
4952 input_location
= saved_location
;
4957 /* Free language specific information for every operand and expression
4958 in every node of the call graph. This process operates in three stages:
4960 1- Every callgraph node and varpool node is traversed looking for
4961 decls and types embedded in them. This is a more exhaustive
4962 search than that done by find_referenced_vars, because it will
4963 also collect individual fields, decls embedded in types, etc.
4965 2- All the decls found are sent to free_lang_data_in_decl.
4967 3- All the types found are sent to free_lang_data_in_type.
4969 The ordering between decls and types is important because
4970 free_lang_data_in_decl sets assembler names, which includes
4971 mangling. So types cannot be freed up until assembler names have
4975 free_lang_data_in_cgraph (void)
4977 struct cgraph_node
*n
;
4978 struct varpool_node
*v
;
4979 struct free_lang_data_d fld
;
4984 /* Initialize sets and arrays to store referenced decls and types. */
4985 fld
.pset
= pointer_set_create ();
4986 fld
.worklist
= NULL
;
4987 fld
.decls
= VEC_alloc (tree
, heap
, 100);
4988 fld
.types
= VEC_alloc (tree
, heap
, 100);
4990 /* Find decls and types in the body of every function in the callgraph. */
4991 for (n
= cgraph_nodes
; n
; n
= n
->next
)
4992 find_decls_types_in_node (n
, &fld
);
4994 for (i
= 0; VEC_iterate (alias_pair
, alias_pairs
, i
, p
); i
++)
4995 find_decls_types (p
->decl
, &fld
);
4997 /* Find decls and types in every varpool symbol. */
4998 for (v
= varpool_nodes_queue
; v
; v
= v
->next_needed
)
4999 find_decls_types_in_var (v
, &fld
);
5001 /* Set the assembler name on every decl found. We need to do this
5002 now because free_lang_data_in_decl will invalidate data needed
5003 for mangling. This breaks mangling on interdependent decls. */
5004 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
5005 assign_assembler_name_if_neeeded (t
);
5007 /* Traverse every decl found freeing its language data. */
5008 for (i
= 0; VEC_iterate (tree
, fld
.decls
, i
, t
); i
++)
5009 free_lang_data_in_decl (t
);
5011 /* Traverse every type found freeing its language data. */
5012 for (i
= 0; VEC_iterate (tree
, fld
.types
, i
, t
); i
++)
5013 free_lang_data_in_type (t
);
5015 pointer_set_destroy (fld
.pset
);
5016 VEC_free (tree
, heap
, fld
.worklist
);
5017 VEC_free (tree
, heap
, fld
.decls
);
5018 VEC_free (tree
, heap
, fld
.types
);
5022 /* Free resources that are used by FE but are not needed once they are done. */
5025 free_lang_data (void)
5029 /* If we are the LTO frontend we have freed lang-specific data already. */
5031 || !flag_generate_lto
)
5034 /* Allocate and assign alias sets to the standard integer types
5035 while the slots are still in the way the frontends generated them. */
5036 for (i
= 0; i
< itk_none
; ++i
)
5037 if (integer_types
[i
])
5038 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5040 /* Traverse the IL resetting language specific information for
5041 operands, expressions, etc. */
5042 free_lang_data_in_cgraph ();
5044 /* Create gimple variants for common types. */
5045 ptrdiff_type_node
= integer_type_node
;
5046 fileptr_type_node
= ptr_type_node
;
5047 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
5048 || (TYPE_MODE (boolean_type_node
)
5049 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
5050 || TYPE_PRECISION (boolean_type_node
) != 1
5051 || !TYPE_UNSIGNED (boolean_type_node
))
5053 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5054 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5055 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5056 TYPE_PRECISION (boolean_type_node
) = 1;
5057 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5058 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5061 /* Unify char_type_node with its properly signed variant. */
5062 if (TYPE_UNSIGNED (char_type_node
))
5063 unsigned_char_type_node
= char_type_node
;
5065 signed_char_type_node
= char_type_node
;
5067 /* Reset some langhooks. Do not reset types_compatible_p, it may
5068 still be used indirectly via the get_alias_set langhook. */
5069 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5070 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5071 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5072 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
5074 /* Reset diagnostic machinery. */
5075 diagnostic_starter (global_dc
) = default_tree_diagnostic_starter
;
5076 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5077 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5083 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5087 "*free_lang_data", /* name */
5089 free_lang_data
, /* execute */
5092 0, /* static_pass_number */
5093 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5094 0, /* properties_required */
5095 0, /* properties_provided */
5096 0, /* properties_destroyed */
5097 0, /* todo_flags_start */
5098 TODO_ggc_collect
/* todo_flags_finish */
5102 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5105 We try both `text' and `__text__', ATTR may be either one. */
5106 /* ??? It might be a reasonable simplification to require ATTR to be only
5107 `text'. One might then also require attribute lists to be stored in
5108 their canonicalized form. */
5111 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5116 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5119 p
= IDENTIFIER_POINTER (ident
);
5120 ident_len
= IDENTIFIER_LENGTH (ident
);
5122 if (ident_len
== attr_len
5123 && strcmp (attr
, p
) == 0)
5126 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5129 gcc_assert (attr
[1] == '_');
5130 gcc_assert (attr
[attr_len
- 2] == '_');
5131 gcc_assert (attr
[attr_len
- 1] == '_');
5132 if (ident_len
== attr_len
- 4
5133 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5138 if (ident_len
== attr_len
+ 4
5139 && p
[0] == '_' && p
[1] == '_'
5140 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5141 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5148 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5151 We try both `text' and `__text__', ATTR may be either one. */
5154 is_attribute_p (const char *attr
, const_tree ident
)
5156 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5159 /* Given an attribute name and a list of attributes, return a pointer to the
5160 attribute's list element if the attribute is part of the list, or NULL_TREE
5161 if not found. If the attribute appears more than once, this only
5162 returns the first occurrence; the TREE_CHAIN of the return value should
5163 be passed back in if further occurrences are wanted. */
5166 lookup_attribute (const char *attr_name
, tree list
)
5169 size_t attr_len
= strlen (attr_name
);
5171 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5173 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5174 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5180 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5184 remove_attribute (const char *attr_name
, tree list
)
5187 size_t attr_len
= strlen (attr_name
);
5189 for (p
= &list
; *p
; )
5192 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5193 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5194 *p
= TREE_CHAIN (l
);
5196 p
= &TREE_CHAIN (l
);
5202 /* Return an attribute list that is the union of a1 and a2. */
5205 merge_attributes (tree a1
, tree a2
)
5209 /* Either one unset? Take the set one. */
5211 if ((attributes
= a1
) == 0)
5214 /* One that completely contains the other? Take it. */
5216 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5218 if (attribute_list_contained (a2
, a1
))
5222 /* Pick the longest list, and hang on the other list. */
5224 if (list_length (a1
) < list_length (a2
))
5225 attributes
= a2
, a2
= a1
;
5227 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5230 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5233 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5236 if (TREE_VALUE (a
) != NULL
5237 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
5238 && TREE_VALUE (a2
) != NULL
5239 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
5241 if (simple_cst_list_equal (TREE_VALUE (a
),
5242 TREE_VALUE (a2
)) == 1)
5245 else if (simple_cst_equal (TREE_VALUE (a
),
5246 TREE_VALUE (a2
)) == 1)
5251 a1
= copy_node (a2
);
5252 TREE_CHAIN (a1
) = attributes
;
5261 /* Given types T1 and T2, merge their attributes and return
5265 merge_type_attributes (tree t1
, tree t2
)
5267 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5268 TYPE_ATTRIBUTES (t2
));
5271 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5275 merge_decl_attributes (tree olddecl
, tree newdecl
)
5277 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5278 DECL_ATTRIBUTES (newdecl
));
5281 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5283 /* Specialization of merge_decl_attributes for various Windows targets.
5285 This handles the following situation:
5287 __declspec (dllimport) int foo;
5290 The second instance of `foo' nullifies the dllimport. */
5293 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5296 int delete_dllimport_p
= 1;
5298 /* What we need to do here is remove from `old' dllimport if it doesn't
5299 appear in `new'. dllimport behaves like extern: if a declaration is
5300 marked dllimport and a definition appears later, then the object
5301 is not dllimport'd. We also remove a `new' dllimport if the old list
5302 contains dllexport: dllexport always overrides dllimport, regardless
5303 of the order of declaration. */
5304 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5305 delete_dllimport_p
= 0;
5306 else if (DECL_DLLIMPORT_P (new_tree
)
5307 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5309 DECL_DLLIMPORT_P (new_tree
) = 0;
5310 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5311 "dllimport ignored", new_tree
);
5313 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5315 /* Warn about overriding a symbol that has already been used, e.g.:
5316 extern int __attribute__ ((dllimport)) foo;
5317 int* bar () {return &foo;}
5320 if (TREE_USED (old
))
5322 warning (0, "%q+D redeclared without dllimport attribute "
5323 "after being referenced with dll linkage", new_tree
);
5324 /* If we have used a variable's address with dllimport linkage,
5325 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5326 decl may already have had TREE_CONSTANT computed.
5327 We still remove the attribute so that assembler code refers
5328 to '&foo rather than '_imp__foo'. */
5329 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5330 DECL_DLLIMPORT_P (new_tree
) = 1;
5333 /* Let an inline definition silently override the external reference,
5334 but otherwise warn about attribute inconsistency. */
5335 else if (TREE_CODE (new_tree
) == VAR_DECL
5336 || !DECL_DECLARED_INLINE_P (new_tree
))
5337 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5338 "previous dllimport ignored", new_tree
);
5341 delete_dllimport_p
= 0;
5343 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5345 if (delete_dllimport_p
)
5348 const size_t attr_len
= strlen ("dllimport");
5350 /* Scan the list for dllimport and delete it. */
5351 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5353 if (is_attribute_with_length_p ("dllimport", attr_len
,
5356 if (prev
== NULL_TREE
)
5359 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5368 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5369 struct attribute_spec.handler. */
5372 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5378 /* These attributes may apply to structure and union types being created,
5379 but otherwise should pass to the declaration involved. */
5382 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5383 | (int) ATTR_FLAG_ARRAY_NEXT
))
5385 *no_add_attrs
= true;
5386 return tree_cons (name
, args
, NULL_TREE
);
5388 if (TREE_CODE (node
) == RECORD_TYPE
5389 || TREE_CODE (node
) == UNION_TYPE
)
5391 node
= TYPE_NAME (node
);
5397 warning (OPT_Wattributes
, "%qE attribute ignored",
5399 *no_add_attrs
= true;
5404 if (TREE_CODE (node
) != FUNCTION_DECL
5405 && TREE_CODE (node
) != VAR_DECL
5406 && TREE_CODE (node
) != TYPE_DECL
)
5408 *no_add_attrs
= true;
5409 warning (OPT_Wattributes
, "%qE attribute ignored",
5414 if (TREE_CODE (node
) == TYPE_DECL
5415 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5416 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5418 *no_add_attrs
= true;
5419 warning (OPT_Wattributes
, "%qE attribute ignored",
5424 is_dllimport
= is_attribute_p ("dllimport", name
);
5426 /* Report error on dllimport ambiguities seen now before they cause
5430 /* Honor any target-specific overrides. */
5431 if (!targetm
.valid_dllimport_attribute_p (node
))
5432 *no_add_attrs
= true;
5434 else if (TREE_CODE (node
) == FUNCTION_DECL
5435 && DECL_DECLARED_INLINE_P (node
))
5437 warning (OPT_Wattributes
, "inline function %q+D declared as "
5438 " dllimport: attribute ignored", node
);
5439 *no_add_attrs
= true;
5441 /* Like MS, treat definition of dllimported variables and
5442 non-inlined functions on declaration as syntax errors. */
5443 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5445 error ("function %q+D definition is marked dllimport", node
);
5446 *no_add_attrs
= true;
5449 else if (TREE_CODE (node
) == VAR_DECL
)
5451 if (DECL_INITIAL (node
))
5453 error ("variable %q+D definition is marked dllimport",
5455 *no_add_attrs
= true;
5458 /* `extern' needn't be specified with dllimport.
5459 Specify `extern' now and hope for the best. Sigh. */
5460 DECL_EXTERNAL (node
) = 1;
5461 /* Also, implicitly give dllimport'd variables declared within
5462 a function global scope, unless declared static. */
5463 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5464 TREE_PUBLIC (node
) = 1;
5467 if (*no_add_attrs
== false)
5468 DECL_DLLIMPORT_P (node
) = 1;
5470 else if (TREE_CODE (node
) == FUNCTION_DECL
5471 && DECL_DECLARED_INLINE_P (node
))
5472 /* An exported function, even if inline, must be emitted. */
5473 DECL_EXTERNAL (node
) = 0;
5475 /* Report error if symbol is not accessible at global scope. */
5476 if (!TREE_PUBLIC (node
)
5477 && (TREE_CODE (node
) == VAR_DECL
5478 || TREE_CODE (node
) == FUNCTION_DECL
))
5480 error ("external linkage required for symbol %q+D because of "
5481 "%qE attribute", node
, name
);
5482 *no_add_attrs
= true;
5485 /* A dllexport'd entity must have default visibility so that other
5486 program units (shared libraries or the main executable) can see
5487 it. A dllimport'd entity must have default visibility so that
5488 the linker knows that undefined references within this program
5489 unit can be resolved by the dynamic linker. */
5492 if (DECL_VISIBILITY_SPECIFIED (node
)
5493 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5494 error ("%qE implies default visibility, but %qD has already "
5495 "been declared with a different visibility",
5497 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5498 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5504 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5506 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5507 of the various TYPE_QUAL values. */
5510 set_type_quals (tree type
, int type_quals
)
5512 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5513 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5514 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5515 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5518 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5521 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5523 return (TYPE_QUALS (cand
) == type_quals
5524 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5525 /* Apparently this is needed for Objective-C. */
5526 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5527 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5528 TYPE_ATTRIBUTES (base
)));
5531 /* Return a version of the TYPE, qualified as indicated by the
5532 TYPE_QUALS, if one exists. If no qualified version exists yet,
5533 return NULL_TREE. */
5536 get_qualified_type (tree type
, int type_quals
)
5540 if (TYPE_QUALS (type
) == type_quals
)
5543 /* Search the chain of variants to see if there is already one there just
5544 like the one we need to have. If so, use that existing one. We must
5545 preserve the TYPE_NAME, since there is code that depends on this. */
5546 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5547 if (check_qualified_type (t
, type
, type_quals
))
5553 /* Like get_qualified_type, but creates the type if it does not
5554 exist. This function never returns NULL_TREE. */
5557 build_qualified_type (tree type
, int type_quals
)
5561 /* See if we already have the appropriate qualified variant. */
5562 t
= get_qualified_type (type
, type_quals
);
5564 /* If not, build it. */
5567 t
= build_variant_type_copy (type
);
5568 set_type_quals (t
, type_quals
);
5570 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5571 /* Propagate structural equality. */
5572 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5573 else if (TYPE_CANONICAL (type
) != type
)
5574 /* Build the underlying canonical type, since it is different
5576 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5579 /* T is its own canonical type. */
5580 TYPE_CANONICAL (t
) = t
;
5587 /* Create a new distinct copy of TYPE. The new type is made its own
5588 MAIN_VARIANT. If TYPE requires structural equality checks, the
5589 resulting type requires structural equality checks; otherwise, its
5590 TYPE_CANONICAL points to itself. */
5593 build_distinct_type_copy (tree type
)
5595 tree t
= copy_node (type
);
5597 TYPE_POINTER_TO (t
) = 0;
5598 TYPE_REFERENCE_TO (t
) = 0;
5600 /* Set the canonical type either to a new equivalence class, or
5601 propagate the need for structural equality checks. */
5602 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5603 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5605 TYPE_CANONICAL (t
) = t
;
5607 /* Make it its own variant. */
5608 TYPE_MAIN_VARIANT (t
) = t
;
5609 TYPE_NEXT_VARIANT (t
) = 0;
5611 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5612 whose TREE_TYPE is not t. This can also happen in the Ada
5613 frontend when using subtypes. */
5618 /* Create a new variant of TYPE, equivalent but distinct. This is so
5619 the caller can modify it. TYPE_CANONICAL for the return type will
5620 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5621 are considered equal by the language itself (or that both types
5622 require structural equality checks). */
5625 build_variant_type_copy (tree type
)
5627 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5629 t
= build_distinct_type_copy (type
);
5631 /* Since we're building a variant, assume that it is a non-semantic
5632 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5633 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5635 /* Add the new type to the chain of variants of TYPE. */
5636 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5637 TYPE_NEXT_VARIANT (m
) = t
;
5638 TYPE_MAIN_VARIANT (t
) = m
;
5643 /* Return true if the from tree in both tree maps are equal. */
5646 tree_map_base_eq (const void *va
, const void *vb
)
5648 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5649 *const b
= (const struct tree_map_base
*) vb
;
5650 return (a
->from
== b
->from
);
5653 /* Hash a from tree in a tree_base_map. */
5656 tree_map_base_hash (const void *item
)
5658 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5661 /* Return true if this tree map structure is marked for garbage collection
5662 purposes. We simply return true if the from tree is marked, so that this
5663 structure goes away when the from tree goes away. */
5666 tree_map_base_marked_p (const void *p
)
5668 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5671 /* Hash a from tree in a tree_map. */
5674 tree_map_hash (const void *item
)
5676 return (((const struct tree_map
*) item
)->hash
);
5679 /* Hash a from tree in a tree_decl_map. */
5682 tree_decl_map_hash (const void *item
)
5684 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5687 /* Return the initialization priority for DECL. */
5690 decl_init_priority_lookup (tree decl
)
5692 struct tree_priority_map
*h
;
5693 struct tree_map_base in
;
5695 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5697 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5698 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5701 /* Return the finalization priority for DECL. */
5704 decl_fini_priority_lookup (tree decl
)
5706 struct tree_priority_map
*h
;
5707 struct tree_map_base in
;
5709 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5711 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5712 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5715 /* Return the initialization and finalization priority information for
5716 DECL. If there is no previous priority information, a freshly
5717 allocated structure is returned. */
5719 static struct tree_priority_map
*
5720 decl_priority_info (tree decl
)
5722 struct tree_priority_map in
;
5723 struct tree_priority_map
*h
;
5726 in
.base
.from
= decl
;
5727 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5728 h
= (struct tree_priority_map
*) *loc
;
5731 h
= ggc_alloc_cleared_tree_priority_map ();
5733 h
->base
.from
= decl
;
5734 h
->init
= DEFAULT_INIT_PRIORITY
;
5735 h
->fini
= DEFAULT_INIT_PRIORITY
;
5741 /* Set the initialization priority for DECL to PRIORITY. */
5744 decl_init_priority_insert (tree decl
, priority_type priority
)
5746 struct tree_priority_map
*h
;
5748 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5749 h
= decl_priority_info (decl
);
5753 /* Set the finalization priority for DECL to PRIORITY. */
5756 decl_fini_priority_insert (tree decl
, priority_type priority
)
5758 struct tree_priority_map
*h
;
5760 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5761 h
= decl_priority_info (decl
);
5765 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5768 print_debug_expr_statistics (void)
5770 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5771 (long) htab_size (debug_expr_for_decl
),
5772 (long) htab_elements (debug_expr_for_decl
),
5773 htab_collisions (debug_expr_for_decl
));
5776 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5779 print_value_expr_statistics (void)
5781 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5782 (long) htab_size (value_expr_for_decl
),
5783 (long) htab_elements (value_expr_for_decl
),
5784 htab_collisions (value_expr_for_decl
));
5787 /* Lookup a debug expression for FROM, and return it if we find one. */
5790 decl_debug_expr_lookup (tree from
)
5792 struct tree_decl_map
*h
, in
;
5793 in
.base
.from
= from
;
5795 h
= (struct tree_decl_map
*)
5796 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
5802 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5805 decl_debug_expr_insert (tree from
, tree to
)
5807 struct tree_decl_map
*h
;
5810 h
= ggc_alloc_tree_decl_map ();
5811 h
->base
.from
= from
;
5813 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
5815 *(struct tree_decl_map
**) loc
= h
;
5818 /* Lookup a value expression for FROM, and return it if we find one. */
5821 decl_value_expr_lookup (tree from
)
5823 struct tree_decl_map
*h
, in
;
5824 in
.base
.from
= from
;
5826 h
= (struct tree_decl_map
*)
5827 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
5833 /* Insert a mapping FROM->TO in the value expression hashtable. */
5836 decl_value_expr_insert (tree from
, tree to
)
5838 struct tree_decl_map
*h
;
5841 h
= ggc_alloc_tree_decl_map ();
5842 h
->base
.from
= from
;
5844 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
5846 *(struct tree_decl_map
**) loc
= h
;
5849 /* Hashing of types so that we don't make duplicates.
5850 The entry point is `type_hash_canon'. */
5852 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
5853 with types in the TREE_VALUE slots), by adding the hash codes
5854 of the individual types. */
5857 type_hash_list (const_tree list
, hashval_t hashcode
)
5861 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
5862 if (TREE_VALUE (tail
) != error_mark_node
)
5863 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
5869 /* These are the Hashtable callback functions. */
5871 /* Returns true iff the types are equivalent. */
5874 type_hash_eq (const void *va
, const void *vb
)
5876 const struct type_hash
*const a
= (const struct type_hash
*) va
,
5877 *const b
= (const struct type_hash
*) vb
;
5879 /* First test the things that are the same for all types. */
5880 if (a
->hash
!= b
->hash
5881 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
5882 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
5883 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
5884 TYPE_ATTRIBUTES (b
->type
))
5885 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
5886 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)
5887 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
5888 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
5891 switch (TREE_CODE (a
->type
))
5896 case REFERENCE_TYPE
:
5900 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
5903 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
5904 && !(TYPE_VALUES (a
->type
)
5905 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
5906 && TYPE_VALUES (b
->type
)
5907 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
5908 && type_list_equal (TYPE_VALUES (a
->type
),
5909 TYPE_VALUES (b
->type
))))
5912 /* ... fall through ... */
5917 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
5918 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
5919 TYPE_MAX_VALUE (b
->type
)))
5920 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
5921 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
5922 TYPE_MIN_VALUE (b
->type
))));
5924 case FIXED_POINT_TYPE
:
5925 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
5928 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
5931 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
5932 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5933 || (TYPE_ARG_TYPES (a
->type
)
5934 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5935 && TYPE_ARG_TYPES (b
->type
)
5936 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5937 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5938 TYPE_ARG_TYPES (b
->type
)))));
5941 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
5945 case QUAL_UNION_TYPE
:
5946 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
5947 || (TYPE_FIELDS (a
->type
)
5948 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
5949 && TYPE_FIELDS (b
->type
)
5950 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
5951 && type_list_equal (TYPE_FIELDS (a
->type
),
5952 TYPE_FIELDS (b
->type
))));
5955 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
5956 || (TYPE_ARG_TYPES (a
->type
)
5957 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
5958 && TYPE_ARG_TYPES (b
->type
)
5959 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
5960 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
5961 TYPE_ARG_TYPES (b
->type
))))
5969 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
5970 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
5975 /* Return the cached hash value. */
5978 type_hash_hash (const void *item
)
5980 return ((const struct type_hash
*) item
)->hash
;
5983 /* Look in the type hash table for a type isomorphic to TYPE.
5984 If one is found, return it. Otherwise return 0. */
5987 type_hash_lookup (hashval_t hashcode
, tree type
)
5989 struct type_hash
*h
, in
;
5991 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
5992 must call that routine before comparing TYPE_ALIGNs. */
5998 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6005 /* Add an entry to the type-hash-table
6006 for a type TYPE whose hash code is HASHCODE. */
6009 type_hash_add (hashval_t hashcode
, tree type
)
6011 struct type_hash
*h
;
6014 h
= ggc_alloc_type_hash ();
6017 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6021 /* Given TYPE, and HASHCODE its hash code, return the canonical
6022 object for an identical type if one already exists.
6023 Otherwise, return TYPE, and record it as the canonical object.
6025 To use this function, first create a type of the sort you want.
6026 Then compute its hash code from the fields of the type that
6027 make it different from other similar types.
6028 Then call this function and use the value. */
6031 type_hash_canon (unsigned int hashcode
, tree type
)
6035 /* The hash table only contains main variants, so ensure that's what we're
6037 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6039 if (!lang_hooks
.types
.hash_types
)
6042 /* See if the type is in the hash table already. If so, return it.
6043 Otherwise, add the type. */
6044 t1
= type_hash_lookup (hashcode
, type
);
6047 #ifdef GATHER_STATISTICS
6048 tree_node_counts
[(int) t_kind
]--;
6049 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
6055 type_hash_add (hashcode
, type
);
6060 /* See if the data pointed to by the type hash table is marked. We consider
6061 it marked if the type is marked or if a debug type number or symbol
6062 table entry has been made for the type. This reduces the amount of
6063 debugging output and eliminates that dependency of the debug output on
6064 the number of garbage collections. */
6067 type_hash_marked_p (const void *p
)
6069 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6071 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
6075 print_type_hash_statistics (void)
6077 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6078 (long) htab_size (type_hash_table
),
6079 (long) htab_elements (type_hash_table
),
6080 htab_collisions (type_hash_table
));
6083 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6084 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6085 by adding the hash codes of the individual attributes. */
6088 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6092 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6093 /* ??? Do we want to add in TREE_VALUE too? */
6094 hashcode
= iterative_hash_object
6095 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6099 /* Given two lists of attributes, return true if list l2 is
6100 equivalent to l1. */
6103 attribute_list_equal (const_tree l1
, const_tree l2
)
6105 return attribute_list_contained (l1
, l2
)
6106 && attribute_list_contained (l2
, l1
);
6109 /* Given two lists of attributes, return true if list L2 is
6110 completely contained within L1. */
6111 /* ??? This would be faster if attribute names were stored in a canonicalized
6112 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6113 must be used to show these elements are equivalent (which they are). */
6114 /* ??? It's not clear that attributes with arguments will always be handled
6118 attribute_list_contained (const_tree l1
, const_tree l2
)
6122 /* First check the obvious, maybe the lists are identical. */
6126 /* Maybe the lists are similar. */
6127 for (t1
= l1
, t2
= l2
;
6129 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6130 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6131 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6133 /* Maybe the lists are equal. */
6134 if (t1
== 0 && t2
== 0)
6137 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6140 /* This CONST_CAST is okay because lookup_attribute does not
6141 modify its argument and the return value is assigned to a
6143 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6144 CONST_CAST_TREE(l1
));
6146 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6149 if (TREE_VALUE (t2
) != NULL
6150 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
6151 && TREE_VALUE (attr
) != NULL
6152 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
6154 if (simple_cst_list_equal (TREE_VALUE (t2
),
6155 TREE_VALUE (attr
)) == 1)
6158 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
6169 /* Given two lists of types
6170 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6171 return 1 if the lists contain the same types in the same order.
6172 Also, the TREE_PURPOSEs must match. */
6175 type_list_equal (const_tree l1
, const_tree l2
)
6179 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6180 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6181 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6182 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6183 && (TREE_TYPE (TREE_PURPOSE (t1
))
6184 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6190 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6191 given by TYPE. If the argument list accepts variable arguments,
6192 then this function counts only the ordinary arguments. */
6195 type_num_arguments (const_tree type
)
6200 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6201 /* If the function does not take a variable number of arguments,
6202 the last element in the list will have type `void'. */
6203 if (VOID_TYPE_P (TREE_VALUE (t
)))
6211 /* Nonzero if integer constants T1 and T2
6212 represent the same constant value. */
6215 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6220 if (t1
== 0 || t2
== 0)
6223 if (TREE_CODE (t1
) == INTEGER_CST
6224 && TREE_CODE (t2
) == INTEGER_CST
6225 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6226 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6232 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6233 The precise way of comparison depends on their data type. */
6236 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6241 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6243 int t1_sgn
= tree_int_cst_sgn (t1
);
6244 int t2_sgn
= tree_int_cst_sgn (t2
);
6246 if (t1_sgn
< t2_sgn
)
6248 else if (t1_sgn
> t2_sgn
)
6250 /* Otherwise, both are non-negative, so we compare them as
6251 unsigned just in case one of them would overflow a signed
6254 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6255 return INT_CST_LT (t1
, t2
);
6257 return INT_CST_LT_UNSIGNED (t1
, t2
);
6260 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6263 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6265 if (tree_int_cst_lt (t1
, t2
))
6267 else if (tree_int_cst_lt (t2
, t1
))
6273 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6274 the host. If POS is zero, the value can be represented in a single
6275 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6276 be represented in a single unsigned HOST_WIDE_INT. */
6279 host_integerp (const_tree t
, int pos
)
6284 return (TREE_CODE (t
) == INTEGER_CST
6285 && ((TREE_INT_CST_HIGH (t
) == 0
6286 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6287 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6288 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6289 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6290 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6291 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6292 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6295 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6296 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6297 be non-negative. We must be able to satisfy the above conditions. */
6300 tree_low_cst (const_tree t
, int pos
)
6302 gcc_assert (host_integerp (t
, pos
));
6303 return TREE_INT_CST_LOW (t
);
6306 /* Return the most significant bit of the integer constant T. */
6309 tree_int_cst_msb (const_tree t
)
6313 unsigned HOST_WIDE_INT l
;
6315 /* Note that using TYPE_PRECISION here is wrong. We care about the
6316 actual bits, not the (arbitrary) range of the type. */
6317 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6318 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6319 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6320 return (l
& 1) == 1;
6323 /* Return an indication of the sign of the integer constant T.
6324 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6325 Note that -1 will never be returned if T's type is unsigned. */
6328 tree_int_cst_sgn (const_tree t
)
6330 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6332 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6334 else if (TREE_INT_CST_HIGH (t
) < 0)
6340 /* Return the minimum number of bits needed to represent VALUE in a
6341 signed or unsigned type, UNSIGNEDP says which. */
6344 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6348 /* If the value is negative, compute its negative minus 1. The latter
6349 adjustment is because the absolute value of the largest negative value
6350 is one larger than the largest positive value. This is equivalent to
6351 a bit-wise negation, so use that operation instead. */
6353 if (tree_int_cst_sgn (value
) < 0)
6354 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6356 /* Return the number of bits needed, taking into account the fact
6357 that we need one more bit for a signed than unsigned type. */
6359 if (integer_zerop (value
))
6362 log
= tree_floor_log2 (value
);
6364 return log
+ 1 + !unsignedp
;
6367 /* Compare two constructor-element-type constants. Return 1 if the lists
6368 are known to be equal; otherwise return 0. */
6371 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6373 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6375 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6378 l1
= TREE_CHAIN (l1
);
6379 l2
= TREE_CHAIN (l2
);
6385 /* Return truthvalue of whether T1 is the same tree structure as T2.
6386 Return 1 if they are the same.
6387 Return 0 if they are understandably different.
6388 Return -1 if either contains tree structure not understood by
6392 simple_cst_equal (const_tree t1
, const_tree t2
)
6394 enum tree_code code1
, code2
;
6400 if (t1
== 0 || t2
== 0)
6403 code1
= TREE_CODE (t1
);
6404 code2
= TREE_CODE (t2
);
6406 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6408 if (CONVERT_EXPR_CODE_P (code2
)
6409 || code2
== NON_LVALUE_EXPR
)
6410 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6412 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6415 else if (CONVERT_EXPR_CODE_P (code2
)
6416 || code2
== NON_LVALUE_EXPR
)
6417 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6425 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6426 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6429 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6432 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6435 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6436 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6437 TREE_STRING_LENGTH (t1
)));
6441 unsigned HOST_WIDE_INT idx
;
6442 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6443 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6445 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6448 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6449 /* ??? Should we handle also fields here? */
6450 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6451 VEC_index (constructor_elt
, v2
, idx
)->value
))
6457 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6460 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6463 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6466 const_tree arg1
, arg2
;
6467 const_call_expr_arg_iterator iter1
, iter2
;
6468 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6469 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6471 arg1
= next_const_call_expr_arg (&iter1
),
6472 arg2
= next_const_call_expr_arg (&iter2
))
6474 cmp
= simple_cst_equal (arg1
, arg2
);
6478 return arg1
== arg2
;
6482 /* Special case: if either target is an unallocated VAR_DECL,
6483 it means that it's going to be unified with whatever the
6484 TARGET_EXPR is really supposed to initialize, so treat it
6485 as being equivalent to anything. */
6486 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6487 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6488 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6489 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6490 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6491 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6494 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6499 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6501 case WITH_CLEANUP_EXPR
:
6502 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6506 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6509 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6510 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6524 /* This general rule works for most tree codes. All exceptions should be
6525 handled above. If this is a language-specific tree code, we can't
6526 trust what might be in the operand, so say we don't know
6528 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6531 switch (TREE_CODE_CLASS (code1
))
6535 case tcc_comparison
:
6536 case tcc_expression
:
6540 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6542 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6554 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6555 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6556 than U, respectively. */
6559 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6561 if (tree_int_cst_sgn (t
) < 0)
6563 else if (TREE_INT_CST_HIGH (t
) != 0)
6565 else if (TREE_INT_CST_LOW (t
) == u
)
6567 else if (TREE_INT_CST_LOW (t
) < u
)
6573 /* Return true if CODE represents an associative tree code. Otherwise
6576 associative_tree_code (enum tree_code code
)
6595 /* Return true if CODE represents a commutative tree code. Otherwise
6598 commutative_tree_code (enum tree_code code
)
6611 case UNORDERED_EXPR
:
6615 case TRUTH_AND_EXPR
:
6616 case TRUTH_XOR_EXPR
:
6626 /* Return true if CODE represents a ternary tree code for which the
6627 first two operands are commutative. Otherwise return false. */
6629 commutative_ternary_tree_code (enum tree_code code
)
6633 case WIDEN_MULT_PLUS_EXPR
:
6634 case WIDEN_MULT_MINUS_EXPR
:
6643 /* Generate a hash value for an expression. This can be used iteratively
6644 by passing a previous result as the VAL argument.
6646 This function is intended to produce the same hash for expressions which
6647 would compare equal using operand_equal_p. */
6650 iterative_hash_expr (const_tree t
, hashval_t val
)
6653 enum tree_code code
;
6657 return iterative_hash_hashval_t (0, val
);
6659 code
= TREE_CODE (t
);
6663 /* Alas, constants aren't shared, so we can't rely on pointer
6666 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6667 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6670 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6672 return iterative_hash_hashval_t (val2
, val
);
6676 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6678 return iterative_hash_hashval_t (val2
, val
);
6681 return iterative_hash (TREE_STRING_POINTER (t
),
6682 TREE_STRING_LENGTH (t
), val
);
6684 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6685 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6687 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6689 /* We can just compare by pointer. */
6690 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6691 case PLACEHOLDER_EXPR
:
6692 /* The node itself doesn't matter. */
6695 /* A list of expressions, for a CALL_EXPR or as the elements of a
6697 for (; t
; t
= TREE_CHAIN (t
))
6698 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6702 unsigned HOST_WIDE_INT idx
;
6704 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6706 val
= iterative_hash_expr (field
, val
);
6707 val
= iterative_hash_expr (value
, val
);
6712 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6713 Otherwise nodes that compare equal according to operand_equal_p might
6714 get different hash codes. However, don't do this for machine specific
6715 or front end builtins, since the function code is overloaded in those
6717 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6718 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6720 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6721 code
= TREE_CODE (t
);
6725 tclass
= TREE_CODE_CLASS (code
);
6727 if (tclass
== tcc_declaration
)
6729 /* DECL's have a unique ID */
6730 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6734 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6736 val
= iterative_hash_object (code
, val
);
6738 /* Don't hash the type, that can lead to having nodes which
6739 compare equal according to operand_equal_p, but which
6740 have different hash codes. */
6741 if (CONVERT_EXPR_CODE_P (code
)
6742 || code
== NON_LVALUE_EXPR
)
6744 /* Make sure to include signness in the hash computation. */
6745 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6746 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6749 else if (commutative_tree_code (code
))
6751 /* It's a commutative expression. We want to hash it the same
6752 however it appears. We do this by first hashing both operands
6753 and then rehashing based on the order of their independent
6755 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6756 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6760 t
= one
, one
= two
, two
= t
;
6762 val
= iterative_hash_hashval_t (one
, val
);
6763 val
= iterative_hash_hashval_t (two
, val
);
6766 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6767 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6774 /* Generate a hash value for a pair of expressions. This can be used
6775 iteratively by passing a previous result as the VAL argument.
6777 The same hash value is always returned for a given pair of expressions,
6778 regardless of the order in which they are presented. This is useful in
6779 hashing the operands of commutative functions. */
6782 iterative_hash_exprs_commutative (const_tree t1
,
6783 const_tree t2
, hashval_t val
)
6785 hashval_t one
= iterative_hash_expr (t1
, 0);
6786 hashval_t two
= iterative_hash_expr (t2
, 0);
6790 t
= one
, one
= two
, two
= t
;
6791 val
= iterative_hash_hashval_t (one
, val
);
6792 val
= iterative_hash_hashval_t (two
, val
);
6797 /* Constructors for pointer, array and function types.
6798 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6799 constructed by language-dependent code, not here.) */
6801 /* Construct, lay out and return the type of pointers to TO_TYPE with
6802 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6803 reference all of memory. If such a type has already been
6804 constructed, reuse it. */
6807 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6812 if (to_type
== error_mark_node
)
6813 return error_mark_node
;
6815 /* If the pointed-to type has the may_alias attribute set, force
6816 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6817 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6818 can_alias_all
= true;
6820 /* In some cases, languages will have things that aren't a POINTER_TYPE
6821 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
6822 In that case, return that type without regard to the rest of our
6825 ??? This is a kludge, but consistent with the way this function has
6826 always operated and there doesn't seem to be a good way to avoid this
6828 if (TYPE_POINTER_TO (to_type
) != 0
6829 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
6830 return TYPE_POINTER_TO (to_type
);
6832 /* First, if we already have a type for pointers to TO_TYPE and it's
6833 the proper mode, use it. */
6834 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
6835 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6838 t
= make_node (POINTER_TYPE
);
6840 TREE_TYPE (t
) = to_type
;
6841 SET_TYPE_MODE (t
, mode
);
6842 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6843 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
6844 TYPE_POINTER_TO (to_type
) = t
;
6846 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6847 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6848 else if (TYPE_CANONICAL (to_type
) != to_type
)
6850 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
6851 mode
, can_alias_all
);
6853 /* Lay out the type. This function has many callers that are concerned
6854 with expression-construction, and this simplifies them all. */
6860 /* By default build pointers in ptr_mode. */
6863 build_pointer_type (tree to_type
)
6865 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
6866 : TYPE_ADDR_SPACE (to_type
);
6867 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
6868 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
6871 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
6874 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
6879 if (to_type
== error_mark_node
)
6880 return error_mark_node
;
6882 /* If the pointed-to type has the may_alias attribute set, force
6883 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6884 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
6885 can_alias_all
= true;
6887 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
6888 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
6889 In that case, return that type without regard to the rest of our
6892 ??? This is a kludge, but consistent with the way this function has
6893 always operated and there doesn't seem to be a good way to avoid this
6895 if (TYPE_REFERENCE_TO (to_type
) != 0
6896 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
6897 return TYPE_REFERENCE_TO (to_type
);
6899 /* First, if we already have a type for pointers to TO_TYPE and it's
6900 the proper mode, use it. */
6901 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
6902 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
6905 t
= make_node (REFERENCE_TYPE
);
6907 TREE_TYPE (t
) = to_type
;
6908 SET_TYPE_MODE (t
, mode
);
6909 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
6910 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
6911 TYPE_REFERENCE_TO (to_type
) = t
;
6913 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
6914 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6915 else if (TYPE_CANONICAL (to_type
) != to_type
)
6917 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
6918 mode
, can_alias_all
);
6926 /* Build the node for the type of references-to-TO_TYPE by default
6930 build_reference_type (tree to_type
)
6932 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
6933 : TYPE_ADDR_SPACE (to_type
);
6934 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
6935 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
6938 /* Build a type that is compatible with t but has no cv quals anywhere
6941 const char *const *const * -> char ***. */
6944 build_type_no_quals (tree t
)
6946 switch (TREE_CODE (t
))
6949 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6951 TYPE_REF_CAN_ALIAS_ALL (t
));
6952 case REFERENCE_TYPE
:
6954 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
6956 TYPE_REF_CAN_ALIAS_ALL (t
));
6958 return TYPE_MAIN_VARIANT (t
);
6962 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
6963 MAXVAL should be the maximum value in the domain
6964 (one less than the length of the array).
6966 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
6967 We don't enforce this limit, that is up to caller (e.g. language front end).
6968 The limit exists because the result is a signed type and we don't handle
6969 sizes that use more than one HOST_WIDE_INT. */
6972 build_index_type (tree maxval
)
6974 tree itype
= make_node (INTEGER_TYPE
);
6976 TREE_TYPE (itype
) = sizetype
;
6977 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
6978 TYPE_MIN_VALUE (itype
) = size_zero_node
;
6979 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
6980 SET_TYPE_MODE (itype
, TYPE_MODE (sizetype
));
6981 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
6982 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
6983 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
6984 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
6986 if (host_integerp (maxval
, 1))
6987 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
6990 /* Since we cannot hash this type, we need to compare it using
6991 structural equality checks. */
6992 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
6997 #define MAX_INT_CACHED_PREC \
6998 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
6999 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7001 /* Builds a signed or unsigned integer type of precision PRECISION.
7002 Used for C bitfields whose precision does not match that of
7003 built-in target types. */
7005 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7011 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7013 if (precision
<= MAX_INT_CACHED_PREC
)
7015 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7020 itype
= make_node (INTEGER_TYPE
);
7021 TYPE_PRECISION (itype
) = precision
;
7024 fixup_unsigned_type (itype
);
7026 fixup_signed_type (itype
);
7029 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7030 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7031 if (precision
<= MAX_INT_CACHED_PREC
&& lang_hooks
.types
.hash_types
)
7032 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7037 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
7038 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
7039 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
7042 build_range_type (tree type
, tree lowval
, tree highval
)
7044 tree itype
= make_node (INTEGER_TYPE
);
7046 TREE_TYPE (itype
) = type
;
7047 if (type
== NULL_TREE
)
7050 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7051 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7053 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7054 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7055 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7056 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7057 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7058 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7060 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
7061 return type_hash_canon (tree_low_cst (highval
, 0)
7062 - tree_low_cst (lowval
, 0),
7068 /* Return true if the debug information for TYPE, a subtype, should be emitted
7069 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7070 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7071 debug info and doesn't reflect the source code. */
7074 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7076 tree base_type
= TREE_TYPE (type
), low
, high
;
7078 /* Subrange types have a base type which is an integral type. */
7079 if (!INTEGRAL_TYPE_P (base_type
))
7082 /* Get the real bounds of the subtype. */
7083 if (lang_hooks
.types
.get_subrange_bounds
)
7084 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7087 low
= TYPE_MIN_VALUE (type
);
7088 high
= TYPE_MAX_VALUE (type
);
7091 /* If the type and its base type have the same representation and the same
7092 name, then the type is not a subrange but a copy of the base type. */
7093 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7094 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7095 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7096 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7097 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7099 tree type_name
= TYPE_NAME (type
);
7100 tree base_type_name
= TYPE_NAME (base_type
);
7102 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7103 type_name
= DECL_NAME (type_name
);
7105 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7106 base_type_name
= DECL_NAME (base_type_name
);
7108 if (type_name
== base_type_name
)
7119 /* Just like build_index_type, but takes lowval and highval instead
7120 of just highval (maxval). */
7123 build_index_2_type (tree lowval
, tree highval
)
7125 return build_range_type (sizetype
, lowval
, highval
);
7128 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7129 and number of elements specified by the range of values of INDEX_TYPE.
7130 If such a type has already been constructed, reuse it. */
7133 build_array_type (tree elt_type
, tree index_type
)
7136 hashval_t hashcode
= 0;
7138 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7140 error ("arrays of functions are not meaningful");
7141 elt_type
= integer_type_node
;
7144 t
= make_node (ARRAY_TYPE
);
7145 TREE_TYPE (t
) = elt_type
;
7146 TYPE_DOMAIN (t
) = index_type
;
7147 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7150 /* If the element type is incomplete at this point we get marked for
7151 structural equality. Do not record these types in the canonical
7153 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7156 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
7158 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7159 t
= type_hash_canon (hashcode
, t
);
7161 if (TYPE_CANONICAL (t
) == t
)
7163 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7164 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7165 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7166 else if (TYPE_CANONICAL (elt_type
) != elt_type
7167 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7169 = build_array_type (TYPE_CANONICAL (elt_type
),
7170 index_type
? TYPE_CANONICAL (index_type
) : NULL
);
7176 /* Recursively examines the array elements of TYPE, until a non-array
7177 element type is found. */
7180 strip_array_types (tree type
)
7182 while (TREE_CODE (type
) == ARRAY_TYPE
)
7183 type
= TREE_TYPE (type
);
7188 /* Computes the canonical argument types from the argument type list
7191 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7192 on entry to this function, or if any of the ARGTYPES are
7195 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7196 true on entry to this function, or if any of the ARGTYPES are
7199 Returns a canonical argument list, which may be ARGTYPES when the
7200 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7201 true) or would not differ from ARGTYPES. */
7204 maybe_canonicalize_argtypes(tree argtypes
,
7205 bool *any_structural_p
,
7206 bool *any_noncanonical_p
)
7209 bool any_noncanonical_argtypes_p
= false;
7211 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7213 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7214 /* Fail gracefully by stating that the type is structural. */
7215 *any_structural_p
= true;
7216 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7217 *any_structural_p
= true;
7218 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7219 || TREE_PURPOSE (arg
))
7220 /* If the argument has a default argument, we consider it
7221 non-canonical even though the type itself is canonical.
7222 That way, different variants of function and method types
7223 with default arguments will all point to the variant with
7224 no defaults as their canonical type. */
7225 any_noncanonical_argtypes_p
= true;
7228 if (*any_structural_p
)
7231 if (any_noncanonical_argtypes_p
)
7233 /* Build the canonical list of argument types. */
7234 tree canon_argtypes
= NULL_TREE
;
7235 bool is_void
= false;
7237 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7239 if (arg
== void_list_node
)
7242 canon_argtypes
= tree_cons (NULL_TREE
,
7243 TYPE_CANONICAL (TREE_VALUE (arg
)),
7247 canon_argtypes
= nreverse (canon_argtypes
);
7249 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7251 /* There is a non-canonical type. */
7252 *any_noncanonical_p
= true;
7253 return canon_argtypes
;
7256 /* The canonical argument types are the same as ARGTYPES. */
7260 /* Construct, lay out and return
7261 the type of functions returning type VALUE_TYPE
7262 given arguments of types ARG_TYPES.
7263 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7264 are data type nodes for the arguments of the function.
7265 If such a type has already been constructed, reuse it. */
7268 build_function_type (tree value_type
, tree arg_types
)
7271 hashval_t hashcode
= 0;
7272 bool any_structural_p
, any_noncanonical_p
;
7273 tree canon_argtypes
;
7275 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7277 error ("function return type cannot be function");
7278 value_type
= integer_type_node
;
7281 /* Make a node of the sort we want. */
7282 t
= make_node (FUNCTION_TYPE
);
7283 TREE_TYPE (t
) = value_type
;
7284 TYPE_ARG_TYPES (t
) = arg_types
;
7286 /* If we already have such a type, use the old one. */
7287 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7288 hashcode
= type_hash_list (arg_types
, hashcode
);
7289 t
= type_hash_canon (hashcode
, t
);
7291 /* Set up the canonical type. */
7292 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7293 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7294 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7296 &any_noncanonical_p
);
7297 if (any_structural_p
)
7298 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7299 else if (any_noncanonical_p
)
7300 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7303 if (!COMPLETE_TYPE_P (t
))
7308 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7311 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7313 tree new_type
= NULL
;
7314 tree args
, new_args
= NULL
, t
;
7318 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7319 args
= TREE_CHAIN (args
), i
++)
7320 if (!bitmap_bit_p (args_to_skip
, i
))
7321 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7323 new_reversed
= nreverse (new_args
);
7327 TREE_CHAIN (new_args
) = void_list_node
;
7329 new_reversed
= void_list_node
;
7332 /* Use copy_node to preserve as much as possible from original type
7333 (debug info, attribute lists etc.)
7334 Exception is METHOD_TYPEs must have THIS argument.
7335 When we are asked to remove it, we need to build new FUNCTION_TYPE
7337 if (TREE_CODE (orig_type
) != METHOD_TYPE
7338 || !bitmap_bit_p (args_to_skip
, 0))
7340 new_type
= copy_node (orig_type
);
7341 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7346 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7348 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7351 /* This is a new type, not a copy of an old type. Need to reassociate
7352 variants. We can handle everything except the main variant lazily. */
7353 t
= TYPE_MAIN_VARIANT (orig_type
);
7356 TYPE_MAIN_VARIANT (new_type
) = t
;
7357 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7358 TYPE_NEXT_VARIANT (t
) = new_type
;
7362 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7363 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7368 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7370 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7371 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7372 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7375 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7377 tree new_decl
= copy_node (orig_decl
);
7380 new_type
= TREE_TYPE (orig_decl
);
7381 if (prototype_p (new_type
))
7382 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7383 TREE_TYPE (new_decl
) = new_type
;
7385 /* For declarations setting DECL_VINDEX (i.e. methods)
7386 we expect first argument to be THIS pointer. */
7387 if (bitmap_bit_p (args_to_skip
, 0))
7388 DECL_VINDEX (new_decl
) = NULL_TREE
;
7390 /* When signature changes, we need to clear builtin info. */
7391 if (DECL_BUILT_IN (new_decl
) && !bitmap_empty_p (args_to_skip
))
7393 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7394 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7399 /* Build a function type. The RETURN_TYPE is the type returned by the
7400 function. If VAARGS is set, no void_type_node is appended to the
7401 the list. ARGP must be always be terminated be a NULL_TREE. */
7404 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7408 t
= va_arg (argp
, tree
);
7409 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7410 args
= tree_cons (NULL_TREE
, t
, args
);
7415 if (args
!= NULL_TREE
)
7416 args
= nreverse (args
);
7417 gcc_assert (last
!= void_list_node
);
7419 else if (args
== NULL_TREE
)
7420 args
= void_list_node
;
7424 args
= nreverse (args
);
7425 TREE_CHAIN (last
) = void_list_node
;
7427 args
= build_function_type (return_type
, args
);
7432 /* Build a function type. The RETURN_TYPE is the type returned by the
7433 function. If additional arguments are provided, they are
7434 additional argument types. The list of argument types must always
7435 be terminated by NULL_TREE. */
7438 build_function_type_list (tree return_type
, ...)
7443 va_start (p
, return_type
);
7444 args
= build_function_type_list_1 (false, return_type
, p
);
7449 /* Build a variable argument function type. The RETURN_TYPE is the
7450 type returned by the function. If additional arguments are provided,
7451 they are additional argument types. The list of argument types must
7452 always be terminated by NULL_TREE. */
7455 build_varargs_function_type_list (tree return_type
, ...)
7460 va_start (p
, return_type
);
7461 args
= build_function_type_list_1 (true, return_type
, p
);
7467 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7468 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7469 for the method. An implicit additional parameter (of type
7470 pointer-to-BASETYPE) is added to the ARGTYPES. */
7473 build_method_type_directly (tree basetype
,
7480 bool any_structural_p
, any_noncanonical_p
;
7481 tree canon_argtypes
;
7483 /* Make a node of the sort we want. */
7484 t
= make_node (METHOD_TYPE
);
7486 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7487 TREE_TYPE (t
) = rettype
;
7488 ptype
= build_pointer_type (basetype
);
7490 /* The actual arglist for this function includes a "hidden" argument
7491 which is "this". Put it into the list of argument types. */
7492 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7493 TYPE_ARG_TYPES (t
) = argtypes
;
7495 /* If we already have such a type, use the old one. */
7496 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7497 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7498 hashcode
= type_hash_list (argtypes
, hashcode
);
7499 t
= type_hash_canon (hashcode
, t
);
7501 /* Set up the canonical type. */
7503 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7504 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7506 = (TYPE_CANONICAL (basetype
) != basetype
7507 || TYPE_CANONICAL (rettype
) != rettype
);
7508 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7510 &any_noncanonical_p
);
7511 if (any_structural_p
)
7512 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7513 else if (any_noncanonical_p
)
7515 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7516 TYPE_CANONICAL (rettype
),
7518 if (!COMPLETE_TYPE_P (t
))
7524 /* Construct, lay out and return the type of methods belonging to class
7525 BASETYPE and whose arguments and values are described by TYPE.
7526 If that type exists already, reuse it.
7527 TYPE must be a FUNCTION_TYPE node. */
7530 build_method_type (tree basetype
, tree type
)
7532 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7534 return build_method_type_directly (basetype
,
7536 TYPE_ARG_TYPES (type
));
7539 /* Construct, lay out and return the type of offsets to a value
7540 of type TYPE, within an object of type BASETYPE.
7541 If a suitable offset type exists already, reuse it. */
7544 build_offset_type (tree basetype
, tree type
)
7547 hashval_t hashcode
= 0;
7549 /* Make a node of the sort we want. */
7550 t
= make_node (OFFSET_TYPE
);
7552 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7553 TREE_TYPE (t
) = type
;
7555 /* If we already have such a type, use the old one. */
7556 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7557 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7558 t
= type_hash_canon (hashcode
, t
);
7560 if (!COMPLETE_TYPE_P (t
))
7563 if (TYPE_CANONICAL (t
) == t
)
7565 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7566 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7567 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7568 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7569 || TYPE_CANONICAL (type
) != type
)
7571 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7572 TYPE_CANONICAL (type
));
7578 /* Create a complex type whose components are COMPONENT_TYPE. */
7581 build_complex_type (tree component_type
)
7586 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7587 || SCALAR_FLOAT_TYPE_P (component_type
)
7588 || FIXED_POINT_TYPE_P (component_type
));
7590 /* Make a node of the sort we want. */
7591 t
= make_node (COMPLEX_TYPE
);
7593 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7595 /* If we already have such a type, use the old one. */
7596 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7597 t
= type_hash_canon (hashcode
, t
);
7599 if (!COMPLETE_TYPE_P (t
))
7602 if (TYPE_CANONICAL (t
) == t
)
7604 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7605 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7606 else if (TYPE_CANONICAL (component_type
) != component_type
)
7608 = build_complex_type (TYPE_CANONICAL (component_type
));
7611 /* We need to create a name, since complex is a fundamental type. */
7612 if (! TYPE_NAME (t
))
7615 if (component_type
== char_type_node
)
7616 name
= "complex char";
7617 else if (component_type
== signed_char_type_node
)
7618 name
= "complex signed char";
7619 else if (component_type
== unsigned_char_type_node
)
7620 name
= "complex unsigned char";
7621 else if (component_type
== short_integer_type_node
)
7622 name
= "complex short int";
7623 else if (component_type
== short_unsigned_type_node
)
7624 name
= "complex short unsigned int";
7625 else if (component_type
== integer_type_node
)
7626 name
= "complex int";
7627 else if (component_type
== unsigned_type_node
)
7628 name
= "complex unsigned int";
7629 else if (component_type
== long_integer_type_node
)
7630 name
= "complex long int";
7631 else if (component_type
== long_unsigned_type_node
)
7632 name
= "complex long unsigned int";
7633 else if (component_type
== long_long_integer_type_node
)
7634 name
= "complex long long int";
7635 else if (component_type
== long_long_unsigned_type_node
)
7636 name
= "complex long long unsigned int";
7641 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7642 get_identifier (name
), t
);
7645 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7648 /* If TYPE is a real or complex floating-point type and the target
7649 does not directly support arithmetic on TYPE then return the wider
7650 type to be used for arithmetic on TYPE. Otherwise, return
7654 excess_precision_type (tree type
)
7656 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7658 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7659 switch (TREE_CODE (type
))
7662 switch (flt_eval_method
)
7665 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7666 return double_type_node
;
7669 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7670 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7671 return long_double_type_node
;
7678 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7680 switch (flt_eval_method
)
7683 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7684 return complex_double_type_node
;
7687 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7688 || (TYPE_MODE (TREE_TYPE (type
))
7689 == TYPE_MODE (double_type_node
)))
7690 return complex_long_double_type_node
;
7703 /* Return OP, stripped of any conversions to wider types as much as is safe.
7704 Converting the value back to OP's type makes a value equivalent to OP.
7706 If FOR_TYPE is nonzero, we return a value which, if converted to
7707 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7709 OP must have integer, real or enumeral type. Pointers are not allowed!
7711 There are some cases where the obvious value we could return
7712 would regenerate to OP if converted to OP's type,
7713 but would not extend like OP to wider types.
7714 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7715 For example, if OP is (unsigned short)(signed char)-1,
7716 we avoid returning (signed char)-1 if FOR_TYPE is int,
7717 even though extending that to an unsigned short would regenerate OP,
7718 since the result of extending (signed char)-1 to (int)
7719 is different from (int) OP. */
7722 get_unwidened (tree op
, tree for_type
)
7724 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7725 tree type
= TREE_TYPE (op
);
7727 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7729 = (for_type
!= 0 && for_type
!= type
7730 && final_prec
> TYPE_PRECISION (type
)
7731 && TYPE_UNSIGNED (type
));
7734 while (CONVERT_EXPR_P (op
))
7738 /* TYPE_PRECISION on vector types has different meaning
7739 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7740 so avoid them here. */
7741 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7744 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7745 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7747 /* Truncations are many-one so cannot be removed.
7748 Unless we are later going to truncate down even farther. */
7750 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7753 /* See what's inside this conversion. If we decide to strip it,
7755 op
= TREE_OPERAND (op
, 0);
7757 /* If we have not stripped any zero-extensions (uns is 0),
7758 we can strip any kind of extension.
7759 If we have previously stripped a zero-extension,
7760 only zero-extensions can safely be stripped.
7761 Any extension can be stripped if the bits it would produce
7762 are all going to be discarded later by truncating to FOR_TYPE. */
7766 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7768 /* TYPE_UNSIGNED says whether this is a zero-extension.
7769 Let's avoid computing it if it does not affect WIN
7770 and if UNS will not be needed again. */
7772 || CONVERT_EXPR_P (op
))
7773 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7781 /* If we finally reach a constant see if it fits in for_type and
7782 in that case convert it. */
7784 && TREE_CODE (win
) == INTEGER_CST
7785 && TREE_TYPE (win
) != for_type
7786 && int_fits_type_p (win
, for_type
))
7787 win
= fold_convert (for_type
, win
);
7792 /* Return OP or a simpler expression for a narrower value
7793 which can be sign-extended or zero-extended to give back OP.
7794 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7795 or 0 if the value should be sign-extended. */
7798 get_narrower (tree op
, int *unsignedp_ptr
)
7803 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
7805 while (TREE_CODE (op
) == NOP_EXPR
)
7808 = (TYPE_PRECISION (TREE_TYPE (op
))
7809 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
7811 /* Truncations are many-one so cannot be removed. */
7815 /* See what's inside this conversion. If we decide to strip it,
7820 op
= TREE_OPERAND (op
, 0);
7821 /* An extension: the outermost one can be stripped,
7822 but remember whether it is zero or sign extension. */
7824 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7825 /* Otherwise, if a sign extension has been stripped,
7826 only sign extensions can now be stripped;
7827 if a zero extension has been stripped, only zero-extensions. */
7828 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
7832 else /* bitschange == 0 */
7834 /* A change in nominal type can always be stripped, but we must
7835 preserve the unsignedness. */
7837 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
7839 op
= TREE_OPERAND (op
, 0);
7840 /* Keep trying to narrow, but don't assign op to win if it
7841 would turn an integral type into something else. */
7842 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
7849 if (TREE_CODE (op
) == COMPONENT_REF
7850 /* Since type_for_size always gives an integer type. */
7851 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
7852 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
7853 /* Ensure field is laid out already. */
7854 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
7855 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
7857 unsigned HOST_WIDE_INT innerprec
7858 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
7859 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
7860 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
7861 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
7863 /* We can get this structure field in a narrower type that fits it,
7864 but the resulting extension to its nominal type (a fullword type)
7865 must satisfy the same conditions as for other extensions.
7867 Do this only for fields that are aligned (not bit-fields),
7868 because when bit-field insns will be used there is no
7869 advantage in doing this. */
7871 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
7872 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
7873 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
7877 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
7878 win
= fold_convert (type
, op
);
7882 *unsignedp_ptr
= uns
;
7886 /* Nonzero if integer constant C has a value that is permissible
7887 for type TYPE (an INTEGER_TYPE). */
7890 int_fits_type_p (const_tree c
, const_tree type
)
7892 tree type_low_bound
, type_high_bound
;
7893 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
7896 dc
= tree_to_double_int (c
);
7897 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
7899 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
7900 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
7902 /* So c is an unsigned integer whose type is sizetype and type is not.
7903 sizetype'd integers are sign extended even though they are
7904 unsigned. If the integer value fits in the lower end word of c,
7905 and if the higher end word has all its bits set to 1, that
7906 means the higher end bits are set to 1 only for sign extension.
7907 So let's convert c into an equivalent zero extended unsigned
7909 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
7912 type_low_bound
= TYPE_MIN_VALUE (type
);
7913 type_high_bound
= TYPE_MAX_VALUE (type
);
7915 /* If at least one bound of the type is a constant integer, we can check
7916 ourselves and maybe make a decision. If no such decision is possible, but
7917 this type is a subtype, try checking against that. Otherwise, use
7918 fit_double_type, which checks against the precision.
7920 Compute the status for each possibly constant bound, and return if we see
7921 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
7922 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
7923 for "constant known to fit". */
7925 /* Check if c >= type_low_bound. */
7926 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
7928 dd
= tree_to_double_int (type_low_bound
);
7929 if (TREE_CODE (type
) == INTEGER_TYPE
7930 && TYPE_IS_SIZETYPE (type
)
7931 && TYPE_UNSIGNED (type
))
7932 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7933 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
7935 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7936 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7938 if (c_neg
&& !t_neg
)
7940 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
7943 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
7945 ok_for_low_bound
= true;
7948 ok_for_low_bound
= false;
7950 /* Check if c <= type_high_bound. */
7951 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
7953 dd
= tree_to_double_int (type_high_bound
);
7954 if (TREE_CODE (type
) == INTEGER_TYPE
7955 && TYPE_IS_SIZETYPE (type
)
7956 && TYPE_UNSIGNED (type
))
7957 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
7958 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
7960 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
7961 int t_neg
= (unsc
&& double_int_negative_p (dd
));
7963 if (t_neg
&& !c_neg
)
7965 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
7968 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
7970 ok_for_high_bound
= true;
7973 ok_for_high_bound
= false;
7975 /* If the constant fits both bounds, the result is known. */
7976 if (ok_for_low_bound
&& ok_for_high_bound
)
7979 /* Perform some generic filtering which may allow making a decision
7980 even if the bounds are not constant. First, negative integers
7981 never fit in unsigned types, */
7982 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
7985 /* Second, narrower types always fit in wider ones. */
7986 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
7989 /* Third, unsigned integers with top bit set never fit signed types. */
7990 if (! TYPE_UNSIGNED (type
) && unsc
)
7992 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
7993 if (prec
< HOST_BITS_PER_WIDE_INT
)
7995 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
7998 else if (((((unsigned HOST_WIDE_INT
) 1)
7999 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8003 /* If we haven't been able to decide at this point, there nothing more we
8004 can check ourselves here. Look at the base type if we have one and it
8005 has the same precision. */
8006 if (TREE_CODE (type
) == INTEGER_TYPE
8007 && TREE_TYPE (type
) != 0
8008 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8010 type
= TREE_TYPE (type
);
8014 /* Or to fit_double_type, if nothing else. */
8015 return !fit_double_type (dc
.low
, dc
.high
, &dc
.low
, &dc
.high
, type
);
8018 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8019 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8020 represented (assuming two's-complement arithmetic) within the bit
8021 precision of the type are returned instead. */
8024 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8026 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8027 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8028 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8029 TYPE_UNSIGNED (type
));
8032 if (TYPE_UNSIGNED (type
))
8033 mpz_set_ui (min
, 0);
8037 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8038 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8039 TYPE_PRECISION (type
));
8040 mpz_set_double_int (min
, mn
, false);
8044 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8045 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8046 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8047 TYPE_UNSIGNED (type
));
8050 if (TYPE_UNSIGNED (type
))
8051 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8054 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8059 /* Return true if VAR is an automatic variable defined in function FN. */
8062 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8064 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8065 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8066 || TREE_CODE (var
) == PARM_DECL
)
8067 && ! TREE_STATIC (var
))
8068 || TREE_CODE (var
) == LABEL_DECL
8069 || TREE_CODE (var
) == RESULT_DECL
));
8072 /* Subprogram of following function. Called by walk_tree.
8074 Return *TP if it is an automatic variable or parameter of the
8075 function passed in as DATA. */
8078 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8080 tree fn
= (tree
) data
;
8085 else if (DECL_P (*tp
)
8086 && auto_var_in_fn_p (*tp
, fn
))
8092 /* Returns true if T is, contains, or refers to a type with variable
8093 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8094 arguments, but not the return type. If FN is nonzero, only return
8095 true if a modifier of the type or position of FN is a variable or
8096 parameter inside FN.
8098 This concept is more general than that of C99 'variably modified types':
8099 in C99, a struct type is never variably modified because a VLA may not
8100 appear as a structure member. However, in GNU C code like:
8102 struct S { int i[f()]; };
8104 is valid, and other languages may define similar constructs. */
8107 variably_modified_type_p (tree type
, tree fn
)
8111 /* Test if T is either variable (if FN is zero) or an expression containing
8112 a variable in FN. */
8113 #define RETURN_TRUE_IF_VAR(T) \
8114 do { tree _t = (T); \
8115 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8116 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8117 return true; } while (0)
8119 if (type
== error_mark_node
)
8122 /* If TYPE itself has variable size, it is variably modified. */
8123 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8124 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8126 switch (TREE_CODE (type
))
8129 case REFERENCE_TYPE
:
8131 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8137 /* If TYPE is a function type, it is variably modified if the
8138 return type is variably modified. */
8139 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8145 case FIXED_POINT_TYPE
:
8148 /* Scalar types are variably modified if their end points
8150 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8151 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8156 case QUAL_UNION_TYPE
:
8157 /* We can't see if any of the fields are variably-modified by the
8158 definition we normally use, since that would produce infinite
8159 recursion via pointers. */
8160 /* This is variably modified if some field's type is. */
8161 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
8162 if (TREE_CODE (t
) == FIELD_DECL
)
8164 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8165 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8166 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8168 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8169 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8174 /* Do not call ourselves to avoid infinite recursion. This is
8175 variably modified if the element type is. */
8176 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8177 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8184 /* The current language may have other cases to check, but in general,
8185 all other types are not variably modified. */
8186 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8188 #undef RETURN_TRUE_IF_VAR
8191 /* Given a DECL or TYPE, return the scope in which it was declared, or
8192 NULL_TREE if there is no containing scope. */
8195 get_containing_scope (const_tree t
)
8197 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8200 /* Return the innermost context enclosing DECL that is
8201 a FUNCTION_DECL, or zero if none. */
8204 decl_function_context (const_tree decl
)
8208 if (TREE_CODE (decl
) == ERROR_MARK
)
8211 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8212 where we look up the function at runtime. Such functions always take
8213 a first argument of type 'pointer to real context'.
8215 C++ should really be fixed to use DECL_CONTEXT for the real context,
8216 and use something else for the "virtual context". */
8217 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8220 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8222 context
= DECL_CONTEXT (decl
);
8224 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8226 if (TREE_CODE (context
) == BLOCK
)
8227 context
= BLOCK_SUPERCONTEXT (context
);
8229 context
= get_containing_scope (context
);
8235 /* Return the innermost context enclosing DECL that is
8236 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8237 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8240 decl_type_context (const_tree decl
)
8242 tree context
= DECL_CONTEXT (decl
);
8245 switch (TREE_CODE (context
))
8247 case NAMESPACE_DECL
:
8248 case TRANSLATION_UNIT_DECL
:
8253 case QUAL_UNION_TYPE
:
8258 context
= DECL_CONTEXT (context
);
8262 context
= BLOCK_SUPERCONTEXT (context
);
8272 /* CALL is a CALL_EXPR. Return the declaration for the function
8273 called, or NULL_TREE if the called function cannot be
8277 get_callee_fndecl (const_tree call
)
8281 if (call
== error_mark_node
)
8282 return error_mark_node
;
8284 /* It's invalid to call this function with anything but a
8286 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8288 /* The first operand to the CALL is the address of the function
8290 addr
= CALL_EXPR_FN (call
);
8294 /* If this is a readonly function pointer, extract its initial value. */
8295 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8296 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8297 && DECL_INITIAL (addr
))
8298 addr
= DECL_INITIAL (addr
);
8300 /* If the address is just `&f' for some function `f', then we know
8301 that `f' is being called. */
8302 if (TREE_CODE (addr
) == ADDR_EXPR
8303 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8304 return TREE_OPERAND (addr
, 0);
8306 /* We couldn't figure out what was being called. */
8310 /* Print debugging information about tree nodes generated during the compile,
8311 and any language-specific information. */
8314 dump_tree_statistics (void)
8316 #ifdef GATHER_STATISTICS
8318 int total_nodes
, total_bytes
;
8321 fprintf (stderr
, "\n??? tree nodes created\n\n");
8322 #ifdef GATHER_STATISTICS
8323 fprintf (stderr
, "Kind Nodes Bytes\n");
8324 fprintf (stderr
, "---------------------------------------\n");
8325 total_nodes
= total_bytes
= 0;
8326 for (i
= 0; i
< (int) all_kinds
; i
++)
8328 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8329 tree_node_counts
[i
], tree_node_sizes
[i
]);
8330 total_nodes
+= tree_node_counts
[i
];
8331 total_bytes
+= tree_node_sizes
[i
];
8333 fprintf (stderr
, "---------------------------------------\n");
8334 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8335 fprintf (stderr
, "---------------------------------------\n");
8336 ssanames_print_statistics ();
8337 phinodes_print_statistics ();
8339 fprintf (stderr
, "(No per-node statistics)\n");
8341 print_type_hash_statistics ();
8342 print_debug_expr_statistics ();
8343 print_value_expr_statistics ();
8344 lang_hooks
.print_statistics ();
8347 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8349 /* Generate a crc32 of a string. */
8352 crc32_string (unsigned chksum
, const char *string
)
8356 unsigned value
= *string
<< 24;
8359 for (ix
= 8; ix
--; value
<<= 1)
8363 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8372 /* P is a string that will be used in a symbol. Mask out any characters
8373 that are not valid in that context. */
8376 clean_symbol_name (char *p
)
8380 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8383 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8390 /* Generate a name for a special-purpose function function.
8391 The generated name may need to be unique across the whole link.
8392 TYPE is some string to identify the purpose of this function to the
8393 linker or collect2; it must start with an uppercase letter,
8395 I - for constructors
8397 N - for C++ anonymous namespaces
8398 F - for DWARF unwind frame information. */
8401 get_file_function_name (const char *type
)
8407 /* If we already have a name we know to be unique, just use that. */
8408 if (first_global_object_name
)
8409 p
= q
= ASTRDUP (first_global_object_name
);
8410 /* If the target is handling the constructors/destructors, they
8411 will be local to this file and the name is only necessary for
8412 debugging purposes. */
8413 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8415 const char *file
= main_input_filename
;
8417 file
= input_filename
;
8418 /* Just use the file's basename, because the full pathname
8419 might be quite long. */
8420 p
= strrchr (file
, '/');
8425 p
= q
= ASTRDUP (p
);
8429 /* Otherwise, the name must be unique across the entire link.
8430 We don't have anything that we know to be unique to this translation
8431 unit, so use what we do have and throw in some randomness. */
8433 const char *name
= weak_global_object_name
;
8434 const char *file
= main_input_filename
;
8439 file
= input_filename
;
8441 len
= strlen (file
);
8442 q
= (char *) alloca (9 * 2 + len
+ 1);
8443 memcpy (q
, file
, len
+ 1);
8445 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8446 crc32_string (0, get_random_seed (false)));
8451 clean_symbol_name (q
);
8452 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8455 /* Set up the name of the file-level functions we may need.
8456 Use a global object (which is already required to be unique over
8457 the program) rather than the file name (which imposes extra
8459 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8461 return get_identifier (buf
);
8464 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8466 /* Complain that the tree code of NODE does not match the expected 0
8467 terminated list of trailing codes. The trailing code list can be
8468 empty, for a more vague error message. FILE, LINE, and FUNCTION
8469 are of the caller. */
8472 tree_check_failed (const_tree node
, const char *file
,
8473 int line
, const char *function
, ...)
8477 unsigned length
= 0;
8480 va_start (args
, function
);
8481 while ((code
= va_arg (args
, int)))
8482 length
+= 4 + strlen (tree_code_name
[code
]);
8487 va_start (args
, function
);
8488 length
+= strlen ("expected ");
8489 buffer
= tmp
= (char *) alloca (length
);
8491 while ((code
= va_arg (args
, int)))
8493 const char *prefix
= length
? " or " : "expected ";
8495 strcpy (tmp
+ length
, prefix
);
8496 length
+= strlen (prefix
);
8497 strcpy (tmp
+ length
, tree_code_name
[code
]);
8498 length
+= strlen (tree_code_name
[code
]);
8503 buffer
= "unexpected node";
8505 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8506 buffer
, tree_code_name
[TREE_CODE (node
)],
8507 function
, trim_filename (file
), line
);
8510 /* Complain that the tree code of NODE does match the expected 0
8511 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8515 tree_not_check_failed (const_tree node
, const char *file
,
8516 int line
, const char *function
, ...)
8520 unsigned length
= 0;
8523 va_start (args
, function
);
8524 while ((code
= va_arg (args
, int)))
8525 length
+= 4 + strlen (tree_code_name
[code
]);
8527 va_start (args
, function
);
8528 buffer
= (char *) alloca (length
);
8530 while ((code
= va_arg (args
, int)))
8534 strcpy (buffer
+ length
, " or ");
8537 strcpy (buffer
+ length
, tree_code_name
[code
]);
8538 length
+= strlen (tree_code_name
[code
]);
8542 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8543 buffer
, tree_code_name
[TREE_CODE (node
)],
8544 function
, trim_filename (file
), line
);
8547 /* Similar to tree_check_failed, except that we check for a class of tree
8548 code, given in CL. */
8551 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8552 const char *file
, int line
, const char *function
)
8555 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8556 TREE_CODE_CLASS_STRING (cl
),
8557 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8558 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8561 /* Similar to tree_check_failed, except that instead of specifying a
8562 dozen codes, use the knowledge that they're all sequential. */
8565 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8566 const char *function
, enum tree_code c1
,
8570 unsigned length
= 0;
8573 for (c
= c1
; c
<= c2
; ++c
)
8574 length
+= 4 + strlen (tree_code_name
[c
]);
8576 length
+= strlen ("expected ");
8577 buffer
= (char *) alloca (length
);
8580 for (c
= c1
; c
<= c2
; ++c
)
8582 const char *prefix
= length
? " or " : "expected ";
8584 strcpy (buffer
+ length
, prefix
);
8585 length
+= strlen (prefix
);
8586 strcpy (buffer
+ length
, tree_code_name
[c
]);
8587 length
+= strlen (tree_code_name
[c
]);
8590 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8591 buffer
, tree_code_name
[TREE_CODE (node
)],
8592 function
, trim_filename (file
), line
);
8596 /* Similar to tree_check_failed, except that we check that a tree does
8597 not have the specified code, given in CL. */
8600 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8601 const char *file
, int line
, const char *function
)
8604 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8605 TREE_CODE_CLASS_STRING (cl
),
8606 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8607 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8611 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8614 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8615 const char *function
, enum omp_clause_code code
)
8617 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8618 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8619 function
, trim_filename (file
), line
);
8623 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8626 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8627 const char *function
, enum omp_clause_code c1
,
8628 enum omp_clause_code c2
)
8631 unsigned length
= 0;
8634 for (c
= c1
; c
<= c2
; ++c
)
8635 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8637 length
+= strlen ("expected ");
8638 buffer
= (char *) alloca (length
);
8641 for (c
= c1
; c
<= c2
; ++c
)
8643 const char *prefix
= length
? " or " : "expected ";
8645 strcpy (buffer
+ length
, prefix
);
8646 length
+= strlen (prefix
);
8647 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8648 length
+= strlen (omp_clause_code_name
[c
]);
8651 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8652 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8653 function
, trim_filename (file
), line
);
8657 #undef DEFTREESTRUCT
8658 #define DEFTREESTRUCT(VAL, NAME) NAME,
8660 static const char *ts_enum_names
[] = {
8661 #include "treestruct.def"
8663 #undef DEFTREESTRUCT
8665 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8667 /* Similar to tree_class_check_failed, except that we check for
8668 whether CODE contains the tree structure identified by EN. */
8671 tree_contains_struct_check_failed (const_tree node
,
8672 const enum tree_node_structure_enum en
,
8673 const char *file
, int line
,
8674 const char *function
)
8677 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8679 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8683 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8684 (dynamically sized) vector. */
8687 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8688 const char *function
)
8691 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8692 idx
+ 1, len
, function
, trim_filename (file
), line
);
8695 /* Similar to above, except that the check is for the bounds of the operand
8696 vector of an expression node EXP. */
8699 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8700 int line
, const char *function
)
8702 int code
= TREE_CODE (exp
);
8704 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8705 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8706 function
, trim_filename (file
), line
);
8709 /* Similar to above, except that the check is for the number of
8710 operands of an OMP_CLAUSE node. */
8713 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8714 int line
, const char *function
)
8717 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8718 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8719 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8720 trim_filename (file
), line
);
8722 #endif /* ENABLE_TREE_CHECKING */
8724 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8725 and mapped to the machine mode MODE. Initialize its fields and build
8726 the information necessary for debugging output. */
8729 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8732 hashval_t hashcode
= 0;
8734 t
= make_node (VECTOR_TYPE
);
8735 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8736 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8737 SET_TYPE_MODE (t
, mode
);
8739 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8740 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8741 else if (TYPE_CANONICAL (innertype
) != innertype
8742 || mode
!= VOIDmode
)
8744 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8749 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
8750 tree array
= build_array_type (TYPE_MAIN_VARIANT (innertype
),
8751 build_index_type (index
));
8752 tree rt
= make_node (RECORD_TYPE
);
8754 TYPE_FIELDS (rt
) = build_decl (UNKNOWN_LOCATION
, FIELD_DECL
,
8755 get_identifier ("f"), array
);
8756 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
8758 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
8759 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
8760 the representation type, and we want to find that die when looking up
8761 the vector type. This is most easily achieved by making the TYPE_UID
8763 TYPE_UID (rt
) = TYPE_UID (t
);
8766 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8767 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8768 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8769 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8770 t
= type_hash_canon (hashcode
, t
);
8772 /* We have built a main variant, based on the main variant of the
8773 inner type. Use it to build the variant we return. */
8774 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8775 && TREE_TYPE (t
) != innertype
)
8776 return build_type_attribute_qual_variant (t
,
8777 TYPE_ATTRIBUTES (innertype
),
8778 TYPE_QUALS (innertype
));
8784 make_or_reuse_type (unsigned size
, int unsignedp
)
8786 if (size
== INT_TYPE_SIZE
)
8787 return unsignedp
? unsigned_type_node
: integer_type_node
;
8788 if (size
== CHAR_TYPE_SIZE
)
8789 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8790 if (size
== SHORT_TYPE_SIZE
)
8791 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8792 if (size
== LONG_TYPE_SIZE
)
8793 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8794 if (size
== LONG_LONG_TYPE_SIZE
)
8795 return (unsignedp
? long_long_unsigned_type_node
8796 : long_long_integer_type_node
);
8797 if (size
== 128 && int128_integer_type_node
)
8798 return (unsignedp
? int128_unsigned_type_node
8799 : int128_integer_type_node
);
8802 return make_unsigned_type (size
);
8804 return make_signed_type (size
);
8807 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8810 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8814 if (size
== SHORT_FRACT_TYPE_SIZE
)
8815 return unsignedp
? sat_unsigned_short_fract_type_node
8816 : sat_short_fract_type_node
;
8817 if (size
== FRACT_TYPE_SIZE
)
8818 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
8819 if (size
== LONG_FRACT_TYPE_SIZE
)
8820 return unsignedp
? sat_unsigned_long_fract_type_node
8821 : sat_long_fract_type_node
;
8822 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8823 return unsignedp
? sat_unsigned_long_long_fract_type_node
8824 : sat_long_long_fract_type_node
;
8828 if (size
== SHORT_FRACT_TYPE_SIZE
)
8829 return unsignedp
? unsigned_short_fract_type_node
8830 : short_fract_type_node
;
8831 if (size
== FRACT_TYPE_SIZE
)
8832 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
8833 if (size
== LONG_FRACT_TYPE_SIZE
)
8834 return unsignedp
? unsigned_long_fract_type_node
8835 : long_fract_type_node
;
8836 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
8837 return unsignedp
? unsigned_long_long_fract_type_node
8838 : long_long_fract_type_node
;
8841 return make_fract_type (size
, unsignedp
, satp
);
8844 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
8847 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
8851 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8852 return unsignedp
? sat_unsigned_short_accum_type_node
8853 : sat_short_accum_type_node
;
8854 if (size
== ACCUM_TYPE_SIZE
)
8855 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
8856 if (size
== LONG_ACCUM_TYPE_SIZE
)
8857 return unsignedp
? sat_unsigned_long_accum_type_node
8858 : sat_long_accum_type_node
;
8859 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8860 return unsignedp
? sat_unsigned_long_long_accum_type_node
8861 : sat_long_long_accum_type_node
;
8865 if (size
== SHORT_ACCUM_TYPE_SIZE
)
8866 return unsignedp
? unsigned_short_accum_type_node
8867 : short_accum_type_node
;
8868 if (size
== ACCUM_TYPE_SIZE
)
8869 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
8870 if (size
== LONG_ACCUM_TYPE_SIZE
)
8871 return unsignedp
? unsigned_long_accum_type_node
8872 : long_accum_type_node
;
8873 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
8874 return unsignedp
? unsigned_long_long_accum_type_node
8875 : long_long_accum_type_node
;
8878 return make_accum_type (size
, unsignedp
, satp
);
8881 /* Create nodes for all integer types (and error_mark_node) using the sizes
8882 of C datatypes. The caller should call set_sizetype soon after calling
8883 this function to select one of the types as sizetype. */
8886 build_common_tree_nodes (bool signed_char
)
8888 error_mark_node
= make_node (ERROR_MARK
);
8889 TREE_TYPE (error_mark_node
) = error_mark_node
;
8891 initialize_sizetypes ();
8893 /* Define both `signed char' and `unsigned char'. */
8894 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
8895 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
8896 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
8897 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
8899 /* Define `char', which is like either `signed char' or `unsigned char'
8900 but not the same as either. */
8903 ? make_signed_type (CHAR_TYPE_SIZE
)
8904 : make_unsigned_type (CHAR_TYPE_SIZE
));
8905 TYPE_STRING_FLAG (char_type_node
) = 1;
8907 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
8908 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
8909 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
8910 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
8911 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
8912 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
8913 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
8914 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
8915 #if HOST_BITS_PER_WIDE_INT >= 64
8916 /* TODO: This isn't correct, but as logic depends at the moment on
8917 host's instead of target's wide-integer.
8918 If there is a target not supporting TImode, but has an 128-bit
8919 integer-scalar register, this target check needs to be adjusted. */
8920 if (targetm
.scalar_mode_supported_p (TImode
))
8922 int128_integer_type_node
= make_signed_type (128);
8923 int128_unsigned_type_node
= make_unsigned_type (128);
8926 /* Define a boolean type. This type only represents boolean values but
8927 may be larger than char depending on the value of BOOL_TYPE_SIZE.
8928 Front ends which want to override this size (i.e. Java) can redefine
8929 boolean_type_node before calling build_common_tree_nodes_2. */
8930 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
8931 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
8932 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
8933 TYPE_PRECISION (boolean_type_node
) = 1;
8935 /* Fill in the rest of the sized types. Reuse existing type nodes
8937 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
8938 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
8939 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
8940 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
8941 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
8943 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
8944 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
8945 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
8946 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
8947 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
8949 access_public_node
= get_identifier ("public");
8950 access_protected_node
= get_identifier ("protected");
8951 access_private_node
= get_identifier ("private");
8954 /* Call this function after calling build_common_tree_nodes and set_sizetype.
8955 It will create several other common tree nodes. */
8958 build_common_tree_nodes_2 (int short_double
)
8960 /* Define these next since types below may used them. */
8961 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
8962 integer_one_node
= build_int_cst (NULL_TREE
, 1);
8963 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
8965 size_zero_node
= size_int (0);
8966 size_one_node
= size_int (1);
8967 bitsize_zero_node
= bitsize_int (0);
8968 bitsize_one_node
= bitsize_int (1);
8969 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
8971 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
8972 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
8974 void_type_node
= make_node (VOID_TYPE
);
8975 layout_type (void_type_node
);
8977 /* We are not going to have real types in C with less than byte alignment,
8978 so we might as well not have any types that claim to have it. */
8979 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
8980 TYPE_USER_ALIGN (void_type_node
) = 0;
8982 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
8983 layout_type (TREE_TYPE (null_pointer_node
));
8985 ptr_type_node
= build_pointer_type (void_type_node
);
8987 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
8988 fileptr_type_node
= ptr_type_node
;
8990 float_type_node
= make_node (REAL_TYPE
);
8991 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
8992 layout_type (float_type_node
);
8994 double_type_node
= make_node (REAL_TYPE
);
8996 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
8998 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
8999 layout_type (double_type_node
);
9001 long_double_type_node
= make_node (REAL_TYPE
);
9002 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9003 layout_type (long_double_type_node
);
9005 float_ptr_type_node
= build_pointer_type (float_type_node
);
9006 double_ptr_type_node
= build_pointer_type (double_type_node
);
9007 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9008 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9010 /* Fixed size integer types. */
9011 uint32_type_node
= build_nonstandard_integer_type (32, true);
9012 uint64_type_node
= build_nonstandard_integer_type (64, true);
9014 /* Decimal float types. */
9015 dfloat32_type_node
= make_node (REAL_TYPE
);
9016 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9017 layout_type (dfloat32_type_node
);
9018 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9019 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9021 dfloat64_type_node
= make_node (REAL_TYPE
);
9022 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9023 layout_type (dfloat64_type_node
);
9024 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9025 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9027 dfloat128_type_node
= make_node (REAL_TYPE
);
9028 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9029 layout_type (dfloat128_type_node
);
9030 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9031 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9033 complex_integer_type_node
= build_complex_type (integer_type_node
);
9034 complex_float_type_node
= build_complex_type (float_type_node
);
9035 complex_double_type_node
= build_complex_type (double_type_node
);
9036 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9038 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9039 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9040 sat_ ## KIND ## _type_node = \
9041 make_sat_signed_ ## KIND ## _type (SIZE); \
9042 sat_unsigned_ ## KIND ## _type_node = \
9043 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9044 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9045 unsigned_ ## KIND ## _type_node = \
9046 make_unsigned_ ## KIND ## _type (SIZE);
9048 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9049 sat_ ## WIDTH ## KIND ## _type_node = \
9050 make_sat_signed_ ## KIND ## _type (SIZE); \
9051 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9052 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9053 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9054 unsigned_ ## WIDTH ## KIND ## _type_node = \
9055 make_unsigned_ ## KIND ## _type (SIZE);
9057 /* Make fixed-point type nodes based on four different widths. */
9058 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9059 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9060 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9061 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9062 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9064 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9065 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9066 NAME ## _type_node = \
9067 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9068 u ## NAME ## _type_node = \
9069 make_or_reuse_unsigned_ ## KIND ## _type \
9070 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9071 sat_ ## NAME ## _type_node = \
9072 make_or_reuse_sat_signed_ ## KIND ## _type \
9073 (GET_MODE_BITSIZE (MODE ## mode)); \
9074 sat_u ## NAME ## _type_node = \
9075 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9076 (GET_MODE_BITSIZE (U ## MODE ## mode));
9078 /* Fixed-point type and mode nodes. */
9079 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9080 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9081 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9082 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9083 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9084 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9085 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9086 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9087 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9088 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9089 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9092 tree t
= targetm
.build_builtin_va_list ();
9094 /* Many back-ends define record types without setting TYPE_NAME.
9095 If we copied the record type here, we'd keep the original
9096 record type without a name. This breaks name mangling. So,
9097 don't copy record types and let c_common_nodes_and_builtins()
9098 declare the type to be __builtin_va_list. */
9099 if (TREE_CODE (t
) != RECORD_TYPE
)
9100 t
= build_variant_type_copy (t
);
9102 va_list_type_node
= t
;
9106 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9109 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9110 const char *library_name
, int ecf_flags
)
9114 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9115 library_name
, NULL_TREE
);
9116 if (ecf_flags
& ECF_CONST
)
9117 TREE_READONLY (decl
) = 1;
9118 if (ecf_flags
& ECF_PURE
)
9119 DECL_PURE_P (decl
) = 1;
9120 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9121 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9122 if (ecf_flags
& ECF_NORETURN
)
9123 TREE_THIS_VOLATILE (decl
) = 1;
9124 if (ecf_flags
& ECF_NOTHROW
)
9125 TREE_NOTHROW (decl
) = 1;
9126 if (ecf_flags
& ECF_MALLOC
)
9127 DECL_IS_MALLOC (decl
) = 1;
9129 built_in_decls
[code
] = decl
;
9130 implicit_built_in_decls
[code
] = decl
;
9133 /* Call this function after instantiating all builtins that the language
9134 front end cares about. This will build the rest of the builtins that
9135 are relied upon by the tree optimizers and the middle-end. */
9138 build_common_builtin_nodes (void)
9140 tree tmp
, tmp2
, ftype
;
9142 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
9143 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9145 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9146 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
9147 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9148 ftype
= build_function_type (ptr_type_node
, tmp
);
9150 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
9151 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9152 "memcpy", ECF_NOTHROW
);
9153 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9154 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9155 "memmove", ECF_NOTHROW
);
9158 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
9160 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9161 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
9162 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
9163 ftype
= build_function_type (integer_type_node
, tmp
);
9164 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9165 "memcmp", ECF_PURE
| ECF_NOTHROW
);
9168 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
9170 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9171 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
9172 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9173 ftype
= build_function_type (ptr_type_node
, tmp
);
9174 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9175 "memset", ECF_NOTHROW
);
9178 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9180 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
9181 ftype
= build_function_type (ptr_type_node
, tmp
);
9182 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9183 "alloca", ECF_MALLOC
| ECF_NOTHROW
);
9186 /* If we're checking the stack, `alloca' can throw. */
9187 if (flag_stack_check
)
9188 TREE_NOTHROW (built_in_decls
[BUILT_IN_ALLOCA
]) = 0;
9190 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9191 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9192 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9193 ftype
= build_function_type (void_type_node
, tmp
);
9194 local_define_builtin ("__builtin_init_trampoline", ftype
,
9195 BUILT_IN_INIT_TRAMPOLINE
,
9196 "__builtin_init_trampoline", ECF_NOTHROW
);
9198 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9199 ftype
= build_function_type (ptr_type_node
, tmp
);
9200 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9201 BUILT_IN_ADJUST_TRAMPOLINE
,
9202 "__builtin_adjust_trampoline",
9203 ECF_CONST
| ECF_NOTHROW
);
9205 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9206 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9207 ftype
= build_function_type (void_type_node
, tmp
);
9208 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9209 BUILT_IN_NONLOCAL_GOTO
,
9210 "__builtin_nonlocal_goto",
9211 ECF_NORETURN
| ECF_NOTHROW
);
9213 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9214 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
9215 ftype
= build_function_type (void_type_node
, tmp
);
9216 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9217 BUILT_IN_SETJMP_SETUP
,
9218 "__builtin_setjmp_setup", ECF_NOTHROW
);
9220 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9221 ftype
= build_function_type (ptr_type_node
, tmp
);
9222 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9223 BUILT_IN_SETJMP_DISPATCHER
,
9224 "__builtin_setjmp_dispatcher",
9225 ECF_PURE
| ECF_NOTHROW
);
9227 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9228 ftype
= build_function_type (void_type_node
, tmp
);
9229 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9230 BUILT_IN_SETJMP_RECEIVER
,
9231 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9233 ftype
= build_function_type (ptr_type_node
, void_list_node
);
9234 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9235 "__builtin_stack_save", ECF_NOTHROW
);
9237 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9238 ftype
= build_function_type (void_type_node
, tmp
);
9239 local_define_builtin ("__builtin_stack_restore", ftype
,
9240 BUILT_IN_STACK_RESTORE
,
9241 "__builtin_stack_restore", ECF_NOTHROW
);
9243 ftype
= build_function_type (void_type_node
, void_list_node
);
9244 local_define_builtin ("__builtin_profile_func_enter", ftype
,
9245 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
9246 local_define_builtin ("__builtin_profile_func_exit", ftype
,
9247 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
9249 /* If there's a possibility that we might use the ARM EABI, build the
9250 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9251 if (targetm
.arm_eabi_unwinder
)
9253 ftype
= build_function_type (void_type_node
, void_list_node
);
9254 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9255 BUILT_IN_CXA_END_CLEANUP
,
9256 "__cxa_end_cleanup", ECF_NORETURN
);
9259 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
9260 ftype
= build_function_type (void_type_node
, tmp
);
9261 local_define_builtin ("__builtin_unwind_resume", ftype
,
9262 BUILT_IN_UNWIND_RESUME
,
9263 (USING_SJLJ_EXCEPTIONS
9264 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9267 /* The exception object and filter values from the runtime. The argument
9268 must be zero before exception lowering, i.e. from the front end. After
9269 exception lowering, it will be the region number for the exception
9270 landing pad. These functions are PURE instead of CONST to prevent
9271 them from being hoisted past the exception edge that will initialize
9272 its value in the landing pad. */
9273 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9274 ftype
= build_function_type (ptr_type_node
, tmp
);
9275 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9276 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
);
9278 tmp2
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9279 ftype
= build_function_type (tmp2
, tmp
);
9280 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9281 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
);
9283 tmp
= tree_cons (NULL_TREE
, integer_type_node
, void_list_node
);
9284 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
9285 ftype
= build_function_type (void_type_node
, tmp
);
9286 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9287 BUILT_IN_EH_COPY_VALUES
,
9288 "__builtin_eh_copy_values", ECF_NOTHROW
);
9290 /* Complex multiplication and division. These are handled as builtins
9291 rather than optabs because emit_library_call_value doesn't support
9292 complex. Further, we can do slightly better with folding these
9293 beasties if the real and complex parts of the arguments are separate. */
9297 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9299 char mode_name_buf
[4], *q
;
9301 enum built_in_function mcode
, dcode
;
9302 tree type
, inner_type
;
9304 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9307 inner_type
= TREE_TYPE (type
);
9309 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
9310 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9311 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9312 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
9313 ftype
= build_function_type (type
, tmp
);
9315 mcode
= ((enum built_in_function
)
9316 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9317 dcode
= ((enum built_in_function
)
9318 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9320 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9324 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9325 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9326 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
9328 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9329 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9330 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
9335 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9338 If we requested a pointer to a vector, build up the pointers that
9339 we stripped off while looking for the inner type. Similarly for
9340 return values from functions.
9342 The argument TYPE is the top of the chain, and BOTTOM is the
9343 new type which we will point to. */
9346 reconstruct_complex_type (tree type
, tree bottom
)
9350 if (TREE_CODE (type
) == POINTER_TYPE
)
9352 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9353 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9354 TYPE_REF_CAN_ALIAS_ALL (type
));
9356 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9358 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9359 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9360 TYPE_REF_CAN_ALIAS_ALL (type
));
9362 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9364 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9365 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9367 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9369 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9370 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9372 else if (TREE_CODE (type
) == METHOD_TYPE
)
9374 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9375 /* The build_method_type_directly() routine prepends 'this' to argument list,
9376 so we must compensate by getting rid of it. */
9378 = build_method_type_directly
9379 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9381 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9383 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9385 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9386 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9391 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9395 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9398 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9402 switch (GET_MODE_CLASS (mode
))
9404 case MODE_VECTOR_INT
:
9405 case MODE_VECTOR_FLOAT
:
9406 case MODE_VECTOR_FRACT
:
9407 case MODE_VECTOR_UFRACT
:
9408 case MODE_VECTOR_ACCUM
:
9409 case MODE_VECTOR_UACCUM
:
9410 nunits
= GET_MODE_NUNITS (mode
);
9414 /* Check that there are no leftover bits. */
9415 gcc_assert (GET_MODE_BITSIZE (mode
)
9416 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9418 nunits
= GET_MODE_BITSIZE (mode
)
9419 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9426 return make_vector_type (innertype
, nunits
, mode
);
9429 /* Similarly, but takes the inner type and number of units, which must be
9433 build_vector_type (tree innertype
, int nunits
)
9435 return make_vector_type (innertype
, nunits
, VOIDmode
);
9438 /* Similarly, but takes the inner type and number of units, which must be
9442 build_opaque_vector_type (tree innertype
, int nunits
)
9445 innertype
= build_distinct_type_copy (innertype
);
9446 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9447 TYPE_VECTOR_OPAQUE (t
) = true;
9452 /* Given an initializer INIT, return TRUE if INIT is zero or some
9453 aggregate of zeros. Otherwise return FALSE. */
9455 initializer_zerop (const_tree init
)
9461 switch (TREE_CODE (init
))
9464 return integer_zerop (init
);
9467 /* ??? Note that this is not correct for C4X float formats. There,
9468 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9469 negative exponent. */
9470 return real_zerop (init
)
9471 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9474 return fixed_zerop (init
);
9477 return integer_zerop (init
)
9478 || (real_zerop (init
)
9479 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9480 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9483 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9484 if (!initializer_zerop (TREE_VALUE (elt
)))
9490 unsigned HOST_WIDE_INT idx
;
9492 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9493 if (!initializer_zerop (elt
))
9502 /* We need to loop through all elements to handle cases like
9503 "\0" and "\0foobar". */
9504 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9505 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9516 /* Build an empty statement at location LOC. */
9519 build_empty_stmt (location_t loc
)
9521 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9522 SET_EXPR_LOCATION (t
, loc
);
9527 /* Build an OpenMP clause with code CODE. LOC is the location of the
9531 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9536 length
= omp_clause_num_ops
[code
];
9537 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9539 t
= ggc_alloc_tree_node (size
);
9540 memset (t
, 0, size
);
9541 TREE_SET_CODE (t
, OMP_CLAUSE
);
9542 OMP_CLAUSE_SET_CODE (t
, code
);
9543 OMP_CLAUSE_LOCATION (t
) = loc
;
9545 #ifdef GATHER_STATISTICS
9546 tree_node_counts
[(int) omp_clause_kind
]++;
9547 tree_node_sizes
[(int) omp_clause_kind
] += size
;
9553 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9554 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9555 Except for the CODE and operand count field, other storage for the
9556 object is initialized to zeros. */
9559 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9562 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9564 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9565 gcc_assert (len
>= 1);
9567 #ifdef GATHER_STATISTICS
9568 tree_node_counts
[(int) e_kind
]++;
9569 tree_node_sizes
[(int) e_kind
] += length
;
9572 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
9574 TREE_SET_CODE (t
, code
);
9576 /* Can't use TREE_OPERAND to store the length because if checking is
9577 enabled, it will try to check the length before we store it. :-P */
9578 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9584 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
9585 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
9589 build_call_list (tree return_type
, tree fn
, tree arglist
)
9594 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
9595 TREE_TYPE (t
) = return_type
;
9596 CALL_EXPR_FN (t
) = fn
;
9597 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9598 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
9599 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
9600 process_call_operands (t
);
9604 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9605 FN and a null static chain slot. NARGS is the number of call arguments
9606 which are specified as "..." arguments. */
9609 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9613 va_start (args
, nargs
);
9614 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9619 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9620 FN and a null static chain slot. NARGS is the number of call arguments
9621 which are specified as a va_list ARGS. */
9624 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9629 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9630 TREE_TYPE (t
) = return_type
;
9631 CALL_EXPR_FN (t
) = fn
;
9632 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9633 for (i
= 0; i
< nargs
; i
++)
9634 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9635 process_call_operands (t
);
9639 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9640 FN and a null static chain slot. NARGS is the number of call arguments
9641 which are specified as a tree array ARGS. */
9644 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9645 int nargs
, const tree
*args
)
9650 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9651 TREE_TYPE (t
) = return_type
;
9652 CALL_EXPR_FN (t
) = fn
;
9653 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
9654 for (i
= 0; i
< nargs
; i
++)
9655 CALL_EXPR_ARG (t
, i
) = args
[i
];
9656 process_call_operands (t
);
9657 SET_EXPR_LOCATION (t
, loc
);
9661 /* Like build_call_array, but takes a VEC. */
9664 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9669 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
9670 TREE_TYPE (ret
) = return_type
;
9671 CALL_EXPR_FN (ret
) = fn
;
9672 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
9673 for (ix
= 0; VEC_iterate (tree
, args
, ix
, t
); ++ix
)
9674 CALL_EXPR_ARG (ret
, ix
) = t
;
9675 process_call_operands (ret
);
9680 /* Returns true if it is possible to prove that the index of
9681 an array access REF (an ARRAY_REF expression) falls into the
9685 in_array_bounds_p (tree ref
)
9687 tree idx
= TREE_OPERAND (ref
, 1);
9690 if (TREE_CODE (idx
) != INTEGER_CST
)
9693 min
= array_ref_low_bound (ref
);
9694 max
= array_ref_up_bound (ref
);
9697 || TREE_CODE (min
) != INTEGER_CST
9698 || TREE_CODE (max
) != INTEGER_CST
)
9701 if (tree_int_cst_lt (idx
, min
)
9702 || tree_int_cst_lt (max
, idx
))
9708 /* Returns true if it is possible to prove that the range of
9709 an array access REF (an ARRAY_RANGE_REF expression) falls
9710 into the array bounds. */
9713 range_in_array_bounds_p (tree ref
)
9715 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9716 tree range_min
, range_max
, min
, max
;
9718 range_min
= TYPE_MIN_VALUE (domain_type
);
9719 range_max
= TYPE_MAX_VALUE (domain_type
);
9722 || TREE_CODE (range_min
) != INTEGER_CST
9723 || TREE_CODE (range_max
) != INTEGER_CST
)
9726 min
= array_ref_low_bound (ref
);
9727 max
= array_ref_up_bound (ref
);
9730 || TREE_CODE (min
) != INTEGER_CST
9731 || TREE_CODE (max
) != INTEGER_CST
)
9734 if (tree_int_cst_lt (range_min
, min
)
9735 || tree_int_cst_lt (max
, range_max
))
9741 /* Return true if T (assumed to be a DECL) must be assigned a memory
9745 needs_to_live_in_memory (const_tree t
)
9747 if (TREE_CODE (t
) == SSA_NAME
)
9748 t
= SSA_NAME_VAR (t
);
9750 return (TREE_ADDRESSABLE (t
)
9751 || is_global_var (t
)
9752 || (TREE_CODE (t
) == RESULT_DECL
9753 && aggregate_value_p (t
, current_function_decl
)));
9756 /* There are situations in which a language considers record types
9757 compatible which have different field lists. Decide if two fields
9758 are compatible. It is assumed that the parent records are compatible. */
9761 fields_compatible_p (const_tree f1
, const_tree f2
)
9763 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
9764 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
9767 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
9768 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
9771 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9777 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
9780 find_compatible_field (tree record
, tree orig_field
)
9784 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
9785 if (TREE_CODE (f
) == FIELD_DECL
9786 && fields_compatible_p (f
, orig_field
))
9789 /* ??? Why isn't this on the main fields list? */
9790 f
= TYPE_VFIELD (record
);
9791 if (f
&& TREE_CODE (f
) == FIELD_DECL
9792 && fields_compatible_p (f
, orig_field
))
9795 /* ??? We should abort here, but Java appears to do Bad Things
9796 with inherited fields. */
9800 /* Return value of a constant X and sign-extend it. */
9803 int_cst_value (const_tree x
)
9805 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9806 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9808 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9809 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9810 || TREE_INT_CST_HIGH (x
) == -1);
9812 if (bits
< HOST_BITS_PER_WIDE_INT
)
9814 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9816 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9818 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9824 /* Return value of a constant X and sign-extend it. */
9827 widest_int_cst_value (const_tree x
)
9829 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9830 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9832 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9833 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9834 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9835 << HOST_BITS_PER_WIDE_INT
);
9837 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9838 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9839 || TREE_INT_CST_HIGH (x
) == -1);
9842 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9844 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9846 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9848 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9854 /* If TYPE is an integral type, return an equivalent type which is
9855 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9856 return TYPE itself. */
9859 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9862 if (POINTER_TYPE_P (type
))
9864 /* If the pointer points to the normal address space, use the
9865 size_type_node. Otherwise use an appropriate size for the pointer
9866 based on the named address space it points to. */
9867 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
9870 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9873 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9876 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9879 /* Returns unsigned variant of TYPE. */
9882 unsigned_type_for (tree type
)
9884 return signed_or_unsigned_type_for (1, type
);
9887 /* Returns signed variant of TYPE. */
9890 signed_type_for (tree type
)
9892 return signed_or_unsigned_type_for (0, type
);
9895 /* Returns the largest value obtainable by casting something in INNER type to
9899 upper_bound_in_type (tree outer
, tree inner
)
9901 unsigned HOST_WIDE_INT lo
, hi
;
9902 unsigned int det
= 0;
9903 unsigned oprec
= TYPE_PRECISION (outer
);
9904 unsigned iprec
= TYPE_PRECISION (inner
);
9907 /* Compute a unique number for every combination. */
9908 det
|= (oprec
> iprec
) ? 4 : 0;
9909 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
9910 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
9912 /* Determine the exponent to use. */
9917 /* oprec <= iprec, outer: signed, inner: don't care. */
9922 /* oprec <= iprec, outer: unsigned, inner: don't care. */
9926 /* oprec > iprec, outer: signed, inner: signed. */
9930 /* oprec > iprec, outer: signed, inner: unsigned. */
9934 /* oprec > iprec, outer: unsigned, inner: signed. */
9938 /* oprec > iprec, outer: unsigned, inner: unsigned. */
9945 /* Compute 2^^prec - 1. */
9946 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9949 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
9950 >> (HOST_BITS_PER_WIDE_INT
- prec
));
9954 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9955 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
9956 lo
= ~(unsigned HOST_WIDE_INT
) 0;
9959 return build_int_cst_wide (outer
, lo
, hi
);
9962 /* Returns the smallest value obtainable by casting something in INNER type to
9966 lower_bound_in_type (tree outer
, tree inner
)
9968 unsigned HOST_WIDE_INT lo
, hi
;
9969 unsigned oprec
= TYPE_PRECISION (outer
);
9970 unsigned iprec
= TYPE_PRECISION (inner
);
9972 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
9974 if (TYPE_UNSIGNED (outer
)
9975 /* If we are widening something of an unsigned type, OUTER type
9976 contains all values of INNER type. In particular, both INNER
9977 and OUTER types have zero in common. */
9978 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
9982 /* If we are widening a signed type to another signed type, we
9983 want to obtain -2^^(iprec-1). If we are keeping the
9984 precision or narrowing to a signed type, we want to obtain
9986 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
9988 if (prec
<= HOST_BITS_PER_WIDE_INT
)
9990 hi
= ~(unsigned HOST_WIDE_INT
) 0;
9991 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
9995 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
9996 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10001 return build_int_cst_wide (outer
, lo
, hi
);
10004 /* Return nonzero if two operands that are suitable for PHI nodes are
10005 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10006 SSA_NAME or invariant. Note that this is strictly an optimization.
10007 That is, callers of this function can directly call operand_equal_p
10008 and get the same result, only slower. */
10011 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10015 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10017 return operand_equal_p (arg0
, arg1
, 0);
10020 /* Returns number of zeros at the end of binary representation of X.
10022 ??? Use ffs if available? */
10025 num_ending_zeros (const_tree x
)
10027 unsigned HOST_WIDE_INT fr
, nfr
;
10028 unsigned num
, abits
;
10029 tree type
= TREE_TYPE (x
);
10031 if (TREE_INT_CST_LOW (x
) == 0)
10033 num
= HOST_BITS_PER_WIDE_INT
;
10034 fr
= TREE_INT_CST_HIGH (x
);
10039 fr
= TREE_INT_CST_LOW (x
);
10042 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10045 if (nfr
<< abits
== fr
)
10052 if (num
> TYPE_PRECISION (type
))
10053 num
= TYPE_PRECISION (type
);
10055 return build_int_cst_type (type
, num
);
10059 #define WALK_SUBTREE(NODE) \
10062 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10068 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10069 be walked whenever a type is seen in the tree. Rest of operands and return
10070 value are as for walk_tree. */
10073 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10074 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10076 tree result
= NULL_TREE
;
10078 switch (TREE_CODE (type
))
10081 case REFERENCE_TYPE
:
10082 /* We have to worry about mutually recursive pointers. These can't
10083 be written in C. They can in Ada. It's pathological, but
10084 there's an ACATS test (c38102a) that checks it. Deal with this
10085 by checking if we're pointing to another pointer, that one
10086 points to another pointer, that one does too, and we have no htab.
10087 If so, get a hash table. We check three levels deep to avoid
10088 the cost of the hash table if we don't need one. */
10089 if (POINTER_TYPE_P (TREE_TYPE (type
))
10090 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10091 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10094 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10102 /* ... fall through ... */
10105 WALK_SUBTREE (TREE_TYPE (type
));
10109 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10111 /* Fall through. */
10113 case FUNCTION_TYPE
:
10114 WALK_SUBTREE (TREE_TYPE (type
));
10118 /* We never want to walk into default arguments. */
10119 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10120 WALK_SUBTREE (TREE_VALUE (arg
));
10125 /* Don't follow this nodes's type if a pointer for fear that
10126 we'll have infinite recursion. If we have a PSET, then we
10129 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10130 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10131 WALK_SUBTREE (TREE_TYPE (type
));
10132 WALK_SUBTREE (TYPE_DOMAIN (type
));
10136 WALK_SUBTREE (TREE_TYPE (type
));
10137 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10147 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10148 called with the DATA and the address of each sub-tree. If FUNC returns a
10149 non-NULL value, the traversal is stopped, and the value returned by FUNC
10150 is returned. If PSET is non-NULL it is used to record the nodes visited,
10151 and to avoid visiting a node more than once. */
10154 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10155 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10157 enum tree_code code
;
10161 #define WALK_SUBTREE_TAIL(NODE) \
10165 goto tail_recurse; \
10170 /* Skip empty subtrees. */
10174 /* Don't walk the same tree twice, if the user has requested
10175 that we avoid doing so. */
10176 if (pset
&& pointer_set_insert (pset
, *tp
))
10179 /* Call the function. */
10181 result
= (*func
) (tp
, &walk_subtrees
, data
);
10183 /* If we found something, return it. */
10187 code
= TREE_CODE (*tp
);
10189 /* Even if we didn't, FUNC may have decided that there was nothing
10190 interesting below this point in the tree. */
10191 if (!walk_subtrees
)
10193 /* But we still need to check our siblings. */
10194 if (code
== TREE_LIST
)
10195 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10196 else if (code
== OMP_CLAUSE
)
10197 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10204 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10205 if (result
|| !walk_subtrees
)
10212 case IDENTIFIER_NODE
:
10219 case PLACEHOLDER_EXPR
:
10223 /* None of these have subtrees other than those already walked
10228 WALK_SUBTREE (TREE_VALUE (*tp
));
10229 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10234 int len
= TREE_VEC_LENGTH (*tp
);
10239 /* Walk all elements but the first. */
10241 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10243 /* Now walk the first one as a tail call. */
10244 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10248 WALK_SUBTREE (TREE_REALPART (*tp
));
10249 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10253 unsigned HOST_WIDE_INT idx
;
10254 constructor_elt
*ce
;
10257 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10259 WALK_SUBTREE (ce
->value
);
10264 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10269 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
10271 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10272 into declarations that are just mentioned, rather than
10273 declared; they don't really belong to this part of the tree.
10274 And, we can see cycles: the initializer for a declaration
10275 can refer to the declaration itself. */
10276 WALK_SUBTREE (DECL_INITIAL (decl
));
10277 WALK_SUBTREE (DECL_SIZE (decl
));
10278 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10280 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10283 case STATEMENT_LIST
:
10285 tree_stmt_iterator i
;
10286 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10287 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10292 switch (OMP_CLAUSE_CODE (*tp
))
10294 case OMP_CLAUSE_PRIVATE
:
10295 case OMP_CLAUSE_SHARED
:
10296 case OMP_CLAUSE_FIRSTPRIVATE
:
10297 case OMP_CLAUSE_COPYIN
:
10298 case OMP_CLAUSE_COPYPRIVATE
:
10299 case OMP_CLAUSE_IF
:
10300 case OMP_CLAUSE_NUM_THREADS
:
10301 case OMP_CLAUSE_SCHEDULE
:
10302 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10305 case OMP_CLAUSE_NOWAIT
:
10306 case OMP_CLAUSE_ORDERED
:
10307 case OMP_CLAUSE_DEFAULT
:
10308 case OMP_CLAUSE_UNTIED
:
10309 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10311 case OMP_CLAUSE_LASTPRIVATE
:
10312 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10313 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10314 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10316 case OMP_CLAUSE_COLLAPSE
:
10319 for (i
= 0; i
< 3; i
++)
10320 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10321 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10324 case OMP_CLAUSE_REDUCTION
:
10327 for (i
= 0; i
< 4; i
++)
10328 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10329 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10333 gcc_unreachable ();
10341 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10342 But, we only want to walk once. */
10343 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10344 for (i
= 0; i
< len
; ++i
)
10345 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10346 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10350 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10351 defining. We only want to walk into these fields of a type in this
10352 case and not in the general case of a mere reference to the type.
10354 The criterion is as follows: if the field can be an expression, it
10355 must be walked only here. This should be in keeping with the fields
10356 that are directly gimplified in gimplify_type_sizes in order for the
10357 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10358 variable-sized types.
10360 Note that DECLs get walked as part of processing the BIND_EXPR. */
10361 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10363 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10364 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10367 /* Call the function for the type. See if it returns anything or
10368 doesn't want us to continue. If we are to continue, walk both
10369 the normal fields and those for the declaration case. */
10370 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10371 if (result
|| !walk_subtrees
)
10374 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10378 /* If this is a record type, also walk the fields. */
10379 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10383 for (field
= TYPE_FIELDS (*type_p
); field
;
10384 field
= TREE_CHAIN (field
))
10386 /* We'd like to look at the type of the field, but we can
10387 easily get infinite recursion. So assume it's pointed
10388 to elsewhere in the tree. Also, ignore things that
10390 if (TREE_CODE (field
) != FIELD_DECL
)
10393 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10394 WALK_SUBTREE (DECL_SIZE (field
));
10395 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10396 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10397 WALK_SUBTREE (DECL_QUALIFIER (field
));
10401 /* Same for scalar types. */
10402 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10403 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10404 || TREE_CODE (*type_p
) == INTEGER_TYPE
10405 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10406 || TREE_CODE (*type_p
) == REAL_TYPE
)
10408 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10409 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10412 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10413 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10418 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10422 /* Walk over all the sub-trees of this operand. */
10423 len
= TREE_OPERAND_LENGTH (*tp
);
10425 /* Go through the subtrees. We need to do this in forward order so
10426 that the scope of a FOR_EXPR is handled properly. */
10429 for (i
= 0; i
< len
- 1; ++i
)
10430 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10431 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10434 /* If this is a type, walk the needed fields in the type. */
10435 else if (TYPE_P (*tp
))
10436 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10440 /* We didn't find what we were looking for. */
10443 #undef WALK_SUBTREE_TAIL
10445 #undef WALK_SUBTREE
10447 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10450 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10454 struct pointer_set_t
*pset
;
10456 pset
= pointer_set_create ();
10457 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10458 pointer_set_destroy (pset
);
10464 tree_block (tree t
)
10466 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10468 if (IS_EXPR_CODE_CLASS (c
))
10469 return &t
->exp
.block
;
10470 gcc_unreachable ();
10474 /* Create a nameless artificial label and put it in the current
10475 function context. The label has a location of LOC. Returns the
10476 newly created label. */
10479 create_artificial_label (location_t loc
)
10481 tree lab
= build_decl (loc
,
10482 LABEL_DECL
, NULL_TREE
, void_type_node
);
10484 DECL_ARTIFICIAL (lab
) = 1;
10485 DECL_IGNORED_P (lab
) = 1;
10486 DECL_CONTEXT (lab
) = current_function_decl
;
10490 /* Given a tree, try to return a useful variable name that we can use
10491 to prefix a temporary that is being assigned the value of the tree.
10492 I.E. given <temp> = &A, return A. */
10497 tree stripped_decl
;
10500 STRIP_NOPS (stripped_decl
);
10501 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10502 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10505 switch (TREE_CODE (stripped_decl
))
10508 return get_name (TREE_OPERAND (stripped_decl
, 0));
10515 /* Return true if TYPE has a variable argument list. */
10518 stdarg_p (tree fntype
)
10520 function_args_iterator args_iter
;
10521 tree n
= NULL_TREE
, t
;
10526 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10531 return n
!= NULL_TREE
&& n
!= void_type_node
;
10534 /* Return true if TYPE has a prototype. */
10537 prototype_p (tree fntype
)
10541 gcc_assert (fntype
!= NULL_TREE
);
10543 t
= TYPE_ARG_TYPES (fntype
);
10544 return (t
!= NULL_TREE
);
10547 /* If BLOCK is inlined from an __attribute__((__artificial__))
10548 routine, return pointer to location from where it has been
10551 block_nonartificial_location (tree block
)
10553 location_t
*ret
= NULL
;
10555 while (block
&& TREE_CODE (block
) == BLOCK
10556 && BLOCK_ABSTRACT_ORIGIN (block
))
10558 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10560 while (TREE_CODE (ao
) == BLOCK
10561 && BLOCK_ABSTRACT_ORIGIN (ao
)
10562 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10563 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10565 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10567 /* If AO is an artificial inline, point RET to the
10568 call site locus at which it has been inlined and continue
10569 the loop, in case AO's caller is also an artificial
10571 if (DECL_DECLARED_INLINE_P (ao
)
10572 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10573 ret
= &BLOCK_SOURCE_LOCATION (block
);
10577 else if (TREE_CODE (ao
) != BLOCK
)
10580 block
= BLOCK_SUPERCONTEXT (block
);
10586 /* If EXP is inlined from an __attribute__((__artificial__))
10587 function, return the location of the original call expression. */
10590 tree_nonartificial_location (tree exp
)
10592 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10597 return EXPR_LOCATION (exp
);
10601 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10604 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10607 cl_option_hash_hash (const void *x
)
10609 const_tree
const t
= (const_tree
) x
;
10613 hashval_t hash
= 0;
10615 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10617 p
= (const char *)TREE_OPTIMIZATION (t
);
10618 len
= sizeof (struct cl_optimization
);
10621 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10623 p
= (const char *)TREE_TARGET_OPTION (t
);
10624 len
= sizeof (struct cl_target_option
);
10628 gcc_unreachable ();
10630 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10632 for (i
= 0; i
< len
; i
++)
10634 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10639 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10640 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10644 cl_option_hash_eq (const void *x
, const void *y
)
10646 const_tree
const xt
= (const_tree
) x
;
10647 const_tree
const yt
= (const_tree
) y
;
10652 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10655 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10657 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10658 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10659 len
= sizeof (struct cl_optimization
);
10662 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10664 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10665 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10666 len
= sizeof (struct cl_target_option
);
10670 gcc_unreachable ();
10672 return (memcmp (xp
, yp
, len
) == 0);
10675 /* Build an OPTIMIZATION_NODE based on the current options. */
10678 build_optimization_node (void)
10683 /* Use the cache of optimization nodes. */
10685 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
));
10687 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10691 /* Insert this one into the hash table. */
10692 t
= cl_optimization_node
;
10695 /* Make a new node for next time round. */
10696 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10702 /* Build a TARGET_OPTION_NODE based on the current options. */
10705 build_target_option_node (void)
10710 /* Use the cache of optimization nodes. */
10712 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
));
10714 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10718 /* Insert this one into the hash table. */
10719 t
= cl_target_option_node
;
10722 /* Make a new node for next time round. */
10723 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10729 /* Determine the "ultimate origin" of a block. The block may be an inlined
10730 instance of an inlined instance of a block which is local to an inline
10731 function, so we have to trace all of the way back through the origin chain
10732 to find out what sort of node actually served as the original seed for the
10736 block_ultimate_origin (const_tree block
)
10738 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10740 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10741 nodes in the function to point to themselves; ignore that if
10742 we're trying to output the abstract instance of this function. */
10743 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10746 if (immediate_origin
== NULL_TREE
)
10751 tree lookahead
= immediate_origin
;
10755 ret_val
= lookahead
;
10756 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10757 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10759 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10761 /* The block's abstract origin chain may not be the *ultimate* origin of
10762 the block. It could lead to a DECL that has an abstract origin set.
10763 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10764 will give us if it has one). Note that DECL's abstract origins are
10765 supposed to be the most distant ancestor (or so decl_ultimate_origin
10766 claims), so we don't need to loop following the DECL origins. */
10767 if (DECL_P (ret_val
))
10768 return DECL_ORIGIN (ret_val
);
10774 /* Return true if T1 and T2 are equivalent lists. */
10777 list_equal_p (const_tree t1
, const_tree t2
)
10779 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10780 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10785 /* Return true iff conversion in EXP generates no instruction. Mark
10786 it inline so that we fully inline into the stripping functions even
10787 though we have two uses of this function. */
10790 tree_nop_conversion (const_tree exp
)
10792 tree outer_type
, inner_type
;
10794 if (!CONVERT_EXPR_P (exp
)
10795 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10797 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10800 outer_type
= TREE_TYPE (exp
);
10801 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10806 /* Use precision rather then machine mode when we can, which gives
10807 the correct answer even for submode (bit-field) types. */
10808 if ((INTEGRAL_TYPE_P (outer_type
)
10809 || POINTER_TYPE_P (outer_type
)
10810 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10811 && (INTEGRAL_TYPE_P (inner_type
)
10812 || POINTER_TYPE_P (inner_type
)
10813 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10814 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10816 /* Otherwise fall back on comparing machine modes (e.g. for
10817 aggregate types, floats). */
10818 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10821 /* Return true iff conversion in EXP generates no instruction. Don't
10822 consider conversions changing the signedness. */
10825 tree_sign_nop_conversion (const_tree exp
)
10827 tree outer_type
, inner_type
;
10829 if (!tree_nop_conversion (exp
))
10832 outer_type
= TREE_TYPE (exp
);
10833 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10835 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10836 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10839 /* Strip conversions from EXP according to tree_nop_conversion and
10840 return the resulting expression. */
10843 tree_strip_nop_conversions (tree exp
)
10845 while (tree_nop_conversion (exp
))
10846 exp
= TREE_OPERAND (exp
, 0);
10850 /* Strip conversions from EXP according to tree_sign_nop_conversion
10851 and return the resulting expression. */
10854 tree_strip_sign_nop_conversions (tree exp
)
10856 while (tree_sign_nop_conversion (exp
))
10857 exp
= TREE_OPERAND (exp
, 0);
10861 static GTY(()) tree gcc_eh_personality_decl
;
10863 /* Return the GCC personality function decl. */
10866 lhd_gcc_personality (void)
10868 if (!gcc_eh_personality_decl
)
10869 gcc_eh_personality_decl
10870 = build_personality_function (USING_SJLJ_EXCEPTIONS
10871 ? "__gcc_personality_sj0"
10872 : "__gcc_personality_v0");
10874 return gcc_eh_personality_decl
;
10877 /* Try to find a base info of BINFO that would have its field decl at offset
10878 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10879 found, return, otherwise return NULL_TREE. */
10882 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
10889 type
= TREE_TYPE (binfo
);
10892 tree base_binfo
, found_binfo
;
10893 HOST_WIDE_INT pos
, size
;
10897 if (TREE_CODE (type
) != RECORD_TYPE
)
10900 for (fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
10902 if (TREE_CODE (fld
) != FIELD_DECL
)
10905 pos
= int_bit_position (fld
);
10906 size
= tree_low_cst (DECL_SIZE (fld
), 1);
10907 if (pos
<= offset
&& (pos
+ size
) > offset
)
10913 found_binfo
= NULL_TREE
;
10914 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
10915 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
10917 found_binfo
= base_binfo
;
10924 type
= TREE_TYPE (fld
);
10925 binfo
= found_binfo
;
10928 if (type
!= expected_type
)
10933 /* Returns true if X is a typedef decl. */
10936 is_typedef_decl (tree x
)
10938 return (x
&& TREE_CODE (x
) == TYPE_DECL
10939 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
10942 /* Returns true iff TYPE is a type variant created for a typedef. */
10945 typedef_variant_p (tree type
)
10947 return is_typedef_decl (TYPE_NAME (type
));
10950 #include "gt-tree.h"