1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011 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"
44 #include "filenames.h"
47 #include "langhooks.h"
48 #include "tree-inline.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
54 #include "tree-pass.h"
55 #include "langhooks-def.h"
56 #include "diagnostic.h"
57 #include "tree-diagnostic.h"
58 #include "tree-pretty-print.h"
65 /* Tree code classes. */
67 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
68 #define END_OF_BASE_TREE_CODES tcc_exceptional,
70 const enum tree_code_class tree_code_type
[] = {
71 #include "all-tree.def"
75 #undef END_OF_BASE_TREE_CODES
77 /* Table indexed by tree code giving number of expression
78 operands beyond the fixed part of the node structure.
79 Not used for types or decls. */
81 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
82 #define END_OF_BASE_TREE_CODES 0,
84 const unsigned char tree_code_length
[] = {
85 #include "all-tree.def"
89 #undef END_OF_BASE_TREE_CODES
91 /* Names of tree components.
92 Used for printing out the tree and error messages. */
93 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
94 #define END_OF_BASE_TREE_CODES "@dummy",
96 const char *const tree_code_name
[] = {
97 #include "all-tree.def"
101 #undef END_OF_BASE_TREE_CODES
103 /* Each tree code class has an associated string representation.
104 These must correspond to the tree_code_class entries. */
106 const char *const tree_code_class_strings
[] =
121 /* obstack.[ch] explicitly declined to prototype this. */
122 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
124 #ifdef GATHER_STATISTICS
125 /* Statistics-gathering stuff. */
127 int tree_node_counts
[(int) all_kinds
];
128 int tree_node_sizes
[(int) all_kinds
];
130 /* Keep in sync with tree.h:enum tree_node_kind. */
131 static const char * const tree_node_kind_names
[] = {
149 #endif /* GATHER_STATISTICS */
151 /* Unique id for next decl created. */
152 static GTY(()) int next_decl_uid
;
153 /* Unique id for next type created. */
154 static GTY(()) int next_type_uid
= 1;
155 /* Unique id for next debug decl created. Use negative numbers,
156 to catch erroneous uses. */
157 static GTY(()) int next_debug_decl_uid
;
159 /* Since we cannot rehash a type after it is in the table, we have to
160 keep the hash code. */
162 struct GTY(()) type_hash
{
167 /* Initial size of the hash table (rounded to next prime). */
168 #define TYPE_HASH_INITIAL_SIZE 1000
170 /* Now here is the hash table. When recording a type, it is added to
171 the slot whose index is the hash code. Note that the hash table is
172 used for several kinds of types (function types, array types and
173 array index range types, for now). While all these live in the
174 same table, they are completely independent, and the hash code is
175 computed differently for each of these. */
177 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
178 htab_t type_hash_table
;
180 /* Hash table and temporary node for larger integer const values. */
181 static GTY (()) tree int_cst_node
;
182 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
183 htab_t int_cst_hash_table
;
185 /* Hash table for optimization flags and target option flags. Use the same
186 hash table for both sets of options. Nodes for building the current
187 optimization and target option nodes. The assumption is most of the time
188 the options created will already be in the hash table, so we avoid
189 allocating and freeing up a node repeatably. */
190 static GTY (()) tree cl_optimization_node
;
191 static GTY (()) tree cl_target_option_node
;
192 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
193 htab_t cl_option_hash_table
;
195 /* General tree->tree mapping structure for use in hash tables. */
198 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
199 htab_t debug_expr_for_decl
;
201 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
202 htab_t value_expr_for_decl
;
204 static GTY ((if_marked ("tree_priority_map_marked_p"),
205 param_is (struct tree_priority_map
)))
206 htab_t init_priority_for_decl
;
208 static void set_type_quals (tree
, int);
209 static int type_hash_eq (const void *, const void *);
210 static hashval_t
type_hash_hash (const void *);
211 static hashval_t
int_cst_hash_hash (const void *);
212 static int int_cst_hash_eq (const void *, const void *);
213 static hashval_t
cl_option_hash_hash (const void *);
214 static int cl_option_hash_eq (const void *, const void *);
215 static void print_type_hash_statistics (void);
216 static void print_debug_expr_statistics (void);
217 static void print_value_expr_statistics (void);
218 static int type_hash_marked_p (const void *);
219 static unsigned int type_hash_list (const_tree
, hashval_t
);
220 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
222 tree global_trees
[TI_MAX
];
223 tree integer_types
[itk_none
];
225 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
227 /* Number of operands for each OpenMP clause. */
228 unsigned const char omp_clause_num_ops
[] =
230 0, /* OMP_CLAUSE_ERROR */
231 1, /* OMP_CLAUSE_PRIVATE */
232 1, /* OMP_CLAUSE_SHARED */
233 1, /* OMP_CLAUSE_FIRSTPRIVATE */
234 2, /* OMP_CLAUSE_LASTPRIVATE */
235 4, /* OMP_CLAUSE_REDUCTION */
236 1, /* OMP_CLAUSE_COPYIN */
237 1, /* OMP_CLAUSE_COPYPRIVATE */
238 1, /* OMP_CLAUSE_IF */
239 1, /* OMP_CLAUSE_NUM_THREADS */
240 1, /* OMP_CLAUSE_SCHEDULE */
241 0, /* OMP_CLAUSE_NOWAIT */
242 0, /* OMP_CLAUSE_ORDERED */
243 0, /* OMP_CLAUSE_DEFAULT */
244 3, /* OMP_CLAUSE_COLLAPSE */
245 0 /* OMP_CLAUSE_UNTIED */
248 const char * const omp_clause_code_name
[] =
269 /* Return the tree node structure used by tree code CODE. */
271 static inline enum tree_node_structure_enum
272 tree_node_structure_for_code (enum tree_code code
)
274 switch (TREE_CODE_CLASS (code
))
276 case tcc_declaration
:
281 return TS_FIELD_DECL
;
287 return TS_LABEL_DECL
;
289 return TS_RESULT_DECL
;
290 case DEBUG_EXPR_DECL
:
293 return TS_CONST_DECL
;
297 return TS_FUNCTION_DECL
;
298 case TRANSLATION_UNIT_DECL
:
299 return TS_TRANSLATION_UNIT_DECL
;
301 return TS_DECL_NON_COMMON
;
314 default: /* tcc_constant and tcc_exceptional */
319 /* tcc_constant cases. */
320 case INTEGER_CST
: return TS_INT_CST
;
321 case REAL_CST
: return TS_REAL_CST
;
322 case FIXED_CST
: return TS_FIXED_CST
;
323 case COMPLEX_CST
: return TS_COMPLEX
;
324 case VECTOR_CST
: return TS_VECTOR
;
325 case STRING_CST
: return TS_STRING
;
326 /* tcc_exceptional cases. */
327 case ERROR_MARK
: return TS_COMMON
;
328 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
329 case TREE_LIST
: return TS_LIST
;
330 case TREE_VEC
: return TS_VEC
;
331 case SSA_NAME
: return TS_SSA_NAME
;
332 case PLACEHOLDER_EXPR
: return TS_COMMON
;
333 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
334 case BLOCK
: return TS_BLOCK
;
335 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
336 case TREE_BINFO
: return TS_BINFO
;
337 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
338 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
339 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
347 /* Initialize tree_contains_struct to describe the hierarchy of tree
351 initialize_tree_contains_struct (void)
355 #define MARK_TS_BASE(C) \
357 tree_contains_struct[C][TS_BASE] = 1; \
360 #define MARK_TS_COMMON(C) \
363 tree_contains_struct[C][TS_COMMON] = 1; \
366 #define MARK_TS_DECL_MINIMAL(C) \
368 MARK_TS_COMMON (C); \
369 tree_contains_struct[C][TS_DECL_MINIMAL] = 1; \
372 #define MARK_TS_DECL_COMMON(C) \
374 MARK_TS_DECL_MINIMAL (C); \
375 tree_contains_struct[C][TS_DECL_COMMON] = 1; \
378 #define MARK_TS_DECL_WRTL(C) \
380 MARK_TS_DECL_COMMON (C); \
381 tree_contains_struct[C][TS_DECL_WRTL] = 1; \
384 #define MARK_TS_DECL_WITH_VIS(C) \
386 MARK_TS_DECL_WRTL (C); \
387 tree_contains_struct[C][TS_DECL_WITH_VIS] = 1; \
390 #define MARK_TS_DECL_NON_COMMON(C) \
392 MARK_TS_DECL_WITH_VIS (C); \
393 tree_contains_struct[C][TS_DECL_NON_COMMON] = 1; \
396 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
399 enum tree_node_structure_enum ts_code
;
401 code
= (enum tree_code
) i
;
402 ts_code
= tree_node_structure_for_code (code
);
404 /* Mark the TS structure itself. */
405 tree_contains_struct
[code
][ts_code
] = 1;
407 /* Mark all the structures that TS is derived from. */
421 case TS_DECL_MINIMAL
:
429 case TS_STATEMENT_LIST
:
432 case TS_OPTIMIZATION
:
433 case TS_TARGET_OPTION
:
434 MARK_TS_COMMON (code
);
438 MARK_TS_DECL_MINIMAL (code
);
443 MARK_TS_DECL_COMMON (code
);
446 case TS_DECL_NON_COMMON
:
447 MARK_TS_DECL_WITH_VIS (code
);
450 case TS_DECL_WITH_VIS
:
454 MARK_TS_DECL_WRTL (code
);
458 MARK_TS_DECL_COMMON (code
);
462 MARK_TS_DECL_WITH_VIS (code
);
466 case TS_FUNCTION_DECL
:
467 MARK_TS_DECL_NON_COMMON (code
);
470 case TS_TRANSLATION_UNIT_DECL
:
471 MARK_TS_DECL_COMMON (code
);
479 /* Basic consistency checks for attributes used in fold. */
480 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
481 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
482 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
483 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
484 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
485 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
486 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
487 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
488 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
489 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
490 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
491 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
492 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
493 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
494 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
495 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
496 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
498 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
499 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
500 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
502 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
503 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
504 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
505 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
506 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
507 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
508 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
509 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
510 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
511 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
512 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
513 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
514 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
515 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
516 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
517 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
520 #undef MARK_TS_COMMON
521 #undef MARK_TS_DECL_MINIMAL
522 #undef MARK_TS_DECL_COMMON
523 #undef MARK_TS_DECL_WRTL
524 #undef MARK_TS_DECL_WITH_VIS
525 #undef MARK_TS_DECL_NON_COMMON
534 /* Initialize the hash table of types. */
535 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
538 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
539 tree_decl_map_eq
, 0);
541 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
542 tree_decl_map_eq
, 0);
543 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
544 tree_priority_map_eq
, 0);
546 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
547 int_cst_hash_eq
, NULL
);
549 int_cst_node
= make_node (INTEGER_CST
);
551 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
552 cl_option_hash_eq
, NULL
);
554 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
555 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
557 /* Initialize the tree_contains_struct array. */
558 initialize_tree_contains_struct ();
559 lang_hooks
.init_ts ();
563 /* The name of the object as the assembler will see it (but before any
564 translations made by ASM_OUTPUT_LABELREF). Often this is the same
565 as DECL_NAME. It is an IDENTIFIER_NODE. */
567 decl_assembler_name (tree decl
)
569 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
570 lang_hooks
.set_decl_assembler_name (decl
);
571 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
574 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
577 decl_assembler_name_equal (tree decl
, const_tree asmname
)
579 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
580 const char *decl_str
;
581 const char *asmname_str
;
584 if (decl_asmname
== asmname
)
587 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
588 asmname_str
= IDENTIFIER_POINTER (asmname
);
591 /* If the target assembler name was set by the user, things are trickier.
592 We have a leading '*' to begin with. After that, it's arguable what
593 is the correct thing to do with -fleading-underscore. Arguably, we've
594 historically been doing the wrong thing in assemble_alias by always
595 printing the leading underscore. Since we're not changing that, make
596 sure user_label_prefix follows the '*' before matching. */
597 if (decl_str
[0] == '*')
599 size_t ulp_len
= strlen (user_label_prefix
);
605 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
606 decl_str
+= ulp_len
, test
=true;
610 if (asmname_str
[0] == '*')
612 size_t ulp_len
= strlen (user_label_prefix
);
618 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
619 asmname_str
+= ulp_len
, test
=true;
626 return strcmp (decl_str
, asmname_str
) == 0;
629 /* Hash asmnames ignoring the user specified marks. */
632 decl_assembler_name_hash (const_tree asmname
)
634 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
636 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
637 size_t ulp_len
= strlen (user_label_prefix
);
641 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
644 return htab_hash_string (decl_str
);
647 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
650 /* Compute the number of bytes occupied by a tree with code CODE.
651 This function cannot be used for nodes that have variable sizes,
652 including TREE_VEC, STRING_CST, and CALL_EXPR. */
654 tree_code_size (enum tree_code code
)
656 switch (TREE_CODE_CLASS (code
))
658 case tcc_declaration
: /* A decl node */
663 return sizeof (struct tree_field_decl
);
665 return sizeof (struct tree_parm_decl
);
667 return sizeof (struct tree_var_decl
);
669 return sizeof (struct tree_label_decl
);
671 return sizeof (struct tree_result_decl
);
673 return sizeof (struct tree_const_decl
);
675 return sizeof (struct tree_type_decl
);
677 return sizeof (struct tree_function_decl
);
678 case DEBUG_EXPR_DECL
:
679 return sizeof (struct tree_decl_with_rtl
);
681 return sizeof (struct tree_decl_non_common
);
685 case tcc_type
: /* a type node */
686 return sizeof (struct tree_type
);
688 case tcc_reference
: /* a reference */
689 case tcc_expression
: /* an expression */
690 case tcc_statement
: /* an expression with side effects */
691 case tcc_comparison
: /* a comparison expression */
692 case tcc_unary
: /* a unary arithmetic expression */
693 case tcc_binary
: /* a binary arithmetic expression */
694 return (sizeof (struct tree_exp
)
695 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
697 case tcc_constant
: /* a constant */
700 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
701 case REAL_CST
: return sizeof (struct tree_real_cst
);
702 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
703 case COMPLEX_CST
: return sizeof (struct tree_complex
);
704 case VECTOR_CST
: return sizeof (struct tree_vector
);
705 case STRING_CST
: gcc_unreachable ();
707 return lang_hooks
.tree_size (code
);
710 case tcc_exceptional
: /* something random, like an identifier. */
713 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
714 case TREE_LIST
: return sizeof (struct tree_list
);
717 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
720 case OMP_CLAUSE
: gcc_unreachable ();
722 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
724 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
725 case BLOCK
: return sizeof (struct tree_block
);
726 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
727 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
728 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
731 return lang_hooks
.tree_size (code
);
739 /* Compute the number of bytes occupied by NODE. This routine only
740 looks at TREE_CODE, except for those nodes that have variable sizes. */
742 tree_size (const_tree node
)
744 const enum tree_code code
= TREE_CODE (node
);
748 return (offsetof (struct tree_binfo
, base_binfos
)
749 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
752 return (sizeof (struct tree_vec
)
753 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
756 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
759 return (sizeof (struct tree_omp_clause
)
760 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
764 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
765 return (sizeof (struct tree_exp
)
766 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
768 return tree_code_size (code
);
772 /* Record interesting allocation statistics for a tree node with CODE
776 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
777 size_t length ATTRIBUTE_UNUSED
)
779 #ifdef GATHER_STATISTICS
780 enum tree_code_class type
= TREE_CODE_CLASS (code
);
785 case tcc_declaration
: /* A decl node */
789 case tcc_type
: /* a type node */
793 case tcc_statement
: /* an expression with side effects */
797 case tcc_reference
: /* a reference */
801 case tcc_expression
: /* an expression */
802 case tcc_comparison
: /* a comparison expression */
803 case tcc_unary
: /* a unary arithmetic expression */
804 case tcc_binary
: /* a binary arithmetic expression */
808 case tcc_constant
: /* a constant */
812 case tcc_exceptional
: /* something random, like an identifier. */
815 case IDENTIFIER_NODE
:
828 kind
= ssa_name_kind
;
840 kind
= omp_clause_kind
;
857 tree_node_counts
[(int) kind
]++;
858 tree_node_sizes
[(int) kind
] += length
;
862 /* Return a newly allocated node of code CODE. For decl and type
863 nodes, some other fields are initialized. The rest of the node is
864 initialized to zero. This function cannot be used for TREE_VEC or
865 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
867 Achoo! I got a code in the node. */
870 make_node_stat (enum tree_code code MEM_STAT_DECL
)
873 enum tree_code_class type
= TREE_CODE_CLASS (code
);
874 size_t length
= tree_code_size (code
);
876 record_node_allocation_statistics (code
, length
);
878 t
= ggc_alloc_zone_cleared_tree_node_stat (
879 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
880 length PASS_MEM_STAT
);
881 TREE_SET_CODE (t
, code
);
886 TREE_SIDE_EFFECTS (t
) = 1;
889 case tcc_declaration
:
890 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
892 if (code
== FUNCTION_DECL
)
894 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
895 DECL_MODE (t
) = FUNCTION_MODE
;
900 DECL_SOURCE_LOCATION (t
) = input_location
;
901 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
902 DECL_UID (t
) = --next_debug_decl_uid
;
905 DECL_UID (t
) = next_decl_uid
++;
906 SET_DECL_PT_UID (t
, -1);
908 if (TREE_CODE (t
) == LABEL_DECL
)
909 LABEL_DECL_UID (t
) = -1;
914 TYPE_UID (t
) = next_type_uid
++;
915 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
916 TYPE_USER_ALIGN (t
) = 0;
917 TYPE_MAIN_VARIANT (t
) = t
;
918 TYPE_CANONICAL (t
) = t
;
920 /* Default to no attributes for type, but let target change that. */
921 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
922 targetm
.set_default_type_attributes (t
);
924 /* We have not yet computed the alias set for this type. */
925 TYPE_ALIAS_SET (t
) = -1;
929 TREE_CONSTANT (t
) = 1;
938 case PREDECREMENT_EXPR
:
939 case PREINCREMENT_EXPR
:
940 case POSTDECREMENT_EXPR
:
941 case POSTINCREMENT_EXPR
:
942 /* All of these have side-effects, no matter what their
944 TREE_SIDE_EFFECTS (t
) = 1;
953 /* Other classes need no special treatment. */
960 /* Return a new node with the same contents as NODE except that its
961 TREE_CHAIN is zero and it has a fresh uid. */
964 copy_node_stat (tree node MEM_STAT_DECL
)
967 enum tree_code code
= TREE_CODE (node
);
970 gcc_assert (code
!= STATEMENT_LIST
);
972 length
= tree_size (node
);
973 record_node_allocation_statistics (code
, length
);
974 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
975 memcpy (t
, node
, length
);
978 TREE_ASM_WRITTEN (t
) = 0;
979 TREE_VISITED (t
) = 0;
980 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
981 *DECL_VAR_ANN_PTR (t
) = 0;
983 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
985 if (code
== DEBUG_EXPR_DECL
)
986 DECL_UID (t
) = --next_debug_decl_uid
;
989 DECL_UID (t
) = next_decl_uid
++;
990 if (DECL_PT_UID_SET_P (node
))
991 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
993 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
994 && DECL_HAS_VALUE_EXPR_P (node
))
996 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
997 DECL_HAS_VALUE_EXPR_P (t
) = 1;
999 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1001 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1002 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1005 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1007 TYPE_UID (t
) = next_type_uid
++;
1008 /* The following is so that the debug code for
1009 the copy is different from the original type.
1010 The two statements usually duplicate each other
1011 (because they clear fields of the same union),
1012 but the optimizer should catch that. */
1013 TYPE_SYMTAB_POINTER (t
) = 0;
1014 TYPE_SYMTAB_ADDRESS (t
) = 0;
1016 /* Do not copy the values cache. */
1017 if (TYPE_CACHED_VALUES_P(t
))
1019 TYPE_CACHED_VALUES_P (t
) = 0;
1020 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1027 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1028 For example, this can copy a list made of TREE_LIST nodes. */
1031 copy_list (tree list
)
1039 head
= prev
= copy_node (list
);
1040 next
= TREE_CHAIN (list
);
1043 TREE_CHAIN (prev
) = copy_node (next
);
1044 prev
= TREE_CHAIN (prev
);
1045 next
= TREE_CHAIN (next
);
1051 /* Create an INT_CST node with a LOW value sign extended. */
1054 build_int_cst (tree type
, HOST_WIDE_INT low
)
1056 /* Support legacy code. */
1058 type
= integer_type_node
;
1060 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
1063 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
1064 if it is negative. This function is similar to build_int_cst, but
1065 the extra bits outside of the type precision are cleared. Constants
1066 with these extra bits may confuse the fold so that it detects overflows
1067 even in cases when they do not occur, and in general should be avoided.
1068 We cannot however make this a default behavior of build_int_cst without
1069 more intrusive changes, since there are parts of gcc that rely on the extra
1070 precision of the integer constants. */
1073 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1077 return double_int_to_tree (type
, shwi_to_double_int (low
));
1080 /* Constructs tree in type TYPE from with value given by CST. Signedness
1081 of CST is assumed to be the same as the signedness of TYPE. */
1084 double_int_to_tree (tree type
, double_int cst
)
1086 /* Size types *are* sign extended. */
1087 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1088 || (TREE_CODE (type
) == INTEGER_TYPE
1089 && TYPE_IS_SIZETYPE (type
)));
1091 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1093 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1096 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1097 to be the same as the signedness of TYPE. */
1100 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1102 /* Size types *are* sign extended. */
1103 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1104 || (TREE_CODE (type
) == INTEGER_TYPE
1105 && TYPE_IS_SIZETYPE (type
)));
1108 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1110 return double_int_equal_p (cst
, ext
);
1113 /* We force the double_int CST to the range of the type TYPE by sign or
1114 zero extending it. OVERFLOWABLE indicates if we are interested in
1115 overflow of the value, when >0 we are only interested in signed
1116 overflow, for <0 we are interested in any overflow. OVERFLOWED
1117 indicates whether overflow has already occurred. CONST_OVERFLOWED
1118 indicates whether constant overflow has already occurred. We force
1119 T's value to be within range of T's type (by setting to 0 or 1 all
1120 the bits outside the type's range). We set TREE_OVERFLOWED if,
1121 OVERFLOWED is nonzero,
1122 or OVERFLOWABLE is >0 and signed overflow occurs
1123 or OVERFLOWABLE is <0 and any overflow occurs
1124 We return a new tree node for the extended double_int. The node
1125 is shared if no overflow flags are set. */
1129 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1132 bool sign_extended_type
;
1134 /* Size types *are* sign extended. */
1135 sign_extended_type
= (!TYPE_UNSIGNED (type
)
1136 || (TREE_CODE (type
) == INTEGER_TYPE
1137 && TYPE_IS_SIZETYPE (type
)));
1139 /* If we need to set overflow flags, return a new unshared node. */
1140 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1144 || (overflowable
> 0 && sign_extended_type
))
1146 tree t
= make_node (INTEGER_CST
);
1147 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1148 !sign_extended_type
);
1149 TREE_TYPE (t
) = type
;
1150 TREE_OVERFLOW (t
) = 1;
1155 /* Else build a shared node. */
1156 return double_int_to_tree (type
, cst
);
1159 /* These are the hash table functions for the hash table of INTEGER_CST
1160 nodes of a sizetype. */
1162 /* Return the hash code code X, an INTEGER_CST. */
1165 int_cst_hash_hash (const void *x
)
1167 const_tree
const t
= (const_tree
) x
;
1169 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1170 ^ htab_hash_pointer (TREE_TYPE (t
)));
1173 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1174 is the same as that given by *Y, which is the same. */
1177 int_cst_hash_eq (const void *x
, const void *y
)
1179 const_tree
const xt
= (const_tree
) x
;
1180 const_tree
const yt
= (const_tree
) y
;
1182 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1183 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1184 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1187 /* Create an INT_CST node of TYPE and value HI:LOW.
1188 The returned node is always shared. For small integers we use a
1189 per-type vector cache, for larger ones we use a single hash table. */
1192 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1200 switch (TREE_CODE (type
))
1203 gcc_assert (hi
== 0 && low
== 0);
1207 case REFERENCE_TYPE
:
1208 /* Cache NULL pointer. */
1217 /* Cache false or true. */
1225 if (TYPE_UNSIGNED (type
))
1228 limit
= INTEGER_SHARE_LIMIT
;
1229 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1235 limit
= INTEGER_SHARE_LIMIT
+ 1;
1236 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1238 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1252 /* Look for it in the type's vector of small shared ints. */
1253 if (!TYPE_CACHED_VALUES_P (type
))
1255 TYPE_CACHED_VALUES_P (type
) = 1;
1256 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1259 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1262 /* Make sure no one is clobbering the shared constant. */
1263 gcc_assert (TREE_TYPE (t
) == type
);
1264 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1265 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1269 /* Create a new shared int. */
1270 t
= make_node (INTEGER_CST
);
1272 TREE_INT_CST_LOW (t
) = low
;
1273 TREE_INT_CST_HIGH (t
) = hi
;
1274 TREE_TYPE (t
) = type
;
1276 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1281 /* Use the cache of larger shared ints. */
1284 TREE_INT_CST_LOW (int_cst_node
) = low
;
1285 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1286 TREE_TYPE (int_cst_node
) = type
;
1288 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1292 /* Insert this one into the hash table. */
1295 /* Make a new node for next time round. */
1296 int_cst_node
= make_node (INTEGER_CST
);
1303 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1304 and the rest are zeros. */
1307 build_low_bits_mask (tree type
, unsigned bits
)
1311 gcc_assert (bits
<= TYPE_PRECISION (type
));
1313 if (bits
== TYPE_PRECISION (type
)
1314 && !TYPE_UNSIGNED (type
))
1315 /* Sign extended all-ones mask. */
1316 mask
= double_int_minus_one
;
1318 mask
= double_int_mask (bits
);
1320 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1323 /* Checks that X is integer constant that can be expressed in (unsigned)
1324 HOST_WIDE_INT without loss of precision. */
1327 cst_and_fits_in_hwi (const_tree x
)
1329 if (TREE_CODE (x
) != INTEGER_CST
)
1332 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1335 return (TREE_INT_CST_HIGH (x
) == 0
1336 || TREE_INT_CST_HIGH (x
) == -1);
1339 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1340 are in a list pointed to by VALS. */
1343 build_vector (tree type
, tree vals
)
1345 tree v
= make_node (VECTOR_CST
);
1350 TREE_VECTOR_CST_ELTS (v
) = vals
;
1351 TREE_TYPE (v
) = type
;
1353 /* Iterate through elements and check for overflow. */
1354 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1356 tree value
= TREE_VALUE (link
);
1359 /* Don't crash if we get an address constant. */
1360 if (!CONSTANT_CLASS_P (value
))
1363 over
|= TREE_OVERFLOW (value
);
1366 gcc_assert (cnt
== TYPE_VECTOR_SUBPARTS (type
));
1368 TREE_OVERFLOW (v
) = over
;
1372 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1373 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1376 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1378 tree list
= NULL_TREE
;
1379 unsigned HOST_WIDE_INT idx
;
1382 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1383 list
= tree_cons (NULL_TREE
, value
, list
);
1384 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1385 list
= tree_cons (NULL_TREE
,
1386 build_zero_cst (TREE_TYPE (type
)), list
);
1387 return build_vector (type
, nreverse (list
));
1390 /* Build a vector of type VECTYPE where all the elements are SCs. */
1392 build_vector_from_val (tree vectype
, tree sc
)
1394 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1395 VEC(constructor_elt
, gc
) *v
= NULL
;
1397 if (sc
== error_mark_node
)
1400 /* Verify that the vector type is suitable for SC. Note that there
1401 is some inconsistency in the type-system with respect to restrict
1402 qualifications of pointers. Vector types always have a main-variant
1403 element type and the qualification is applied to the vector-type.
1404 So TREE_TYPE (vector-type) does not return a properly qualified
1405 vector element-type. */
1406 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1407 TREE_TYPE (vectype
)));
1409 v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1410 for (i
= 0; i
< nunits
; ++i
)
1411 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1413 if (CONSTANT_CLASS_P (sc
))
1414 return build_vector_from_ctor (vectype
, v
);
1416 return build_constructor (vectype
, v
);
1419 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1420 are in the VEC pointed to by VALS. */
1422 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1424 tree c
= make_node (CONSTRUCTOR
);
1426 constructor_elt
*elt
;
1427 bool constant_p
= true;
1429 TREE_TYPE (c
) = type
;
1430 CONSTRUCTOR_ELTS (c
) = vals
;
1432 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1433 if (!TREE_CONSTANT (elt
->value
))
1439 TREE_CONSTANT (c
) = constant_p
;
1444 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1447 build_constructor_single (tree type
, tree index
, tree value
)
1449 VEC(constructor_elt
,gc
) *v
;
1450 constructor_elt
*elt
;
1452 v
= VEC_alloc (constructor_elt
, gc
, 1);
1453 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1457 return build_constructor (type
, v
);
1461 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1462 are in a list pointed to by VALS. */
1464 build_constructor_from_list (tree type
, tree vals
)
1467 VEC(constructor_elt
,gc
) *v
= NULL
;
1471 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1472 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1473 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1476 return build_constructor (type
, v
);
1479 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1482 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1485 FIXED_VALUE_TYPE
*fp
;
1487 v
= make_node (FIXED_CST
);
1488 fp
= ggc_alloc_fixed_value ();
1489 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1491 TREE_TYPE (v
) = type
;
1492 TREE_FIXED_CST_PTR (v
) = fp
;
1496 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1499 build_real (tree type
, REAL_VALUE_TYPE d
)
1502 REAL_VALUE_TYPE
*dp
;
1505 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1506 Consider doing it via real_convert now. */
1508 v
= make_node (REAL_CST
);
1509 dp
= ggc_alloc_real_value ();
1510 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1512 TREE_TYPE (v
) = type
;
1513 TREE_REAL_CST_PTR (v
) = dp
;
1514 TREE_OVERFLOW (v
) = overflow
;
1518 /* Return a new REAL_CST node whose type is TYPE
1519 and whose value is the integer value of the INTEGER_CST node I. */
1522 real_value_from_int_cst (const_tree type
, const_tree i
)
1526 /* Clear all bits of the real value type so that we can later do
1527 bitwise comparisons to see if two values are the same. */
1528 memset (&d
, 0, sizeof d
);
1530 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1531 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1532 TYPE_UNSIGNED (TREE_TYPE (i
)));
1536 /* Given a tree representing an integer constant I, return a tree
1537 representing the same value as a floating-point constant of type TYPE. */
1540 build_real_from_int_cst (tree type
, const_tree i
)
1543 int overflow
= TREE_OVERFLOW (i
);
1545 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1547 TREE_OVERFLOW (v
) |= overflow
;
1551 /* Return a newly constructed STRING_CST node whose value is
1552 the LEN characters at STR.
1553 The TREE_TYPE is not initialized. */
1556 build_string (int len
, const char *str
)
1561 /* Do not waste bytes provided by padding of struct tree_string. */
1562 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1564 record_node_allocation_statistics (STRING_CST
, length
);
1566 s
= ggc_alloc_tree_node (length
);
1568 memset (s
, 0, sizeof (struct tree_common
));
1569 TREE_SET_CODE (s
, STRING_CST
);
1570 TREE_CONSTANT (s
) = 1;
1571 TREE_STRING_LENGTH (s
) = len
;
1572 memcpy (s
->string
.str
, str
, len
);
1573 s
->string
.str
[len
] = '\0';
1578 /* Return a newly constructed COMPLEX_CST node whose value is
1579 specified by the real and imaginary parts REAL and IMAG.
1580 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1581 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1584 build_complex (tree type
, tree real
, tree imag
)
1586 tree t
= make_node (COMPLEX_CST
);
1588 TREE_REALPART (t
) = real
;
1589 TREE_IMAGPART (t
) = imag
;
1590 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1591 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1595 /* Return a constant of arithmetic type TYPE which is the
1596 multiplicative identity of the set TYPE. */
1599 build_one_cst (tree type
)
1601 switch (TREE_CODE (type
))
1603 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1604 case POINTER_TYPE
: case REFERENCE_TYPE
:
1606 return build_int_cst (type
, 1);
1609 return build_real (type
, dconst1
);
1611 case FIXED_POINT_TYPE
:
1612 /* We can only generate 1 for accum types. */
1613 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1614 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1618 tree scalar
= build_one_cst (TREE_TYPE (type
));
1620 return build_vector_from_val (type
, scalar
);
1624 return build_complex (type
,
1625 build_one_cst (TREE_TYPE (type
)),
1626 build_zero_cst (TREE_TYPE (type
)));
1633 /* Build 0 constant of type TYPE. This is used by constructor folding
1634 and thus the constant should be represented in memory by
1638 build_zero_cst (tree type
)
1640 switch (TREE_CODE (type
))
1642 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1643 case POINTER_TYPE
: case REFERENCE_TYPE
:
1645 return build_int_cst (type
, 0);
1648 return build_real (type
, dconst0
);
1650 case FIXED_POINT_TYPE
:
1651 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1655 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1657 return build_vector_from_val (type
, scalar
);
1662 tree zero
= build_zero_cst (TREE_TYPE (type
));
1664 return build_complex (type
, zero
, zero
);
1668 if (!AGGREGATE_TYPE_P (type
))
1669 return fold_convert (type
, integer_zero_node
);
1670 return build_constructor (type
, NULL
);
1675 /* Build a BINFO with LEN language slots. */
1678 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1681 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1682 + VEC_embedded_size (tree
, base_binfos
));
1684 record_node_allocation_statistics (TREE_BINFO
, length
);
1686 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1688 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1690 TREE_SET_CODE (t
, TREE_BINFO
);
1692 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1698 /* Build a newly constructed TREE_VEC node of length LEN. */
1701 make_tree_vec_stat (int len MEM_STAT_DECL
)
1704 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1706 record_node_allocation_statistics (TREE_VEC
, length
);
1708 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1710 TREE_SET_CODE (t
, TREE_VEC
);
1711 TREE_VEC_LENGTH (t
) = len
;
1716 /* Return 1 if EXPR is the integer constant zero or a complex constant
1720 integer_zerop (const_tree expr
)
1724 return ((TREE_CODE (expr
) == INTEGER_CST
1725 && TREE_INT_CST_LOW (expr
) == 0
1726 && TREE_INT_CST_HIGH (expr
) == 0)
1727 || (TREE_CODE (expr
) == COMPLEX_CST
1728 && integer_zerop (TREE_REALPART (expr
))
1729 && integer_zerop (TREE_IMAGPART (expr
))));
1732 /* Return 1 if EXPR is the integer constant one or the corresponding
1733 complex constant. */
1736 integer_onep (const_tree expr
)
1740 return ((TREE_CODE (expr
) == INTEGER_CST
1741 && TREE_INT_CST_LOW (expr
) == 1
1742 && TREE_INT_CST_HIGH (expr
) == 0)
1743 || (TREE_CODE (expr
) == COMPLEX_CST
1744 && integer_onep (TREE_REALPART (expr
))
1745 && integer_zerop (TREE_IMAGPART (expr
))));
1748 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1749 it contains. Likewise for the corresponding complex constant. */
1752 integer_all_onesp (const_tree expr
)
1759 if (TREE_CODE (expr
) == COMPLEX_CST
1760 && integer_all_onesp (TREE_REALPART (expr
))
1761 && integer_zerop (TREE_IMAGPART (expr
)))
1764 else if (TREE_CODE (expr
) != INTEGER_CST
)
1767 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1768 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1769 && TREE_INT_CST_HIGH (expr
) == -1)
1774 /* Note that using TYPE_PRECISION here is wrong. We care about the
1775 actual bits, not the (arbitrary) range of the type. */
1776 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1777 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1779 HOST_WIDE_INT high_value
;
1782 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1784 /* Can not handle precisions greater than twice the host int size. */
1785 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1786 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1787 /* Shifting by the host word size is undefined according to the ANSI
1788 standard, so we must handle this as a special case. */
1791 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1793 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1794 && TREE_INT_CST_HIGH (expr
) == high_value
);
1797 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1800 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1804 integer_pow2p (const_tree expr
)
1807 HOST_WIDE_INT high
, low
;
1811 if (TREE_CODE (expr
) == COMPLEX_CST
1812 && integer_pow2p (TREE_REALPART (expr
))
1813 && integer_zerop (TREE_IMAGPART (expr
)))
1816 if (TREE_CODE (expr
) != INTEGER_CST
)
1819 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1820 high
= TREE_INT_CST_HIGH (expr
);
1821 low
= TREE_INT_CST_LOW (expr
);
1823 /* First clear all bits that are beyond the type's precision in case
1824 we've been sign extended. */
1826 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1828 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1829 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1833 if (prec
< HOST_BITS_PER_WIDE_INT
)
1834 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1837 if (high
== 0 && low
== 0)
1840 return ((high
== 0 && (low
& (low
- 1)) == 0)
1841 || (low
== 0 && (high
& (high
- 1)) == 0));
1844 /* Return 1 if EXPR is an integer constant other than zero or a
1845 complex constant other than zero. */
1848 integer_nonzerop (const_tree expr
)
1852 return ((TREE_CODE (expr
) == INTEGER_CST
1853 && (TREE_INT_CST_LOW (expr
) != 0
1854 || TREE_INT_CST_HIGH (expr
) != 0))
1855 || (TREE_CODE (expr
) == COMPLEX_CST
1856 && (integer_nonzerop (TREE_REALPART (expr
))
1857 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1860 /* Return 1 if EXPR is the fixed-point constant zero. */
1863 fixed_zerop (const_tree expr
)
1865 return (TREE_CODE (expr
) == FIXED_CST
1866 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1869 /* Return the power of two represented by a tree node known to be a
1873 tree_log2 (const_tree expr
)
1876 HOST_WIDE_INT high
, low
;
1880 if (TREE_CODE (expr
) == COMPLEX_CST
)
1881 return tree_log2 (TREE_REALPART (expr
));
1883 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1884 high
= TREE_INT_CST_HIGH (expr
);
1885 low
= TREE_INT_CST_LOW (expr
);
1887 /* First clear all bits that are beyond the type's precision in case
1888 we've been sign extended. */
1890 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1892 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1893 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1897 if (prec
< HOST_BITS_PER_WIDE_INT
)
1898 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1901 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1902 : exact_log2 (low
));
1905 /* Similar, but return the largest integer Y such that 2 ** Y is less
1906 than or equal to EXPR. */
1909 tree_floor_log2 (const_tree expr
)
1912 HOST_WIDE_INT high
, low
;
1916 if (TREE_CODE (expr
) == COMPLEX_CST
)
1917 return tree_log2 (TREE_REALPART (expr
));
1919 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1920 high
= TREE_INT_CST_HIGH (expr
);
1921 low
= TREE_INT_CST_LOW (expr
);
1923 /* First clear all bits that are beyond the type's precision in case
1924 we've been sign extended. Ignore if type's precision hasn't been set
1925 since what we are doing is setting it. */
1927 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1929 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1930 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1934 if (prec
< HOST_BITS_PER_WIDE_INT
)
1935 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1938 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1939 : floor_log2 (low
));
1942 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1943 decimal float constants, so don't return 1 for them. */
1946 real_zerop (const_tree expr
)
1950 return ((TREE_CODE (expr
) == REAL_CST
1951 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1952 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1953 || (TREE_CODE (expr
) == COMPLEX_CST
1954 && real_zerop (TREE_REALPART (expr
))
1955 && real_zerop (TREE_IMAGPART (expr
))));
1958 /* Return 1 if EXPR is the real constant one in real or complex form.
1959 Trailing zeroes matter for decimal float constants, so don't return
1963 real_onep (const_tree expr
)
1967 return ((TREE_CODE (expr
) == REAL_CST
1968 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1969 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1970 || (TREE_CODE (expr
) == COMPLEX_CST
1971 && real_onep (TREE_REALPART (expr
))
1972 && real_zerop (TREE_IMAGPART (expr
))));
1975 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1976 for decimal float constants, so don't return 1 for them. */
1979 real_twop (const_tree expr
)
1983 return ((TREE_CODE (expr
) == REAL_CST
1984 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1985 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1986 || (TREE_CODE (expr
) == COMPLEX_CST
1987 && real_twop (TREE_REALPART (expr
))
1988 && real_zerop (TREE_IMAGPART (expr
))));
1991 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1992 matter for decimal float constants, so don't return 1 for them. */
1995 real_minus_onep (const_tree expr
)
1999 return ((TREE_CODE (expr
) == REAL_CST
2000 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2001 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2002 || (TREE_CODE (expr
) == COMPLEX_CST
2003 && real_minus_onep (TREE_REALPART (expr
))
2004 && real_zerop (TREE_IMAGPART (expr
))));
2007 /* Nonzero if EXP is a constant or a cast of a constant. */
2010 really_constant_p (const_tree exp
)
2012 /* This is not quite the same as STRIP_NOPS. It does more. */
2013 while (CONVERT_EXPR_P (exp
)
2014 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2015 exp
= TREE_OPERAND (exp
, 0);
2016 return TREE_CONSTANT (exp
);
2019 /* Return first list element whose TREE_VALUE is ELEM.
2020 Return 0 if ELEM is not in LIST. */
2023 value_member (tree elem
, tree list
)
2027 if (elem
== TREE_VALUE (list
))
2029 list
= TREE_CHAIN (list
);
2034 /* Return first list element whose TREE_PURPOSE is ELEM.
2035 Return 0 if ELEM is not in LIST. */
2038 purpose_member (const_tree elem
, tree list
)
2042 if (elem
== TREE_PURPOSE (list
))
2044 list
= TREE_CHAIN (list
);
2049 /* Return true if ELEM is in V. */
2052 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2056 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2062 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2066 chain_index (int idx
, tree chain
)
2068 for (; chain
&& idx
> 0; --idx
)
2069 chain
= TREE_CHAIN (chain
);
2073 /* Return nonzero if ELEM is part of the chain CHAIN. */
2076 chain_member (const_tree elem
, const_tree chain
)
2082 chain
= DECL_CHAIN (chain
);
2088 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2089 We expect a null pointer to mark the end of the chain.
2090 This is the Lisp primitive `length'. */
2093 list_length (const_tree t
)
2096 #ifdef ENABLE_TREE_CHECKING
2104 #ifdef ENABLE_TREE_CHECKING
2107 gcc_assert (p
!= q
);
2115 /* Returns the number of FIELD_DECLs in TYPE. */
2118 fields_length (const_tree type
)
2120 tree t
= TYPE_FIELDS (type
);
2123 for (; t
; t
= DECL_CHAIN (t
))
2124 if (TREE_CODE (t
) == FIELD_DECL
)
2130 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2131 UNION_TYPE TYPE, or NULL_TREE if none. */
2134 first_field (const_tree type
)
2136 tree t
= TYPE_FIELDS (type
);
2137 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2142 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2143 by modifying the last node in chain 1 to point to chain 2.
2144 This is the Lisp primitive `nconc'. */
2147 chainon (tree op1
, tree op2
)
2156 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2158 TREE_CHAIN (t1
) = op2
;
2160 #ifdef ENABLE_TREE_CHECKING
2163 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2164 gcc_assert (t2
!= t1
);
2171 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2174 tree_last (tree chain
)
2178 while ((next
= TREE_CHAIN (chain
)))
2183 /* Reverse the order of elements in the chain T,
2184 and return the new head of the chain (old last element). */
2189 tree prev
= 0, decl
, next
;
2190 for (decl
= t
; decl
; decl
= next
)
2192 /* We shouldn't be using this function to reverse BLOCK chains; we
2193 have blocks_nreverse for that. */
2194 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2195 next
= TREE_CHAIN (decl
);
2196 TREE_CHAIN (decl
) = prev
;
2202 /* Return a newly created TREE_LIST node whose
2203 purpose and value fields are PARM and VALUE. */
2206 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2208 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2209 TREE_PURPOSE (t
) = parm
;
2210 TREE_VALUE (t
) = value
;
2214 /* Build a chain of TREE_LIST nodes from a vector. */
2217 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2219 tree ret
= NULL_TREE
;
2223 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2225 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2226 pp
= &TREE_CHAIN (*pp
);
2231 /* Return a newly created TREE_LIST node whose
2232 purpose and value fields are PURPOSE and VALUE
2233 and whose TREE_CHAIN is CHAIN. */
2236 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2240 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2242 memset (node
, 0, sizeof (struct tree_common
));
2244 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2246 TREE_SET_CODE (node
, TREE_LIST
);
2247 TREE_CHAIN (node
) = chain
;
2248 TREE_PURPOSE (node
) = purpose
;
2249 TREE_VALUE (node
) = value
;
2253 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2257 ctor_to_vec (tree ctor
)
2259 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2263 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2264 VEC_quick_push (tree
, vec
, val
);
2269 /* Return the size nominally occupied by an object of type TYPE
2270 when it resides in memory. The value is measured in units of bytes,
2271 and its data type is that normally used for type sizes
2272 (which is the first type created by make_signed_type or
2273 make_unsigned_type). */
2276 size_in_bytes (const_tree type
)
2280 if (type
== error_mark_node
)
2281 return integer_zero_node
;
2283 type
= TYPE_MAIN_VARIANT (type
);
2284 t
= TYPE_SIZE_UNIT (type
);
2288 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2289 return size_zero_node
;
2295 /* Return the size of TYPE (in bytes) as a wide integer
2296 or return -1 if the size can vary or is larger than an integer. */
2299 int_size_in_bytes (const_tree type
)
2303 if (type
== error_mark_node
)
2306 type
= TYPE_MAIN_VARIANT (type
);
2307 t
= TYPE_SIZE_UNIT (type
);
2309 || TREE_CODE (t
) != INTEGER_CST
2310 || TREE_INT_CST_HIGH (t
) != 0
2311 /* If the result would appear negative, it's too big to represent. */
2312 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2315 return TREE_INT_CST_LOW (t
);
2318 /* Return the maximum size of TYPE (in bytes) as a wide integer
2319 or return -1 if the size can vary or is larger than an integer. */
2322 max_int_size_in_bytes (const_tree type
)
2324 HOST_WIDE_INT size
= -1;
2327 /* If this is an array type, check for a possible MAX_SIZE attached. */
2329 if (TREE_CODE (type
) == ARRAY_TYPE
)
2331 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2333 if (size_tree
&& host_integerp (size_tree
, 1))
2334 size
= tree_low_cst (size_tree
, 1);
2337 /* If we still haven't been able to get a size, see if the language
2338 can compute a maximum size. */
2342 size_tree
= lang_hooks
.types
.max_size (type
);
2344 if (size_tree
&& host_integerp (size_tree
, 1))
2345 size
= tree_low_cst (size_tree
, 1);
2351 /* Returns a tree for the size of EXP in bytes. */
2354 tree_expr_size (const_tree exp
)
2357 && DECL_SIZE_UNIT (exp
) != 0)
2358 return DECL_SIZE_UNIT (exp
);
2360 return size_in_bytes (TREE_TYPE (exp
));
2363 /* Return the bit position of FIELD, in bits from the start of the record.
2364 This is a tree of type bitsizetype. */
2367 bit_position (const_tree field
)
2369 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2370 DECL_FIELD_BIT_OFFSET (field
));
2373 /* Likewise, but return as an integer. It must be representable in
2374 that way (since it could be a signed value, we don't have the
2375 option of returning -1 like int_size_in_byte can. */
2378 int_bit_position (const_tree field
)
2380 return tree_low_cst (bit_position (field
), 0);
2383 /* Return the byte position of FIELD, in bytes from the start of the record.
2384 This is a tree of type sizetype. */
2387 byte_position (const_tree field
)
2389 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2390 DECL_FIELD_BIT_OFFSET (field
));
2393 /* Likewise, but return as an integer. It must be representable in
2394 that way (since it could be a signed value, we don't have the
2395 option of returning -1 like int_size_in_byte can. */
2398 int_byte_position (const_tree field
)
2400 return tree_low_cst (byte_position (field
), 0);
2403 /* Return the strictest alignment, in bits, that T is known to have. */
2406 expr_align (const_tree t
)
2408 unsigned int align0
, align1
;
2410 switch (TREE_CODE (t
))
2412 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2413 /* If we have conversions, we know that the alignment of the
2414 object must meet each of the alignments of the types. */
2415 align0
= expr_align (TREE_OPERAND (t
, 0));
2416 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2417 return MAX (align0
, align1
);
2419 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2420 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2421 case CLEANUP_POINT_EXPR
:
2422 /* These don't change the alignment of an object. */
2423 return expr_align (TREE_OPERAND (t
, 0));
2426 /* The best we can do is say that the alignment is the least aligned
2428 align0
= expr_align (TREE_OPERAND (t
, 1));
2429 align1
= expr_align (TREE_OPERAND (t
, 2));
2430 return MIN (align0
, align1
);
2432 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2433 meaningfully, it's always 1. */
2434 case LABEL_DECL
: case CONST_DECL
:
2435 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2437 gcc_assert (DECL_ALIGN (t
) != 0);
2438 return DECL_ALIGN (t
);
2444 /* Otherwise take the alignment from that of the type. */
2445 return TYPE_ALIGN (TREE_TYPE (t
));
2448 /* Return, as a tree node, the number of elements for TYPE (which is an
2449 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2452 array_type_nelts (const_tree type
)
2454 tree index_type
, min
, max
;
2456 /* If they did it with unspecified bounds, then we should have already
2457 given an error about it before we got here. */
2458 if (! TYPE_DOMAIN (type
))
2459 return error_mark_node
;
2461 index_type
= TYPE_DOMAIN (type
);
2462 min
= TYPE_MIN_VALUE (index_type
);
2463 max
= TYPE_MAX_VALUE (index_type
);
2465 return (integer_zerop (min
)
2467 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2470 /* If arg is static -- a reference to an object in static storage -- then
2471 return the object. This is not the same as the C meaning of `static'.
2472 If arg isn't static, return NULL. */
2477 switch (TREE_CODE (arg
))
2480 /* Nested functions are static, even though taking their address will
2481 involve a trampoline as we unnest the nested function and create
2482 the trampoline on the tree level. */
2486 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2487 && ! DECL_THREAD_LOCAL_P (arg
)
2488 && ! DECL_DLLIMPORT_P (arg
)
2492 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2496 return TREE_STATIC (arg
) ? arg
: NULL
;
2503 /* If the thing being referenced is not a field, then it is
2504 something language specific. */
2505 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2507 /* If we are referencing a bitfield, we can't evaluate an
2508 ADDR_EXPR at compile time and so it isn't a constant. */
2509 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2512 return staticp (TREE_OPERAND (arg
, 0));
2518 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2521 case ARRAY_RANGE_REF
:
2522 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2523 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2524 return staticp (TREE_OPERAND (arg
, 0));
2528 case COMPOUND_LITERAL_EXPR
:
2529 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2539 /* Return whether OP is a DECL whose address is function-invariant. */
2542 decl_address_invariant_p (const_tree op
)
2544 /* The conditions below are slightly less strict than the one in
2547 switch (TREE_CODE (op
))
2556 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2557 || DECL_THREAD_LOCAL_P (op
)
2558 || DECL_CONTEXT (op
) == current_function_decl
2559 || decl_function_context (op
) == current_function_decl
)
2564 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2565 || decl_function_context (op
) == current_function_decl
)
2576 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2579 decl_address_ip_invariant_p (const_tree op
)
2581 /* The conditions below are slightly less strict than the one in
2584 switch (TREE_CODE (op
))
2592 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2593 && !DECL_DLLIMPORT_P (op
))
2594 || DECL_THREAD_LOCAL_P (op
))
2599 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2611 /* Return true if T is function-invariant (internal function, does
2612 not handle arithmetic; that's handled in skip_simple_arithmetic and
2613 tree_invariant_p). */
2615 static bool tree_invariant_p (tree t
);
2618 tree_invariant_p_1 (tree t
)
2622 if (TREE_CONSTANT (t
)
2623 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2626 switch (TREE_CODE (t
))
2632 op
= TREE_OPERAND (t
, 0);
2633 while (handled_component_p (op
))
2635 switch (TREE_CODE (op
))
2638 case ARRAY_RANGE_REF
:
2639 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2640 || TREE_OPERAND (op
, 2) != NULL_TREE
2641 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2646 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2652 op
= TREE_OPERAND (op
, 0);
2655 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2664 /* Return true if T is function-invariant. */
2667 tree_invariant_p (tree t
)
2669 tree inner
= skip_simple_arithmetic (t
);
2670 return tree_invariant_p_1 (inner
);
2673 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2674 Do this to any expression which may be used in more than one place,
2675 but must be evaluated only once.
2677 Normally, expand_expr would reevaluate the expression each time.
2678 Calling save_expr produces something that is evaluated and recorded
2679 the first time expand_expr is called on it. Subsequent calls to
2680 expand_expr just reuse the recorded value.
2682 The call to expand_expr that generates code that actually computes
2683 the value is the first call *at compile time*. Subsequent calls
2684 *at compile time* generate code to use the saved value.
2685 This produces correct result provided that *at run time* control
2686 always flows through the insns made by the first expand_expr
2687 before reaching the other places where the save_expr was evaluated.
2688 You, the caller of save_expr, must make sure this is so.
2690 Constants, and certain read-only nodes, are returned with no
2691 SAVE_EXPR because that is safe. Expressions containing placeholders
2692 are not touched; see tree.def for an explanation of what these
2696 save_expr (tree expr
)
2698 tree t
= fold (expr
);
2701 /* If the tree evaluates to a constant, then we don't want to hide that
2702 fact (i.e. this allows further folding, and direct checks for constants).
2703 However, a read-only object that has side effects cannot be bypassed.
2704 Since it is no problem to reevaluate literals, we just return the
2706 inner
= skip_simple_arithmetic (t
);
2707 if (TREE_CODE (inner
) == ERROR_MARK
)
2710 if (tree_invariant_p_1 (inner
))
2713 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2714 it means that the size or offset of some field of an object depends on
2715 the value within another field.
2717 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2718 and some variable since it would then need to be both evaluated once and
2719 evaluated more than once. Front-ends must assure this case cannot
2720 happen by surrounding any such subexpressions in their own SAVE_EXPR
2721 and forcing evaluation at the proper time. */
2722 if (contains_placeholder_p (inner
))
2725 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2726 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2728 /* This expression might be placed ahead of a jump to ensure that the
2729 value was computed on both sides of the jump. So make sure it isn't
2730 eliminated as dead. */
2731 TREE_SIDE_EFFECTS (t
) = 1;
2735 /* Look inside EXPR and into any simple arithmetic operations. Return
2736 the innermost non-arithmetic node. */
2739 skip_simple_arithmetic (tree expr
)
2743 /* We don't care about whether this can be used as an lvalue in this
2745 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2746 expr
= TREE_OPERAND (expr
, 0);
2748 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2749 a constant, it will be more efficient to not make another SAVE_EXPR since
2750 it will allow better simplification and GCSE will be able to merge the
2751 computations if they actually occur. */
2755 if (UNARY_CLASS_P (inner
))
2756 inner
= TREE_OPERAND (inner
, 0);
2757 else if (BINARY_CLASS_P (inner
))
2759 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2760 inner
= TREE_OPERAND (inner
, 0);
2761 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2762 inner
= TREE_OPERAND (inner
, 1);
2774 /* Return which tree structure is used by T. */
2776 enum tree_node_structure_enum
2777 tree_node_structure (const_tree t
)
2779 const enum tree_code code
= TREE_CODE (t
);
2780 return tree_node_structure_for_code (code
);
2783 /* Set various status flags when building a CALL_EXPR object T. */
2786 process_call_operands (tree t
)
2788 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2789 bool read_only
= false;
2790 int i
= call_expr_flags (t
);
2792 /* Calls have side-effects, except those to const or pure functions. */
2793 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2794 side_effects
= true;
2795 /* Propagate TREE_READONLY of arguments for const functions. */
2799 if (!side_effects
|| read_only
)
2800 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2802 tree op
= TREE_OPERAND (t
, i
);
2803 if (op
&& TREE_SIDE_EFFECTS (op
))
2804 side_effects
= true;
2805 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2809 TREE_SIDE_EFFECTS (t
) = side_effects
;
2810 TREE_READONLY (t
) = read_only
;
2813 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2814 size or offset that depends on a field within a record. */
2817 contains_placeholder_p (const_tree exp
)
2819 enum tree_code code
;
2824 code
= TREE_CODE (exp
);
2825 if (code
== PLACEHOLDER_EXPR
)
2828 switch (TREE_CODE_CLASS (code
))
2831 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2832 position computations since they will be converted into a
2833 WITH_RECORD_EXPR involving the reference, which will assume
2834 here will be valid. */
2835 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2837 case tcc_exceptional
:
2838 if (code
== TREE_LIST
)
2839 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2840 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2845 case tcc_comparison
:
2846 case tcc_expression
:
2850 /* Ignoring the first operand isn't quite right, but works best. */
2851 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2854 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2855 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2856 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2859 /* The save_expr function never wraps anything containing
2860 a PLACEHOLDER_EXPR. */
2867 switch (TREE_CODE_LENGTH (code
))
2870 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2872 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2873 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2884 const_call_expr_arg_iterator iter
;
2885 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2886 if (CONTAINS_PLACEHOLDER_P (arg
))
2900 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2901 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2905 type_contains_placeholder_1 (const_tree type
)
2907 /* If the size contains a placeholder or the parent type (component type in
2908 the case of arrays) type involves a placeholder, this type does. */
2909 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2910 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2911 || (!POINTER_TYPE_P (type
)
2913 && type_contains_placeholder_p (TREE_TYPE (type
))))
2916 /* Now do type-specific checks. Note that the last part of the check above
2917 greatly limits what we have to do below. */
2918 switch (TREE_CODE (type
))
2926 case REFERENCE_TYPE
:
2934 case FIXED_POINT_TYPE
:
2935 /* Here we just check the bounds. */
2936 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2937 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2940 /* We have already checked the component type above, so just check the
2942 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2946 case QUAL_UNION_TYPE
:
2950 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2951 if (TREE_CODE (field
) == FIELD_DECL
2952 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2953 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2954 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2955 || type_contains_placeholder_p (TREE_TYPE (field
))))
2966 /* Wrapper around above function used to cache its result. */
2969 type_contains_placeholder_p (tree type
)
2973 /* If the contains_placeholder_bits field has been initialized,
2974 then we know the answer. */
2975 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2976 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2978 /* Indicate that we've seen this type node, and the answer is false.
2979 This is what we want to return if we run into recursion via fields. */
2980 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2982 /* Compute the real value. */
2983 result
= type_contains_placeholder_1 (type
);
2985 /* Store the real value. */
2986 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2991 /* Push tree EXP onto vector QUEUE if it is not already present. */
2994 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2999 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
3000 if (simple_cst_equal (iter
, exp
) == 1)
3004 VEC_safe_push (tree
, heap
, *queue
, exp
);
3007 /* Given a tree EXP, find all occurences of references to fields
3008 in a PLACEHOLDER_EXPR and place them in vector REFS without
3009 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3010 we assume here that EXP contains only arithmetic expressions
3011 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3015 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3017 enum tree_code code
= TREE_CODE (exp
);
3021 /* We handle TREE_LIST and COMPONENT_REF separately. */
3022 if (code
== TREE_LIST
)
3024 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3025 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3027 else if (code
== COMPONENT_REF
)
3029 for (inner
= TREE_OPERAND (exp
, 0);
3030 REFERENCE_CLASS_P (inner
);
3031 inner
= TREE_OPERAND (inner
, 0))
3034 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3035 push_without_duplicates (exp
, refs
);
3037 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3040 switch (TREE_CODE_CLASS (code
))
3045 case tcc_declaration
:
3046 /* Variables allocated to static storage can stay. */
3047 if (!TREE_STATIC (exp
))
3048 push_without_duplicates (exp
, refs
);
3051 case tcc_expression
:
3052 /* This is the pattern built in ada/make_aligning_type. */
3053 if (code
== ADDR_EXPR
3054 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3056 push_without_duplicates (exp
, refs
);
3060 /* Fall through... */
3062 case tcc_exceptional
:
3065 case tcc_comparison
:
3067 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3068 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3072 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3073 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3081 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3082 return a tree with all occurrences of references to F in a
3083 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3084 CONST_DECLs. Note that we assume here that EXP contains only
3085 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3086 occurring only in their argument list. */
3089 substitute_in_expr (tree exp
, tree f
, tree r
)
3091 enum tree_code code
= TREE_CODE (exp
);
3092 tree op0
, op1
, op2
, op3
;
3095 /* We handle TREE_LIST and COMPONENT_REF separately. */
3096 if (code
== TREE_LIST
)
3098 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3099 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3100 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3103 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3105 else if (code
== COMPONENT_REF
)
3109 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3110 and it is the right field, replace it with R. */
3111 for (inner
= TREE_OPERAND (exp
, 0);
3112 REFERENCE_CLASS_P (inner
);
3113 inner
= TREE_OPERAND (inner
, 0))
3117 op1
= TREE_OPERAND (exp
, 1);
3119 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3122 /* If this expression hasn't been completed let, leave it alone. */
3123 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3126 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3127 if (op0
== TREE_OPERAND (exp
, 0))
3131 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3134 switch (TREE_CODE_CLASS (code
))
3139 case tcc_declaration
:
3145 case tcc_expression
:
3149 /* Fall through... */
3151 case tcc_exceptional
:
3154 case tcc_comparison
:
3156 switch (TREE_CODE_LENGTH (code
))
3162 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3163 if (op0
== TREE_OPERAND (exp
, 0))
3166 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3170 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3171 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3173 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3176 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3180 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3181 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3182 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3184 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3185 && op2
== TREE_OPERAND (exp
, 2))
3188 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3192 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3193 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3194 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3195 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3197 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3198 && op2
== TREE_OPERAND (exp
, 2)
3199 && op3
== TREE_OPERAND (exp
, 3))
3203 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3215 new_tree
= NULL_TREE
;
3217 /* If we are trying to replace F with a constant, inline back
3218 functions which do nothing else than computing a value from
3219 the arguments they are passed. This makes it possible to
3220 fold partially or entirely the replacement expression. */
3221 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3223 tree t
= maybe_inline_call_in_expr (exp
);
3225 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3228 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3230 tree op
= TREE_OPERAND (exp
, i
);
3231 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3235 new_tree
= copy_node (exp
);
3236 TREE_OPERAND (new_tree
, i
) = new_op
;
3242 new_tree
= fold (new_tree
);
3243 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3244 process_call_operands (new_tree
);
3255 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3257 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3258 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3263 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3264 for it within OBJ, a tree that is an object or a chain of references. */
3267 substitute_placeholder_in_expr (tree exp
, tree obj
)
3269 enum tree_code code
= TREE_CODE (exp
);
3270 tree op0
, op1
, op2
, op3
;
3273 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3274 in the chain of OBJ. */
3275 if (code
== PLACEHOLDER_EXPR
)
3277 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3280 for (elt
= obj
; elt
!= 0;
3281 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3282 || TREE_CODE (elt
) == COND_EXPR
)
3283 ? TREE_OPERAND (elt
, 1)
3284 : (REFERENCE_CLASS_P (elt
)
3285 || UNARY_CLASS_P (elt
)
3286 || BINARY_CLASS_P (elt
)
3287 || VL_EXP_CLASS_P (elt
)
3288 || EXPRESSION_CLASS_P (elt
))
3289 ? TREE_OPERAND (elt
, 0) : 0))
3290 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3293 for (elt
= obj
; elt
!= 0;
3294 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3295 || TREE_CODE (elt
) == COND_EXPR
)
3296 ? TREE_OPERAND (elt
, 1)
3297 : (REFERENCE_CLASS_P (elt
)
3298 || UNARY_CLASS_P (elt
)
3299 || BINARY_CLASS_P (elt
)
3300 || VL_EXP_CLASS_P (elt
)
3301 || EXPRESSION_CLASS_P (elt
))
3302 ? TREE_OPERAND (elt
, 0) : 0))
3303 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3304 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3306 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3308 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3309 survives until RTL generation, there will be an error. */
3313 /* TREE_LIST is special because we need to look at TREE_VALUE
3314 and TREE_CHAIN, not TREE_OPERANDS. */
3315 else if (code
== TREE_LIST
)
3317 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3318 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3319 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3322 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3325 switch (TREE_CODE_CLASS (code
))
3328 case tcc_declaration
:
3331 case tcc_exceptional
:
3334 case tcc_comparison
:
3335 case tcc_expression
:
3338 switch (TREE_CODE_LENGTH (code
))
3344 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3345 if (op0
== TREE_OPERAND (exp
, 0))
3348 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3352 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3353 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3355 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3358 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3362 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3363 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3364 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3366 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3367 && op2
== TREE_OPERAND (exp
, 2))
3370 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3374 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3375 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3376 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3377 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3379 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3380 && op2
== TREE_OPERAND (exp
, 2)
3381 && op3
== TREE_OPERAND (exp
, 3))
3385 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3397 new_tree
= NULL_TREE
;
3399 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3401 tree op
= TREE_OPERAND (exp
, i
);
3402 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3406 new_tree
= copy_node (exp
);
3407 TREE_OPERAND (new_tree
, i
) = new_op
;
3413 new_tree
= fold (new_tree
);
3414 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3415 process_call_operands (new_tree
);
3426 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3428 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3429 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3434 /* Stabilize a reference so that we can use it any number of times
3435 without causing its operands to be evaluated more than once.
3436 Returns the stabilized reference. This works by means of save_expr,
3437 so see the caveats in the comments about save_expr.
3439 Also allows conversion expressions whose operands are references.
3440 Any other kind of expression is returned unchanged. */
3443 stabilize_reference (tree ref
)
3446 enum tree_code code
= TREE_CODE (ref
);
3453 /* No action is needed in this case. */
3458 case FIX_TRUNC_EXPR
:
3459 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3463 result
= build_nt (INDIRECT_REF
,
3464 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3468 result
= build_nt (COMPONENT_REF
,
3469 stabilize_reference (TREE_OPERAND (ref
, 0)),
3470 TREE_OPERAND (ref
, 1), NULL_TREE
);
3474 result
= build_nt (BIT_FIELD_REF
,
3475 stabilize_reference (TREE_OPERAND (ref
, 0)),
3476 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3477 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3481 result
= build_nt (ARRAY_REF
,
3482 stabilize_reference (TREE_OPERAND (ref
, 0)),
3483 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3484 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3487 case ARRAY_RANGE_REF
:
3488 result
= build_nt (ARRAY_RANGE_REF
,
3489 stabilize_reference (TREE_OPERAND (ref
, 0)),
3490 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3491 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3495 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3496 it wouldn't be ignored. This matters when dealing with
3498 return stabilize_reference_1 (ref
);
3500 /* If arg isn't a kind of lvalue we recognize, make no change.
3501 Caller should recognize the error for an invalid lvalue. */
3506 return error_mark_node
;
3509 TREE_TYPE (result
) = TREE_TYPE (ref
);
3510 TREE_READONLY (result
) = TREE_READONLY (ref
);
3511 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3512 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3517 /* Subroutine of stabilize_reference; this is called for subtrees of
3518 references. Any expression with side-effects must be put in a SAVE_EXPR
3519 to ensure that it is only evaluated once.
3521 We don't put SAVE_EXPR nodes around everything, because assigning very
3522 simple expressions to temporaries causes us to miss good opportunities
3523 for optimizations. Among other things, the opportunity to fold in the
3524 addition of a constant into an addressing mode often gets lost, e.g.
3525 "y[i+1] += x;". In general, we take the approach that we should not make
3526 an assignment unless we are forced into it - i.e., that any non-side effect
3527 operator should be allowed, and that cse should take care of coalescing
3528 multiple utterances of the same expression should that prove fruitful. */
3531 stabilize_reference_1 (tree e
)
3534 enum tree_code code
= TREE_CODE (e
);
3536 /* We cannot ignore const expressions because it might be a reference
3537 to a const array but whose index contains side-effects. But we can
3538 ignore things that are actual constant or that already have been
3539 handled by this function. */
3541 if (tree_invariant_p (e
))
3544 switch (TREE_CODE_CLASS (code
))
3546 case tcc_exceptional
:
3548 case tcc_declaration
:
3549 case tcc_comparison
:
3551 case tcc_expression
:
3554 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3555 so that it will only be evaluated once. */
3556 /* The reference (r) and comparison (<) classes could be handled as
3557 below, but it is generally faster to only evaluate them once. */
3558 if (TREE_SIDE_EFFECTS (e
))
3559 return save_expr (e
);
3563 /* Constants need no processing. In fact, we should never reach
3568 /* Division is slow and tends to be compiled with jumps,
3569 especially the division by powers of 2 that is often
3570 found inside of an array reference. So do it just once. */
3571 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3572 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3573 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3574 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3575 return save_expr (e
);
3576 /* Recursively stabilize each operand. */
3577 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3578 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3582 /* Recursively stabilize each operand. */
3583 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3590 TREE_TYPE (result
) = TREE_TYPE (e
);
3591 TREE_READONLY (result
) = TREE_READONLY (e
);
3592 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3593 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3598 /* Low-level constructors for expressions. */
3600 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3601 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3604 recompute_tree_invariant_for_addr_expr (tree t
)
3607 bool tc
= true, se
= false;
3609 /* We started out assuming this address is both invariant and constant, but
3610 does not have side effects. Now go down any handled components and see if
3611 any of them involve offsets that are either non-constant or non-invariant.
3612 Also check for side-effects.
3614 ??? Note that this code makes no attempt to deal with the case where
3615 taking the address of something causes a copy due to misalignment. */
3617 #define UPDATE_FLAGS(NODE) \
3618 do { tree _node = (NODE); \
3619 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3620 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3622 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3623 node
= TREE_OPERAND (node
, 0))
3625 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3626 array reference (probably made temporarily by the G++ front end),
3627 so ignore all the operands. */
3628 if ((TREE_CODE (node
) == ARRAY_REF
3629 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3630 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3632 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3633 if (TREE_OPERAND (node
, 2))
3634 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3635 if (TREE_OPERAND (node
, 3))
3636 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3638 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3639 FIELD_DECL, apparently. The G++ front end can put something else
3640 there, at least temporarily. */
3641 else if (TREE_CODE (node
) == COMPONENT_REF
3642 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3644 if (TREE_OPERAND (node
, 2))
3645 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3647 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3648 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3651 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3653 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3654 the address, since &(*a)->b is a form of addition. If it's a constant, the
3655 address is constant too. If it's a decl, its address is constant if the
3656 decl is static. Everything else is not constant and, furthermore,
3657 taking the address of a volatile variable is not volatile. */
3658 if (TREE_CODE (node
) == INDIRECT_REF
3659 || TREE_CODE (node
) == MEM_REF
)
3660 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3661 else if (CONSTANT_CLASS_P (node
))
3663 else if (DECL_P (node
))
3664 tc
&= (staticp (node
) != NULL_TREE
);
3668 se
|= TREE_SIDE_EFFECTS (node
);
3672 TREE_CONSTANT (t
) = tc
;
3673 TREE_SIDE_EFFECTS (t
) = se
;
3677 /* Build an expression of code CODE, data type TYPE, and operands as
3678 specified. Expressions and reference nodes can be created this way.
3679 Constants, decls, types and misc nodes cannot be.
3681 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3682 enough for all extant tree codes. */
3685 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3689 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3691 t
= make_node_stat (code PASS_MEM_STAT
);
3698 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3700 int length
= sizeof (struct tree_exp
);
3703 record_node_allocation_statistics (code
, length
);
3705 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3707 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3709 memset (t
, 0, sizeof (struct tree_common
));
3711 TREE_SET_CODE (t
, code
);
3713 TREE_TYPE (t
) = type
;
3714 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3715 TREE_OPERAND (t
, 0) = node
;
3716 TREE_BLOCK (t
) = NULL_TREE
;
3717 if (node
&& !TYPE_P (node
))
3719 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3720 TREE_READONLY (t
) = TREE_READONLY (node
);
3723 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3724 TREE_SIDE_EFFECTS (t
) = 1;
3728 /* All of these have side-effects, no matter what their
3730 TREE_SIDE_EFFECTS (t
) = 1;
3731 TREE_READONLY (t
) = 0;
3735 /* Whether a dereference is readonly has nothing to do with whether
3736 its operand is readonly. */
3737 TREE_READONLY (t
) = 0;
3742 recompute_tree_invariant_for_addr_expr (t
);
3746 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3747 && node
&& !TYPE_P (node
)
3748 && TREE_CONSTANT (node
))
3749 TREE_CONSTANT (t
) = 1;
3750 if (TREE_CODE_CLASS (code
) == tcc_reference
3751 && node
&& TREE_THIS_VOLATILE (node
))
3752 TREE_THIS_VOLATILE (t
) = 1;
3759 #define PROCESS_ARG(N) \
3761 TREE_OPERAND (t, N) = arg##N; \
3762 if (arg##N &&!TYPE_P (arg##N)) \
3764 if (TREE_SIDE_EFFECTS (arg##N)) \
3766 if (!TREE_READONLY (arg##N) \
3767 && !CONSTANT_CLASS_P (arg##N)) \
3768 (void) (read_only = 0); \
3769 if (!TREE_CONSTANT (arg##N)) \
3770 (void) (constant = 0); \
3775 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3777 bool constant
, read_only
, side_effects
;
3780 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3782 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3783 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3784 /* When sizetype precision doesn't match that of pointers
3785 we need to be able to build explicit extensions or truncations
3786 of the offset argument. */
3787 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3788 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3789 && TREE_CODE (arg1
) == INTEGER_CST
);
3791 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3792 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3793 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3794 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3796 t
= make_node_stat (code PASS_MEM_STAT
);
3799 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3800 result based on those same flags for the arguments. But if the
3801 arguments aren't really even `tree' expressions, we shouldn't be trying
3804 /* Expressions without side effects may be constant if their
3805 arguments are as well. */
3806 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3807 || TREE_CODE_CLASS (code
) == tcc_binary
);
3809 side_effects
= TREE_SIDE_EFFECTS (t
);
3814 TREE_READONLY (t
) = read_only
;
3815 TREE_CONSTANT (t
) = constant
;
3816 TREE_SIDE_EFFECTS (t
) = side_effects
;
3817 TREE_THIS_VOLATILE (t
)
3818 = (TREE_CODE_CLASS (code
) == tcc_reference
3819 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3826 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3827 tree arg2 MEM_STAT_DECL
)
3829 bool constant
, read_only
, side_effects
;
3832 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3833 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3835 t
= make_node_stat (code PASS_MEM_STAT
);
3840 /* As a special exception, if COND_EXPR has NULL branches, we
3841 assume that it is a gimple statement and always consider
3842 it to have side effects. */
3843 if (code
== COND_EXPR
3844 && tt
== void_type_node
3845 && arg1
== NULL_TREE
3846 && arg2
== NULL_TREE
)
3847 side_effects
= true;
3849 side_effects
= TREE_SIDE_EFFECTS (t
);
3855 if (code
== COND_EXPR
)
3856 TREE_READONLY (t
) = read_only
;
3858 TREE_SIDE_EFFECTS (t
) = side_effects
;
3859 TREE_THIS_VOLATILE (t
)
3860 = (TREE_CODE_CLASS (code
) == tcc_reference
3861 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3867 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3868 tree arg2
, tree arg3 MEM_STAT_DECL
)
3870 bool constant
, read_only
, side_effects
;
3873 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3875 t
= make_node_stat (code PASS_MEM_STAT
);
3878 side_effects
= TREE_SIDE_EFFECTS (t
);
3885 TREE_SIDE_EFFECTS (t
) = side_effects
;
3886 TREE_THIS_VOLATILE (t
)
3887 = (TREE_CODE_CLASS (code
) == tcc_reference
3888 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3894 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3895 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3897 bool constant
, read_only
, side_effects
;
3900 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3902 t
= make_node_stat (code PASS_MEM_STAT
);
3905 side_effects
= TREE_SIDE_EFFECTS (t
);
3913 TREE_SIDE_EFFECTS (t
) = side_effects
;
3914 TREE_THIS_VOLATILE (t
)
3915 = (TREE_CODE_CLASS (code
) == tcc_reference
3916 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3922 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3923 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3925 bool constant
, read_only
, side_effects
;
3928 gcc_assert (code
== TARGET_MEM_REF
);
3930 t
= make_node_stat (code PASS_MEM_STAT
);
3933 side_effects
= TREE_SIDE_EFFECTS (t
);
3940 if (code
== TARGET_MEM_REF
)
3944 TREE_SIDE_EFFECTS (t
) = side_effects
;
3945 TREE_THIS_VOLATILE (t
)
3946 = (code
== TARGET_MEM_REF
3947 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3952 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3953 on the pointer PTR. */
3956 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3958 HOST_WIDE_INT offset
= 0;
3959 tree ptype
= TREE_TYPE (ptr
);
3961 /* For convenience allow addresses that collapse to a simple base
3963 if (TREE_CODE (ptr
) == ADDR_EXPR
3964 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3965 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3967 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3969 ptr
= build_fold_addr_expr (ptr
);
3970 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3972 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3973 ptr
, build_int_cst (ptype
, offset
));
3974 SET_EXPR_LOCATION (tem
, loc
);
3978 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3981 mem_ref_offset (const_tree t
)
3983 tree toff
= TREE_OPERAND (t
, 1);
3984 return double_int_sext (tree_to_double_int (toff
),
3985 TYPE_PRECISION (TREE_TYPE (toff
)));
3988 /* Return the pointer-type relevant for TBAA purposes from the
3989 gimple memory reference tree T. This is the type to be used for
3990 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3993 reference_alias_ptr_type (const_tree t
)
3995 const_tree base
= t
;
3996 while (handled_component_p (base
))
3997 base
= TREE_OPERAND (base
, 0);
3998 if (TREE_CODE (base
) == MEM_REF
)
3999 return TREE_TYPE (TREE_OPERAND (base
, 1));
4000 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4001 return TREE_TYPE (TMR_OFFSET (base
));
4003 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4006 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4007 offsetted by OFFSET units. */
4010 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4012 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4013 build_fold_addr_expr (base
),
4014 build_int_cst (ptr_type_node
, offset
));
4015 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4016 recompute_tree_invariant_for_addr_expr (addr
);
4020 /* Similar except don't specify the TREE_TYPE
4021 and leave the TREE_SIDE_EFFECTS as 0.
4022 It is permissible for arguments to be null,
4023 or even garbage if their values do not matter. */
4026 build_nt (enum tree_code code
, ...)
4033 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4037 t
= make_node (code
);
4038 length
= TREE_CODE_LENGTH (code
);
4040 for (i
= 0; i
< length
; i
++)
4041 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4047 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4051 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4056 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4057 CALL_EXPR_FN (ret
) = fn
;
4058 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4059 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4060 CALL_EXPR_ARG (ret
, ix
) = t
;
4064 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4065 We do NOT enter this node in any sort of symbol table.
4067 LOC is the location of the decl.
4069 layout_decl is used to set up the decl's storage layout.
4070 Other slots are initialized to 0 or null pointers. */
4073 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4074 tree type MEM_STAT_DECL
)
4078 t
= make_node_stat (code PASS_MEM_STAT
);
4079 DECL_SOURCE_LOCATION (t
) = loc
;
4081 /* if (type == error_mark_node)
4082 type = integer_type_node; */
4083 /* That is not done, deliberately, so that having error_mark_node
4084 as the type can suppress useless errors in the use of this variable. */
4086 DECL_NAME (t
) = name
;
4087 TREE_TYPE (t
) = type
;
4089 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4095 /* Builds and returns function declaration with NAME and TYPE. */
4098 build_fn_decl (const char *name
, tree type
)
4100 tree id
= get_identifier (name
);
4101 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4103 DECL_EXTERNAL (decl
) = 1;
4104 TREE_PUBLIC (decl
) = 1;
4105 DECL_ARTIFICIAL (decl
) = 1;
4106 TREE_NOTHROW (decl
) = 1;
4111 VEC(tree
,gc
) *all_translation_units
;
4113 /* Builds a new translation-unit decl with name NAME, queues it in the
4114 global list of translation-unit decls and returns it. */
4117 build_translation_unit_decl (tree name
)
4119 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4121 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4122 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4127 /* BLOCK nodes are used to represent the structure of binding contours
4128 and declarations, once those contours have been exited and their contents
4129 compiled. This information is used for outputting debugging info. */
4132 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4134 tree block
= make_node (BLOCK
);
4136 BLOCK_VARS (block
) = vars
;
4137 BLOCK_SUBBLOCKS (block
) = subblocks
;
4138 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4139 BLOCK_CHAIN (block
) = chain
;
4144 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4146 LOC is the location to use in tree T. */
4149 protected_set_expr_location (tree t
, location_t loc
)
4151 if (t
&& CAN_HAVE_LOCATION_P (t
))
4152 SET_EXPR_LOCATION (t
, loc
);
4155 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4159 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4161 DECL_ATTRIBUTES (ddecl
) = attribute
;
4165 /* Borrowed from hashtab.c iterative_hash implementation. */
4166 #define mix(a,b,c) \
4168 a -= b; a -= c; a ^= (c>>13); \
4169 b -= c; b -= a; b ^= (a<< 8); \
4170 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4171 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4172 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4173 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4174 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4175 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4176 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4180 /* Produce good hash value combining VAL and VAL2. */
4182 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4184 /* the golden ratio; an arbitrary value. */
4185 hashval_t a
= 0x9e3779b9;
4191 /* Produce good hash value combining VAL and VAL2. */
4193 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4195 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4196 return iterative_hash_hashval_t (val
, val2
);
4199 hashval_t a
= (hashval_t
) val
;
4200 /* Avoid warnings about shifting of more than the width of the type on
4201 hosts that won't execute this path. */
4203 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4205 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4207 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4208 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4215 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4216 is ATTRIBUTE and its qualifiers are QUALS.
4218 Record such modified types already made so we don't make duplicates. */
4221 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4223 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4225 hashval_t hashcode
= 0;
4227 enum tree_code code
= TREE_CODE (ttype
);
4229 /* Building a distinct copy of a tagged type is inappropriate; it
4230 causes breakage in code that expects there to be a one-to-one
4231 relationship between a struct and its fields.
4232 build_duplicate_type is another solution (as used in
4233 handle_transparent_union_attribute), but that doesn't play well
4234 with the stronger C++ type identity model. */
4235 if (TREE_CODE (ttype
) == RECORD_TYPE
4236 || TREE_CODE (ttype
) == UNION_TYPE
4237 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4238 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4240 warning (OPT_Wattributes
,
4241 "ignoring attributes applied to %qT after definition",
4242 TYPE_MAIN_VARIANT (ttype
));
4243 return build_qualified_type (ttype
, quals
);
4246 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4247 ntype
= build_distinct_type_copy (ttype
);
4249 TYPE_ATTRIBUTES (ntype
) = attribute
;
4251 hashcode
= iterative_hash_object (code
, hashcode
);
4252 if (TREE_TYPE (ntype
))
4253 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4255 hashcode
= attribute_hash_list (attribute
, hashcode
);
4257 switch (TREE_CODE (ntype
))
4260 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4263 if (TYPE_DOMAIN (ntype
))
4264 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4268 hashcode
= iterative_hash_object
4269 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4270 hashcode
= iterative_hash_object
4271 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4274 case FIXED_POINT_TYPE
:
4276 unsigned int precision
= TYPE_PRECISION (ntype
);
4277 hashcode
= iterative_hash_object (precision
, hashcode
);
4284 ntype
= type_hash_canon (hashcode
, ntype
);
4286 /* If the target-dependent attributes make NTYPE different from
4287 its canonical type, we will need to use structural equality
4288 checks for this type. */
4289 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4290 || !comp_type_attributes (ntype
, ttype
))
4291 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4292 else if (TYPE_CANONICAL (ntype
) == ntype
)
4293 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4295 ttype
= build_qualified_type (ntype
, quals
);
4297 else if (TYPE_QUALS (ttype
) != quals
)
4298 ttype
= build_qualified_type (ttype
, quals
);
4303 /* Compare two attributes for their value identity. Return true if the
4304 attribute values are known to be equal; otherwise return false.
4308 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4310 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4313 if (TREE_VALUE (attr1
) != NULL_TREE
4314 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4315 && TREE_VALUE (attr2
) != NULL
4316 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4317 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4318 TREE_VALUE (attr2
)) == 1);
4320 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4323 /* Return 0 if the attributes for two types are incompatible, 1 if they
4324 are compatible, and 2 if they are nearly compatible (which causes a
4325 warning to be generated). */
4327 comp_type_attributes (const_tree type1
, const_tree type2
)
4329 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4330 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4335 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4337 const struct attribute_spec
*as
;
4340 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4341 if (!as
|| as
->affects_type_identity
== false)
4344 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4345 if (!attr
|| !attribute_value_equal (a
, attr
))
4350 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4352 const struct attribute_spec
*as
;
4354 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4355 if (!as
|| as
->affects_type_identity
== false)
4358 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4360 /* We don't need to compare trees again, as we did this
4361 already in first loop. */
4363 /* All types - affecting identity - are equal, so
4364 there is no need to call target hook for comparison. */
4368 /* As some type combinations - like default calling-convention - might
4369 be compatible, we have to call the target hook to get the final result. */
4370 return targetm
.comp_type_attributes (type1
, type2
);
4373 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4376 Record such modified types already made so we don't make duplicates. */
4379 build_type_attribute_variant (tree ttype
, tree attribute
)
4381 return build_type_attribute_qual_variant (ttype
, attribute
,
4382 TYPE_QUALS (ttype
));
4386 /* Reset the expression *EXPR_P, a size or position.
4388 ??? We could reset all non-constant sizes or positions. But it's cheap
4389 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4391 We need to reset self-referential sizes or positions because they cannot
4392 be gimplified and thus can contain a CALL_EXPR after the gimplification
4393 is finished, which will run afoul of LTO streaming. And they need to be
4394 reset to something essentially dummy but not constant, so as to preserve
4395 the properties of the object they are attached to. */
4398 free_lang_data_in_one_sizepos (tree
*expr_p
)
4400 tree expr
= *expr_p
;
4401 if (CONTAINS_PLACEHOLDER_P (expr
))
4402 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4406 /* Reset all the fields in a binfo node BINFO. We only keep
4407 BINFO_VIRTUALS, which is used by gimple_fold_obj_type_ref. */
4410 free_lang_data_in_binfo (tree binfo
)
4415 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4417 BINFO_VTABLE (binfo
) = NULL_TREE
;
4418 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4419 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4420 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4422 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4423 free_lang_data_in_binfo (t
);
4427 /* Reset all language specific information still present in TYPE. */
4430 free_lang_data_in_type (tree type
)
4432 gcc_assert (TYPE_P (type
));
4434 /* Give the FE a chance to remove its own data first. */
4435 lang_hooks
.free_lang_data (type
);
4437 TREE_LANG_FLAG_0 (type
) = 0;
4438 TREE_LANG_FLAG_1 (type
) = 0;
4439 TREE_LANG_FLAG_2 (type
) = 0;
4440 TREE_LANG_FLAG_3 (type
) = 0;
4441 TREE_LANG_FLAG_4 (type
) = 0;
4442 TREE_LANG_FLAG_5 (type
) = 0;
4443 TREE_LANG_FLAG_6 (type
) = 0;
4445 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4447 /* Remove the const and volatile qualifiers from arguments. The
4448 C++ front end removes them, but the C front end does not,
4449 leading to false ODR violation errors when merging two
4450 instances of the same function signature compiled by
4451 different front ends. */
4454 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4456 tree arg_type
= TREE_VALUE (p
);
4458 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4460 int quals
= TYPE_QUALS (arg_type
)
4462 & ~TYPE_QUAL_VOLATILE
;
4463 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4464 free_lang_data_in_type (TREE_VALUE (p
));
4469 /* Remove members that are not actually FIELD_DECLs from the field
4470 list of an aggregate. These occur in C++. */
4471 if (RECORD_OR_UNION_TYPE_P (type
))
4475 /* Note that TYPE_FIELDS can be shared across distinct
4476 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4477 to be removed, we cannot set its TREE_CHAIN to NULL.
4478 Otherwise, we would not be able to find all the other fields
4479 in the other instances of this TREE_TYPE.
4481 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4483 member
= TYPE_FIELDS (type
);
4486 if (TREE_CODE (member
) == FIELD_DECL
)
4489 TREE_CHAIN (prev
) = member
;
4491 TYPE_FIELDS (type
) = member
;
4495 member
= TREE_CHAIN (member
);
4499 TREE_CHAIN (prev
) = NULL_TREE
;
4501 TYPE_FIELDS (type
) = NULL_TREE
;
4503 TYPE_METHODS (type
) = NULL_TREE
;
4504 if (TYPE_BINFO (type
))
4505 free_lang_data_in_binfo (TYPE_BINFO (type
));
4509 /* For non-aggregate types, clear out the language slot (which
4510 overloads TYPE_BINFO). */
4511 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4513 if (INTEGRAL_TYPE_P (type
)
4514 || SCALAR_FLOAT_TYPE_P (type
)
4515 || FIXED_POINT_TYPE_P (type
))
4517 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4518 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4522 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4523 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4525 if (debug_info_level
< DINFO_LEVEL_TERSE
4526 || (TYPE_CONTEXT (type
)
4527 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4528 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4529 TYPE_CONTEXT (type
) = NULL_TREE
;
4531 if (debug_info_level
< DINFO_LEVEL_TERSE
)
4532 TYPE_STUB_DECL (type
) = NULL_TREE
;
4536 /* Return true if DECL may need an assembler name to be set. */
4539 need_assembler_name_p (tree decl
)
4541 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4542 if (TREE_CODE (decl
) != FUNCTION_DECL
4543 && TREE_CODE (decl
) != VAR_DECL
)
4546 /* If DECL already has its assembler name set, it does not need a
4548 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4549 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4552 /* Abstract decls do not need an assembler name. */
4553 if (DECL_ABSTRACT (decl
))
4556 /* For VAR_DECLs, only static, public and external symbols need an
4558 if (TREE_CODE (decl
) == VAR_DECL
4559 && !TREE_STATIC (decl
)
4560 && !TREE_PUBLIC (decl
)
4561 && !DECL_EXTERNAL (decl
))
4564 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4566 /* Do not set assembler name on builtins. Allow RTL expansion to
4567 decide whether to expand inline or via a regular call. */
4568 if (DECL_BUILT_IN (decl
)
4569 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4572 /* Functions represented in the callgraph need an assembler name. */
4573 if (cgraph_get_node (decl
) != NULL
)
4576 /* Unused and not public functions don't need an assembler name. */
4577 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4585 /* Reset all language specific information still present in symbol
4589 free_lang_data_in_decl (tree decl
)
4591 gcc_assert (DECL_P (decl
));
4593 /* Give the FE a chance to remove its own data first. */
4594 lang_hooks
.free_lang_data (decl
);
4596 TREE_LANG_FLAG_0 (decl
) = 0;
4597 TREE_LANG_FLAG_1 (decl
) = 0;
4598 TREE_LANG_FLAG_2 (decl
) = 0;
4599 TREE_LANG_FLAG_3 (decl
) = 0;
4600 TREE_LANG_FLAG_4 (decl
) = 0;
4601 TREE_LANG_FLAG_5 (decl
) = 0;
4602 TREE_LANG_FLAG_6 (decl
) = 0;
4604 /* Identifiers need not have a type. */
4605 if (DECL_NAME (decl
))
4606 TREE_TYPE (DECL_NAME (decl
)) = NULL_TREE
;
4608 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4609 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4610 if (TREE_CODE (decl
) == FIELD_DECL
)
4611 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4613 /* DECL_FCONTEXT is only used for debug info generation. */
4614 if (TREE_CODE (decl
) == FIELD_DECL
4615 && debug_info_level
< DINFO_LEVEL_TERSE
)
4616 DECL_FCONTEXT (decl
) = NULL_TREE
;
4618 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4620 if (gimple_has_body_p (decl
))
4624 /* If DECL has a gimple body, then the context for its
4625 arguments must be DECL. Otherwise, it doesn't really
4626 matter, as we will not be emitting any code for DECL. In
4627 general, there may be other instances of DECL created by
4628 the front end and since PARM_DECLs are generally shared,
4629 their DECL_CONTEXT changes as the replicas of DECL are
4630 created. The only time where DECL_CONTEXT is important
4631 is for the FUNCTION_DECLs that have a gimple body (since
4632 the PARM_DECL will be used in the function's body). */
4633 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4634 DECL_CONTEXT (t
) = decl
;
4637 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4638 At this point, it is not needed anymore. */
4639 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4641 /* Clear the abstract origin if it refers to a method. Otherwise
4642 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4643 origin will not be output correctly. */
4644 if (DECL_ABSTRACT_ORIGIN (decl
)
4645 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4646 && RECORD_OR_UNION_TYPE_P
4647 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4648 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4650 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4651 DECL_VINDEX referring to itself into a vtable slot number as it
4652 should. Happens with functions that are copied and then forgotten
4653 about. Just clear it, it won't matter anymore. */
4654 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4655 DECL_VINDEX (decl
) = NULL_TREE
;
4657 else if (TREE_CODE (decl
) == VAR_DECL
)
4659 if ((DECL_EXTERNAL (decl
)
4660 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4661 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4662 DECL_INITIAL (decl
) = NULL_TREE
;
4664 else if (TREE_CODE (decl
) == TYPE_DECL
)
4665 DECL_INITIAL (decl
) = NULL_TREE
;
4666 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4667 && DECL_INITIAL (decl
)
4668 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4670 /* Strip builtins from the translation-unit BLOCK. We still have
4671 targets without builtin_decl support and also builtins are
4672 shared nodes and thus we can't use TREE_CHAIN in multiple
4674 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4678 if (TREE_CODE (var
) == FUNCTION_DECL
4679 && DECL_BUILT_IN (var
))
4680 *nextp
= TREE_CHAIN (var
);
4682 nextp
= &TREE_CHAIN (var
);
4688 /* Data used when collecting DECLs and TYPEs for language data removal. */
4690 struct free_lang_data_d
4692 /* Worklist to avoid excessive recursion. */
4693 VEC(tree
,heap
) *worklist
;
4695 /* Set of traversed objects. Used to avoid duplicate visits. */
4696 struct pointer_set_t
*pset
;
4698 /* Array of symbols to process with free_lang_data_in_decl. */
4699 VEC(tree
,heap
) *decls
;
4701 /* Array of types to process with free_lang_data_in_type. */
4702 VEC(tree
,heap
) *types
;
4706 /* Save all language fields needed to generate proper debug information
4707 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4710 save_debug_info_for_decl (tree t
)
4712 /*struct saved_debug_info_d *sdi;*/
4714 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4716 /* FIXME. Partial implementation for saving debug info removed. */
4720 /* Save all language fields needed to generate proper debug information
4721 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4724 save_debug_info_for_type (tree t
)
4726 /*struct saved_debug_info_d *sdi;*/
4728 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4730 /* FIXME. Partial implementation for saving debug info removed. */
4734 /* Add type or decl T to one of the list of tree nodes that need their
4735 language data removed. The lists are held inside FLD. */
4738 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4742 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4743 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4744 save_debug_info_for_decl (t
);
4746 else if (TYPE_P (t
))
4748 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4749 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4750 save_debug_info_for_type (t
);
4756 /* Push tree node T into FLD->WORKLIST. */
4759 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4761 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4762 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4766 /* Operand callback helper for free_lang_data_in_node. *TP is the
4767 subtree operand being considered. */
4770 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4773 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4775 if (TREE_CODE (t
) == TREE_LIST
)
4778 /* Language specific nodes will be removed, so there is no need
4779 to gather anything under them. */
4780 if (is_lang_specific (t
))
4788 /* Note that walk_tree does not traverse every possible field in
4789 decls, so we have to do our own traversals here. */
4790 add_tree_to_fld_list (t
, fld
);
4792 fld_worklist_push (DECL_NAME (t
), fld
);
4793 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4794 fld_worklist_push (DECL_SIZE (t
), fld
);
4795 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4797 /* We are going to remove everything under DECL_INITIAL for
4798 TYPE_DECLs. No point walking them. */
4799 if (TREE_CODE (t
) != TYPE_DECL
)
4800 fld_worklist_push (DECL_INITIAL (t
), fld
);
4802 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4803 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4805 if (TREE_CODE (t
) == FUNCTION_DECL
)
4807 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4808 fld_worklist_push (DECL_RESULT (t
), fld
);
4810 else if (TREE_CODE (t
) == TYPE_DECL
)
4812 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4813 fld_worklist_push (DECL_VINDEX (t
), fld
);
4815 else if (TREE_CODE (t
) == FIELD_DECL
)
4817 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4818 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4819 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4820 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4821 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4823 else if (TREE_CODE (t
) == VAR_DECL
)
4825 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4826 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4829 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4830 && DECL_HAS_VALUE_EXPR_P (t
))
4831 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4833 if (TREE_CODE (t
) != FIELD_DECL
4834 && TREE_CODE (t
) != TYPE_DECL
)
4835 fld_worklist_push (TREE_CHAIN (t
), fld
);
4838 else if (TYPE_P (t
))
4840 /* Note that walk_tree does not traverse every possible field in
4841 types, so we have to do our own traversals here. */
4842 add_tree_to_fld_list (t
, fld
);
4844 if (!RECORD_OR_UNION_TYPE_P (t
))
4845 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4846 fld_worklist_push (TYPE_SIZE (t
), fld
);
4847 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4848 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4849 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4850 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4851 fld_worklist_push (TYPE_NAME (t
), fld
);
4852 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4853 them and thus do not and want not to reach unused pointer types
4855 if (!POINTER_TYPE_P (t
))
4856 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4857 if (!RECORD_OR_UNION_TYPE_P (t
))
4858 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4859 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4860 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4861 do not and want not to reach unused variants this way. */
4862 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4863 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4864 and want not to reach unused types this way. */
4866 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4870 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4872 fld_worklist_push (TREE_TYPE (tem
), fld
);
4873 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4875 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4876 && TREE_CODE (tem
) == TREE_LIST
)
4879 fld_worklist_push (TREE_VALUE (tem
), fld
);
4880 tem
= TREE_CHAIN (tem
);
4884 if (RECORD_OR_UNION_TYPE_P (t
))
4887 /* Push all TYPE_FIELDS - there can be interleaving interesting
4888 and non-interesting things. */
4889 tem
= TYPE_FIELDS (t
);
4892 if (TREE_CODE (tem
) == FIELD_DECL
)
4893 fld_worklist_push (tem
, fld
);
4894 tem
= TREE_CHAIN (tem
);
4898 fld_worklist_push (TREE_CHAIN (t
), fld
);
4901 else if (TREE_CODE (t
) == BLOCK
)
4904 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4905 fld_worklist_push (tem
, fld
);
4906 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4907 fld_worklist_push (tem
, fld
);
4908 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4911 if (TREE_CODE (t
) != IDENTIFIER_NODE
)
4912 fld_worklist_push (TREE_TYPE (t
), fld
);
4918 /* Find decls and types in T. */
4921 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4925 if (!pointer_set_contains (fld
->pset
, t
))
4926 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4927 if (VEC_empty (tree
, fld
->worklist
))
4929 t
= VEC_pop (tree
, fld
->worklist
);
4933 /* Translate all the types in LIST with the corresponding runtime
4937 get_eh_types_for_runtime (tree list
)
4941 if (list
== NULL_TREE
)
4944 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4946 list
= TREE_CHAIN (list
);
4949 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4950 TREE_CHAIN (prev
) = n
;
4951 prev
= TREE_CHAIN (prev
);
4952 list
= TREE_CHAIN (list
);
4959 /* Find decls and types referenced in EH region R and store them in
4960 FLD->DECLS and FLD->TYPES. */
4963 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4974 /* The types referenced in each catch must first be changed to the
4975 EH types used at runtime. This removes references to FE types
4977 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4979 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4980 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4985 case ERT_ALLOWED_EXCEPTIONS
:
4986 r
->u
.allowed
.type_list
4987 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4988 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4991 case ERT_MUST_NOT_THROW
:
4992 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4993 find_decls_types_r
, fld
, fld
->pset
);
4999 /* Find decls and types referenced in cgraph node N and store them in
5000 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5001 look for *every* kind of DECL and TYPE node reachable from N,
5002 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5003 NAMESPACE_DECLs, etc). */
5006 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5009 struct function
*fn
;
5013 find_decls_types (n
->decl
, fld
);
5015 if (!gimple_has_body_p (n
->decl
))
5018 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5020 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5022 /* Traverse locals. */
5023 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5024 find_decls_types (t
, fld
);
5026 /* Traverse EH regions in FN. */
5029 FOR_ALL_EH_REGION_FN (r
, fn
)
5030 find_decls_types_in_eh_region (r
, fld
);
5033 /* Traverse every statement in FN. */
5034 FOR_EACH_BB_FN (bb
, fn
)
5036 gimple_stmt_iterator si
;
5039 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5041 gimple phi
= gsi_stmt (si
);
5043 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5045 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5046 find_decls_types (*arg_p
, fld
);
5050 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5052 gimple stmt
= gsi_stmt (si
);
5054 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5056 tree arg
= gimple_op (stmt
, i
);
5057 find_decls_types (arg
, fld
);
5064 /* Find decls and types referenced in varpool node N and store them in
5065 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5066 look for *every* kind of DECL and TYPE node reachable from N,
5067 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5068 NAMESPACE_DECLs, etc). */
5071 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5073 find_decls_types (v
->decl
, fld
);
5076 /* If T needs an assembler name, have one created for it. */
5079 assign_assembler_name_if_neeeded (tree t
)
5081 if (need_assembler_name_p (t
))
5083 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5084 diagnostics that use input_location to show locus
5085 information. The problem here is that, at this point,
5086 input_location is generally anchored to the end of the file
5087 (since the parser is long gone), so we don't have a good
5088 position to pin it to.
5090 To alleviate this problem, this uses the location of T's
5091 declaration. Examples of this are
5092 testsuite/g++.dg/template/cond2.C and
5093 testsuite/g++.dg/template/pr35240.C. */
5094 location_t saved_location
= input_location
;
5095 input_location
= DECL_SOURCE_LOCATION (t
);
5097 decl_assembler_name (t
);
5099 input_location
= saved_location
;
5104 /* Free language specific information for every operand and expression
5105 in every node of the call graph. This process operates in three stages:
5107 1- Every callgraph node and varpool node is traversed looking for
5108 decls and types embedded in them. This is a more exhaustive
5109 search than that done by find_referenced_vars, because it will
5110 also collect individual fields, decls embedded in types, etc.
5112 2- All the decls found are sent to free_lang_data_in_decl.
5114 3- All the types found are sent to free_lang_data_in_type.
5116 The ordering between decls and types is important because
5117 free_lang_data_in_decl sets assembler names, which includes
5118 mangling. So types cannot be freed up until assembler names have
5122 free_lang_data_in_cgraph (void)
5124 struct cgraph_node
*n
;
5125 struct varpool_node
*v
;
5126 struct free_lang_data_d fld
;
5131 /* Initialize sets and arrays to store referenced decls and types. */
5132 fld
.pset
= pointer_set_create ();
5133 fld
.worklist
= NULL
;
5134 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5135 fld
.types
= VEC_alloc (tree
, heap
, 100);
5137 /* Find decls and types in the body of every function in the callgraph. */
5138 for (n
= cgraph_nodes
; n
; n
= n
->next
)
5139 find_decls_types_in_node (n
, &fld
);
5141 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5142 find_decls_types (p
->decl
, &fld
);
5144 /* Find decls and types in every varpool symbol. */
5145 for (v
= varpool_nodes
; v
; v
= v
->next
)
5146 find_decls_types_in_var (v
, &fld
);
5148 /* Set the assembler name on every decl found. We need to do this
5149 now because free_lang_data_in_decl will invalidate data needed
5150 for mangling. This breaks mangling on interdependent decls. */
5151 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5152 assign_assembler_name_if_neeeded (t
);
5154 /* Traverse every decl found freeing its language data. */
5155 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5156 free_lang_data_in_decl (t
);
5158 /* Traverse every type found freeing its language data. */
5159 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5160 free_lang_data_in_type (t
);
5162 pointer_set_destroy (fld
.pset
);
5163 VEC_free (tree
, heap
, fld
.worklist
);
5164 VEC_free (tree
, heap
, fld
.decls
);
5165 VEC_free (tree
, heap
, fld
.types
);
5169 /* Free resources that are used by FE but are not needed once they are done. */
5172 free_lang_data (void)
5176 /* If we are the LTO frontend we have freed lang-specific data already. */
5178 || !flag_generate_lto
)
5181 /* Allocate and assign alias sets to the standard integer types
5182 while the slots are still in the way the frontends generated them. */
5183 for (i
= 0; i
< itk_none
; ++i
)
5184 if (integer_types
[i
])
5185 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5187 /* Traverse the IL resetting language specific information for
5188 operands, expressions, etc. */
5189 free_lang_data_in_cgraph ();
5191 /* Create gimple variants for common types. */
5192 ptrdiff_type_node
= integer_type_node
;
5193 fileptr_type_node
= ptr_type_node
;
5194 if (TREE_CODE (boolean_type_node
) != BOOLEAN_TYPE
5195 || (TYPE_MODE (boolean_type_node
)
5196 != mode_for_size (BOOL_TYPE_SIZE
, MODE_INT
, 0))
5197 || TYPE_PRECISION (boolean_type_node
) != 1
5198 || !TYPE_UNSIGNED (boolean_type_node
))
5200 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5201 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5202 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5203 TYPE_PRECISION (boolean_type_node
) = 1;
5204 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5205 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5208 /* Unify char_type_node with its properly signed variant. */
5209 if (TYPE_UNSIGNED (char_type_node
))
5210 unsigned_char_type_node
= char_type_node
;
5212 signed_char_type_node
= char_type_node
;
5214 /* Reset some langhooks. Do not reset types_compatible_p, it may
5215 still be used indirectly via the get_alias_set langhook. */
5216 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5217 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5218 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5219 lang_hooks
.set_decl_assembler_name
= lhd_set_decl_assembler_name
;
5221 /* Reset diagnostic machinery. */
5222 diagnostic_starter (global_dc
) = default_tree_diagnostic_starter
;
5223 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5224 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5230 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5234 "*free_lang_data", /* name */
5236 free_lang_data
, /* execute */
5239 0, /* static_pass_number */
5240 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5241 0, /* properties_required */
5242 0, /* properties_provided */
5243 0, /* properties_destroyed */
5244 0, /* todo_flags_start */
5245 TODO_ggc_collect
/* todo_flags_finish */
5249 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5252 We try both `text' and `__text__', ATTR may be either one. */
5253 /* ??? It might be a reasonable simplification to require ATTR to be only
5254 `text'. One might then also require attribute lists to be stored in
5255 their canonicalized form. */
5258 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
5263 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
5266 p
= IDENTIFIER_POINTER (ident
);
5267 ident_len
= IDENTIFIER_LENGTH (ident
);
5269 if (ident_len
== attr_len
5270 && strcmp (attr
, p
) == 0)
5273 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
5276 gcc_assert (attr
[1] == '_');
5277 gcc_assert (attr
[attr_len
- 2] == '_');
5278 gcc_assert (attr
[attr_len
- 1] == '_');
5279 if (ident_len
== attr_len
- 4
5280 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
5285 if (ident_len
== attr_len
+ 4
5286 && p
[0] == '_' && p
[1] == '_'
5287 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5288 && strncmp (attr
, p
+ 2, attr_len
) == 0)
5295 /* Return nonzero if IDENT is a valid name for attribute ATTR,
5298 We try both `text' and `__text__', ATTR may be either one. */
5301 is_attribute_p (const char *attr
, const_tree ident
)
5303 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
5306 /* Given an attribute name and a list of attributes, return a pointer to the
5307 attribute's list element if the attribute is part of the list, or NULL_TREE
5308 if not found. If the attribute appears more than once, this only
5309 returns the first occurrence; the TREE_CHAIN of the return value should
5310 be passed back in if further occurrences are wanted. */
5313 lookup_attribute (const char *attr_name
, tree list
)
5316 size_t attr_len
= strlen (attr_name
);
5318 for (l
= list
; l
; l
= TREE_CHAIN (l
))
5320 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5321 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5327 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5331 remove_attribute (const char *attr_name
, tree list
)
5334 size_t attr_len
= strlen (attr_name
);
5336 for (p
= &list
; *p
; )
5339 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
5340 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5341 *p
= TREE_CHAIN (l
);
5343 p
= &TREE_CHAIN (l
);
5349 /* Return an attribute list that is the union of a1 and a2. */
5352 merge_attributes (tree a1
, tree a2
)
5356 /* Either one unset? Take the set one. */
5358 if ((attributes
= a1
) == 0)
5361 /* One that completely contains the other? Take it. */
5363 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5365 if (attribute_list_contained (a2
, a1
))
5369 /* Pick the longest list, and hang on the other list. */
5371 if (list_length (a1
) < list_length (a2
))
5372 attributes
= a2
, a2
= a1
;
5374 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5377 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5379 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5380 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
5385 a1
= copy_node (a2
);
5386 TREE_CHAIN (a1
) = attributes
;
5395 /* Given types T1 and T2, merge their attributes and return
5399 merge_type_attributes (tree t1
, tree t2
)
5401 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5402 TYPE_ATTRIBUTES (t2
));
5405 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5409 merge_decl_attributes (tree olddecl
, tree newdecl
)
5411 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5412 DECL_ATTRIBUTES (newdecl
));
5415 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5417 /* Specialization of merge_decl_attributes for various Windows targets.
5419 This handles the following situation:
5421 __declspec (dllimport) int foo;
5424 The second instance of `foo' nullifies the dllimport. */
5427 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5430 int delete_dllimport_p
= 1;
5432 /* What we need to do here is remove from `old' dllimport if it doesn't
5433 appear in `new'. dllimport behaves like extern: if a declaration is
5434 marked dllimport and a definition appears later, then the object
5435 is not dllimport'd. We also remove a `new' dllimport if the old list
5436 contains dllexport: dllexport always overrides dllimport, regardless
5437 of the order of declaration. */
5438 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5439 delete_dllimport_p
= 0;
5440 else if (DECL_DLLIMPORT_P (new_tree
)
5441 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5443 DECL_DLLIMPORT_P (new_tree
) = 0;
5444 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5445 "dllimport ignored", new_tree
);
5447 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5449 /* Warn about overriding a symbol that has already been used, e.g.:
5450 extern int __attribute__ ((dllimport)) foo;
5451 int* bar () {return &foo;}
5454 if (TREE_USED (old
))
5456 warning (0, "%q+D redeclared without dllimport attribute "
5457 "after being referenced with dll linkage", new_tree
);
5458 /* If we have used a variable's address with dllimport linkage,
5459 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5460 decl may already have had TREE_CONSTANT computed.
5461 We still remove the attribute so that assembler code refers
5462 to '&foo rather than '_imp__foo'. */
5463 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5464 DECL_DLLIMPORT_P (new_tree
) = 1;
5467 /* Let an inline definition silently override the external reference,
5468 but otherwise warn about attribute inconsistency. */
5469 else if (TREE_CODE (new_tree
) == VAR_DECL
5470 || !DECL_DECLARED_INLINE_P (new_tree
))
5471 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5472 "previous dllimport ignored", new_tree
);
5475 delete_dllimport_p
= 0;
5477 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5479 if (delete_dllimport_p
)
5482 const size_t attr_len
= strlen ("dllimport");
5484 /* Scan the list for dllimport and delete it. */
5485 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
5487 if (is_attribute_with_length_p ("dllimport", attr_len
,
5490 if (prev
== NULL_TREE
)
5493 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
5502 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5503 struct attribute_spec.handler. */
5506 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5512 /* These attributes may apply to structure and union types being created,
5513 but otherwise should pass to the declaration involved. */
5516 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5517 | (int) ATTR_FLAG_ARRAY_NEXT
))
5519 *no_add_attrs
= true;
5520 return tree_cons (name
, args
, NULL_TREE
);
5522 if (TREE_CODE (node
) == RECORD_TYPE
5523 || TREE_CODE (node
) == UNION_TYPE
)
5525 node
= TYPE_NAME (node
);
5531 warning (OPT_Wattributes
, "%qE attribute ignored",
5533 *no_add_attrs
= true;
5538 if (TREE_CODE (node
) != FUNCTION_DECL
5539 && TREE_CODE (node
) != VAR_DECL
5540 && TREE_CODE (node
) != TYPE_DECL
)
5542 *no_add_attrs
= true;
5543 warning (OPT_Wattributes
, "%qE attribute ignored",
5548 if (TREE_CODE (node
) == TYPE_DECL
5549 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5550 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5552 *no_add_attrs
= true;
5553 warning (OPT_Wattributes
, "%qE attribute ignored",
5558 is_dllimport
= is_attribute_p ("dllimport", name
);
5560 /* Report error on dllimport ambiguities seen now before they cause
5564 /* Honor any target-specific overrides. */
5565 if (!targetm
.valid_dllimport_attribute_p (node
))
5566 *no_add_attrs
= true;
5568 else if (TREE_CODE (node
) == FUNCTION_DECL
5569 && DECL_DECLARED_INLINE_P (node
))
5571 warning (OPT_Wattributes
, "inline function %q+D declared as "
5572 " dllimport: attribute ignored", node
);
5573 *no_add_attrs
= true;
5575 /* Like MS, treat definition of dllimported variables and
5576 non-inlined functions on declaration as syntax errors. */
5577 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5579 error ("function %q+D definition is marked dllimport", node
);
5580 *no_add_attrs
= true;
5583 else if (TREE_CODE (node
) == VAR_DECL
)
5585 if (DECL_INITIAL (node
))
5587 error ("variable %q+D definition is marked dllimport",
5589 *no_add_attrs
= true;
5592 /* `extern' needn't be specified with dllimport.
5593 Specify `extern' now and hope for the best. Sigh. */
5594 DECL_EXTERNAL (node
) = 1;
5595 /* Also, implicitly give dllimport'd variables declared within
5596 a function global scope, unless declared static. */
5597 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5598 TREE_PUBLIC (node
) = 1;
5601 if (*no_add_attrs
== false)
5602 DECL_DLLIMPORT_P (node
) = 1;
5604 else if (TREE_CODE (node
) == FUNCTION_DECL
5605 && DECL_DECLARED_INLINE_P (node
)
5606 && flag_keep_inline_dllexport
)
5607 /* An exported function, even if inline, must be emitted. */
5608 DECL_EXTERNAL (node
) = 0;
5610 /* Report error if symbol is not accessible at global scope. */
5611 if (!TREE_PUBLIC (node
)
5612 && (TREE_CODE (node
) == VAR_DECL
5613 || TREE_CODE (node
) == FUNCTION_DECL
))
5615 error ("external linkage required for symbol %q+D because of "
5616 "%qE attribute", node
, name
);
5617 *no_add_attrs
= true;
5620 /* A dllexport'd entity must have default visibility so that other
5621 program units (shared libraries or the main executable) can see
5622 it. A dllimport'd entity must have default visibility so that
5623 the linker knows that undefined references within this program
5624 unit can be resolved by the dynamic linker. */
5627 if (DECL_VISIBILITY_SPECIFIED (node
)
5628 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5629 error ("%qE implies default visibility, but %qD has already "
5630 "been declared with a different visibility",
5632 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5633 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5639 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5641 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5642 of the various TYPE_QUAL values. */
5645 set_type_quals (tree type
, int type_quals
)
5647 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5648 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5649 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5650 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5653 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5656 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5658 return (TYPE_QUALS (cand
) == type_quals
5659 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5660 /* Apparently this is needed for Objective-C. */
5661 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5662 /* Check alignment. */
5663 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5664 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5665 TYPE_ATTRIBUTES (base
)));
5668 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5671 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5673 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5674 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5675 /* Apparently this is needed for Objective-C. */
5676 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5677 /* Check alignment. */
5678 && TYPE_ALIGN (cand
) == align
5679 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5680 TYPE_ATTRIBUTES (base
)));
5683 /* Return a version of the TYPE, qualified as indicated by the
5684 TYPE_QUALS, if one exists. If no qualified version exists yet,
5685 return NULL_TREE. */
5688 get_qualified_type (tree type
, int type_quals
)
5692 if (TYPE_QUALS (type
) == type_quals
)
5695 /* Search the chain of variants to see if there is already one there just
5696 like the one we need to have. If so, use that existing one. We must
5697 preserve the TYPE_NAME, since there is code that depends on this. */
5698 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5699 if (check_qualified_type (t
, type
, type_quals
))
5705 /* Like get_qualified_type, but creates the type if it does not
5706 exist. This function never returns NULL_TREE. */
5709 build_qualified_type (tree type
, int type_quals
)
5713 /* See if we already have the appropriate qualified variant. */
5714 t
= get_qualified_type (type
, type_quals
);
5716 /* If not, build it. */
5719 t
= build_variant_type_copy (type
);
5720 set_type_quals (t
, type_quals
);
5722 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5723 /* Propagate structural equality. */
5724 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5725 else if (TYPE_CANONICAL (type
) != type
)
5726 /* Build the underlying canonical type, since it is different
5728 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5731 /* T is its own canonical type. */
5732 TYPE_CANONICAL (t
) = t
;
5739 /* Create a variant of type T with alignment ALIGN. */
5742 build_aligned_type (tree type
, unsigned int align
)
5746 if (TYPE_PACKED (type
)
5747 || TYPE_ALIGN (type
) == align
)
5750 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5751 if (check_aligned_type (t
, type
, align
))
5754 t
= build_variant_type_copy (type
);
5755 TYPE_ALIGN (t
) = align
;
5760 /* Create a new distinct copy of TYPE. The new type is made its own
5761 MAIN_VARIANT. If TYPE requires structural equality checks, the
5762 resulting type requires structural equality checks; otherwise, its
5763 TYPE_CANONICAL points to itself. */
5766 build_distinct_type_copy (tree type
)
5768 tree t
= copy_node (type
);
5770 TYPE_POINTER_TO (t
) = 0;
5771 TYPE_REFERENCE_TO (t
) = 0;
5773 /* Set the canonical type either to a new equivalence class, or
5774 propagate the need for structural equality checks. */
5775 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5776 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5778 TYPE_CANONICAL (t
) = t
;
5780 /* Make it its own variant. */
5781 TYPE_MAIN_VARIANT (t
) = t
;
5782 TYPE_NEXT_VARIANT (t
) = 0;
5784 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5785 whose TREE_TYPE is not t. This can also happen in the Ada
5786 frontend when using subtypes. */
5791 /* Create a new variant of TYPE, equivalent but distinct. This is so
5792 the caller can modify it. TYPE_CANONICAL for the return type will
5793 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5794 are considered equal by the language itself (or that both types
5795 require structural equality checks). */
5798 build_variant_type_copy (tree type
)
5800 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5802 t
= build_distinct_type_copy (type
);
5804 /* Since we're building a variant, assume that it is a non-semantic
5805 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5806 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5808 /* Add the new type to the chain of variants of TYPE. */
5809 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5810 TYPE_NEXT_VARIANT (m
) = t
;
5811 TYPE_MAIN_VARIANT (t
) = m
;
5816 /* Return true if the from tree in both tree maps are equal. */
5819 tree_map_base_eq (const void *va
, const void *vb
)
5821 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5822 *const b
= (const struct tree_map_base
*) vb
;
5823 return (a
->from
== b
->from
);
5826 /* Hash a from tree in a tree_base_map. */
5829 tree_map_base_hash (const void *item
)
5831 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5834 /* Return true if this tree map structure is marked for garbage collection
5835 purposes. We simply return true if the from tree is marked, so that this
5836 structure goes away when the from tree goes away. */
5839 tree_map_base_marked_p (const void *p
)
5841 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5844 /* Hash a from tree in a tree_map. */
5847 tree_map_hash (const void *item
)
5849 return (((const struct tree_map
*) item
)->hash
);
5852 /* Hash a from tree in a tree_decl_map. */
5855 tree_decl_map_hash (const void *item
)
5857 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5860 /* Return the initialization priority for DECL. */
5863 decl_init_priority_lookup (tree decl
)
5865 struct tree_priority_map
*h
;
5866 struct tree_map_base in
;
5868 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5870 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5871 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5874 /* Return the finalization priority for DECL. */
5877 decl_fini_priority_lookup (tree decl
)
5879 struct tree_priority_map
*h
;
5880 struct tree_map_base in
;
5882 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5884 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5885 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5888 /* Return the initialization and finalization priority information for
5889 DECL. If there is no previous priority information, a freshly
5890 allocated structure is returned. */
5892 static struct tree_priority_map
*
5893 decl_priority_info (tree decl
)
5895 struct tree_priority_map in
;
5896 struct tree_priority_map
*h
;
5899 in
.base
.from
= decl
;
5900 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5901 h
= (struct tree_priority_map
*) *loc
;
5904 h
= ggc_alloc_cleared_tree_priority_map ();
5906 h
->base
.from
= decl
;
5907 h
->init
= DEFAULT_INIT_PRIORITY
;
5908 h
->fini
= DEFAULT_INIT_PRIORITY
;
5914 /* Set the initialization priority for DECL to PRIORITY. */
5917 decl_init_priority_insert (tree decl
, priority_type priority
)
5919 struct tree_priority_map
*h
;
5921 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5922 if (priority
== DEFAULT_INIT_PRIORITY
)
5924 h
= decl_priority_info (decl
);
5928 /* Set the finalization priority for DECL to PRIORITY. */
5931 decl_fini_priority_insert (tree decl
, priority_type priority
)
5933 struct tree_priority_map
*h
;
5935 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5936 if (priority
== DEFAULT_INIT_PRIORITY
)
5938 h
= decl_priority_info (decl
);
5942 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5945 print_debug_expr_statistics (void)
5947 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5948 (long) htab_size (debug_expr_for_decl
),
5949 (long) htab_elements (debug_expr_for_decl
),
5950 htab_collisions (debug_expr_for_decl
));
5953 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5956 print_value_expr_statistics (void)
5958 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5959 (long) htab_size (value_expr_for_decl
),
5960 (long) htab_elements (value_expr_for_decl
),
5961 htab_collisions (value_expr_for_decl
));
5964 /* Lookup a debug expression for FROM, and return it if we find one. */
5967 decl_debug_expr_lookup (tree from
)
5969 struct tree_decl_map
*h
, in
;
5970 in
.base
.from
= from
;
5972 h
= (struct tree_decl_map
*)
5973 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
5979 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5982 decl_debug_expr_insert (tree from
, tree to
)
5984 struct tree_decl_map
*h
;
5987 h
= ggc_alloc_tree_decl_map ();
5988 h
->base
.from
= from
;
5990 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
5992 *(struct tree_decl_map
**) loc
= h
;
5995 /* Lookup a value expression for FROM, and return it if we find one. */
5998 decl_value_expr_lookup (tree from
)
6000 struct tree_decl_map
*h
, in
;
6001 in
.base
.from
= from
;
6003 h
= (struct tree_decl_map
*)
6004 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6010 /* Insert a mapping FROM->TO in the value expression hashtable. */
6013 decl_value_expr_insert (tree from
, tree to
)
6015 struct tree_decl_map
*h
;
6018 h
= ggc_alloc_tree_decl_map ();
6019 h
->base
.from
= from
;
6021 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6023 *(struct tree_decl_map
**) loc
= h
;
6026 /* Hashing of types so that we don't make duplicates.
6027 The entry point is `type_hash_canon'. */
6029 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6030 with types in the TREE_VALUE slots), by adding the hash codes
6031 of the individual types. */
6034 type_hash_list (const_tree list
, hashval_t hashcode
)
6038 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6039 if (TREE_VALUE (tail
) != error_mark_node
)
6040 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6046 /* These are the Hashtable callback functions. */
6048 /* Returns true iff the types are equivalent. */
6051 type_hash_eq (const void *va
, const void *vb
)
6053 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6054 *const b
= (const struct type_hash
*) vb
;
6056 /* First test the things that are the same for all types. */
6057 if (a
->hash
!= b
->hash
6058 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6059 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6060 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6061 TYPE_ATTRIBUTES (b
->type
))
6062 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6063 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6066 /* Be careful about comparing arrays before and after the element type
6067 has been completed; don't compare TYPE_ALIGN unless both types are
6069 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6070 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6071 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6074 switch (TREE_CODE (a
->type
))
6079 case REFERENCE_TYPE
:
6083 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6086 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6087 && !(TYPE_VALUES (a
->type
)
6088 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6089 && TYPE_VALUES (b
->type
)
6090 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6091 && type_list_equal (TYPE_VALUES (a
->type
),
6092 TYPE_VALUES (b
->type
))))
6095 /* ... fall through ... */
6100 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6101 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6102 TYPE_MAX_VALUE (b
->type
)))
6103 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6104 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6105 TYPE_MIN_VALUE (b
->type
))));
6107 case FIXED_POINT_TYPE
:
6108 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6111 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6114 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6115 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6116 || (TYPE_ARG_TYPES (a
->type
)
6117 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6118 && TYPE_ARG_TYPES (b
->type
)
6119 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6120 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6121 TYPE_ARG_TYPES (b
->type
)))))
6125 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6129 case QUAL_UNION_TYPE
:
6130 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6131 || (TYPE_FIELDS (a
->type
)
6132 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6133 && TYPE_FIELDS (b
->type
)
6134 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6135 && type_list_equal (TYPE_FIELDS (a
->type
),
6136 TYPE_FIELDS (b
->type
))));
6139 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6140 || (TYPE_ARG_TYPES (a
->type
)
6141 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6142 && TYPE_ARG_TYPES (b
->type
)
6143 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6144 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6145 TYPE_ARG_TYPES (b
->type
))))
6153 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6154 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6159 /* Return the cached hash value. */
6162 type_hash_hash (const void *item
)
6164 return ((const struct type_hash
*) item
)->hash
;
6167 /* Look in the type hash table for a type isomorphic to TYPE.
6168 If one is found, return it. Otherwise return 0. */
6171 type_hash_lookup (hashval_t hashcode
, tree type
)
6173 struct type_hash
*h
, in
;
6175 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6176 must call that routine before comparing TYPE_ALIGNs. */
6182 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6189 /* Add an entry to the type-hash-table
6190 for a type TYPE whose hash code is HASHCODE. */
6193 type_hash_add (hashval_t hashcode
, tree type
)
6195 struct type_hash
*h
;
6198 h
= ggc_alloc_type_hash ();
6201 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6205 /* Given TYPE, and HASHCODE its hash code, return the canonical
6206 object for an identical type if one already exists.
6207 Otherwise, return TYPE, and record it as the canonical object.
6209 To use this function, first create a type of the sort you want.
6210 Then compute its hash code from the fields of the type that
6211 make it different from other similar types.
6212 Then call this function and use the value. */
6215 type_hash_canon (unsigned int hashcode
, tree type
)
6219 /* The hash table only contains main variants, so ensure that's what we're
6221 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6223 /* See if the type is in the hash table already. If so, return it.
6224 Otherwise, add the type. */
6225 t1
= type_hash_lookup (hashcode
, type
);
6228 #ifdef GATHER_STATISTICS
6229 tree_node_counts
[(int) t_kind
]--;
6230 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
6236 type_hash_add (hashcode
, type
);
6241 /* See if the data pointed to by the type hash table is marked. We consider
6242 it marked if the type is marked or if a debug type number or symbol
6243 table entry has been made for the type. */
6246 type_hash_marked_p (const void *p
)
6248 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6250 return ggc_marked_p (type
);
6254 print_type_hash_statistics (void)
6256 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6257 (long) htab_size (type_hash_table
),
6258 (long) htab_elements (type_hash_table
),
6259 htab_collisions (type_hash_table
));
6262 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6263 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6264 by adding the hash codes of the individual attributes. */
6267 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6271 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6272 /* ??? Do we want to add in TREE_VALUE too? */
6273 hashcode
= iterative_hash_object
6274 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6278 /* Given two lists of attributes, return true if list l2 is
6279 equivalent to l1. */
6282 attribute_list_equal (const_tree l1
, const_tree l2
)
6284 return attribute_list_contained (l1
, l2
)
6285 && attribute_list_contained (l2
, l1
);
6288 /* Given two lists of attributes, return true if list L2 is
6289 completely contained within L1. */
6290 /* ??? This would be faster if attribute names were stored in a canonicalized
6291 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6292 must be used to show these elements are equivalent (which they are). */
6293 /* ??? It's not clear that attributes with arguments will always be handled
6297 attribute_list_contained (const_tree l1
, const_tree l2
)
6301 /* First check the obvious, maybe the lists are identical. */
6305 /* Maybe the lists are similar. */
6306 for (t1
= l1
, t2
= l2
;
6308 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6309 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6310 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
6312 /* Maybe the lists are equal. */
6313 if (t1
== 0 && t2
== 0)
6316 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6319 /* This CONST_CAST is okay because lookup_attribute does not
6320 modify its argument and the return value is assigned to a
6322 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6323 CONST_CAST_TREE(l1
));
6324 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6325 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
6329 if (attr
== NULL_TREE
)
6336 /* Given two lists of types
6337 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6338 return 1 if the lists contain the same types in the same order.
6339 Also, the TREE_PURPOSEs must match. */
6342 type_list_equal (const_tree l1
, const_tree l2
)
6346 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6347 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6348 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6349 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6350 && (TREE_TYPE (TREE_PURPOSE (t1
))
6351 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6357 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6358 given by TYPE. If the argument list accepts variable arguments,
6359 then this function counts only the ordinary arguments. */
6362 type_num_arguments (const_tree type
)
6367 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6368 /* If the function does not take a variable number of arguments,
6369 the last element in the list will have type `void'. */
6370 if (VOID_TYPE_P (TREE_VALUE (t
)))
6378 /* Nonzero if integer constants T1 and T2
6379 represent the same constant value. */
6382 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6387 if (t1
== 0 || t2
== 0)
6390 if (TREE_CODE (t1
) == INTEGER_CST
6391 && TREE_CODE (t2
) == INTEGER_CST
6392 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6393 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6399 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6400 The precise way of comparison depends on their data type. */
6403 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6408 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6410 int t1_sgn
= tree_int_cst_sgn (t1
);
6411 int t2_sgn
= tree_int_cst_sgn (t2
);
6413 if (t1_sgn
< t2_sgn
)
6415 else if (t1_sgn
> t2_sgn
)
6417 /* Otherwise, both are non-negative, so we compare them as
6418 unsigned just in case one of them would overflow a signed
6421 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6422 return INT_CST_LT (t1
, t2
);
6424 return INT_CST_LT_UNSIGNED (t1
, t2
);
6427 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6430 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6432 if (tree_int_cst_lt (t1
, t2
))
6434 else if (tree_int_cst_lt (t2
, t1
))
6440 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6441 the host. If POS is zero, the value can be represented in a single
6442 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6443 be represented in a single unsigned HOST_WIDE_INT. */
6446 host_integerp (const_tree t
, int pos
)
6451 return (TREE_CODE (t
) == INTEGER_CST
6452 && ((TREE_INT_CST_HIGH (t
) == 0
6453 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6454 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6455 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6456 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6457 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6458 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6459 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6462 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6463 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6464 be non-negative. We must be able to satisfy the above conditions. */
6467 tree_low_cst (const_tree t
, int pos
)
6469 gcc_assert (host_integerp (t
, pos
));
6470 return TREE_INT_CST_LOW (t
);
6473 /* Return the most significant bit of the integer constant T. */
6476 tree_int_cst_msb (const_tree t
)
6480 unsigned HOST_WIDE_INT l
;
6482 /* Note that using TYPE_PRECISION here is wrong. We care about the
6483 actual bits, not the (arbitrary) range of the type. */
6484 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
6485 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
6486 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
6487 return (l
& 1) == 1;
6490 /* Return an indication of the sign of the integer constant T.
6491 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6492 Note that -1 will never be returned if T's type is unsigned. */
6495 tree_int_cst_sgn (const_tree t
)
6497 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6499 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6501 else if (TREE_INT_CST_HIGH (t
) < 0)
6507 /* Return the minimum number of bits needed to represent VALUE in a
6508 signed or unsigned type, UNSIGNEDP says which. */
6511 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6515 /* If the value is negative, compute its negative minus 1. The latter
6516 adjustment is because the absolute value of the largest negative value
6517 is one larger than the largest positive value. This is equivalent to
6518 a bit-wise negation, so use that operation instead. */
6520 if (tree_int_cst_sgn (value
) < 0)
6521 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6523 /* Return the number of bits needed, taking into account the fact
6524 that we need one more bit for a signed than unsigned type. */
6526 if (integer_zerop (value
))
6529 log
= tree_floor_log2 (value
);
6531 return log
+ 1 + !unsignedp
;
6534 /* Compare two constructor-element-type constants. Return 1 if the lists
6535 are known to be equal; otherwise return 0. */
6538 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6540 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6542 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6545 l1
= TREE_CHAIN (l1
);
6546 l2
= TREE_CHAIN (l2
);
6552 /* Return truthvalue of whether T1 is the same tree structure as T2.
6553 Return 1 if they are the same.
6554 Return 0 if they are understandably different.
6555 Return -1 if either contains tree structure not understood by
6559 simple_cst_equal (const_tree t1
, const_tree t2
)
6561 enum tree_code code1
, code2
;
6567 if (t1
== 0 || t2
== 0)
6570 code1
= TREE_CODE (t1
);
6571 code2
= TREE_CODE (t2
);
6573 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6575 if (CONVERT_EXPR_CODE_P (code2
)
6576 || code2
== NON_LVALUE_EXPR
)
6577 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6579 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6582 else if (CONVERT_EXPR_CODE_P (code2
)
6583 || code2
== NON_LVALUE_EXPR
)
6584 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6592 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6593 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6596 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6599 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6602 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6603 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6604 TREE_STRING_LENGTH (t1
)));
6608 unsigned HOST_WIDE_INT idx
;
6609 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6610 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6612 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6615 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6616 /* ??? Should we handle also fields here? */
6617 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6618 VEC_index (constructor_elt
, v2
, idx
)->value
))
6624 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6627 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6630 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6633 const_tree arg1
, arg2
;
6634 const_call_expr_arg_iterator iter1
, iter2
;
6635 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6636 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6638 arg1
= next_const_call_expr_arg (&iter1
),
6639 arg2
= next_const_call_expr_arg (&iter2
))
6641 cmp
= simple_cst_equal (arg1
, arg2
);
6645 return arg1
== arg2
;
6649 /* Special case: if either target is an unallocated VAR_DECL,
6650 it means that it's going to be unified with whatever the
6651 TARGET_EXPR is really supposed to initialize, so treat it
6652 as being equivalent to anything. */
6653 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6654 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6655 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6656 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6657 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6658 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6661 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6666 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6668 case WITH_CLEANUP_EXPR
:
6669 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6673 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6676 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6677 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6691 /* This general rule works for most tree codes. All exceptions should be
6692 handled above. If this is a language-specific tree code, we can't
6693 trust what might be in the operand, so say we don't know
6695 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6698 switch (TREE_CODE_CLASS (code1
))
6702 case tcc_comparison
:
6703 case tcc_expression
:
6707 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6709 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6721 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6722 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6723 than U, respectively. */
6726 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6728 if (tree_int_cst_sgn (t
) < 0)
6730 else if (TREE_INT_CST_HIGH (t
) != 0)
6732 else if (TREE_INT_CST_LOW (t
) == u
)
6734 else if (TREE_INT_CST_LOW (t
) < u
)
6740 /* Return true if CODE represents an associative tree code. Otherwise
6743 associative_tree_code (enum tree_code code
)
6762 /* Return true if CODE represents a commutative tree code. Otherwise
6765 commutative_tree_code (enum tree_code code
)
6778 case UNORDERED_EXPR
:
6782 case TRUTH_AND_EXPR
:
6783 case TRUTH_XOR_EXPR
:
6793 /* Return true if CODE represents a ternary tree code for which the
6794 first two operands are commutative. Otherwise return false. */
6796 commutative_ternary_tree_code (enum tree_code code
)
6800 case WIDEN_MULT_PLUS_EXPR
:
6801 case WIDEN_MULT_MINUS_EXPR
:
6810 /* Generate a hash value for an expression. This can be used iteratively
6811 by passing a previous result as the VAL argument.
6813 This function is intended to produce the same hash for expressions which
6814 would compare equal using operand_equal_p. */
6817 iterative_hash_expr (const_tree t
, hashval_t val
)
6820 enum tree_code code
;
6824 return iterative_hash_hashval_t (0, val
);
6826 code
= TREE_CODE (t
);
6830 /* Alas, constants aren't shared, so we can't rely on pointer
6833 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6834 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6837 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6839 return iterative_hash_hashval_t (val2
, val
);
6843 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6845 return iterative_hash_hashval_t (val2
, val
);
6848 return iterative_hash (TREE_STRING_POINTER (t
),
6849 TREE_STRING_LENGTH (t
), val
);
6851 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6852 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6854 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6856 /* We can just compare by pointer. */
6857 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6858 case PLACEHOLDER_EXPR
:
6859 /* The node itself doesn't matter. */
6862 /* A list of expressions, for a CALL_EXPR or as the elements of a
6864 for (; t
; t
= TREE_CHAIN (t
))
6865 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6869 unsigned HOST_WIDE_INT idx
;
6871 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6873 val
= iterative_hash_expr (field
, val
);
6874 val
= iterative_hash_expr (value
, val
);
6880 /* The type of the second operand is relevant, except for
6881 its top-level qualifiers. */
6882 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
6884 val
= iterative_hash_object (TYPE_HASH (type
), val
);
6886 /* We could use the standard hash computation from this point
6888 val
= iterative_hash_object (code
, val
);
6889 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
6890 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6894 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6895 Otherwise nodes that compare equal according to operand_equal_p might
6896 get different hash codes. However, don't do this for machine specific
6897 or front end builtins, since the function code is overloaded in those
6899 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6900 && built_in_decls
[DECL_FUNCTION_CODE (t
)])
6902 t
= built_in_decls
[DECL_FUNCTION_CODE (t
)];
6903 code
= TREE_CODE (t
);
6907 tclass
= TREE_CODE_CLASS (code
);
6909 if (tclass
== tcc_declaration
)
6911 /* DECL's have a unique ID */
6912 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6916 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6918 val
= iterative_hash_object (code
, val
);
6920 /* Don't hash the type, that can lead to having nodes which
6921 compare equal according to operand_equal_p, but which
6922 have different hash codes. */
6923 if (CONVERT_EXPR_CODE_P (code
)
6924 || code
== NON_LVALUE_EXPR
)
6926 /* Make sure to include signness in the hash computation. */
6927 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6928 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6931 else if (commutative_tree_code (code
))
6933 /* It's a commutative expression. We want to hash it the same
6934 however it appears. We do this by first hashing both operands
6935 and then rehashing based on the order of their independent
6937 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6938 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6942 t
= one
, one
= two
, two
= t
;
6944 val
= iterative_hash_hashval_t (one
, val
);
6945 val
= iterative_hash_hashval_t (two
, val
);
6948 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6949 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6956 /* Generate a hash value for a pair of expressions. This can be used
6957 iteratively by passing a previous result as the VAL argument.
6959 The same hash value is always returned for a given pair of expressions,
6960 regardless of the order in which they are presented. This is useful in
6961 hashing the operands of commutative functions. */
6964 iterative_hash_exprs_commutative (const_tree t1
,
6965 const_tree t2
, hashval_t val
)
6967 hashval_t one
= iterative_hash_expr (t1
, 0);
6968 hashval_t two
= iterative_hash_expr (t2
, 0);
6972 t
= one
, one
= two
, two
= t
;
6973 val
= iterative_hash_hashval_t (one
, val
);
6974 val
= iterative_hash_hashval_t (two
, val
);
6979 /* Constructors for pointer, array and function types.
6980 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
6981 constructed by language-dependent code, not here.) */
6983 /* Construct, lay out and return the type of pointers to TO_TYPE with
6984 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
6985 reference all of memory. If such a type has already been
6986 constructed, reuse it. */
6989 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
6994 if (to_type
== error_mark_node
)
6995 return error_mark_node
;
6997 /* If the pointed-to type has the may_alias attribute set, force
6998 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
6999 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7000 can_alias_all
= true;
7002 /* In some cases, languages will have things that aren't a POINTER_TYPE
7003 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7004 In that case, return that type without regard to the rest of our
7007 ??? This is a kludge, but consistent with the way this function has
7008 always operated and there doesn't seem to be a good way to avoid this
7010 if (TYPE_POINTER_TO (to_type
) != 0
7011 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7012 return TYPE_POINTER_TO (to_type
);
7014 /* First, if we already have a type for pointers to TO_TYPE and it's
7015 the proper mode, use it. */
7016 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7017 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7020 t
= make_node (POINTER_TYPE
);
7022 TREE_TYPE (t
) = to_type
;
7023 SET_TYPE_MODE (t
, mode
);
7024 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7025 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7026 TYPE_POINTER_TO (to_type
) = t
;
7028 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7029 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7030 else if (TYPE_CANONICAL (to_type
) != to_type
)
7032 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7033 mode
, can_alias_all
);
7035 /* Lay out the type. This function has many callers that are concerned
7036 with expression-construction, and this simplifies them all. */
7042 /* By default build pointers in ptr_mode. */
7045 build_pointer_type (tree to_type
)
7047 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7048 : TYPE_ADDR_SPACE (to_type
);
7049 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7050 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7053 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7056 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7061 if (to_type
== error_mark_node
)
7062 return error_mark_node
;
7064 /* If the pointed-to type has the may_alias attribute set, force
7065 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7066 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7067 can_alias_all
= true;
7069 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7070 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7071 In that case, return that type without regard to the rest of our
7074 ??? This is a kludge, but consistent with the way this function has
7075 always operated and there doesn't seem to be a good way to avoid this
7077 if (TYPE_REFERENCE_TO (to_type
) != 0
7078 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7079 return TYPE_REFERENCE_TO (to_type
);
7081 /* First, if we already have a type for pointers to TO_TYPE and it's
7082 the proper mode, use it. */
7083 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7084 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7087 t
= make_node (REFERENCE_TYPE
);
7089 TREE_TYPE (t
) = to_type
;
7090 SET_TYPE_MODE (t
, mode
);
7091 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7092 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7093 TYPE_REFERENCE_TO (to_type
) = t
;
7095 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7096 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7097 else if (TYPE_CANONICAL (to_type
) != to_type
)
7099 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7100 mode
, can_alias_all
);
7108 /* Build the node for the type of references-to-TO_TYPE by default
7112 build_reference_type (tree to_type
)
7114 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7115 : TYPE_ADDR_SPACE (to_type
);
7116 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7117 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7120 /* Build a type that is compatible with t but has no cv quals anywhere
7123 const char *const *const * -> char ***. */
7126 build_type_no_quals (tree t
)
7128 switch (TREE_CODE (t
))
7131 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7133 TYPE_REF_CAN_ALIAS_ALL (t
));
7134 case REFERENCE_TYPE
:
7136 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7138 TYPE_REF_CAN_ALIAS_ALL (t
));
7140 return TYPE_MAIN_VARIANT (t
);
7144 #define MAX_INT_CACHED_PREC \
7145 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7146 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7148 /* Builds a signed or unsigned integer type of precision PRECISION.
7149 Used for C bitfields whose precision does not match that of
7150 built-in target types. */
7152 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7158 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7160 if (precision
<= MAX_INT_CACHED_PREC
)
7162 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7167 itype
= make_node (INTEGER_TYPE
);
7168 TYPE_PRECISION (itype
) = precision
;
7171 fixup_unsigned_type (itype
);
7173 fixup_signed_type (itype
);
7176 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7177 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7178 if (precision
<= MAX_INT_CACHED_PREC
)
7179 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7184 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7185 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7186 is true, reuse such a type that has already been constructed. */
7189 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7191 tree itype
= make_node (INTEGER_TYPE
);
7192 hashval_t hashcode
= 0;
7194 TREE_TYPE (itype
) = type
;
7196 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7197 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7199 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7200 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7201 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7202 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7203 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7204 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7209 if ((TYPE_MIN_VALUE (itype
)
7210 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7211 || (TYPE_MAX_VALUE (itype
)
7212 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7214 /* Since we cannot reliably merge this type, we need to compare it using
7215 structural equality checks. */
7216 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7220 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7221 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7222 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7223 itype
= type_hash_canon (hashcode
, itype
);
7228 /* Wrapper around build_range_type_1 with SHARED set to true. */
7231 build_range_type (tree type
, tree lowval
, tree highval
)
7233 return build_range_type_1 (type
, lowval
, highval
, true);
7236 /* Wrapper around build_range_type_1 with SHARED set to false. */
7239 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7241 return build_range_type_1 (type
, lowval
, highval
, false);
7244 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7245 MAXVAL should be the maximum value in the domain
7246 (one less than the length of the array).
7248 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7249 We don't enforce this limit, that is up to caller (e.g. language front end).
7250 The limit exists because the result is a signed type and we don't handle
7251 sizes that use more than one HOST_WIDE_INT. */
7254 build_index_type (tree maxval
)
7256 return build_range_type (sizetype
, size_zero_node
, maxval
);
7259 /* Return true if the debug information for TYPE, a subtype, should be emitted
7260 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7261 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7262 debug info and doesn't reflect the source code. */
7265 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7267 tree base_type
= TREE_TYPE (type
), low
, high
;
7269 /* Subrange types have a base type which is an integral type. */
7270 if (!INTEGRAL_TYPE_P (base_type
))
7273 /* Get the real bounds of the subtype. */
7274 if (lang_hooks
.types
.get_subrange_bounds
)
7275 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7278 low
= TYPE_MIN_VALUE (type
);
7279 high
= TYPE_MAX_VALUE (type
);
7282 /* If the type and its base type have the same representation and the same
7283 name, then the type is not a subrange but a copy of the base type. */
7284 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7285 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7286 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7287 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7288 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7290 tree type_name
= TYPE_NAME (type
);
7291 tree base_type_name
= TYPE_NAME (base_type
);
7293 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7294 type_name
= DECL_NAME (type_name
);
7296 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7297 base_type_name
= DECL_NAME (base_type_name
);
7299 if (type_name
== base_type_name
)
7310 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7311 and number of elements specified by the range of values of INDEX_TYPE.
7312 If SHARED is true, reuse such a type that has already been constructed. */
7315 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7319 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7321 error ("arrays of functions are not meaningful");
7322 elt_type
= integer_type_node
;
7325 t
= make_node (ARRAY_TYPE
);
7326 TREE_TYPE (t
) = elt_type
;
7327 TYPE_DOMAIN (t
) = index_type
;
7328 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7331 /* If the element type is incomplete at this point we get marked for
7332 structural equality. Do not record these types in the canonical
7334 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7339 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7341 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7342 t
= type_hash_canon (hashcode
, t
);
7345 if (TYPE_CANONICAL (t
) == t
)
7347 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7348 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7349 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7350 else if (TYPE_CANONICAL (elt_type
) != elt_type
7351 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7353 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7355 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7362 /* Wrapper around build_array_type_1 with SHARED set to true. */
7365 build_array_type (tree elt_type
, tree index_type
)
7367 return build_array_type_1 (elt_type
, index_type
, true);
7370 /* Wrapper around build_array_type_1 with SHARED set to false. */
7373 build_nonshared_array_type (tree elt_type
, tree index_type
)
7375 return build_array_type_1 (elt_type
, index_type
, false);
7378 /* Recursively examines the array elements of TYPE, until a non-array
7379 element type is found. */
7382 strip_array_types (tree type
)
7384 while (TREE_CODE (type
) == ARRAY_TYPE
)
7385 type
= TREE_TYPE (type
);
7390 /* Computes the canonical argument types from the argument type list
7393 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7394 on entry to this function, or if any of the ARGTYPES are
7397 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7398 true on entry to this function, or if any of the ARGTYPES are
7401 Returns a canonical argument list, which may be ARGTYPES when the
7402 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7403 true) or would not differ from ARGTYPES. */
7406 maybe_canonicalize_argtypes(tree argtypes
,
7407 bool *any_structural_p
,
7408 bool *any_noncanonical_p
)
7411 bool any_noncanonical_argtypes_p
= false;
7413 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7415 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7416 /* Fail gracefully by stating that the type is structural. */
7417 *any_structural_p
= true;
7418 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7419 *any_structural_p
= true;
7420 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7421 || TREE_PURPOSE (arg
))
7422 /* If the argument has a default argument, we consider it
7423 non-canonical even though the type itself is canonical.
7424 That way, different variants of function and method types
7425 with default arguments will all point to the variant with
7426 no defaults as their canonical type. */
7427 any_noncanonical_argtypes_p
= true;
7430 if (*any_structural_p
)
7433 if (any_noncanonical_argtypes_p
)
7435 /* Build the canonical list of argument types. */
7436 tree canon_argtypes
= NULL_TREE
;
7437 bool is_void
= false;
7439 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7441 if (arg
== void_list_node
)
7444 canon_argtypes
= tree_cons (NULL_TREE
,
7445 TYPE_CANONICAL (TREE_VALUE (arg
)),
7449 canon_argtypes
= nreverse (canon_argtypes
);
7451 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7453 /* There is a non-canonical type. */
7454 *any_noncanonical_p
= true;
7455 return canon_argtypes
;
7458 /* The canonical argument types are the same as ARGTYPES. */
7462 /* Construct, lay out and return
7463 the type of functions returning type VALUE_TYPE
7464 given arguments of types ARG_TYPES.
7465 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7466 are data type nodes for the arguments of the function.
7467 If such a type has already been constructed, reuse it. */
7470 build_function_type (tree value_type
, tree arg_types
)
7473 hashval_t hashcode
= 0;
7474 bool any_structural_p
, any_noncanonical_p
;
7475 tree canon_argtypes
;
7477 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7479 error ("function return type cannot be function");
7480 value_type
= integer_type_node
;
7483 /* Make a node of the sort we want. */
7484 t
= make_node (FUNCTION_TYPE
);
7485 TREE_TYPE (t
) = value_type
;
7486 TYPE_ARG_TYPES (t
) = arg_types
;
7488 /* If we already have such a type, use the old one. */
7489 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7490 hashcode
= type_hash_list (arg_types
, hashcode
);
7491 t
= type_hash_canon (hashcode
, t
);
7493 /* Set up the canonical type. */
7494 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7495 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7496 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7498 &any_noncanonical_p
);
7499 if (any_structural_p
)
7500 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7501 else if (any_noncanonical_p
)
7502 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7505 if (!COMPLETE_TYPE_P (t
))
7510 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7513 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7515 tree new_type
= NULL
;
7516 tree args
, new_args
= NULL
, t
;
7520 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7521 args
= TREE_CHAIN (args
), i
++)
7522 if (!bitmap_bit_p (args_to_skip
, i
))
7523 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7525 new_reversed
= nreverse (new_args
);
7529 TREE_CHAIN (new_args
) = void_list_node
;
7531 new_reversed
= void_list_node
;
7534 /* Use copy_node to preserve as much as possible from original type
7535 (debug info, attribute lists etc.)
7536 Exception is METHOD_TYPEs must have THIS argument.
7537 When we are asked to remove it, we need to build new FUNCTION_TYPE
7539 if (TREE_CODE (orig_type
) != METHOD_TYPE
7540 || !bitmap_bit_p (args_to_skip
, 0))
7542 new_type
= build_distinct_type_copy (orig_type
);
7543 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7548 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7550 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7553 /* This is a new type, not a copy of an old type. Need to reassociate
7554 variants. We can handle everything except the main variant lazily. */
7555 t
= TYPE_MAIN_VARIANT (orig_type
);
7558 TYPE_MAIN_VARIANT (new_type
) = t
;
7559 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7560 TYPE_NEXT_VARIANT (t
) = new_type
;
7564 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7565 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7570 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7572 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7573 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7574 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7577 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7579 tree new_decl
= copy_node (orig_decl
);
7582 new_type
= TREE_TYPE (orig_decl
);
7583 if (prototype_p (new_type
))
7584 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7585 TREE_TYPE (new_decl
) = new_type
;
7587 /* For declarations setting DECL_VINDEX (i.e. methods)
7588 we expect first argument to be THIS pointer. */
7589 if (bitmap_bit_p (args_to_skip
, 0))
7590 DECL_VINDEX (new_decl
) = NULL_TREE
;
7592 /* When signature changes, we need to clear builtin info. */
7593 if (DECL_BUILT_IN (new_decl
) && !bitmap_empty_p (args_to_skip
))
7595 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7596 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7601 /* Build a function type. The RETURN_TYPE is the type returned by the
7602 function. If VAARGS is set, no void_type_node is appended to the
7603 the list. ARGP must be always be terminated be a NULL_TREE. */
7606 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7610 t
= va_arg (argp
, tree
);
7611 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7612 args
= tree_cons (NULL_TREE
, t
, args
);
7617 if (args
!= NULL_TREE
)
7618 args
= nreverse (args
);
7619 gcc_assert (last
!= void_list_node
);
7621 else if (args
== NULL_TREE
)
7622 args
= void_list_node
;
7626 args
= nreverse (args
);
7627 TREE_CHAIN (last
) = void_list_node
;
7629 args
= build_function_type (return_type
, args
);
7634 /* Build a function type. The RETURN_TYPE is the type returned by the
7635 function. If additional arguments are provided, they are
7636 additional argument types. The list of argument types must always
7637 be terminated by NULL_TREE. */
7640 build_function_type_list (tree return_type
, ...)
7645 va_start (p
, return_type
);
7646 args
= build_function_type_list_1 (false, return_type
, p
);
7651 /* Build a variable argument function type. The RETURN_TYPE is the
7652 type returned by the function. If additional arguments are provided,
7653 they are additional argument types. The list of argument types must
7654 always be terminated by NULL_TREE. */
7657 build_varargs_function_type_list (tree return_type
, ...)
7662 va_start (p
, return_type
);
7663 args
= build_function_type_list_1 (true, return_type
, p
);
7669 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7670 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7671 for the method. An implicit additional parameter (of type
7672 pointer-to-BASETYPE) is added to the ARGTYPES. */
7675 build_method_type_directly (tree basetype
,
7682 bool any_structural_p
, any_noncanonical_p
;
7683 tree canon_argtypes
;
7685 /* Make a node of the sort we want. */
7686 t
= make_node (METHOD_TYPE
);
7688 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7689 TREE_TYPE (t
) = rettype
;
7690 ptype
= build_pointer_type (basetype
);
7692 /* The actual arglist for this function includes a "hidden" argument
7693 which is "this". Put it into the list of argument types. */
7694 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7695 TYPE_ARG_TYPES (t
) = argtypes
;
7697 /* If we already have such a type, use the old one. */
7698 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7699 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7700 hashcode
= type_hash_list (argtypes
, hashcode
);
7701 t
= type_hash_canon (hashcode
, t
);
7703 /* Set up the canonical type. */
7705 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7706 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7708 = (TYPE_CANONICAL (basetype
) != basetype
7709 || TYPE_CANONICAL (rettype
) != rettype
);
7710 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7712 &any_noncanonical_p
);
7713 if (any_structural_p
)
7714 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7715 else if (any_noncanonical_p
)
7717 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7718 TYPE_CANONICAL (rettype
),
7720 if (!COMPLETE_TYPE_P (t
))
7726 /* Construct, lay out and return the type of methods belonging to class
7727 BASETYPE and whose arguments and values are described by TYPE.
7728 If that type exists already, reuse it.
7729 TYPE must be a FUNCTION_TYPE node. */
7732 build_method_type (tree basetype
, tree type
)
7734 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7736 return build_method_type_directly (basetype
,
7738 TYPE_ARG_TYPES (type
));
7741 /* Construct, lay out and return the type of offsets to a value
7742 of type TYPE, within an object of type BASETYPE.
7743 If a suitable offset type exists already, reuse it. */
7746 build_offset_type (tree basetype
, tree type
)
7749 hashval_t hashcode
= 0;
7751 /* Make a node of the sort we want. */
7752 t
= make_node (OFFSET_TYPE
);
7754 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7755 TREE_TYPE (t
) = type
;
7757 /* If we already have such a type, use the old one. */
7758 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7759 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7760 t
= type_hash_canon (hashcode
, t
);
7762 if (!COMPLETE_TYPE_P (t
))
7765 if (TYPE_CANONICAL (t
) == t
)
7767 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7768 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7769 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7770 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7771 || TYPE_CANONICAL (type
) != type
)
7773 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7774 TYPE_CANONICAL (type
));
7780 /* Create a complex type whose components are COMPONENT_TYPE. */
7783 build_complex_type (tree component_type
)
7788 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7789 || SCALAR_FLOAT_TYPE_P (component_type
)
7790 || FIXED_POINT_TYPE_P (component_type
));
7792 /* Make a node of the sort we want. */
7793 t
= make_node (COMPLEX_TYPE
);
7795 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7797 /* If we already have such a type, use the old one. */
7798 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7799 t
= type_hash_canon (hashcode
, t
);
7801 if (!COMPLETE_TYPE_P (t
))
7804 if (TYPE_CANONICAL (t
) == t
)
7806 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7807 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7808 else if (TYPE_CANONICAL (component_type
) != component_type
)
7810 = build_complex_type (TYPE_CANONICAL (component_type
));
7813 /* We need to create a name, since complex is a fundamental type. */
7814 if (! TYPE_NAME (t
))
7817 if (component_type
== char_type_node
)
7818 name
= "complex char";
7819 else if (component_type
== signed_char_type_node
)
7820 name
= "complex signed char";
7821 else if (component_type
== unsigned_char_type_node
)
7822 name
= "complex unsigned char";
7823 else if (component_type
== short_integer_type_node
)
7824 name
= "complex short int";
7825 else if (component_type
== short_unsigned_type_node
)
7826 name
= "complex short unsigned int";
7827 else if (component_type
== integer_type_node
)
7828 name
= "complex int";
7829 else if (component_type
== unsigned_type_node
)
7830 name
= "complex unsigned int";
7831 else if (component_type
== long_integer_type_node
)
7832 name
= "complex long int";
7833 else if (component_type
== long_unsigned_type_node
)
7834 name
= "complex long unsigned int";
7835 else if (component_type
== long_long_integer_type_node
)
7836 name
= "complex long long int";
7837 else if (component_type
== long_long_unsigned_type_node
)
7838 name
= "complex long long unsigned int";
7843 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7844 get_identifier (name
), t
);
7847 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7850 /* If TYPE is a real or complex floating-point type and the target
7851 does not directly support arithmetic on TYPE then return the wider
7852 type to be used for arithmetic on TYPE. Otherwise, return
7856 excess_precision_type (tree type
)
7858 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7860 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7861 switch (TREE_CODE (type
))
7864 switch (flt_eval_method
)
7867 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7868 return double_type_node
;
7871 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7872 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7873 return long_double_type_node
;
7880 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7882 switch (flt_eval_method
)
7885 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7886 return complex_double_type_node
;
7889 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7890 || (TYPE_MODE (TREE_TYPE (type
))
7891 == TYPE_MODE (double_type_node
)))
7892 return complex_long_double_type_node
;
7905 /* Return OP, stripped of any conversions to wider types as much as is safe.
7906 Converting the value back to OP's type makes a value equivalent to OP.
7908 If FOR_TYPE is nonzero, we return a value which, if converted to
7909 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7911 OP must have integer, real or enumeral type. Pointers are not allowed!
7913 There are some cases where the obvious value we could return
7914 would regenerate to OP if converted to OP's type,
7915 but would not extend like OP to wider types.
7916 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
7917 For example, if OP is (unsigned short)(signed char)-1,
7918 we avoid returning (signed char)-1 if FOR_TYPE is int,
7919 even though extending that to an unsigned short would regenerate OP,
7920 since the result of extending (signed char)-1 to (int)
7921 is different from (int) OP. */
7924 get_unwidened (tree op
, tree for_type
)
7926 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
7927 tree type
= TREE_TYPE (op
);
7929 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
7931 = (for_type
!= 0 && for_type
!= type
7932 && final_prec
> TYPE_PRECISION (type
)
7933 && TYPE_UNSIGNED (type
));
7936 while (CONVERT_EXPR_P (op
))
7940 /* TYPE_PRECISION on vector types has different meaning
7941 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
7942 so avoid them here. */
7943 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
7946 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
7947 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
7949 /* Truncations are many-one so cannot be removed.
7950 Unless we are later going to truncate down even farther. */
7952 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
7955 /* See what's inside this conversion. If we decide to strip it,
7957 op
= TREE_OPERAND (op
, 0);
7959 /* If we have not stripped any zero-extensions (uns is 0),
7960 we can strip any kind of extension.
7961 If we have previously stripped a zero-extension,
7962 only zero-extensions can safely be stripped.
7963 Any extension can be stripped if the bits it would produce
7964 are all going to be discarded later by truncating to FOR_TYPE. */
7968 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
7970 /* TYPE_UNSIGNED says whether this is a zero-extension.
7971 Let's avoid computing it if it does not affect WIN
7972 and if UNS will not be needed again. */
7974 || CONVERT_EXPR_P (op
))
7975 && TYPE_UNSIGNED (TREE_TYPE (op
)))
7983 /* If we finally reach a constant see if it fits in for_type and
7984 in that case convert it. */
7986 && TREE_CODE (win
) == INTEGER_CST
7987 && TREE_TYPE (win
) != for_type
7988 && int_fits_type_p (win
, for_type
))
7989 win
= fold_convert (for_type
, win
);
7994 /* Return OP or a simpler expression for a narrower value
7995 which can be sign-extended or zero-extended to give back OP.
7996 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
7997 or 0 if the value should be sign-extended. */
8000 get_narrower (tree op
, int *unsignedp_ptr
)
8005 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8007 while (TREE_CODE (op
) == NOP_EXPR
)
8010 = (TYPE_PRECISION (TREE_TYPE (op
))
8011 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8013 /* Truncations are many-one so cannot be removed. */
8017 /* See what's inside this conversion. If we decide to strip it,
8022 op
= TREE_OPERAND (op
, 0);
8023 /* An extension: the outermost one can be stripped,
8024 but remember whether it is zero or sign extension. */
8026 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8027 /* Otherwise, if a sign extension has been stripped,
8028 only sign extensions can now be stripped;
8029 if a zero extension has been stripped, only zero-extensions. */
8030 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8034 else /* bitschange == 0 */
8036 /* A change in nominal type can always be stripped, but we must
8037 preserve the unsignedness. */
8039 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8041 op
= TREE_OPERAND (op
, 0);
8042 /* Keep trying to narrow, but don't assign op to win if it
8043 would turn an integral type into something else. */
8044 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8051 if (TREE_CODE (op
) == COMPONENT_REF
8052 /* Since type_for_size always gives an integer type. */
8053 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8054 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8055 /* Ensure field is laid out already. */
8056 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8057 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8059 unsigned HOST_WIDE_INT innerprec
8060 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8061 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8062 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8063 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8065 /* We can get this structure field in a narrower type that fits it,
8066 but the resulting extension to its nominal type (a fullword type)
8067 must satisfy the same conditions as for other extensions.
8069 Do this only for fields that are aligned (not bit-fields),
8070 because when bit-field insns will be used there is no
8071 advantage in doing this. */
8073 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8074 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8075 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8079 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8080 win
= fold_convert (type
, op
);
8084 *unsignedp_ptr
= uns
;
8088 /* Returns true if integer constant C has a value that is permissible
8089 for type TYPE (an INTEGER_TYPE). */
8092 int_fits_type_p (const_tree c
, const_tree type
)
8094 tree type_low_bound
, type_high_bound
;
8095 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8098 dc
= tree_to_double_int (c
);
8099 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8101 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
8102 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
8104 /* So c is an unsigned integer whose type is sizetype and type is not.
8105 sizetype'd integers are sign extended even though they are
8106 unsigned. If the integer value fits in the lower end word of c,
8107 and if the higher end word has all its bits set to 1, that
8108 means the higher end bits are set to 1 only for sign extension.
8109 So let's convert c into an equivalent zero extended unsigned
8111 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
8114 type_low_bound
= TYPE_MIN_VALUE (type
);
8115 type_high_bound
= TYPE_MAX_VALUE (type
);
8117 /* If at least one bound of the type is a constant integer, we can check
8118 ourselves and maybe make a decision. If no such decision is possible, but
8119 this type is a subtype, try checking against that. Otherwise, use
8120 double_int_fits_to_tree_p, which checks against the precision.
8122 Compute the status for each possibly constant bound, and return if we see
8123 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8124 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8125 for "constant known to fit". */
8127 /* Check if c >= type_low_bound. */
8128 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8130 dd
= tree_to_double_int (type_low_bound
);
8131 if (TREE_CODE (type
) == INTEGER_TYPE
8132 && TYPE_IS_SIZETYPE (type
)
8133 && TYPE_UNSIGNED (type
))
8134 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8135 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8137 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8138 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8140 if (c_neg
&& !t_neg
)
8142 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8145 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8147 ok_for_low_bound
= true;
8150 ok_for_low_bound
= false;
8152 /* Check if c <= type_high_bound. */
8153 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8155 dd
= tree_to_double_int (type_high_bound
);
8156 if (TREE_CODE (type
) == INTEGER_TYPE
8157 && TYPE_IS_SIZETYPE (type
)
8158 && TYPE_UNSIGNED (type
))
8159 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8160 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8162 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8163 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8165 if (t_neg
&& !c_neg
)
8167 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8170 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8172 ok_for_high_bound
= true;
8175 ok_for_high_bound
= false;
8177 /* If the constant fits both bounds, the result is known. */
8178 if (ok_for_low_bound
&& ok_for_high_bound
)
8181 /* Perform some generic filtering which may allow making a decision
8182 even if the bounds are not constant. First, negative integers
8183 never fit in unsigned types, */
8184 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8187 /* Second, narrower types always fit in wider ones. */
8188 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8191 /* Third, unsigned integers with top bit set never fit signed types. */
8192 if (! TYPE_UNSIGNED (type
) && unsc
)
8194 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8195 if (prec
< HOST_BITS_PER_WIDE_INT
)
8197 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8200 else if (((((unsigned HOST_WIDE_INT
) 1)
8201 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8205 /* If we haven't been able to decide at this point, there nothing more we
8206 can check ourselves here. Look at the base type if we have one and it
8207 has the same precision. */
8208 if (TREE_CODE (type
) == INTEGER_TYPE
8209 && TREE_TYPE (type
) != 0
8210 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8212 type
= TREE_TYPE (type
);
8216 /* Or to double_int_fits_to_tree_p, if nothing else. */
8217 return double_int_fits_to_tree_p (type
, dc
);
8220 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8221 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8222 represented (assuming two's-complement arithmetic) within the bit
8223 precision of the type are returned instead. */
8226 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8228 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8229 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8230 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8231 TYPE_UNSIGNED (type
));
8234 if (TYPE_UNSIGNED (type
))
8235 mpz_set_ui (min
, 0);
8239 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8240 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8241 TYPE_PRECISION (type
));
8242 mpz_set_double_int (min
, mn
, false);
8246 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8247 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8248 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8249 TYPE_UNSIGNED (type
));
8252 if (TYPE_UNSIGNED (type
))
8253 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8256 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8261 /* Return true if VAR is an automatic variable defined in function FN. */
8264 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8266 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8267 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8268 || TREE_CODE (var
) == PARM_DECL
)
8269 && ! TREE_STATIC (var
))
8270 || TREE_CODE (var
) == LABEL_DECL
8271 || TREE_CODE (var
) == RESULT_DECL
));
8274 /* Subprogram of following function. Called by walk_tree.
8276 Return *TP if it is an automatic variable or parameter of the
8277 function passed in as DATA. */
8280 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8282 tree fn
= (tree
) data
;
8287 else if (DECL_P (*tp
)
8288 && auto_var_in_fn_p (*tp
, fn
))
8294 /* Returns true if T is, contains, or refers to a type with variable
8295 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8296 arguments, but not the return type. If FN is nonzero, only return
8297 true if a modifier of the type or position of FN is a variable or
8298 parameter inside FN.
8300 This concept is more general than that of C99 'variably modified types':
8301 in C99, a struct type is never variably modified because a VLA may not
8302 appear as a structure member. However, in GNU C code like:
8304 struct S { int i[f()]; };
8306 is valid, and other languages may define similar constructs. */
8309 variably_modified_type_p (tree type
, tree fn
)
8313 /* Test if T is either variable (if FN is zero) or an expression containing
8314 a variable in FN. */
8315 #define RETURN_TRUE_IF_VAR(T) \
8316 do { tree _t = (T); \
8317 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8318 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8319 return true; } while (0)
8321 if (type
== error_mark_node
)
8324 /* If TYPE itself has variable size, it is variably modified. */
8325 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8326 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8328 switch (TREE_CODE (type
))
8331 case REFERENCE_TYPE
:
8333 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8339 /* If TYPE is a function type, it is variably modified if the
8340 return type is variably modified. */
8341 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8347 case FIXED_POINT_TYPE
:
8350 /* Scalar types are variably modified if their end points
8352 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8353 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8358 case QUAL_UNION_TYPE
:
8359 /* We can't see if any of the fields are variably-modified by the
8360 definition we normally use, since that would produce infinite
8361 recursion via pointers. */
8362 /* This is variably modified if some field's type is. */
8363 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8364 if (TREE_CODE (t
) == FIELD_DECL
)
8366 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8367 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8368 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8370 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8371 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8376 /* Do not call ourselves to avoid infinite recursion. This is
8377 variably modified if the element type is. */
8378 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8379 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8386 /* The current language may have other cases to check, but in general,
8387 all other types are not variably modified. */
8388 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8390 #undef RETURN_TRUE_IF_VAR
8393 /* Given a DECL or TYPE, return the scope in which it was declared, or
8394 NULL_TREE if there is no containing scope. */
8397 get_containing_scope (const_tree t
)
8399 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8402 /* Return the innermost context enclosing DECL that is
8403 a FUNCTION_DECL, or zero if none. */
8406 decl_function_context (const_tree decl
)
8410 if (TREE_CODE (decl
) == ERROR_MARK
)
8413 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8414 where we look up the function at runtime. Such functions always take
8415 a first argument of type 'pointer to real context'.
8417 C++ should really be fixed to use DECL_CONTEXT for the real context,
8418 and use something else for the "virtual context". */
8419 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8422 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8424 context
= DECL_CONTEXT (decl
);
8426 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8428 if (TREE_CODE (context
) == BLOCK
)
8429 context
= BLOCK_SUPERCONTEXT (context
);
8431 context
= get_containing_scope (context
);
8437 /* Return the innermost context enclosing DECL that is
8438 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8439 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8442 decl_type_context (const_tree decl
)
8444 tree context
= DECL_CONTEXT (decl
);
8447 switch (TREE_CODE (context
))
8449 case NAMESPACE_DECL
:
8450 case TRANSLATION_UNIT_DECL
:
8455 case QUAL_UNION_TYPE
:
8460 context
= DECL_CONTEXT (context
);
8464 context
= BLOCK_SUPERCONTEXT (context
);
8474 /* CALL is a CALL_EXPR. Return the declaration for the function
8475 called, or NULL_TREE if the called function cannot be
8479 get_callee_fndecl (const_tree call
)
8483 if (call
== error_mark_node
)
8484 return error_mark_node
;
8486 /* It's invalid to call this function with anything but a
8488 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8490 /* The first operand to the CALL is the address of the function
8492 addr
= CALL_EXPR_FN (call
);
8496 /* If this is a readonly function pointer, extract its initial value. */
8497 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8498 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8499 && DECL_INITIAL (addr
))
8500 addr
= DECL_INITIAL (addr
);
8502 /* If the address is just `&f' for some function `f', then we know
8503 that `f' is being called. */
8504 if (TREE_CODE (addr
) == ADDR_EXPR
8505 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8506 return TREE_OPERAND (addr
, 0);
8508 /* We couldn't figure out what was being called. */
8512 /* Print debugging information about tree nodes generated during the compile,
8513 and any language-specific information. */
8516 dump_tree_statistics (void)
8518 #ifdef GATHER_STATISTICS
8520 int total_nodes
, total_bytes
;
8523 fprintf (stderr
, "\n??? tree nodes created\n\n");
8524 #ifdef GATHER_STATISTICS
8525 fprintf (stderr
, "Kind Nodes Bytes\n");
8526 fprintf (stderr
, "---------------------------------------\n");
8527 total_nodes
= total_bytes
= 0;
8528 for (i
= 0; i
< (int) all_kinds
; i
++)
8530 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8531 tree_node_counts
[i
], tree_node_sizes
[i
]);
8532 total_nodes
+= tree_node_counts
[i
];
8533 total_bytes
+= tree_node_sizes
[i
];
8535 fprintf (stderr
, "---------------------------------------\n");
8536 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8537 fprintf (stderr
, "---------------------------------------\n");
8538 ssanames_print_statistics ();
8539 phinodes_print_statistics ();
8541 fprintf (stderr
, "(No per-node statistics)\n");
8543 print_type_hash_statistics ();
8544 print_debug_expr_statistics ();
8545 print_value_expr_statistics ();
8546 lang_hooks
.print_statistics ();
8549 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8551 /* Generate a crc32 of a string. */
8554 crc32_string (unsigned chksum
, const char *string
)
8558 unsigned value
= *string
<< 24;
8561 for (ix
= 8; ix
--; value
<<= 1)
8565 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8574 /* P is a string that will be used in a symbol. Mask out any characters
8575 that are not valid in that context. */
8578 clean_symbol_name (char *p
)
8582 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8585 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8592 /* Generate a name for a special-purpose function function.
8593 The generated name may need to be unique across the whole link.
8594 TYPE is some string to identify the purpose of this function to the
8595 linker or collect2; it must start with an uppercase letter,
8597 I - for constructors
8599 N - for C++ anonymous namespaces
8600 F - for DWARF unwind frame information. */
8603 get_file_function_name (const char *type
)
8609 /* If we already have a name we know to be unique, just use that. */
8610 if (first_global_object_name
)
8611 p
= q
= ASTRDUP (first_global_object_name
);
8612 /* If the target is handling the constructors/destructors, they
8613 will be local to this file and the name is only necessary for
8615 We also assign sub_I and sub_D sufixes to constructors called from
8616 the global static constructors. These are always local. */
8617 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8618 || (strncmp (type
, "sub_", 4) == 0
8619 && (type
[4] == 'I' || type
[4] == 'D')))
8621 const char *file
= main_input_filename
;
8623 file
= input_filename
;
8624 /* Just use the file's basename, because the full pathname
8625 might be quite long. */
8626 p
= q
= ASTRDUP (lbasename (file
));
8630 /* Otherwise, the name must be unique across the entire link.
8631 We don't have anything that we know to be unique to this translation
8632 unit, so use what we do have and throw in some randomness. */
8634 const char *name
= weak_global_object_name
;
8635 const char *file
= main_input_filename
;
8640 file
= input_filename
;
8642 len
= strlen (file
);
8643 q
= (char *) alloca (9 * 2 + len
+ 1);
8644 memcpy (q
, file
, len
+ 1);
8646 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
8647 crc32_string (0, get_random_seed (false)));
8652 clean_symbol_name (q
);
8653 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8656 /* Set up the name of the file-level functions we may need.
8657 Use a global object (which is already required to be unique over
8658 the program) rather than the file name (which imposes extra
8660 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8662 return get_identifier (buf
);
8665 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8667 /* Complain that the tree code of NODE does not match the expected 0
8668 terminated list of trailing codes. The trailing code list can be
8669 empty, for a more vague error message. FILE, LINE, and FUNCTION
8670 are of the caller. */
8673 tree_check_failed (const_tree node
, const char *file
,
8674 int line
, const char *function
, ...)
8678 unsigned length
= 0;
8681 va_start (args
, function
);
8682 while ((code
= va_arg (args
, int)))
8683 length
+= 4 + strlen (tree_code_name
[code
]);
8688 va_start (args
, function
);
8689 length
+= strlen ("expected ");
8690 buffer
= tmp
= (char *) alloca (length
);
8692 while ((code
= va_arg (args
, int)))
8694 const char *prefix
= length
? " or " : "expected ";
8696 strcpy (tmp
+ length
, prefix
);
8697 length
+= strlen (prefix
);
8698 strcpy (tmp
+ length
, tree_code_name
[code
]);
8699 length
+= strlen (tree_code_name
[code
]);
8704 buffer
= "unexpected node";
8706 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8707 buffer
, tree_code_name
[TREE_CODE (node
)],
8708 function
, trim_filename (file
), line
);
8711 /* Complain that the tree code of NODE does match the expected 0
8712 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8716 tree_not_check_failed (const_tree node
, const char *file
,
8717 int line
, const char *function
, ...)
8721 unsigned length
= 0;
8724 va_start (args
, function
);
8725 while ((code
= va_arg (args
, int)))
8726 length
+= 4 + strlen (tree_code_name
[code
]);
8728 va_start (args
, function
);
8729 buffer
= (char *) alloca (length
);
8731 while ((code
= va_arg (args
, int)))
8735 strcpy (buffer
+ length
, " or ");
8738 strcpy (buffer
+ length
, tree_code_name
[code
]);
8739 length
+= strlen (tree_code_name
[code
]);
8743 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8744 buffer
, tree_code_name
[TREE_CODE (node
)],
8745 function
, trim_filename (file
), line
);
8748 /* Similar to tree_check_failed, except that we check for a class of tree
8749 code, given in CL. */
8752 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8753 const char *file
, int line
, const char *function
)
8756 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8757 TREE_CODE_CLASS_STRING (cl
),
8758 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8759 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8762 /* Similar to tree_check_failed, except that instead of specifying a
8763 dozen codes, use the knowledge that they're all sequential. */
8766 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8767 const char *function
, enum tree_code c1
,
8771 unsigned length
= 0;
8774 for (c
= c1
; c
<= c2
; ++c
)
8775 length
+= 4 + strlen (tree_code_name
[c
]);
8777 length
+= strlen ("expected ");
8778 buffer
= (char *) alloca (length
);
8781 for (c
= c1
; c
<= c2
; ++c
)
8783 const char *prefix
= length
? " or " : "expected ";
8785 strcpy (buffer
+ length
, prefix
);
8786 length
+= strlen (prefix
);
8787 strcpy (buffer
+ length
, tree_code_name
[c
]);
8788 length
+= strlen (tree_code_name
[c
]);
8791 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8792 buffer
, tree_code_name
[TREE_CODE (node
)],
8793 function
, trim_filename (file
), line
);
8797 /* Similar to tree_check_failed, except that we check that a tree does
8798 not have the specified code, given in CL. */
8801 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8802 const char *file
, int line
, const char *function
)
8805 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8806 TREE_CODE_CLASS_STRING (cl
),
8807 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8808 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8812 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8815 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8816 const char *function
, enum omp_clause_code code
)
8818 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8819 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8820 function
, trim_filename (file
), line
);
8824 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8827 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8828 const char *function
, enum omp_clause_code c1
,
8829 enum omp_clause_code c2
)
8832 unsigned length
= 0;
8835 for (c
= c1
; c
<= c2
; ++c
)
8836 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8838 length
+= strlen ("expected ");
8839 buffer
= (char *) alloca (length
);
8842 for (c
= c1
; c
<= c2
; ++c
)
8844 const char *prefix
= length
? " or " : "expected ";
8846 strcpy (buffer
+ length
, prefix
);
8847 length
+= strlen (prefix
);
8848 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8849 length
+= strlen (omp_clause_code_name
[c
]);
8852 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8853 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8854 function
, trim_filename (file
), line
);
8858 #undef DEFTREESTRUCT
8859 #define DEFTREESTRUCT(VAL, NAME) NAME,
8861 static const char *ts_enum_names
[] = {
8862 #include "treestruct.def"
8864 #undef DEFTREESTRUCT
8866 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8868 /* Similar to tree_class_check_failed, except that we check for
8869 whether CODE contains the tree structure identified by EN. */
8872 tree_contains_struct_check_failed (const_tree node
,
8873 const enum tree_node_structure_enum en
,
8874 const char *file
, int line
,
8875 const char *function
)
8878 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8880 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8884 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8885 (dynamically sized) vector. */
8888 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8889 const char *function
)
8892 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8893 idx
+ 1, len
, function
, trim_filename (file
), line
);
8896 /* Similar to above, except that the check is for the bounds of the operand
8897 vector of an expression node EXP. */
8900 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
8901 int line
, const char *function
)
8903 int code
= TREE_CODE (exp
);
8905 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
8906 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
8907 function
, trim_filename (file
), line
);
8910 /* Similar to above, except that the check is for the number of
8911 operands of an OMP_CLAUSE node. */
8914 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
8915 int line
, const char *function
)
8918 ("tree check: accessed operand %d of omp_clause %s with %d operands "
8919 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
8920 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
8921 trim_filename (file
), line
);
8923 #endif /* ENABLE_TREE_CHECKING */
8925 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
8926 and mapped to the machine mode MODE. Initialize its fields and build
8927 the information necessary for debugging output. */
8930 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
8933 hashval_t hashcode
= 0;
8935 t
= make_node (VECTOR_TYPE
);
8936 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
8937 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
8938 SET_TYPE_MODE (t
, mode
);
8940 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
8941 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8942 else if (TYPE_CANONICAL (innertype
) != innertype
8943 || mode
!= VOIDmode
)
8945 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
8949 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
8950 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
8951 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
8952 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
8953 t
= type_hash_canon (hashcode
, t
);
8955 /* We have built a main variant, based on the main variant of the
8956 inner type. Use it to build the variant we return. */
8957 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
8958 && TREE_TYPE (t
) != innertype
)
8959 return build_type_attribute_qual_variant (t
,
8960 TYPE_ATTRIBUTES (innertype
),
8961 TYPE_QUALS (innertype
));
8967 make_or_reuse_type (unsigned size
, int unsignedp
)
8969 if (size
== INT_TYPE_SIZE
)
8970 return unsignedp
? unsigned_type_node
: integer_type_node
;
8971 if (size
== CHAR_TYPE_SIZE
)
8972 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
8973 if (size
== SHORT_TYPE_SIZE
)
8974 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
8975 if (size
== LONG_TYPE_SIZE
)
8976 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
8977 if (size
== LONG_LONG_TYPE_SIZE
)
8978 return (unsignedp
? long_long_unsigned_type_node
8979 : long_long_integer_type_node
);
8980 if (size
== 128 && int128_integer_type_node
)
8981 return (unsignedp
? int128_unsigned_type_node
8982 : int128_integer_type_node
);
8985 return make_unsigned_type (size
);
8987 return make_signed_type (size
);
8990 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
8993 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
8997 if (size
== SHORT_FRACT_TYPE_SIZE
)
8998 return unsignedp
? sat_unsigned_short_fract_type_node
8999 : sat_short_fract_type_node
;
9000 if (size
== FRACT_TYPE_SIZE
)
9001 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9002 if (size
== LONG_FRACT_TYPE_SIZE
)
9003 return unsignedp
? sat_unsigned_long_fract_type_node
9004 : sat_long_fract_type_node
;
9005 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9006 return unsignedp
? sat_unsigned_long_long_fract_type_node
9007 : sat_long_long_fract_type_node
;
9011 if (size
== SHORT_FRACT_TYPE_SIZE
)
9012 return unsignedp
? unsigned_short_fract_type_node
9013 : short_fract_type_node
;
9014 if (size
== FRACT_TYPE_SIZE
)
9015 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9016 if (size
== LONG_FRACT_TYPE_SIZE
)
9017 return unsignedp
? unsigned_long_fract_type_node
9018 : long_fract_type_node
;
9019 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9020 return unsignedp
? unsigned_long_long_fract_type_node
9021 : long_long_fract_type_node
;
9024 return make_fract_type (size
, unsignedp
, satp
);
9027 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9030 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9034 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9035 return unsignedp
? sat_unsigned_short_accum_type_node
9036 : sat_short_accum_type_node
;
9037 if (size
== ACCUM_TYPE_SIZE
)
9038 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9039 if (size
== LONG_ACCUM_TYPE_SIZE
)
9040 return unsignedp
? sat_unsigned_long_accum_type_node
9041 : sat_long_accum_type_node
;
9042 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9043 return unsignedp
? sat_unsigned_long_long_accum_type_node
9044 : sat_long_long_accum_type_node
;
9048 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9049 return unsignedp
? unsigned_short_accum_type_node
9050 : short_accum_type_node
;
9051 if (size
== ACCUM_TYPE_SIZE
)
9052 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9053 if (size
== LONG_ACCUM_TYPE_SIZE
)
9054 return unsignedp
? unsigned_long_accum_type_node
9055 : long_accum_type_node
;
9056 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9057 return unsignedp
? unsigned_long_long_accum_type_node
9058 : long_long_accum_type_node
;
9061 return make_accum_type (size
, unsignedp
, satp
);
9064 /* Create nodes for all integer types (and error_mark_node) using the sizes
9065 of C datatypes. The caller should call set_sizetype soon after calling
9066 this function to select one of the types as sizetype. */
9069 build_common_tree_nodes (bool signed_char
)
9071 error_mark_node
= make_node (ERROR_MARK
);
9072 TREE_TYPE (error_mark_node
) = error_mark_node
;
9074 initialize_sizetypes ();
9076 /* Define both `signed char' and `unsigned char'. */
9077 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9078 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9079 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9080 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9082 /* Define `char', which is like either `signed char' or `unsigned char'
9083 but not the same as either. */
9086 ? make_signed_type (CHAR_TYPE_SIZE
)
9087 : make_unsigned_type (CHAR_TYPE_SIZE
));
9088 TYPE_STRING_FLAG (char_type_node
) = 1;
9090 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9091 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9092 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9093 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9094 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9095 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9096 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9097 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9098 #if HOST_BITS_PER_WIDE_INT >= 64
9099 /* TODO: This isn't correct, but as logic depends at the moment on
9100 host's instead of target's wide-integer.
9101 If there is a target not supporting TImode, but has an 128-bit
9102 integer-scalar register, this target check needs to be adjusted. */
9103 if (targetm
.scalar_mode_supported_p (TImode
))
9105 int128_integer_type_node
= make_signed_type (128);
9106 int128_unsigned_type_node
= make_unsigned_type (128);
9109 /* Define a boolean type. This type only represents boolean values but
9110 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9111 Front ends which want to override this size (i.e. Java) can redefine
9112 boolean_type_node before calling build_common_tree_nodes_2. */
9113 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9114 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9115 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9116 TYPE_PRECISION (boolean_type_node
) = 1;
9118 /* Fill in the rest of the sized types. Reuse existing type nodes
9120 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9121 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9122 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9123 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9124 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9126 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9127 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9128 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9129 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9130 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9132 access_public_node
= get_identifier ("public");
9133 access_protected_node
= get_identifier ("protected");
9134 access_private_node
= get_identifier ("private");
9137 /* Call this function after calling build_common_tree_nodes and set_sizetype.
9138 It will create several other common tree nodes. */
9141 build_common_tree_nodes_2 (int short_double
)
9143 /* Define these next since types below may used them. */
9144 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9145 integer_one_node
= build_int_cst (integer_type_node
, 1);
9146 integer_three_node
= build_int_cst (integer_type_node
, 3);
9147 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9149 size_zero_node
= size_int (0);
9150 size_one_node
= size_int (1);
9151 bitsize_zero_node
= bitsize_int (0);
9152 bitsize_one_node
= bitsize_int (1);
9153 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9155 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9156 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9158 void_type_node
= make_node (VOID_TYPE
);
9159 layout_type (void_type_node
);
9161 /* We are not going to have real types in C with less than byte alignment,
9162 so we might as well not have any types that claim to have it. */
9163 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9164 TYPE_USER_ALIGN (void_type_node
) = 0;
9166 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9167 layout_type (TREE_TYPE (null_pointer_node
));
9169 ptr_type_node
= build_pointer_type (void_type_node
);
9171 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9172 fileptr_type_node
= ptr_type_node
;
9174 float_type_node
= make_node (REAL_TYPE
);
9175 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9176 layout_type (float_type_node
);
9178 double_type_node
= make_node (REAL_TYPE
);
9180 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9182 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9183 layout_type (double_type_node
);
9185 long_double_type_node
= make_node (REAL_TYPE
);
9186 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9187 layout_type (long_double_type_node
);
9189 float_ptr_type_node
= build_pointer_type (float_type_node
);
9190 double_ptr_type_node
= build_pointer_type (double_type_node
);
9191 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9192 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9194 /* Fixed size integer types. */
9195 uint32_type_node
= build_nonstandard_integer_type (32, true);
9196 uint64_type_node
= build_nonstandard_integer_type (64, true);
9198 /* Decimal float types. */
9199 dfloat32_type_node
= make_node (REAL_TYPE
);
9200 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9201 layout_type (dfloat32_type_node
);
9202 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9203 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9205 dfloat64_type_node
= make_node (REAL_TYPE
);
9206 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9207 layout_type (dfloat64_type_node
);
9208 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9209 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9211 dfloat128_type_node
= make_node (REAL_TYPE
);
9212 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9213 layout_type (dfloat128_type_node
);
9214 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9215 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9217 complex_integer_type_node
= build_complex_type (integer_type_node
);
9218 complex_float_type_node
= build_complex_type (float_type_node
);
9219 complex_double_type_node
= build_complex_type (double_type_node
);
9220 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9222 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9223 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9224 sat_ ## KIND ## _type_node = \
9225 make_sat_signed_ ## KIND ## _type (SIZE); \
9226 sat_unsigned_ ## KIND ## _type_node = \
9227 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9228 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9229 unsigned_ ## KIND ## _type_node = \
9230 make_unsigned_ ## KIND ## _type (SIZE);
9232 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9233 sat_ ## WIDTH ## KIND ## _type_node = \
9234 make_sat_signed_ ## KIND ## _type (SIZE); \
9235 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9236 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9237 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9238 unsigned_ ## WIDTH ## KIND ## _type_node = \
9239 make_unsigned_ ## KIND ## _type (SIZE);
9241 /* Make fixed-point type nodes based on four different widths. */
9242 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9243 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9244 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9245 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9246 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9248 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9249 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9250 NAME ## _type_node = \
9251 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9252 u ## NAME ## _type_node = \
9253 make_or_reuse_unsigned_ ## KIND ## _type \
9254 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9255 sat_ ## NAME ## _type_node = \
9256 make_or_reuse_sat_signed_ ## KIND ## _type \
9257 (GET_MODE_BITSIZE (MODE ## mode)); \
9258 sat_u ## NAME ## _type_node = \
9259 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9260 (GET_MODE_BITSIZE (U ## MODE ## mode));
9262 /* Fixed-point type and mode nodes. */
9263 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9264 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9265 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9266 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9267 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9268 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9269 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9270 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9271 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9272 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9273 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9276 tree t
= targetm
.build_builtin_va_list ();
9278 /* Many back-ends define record types without setting TYPE_NAME.
9279 If we copied the record type here, we'd keep the original
9280 record type without a name. This breaks name mangling. So,
9281 don't copy record types and let c_common_nodes_and_builtins()
9282 declare the type to be __builtin_va_list. */
9283 if (TREE_CODE (t
) != RECORD_TYPE
)
9284 t
= build_variant_type_copy (t
);
9286 va_list_type_node
= t
;
9290 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9293 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9294 const char *library_name
, int ecf_flags
)
9298 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9299 library_name
, NULL_TREE
);
9300 if (ecf_flags
& ECF_CONST
)
9301 TREE_READONLY (decl
) = 1;
9302 if (ecf_flags
& ECF_PURE
)
9303 DECL_PURE_P (decl
) = 1;
9304 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9305 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9306 if (ecf_flags
& ECF_NORETURN
)
9307 TREE_THIS_VOLATILE (decl
) = 1;
9308 if (ecf_flags
& ECF_NOTHROW
)
9309 TREE_NOTHROW (decl
) = 1;
9310 if (ecf_flags
& ECF_MALLOC
)
9311 DECL_IS_MALLOC (decl
) = 1;
9312 if (ecf_flags
& ECF_LEAF
)
9313 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9314 NULL
, DECL_ATTRIBUTES (decl
));
9316 built_in_decls
[code
] = decl
;
9317 implicit_built_in_decls
[code
] = decl
;
9320 /* Call this function after instantiating all builtins that the language
9321 front end cares about. This will build the rest of the builtins that
9322 are relied upon by the tree optimizers and the middle-end. */
9325 build_common_builtin_nodes (void)
9329 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
9330 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9332 ftype
= build_function_type_list (ptr_type_node
,
9333 ptr_type_node
, const_ptr_type_node
,
9334 size_type_node
, NULL_TREE
);
9336 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
9337 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9338 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9339 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
9340 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9341 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9344 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
9346 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9347 const_ptr_type_node
, size_type_node
,
9349 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9350 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9353 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
9355 ftype
= build_function_type_list (ptr_type_node
,
9356 ptr_type_node
, integer_type_node
,
9357 size_type_node
, NULL_TREE
);
9358 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9359 "memset", ECF_NOTHROW
| ECF_LEAF
);
9362 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
9364 ftype
= build_function_type_list (ptr_type_node
,
9365 size_type_node
, NULL_TREE
);
9366 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9367 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9370 /* If we're checking the stack, `alloca' can throw. */
9371 if (flag_stack_check
)
9372 TREE_NOTHROW (built_in_decls
[BUILT_IN_ALLOCA
]) = 0;
9374 ftype
= build_function_type_list (void_type_node
,
9375 ptr_type_node
, ptr_type_node
,
9376 ptr_type_node
, NULL_TREE
);
9377 local_define_builtin ("__builtin_init_trampoline", ftype
,
9378 BUILT_IN_INIT_TRAMPOLINE
,
9379 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9381 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9382 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9383 BUILT_IN_ADJUST_TRAMPOLINE
,
9384 "__builtin_adjust_trampoline",
9385 ECF_CONST
| ECF_NOTHROW
);
9387 ftype
= build_function_type_list (void_type_node
,
9388 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9389 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9390 BUILT_IN_NONLOCAL_GOTO
,
9391 "__builtin_nonlocal_goto",
9392 ECF_NORETURN
| ECF_NOTHROW
);
9394 ftype
= build_function_type_list (void_type_node
,
9395 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9396 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9397 BUILT_IN_SETJMP_SETUP
,
9398 "__builtin_setjmp_setup", ECF_NOTHROW
);
9400 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9401 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9402 BUILT_IN_SETJMP_DISPATCHER
,
9403 "__builtin_setjmp_dispatcher",
9404 ECF_PURE
| ECF_NOTHROW
);
9406 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9407 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9408 BUILT_IN_SETJMP_RECEIVER
,
9409 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9411 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9412 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9413 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9415 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9416 local_define_builtin ("__builtin_stack_restore", ftype
,
9417 BUILT_IN_STACK_RESTORE
,
9418 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9420 /* If there's a possibility that we might use the ARM EABI, build the
9421 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9422 if (targetm
.arm_eabi_unwinder
)
9424 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9425 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9426 BUILT_IN_CXA_END_CLEANUP
,
9427 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9430 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9431 local_define_builtin ("__builtin_unwind_resume", ftype
,
9432 BUILT_IN_UNWIND_RESUME
,
9433 ((targetm
.except_unwind_info (&global_options
)
9435 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9438 /* The exception object and filter values from the runtime. The argument
9439 must be zero before exception lowering, i.e. from the front end. After
9440 exception lowering, it will be the region number for the exception
9441 landing pad. These functions are PURE instead of CONST to prevent
9442 them from being hoisted past the exception edge that will initialize
9443 its value in the landing pad. */
9444 ftype
= build_function_type_list (ptr_type_node
,
9445 integer_type_node
, NULL_TREE
);
9446 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9447 "__builtin_eh_pointer", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9449 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9450 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9451 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9452 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9454 ftype
= build_function_type_list (void_type_node
,
9455 integer_type_node
, integer_type_node
,
9457 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9458 BUILT_IN_EH_COPY_VALUES
,
9459 "__builtin_eh_copy_values", ECF_NOTHROW
);
9461 /* Complex multiplication and division. These are handled as builtins
9462 rather than optabs because emit_library_call_value doesn't support
9463 complex. Further, we can do slightly better with folding these
9464 beasties if the real and complex parts of the arguments are separate. */
9468 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9470 char mode_name_buf
[4], *q
;
9472 enum built_in_function mcode
, dcode
;
9473 tree type
, inner_type
;
9475 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9478 inner_type
= TREE_TYPE (type
);
9480 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9481 inner_type
, inner_type
, NULL_TREE
);
9483 mcode
= ((enum built_in_function
)
9484 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9485 dcode
= ((enum built_in_function
)
9486 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9488 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9492 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
9493 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9494 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9496 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
9497 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9498 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9503 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9506 If we requested a pointer to a vector, build up the pointers that
9507 we stripped off while looking for the inner type. Similarly for
9508 return values from functions.
9510 The argument TYPE is the top of the chain, and BOTTOM is the
9511 new type which we will point to. */
9514 reconstruct_complex_type (tree type
, tree bottom
)
9518 if (TREE_CODE (type
) == POINTER_TYPE
)
9520 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9521 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9522 TYPE_REF_CAN_ALIAS_ALL (type
));
9524 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9526 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9527 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9528 TYPE_REF_CAN_ALIAS_ALL (type
));
9530 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9532 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9533 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9535 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9537 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9538 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9540 else if (TREE_CODE (type
) == METHOD_TYPE
)
9542 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9543 /* The build_method_type_directly() routine prepends 'this' to argument list,
9544 so we must compensate by getting rid of it. */
9546 = build_method_type_directly
9547 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9549 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9551 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9553 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9554 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9559 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9563 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9566 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9570 switch (GET_MODE_CLASS (mode
))
9572 case MODE_VECTOR_INT
:
9573 case MODE_VECTOR_FLOAT
:
9574 case MODE_VECTOR_FRACT
:
9575 case MODE_VECTOR_UFRACT
:
9576 case MODE_VECTOR_ACCUM
:
9577 case MODE_VECTOR_UACCUM
:
9578 nunits
= GET_MODE_NUNITS (mode
);
9582 /* Check that there are no leftover bits. */
9583 gcc_assert (GET_MODE_BITSIZE (mode
)
9584 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9586 nunits
= GET_MODE_BITSIZE (mode
)
9587 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9594 return make_vector_type (innertype
, nunits
, mode
);
9597 /* Similarly, but takes the inner type and number of units, which must be
9601 build_vector_type (tree innertype
, int nunits
)
9603 return make_vector_type (innertype
, nunits
, VOIDmode
);
9606 /* Similarly, but takes the inner type and number of units, which must be
9610 build_opaque_vector_type (tree innertype
, int nunits
)
9613 innertype
= build_distinct_type_copy (innertype
);
9614 t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9615 TYPE_VECTOR_OPAQUE (t
) = true;
9620 /* Given an initializer INIT, return TRUE if INIT is zero or some
9621 aggregate of zeros. Otherwise return FALSE. */
9623 initializer_zerop (const_tree init
)
9629 switch (TREE_CODE (init
))
9632 return integer_zerop (init
);
9635 /* ??? Note that this is not correct for C4X float formats. There,
9636 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9637 negative exponent. */
9638 return real_zerop (init
)
9639 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9642 return fixed_zerop (init
);
9645 return integer_zerop (init
)
9646 || (real_zerop (init
)
9647 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9648 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9651 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9652 if (!initializer_zerop (TREE_VALUE (elt
)))
9658 unsigned HOST_WIDE_INT idx
;
9660 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9661 if (!initializer_zerop (elt
))
9670 /* We need to loop through all elements to handle cases like
9671 "\0" and "\0foobar". */
9672 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9673 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9684 /* Build an empty statement at location LOC. */
9687 build_empty_stmt (location_t loc
)
9689 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9690 SET_EXPR_LOCATION (t
, loc
);
9695 /* Build an OpenMP clause with code CODE. LOC is the location of the
9699 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9704 length
= omp_clause_num_ops
[code
];
9705 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9707 record_node_allocation_statistics (OMP_CLAUSE
, size
);
9709 t
= ggc_alloc_tree_node (size
);
9710 memset (t
, 0, size
);
9711 TREE_SET_CODE (t
, OMP_CLAUSE
);
9712 OMP_CLAUSE_SET_CODE (t
, code
);
9713 OMP_CLAUSE_LOCATION (t
) = loc
;
9718 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9719 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9720 Except for the CODE and operand count field, other storage for the
9721 object is initialized to zeros. */
9724 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9727 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9729 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9730 gcc_assert (len
>= 1);
9732 record_node_allocation_statistics (code
, length
);
9734 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
9736 TREE_SET_CODE (t
, code
);
9738 /* Can't use TREE_OPERAND to store the length because if checking is
9739 enabled, it will try to check the length before we store it. :-P */
9740 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9745 /* Helper function for build_call_* functions; build a CALL_EXPR with
9746 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9747 the argument slots. */
9750 build_call_1 (tree return_type
, tree fn
, int nargs
)
9754 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9755 TREE_TYPE (t
) = return_type
;
9756 CALL_EXPR_FN (t
) = fn
;
9757 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
9762 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9763 FN and a null static chain slot. NARGS is the number of call arguments
9764 which are specified as "..." arguments. */
9767 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9771 va_start (args
, nargs
);
9772 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9777 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9778 FN and a null static chain slot. NARGS is the number of call arguments
9779 which are specified as a va_list ARGS. */
9782 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9787 t
= build_call_1 (return_type
, fn
, nargs
);
9788 for (i
= 0; i
< nargs
; i
++)
9789 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9790 process_call_operands (t
);
9794 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9795 FN and a null static chain slot. NARGS is the number of call arguments
9796 which are specified as a tree array ARGS. */
9799 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9800 int nargs
, const tree
*args
)
9805 t
= build_call_1 (return_type
, fn
, nargs
);
9806 for (i
= 0; i
< nargs
; i
++)
9807 CALL_EXPR_ARG (t
, i
) = args
[i
];
9808 process_call_operands (t
);
9809 SET_EXPR_LOCATION (t
, loc
);
9813 /* Like build_call_array, but takes a VEC. */
9816 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9821 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
9822 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
9823 CALL_EXPR_ARG (ret
, ix
) = t
;
9824 process_call_operands (ret
);
9829 /* Returns true if it is possible to prove that the index of
9830 an array access REF (an ARRAY_REF expression) falls into the
9834 in_array_bounds_p (tree ref
)
9836 tree idx
= TREE_OPERAND (ref
, 1);
9839 if (TREE_CODE (idx
) != INTEGER_CST
)
9842 min
= array_ref_low_bound (ref
);
9843 max
= array_ref_up_bound (ref
);
9846 || TREE_CODE (min
) != INTEGER_CST
9847 || TREE_CODE (max
) != INTEGER_CST
)
9850 if (tree_int_cst_lt (idx
, min
)
9851 || tree_int_cst_lt (max
, idx
))
9857 /* Returns true if it is possible to prove that the range of
9858 an array access REF (an ARRAY_RANGE_REF expression) falls
9859 into the array bounds. */
9862 range_in_array_bounds_p (tree ref
)
9864 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
9865 tree range_min
, range_max
, min
, max
;
9867 range_min
= TYPE_MIN_VALUE (domain_type
);
9868 range_max
= TYPE_MAX_VALUE (domain_type
);
9871 || TREE_CODE (range_min
) != INTEGER_CST
9872 || TREE_CODE (range_max
) != INTEGER_CST
)
9875 min
= array_ref_low_bound (ref
);
9876 max
= array_ref_up_bound (ref
);
9879 || TREE_CODE (min
) != INTEGER_CST
9880 || TREE_CODE (max
) != INTEGER_CST
)
9883 if (tree_int_cst_lt (range_min
, min
)
9884 || tree_int_cst_lt (max
, range_max
))
9890 /* Return true if T (assumed to be a DECL) must be assigned a memory
9894 needs_to_live_in_memory (const_tree t
)
9896 if (TREE_CODE (t
) == SSA_NAME
)
9897 t
= SSA_NAME_VAR (t
);
9899 return (TREE_ADDRESSABLE (t
)
9900 || is_global_var (t
)
9901 || (TREE_CODE (t
) == RESULT_DECL
9902 && !DECL_BY_REFERENCE (t
)
9903 && aggregate_value_p (t
, current_function_decl
)));
9906 /* Return value of a constant X and sign-extend it. */
9909 int_cst_value (const_tree x
)
9911 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9912 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
9914 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9915 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9916 || TREE_INT_CST_HIGH (x
) == -1);
9918 if (bits
< HOST_BITS_PER_WIDE_INT
)
9920 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9922 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
9924 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
9930 /* Return value of a constant X and sign-extend it. */
9933 widest_int_cst_value (const_tree x
)
9935 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
9936 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
9938 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
9939 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
9940 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
9941 << HOST_BITS_PER_WIDE_INT
);
9943 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
9944 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
9945 || TREE_INT_CST_HIGH (x
) == -1);
9948 if (bits
< HOST_BITS_PER_WIDEST_INT
)
9950 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
9952 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
9954 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
9960 /* If TYPE is an integral type, return an equivalent type which is
9961 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
9962 return TYPE itself. */
9965 signed_or_unsigned_type_for (int unsignedp
, tree type
)
9968 if (POINTER_TYPE_P (type
))
9970 /* If the pointer points to the normal address space, use the
9971 size_type_node. Otherwise use an appropriate size for the pointer
9972 based on the named address space it points to. */
9973 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
9976 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9979 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
9982 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
9985 /* Returns unsigned variant of TYPE. */
9988 unsigned_type_for (tree type
)
9990 return signed_or_unsigned_type_for (1, type
);
9993 /* Returns signed variant of TYPE. */
9996 signed_type_for (tree type
)
9998 return signed_or_unsigned_type_for (0, type
);
10001 /* Returns the largest value obtainable by casting something in INNER type to
10005 upper_bound_in_type (tree outer
, tree inner
)
10007 unsigned HOST_WIDE_INT lo
, hi
;
10008 unsigned int det
= 0;
10009 unsigned oprec
= TYPE_PRECISION (outer
);
10010 unsigned iprec
= TYPE_PRECISION (inner
);
10013 /* Compute a unique number for every combination. */
10014 det
|= (oprec
> iprec
) ? 4 : 0;
10015 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10016 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10018 /* Determine the exponent to use. */
10023 /* oprec <= iprec, outer: signed, inner: don't care. */
10028 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10032 /* oprec > iprec, outer: signed, inner: signed. */
10036 /* oprec > iprec, outer: signed, inner: unsigned. */
10040 /* oprec > iprec, outer: unsigned, inner: signed. */
10044 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10048 gcc_unreachable ();
10051 /* Compute 2^^prec - 1. */
10052 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10055 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
10056 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10060 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10061 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
10062 lo
= ~(unsigned HOST_WIDE_INT
) 0;
10065 return build_int_cst_wide (outer
, lo
, hi
);
10068 /* Returns the smallest value obtainable by casting something in INNER type to
10072 lower_bound_in_type (tree outer
, tree inner
)
10074 unsigned HOST_WIDE_INT lo
, hi
;
10075 unsigned oprec
= TYPE_PRECISION (outer
);
10076 unsigned iprec
= TYPE_PRECISION (inner
);
10078 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10080 if (TYPE_UNSIGNED (outer
)
10081 /* If we are widening something of an unsigned type, OUTER type
10082 contains all values of INNER type. In particular, both INNER
10083 and OUTER types have zero in common. */
10084 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10088 /* If we are widening a signed type to another signed type, we
10089 want to obtain -2^^(iprec-1). If we are keeping the
10090 precision or narrowing to a signed type, we want to obtain
10092 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10094 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10096 hi
= ~(unsigned HOST_WIDE_INT
) 0;
10097 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10101 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
10102 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10107 return build_int_cst_wide (outer
, lo
, hi
);
10110 /* Return nonzero if two operands that are suitable for PHI nodes are
10111 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10112 SSA_NAME or invariant. Note that this is strictly an optimization.
10113 That is, callers of this function can directly call operand_equal_p
10114 and get the same result, only slower. */
10117 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10121 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10123 return operand_equal_p (arg0
, arg1
, 0);
10126 /* Returns number of zeros at the end of binary representation of X.
10128 ??? Use ffs if available? */
10131 num_ending_zeros (const_tree x
)
10133 unsigned HOST_WIDE_INT fr
, nfr
;
10134 unsigned num
, abits
;
10135 tree type
= TREE_TYPE (x
);
10137 if (TREE_INT_CST_LOW (x
) == 0)
10139 num
= HOST_BITS_PER_WIDE_INT
;
10140 fr
= TREE_INT_CST_HIGH (x
);
10145 fr
= TREE_INT_CST_LOW (x
);
10148 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10151 if (nfr
<< abits
== fr
)
10158 if (num
> TYPE_PRECISION (type
))
10159 num
= TYPE_PRECISION (type
);
10161 return build_int_cst_type (type
, num
);
10165 #define WALK_SUBTREE(NODE) \
10168 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10174 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10175 be walked whenever a type is seen in the tree. Rest of operands and return
10176 value are as for walk_tree. */
10179 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10180 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10182 tree result
= NULL_TREE
;
10184 switch (TREE_CODE (type
))
10187 case REFERENCE_TYPE
:
10188 /* We have to worry about mutually recursive pointers. These can't
10189 be written in C. They can in Ada. It's pathological, but
10190 there's an ACATS test (c38102a) that checks it. Deal with this
10191 by checking if we're pointing to another pointer, that one
10192 points to another pointer, that one does too, and we have no htab.
10193 If so, get a hash table. We check three levels deep to avoid
10194 the cost of the hash table if we don't need one. */
10195 if (POINTER_TYPE_P (TREE_TYPE (type
))
10196 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10197 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10200 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10208 /* ... fall through ... */
10211 WALK_SUBTREE (TREE_TYPE (type
));
10215 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10217 /* Fall through. */
10219 case FUNCTION_TYPE
:
10220 WALK_SUBTREE (TREE_TYPE (type
));
10224 /* We never want to walk into default arguments. */
10225 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10226 WALK_SUBTREE (TREE_VALUE (arg
));
10231 /* Don't follow this nodes's type if a pointer for fear that
10232 we'll have infinite recursion. If we have a PSET, then we
10235 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10236 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10237 WALK_SUBTREE (TREE_TYPE (type
));
10238 WALK_SUBTREE (TYPE_DOMAIN (type
));
10242 WALK_SUBTREE (TREE_TYPE (type
));
10243 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10253 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10254 called with the DATA and the address of each sub-tree. If FUNC returns a
10255 non-NULL value, the traversal is stopped, and the value returned by FUNC
10256 is returned. If PSET is non-NULL it is used to record the nodes visited,
10257 and to avoid visiting a node more than once. */
10260 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10261 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10263 enum tree_code code
;
10267 #define WALK_SUBTREE_TAIL(NODE) \
10271 goto tail_recurse; \
10276 /* Skip empty subtrees. */
10280 /* Don't walk the same tree twice, if the user has requested
10281 that we avoid doing so. */
10282 if (pset
&& pointer_set_insert (pset
, *tp
))
10285 /* Call the function. */
10287 result
= (*func
) (tp
, &walk_subtrees
, data
);
10289 /* If we found something, return it. */
10293 code
= TREE_CODE (*tp
);
10295 /* Even if we didn't, FUNC may have decided that there was nothing
10296 interesting below this point in the tree. */
10297 if (!walk_subtrees
)
10299 /* But we still need to check our siblings. */
10300 if (code
== TREE_LIST
)
10301 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10302 else if (code
== OMP_CLAUSE
)
10303 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10310 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10311 if (result
|| !walk_subtrees
)
10318 case IDENTIFIER_NODE
:
10325 case PLACEHOLDER_EXPR
:
10329 /* None of these have subtrees other than those already walked
10334 WALK_SUBTREE (TREE_VALUE (*tp
));
10335 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10340 int len
= TREE_VEC_LENGTH (*tp
);
10345 /* Walk all elements but the first. */
10347 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10349 /* Now walk the first one as a tail call. */
10350 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10354 WALK_SUBTREE (TREE_REALPART (*tp
));
10355 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10359 unsigned HOST_WIDE_INT idx
;
10360 constructor_elt
*ce
;
10363 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10365 WALK_SUBTREE (ce
->value
);
10370 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10375 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10377 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10378 into declarations that are just mentioned, rather than
10379 declared; they don't really belong to this part of the tree.
10380 And, we can see cycles: the initializer for a declaration
10381 can refer to the declaration itself. */
10382 WALK_SUBTREE (DECL_INITIAL (decl
));
10383 WALK_SUBTREE (DECL_SIZE (decl
));
10384 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10386 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10389 case STATEMENT_LIST
:
10391 tree_stmt_iterator i
;
10392 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10393 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10398 switch (OMP_CLAUSE_CODE (*tp
))
10400 case OMP_CLAUSE_PRIVATE
:
10401 case OMP_CLAUSE_SHARED
:
10402 case OMP_CLAUSE_FIRSTPRIVATE
:
10403 case OMP_CLAUSE_COPYIN
:
10404 case OMP_CLAUSE_COPYPRIVATE
:
10405 case OMP_CLAUSE_IF
:
10406 case OMP_CLAUSE_NUM_THREADS
:
10407 case OMP_CLAUSE_SCHEDULE
:
10408 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10411 case OMP_CLAUSE_NOWAIT
:
10412 case OMP_CLAUSE_ORDERED
:
10413 case OMP_CLAUSE_DEFAULT
:
10414 case OMP_CLAUSE_UNTIED
:
10415 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10417 case OMP_CLAUSE_LASTPRIVATE
:
10418 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10419 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10420 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10422 case OMP_CLAUSE_COLLAPSE
:
10425 for (i
= 0; i
< 3; i
++)
10426 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10427 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10430 case OMP_CLAUSE_REDUCTION
:
10433 for (i
= 0; i
< 4; i
++)
10434 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10435 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10439 gcc_unreachable ();
10447 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10448 But, we only want to walk once. */
10449 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10450 for (i
= 0; i
< len
; ++i
)
10451 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10452 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10456 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10457 defining. We only want to walk into these fields of a type in this
10458 case and not in the general case of a mere reference to the type.
10460 The criterion is as follows: if the field can be an expression, it
10461 must be walked only here. This should be in keeping with the fields
10462 that are directly gimplified in gimplify_type_sizes in order for the
10463 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10464 variable-sized types.
10466 Note that DECLs get walked as part of processing the BIND_EXPR. */
10467 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10469 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10470 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10473 /* Call the function for the type. See if it returns anything or
10474 doesn't want us to continue. If we are to continue, walk both
10475 the normal fields and those for the declaration case. */
10476 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10477 if (result
|| !walk_subtrees
)
10480 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10484 /* If this is a record type, also walk the fields. */
10485 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10489 for (field
= TYPE_FIELDS (*type_p
); field
;
10490 field
= DECL_CHAIN (field
))
10492 /* We'd like to look at the type of the field, but we can
10493 easily get infinite recursion. So assume it's pointed
10494 to elsewhere in the tree. Also, ignore things that
10496 if (TREE_CODE (field
) != FIELD_DECL
)
10499 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10500 WALK_SUBTREE (DECL_SIZE (field
));
10501 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10502 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10503 WALK_SUBTREE (DECL_QUALIFIER (field
));
10507 /* Same for scalar types. */
10508 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10509 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10510 || TREE_CODE (*type_p
) == INTEGER_TYPE
10511 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10512 || TREE_CODE (*type_p
) == REAL_TYPE
)
10514 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10515 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10518 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10519 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10524 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10528 /* Walk over all the sub-trees of this operand. */
10529 len
= TREE_OPERAND_LENGTH (*tp
);
10531 /* Go through the subtrees. We need to do this in forward order so
10532 that the scope of a FOR_EXPR is handled properly. */
10535 for (i
= 0; i
< len
- 1; ++i
)
10536 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10537 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10540 /* If this is a type, walk the needed fields in the type. */
10541 else if (TYPE_P (*tp
))
10542 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10546 /* We didn't find what we were looking for. */
10549 #undef WALK_SUBTREE_TAIL
10551 #undef WALK_SUBTREE
10553 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10556 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10560 struct pointer_set_t
*pset
;
10562 pset
= pointer_set_create ();
10563 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10564 pointer_set_destroy (pset
);
10570 tree_block (tree t
)
10572 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10574 if (IS_EXPR_CODE_CLASS (c
))
10575 return &t
->exp
.block
;
10576 gcc_unreachable ();
10580 /* Create a nameless artificial label and put it in the current
10581 function context. The label has a location of LOC. Returns the
10582 newly created label. */
10585 create_artificial_label (location_t loc
)
10587 tree lab
= build_decl (loc
,
10588 LABEL_DECL
, NULL_TREE
, void_type_node
);
10590 DECL_ARTIFICIAL (lab
) = 1;
10591 DECL_IGNORED_P (lab
) = 1;
10592 DECL_CONTEXT (lab
) = current_function_decl
;
10596 /* Given a tree, try to return a useful variable name that we can use
10597 to prefix a temporary that is being assigned the value of the tree.
10598 I.E. given <temp> = &A, return A. */
10603 tree stripped_decl
;
10606 STRIP_NOPS (stripped_decl
);
10607 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10608 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10611 switch (TREE_CODE (stripped_decl
))
10614 return get_name (TREE_OPERAND (stripped_decl
, 0));
10621 /* Return true if TYPE has a variable argument list. */
10624 stdarg_p (const_tree fntype
)
10626 function_args_iterator args_iter
;
10627 tree n
= NULL_TREE
, t
;
10632 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10637 return n
!= NULL_TREE
&& n
!= void_type_node
;
10640 /* Return true if TYPE has a prototype. */
10643 prototype_p (tree fntype
)
10647 gcc_assert (fntype
!= NULL_TREE
);
10649 t
= TYPE_ARG_TYPES (fntype
);
10650 return (t
!= NULL_TREE
);
10653 /* If BLOCK is inlined from an __attribute__((__artificial__))
10654 routine, return pointer to location from where it has been
10657 block_nonartificial_location (tree block
)
10659 location_t
*ret
= NULL
;
10661 while (block
&& TREE_CODE (block
) == BLOCK
10662 && BLOCK_ABSTRACT_ORIGIN (block
))
10664 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10666 while (TREE_CODE (ao
) == BLOCK
10667 && BLOCK_ABSTRACT_ORIGIN (ao
)
10668 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10669 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10671 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10673 /* If AO is an artificial inline, point RET to the
10674 call site locus at which it has been inlined and continue
10675 the loop, in case AO's caller is also an artificial
10677 if (DECL_DECLARED_INLINE_P (ao
)
10678 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10679 ret
= &BLOCK_SOURCE_LOCATION (block
);
10683 else if (TREE_CODE (ao
) != BLOCK
)
10686 block
= BLOCK_SUPERCONTEXT (block
);
10692 /* If EXP is inlined from an __attribute__((__artificial__))
10693 function, return the location of the original call expression. */
10696 tree_nonartificial_location (tree exp
)
10698 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10703 return EXPR_LOCATION (exp
);
10707 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10710 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10713 cl_option_hash_hash (const void *x
)
10715 const_tree
const t
= (const_tree
) x
;
10719 hashval_t hash
= 0;
10721 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10723 p
= (const char *)TREE_OPTIMIZATION (t
);
10724 len
= sizeof (struct cl_optimization
);
10727 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10729 p
= (const char *)TREE_TARGET_OPTION (t
);
10730 len
= sizeof (struct cl_target_option
);
10734 gcc_unreachable ();
10736 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10738 for (i
= 0; i
< len
; i
++)
10740 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10745 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10746 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10750 cl_option_hash_eq (const void *x
, const void *y
)
10752 const_tree
const xt
= (const_tree
) x
;
10753 const_tree
const yt
= (const_tree
) y
;
10758 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10761 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10763 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10764 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10765 len
= sizeof (struct cl_optimization
);
10768 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10770 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10771 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10772 len
= sizeof (struct cl_target_option
);
10776 gcc_unreachable ();
10778 return (memcmp (xp
, yp
, len
) == 0);
10781 /* Build an OPTIMIZATION_NODE based on the current options. */
10784 build_optimization_node (void)
10789 /* Use the cache of optimization nodes. */
10791 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
10794 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10798 /* Insert this one into the hash table. */
10799 t
= cl_optimization_node
;
10802 /* Make a new node for next time round. */
10803 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10809 /* Build a TARGET_OPTION_NODE based on the current options. */
10812 build_target_option_node (void)
10817 /* Use the cache of optimization nodes. */
10819 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
10822 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
10826 /* Insert this one into the hash table. */
10827 t
= cl_target_option_node
;
10830 /* Make a new node for next time round. */
10831 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
10837 /* Determine the "ultimate origin" of a block. The block may be an inlined
10838 instance of an inlined instance of a block which is local to an inline
10839 function, so we have to trace all of the way back through the origin chain
10840 to find out what sort of node actually served as the original seed for the
10844 block_ultimate_origin (const_tree block
)
10846 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
10848 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
10849 nodes in the function to point to themselves; ignore that if
10850 we're trying to output the abstract instance of this function. */
10851 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
10854 if (immediate_origin
== NULL_TREE
)
10859 tree lookahead
= immediate_origin
;
10863 ret_val
= lookahead
;
10864 lookahead
= (TREE_CODE (ret_val
) == BLOCK
10865 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
10867 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
10869 /* The block's abstract origin chain may not be the *ultimate* origin of
10870 the block. It could lead to a DECL that has an abstract origin set.
10871 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
10872 will give us if it has one). Note that DECL's abstract origins are
10873 supposed to be the most distant ancestor (or so decl_ultimate_origin
10874 claims), so we don't need to loop following the DECL origins. */
10875 if (DECL_P (ret_val
))
10876 return DECL_ORIGIN (ret_val
);
10882 /* Return true if T1 and T2 are equivalent lists. */
10885 list_equal_p (const_tree t1
, const_tree t2
)
10887 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
10888 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
10893 /* Return true iff conversion in EXP generates no instruction. Mark
10894 it inline so that we fully inline into the stripping functions even
10895 though we have two uses of this function. */
10898 tree_nop_conversion (const_tree exp
)
10900 tree outer_type
, inner_type
;
10902 if (!CONVERT_EXPR_P (exp
)
10903 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
10905 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
10908 outer_type
= TREE_TYPE (exp
);
10909 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10914 /* Use precision rather then machine mode when we can, which gives
10915 the correct answer even for submode (bit-field) types. */
10916 if ((INTEGRAL_TYPE_P (outer_type
)
10917 || POINTER_TYPE_P (outer_type
)
10918 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
10919 && (INTEGRAL_TYPE_P (inner_type
)
10920 || POINTER_TYPE_P (inner_type
)
10921 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
10922 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
10924 /* Otherwise fall back on comparing machine modes (e.g. for
10925 aggregate types, floats). */
10926 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
10929 /* Return true iff conversion in EXP generates no instruction. Don't
10930 consider conversions changing the signedness. */
10933 tree_sign_nop_conversion (const_tree exp
)
10935 tree outer_type
, inner_type
;
10937 if (!tree_nop_conversion (exp
))
10940 outer_type
= TREE_TYPE (exp
);
10941 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
10943 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
10944 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
10947 /* Strip conversions from EXP according to tree_nop_conversion and
10948 return the resulting expression. */
10951 tree_strip_nop_conversions (tree exp
)
10953 while (tree_nop_conversion (exp
))
10954 exp
= TREE_OPERAND (exp
, 0);
10958 /* Strip conversions from EXP according to tree_sign_nop_conversion
10959 and return the resulting expression. */
10962 tree_strip_sign_nop_conversions (tree exp
)
10964 while (tree_sign_nop_conversion (exp
))
10965 exp
= TREE_OPERAND (exp
, 0);
10969 static GTY(()) tree gcc_eh_personality_decl
;
10971 /* Return the GCC personality function decl. */
10974 lhd_gcc_personality (void)
10976 if (!gcc_eh_personality_decl
)
10977 gcc_eh_personality_decl
= build_personality_function ("gcc");
10978 return gcc_eh_personality_decl
;
10981 /* Try to find a base info of BINFO that would have its field decl at offset
10982 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
10983 found, return, otherwise return NULL_TREE. */
10986 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
10988 tree type
= BINFO_TYPE (binfo
);
10992 HOST_WIDE_INT pos
, size
;
10996 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11001 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11003 if (TREE_CODE (fld
) != FIELD_DECL
)
11006 pos
= int_bit_position (fld
);
11007 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11008 if (pos
<= offset
&& (pos
+ size
) > offset
)
11011 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11014 if (!DECL_ARTIFICIAL (fld
))
11016 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11020 /* Offset 0 indicates the primary base, whose vtable contents are
11021 represented in the binfo for the derived class. */
11022 else if (offset
!= 0)
11024 tree base_binfo
, found_binfo
= NULL_TREE
;
11025 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11026 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11028 found_binfo
= base_binfo
;
11033 binfo
= found_binfo
;
11036 type
= TREE_TYPE (fld
);
11041 /* Returns true if X is a typedef decl. */
11044 is_typedef_decl (tree x
)
11046 return (x
&& TREE_CODE (x
) == TYPE_DECL
11047 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11050 /* Returns true iff TYPE is a type variant created for a typedef. */
11053 typedef_variant_p (tree type
)
11055 return is_typedef_decl (TYPE_NAME (type
));
11058 /* Warn about a use of an identifier which was marked deprecated. */
11060 warn_deprecated_use (tree node
, tree attr
)
11064 if (node
== 0 || !warn_deprecated_decl
)
11070 attr
= DECL_ATTRIBUTES (node
);
11071 else if (TYPE_P (node
))
11073 tree decl
= TYPE_STUB_DECL (node
);
11075 attr
= lookup_attribute ("deprecated",
11076 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11081 attr
= lookup_attribute ("deprecated", attr
);
11084 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11090 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11092 warning (OPT_Wdeprecated_declarations
,
11093 "%qD is deprecated (declared at %s:%d): %s",
11094 node
, xloc
.file
, xloc
.line
, msg
);
11096 warning (OPT_Wdeprecated_declarations
,
11097 "%qD is deprecated (declared at %s:%d)",
11098 node
, xloc
.file
, xloc
.line
);
11100 else if (TYPE_P (node
))
11102 tree what
= NULL_TREE
;
11103 tree decl
= TYPE_STUB_DECL (node
);
11105 if (TYPE_NAME (node
))
11107 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11108 what
= TYPE_NAME (node
);
11109 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11110 && DECL_NAME (TYPE_NAME (node
)))
11111 what
= DECL_NAME (TYPE_NAME (node
));
11116 expanded_location xloc
11117 = expand_location (DECL_SOURCE_LOCATION (decl
));
11121 warning (OPT_Wdeprecated_declarations
,
11122 "%qE is deprecated (declared at %s:%d): %s",
11123 what
, xloc
.file
, xloc
.line
, msg
);
11125 warning (OPT_Wdeprecated_declarations
,
11126 "%qE is deprecated (declared at %s:%d)", what
,
11127 xloc
.file
, xloc
.line
);
11132 warning (OPT_Wdeprecated_declarations
,
11133 "type is deprecated (declared at %s:%d): %s",
11134 xloc
.file
, xloc
.line
, msg
);
11136 warning (OPT_Wdeprecated_declarations
,
11137 "type is deprecated (declared at %s:%d)",
11138 xloc
.file
, xloc
.line
);
11146 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11149 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11154 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11157 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11163 #include "gt-tree.h"