]>
Commit | Line | Data |
---|---|---|
c6a1db6c | 1 | /* Language-independent node constructors for parse phase of GNU compiler. |
06ceef4e | 2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
69618c49 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. |
c6a1db6c | 4 | |
1322177d | 5 | This file is part of GCC. |
c6a1db6c | 6 | |
1322177d LB |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
c6a1db6c | 11 | |
1322177d LB |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
c6a1db6c RS |
16 | |
17 | You should have received a copy of the GNU General Public License | |
1322177d LB |
18 | along with GCC; see the file COPYING. If not, write to the Free |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. */ | |
c6a1db6c | 21 | |
c6a1db6c RS |
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 | |
27 | nodes of that code. | |
28 | ||
29 | It is intended to be language-independent, but occasionally | |
6d9f628e | 30 | calls language-dependent routines defined (for C) in typecheck.c. */ |
c6a1db6c RS |
31 | |
32 | #include "config.h" | |
670ee920 | 33 | #include "system.h" |
4977bab6 ZW |
34 | #include "coretypes.h" |
35 | #include "tm.h" | |
c6a1db6c | 36 | #include "flags.h" |
c6a1db6c | 37 | #include "tree.h" |
11ad4784 | 38 | #include "real.h" |
6baf1cc8 | 39 | #include "tm_p.h" |
d69c4bd1 | 40 | #include "function.h" |
c6a1db6c | 41 | #include "obstack.h" |
10f0ad3d | 42 | #include "toplev.h" |
87ff9c8e | 43 | #include "ggc.h" |
d88f311b | 44 | #include "hashtab.h" |
3b304f5b | 45 | #include "output.h" |
672a6f42 | 46 | #include "target.h" |
5d69f816 | 47 | #include "langhooks.h" |
6de9cd9a DN |
48 | #include "tree-iterator.h" |
49 | #include "basic-block.h" | |
50 | #include "tree-flow.h" | |
89b0433e | 51 | #include "params.h" |
b8c4a565 | 52 | #include "pointer-set.h" |
956d6950 | 53 | |
6615c446 JO |
54 | /* Each tree code class has an associated string representation. |
55 | These must correspond to the tree_code_class entries. */ | |
56 | ||
b85e3643 ZW |
57 | const char *const tree_code_class_strings[] = |
58 | { | |
59 | "exceptional", | |
60 | "constant", | |
61 | "type", | |
62 | "declaration", | |
63 | "reference", | |
64 | "comparison", | |
65 | "unary", | |
66 | "binary", | |
67 | "statement", | |
68 | "expression", | |
69 | }; | |
6615c446 | 70 | |
dc478a5d | 71 | /* obstack.[ch] explicitly declined to prototype this. */ |
46c5ad27 | 72 | extern int _obstack_allocated_p (struct obstack *h, void *obj); |
c6a1db6c | 73 | |
3e16bfe2 | 74 | #ifdef GATHER_STATISTICS |
c6a1db6c | 75 | /* Statistics-gathering stuff. */ |
03646189 | 76 | |
dc478a5d KH |
77 | int tree_node_counts[(int) all_kinds]; |
78 | int tree_node_sizes[(int) all_kinds]; | |
03646189 | 79 | |
938d968e | 80 | /* Keep in sync with tree.h:enum tree_node_kind. */ |
341a243e | 81 | static const char * const tree_node_kind_names[] = { |
03646189 RS |
82 | "decls", |
83 | "types", | |
84 | "blocks", | |
85 | "stmts", | |
86 | "refs", | |
87 | "exprs", | |
88 | "constants", | |
89 | "identifiers", | |
03646189 RS |
90 | "perm_tree_lists", |
91 | "temp_tree_lists", | |
92 | "vecs", | |
95b4aca6 | 93 | "binfos", |
6de9cd9a DN |
94 | "phi_nodes", |
95 | "ssa names", | |
03646189 RS |
96 | "random kinds", |
97 | "lang_decl kinds", | |
98 | "lang_type kinds" | |
99 | }; | |
3e16bfe2 | 100 | #endif /* GATHER_STATISTICS */ |
c6a1db6c | 101 | |
0e77444b | 102 | /* Unique id for next decl created. */ |
03907fbd | 103 | static GTY(()) int next_decl_uid; |
579f50b6 | 104 | /* Unique id for next type created. */ |
03907fbd | 105 | static GTY(()) int next_type_uid = 1; |
0e77444b | 106 | |
d88f311b ML |
107 | /* Since we cannot rehash a type after it is in the table, we have to |
108 | keep the hash code. */ | |
87ff9c8e | 109 | |
e2500fed | 110 | struct type_hash GTY(()) |
87ff9c8e | 111 | { |
d88f311b ML |
112 | unsigned long hash; |
113 | tree type; | |
87ff9c8e RH |
114 | }; |
115 | ||
dc478a5d | 116 | /* Initial size of the hash table (rounded to next prime). */ |
d88f311b | 117 | #define TYPE_HASH_INITIAL_SIZE 1000 |
87ff9c8e | 118 | |
d88f311b ML |
119 | /* Now here is the hash table. When recording a type, it is added to |
120 | the slot whose index is the hash code. Note that the hash table is | |
121 | used for several kinds of types (function types, array types and | |
122 | array index range types, for now). While all these live in the | |
123 | same table, they are completely independent, and the hash code is | |
124 | computed differently for each of these. */ | |
125 | ||
e2500fed GK |
126 | static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash))) |
127 | htab_t type_hash_table; | |
87ff9c8e | 128 | |
b66a64f1 NS |
129 | /* Hash table and temporary node for larger integer const values. */ |
130 | static GTY (()) tree int_cst_node; | |
131 | static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node))) | |
132 | htab_t int_cst_hash_table; | |
133 | ||
46c5ad27 | 134 | static void set_type_quals (tree, int); |
46c5ad27 AJ |
135 | static int type_hash_eq (const void *, const void *); |
136 | static hashval_t type_hash_hash (const void *); | |
b66a64f1 NS |
137 | static hashval_t int_cst_hash_hash (const void *); |
138 | static int int_cst_hash_eq (const void *, const void *); | |
46c5ad27 | 139 | static void print_type_hash_statistics (void); |
26277d41 | 140 | static tree make_vector_type (tree, int, enum machine_mode); |
46c5ad27 | 141 | static int type_hash_marked_p (const void *); |
fd917e0d JM |
142 | static unsigned int type_hash_list (tree, hashval_t); |
143 | static unsigned int attribute_hash_list (tree, hashval_t); | |
0a818f84 | 144 | |
81b3411c | 145 | tree global_trees[TI_MAX]; |
7145ef21 | 146 | tree integer_types[itk_none]; |
81b3411c | 147 | \f |
6d9f628e | 148 | /* Init tree.c. */ |
c6a1db6c RS |
149 | |
150 | void | |
46c5ad27 | 151 | init_ttree (void) |
c6a1db6c | 152 | { |
d4b60170 | 153 | /* Initialize the hash table of types. */ |
17211ab5 GK |
154 | type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash, |
155 | type_hash_eq, 0); | |
b66a64f1 NS |
156 | int_cst_hash_table = htab_create_ggc (1024, int_cst_hash_hash, |
157 | int_cst_hash_eq, NULL); | |
158 | int_cst_node = make_node (INTEGER_CST); | |
c6a1db6c RS |
159 | } |
160 | ||
c6a1db6c | 161 | \f |
599bba86 NB |
162 | /* The name of the object as the assembler will see it (but before any |
163 | translations made by ASM_OUTPUT_LABELREF). Often this is the same | |
164 | as DECL_NAME. It is an IDENTIFIER_NODE. */ | |
165 | tree | |
46c5ad27 | 166 | decl_assembler_name (tree decl) |
599bba86 NB |
167 | { |
168 | if (!DECL_ASSEMBLER_NAME_SET_P (decl)) | |
ae2bcd98 | 169 | lang_hooks.set_decl_assembler_name (decl); |
599bba86 NB |
170 | return DECL_CHECK (decl)->decl.assembler_name; |
171 | } | |
172 | ||
a396f8ae GK |
173 | /* Compute the number of bytes occupied by a tree with code CODE. |
174 | This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST | |
175 | codes, which are of variable length. */ | |
c5620996 | 176 | size_t |
a38b644b | 177 | tree_code_size (enum tree_code code) |
c5620996 | 178 | { |
c5620996 GK |
179 | switch (TREE_CODE_CLASS (code)) |
180 | { | |
6615c446 | 181 | case tcc_declaration: /* A decl node */ |
c5620996 GK |
182 | return sizeof (struct tree_decl); |
183 | ||
6615c446 | 184 | case tcc_type: /* a type node */ |
c5620996 GK |
185 | return sizeof (struct tree_type); |
186 | ||
6615c446 JO |
187 | case tcc_reference: /* a reference */ |
188 | case tcc_expression: /* an expression */ | |
189 | case tcc_statement: /* an expression with side effects */ | |
190 | case tcc_comparison: /* a comparison expression */ | |
191 | case tcc_unary: /* a unary arithmetic expression */ | |
192 | case tcc_binary: /* a binary arithmetic expression */ | |
c5620996 | 193 | return (sizeof (struct tree_exp) |
a38b644b | 194 | + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *)); |
c5620996 | 195 | |
6615c446 | 196 | case tcc_constant: /* a constant */ |
d78e771d ZW |
197 | switch (code) |
198 | { | |
199 | case INTEGER_CST: return sizeof (struct tree_int_cst); | |
200 | case REAL_CST: return sizeof (struct tree_real_cst); | |
201 | case COMPLEX_CST: return sizeof (struct tree_complex); | |
202 | case VECTOR_CST: return sizeof (struct tree_vector); | |
a396f8ae | 203 | case STRING_CST: gcc_unreachable (); |
d78e771d | 204 | default: |
ae2bcd98 | 205 | return lang_hooks.tree_size (code); |
d78e771d | 206 | } |
c5620996 | 207 | |
6615c446 | 208 | case tcc_exceptional: /* something random, like an identifier. */ |
d78e771d ZW |
209 | switch (code) |
210 | { | |
211 | case IDENTIFIER_NODE: return lang_hooks.identifier_size; | |
212 | case TREE_LIST: return sizeof (struct tree_list); | |
d78e771d ZW |
213 | |
214 | case ERROR_MARK: | |
215 | case PLACEHOLDER_EXPR: return sizeof (struct tree_common); | |
216 | ||
a396f8ae GK |
217 | case TREE_VEC: |
218 | case PHI_NODE: gcc_unreachable (); | |
6de9cd9a | 219 | |
6de9cd9a | 220 | case SSA_NAME: return sizeof (struct tree_ssa_name); |
6de9cd9a DN |
221 | |
222 | case STATEMENT_LIST: return sizeof (struct tree_statement_list); | |
90afe2c9 | 223 | case BLOCK: return sizeof (struct tree_block); |
33c94679 | 224 | case VALUE_HANDLE: return sizeof (struct tree_value_handle); |
6de9cd9a | 225 | |
d78e771d | 226 | default: |
ae2bcd98 | 227 | return lang_hooks.tree_size (code); |
d78e771d | 228 | } |
c5620996 GK |
229 | |
230 | default: | |
1e128c5f | 231 | gcc_unreachable (); |
c5620996 GK |
232 | } |
233 | } | |
234 | ||
a38b644b ZW |
235 | /* Compute the number of bytes occupied by NODE. This routine only |
236 | looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */ | |
237 | size_t | |
238 | tree_size (tree node) | |
239 | { | |
240 | enum tree_code code = TREE_CODE (node); | |
241 | switch (code) | |
242 | { | |
243 | case PHI_NODE: | |
244 | return (sizeof (struct tree_phi_node) | |
245 | + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d)); | |
0ebfd2c9 RS |
246 | |
247 | case TREE_BINFO: | |
248 | return (offsetof (struct tree_binfo, base_binfos) | |
249 | + VEC_embedded_size (tree, BINFO_N_BASE_BINFOS (node))); | |
a38b644b ZW |
250 | |
251 | case TREE_VEC: | |
252 | return (sizeof (struct tree_vec) | |
253 | + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *)); | |
254 | ||
a396f8ae GK |
255 | case STRING_CST: |
256 | return sizeof (struct tree_string) + TREE_STRING_LENGTH (node) - 1; | |
257 | ||
a38b644b ZW |
258 | default: |
259 | return tree_code_size (code); | |
260 | } | |
261 | } | |
262 | ||
263 | /* Return a newly allocated node of code CODE. For decl and type | |
264 | nodes, some other fields are initialized. The rest of the node is | |
265 | initialized to zero. This function cannot be used for PHI_NODE or | |
266 | TREE_VEC nodes, which is enforced by asserts in tree_code_size. | |
c6a1db6c RS |
267 | |
268 | Achoo! I got a code in the node. */ | |
269 | ||
270 | tree | |
b9dcdee4 | 271 | make_node_stat (enum tree_code code MEM_STAT_DECL) |
c6a1db6c | 272 | { |
b3694847 | 273 | tree t; |
6615c446 | 274 | enum tree_code_class type = TREE_CODE_CLASS (code); |
a38b644b | 275 | size_t length = tree_code_size (code); |
5e9defae | 276 | #ifdef GATHER_STATISTICS |
b3694847 | 277 | tree_node_kind kind; |
3b03c671 | 278 | |
c6a1db6c RS |
279 | switch (type) |
280 | { | |
6615c446 | 281 | case tcc_declaration: /* A decl node */ |
c6a1db6c | 282 | kind = d_kind; |
c6a1db6c RS |
283 | break; |
284 | ||
6615c446 | 285 | case tcc_type: /* a type node */ |
c6a1db6c | 286 | kind = t_kind; |
c6a1db6c RS |
287 | break; |
288 | ||
6615c446 | 289 | case tcc_statement: /* an expression with side effects */ |
c6a1db6c | 290 | kind = s_kind; |
c5620996 GK |
291 | break; |
292 | ||
6615c446 | 293 | case tcc_reference: /* a reference */ |
c6a1db6c | 294 | kind = r_kind; |
c5620996 GK |
295 | break; |
296 | ||
6615c446 JO |
297 | case tcc_expression: /* an expression */ |
298 | case tcc_comparison: /* a comparison expression */ | |
299 | case tcc_unary: /* a unary arithmetic expression */ | |
300 | case tcc_binary: /* a binary arithmetic expression */ | |
c6a1db6c | 301 | kind = e_kind; |
c6a1db6c RS |
302 | break; |
303 | ||
6615c446 | 304 | case tcc_constant: /* a constant */ |
c6a1db6c | 305 | kind = c_kind; |
66212c2f | 306 | break; |
c6a1db6c | 307 | |
6615c446 | 308 | case tcc_exceptional: /* something random, like an identifier. */ |
c4b3f0eb NS |
309 | switch (code) |
310 | { | |
311 | case IDENTIFIER_NODE: | |
312 | kind = id_kind; | |
313 | break; | |
314 | ||
315 | case TREE_VEC:; | |
316 | kind = vec_kind; | |
317 | break; | |
318 | ||
319 | case TREE_BINFO: | |
320 | kind = binfo_kind; | |
321 | break; | |
322 | ||
323 | case PHI_NODE: | |
324 | kind = phi_kind; | |
325 | break; | |
326 | ||
327 | case SSA_NAME: | |
328 | kind = ssa_name_kind; | |
329 | break; | |
330 | ||
331 | case BLOCK: | |
332 | kind = b_kind; | |
333 | break; | |
334 | ||
335 | default: | |
336 | kind = x_kind; | |
337 | break; | |
338 | } | |
a7fcb968 | 339 | break; |
c4b3f0eb NS |
340 | |
341 | default: | |
342 | gcc_unreachable (); | |
c6a1db6c RS |
343 | } |
344 | ||
dc478a5d KH |
345 | tree_node_counts[(int) kind]++; |
346 | tree_node_sizes[(int) kind] += length; | |
c6a1db6c RS |
347 | #endif |
348 | ||
08cee789 DJ |
349 | if (code == IDENTIFIER_NODE) |
350 | t = ggc_alloc_zone_stat (length, &tree_id_zone PASS_MEM_STAT); | |
351 | else | |
352 | t = ggc_alloc_zone_stat (length, &tree_zone PASS_MEM_STAT); | |
c5620996 | 353 | |
fad205ff | 354 | memset (t, 0, length); |
c5620996 | 355 | |
c6a1db6c | 356 | TREE_SET_CODE (t, code); |
c6a1db6c RS |
357 | |
358 | switch (type) | |
359 | { | |
6615c446 | 360 | case tcc_statement: |
c6a1db6c | 361 | TREE_SIDE_EFFECTS (t) = 1; |
c6a1db6c RS |
362 | break; |
363 | ||
6615c446 | 364 | case tcc_declaration: |
c0920bf9 | 365 | if (code != FUNCTION_DECL) |
c7ee7249 | 366 | DECL_ALIGN (t) = 1; |
11cf4d18 | 367 | DECL_USER_ALIGN (t) = 0; |
23dfa477 | 368 | DECL_IN_SYSTEM_HEADER (t) = in_system_header; |
f31686a3 | 369 | DECL_SOURCE_LOCATION (t) = input_location; |
5b02f0e0 | 370 | DECL_UID (t) = next_decl_uid++; |
128e8aa9 RK |
371 | |
372 | /* We have not yet computed the alias set for this declaration. */ | |
3932261a | 373 | DECL_POINTER_ALIAS_SET (t) = -1; |
c6a1db6c RS |
374 | break; |
375 | ||
6615c446 | 376 | case tcc_type: |
579f50b6 | 377 | TYPE_UID (t) = next_type_uid++; |
13c6f0d5 | 378 | TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0; |
11cf4d18 | 379 | TYPE_USER_ALIGN (t) = 0; |
c6a1db6c | 380 | TYPE_MAIN_VARIANT (t) = t; |
128e8aa9 RK |
381 | |
382 | /* Default to no attributes for type, but let target change that. */ | |
91e97eb8 | 383 | TYPE_ATTRIBUTES (t) = NULL_TREE; |
5fd9b178 | 384 | targetm.set_default_type_attributes (t); |
128e8aa9 RK |
385 | |
386 | /* We have not yet computed the alias set for this type. */ | |
41472af8 | 387 | TYPE_ALIAS_SET (t) = -1; |
c6a1db6c RS |
388 | break; |
389 | ||
6615c446 | 390 | case tcc_constant: |
c6a1db6c | 391 | TREE_CONSTANT (t) = 1; |
6de9cd9a | 392 | TREE_INVARIANT (t) = 1; |
c6a1db6c | 393 | break; |
783feeb0 | 394 | |
6615c446 | 395 | case tcc_expression: |
783feeb0 MM |
396 | switch (code) |
397 | { | |
398 | case INIT_EXPR: | |
399 | case MODIFY_EXPR: | |
400 | case VA_ARG_EXPR: | |
783feeb0 MM |
401 | case PREDECREMENT_EXPR: |
402 | case PREINCREMENT_EXPR: | |
403 | case POSTDECREMENT_EXPR: | |
404 | case POSTINCREMENT_EXPR: | |
405 | /* All of these have side-effects, no matter what their | |
406 | operands are. */ | |
407 | TREE_SIDE_EFFECTS (t) = 1; | |
408 | break; | |
dc478a5d | 409 | |
783feeb0 MM |
410 | default: |
411 | break; | |
412 | } | |
413 | break; | |
6615c446 JO |
414 | |
415 | default: | |
416 | /* Other classes need no special treatment. */ | |
417 | break; | |
c6a1db6c RS |
418 | } |
419 | ||
420 | return t; | |
421 | } | |
422 | \f | |
c3da6f12 | 423 | /* Return a new node with the same contents as NODE except that its |
3af4c257 | 424 | TREE_CHAIN is zero and it has a fresh uid. */ |
c6a1db6c RS |
425 | |
426 | tree | |
b9dcdee4 | 427 | copy_node_stat (tree node MEM_STAT_DECL) |
c6a1db6c | 428 | { |
b3694847 SS |
429 | tree t; |
430 | enum tree_code code = TREE_CODE (node); | |
431 | size_t length; | |
c6a1db6c | 432 | |
1e128c5f | 433 | gcc_assert (code != STATEMENT_LIST); |
6de9cd9a | 434 | |
c5620996 | 435 | length = tree_size (node); |
08cee789 | 436 | t = ggc_alloc_zone_stat (length, &tree_zone PASS_MEM_STAT); |
2e28f042 | 437 | memcpy (t, node, length); |
c6a1db6c | 438 | |
1e54d32b | 439 | TREE_CHAIN (t) = 0; |
69b7087e | 440 | TREE_ASM_WRITTEN (t) = 0; |
6de9cd9a DN |
441 | TREE_VISITED (t) = 0; |
442 | t->common.ann = 0; | |
c6a1db6c | 443 | |
6615c446 | 444 | if (TREE_CODE_CLASS (code) == tcc_declaration) |
579f50b6 | 445 | DECL_UID (t) = next_decl_uid++; |
6615c446 | 446 | else if (TREE_CODE_CLASS (code) == tcc_type) |
d9cbc259 RK |
447 | { |
448 | TYPE_UID (t) = next_type_uid++; | |
28238567 PB |
449 | /* The following is so that the debug code for |
450 | the copy is different from the original type. | |
451 | The two statements usually duplicate each other | |
452 | (because they clear fields of the same union), | |
0f41302f | 453 | but the optimizer should catch that. */ |
28238567 PB |
454 | TYPE_SYMTAB_POINTER (t) = 0; |
455 | TYPE_SYMTAB_ADDRESS (t) = 0; | |
8c1d6d62 NS |
456 | |
457 | /* Do not copy the values cache. */ | |
458 | if (TYPE_CACHED_VALUES_P(t)) | |
459 | { | |
460 | TYPE_CACHED_VALUES_P (t) = 0; | |
461 | TYPE_CACHED_VALUES (t) = NULL_TREE; | |
462 | } | |
d9cbc259 | 463 | } |
579f50b6 | 464 | |
c6a1db6c RS |
465 | return t; |
466 | } | |
467 | ||
468 | /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field. | |
469 | For example, this can copy a list made of TREE_LIST nodes. */ | |
470 | ||
471 | tree | |
46c5ad27 | 472 | copy_list (tree list) |
c6a1db6c RS |
473 | { |
474 | tree head; | |
b3694847 | 475 | tree prev, next; |
c6a1db6c RS |
476 | |
477 | if (list == 0) | |
478 | return 0; | |
479 | ||
480 | head = prev = copy_node (list); | |
481 | next = TREE_CHAIN (list); | |
482 | while (next) | |
483 | { | |
484 | TREE_CHAIN (prev) = copy_node (next); | |
485 | prev = TREE_CHAIN (prev); | |
486 | next = TREE_CHAIN (next); | |
487 | } | |
488 | return head; | |
489 | } | |
a94dbf2c | 490 | |
c6a1db6c | 491 | \f |
7d60be94 NS |
492 | /* Create an INT_CST node with a LOW value sign extended. */ |
493 | ||
d938569c RK |
494 | tree |
495 | build_int_cst (tree type, HOST_WIDE_INT low) | |
7d60be94 | 496 | { |
69fbfdd8 | 497 | return build_int_cst_wide (type, low, low < 0 ? -1 : 0); |
7d60be94 NS |
498 | } |
499 | ||
500 | /* Create an INT_CST node with a LOW value zero extended. */ | |
501 | ||
d938569c RK |
502 | tree |
503 | build_int_cstu (tree type, unsigned HOST_WIDE_INT low) | |
7d60be94 NS |
504 | { |
505 | return build_int_cst_wide (type, low, 0); | |
506 | } | |
507 | ||
89d12f5d ZD |
508 | /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended |
509 | if it is negative. This function is similar to build_int_cst, but | |
510 | the extra bits outside of the type precision are cleared. Constants | |
511 | with these extra bits may confuse the fold so that it detects overflows | |
512 | even in cases when they do not occur, and in general should be avoided. | |
513 | We cannot however make this a default behavior of build_int_cst without | |
514 | more intrusive changes, since there are parts of gcc that rely on the extra | |
515 | precision of the integer constants. */ | |
8b11a64c ZD |
516 | |
517 | tree | |
518 | build_int_cst_type (tree type, HOST_WIDE_INT low) | |
519 | { | |
520 | unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low; | |
89d12f5d | 521 | unsigned HOST_WIDE_INT hi; |
8b11a64c ZD |
522 | unsigned bits; |
523 | bool signed_p; | |
524 | bool negative; | |
8b11a64c ZD |
525 | |
526 | if (!type) | |
527 | type = integer_type_node; | |
528 | ||
529 | bits = TYPE_PRECISION (type); | |
530 | signed_p = !TYPE_UNSIGNED (type); | |
8b11a64c | 531 | |
89d12f5d ZD |
532 | if (bits >= HOST_BITS_PER_WIDE_INT) |
533 | negative = (low < 0); | |
534 | else | |
8b11a64c | 535 | { |
89d12f5d ZD |
536 | /* If the sign bit is inside precision of LOW, use it to determine |
537 | the sign of the constant. */ | |
538 | negative = ((val >> (bits - 1)) & 1) != 0; | |
539 | ||
540 | /* Mask out the bits outside of the precision of the constant. */ | |
541 | if (signed_p && negative) | |
8b11a64c | 542 | val = val | ((~(unsigned HOST_WIDE_INT) 0) << bits); |
89d12f5d ZD |
543 | else |
544 | val = val & ~((~(unsigned HOST_WIDE_INT) 0) << bits); | |
8b11a64c | 545 | } |
89d12f5d ZD |
546 | |
547 | /* Determine the high bits. */ | |
548 | hi = (negative ? ~(unsigned HOST_WIDE_INT) 0 : 0); | |
549 | ||
550 | /* For unsigned type we need to mask out the bits outside of the type | |
551 | precision. */ | |
552 | if (!signed_p) | |
8b11a64c | 553 | { |
89d12f5d ZD |
554 | if (bits <= HOST_BITS_PER_WIDE_INT) |
555 | hi = 0; | |
556 | else | |
557 | { | |
558 | bits -= HOST_BITS_PER_WIDE_INT; | |
559 | hi = hi & ~((~(unsigned HOST_WIDE_INT) 0) << bits); | |
560 | } | |
8b11a64c ZD |
561 | } |
562 | ||
89d12f5d | 563 | return build_int_cst_wide (type, val, hi); |
8b11a64c ZD |
564 | } |
565 | ||
b66a64f1 NS |
566 | /* These are the hash table functions for the hash table of INTEGER_CST |
567 | nodes of a sizetype. */ | |
568 | ||
569 | /* Return the hash code code X, an INTEGER_CST. */ | |
570 | ||
571 | static hashval_t | |
572 | int_cst_hash_hash (const void *x) | |
573 | { | |
574 | tree t = (tree) x; | |
575 | ||
576 | return (TREE_INT_CST_HIGH (t) ^ TREE_INT_CST_LOW (t) | |
577 | ^ htab_hash_pointer (TREE_TYPE (t))); | |
578 | } | |
579 | ||
580 | /* Return nonzero if the value represented by *X (an INTEGER_CST tree node) | |
581 | is the same as that given by *Y, which is the same. */ | |
582 | ||
583 | static int | |
584 | int_cst_hash_eq (const void *x, const void *y) | |
585 | { | |
586 | tree xt = (tree) x; | |
587 | tree yt = (tree) y; | |
588 | ||
589 | return (TREE_TYPE (xt) == TREE_TYPE (yt) | |
590 | && TREE_INT_CST_HIGH (xt) == TREE_INT_CST_HIGH (yt) | |
591 | && TREE_INT_CST_LOW (xt) == TREE_INT_CST_LOW (yt)); | |
592 | } | |
593 | ||
4a90aeeb | 594 | /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL, |
b66a64f1 NS |
595 | integer_type_node is used. The returned node is always shared. |
596 | For small integers we use a per-type vector cache, for larger ones | |
597 | we use a single hash table. */ | |
c6a1db6c RS |
598 | |
599 | tree | |
7d60be94 | 600 | build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi) |
c6a1db6c | 601 | { |
4a90aeeb | 602 | tree t; |
89b0433e NS |
603 | int ix = -1; |
604 | int limit = 0; | |
4a90aeeb NS |
605 | |
606 | if (!type) | |
607 | type = integer_type_node; | |
19114537 | 608 | |
89b0433e NS |
609 | switch (TREE_CODE (type)) |
610 | { | |
611 | case POINTER_TYPE: | |
612 | case REFERENCE_TYPE: | |
613 | /* Cache NULL pointer. */ | |
614 | if (!hi && !low) | |
615 | { | |
616 | limit = 1; | |
617 | ix = 0; | |
618 | } | |
619 | break; | |
19114537 | 620 | |
89b0433e NS |
621 | case BOOLEAN_TYPE: |
622 | /* Cache false or true. */ | |
623 | limit = 2; | |
624 | if (!hi && low < 2) | |
625 | ix = low; | |
626 | break; | |
19114537 | 627 | |
89b0433e NS |
628 | case INTEGER_TYPE: |
629 | case CHAR_TYPE: | |
630 | case OFFSET_TYPE: | |
631 | if (TYPE_UNSIGNED (type)) | |
632 | { | |
633 | /* Cache 0..N */ | |
634 | limit = INTEGER_SHARE_LIMIT; | |
635 | if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT) | |
636 | ix = low; | |
637 | } | |
638 | else | |
639 | { | |
640 | /* Cache -1..N */ | |
641 | limit = INTEGER_SHARE_LIMIT + 1; | |
642 | if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT) | |
643 | ix = low + 1; | |
644 | else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1) | |
645 | ix = 0; | |
646 | } | |
647 | break; | |
648 | default: | |
649 | break; | |
650 | } | |
19114537 | 651 | |
89b0433e NS |
652 | if (ix >= 0) |
653 | { | |
b66a64f1 | 654 | /* Look for it in the type's vector of small shared ints. */ |
89b0433e NS |
655 | if (!TYPE_CACHED_VALUES_P (type)) |
656 | { | |
657 | TYPE_CACHED_VALUES_P (type) = 1; | |
658 | TYPE_CACHED_VALUES (type) = make_tree_vec (limit); | |
659 | } | |
19114537 | 660 | |
89b0433e NS |
661 | t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix); |
662 | if (t) | |
663 | { | |
664 | /* Make sure no one is clobbering the shared constant. */ | |
1e128c5f GB |
665 | gcc_assert (TREE_TYPE (t) == type); |
666 | gcc_assert (TREE_INT_CST_LOW (t) == low); | |
667 | gcc_assert (TREE_INT_CST_HIGH (t) == hi); | |
b66a64f1 NS |
668 | } |
669 | else | |
670 | { | |
671 | /* Create a new shared int. */ | |
672 | t = make_node (INTEGER_CST); | |
673 | ||
674 | TREE_INT_CST_LOW (t) = low; | |
675 | TREE_INT_CST_HIGH (t) = hi; | |
676 | TREE_TYPE (t) = type; | |
677 | ||
678 | TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t; | |
89b0433e NS |
679 | } |
680 | } | |
b66a64f1 NS |
681 | else |
682 | { | |
683 | /* Use the cache of larger shared ints. */ | |
684 | void **slot; | |
19114537 | 685 | |
b66a64f1 NS |
686 | TREE_INT_CST_LOW (int_cst_node) = low; |
687 | TREE_INT_CST_HIGH (int_cst_node) = hi; | |
688 | TREE_TYPE (int_cst_node) = type; | |
89b0433e | 689 | |
b66a64f1 NS |
690 | slot = htab_find_slot (int_cst_hash_table, int_cst_node, INSERT); |
691 | t = *slot; | |
692 | if (!t) | |
693 | { | |
694 | /* Insert this one into the hash table. */ | |
695 | t = int_cst_node; | |
696 | *slot = t; | |
697 | /* Make a new node for next time round. */ | |
698 | int_cst_node = make_node (INTEGER_CST); | |
699 | } | |
700 | } | |
19114537 | 701 | |
c6a1db6c RS |
702 | return t; |
703 | } | |
704 | ||
38b0dcb8 ZD |
705 | /* Builds an integer constant in TYPE such that lowest BITS bits are ones |
706 | and the rest are zeros. */ | |
707 | ||
708 | tree | |
709 | build_low_bits_mask (tree type, unsigned bits) | |
710 | { | |
711 | unsigned HOST_WIDE_INT low; | |
712 | HOST_WIDE_INT high; | |
713 | unsigned HOST_WIDE_INT all_ones = ~(unsigned HOST_WIDE_INT) 0; | |
714 | ||
715 | gcc_assert (bits <= TYPE_PRECISION (type)); | |
716 | ||
717 | if (bits == TYPE_PRECISION (type) | |
718 | && !TYPE_UNSIGNED (type)) | |
719 | { | |
720 | /* Sign extended all-ones mask. */ | |
721 | low = all_ones; | |
722 | high = -1; | |
723 | } | |
724 | else if (bits <= HOST_BITS_PER_WIDE_INT) | |
725 | { | |
726 | low = all_ones >> (HOST_BITS_PER_WIDE_INT - bits); | |
727 | high = 0; | |
728 | } | |
729 | else | |
730 | { | |
731 | bits -= HOST_BITS_PER_WIDE_INT; | |
732 | low = all_ones; | |
733 | high = all_ones >> (HOST_BITS_PER_WIDE_INT - bits); | |
734 | } | |
735 | ||
736 | return build_int_cst_wide (type, low, high); | |
737 | } | |
738 | ||
8b11a64c ZD |
739 | /* Checks that X is integer constant that can be expressed in (unsigned) |
740 | HOST_WIDE_INT without loss of precision. */ | |
741 | ||
742 | bool | |
743 | cst_and_fits_in_hwi (tree x) | |
744 | { | |
745 | if (TREE_CODE (x) != INTEGER_CST) | |
746 | return false; | |
747 | ||
748 | if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT) | |
749 | return false; | |
750 | ||
751 | return (TREE_INT_CST_HIGH (x) == 0 | |
752 | || TREE_INT_CST_HIGH (x) == -1); | |
753 | } | |
754 | ||
69ef87e2 AH |
755 | /* Return a new VECTOR_CST node whose type is TYPE and whose values |
756 | are in a list pointed by VALS. */ | |
757 | ||
758 | tree | |
46c5ad27 | 759 | build_vector (tree type, tree vals) |
69ef87e2 AH |
760 | { |
761 | tree v = make_node (VECTOR_CST); | |
762 | int over1 = 0, over2 = 0; | |
763 | tree link; | |
764 | ||
765 | TREE_VECTOR_CST_ELTS (v) = vals; | |
766 | TREE_TYPE (v) = type; | |
767 | ||
768 | /* Iterate through elements and check for overflow. */ | |
769 | for (link = vals; link; link = TREE_CHAIN (link)) | |
770 | { | |
771 | tree value = TREE_VALUE (link); | |
772 | ||
773 | over1 |= TREE_OVERFLOW (value); | |
774 | over2 |= TREE_CONSTANT_OVERFLOW (value); | |
775 | } | |
3b03c671 | 776 | |
69ef87e2 AH |
777 | TREE_OVERFLOW (v) = over1; |
778 | TREE_CONSTANT_OVERFLOW (v) = over2; | |
779 | ||
780 | return v; | |
781 | } | |
782 | ||
dcf92453 ZW |
783 | /* Return a new CONSTRUCTOR node whose type is TYPE and whose values |
784 | are in a list pointed to by VALS. */ | |
785 | tree | |
46c5ad27 | 786 | build_constructor (tree type, tree vals) |
dcf92453 ZW |
787 | { |
788 | tree c = make_node (CONSTRUCTOR); | |
789 | TREE_TYPE (c) = type; | |
790 | CONSTRUCTOR_ELTS (c) = vals; | |
791 | ||
792 | /* ??? May not be necessary. Mirrors what build does. */ | |
793 | if (vals) | |
794 | { | |
795 | TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals); | |
796 | TREE_READONLY (c) = TREE_READONLY (vals); | |
797 | TREE_CONSTANT (c) = TREE_CONSTANT (vals); | |
6de9cd9a | 798 | TREE_INVARIANT (c) = TREE_INVARIANT (vals); |
dcf92453 | 799 | } |
dcf92453 ZW |
800 | |
801 | return c; | |
802 | } | |
803 | ||
c6a1db6c RS |
804 | /* Return a new REAL_CST node whose type is TYPE and value is D. */ |
805 | ||
806 | tree | |
46c5ad27 | 807 | build_real (tree type, REAL_VALUE_TYPE d) |
c6a1db6c RS |
808 | { |
809 | tree v; | |
11ad4784 | 810 | REAL_VALUE_TYPE *dp; |
0afbe93d | 811 | int overflow = 0; |
c6a1db6c | 812 | |
efdc7e19 RH |
813 | /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE. |
814 | Consider doing it via real_convert now. */ | |
c6a1db6c RS |
815 | |
816 | v = make_node (REAL_CST); | |
11ad4784 ZW |
817 | dp = ggc_alloc (sizeof (REAL_VALUE_TYPE)); |
818 | memcpy (dp, &d, sizeof (REAL_VALUE_TYPE)); | |
41077ce4 | 819 | |
c6a1db6c | 820 | TREE_TYPE (v) = type; |
11ad4784 | 821 | TREE_REAL_CST_PTR (v) = dp; |
0afbe93d | 822 | TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow; |
c6a1db6c RS |
823 | return v; |
824 | } | |
825 | ||
826 | /* Return a new REAL_CST node whose type is TYPE | |
827 | and whose value is the integer value of the INTEGER_CST node I. */ | |
828 | ||
c6a1db6c | 829 | REAL_VALUE_TYPE |
875eda9c | 830 | real_value_from_int_cst (tree type, tree i) |
c6a1db6c RS |
831 | { |
832 | REAL_VALUE_TYPE d; | |
2026444a | 833 | |
e545d37f RK |
834 | /* Clear all bits of the real value type so that we can later do |
835 | bitwise comparisons to see if two values are the same. */ | |
703ad42b | 836 | memset (&d, 0, sizeof d); |
e545d37f | 837 | |
875eda9c RS |
838 | real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode, |
839 | TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i), | |
8df83eae | 840 | TYPE_UNSIGNED (TREE_TYPE (i))); |
c6a1db6c RS |
841 | return d; |
842 | } | |
843 | ||
d4b60170 | 844 | /* Given a tree representing an integer constant I, return a tree |
15e5ad76 | 845 | representing the same value as a floating-point constant of type TYPE. */ |
c6a1db6c RS |
846 | |
847 | tree | |
46c5ad27 | 848 | build_real_from_int_cst (tree type, tree i) |
c6a1db6c RS |
849 | { |
850 | tree v; | |
53d74c3c | 851 | int overflow = TREE_OVERFLOW (i); |
c6a1db6c | 852 | |
11ad4784 | 853 | v = build_real (type, real_value_from_int_cst (type, i)); |
c6a1db6c | 854 | |
11ad4784 ZW |
855 | TREE_OVERFLOW (v) |= overflow; |
856 | TREE_CONSTANT_OVERFLOW (v) |= overflow; | |
c6a1db6c RS |
857 | return v; |
858 | } | |
859 | ||
c6a1db6c RS |
860 | /* Return a newly constructed STRING_CST node whose value is |
861 | the LEN characters at STR. | |
862 | The TREE_TYPE is not initialized. */ | |
863 | ||
864 | tree | |
46c5ad27 | 865 | build_string (int len, const char *str) |
c6a1db6c | 866 | { |
a396f8ae GK |
867 | tree s; |
868 | size_t length; | |
869 | ||
870 | length = len + sizeof (struct tree_string); | |
871 | ||
872 | #ifdef GATHER_STATISTICS | |
873 | tree_node_counts[(int) c_kind]++; | |
874 | tree_node_sizes[(int) c_kind] += length; | |
875 | #endif | |
876 | ||
877 | s = ggc_alloc_tree (length); | |
d4b60170 | 878 | |
a396f8ae GK |
879 | memset (s, 0, sizeof (struct tree_common)); |
880 | TREE_SET_CODE (s, STRING_CST); | |
c6a1db6c | 881 | TREE_STRING_LENGTH (s) = len; |
a396f8ae GK |
882 | memcpy ((char *) TREE_STRING_POINTER (s), str, len); |
883 | ((char *) TREE_STRING_POINTER (s))[len] = '\0'; | |
d4b60170 | 884 | |
c6a1db6c RS |
885 | return s; |
886 | } | |
887 | ||
888 | /* Return a newly constructed COMPLEX_CST node whose value is | |
889 | specified by the real and imaginary parts REAL and IMAG. | |
b217d7fe RK |
890 | Both REAL and IMAG should be constant nodes. TYPE, if specified, |
891 | will be the type of the COMPLEX_CST; otherwise a new type will be made. */ | |
c6a1db6c RS |
892 | |
893 | tree | |
46c5ad27 | 894 | build_complex (tree type, tree real, tree imag) |
c6a1db6c | 895 | { |
b3694847 | 896 | tree t = make_node (COMPLEX_CST); |
53d74c3c | 897 | |
c6a1db6c RS |
898 | TREE_REALPART (t) = real; |
899 | TREE_IMAGPART (t) = imag; | |
b217d7fe | 900 | TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real)); |
53d74c3c RK |
901 | TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag); |
902 | TREE_CONSTANT_OVERFLOW (t) | |
903 | = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag); | |
c6a1db6c RS |
904 | return t; |
905 | } | |
906 | ||
95b4aca6 NS |
907 | /* Build a BINFO with LEN language slots. */ |
908 | ||
909 | tree | |
fa743e8c | 910 | make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL) |
95b4aca6 NS |
911 | { |
912 | tree t; | |
fa743e8c NS |
913 | size_t length = (offsetof (struct tree_binfo, base_binfos) |
914 | + VEC_embedded_size (tree, base_binfos)); | |
9f63daea | 915 | |
95b4aca6 NS |
916 | #ifdef GATHER_STATISTICS |
917 | tree_node_counts[(int) binfo_kind]++; | |
918 | tree_node_sizes[(int) binfo_kind] += length; | |
919 | #endif | |
920 | ||
08cee789 | 921 | t = ggc_alloc_zone_stat (length, &tree_zone PASS_MEM_STAT); |
95b4aca6 | 922 | |
fa743e8c | 923 | memset (t, 0, offsetof (struct tree_binfo, base_binfos)); |
95b4aca6 NS |
924 | |
925 | TREE_SET_CODE (t, TREE_BINFO); | |
9f63daea | 926 | |
fa743e8c | 927 | VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos); |
95b4aca6 NS |
928 | |
929 | return t; | |
930 | } | |
931 | ||
932 | ||
c6a1db6c | 933 | /* Build a newly constructed TREE_VEC node of length LEN. */ |
0f41302f | 934 | |
c6a1db6c | 935 | tree |
b9dcdee4 | 936 | make_tree_vec_stat (int len MEM_STAT_DECL) |
c6a1db6c | 937 | { |
b3694847 | 938 | tree t; |
3b03c671 | 939 | int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec); |
c6a1db6c RS |
940 | |
941 | #ifdef GATHER_STATISTICS | |
3b03c671 KH |
942 | tree_node_counts[(int) vec_kind]++; |
943 | tree_node_sizes[(int) vec_kind] += length; | |
c6a1db6c RS |
944 | #endif |
945 | ||
08cee789 | 946 | t = ggc_alloc_zone_stat (length, &tree_zone PASS_MEM_STAT); |
508f8149 | 947 | |
fad205ff | 948 | memset (t, 0, length); |
b9dcdee4 | 949 | |
c6a1db6c RS |
950 | TREE_SET_CODE (t, TREE_VEC); |
951 | TREE_VEC_LENGTH (t) = len; | |
c6a1db6c RS |
952 | |
953 | return t; | |
954 | } | |
955 | \f | |
9ad265b0 RK |
956 | /* Return 1 if EXPR is the integer constant zero or a complex constant |
957 | of zero. */ | |
c6a1db6c RS |
958 | |
959 | int | |
46c5ad27 | 960 | integer_zerop (tree expr) |
c6a1db6c | 961 | { |
d964285c | 962 | STRIP_NOPS (expr); |
c6a1db6c | 963 | |
9ad265b0 | 964 | return ((TREE_CODE (expr) == INTEGER_CST |
1ac876be | 965 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
966 | && TREE_INT_CST_LOW (expr) == 0 |
967 | && TREE_INT_CST_HIGH (expr) == 0) | |
968 | || (TREE_CODE (expr) == COMPLEX_CST | |
969 | && integer_zerop (TREE_REALPART (expr)) | |
970 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
971 | } |
972 | ||
9ad265b0 RK |
973 | /* Return 1 if EXPR is the integer constant one or the corresponding |
974 | complex constant. */ | |
c6a1db6c RS |
975 | |
976 | int | |
46c5ad27 | 977 | integer_onep (tree expr) |
c6a1db6c | 978 | { |
d964285c | 979 | STRIP_NOPS (expr); |
c6a1db6c | 980 | |
9ad265b0 | 981 | return ((TREE_CODE (expr) == INTEGER_CST |
1ac876be | 982 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
983 | && TREE_INT_CST_LOW (expr) == 1 |
984 | && TREE_INT_CST_HIGH (expr) == 0) | |
985 | || (TREE_CODE (expr) == COMPLEX_CST | |
986 | && integer_onep (TREE_REALPART (expr)) | |
987 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
988 | } |
989 | ||
9ad265b0 RK |
990 | /* Return 1 if EXPR is an integer containing all 1's in as much precision as |
991 | it contains. Likewise for the corresponding complex constant. */ | |
c6a1db6c RS |
992 | |
993 | int | |
46c5ad27 | 994 | integer_all_onesp (tree expr) |
c6a1db6c | 995 | { |
b3694847 SS |
996 | int prec; |
997 | int uns; | |
c6a1db6c | 998 | |
d964285c | 999 | STRIP_NOPS (expr); |
c6a1db6c | 1000 | |
9ad265b0 RK |
1001 | if (TREE_CODE (expr) == COMPLEX_CST |
1002 | && integer_all_onesp (TREE_REALPART (expr)) | |
1003 | && integer_zerop (TREE_IMAGPART (expr))) | |
1004 | return 1; | |
1005 | ||
1ac876be RK |
1006 | else if (TREE_CODE (expr) != INTEGER_CST |
1007 | || TREE_CONSTANT_OVERFLOW (expr)) | |
c6a1db6c RS |
1008 | return 0; |
1009 | ||
8df83eae | 1010 | uns = TYPE_UNSIGNED (TREE_TYPE (expr)); |
c6a1db6c | 1011 | if (!uns) |
dc478a5d | 1012 | return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0 |
05bccae2 | 1013 | && TREE_INT_CST_HIGH (expr) == -1); |
c6a1db6c | 1014 | |
8980b5a3 RK |
1015 | /* Note that using TYPE_PRECISION here is wrong. We care about the |
1016 | actual bits, not the (arbitrary) range of the type. */ | |
1017 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr))); | |
37366632 | 1018 | if (prec >= HOST_BITS_PER_WIDE_INT) |
c6a1db6c | 1019 | { |
05bccae2 RK |
1020 | HOST_WIDE_INT high_value; |
1021 | int shift_amount; | |
c6a1db6c | 1022 | |
37366632 | 1023 | shift_amount = prec - HOST_BITS_PER_WIDE_INT; |
c6a1db6c | 1024 | |
1e128c5f GB |
1025 | /* Can not handle precisions greater than twice the host int size. */ |
1026 | gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT); | |
1027 | if (shift_amount == HOST_BITS_PER_WIDE_INT) | |
c6a1db6c RS |
1028 | /* Shifting by the host word size is undefined according to the ANSI |
1029 | standard, so we must handle this as a special case. */ | |
1030 | high_value = -1; | |
1031 | else | |
37366632 | 1032 | high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1; |
c6a1db6c | 1033 | |
dc478a5d | 1034 | return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0 |
05bccae2 | 1035 | && TREE_INT_CST_HIGH (expr) == high_value); |
c6a1db6c RS |
1036 | } |
1037 | else | |
05bccae2 | 1038 | return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1; |
c6a1db6c RS |
1039 | } |
1040 | ||
1041 | /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only | |
1042 | one bit on). */ | |
1043 | ||
1044 | int | |
46c5ad27 | 1045 | integer_pow2p (tree expr) |
c6a1db6c | 1046 | { |
5cb1f2fa | 1047 | int prec; |
37366632 | 1048 | HOST_WIDE_INT high, low; |
c6a1db6c | 1049 | |
d964285c | 1050 | STRIP_NOPS (expr); |
c6a1db6c | 1051 | |
9ad265b0 RK |
1052 | if (TREE_CODE (expr) == COMPLEX_CST |
1053 | && integer_pow2p (TREE_REALPART (expr)) | |
1054 | && integer_zerop (TREE_IMAGPART (expr))) | |
1055 | return 1; | |
1056 | ||
1ac876be | 1057 | if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr)) |
c6a1db6c RS |
1058 | return 0; |
1059 | ||
e5e809f4 | 1060 | prec = (POINTER_TYPE_P (TREE_TYPE (expr)) |
5cb1f2fa | 1061 | ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr))); |
c6a1db6c RS |
1062 | high = TREE_INT_CST_HIGH (expr); |
1063 | low = TREE_INT_CST_LOW (expr); | |
1064 | ||
5cb1f2fa RK |
1065 | /* First clear all bits that are beyond the type's precision in case |
1066 | we've been sign extended. */ | |
1067 | ||
1068 | if (prec == 2 * HOST_BITS_PER_WIDE_INT) | |
1069 | ; | |
1070 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
1071 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
1072 | else | |
1073 | { | |
1074 | high = 0; | |
1075 | if (prec < HOST_BITS_PER_WIDE_INT) | |
1076 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
1077 | } | |
1078 | ||
c6a1db6c RS |
1079 | if (high == 0 && low == 0) |
1080 | return 0; | |
1081 | ||
1082 | return ((high == 0 && (low & (low - 1)) == 0) | |
1083 | || (low == 0 && (high & (high - 1)) == 0)); | |
1084 | } | |
1085 | ||
4977bab6 ZW |
1086 | /* Return 1 if EXPR is an integer constant other than zero or a |
1087 | complex constant other than zero. */ | |
1088 | ||
1089 | int | |
46c5ad27 | 1090 | integer_nonzerop (tree expr) |
4977bab6 ZW |
1091 | { |
1092 | STRIP_NOPS (expr); | |
1093 | ||
1094 | return ((TREE_CODE (expr) == INTEGER_CST | |
1095 | && ! TREE_CONSTANT_OVERFLOW (expr) | |
1096 | && (TREE_INT_CST_LOW (expr) != 0 | |
1097 | || TREE_INT_CST_HIGH (expr) != 0)) | |
1098 | || (TREE_CODE (expr) == COMPLEX_CST | |
1099 | && (integer_nonzerop (TREE_REALPART (expr)) | |
1100 | || integer_nonzerop (TREE_IMAGPART (expr))))); | |
1101 | } | |
1102 | ||
5cb1f2fa RK |
1103 | /* Return the power of two represented by a tree node known to be a |
1104 | power of two. */ | |
1105 | ||
1106 | int | |
46c5ad27 | 1107 | tree_log2 (tree expr) |
5cb1f2fa RK |
1108 | { |
1109 | int prec; | |
1110 | HOST_WIDE_INT high, low; | |
1111 | ||
1112 | STRIP_NOPS (expr); | |
1113 | ||
1114 | if (TREE_CODE (expr) == COMPLEX_CST) | |
1115 | return tree_log2 (TREE_REALPART (expr)); | |
1116 | ||
e5e809f4 | 1117 | prec = (POINTER_TYPE_P (TREE_TYPE (expr)) |
5cb1f2fa RK |
1118 | ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr))); |
1119 | ||
1120 | high = TREE_INT_CST_HIGH (expr); | |
1121 | low = TREE_INT_CST_LOW (expr); | |
1122 | ||
1123 | /* First clear all bits that are beyond the type's precision in case | |
1124 | we've been sign extended. */ | |
1125 | ||
1126 | if (prec == 2 * HOST_BITS_PER_WIDE_INT) | |
1127 | ; | |
1128 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
1129 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
1130 | else | |
1131 | { | |
1132 | high = 0; | |
1133 | if (prec < HOST_BITS_PER_WIDE_INT) | |
1134 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
1135 | } | |
1136 | ||
1137 | return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high) | |
dc478a5d | 1138 | : exact_log2 (low)); |
5cb1f2fa RK |
1139 | } |
1140 | ||
05bccae2 RK |
1141 | /* Similar, but return the largest integer Y such that 2 ** Y is less |
1142 | than or equal to EXPR. */ | |
1143 | ||
1144 | int | |
46c5ad27 | 1145 | tree_floor_log2 (tree expr) |
05bccae2 RK |
1146 | { |
1147 | int prec; | |
1148 | HOST_WIDE_INT high, low; | |
1149 | ||
1150 | STRIP_NOPS (expr); | |
1151 | ||
1152 | if (TREE_CODE (expr) == COMPLEX_CST) | |
1153 | return tree_log2 (TREE_REALPART (expr)); | |
1154 | ||
1155 | prec = (POINTER_TYPE_P (TREE_TYPE (expr)) | |
1156 | ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr))); | |
1157 | ||
1158 | high = TREE_INT_CST_HIGH (expr); | |
1159 | low = TREE_INT_CST_LOW (expr); | |
1160 | ||
1161 | /* First clear all bits that are beyond the type's precision in case | |
1162 | we've been sign extended. Ignore if type's precision hasn't been set | |
1163 | since what we are doing is setting it. */ | |
1164 | ||
1165 | if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0) | |
1166 | ; | |
1167 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
1168 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
1169 | else | |
1170 | { | |
1171 | high = 0; | |
1172 | if (prec < HOST_BITS_PER_WIDE_INT) | |
1173 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
1174 | } | |
1175 | ||
1176 | return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high) | |
1177 | : floor_log2 (low)); | |
1178 | } | |
1179 | ||
c6a1db6c RS |
1180 | /* Return 1 if EXPR is the real constant zero. */ |
1181 | ||
1182 | int | |
46c5ad27 | 1183 | real_zerop (tree expr) |
c6a1db6c | 1184 | { |
d964285c | 1185 | STRIP_NOPS (expr); |
c6a1db6c | 1186 | |
9ad265b0 | 1187 | return ((TREE_CODE (expr) == REAL_CST |
1ac876be | 1188 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
1189 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)) |
1190 | || (TREE_CODE (expr) == COMPLEX_CST | |
1191 | && real_zerop (TREE_REALPART (expr)) | |
1192 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1193 | } |
1194 | ||
9ad265b0 | 1195 | /* Return 1 if EXPR is the real constant one in real or complex form. */ |
c6a1db6c RS |
1196 | |
1197 | int | |
46c5ad27 | 1198 | real_onep (tree expr) |
c6a1db6c | 1199 | { |
d964285c | 1200 | STRIP_NOPS (expr); |
c6a1db6c | 1201 | |
9ad265b0 | 1202 | return ((TREE_CODE (expr) == REAL_CST |
1ac876be | 1203 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
1204 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)) |
1205 | || (TREE_CODE (expr) == COMPLEX_CST | |
1206 | && real_onep (TREE_REALPART (expr)) | |
1207 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1208 | } |
1209 | ||
1210 | /* Return 1 if EXPR is the real constant two. */ | |
1211 | ||
1212 | int | |
46c5ad27 | 1213 | real_twop (tree expr) |
c6a1db6c | 1214 | { |
d964285c | 1215 | STRIP_NOPS (expr); |
c6a1db6c | 1216 | |
9ad265b0 | 1217 | return ((TREE_CODE (expr) == REAL_CST |
1ac876be | 1218 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
1219 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)) |
1220 | || (TREE_CODE (expr) == COMPLEX_CST | |
1221 | && real_twop (TREE_REALPART (expr)) | |
1222 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1223 | } |
1224 | ||
378393da RS |
1225 | /* Return 1 if EXPR is the real constant minus one. */ |
1226 | ||
1227 | int | |
46c5ad27 | 1228 | real_minus_onep (tree expr) |
378393da RS |
1229 | { |
1230 | STRIP_NOPS (expr); | |
1231 | ||
1232 | return ((TREE_CODE (expr) == REAL_CST | |
1233 | && ! TREE_CONSTANT_OVERFLOW (expr) | |
1234 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1)) | |
1235 | || (TREE_CODE (expr) == COMPLEX_CST | |
1236 | && real_minus_onep (TREE_REALPART (expr)) | |
1237 | && real_zerop (TREE_IMAGPART (expr)))); | |
1238 | } | |
1239 | ||
c6a1db6c | 1240 | /* Nonzero if EXP is a constant or a cast of a constant. */ |
dc478a5d | 1241 | |
c6a1db6c | 1242 | int |
46c5ad27 | 1243 | really_constant_p (tree exp) |
c6a1db6c | 1244 | { |
d964285c | 1245 | /* This is not quite the same as STRIP_NOPS. It does more. */ |
c6a1db6c RS |
1246 | while (TREE_CODE (exp) == NOP_EXPR |
1247 | || TREE_CODE (exp) == CONVERT_EXPR | |
1248 | || TREE_CODE (exp) == NON_LVALUE_EXPR) | |
1249 | exp = TREE_OPERAND (exp, 0); | |
1250 | return TREE_CONSTANT (exp); | |
1251 | } | |
1252 | \f | |
1253 | /* Return first list element whose TREE_VALUE is ELEM. | |
2a3c15b5 | 1254 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1255 | |
1256 | tree | |
46c5ad27 | 1257 | value_member (tree elem, tree list) |
c6a1db6c RS |
1258 | { |
1259 | while (list) | |
1260 | { | |
1261 | if (elem == TREE_VALUE (list)) | |
1262 | return list; | |
1263 | list = TREE_CHAIN (list); | |
1264 | } | |
1265 | return NULL_TREE; | |
1266 | } | |
1267 | ||
1268 | /* Return first list element whose TREE_PURPOSE is ELEM. | |
2a3c15b5 | 1269 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1270 | |
1271 | tree | |
46c5ad27 | 1272 | purpose_member (tree elem, tree list) |
c6a1db6c RS |
1273 | { |
1274 | while (list) | |
1275 | { | |
1276 | if (elem == TREE_PURPOSE (list)) | |
1277 | return list; | |
1278 | list = TREE_CHAIN (list); | |
c6a1db6c RS |
1279 | } |
1280 | return NULL_TREE; | |
1281 | } | |
1282 | ||
0f41302f | 1283 | /* Return nonzero if ELEM is part of the chain CHAIN. */ |
c6a1db6c RS |
1284 | |
1285 | int | |
46c5ad27 | 1286 | chain_member (tree elem, tree chain) |
c6a1db6c RS |
1287 | { |
1288 | while (chain) | |
1289 | { | |
1290 | if (elem == chain) | |
1291 | return 1; | |
1292 | chain = TREE_CHAIN (chain); | |
1293 | } | |
1294 | ||
1295 | return 0; | |
1296 | } | |
1297 | ||
1298 | /* Return the length of a chain of nodes chained through TREE_CHAIN. | |
1299 | We expect a null pointer to mark the end of the chain. | |
1300 | This is the Lisp primitive `length'. */ | |
1301 | ||
1302 | int | |
46c5ad27 | 1303 | list_length (tree t) |
c6a1db6c | 1304 | { |
f75fbaf7 ZW |
1305 | tree p = t; |
1306 | #ifdef ENABLE_TREE_CHECKING | |
1307 | tree q = t; | |
1308 | #endif | |
b3694847 | 1309 | int len = 0; |
c6a1db6c | 1310 | |
f75fbaf7 ZW |
1311 | while (p) |
1312 | { | |
1313 | p = TREE_CHAIN (p); | |
1314 | #ifdef ENABLE_TREE_CHECKING | |
1315 | if (len % 2) | |
1316 | q = TREE_CHAIN (q); | |
1e128c5f | 1317 | gcc_assert (p != q); |
f75fbaf7 ZW |
1318 | #endif |
1319 | len++; | |
1320 | } | |
c6a1db6c RS |
1321 | |
1322 | return len; | |
1323 | } | |
1324 | ||
c3b247b4 JM |
1325 | /* Returns the number of FIELD_DECLs in TYPE. */ |
1326 | ||
1327 | int | |
46c5ad27 | 1328 | fields_length (tree type) |
c3b247b4 JM |
1329 | { |
1330 | tree t = TYPE_FIELDS (type); | |
1331 | int count = 0; | |
1332 | ||
1333 | for (; t; t = TREE_CHAIN (t)) | |
1334 | if (TREE_CODE (t) == FIELD_DECL) | |
1335 | ++count; | |
1336 | ||
1337 | return count; | |
1338 | } | |
1339 | ||
c6a1db6c RS |
1340 | /* Concatenate two chains of nodes (chained through TREE_CHAIN) |
1341 | by modifying the last node in chain 1 to point to chain 2. | |
1342 | This is the Lisp primitive `nconc'. */ | |
1343 | ||
1344 | tree | |
46c5ad27 | 1345 | chainon (tree op1, tree op2) |
c6a1db6c | 1346 | { |
66ea6f4c | 1347 | tree t1; |
c6a1db6c | 1348 | |
66ea6f4c RH |
1349 | if (!op1) |
1350 | return op2; | |
1351 | if (!op2) | |
1352 | return op1; | |
1353 | ||
1354 | for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1)) | |
1355 | continue; | |
1356 | TREE_CHAIN (t1) = op2; | |
1810c3fa | 1357 | |
f4524c9e | 1358 | #ifdef ENABLE_TREE_CHECKING |
66ea6f4c RH |
1359 | { |
1360 | tree t2; | |
1361 | for (t2 = op2; t2; t2 = TREE_CHAIN (t2)) | |
1e128c5f | 1362 | gcc_assert (t2 != t1); |
66ea6f4c | 1363 | } |
0f4668ef | 1364 | #endif |
66ea6f4c RH |
1365 | |
1366 | return op1; | |
c6a1db6c RS |
1367 | } |
1368 | ||
1369 | /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */ | |
1370 | ||
1371 | tree | |
46c5ad27 | 1372 | tree_last (tree chain) |
c6a1db6c | 1373 | { |
b3694847 | 1374 | tree next; |
c6a1db6c | 1375 | if (chain) |
5e9defae | 1376 | while ((next = TREE_CHAIN (chain))) |
c6a1db6c RS |
1377 | chain = next; |
1378 | return chain; | |
1379 | } | |
1380 | ||
1381 | /* Reverse the order of elements in the chain T, | |
1382 | and return the new head of the chain (old last element). */ | |
1383 | ||
1384 | tree | |
46c5ad27 | 1385 | nreverse (tree t) |
c6a1db6c | 1386 | { |
b3694847 | 1387 | tree prev = 0, decl, next; |
c6a1db6c RS |
1388 | for (decl = t; decl; decl = next) |
1389 | { | |
1390 | next = TREE_CHAIN (decl); | |
1391 | TREE_CHAIN (decl) = prev; | |
1392 | prev = decl; | |
1393 | } | |
1394 | return prev; | |
1395 | } | |
c6a1db6c RS |
1396 | \f |
1397 | /* Return a newly created TREE_LIST node whose | |
1398 | purpose and value fields are PARM and VALUE. */ | |
1399 | ||
1400 | tree | |
b9dcdee4 | 1401 | build_tree_list_stat (tree parm, tree value MEM_STAT_DECL) |
c6a1db6c | 1402 | { |
b9dcdee4 | 1403 | tree t = make_node_stat (TREE_LIST PASS_MEM_STAT); |
c6a1db6c RS |
1404 | TREE_PURPOSE (t) = parm; |
1405 | TREE_VALUE (t) = value; | |
1406 | return t; | |
1407 | } | |
1408 | ||
c6a1db6c | 1409 | /* Return a newly created TREE_LIST node whose |
411e2759 | 1410 | purpose and value fields are PURPOSE and VALUE |
c6a1db6c RS |
1411 | and whose TREE_CHAIN is CHAIN. */ |
1412 | ||
1413 | tree | |
b9dcdee4 | 1414 | tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL) |
c6a1db6c | 1415 | { |
b3694847 | 1416 | tree node; |
a3770a81 | 1417 | |
b9dcdee4 | 1418 | node = ggc_alloc_zone_stat (sizeof (struct tree_list), |
08cee789 | 1419 | &tree_zone PASS_MEM_STAT); |
f8a83ee3 ZW |
1420 | |
1421 | memset (node, 0, sizeof (struct tree_common)); | |
a3770a81 | 1422 | |
c6a1db6c | 1423 | #ifdef GATHER_STATISTICS |
ad41cc2a RK |
1424 | tree_node_counts[(int) x_kind]++; |
1425 | tree_node_sizes[(int) x_kind] += sizeof (struct tree_list); | |
c6a1db6c RS |
1426 | #endif |
1427 | ||
c6a1db6c | 1428 | TREE_SET_CODE (node, TREE_LIST); |
c6a1db6c RS |
1429 | TREE_CHAIN (node) = chain; |
1430 | TREE_PURPOSE (node) = purpose; | |
1431 | TREE_VALUE (node) = value; | |
1432 | return node; | |
1433 | } | |
1434 | ||
c6a1db6c RS |
1435 | \f |
1436 | /* Return the size nominally occupied by an object of type TYPE | |
1437 | when it resides in memory. The value is measured in units of bytes, | |
1438 | and its data type is that normally used for type sizes | |
1439 | (which is the first type created by make_signed_type or | |
1440 | make_unsigned_type). */ | |
1441 | ||
1442 | tree | |
46c5ad27 | 1443 | size_in_bytes (tree type) |
c6a1db6c | 1444 | { |
cdc5a032 RS |
1445 | tree t; |
1446 | ||
c6a1db6c RS |
1447 | if (type == error_mark_node) |
1448 | return integer_zero_node; | |
ead17059 | 1449 | |
c6a1db6c | 1450 | type = TYPE_MAIN_VARIANT (type); |
ead17059 | 1451 | t = TYPE_SIZE_UNIT (type); |
d4b60170 | 1452 | |
ead17059 | 1453 | if (t == 0) |
c6a1db6c | 1454 | { |
ae2bcd98 | 1455 | lang_hooks.types.incomplete_type_error (NULL_TREE, type); |
dc397323 | 1456 | return size_zero_node; |
c6a1db6c | 1457 | } |
d4b60170 | 1458 | |
4d7d0403 | 1459 | if (TREE_CODE (t) == INTEGER_CST) |
ca7a3bd7 | 1460 | t = force_fit_type (t, 0, false, false); |
ead17059 | 1461 | |
cdc5a032 | 1462 | return t; |
c6a1db6c RS |
1463 | } |
1464 | ||
e5e809f4 JL |
1465 | /* Return the size of TYPE (in bytes) as a wide integer |
1466 | or return -1 if the size can vary or is larger than an integer. */ | |
c6a1db6c | 1467 | |
e5e809f4 | 1468 | HOST_WIDE_INT |
46c5ad27 | 1469 | int_size_in_bytes (tree type) |
c6a1db6c | 1470 | { |
e5e809f4 JL |
1471 | tree t; |
1472 | ||
c6a1db6c RS |
1473 | if (type == error_mark_node) |
1474 | return 0; | |
e5e809f4 | 1475 | |
c6a1db6c | 1476 | type = TYPE_MAIN_VARIANT (type); |
ead17059 RH |
1477 | t = TYPE_SIZE_UNIT (type); |
1478 | if (t == 0 | |
1479 | || TREE_CODE (t) != INTEGER_CST | |
d4b60170 | 1480 | || TREE_OVERFLOW (t) |
665f2503 RK |
1481 | || TREE_INT_CST_HIGH (t) != 0 |
1482 | /* If the result would appear negative, it's too big to represent. */ | |
1483 | || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0) | |
c6a1db6c | 1484 | return -1; |
e5e809f4 JL |
1485 | |
1486 | return TREE_INT_CST_LOW (t); | |
c6a1db6c | 1487 | } |
665f2503 RK |
1488 | \f |
1489 | /* Return the bit position of FIELD, in bits from the start of the record. | |
1490 | This is a tree of type bitsizetype. */ | |
1491 | ||
1492 | tree | |
46c5ad27 | 1493 | bit_position (tree field) |
665f2503 | 1494 | { |
f2704b9f RK |
1495 | return bit_from_pos (DECL_FIELD_OFFSET (field), |
1496 | DECL_FIELD_BIT_OFFSET (field)); | |
665f2503 | 1497 | } |
729a2125 | 1498 | |
665f2503 RK |
1499 | /* Likewise, but return as an integer. Abort if it cannot be represented |
1500 | in that way (since it could be a signed value, we don't have the option | |
1501 | of returning -1 like int_size_in_byte can. */ | |
1502 | ||
1503 | HOST_WIDE_INT | |
46c5ad27 | 1504 | int_bit_position (tree field) |
665f2503 RK |
1505 | { |
1506 | return tree_low_cst (bit_position (field), 0); | |
1507 | } | |
1508 | \f | |
770ae6cc RK |
1509 | /* Return the byte position of FIELD, in bytes from the start of the record. |
1510 | This is a tree of type sizetype. */ | |
1511 | ||
1512 | tree | |
46c5ad27 | 1513 | byte_position (tree field) |
770ae6cc | 1514 | { |
f2704b9f RK |
1515 | return byte_from_pos (DECL_FIELD_OFFSET (field), |
1516 | DECL_FIELD_BIT_OFFSET (field)); | |
770ae6cc RK |
1517 | } |
1518 | ||
1519 | /* Likewise, but return as an integer. Abort if it cannot be represented | |
1520 | in that way (since it could be a signed value, we don't have the option | |
1521 | of returning -1 like int_size_in_byte can. */ | |
1522 | ||
1523 | HOST_WIDE_INT | |
46c5ad27 | 1524 | int_byte_position (tree field) |
770ae6cc RK |
1525 | { |
1526 | return tree_low_cst (byte_position (field), 0); | |
1527 | } | |
1528 | \f | |
665f2503 | 1529 | /* Return the strictest alignment, in bits, that T is known to have. */ |
729a2125 RK |
1530 | |
1531 | unsigned int | |
46c5ad27 | 1532 | expr_align (tree t) |
729a2125 RK |
1533 | { |
1534 | unsigned int align0, align1; | |
1535 | ||
1536 | switch (TREE_CODE (t)) | |
1537 | { | |
1538 | case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR: | |
1539 | /* If we have conversions, we know that the alignment of the | |
1540 | object must meet each of the alignments of the types. */ | |
1541 | align0 = expr_align (TREE_OPERAND (t, 0)); | |
1542 | align1 = TYPE_ALIGN (TREE_TYPE (t)); | |
1543 | return MAX (align0, align1); | |
1544 | ||
1545 | case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR: | |
1546 | case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR: | |
9f63daea | 1547 | case CLEANUP_POINT_EXPR: |
729a2125 RK |
1548 | /* These don't change the alignment of an object. */ |
1549 | return expr_align (TREE_OPERAND (t, 0)); | |
1550 | ||
1551 | case COND_EXPR: | |
1552 | /* The best we can do is say that the alignment is the least aligned | |
1553 | of the two arms. */ | |
1554 | align0 = expr_align (TREE_OPERAND (t, 1)); | |
1555 | align1 = expr_align (TREE_OPERAND (t, 2)); | |
1556 | return MIN (align0, align1); | |
1557 | ||
06ceef4e | 1558 | case LABEL_DECL: case CONST_DECL: |
729a2125 RK |
1559 | case VAR_DECL: case PARM_DECL: case RESULT_DECL: |
1560 | if (DECL_ALIGN (t) != 0) | |
1561 | return DECL_ALIGN (t); | |
1562 | break; | |
1563 | ||
06ceef4e RK |
1564 | case FUNCTION_DECL: |
1565 | return FUNCTION_BOUNDARY; | |
1566 | ||
729a2125 RK |
1567 | default: |
1568 | break; | |
1569 | } | |
1570 | ||
1571 | /* Otherwise take the alignment from that of the type. */ | |
1572 | return TYPE_ALIGN (TREE_TYPE (t)); | |
1573 | } | |
c0560b8b RK |
1574 | \f |
1575 | /* Return, as a tree node, the number of elements for TYPE (which is an | |
d26f8097 | 1576 | ARRAY_TYPE) minus one. This counts only elements of the top array. */ |
c6a1db6c RS |
1577 | |
1578 | tree | |
46c5ad27 | 1579 | array_type_nelts (tree type) |
c6a1db6c | 1580 | { |
7671d67b BK |
1581 | tree index_type, min, max; |
1582 | ||
1583 | /* If they did it with unspecified bounds, then we should have already | |
1584 | given an error about it before we got here. */ | |
1585 | if (! TYPE_DOMAIN (type)) | |
1586 | return error_mark_node; | |
1587 | ||
1588 | index_type = TYPE_DOMAIN (type); | |
1589 | min = TYPE_MIN_VALUE (index_type); | |
1590 | max = TYPE_MAX_VALUE (index_type); | |
83b853c9 | 1591 | |
83b853c9 JM |
1592 | return (integer_zerop (min) |
1593 | ? max | |
59ce6d6b | 1594 | : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min))); |
c6a1db6c RS |
1595 | } |
1596 | \f | |
dc700f49 RH |
1597 | /* If arg is static -- a reference to an object in static storage -- then |
1598 | return the object. This is not the same as the C meaning of `static'. | |
1599 | If arg isn't static, return NULL. */ | |
c6a1db6c | 1600 | |
525c6bf5 | 1601 | tree |
46c5ad27 | 1602 | staticp (tree arg) |
c6a1db6c RS |
1603 | { |
1604 | switch (TREE_CODE (arg)) | |
1605 | { | |
c6a1db6c | 1606 | case FUNCTION_DECL: |
269b7526 AP |
1607 | /* Nested functions are static, even though taking their address will |
1608 | involve a trampoline as we unnest the nested function and create | |
1609 | the trampoline on the tree level. */ | |
1610 | return arg; | |
27da1b4d | 1611 | |
86270344 | 1612 | case VAR_DECL: |
3d78f2e9 RH |
1613 | return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg)) |
1614 | && ! DECL_THREAD_LOCAL (arg) | |
525c6bf5 RH |
1615 | && ! DECL_NON_ADDR_CONST_P (arg) |
1616 | ? arg : NULL); | |
c6a1db6c | 1617 | |
943db347 AP |
1618 | case CONST_DECL: |
1619 | return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg)) | |
1620 | ? arg : NULL); | |
1621 | ||
492c86a4 | 1622 | case CONSTRUCTOR: |
525c6bf5 | 1623 | return TREE_STATIC (arg) ? arg : NULL; |
492c86a4 | 1624 | |
1c12c179 | 1625 | case LABEL_DECL: |
c6a1db6c | 1626 | case STRING_CST: |
525c6bf5 | 1627 | return arg; |
c6a1db6c | 1628 | |
6de9cd9a | 1629 | case COMPONENT_REF: |
9f63daea | 1630 | /* If the thing being referenced is not a field, then it is |
6de9cd9a DN |
1631 | something language specific. */ |
1632 | if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL) | |
1633 | return (*lang_hooks.staticp) (arg); | |
1634 | ||
f7fa6ef9 RK |
1635 | /* If we are referencing a bitfield, we can't evaluate an |
1636 | ADDR_EXPR at compile time and so it isn't a constant. */ | |
6de9cd9a | 1637 | if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1))) |
525c6bf5 | 1638 | return NULL; |
6de9cd9a DN |
1639 | |
1640 | return staticp (TREE_OPERAND (arg, 0)); | |
f7fa6ef9 | 1641 | |
c6a1db6c | 1642 | case BIT_FIELD_REF: |
525c6bf5 | 1643 | return NULL; |
c6a1db6c | 1644 | |
7ccf35ed DN |
1645 | case MISALIGNED_INDIRECT_REF: |
1646 | case ALIGN_INDIRECT_REF: | |
c6a1db6c | 1647 | case INDIRECT_REF: |
525c6bf5 | 1648 | return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL; |
c6a1db6c RS |
1649 | |
1650 | case ARRAY_REF: | |
b4e3fabb | 1651 | case ARRAY_RANGE_REF: |
c6a1db6c RS |
1652 | if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST |
1653 | && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST) | |
1654 | return staticp (TREE_OPERAND (arg, 0)); | |
6de9cd9a | 1655 | else |
ea06b166 | 1656 | return false; |
c6a1db6c | 1657 | |
e9a25f70 | 1658 | default: |
d062a680 JM |
1659 | if ((unsigned int) TREE_CODE (arg) |
1660 | >= (unsigned int) LAST_AND_UNUSED_TREE_CODE) | |
ae2bcd98 | 1661 | return lang_hooks.staticp (arg); |
d062a680 | 1662 | else |
525c6bf5 | 1663 | return NULL; |
e9a25f70 | 1664 | } |
c6a1db6c RS |
1665 | } |
1666 | \f | |
3aa77500 RS |
1667 | /* Wrap a SAVE_EXPR around EXPR, if appropriate. |
1668 | Do this to any expression which may be used in more than one place, | |
1669 | but must be evaluated only once. | |
1670 | ||
1671 | Normally, expand_expr would reevaluate the expression each time. | |
1672 | Calling save_expr produces something that is evaluated and recorded | |
1673 | the first time expand_expr is called on it. Subsequent calls to | |
1674 | expand_expr just reuse the recorded value. | |
1675 | ||
1676 | The call to expand_expr that generates code that actually computes | |
1677 | the value is the first call *at compile time*. Subsequent calls | |
1678 | *at compile time* generate code to use the saved value. | |
1679 | This produces correct result provided that *at run time* control | |
1680 | always flows through the insns made by the first expand_expr | |
1681 | before reaching the other places where the save_expr was evaluated. | |
1682 | You, the caller of save_expr, must make sure this is so. | |
1683 | ||
1684 | Constants, and certain read-only nodes, are returned with no | |
1685 | SAVE_EXPR because that is safe. Expressions containing placeholders | |
c5af9901 RK |
1686 | are not touched; see tree.def for an explanation of what these |
1687 | are used for. */ | |
c6a1db6c RS |
1688 | |
1689 | tree | |
46c5ad27 | 1690 | save_expr (tree expr) |
c6a1db6c | 1691 | { |
7a6cdb44 | 1692 | tree t = fold (expr); |
84d8756d RK |
1693 | tree inner; |
1694 | ||
c6a1db6c RS |
1695 | /* If the tree evaluates to a constant, then we don't want to hide that |
1696 | fact (i.e. this allows further folding, and direct checks for constants). | |
af929c62 | 1697 | However, a read-only object that has side effects cannot be bypassed. |
dc478a5d | 1698 | Since it is no problem to reevaluate literals, we just return the |
0f41302f | 1699 | literal node. */ |
84d8756d | 1700 | inner = skip_simple_arithmetic (t); |
6de9cd9a DN |
1701 | |
1702 | if (TREE_INVARIANT (inner) | |
ac79cd5a | 1703 | || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner)) |
0c685f12 NS |
1704 | || TREE_CODE (inner) == SAVE_EXPR |
1705 | || TREE_CODE (inner) == ERROR_MARK) | |
c6a1db6c RS |
1706 | return t; |
1707 | ||
a9ecacf6 | 1708 | /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since |
dec20b4b RK |
1709 | it means that the size or offset of some field of an object depends on |
1710 | the value within another field. | |
1711 | ||
1712 | Note that it must not be the case that T contains both a PLACEHOLDER_EXPR | |
1713 | and some variable since it would then need to be both evaluated once and | |
1714 | evaluated more than once. Front-ends must assure this case cannot | |
1715 | happen by surrounding any such subexpressions in their own SAVE_EXPR | |
1716 | and forcing evaluation at the proper time. */ | |
a9ecacf6 | 1717 | if (contains_placeholder_p (inner)) |
dec20b4b RK |
1718 | return t; |
1719 | ||
82c82743 | 1720 | t = build1 (SAVE_EXPR, TREE_TYPE (expr), t); |
c6a1db6c RS |
1721 | |
1722 | /* This expression might be placed ahead of a jump to ensure that the | |
1723 | value was computed on both sides of the jump. So make sure it isn't | |
1724 | eliminated as dead. */ | |
1725 | TREE_SIDE_EFFECTS (t) = 1; | |
6de9cd9a | 1726 | TREE_INVARIANT (t) = 1; |
c6a1db6c RS |
1727 | return t; |
1728 | } | |
679163cf | 1729 | |
a9ecacf6 OH |
1730 | /* Look inside EXPR and into any simple arithmetic operations. Return |
1731 | the innermost non-arithmetic node. */ | |
1732 | ||
1733 | tree | |
46c5ad27 | 1734 | skip_simple_arithmetic (tree expr) |
a9ecacf6 OH |
1735 | { |
1736 | tree inner; | |
46c5ad27 | 1737 | |
a9ecacf6 OH |
1738 | /* We don't care about whether this can be used as an lvalue in this |
1739 | context. */ | |
1740 | while (TREE_CODE (expr) == NON_LVALUE_EXPR) | |
1741 | expr = TREE_OPERAND (expr, 0); | |
1742 | ||
1743 | /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and | |
1744 | a constant, it will be more efficient to not make another SAVE_EXPR since | |
1745 | it will allow better simplification and GCSE will be able to merge the | |
1746 | computations if they actually occur. */ | |
1747 | inner = expr; | |
1748 | while (1) | |
1749 | { | |
6615c446 | 1750 | if (UNARY_CLASS_P (inner)) |
a9ecacf6 | 1751 | inner = TREE_OPERAND (inner, 0); |
6615c446 | 1752 | else if (BINARY_CLASS_P (inner)) |
a9ecacf6 | 1753 | { |
6de9cd9a | 1754 | if (TREE_INVARIANT (TREE_OPERAND (inner, 1))) |
a9ecacf6 | 1755 | inner = TREE_OPERAND (inner, 0); |
6de9cd9a | 1756 | else if (TREE_INVARIANT (TREE_OPERAND (inner, 0))) |
a9ecacf6 OH |
1757 | inner = TREE_OPERAND (inner, 1); |
1758 | else | |
1759 | break; | |
1760 | } | |
1761 | else | |
1762 | break; | |
1763 | } | |
1764 | ||
1765 | return inner; | |
1766 | } | |
1767 | ||
e2500fed GK |
1768 | /* Return which tree structure is used by T. */ |
1769 | ||
1770 | enum tree_node_structure_enum | |
46c5ad27 | 1771 | tree_node_structure (tree t) |
e2500fed GK |
1772 | { |
1773 | enum tree_code code = TREE_CODE (t); | |
46c5ad27 | 1774 | |
e2500fed GK |
1775 | switch (TREE_CODE_CLASS (code)) |
1776 | { | |
6615c446 JO |
1777 | case tcc_declaration: |
1778 | return TS_DECL; | |
1779 | case tcc_type: | |
1780 | return TS_TYPE; | |
1781 | case tcc_reference: | |
1782 | case tcc_comparison: | |
1783 | case tcc_unary: | |
1784 | case tcc_binary: | |
1785 | case tcc_expression: | |
1786 | case tcc_statement: | |
e2500fed | 1787 | return TS_EXP; |
6615c446 | 1788 | default: /* tcc_constant and tcc_exceptional */ |
e2500fed GK |
1789 | break; |
1790 | } | |
1791 | switch (code) | |
1792 | { | |
6615c446 | 1793 | /* tcc_constant cases. */ |
e2500fed GK |
1794 | case INTEGER_CST: return TS_INT_CST; |
1795 | case REAL_CST: return TS_REAL_CST; | |
1796 | case COMPLEX_CST: return TS_COMPLEX; | |
1797 | case VECTOR_CST: return TS_VECTOR; | |
1798 | case STRING_CST: return TS_STRING; | |
6615c446 | 1799 | /* tcc_exceptional cases. */ |
e2500fed GK |
1800 | case ERROR_MARK: return TS_COMMON; |
1801 | case IDENTIFIER_NODE: return TS_IDENTIFIER; | |
1802 | case TREE_LIST: return TS_LIST; | |
1803 | case TREE_VEC: return TS_VEC; | |
6de9cd9a | 1804 | case PHI_NODE: return TS_PHI_NODE; |
6de9cd9a | 1805 | case SSA_NAME: return TS_SSA_NAME; |
e2500fed | 1806 | case PLACEHOLDER_EXPR: return TS_COMMON; |
6de9cd9a | 1807 | case STATEMENT_LIST: return TS_STATEMENT_LIST; |
90afe2c9 | 1808 | case BLOCK: return TS_BLOCK; |
95b4aca6 | 1809 | case TREE_BINFO: return TS_BINFO; |
33c94679 | 1810 | case VALUE_HANDLE: return TS_VALUE_HANDLE; |
e2500fed GK |
1811 | |
1812 | default: | |
1e128c5f | 1813 | gcc_unreachable (); |
e2500fed GK |
1814 | } |
1815 | } | |
dec20b4b RK |
1816 | \f |
1817 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size | |
3910a7cb | 1818 | or offset that depends on a field within a record. */ |
dec20b4b | 1819 | |
7a6cdb44 | 1820 | bool |
46c5ad27 | 1821 | contains_placeholder_p (tree exp) |
dec20b4b | 1822 | { |
b3694847 | 1823 | enum tree_code code; |
dec20b4b | 1824 | |
8f17b5c5 MM |
1825 | if (!exp) |
1826 | return 0; | |
1827 | ||
8f17b5c5 | 1828 | code = TREE_CODE (exp); |
6fce44af | 1829 | if (code == PLACEHOLDER_EXPR) |
cc3c7c13 | 1830 | return 1; |
67c8d7de | 1831 | |
dec20b4b RK |
1832 | switch (TREE_CODE_CLASS (code)) |
1833 | { | |
6615c446 | 1834 | case tcc_reference: |
cc3c7c13 RK |
1835 | /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit |
1836 | position computations since they will be converted into a | |
1837 | WITH_RECORD_EXPR involving the reference, which will assume | |
1838 | here will be valid. */ | |
7a6cdb44 | 1839 | return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)); |
dec20b4b | 1840 | |
6615c446 | 1841 | case tcc_exceptional: |
e9a25f70 | 1842 | if (code == TREE_LIST) |
7a6cdb44 RK |
1843 | return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp)) |
1844 | || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp))); | |
e9a25f70 | 1845 | break; |
dc478a5d | 1846 | |
6615c446 JO |
1847 | case tcc_unary: |
1848 | case tcc_binary: | |
1849 | case tcc_comparison: | |
1850 | case tcc_expression: | |
3910a7cb RK |
1851 | switch (code) |
1852 | { | |
1853 | case COMPOUND_EXPR: | |
dc478a5d | 1854 | /* Ignoring the first operand isn't quite right, but works best. */ |
7a6cdb44 | 1855 | return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)); |
3910a7cb | 1856 | |
3910a7cb | 1857 | case COND_EXPR: |
7a6cdb44 RK |
1858 | return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)) |
1859 | || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)) | |
1860 | || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2))); | |
3910a7cb | 1861 | |
e9a25f70 JL |
1862 | default: |
1863 | break; | |
3910a7cb RK |
1864 | } |
1865 | ||
54e4aedb | 1866 | switch (TREE_CODE_LENGTH (code)) |
dec20b4b RK |
1867 | { |
1868 | case 1: | |
7a6cdb44 | 1869 | return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)); |
dec20b4b | 1870 | case 2: |
7a6cdb44 RK |
1871 | return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0)) |
1872 | || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))); | |
e9a25f70 JL |
1873 | default: |
1874 | return 0; | |
dec20b4b | 1875 | } |
dec20b4b | 1876 | |
e9a25f70 JL |
1877 | default: |
1878 | return 0; | |
1879 | } | |
1160f9ec | 1880 | return 0; |
dec20b4b | 1881 | } |
b7f6588d | 1882 | |
a5bfe141 RH |
1883 | /* Return true if any part of the computation of TYPE involves a |
1884 | PLACEHOLDER_EXPR. This includes size, bounds, qualifiers | |
1885 | (for QUAL_UNION_TYPE) and field positions. */ | |
7a6cdb44 | 1886 | |
a5bfe141 RH |
1887 | static bool |
1888 | type_contains_placeholder_1 (tree type) | |
7a6cdb44 RK |
1889 | { |
1890 | /* If the size contains a placeholder or the parent type (component type in | |
1891 | the case of arrays) type involves a placeholder, this type does. */ | |
1892 | if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type)) | |
1893 | || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type)) | |
1894 | || (TREE_TYPE (type) != 0 | |
1895 | && type_contains_placeholder_p (TREE_TYPE (type)))) | |
a5bfe141 | 1896 | return true; |
7a6cdb44 RK |
1897 | |
1898 | /* Now do type-specific checks. Note that the last part of the check above | |
1899 | greatly limits what we have to do below. */ | |
1900 | switch (TREE_CODE (type)) | |
1901 | { | |
1902 | case VOID_TYPE: | |
1903 | case COMPLEX_TYPE: | |
7a6cdb44 RK |
1904 | case ENUMERAL_TYPE: |
1905 | case BOOLEAN_TYPE: | |
1906 | case CHAR_TYPE: | |
1907 | case POINTER_TYPE: | |
1908 | case OFFSET_TYPE: | |
1909 | case REFERENCE_TYPE: | |
1910 | case METHOD_TYPE: | |
1911 | case FILE_TYPE: | |
1912 | case FUNCTION_TYPE: | |
a65735cd | 1913 | case VECTOR_TYPE: |
a5bfe141 | 1914 | return false; |
7a6cdb44 RK |
1915 | |
1916 | case INTEGER_TYPE: | |
1917 | case REAL_TYPE: | |
1918 | /* Here we just check the bounds. */ | |
1919 | return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type)) | |
1920 | || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type))); | |
1921 | ||
1922 | case ARRAY_TYPE: | |
7a6cdb44 RK |
1923 | /* We're already checked the component type (TREE_TYPE), so just check |
1924 | the index type. */ | |
1925 | return type_contains_placeholder_p (TYPE_DOMAIN (type)); | |
1926 | ||
1927 | case RECORD_TYPE: | |
1928 | case UNION_TYPE: | |
1929 | case QUAL_UNION_TYPE: | |
1930 | { | |
7a6cdb44 | 1931 | tree field; |
7a6cdb44 RK |
1932 | |
1933 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
1934 | if (TREE_CODE (field) == FIELD_DECL | |
1935 | && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field)) | |
1936 | || (TREE_CODE (type) == QUAL_UNION_TYPE | |
1937 | && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field))) | |
1938 | || type_contains_placeholder_p (TREE_TYPE (field)))) | |
a5bfe141 RH |
1939 | return true; |
1940 | ||
1941 | return false; | |
7a6cdb44 RK |
1942 | } |
1943 | ||
1944 | default: | |
1e128c5f | 1945 | gcc_unreachable (); |
7a6cdb44 RK |
1946 | } |
1947 | } | |
a5bfe141 RH |
1948 | |
1949 | bool | |
1950 | type_contains_placeholder_p (tree type) | |
1951 | { | |
1952 | bool result; | |
1953 | ||
1954 | /* If the contains_placeholder_bits field has been initialized, | |
1955 | then we know the answer. */ | |
1956 | if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) > 0) | |
1957 | return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) - 1; | |
1958 | ||
1959 | /* Indicate that we've seen this type node, and the answer is false. | |
1960 | This is what we want to return if we run into recursion via fields. */ | |
1961 | TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = 1; | |
1962 | ||
1963 | /* Compute the real value. */ | |
1964 | result = type_contains_placeholder_1 (type); | |
1965 | ||
1966 | /* Store the real value. */ | |
1967 | TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type) = result + 1; | |
1968 | ||
1969 | return result; | |
1970 | } | |
dec20b4b RK |
1971 | \f |
1972 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
1973 | return a tree with all occurrences of references to F in a | |
1974 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
e9a25f70 JL |
1975 | contains only arithmetic expressions or a CALL_EXPR with a |
1976 | PLACEHOLDER_EXPR occurring only in its arglist. */ | |
dec20b4b RK |
1977 | |
1978 | tree | |
46c5ad27 | 1979 | substitute_in_expr (tree exp, tree f, tree r) |
dec20b4b RK |
1980 | { |
1981 | enum tree_code code = TREE_CODE (exp); | |
9b594acf | 1982 | tree op0, op1, op2; |
e9a25f70 | 1983 | tree new; |
dec20b4b RK |
1984 | tree inner; |
1985 | ||
9d2a492d RK |
1986 | /* We handle TREE_LIST and COMPONENT_REF separately. */ |
1987 | if (code == TREE_LIST) | |
dec20b4b | 1988 | { |
6fce44af RK |
1989 | op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r); |
1990 | op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r); | |
9d2a492d | 1991 | if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp)) |
dec20b4b | 1992 | return exp; |
e9a25f70 | 1993 | |
9d2a492d RK |
1994 | return tree_cons (TREE_PURPOSE (exp), op1, op0); |
1995 | } | |
1996 | else if (code == COMPONENT_REF) | |
1997 | { | |
1998 | /* If this expression is getting a value from a PLACEHOLDER_EXPR | |
1999 | and it is the right field, replace it with R. */ | |
2000 | for (inner = TREE_OPERAND (exp, 0); | |
6615c446 | 2001 | REFERENCE_CLASS_P (inner); |
9d2a492d RK |
2002 | inner = TREE_OPERAND (inner, 0)) |
2003 | ; | |
2004 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR | |
2005 | && TREE_OPERAND (exp, 1) == f) | |
2006 | return r; | |
2007 | ||
3244e67d | 2008 | /* If this expression hasn't been completed let, leave it alone. */ |
9d2a492d RK |
2009 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0) |
2010 | return exp; | |
2011 | ||
6fce44af | 2012 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
9d2a492d RK |
2013 | if (op0 == TREE_OPERAND (exp, 0)) |
2014 | return exp; | |
2015 | ||
3244e67d RS |
2016 | new = fold (build3 (COMPONENT_REF, TREE_TYPE (exp), |
2017 | op0, TREE_OPERAND (exp, 1), NULL_TREE)); | |
9d2a492d RK |
2018 | } |
2019 | else | |
2020 | switch (TREE_CODE_CLASS (code)) | |
2021 | { | |
6615c446 JO |
2022 | case tcc_constant: |
2023 | case tcc_declaration: | |
9d2a492d | 2024 | return exp; |
dec20b4b | 2025 | |
6615c446 JO |
2026 | case tcc_exceptional: |
2027 | case tcc_unary: | |
2028 | case tcc_binary: | |
2029 | case tcc_comparison: | |
2030 | case tcc_expression: | |
2031 | case tcc_reference: | |
54e4aedb | 2032 | switch (TREE_CODE_LENGTH (code)) |
9d2a492d RK |
2033 | { |
2034 | case 0: | |
9b594acf | 2035 | return exp; |
dc478a5d | 2036 | |
9d2a492d | 2037 | case 1: |
6fce44af | 2038 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
9d2a492d RK |
2039 | if (op0 == TREE_OPERAND (exp, 0)) |
2040 | return exp; | |
235783d1 | 2041 | |
9d2a492d RK |
2042 | new = fold (build1 (code, TREE_TYPE (exp), op0)); |
2043 | break; | |
dec20b4b | 2044 | |
9d2a492d | 2045 | case 2: |
6fce44af RK |
2046 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
2047 | op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r); | |
784fb70e | 2048 | |
9d2a492d RK |
2049 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)) |
2050 | return exp; | |
9b594acf | 2051 | |
9d2a492d RK |
2052 | new = fold (build2 (code, TREE_TYPE (exp), op0, op1)); |
2053 | break; | |
dec20b4b | 2054 | |
9d2a492d | 2055 | case 3: |
6fce44af RK |
2056 | op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r); |
2057 | op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r); | |
2058 | op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r); | |
6a22e3a7 | 2059 | |
9d2a492d RK |
2060 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) |
2061 | && op2 == TREE_OPERAND (exp, 2)) | |
2062 | return exp; | |
e9a25f70 | 2063 | |
9d2a492d RK |
2064 | new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2)); |
2065 | break; | |
e9a25f70 | 2066 | |
9d2a492d | 2067 | default: |
1e128c5f | 2068 | gcc_unreachable (); |
9d2a492d RK |
2069 | } |
2070 | break; | |
dec20b4b | 2071 | |
9d2a492d | 2072 | default: |
1e128c5f | 2073 | gcc_unreachable (); |
9d2a492d | 2074 | } |
dec20b4b | 2075 | |
abd23b66 RK |
2076 | TREE_READONLY (new) = TREE_READONLY (exp); |
2077 | return new; | |
dec20b4b | 2078 | } |
6fce44af RK |
2079 | |
2080 | /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement | |
2081 | for it within OBJ, a tree that is an object or a chain of references. */ | |
2082 | ||
2083 | tree | |
2084 | substitute_placeholder_in_expr (tree exp, tree obj) | |
2085 | { | |
2086 | enum tree_code code = TREE_CODE (exp); | |
95df09f0 | 2087 | tree op0, op1, op2, op3; |
6fce44af RK |
2088 | |
2089 | /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type | |
2090 | in the chain of OBJ. */ | |
2091 | if (code == PLACEHOLDER_EXPR) | |
2092 | { | |
2093 | tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp)); | |
2094 | tree elt; | |
2095 | ||
2096 | for (elt = obj; elt != 0; | |
2097 | elt = ((TREE_CODE (elt) == COMPOUND_EXPR | |
2098 | || TREE_CODE (elt) == COND_EXPR) | |
2099 | ? TREE_OPERAND (elt, 1) | |
6615c446 JO |
2100 | : (REFERENCE_CLASS_P (elt) |
2101 | || UNARY_CLASS_P (elt) | |
2102 | || BINARY_CLASS_P (elt) | |
2103 | || EXPRESSION_CLASS_P (elt)) | |
6fce44af RK |
2104 | ? TREE_OPERAND (elt, 0) : 0)) |
2105 | if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type) | |
2106 | return elt; | |
2107 | ||
2108 | for (elt = obj; elt != 0; | |
2109 | elt = ((TREE_CODE (elt) == COMPOUND_EXPR | |
2110 | || TREE_CODE (elt) == COND_EXPR) | |
2111 | ? TREE_OPERAND (elt, 1) | |
6615c446 JO |
2112 | : (REFERENCE_CLASS_P (elt) |
2113 | || UNARY_CLASS_P (elt) | |
2114 | || BINARY_CLASS_P (elt) | |
2115 | || EXPRESSION_CLASS_P (elt)) | |
6fce44af RK |
2116 | ? TREE_OPERAND (elt, 0) : 0)) |
2117 | if (POINTER_TYPE_P (TREE_TYPE (elt)) | |
2118 | && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt))) | |
2119 | == need_type)) | |
2120 | return fold (build1 (INDIRECT_REF, need_type, elt)); | |
2121 | ||
2122 | /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it | |
2123 | survives until RTL generation, there will be an error. */ | |
2124 | return exp; | |
2125 | } | |
2126 | ||
2127 | /* TREE_LIST is special because we need to look at TREE_VALUE | |
2128 | and TREE_CHAIN, not TREE_OPERANDS. */ | |
2129 | else if (code == TREE_LIST) | |
2130 | { | |
2131 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj); | |
2132 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj); | |
2133 | if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp)) | |
2134 | return exp; | |
2135 | ||
2136 | return tree_cons (TREE_PURPOSE (exp), op1, op0); | |
2137 | } | |
2138 | else | |
2139 | switch (TREE_CODE_CLASS (code)) | |
2140 | { | |
6615c446 JO |
2141 | case tcc_constant: |
2142 | case tcc_declaration: | |
6fce44af RK |
2143 | return exp; |
2144 | ||
6615c446 JO |
2145 | case tcc_exceptional: |
2146 | case tcc_unary: | |
2147 | case tcc_binary: | |
2148 | case tcc_comparison: | |
2149 | case tcc_expression: | |
2150 | case tcc_reference: | |
2151 | case tcc_statement: | |
54e4aedb | 2152 | switch (TREE_CODE_LENGTH (code)) |
6fce44af RK |
2153 | { |
2154 | case 0: | |
2155 | return exp; | |
2156 | ||
2157 | case 1: | |
2158 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
2159 | if (op0 == TREE_OPERAND (exp, 0)) | |
2160 | return exp; | |
2161 | else | |
2162 | return fold (build1 (code, TREE_TYPE (exp), op0)); | |
2163 | ||
2164 | case 2: | |
2165 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
2166 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj); | |
2167 | ||
2168 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)) | |
2169 | return exp; | |
2170 | else | |
2171 | return fold (build2 (code, TREE_TYPE (exp), op0, op1)); | |
2172 | ||
2173 | case 3: | |
2174 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
2175 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj); | |
2176 | op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj); | |
2177 | ||
2178 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
2179 | && op2 == TREE_OPERAND (exp, 2)) | |
2180 | return exp; | |
2181 | else | |
2182 | return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2)); | |
2183 | ||
95df09f0 RK |
2184 | case 4: |
2185 | op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj); | |
2186 | op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj); | |
2187 | op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj); | |
2188 | op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj); | |
2189 | ||
2190 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
2191 | && op2 == TREE_OPERAND (exp, 2) | |
2192 | && op3 == TREE_OPERAND (exp, 3)) | |
2193 | return exp; | |
2194 | else | |
2195 | return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3)); | |
2196 | ||
6fce44af | 2197 | default: |
1e128c5f | 2198 | gcc_unreachable (); |
6fce44af RK |
2199 | } |
2200 | break; | |
2201 | ||
2202 | default: | |
1e128c5f | 2203 | gcc_unreachable (); |
6fce44af RK |
2204 | } |
2205 | } | |
dec20b4b | 2206 | \f |
c6a1db6c RS |
2207 | /* Stabilize a reference so that we can use it any number of times |
2208 | without causing its operands to be evaluated more than once. | |
4b1d0fea RS |
2209 | Returns the stabilized reference. This works by means of save_expr, |
2210 | so see the caveats in the comments about save_expr. | |
c6a1db6c RS |
2211 | |
2212 | Also allows conversion expressions whose operands are references. | |
2213 | Any other kind of expression is returned unchanged. */ | |
2214 | ||
2215 | tree | |
46c5ad27 | 2216 | stabilize_reference (tree ref) |
c6a1db6c | 2217 | { |
b3694847 SS |
2218 | tree result; |
2219 | enum tree_code code = TREE_CODE (ref); | |
c6a1db6c RS |
2220 | |
2221 | switch (code) | |
2222 | { | |
2223 | case VAR_DECL: | |
2224 | case PARM_DECL: | |
2225 | case RESULT_DECL: | |
2226 | /* No action is needed in this case. */ | |
2227 | return ref; | |
2228 | ||
2229 | case NOP_EXPR: | |
2230 | case CONVERT_EXPR: | |
2231 | case FLOAT_EXPR: | |
2232 | case FIX_TRUNC_EXPR: | |
2233 | case FIX_FLOOR_EXPR: | |
2234 | case FIX_ROUND_EXPR: | |
2235 | case FIX_CEIL_EXPR: | |
2236 | result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0))); | |
2237 | break; | |
2238 | ||
2239 | case INDIRECT_REF: | |
2240 | result = build_nt (INDIRECT_REF, | |
2241 | stabilize_reference_1 (TREE_OPERAND (ref, 0))); | |
2242 | break; | |
2243 | ||
2244 | case COMPONENT_REF: | |
2245 | result = build_nt (COMPONENT_REF, | |
2246 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
44de5aeb | 2247 | TREE_OPERAND (ref, 1), NULL_TREE); |
c6a1db6c RS |
2248 | break; |
2249 | ||
2250 | case BIT_FIELD_REF: | |
2251 | result = build_nt (BIT_FIELD_REF, | |
2252 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2253 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), | |
2254 | stabilize_reference_1 (TREE_OPERAND (ref, 2))); | |
2255 | break; | |
2256 | ||
2257 | case ARRAY_REF: | |
2258 | result = build_nt (ARRAY_REF, | |
2259 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
44de5aeb RK |
2260 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), |
2261 | TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3)); | |
c6a1db6c RS |
2262 | break; |
2263 | ||
b4e3fabb RK |
2264 | case ARRAY_RANGE_REF: |
2265 | result = build_nt (ARRAY_RANGE_REF, | |
2266 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
44de5aeb RK |
2267 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), |
2268 | TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3)); | |
b4e3fabb RK |
2269 | break; |
2270 | ||
c451a7a0 | 2271 | case COMPOUND_EXPR: |
7b8b9722 MS |
2272 | /* We cannot wrap the first expression in a SAVE_EXPR, as then |
2273 | it wouldn't be ignored. This matters when dealing with | |
2274 | volatiles. */ | |
2275 | return stabilize_reference_1 (ref); | |
c451a7a0 | 2276 | |
c6a1db6c RS |
2277 | /* If arg isn't a kind of lvalue we recognize, make no change. |
2278 | Caller should recognize the error for an invalid lvalue. */ | |
2279 | default: | |
2280 | return ref; | |
2281 | ||
2282 | case ERROR_MARK: | |
2283 | return error_mark_node; | |
2284 | } | |
2285 | ||
2286 | TREE_TYPE (result) = TREE_TYPE (ref); | |
2287 | TREE_READONLY (result) = TREE_READONLY (ref); | |
2288 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref); | |
2289 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref); | |
c6a1db6c RS |
2290 | |
2291 | return result; | |
2292 | } | |
2293 | ||
2294 | /* Subroutine of stabilize_reference; this is called for subtrees of | |
2295 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
2296 | to ensure that it is only evaluated once. | |
2297 | ||
2298 | We don't put SAVE_EXPR nodes around everything, because assigning very | |
2299 | simple expressions to temporaries causes us to miss good opportunities | |
2300 | for optimizations. Among other things, the opportunity to fold in the | |
2301 | addition of a constant into an addressing mode often gets lost, e.g. | |
2302 | "y[i+1] += x;". In general, we take the approach that we should not make | |
2303 | an assignment unless we are forced into it - i.e., that any non-side effect | |
2304 | operator should be allowed, and that cse should take care of coalescing | |
2305 | multiple utterances of the same expression should that prove fruitful. */ | |
2306 | ||
4745ddae | 2307 | tree |
46c5ad27 | 2308 | stabilize_reference_1 (tree e) |
c6a1db6c | 2309 | { |
b3694847 SS |
2310 | tree result; |
2311 | enum tree_code code = TREE_CODE (e); | |
c6a1db6c | 2312 | |
af929c62 RK |
2313 | /* We cannot ignore const expressions because it might be a reference |
2314 | to a const array but whose index contains side-effects. But we can | |
2315 | ignore things that are actual constant or that already have been | |
2316 | handled by this function. */ | |
2317 | ||
6de9cd9a | 2318 | if (TREE_INVARIANT (e)) |
c6a1db6c RS |
2319 | return e; |
2320 | ||
2321 | switch (TREE_CODE_CLASS (code)) | |
2322 | { | |
6615c446 JO |
2323 | case tcc_exceptional: |
2324 | case tcc_type: | |
2325 | case tcc_declaration: | |
2326 | case tcc_comparison: | |
2327 | case tcc_statement: | |
2328 | case tcc_expression: | |
2329 | case tcc_reference: | |
c6a1db6c RS |
2330 | /* If the expression has side-effects, then encase it in a SAVE_EXPR |
2331 | so that it will only be evaluated once. */ | |
2332 | /* The reference (r) and comparison (<) classes could be handled as | |
2333 | below, but it is generally faster to only evaluate them once. */ | |
2334 | if (TREE_SIDE_EFFECTS (e)) | |
2335 | return save_expr (e); | |
2336 | return e; | |
2337 | ||
6615c446 | 2338 | case tcc_constant: |
c6a1db6c RS |
2339 | /* Constants need no processing. In fact, we should never reach |
2340 | here. */ | |
2341 | return e; | |
dc478a5d | 2342 | |
6615c446 | 2343 | case tcc_binary: |
ae698e41 RS |
2344 | /* Division is slow and tends to be compiled with jumps, |
2345 | especially the division by powers of 2 that is often | |
2346 | found inside of an array reference. So do it just once. */ | |
2347 | if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR | |
2348 | || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR | |
2349 | || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR | |
2350 | || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR) | |
2351 | return save_expr (e); | |
c6a1db6c RS |
2352 | /* Recursively stabilize each operand. */ |
2353 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)), | |
2354 | stabilize_reference_1 (TREE_OPERAND (e, 1))); | |
2355 | break; | |
2356 | ||
6615c446 | 2357 | case tcc_unary: |
c6a1db6c RS |
2358 | /* Recursively stabilize each operand. */ |
2359 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0))); | |
2360 | break; | |
a7fcb968 RK |
2361 | |
2362 | default: | |
1e128c5f | 2363 | gcc_unreachable (); |
c6a1db6c | 2364 | } |
dc478a5d | 2365 | |
c6a1db6c RS |
2366 | TREE_TYPE (result) = TREE_TYPE (e); |
2367 | TREE_READONLY (result) = TREE_READONLY (e); | |
2368 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e); | |
2369 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e); | |
6de9cd9a | 2370 | TREE_INVARIANT (result) = 1; |
c6a1db6c RS |
2371 | |
2372 | return result; | |
2373 | } | |
2374 | \f | |
2375 | /* Low-level constructors for expressions. */ | |
2376 | ||
44de5aeb RK |
2377 | /* A helper function for build1 and constant folders. Set TREE_CONSTANT, |
2378 | TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */ | |
6de9cd9a DN |
2379 | |
2380 | void | |
2381 | recompute_tree_invarant_for_addr_expr (tree t) | |
2382 | { | |
44de5aeb RK |
2383 | tree node; |
2384 | bool tc = true, ti = true, se = false; | |
6de9cd9a | 2385 | |
44de5aeb RK |
2386 | /* We started out assuming this address is both invariant and constant, but |
2387 | does not have side effects. Now go down any handled components and see if | |
2388 | any of them involve offsets that are either non-constant or non-invariant. | |
2389 | Also check for side-effects. | |
2390 | ||
2391 | ??? Note that this code makes no attempt to deal with the case where | |
2392 | taking the address of something causes a copy due to misalignment. */ | |
2393 | ||
2394 | #define UPDATE_TITCSE(NODE) \ | |
2395 | do { tree _node = (NODE); \ | |
2396 | if (_node && !TREE_INVARIANT (_node)) ti = false; \ | |
2397 | if (_node && !TREE_CONSTANT (_node)) tc = false; \ | |
2398 | if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0) | |
2399 | ||
2400 | for (node = TREE_OPERAND (t, 0); handled_component_p (node); | |
2401 | node = TREE_OPERAND (node, 0)) | |
6de9cd9a | 2402 | { |
44de5aeb RK |
2403 | /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus |
2404 | array reference (probably made temporarily by the G++ front end), | |
2405 | so ignore all the operands. */ | |
2406 | if ((TREE_CODE (node) == ARRAY_REF | |
2407 | || TREE_CODE (node) == ARRAY_RANGE_REF) | |
2408 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE) | |
6de9cd9a | 2409 | { |
44de5aeb | 2410 | UPDATE_TITCSE (TREE_OPERAND (node, 1)); |
bc482be4 RH |
2411 | if (TREE_OPERAND (node, 2)) |
2412 | UPDATE_TITCSE (TREE_OPERAND (node, 2)); | |
2413 | if (TREE_OPERAND (node, 3)) | |
2414 | UPDATE_TITCSE (TREE_OPERAND (node, 3)); | |
6de9cd9a | 2415 | } |
44de5aeb RK |
2416 | /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a |
2417 | FIELD_DECL, apparently. The G++ front end can put something else | |
2418 | there, at least temporarily. */ | |
2419 | else if (TREE_CODE (node) == COMPONENT_REF | |
2420 | && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL) | |
bc482be4 RH |
2421 | { |
2422 | if (TREE_OPERAND (node, 2)) | |
2423 | UPDATE_TITCSE (TREE_OPERAND (node, 2)); | |
2424 | } | |
44de5aeb RK |
2425 | else if (TREE_CODE (node) == BIT_FIELD_REF) |
2426 | UPDATE_TITCSE (TREE_OPERAND (node, 2)); | |
2427 | } | |
9f63daea | 2428 | |
44de5aeb | 2429 | /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from |
a8afd3ac RH |
2430 | the address, since &(*a)->b is a form of addition. If it's a decl, it's |
2431 | invariant and constant if the decl is static. It's also invariant if it's | |
2432 | a decl in the current function. Taking the address of a volatile variable | |
2433 | is not volatile. If it's a constant, the address is both invariant and | |
2434 | constant. Otherwise it's neither. */ | |
44de5aeb | 2435 | if (TREE_CODE (node) == INDIRECT_REF) |
a8afd3ac | 2436 | UPDATE_TITCSE (TREE_OPERAND (node, 0)); |
44de5aeb RK |
2437 | else if (DECL_P (node)) |
2438 | { | |
5377d5ba RK |
2439 | if (staticp (node)) |
2440 | ; | |
4033a1f2 AH |
2441 | else if (decl_function_context (node) == current_function_decl |
2442 | /* Addresses of thread-local variables are invariant. */ | |
2443 | || (TREE_CODE (node) == VAR_DECL && DECL_THREAD_LOCAL (node))) | |
44de5aeb | 2444 | tc = false; |
5377d5ba RK |
2445 | else |
2446 | ti = tc = false; | |
44de5aeb | 2447 | } |
6615c446 | 2448 | else if (CONSTANT_CLASS_P (node)) |
44de5aeb RK |
2449 | ; |
2450 | else | |
2451 | { | |
2452 | ti = tc = false; | |
2453 | se |= TREE_SIDE_EFFECTS (node); | |
6de9cd9a DN |
2454 | } |
2455 | ||
2456 | TREE_CONSTANT (t) = tc; | |
2457 | TREE_INVARIANT (t) = ti; | |
44de5aeb RK |
2458 | TREE_SIDE_EFFECTS (t) = se; |
2459 | #undef UPDATE_TITCSE | |
6de9cd9a DN |
2460 | } |
2461 | ||
4221057e RH |
2462 | /* Build an expression of code CODE, data type TYPE, and operands as |
2463 | specified. Expressions and reference nodes can be created this way. | |
2464 | Constants, decls, types and misc nodes cannot be. | |
2465 | ||
2466 | We define 5 non-variadic functions, from 0 to 4 arguments. This is | |
9f63daea | 2467 | enough for all extant tree codes. These functions can be called |
4221057e RH |
2468 | directly (preferably!), but can also be obtained via GCC preprocessor |
2469 | magic within the build macro. */ | |
c6a1db6c RS |
2470 | |
2471 | tree | |
b9dcdee4 | 2472 | build0_stat (enum tree_code code, tree tt MEM_STAT_DECL) |
c6a1db6c | 2473 | { |
b3694847 | 2474 | tree t; |
c6a1db6c | 2475 | |
1e128c5f | 2476 | gcc_assert (TREE_CODE_LENGTH (code) == 0); |
ba63ed56 | 2477 | |
b9dcdee4 | 2478 | t = make_node_stat (code PASS_MEM_STAT); |
ba63ed56 | 2479 | TREE_TYPE (t) = tt; |
c6a1db6c | 2480 | |
c6a1db6c RS |
2481 | return t; |
2482 | } | |
2483 | ||
c6a1db6c | 2484 | tree |
b9dcdee4 | 2485 | build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL) |
c6a1db6c | 2486 | { |
9ec22713 | 2487 | int length = sizeof (struct tree_exp); |
5e9defae | 2488 | #ifdef GATHER_STATISTICS |
b3694847 | 2489 | tree_node_kind kind; |
5e9defae | 2490 | #endif |
b3694847 | 2491 | tree t; |
c6a1db6c RS |
2492 | |
2493 | #ifdef GATHER_STATISTICS | |
9ec22713 JM |
2494 | switch (TREE_CODE_CLASS (code)) |
2495 | { | |
6615c446 | 2496 | case tcc_statement: /* an expression with side effects */ |
9ec22713 JM |
2497 | kind = s_kind; |
2498 | break; | |
6615c446 | 2499 | case tcc_reference: /* a reference */ |
9ec22713 JM |
2500 | kind = r_kind; |
2501 | break; | |
2502 | default: | |
2503 | kind = e_kind; | |
2504 | break; | |
2505 | } | |
2506 | ||
2507 | tree_node_counts[(int) kind]++; | |
2508 | tree_node_sizes[(int) kind] += length; | |
c6a1db6c RS |
2509 | #endif |
2510 | ||
1e128c5f | 2511 | gcc_assert (TREE_CODE_LENGTH (code) == 1); |
3af4c257 | 2512 | |
08cee789 | 2513 | t = ggc_alloc_zone_stat (length, &tree_zone PASS_MEM_STAT); |
f8a83ee3 | 2514 | |
fad205ff | 2515 | memset (t, 0, sizeof (struct tree_common)); |
c6a1db6c | 2516 | |
c6a1db6c | 2517 | TREE_SET_CODE (t, code); |
235783d1 | 2518 | |
f8a83ee3 | 2519 | TREE_TYPE (t) = type; |
c1667470 PB |
2520 | #ifdef USE_MAPPED_LOCATION |
2521 | SET_EXPR_LOCATION (t, UNKNOWN_LOCATION); | |
2522 | #else | |
6de9cd9a | 2523 | SET_EXPR_LOCUS (t, NULL); |
c1667470 | 2524 | #endif |
f8a83ee3 | 2525 | TREE_COMPLEXITY (t) = 0; |
c6a1db6c | 2526 | TREE_OPERAND (t, 0) = node; |
6de9cd9a | 2527 | TREE_BLOCK (t) = NULL_TREE; |
ac1b13f4 | 2528 | if (node && !TYPE_P (node)) |
235783d1 RK |
2529 | { |
2530 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node); | |
2531 | TREE_READONLY (t) = TREE_READONLY (node); | |
2532 | } | |
c6a1db6c | 2533 | |
6615c446 | 2534 | if (TREE_CODE_CLASS (code) == tcc_statement) |
4f7c4327 | 2535 | TREE_SIDE_EFFECTS (t) = 1; |
9ec22713 | 2536 | else switch (code) |
1fef02f6 RH |
2537 | { |
2538 | case INIT_EXPR: | |
2539 | case MODIFY_EXPR: | |
2540 | case VA_ARG_EXPR: | |
1fef02f6 RH |
2541 | case PREDECREMENT_EXPR: |
2542 | case PREINCREMENT_EXPR: | |
2543 | case POSTDECREMENT_EXPR: | |
2544 | case POSTINCREMENT_EXPR: | |
2545 | /* All of these have side-effects, no matter what their | |
2546 | operands are. */ | |
2547 | TREE_SIDE_EFFECTS (t) = 1; | |
235783d1 | 2548 | TREE_READONLY (t) = 0; |
1fef02f6 | 2549 | break; |
f893c16e | 2550 | |
7ccf35ed DN |
2551 | case MISALIGNED_INDIRECT_REF: |
2552 | case ALIGN_INDIRECT_REF: | |
f893c16e JM |
2553 | case INDIRECT_REF: |
2554 | /* Whether a dereference is readonly has nothing to do with whether | |
2555 | its operand is readonly. */ | |
2556 | TREE_READONLY (t) = 0; | |
2557 | break; | |
dc478a5d | 2558 | |
2038bd69 JM |
2559 | case ADDR_EXPR: |
2560 | if (node) | |
44de5aeb | 2561 | recompute_tree_invarant_for_addr_expr (t); |
2038bd69 JM |
2562 | break; |
2563 | ||
1fef02f6 | 2564 | default: |
6615c446 JO |
2565 | if (TREE_CODE_CLASS (code) == tcc_unary |
2566 | && node && !TYPE_P (node) | |
4f976745 | 2567 | && TREE_CONSTANT (node)) |
1796dff4 | 2568 | TREE_CONSTANT (t) = 1; |
6615c446 JO |
2569 | if (TREE_CODE_CLASS (code) == tcc_unary |
2570 | && node && TREE_INVARIANT (node)) | |
6de9cd9a | 2571 | TREE_INVARIANT (t) = 1; |
6615c446 JO |
2572 | if (TREE_CODE_CLASS (code) == tcc_reference |
2573 | && node && TREE_THIS_VOLATILE (node)) | |
497be978 | 2574 | TREE_THIS_VOLATILE (t) = 1; |
1fef02f6 RH |
2575 | break; |
2576 | } | |
2577 | ||
c6a1db6c RS |
2578 | return t; |
2579 | } | |
2580 | ||
4221057e RH |
2581 | #define PROCESS_ARG(N) \ |
2582 | do { \ | |
2583 | TREE_OPERAND (t, N) = arg##N; \ | |
ac1b13f4 | 2584 | if (arg##N &&!TYPE_P (arg##N)) \ |
4221057e RH |
2585 | { \ |
2586 | if (TREE_SIDE_EFFECTS (arg##N)) \ | |
2587 | side_effects = 1; \ | |
2588 | if (!TREE_READONLY (arg##N)) \ | |
2589 | read_only = 0; \ | |
2590 | if (!TREE_CONSTANT (arg##N)) \ | |
2591 | constant = 0; \ | |
6de9cd9a DN |
2592 | if (!TREE_INVARIANT (arg##N)) \ |
2593 | invariant = 0; \ | |
4221057e RH |
2594 | } \ |
2595 | } while (0) | |
2596 | ||
2597 | tree | |
b9dcdee4 | 2598 | build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL) |
4221057e | 2599 | { |
6de9cd9a | 2600 | bool constant, read_only, side_effects, invariant; |
4221057e | 2601 | tree t; |
4221057e | 2602 | |
1e128c5f | 2603 | gcc_assert (TREE_CODE_LENGTH (code) == 2); |
4221057e | 2604 | |
b9dcdee4 | 2605 | t = make_node_stat (code PASS_MEM_STAT); |
4221057e RH |
2606 | TREE_TYPE (t) = tt; |
2607 | ||
2608 | /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the | |
2609 | result based on those same flags for the arguments. But if the | |
2610 | arguments aren't really even `tree' expressions, we shouldn't be trying | |
2611 | to do this. */ | |
4221057e RH |
2612 | |
2613 | /* Expressions without side effects may be constant if their | |
2614 | arguments are as well. */ | |
6615c446 JO |
2615 | constant = (TREE_CODE_CLASS (code) == tcc_comparison |
2616 | || TREE_CODE_CLASS (code) == tcc_binary); | |
4221057e RH |
2617 | read_only = 1; |
2618 | side_effects = TREE_SIDE_EFFECTS (t); | |
6de9cd9a | 2619 | invariant = constant; |
4221057e RH |
2620 | |
2621 | PROCESS_ARG(0); | |
2622 | PROCESS_ARG(1); | |
2623 | ||
4221057e RH |
2624 | TREE_READONLY (t) = read_only; |
2625 | TREE_CONSTANT (t) = constant; | |
6de9cd9a | 2626 | TREE_INVARIANT (t) = invariant; |
9f63daea | 2627 | TREE_SIDE_EFFECTS (t) = side_effects; |
44de5aeb | 2628 | TREE_THIS_VOLATILE (t) |
6615c446 JO |
2629 | = (TREE_CODE_CLASS (code) == tcc_reference |
2630 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
4221057e RH |
2631 | |
2632 | return t; | |
2633 | } | |
2634 | ||
2635 | tree | |
b9dcdee4 JH |
2636 | build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1, |
2637 | tree arg2 MEM_STAT_DECL) | |
4221057e | 2638 | { |
6de9cd9a | 2639 | bool constant, read_only, side_effects, invariant; |
4221057e | 2640 | tree t; |
4221057e | 2641 | |
1e128c5f | 2642 | gcc_assert (TREE_CODE_LENGTH (code) == 3); |
4221057e | 2643 | |
b9dcdee4 | 2644 | t = make_node_stat (code PASS_MEM_STAT); |
4221057e RH |
2645 | TREE_TYPE (t) = tt; |
2646 | ||
4221057e RH |
2647 | side_effects = TREE_SIDE_EFFECTS (t); |
2648 | ||
2649 | PROCESS_ARG(0); | |
2650 | PROCESS_ARG(1); | |
2651 | PROCESS_ARG(2); | |
2652 | ||
6de9cd9a DN |
2653 | if (code == CALL_EXPR && !side_effects) |
2654 | { | |
2655 | tree node; | |
2656 | int i; | |
2657 | ||
2658 | /* Calls have side-effects, except those to const or | |
2659 | pure functions. */ | |
2660 | i = call_expr_flags (t); | |
2661 | if (!(i & (ECF_CONST | ECF_PURE))) | |
2662 | side_effects = 1; | |
2663 | ||
2664 | /* And even those have side-effects if their arguments do. */ | |
2665 | else for (node = arg1; node; node = TREE_CHAIN (node)) | |
2666 | if (TREE_SIDE_EFFECTS (TREE_VALUE (node))) | |
2667 | { | |
2668 | side_effects = 1; | |
2669 | break; | |
2670 | } | |
2671 | } | |
2672 | ||
9f63daea | 2673 | TREE_SIDE_EFFECTS (t) = side_effects; |
44de5aeb | 2674 | TREE_THIS_VOLATILE (t) |
6615c446 JO |
2675 | = (TREE_CODE_CLASS (code) == tcc_reference |
2676 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
4221057e RH |
2677 | |
2678 | return t; | |
2679 | } | |
2680 | ||
2681 | tree | |
b9dcdee4 JH |
2682 | build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1, |
2683 | tree arg2, tree arg3 MEM_STAT_DECL) | |
4221057e | 2684 | { |
6de9cd9a | 2685 | bool constant, read_only, side_effects, invariant; |
4221057e | 2686 | tree t; |
4221057e | 2687 | |
1e128c5f | 2688 | gcc_assert (TREE_CODE_LENGTH (code) == 4); |
4221057e | 2689 | |
b9dcdee4 | 2690 | t = make_node_stat (code PASS_MEM_STAT); |
4221057e RH |
2691 | TREE_TYPE (t) = tt; |
2692 | ||
4221057e RH |
2693 | side_effects = TREE_SIDE_EFFECTS (t); |
2694 | ||
2695 | PROCESS_ARG(0); | |
2696 | PROCESS_ARG(1); | |
2697 | PROCESS_ARG(2); | |
2698 | PROCESS_ARG(3); | |
2699 | ||
9f63daea | 2700 | TREE_SIDE_EFFECTS (t) = side_effects; |
44de5aeb | 2701 | TREE_THIS_VOLATILE (t) |
6615c446 JO |
2702 | = (TREE_CODE_CLASS (code) == tcc_reference |
2703 | && arg0 && TREE_THIS_VOLATILE (arg0)); | |
4221057e RH |
2704 | |
2705 | return t; | |
2706 | } | |
2707 | ||
2708 | /* Backup definition for non-gcc build compilers. */ | |
2709 | ||
2710 | tree | |
2711 | (build) (enum tree_code code, tree tt, ...) | |
2712 | { | |
2713 | tree t, arg0, arg1, arg2, arg3; | |
2714 | int length = TREE_CODE_LENGTH (code); | |
2715 | va_list p; | |
2716 | ||
2717 | va_start (p, tt); | |
2718 | switch (length) | |
2719 | { | |
2720 | case 0: | |
2721 | t = build0 (code, tt); | |
2722 | break; | |
2723 | case 1: | |
2724 | arg0 = va_arg (p, tree); | |
2725 | t = build1 (code, tt, arg0); | |
2726 | break; | |
2727 | case 2: | |
2728 | arg0 = va_arg (p, tree); | |
2729 | arg1 = va_arg (p, tree); | |
2730 | t = build2 (code, tt, arg0, arg1); | |
2731 | break; | |
2732 | case 3: | |
2733 | arg0 = va_arg (p, tree); | |
2734 | arg1 = va_arg (p, tree); | |
2735 | arg2 = va_arg (p, tree); | |
2736 | t = build3 (code, tt, arg0, arg1, arg2); | |
2737 | break; | |
2738 | case 4: | |
2739 | arg0 = va_arg (p, tree); | |
2740 | arg1 = va_arg (p, tree); | |
2741 | arg2 = va_arg (p, tree); | |
2742 | arg3 = va_arg (p, tree); | |
2743 | t = build4 (code, tt, arg0, arg1, arg2, arg3); | |
2744 | break; | |
2745 | default: | |
1e128c5f | 2746 | gcc_unreachable (); |
4221057e RH |
2747 | } |
2748 | va_end (p); | |
2749 | ||
2750 | return t; | |
2751 | } | |
2752 | ||
c6a1db6c RS |
2753 | /* Similar except don't specify the TREE_TYPE |
2754 | and leave the TREE_SIDE_EFFECTS as 0. | |
2755 | It is permissible for arguments to be null, | |
2756 | or even garbage if their values do not matter. */ | |
2757 | ||
2758 | tree | |
e34d07f2 | 2759 | build_nt (enum tree_code code, ...) |
c6a1db6c | 2760 | { |
b3694847 SS |
2761 | tree t; |
2762 | int length; | |
2763 | int i; | |
e34d07f2 | 2764 | va_list p; |
c6a1db6c | 2765 | |
e34d07f2 | 2766 | va_start (p, code); |
ba63ed56 | 2767 | |
c6a1db6c | 2768 | t = make_node (code); |
8d5e6e25 | 2769 | length = TREE_CODE_LENGTH (code); |
c6a1db6c RS |
2770 | |
2771 | for (i = 0; i < length; i++) | |
2772 | TREE_OPERAND (t, i) = va_arg (p, tree); | |
2773 | ||
e34d07f2 | 2774 | va_end (p); |
c6a1db6c RS |
2775 | return t; |
2776 | } | |
c6a1db6c RS |
2777 | \f |
2778 | /* Create a DECL_... node of code CODE, name NAME and data type TYPE. | |
2779 | We do NOT enter this node in any sort of symbol table. | |
2780 | ||
2781 | layout_decl is used to set up the decl's storage layout. | |
2782 | Other slots are initialized to 0 or null pointers. */ | |
2783 | ||
2784 | tree | |
b9dcdee4 | 2785 | build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL) |
c6a1db6c | 2786 | { |
b3694847 | 2787 | tree t; |
c6a1db6c | 2788 | |
b9dcdee4 | 2789 | t = make_node_stat (code PASS_MEM_STAT); |
c6a1db6c RS |
2790 | |
2791 | /* if (type == error_mark_node) | |
2792 | type = integer_type_node; */ | |
2793 | /* That is not done, deliberately, so that having error_mark_node | |
2794 | as the type can suppress useless errors in the use of this variable. */ | |
2795 | ||
2796 | DECL_NAME (t) = name; | |
c6a1db6c RS |
2797 | TREE_TYPE (t) = type; |
2798 | ||
2799 | if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL) | |
2800 | layout_decl (t, 0); | |
2801 | else if (code == FUNCTION_DECL) | |
2802 | DECL_MODE (t) = FUNCTION_MODE; | |
9f63daea | 2803 | |
d7afec4b ND |
2804 | /* Set default visibility to whatever the user supplied with |
2805 | visibility_specified depending on #pragma GCC visibility. */ | |
2806 | DECL_VISIBILITY (t) = default_visibility; | |
2807 | DECL_VISIBILITY_SPECIFIED (t) = visibility_options.inpragma; | |
c6a1db6c RS |
2808 | |
2809 | return t; | |
2810 | } | |
2811 | \f | |
2812 | /* BLOCK nodes are used to represent the structure of binding contours | |
2813 | and declarations, once those contours have been exited and their contents | |
52d2830e | 2814 | compiled. This information is used for outputting debugging info. */ |
c6a1db6c RS |
2815 | |
2816 | tree | |
46c5ad27 AJ |
2817 | build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks, |
2818 | tree supercontext, tree chain) | |
c6a1db6c | 2819 | { |
b3694847 | 2820 | tree block = make_node (BLOCK); |
d4b60170 | 2821 | |
c6a1db6c | 2822 | BLOCK_VARS (block) = vars; |
c6a1db6c RS |
2823 | BLOCK_SUBBLOCKS (block) = subblocks; |
2824 | BLOCK_SUPERCONTEXT (block) = supercontext; | |
2825 | BLOCK_CHAIN (block) = chain; | |
2826 | return block; | |
2827 | } | |
bf1e5319 | 2828 | |
c1667470 PB |
2829 | #if 1 /* ! defined(USE_MAPPED_LOCATION) */ |
2830 | /* ??? gengtype doesn't handle conditionals */ | |
6de9cd9a | 2831 | static GTY(()) tree last_annotated_node; |
c1667470 PB |
2832 | #endif |
2833 | ||
2834 | #ifdef USE_MAPPED_LOCATION | |
2835 | ||
2836 | expanded_location | |
2837 | expand_location (source_location loc) | |
2838 | { | |
2839 | expanded_location xloc; | |
aa3c6dc1 | 2840 | if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; } |
c1667470 PB |
2841 | else |
2842 | { | |
2843 | const struct line_map *map = linemap_lookup (&line_table, loc); | |
2844 | xloc.file = map->to_file; | |
2845 | xloc.line = SOURCE_LINE (map, loc); | |
aa3c6dc1 | 2846 | xloc.column = SOURCE_COLUMN (map, loc); |
c1667470 PB |
2847 | }; |
2848 | return xloc; | |
2849 | } | |
2850 | ||
2851 | #else | |
bf1e5319 | 2852 | |
6de9cd9a DN |
2853 | /* Record the exact location where an expression or an identifier were |
2854 | encountered. */ | |
9fe9a2e1 | 2855 | |
6de9cd9a DN |
2856 | void |
2857 | annotate_with_file_line (tree node, const char *file, int line) | |
2858 | { | |
2859 | /* Roughly one percent of the calls to this function are to annotate | |
2860 | a node with the same information already attached to that node! | |
2861 | Just return instead of wasting memory. */ | |
2862 | if (EXPR_LOCUS (node) | |
2863 | && (EXPR_FILENAME (node) == file | |
2864 | || ! strcmp (EXPR_FILENAME (node), file)) | |
2865 | && EXPR_LINENO (node) == line) | |
9fe9a2e1 | 2866 | { |
6de9cd9a DN |
2867 | last_annotated_node = node; |
2868 | return; | |
9fe9a2e1 | 2869 | } |
d4b60170 | 2870 | |
6de9cd9a DN |
2871 | /* In heavily macroized code (such as GCC itself) this single |
2872 | entry cache can reduce the number of allocations by more | |
2873 | than half. */ | |
2874 | if (last_annotated_node | |
2875 | && EXPR_LOCUS (last_annotated_node) | |
2876 | && (EXPR_FILENAME (last_annotated_node) == file | |
2877 | || ! strcmp (EXPR_FILENAME (last_annotated_node), file)) | |
2878 | && EXPR_LINENO (last_annotated_node) == line) | |
9fe9a2e1 | 2879 | { |
6de9cd9a DN |
2880 | SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node)); |
2881 | return; | |
9fe9a2e1 | 2882 | } |
d4b60170 | 2883 | |
6de9cd9a DN |
2884 | SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t))); |
2885 | EXPR_LINENO (node) = line; | |
2886 | EXPR_FILENAME (node) = file; | |
2887 | last_annotated_node = node; | |
2888 | } | |
2889 | ||
2890 | void | |
2891 | annotate_with_locus (tree node, location_t locus) | |
2892 | { | |
2893 | annotate_with_file_line (node, locus.file, locus.line); | |
bf1e5319 | 2894 | } |
c1667470 | 2895 | #endif |
c6a1db6c | 2896 | \f |
91d231cb | 2897 | /* Return a declaration like DDECL except that its DECL_ATTRIBUTES |
0f41302f | 2898 | is ATTRIBUTE. */ |
1a2927d2 RK |
2899 | |
2900 | tree | |
46c5ad27 | 2901 | build_decl_attribute_variant (tree ddecl, tree attribute) |
1a2927d2 | 2902 | { |
91d231cb | 2903 | DECL_ATTRIBUTES (ddecl) = attribute; |
1a2927d2 RK |
2904 | return ddecl; |
2905 | } | |
2906 | ||
caf29de7 JH |
2907 | /* Borrowed from hashtab.c iterative_hash implementation. */ |
2908 | #define mix(a,b,c) \ | |
2909 | { \ | |
2910 | a -= b; a -= c; a ^= (c>>13); \ | |
2911 | b -= c; b -= a; b ^= (a<< 8); \ | |
2912 | c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \ | |
2913 | a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \ | |
2914 | b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \ | |
2915 | c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \ | |
2916 | a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \ | |
2917 | b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \ | |
2918 | c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \ | |
2919 | } | |
2920 | ||
2921 | ||
2922 | /* Produce good hash value combining VAL and VAL2. */ | |
2923 | static inline hashval_t | |
2924 | iterative_hash_hashval_t (hashval_t val, hashval_t val2) | |
2925 | { | |
2926 | /* the golden ratio; an arbitrary value. */ | |
2927 | hashval_t a = 0x9e3779b9; | |
2928 | ||
2929 | mix (a, val, val2); | |
2930 | return val2; | |
2931 | } | |
2932 | ||
2933 | /* Produce good hash value combining PTR and VAL2. */ | |
2934 | static inline hashval_t | |
2935 | iterative_hash_pointer (void *ptr, hashval_t val2) | |
2936 | { | |
2937 | if (sizeof (ptr) == sizeof (hashval_t)) | |
2938 | return iterative_hash_hashval_t ((size_t) ptr, val2); | |
2939 | else | |
2940 | { | |
2941 | hashval_t a = (hashval_t) (size_t) ptr; | |
2942 | /* Avoid warnings about shifting of more than the width of the type on | |
2943 | hosts that won't execute this path. */ | |
2944 | int zero = 0; | |
2945 | hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero)); | |
2946 | mix (a, b, val2); | |
2947 | return val2; | |
2948 | } | |
2949 | } | |
2950 | ||
2951 | /* Produce good hash value combining VAL and VAL2. */ | |
2952 | static inline hashval_t | |
2953 | iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2) | |
2954 | { | |
2955 | if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t)) | |
2956 | return iterative_hash_hashval_t (val, val2); | |
2957 | else | |
2958 | { | |
2959 | hashval_t a = (hashval_t) val; | |
2960 | /* Avoid warnings about shifting of more than the width of the type on | |
2961 | hosts that won't execute this path. */ | |
2962 | int zero = 0; | |
2963 | hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero)); | |
2964 | mix (a, b, val2); | |
2965 | if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t)) | |
2966 | { | |
2967 | hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero)); | |
2968 | hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero)); | |
2969 | mix (a, b, val2); | |
2970 | } | |
2971 | return val2; | |
2972 | } | |
2973 | } | |
2974 | ||
91e97eb8 RK |
2975 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTE |
2976 | is ATTRIBUTE. | |
2977 | ||
f8a89236 | 2978 | Record such modified types already made so we don't make duplicates. */ |
91e97eb8 RK |
2979 | |
2980 | tree | |
46c5ad27 | 2981 | build_type_attribute_variant (tree ttype, tree attribute) |
91e97eb8 | 2982 | { |
3b03c671 | 2983 | if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute)) |
91e97eb8 | 2984 | { |
fd917e0d | 2985 | hashval_t hashcode = 0; |
91e97eb8 | 2986 | tree ntype; |
fd917e0d | 2987 | enum tree_code code = TREE_CODE (ttype); |
91e97eb8 | 2988 | |
91e97eb8 | 2989 | ntype = copy_node (ttype); |
91e97eb8 RK |
2990 | |
2991 | TYPE_POINTER_TO (ntype) = 0; | |
2992 | TYPE_REFERENCE_TO (ntype) = 0; | |
2993 | TYPE_ATTRIBUTES (ntype) = attribute; | |
2994 | ||
2995 | /* Create a new main variant of TYPE. */ | |
2996 | TYPE_MAIN_VARIANT (ntype) = ntype; | |
2997 | TYPE_NEXT_VARIANT (ntype) = 0; | |
3932261a | 2998 | set_type_quals (ntype, TYPE_UNQUALIFIED); |
91e97eb8 | 2999 | |
fd917e0d JM |
3000 | hashcode = iterative_hash_object (code, hashcode); |
3001 | if (TREE_TYPE (ntype)) | |
3002 | hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)), | |
3003 | hashcode); | |
3004 | hashcode = attribute_hash_list (attribute, hashcode); | |
91e97eb8 RK |
3005 | |
3006 | switch (TREE_CODE (ntype)) | |
dc478a5d | 3007 | { |
e9a25f70 | 3008 | case FUNCTION_TYPE: |
fd917e0d | 3009 | hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode); |
e9a25f70 JL |
3010 | break; |
3011 | case ARRAY_TYPE: | |
fd917e0d JM |
3012 | hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)), |
3013 | hashcode); | |
e9a25f70 JL |
3014 | break; |
3015 | case INTEGER_TYPE: | |
fd917e0d JM |
3016 | hashcode = iterative_hash_object |
3017 | (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode); | |
3018 | hashcode = iterative_hash_object | |
3019 | (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode); | |
e9a25f70 JL |
3020 | break; |
3021 | case REAL_TYPE: | |
fd917e0d JM |
3022 | { |
3023 | unsigned int precision = TYPE_PRECISION (ntype); | |
3024 | hashcode = iterative_hash_object (precision, hashcode); | |
3025 | } | |
e9a25f70 JL |
3026 | break; |
3027 | default: | |
3028 | break; | |
dc478a5d | 3029 | } |
91e97eb8 RK |
3030 | |
3031 | ntype = type_hash_canon (hashcode, ntype); | |
3932261a | 3032 | ttype = build_qualified_type (ntype, TYPE_QUALS (ttype)); |
91e97eb8 RK |
3033 | } |
3034 | ||
3035 | return ttype; | |
3036 | } | |
1a2927d2 | 3037 | |
e5410ba7 | 3038 | |
0e9e1e0a | 3039 | /* Return nonzero if IDENT is a valid name for attribute ATTR, |
2a3c15b5 DE |
3040 | or zero if not. |
3041 | ||
3042 | We try both `text' and `__text__', ATTR may be either one. */ | |
3043 | /* ??? It might be a reasonable simplification to require ATTR to be only | |
3044 | `text'. One might then also require attribute lists to be stored in | |
3045 | their canonicalized form. */ | |
3046 | ||
e5410ba7 AP |
3047 | static int |
3048 | is_attribute_with_length_p (const char *attr, int attr_len, tree ident) | |
2a3c15b5 | 3049 | { |
e5410ba7 | 3050 | int ident_len; |
63ad61ed | 3051 | const char *p; |
2a3c15b5 DE |
3052 | |
3053 | if (TREE_CODE (ident) != IDENTIFIER_NODE) | |
3054 | return 0; | |
e5410ba7 | 3055 | |
2a3c15b5 | 3056 | p = IDENTIFIER_POINTER (ident); |
e5410ba7 AP |
3057 | ident_len = IDENTIFIER_LENGTH (ident); |
3058 | ||
3059 | if (ident_len == attr_len | |
3060 | && strcmp (attr, p) == 0) | |
3061 | return 1; | |
2a3c15b5 DE |
3062 | |
3063 | /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */ | |
3064 | if (attr[0] == '_') | |
3065 | { | |
1e128c5f GB |
3066 | gcc_assert (attr[1] == '_'); |
3067 | gcc_assert (attr[attr_len - 2] == '_'); | |
3068 | gcc_assert (attr[attr_len - 1] == '_'); | |
3069 | gcc_assert (attr[1] == '_'); | |
2a3c15b5 DE |
3070 | if (ident_len == attr_len - 4 |
3071 | && strncmp (attr + 2, p, attr_len - 4) == 0) | |
3072 | return 1; | |
3073 | } | |
3074 | else | |
3075 | { | |
3076 | if (ident_len == attr_len + 4 | |
3077 | && p[0] == '_' && p[1] == '_' | |
3078 | && p[ident_len - 2] == '_' && p[ident_len - 1] == '_' | |
3079 | && strncmp (attr, p + 2, attr_len) == 0) | |
3080 | return 1; | |
3081 | } | |
3082 | ||
3083 | return 0; | |
3084 | } | |
3085 | ||
e5410ba7 AP |
3086 | /* Return nonzero if IDENT is a valid name for attribute ATTR, |
3087 | or zero if not. | |
3088 | ||
3089 | We try both `text' and `__text__', ATTR may be either one. */ | |
3090 | ||
3091 | int | |
3092 | is_attribute_p (const char *attr, tree ident) | |
3093 | { | |
3094 | return is_attribute_with_length_p (attr, strlen (attr), ident); | |
3095 | } | |
3096 | ||
2a3c15b5 DE |
3097 | /* Given an attribute name and a list of attributes, return a pointer to the |
3098 | attribute's list element if the attribute is part of the list, or NULL_TREE | |
91d231cb | 3099 | if not found. If the attribute appears more than once, this only |
ff7cc307 JM |
3100 | returns the first occurrence; the TREE_CHAIN of the return value should |
3101 | be passed back in if further occurrences are wanted. */ | |
2a3c15b5 DE |
3102 | |
3103 | tree | |
46c5ad27 | 3104 | lookup_attribute (const char *attr_name, tree list) |
2a3c15b5 DE |
3105 | { |
3106 | tree l; | |
e5410ba7 | 3107 | size_t attr_len = strlen (attr_name); |
2a3c15b5 DE |
3108 | |
3109 | for (l = list; l; l = TREE_CHAIN (l)) | |
3110 | { | |
1e128c5f | 3111 | gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE); |
e5410ba7 | 3112 | if (is_attribute_with_length_p (attr_name, attr_len, TREE_PURPOSE (l))) |
2a3c15b5 DE |
3113 | return l; |
3114 | } | |
3115 | ||
3116 | return NULL_TREE; | |
3117 | } | |
f3209e2f DE |
3118 | |
3119 | /* Return an attribute list that is the union of a1 and a2. */ | |
3120 | ||
3121 | tree | |
46c5ad27 | 3122 | merge_attributes (tree a1, tree a2) |
f3209e2f DE |
3123 | { |
3124 | tree attributes; | |
3125 | ||
3126 | /* Either one unset? Take the set one. */ | |
3127 | ||
d4b60170 | 3128 | if ((attributes = a1) == 0) |
f3209e2f DE |
3129 | attributes = a2; |
3130 | ||
3131 | /* One that completely contains the other? Take it. */ | |
3132 | ||
d4b60170 | 3133 | else if (a2 != 0 && ! attribute_list_contained (a1, a2)) |
dc478a5d KH |
3134 | { |
3135 | if (attribute_list_contained (a2, a1)) | |
3136 | attributes = a2; | |
3137 | else | |
3138 | { | |
3139 | /* Pick the longest list, and hang on the other list. */ | |
dc478a5d KH |
3140 | |
3141 | if (list_length (a1) < list_length (a2)) | |
3142 | attributes = a2, a2 = a1; | |
3143 | ||
3144 | for (; a2 != 0; a2 = TREE_CHAIN (a2)) | |
91d231cb JM |
3145 | { |
3146 | tree a; | |
3147 | for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)), | |
3148 | attributes); | |
3149 | a != NULL_TREE; | |
3150 | a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)), | |
3151 | TREE_CHAIN (a))) | |
3152 | { | |
3153 | if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1) | |
3154 | break; | |
3155 | } | |
3156 | if (a == NULL_TREE) | |
3157 | { | |
3158 | a1 = copy_node (a2); | |
3159 | TREE_CHAIN (a1) = attributes; | |
3160 | attributes = a1; | |
3161 | } | |
3162 | } | |
dc478a5d KH |
3163 | } |
3164 | } | |
f3209e2f DE |
3165 | return attributes; |
3166 | } | |
d9525bec BK |
3167 | |
3168 | /* Given types T1 and T2, merge their attributes and return | |
672a6f42 | 3169 | the result. */ |
d9525bec BK |
3170 | |
3171 | tree | |
46c5ad27 | 3172 | merge_type_attributes (tree t1, tree t2) |
d9525bec | 3173 | { |
d9525bec BK |
3174 | return merge_attributes (TYPE_ATTRIBUTES (t1), |
3175 | TYPE_ATTRIBUTES (t2)); | |
d9525bec BK |
3176 | } |
3177 | ||
3178 | /* Given decls OLDDECL and NEWDECL, merge their attributes and return | |
3179 | the result. */ | |
3180 | ||
3181 | tree | |
46c5ad27 | 3182 | merge_decl_attributes (tree olddecl, tree newdecl) |
d9525bec | 3183 | { |
91d231cb JM |
3184 | return merge_attributes (DECL_ATTRIBUTES (olddecl), |
3185 | DECL_ATTRIBUTES (newdecl)); | |
d9525bec | 3186 | } |
672a6f42 | 3187 | |
b2ca3702 | 3188 | #if TARGET_DLLIMPORT_DECL_ATTRIBUTES |
672a6f42 NB |
3189 | |
3190 | /* Specialization of merge_decl_attributes for various Windows targets. | |
3191 | ||
3192 | This handles the following situation: | |
3193 | ||
3194 | __declspec (dllimport) int foo; | |
3195 | int foo; | |
3196 | ||
3197 | The second instance of `foo' nullifies the dllimport. */ | |
3198 | ||
3199 | tree | |
46c5ad27 | 3200 | merge_dllimport_decl_attributes (tree old, tree new) |
672a6f42 NB |
3201 | { |
3202 | tree a; | |
3203 | int delete_dllimport_p; | |
3204 | ||
91d231cb JM |
3205 | old = DECL_ATTRIBUTES (old); |
3206 | new = DECL_ATTRIBUTES (new); | |
672a6f42 NB |
3207 | |
3208 | /* What we need to do here is remove from `old' dllimport if it doesn't | |
3209 | appear in `new'. dllimport behaves like extern: if a declaration is | |
3210 | marked dllimport and a definition appears later, then the object | |
3211 | is not dllimport'd. */ | |
3212 | if (lookup_attribute ("dllimport", old) != NULL_TREE | |
3213 | && lookup_attribute ("dllimport", new) == NULL_TREE) | |
3214 | delete_dllimport_p = 1; | |
3215 | else | |
3216 | delete_dllimport_p = 0; | |
3217 | ||
3218 | a = merge_attributes (old, new); | |
3219 | ||
3220 | if (delete_dllimport_p) | |
3221 | { | |
a01da83b | 3222 | tree prev, t; |
672a6f42 NB |
3223 | |
3224 | /* Scan the list for dllimport and delete it. */ | |
3225 | for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t)) | |
3226 | { | |
3227 | if (is_attribute_p ("dllimport", TREE_PURPOSE (t))) | |
3228 | { | |
3229 | if (prev == NULL_TREE) | |
3230 | a = TREE_CHAIN (a); | |
3231 | else | |
3232 | TREE_CHAIN (prev) = TREE_CHAIN (t); | |
3233 | break; | |
3234 | } | |
3235 | } | |
3236 | } | |
3237 | ||
3238 | return a; | |
3239 | } | |
3240 | ||
b2ca3702 MM |
3241 | /* Handle a "dllimport" or "dllexport" attribute; arguments as in |
3242 | struct attribute_spec.handler. */ | |
3243 | ||
3244 | tree | |
3245 | handle_dll_attribute (tree * pnode, tree name, tree args, int flags, | |
3246 | bool *no_add_attrs) | |
3247 | { | |
3248 | tree node = *pnode; | |
3249 | ||
3250 | /* These attributes may apply to structure and union types being created, | |
3251 | but otherwise should pass to the declaration involved. */ | |
3252 | if (!DECL_P (node)) | |
3253 | { | |
3254 | if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT | |
3255 | | (int) ATTR_FLAG_ARRAY_NEXT)) | |
3256 | { | |
3257 | *no_add_attrs = true; | |
3258 | return tree_cons (name, args, NULL_TREE); | |
3259 | } | |
3260 | if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE) | |
3261 | { | |
971801ff | 3262 | warning ("%qs attribute ignored", IDENTIFIER_POINTER (name)); |
b2ca3702 MM |
3263 | *no_add_attrs = true; |
3264 | } | |
3265 | ||
3266 | return NULL_TREE; | |
3267 | } | |
3268 | ||
3269 | /* Report error on dllimport ambiguities seen now before they cause | |
3270 | any damage. */ | |
3271 | if (is_attribute_p ("dllimport", name)) | |
3272 | { | |
3273 | /* Like MS, treat definition of dllimported variables and | |
3274 | non-inlined functions on declaration as syntax errors. We | |
3275 | allow the attribute for function definitions if declared | |
3276 | inline. */ | |
3277 | if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node) | |
3278 | && !DECL_DECLARED_INLINE_P (node)) | |
3279 | { | |
971801ff | 3280 | error ("%Jfunction %qD definition is marked dllimport.", node, node); |
b2ca3702 MM |
3281 | *no_add_attrs = true; |
3282 | } | |
3283 | ||
3284 | else if (TREE_CODE (node) == VAR_DECL) | |
3285 | { | |
3286 | if (DECL_INITIAL (node)) | |
3287 | { | |
971801ff | 3288 | error ("%Jvariable %qD definition is marked dllimport.", |
b2ca3702 MM |
3289 | node, node); |
3290 | *no_add_attrs = true; | |
3291 | } | |
3292 | ||
3293 | /* `extern' needn't be specified with dllimport. | |
3294 | Specify `extern' now and hope for the best. Sigh. */ | |
3295 | DECL_EXTERNAL (node) = 1; | |
3296 | /* Also, implicitly give dllimport'd variables declared within | |
3297 | a function global scope, unless declared static. */ | |
3298 | if (current_function_decl != NULL_TREE && !TREE_STATIC (node)) | |
3299 | TREE_PUBLIC (node) = 1; | |
3300 | } | |
3301 | } | |
3302 | ||
3303 | /* Report error if symbol is not accessible at global scope. */ | |
3304 | if (!TREE_PUBLIC (node) | |
3305 | && (TREE_CODE (node) == VAR_DECL | |
3306 | || TREE_CODE (node) == FUNCTION_DECL)) | |
3307 | { | |
971801ff JM |
3308 | error ("%Jexternal linkage required for symbol %qD because of " |
3309 | "%qs attribute.", node, node, IDENTIFIER_POINTER (name)); | |
b2ca3702 MM |
3310 | *no_add_attrs = true; |
3311 | } | |
3312 | ||
3313 | return NULL_TREE; | |
3314 | } | |
3315 | ||
672a6f42 | 3316 | #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */ |
91e97eb8 | 3317 | \f |
3932261a MM |
3318 | /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask |
3319 | of the various TYPE_QUAL values. */ | |
c6a1db6c | 3320 | |
3932261a | 3321 | static void |
46c5ad27 | 3322 | set_type_quals (tree type, int type_quals) |
3932261a MM |
3323 | { |
3324 | TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0; | |
3325 | TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0; | |
3326 | TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0; | |
3327 | } | |
c6a1db6c | 3328 | |
896c3aa3 JM |
3329 | /* Returns true iff cand is equivalent to base with type_quals. */ |
3330 | ||
3331 | bool | |
3332 | check_qualified_type (tree cand, tree base, int type_quals) | |
3333 | { | |
3334 | return (TYPE_QUALS (cand) == type_quals | |
3335 | && TYPE_NAME (cand) == TYPE_NAME (base) | |
3336 | /* Apparently this is needed for Objective-C. */ | |
3337 | && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base) | |
3338 | && attribute_list_equal (TYPE_ATTRIBUTES (cand), | |
3339 | TYPE_ATTRIBUTES (base))); | |
3340 | } | |
3341 | ||
5101b304 MM |
3342 | /* Return a version of the TYPE, qualified as indicated by the |
3343 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
3344 | return NULL_TREE. */ | |
c6a1db6c RS |
3345 | |
3346 | tree | |
46c5ad27 | 3347 | get_qualified_type (tree type, int type_quals) |
c6a1db6c | 3348 | { |
5101b304 | 3349 | tree t; |
dc478a5d | 3350 | |
896c3aa3 JM |
3351 | if (TYPE_QUALS (type) == type_quals) |
3352 | return type; | |
3353 | ||
e24fa534 JW |
3354 | /* Search the chain of variants to see if there is already one there just |
3355 | like the one we need to have. If so, use that existing one. We must | |
3356 | preserve the TYPE_NAME, since there is code that depends on this. */ | |
b217d7fe | 3357 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
896c3aa3 | 3358 | if (check_qualified_type (t, type, type_quals)) |
e24fa534 | 3359 | return t; |
c6a1db6c | 3360 | |
5101b304 MM |
3361 | return NULL_TREE; |
3362 | } | |
3363 | ||
3364 | /* Like get_qualified_type, but creates the type if it does not | |
3365 | exist. This function never returns NULL_TREE. */ | |
3366 | ||
3367 | tree | |
46c5ad27 | 3368 | build_qualified_type (tree type, int type_quals) |
5101b304 MM |
3369 | { |
3370 | tree t; | |
3371 | ||
3372 | /* See if we already have the appropriate qualified variant. */ | |
3373 | t = get_qualified_type (type, type_quals); | |
3374 | ||
3375 | /* If not, build it. */ | |
3376 | if (!t) | |
3377 | { | |
8dd16ecc | 3378 | t = build_variant_type_copy (type); |
5101b304 MM |
3379 | set_type_quals (t, type_quals); |
3380 | } | |
3381 | ||
c6a1db6c RS |
3382 | return t; |
3383 | } | |
b4ac57ab | 3384 | |
8dd16ecc NS |
3385 | /* Create a new distinct copy of TYPE. The new type is made its own |
3386 | MAIN_VARIANT. */ | |
b4ac57ab RS |
3387 | |
3388 | tree | |
8dd16ecc | 3389 | build_distinct_type_copy (tree type) |
b4ac57ab | 3390 | { |
8dd16ecc NS |
3391 | tree t = copy_node (type); |
3392 | ||
b4ac57ab RS |
3393 | TYPE_POINTER_TO (t) = 0; |
3394 | TYPE_REFERENCE_TO (t) = 0; | |
3395 | ||
8dd16ecc NS |
3396 | /* Make it its own variant. */ |
3397 | TYPE_MAIN_VARIANT (t) = t; | |
3398 | TYPE_NEXT_VARIANT (t) = 0; | |
3399 | ||
3400 | return t; | |
3401 | } | |
3402 | ||
3403 | /* Create a new variant of TYPE, equivalent but distinct. | |
3404 | This is so the caller can modify it. */ | |
3405 | ||
3406 | tree | |
3407 | build_variant_type_copy (tree type) | |
3408 | { | |
3409 | tree t, m = TYPE_MAIN_VARIANT (type); | |
3410 | ||
3411 | t = build_distinct_type_copy (type); | |
3412 | ||
3413 | /* Add the new type to the chain of variants of TYPE. */ | |
b4ac57ab RS |
3414 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m); |
3415 | TYPE_NEXT_VARIANT (m) = t; | |
8dd16ecc | 3416 | TYPE_MAIN_VARIANT (t) = m; |
b4ac57ab | 3417 | |
b4ac57ab RS |
3418 | return t; |
3419 | } | |
c6a1db6c RS |
3420 | \f |
3421 | /* Hashing of types so that we don't make duplicates. | |
3422 | The entry point is `type_hash_canon'. */ | |
3423 | ||
c6a1db6c RS |
3424 | /* Compute a hash code for a list of types (chain of TREE_LIST nodes |
3425 | with types in the TREE_VALUE slots), by adding the hash codes | |
3426 | of the individual types. */ | |
3427 | ||
05bccae2 | 3428 | unsigned int |
fd917e0d | 3429 | type_hash_list (tree list, hashval_t hashcode) |
c6a1db6c | 3430 | { |
b3694847 | 3431 | tree tail; |
d4b60170 | 3432 | |
fd917e0d JM |
3433 | for (tail = list; tail; tail = TREE_CHAIN (tail)) |
3434 | if (TREE_VALUE (tail) != error_mark_node) | |
3435 | hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)), | |
3436 | hashcode); | |
d4b60170 | 3437 | |
c6a1db6c RS |
3438 | return hashcode; |
3439 | } | |
3440 | ||
d88f311b ML |
3441 | /* These are the Hashtable callback functions. */ |
3442 | ||
eb34af89 | 3443 | /* Returns true iff the types are equivalent. */ |
d88f311b ML |
3444 | |
3445 | static int | |
46c5ad27 | 3446 | type_hash_eq (const void *va, const void *vb) |
d88f311b ML |
3447 | { |
3448 | const struct type_hash *a = va, *b = vb; | |
eb34af89 RK |
3449 | |
3450 | /* First test the things that are the same for all types. */ | |
3451 | if (a->hash != b->hash | |
3452 | || TREE_CODE (a->type) != TREE_CODE (b->type) | |
3453 | || TREE_TYPE (a->type) != TREE_TYPE (b->type) | |
3454 | || !attribute_list_equal (TYPE_ATTRIBUTES (a->type), | |
3455 | TYPE_ATTRIBUTES (b->type)) | |
3456 | || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type) | |
3457 | || TYPE_MODE (a->type) != TYPE_MODE (b->type)) | |
3458 | return 0; | |
3459 | ||
3460 | switch (TREE_CODE (a->type)) | |
3461 | { | |
3462 | case VOID_TYPE: | |
3463 | case COMPLEX_TYPE: | |
eb34af89 RK |
3464 | case POINTER_TYPE: |
3465 | case REFERENCE_TYPE: | |
3466 | return 1; | |
3467 | ||
d70b8c3a PB |
3468 | case VECTOR_TYPE: |
3469 | return TYPE_VECTOR_SUBPARTS (a->type) == TYPE_VECTOR_SUBPARTS (b->type); | |
3470 | ||
eb34af89 RK |
3471 | case ENUMERAL_TYPE: |
3472 | if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type) | |
3473 | && !(TYPE_VALUES (a->type) | |
3474 | && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST | |
3475 | && TYPE_VALUES (b->type) | |
3476 | && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST | |
3477 | && type_list_equal (TYPE_VALUES (a->type), | |
3478 | TYPE_VALUES (b->type)))) | |
3479 | return 0; | |
3480 | ||
3481 | /* ... fall through ... */ | |
3482 | ||
3483 | case INTEGER_TYPE: | |
3484 | case REAL_TYPE: | |
3485 | case BOOLEAN_TYPE: | |
3486 | case CHAR_TYPE: | |
3487 | return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type) | |
3488 | || tree_int_cst_equal (TYPE_MAX_VALUE (a->type), | |
3489 | TYPE_MAX_VALUE (b->type))) | |
3490 | && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type) | |
614ed70a | 3491 | || tree_int_cst_equal (TYPE_MIN_VALUE (a->type), |
eb34af89 RK |
3492 | TYPE_MIN_VALUE (b->type)))); |
3493 | ||
3494 | case OFFSET_TYPE: | |
3495 | return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type); | |
3496 | ||
3497 | case METHOD_TYPE: | |
3498 | return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type) | |
3499 | && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type) | |
3500 | || (TYPE_ARG_TYPES (a->type) | |
3501 | && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST | |
3502 | && TYPE_ARG_TYPES (b->type) | |
3503 | && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST | |
3504 | && type_list_equal (TYPE_ARG_TYPES (a->type), | |
3505 | TYPE_ARG_TYPES (b->type))))); | |
9f63daea | 3506 | |
eb34af89 | 3507 | case ARRAY_TYPE: |
eb34af89 RK |
3508 | return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type); |
3509 | ||
3510 | case RECORD_TYPE: | |
3511 | case UNION_TYPE: | |
3512 | case QUAL_UNION_TYPE: | |
3513 | return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type) | |
3514 | || (TYPE_FIELDS (a->type) | |
3515 | && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST | |
3516 | && TYPE_FIELDS (b->type) | |
3517 | && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST | |
3518 | && type_list_equal (TYPE_FIELDS (a->type), | |
3519 | TYPE_FIELDS (b->type)))); | |
3520 | ||
3521 | case FUNCTION_TYPE: | |
3522 | return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type) | |
3523 | || (TYPE_ARG_TYPES (a->type) | |
3524 | && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST | |
3525 | && TYPE_ARG_TYPES (b->type) | |
3526 | && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST | |
3527 | && type_list_equal (TYPE_ARG_TYPES (a->type), | |
3528 | TYPE_ARG_TYPES (b->type)))); | |
3529 | ||
3530 | default: | |
3531 | return 0; | |
3532 | } | |
d88f311b ML |
3533 | } |
3534 | ||
3535 | /* Return the cached hash value. */ | |
3536 | ||
fb7e6024 | 3537 | static hashval_t |
46c5ad27 | 3538 | type_hash_hash (const void *item) |
d88f311b | 3539 | { |
dc478a5d | 3540 | return ((const struct type_hash *) item)->hash; |
d88f311b ML |
3541 | } |
3542 | ||
c6a1db6c RS |
3543 | /* Look in the type hash table for a type isomorphic to TYPE. |
3544 | If one is found, return it. Otherwise return 0. */ | |
3545 | ||
3546 | tree | |
fd917e0d | 3547 | type_hash_lookup (hashval_t hashcode, tree type) |
c6a1db6c | 3548 | { |
d88f311b | 3549 | struct type_hash *h, in; |
da48638e AH |
3550 | |
3551 | /* The TYPE_ALIGN field of a type is set by layout_type(), so we | |
dc478a5d | 3552 | must call that routine before comparing TYPE_ALIGNs. */ |
da48638e AH |
3553 | layout_type (type); |
3554 | ||
d88f311b ML |
3555 | in.hash = hashcode; |
3556 | in.type = type; | |
d4b60170 | 3557 | |
d88f311b ML |
3558 | h = htab_find_with_hash (type_hash_table, &in, hashcode); |
3559 | if (h) | |
3560 | return h->type; | |
3561 | return NULL_TREE; | |
c6a1db6c RS |
3562 | } |
3563 | ||
3564 | /* Add an entry to the type-hash-table | |
3565 | for a type TYPE whose hash code is HASHCODE. */ | |
3566 | ||
3567 | void | |
fd917e0d | 3568 | type_hash_add (hashval_t hashcode, tree type) |
c6a1db6c | 3569 | { |
d88f311b ML |
3570 | struct type_hash *h; |
3571 | void **loc; | |
c6a1db6c | 3572 | |
703ad42b | 3573 | h = ggc_alloc (sizeof (struct type_hash)); |
d88f311b | 3574 | h->hash = hashcode; |
c6a1db6c | 3575 | h->type = type; |
f64bedbd | 3576 | loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT); |
dc478a5d | 3577 | *(struct type_hash **) loc = h; |
c6a1db6c RS |
3578 | } |
3579 | ||
3580 | /* Given TYPE, and HASHCODE its hash code, return the canonical | |
3581 | object for an identical type if one already exists. | |
7548281d | 3582 | Otherwise, return TYPE, and record it as the canonical object. |
c6a1db6c RS |
3583 | |
3584 | To use this function, first create a type of the sort you want. | |
3585 | Then compute its hash code from the fields of the type that | |
3586 | make it different from other similar types. | |
7548281d | 3587 | Then call this function and use the value. */ |
c6a1db6c RS |
3588 | |
3589 | tree | |
46c5ad27 | 3590 | type_hash_canon (unsigned int hashcode, tree type) |
c6a1db6c RS |
3591 | { |
3592 | tree t1; | |
3593 | ||
7548281d RK |
3594 | /* The hash table only contains main variants, so ensure that's what we're |
3595 | being passed. */ | |
1e128c5f | 3596 | gcc_assert (TYPE_MAIN_VARIANT (type) == type); |
7548281d RK |
3597 | |
3598 | if (!lang_hooks.types.hash_types) | |
c6a1db6c RS |
3599 | return type; |
3600 | ||
4c160717 RK |
3601 | /* See if the type is in the hash table already. If so, return it. |
3602 | Otherwise, add the type. */ | |
c6a1db6c RS |
3603 | t1 = type_hash_lookup (hashcode, type); |
3604 | if (t1 != 0) | |
3605 | { | |
c6a1db6c | 3606 | #ifdef GATHER_STATISTICS |
770ae6cc RK |
3607 | tree_node_counts[(int) t_kind]--; |
3608 | tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type); | |
c6a1db6c RS |
3609 | #endif |
3610 | return t1; | |
3611 | } | |
4c160717 RK |
3612 | else |
3613 | { | |
3614 | type_hash_add (hashcode, type); | |
3615 | return type; | |
3616 | } | |
c6a1db6c RS |
3617 | } |
3618 | ||
6abba055 RK |
3619 | /* See if the data pointed to by the type hash table is marked. We consider |
3620 | it marked if the type is marked or if a debug type number or symbol | |
3621 | table entry has been made for the type. This reduces the amount of | |
3622 | debugging output and eliminates that dependency of the debug output on | |
3623 | the number of garbage collections. */ | |
d88f311b ML |
3624 | |
3625 | static int | |
46c5ad27 | 3626 | type_hash_marked_p (const void *p) |
d88f311b | 3627 | { |
6abba055 RK |
3628 | tree type = ((struct type_hash *) p)->type; |
3629 | ||
3630 | return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type); | |
d88f311b ML |
3631 | } |
3632 | ||
d88f311b | 3633 | static void |
46c5ad27 | 3634 | print_type_hash_statistics (void) |
d88f311b | 3635 | { |
770ae6cc RK |
3636 | fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n", |
3637 | (long) htab_size (type_hash_table), | |
3638 | (long) htab_elements (type_hash_table), | |
d88f311b | 3639 | htab_collisions (type_hash_table)); |
87ff9c8e RH |
3640 | } |
3641 | ||
2a3c15b5 DE |
3642 | /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes |
3643 | with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots), | |
3644 | by adding the hash codes of the individual attributes. */ | |
3e3d7e77 | 3645 | |
05bccae2 | 3646 | unsigned int |
fd917e0d | 3647 | attribute_hash_list (tree list, hashval_t hashcode) |
3e3d7e77 | 3648 | { |
b3694847 | 3649 | tree tail; |
d4b60170 | 3650 | |
fd917e0d | 3651 | for (tail = list; tail; tail = TREE_CHAIN (tail)) |
2a3c15b5 | 3652 | /* ??? Do we want to add in TREE_VALUE too? */ |
fd917e0d JM |
3653 | hashcode = iterative_hash_object |
3654 | (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode); | |
2a3c15b5 | 3655 | return hashcode; |
3e3d7e77 RK |
3656 | } |
3657 | ||
91e97eb8 RK |
3658 | /* Given two lists of attributes, return true if list l2 is |
3659 | equivalent to l1. */ | |
3660 | ||
3661 | int | |
46c5ad27 | 3662 | attribute_list_equal (tree l1, tree l2) |
91e97eb8 | 3663 | { |
3b03c671 KH |
3664 | return attribute_list_contained (l1, l2) |
3665 | && attribute_list_contained (l2, l1); | |
91e97eb8 RK |
3666 | } |
3667 | ||
2a3c15b5 DE |
3668 | /* Given two lists of attributes, return true if list L2 is |
3669 | completely contained within L1. */ | |
3670 | /* ??? This would be faster if attribute names were stored in a canonicalized | |
3671 | form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method | |
3672 | must be used to show these elements are equivalent (which they are). */ | |
3673 | /* ??? It's not clear that attributes with arguments will always be handled | |
3674 | correctly. */ | |
91e97eb8 RK |
3675 | |
3676 | int | |
46c5ad27 | 3677 | attribute_list_contained (tree l1, tree l2) |
91e97eb8 | 3678 | { |
b3694847 | 3679 | tree t1, t2; |
91e97eb8 RK |
3680 | |
3681 | /* First check the obvious, maybe the lists are identical. */ | |
3682 | if (l1 == l2) | |
dc478a5d | 3683 | return 1; |
91e97eb8 | 3684 | |
2a3c15b5 | 3685 | /* Maybe the lists are similar. */ |
91e97eb8 | 3686 | for (t1 = l1, t2 = l2; |
d4b60170 | 3687 | t1 != 0 && t2 != 0 |
2a3c15b5 | 3688 | && TREE_PURPOSE (t1) == TREE_PURPOSE (t2) |
91e97eb8 RK |
3689 | && TREE_VALUE (t1) == TREE_VALUE (t2); |
3690 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)); | |
3691 | ||
3692 | /* Maybe the lists are equal. */ | |
3693 | if (t1 == 0 && t2 == 0) | |
a01da83b | 3694 | return 1; |
91e97eb8 | 3695 | |
d4b60170 | 3696 | for (; t2 != 0; t2 = TREE_CHAIN (t2)) |
2a3c15b5 | 3697 | { |
91d231cb JM |
3698 | tree attr; |
3699 | for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1); | |
3700 | attr != NULL_TREE; | |
3701 | attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), | |
3702 | TREE_CHAIN (attr))) | |
3703 | { | |
3704 | if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1) | |
3705 | break; | |
3706 | } | |
2a3c15b5 | 3707 | |
d4b60170 | 3708 | if (attr == 0) |
91e97eb8 | 3709 | return 0; |
d4b60170 | 3710 | |
2a3c15b5 DE |
3711 | if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1) |
3712 | return 0; | |
3713 | } | |
3e3d7e77 | 3714 | |
91e97eb8 RK |
3715 | return 1; |
3716 | } | |
3717 | ||
c6a1db6c RS |
3718 | /* Given two lists of types |
3719 | (chains of TREE_LIST nodes with types in the TREE_VALUE slots) | |
3720 | return 1 if the lists contain the same types in the same order. | |
3721 | Also, the TREE_PURPOSEs must match. */ | |
3722 | ||
3723 | int | |
46c5ad27 | 3724 | type_list_equal (tree l1, tree l2) |
c6a1db6c | 3725 | { |
b3694847 | 3726 | tree t1, t2; |
364e1f1c | 3727 | |
c6a1db6c | 3728 | for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) |
364e1f1c RK |
3729 | if (TREE_VALUE (t1) != TREE_VALUE (t2) |
3730 | || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2) | |
bbda4250 JM |
3731 | && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)) |
3732 | && (TREE_TYPE (TREE_PURPOSE (t1)) | |
3733 | == TREE_TYPE (TREE_PURPOSE (t2)))))) | |
364e1f1c | 3734 | return 0; |
c6a1db6c RS |
3735 | |
3736 | return t1 == t2; | |
3737 | } | |
3738 | ||
f5d6a24c MM |
3739 | /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE |
3740 | given by TYPE. If the argument list accepts variable arguments, | |
3741 | then this function counts only the ordinary arguments. */ | |
3742 | ||
3743 | int | |
46c5ad27 | 3744 | type_num_arguments (tree type) |
f5d6a24c MM |
3745 | { |
3746 | int i = 0; | |
3747 | tree t; | |
3748 | ||
3749 | for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t)) | |
3750 | /* If the function does not take a variable number of arguments, | |
3751 | the last element in the list will have type `void'. */ | |
3752 | if (VOID_TYPE_P (TREE_VALUE (t))) | |
3753 | break; | |
3754 | else | |
3755 | ++i; | |
3756 | ||
3757 | return i; | |
3758 | } | |
3759 | ||
c6a1db6c RS |
3760 | /* Nonzero if integer constants T1 and T2 |
3761 | represent the same constant value. */ | |
3762 | ||
3763 | int | |
46c5ad27 | 3764 | tree_int_cst_equal (tree t1, tree t2) |
c6a1db6c RS |
3765 | { |
3766 | if (t1 == t2) | |
3767 | return 1; | |
d4b60170 | 3768 | |
c6a1db6c RS |
3769 | if (t1 == 0 || t2 == 0) |
3770 | return 0; | |
d4b60170 | 3771 | |
c6a1db6c RS |
3772 | if (TREE_CODE (t1) == INTEGER_CST |
3773 | && TREE_CODE (t2) == INTEGER_CST | |
3774 | && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
3775 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)) | |
3776 | return 1; | |
d4b60170 | 3777 | |
c6a1db6c RS |
3778 | return 0; |
3779 | } | |
3780 | ||
3781 | /* Nonzero if integer constants T1 and T2 represent values that satisfy <. | |
3782 | The precise way of comparison depends on their data type. */ | |
3783 | ||
3784 | int | |
46c5ad27 | 3785 | tree_int_cst_lt (tree t1, tree t2) |
c6a1db6c RS |
3786 | { |
3787 | if (t1 == t2) | |
3788 | return 0; | |
3789 | ||
8df83eae | 3790 | if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2))) |
b13ab42c AO |
3791 | { |
3792 | int t1_sgn = tree_int_cst_sgn (t1); | |
3793 | int t2_sgn = tree_int_cst_sgn (t2); | |
3794 | ||
3795 | if (t1_sgn < t2_sgn) | |
3796 | return 1; | |
3797 | else if (t1_sgn > t2_sgn) | |
3798 | return 0; | |
3799 | /* Otherwise, both are non-negative, so we compare them as | |
3800 | unsigned just in case one of them would overflow a signed | |
3801 | type. */ | |
3802 | } | |
8df83eae | 3803 | else if (!TYPE_UNSIGNED (TREE_TYPE (t1))) |
c6a1db6c | 3804 | return INT_CST_LT (t1, t2); |
d4b60170 | 3805 | |
c6a1db6c RS |
3806 | return INT_CST_LT_UNSIGNED (t1, t2); |
3807 | } | |
3808 | ||
56cb9733 MM |
3809 | /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */ |
3810 | ||
3811 | int | |
46c5ad27 | 3812 | tree_int_cst_compare (tree t1, tree t2) |
56cb9733 MM |
3813 | { |
3814 | if (tree_int_cst_lt (t1, t2)) | |
3815 | return -1; | |
3816 | else if (tree_int_cst_lt (t2, t1)) | |
3817 | return 1; | |
3b03c671 | 3818 | else |
56cb9733 MM |
3819 | return 0; |
3820 | } | |
3821 | ||
4636c87e JJ |
3822 | /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on |
3823 | the host. If POS is zero, the value can be represented in a single | |
3824 | HOST_WIDE_INT. If POS is nonzero, the value must be positive and can | |
3825 | be represented in a single unsigned HOST_WIDE_INT. */ | |
665f2503 RK |
3826 | |
3827 | int | |
46c5ad27 | 3828 | host_integerp (tree t, int pos) |
665f2503 RK |
3829 | { |
3830 | return (TREE_CODE (t) == INTEGER_CST | |
3831 | && ! TREE_OVERFLOW (t) | |
3832 | && ((TREE_INT_CST_HIGH (t) == 0 | |
3833 | && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0) | |
3834 | || (! pos && TREE_INT_CST_HIGH (t) == -1 | |
4636c87e | 3835 | && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0 |
8df83eae | 3836 | && !TYPE_UNSIGNED (TREE_TYPE (t))) |
4636c87e | 3837 | || (pos && TREE_INT_CST_HIGH (t) == 0))); |
665f2503 RK |
3838 | } |
3839 | ||
3840 | /* Return the HOST_WIDE_INT least significant bits of T if it is an | |
3841 | INTEGER_CST and there is no overflow. POS is nonzero if the result must | |
3842 | be positive. Abort if we cannot satisfy the above conditions. */ | |
3843 | ||
3844 | HOST_WIDE_INT | |
46c5ad27 | 3845 | tree_low_cst (tree t, int pos) |
665f2503 | 3846 | { |
1e128c5f GB |
3847 | gcc_assert (host_integerp (t, pos)); |
3848 | return TREE_INT_CST_LOW (t); | |
dc478a5d | 3849 | } |
665f2503 | 3850 | |
4694840a OH |
3851 | /* Return the most significant bit of the integer constant T. */ |
3852 | ||
3853 | int | |
46c5ad27 | 3854 | tree_int_cst_msb (tree t) |
4694840a OH |
3855 | { |
3856 | int prec; | |
3857 | HOST_WIDE_INT h; | |
3858 | unsigned HOST_WIDE_INT l; | |
3859 | ||
3860 | /* Note that using TYPE_PRECISION here is wrong. We care about the | |
3861 | actual bits, not the (arbitrary) range of the type. */ | |
3862 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1; | |
3863 | rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec, | |
3864 | 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0); | |
3865 | return (l & 1) == 1; | |
3866 | } | |
3867 | ||
6d9cb074 RK |
3868 | /* Return an indication of the sign of the integer constant T. |
3869 | The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0. | |
3870 | Note that -1 will never be returned it T's type is unsigned. */ | |
3871 | ||
3872 | int | |
46c5ad27 | 3873 | tree_int_cst_sgn (tree t) |
6d9cb074 RK |
3874 | { |
3875 | if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0) | |
3876 | return 0; | |
8df83eae | 3877 | else if (TYPE_UNSIGNED (TREE_TYPE (t))) |
6d9cb074 RK |
3878 | return 1; |
3879 | else if (TREE_INT_CST_HIGH (t) < 0) | |
3880 | return -1; | |
3881 | else | |
3882 | return 1; | |
3883 | } | |
3884 | ||
364e1f1c RK |
3885 | /* Compare two constructor-element-type constants. Return 1 if the lists |
3886 | are known to be equal; otherwise return 0. */ | |
3887 | ||
c6a1db6c | 3888 | int |
46c5ad27 | 3889 | simple_cst_list_equal (tree l1, tree l2) |
c6a1db6c RS |
3890 | { |
3891 | while (l1 != NULL_TREE && l2 != NULL_TREE) | |
3892 | { | |
364e1f1c | 3893 | if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1) |
c6a1db6c | 3894 | return 0; |
364e1f1c | 3895 | |
c6a1db6c RS |
3896 | l1 = TREE_CHAIN (l1); |
3897 | l2 = TREE_CHAIN (l2); | |
3898 | } | |
364e1f1c | 3899 | |
d4b60170 | 3900 | return l1 == l2; |
c6a1db6c RS |
3901 | } |
3902 | ||
3903 | /* Return truthvalue of whether T1 is the same tree structure as T2. | |
3904 | Return 1 if they are the same. | |
3905 | Return 0 if they are understandably different. | |
3906 | Return -1 if either contains tree structure not understood by | |
3907 | this function. */ | |
3908 | ||
3909 | int | |
46c5ad27 | 3910 | simple_cst_equal (tree t1, tree t2) |
c6a1db6c | 3911 | { |
b3694847 | 3912 | enum tree_code code1, code2; |
c6a1db6c | 3913 | int cmp; |
d4b60170 | 3914 | int i; |
c6a1db6c RS |
3915 | |
3916 | if (t1 == t2) | |
3917 | return 1; | |
3918 | if (t1 == 0 || t2 == 0) | |
3919 | return 0; | |
3920 | ||
3921 | code1 = TREE_CODE (t1); | |
3922 | code2 = TREE_CODE (t2); | |
3923 | ||
3924 | if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR) | |
af79bb86 JM |
3925 | { |
3926 | if (code2 == NOP_EXPR || code2 == CONVERT_EXPR | |
3927 | || code2 == NON_LVALUE_EXPR) | |
3928 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3929 | else | |
3930 | return simple_cst_equal (TREE_OPERAND (t1, 0), t2); | |
3931 | } | |
d4b60170 | 3932 | |
c6a1db6c RS |
3933 | else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR |
3934 | || code2 == NON_LVALUE_EXPR) | |
3935 | return simple_cst_equal (t1, TREE_OPERAND (t2, 0)); | |
3936 | ||
3937 | if (code1 != code2) | |
3938 | return 0; | |
3939 | ||
3940 | switch (code1) | |
3941 | { | |
3942 | case INTEGER_CST: | |
d4b60170 RK |
3943 | return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) |
3944 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)); | |
c6a1db6c RS |
3945 | |
3946 | case REAL_CST: | |
41c9120b | 3947 | return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); |
c6a1db6c RS |
3948 | |
3949 | case STRING_CST: | |
d4b60170 | 3950 | return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) |
da61dec9 | 3951 | && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), |
d4b60170 | 3952 | TREE_STRING_LENGTH (t1))); |
c6a1db6c RS |
3953 | |
3954 | case CONSTRUCTOR: | |
9f63daea | 3955 | return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1), |
6de9cd9a | 3956 | CONSTRUCTOR_ELTS (t2)); |
c6a1db6c RS |
3957 | |
3958 | case SAVE_EXPR: | |
3959 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3960 | ||
3961 | case CALL_EXPR: | |
3962 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3963 | if (cmp <= 0) | |
3964 | return cmp; | |
d4b60170 RK |
3965 | return |
3966 | simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); | |
c6a1db6c RS |
3967 | |
3968 | case TARGET_EXPR: | |
3969 | /* Special case: if either target is an unallocated VAR_DECL, | |
3970 | it means that it's going to be unified with whatever the | |
3971 | TARGET_EXPR is really supposed to initialize, so treat it | |
3972 | as being equivalent to anything. */ | |
3973 | if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL | |
3974 | && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE | |
19e7881c | 3975 | && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0))) |
c6a1db6c RS |
3976 | || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL |
3977 | && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE | |
19e7881c | 3978 | && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0)))) |
c6a1db6c RS |
3979 | cmp = 1; |
3980 | else | |
3981 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
d4b60170 | 3982 | |
c6a1db6c RS |
3983 | if (cmp <= 0) |
3984 | return cmp; | |
d4b60170 | 3985 | |
c6a1db6c RS |
3986 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
3987 | ||
3988 | case WITH_CLEANUP_EXPR: | |
3989 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3990 | if (cmp <= 0) | |
3991 | return cmp; | |
d4b60170 | 3992 | |
6ad7895a | 3993 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1)); |
c6a1db6c RS |
3994 | |
3995 | case COMPONENT_REF: | |
3996 | if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1)) | |
3997 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
d4b60170 | 3998 | |
c6a1db6c RS |
3999 | return 0; |
4000 | ||
c6a1db6c RS |
4001 | case VAR_DECL: |
4002 | case PARM_DECL: | |
4003 | case CONST_DECL: | |
4004 | case FUNCTION_DECL: | |
4005 | return 0; | |
dc478a5d | 4006 | |
e9a25f70 JL |
4007 | default: |
4008 | break; | |
86aed40b | 4009 | } |
c6a1db6c | 4010 | |
8ae49a28 RK |
4011 | /* This general rule works for most tree codes. All exceptions should be |
4012 | handled above. If this is a language-specific tree code, we can't | |
4013 | trust what might be in the operand, so say we don't know | |
4014 | the situation. */ | |
0a6969ad | 4015 | if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE) |
8ae49a28 | 4016 | return -1; |
c6a1db6c | 4017 | |
86aed40b RS |
4018 | switch (TREE_CODE_CLASS (code1)) |
4019 | { | |
6615c446 JO |
4020 | case tcc_unary: |
4021 | case tcc_binary: | |
4022 | case tcc_comparison: | |
4023 | case tcc_expression: | |
4024 | case tcc_reference: | |
4025 | case tcc_statement: | |
86aed40b | 4026 | cmp = 1; |
8d5e6e25 | 4027 | for (i = 0; i < TREE_CODE_LENGTH (code1); i++) |
86aed40b RS |
4028 | { |
4029 | cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)); | |
4030 | if (cmp <= 0) | |
4031 | return cmp; | |
4032 | } | |
d4b60170 | 4033 | |
86aed40b | 4034 | return cmp; |
86aed40b | 4035 | |
e9a25f70 JL |
4036 | default: |
4037 | return -1; | |
4038 | } | |
c6a1db6c | 4039 | } |
05bccae2 RK |
4040 | |
4041 | /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value. | |
4042 | Return -1, 0, or 1 if the value of T is less than, equal to, or greater | |
4043 | than U, respectively. */ | |
4044 | ||
4045 | int | |
46c5ad27 | 4046 | compare_tree_int (tree t, unsigned HOST_WIDE_INT u) |
05bccae2 RK |
4047 | { |
4048 | if (tree_int_cst_sgn (t) < 0) | |
4049 | return -1; | |
4050 | else if (TREE_INT_CST_HIGH (t) != 0) | |
4051 | return 1; | |
4052 | else if (TREE_INT_CST_LOW (t) == u) | |
4053 | return 0; | |
4054 | else if (TREE_INT_CST_LOW (t) < u) | |
4055 | return -1; | |
4056 | else | |
4057 | return 1; | |
4058 | } | |
03307888 | 4059 | |
3168cb99 JL |
4060 | /* Return true if CODE represents an associative tree code. Otherwise |
4061 | return false. */ | |
4062 | bool | |
4063 | associative_tree_code (enum tree_code code) | |
4064 | { | |
4065 | switch (code) | |
4066 | { | |
4067 | case BIT_IOR_EXPR: | |
4068 | case BIT_AND_EXPR: | |
4069 | case BIT_XOR_EXPR: | |
4070 | case PLUS_EXPR: | |
3168cb99 | 4071 | case MULT_EXPR: |
3168cb99 JL |
4072 | case MIN_EXPR: |
4073 | case MAX_EXPR: | |
4074 | return true; | |
4075 | ||
4076 | default: | |
4077 | break; | |
4078 | } | |
4079 | return false; | |
4080 | } | |
4081 | ||
1f838355 | 4082 | /* Return true if CODE represents a commutative tree code. Otherwise |
3168cb99 JL |
4083 | return false. */ |
4084 | bool | |
4085 | commutative_tree_code (enum tree_code code) | |
4086 | { | |
4087 | switch (code) | |
4088 | { | |
4089 | case PLUS_EXPR: | |
4090 | case MULT_EXPR: | |
4091 | case MIN_EXPR: | |
4092 | case MAX_EXPR: | |
4093 | case BIT_IOR_EXPR: | |
4094 | case BIT_XOR_EXPR: | |
4095 | case BIT_AND_EXPR: | |
4096 | case NE_EXPR: | |
4097 | case EQ_EXPR: | |
54d581a2 RS |
4098 | case UNORDERED_EXPR: |
4099 | case ORDERED_EXPR: | |
4100 | case UNEQ_EXPR: | |
4101 | case LTGT_EXPR: | |
4102 | case TRUTH_AND_EXPR: | |
4103 | case TRUTH_XOR_EXPR: | |
4104 | case TRUTH_OR_EXPR: | |
3168cb99 JL |
4105 | return true; |
4106 | ||
4107 | default: | |
4108 | break; | |
4109 | } | |
4110 | return false; | |
4111 | } | |
4112 | ||
03307888 JM |
4113 | /* Generate a hash value for an expression. This can be used iteratively |
4114 | by passing a previous result as the "val" argument. | |
4115 | ||
4116 | This function is intended to produce the same hash for expressions which | |
4117 | would compare equal using operand_equal_p. */ | |
4118 | ||
4119 | hashval_t | |
4120 | iterative_hash_expr (tree t, hashval_t val) | |
4121 | { | |
4122 | int i; | |
4123 | enum tree_code code; | |
4124 | char class; | |
4125 | ||
4126 | if (t == NULL_TREE) | |
caf29de7 | 4127 | return iterative_hash_pointer (t, val); |
03307888 JM |
4128 | |
4129 | code = TREE_CODE (t); | |
03307888 | 4130 | |
caf29de7 | 4131 | switch (code) |
03307888 | 4132 | { |
caf29de7 JH |
4133 | /* Alas, constants aren't shared, so we can't rely on pointer |
4134 | identity. */ | |
4135 | case INTEGER_CST: | |
4136 | val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val); | |
4137 | return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val); | |
4138 | case REAL_CST: | |
4139 | { | |
4140 | unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t)); | |
f29b9db9 | 4141 | |
caf29de7 JH |
4142 | return iterative_hash_hashval_t (val2, val); |
4143 | } | |
4144 | case STRING_CST: | |
4145 | return iterative_hash (TREE_STRING_POINTER (t), | |
4146 | TREE_STRING_LENGTH (t), val); | |
4147 | case COMPLEX_CST: | |
4148 | val = iterative_hash_expr (TREE_REALPART (t), val); | |
4149 | return iterative_hash_expr (TREE_IMAGPART (t), val); | |
4150 | case VECTOR_CST: | |
4151 | return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val); | |
4152 | ||
4153 | case SSA_NAME: | |
4154 | case VALUE_HANDLE: | |
4155 | /* we can just compare by pointer. */ | |
4156 | return iterative_hash_pointer (t, val); | |
4157 | ||
4158 | case TREE_LIST: | |
4159 | /* A list of expressions, for a CALL_EXPR or as the elements of a | |
4160 | VECTOR_CST. */ | |
4161 | for (; t; t = TREE_CHAIN (t)) | |
4162 | val = iterative_hash_expr (TREE_VALUE (t), val); | |
4163 | return val; | |
d070d4fd DJ |
4164 | case FUNCTION_DECL: |
4165 | /* When referring to a built-in FUNCTION_DECL, use the | |
4166 | __builtin__ form. Otherwise nodes that compare equal | |
4167 | according to operand_equal_p might get different | |
4168 | hash codes. */ | |
4169 | if (DECL_BUILT_IN (t)) | |
4170 | { | |
4171 | val = iterative_hash_pointer (built_in_decls[DECL_FUNCTION_CODE (t)], | |
4172 | val); | |
4173 | return val; | |
4174 | } | |
4175 | /* else FALL THROUGH */ | |
caf29de7 JH |
4176 | default: |
4177 | class = TREE_CODE_CLASS (code); | |
03307888 | 4178 | |
6615c446 | 4179 | if (class == tcc_declaration) |
6de9cd9a | 4180 | { |
d070d4fd | 4181 | /* Otherwise, we can just compare decls by pointer. */ |
caf29de7 | 4182 | val = iterative_hash_pointer (t, val); |
6de9cd9a | 4183 | } |
1a2caa7a | 4184 | else |
066f50a9 | 4185 | { |
1a2caa7a NS |
4186 | gcc_assert (IS_EXPR_CODE_CLASS (class)); |
4187 | ||
caf29de7 JH |
4188 | val = iterative_hash_object (code, val); |
4189 | ||
4190 | /* Don't hash the type, that can lead to having nodes which | |
4191 | compare equal according to operand_equal_p, but which | |
4192 | have different hash codes. */ | |
4193 | if (code == NOP_EXPR | |
4194 | || code == CONVERT_EXPR | |
4195 | || code == NON_LVALUE_EXPR) | |
4196 | { | |
4197 | /* Make sure to include signness in the hash computation. */ | |
4198 | val += TYPE_UNSIGNED (TREE_TYPE (t)); | |
4199 | val = iterative_hash_expr (TREE_OPERAND (t, 0), val); | |
4200 | } | |
4201 | ||
4202 | else if (commutative_tree_code (code)) | |
4203 | { | |
4204 | /* It's a commutative expression. We want to hash it the same | |
4205 | however it appears. We do this by first hashing both operands | |
4206 | and then rehashing based on the order of their independent | |
4207 | hashes. */ | |
4208 | hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0); | |
4209 | hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0); | |
4210 | hashval_t t; | |
4211 | ||
4212 | if (one > two) | |
4213 | t = one, one = two, two = t; | |
4214 | ||
4215 | val = iterative_hash_hashval_t (one, val); | |
4216 | val = iterative_hash_hashval_t (two, val); | |
4217 | } | |
4218 | else | |
54e4aedb | 4219 | for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; --i) |
caf29de7 | 4220 | val = iterative_hash_expr (TREE_OPERAND (t, i), val); |
066f50a9 | 4221 | } |
caf29de7 JH |
4222 | return val; |
4223 | break; | |
6de9cd9a | 4224 | } |
03307888 | 4225 | } |
c6a1db6c RS |
4226 | \f |
4227 | /* Constructors for pointer, array and function types. | |
4228 | (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are | |
4229 | constructed by language-dependent code, not here.) */ | |
4230 | ||
22421b79 RK |
4231 | /* Construct, lay out and return the type of pointers to TO_TYPE with |
4232 | mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can | |
4233 | reference all of memory. If such a type has already been | |
4234 | constructed, reuse it. */ | |
c6a1db6c RS |
4235 | |
4236 | tree | |
22421b79 RK |
4237 | build_pointer_type_for_mode (tree to_type, enum machine_mode mode, |
4238 | bool can_alias_all) | |
c6a1db6c | 4239 | { |
22421b79 RK |
4240 | tree t; |
4241 | ||
4242 | /* In some cases, languages will have things that aren't a POINTER_TYPE | |
4243 | (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO. | |
4244 | In that case, return that type without regard to the rest of our | |
4245 | operands. | |
4246 | ||
4247 | ??? This is a kludge, but consistent with the way this function has | |
4248 | always operated and there doesn't seem to be a good way to avoid this | |
4249 | at the moment. */ | |
4250 | if (TYPE_POINTER_TO (to_type) != 0 | |
4251 | && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE) | |
4252 | return TYPE_POINTER_TO (to_type); | |
c6a1db6c | 4253 | |
20475e78 RK |
4254 | /* First, if we already have a type for pointers to TO_TYPE and it's |
4255 | the proper mode, use it. */ | |
22421b79 RK |
4256 | for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t)) |
4257 | if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all) | |
4258 | return t; | |
c6a1db6c | 4259 | |
c6a1db6c | 4260 | t = make_node (POINTER_TYPE); |
d9cbc259 | 4261 | |
c6a1db6c | 4262 | TREE_TYPE (t) = to_type; |
4977bab6 | 4263 | TYPE_MODE (t) = mode; |
22421b79 RK |
4264 | TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all; |
4265 | TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type); | |
4266 | TYPE_POINTER_TO (to_type) = t; | |
c6a1db6c RS |
4267 | |
4268 | /* Lay out the type. This function has many callers that are concerned | |
20475e78 | 4269 | with expression-construction, and this simplifies them all. */ |
c6a1db6c RS |
4270 | layout_type (t); |
4271 | ||
c6a1db6c RS |
4272 | return t; |
4273 | } | |
4274 | ||
4977bab6 | 4275 | /* By default build pointers in ptr_mode. */ |
d4b60170 RK |
4276 | |
4277 | tree | |
46c5ad27 | 4278 | build_pointer_type (tree to_type) |
4977bab6 | 4279 | { |
22421b79 | 4280 | return build_pointer_type_for_mode (to_type, ptr_mode, false); |
4977bab6 ZW |
4281 | } |
4282 | ||
22421b79 | 4283 | /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */ |
4977bab6 ZW |
4284 | |
4285 | tree | |
22421b79 RK |
4286 | build_reference_type_for_mode (tree to_type, enum machine_mode mode, |
4287 | bool can_alias_all) | |
d4b60170 | 4288 | { |
22421b79 | 4289 | tree t; |
d4b60170 | 4290 | |
22421b79 RK |
4291 | /* In some cases, languages will have things that aren't a REFERENCE_TYPE |
4292 | (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO. | |
4293 | In that case, return that type without regard to the rest of our | |
4294 | operands. | |
4295 | ||
4296 | ??? This is a kludge, but consistent with the way this function has | |
4297 | always operated and there doesn't seem to be a good way to avoid this | |
4298 | at the moment. */ | |
4299 | if (TYPE_REFERENCE_TO (to_type) != 0 | |
4300 | && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE) | |
4301 | return TYPE_REFERENCE_TO (to_type); | |
4302 | ||
4303 | /* First, if we already have a type for pointers to TO_TYPE and it's | |
4304 | the proper mode, use it. */ | |
4305 | for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t)) | |
4306 | if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all) | |
4307 | return t; | |
d4b60170 | 4308 | |
d4b60170 | 4309 | t = make_node (REFERENCE_TYPE); |
d4b60170 RK |
4310 | |
4311 | TREE_TYPE (t) = to_type; | |
4977bab6 | 4312 | TYPE_MODE (t) = mode; |
22421b79 RK |
4313 | TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all; |
4314 | TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type); | |
d4b60170 RK |
4315 | TYPE_REFERENCE_TO (to_type) = t; |
4316 | ||
4317 | layout_type (t); | |
4318 | ||
4319 | return t; | |
4320 | } | |
4321 | ||
4977bab6 ZW |
4322 | |
4323 | /* Build the node for the type of references-to-TO_TYPE by default | |
4324 | in ptr_mode. */ | |
4325 | ||
4326 | tree | |
46c5ad27 | 4327 | build_reference_type (tree to_type) |
4977bab6 | 4328 | { |
22421b79 | 4329 | return build_reference_type_for_mode (to_type, ptr_mode, false); |
4977bab6 ZW |
4330 | } |
4331 | ||
12e1243e AH |
4332 | /* Build a type that is compatible with t but has no cv quals anywhere |
4333 | in its type, thus | |
4334 | ||
4335 | const char *const *const * -> char ***. */ | |
4336 | ||
4337 | tree | |
46c5ad27 | 4338 | build_type_no_quals (tree t) |
12e1243e AH |
4339 | { |
4340 | switch (TREE_CODE (t)) | |
4341 | { | |
4342 | case POINTER_TYPE: | |
7548281d | 4343 | return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)), |
22421b79 RK |
4344 | TYPE_MODE (t), |
4345 | TYPE_REF_CAN_ALIAS_ALL (t)); | |
12e1243e | 4346 | case REFERENCE_TYPE: |
7548281d RK |
4347 | return |
4348 | build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)), | |
22421b79 RK |
4349 | TYPE_MODE (t), |
4350 | TYPE_REF_CAN_ALIAS_ALL (t)); | |
12e1243e AH |
4351 | default: |
4352 | return TYPE_MAIN_VARIANT (t); | |
4353 | } | |
4354 | } | |
4355 | ||
c6a1db6c RS |
4356 | /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE. |
4357 | MAXVAL should be the maximum value in the domain | |
e9a25f70 JL |
4358 | (one less than the length of the array). |
4359 | ||
4360 | The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT. | |
4361 | We don't enforce this limit, that is up to caller (e.g. language front end). | |
4362 | The limit exists because the result is a signed type and we don't handle | |
4363 | sizes that use more than one HOST_WIDE_INT. */ | |
c6a1db6c RS |
4364 | |
4365 | tree | |
46c5ad27 | 4366 | build_index_type (tree maxval) |
c6a1db6c | 4367 | { |
b3694847 | 4368 | tree itype = make_node (INTEGER_TYPE); |
0fd17968 | 4369 | |
770ae6cc | 4370 | TREE_TYPE (itype) = sizetype; |
c6a1db6c | 4371 | TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype); |
967e627a | 4372 | TYPE_MIN_VALUE (itype) = size_zero_node; |
455f19cb | 4373 | TYPE_MAX_VALUE (itype) = fold_convert (sizetype, maxval); |
c6a1db6c RS |
4374 | TYPE_MODE (itype) = TYPE_MODE (sizetype); |
4375 | TYPE_SIZE (itype) = TYPE_SIZE (sizetype); | |
def9b006 | 4376 | TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype); |
c6a1db6c | 4377 | TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype); |
11cf4d18 | 4378 | TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype); |
05bccae2 | 4379 | |
967e627a | 4380 | if (host_integerp (maxval, 1)) |
770ae6cc | 4381 | return type_hash_canon (tree_low_cst (maxval, 1), itype); |
c6a1db6c RS |
4382 | else |
4383 | return itype; | |
4384 | } | |
4385 | ||
bc15d0ef JM |
4386 | /* Builds a signed or unsigned integer type of precision PRECISION. |
4387 | Used for C bitfields whose precision does not match that of | |
4388 | built-in target types. */ | |
4389 | tree | |
4390 | build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision, | |
4391 | int unsignedp) | |
4392 | { | |
4393 | tree itype = make_node (INTEGER_TYPE); | |
4394 | ||
4395 | TYPE_PRECISION (itype) = precision; | |
4396 | ||
4397 | if (unsignedp) | |
4398 | fixup_unsigned_type (itype); | |
4399 | else | |
4400 | fixup_signed_type (itype); | |
4401 | ||
4402 | if (host_integerp (TYPE_MAX_VALUE (itype), 1)) | |
4403 | return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype); | |
4404 | ||
4405 | return itype; | |
4406 | } | |
4407 | ||
742e43a2 | 4408 | /* Create a range of some discrete type TYPE (an INTEGER_TYPE, |
238a1856 | 4409 | ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with |
742e43a2 | 4410 | low bound LOWVAL and high bound HIGHVAL. |
0f41302f | 4411 | if TYPE==NULL_TREE, sizetype is used. */ |
c6a1db6c RS |
4412 | |
4413 | tree | |
46c5ad27 | 4414 | build_range_type (tree type, tree lowval, tree highval) |
c6a1db6c | 4415 | { |
b3694847 | 4416 | tree itype = make_node (INTEGER_TYPE); |
0fd17968 | 4417 | |
742e43a2 PB |
4418 | TREE_TYPE (itype) = type; |
4419 | if (type == NULL_TREE) | |
4420 | type = sizetype; | |
0fd17968 | 4421 | |
742e43a2 | 4422 | TYPE_MIN_VALUE (itype) = convert (type, lowval); |
e1ee5cdc | 4423 | TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL; |
0fd17968 RK |
4424 | |
4425 | TYPE_PRECISION (itype) = TYPE_PRECISION (type); | |
742e43a2 PB |
4426 | TYPE_MODE (itype) = TYPE_MODE (type); |
4427 | TYPE_SIZE (itype) = TYPE_SIZE (type); | |
28372f41 | 4428 | TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type); |
742e43a2 | 4429 | TYPE_ALIGN (itype) = TYPE_ALIGN (type); |
11cf4d18 | 4430 | TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type); |
e1ee5cdc | 4431 | |
770ae6cc RK |
4432 | if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0)) |
4433 | return type_hash_canon (tree_low_cst (highval, 0) | |
4434 | - tree_low_cst (lowval, 0), | |
4435 | itype); | |
c6a1db6c RS |
4436 | else |
4437 | return itype; | |
4438 | } | |
4439 | ||
742e43a2 | 4440 | /* Just like build_index_type, but takes lowval and highval instead |
0f41302f | 4441 | of just highval (maxval). */ |
742e43a2 PB |
4442 | |
4443 | tree | |
46c5ad27 | 4444 | build_index_2_type (tree lowval, tree highval) |
742e43a2 | 4445 | { |
770ae6cc | 4446 | return build_range_type (sizetype, lowval, highval); |
742e43a2 PB |
4447 | } |
4448 | ||
c6a1db6c RS |
4449 | /* Construct, lay out and return the type of arrays of elements with ELT_TYPE |
4450 | and number of elements specified by the range of values of INDEX_TYPE. | |
4451 | If such a type has already been constructed, reuse it. */ | |
4452 | ||
4453 | tree | |
46c5ad27 | 4454 | build_array_type (tree elt_type, tree index_type) |
c6a1db6c | 4455 | { |
b3694847 | 4456 | tree t; |
fd917e0d | 4457 | hashval_t hashcode = 0; |
c6a1db6c RS |
4458 | |
4459 | if (TREE_CODE (elt_type) == FUNCTION_TYPE) | |
4460 | { | |
4461 | error ("arrays of functions are not meaningful"); | |
4462 | elt_type = integer_type_node; | |
4463 | } | |
4464 | ||
c6a1db6c RS |
4465 | t = make_node (ARRAY_TYPE); |
4466 | TREE_TYPE (t) = elt_type; | |
4467 | TYPE_DOMAIN (t) = index_type; | |
4c7c0c70 | 4468 | |
c6a1db6c | 4469 | if (index_type == 0) |
4c7c0c70 AP |
4470 | { |
4471 | layout_type (t); | |
4472 | return t; | |
4473 | } | |
c6a1db6c | 4474 | |
fd917e0d JM |
4475 | hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode); |
4476 | hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode); | |
c6a1db6c RS |
4477 | t = type_hash_canon (hashcode, t); |
4478 | ||
d0f062fb | 4479 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
4480 | layout_type (t); |
4481 | return t; | |
4482 | } | |
4483 | ||
a260abc9 DE |
4484 | /* Return the TYPE of the elements comprising |
4485 | the innermost dimension of ARRAY. */ | |
4486 | ||
4487 | tree | |
46c5ad27 | 4488 | get_inner_array_type (tree array) |
a260abc9 DE |
4489 | { |
4490 | tree type = TREE_TYPE (array); | |
4491 | ||
4492 | while (TREE_CODE (type) == ARRAY_TYPE) | |
4493 | type = TREE_TYPE (type); | |
4494 | ||
4495 | return type; | |
4496 | } | |
4497 | ||
c6a1db6c RS |
4498 | /* Construct, lay out and return |
4499 | the type of functions returning type VALUE_TYPE | |
4500 | given arguments of types ARG_TYPES. | |
4501 | ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs | |
4502 | are data type nodes for the arguments of the function. | |
4503 | If such a type has already been constructed, reuse it. */ | |
4504 | ||
4505 | tree | |
46c5ad27 | 4506 | build_function_type (tree value_type, tree arg_types) |
c6a1db6c | 4507 | { |
b3694847 | 4508 | tree t; |
fd917e0d | 4509 | hashval_t hashcode = 0; |
c6a1db6c | 4510 | |
c0560b8b | 4511 | if (TREE_CODE (value_type) == FUNCTION_TYPE) |
c6a1db6c | 4512 | { |
c0560b8b | 4513 | error ("function return type cannot be function"); |
c6a1db6c RS |
4514 | value_type = integer_type_node; |
4515 | } | |
4516 | ||
4517 | /* Make a node of the sort we want. */ | |
4518 | t = make_node (FUNCTION_TYPE); | |
4519 | TREE_TYPE (t) = value_type; | |
4520 | TYPE_ARG_TYPES (t) = arg_types; | |
4521 | ||
7548281d | 4522 | /* If we already have such a type, use the old one. */ |
fd917e0d JM |
4523 | hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode); |
4524 | hashcode = type_hash_list (arg_types, hashcode); | |
c6a1db6c RS |
4525 | t = type_hash_canon (hashcode, t); |
4526 | ||
d0f062fb | 4527 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
4528 | layout_type (t); |
4529 | return t; | |
4530 | } | |
4531 | ||
a98ebe2e | 4532 | /* Build a function type. The RETURN_TYPE is the type returned by the |
97ebc06f AH |
4533 | function. If additional arguments are provided, they are |
4534 | additional argument types. The list of argument types must always | |
4535 | be terminated by NULL_TREE. */ | |
b4de2f7d AH |
4536 | |
4537 | tree | |
e34d07f2 | 4538 | build_function_type_list (tree return_type, ...) |
b4de2f7d AH |
4539 | { |
4540 | tree t, args, last; | |
e34d07f2 | 4541 | va_list p; |
b4de2f7d | 4542 | |
e34d07f2 | 4543 | va_start (p, return_type); |
b4de2f7d AH |
4544 | |
4545 | t = va_arg (p, tree); | |
4546 | for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree)) | |
4547 | args = tree_cons (NULL_TREE, t, args); | |
4548 | ||
f6254da4 ILT |
4549 | if (args == NULL_TREE) |
4550 | args = void_list_node; | |
4551 | else | |
4552 | { | |
4553 | last = args; | |
4554 | args = nreverse (args); | |
4555 | TREE_CHAIN (last) = void_list_node; | |
4556 | } | |
97ebc06f | 4557 | args = build_function_type (return_type, args); |
b4de2f7d | 4558 | |
e34d07f2 | 4559 | va_end (p); |
b4de2f7d AH |
4560 | return args; |
4561 | } | |
4562 | ||
1281fe11 MM |
4563 | /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE) |
4564 | and ARGTYPES (a TREE_LIST) are the return type and arguments types | |
4565 | for the method. An implicit additional parameter (of type | |
4566 | pointer-to-BASETYPE) is added to the ARGTYPES. */ | |
c6a1db6c RS |
4567 | |
4568 | tree | |
1281fe11 MM |
4569 | build_method_type_directly (tree basetype, |
4570 | tree rettype, | |
4571 | tree argtypes) | |
c6a1db6c | 4572 | { |
b3694847 | 4573 | tree t; |
1281fe11 | 4574 | tree ptype; |
fd917e0d | 4575 | int hashcode = 0; |
c6a1db6c RS |
4576 | |
4577 | /* Make a node of the sort we want. */ | |
4578 | t = make_node (METHOD_TYPE); | |
4579 | ||
c6a1db6c | 4580 | TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); |
1281fe11 MM |
4581 | TREE_TYPE (t) = rettype; |
4582 | ptype = build_pointer_type (basetype); | |
c6a1db6c RS |
4583 | |
4584 | /* The actual arglist for this function includes a "hidden" argument | |
4585 | which is "this". Put it into the list of argument types. */ | |
1281fe11 MM |
4586 | argtypes = tree_cons (NULL_TREE, ptype, argtypes); |
4587 | TYPE_ARG_TYPES (t) = argtypes; | |
c6a1db6c | 4588 | |
7548281d | 4589 | /* If we already have such a type, use the old one. */ |
fd917e0d JM |
4590 | hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode); |
4591 | hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode); | |
4592 | hashcode = type_hash_list (argtypes, hashcode); | |
c6a1db6c RS |
4593 | t = type_hash_canon (hashcode, t); |
4594 | ||
d0f062fb | 4595 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
4596 | layout_type (t); |
4597 | ||
4598 | return t; | |
4599 | } | |
4600 | ||
1281fe11 MM |
4601 | /* Construct, lay out and return the type of methods belonging to class |
4602 | BASETYPE and whose arguments and values are described by TYPE. | |
4603 | If that type exists already, reuse it. | |
4604 | TYPE must be a FUNCTION_TYPE node. */ | |
4605 | ||
4606 | tree | |
4607 | build_method_type (tree basetype, tree type) | |
4608 | { | |
1e128c5f | 4609 | gcc_assert (TREE_CODE (type) == FUNCTION_TYPE); |
1281fe11 | 4610 | |
9f63daea | 4611 | return build_method_type_directly (basetype, |
1281fe11 MM |
4612 | TREE_TYPE (type), |
4613 | TYPE_ARG_TYPES (type)); | |
4614 | } | |
4615 | ||
86aed40b RS |
4616 | /* Construct, lay out and return the type of offsets to a value |
4617 | of type TYPE, within an object of type BASETYPE. | |
4618 | If a suitable offset type exists already, reuse it. */ | |
c6a1db6c RS |
4619 | |
4620 | tree | |
46c5ad27 | 4621 | build_offset_type (tree basetype, tree type) |
c6a1db6c | 4622 | { |
b3694847 | 4623 | tree t; |
fd917e0d | 4624 | hashval_t hashcode = 0; |
c6a1db6c RS |
4625 | |
4626 | /* Make a node of the sort we want. */ | |
4627 | t = make_node (OFFSET_TYPE); | |
4628 | ||
4629 | TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
4630 | TREE_TYPE (t) = type; | |
4631 | ||
7548281d | 4632 | /* If we already have such a type, use the old one. */ |
fd917e0d JM |
4633 | hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode); |
4634 | hashcode = iterative_hash_object (TYPE_HASH (type), hashcode); | |
c6a1db6c RS |
4635 | t = type_hash_canon (hashcode, t); |
4636 | ||
d0f062fb | 4637 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
4638 | layout_type (t); |
4639 | ||
4640 | return t; | |
4641 | } | |
4642 | ||
4643 | /* Create a complex type whose components are COMPONENT_TYPE. */ | |
4644 | ||
4645 | tree | |
46c5ad27 | 4646 | build_complex_type (tree component_type) |
c6a1db6c | 4647 | { |
b3694847 | 4648 | tree t; |
fd917e0d | 4649 | hashval_t hashcode; |
c6a1db6c RS |
4650 | |
4651 | /* Make a node of the sort we want. */ | |
4652 | t = make_node (COMPLEX_TYPE); | |
4653 | ||
4654 | TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type); | |
c6a1db6c | 4655 | |
7548281d | 4656 | /* If we already have such a type, use the old one. */ |
fd917e0d | 4657 | hashcode = iterative_hash_object (TYPE_HASH (component_type), 0); |
c6a1db6c RS |
4658 | t = type_hash_canon (hashcode, t); |
4659 | ||
d0f062fb | 4660 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
4661 | layout_type (t); |
4662 | ||
405f63da MM |
4663 | /* If we are writing Dwarf2 output we need to create a name, |
4664 | since complex is a fundamental type. */ | |
7a0c8d71 DR |
4665 | if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG) |
4666 | && ! TYPE_NAME (t)) | |
405f63da | 4667 | { |
ec0ce6e2 | 4668 | const char *name; |
405f63da MM |
4669 | if (component_type == char_type_node) |
4670 | name = "complex char"; | |
4671 | else if (component_type == signed_char_type_node) | |
4672 | name = "complex signed char"; | |
4673 | else if (component_type == unsigned_char_type_node) | |
4674 | name = "complex unsigned char"; | |
4675 | else if (component_type == short_integer_type_node) | |
4676 | name = "complex short int"; | |
4677 | else if (component_type == short_unsigned_type_node) | |
4678 | name = "complex short unsigned int"; | |
4679 | else if (component_type == integer_type_node) | |
4680 | name = "complex int"; | |
4681 | else if (component_type == unsigned_type_node) | |
4682 | name = "complex unsigned int"; | |
4683 | else if (component_type == long_integer_type_node) | |
4684 | name = "complex long int"; | |
4685 | else if (component_type == long_unsigned_type_node) | |
4686 | name = "complex long unsigned int"; | |
4687 | else if (component_type == long_long_integer_type_node) | |
4688 | name = "complex long long int"; | |
4689 | else if (component_type == long_long_unsigned_type_node) | |
4690 | name = "complex long long unsigned int"; | |
4691 | else | |
d4b60170 | 4692 | name = 0; |
405f63da | 4693 | |
d4b60170 | 4694 | if (name != 0) |
405f63da MM |
4695 | TYPE_NAME (t) = get_identifier (name); |
4696 | } | |
4697 | ||
7548281d | 4698 | return build_qualified_type (t, TYPE_QUALS (component_type)); |
c6a1db6c RS |
4699 | } |
4700 | \f | |
4701 | /* Return OP, stripped of any conversions to wider types as much as is safe. | |
4702 | Converting the value back to OP's type makes a value equivalent to OP. | |
4703 | ||
4704 | If FOR_TYPE is nonzero, we return a value which, if converted to | |
4705 | type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE. | |
4706 | ||
4707 | If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the | |
4708 | narrowest type that can hold the value, even if they don't exactly fit. | |
4709 | Otherwise, bit-field references are changed to a narrower type | |
4710 | only if they can be fetched directly from memory in that type. | |
4711 | ||
4712 | OP must have integer, real or enumeral type. Pointers are not allowed! | |
4713 | ||
4714 | There are some cases where the obvious value we could return | |
dc478a5d | 4715 | would regenerate to OP if converted to OP's type, |
c6a1db6c RS |
4716 | but would not extend like OP to wider types. |
4717 | If FOR_TYPE indicates such extension is contemplated, we eschew such values. | |
4718 | For example, if OP is (unsigned short)(signed char)-1, | |
4719 | we avoid returning (signed char)-1 if FOR_TYPE is int, | |
4720 | even though extending that to an unsigned short would regenerate OP, | |
4721 | since the result of extending (signed char)-1 to (int) | |
4722 | is different from (int) OP. */ | |
4723 | ||
4724 | tree | |
46c5ad27 | 4725 | get_unwidened (tree op, tree for_type) |
c6a1db6c RS |
4726 | { |
4727 | /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */ | |
b3694847 SS |
4728 | tree type = TREE_TYPE (op); |
4729 | unsigned final_prec | |
c6a1db6c | 4730 | = TYPE_PRECISION (for_type != 0 ? for_type : type); |
b3694847 | 4731 | int uns |
c6a1db6c RS |
4732 | = (for_type != 0 && for_type != type |
4733 | && final_prec > TYPE_PRECISION (type) | |
8df83eae | 4734 | && TYPE_UNSIGNED (type)); |
b3694847 | 4735 | tree win = op; |
c6a1db6c | 4736 | |
362cb1bb RS |
4737 | while (TREE_CODE (op) == NOP_EXPR |
4738 | || TREE_CODE (op) == CONVERT_EXPR) | |
c6a1db6c | 4739 | { |
b3694847 | 4740 | int bitschange |
c6a1db6c RS |
4741 | = TYPE_PRECISION (TREE_TYPE (op)) |
4742 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))); | |
4743 | ||
4744 | /* Truncations are many-one so cannot be removed. | |
4745 | Unless we are later going to truncate down even farther. */ | |
4746 | if (bitschange < 0 | |
4747 | && final_prec > TYPE_PRECISION (TREE_TYPE (op))) | |
4748 | break; | |
4749 | ||
4750 | /* See what's inside this conversion. If we decide to strip it, | |
4751 | we will set WIN. */ | |
4752 | op = TREE_OPERAND (op, 0); | |
4753 | ||
4754 | /* If we have not stripped any zero-extensions (uns is 0), | |
4755 | we can strip any kind of extension. | |
4756 | If we have previously stripped a zero-extension, | |
4757 | only zero-extensions can safely be stripped. | |
4758 | Any extension can be stripped if the bits it would produce | |
4759 | are all going to be discarded later by truncating to FOR_TYPE. */ | |
4760 | ||
4761 | if (bitschange > 0) | |
4762 | { | |
4763 | if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op))) | |
4764 | win = op; | |
8df83eae | 4765 | /* TYPE_UNSIGNED says whether this is a zero-extension. |
c6a1db6c RS |
4766 | Let's avoid computing it if it does not affect WIN |
4767 | and if UNS will not be needed again. */ | |
362cb1bb RS |
4768 | if ((uns |
4769 | || TREE_CODE (op) == NOP_EXPR | |
4770 | || TREE_CODE (op) == CONVERT_EXPR) | |
8df83eae | 4771 | && TYPE_UNSIGNED (TREE_TYPE (op))) |
c6a1db6c RS |
4772 | { |
4773 | uns = 1; | |
4774 | win = op; | |
4775 | } | |
4776 | } | |
4777 | } | |
4778 | ||
4779 | if (TREE_CODE (op) == COMPONENT_REF | |
4780 | /* Since type_for_size always gives an integer type. */ | |
02a27e82 | 4781 | && TREE_CODE (type) != REAL_TYPE |
956d6950 | 4782 | /* Don't crash if field not laid out yet. */ |
3401c26b RK |
4783 | && DECL_SIZE (TREE_OPERAND (op, 1)) != 0 |
4784 | && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1)) | |
c6a1db6c | 4785 | { |
05bccae2 | 4786 | unsigned int innerprec |
3401c26b | 4787 | = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1); |
a150de29 | 4788 | int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1)) |
8df83eae | 4789 | || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1)))); |
ae2bcd98 | 4790 | type = lang_hooks.types.type_for_size (innerprec, unsignedp); |
c6a1db6c RS |
4791 | |
4792 | /* We can get this structure field in the narrowest type it fits in. | |
4793 | If FOR_TYPE is 0, do this only for a field that matches the | |
4794 | narrower type exactly and is aligned for it | |
4795 | The resulting extension to its nominal type (a fullword type) | |
4796 | must fit the same conditions as for other extensions. */ | |
4797 | ||
bb3f5384 RS |
4798 | if (type != 0 |
4799 | && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op))) | |
c6a1db6c | 4800 | && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))) |
bb3f5384 | 4801 | && (! uns || final_prec <= innerprec || unsignedp)) |
c6a1db6c | 4802 | { |
44de5aeb RK |
4803 | win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0), |
4804 | TREE_OPERAND (op, 1), NULL_TREE); | |
c6a1db6c RS |
4805 | TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op); |
4806 | TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op); | |
c6a1db6c RS |
4807 | } |
4808 | } | |
3401c26b | 4809 | |
c6a1db6c RS |
4810 | return win; |
4811 | } | |
4812 | \f | |
4813 | /* Return OP or a simpler expression for a narrower value | |
4814 | which can be sign-extended or zero-extended to give back OP. | |
4815 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
4816 | or 0 if the value should be sign-extended. */ | |
4817 | ||
4818 | tree | |
46c5ad27 | 4819 | get_narrower (tree op, int *unsignedp_ptr) |
c6a1db6c | 4820 | { |
b3694847 | 4821 | int uns = 0; |
c6a1db6c | 4822 | int first = 1; |
b3694847 | 4823 | tree win = op; |
beed8fc0 | 4824 | bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op)); |
c6a1db6c RS |
4825 | |
4826 | while (TREE_CODE (op) == NOP_EXPR) | |
4827 | { | |
b3694847 | 4828 | int bitschange |
d4b60170 RK |
4829 | = (TYPE_PRECISION (TREE_TYPE (op)) |
4830 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)))); | |
c6a1db6c RS |
4831 | |
4832 | /* Truncations are many-one so cannot be removed. */ | |
4833 | if (bitschange < 0) | |
4834 | break; | |
4835 | ||
4836 | /* See what's inside this conversion. If we decide to strip it, | |
4837 | we will set WIN. */ | |
c6a1db6c RS |
4838 | |
4839 | if (bitschange > 0) | |
4840 | { | |
0a71919d | 4841 | op = TREE_OPERAND (op, 0); |
c6a1db6c RS |
4842 | /* An extension: the outermost one can be stripped, |
4843 | but remember whether it is zero or sign extension. */ | |
4844 | if (first) | |
8df83eae | 4845 | uns = TYPE_UNSIGNED (TREE_TYPE (op)); |
c6a1db6c RS |
4846 | /* Otherwise, if a sign extension has been stripped, |
4847 | only sign extensions can now be stripped; | |
4848 | if a zero extension has been stripped, only zero-extensions. */ | |
8df83eae | 4849 | else if (uns != TYPE_UNSIGNED (TREE_TYPE (op))) |
c6a1db6c RS |
4850 | break; |
4851 | first = 0; | |
4852 | } | |
e02b9957 DE |
4853 | else /* bitschange == 0 */ |
4854 | { | |
4855 | /* A change in nominal type can always be stripped, but we must | |
4856 | preserve the unsignedness. */ | |
4857 | if (first) | |
8df83eae | 4858 | uns = TYPE_UNSIGNED (TREE_TYPE (op)); |
e02b9957 | 4859 | first = 0; |
0a71919d | 4860 | op = TREE_OPERAND (op, 0); |
beed8fc0 AO |
4861 | /* Keep trying to narrow, but don't assign op to win if it |
4862 | would turn an integral type into something else. */ | |
4863 | if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p) | |
4864 | continue; | |
e02b9957 | 4865 | } |
c6a1db6c RS |
4866 | |
4867 | win = op; | |
4868 | } | |
4869 | ||
4870 | if (TREE_CODE (op) == COMPONENT_REF | |
4871 | /* Since type_for_size always gives an integer type. */ | |
0fba7208 RK |
4872 | && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE |
4873 | /* Ensure field is laid out already. */ | |
44de5aeb RK |
4874 | && DECL_SIZE (TREE_OPERAND (op, 1)) != 0 |
4875 | && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1)) | |
c6a1db6c | 4876 | { |
0fba7208 RK |
4877 | unsigned HOST_WIDE_INT innerprec |
4878 | = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1); | |
a150de29 | 4879 | int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1)) |
8df83eae | 4880 | || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1)))); |
ae2bcd98 | 4881 | tree type = lang_hooks.types.type_for_size (innerprec, unsignedp); |
c6a1db6c RS |
4882 | |
4883 | /* We can get this structure field in a narrower type that fits it, | |
4884 | but the resulting extension to its nominal type (a fullword type) | |
4885 | must satisfy the same conditions as for other extensions. | |
4886 | ||
4887 | Do this only for fields that are aligned (not bit-fields), | |
4888 | because when bit-field insns will be used there is no | |
4889 | advantage in doing this. */ | |
4890 | ||
4891 | if (innerprec < TYPE_PRECISION (TREE_TYPE (op)) | |
4892 | && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)) | |
a150de29 | 4893 | && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1))) |
c6a1db6c RS |
4894 | && type != 0) |
4895 | { | |
4896 | if (first) | |
a150de29 | 4897 | uns = DECL_UNSIGNED (TREE_OPERAND (op, 1)); |
44de5aeb RK |
4898 | win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0), |
4899 | TREE_OPERAND (op, 1), NULL_TREE); | |
c6a1db6c RS |
4900 | TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op); |
4901 | TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op); | |
c6a1db6c RS |
4902 | } |
4903 | } | |
4904 | *unsignedp_ptr = uns; | |
4905 | return win; | |
4906 | } | |
4907 | \f | |
c6a1db6c RS |
4908 | /* Nonzero if integer constant C has a value that is permissible |
4909 | for type TYPE (an INTEGER_TYPE). */ | |
4910 | ||
4911 | int | |
46c5ad27 | 4912 | int_fits_type_p (tree c, tree type) |
c6a1db6c | 4913 | { |
4694840a OH |
4914 | tree type_low_bound = TYPE_MIN_VALUE (type); |
4915 | tree type_high_bound = TYPE_MAX_VALUE (type); | |
4634cf7e RS |
4916 | bool ok_for_low_bound, ok_for_high_bound; |
4917 | tree tmp; | |
4694840a OH |
4918 | |
4919 | /* If at least one bound of the type is a constant integer, we can check | |
4920 | ourselves and maybe make a decision. If no such decision is possible, but | |
4921 | this type is a subtype, try checking against that. Otherwise, use | |
4922 | force_fit_type, which checks against the precision. | |
4923 | ||
4924 | Compute the status for each possibly constant bound, and return if we see | |
4925 | one does not match. Use ok_for_xxx_bound for this purpose, assigning -1 | |
4926 | for "unknown if constant fits", 0 for "constant known *not* to fit" and 1 | |
4927 | for "constant known to fit". */ | |
4928 | ||
4694840a OH |
4929 | /* Check if C >= type_low_bound. */ |
4930 | if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST) | |
3401c26b | 4931 | { |
4634cf7e | 4932 | if (tree_int_cst_lt (c, type_low_bound)) |
4694840a | 4933 | return 0; |
4634cf7e | 4934 | ok_for_low_bound = true; |
3401c26b | 4935 | } |
4634cf7e RS |
4936 | else |
4937 | ok_for_low_bound = false; | |
4694840a OH |
4938 | |
4939 | /* Check if c <= type_high_bound. */ | |
4940 | if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST) | |
4941 | { | |
4634cf7e | 4942 | if (tree_int_cst_lt (type_high_bound, c)) |
4694840a | 4943 | return 0; |
4634cf7e | 4944 | ok_for_high_bound = true; |
4694840a | 4945 | } |
4634cf7e RS |
4946 | else |
4947 | ok_for_high_bound = false; | |
4694840a OH |
4948 | |
4949 | /* If the constant fits both bounds, the result is known. */ | |
4634cf7e | 4950 | if (ok_for_low_bound && ok_for_high_bound) |
4694840a OH |
4951 | return 1; |
4952 | ||
4634cf7e RS |
4953 | /* Perform some generic filtering which may allow making a decision |
4954 | even if the bounds are not constant. First, negative integers | |
4955 | never fit in unsigned types, */ | |
4956 | if (TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0) | |
4957 | return 0; | |
4958 | ||
4959 | /* Second, narrower types always fit in wider ones. */ | |
4960 | if (TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (c))) | |
4961 | return 1; | |
4962 | ||
4963 | /* Third, unsigned integers with top bit set never fit signed types. */ | |
4964 | if (! TYPE_UNSIGNED (type) | |
4965 | && TYPE_UNSIGNED (TREE_TYPE (c)) | |
4966 | && tree_int_cst_msb (c)) | |
4967 | return 0; | |
4968 | ||
4694840a OH |
4969 | /* If we haven't been able to decide at this point, there nothing more we |
4970 | can check ourselves here. Look at the base type if we have one. */ | |
4634cf7e | 4971 | if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0) |
a8765ae7 | 4972 | return int_fits_type_p (c, TREE_TYPE (type)); |
46c5ad27 | 4973 | |
4694840a | 4974 | /* Or to force_fit_type, if nothing else. */ |
4634cf7e RS |
4975 | tmp = copy_node (c); |
4976 | TREE_TYPE (tmp) = type; | |
4977 | tmp = force_fit_type (tmp, -1, false, false); | |
4978 | return TREE_INT_CST_HIGH (tmp) == TREE_INT_CST_HIGH (c) | |
4979 | && TREE_INT_CST_LOW (tmp) == TREE_INT_CST_LOW (c); | |
c6a1db6c RS |
4980 | } |
4981 | ||
5377d5ba RK |
4982 | /* Subprogram of following function. Called by walk_tree. |
4983 | ||
4984 | Return *TP if it is an automatic variable or parameter of the | |
4985 | function passed in as DATA. */ | |
4986 | ||
4987 | static tree | |
4988 | find_var_from_fn (tree *tp, int *walk_subtrees, void *data) | |
4989 | { | |
4990 | tree fn = (tree) data; | |
4991 | ||
4992 | if (TYPE_P (*tp)) | |
4993 | *walk_subtrees = 0; | |
4994 | ||
6615c446 JO |
4995 | else if (DECL_P (*tp) |
4996 | && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn)) | |
5377d5ba RK |
4997 | return *tp; |
4998 | ||
4999 | return NULL_TREE; | |
5000 | } | |
5001 | ||
8bcefb43 | 5002 | /* Returns true if T is, contains, or refers to a type with variable |
5377d5ba RK |
5003 | size. If FN is nonzero, only return true if a modifier of the type |
5004 | or position of FN is a variable or parameter inside FN. | |
5005 | ||
5006 | This concept is more general than that of C99 'variably modified types': | |
5007 | in C99, a struct type is never variably modified because a VLA may not | |
5008 | appear as a structure member. However, in GNU C code like: | |
46c5ad27 | 5009 | |
8bcefb43 ZW |
5010 | struct S { int i[f()]; }; |
5011 | ||
5012 | is valid, and other languages may define similar constructs. */ | |
5013 | ||
5014 | bool | |
5377d5ba | 5015 | variably_modified_type_p (tree type, tree fn) |
8bcefb43 | 5016 | { |
3c2a7a6a RH |
5017 | tree t; |
5018 | ||
5377d5ba RK |
5019 | /* Test if T is either variable (if FN is zero) or an expression containing |
5020 | a variable in FN. */ | |
5021 | #define RETURN_TRUE_IF_VAR(T) \ | |
5022 | do { tree _t = (T); \ | |
5023 | if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \ | |
5024 | && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \ | |
5025 | return true; } while (0) | |
5026 | ||
c246c65d JM |
5027 | if (type == error_mark_node) |
5028 | return false; | |
5029 | ||
46c5ad27 | 5030 | /* If TYPE itself has variable size, it is variably modified. |
8bcefb43 ZW |
5031 | |
5032 | We do not yet have a representation of the C99 '[*]' syntax. | |
5033 | When a representation is chosen, this function should be modified | |
5034 | to test for that case as well. */ | |
5377d5ba RK |
5035 | RETURN_TRUE_IF_VAR (TYPE_SIZE (type)); |
5036 | RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type)); | |
8bcefb43 | 5037 | |
3c2a7a6a RH |
5038 | switch (TREE_CODE (type)) |
5039 | { | |
5040 | case POINTER_TYPE: | |
5041 | case REFERENCE_TYPE: | |
5042 | case ARRAY_TYPE: | |
1c9766da | 5043 | case VECTOR_TYPE: |
5377d5ba | 5044 | if (variably_modified_type_p (TREE_TYPE (type), fn)) |
1c9766da RK |
5045 | return true; |
5046 | break; | |
46c5ad27 | 5047 | |
3c2a7a6a RH |
5048 | case FUNCTION_TYPE: |
5049 | case METHOD_TYPE: | |
5050 | /* If TYPE is a function type, it is variably modified if any of the | |
5051 | parameters or the return type are variably modified. */ | |
5377d5ba | 5052 | if (variably_modified_type_p (TREE_TYPE (type), fn)) |
1c9766da | 5053 | return true; |
8bcefb43 | 5054 | |
1c9766da RK |
5055 | for (t = TYPE_ARG_TYPES (type); |
5056 | t && t != void_list_node; | |
5057 | t = TREE_CHAIN (t)) | |
5377d5ba | 5058 | if (variably_modified_type_p (TREE_VALUE (t), fn)) |
3c2a7a6a | 5059 | return true; |
3c2a7a6a | 5060 | break; |
8bcefb43 | 5061 | |
3c2a7a6a | 5062 | case INTEGER_TYPE: |
1c9766da RK |
5063 | case REAL_TYPE: |
5064 | case ENUMERAL_TYPE: | |
5065 | case BOOLEAN_TYPE: | |
5066 | case CHAR_TYPE: | |
3c2a7a6a RH |
5067 | /* Scalar types are variably modified if their end points |
5068 | aren't constant. */ | |
5377d5ba RK |
5069 | RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type)); |
5070 | RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type)); | |
1c9766da RK |
5071 | break; |
5072 | ||
5073 | case RECORD_TYPE: | |
5074 | case UNION_TYPE: | |
5075 | case QUAL_UNION_TYPE: | |
5076 | /* We can't see if any of the field are variably-modified by the | |
5077 | definition we normally use, since that would produce infinite | |
5078 | recursion via pointers. */ | |
5079 | /* This is variably modified if some field's type is. */ | |
5080 | for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t)) | |
5081 | if (TREE_CODE (t) == FIELD_DECL) | |
5082 | { | |
5377d5ba RK |
5083 | RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t)); |
5084 | RETURN_TRUE_IF_VAR (DECL_SIZE (t)); | |
5085 | RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t)); | |
1c9766da | 5086 | |
5377d5ba RK |
5087 | if (TREE_CODE (type) == QUAL_UNION_TYPE) |
5088 | RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t)); | |
1c9766da RK |
5089 | } |
5090 | break; | |
3c2a7a6a RH |
5091 | |
5092 | default: | |
5093 | break; | |
8bcefb43 ZW |
5094 | } |
5095 | ||
5096 | /* The current language may have other cases to check, but in general, | |
5097 | all other types are not variably modified. */ | |
5377d5ba RK |
5098 | return lang_hooks.tree_inlining.var_mod_type_p (type, fn); |
5099 | ||
5100 | #undef RETURN_TRUE_IF_VAR | |
8bcefb43 ZW |
5101 | } |
5102 | ||
140b60b4 | 5103 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
77a02dba | 5104 | NULL_TREE if there is no containing scope. */ |
140b60b4 MM |
5105 | |
5106 | tree | |
46c5ad27 | 5107 | get_containing_scope (tree t) |
140b60b4 MM |
5108 | { |
5109 | return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t)); | |
5110 | } | |
5111 | ||
bfa30b22 | 5112 | /* Return the innermost context enclosing DECL that is |
c6a1db6c RS |
5113 | a FUNCTION_DECL, or zero if none. */ |
5114 | ||
5115 | tree | |
46c5ad27 | 5116 | decl_function_context (tree decl) |
c6a1db6c RS |
5117 | { |
5118 | tree context; | |
5119 | ||
bfa30b22 | 5120 | if (TREE_CODE (decl) == ERROR_MARK) |
c6a1db6c RS |
5121 | return 0; |
5122 | ||
6ff7fb95 JM |
5123 | /* C++ virtual functions use DECL_CONTEXT for the class of the vtable |
5124 | where we look up the function at runtime. Such functions always take | |
5125 | a first argument of type 'pointer to real context'. | |
5126 | ||
5127 | C++ should really be fixed to use DECL_CONTEXT for the real context, | |
5128 | and use something else for the "virtual context". */ | |
5129 | else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl)) | |
77a02dba RK |
5130 | context |
5131 | = TYPE_MAIN_VARIANT | |
5132 | (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl))))); | |
c6a1db6c | 5133 | else |
bfa30b22 | 5134 | context = DECL_CONTEXT (decl); |
c6a1db6c RS |
5135 | |
5136 | while (context && TREE_CODE (context) != FUNCTION_DECL) | |
5137 | { | |
140b60b4 | 5138 | if (TREE_CODE (context) == BLOCK) |
c6a1db6c | 5139 | context = BLOCK_SUPERCONTEXT (context); |
dc478a5d | 5140 | else |
140b60b4 | 5141 | context = get_containing_scope (context); |
c6a1db6c RS |
5142 | } |
5143 | ||
5144 | return context; | |
5145 | } | |
5146 | ||
bfa30b22 | 5147 | /* Return the innermost context enclosing DECL that is |
c0560b8b | 5148 | a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none. |
c6a1db6c RS |
5149 | TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */ |
5150 | ||
5151 | tree | |
46c5ad27 | 5152 | decl_type_context (tree decl) |
c6a1db6c | 5153 | { |
bfa30b22 | 5154 | tree context = DECL_CONTEXT (decl); |
c6a1db6c RS |
5155 | |
5156 | while (context) | |
d1bd0ded GK |
5157 | switch (TREE_CODE (context)) |
5158 | { | |
5159 | case NAMESPACE_DECL: | |
5160 | case TRANSLATION_UNIT_DECL: | |
41077ce4 | 5161 | return NULL_TREE; |
7efda054 | 5162 | |
d1bd0ded GK |
5163 | case RECORD_TYPE: |
5164 | case UNION_TYPE: | |
5165 | case QUAL_UNION_TYPE: | |
c6a1db6c | 5166 | return context; |
9f63daea | 5167 | |
d1bd0ded GK |
5168 | case TYPE_DECL: |
5169 | case FUNCTION_DECL: | |
c6a1db6c | 5170 | context = DECL_CONTEXT (context); |
d1bd0ded | 5171 | break; |
9f63daea | 5172 | |
d1bd0ded | 5173 | case BLOCK: |
c6a1db6c | 5174 | context = BLOCK_SUPERCONTEXT (context); |
d1bd0ded | 5175 | break; |
9f63daea | 5176 | |
d1bd0ded | 5177 | default: |
1e128c5f | 5178 | gcc_unreachable (); |
d1bd0ded GK |
5179 | } |
5180 | ||
c6a1db6c RS |
5181 | return NULL_TREE; |
5182 | } | |
5183 | ||
582db8e4 | 5184 | /* CALL is a CALL_EXPR. Return the declaration for the function |
dc478a5d | 5185 | called, or NULL_TREE if the called function cannot be |
582db8e4 MM |
5186 | determined. */ |
5187 | ||
5188 | tree | |
46c5ad27 | 5189 | get_callee_fndecl (tree call) |
582db8e4 MM |
5190 | { |
5191 | tree addr; | |
5192 | ||
5193 | /* It's invalid to call this function with anything but a | |
5194 | CALL_EXPR. */ | |
1e128c5f | 5195 | gcc_assert (TREE_CODE (call) == CALL_EXPR); |
582db8e4 MM |
5196 | |
5197 | /* The first operand to the CALL is the address of the function | |
5198 | called. */ | |
5199 | addr = TREE_OPERAND (call, 0); | |
5200 | ||
c083cf9a JM |
5201 | STRIP_NOPS (addr); |
5202 | ||
5203 | /* If this is a readonly function pointer, extract its initial value. */ | |
5204 | if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL | |
5205 | && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr) | |
5206 | && DECL_INITIAL (addr)) | |
5207 | addr = DECL_INITIAL (addr); | |
5208 | ||
582db8e4 MM |
5209 | /* If the address is just `&f' for some function `f', then we know |
5210 | that `f' is being called. */ | |
5211 | if (TREE_CODE (addr) == ADDR_EXPR | |
5212 | && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL) | |
a1a0fd4e | 5213 | return TREE_OPERAND (addr, 0); |
9f63daea | 5214 | |
83d865c5 AH |
5215 | /* We couldn't figure out what was being called. Maybe the front |
5216 | end has some idea. */ | |
ae2bcd98 | 5217 | return lang_hooks.lang_get_callee_fndecl (call); |
582db8e4 MM |
5218 | } |
5219 | ||
d1485032 JM |
5220 | /* Print debugging information about tree nodes generated during the compile, |
5221 | and any language-specific information. */ | |
5222 | ||
c6a1db6c | 5223 | void |
46c5ad27 | 5224 | dump_tree_statistics (void) |
c6a1db6c | 5225 | { |
5e9defae | 5226 | #ifdef GATHER_STATISTICS |
c6a1db6c RS |
5227 | int i; |
5228 | int total_nodes, total_bytes; | |
5e9defae | 5229 | #endif |
c6a1db6c RS |
5230 | |
5231 | fprintf (stderr, "\n??? tree nodes created\n\n"); | |
5232 | #ifdef GATHER_STATISTICS | |
adc4adcd GP |
5233 | fprintf (stderr, "Kind Nodes Bytes\n"); |
5234 | fprintf (stderr, "---------------------------------------\n"); | |
c6a1db6c RS |
5235 | total_nodes = total_bytes = 0; |
5236 | for (i = 0; i < (int) all_kinds; i++) | |
5237 | { | |
adc4adcd | 5238 | fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i], |
c6a1db6c RS |
5239 | tree_node_counts[i], tree_node_sizes[i]); |
5240 | total_nodes += tree_node_counts[i]; | |
5241 | total_bytes += tree_node_sizes[i]; | |
5242 | } | |
adc4adcd GP |
5243 | fprintf (stderr, "---------------------------------------\n"); |
5244 | fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes); | |
5245 | fprintf (stderr, "---------------------------------------\n"); | |
6de9cd9a DN |
5246 | ssanames_print_statistics (); |
5247 | phinodes_print_statistics (); | |
c6a1db6c RS |
5248 | #else |
5249 | fprintf (stderr, "(No per-node statistics)\n"); | |
5250 | #endif | |
d88f311b | 5251 | print_type_hash_statistics (); |
ae2bcd98 | 5252 | lang_hooks.print_statistics (); |
c6a1db6c | 5253 | } |
bb288278 | 5254 | \f |
2ce3c6c6 | 5255 | #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s" |
bb288278 | 5256 | |
2aab7ceb | 5257 | /* Generate a crc32 of a string. */ |
e2c31432 | 5258 | |
2aab7ceb NS |
5259 | unsigned |
5260 | crc32_string (unsigned chksum, const char *string) | |
e2c31432 | 5261 | { |
2aab7ceb NS |
5262 | do |
5263 | { | |
5264 | unsigned value = *string << 24; | |
5265 | unsigned ix; | |
9f63daea | 5266 | |
2aab7ceb NS |
5267 | for (ix = 8; ix--; value <<= 1) |
5268 | { | |
5269 | unsigned feedback; | |
9f63daea | 5270 | |
2aab7ceb NS |
5271 | feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0; |
5272 | chksum <<= 1; | |
5273 | chksum ^= feedback; | |
5274 | } | |
5275 | } | |
5276 | while (*string++); | |
5277 | return chksum; | |
e2c31432 JM |
5278 | } |
5279 | ||
881c6935 JM |
5280 | /* P is a string that will be used in a symbol. Mask out any characters |
5281 | that are not valid in that context. */ | |
5282 | ||
5283 | void | |
46c5ad27 | 5284 | clean_symbol_name (char *p) |
881c6935 JM |
5285 | { |
5286 | for (; *p; p++) | |
0df6c2c7 | 5287 | if (! (ISALNUM (*p) |
881c6935 JM |
5288 | #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */ |
5289 | || *p == '$' | |
5290 | #endif | |
5291 | #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */ | |
5292 | || *p == '.' | |
5293 | #endif | |
0df6c2c7 | 5294 | )) |
881c6935 JM |
5295 | *p = '_'; |
5296 | } | |
3b03c671 | 5297 | |
e2c31432 JM |
5298 | /* Generate a name for a function unique to this translation unit. |
5299 | TYPE is some string to identify the purpose of this function to the | |
5300 | linker or collect2. */ | |
bb288278 PB |
5301 | |
5302 | tree | |
46c5ad27 | 5303 | get_file_function_name_long (const char *type) |
bb288278 PB |
5304 | { |
5305 | char *buf; | |
3b304f5b ZW |
5306 | const char *p; |
5307 | char *q; | |
bb288278 PB |
5308 | |
5309 | if (first_global_object_name) | |
5310 | p = first_global_object_name; | |
bb288278 | 5311 | else |
e2c31432 JM |
5312 | { |
5313 | /* We don't have anything that we know to be unique to this translation | |
5314 | unit, so use what we do have and throw in some randomness. */ | |
2aab7ceb | 5315 | unsigned len; |
37b37199 KG |
5316 | const char *name = weak_global_object_name; |
5317 | const char *file = main_input_filename; | |
e2c31432 JM |
5318 | |
5319 | if (! name) | |
5320 | name = ""; | |
5321 | if (! file) | |
5322 | file = input_filename; | |
5323 | ||
2aab7ceb | 5324 | len = strlen (file); |
679c4092 | 5325 | q = alloca (9 * 2 + len + 1); |
2aab7ceb NS |
5326 | memcpy (q, file, len + 1); |
5327 | clean_symbol_name (q); | |
5328 | ||
2aab7ceb NS |
5329 | sprintf (q + len, "_%08X_%08X", crc32_string (0, name), |
5330 | crc32_string (0, flag_random_seed)); | |
e2c31432 | 5331 | |
3b304f5b | 5332 | p = q; |
e2c31432 | 5333 | } |
bb288278 | 5334 | |
703ad42b | 5335 | buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type)); |
bb288278 | 5336 | |
dc478a5d | 5337 | /* Set up the name of the file-level functions we may need. |
d4b60170 | 5338 | Use a global object (which is already required to be unique over |
bb288278 | 5339 | the program) rather than the file name (which imposes extra |
d4b60170 | 5340 | constraints). */ |
2ce3c6c6 | 5341 | sprintf (buf, FILE_FUNCTION_FORMAT, type, p); |
bb288278 | 5342 | |
bb288278 PB |
5343 | return get_identifier (buf); |
5344 | } | |
2ce3c6c6 JM |
5345 | |
5346 | /* If KIND=='I', return a suitable global initializer (constructor) name. | |
5347 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
5348 | ||
5349 | tree | |
46c5ad27 | 5350 | get_file_function_name (int kind) |
2ce3c6c6 JM |
5351 | { |
5352 | char p[2]; | |
d4b60170 | 5353 | |
2ce3c6c6 JM |
5354 | p[0] = kind; |
5355 | p[1] = 0; | |
5356 | ||
5357 | return get_file_function_name_long (p); | |
5358 | } | |
bca949e2 | 5359 | \f |
9faa82d8 | 5360 | /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node. |
bca949e2 PB |
5361 | The result is placed in BUFFER (which has length BIT_SIZE), |
5362 | with one bit in each char ('\000' or '\001'). | |
5363 | ||
5364 | If the constructor is constant, NULL_TREE is returned. | |
0f41302f | 5365 | Otherwise, a TREE_LIST of the non-constant elements is emitted. */ |
bca949e2 PB |
5366 | |
5367 | tree | |
46c5ad27 | 5368 | get_set_constructor_bits (tree init, char *buffer, int bit_size) |
bca949e2 PB |
5369 | { |
5370 | int i; | |
5371 | tree vals; | |
5372 | HOST_WIDE_INT domain_min | |
5538d8a0 | 5373 | = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0); |
bca949e2 | 5374 | tree non_const_bits = NULL_TREE; |
5538d8a0 | 5375 | |
bca949e2 PB |
5376 | for (i = 0; i < bit_size; i++) |
5377 | buffer[i] = 0; | |
5378 | ||
dc478a5d | 5379 | for (vals = TREE_OPERAND (init, 1); |
bca949e2 PB |
5380 | vals != NULL_TREE; vals = TREE_CHAIN (vals)) |
5381 | { | |
5538d8a0 | 5382 | if (!host_integerp (TREE_VALUE (vals), 0) |
bca949e2 | 5383 | || (TREE_PURPOSE (vals) != NULL_TREE |
5538d8a0 | 5384 | && !host_integerp (TREE_PURPOSE (vals), 0))) |
db3cf6fb MS |
5385 | non_const_bits |
5386 | = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits); | |
bca949e2 PB |
5387 | else if (TREE_PURPOSE (vals) != NULL_TREE) |
5388 | { | |
0f41302f | 5389 | /* Set a range of bits to ones. */ |
bca949e2 | 5390 | HOST_WIDE_INT lo_index |
5538d8a0 | 5391 | = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min; |
bca949e2 | 5392 | HOST_WIDE_INT hi_index |
5538d8a0 | 5393 | = tree_low_cst (TREE_VALUE (vals), 0) - domain_min; |
05bccae2 | 5394 | |
1e128c5f GB |
5395 | gcc_assert (lo_index >= 0); |
5396 | gcc_assert (lo_index < bit_size); | |
5397 | gcc_assert (hi_index >= 0); | |
5398 | gcc_assert (hi_index < bit_size); | |
dc478a5d | 5399 | for (; lo_index <= hi_index; lo_index++) |
bca949e2 PB |
5400 | buffer[lo_index] = 1; |
5401 | } | |
5402 | else | |
5403 | { | |
0f41302f | 5404 | /* Set a single bit to one. */ |
bca949e2 | 5405 | HOST_WIDE_INT index |
5538d8a0 | 5406 | = tree_low_cst (TREE_VALUE (vals), 0) - domain_min; |
bca949e2 PB |
5407 | if (index < 0 || index >= bit_size) |
5408 | { | |
5409 | error ("invalid initializer for bit string"); | |
5410 | return NULL_TREE; | |
5411 | } | |
5412 | buffer[index] = 1; | |
5413 | } | |
5414 | } | |
5415 | return non_const_bits; | |
5416 | } | |
5417 | ||
9faa82d8 | 5418 | /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node. |
f3ffec8e | 5419 | The result is placed in BUFFER (which is an array of bytes). |
bca949e2 | 5420 | If the constructor is constant, NULL_TREE is returned. |
0f41302f | 5421 | Otherwise, a TREE_LIST of the non-constant elements is emitted. */ |
bca949e2 PB |
5422 | |
5423 | tree | |
46c5ad27 | 5424 | get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size) |
bca949e2 PB |
5425 | { |
5426 | int i; | |
f3ffec8e | 5427 | int set_word_size = BITS_PER_UNIT; |
bca949e2 PB |
5428 | int bit_size = wd_size * set_word_size; |
5429 | int bit_pos = 0; | |
f3ffec8e | 5430 | unsigned char *bytep = buffer; |
703ad42b | 5431 | char *bit_buffer = alloca (bit_size); |
bca949e2 PB |
5432 | tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size); |
5433 | ||
5434 | for (i = 0; i < wd_size; i++) | |
5435 | buffer[i] = 0; | |
5436 | ||
5437 | for (i = 0; i < bit_size; i++) | |
5438 | { | |
5439 | if (bit_buffer[i]) | |
5440 | { | |
8a0e8d4d | 5441 | if (BYTES_BIG_ENDIAN) |
f3ffec8e | 5442 | *bytep |= (1 << (set_word_size - 1 - bit_pos)); |
f76b9db2 | 5443 | else |
f3ffec8e | 5444 | *bytep |= 1 << bit_pos; |
bca949e2 PB |
5445 | } |
5446 | bit_pos++; | |
5447 | if (bit_pos >= set_word_size) | |
f3ffec8e | 5448 | bit_pos = 0, bytep++; |
bca949e2 PB |
5449 | } |
5450 | return non_const_bits; | |
5451 | } | |
9ec36da5 | 5452 | \f |
f4524c9e | 5453 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
eb34af89 | 5454 | |
086e3095 | 5455 | /* Complain that the tree code of NODE does not match the expected 0 |
ea1763b1 NS |
5456 | terminated list of trailing codes. The trailing code list can be |
5457 | empty, for a more vague error message. FILE, LINE, and FUNCTION | |
5458 | are of the caller. */ | |
dc478a5d | 5459 | |
8f985ec4 | 5460 | void |
086e3095 NS |
5461 | tree_check_failed (const tree node, const char *file, |
5462 | int line, const char *function, ...) | |
5463 | { | |
5464 | va_list args; | |
5465 | char *buffer; | |
5466 | unsigned length = 0; | |
5467 | int code; | |
5468 | ||
5469 | va_start (args, function); | |
5470 | while ((code = va_arg (args, int))) | |
5471 | length += 4 + strlen (tree_code_name[code]); | |
5472 | va_end (args); | |
ea1763b1 | 5473 | if (length) |
086e3095 | 5474 | { |
ea1763b1 NS |
5475 | va_start (args, function); |
5476 | length += strlen ("expected "); | |
5477 | buffer = alloca (length); | |
5478 | length = 0; | |
5479 | while ((code = va_arg (args, int))) | |
086e3095 | 5480 | { |
ea1763b1 NS |
5481 | const char *prefix = length ? " or " : "expected "; |
5482 | ||
5483 | strcpy (buffer + length, prefix); | |
5484 | length += strlen (prefix); | |
5485 | strcpy (buffer + length, tree_code_name[code]); | |
5486 | length += strlen (tree_code_name[code]); | |
086e3095 | 5487 | } |
ea1763b1 | 5488 | va_end (args); |
086e3095 | 5489 | } |
ea1763b1 NS |
5490 | else |
5491 | buffer = (char *)"unexpected node"; | |
9f63daea | 5492 | |
ea1763b1 | 5493 | internal_error ("tree check: %s, have %s in %s, at %s:%d", |
086e3095 | 5494 | buffer, tree_code_name[TREE_CODE (node)], |
eb34af89 RK |
5495 | function, trim_filename (file), line); |
5496 | } | |
5497 | ||
086e3095 NS |
5498 | /* Complain that the tree code of NODE does match the expected 0 |
5499 | terminated list of trailing codes. FILE, LINE, and FUNCTION are of | |
5500 | the caller. */ | |
eb34af89 RK |
5501 | |
5502 | void | |
086e3095 NS |
5503 | tree_not_check_failed (const tree node, const char *file, |
5504 | int line, const char *function, ...) | |
5505 | { | |
5506 | va_list args; | |
5507 | char *buffer; | |
5508 | unsigned length = 0; | |
5509 | int code; | |
5510 | ||
5511 | va_start (args, function); | |
5512 | while ((code = va_arg (args, int))) | |
5513 | length += 4 + strlen (tree_code_name[code]); | |
5514 | va_end (args); | |
5515 | va_start (args, function); | |
5516 | buffer = alloca (length); | |
5517 | length = 0; | |
5518 | while ((code = va_arg (args, int))) | |
5519 | { | |
5520 | if (length) | |
5521 | { | |
5522 | strcpy (buffer + length, " or "); | |
5523 | length += 4; | |
5524 | } | |
5525 | strcpy (buffer + length, tree_code_name[code]); | |
5526 | length += strlen (tree_code_name[code]); | |
5527 | } | |
5528 | va_end (args); | |
9f63daea | 5529 | |
086e3095 NS |
5530 | internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d", |
5531 | buffer, tree_code_name[TREE_CODE (node)], | |
eb34af89 RK |
5532 | function, trim_filename (file), line); |
5533 | } | |
5534 | ||
eb34af89 | 5535 | /* Similar to tree_check_failed, except that we check for a class of tree |
9ec36da5 | 5536 | code, given in CL. */ |
dc478a5d | 5537 | |
8f985ec4 | 5538 | void |
6615c446 JO |
5539 | tree_class_check_failed (const tree node, const enum tree_code_class cl, |
5540 | const char *file, int line, const char *function) | |
12b195d9 | 5541 | { |
fce687f8 | 5542 | internal_error |
6615c446 JO |
5543 | ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d", |
5544 | TREE_CODE_CLASS_STRING (cl), | |
5545 | TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node))), | |
fce687f8 | 5546 | tree_code_name[TREE_CODE (node)], function, trim_filename (file), line); |
8f985ec4 ZW |
5547 | } |
5548 | ||
fa7b533b ZW |
5549 | /* Similar to above, except that the check is for the bounds of a TREE_VEC's |
5550 | (dynamically sized) vector. */ | |
5551 | ||
5552 | void | |
46c5ad27 AJ |
5553 | tree_vec_elt_check_failed (int idx, int len, const char *file, int line, |
5554 | const char *function) | |
fa7b533b ZW |
5555 | { |
5556 | internal_error | |
5557 | ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d", | |
5558 | idx + 1, len, function, trim_filename (file), line); | |
5559 | } | |
5560 | ||
6de9cd9a DN |
5561 | /* Similar to above, except that the check is for the bounds of a PHI_NODE's |
5562 | (dynamically sized) vector. */ | |
5563 | ||
5564 | void | |
5565 | phi_node_elt_check_failed (int idx, int len, const char *file, int line, | |
5566 | const char *function) | |
5567 | { | |
5568 | internal_error | |
5569 | ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d", | |
5570 | idx + 1, len, function, trim_filename (file), line); | |
5571 | } | |
5572 | ||
06790e5f ZW |
5573 | /* Similar to above, except that the check is for the bounds of the operand |
5574 | vector of an expression node. */ | |
5575 | ||
5576 | void | |
46c5ad27 AJ |
5577 | tree_operand_check_failed (int idx, enum tree_code code, const char *file, |
5578 | int line, const char *function) | |
06790e5f ZW |
5579 | { |
5580 | internal_error | |
5581 | ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d", | |
5582 | idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code), | |
5583 | function, trim_filename (file), line); | |
5584 | } | |
f4524c9e | 5585 | #endif /* ENABLE_TREE_CHECKING */ |
81b3411c | 5586 | \f |
26277d41 PB |
5587 | /* Create a new vector type node holding SUBPARTS units of type INNERTYPE, |
5588 | and mapped to the machine mode MODE. Initialize its fields and build | |
5589 | the information necessary for debugging output. */ | |
dc478a5d | 5590 | |
26277d41 PB |
5591 | static tree |
5592 | make_vector_type (tree innertype, int nunits, enum machine_mode mode) | |
4061f623 | 5593 | { |
26277d41 PB |
5594 | tree t = make_node (VECTOR_TYPE); |
5595 | ||
d70b8c3a | 5596 | TREE_TYPE (t) = TYPE_MAIN_VARIANT (innertype); |
26277d41 PB |
5597 | TYPE_VECTOR_SUBPARTS (t) = nunits; |
5598 | TYPE_MODE (t) = mode; | |
d70b8c3a PB |
5599 | TYPE_READONLY (t) = TYPE_READONLY (innertype); |
5600 | TYPE_VOLATILE (t) = TYPE_VOLATILE (innertype); | |
5601 | ||
4061f623 BS |
5602 | layout_type (t); |
5603 | ||
5604 | { | |
7d60be94 | 5605 | tree index = build_int_cst (NULL_TREE, nunits - 1); |
26277d41 | 5606 | tree array = build_array_type (innertype, build_index_type (index)); |
4061f623 BS |
5607 | tree rt = make_node (RECORD_TYPE); |
5608 | ||
5609 | TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array); | |
5610 | DECL_CONTEXT (TYPE_FIELDS (rt)) = rt; | |
5611 | layout_type (rt); | |
5612 | TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt; | |
5613 | /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output | |
5614 | the representation type, and we want to find that die when looking up | |
5615 | the vector type. This is most easily achieved by making the TYPE_UID | |
5616 | numbers equal. */ | |
5617 | TYPE_UID (rt) = TYPE_UID (t); | |
5618 | } | |
26277d41 | 5619 | |
d70b8c3a PB |
5620 | /* Build our main variant, based on the main variant of the inner type. */ |
5621 | if (TYPE_MAIN_VARIANT (innertype) != innertype) | |
5622 | { | |
5623 | tree innertype_main_variant = TYPE_MAIN_VARIANT (innertype); | |
5624 | unsigned int hash = TYPE_HASH (innertype_main_variant); | |
5625 | TYPE_MAIN_VARIANT (t) | |
5626 | = type_hash_canon (hash, make_vector_type (innertype_main_variant, | |
5627 | nunits, mode)); | |
5628 | } | |
5629 | ||
26277d41 | 5630 | return t; |
4061f623 BS |
5631 | } |
5632 | ||
cc27e657 PB |
5633 | static tree |
5634 | make_or_reuse_type (unsigned size, int unsignedp) | |
5635 | { | |
5636 | if (size == INT_TYPE_SIZE) | |
5637 | return unsignedp ? unsigned_type_node : integer_type_node; | |
5638 | if (size == CHAR_TYPE_SIZE) | |
5639 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
5640 | if (size == SHORT_TYPE_SIZE) | |
5641 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
5642 | if (size == LONG_TYPE_SIZE) | |
5643 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
5644 | if (size == LONG_LONG_TYPE_SIZE) | |
5645 | return (unsignedp ? long_long_unsigned_type_node | |
5646 | : long_long_integer_type_node); | |
5647 | ||
5648 | if (unsignedp) | |
5649 | return make_unsigned_type (size); | |
5650 | else | |
5651 | return make_signed_type (size); | |
5652 | } | |
5653 | ||
81b3411c BS |
5654 | /* Create nodes for all integer types (and error_mark_node) using the sizes |
5655 | of C datatypes. The caller should call set_sizetype soon after calling | |
5656 | this function to select one of the types as sizetype. */ | |
dc478a5d | 5657 | |
81b3411c | 5658 | void |
8c1d6d62 | 5659 | build_common_tree_nodes (bool signed_char, bool signed_sizetype) |
81b3411c BS |
5660 | { |
5661 | error_mark_node = make_node (ERROR_MARK); | |
5662 | TREE_TYPE (error_mark_node) = error_mark_node; | |
5663 | ||
8c1d6d62 | 5664 | initialize_sizetypes (signed_sizetype); |
fed3cef0 | 5665 | |
81b3411c BS |
5666 | /* Define both `signed char' and `unsigned char'. */ |
5667 | signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE); | |
5668 | unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE); | |
5669 | ||
5670 | /* Define `char', which is like either `signed char' or `unsigned char' | |
5671 | but not the same as either. */ | |
5672 | char_type_node | |
5673 | = (signed_char | |
5674 | ? make_signed_type (CHAR_TYPE_SIZE) | |
5675 | : make_unsigned_type (CHAR_TYPE_SIZE)); | |
5676 | ||
5677 | short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE); | |
5678 | short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE); | |
5679 | integer_type_node = make_signed_type (INT_TYPE_SIZE); | |
81b3411c BS |
5680 | unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE); |
5681 | long_integer_type_node = make_signed_type (LONG_TYPE_SIZE); | |
5682 | long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE); | |
5683 | long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE); | |
5684 | long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE); | |
5685 | ||
de7df9eb JM |
5686 | /* Define a boolean type. This type only represents boolean values but |
5687 | may be larger than char depending on the value of BOOL_TYPE_SIZE. | |
5688 | Front ends which want to override this size (i.e. Java) can redefine | |
5689 | boolean_type_node before calling build_common_tree_nodes_2. */ | |
5690 | boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE); | |
5691 | TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE); | |
7d60be94 | 5692 | TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1); |
de7df9eb JM |
5693 | TYPE_PRECISION (boolean_type_node) = 1; |
5694 | ||
cc27e657 PB |
5695 | /* Fill in the rest of the sized types. Reuse existing type nodes |
5696 | when possible. */ | |
5697 | intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0); | |
5698 | intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0); | |
5699 | intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0); | |
5700 | intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0); | |
5701 | intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0); | |
5702 | ||
5703 | unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1); | |
5704 | unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1); | |
5705 | unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1); | |
5706 | unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1); | |
5707 | unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1); | |
9f63daea | 5708 | |
5a98fa7b MM |
5709 | access_public_node = get_identifier ("public"); |
5710 | access_protected_node = get_identifier ("protected"); | |
5711 | access_private_node = get_identifier ("private"); | |
81b3411c BS |
5712 | } |
5713 | ||
81b3411c | 5714 | /* Call this function after calling build_common_tree_nodes and set_sizetype. |
fed3cef0 | 5715 | It will create several other common tree nodes. */ |
d4b60170 | 5716 | |
81b3411c | 5717 | void |
46c5ad27 | 5718 | build_common_tree_nodes_2 (int short_double) |
81b3411c | 5719 | { |
05bccae2 | 5720 | /* Define these next since types below may used them. */ |
7d60be94 NS |
5721 | integer_zero_node = build_int_cst (NULL_TREE, 0); |
5722 | integer_one_node = build_int_cst (NULL_TREE, 1); | |
5723 | integer_minus_one_node = build_int_cst (NULL_TREE, -1); | |
81b3411c | 5724 | |
770ae6cc RK |
5725 | size_zero_node = size_int (0); |
5726 | size_one_node = size_int (1); | |
5727 | bitsize_zero_node = bitsize_int (0); | |
5728 | bitsize_one_node = bitsize_int (1); | |
5729 | bitsize_unit_node = bitsize_int (BITS_PER_UNIT); | |
81b3411c | 5730 | |
de7df9eb JM |
5731 | boolean_false_node = TYPE_MIN_VALUE (boolean_type_node); |
5732 | boolean_true_node = TYPE_MAX_VALUE (boolean_type_node); | |
5733 | ||
81b3411c | 5734 | void_type_node = make_node (VOID_TYPE); |
05bccae2 | 5735 | layout_type (void_type_node); |
d4b60170 | 5736 | |
81b3411c BS |
5737 | /* We are not going to have real types in C with less than byte alignment, |
5738 | so we might as well not have any types that claim to have it. */ | |
5739 | TYPE_ALIGN (void_type_node) = BITS_PER_UNIT; | |
11cf4d18 | 5740 | TYPE_USER_ALIGN (void_type_node) = 0; |
81b3411c | 5741 | |
7d60be94 | 5742 | null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0); |
81b3411c BS |
5743 | layout_type (TREE_TYPE (null_pointer_node)); |
5744 | ||
5745 | ptr_type_node = build_pointer_type (void_type_node); | |
5746 | const_ptr_type_node | |
5747 | = build_pointer_type (build_type_variant (void_type_node, 1, 0)); | |
498c0f27 | 5748 | fileptr_type_node = ptr_type_node; |
81b3411c BS |
5749 | |
5750 | float_type_node = make_node (REAL_TYPE); | |
5751 | TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE; | |
5752 | layout_type (float_type_node); | |
5753 | ||
5754 | double_type_node = make_node (REAL_TYPE); | |
5755 | if (short_double) | |
5756 | TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE; | |
5757 | else | |
5758 | TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE; | |
5759 | layout_type (double_type_node); | |
5760 | ||
5761 | long_double_type_node = make_node (REAL_TYPE); | |
5762 | TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE; | |
5763 | layout_type (long_double_type_node); | |
5764 | ||
a2a919aa KG |
5765 | float_ptr_type_node = build_pointer_type (float_type_node); |
5766 | double_ptr_type_node = build_pointer_type (double_type_node); | |
5767 | long_double_ptr_type_node = build_pointer_type (long_double_type_node); | |
5768 | integer_ptr_type_node = build_pointer_type (integer_type_node); | |
5769 | ||
81b3411c BS |
5770 | complex_integer_type_node = make_node (COMPLEX_TYPE); |
5771 | TREE_TYPE (complex_integer_type_node) = integer_type_node; | |
5772 | layout_type (complex_integer_type_node); | |
5773 | ||
5774 | complex_float_type_node = make_node (COMPLEX_TYPE); | |
5775 | TREE_TYPE (complex_float_type_node) = float_type_node; | |
5776 | layout_type (complex_float_type_node); | |
5777 | ||
5778 | complex_double_type_node = make_node (COMPLEX_TYPE); | |
5779 | TREE_TYPE (complex_double_type_node) = double_type_node; | |
5780 | layout_type (complex_double_type_node); | |
5781 | ||
5782 | complex_long_double_type_node = make_node (COMPLEX_TYPE); | |
5783 | TREE_TYPE (complex_long_double_type_node) = long_double_type_node; | |
5784 | layout_type (complex_long_double_type_node); | |
5785 | ||
2df88e9f | 5786 | { |
5fd9b178 | 5787 | tree t = targetm.build_builtin_va_list (); |
066c84df | 5788 | |
4d6922ee | 5789 | /* Many back-ends define record types without setting TYPE_NAME. |
066c84df AO |
5790 | If we copied the record type here, we'd keep the original |
5791 | record type without a name. This breaks name mangling. So, | |
5792 | don't copy record types and let c_common_nodes_and_builtins() | |
5793 | declare the type to be __builtin_va_list. */ | |
5794 | if (TREE_CODE (t) != RECORD_TYPE) | |
8dd16ecc | 5795 | t = build_variant_type_copy (t); |
066c84df AO |
5796 | |
5797 | va_list_type_node = t; | |
2df88e9f | 5798 | } |
0afeef64 AH |
5799 | } |
5800 | ||
c6a912da RH |
5801 | /* A subroutine of build_common_builtin_nodes. Define a builtin function. */ |
5802 | ||
5803 | static void | |
5804 | local_define_builtin (const char *name, tree type, enum built_in_function code, | |
5805 | const char *library_name, int ecf_flags) | |
5806 | { | |
5807 | tree decl; | |
5808 | ||
5809 | decl = lang_hooks.builtin_function (name, type, code, BUILT_IN_NORMAL, | |
5810 | library_name, NULL_TREE); | |
5811 | if (ecf_flags & ECF_CONST) | |
5812 | TREE_READONLY (decl) = 1; | |
5813 | if (ecf_flags & ECF_PURE) | |
5814 | DECL_IS_PURE (decl) = 1; | |
5815 | if (ecf_flags & ECF_NORETURN) | |
5816 | TREE_THIS_VOLATILE (decl) = 1; | |
5817 | if (ecf_flags & ECF_NOTHROW) | |
5818 | TREE_NOTHROW (decl) = 1; | |
5819 | if (ecf_flags & ECF_MALLOC) | |
5820 | DECL_IS_MALLOC (decl) = 1; | |
5821 | ||
5822 | built_in_decls[code] = decl; | |
5823 | implicit_built_in_decls[code] = decl; | |
5824 | } | |
5825 | ||
5826 | /* Call this function after instantiating all builtins that the language | |
5827 | front end cares about. This will build the rest of the builtins that | |
5828 | are relied upon by the tree optimizers and the middle-end. */ | |
5829 | ||
5830 | void | |
5831 | build_common_builtin_nodes (void) | |
5832 | { | |
5833 | tree tmp, ftype; | |
5834 | ||
5835 | if (built_in_decls[BUILT_IN_MEMCPY] == NULL | |
5836 | || built_in_decls[BUILT_IN_MEMMOVE] == NULL) | |
5837 | { | |
5838 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
5839 | tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp); | |
5840 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
5841 | ftype = build_function_type (ptr_type_node, tmp); | |
5842 | ||
5843 | if (built_in_decls[BUILT_IN_MEMCPY] == NULL) | |
5844 | local_define_builtin ("__builtin_memcpy", ftype, BUILT_IN_MEMCPY, | |
5845 | "memcpy", ECF_NOTHROW); | |
5846 | if (built_in_decls[BUILT_IN_MEMMOVE] == NULL) | |
5847 | local_define_builtin ("__builtin_memmove", ftype, BUILT_IN_MEMMOVE, | |
5848 | "memmove", ECF_NOTHROW); | |
5849 | } | |
5850 | ||
5851 | if (built_in_decls[BUILT_IN_MEMCMP] == NULL) | |
5852 | { | |
5853 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
5854 | tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp); | |
5855 | tmp = tree_cons (NULL_TREE, const_ptr_type_node, tmp); | |
5856 | ftype = build_function_type (ptr_type_node, tmp); | |
5857 | local_define_builtin ("__builtin_memcmp", ftype, BUILT_IN_MEMCMP, | |
5858 | "memcmp", ECF_PURE | ECF_NOTHROW); | |
5859 | } | |
5860 | ||
5861 | if (built_in_decls[BUILT_IN_MEMSET] == NULL) | |
5862 | { | |
5863 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
5864 | tmp = tree_cons (NULL_TREE, integer_type_node, tmp); | |
5865 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
5866 | ftype = build_function_type (ptr_type_node, tmp); | |
5867 | local_define_builtin ("__builtin_memset", ftype, BUILT_IN_MEMSET, | |
5868 | "memset", ECF_NOTHROW); | |
5869 | } | |
5870 | ||
5871 | if (built_in_decls[BUILT_IN_ALLOCA] == NULL) | |
5872 | { | |
5873 | tmp = tree_cons (NULL_TREE, size_type_node, void_list_node); | |
5874 | ftype = build_function_type (ptr_type_node, tmp); | |
5875 | local_define_builtin ("__builtin_alloca", ftype, BUILT_IN_ALLOCA, | |
5876 | "alloca", ECF_NOTHROW | ECF_MALLOC); | |
5877 | } | |
5878 | ||
5879 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5880 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
5881 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
5882 | ftype = build_function_type (void_type_node, tmp); | |
5883 | local_define_builtin ("__builtin_init_trampoline", ftype, | |
5884 | BUILT_IN_INIT_TRAMPOLINE, | |
5885 | "__builtin_init_trampoline", ECF_NOTHROW); | |
5886 | ||
5887 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5888 | ftype = build_function_type (ptr_type_node, tmp); | |
5889 | local_define_builtin ("__builtin_adjust_trampoline", ftype, | |
5890 | BUILT_IN_ADJUST_TRAMPOLINE, | |
5891 | "__builtin_adjust_trampoline", | |
5892 | ECF_CONST | ECF_NOTHROW); | |
5893 | ||
5894 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5895 | tmp = tree_cons (NULL_TREE, ptr_type_node, tmp); | |
5896 | ftype = build_function_type (void_type_node, tmp); | |
5897 | local_define_builtin ("__builtin_nonlocal_goto", ftype, | |
5898 | BUILT_IN_NONLOCAL_GOTO, | |
5899 | "__builtin_nonlocal_goto", | |
5900 | ECF_NORETURN | ECF_NOTHROW); | |
5901 | ||
5902 | ftype = build_function_type (ptr_type_node, void_list_node); | |
5903 | local_define_builtin ("__builtin_stack_save", ftype, BUILT_IN_STACK_SAVE, | |
5904 | "__builtin_stack_save", ECF_NOTHROW); | |
5905 | ||
5906 | tmp = tree_cons (NULL_TREE, ptr_type_node, void_list_node); | |
5907 | ftype = build_function_type (void_type_node, tmp); | |
5908 | local_define_builtin ("__builtin_stack_restore", ftype, | |
5909 | BUILT_IN_STACK_RESTORE, | |
5910 | "__builtin_stack_restore", ECF_NOTHROW); | |
5911 | ||
5912 | ftype = build_function_type (void_type_node, void_list_node); | |
5913 | local_define_builtin ("__builtin_profile_func_enter", ftype, | |
5914 | BUILT_IN_PROFILE_FUNC_ENTER, "profile_func_enter", 0); | |
5915 | local_define_builtin ("__builtin_profile_func_exit", ftype, | |
5916 | BUILT_IN_PROFILE_FUNC_EXIT, "profile_func_exit", 0); | |
7e7e470f RH |
5917 | |
5918 | /* Complex multiplication and division. These are handled as builtins | |
5919 | rather than optabs because emit_library_call_value doesn't support | |
5920 | complex. Further, we can do slightly better with folding these | |
5921 | beasties if the real and complex parts of the arguments are separate. */ | |
5922 | { | |
5923 | enum machine_mode mode; | |
5924 | ||
5925 | for (mode = MIN_MODE_COMPLEX_FLOAT; mode <= MAX_MODE_COMPLEX_FLOAT; ++mode) | |
5926 | { | |
5927 | char mode_name_buf[4], *q; | |
5928 | const char *p; | |
5929 | enum built_in_function mcode, dcode; | |
5930 | tree type, inner_type; | |
5931 | ||
5932 | type = lang_hooks.types.type_for_mode (mode, 0); | |
5933 | if (type == NULL) | |
5934 | continue; | |
5935 | inner_type = TREE_TYPE (type); | |
5936 | ||
5937 | tmp = tree_cons (NULL_TREE, inner_type, void_list_node); | |
5938 | tmp = tree_cons (NULL_TREE, inner_type, tmp); | |
5939 | tmp = tree_cons (NULL_TREE, inner_type, tmp); | |
5940 | tmp = tree_cons (NULL_TREE, inner_type, tmp); | |
5941 | ftype = build_function_type (type, tmp); | |
5942 | ||
5943 | mcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT; | |
5944 | dcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT; | |
5945 | ||
5946 | for (p = GET_MODE_NAME (mode), q = mode_name_buf; *p; p++, q++) | |
5947 | *q = TOLOWER (*p); | |
5948 | *q = '\0'; | |
5949 | ||
5950 | built_in_names[mcode] = concat ("__mul", mode_name_buf, "3", NULL); | |
5951 | local_define_builtin (built_in_names[mcode], ftype, mcode, | |
5952 | built_in_names[mcode], ECF_CONST | ECF_NOTHROW); | |
5953 | ||
5954 | built_in_names[dcode] = concat ("__div", mode_name_buf, "3", NULL); | |
5955 | local_define_builtin (built_in_names[dcode], ftype, dcode, | |
5956 | built_in_names[dcode], ECF_CONST | ECF_NOTHROW); | |
5957 | } | |
5958 | } | |
c6a912da RH |
5959 | } |
5960 | ||
b34417a4 ZL |
5961 | /* HACK. GROSS. This is absolutely disgusting. I wish there was a |
5962 | better way. | |
5963 | ||
5964 | If we requested a pointer to a vector, build up the pointers that | |
5965 | we stripped off while looking for the inner type. Similarly for | |
5966 | return values from functions. | |
5967 | ||
5968 | The argument TYPE is the top of the chain, and BOTTOM is the | |
5969 | new type which we will point to. */ | |
5970 | ||
5971 | tree | |
5972 | reconstruct_complex_type (tree type, tree bottom) | |
5973 | { | |
5974 | tree inner, outer; | |
5975 | ||
5976 | if (POINTER_TYPE_P (type)) | |
5977 | { | |
5978 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
5979 | outer = build_pointer_type (inner); | |
5980 | } | |
5981 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
5982 | { | |
5983 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
5984 | outer = build_array_type (inner, TYPE_DOMAIN (type)); | |
5985 | } | |
5986 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
5987 | { | |
5988 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); | |
5989 | outer = build_function_type (inner, TYPE_ARG_TYPES (type)); | |
5990 | } | |
5991 | else if (TREE_CODE (type) == METHOD_TYPE) | |
5992 | { | |
037cc9c5 | 5993 | tree argtypes; |
b34417a4 | 5994 | inner = reconstruct_complex_type (TREE_TYPE (type), bottom); |
037cc9c5 FJ |
5995 | /* The build_method_type_directly() routine prepends 'this' to argument list, |
5996 | so we must compensate by getting rid of it. */ | |
5997 | argtypes = TYPE_ARG_TYPES (type); | |
b34417a4 | 5998 | outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type), |
9f63daea | 5999 | inner, |
b34417a4 | 6000 | TYPE_ARG_TYPES (type)); |
037cc9c5 | 6001 | TYPE_ARG_TYPES (outer) = argtypes; |
b34417a4 ZL |
6002 | } |
6003 | else | |
6004 | return bottom; | |
6005 | ||
e0e4ac7f AP |
6006 | TYPE_READONLY (outer) = TYPE_READONLY (type); |
6007 | TYPE_VOLATILE (outer) = TYPE_VOLATILE (type); | |
b34417a4 ZL |
6008 | |
6009 | return outer; | |
6010 | } | |
6011 | ||
26277d41 PB |
6012 | /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and |
6013 | the inner type. */ | |
b34417a4 | 6014 | tree |
4a5eab38 | 6015 | build_vector_type_for_mode (tree innertype, enum machine_mode mode) |
0afeef64 | 6016 | { |
26277d41 | 6017 | int nunits; |
27b41650 | 6018 | |
1e128c5f | 6019 | switch (GET_MODE_CLASS (mode)) |
26277d41 | 6020 | { |
1e128c5f GB |
6021 | case MODE_VECTOR_INT: |
6022 | case MODE_VECTOR_FLOAT: | |
6023 | nunits = GET_MODE_NUNITS (mode); | |
6024 | break; | |
6025 | ||
6026 | case MODE_INT: | |
26277d41 | 6027 | /* Check that there are no leftover bits. */ |
1e128c5f GB |
6028 | gcc_assert (GET_MODE_BITSIZE (mode) |
6029 | % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0); | |
4a5eab38 | 6030 | |
26277d41 PB |
6031 | nunits = GET_MODE_BITSIZE (mode) |
6032 | / TREE_INT_CST_LOW (TYPE_SIZE (innertype)); | |
1e128c5f GB |
6033 | break; |
6034 | ||
6035 | default: | |
6036 | gcc_unreachable (); | |
26277d41 | 6037 | } |
4a5eab38 | 6038 | |
26277d41 PB |
6039 | return make_vector_type (innertype, nunits, mode); |
6040 | } | |
4a5eab38 | 6041 | |
26277d41 PB |
6042 | /* Similarly, but takes the inner type and number of units, which must be |
6043 | a power of two. */ | |
6044 | ||
6045 | tree | |
6046 | build_vector_type (tree innertype, int nunits) | |
6047 | { | |
6048 | return make_vector_type (innertype, nunits, VOIDmode); | |
4a5eab38 PB |
6049 | } |
6050 | ||
27b41650 KG |
6051 | /* Given an initializer INIT, return TRUE if INIT is zero or some |
6052 | aggregate of zeros. Otherwise return FALSE. */ | |
27b41650 | 6053 | bool |
46c5ad27 | 6054 | initializer_zerop (tree init) |
27b41650 | 6055 | { |
6de9cd9a DN |
6056 | tree elt; |
6057 | ||
27b41650 KG |
6058 | STRIP_NOPS (init); |
6059 | ||
6060 | switch (TREE_CODE (init)) | |
6061 | { | |
6062 | case INTEGER_CST: | |
6063 | return integer_zerop (init); | |
6de9cd9a | 6064 | |
27b41650 | 6065 | case REAL_CST: |
6de9cd9a DN |
6066 | /* ??? Note that this is not correct for C4X float formats. There, |
6067 | a bit pattern of all zeros is 1.0; 0.0 is encoded with the most | |
6068 | negative exponent. */ | |
27b41650 KG |
6069 | return real_zerop (init) |
6070 | && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init)); | |
6de9cd9a | 6071 | |
27b41650 KG |
6072 | case COMPLEX_CST: |
6073 | return integer_zerop (init) | |
6074 | || (real_zerop (init) | |
6075 | && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init))) | |
6076 | && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init)))); | |
6de9cd9a DN |
6077 | |
6078 | case VECTOR_CST: | |
6079 | for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt)) | |
6080 | if (!initializer_zerop (TREE_VALUE (elt))) | |
e8423af9 | 6081 | return false; |
6de9cd9a | 6082 | return true; |
e8423af9 | 6083 | |
6de9cd9a DN |
6084 | case CONSTRUCTOR: |
6085 | elt = CONSTRUCTOR_ELTS (init); | |
6086 | if (elt == NULL_TREE) | |
6087 | return true; | |
6088 | ||
6de9cd9a DN |
6089 | for (; elt ; elt = TREE_CHAIN (elt)) |
6090 | if (! initializer_zerop (TREE_VALUE (elt))) | |
6091 | return false; | |
6092 | return true; | |
6093 | ||
27b41650 KG |
6094 | default: |
6095 | return false; | |
6096 | } | |
6097 | } | |
e2500fed | 6098 | |
6de9cd9a DN |
6099 | void |
6100 | add_var_to_bind_expr (tree bind_expr, tree var) | |
6101 | { | |
6102 | BIND_EXPR_VARS (bind_expr) | |
6103 | = chainon (BIND_EXPR_VARS (bind_expr), var); | |
6104 | if (BIND_EXPR_BLOCK (bind_expr)) | |
6105 | BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr)) | |
6106 | = BIND_EXPR_VARS (bind_expr); | |
6107 | } | |
6108 | ||
6109 | /* Build an empty statement. */ | |
6110 | ||
6111 | tree | |
6112 | build_empty_stmt (void) | |
6113 | { | |
6114 | return build1 (NOP_EXPR, void_type_node, size_zero_node); | |
6115 | } | |
6116 | ||
6de9cd9a | 6117 | |
a7e5372d ZD |
6118 | /* Returns true if it is possible to prove that the index of |
6119 | an array access REF (an ARRAY_REF expression) falls into the | |
6120 | array bounds. */ | |
6121 | ||
6122 | bool | |
6123 | in_array_bounds_p (tree ref) | |
6124 | { | |
6125 | tree idx = TREE_OPERAND (ref, 1); | |
6126 | tree min, max; | |
6127 | ||
6128 | if (TREE_CODE (idx) != INTEGER_CST) | |
6129 | return false; | |
9f63daea | 6130 | |
a7e5372d ZD |
6131 | min = array_ref_low_bound (ref); |
6132 | max = array_ref_up_bound (ref); | |
6133 | if (!min | |
6134 | || !max | |
6135 | || TREE_CODE (min) != INTEGER_CST | |
6136 | || TREE_CODE (max) != INTEGER_CST) | |
6137 | return false; | |
6138 | ||
6139 | if (tree_int_cst_lt (idx, min) | |
6140 | || tree_int_cst_lt (max, idx)) | |
6141 | return false; | |
6142 | ||
6143 | return true; | |
6144 | } | |
6145 | ||
c597ef4e DN |
6146 | /* Return true if T (assumed to be a DECL) is a global variable. */ |
6147 | ||
6148 | bool | |
6149 | is_global_var (tree t) | |
6150 | { | |
6151 | return (TREE_STATIC (t) || DECL_EXTERNAL (t)); | |
6152 | } | |
6153 | ||
6de9cd9a DN |
6154 | /* Return true if T (assumed to be a DECL) must be assigned a memory |
6155 | location. */ | |
6156 | ||
6157 | bool | |
6158 | needs_to_live_in_memory (tree t) | |
6159 | { | |
c597ef4e DN |
6160 | return (TREE_ADDRESSABLE (t) |
6161 | || is_global_var (t) | |
6de9cd9a | 6162 | || (TREE_CODE (t) == RESULT_DECL |
ab8907ef | 6163 | && aggregate_value_p (t, current_function_decl))); |
6de9cd9a DN |
6164 | } |
6165 | ||
fa27426e RH |
6166 | /* There are situations in which a language considers record types |
6167 | compatible which have different field lists. Decide if two fields | |
6168 | are compatible. It is assumed that the parent records are compatible. */ | |
6169 | ||
6170 | bool | |
6171 | fields_compatible_p (tree f1, tree f2) | |
6172 | { | |
6173 | if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1), | |
6174 | DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST)) | |
6175 | return false; | |
6176 | ||
6177 | if (!operand_equal_p (DECL_FIELD_OFFSET (f1), | |
6178 | DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST)) | |
6179 | return false; | |
6180 | ||
6181 | if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2))) | |
9f63daea | 6182 | return false; |
fa27426e RH |
6183 | |
6184 | return true; | |
6185 | } | |
6186 | ||
6187 | /* Locate within RECORD a field that is compatible with ORIG_FIELD. */ | |
6188 | ||
6189 | tree | |
6190 | find_compatible_field (tree record, tree orig_field) | |
6191 | { | |
6192 | tree f; | |
6193 | ||
6194 | for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f)) | |
6195 | if (TREE_CODE (f) == FIELD_DECL | |
6196 | && fields_compatible_p (f, orig_field)) | |
6197 | return f; | |
6198 | ||
6199 | /* ??? Why isn't this on the main fields list? */ | |
6200 | f = TYPE_VFIELD (record); | |
6201 | if (f && TREE_CODE (f) == FIELD_DECL | |
6202 | && fields_compatible_p (f, orig_field)) | |
6203 | return f; | |
6204 | ||
6205 | /* ??? We should abort here, but Java appears to do Bad Things | |
6206 | with inherited fields. */ | |
6207 | return orig_field; | |
6208 | } | |
6209 | ||
56cf8686 SP |
6210 | /* Return value of a constant X. */ |
6211 | ||
6212 | HOST_WIDE_INT | |
6213 | int_cst_value (tree x) | |
6214 | { | |
6215 | unsigned bits = TYPE_PRECISION (TREE_TYPE (x)); | |
6216 | unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x); | |
6217 | bool negative = ((val >> (bits - 1)) & 1) != 0; | |
6218 | ||
1e128c5f | 6219 | gcc_assert (bits <= HOST_BITS_PER_WIDE_INT); |
56cf8686 SP |
6220 | |
6221 | if (negative) | |
6222 | val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1; | |
6223 | else | |
6224 | val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1); | |
6225 | ||
6226 | return val; | |
6227 | } | |
6228 | ||
6229 | /* Returns the greatest common divisor of A and B, which must be | |
6230 | INTEGER_CSTs. */ | |
6231 | ||
9f63daea | 6232 | tree |
56cf8686 SP |
6233 | tree_fold_gcd (tree a, tree b) |
6234 | { | |
6235 | tree a_mod_b; | |
6236 | tree type = TREE_TYPE (a); | |
9f63daea | 6237 | |
1e128c5f GB |
6238 | gcc_assert (TREE_CODE (a) == INTEGER_CST); |
6239 | gcc_assert (TREE_CODE (b) == INTEGER_CST); | |
9f63daea EC |
6240 | |
6241 | if (integer_zerop (a)) | |
56cf8686 | 6242 | return b; |
9f63daea EC |
6243 | |
6244 | if (integer_zerop (b)) | |
56cf8686 | 6245 | return a; |
9f63daea | 6246 | |
56cf8686 | 6247 | if (tree_int_cst_sgn (a) == -1) |
3244e67d RS |
6248 | a = fold (build2 (MULT_EXPR, type, a, |
6249 | convert (type, integer_minus_one_node))); | |
9f63daea | 6250 | |
56cf8686 | 6251 | if (tree_int_cst_sgn (b) == -1) |
3244e67d RS |
6252 | b = fold (build2 (MULT_EXPR, type, b, |
6253 | convert (type, integer_minus_one_node))); | |
9f63daea | 6254 | |
56cf8686 SP |
6255 | while (1) |
6256 | { | |
308d5189 | 6257 | a_mod_b = fold (build2 (FLOOR_MOD_EXPR, type, a, b)); |
9f63daea | 6258 | |
56cf8686 SP |
6259 | if (!TREE_INT_CST_LOW (a_mod_b) |
6260 | && !TREE_INT_CST_HIGH (a_mod_b)) | |
6261 | return b; | |
6262 | ||
6263 | a = b; | |
6264 | b = a_mod_b; | |
6265 | } | |
6266 | } | |
fa27426e | 6267 | |
2f4675b4 ZD |
6268 | /* Returns unsigned variant of TYPE. */ |
6269 | ||
6270 | tree | |
6271 | unsigned_type_for (tree type) | |
6272 | { | |
6273 | return lang_hooks.types.unsigned_type (type); | |
6274 | } | |
6275 | ||
6276 | /* Returns signed variant of TYPE. */ | |
6277 | ||
6278 | tree | |
6279 | signed_type_for (tree type) | |
6280 | { | |
6281 | return lang_hooks.types.signed_type (type); | |
6282 | } | |
6283 | ||
18522563 ZD |
6284 | /* Returns the largest value obtainable by casting something in INNER type to |
6285 | OUTER type. */ | |
6286 | ||
6287 | tree | |
6288 | upper_bound_in_type (tree outer, tree inner) | |
6289 | { | |
6290 | unsigned HOST_WIDE_INT lo, hi; | |
6291 | unsigned bits = TYPE_PRECISION (inner); | |
6292 | ||
6293 | if (TYPE_UNSIGNED (outer) || TYPE_UNSIGNED (inner)) | |
6294 | { | |
6295 | /* Zero extending in these cases. */ | |
6296 | if (bits <= HOST_BITS_PER_WIDE_INT) | |
6297 | { | |
6298 | hi = 0; | |
6299 | lo = (~(unsigned HOST_WIDE_INT) 0) | |
6300 | >> (HOST_BITS_PER_WIDE_INT - bits); | |
6301 | } | |
6302 | else | |
6303 | { | |
6304 | hi = (~(unsigned HOST_WIDE_INT) 0) | |
6305 | >> (2 * HOST_BITS_PER_WIDE_INT - bits); | |
6306 | lo = ~(unsigned HOST_WIDE_INT) 0; | |
6307 | } | |
6308 | } | |
6309 | else | |
6310 | { | |
6311 | /* Sign extending in these cases. */ | |
6312 | if (bits <= HOST_BITS_PER_WIDE_INT) | |
6313 | { | |
6314 | hi = 0; | |
6315 | lo = (~(unsigned HOST_WIDE_INT) 0) | |
6316 | >> (HOST_BITS_PER_WIDE_INT - bits) >> 1; | |
6317 | } | |
6318 | else | |
6319 | { | |
6320 | hi = (~(unsigned HOST_WIDE_INT) 0) | |
6321 | >> (2 * HOST_BITS_PER_WIDE_INT - bits) >> 1; | |
6322 | lo = ~(unsigned HOST_WIDE_INT) 0; | |
6323 | } | |
6324 | } | |
6325 | ||
6326 | return fold_convert (outer, | |
6327 | build_int_cst_wide (inner, lo, hi)); | |
6328 | } | |
6329 | ||
6330 | /* Returns the smallest value obtainable by casting something in INNER type to | |
6331 | OUTER type. */ | |
6332 | ||
6333 | tree | |
6334 | lower_bound_in_type (tree outer, tree inner) | |
6335 | { | |
6336 | unsigned HOST_WIDE_INT lo, hi; | |
6337 | unsigned bits = TYPE_PRECISION (inner); | |
6338 | ||
6339 | if (TYPE_UNSIGNED (outer) || TYPE_UNSIGNED (inner)) | |
6340 | lo = hi = 0; | |
6341 | else if (bits <= HOST_BITS_PER_WIDE_INT) | |
6342 | { | |
6343 | hi = ~(unsigned HOST_WIDE_INT) 0; | |
6344 | lo = (~(unsigned HOST_WIDE_INT) 0) << (bits - 1); | |
6345 | } | |
6346 | else | |
6347 | { | |
6348 | hi = (~(unsigned HOST_WIDE_INT) 0) << (bits - HOST_BITS_PER_WIDE_INT - 1); | |
6349 | lo = 0; | |
6350 | } | |
6351 | ||
6352 | return fold_convert (outer, | |
6353 | build_int_cst_wide (inner, lo, hi)); | |
6354 | } | |
6355 | ||
cdef8bc6 KH |
6356 | /* Return nonzero if two operands that are suitable for PHI nodes are |
6357 | necessarily equal. Specifically, both ARG0 and ARG1 must be either | |
6358 | SSA_NAME or invariant. Note that this is strictly an optimization. | |
6359 | That is, callers of this function can directly call operand_equal_p | |
6360 | and get the same result, only slower. */ | |
6361 | ||
6362 | int | |
6363 | operand_equal_for_phi_arg_p (tree arg0, tree arg1) | |
6364 | { | |
6365 | if (arg0 == arg1) | |
6366 | return 1; | |
6367 | if (TREE_CODE (arg0) == SSA_NAME || TREE_CODE (arg1) == SSA_NAME) | |
6368 | return 0; | |
6369 | return operand_equal_p (arg0, arg1, 0); | |
6370 | } | |
6371 | ||
ca4c3169 ZD |
6372 | /* Returns number of zeros at the end of binary representation of X. |
6373 | ||
6374 | ??? Use ffs if available? */ | |
6375 | ||
6376 | tree | |
6377 | num_ending_zeros (tree x) | |
6378 | { | |
6379 | unsigned HOST_WIDE_INT fr, nfr; | |
6380 | unsigned num, abits; | |
6381 | tree type = TREE_TYPE (x); | |
6382 | ||
6383 | if (TREE_INT_CST_LOW (x) == 0) | |
6384 | { | |
6385 | num = HOST_BITS_PER_WIDE_INT; | |
6386 | fr = TREE_INT_CST_HIGH (x); | |
6387 | } | |
6388 | else | |
6389 | { | |
6390 | num = 0; | |
6391 | fr = TREE_INT_CST_LOW (x); | |
6392 | } | |
6393 | ||
6394 | for (abits = HOST_BITS_PER_WIDE_INT / 2; abits; abits /= 2) | |
6395 | { | |
6396 | nfr = fr >> abits; | |
6397 | if (nfr << abits == fr) | |
6398 | { | |
6399 | num += abits; | |
6400 | fr = nfr; | |
6401 | } | |
6402 | } | |
6403 | ||
6404 | if (num > TYPE_PRECISION (type)) | |
6405 | num = TYPE_PRECISION (type); | |
6406 | ||
6407 | return build_int_cst_type (type, num); | |
6408 | } | |
6409 | ||
b8c4a565 SB |
6410 | |
6411 | #define WALK_SUBTREE(NODE) \ | |
6412 | do \ | |
6413 | { \ | |
6414 | result = walk_tree (&(NODE), func, data, pset); \ | |
6415 | if (result) \ | |
6416 | return result; \ | |
6417 | } \ | |
6418 | while (0) | |
6419 | ||
6420 | /* This is a subroutine of walk_tree that walks field of TYPE that are to | |
6421 | be walked whenever a type is seen in the tree. Rest of operands and return | |
6422 | value are as for walk_tree. */ | |
6423 | ||
6424 | static tree | |
6425 | walk_type_fields (tree type, walk_tree_fn func, void *data, | |
6426 | struct pointer_set_t *pset) | |
6427 | { | |
6428 | tree result = NULL_TREE; | |
6429 | ||
6430 | switch (TREE_CODE (type)) | |
6431 | { | |
6432 | case POINTER_TYPE: | |
6433 | case REFERENCE_TYPE: | |
6434 | /* We have to worry about mutually recursive pointers. These can't | |
6435 | be written in C. They can in Ada. It's pathological, but | |
6436 | there's an ACATS test (c38102a) that checks it. Deal with this | |
6437 | by checking if we're pointing to another pointer, that one | |
6438 | points to another pointer, that one does too, and we have no htab. | |
6439 | If so, get a hash table. We check three levels deep to avoid | |
6440 | the cost of the hash table if we don't need one. */ | |
6441 | if (POINTER_TYPE_P (TREE_TYPE (type)) | |
6442 | && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type))) | |
6443 | && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type)))) | |
6444 | && !pset) | |
6445 | { | |
6446 | result = walk_tree_without_duplicates (&TREE_TYPE (type), | |
6447 | func, data); | |
6448 | if (result) | |
6449 | return result; | |
6450 | ||
6451 | break; | |
6452 | } | |
6453 | ||
6454 | /* ... fall through ... */ | |
6455 | ||
6456 | case COMPLEX_TYPE: | |
6457 | WALK_SUBTREE (TREE_TYPE (type)); | |
6458 | break; | |
6459 | ||
6460 | case METHOD_TYPE: | |
6461 | WALK_SUBTREE (TYPE_METHOD_BASETYPE (type)); | |
6462 | ||
6463 | /* Fall through. */ | |
6464 | ||
6465 | case FUNCTION_TYPE: | |
6466 | WALK_SUBTREE (TREE_TYPE (type)); | |
6467 | { | |
6468 | tree arg; | |
6469 | ||
6470 | /* We never want to walk into default arguments. */ | |
6471 | for (arg = TYPE_ARG_TYPES (type); arg; arg = TREE_CHAIN (arg)) | |
6472 | WALK_SUBTREE (TREE_VALUE (arg)); | |
6473 | } | |
6474 | break; | |
6475 | ||
6476 | case ARRAY_TYPE: | |
6477 | /* Don't follow this nodes's type if a pointer for fear that we'll | |
6478 | have infinite recursion. Those types are uninteresting anyway. */ | |
6479 | if (!POINTER_TYPE_P (TREE_TYPE (type)) | |
6480 | && TREE_CODE (TREE_TYPE (type)) != OFFSET_TYPE) | |
6481 | WALK_SUBTREE (TREE_TYPE (type)); | |
6482 | WALK_SUBTREE (TYPE_DOMAIN (type)); | |
6483 | break; | |
6484 | ||
6485 | case BOOLEAN_TYPE: | |
6486 | case ENUMERAL_TYPE: | |
6487 | case INTEGER_TYPE: | |
6488 | case CHAR_TYPE: | |
6489 | case REAL_TYPE: | |
6490 | WALK_SUBTREE (TYPE_MIN_VALUE (type)); | |
6491 | WALK_SUBTREE (TYPE_MAX_VALUE (type)); | |
6492 | break; | |
6493 | ||
6494 | case OFFSET_TYPE: | |
6495 | WALK_SUBTREE (TREE_TYPE (type)); | |
6496 | WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type)); | |
6497 | break; | |
6498 | ||
6499 | default: | |
6500 | break; | |
6501 | } | |
6502 | ||
6503 | return NULL_TREE; | |
6504 | } | |
6505 | ||
6506 | /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is | |
6507 | called with the DATA and the address of each sub-tree. If FUNC returns a | |
6508 | non-NULL value, the traversal is aborted, and the value returned by FUNC | |
6509 | is returned. If PSET is non-NULL it is used to record the nodes visited, | |
6510 | and to avoid visiting a node more than once. */ | |
6511 | ||
6512 | tree | |
6513 | walk_tree (tree *tp, walk_tree_fn func, void *data, struct pointer_set_t *pset) | |
6514 | { | |
6515 | enum tree_code code; | |
6516 | int walk_subtrees; | |
6517 | tree result; | |
6518 | ||
6519 | #define WALK_SUBTREE_TAIL(NODE) \ | |
6520 | do \ | |
6521 | { \ | |
6522 | tp = & (NODE); \ | |
6523 | goto tail_recurse; \ | |
6524 | } \ | |
6525 | while (0) | |
6526 | ||
6527 | tail_recurse: | |
6528 | /* Skip empty subtrees. */ | |
6529 | if (!*tp) | |
6530 | return NULL_TREE; | |
6531 | ||
6532 | /* Don't walk the same tree twice, if the user has requested | |
6533 | that we avoid doing so. */ | |
6534 | if (pset && pointer_set_insert (pset, *tp)) | |
6535 | return NULL_TREE; | |
6536 | ||
6537 | /* Call the function. */ | |
6538 | walk_subtrees = 1; | |
6539 | result = (*func) (tp, &walk_subtrees, data); | |
6540 | ||
6541 | /* If we found something, return it. */ | |
6542 | if (result) | |
6543 | return result; | |
6544 | ||
6545 | code = TREE_CODE (*tp); | |
6546 | ||
6547 | /* Even if we didn't, FUNC may have decided that there was nothing | |
6548 | interesting below this point in the tree. */ | |
6549 | if (!walk_subtrees) | |
6550 | { | |
6551 | if (code == TREE_LIST) | |
6552 | /* But we still need to check our siblings. */ | |
6553 | WALK_SUBTREE_TAIL (TREE_CHAIN (*tp)); | |
6554 | else | |
6555 | return NULL_TREE; | |
6556 | } | |
6557 | ||
6558 | result = lang_hooks.tree_inlining.walk_subtrees (tp, &walk_subtrees, func, | |
6559 | data, pset); | |
6560 | if (result || ! walk_subtrees) | |
6561 | return result; | |
6562 | ||
6563 | /* If this is a DECL_EXPR, walk into various fields of the type that it's | |
6564 | defining. We only want to walk into these fields of a type in this | |
6565 | case. Note that decls get walked as part of the processing of a | |
6566 | BIND_EXPR. | |
6567 | ||
6568 | ??? Precisely which fields of types that we are supposed to walk in | |
6569 | this case vs. the normal case aren't well defined. */ | |
6570 | if (code == DECL_EXPR | |
6571 | && TREE_CODE (DECL_EXPR_DECL (*tp)) == TYPE_DECL | |
6572 | && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp))) != ERROR_MARK) | |
6573 | { | |
6574 | tree *type_p = &TREE_TYPE (DECL_EXPR_DECL (*tp)); | |
6575 | ||
6576 | /* Call the function for the type. See if it returns anything or | |
6577 | doesn't want us to continue. If we are to continue, walk both | |
6578 | the normal fields and those for the declaration case. */ | |
6579 | result = (*func) (type_p, &walk_subtrees, data); | |
6580 | if (result || !walk_subtrees) | |
6581 | return NULL_TREE; | |
6582 | ||
6583 | result = walk_type_fields (*type_p, func, data, pset); | |
6584 | if (result) | |
6585 | return result; | |
6586 | ||
6587 | WALK_SUBTREE (TYPE_SIZE (*type_p)); | |
6588 | WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p)); | |
6589 | ||
6590 | /* If this is a record type, also walk the fields. */ | |
6591 | if (TREE_CODE (*type_p) == RECORD_TYPE | |
6592 | || TREE_CODE (*type_p) == UNION_TYPE | |
6593 | || TREE_CODE (*type_p) == QUAL_UNION_TYPE) | |
6594 | { | |
6595 | tree field; | |
6596 | ||
6597 | for (field = TYPE_FIELDS (*type_p); field; | |
6598 | field = TREE_CHAIN (field)) | |
6599 | { | |
6600 | /* We'd like to look at the type of the field, but we can easily | |
6601 | get infinite recursion. So assume it's pointed to elsewhere | |
6602 | in the tree. Also, ignore things that aren't fields. */ | |
6603 | if (TREE_CODE (field) != FIELD_DECL) | |
6604 | continue; | |
6605 | ||
6606 | WALK_SUBTREE (DECL_FIELD_OFFSET (field)); | |
6607 | WALK_SUBTREE (DECL_SIZE (field)); | |
6608 | WALK_SUBTREE (DECL_SIZE_UNIT (field)); | |
6609 | if (TREE_CODE (*type_p) == QUAL_UNION_TYPE) | |
6610 | WALK_SUBTREE (DECL_QUALIFIER (field)); | |
6611 | } | |
6612 | } | |
6613 | } | |
6614 | ||
6615 | else if (code != SAVE_EXPR | |
6616 | && code != BIND_EXPR | |
6617 | && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code))) | |
6618 | { | |
6619 | int i, len; | |
6620 | ||
6621 | /* Walk over all the sub-trees of this operand. */ | |
6622 | len = TREE_CODE_LENGTH (code); | |
6623 | /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same. | |
6624 | But, we only want to walk once. */ | |
6625 | if (code == TARGET_EXPR | |
6626 | && TREE_OPERAND (*tp, 3) == TREE_OPERAND (*tp, 1)) | |
6627 | --len; | |
6628 | ||
6629 | /* Go through the subtrees. We need to do this in forward order so | |
6630 | that the scope of a FOR_EXPR is handled properly. */ | |
6631 | #ifdef DEBUG_WALK_TREE | |
6632 | for (i = 0; i < len; ++i) | |
6633 | WALK_SUBTREE (TREE_OPERAND (*tp, i)); | |
6634 | #else | |
6635 | for (i = 0; i < len - 1; ++i) | |
6636 | WALK_SUBTREE (TREE_OPERAND (*tp, i)); | |
6637 | ||
6638 | if (len) | |
6639 | { | |
6640 | /* The common case is that we may tail recurse here. */ | |
6641 | if (code != BIND_EXPR | |
6642 | && !TREE_CHAIN (*tp)) | |
6643 | WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, len - 1)); | |
6644 | else | |
6645 | WALK_SUBTREE (TREE_OPERAND (*tp, len - 1)); | |
6646 | } | |
6647 | #endif | |
6648 | } | |
6649 | ||
6650 | /* If this is a type, walk the needed fields in the type. */ | |
6651 | else if (TYPE_P (*tp)) | |
6652 | { | |
6653 | result = walk_type_fields (*tp, func, data, pset); | |
6654 | if (result) | |
6655 | return result; | |
6656 | } | |
6657 | else | |
6658 | { | |
6659 | /* Not one of the easy cases. We must explicitly go through the | |
6660 | children. */ | |
6661 | switch (code) | |
6662 | { | |
6663 | case ERROR_MARK: | |
6664 | case IDENTIFIER_NODE: | |
6665 | case INTEGER_CST: | |
6666 | case REAL_CST: | |
6667 | case VECTOR_CST: | |
6668 | case STRING_CST: | |
6669 | case BLOCK: | |
6670 | case PLACEHOLDER_EXPR: | |
6671 | case SSA_NAME: | |
6672 | case FIELD_DECL: | |
6673 | case RESULT_DECL: | |
6674 | /* None of thse have subtrees other than those already walked | |
6675 | above. */ | |
6676 | break; | |
6677 | ||
6678 | case TREE_LIST: | |
6679 | WALK_SUBTREE (TREE_VALUE (*tp)); | |
6680 | WALK_SUBTREE_TAIL (TREE_CHAIN (*tp)); | |
6681 | break; | |
6682 | ||
6683 | case TREE_VEC: | |
6684 | { | |
6685 | int len = TREE_VEC_LENGTH (*tp); | |
6686 | ||
6687 | if (len == 0) | |
6688 | break; | |
6689 | ||
6690 | /* Walk all elements but the first. */ | |
6691 | while (--len) | |
6692 | WALK_SUBTREE (TREE_VEC_ELT (*tp, len)); | |
6693 | ||
6694 | /* Now walk the first one as a tail call. */ | |
6695 | WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp, 0)); | |
6696 | } | |
6697 | ||
6698 | case COMPLEX_CST: | |
6699 | WALK_SUBTREE (TREE_REALPART (*tp)); | |
6700 | WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp)); | |
6701 | ||
6702 | case CONSTRUCTOR: | |
6703 | WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp)); | |
6704 | ||
6705 | case SAVE_EXPR: | |
6706 | WALK_SUBTREE_TAIL (TREE_OPERAND (*tp, 0)); | |
6707 | ||
6708 | case BIND_EXPR: | |
6709 | { | |
6710 | tree decl; | |
6711 | for (decl = BIND_EXPR_VARS (*tp); decl; decl = TREE_CHAIN (decl)) | |
6712 | { | |
6713 | /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk | |
6714 | into declarations that are just mentioned, rather than | |
6715 | declared; they don't really belong to this part of the tree. | |
6716 | And, we can see cycles: the initializer for a declaration | |
6717 | can refer to the declaration itself. */ | |
6718 | WALK_SUBTREE (DECL_INITIAL (decl)); | |
6719 | WALK_SUBTREE (DECL_SIZE (decl)); | |
6720 | WALK_SUBTREE (DECL_SIZE_UNIT (decl)); | |
6721 | } | |
6722 | WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp)); | |
6723 | } | |
6724 | ||
6725 | case STATEMENT_LIST: | |
6726 | { | |
6727 | tree_stmt_iterator i; | |
6728 | for (i = tsi_start (*tp); !tsi_end_p (i); tsi_next (&i)) | |
6729 | WALK_SUBTREE (*tsi_stmt_ptr (i)); | |
6730 | } | |
6731 | break; | |
6732 | ||
6733 | default: | |
6734 | /* ??? This could be a language-defined node. We really should make | |
6735 | a hook for it, but right now just ignore it. */ | |
6736 | break; | |
6737 | } | |
6738 | } | |
6739 | ||
6740 | /* We didn't find what we were looking for. */ | |
6741 | return NULL_TREE; | |
6742 | ||
6743 | #undef WALK_SUBTREE_TAIL | |
6744 | } | |
6745 | #undef WALK_SUBTREE | |
6746 | ||
6747 | /* Like walk_tree, but does not walk duplicate nodes more than once. */ | |
6748 | ||
6749 | tree | |
6750 | walk_tree_without_duplicates (tree *tp, walk_tree_fn func, void *data) | |
6751 | { | |
6752 | tree result; | |
6753 | struct pointer_set_t *pset; | |
6754 | ||
6755 | pset = pointer_set_create (); | |
6756 | result = walk_tree (tp, func, data, pset); | |
6757 | pointer_set_destroy (pset); | |
6758 | return result; | |
6759 | } | |
6760 | ||
e2500fed | 6761 | #include "gt-tree.h" |