]>
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, |
c913b6f1 | 3 | 1999, 2000, 2001 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 | |
30 | calls language-dependent routines defined (for C) in typecheck.c. | |
31 | ||
32 | The low-level allocation routines oballoc and permalloc | |
33 | are used also for allocating many other kinds of objects | |
34 | by all passes of the compiler. */ | |
35 | ||
36 | #include "config.h" | |
670ee920 | 37 | #include "system.h" |
c6a1db6c | 38 | #include "flags.h" |
c6a1db6c | 39 | #include "tree.h" |
6baf1cc8 | 40 | #include "tm_p.h" |
d69c4bd1 | 41 | #include "function.h" |
c6a1db6c | 42 | #include "obstack.h" |
10f0ad3d | 43 | #include "toplev.h" |
87ff9c8e | 44 | #include "ggc.h" |
d88f311b | 45 | #include "hashtab.h" |
3b304f5b | 46 | #include "output.h" |
672a6f42 | 47 | #include "target.h" |
956d6950 | 48 | |
c6a1db6c RS |
49 | #define obstack_chunk_alloc xmalloc |
50 | #define obstack_chunk_free free | |
dc478a5d | 51 | /* obstack.[ch] explicitly declined to prototype this. */ |
58782098 | 52 | extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj)); |
c6a1db6c | 53 | |
58782098 | 54 | static void unsave_expr_now_r PARAMS ((tree)); |
582db8e4 | 55 | |
1f8f4a0b | 56 | /* Objects allocated on this obstack last forever. */ |
c6a1db6c RS |
57 | |
58 | struct obstack permanent_obstack; | |
59 | ||
c6a1db6c RS |
60 | /* Table indexed by tree code giving a string containing a character |
61 | classifying the tree code. Possibilities are | |
62 | t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */ | |
63 | ||
64 | #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE, | |
65 | ||
0a6969ad | 66 | char tree_code_type[MAX_TREE_CODES] = { |
c6a1db6c RS |
67 | #include "tree.def" |
68 | }; | |
69 | #undef DEFTREECODE | |
70 | ||
71 | /* Table indexed by tree code giving number of expression | |
72 | operands beyond the fixed part of the node structure. | |
73 | Not used for types or decls. */ | |
74 | ||
75 | #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH, | |
76 | ||
0a6969ad | 77 | int tree_code_length[MAX_TREE_CODES] = { |
c6a1db6c RS |
78 | #include "tree.def" |
79 | }; | |
80 | #undef DEFTREECODE | |
81 | ||
82 | /* Names of tree components. | |
83 | Used for printing out the tree and error messages. */ | |
84 | #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME, | |
85 | ||
5f8ded66 | 86 | const char *tree_code_name[MAX_TREE_CODES] = { |
c6a1db6c RS |
87 | #include "tree.def" |
88 | }; | |
89 | #undef DEFTREECODE | |
90 | ||
c6a1db6c RS |
91 | /* Statistics-gathering stuff. */ |
92 | typedef enum | |
93 | { | |
03646189 RS |
94 | d_kind, |
95 | t_kind, | |
96 | b_kind, | |
97 | s_kind, | |
98 | r_kind, | |
99 | e_kind, | |
100 | c_kind, | |
101 | id_kind, | |
03646189 RS |
102 | perm_list_kind, |
103 | temp_list_kind, | |
104 | vec_kind, | |
105 | x_kind, | |
106 | lang_decl, | |
107 | lang_type, | |
108 | all_kinds | |
c6a1db6c | 109 | } tree_node_kind; |
03646189 | 110 | |
dc478a5d KH |
111 | int tree_node_counts[(int) all_kinds]; |
112 | int tree_node_sizes[(int) all_kinds]; | |
c6a1db6c | 113 | int id_string_size = 0; |
03646189 | 114 | |
341a243e | 115 | static const char * const tree_node_kind_names[] = { |
03646189 RS |
116 | "decls", |
117 | "types", | |
118 | "blocks", | |
119 | "stmts", | |
120 | "refs", | |
121 | "exprs", | |
122 | "constants", | |
123 | "identifiers", | |
03646189 RS |
124 | "perm_tree_lists", |
125 | "temp_tree_lists", | |
126 | "vecs", | |
127 | "random kinds", | |
128 | "lang_decl kinds", | |
129 | "lang_type kinds" | |
130 | }; | |
c6a1db6c | 131 | |
0e77444b RS |
132 | /* Unique id for next decl created. */ |
133 | static int next_decl_uid; | |
579f50b6 RK |
134 | /* Unique id for next type created. */ |
135 | static int next_type_uid = 1; | |
0e77444b | 136 | |
d88f311b ML |
137 | /* Since we cannot rehash a type after it is in the table, we have to |
138 | keep the hash code. */ | |
87ff9c8e RH |
139 | |
140 | struct type_hash | |
141 | { | |
d88f311b ML |
142 | unsigned long hash; |
143 | tree type; | |
87ff9c8e RH |
144 | }; |
145 | ||
dc478a5d | 146 | /* Initial size of the hash table (rounded to next prime). */ |
d88f311b | 147 | #define TYPE_HASH_INITIAL_SIZE 1000 |
87ff9c8e | 148 | |
d88f311b ML |
149 | /* Now here is the hash table. When recording a type, it is added to |
150 | the slot whose index is the hash code. Note that the hash table is | |
151 | used for several kinds of types (function types, array types and | |
152 | array index range types, for now). While all these live in the | |
153 | same table, they are completely independent, and the hash code is | |
154 | computed differently for each of these. */ | |
155 | ||
156 | htab_t type_hash_table; | |
87ff9c8e | 157 | |
58782098 KG |
158 | static void build_real_from_int_cst_1 PARAMS ((PTR)); |
159 | static void set_type_quals PARAMS ((tree, int)); | |
160 | static void append_random_chars PARAMS ((char *)); | |
d88f311b ML |
161 | static int type_hash_eq PARAMS ((const void*, const void*)); |
162 | static unsigned int type_hash_hash PARAMS ((const void*)); | |
163 | static void print_type_hash_statistics PARAMS((void)); | |
20217ac1 | 164 | static void finish_vector_type PARAMS((tree)); |
4c160717 RK |
165 | static int type_hash_marked_p PARAMS ((const void *)); |
166 | static void type_hash_mark PARAMS ((const void *)); | |
9ccb25d5 | 167 | static int mark_tree_hashtable_entry PARAMS((void **, void *)); |
0a818f84 | 168 | |
582db8e4 MM |
169 | /* If non-null, these are language-specific helper functions for |
170 | unsave_expr_now. If present, LANG_UNSAVE is called before its | |
171 | argument (an UNSAVE_EXPR) is to be unsaved, and all other | |
172 | processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is | |
173 | called from unsave_expr_1 for language-specific tree codes. */ | |
58782098 KG |
174 | void (*lang_unsave) PARAMS ((tree *)); |
175 | void (*lang_unsave_expr_now) PARAMS ((tree)); | |
5c7261ab | 176 | |
3fe30ff6 RH |
177 | /* If non-null, these are language-specific helper functions for |
178 | unsafe_for_reeval. Return negative to not handle some tree. */ | |
179 | int (*lang_unsafe_for_reeval) PARAMS ((tree)); | |
92643fea MM |
180 | |
181 | /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing | |
182 | that the assembler should talk about, set DECL_ASSEMBLER_NAME to an | |
183 | appropriate IDENTIFIER_NODE. Otherwise, set it to the | |
184 | ERROR_MARK_NODE to ensure that the assembler does not talk about | |
185 | it. */ | |
186 | void (*lang_set_decl_assembler_name) PARAMS ((tree)); | |
c6a1db6c | 187 | \f |
81b3411c | 188 | tree global_trees[TI_MAX]; |
7145ef21 | 189 | tree integer_types[itk_none]; |
81b3411c | 190 | \f |
92643fea MM |
191 | /* Set the DECL_ASSEMBLER_NAME for DECL. */ |
192 | void | |
193 | set_decl_assembler_name (decl) | |
194 | tree decl; | |
195 | { | |
196 | /* The language-independent code should never use the | |
197 | DECL_ASSEMBLER_NAME for lots of DECLs. Only FUNCTION_DECLs and | |
198 | VAR_DECLs for variables with static storage duration need a real | |
199 | DECL_ASSEMBLER_NAME. */ | |
200 | if (TREE_CODE (decl) == FUNCTION_DECL | |
201 | || (TREE_CODE (decl) == VAR_DECL | |
116b39e0 MM |
202 | && (TREE_STATIC (decl) |
203 | || DECL_EXTERNAL (decl) | |
204 | || TREE_PUBLIC (decl)))) | |
92643fea MM |
205 | /* By default, assume the name to use in assembly code is the |
206 | same as that used in the source language. (That's correct | |
207 | for C, and GCC used to set DECL_ASSEMBLER_NAME to the same | |
208 | value as DECL_NAME in build_decl, so this choice provides | |
209 | backwards compatibility with existing front-ends. */ | |
210 | SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl)); | |
211 | else | |
212 | /* Nobody should ever be asking for the DECL_ASSEMBLER_NAME of | |
213 | these DECLs -- unless they're in language-dependent code, in | |
214 | which case lang_set_decl_assembler_name should handle things. */ | |
215 | abort (); | |
216 | } | |
217 | \f | |
c6a1db6c RS |
218 | /* Init the principal obstacks. */ |
219 | ||
220 | void | |
221 | init_obstacks () | |
222 | { | |
c6a1db6c RS |
223 | gcc_obstack_init (&permanent_obstack); |
224 | ||
d4b60170 | 225 | /* Initialize the hash table of types. */ |
dc478a5d | 226 | type_hash_table = htab_create (TYPE_HASH_INITIAL_SIZE, type_hash_hash, |
d88f311b | 227 | type_hash_eq, 0); |
4c160717 RK |
228 | ggc_add_deletable_htab (type_hash_table, type_hash_marked_p, |
229 | type_hash_mark); | |
81b3411c | 230 | ggc_add_tree_root (global_trees, TI_MAX); |
7145ef21 | 231 | ggc_add_tree_root (integer_types, itk_none); |
92643fea MM |
232 | |
233 | /* Set lang_set_decl_set_assembler_name to a default value. */ | |
234 | lang_set_decl_assembler_name = set_decl_assembler_name; | |
c6a1db6c RS |
235 | } |
236 | ||
c6a1db6c | 237 | \f |
c6a1db6c RS |
238 | /* Allocate SIZE bytes in the permanent obstack |
239 | and return a pointer to them. */ | |
240 | ||
241 | char * | |
242 | permalloc (size) | |
37366632 | 243 | int size; |
c6a1db6c RS |
244 | { |
245 | return (char *) obstack_alloc (&permanent_obstack, size); | |
246 | } | |
247 | ||
248 | /* Allocate NELEM items of SIZE bytes in the permanent obstack | |
249 | and return a pointer to them. The storage is cleared before | |
250 | returning the value. */ | |
251 | ||
252 | char * | |
253 | perm_calloc (nelem, size) | |
254 | int nelem; | |
255 | long size; | |
256 | { | |
257 | char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size); | |
da61dec9 | 258 | memset (rval, 0, nelem * size); |
c6a1db6c RS |
259 | return rval; |
260 | } | |
261 | ||
c5620996 GK |
262 | /* Compute the number of bytes occupied by 'node'. This routine only |
263 | looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */ | |
264 | size_t | |
265 | tree_size (node) | |
266 | tree node; | |
267 | { | |
268 | enum tree_code code = TREE_CODE (node); | |
269 | ||
270 | switch (TREE_CODE_CLASS (code)) | |
271 | { | |
272 | case 'd': /* A decl node */ | |
273 | return sizeof (struct tree_decl); | |
274 | ||
275 | case 't': /* a type node */ | |
276 | return sizeof (struct tree_type); | |
277 | ||
278 | case 'b': /* a lexical block node */ | |
279 | return sizeof (struct tree_block); | |
280 | ||
281 | case 'r': /* a reference */ | |
282 | case 'e': /* an expression */ | |
283 | case 's': /* an expression with side effects */ | |
284 | case '<': /* a comparison expression */ | |
285 | case '1': /* a unary arithmetic expression */ | |
286 | case '2': /* a binary arithmetic expression */ | |
287 | return (sizeof (struct tree_exp) | |
288 | + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *)); | |
289 | ||
290 | case 'c': /* a constant */ | |
291 | /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of | |
292 | words is machine-dependent due to varying length of HOST_WIDE_INT, | |
293 | which might be wider than a pointer (e.g., long long). Similarly | |
294 | for REAL_CST, since the number of words is machine-dependent due | |
295 | to varying size and alignment of `double'. */ | |
296 | if (code == INTEGER_CST) | |
297 | return sizeof (struct tree_int_cst); | |
298 | else if (code == REAL_CST) | |
299 | return sizeof (struct tree_real_cst); | |
300 | else | |
301 | return (sizeof (struct tree_common) | |
302 | + TREE_CODE_LENGTH (code) * sizeof (char *)); | |
303 | ||
304 | case 'x': /* something random, like an identifier. */ | |
305 | { | |
306 | size_t length; | |
307 | length = (sizeof (struct tree_common) | |
308 | + TREE_CODE_LENGTH (code) * sizeof (char *)); | |
309 | if (code == TREE_VEC) | |
310 | length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *); | |
311 | return length; | |
312 | } | |
313 | ||
314 | default: | |
315 | abort (); | |
316 | } | |
317 | } | |
318 | ||
c6a1db6c | 319 | /* Return a newly allocated node of code CODE. |
c6a1db6c RS |
320 | For decl and type nodes, some other fields are initialized. |
321 | The rest of the node is initialized to zero. | |
322 | ||
323 | Achoo! I got a code in the node. */ | |
324 | ||
325 | tree | |
326 | make_node (code) | |
327 | enum tree_code code; | |
328 | { | |
b3694847 SS |
329 | tree t; |
330 | int type = TREE_CODE_CLASS (code); | |
331 | size_t length; | |
5e9defae | 332 | #ifdef GATHER_STATISTICS |
b3694847 | 333 | tree_node_kind kind; |
5e9defae | 334 | #endif |
c5620996 GK |
335 | struct tree_common ttmp; |
336 | ||
337 | /* We can't allocate a TREE_VEC without knowing how many elements | |
338 | it will have. */ | |
339 | if (code == TREE_VEC) | |
340 | abort (); | |
341 | ||
342 | TREE_SET_CODE ((tree)&ttmp, code); | |
343 | length = tree_size ((tree)&ttmp); | |
c6a1db6c | 344 | |
c5620996 | 345 | #ifdef GATHER_STATISTICS |
c6a1db6c RS |
346 | switch (type) |
347 | { | |
348 | case 'd': /* A decl node */ | |
c6a1db6c | 349 | kind = d_kind; |
c6a1db6c RS |
350 | break; |
351 | ||
352 | case 't': /* a type node */ | |
c6a1db6c | 353 | kind = t_kind; |
c6a1db6c RS |
354 | break; |
355 | ||
03646189 | 356 | case 'b': /* a lexical block */ |
03646189 | 357 | kind = b_kind; |
03646189 RS |
358 | break; |
359 | ||
c6a1db6c | 360 | case 's': /* an expression with side effects */ |
c6a1db6c | 361 | kind = s_kind; |
c5620996 GK |
362 | break; |
363 | ||
c6a1db6c | 364 | case 'r': /* a reference */ |
c6a1db6c | 365 | kind = r_kind; |
c5620996 GK |
366 | break; |
367 | ||
c6a1db6c RS |
368 | case 'e': /* an expression */ |
369 | case '<': /* a comparison expression */ | |
370 | case '1': /* a unary arithmetic expression */ | |
371 | case '2': /* a binary arithmetic expression */ | |
c6a1db6c | 372 | kind = e_kind; |
c6a1db6c RS |
373 | break; |
374 | ||
375 | case 'c': /* a constant */ | |
c6a1db6c | 376 | kind = c_kind; |
66212c2f | 377 | break; |
c6a1db6c RS |
378 | |
379 | case 'x': /* something random, like an identifier. */ | |
c6a1db6c RS |
380 | if (code == IDENTIFIER_NODE) |
381 | kind = id_kind; | |
c6a1db6c RS |
382 | else if (code == TREE_VEC) |
383 | kind = vec_kind; | |
384 | else | |
385 | kind = x_kind; | |
a7fcb968 RK |
386 | break; |
387 | ||
388 | default: | |
389 | abort (); | |
c6a1db6c RS |
390 | } |
391 | ||
dc478a5d KH |
392 | tree_node_counts[(int) kind]++; |
393 | tree_node_sizes[(int) kind] += length; | |
c6a1db6c RS |
394 | #endif |
395 | ||
c5620996 GK |
396 | t = ggc_alloc_tree (length); |
397 | ||
398 | memset ((PTR) t, 0, length); | |
399 | ||
c6a1db6c | 400 | TREE_SET_CODE (t, code); |
c6a1db6c RS |
401 | |
402 | switch (type) | |
403 | { | |
404 | case 's': | |
405 | TREE_SIDE_EFFECTS (t) = 1; | |
406 | TREE_TYPE (t) = void_type_node; | |
407 | break; | |
408 | ||
409 | case 'd': | |
c0920bf9 | 410 | if (code != FUNCTION_DECL) |
c7ee7249 | 411 | DECL_ALIGN (t) = 1; |
11cf4d18 | 412 | DECL_USER_ALIGN (t) = 0; |
23dfa477 | 413 | DECL_IN_SYSTEM_HEADER (t) = in_system_header; |
c6a1db6c | 414 | DECL_SOURCE_LINE (t) = lineno; |
dc478a5d | 415 | DECL_SOURCE_FILE (t) = |
a8a05998 | 416 | (input_filename) ? input_filename : "<built-in>"; |
0e77444b | 417 | DECL_UID (t) = next_decl_uid++; |
128e8aa9 RK |
418 | |
419 | /* We have not yet computed the alias set for this declaration. */ | |
3932261a | 420 | DECL_POINTER_ALIAS_SET (t) = -1; |
c6a1db6c RS |
421 | break; |
422 | ||
423 | case 't': | |
579f50b6 | 424 | TYPE_UID (t) = next_type_uid++; |
13c6f0d5 | 425 | TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0; |
11cf4d18 | 426 | TYPE_USER_ALIGN (t) = 0; |
c6a1db6c | 427 | TYPE_MAIN_VARIANT (t) = t; |
128e8aa9 RK |
428 | |
429 | /* Default to no attributes for type, but let target change that. */ | |
91e97eb8 | 430 | TYPE_ATTRIBUTES (t) = NULL_TREE; |
f6897b10 | 431 | (*targetm.set_default_type_attributes) (t); |
128e8aa9 RK |
432 | |
433 | /* We have not yet computed the alias set for this type. */ | |
41472af8 | 434 | TYPE_ALIAS_SET (t) = -1; |
c6a1db6c RS |
435 | break; |
436 | ||
437 | case 'c': | |
438 | TREE_CONSTANT (t) = 1; | |
439 | break; | |
783feeb0 MM |
440 | |
441 | case 'e': | |
442 | switch (code) | |
443 | { | |
444 | case INIT_EXPR: | |
445 | case MODIFY_EXPR: | |
446 | case VA_ARG_EXPR: | |
447 | case RTL_EXPR: | |
448 | case PREDECREMENT_EXPR: | |
449 | case PREINCREMENT_EXPR: | |
450 | case POSTDECREMENT_EXPR: | |
451 | case POSTINCREMENT_EXPR: | |
452 | /* All of these have side-effects, no matter what their | |
453 | operands are. */ | |
454 | TREE_SIDE_EFFECTS (t) = 1; | |
455 | break; | |
dc478a5d | 456 | |
783feeb0 MM |
457 | default: |
458 | break; | |
459 | } | |
460 | break; | |
c6a1db6c RS |
461 | } |
462 | ||
463 | return t; | |
464 | } | |
0f4fd75d FS |
465 | |
466 | /* A front-end can reset this to an appropriate function if types need | |
467 | special handling. */ | |
468 | ||
58782098 | 469 | tree (*make_lang_type_fn) PARAMS ((enum tree_code)) = make_node; |
0f4fd75d FS |
470 | |
471 | /* Return a new type (with the indicated CODE), doing whatever | |
472 | language-specific processing is required. */ | |
473 | ||
dc478a5d | 474 | tree |
0f4fd75d FS |
475 | make_lang_type (code) |
476 | enum tree_code code; | |
477 | { | |
478 | return (*make_lang_type_fn) (code); | |
479 | } | |
c6a1db6c | 480 | \f |
c3da6f12 | 481 | /* Return a new node with the same contents as NODE except that its |
3af4c257 | 482 | TREE_CHAIN is zero and it has a fresh uid. */ |
c6a1db6c RS |
483 | |
484 | tree | |
485 | copy_node (node) | |
486 | tree node; | |
487 | { | |
b3694847 SS |
488 | tree t; |
489 | enum tree_code code = TREE_CODE (node); | |
490 | size_t length; | |
c6a1db6c | 491 | |
c5620996 | 492 | length = tree_size (node); |
1f8f4a0b | 493 | t = ggc_alloc_tree (length); |
2e28f042 | 494 | memcpy (t, node, length); |
c6a1db6c | 495 | |
1e54d32b | 496 | TREE_CHAIN (t) = 0; |
69b7087e | 497 | TREE_ASM_WRITTEN (t) = 0; |
c6a1db6c | 498 | |
579f50b6 RK |
499 | if (TREE_CODE_CLASS (code) == 'd') |
500 | DECL_UID (t) = next_decl_uid++; | |
501 | else if (TREE_CODE_CLASS (code) == 't') | |
d9cbc259 RK |
502 | { |
503 | TYPE_UID (t) = next_type_uid++; | |
28238567 PB |
504 | /* The following is so that the debug code for |
505 | the copy is different from the original type. | |
506 | The two statements usually duplicate each other | |
507 | (because they clear fields of the same union), | |
0f41302f | 508 | but the optimizer should catch that. */ |
28238567 PB |
509 | TYPE_SYMTAB_POINTER (t) = 0; |
510 | TYPE_SYMTAB_ADDRESS (t) = 0; | |
d9cbc259 | 511 | } |
579f50b6 | 512 | |
c6a1db6c RS |
513 | return t; |
514 | } | |
515 | ||
516 | /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field. | |
517 | For example, this can copy a list made of TREE_LIST nodes. */ | |
518 | ||
519 | tree | |
520 | copy_list (list) | |
521 | tree list; | |
522 | { | |
523 | tree head; | |
b3694847 | 524 | tree prev, next; |
c6a1db6c RS |
525 | |
526 | if (list == 0) | |
527 | return 0; | |
528 | ||
529 | head = prev = copy_node (list); | |
530 | next = TREE_CHAIN (list); | |
531 | while (next) | |
532 | { | |
533 | TREE_CHAIN (prev) = copy_node (next); | |
534 | prev = TREE_CHAIN (prev); | |
535 | next = TREE_CHAIN (next); | |
536 | } | |
537 | return head; | |
538 | } | |
a94dbf2c | 539 | |
c6a1db6c RS |
540 | \f |
541 | /* Return a newly constructed INTEGER_CST node whose constant value | |
542 | is specified by the two ints LOW and HI. | |
dc478a5d | 543 | The TREE_TYPE is set to `int'. |
37366632 RK |
544 | |
545 | This function should be used via the `build_int_2' macro. */ | |
c6a1db6c RS |
546 | |
547 | tree | |
37366632 | 548 | build_int_2_wide (low, hi) |
f9e158c3 JM |
549 | unsigned HOST_WIDE_INT low; |
550 | HOST_WIDE_INT hi; | |
c6a1db6c | 551 | { |
b3694847 | 552 | tree t = make_node (INTEGER_CST); |
d4b60170 | 553 | |
c6a1db6c RS |
554 | TREE_INT_CST_LOW (t) = low; |
555 | TREE_INT_CST_HIGH (t) = hi; | |
556 | TREE_TYPE (t) = integer_type_node; | |
557 | return t; | |
558 | } | |
559 | ||
560 | /* Return a new REAL_CST node whose type is TYPE and value is D. */ | |
561 | ||
562 | tree | |
563 | build_real (type, d) | |
564 | tree type; | |
565 | REAL_VALUE_TYPE d; | |
566 | { | |
567 | tree v; | |
0afbe93d | 568 | int overflow = 0; |
c6a1db6c RS |
569 | |
570 | /* Check for valid float value for this type on this target machine; | |
571 | if not, can print error message and store a valid value in D. */ | |
572 | #ifdef CHECK_FLOAT_VALUE | |
0afbe93d | 573 | CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow); |
c6a1db6c RS |
574 | #endif |
575 | ||
576 | v = make_node (REAL_CST); | |
577 | TREE_TYPE (v) = type; | |
578 | TREE_REAL_CST (v) = d; | |
0afbe93d | 579 | TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow; |
c6a1db6c RS |
580 | return v; |
581 | } | |
582 | ||
583 | /* Return a new REAL_CST node whose type is TYPE | |
584 | and whose value is the integer value of the INTEGER_CST node I. */ | |
585 | ||
586 | #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC) | |
587 | ||
588 | REAL_VALUE_TYPE | |
84c7be4b | 589 | real_value_from_int_cst (type, i) |
7bdb32b9 | 590 | tree type ATTRIBUTE_UNUSED, i; |
c6a1db6c RS |
591 | { |
592 | REAL_VALUE_TYPE d; | |
2026444a | 593 | |
c6a1db6c | 594 | #ifdef REAL_ARITHMETIC |
e545d37f RK |
595 | /* Clear all bits of the real value type so that we can later do |
596 | bitwise comparisons to see if two values are the same. */ | |
da61dec9 | 597 | memset ((char *) &d, 0, sizeof d); |
e545d37f | 598 | |
15c76378 | 599 | if (! TREE_UNSIGNED (TREE_TYPE (i))) |
84c7be4b RK |
600 | REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i), |
601 | TYPE_MODE (type)); | |
15c76378 | 602 | else |
84c7be4b RK |
603 | REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i), |
604 | TREE_INT_CST_HIGH (i), TYPE_MODE (type)); | |
c6a1db6c | 605 | #else /* not REAL_ARITHMETIC */ |
5e9defae KG |
606 | /* Some 386 compilers mishandle unsigned int to float conversions, |
607 | so introduce a temporary variable E to avoid those bugs. */ | |
db7e5239 | 608 | if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i))) |
c6a1db6c | 609 | { |
5e9defae KG |
610 | REAL_VALUE_TYPE e; |
611 | ||
dc478a5d | 612 | d = (double) (~TREE_INT_CST_HIGH (i)); |
2026444a | 613 | e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) |
37366632 | 614 | * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))); |
2026444a | 615 | d *= e; |
dc478a5d | 616 | e = (double) (~TREE_INT_CST_LOW (i)); |
2026444a | 617 | d += e; |
c6a1db6c RS |
618 | d = (- d - 1.0); |
619 | } | |
620 | else | |
621 | { | |
5e9defae KG |
622 | REAL_VALUE_TYPE e; |
623 | ||
db7e5239 | 624 | d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i); |
2026444a | 625 | e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) |
dc478a5d | 626 | * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))); |
2026444a | 627 | d *= e; |
05bccae2 | 628 | e = (double) TREE_INT_CST_LOW (i); |
2026444a | 629 | d += e; |
c6a1db6c RS |
630 | } |
631 | #endif /* not REAL_ARITHMETIC */ | |
632 | return d; | |
633 | } | |
634 | ||
d4b60170 RK |
635 | /* Args to pass to and from build_real_from_int_cst_1. */ |
636 | ||
1a87eea2 KG |
637 | struct brfic_args |
638 | { | |
dc478a5d KH |
639 | tree type; /* Input: type to conver to. */ |
640 | tree i; /* Input: operand to convert. */ | |
641 | REAL_VALUE_TYPE d; /* Output: floating point value. */ | |
1a87eea2 KG |
642 | }; |
643 | ||
d4b60170 RK |
644 | /* Convert an integer to a floating point value while protected by a floating |
645 | point exception handler. */ | |
646 | ||
1a87eea2 KG |
647 | static void |
648 | build_real_from_int_cst_1 (data) | |
dc478a5d | 649 | PTR data; |
1a87eea2 | 650 | { |
d4b60170 | 651 | struct brfic_args *args = (struct brfic_args *) data; |
dc478a5d | 652 | |
1a87eea2 KG |
653 | #ifdef REAL_ARITHMETIC |
654 | args->d = real_value_from_int_cst (args->type, args->i); | |
655 | #else | |
d4b60170 RK |
656 | args->d |
657 | = REAL_VALUE_TRUNCATE (TYPE_MODE (args->type), | |
658 | real_value_from_int_cst (args->type, args->i)); | |
1a87eea2 KG |
659 | #endif |
660 | } | |
661 | ||
d4b60170 RK |
662 | /* Given a tree representing an integer constant I, return a tree |
663 | representing the same value as a floating-point constant of type TYPE. | |
664 | We cannot perform this operation if there is no way of doing arithmetic | |
665 | on floating-point values. */ | |
c6a1db6c RS |
666 | |
667 | tree | |
668 | build_real_from_int_cst (type, i) | |
669 | tree type; | |
670 | tree i; | |
671 | { | |
672 | tree v; | |
53d74c3c | 673 | int overflow = TREE_OVERFLOW (i); |
c6a1db6c | 674 | REAL_VALUE_TYPE d; |
1a87eea2 | 675 | struct brfic_args args; |
c6a1db6c RS |
676 | |
677 | v = make_node (REAL_CST); | |
678 | TREE_TYPE (v) = type; | |
679 | ||
1a87eea2 KG |
680 | /* Setup input for build_real_from_int_cst_1() */ |
681 | args.type = type; | |
682 | args.i = i; | |
683 | ||
684 | if (do_float_handler (build_real_from_int_cst_1, (PTR) &args)) | |
d4b60170 RK |
685 | /* Receive output from build_real_from_int_cst_1() */ |
686 | d = args.d; | |
1a87eea2 KG |
687 | else |
688 | { | |
689 | /* We got an exception from build_real_from_int_cst_1() */ | |
53d74c3c RK |
690 | d = dconst0; |
691 | overflow = 1; | |
53d74c3c | 692 | } |
dc478a5d | 693 | |
53d74c3c RK |
694 | /* Check for valid float value for this type on this target machine. */ |
695 | ||
c6a1db6c | 696 | #ifdef CHECK_FLOAT_VALUE |
53d74c3c | 697 | CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow); |
c6a1db6c RS |
698 | #endif |
699 | ||
700 | TREE_REAL_CST (v) = d; | |
53d74c3c | 701 | TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow; |
c6a1db6c RS |
702 | return v; |
703 | } | |
704 | ||
705 | #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */ | |
706 | ||
707 | /* Return a newly constructed STRING_CST node whose value is | |
708 | the LEN characters at STR. | |
709 | The TREE_TYPE is not initialized. */ | |
710 | ||
711 | tree | |
712 | build_string (len, str) | |
713 | int len; | |
37b37199 | 714 | const char *str; |
c6a1db6c | 715 | { |
b3694847 | 716 | tree s = make_node (STRING_CST); |
d4b60170 | 717 | |
c6a1db6c | 718 | TREE_STRING_LENGTH (s) = len; |
1f8f4a0b | 719 | TREE_STRING_POINTER (s) = ggc_alloc_string (str, len); |
d4b60170 | 720 | |
c6a1db6c RS |
721 | return s; |
722 | } | |
723 | ||
724 | /* Return a newly constructed COMPLEX_CST node whose value is | |
725 | specified by the real and imaginary parts REAL and IMAG. | |
b217d7fe RK |
726 | Both REAL and IMAG should be constant nodes. TYPE, if specified, |
727 | will be the type of the COMPLEX_CST; otherwise a new type will be made. */ | |
c6a1db6c RS |
728 | |
729 | tree | |
b217d7fe RK |
730 | build_complex (type, real, imag) |
731 | tree type; | |
c6a1db6c RS |
732 | tree real, imag; |
733 | { | |
b3694847 | 734 | tree t = make_node (COMPLEX_CST); |
53d74c3c | 735 | |
c6a1db6c RS |
736 | TREE_REALPART (t) = real; |
737 | TREE_IMAGPART (t) = imag; | |
b217d7fe | 738 | TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real)); |
53d74c3c RK |
739 | TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag); |
740 | TREE_CONSTANT_OVERFLOW (t) | |
741 | = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag); | |
c6a1db6c RS |
742 | return t; |
743 | } | |
744 | ||
745 | /* Build a newly constructed TREE_VEC node of length LEN. */ | |
0f41302f | 746 | |
c6a1db6c RS |
747 | tree |
748 | make_tree_vec (len) | |
749 | int len; | |
750 | { | |
b3694847 SS |
751 | tree t; |
752 | int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec); | |
c6a1db6c RS |
753 | |
754 | #ifdef GATHER_STATISTICS | |
755 | tree_node_counts[(int)vec_kind]++; | |
756 | tree_node_sizes[(int)vec_kind] += length; | |
757 | #endif | |
758 | ||
1f8f4a0b | 759 | t = ggc_alloc_tree (length); |
508f8149 | 760 | |
f8a83ee3 | 761 | memset ((PTR) t, 0, length); |
c6a1db6c RS |
762 | TREE_SET_CODE (t, TREE_VEC); |
763 | TREE_VEC_LENGTH (t) = len; | |
c6a1db6c RS |
764 | |
765 | return t; | |
766 | } | |
767 | \f | |
9ad265b0 RK |
768 | /* Return 1 if EXPR is the integer constant zero or a complex constant |
769 | of zero. */ | |
c6a1db6c RS |
770 | |
771 | int | |
772 | integer_zerop (expr) | |
773 | tree expr; | |
774 | { | |
d964285c | 775 | STRIP_NOPS (expr); |
c6a1db6c | 776 | |
9ad265b0 | 777 | return ((TREE_CODE (expr) == INTEGER_CST |
1ac876be | 778 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
779 | && TREE_INT_CST_LOW (expr) == 0 |
780 | && TREE_INT_CST_HIGH (expr) == 0) | |
781 | || (TREE_CODE (expr) == COMPLEX_CST | |
782 | && integer_zerop (TREE_REALPART (expr)) | |
783 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
784 | } |
785 | ||
9ad265b0 RK |
786 | /* Return 1 if EXPR is the integer constant one or the corresponding |
787 | complex constant. */ | |
c6a1db6c RS |
788 | |
789 | int | |
790 | integer_onep (expr) | |
791 | tree expr; | |
792 | { | |
d964285c | 793 | STRIP_NOPS (expr); |
c6a1db6c | 794 | |
9ad265b0 | 795 | return ((TREE_CODE (expr) == INTEGER_CST |
1ac876be | 796 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
797 | && TREE_INT_CST_LOW (expr) == 1 |
798 | && TREE_INT_CST_HIGH (expr) == 0) | |
799 | || (TREE_CODE (expr) == COMPLEX_CST | |
800 | && integer_onep (TREE_REALPART (expr)) | |
801 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
802 | } |
803 | ||
9ad265b0 RK |
804 | /* Return 1 if EXPR is an integer containing all 1's in as much precision as |
805 | it contains. Likewise for the corresponding complex constant. */ | |
c6a1db6c RS |
806 | |
807 | int | |
808 | integer_all_onesp (expr) | |
809 | tree expr; | |
810 | { | |
b3694847 SS |
811 | int prec; |
812 | int uns; | |
c6a1db6c | 813 | |
d964285c | 814 | STRIP_NOPS (expr); |
c6a1db6c | 815 | |
9ad265b0 RK |
816 | if (TREE_CODE (expr) == COMPLEX_CST |
817 | && integer_all_onesp (TREE_REALPART (expr)) | |
818 | && integer_zerop (TREE_IMAGPART (expr))) | |
819 | return 1; | |
820 | ||
1ac876be RK |
821 | else if (TREE_CODE (expr) != INTEGER_CST |
822 | || TREE_CONSTANT_OVERFLOW (expr)) | |
c6a1db6c RS |
823 | return 0; |
824 | ||
825 | uns = TREE_UNSIGNED (TREE_TYPE (expr)); | |
826 | if (!uns) | |
dc478a5d | 827 | return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0 |
05bccae2 | 828 | && TREE_INT_CST_HIGH (expr) == -1); |
c6a1db6c | 829 | |
8980b5a3 RK |
830 | /* Note that using TYPE_PRECISION here is wrong. We care about the |
831 | actual bits, not the (arbitrary) range of the type. */ | |
832 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr))); | |
37366632 | 833 | if (prec >= HOST_BITS_PER_WIDE_INT) |
c6a1db6c | 834 | { |
05bccae2 RK |
835 | HOST_WIDE_INT high_value; |
836 | int shift_amount; | |
c6a1db6c | 837 | |
37366632 | 838 | shift_amount = prec - HOST_BITS_PER_WIDE_INT; |
c6a1db6c | 839 | |
37366632 | 840 | if (shift_amount > HOST_BITS_PER_WIDE_INT) |
c6a1db6c RS |
841 | /* Can not handle precisions greater than twice the host int size. */ |
842 | abort (); | |
37366632 | 843 | else if (shift_amount == HOST_BITS_PER_WIDE_INT) |
c6a1db6c RS |
844 | /* Shifting by the host word size is undefined according to the ANSI |
845 | standard, so we must handle this as a special case. */ | |
846 | high_value = -1; | |
847 | else | |
37366632 | 848 | high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1; |
c6a1db6c | 849 | |
dc478a5d | 850 | return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0 |
05bccae2 | 851 | && TREE_INT_CST_HIGH (expr) == high_value); |
c6a1db6c RS |
852 | } |
853 | else | |
05bccae2 | 854 | return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1; |
c6a1db6c RS |
855 | } |
856 | ||
857 | /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only | |
858 | one bit on). */ | |
859 | ||
860 | int | |
861 | integer_pow2p (expr) | |
862 | tree expr; | |
863 | { | |
5cb1f2fa | 864 | int prec; |
37366632 | 865 | HOST_WIDE_INT high, low; |
c6a1db6c | 866 | |
d964285c | 867 | STRIP_NOPS (expr); |
c6a1db6c | 868 | |
9ad265b0 RK |
869 | if (TREE_CODE (expr) == COMPLEX_CST |
870 | && integer_pow2p (TREE_REALPART (expr)) | |
871 | && integer_zerop (TREE_IMAGPART (expr))) | |
872 | return 1; | |
873 | ||
1ac876be | 874 | if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr)) |
c6a1db6c RS |
875 | return 0; |
876 | ||
e5e809f4 | 877 | prec = (POINTER_TYPE_P (TREE_TYPE (expr)) |
5cb1f2fa | 878 | ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr))); |
c6a1db6c RS |
879 | high = TREE_INT_CST_HIGH (expr); |
880 | low = TREE_INT_CST_LOW (expr); | |
881 | ||
5cb1f2fa RK |
882 | /* First clear all bits that are beyond the type's precision in case |
883 | we've been sign extended. */ | |
884 | ||
885 | if (prec == 2 * HOST_BITS_PER_WIDE_INT) | |
886 | ; | |
887 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
888 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
889 | else | |
890 | { | |
891 | high = 0; | |
892 | if (prec < HOST_BITS_PER_WIDE_INT) | |
893 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
894 | } | |
895 | ||
c6a1db6c RS |
896 | if (high == 0 && low == 0) |
897 | return 0; | |
898 | ||
899 | return ((high == 0 && (low & (low - 1)) == 0) | |
900 | || (low == 0 && (high & (high - 1)) == 0)); | |
901 | } | |
902 | ||
5cb1f2fa RK |
903 | /* Return the power of two represented by a tree node known to be a |
904 | power of two. */ | |
905 | ||
906 | int | |
907 | tree_log2 (expr) | |
908 | tree expr; | |
909 | { | |
910 | int prec; | |
911 | HOST_WIDE_INT high, low; | |
912 | ||
913 | STRIP_NOPS (expr); | |
914 | ||
915 | if (TREE_CODE (expr) == COMPLEX_CST) | |
916 | return tree_log2 (TREE_REALPART (expr)); | |
917 | ||
e5e809f4 | 918 | prec = (POINTER_TYPE_P (TREE_TYPE (expr)) |
5cb1f2fa RK |
919 | ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr))); |
920 | ||
921 | high = TREE_INT_CST_HIGH (expr); | |
922 | low = TREE_INT_CST_LOW (expr); | |
923 | ||
924 | /* First clear all bits that are beyond the type's precision in case | |
925 | we've been sign extended. */ | |
926 | ||
927 | if (prec == 2 * HOST_BITS_PER_WIDE_INT) | |
928 | ; | |
929 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
930 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
931 | else | |
932 | { | |
933 | high = 0; | |
934 | if (prec < HOST_BITS_PER_WIDE_INT) | |
935 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
936 | } | |
937 | ||
938 | return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high) | |
dc478a5d | 939 | : exact_log2 (low)); |
5cb1f2fa RK |
940 | } |
941 | ||
05bccae2 RK |
942 | /* Similar, but return the largest integer Y such that 2 ** Y is less |
943 | than or equal to EXPR. */ | |
944 | ||
945 | int | |
946 | tree_floor_log2 (expr) | |
947 | tree expr; | |
948 | { | |
949 | int prec; | |
950 | HOST_WIDE_INT high, low; | |
951 | ||
952 | STRIP_NOPS (expr); | |
953 | ||
954 | if (TREE_CODE (expr) == COMPLEX_CST) | |
955 | return tree_log2 (TREE_REALPART (expr)); | |
956 | ||
957 | prec = (POINTER_TYPE_P (TREE_TYPE (expr)) | |
958 | ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr))); | |
959 | ||
960 | high = TREE_INT_CST_HIGH (expr); | |
961 | low = TREE_INT_CST_LOW (expr); | |
962 | ||
963 | /* First clear all bits that are beyond the type's precision in case | |
964 | we've been sign extended. Ignore if type's precision hasn't been set | |
965 | since what we are doing is setting it. */ | |
966 | ||
967 | if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0) | |
968 | ; | |
969 | else if (prec > HOST_BITS_PER_WIDE_INT) | |
970 | high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT)); | |
971 | else | |
972 | { | |
973 | high = 0; | |
974 | if (prec < HOST_BITS_PER_WIDE_INT) | |
975 | low &= ~((HOST_WIDE_INT) (-1) << prec); | |
976 | } | |
977 | ||
978 | return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high) | |
979 | : floor_log2 (low)); | |
980 | } | |
981 | ||
c6a1db6c RS |
982 | /* Return 1 if EXPR is the real constant zero. */ |
983 | ||
984 | int | |
985 | real_zerop (expr) | |
986 | tree expr; | |
987 | { | |
d964285c | 988 | STRIP_NOPS (expr); |
c6a1db6c | 989 | |
9ad265b0 | 990 | return ((TREE_CODE (expr) == REAL_CST |
1ac876be | 991 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
992 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)) |
993 | || (TREE_CODE (expr) == COMPLEX_CST | |
994 | && real_zerop (TREE_REALPART (expr)) | |
995 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
996 | } |
997 | ||
9ad265b0 | 998 | /* Return 1 if EXPR is the real constant one in real or complex form. */ |
c6a1db6c RS |
999 | |
1000 | int | |
1001 | real_onep (expr) | |
1002 | tree expr; | |
1003 | { | |
d964285c | 1004 | STRIP_NOPS (expr); |
c6a1db6c | 1005 | |
9ad265b0 | 1006 | return ((TREE_CODE (expr) == REAL_CST |
1ac876be | 1007 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
1008 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)) |
1009 | || (TREE_CODE (expr) == COMPLEX_CST | |
1010 | && real_onep (TREE_REALPART (expr)) | |
1011 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1012 | } |
1013 | ||
1014 | /* Return 1 if EXPR is the real constant two. */ | |
1015 | ||
1016 | int | |
1017 | real_twop (expr) | |
1018 | tree expr; | |
1019 | { | |
d964285c | 1020 | STRIP_NOPS (expr); |
c6a1db6c | 1021 | |
9ad265b0 | 1022 | return ((TREE_CODE (expr) == REAL_CST |
1ac876be | 1023 | && ! TREE_CONSTANT_OVERFLOW (expr) |
9ad265b0 RK |
1024 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)) |
1025 | || (TREE_CODE (expr) == COMPLEX_CST | |
1026 | && real_twop (TREE_REALPART (expr)) | |
1027 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1028 | } |
1029 | ||
1030 | /* Nonzero if EXP is a constant or a cast of a constant. */ | |
dc478a5d | 1031 | |
c6a1db6c RS |
1032 | int |
1033 | really_constant_p (exp) | |
1034 | tree exp; | |
1035 | { | |
d964285c | 1036 | /* This is not quite the same as STRIP_NOPS. It does more. */ |
c6a1db6c RS |
1037 | while (TREE_CODE (exp) == NOP_EXPR |
1038 | || TREE_CODE (exp) == CONVERT_EXPR | |
1039 | || TREE_CODE (exp) == NON_LVALUE_EXPR) | |
1040 | exp = TREE_OPERAND (exp, 0); | |
1041 | return TREE_CONSTANT (exp); | |
1042 | } | |
1043 | \f | |
1044 | /* Return first list element whose TREE_VALUE is ELEM. | |
2a3c15b5 | 1045 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1046 | |
1047 | tree | |
1048 | value_member (elem, list) | |
1049 | tree elem, list; | |
1050 | { | |
1051 | while (list) | |
1052 | { | |
1053 | if (elem == TREE_VALUE (list)) | |
1054 | return list; | |
1055 | list = TREE_CHAIN (list); | |
1056 | } | |
1057 | return NULL_TREE; | |
1058 | } | |
1059 | ||
1060 | /* Return first list element whose TREE_PURPOSE is ELEM. | |
2a3c15b5 | 1061 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1062 | |
1063 | tree | |
1064 | purpose_member (elem, list) | |
1065 | tree elem, list; | |
1066 | { | |
1067 | while (list) | |
1068 | { | |
1069 | if (elem == TREE_PURPOSE (list)) | |
1070 | return list; | |
1071 | list = TREE_CHAIN (list); | |
1072 | } | |
1073 | return NULL_TREE; | |
1074 | } | |
1075 | ||
1076 | /* Return first list element whose BINFO_TYPE is ELEM. | |
2a3c15b5 | 1077 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1078 | |
1079 | tree | |
1080 | binfo_member (elem, list) | |
1081 | tree elem, list; | |
1082 | { | |
1083 | while (list) | |
1084 | { | |
1085 | if (elem == BINFO_TYPE (list)) | |
1086 | return list; | |
1087 | list = TREE_CHAIN (list); | |
1088 | } | |
1089 | return NULL_TREE; | |
1090 | } | |
1091 | ||
0f41302f | 1092 | /* Return nonzero if ELEM is part of the chain CHAIN. */ |
c6a1db6c RS |
1093 | |
1094 | int | |
1095 | chain_member (elem, chain) | |
1096 | tree elem, chain; | |
1097 | { | |
1098 | while (chain) | |
1099 | { | |
1100 | if (elem == chain) | |
1101 | return 1; | |
1102 | chain = TREE_CHAIN (chain); | |
1103 | } | |
1104 | ||
1105 | return 0; | |
1106 | } | |
1107 | ||
1a2927d2 | 1108 | /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of |
d4b60170 RK |
1109 | chain CHAIN. This and the next function are currently unused, but |
1110 | are retained for completeness. */ | |
1a2927d2 RK |
1111 | |
1112 | int | |
1113 | chain_member_value (elem, chain) | |
1114 | tree elem, chain; | |
1115 | { | |
1116 | while (chain) | |
1117 | { | |
1118 | if (elem == TREE_VALUE (chain)) | |
1119 | return 1; | |
1120 | chain = TREE_CHAIN (chain); | |
1121 | } | |
1122 | ||
1123 | return 0; | |
1124 | } | |
1125 | ||
33a79dfa | 1126 | /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN) |
0f41302f | 1127 | for any piece of chain CHAIN. */ |
0bcec367 RK |
1128 | |
1129 | int | |
1130 | chain_member_purpose (elem, chain) | |
1131 | tree elem, chain; | |
1132 | { | |
0bcec367 RK |
1133 | while (chain) |
1134 | { | |
33a79dfa | 1135 | if (elem == TREE_PURPOSE (chain)) |
0bcec367 RK |
1136 | return 1; |
1137 | chain = TREE_CHAIN (chain); | |
1138 | } | |
1139 | ||
1140 | return 0; | |
1141 | } | |
1142 | ||
c6a1db6c RS |
1143 | /* Return the length of a chain of nodes chained through TREE_CHAIN. |
1144 | We expect a null pointer to mark the end of the chain. | |
1145 | This is the Lisp primitive `length'. */ | |
1146 | ||
1147 | int | |
1148 | list_length (t) | |
1149 | tree t; | |
1150 | { | |
b3694847 SS |
1151 | tree tail; |
1152 | int len = 0; | |
c6a1db6c RS |
1153 | |
1154 | for (tail = t; tail; tail = TREE_CHAIN (tail)) | |
1155 | len++; | |
1156 | ||
1157 | return len; | |
1158 | } | |
1159 | ||
c3b247b4 JM |
1160 | /* Returns the number of FIELD_DECLs in TYPE. */ |
1161 | ||
1162 | int | |
1163 | fields_length (type) | |
1164 | tree type; | |
1165 | { | |
1166 | tree t = TYPE_FIELDS (type); | |
1167 | int count = 0; | |
1168 | ||
1169 | for (; t; t = TREE_CHAIN (t)) | |
1170 | if (TREE_CODE (t) == FIELD_DECL) | |
1171 | ++count; | |
1172 | ||
1173 | return count; | |
1174 | } | |
1175 | ||
c6a1db6c RS |
1176 | /* Concatenate two chains of nodes (chained through TREE_CHAIN) |
1177 | by modifying the last node in chain 1 to point to chain 2. | |
1178 | This is the Lisp primitive `nconc'. */ | |
1179 | ||
1180 | tree | |
1181 | chainon (op1, op2) | |
1182 | tree op1, op2; | |
1183 | { | |
c6a1db6c RS |
1184 | |
1185 | if (op1) | |
1186 | { | |
b3694847 | 1187 | tree t1; |
f4524c9e | 1188 | #ifdef ENABLE_TREE_CHECKING |
b3694847 | 1189 | tree t2; |
cbbfcb3b | 1190 | #endif |
1810c3fa RK |
1191 | |
1192 | for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1)) | |
1193 | ; | |
1194 | TREE_CHAIN (t1) = op2; | |
f4524c9e | 1195 | #ifdef ENABLE_TREE_CHECKING |
1810c3fa RK |
1196 | for (t2 = op2; t2; t2 = TREE_CHAIN (t2)) |
1197 | if (t2 == t1) | |
1198 | abort (); /* Circularity created. */ | |
0f4668ef | 1199 | #endif |
c6a1db6c RS |
1200 | return op1; |
1201 | } | |
dc478a5d KH |
1202 | else |
1203 | return op2; | |
c6a1db6c RS |
1204 | } |
1205 | ||
1206 | /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */ | |
1207 | ||
1208 | tree | |
1209 | tree_last (chain) | |
b3694847 | 1210 | tree chain; |
c6a1db6c | 1211 | { |
b3694847 | 1212 | tree next; |
c6a1db6c | 1213 | if (chain) |
5e9defae | 1214 | while ((next = TREE_CHAIN (chain))) |
c6a1db6c RS |
1215 | chain = next; |
1216 | return chain; | |
1217 | } | |
1218 | ||
1219 | /* Reverse the order of elements in the chain T, | |
1220 | and return the new head of the chain (old last element). */ | |
1221 | ||
1222 | tree | |
1223 | nreverse (t) | |
1224 | tree t; | |
1225 | { | |
b3694847 | 1226 | tree prev = 0, decl, next; |
c6a1db6c RS |
1227 | for (decl = t; decl; decl = next) |
1228 | { | |
1229 | next = TREE_CHAIN (decl); | |
1230 | TREE_CHAIN (decl) = prev; | |
1231 | prev = decl; | |
1232 | } | |
1233 | return prev; | |
1234 | } | |
1235 | ||
1236 | /* Given a chain CHAIN of tree nodes, | |
1237 | construct and return a list of those nodes. */ | |
1238 | ||
1239 | tree | |
1240 | listify (chain) | |
1241 | tree chain; | |
1242 | { | |
1243 | tree result = NULL_TREE; | |
1244 | tree in_tail = chain; | |
1245 | tree out_tail = NULL_TREE; | |
1246 | ||
1247 | while (in_tail) | |
1248 | { | |
1249 | tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE); | |
1250 | if (out_tail) | |
1251 | TREE_CHAIN (out_tail) = next; | |
1252 | else | |
1253 | result = next; | |
1254 | out_tail = next; | |
1255 | in_tail = TREE_CHAIN (in_tail); | |
1256 | } | |
1257 | ||
1258 | return result; | |
1259 | } | |
1260 | \f | |
1261 | /* Return a newly created TREE_LIST node whose | |
1262 | purpose and value fields are PARM and VALUE. */ | |
1263 | ||
1264 | tree | |
1265 | build_tree_list (parm, value) | |
1266 | tree parm, value; | |
1267 | { | |
b3694847 | 1268 | tree t = make_node (TREE_LIST); |
c6a1db6c RS |
1269 | TREE_PURPOSE (t) = parm; |
1270 | TREE_VALUE (t) = value; | |
1271 | return t; | |
1272 | } | |
1273 | ||
c6a1db6c RS |
1274 | /* Return a newly created TREE_LIST node whose |
1275 | purpose and value fields are PARM and VALUE | |
1276 | and whose TREE_CHAIN is CHAIN. */ | |
1277 | ||
1278 | tree | |
1279 | tree_cons (purpose, value, chain) | |
1280 | tree purpose, value, chain; | |
1281 | { | |
b3694847 | 1282 | tree node; |
a3770a81 | 1283 | |
1f8f4a0b | 1284 | node = ggc_alloc_tree (sizeof (struct tree_list)); |
f8a83ee3 ZW |
1285 | |
1286 | memset (node, 0, sizeof (struct tree_common)); | |
a3770a81 | 1287 | |
c6a1db6c | 1288 | #ifdef GATHER_STATISTICS |
ad41cc2a RK |
1289 | tree_node_counts[(int) x_kind]++; |
1290 | tree_node_sizes[(int) x_kind] += sizeof (struct tree_list); | |
c6a1db6c RS |
1291 | #endif |
1292 | ||
c6a1db6c | 1293 | TREE_SET_CODE (node, TREE_LIST); |
c6a1db6c RS |
1294 | TREE_CHAIN (node) = chain; |
1295 | TREE_PURPOSE (node) = purpose; | |
1296 | TREE_VALUE (node) = value; | |
1297 | return node; | |
1298 | } | |
1299 | ||
c6a1db6c RS |
1300 | \f |
1301 | /* Return the size nominally occupied by an object of type TYPE | |
1302 | when it resides in memory. The value is measured in units of bytes, | |
1303 | and its data type is that normally used for type sizes | |
1304 | (which is the first type created by make_signed_type or | |
1305 | make_unsigned_type). */ | |
1306 | ||
1307 | tree | |
1308 | size_in_bytes (type) | |
1309 | tree type; | |
1310 | { | |
cdc5a032 RS |
1311 | tree t; |
1312 | ||
c6a1db6c RS |
1313 | if (type == error_mark_node) |
1314 | return integer_zero_node; | |
ead17059 | 1315 | |
c6a1db6c | 1316 | type = TYPE_MAIN_VARIANT (type); |
ead17059 | 1317 | t = TYPE_SIZE_UNIT (type); |
d4b60170 | 1318 | |
ead17059 | 1319 | if (t == 0) |
c6a1db6c | 1320 | { |
37366632 | 1321 | incomplete_type_error (NULL_TREE, type); |
dc397323 | 1322 | return size_zero_node; |
c6a1db6c | 1323 | } |
d4b60170 | 1324 | |
4d7d0403 | 1325 | if (TREE_CODE (t) == INTEGER_CST) |
b6542989 | 1326 | force_fit_type (t, 0); |
ead17059 | 1327 | |
cdc5a032 | 1328 | return t; |
c6a1db6c RS |
1329 | } |
1330 | ||
e5e809f4 JL |
1331 | /* Return the size of TYPE (in bytes) as a wide integer |
1332 | or return -1 if the size can vary or is larger than an integer. */ | |
c6a1db6c | 1333 | |
e5e809f4 | 1334 | HOST_WIDE_INT |
c6a1db6c RS |
1335 | int_size_in_bytes (type) |
1336 | tree type; | |
1337 | { | |
e5e809f4 JL |
1338 | tree t; |
1339 | ||
c6a1db6c RS |
1340 | if (type == error_mark_node) |
1341 | return 0; | |
e5e809f4 | 1342 | |
c6a1db6c | 1343 | type = TYPE_MAIN_VARIANT (type); |
ead17059 RH |
1344 | t = TYPE_SIZE_UNIT (type); |
1345 | if (t == 0 | |
1346 | || TREE_CODE (t) != INTEGER_CST | |
d4b60170 | 1347 | || TREE_OVERFLOW (t) |
665f2503 RK |
1348 | || TREE_INT_CST_HIGH (t) != 0 |
1349 | /* If the result would appear negative, it's too big to represent. */ | |
1350 | || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0) | |
c6a1db6c | 1351 | return -1; |
e5e809f4 JL |
1352 | |
1353 | return TREE_INT_CST_LOW (t); | |
c6a1db6c | 1354 | } |
665f2503 RK |
1355 | \f |
1356 | /* Return the bit position of FIELD, in bits from the start of the record. | |
1357 | This is a tree of type bitsizetype. */ | |
1358 | ||
1359 | tree | |
1360 | bit_position (field) | |
1361 | tree field; | |
1362 | { | |
f2704b9f RK |
1363 | |
1364 | return bit_from_pos (DECL_FIELD_OFFSET (field), | |
1365 | DECL_FIELD_BIT_OFFSET (field)); | |
665f2503 | 1366 | } |
729a2125 | 1367 | |
665f2503 RK |
1368 | /* Likewise, but return as an integer. Abort if it cannot be represented |
1369 | in that way (since it could be a signed value, we don't have the option | |
1370 | of returning -1 like int_size_in_byte can. */ | |
1371 | ||
1372 | HOST_WIDE_INT | |
1373 | int_bit_position (field) | |
1374 | tree field; | |
1375 | { | |
1376 | return tree_low_cst (bit_position (field), 0); | |
1377 | } | |
1378 | \f | |
770ae6cc RK |
1379 | /* Return the byte position of FIELD, in bytes from the start of the record. |
1380 | This is a tree of type sizetype. */ | |
1381 | ||
1382 | tree | |
1383 | byte_position (field) | |
1384 | tree field; | |
1385 | { | |
f2704b9f RK |
1386 | return byte_from_pos (DECL_FIELD_OFFSET (field), |
1387 | DECL_FIELD_BIT_OFFSET (field)); | |
770ae6cc RK |
1388 | } |
1389 | ||
1390 | /* Likewise, but return as an integer. Abort if it cannot be represented | |
1391 | in that way (since it could be a signed value, we don't have the option | |
1392 | of returning -1 like int_size_in_byte can. */ | |
1393 | ||
1394 | HOST_WIDE_INT | |
1395 | int_byte_position (field) | |
1396 | tree field; | |
1397 | { | |
1398 | return tree_low_cst (byte_position (field), 0); | |
1399 | } | |
1400 | \f | |
665f2503 | 1401 | /* Return the strictest alignment, in bits, that T is known to have. */ |
729a2125 RK |
1402 | |
1403 | unsigned int | |
1404 | expr_align (t) | |
1405 | tree t; | |
1406 | { | |
1407 | unsigned int align0, align1; | |
1408 | ||
1409 | switch (TREE_CODE (t)) | |
1410 | { | |
1411 | case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR: | |
1412 | /* If we have conversions, we know that the alignment of the | |
1413 | object must meet each of the alignments of the types. */ | |
1414 | align0 = expr_align (TREE_OPERAND (t, 0)); | |
1415 | align1 = TYPE_ALIGN (TREE_TYPE (t)); | |
1416 | return MAX (align0, align1); | |
1417 | ||
1418 | case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR: | |
1419 | case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR: | |
1420 | case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR: | |
1421 | /* These don't change the alignment of an object. */ | |
1422 | return expr_align (TREE_OPERAND (t, 0)); | |
1423 | ||
1424 | case COND_EXPR: | |
1425 | /* The best we can do is say that the alignment is the least aligned | |
1426 | of the two arms. */ | |
1427 | align0 = expr_align (TREE_OPERAND (t, 1)); | |
1428 | align1 = expr_align (TREE_OPERAND (t, 2)); | |
1429 | return MIN (align0, align1); | |
1430 | ||
06ceef4e | 1431 | case LABEL_DECL: case CONST_DECL: |
729a2125 RK |
1432 | case VAR_DECL: case PARM_DECL: case RESULT_DECL: |
1433 | if (DECL_ALIGN (t) != 0) | |
1434 | return DECL_ALIGN (t); | |
1435 | break; | |
1436 | ||
06ceef4e RK |
1437 | case FUNCTION_DECL: |
1438 | return FUNCTION_BOUNDARY; | |
1439 | ||
729a2125 RK |
1440 | default: |
1441 | break; | |
1442 | } | |
1443 | ||
1444 | /* Otherwise take the alignment from that of the type. */ | |
1445 | return TYPE_ALIGN (TREE_TYPE (t)); | |
1446 | } | |
c0560b8b RK |
1447 | \f |
1448 | /* Return, as a tree node, the number of elements for TYPE (which is an | |
d26f8097 | 1449 | ARRAY_TYPE) minus one. This counts only elements of the top array. */ |
c6a1db6c RS |
1450 | |
1451 | tree | |
1452 | array_type_nelts (type) | |
1453 | tree type; | |
1454 | { | |
7671d67b BK |
1455 | tree index_type, min, max; |
1456 | ||
1457 | /* If they did it with unspecified bounds, then we should have already | |
1458 | given an error about it before we got here. */ | |
1459 | if (! TYPE_DOMAIN (type)) | |
1460 | return error_mark_node; | |
1461 | ||
1462 | index_type = TYPE_DOMAIN (type); | |
1463 | min = TYPE_MIN_VALUE (index_type); | |
1464 | max = TYPE_MAX_VALUE (index_type); | |
83b853c9 | 1465 | |
83b853c9 JM |
1466 | return (integer_zerop (min) |
1467 | ? max | |
1468 | : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min))); | |
c6a1db6c RS |
1469 | } |
1470 | \f | |
1471 | /* Return nonzero if arg is static -- a reference to an object in | |
1472 | static storage. This is not the same as the C meaning of `static'. */ | |
1473 | ||
1474 | int | |
1475 | staticp (arg) | |
1476 | tree arg; | |
1477 | { | |
1478 | switch (TREE_CODE (arg)) | |
1479 | { | |
c6a1db6c | 1480 | case FUNCTION_DECL: |
1324c5de | 1481 | /* Nested functions aren't static, since taking their address |
86270344 | 1482 | involves a trampoline. */ |
1c12c179 RK |
1483 | return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg)) |
1484 | && ! DECL_NON_ADDR_CONST_P (arg); | |
27da1b4d | 1485 | |
86270344 | 1486 | case VAR_DECL: |
27da1b4d | 1487 | return (TREE_STATIC (arg) || DECL_EXTERNAL (arg)) |
1c12c179 | 1488 | && ! DECL_NON_ADDR_CONST_P (arg); |
c6a1db6c | 1489 | |
492c86a4 RK |
1490 | case CONSTRUCTOR: |
1491 | return TREE_STATIC (arg); | |
1492 | ||
1c12c179 | 1493 | case LABEL_DECL: |
c6a1db6c RS |
1494 | case STRING_CST: |
1495 | return 1; | |
1496 | ||
f7fa6ef9 RK |
1497 | /* If we are referencing a bitfield, we can't evaluate an |
1498 | ADDR_EXPR at compile time and so it isn't a constant. */ | |
c6a1db6c | 1499 | case COMPONENT_REF: |
f7fa6ef9 RK |
1500 | return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1)) |
1501 | && staticp (TREE_OPERAND (arg, 0))); | |
1502 | ||
c6a1db6c | 1503 | case BIT_FIELD_REF: |
f7fa6ef9 | 1504 | return 0; |
c6a1db6c | 1505 | |
2cd2a93e RK |
1506 | #if 0 |
1507 | /* This case is technically correct, but results in setting | |
1508 | TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at | |
1509 | compile time. */ | |
c6a1db6c RS |
1510 | case INDIRECT_REF: |
1511 | return TREE_CONSTANT (TREE_OPERAND (arg, 0)); | |
2cd2a93e | 1512 | #endif |
c6a1db6c RS |
1513 | |
1514 | case ARRAY_REF: | |
b4e3fabb | 1515 | case ARRAY_RANGE_REF: |
c6a1db6c RS |
1516 | if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST |
1517 | && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST) | |
1518 | return staticp (TREE_OPERAND (arg, 0)); | |
c6a1db6c | 1519 | |
e9a25f70 JL |
1520 | default: |
1521 | return 0; | |
1522 | } | |
c6a1db6c RS |
1523 | } |
1524 | \f | |
3aa77500 RS |
1525 | /* Wrap a SAVE_EXPR around EXPR, if appropriate. |
1526 | Do this to any expression which may be used in more than one place, | |
1527 | but must be evaluated only once. | |
1528 | ||
1529 | Normally, expand_expr would reevaluate the expression each time. | |
1530 | Calling save_expr produces something that is evaluated and recorded | |
1531 | the first time expand_expr is called on it. Subsequent calls to | |
1532 | expand_expr just reuse the recorded value. | |
1533 | ||
1534 | The call to expand_expr that generates code that actually computes | |
1535 | the value is the first call *at compile time*. Subsequent calls | |
1536 | *at compile time* generate code to use the saved value. | |
1537 | This produces correct result provided that *at run time* control | |
1538 | always flows through the insns made by the first expand_expr | |
1539 | before reaching the other places where the save_expr was evaluated. | |
1540 | You, the caller of save_expr, must make sure this is so. | |
1541 | ||
1542 | Constants, and certain read-only nodes, are returned with no | |
1543 | SAVE_EXPR because that is safe. Expressions containing placeholders | |
c5af9901 RK |
1544 | are not touched; see tree.def for an explanation of what these |
1545 | are used for. */ | |
c6a1db6c RS |
1546 | |
1547 | tree | |
1548 | save_expr (expr) | |
1549 | tree expr; | |
1550 | { | |
b3694847 | 1551 | tree t = fold (expr); |
c6a1db6c RS |
1552 | |
1553 | /* We don't care about whether this can be used as an lvalue in this | |
1554 | context. */ | |
1555 | while (TREE_CODE (t) == NON_LVALUE_EXPR) | |
1556 | t = TREE_OPERAND (t, 0); | |
1557 | ||
1558 | /* If the tree evaluates to a constant, then we don't want to hide that | |
1559 | fact (i.e. this allows further folding, and direct checks for constants). | |
af929c62 | 1560 | However, a read-only object that has side effects cannot be bypassed. |
dc478a5d | 1561 | Since it is no problem to reevaluate literals, we just return the |
0f41302f | 1562 | literal node. */ |
c6a1db6c | 1563 | |
af929c62 | 1564 | if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t)) |
e0094edb | 1565 | || TREE_CODE (t) == SAVE_EXPR || TREE_CODE (t) == ERROR_MARK) |
c6a1db6c RS |
1566 | return t; |
1567 | ||
dec20b4b RK |
1568 | /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since |
1569 | it means that the size or offset of some field of an object depends on | |
1570 | the value within another field. | |
1571 | ||
1572 | Note that it must not be the case that T contains both a PLACEHOLDER_EXPR | |
1573 | and some variable since it would then need to be both evaluated once and | |
1574 | evaluated more than once. Front-ends must assure this case cannot | |
1575 | happen by surrounding any such subexpressions in their own SAVE_EXPR | |
1576 | and forcing evaluation at the proper time. */ | |
1577 | if (contains_placeholder_p (t)) | |
1578 | return t; | |
1579 | ||
37366632 | 1580 | t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE); |
c6a1db6c RS |
1581 | |
1582 | /* This expression might be placed ahead of a jump to ensure that the | |
1583 | value was computed on both sides of the jump. So make sure it isn't | |
1584 | eliminated as dead. */ | |
1585 | TREE_SIDE_EFFECTS (t) = 1; | |
235783d1 | 1586 | TREE_READONLY (t) = 1; |
c6a1db6c RS |
1587 | return t; |
1588 | } | |
679163cf MS |
1589 | |
1590 | /* Arrange for an expression to be expanded multiple independent | |
1591 | times. This is useful for cleanup actions, as the backend can | |
1592 | expand them multiple times in different places. */ | |
0f41302f | 1593 | |
679163cf MS |
1594 | tree |
1595 | unsave_expr (expr) | |
1596 | tree expr; | |
1597 | { | |
1598 | tree t; | |
1599 | ||
1600 | /* If this is already protected, no sense in protecting it again. */ | |
1601 | if (TREE_CODE (expr) == UNSAVE_EXPR) | |
1602 | return expr; | |
1603 | ||
1604 | t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr); | |
1605 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr); | |
1606 | return t; | |
1607 | } | |
1608 | ||
b7f6588d JM |
1609 | /* Returns the index of the first non-tree operand for CODE, or the number |
1610 | of operands if all are trees. */ | |
1611 | ||
1612 | int | |
1613 | first_rtl_op (code) | |
1614 | enum tree_code code; | |
1615 | { | |
1616 | switch (code) | |
1617 | { | |
1618 | case SAVE_EXPR: | |
1619 | return 2; | |
8dd858ca | 1620 | case GOTO_SUBROUTINE_EXPR: |
b7f6588d JM |
1621 | case RTL_EXPR: |
1622 | return 0; | |
b7f6588d | 1623 | case WITH_CLEANUP_EXPR: |
6ad7895a | 1624 | return 2; |
b7f6588d JM |
1625 | case METHOD_CALL_EXPR: |
1626 | return 3; | |
1627 | default: | |
8d5e6e25 | 1628 | return TREE_CODE_LENGTH (code); |
b7f6588d JM |
1629 | } |
1630 | } | |
1631 | ||
582db8e4 MM |
1632 | /* Perform any modifications to EXPR required when it is unsaved. Does |
1633 | not recurse into EXPR's subtrees. */ | |
0f41302f | 1634 | |
582db8e4 MM |
1635 | void |
1636 | unsave_expr_1 (expr) | |
679163cf MS |
1637 | tree expr; |
1638 | { | |
582db8e4 | 1639 | switch (TREE_CODE (expr)) |
679163cf MS |
1640 | { |
1641 | case SAVE_EXPR: | |
d4b60170 | 1642 | if (! SAVE_EXPR_PERSISTENT_P (expr)) |
d26f8097 | 1643 | SAVE_EXPR_RTL (expr) = 0; |
679163cf MS |
1644 | break; |
1645 | ||
1646 | case TARGET_EXPR: | |
700473ab JM |
1647 | /* Don't mess with a TARGET_EXPR that hasn't been expanded. |
1648 | It's OK for this to happen if it was part of a subtree that | |
1649 | isn't immediately expanded, such as operand 2 of another | |
1650 | TARGET_EXPR. */ | |
1651 | if (TREE_OPERAND (expr, 1)) | |
1652 | break; | |
1653 | ||
4847c938 MS |
1654 | TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3); |
1655 | TREE_OPERAND (expr, 3) = NULL_TREE; | |
679163cf | 1656 | break; |
dc478a5d | 1657 | |
679163cf | 1658 | case RTL_EXPR: |
4847c938 | 1659 | /* I don't yet know how to emit a sequence multiple times. */ |
d4b60170 | 1660 | if (RTL_EXPR_SEQUENCE (expr) != 0) |
4847c938 | 1661 | abort (); |
679163cf MS |
1662 | break; |
1663 | ||
e9a25f70 | 1664 | default: |
d4b60170 | 1665 | if (lang_unsave_expr_now != 0) |
0a818f84 | 1666 | (*lang_unsave_expr_now) (expr); |
e9a25f70 | 1667 | break; |
679163cf | 1668 | } |
582db8e4 MM |
1669 | } |
1670 | ||
1671 | /* Helper function for unsave_expr_now. */ | |
1672 | ||
1673 | static void | |
1674 | unsave_expr_now_r (expr) | |
1675 | tree expr; | |
1676 | { | |
1677 | enum tree_code code; | |
1678 | ||
7a12ace5 | 1679 | /* There's nothing to do for NULL_TREE. */ |
d4b60170 | 1680 | if (expr == 0) |
7a12ace5 MM |
1681 | return; |
1682 | ||
582db8e4 | 1683 | unsave_expr_1 (expr); |
679163cf | 1684 | |
582db8e4 | 1685 | code = TREE_CODE (expr); |
679163cf MS |
1686 | switch (TREE_CODE_CLASS (code)) |
1687 | { | |
1688 | case 'c': /* a constant */ | |
1689 | case 't': /* a type node */ | |
679163cf MS |
1690 | case 'd': /* A decl node */ |
1691 | case 'b': /* A block node */ | |
582db8e4 | 1692 | break; |
679163cf | 1693 | |
58de89e7 RK |
1694 | case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */ |
1695 | if (code == TREE_LIST) | |
1696 | { | |
1697 | unsave_expr_now_r (TREE_VALUE (expr)); | |
1698 | unsave_expr_now_r (TREE_CHAIN (expr)); | |
1699 | } | |
1700 | break; | |
1701 | ||
679163cf MS |
1702 | case 'e': /* an expression */ |
1703 | case 'r': /* a reference */ | |
1704 | case 's': /* an expression with side effects */ | |
1705 | case '<': /* a comparison expression */ | |
1706 | case '2': /* a binary arithmetic expression */ | |
1707 | case '1': /* a unary arithmetic expression */ | |
582db8e4 MM |
1708 | { |
1709 | int i; | |
dc478a5d | 1710 | |
582db8e4 MM |
1711 | for (i = first_rtl_op (code) - 1; i >= 0; i--) |
1712 | unsave_expr_now_r (TREE_OPERAND (expr, i)); | |
1713 | } | |
1714 | break; | |
679163cf MS |
1715 | |
1716 | default: | |
1717 | abort (); | |
1718 | } | |
1719 | } | |
582db8e4 MM |
1720 | |
1721 | /* Modify a tree in place so that all the evaluate only once things | |
1722 | are cleared out. Return the EXPR given. */ | |
1723 | ||
1724 | tree | |
1725 | unsave_expr_now (expr) | |
1726 | tree expr; | |
1727 | { | |
d4b60170 | 1728 | if (lang_unsave!= 0) |
582db8e4 MM |
1729 | (*lang_unsave) (&expr); |
1730 | else | |
1731 | unsave_expr_now_r (expr); | |
1732 | ||
1733 | return expr; | |
1734 | } | |
0a1c58a2 | 1735 | |
194c7c45 RH |
1736 | /* Return 0 if it is safe to evaluate EXPR multiple times, |
1737 | return 1 if it is safe if EXPR is unsaved afterward, or | |
dc478a5d | 1738 | return 2 if it is completely unsafe. |
194c7c45 RH |
1739 | |
1740 | This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in | |
1741 | an expression tree, so that it safe to unsave them and the surrounding | |
1742 | context will be correct. | |
1743 | ||
1744 | SAVE_EXPRs basically *only* appear replicated in an expression tree, | |
1745 | occasionally across the whole of a function. It is therefore only | |
1746 | safe to unsave a SAVE_EXPR if you know that all occurrences appear | |
1747 | below the UNSAVE_EXPR. | |
1748 | ||
dc478a5d | 1749 | RTL_EXPRs consume their rtl during evaluation. It is therefore |
194c7c45 | 1750 | never possible to unsave them. */ |
0a1c58a2 JL |
1751 | |
1752 | int | |
194c7c45 | 1753 | unsafe_for_reeval (expr) |
0a1c58a2 JL |
1754 | tree expr; |
1755 | { | |
58de89e7 | 1756 | int unsafeness = 0; |
0a1c58a2 | 1757 | enum tree_code code; |
58de89e7 RK |
1758 | int i, tmp; |
1759 | tree exp; | |
0a1c58a2 JL |
1760 | int first_rtl; |
1761 | ||
1762 | if (expr == NULL_TREE) | |
1763 | return 1; | |
1764 | ||
1765 | code = TREE_CODE (expr); | |
1766 | first_rtl = first_rtl_op (code); | |
194c7c45 | 1767 | |
0a1c58a2 JL |
1768 | switch (code) |
1769 | { | |
194c7c45 | 1770 | case SAVE_EXPR: |
0a1c58a2 | 1771 | case RTL_EXPR: |
194c7c45 | 1772 | return 2; |
0a1c58a2 | 1773 | |
58de89e7 RK |
1774 | case TREE_LIST: |
1775 | for (exp = expr; exp != 0; exp = TREE_CHAIN (exp)) | |
0a1c58a2 | 1776 | { |
58de89e7 RK |
1777 | tmp = unsafe_for_reeval (TREE_VALUE (exp)); |
1778 | unsafeness = MAX (tmp, unsafeness); | |
0a1c58a2 | 1779 | } |
58de89e7 RK |
1780 | |
1781 | return unsafeness; | |
1782 | ||
1783 | case CALL_EXPR: | |
1784 | tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1)); | |
1785 | return MAX (tmp, 1); | |
194c7c45 RH |
1786 | |
1787 | case TARGET_EXPR: | |
1788 | unsafeness = 1; | |
0a1c58a2 JL |
1789 | break; |
1790 | ||
1791 | default: | |
3fe30ff6 RH |
1792 | if (lang_unsafe_for_reeval != 0) |
1793 | { | |
1794 | tmp = (*lang_unsafe_for_reeval) (expr); | |
1795 | if (tmp >= 0) | |
1796 | return tmp; | |
1797 | } | |
0a1c58a2 JL |
1798 | break; |
1799 | } | |
1800 | ||
1801 | switch (TREE_CODE_CLASS (code)) | |
1802 | { | |
1803 | case 'c': /* a constant */ | |
1804 | case 't': /* a type node */ | |
1805 | case 'x': /* something random, like an identifier or an ERROR_MARK. */ | |
1806 | case 'd': /* A decl node */ | |
1807 | case 'b': /* A block node */ | |
194c7c45 | 1808 | return 0; |
0a1c58a2 JL |
1809 | |
1810 | case 'e': /* an expression */ | |
1811 | case 'r': /* a reference */ | |
1812 | case 's': /* an expression with side effects */ | |
1813 | case '<': /* a comparison expression */ | |
1814 | case '2': /* a binary arithmetic expression */ | |
1815 | case '1': /* a unary arithmetic expression */ | |
1816 | for (i = first_rtl - 1; i >= 0; i--) | |
194c7c45 RH |
1817 | { |
1818 | tmp = unsafe_for_reeval (TREE_OPERAND (expr, i)); | |
58de89e7 | 1819 | unsafeness = MAX (tmp, unsafeness); |
194c7c45 | 1820 | } |
58de89e7 | 1821 | |
194c7c45 | 1822 | return unsafeness; |
0a1c58a2 JL |
1823 | |
1824 | default: | |
194c7c45 | 1825 | return 2; |
0a1c58a2 JL |
1826 | } |
1827 | } | |
dec20b4b RK |
1828 | \f |
1829 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size | |
3910a7cb | 1830 | or offset that depends on a field within a record. */ |
dec20b4b RK |
1831 | |
1832 | int | |
1833 | contains_placeholder_p (exp) | |
1834 | tree exp; | |
1835 | { | |
b3694847 | 1836 | enum tree_code code; |
e9a25f70 | 1837 | int result; |
dec20b4b | 1838 | |
8f17b5c5 MM |
1839 | if (!exp) |
1840 | return 0; | |
1841 | ||
67c8d7de RK |
1842 | /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR |
1843 | in it since it is supplying a value for it. */ | |
8f17b5c5 | 1844 | code = TREE_CODE (exp); |
67c8d7de RK |
1845 | if (code == WITH_RECORD_EXPR) |
1846 | return 0; | |
a5ee6e44 | 1847 | else if (code == PLACEHOLDER_EXPR) |
cc3c7c13 | 1848 | return 1; |
67c8d7de | 1849 | |
dec20b4b RK |
1850 | switch (TREE_CODE_CLASS (code)) |
1851 | { | |
1852 | case 'r': | |
cc3c7c13 RK |
1853 | /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit |
1854 | position computations since they will be converted into a | |
1855 | WITH_RECORD_EXPR involving the reference, which will assume | |
1856 | here will be valid. */ | |
1857 | return contains_placeholder_p (TREE_OPERAND (exp, 0)); | |
dec20b4b | 1858 | |
e9a25f70 JL |
1859 | case 'x': |
1860 | if (code == TREE_LIST) | |
1861 | return (contains_placeholder_p (TREE_VALUE (exp)) | |
1862 | || (TREE_CHAIN (exp) != 0 | |
1863 | && contains_placeholder_p (TREE_CHAIN (exp)))); | |
1864 | break; | |
dc478a5d | 1865 | |
dec20b4b RK |
1866 | case '1': |
1867 | case '2': case '<': | |
1868 | case 'e': | |
3910a7cb RK |
1869 | switch (code) |
1870 | { | |
1871 | case COMPOUND_EXPR: | |
dc478a5d | 1872 | /* Ignoring the first operand isn't quite right, but works best. */ |
cc3c7c13 | 1873 | return contains_placeholder_p (TREE_OPERAND (exp, 1)); |
3910a7cb RK |
1874 | |
1875 | case RTL_EXPR: | |
1876 | case CONSTRUCTOR: | |
1877 | return 0; | |
1878 | ||
1879 | case COND_EXPR: | |
cc3c7c13 RK |
1880 | return (contains_placeholder_p (TREE_OPERAND (exp, 0)) |
1881 | || contains_placeholder_p (TREE_OPERAND (exp, 1)) | |
1882 | || contains_placeholder_p (TREE_OPERAND (exp, 2))); | |
3910a7cb RK |
1883 | |
1884 | case SAVE_EXPR: | |
e9a25f70 JL |
1885 | /* If we already know this doesn't have a placeholder, don't |
1886 | check again. */ | |
1887 | if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0) | |
1888 | return 0; | |
1889 | ||
1890 | SAVE_EXPR_NOPLACEHOLDER (exp) = 1; | |
1891 | result = contains_placeholder_p (TREE_OPERAND (exp, 0)); | |
1892 | if (result) | |
1893 | SAVE_EXPR_NOPLACEHOLDER (exp) = 0; | |
1894 | ||
1895 | return result; | |
1896 | ||
1897 | case CALL_EXPR: | |
1898 | return (TREE_OPERAND (exp, 1) != 0 | |
1899 | && contains_placeholder_p (TREE_OPERAND (exp, 1))); | |
1900 | ||
1901 | default: | |
1902 | break; | |
3910a7cb RK |
1903 | } |
1904 | ||
8d5e6e25 | 1905 | switch (TREE_CODE_LENGTH (code)) |
dec20b4b RK |
1906 | { |
1907 | case 1: | |
cc3c7c13 | 1908 | return contains_placeholder_p (TREE_OPERAND (exp, 0)); |
dec20b4b | 1909 | case 2: |
cc3c7c13 RK |
1910 | return (contains_placeholder_p (TREE_OPERAND (exp, 0)) |
1911 | || contains_placeholder_p (TREE_OPERAND (exp, 1))); | |
e9a25f70 JL |
1912 | default: |
1913 | return 0; | |
dec20b4b | 1914 | } |
dec20b4b | 1915 | |
e9a25f70 JL |
1916 | default: |
1917 | return 0; | |
1918 | } | |
1160f9ec | 1919 | return 0; |
dec20b4b | 1920 | } |
b7f6588d JM |
1921 | |
1922 | /* Return 1 if EXP contains any expressions that produce cleanups for an | |
1923 | outer scope to deal with. Used by fold. */ | |
1924 | ||
1925 | int | |
1926 | has_cleanups (exp) | |
1927 | tree exp; | |
1928 | { | |
1929 | int i, nops, cmp; | |
1930 | ||
1931 | if (! TREE_SIDE_EFFECTS (exp)) | |
1932 | return 0; | |
1933 | ||
1934 | switch (TREE_CODE (exp)) | |
1935 | { | |
1936 | case TARGET_EXPR: | |
8dd858ca | 1937 | case GOTO_SUBROUTINE_EXPR: |
b7f6588d JM |
1938 | case WITH_CLEANUP_EXPR: |
1939 | return 1; | |
1940 | ||
1941 | case CLEANUP_POINT_EXPR: | |
1942 | return 0; | |
1943 | ||
1944 | case CALL_EXPR: | |
1945 | for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp)) | |
1946 | { | |
1947 | cmp = has_cleanups (TREE_VALUE (exp)); | |
1948 | if (cmp) | |
1949 | return cmp; | |
1950 | } | |
1951 | return 0; | |
1952 | ||
1953 | default: | |
1954 | break; | |
1955 | } | |
1956 | ||
1957 | /* This general rule works for most tree codes. All exceptions should be | |
1958 | handled above. If this is a language-specific tree code, we can't | |
1959 | trust what might be in the operand, so say we don't know | |
1960 | the situation. */ | |
1961 | if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE) | |
1962 | return -1; | |
1963 | ||
1964 | nops = first_rtl_op (TREE_CODE (exp)); | |
1965 | for (i = 0; i < nops; i++) | |
1966 | if (TREE_OPERAND (exp, i) != 0) | |
1967 | { | |
1968 | int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i))); | |
1969 | if (type == 'e' || type == '<' || type == '1' || type == '2' | |
1970 | || type == 'r' || type == 's') | |
1971 | { | |
1972 | cmp = has_cleanups (TREE_OPERAND (exp, i)); | |
1973 | if (cmp) | |
1974 | return cmp; | |
1975 | } | |
1976 | } | |
1977 | ||
1978 | return 0; | |
1979 | } | |
dec20b4b RK |
1980 | \f |
1981 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
1982 | return a tree with all occurrences of references to F in a | |
1983 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
e9a25f70 JL |
1984 | contains only arithmetic expressions or a CALL_EXPR with a |
1985 | PLACEHOLDER_EXPR occurring only in its arglist. */ | |
dec20b4b RK |
1986 | |
1987 | tree | |
1988 | substitute_in_expr (exp, f, r) | |
1989 | tree exp; | |
1990 | tree f; | |
1991 | tree r; | |
1992 | { | |
1993 | enum tree_code code = TREE_CODE (exp); | |
9b594acf | 1994 | tree op0, op1, op2; |
e9a25f70 | 1995 | tree new; |
dec20b4b RK |
1996 | tree inner; |
1997 | ||
1998 | switch (TREE_CODE_CLASS (code)) | |
1999 | { | |
2000 | case 'c': | |
2001 | case 'd': | |
2002 | return exp; | |
2003 | ||
2004 | case 'x': | |
2005 | if (code == PLACEHOLDER_EXPR) | |
2006 | return exp; | |
e9a25f70 JL |
2007 | else if (code == TREE_LIST) |
2008 | { | |
2009 | op0 = (TREE_CHAIN (exp) == 0 | |
2010 | ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r)); | |
2011 | op1 = substitute_in_expr (TREE_VALUE (exp), f, r); | |
956d6950 | 2012 | if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp)) |
e9a25f70 JL |
2013 | return exp; |
2014 | ||
956d6950 | 2015 | return tree_cons (TREE_PURPOSE (exp), op1, op0); |
e9a25f70 JL |
2016 | } |
2017 | ||
2018 | abort (); | |
dec20b4b RK |
2019 | |
2020 | case '1': | |
2021 | case '2': | |
2022 | case '<': | |
2023 | case 'e': | |
8d5e6e25 | 2024 | switch (TREE_CODE_LENGTH (code)) |
dec20b4b RK |
2025 | { |
2026 | case 1: | |
9b594acf RK |
2027 | op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r); |
2028 | if (op0 == TREE_OPERAND (exp, 0)) | |
2029 | return exp; | |
dc478a5d | 2030 | |
235783d1 RK |
2031 | if (code == NON_LVALUE_EXPR) |
2032 | return op0; | |
2033 | ||
9b594acf | 2034 | new = fold (build1 (code, TREE_TYPE (exp), op0)); |
abd23b66 | 2035 | break; |
dec20b4b RK |
2036 | |
2037 | case 2: | |
6a22e3a7 RK |
2038 | /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR |
2039 | could, but we don't support it. */ | |
2040 | if (code == RTL_EXPR) | |
2041 | return exp; | |
2042 | else if (code == CONSTRUCTOR) | |
dec20b4b RK |
2043 | abort (); |
2044 | ||
9b594acf RK |
2045 | op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r); |
2046 | op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r); | |
2047 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)) | |
2048 | return exp; | |
2049 | ||
2050 | new = fold (build (code, TREE_TYPE (exp), op0, op1)); | |
abd23b66 | 2051 | break; |
dec20b4b RK |
2052 | |
2053 | case 3: | |
6a22e3a7 RK |
2054 | /* It cannot be that anything inside a SAVE_EXPR contains a |
2055 | PLACEHOLDER_EXPR. */ | |
2056 | if (code == SAVE_EXPR) | |
2057 | return exp; | |
2058 | ||
e9a25f70 JL |
2059 | else if (code == CALL_EXPR) |
2060 | { | |
2061 | op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r); | |
2062 | if (op1 == TREE_OPERAND (exp, 1)) | |
2063 | return exp; | |
2064 | ||
2065 | return build (code, TREE_TYPE (exp), | |
2066 | TREE_OPERAND (exp, 0), op1, NULL_TREE); | |
2067 | } | |
2068 | ||
2069 | else if (code != COND_EXPR) | |
dec20b4b RK |
2070 | abort (); |
2071 | ||
9b594acf RK |
2072 | op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r); |
2073 | op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r); | |
2074 | op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r); | |
2075 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
2076 | && op2 == TREE_OPERAND (exp, 2)) | |
2077 | return exp; | |
2078 | ||
2079 | new = fold (build (code, TREE_TYPE (exp), op0, op1, op2)); | |
e9a25f70 JL |
2080 | break; |
2081 | ||
2082 | default: | |
2083 | abort (); | |
dec20b4b RK |
2084 | } |
2085 | ||
2086 | break; | |
2087 | ||
2088 | case 'r': | |
2089 | switch (code) | |
2090 | { | |
2091 | case COMPONENT_REF: | |
2092 | /* If this expression is getting a value from a PLACEHOLDER_EXPR | |
2093 | and it is the right field, replace it with R. */ | |
2094 | for (inner = TREE_OPERAND (exp, 0); | |
2095 | TREE_CODE_CLASS (TREE_CODE (inner)) == 'r'; | |
2096 | inner = TREE_OPERAND (inner, 0)) | |
2097 | ; | |
2098 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR | |
2099 | && TREE_OPERAND (exp, 1) == f) | |
2100 | return r; | |
2101 | ||
dc478a5d | 2102 | /* If this expression hasn't been completed let, leave it |
6cba9fcc RK |
2103 | alone. */ |
2104 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR | |
2105 | && TREE_TYPE (inner) == 0) | |
2106 | return exp; | |
2107 | ||
9b594acf RK |
2108 | op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r); |
2109 | if (op0 == TREE_OPERAND (exp, 0)) | |
2110 | return exp; | |
2111 | ||
2112 | new = fold (build (code, TREE_TYPE (exp), op0, | |
abd23b66 RK |
2113 | TREE_OPERAND (exp, 1))); |
2114 | break; | |
2115 | ||
dec20b4b | 2116 | case BIT_FIELD_REF: |
9b594acf RK |
2117 | op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r); |
2118 | op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r); | |
2119 | op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r); | |
2120 | if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1) | |
2121 | && op2 == TREE_OPERAND (exp, 2)) | |
2122 | return exp; | |
2123 | ||
2124 | new = fold (build (code, TREE_TYPE (exp), op0, op1, op2)); | |
abd23b66 RK |
2125 | break; |
2126 | ||
dec20b4b RK |
2127 | case INDIRECT_REF: |
2128 | case BUFFER_REF: | |
9b594acf RK |
2129 | op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r); |
2130 | if (op0 == TREE_OPERAND (exp, 0)) | |
2131 | return exp; | |
2132 | ||
2133 | new = fold (build1 (code, TREE_TYPE (exp), op0)); | |
abd23b66 | 2134 | break; |
e9a25f70 JL |
2135 | |
2136 | default: | |
2137 | abort (); | |
dec20b4b | 2138 | } |
e9a25f70 | 2139 | break; |
dc478a5d | 2140 | |
e9a25f70 JL |
2141 | default: |
2142 | abort (); | |
dec20b4b RK |
2143 | } |
2144 | ||
abd23b66 RK |
2145 | TREE_READONLY (new) = TREE_READONLY (exp); |
2146 | return new; | |
dec20b4b RK |
2147 | } |
2148 | \f | |
c6a1db6c RS |
2149 | /* Stabilize a reference so that we can use it any number of times |
2150 | without causing its operands to be evaluated more than once. | |
4b1d0fea RS |
2151 | Returns the stabilized reference. This works by means of save_expr, |
2152 | so see the caveats in the comments about save_expr. | |
c6a1db6c RS |
2153 | |
2154 | Also allows conversion expressions whose operands are references. | |
2155 | Any other kind of expression is returned unchanged. */ | |
2156 | ||
2157 | tree | |
2158 | stabilize_reference (ref) | |
2159 | tree ref; | |
2160 | { | |
b3694847 SS |
2161 | tree result; |
2162 | enum tree_code code = TREE_CODE (ref); | |
c6a1db6c RS |
2163 | |
2164 | switch (code) | |
2165 | { | |
2166 | case VAR_DECL: | |
2167 | case PARM_DECL: | |
2168 | case RESULT_DECL: | |
2169 | /* No action is needed in this case. */ | |
2170 | return ref; | |
2171 | ||
2172 | case NOP_EXPR: | |
2173 | case CONVERT_EXPR: | |
2174 | case FLOAT_EXPR: | |
2175 | case FIX_TRUNC_EXPR: | |
2176 | case FIX_FLOOR_EXPR: | |
2177 | case FIX_ROUND_EXPR: | |
2178 | case FIX_CEIL_EXPR: | |
2179 | result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0))); | |
2180 | break; | |
2181 | ||
2182 | case INDIRECT_REF: | |
2183 | result = build_nt (INDIRECT_REF, | |
2184 | stabilize_reference_1 (TREE_OPERAND (ref, 0))); | |
2185 | break; | |
2186 | ||
2187 | case COMPONENT_REF: | |
2188 | result = build_nt (COMPONENT_REF, | |
2189 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2190 | TREE_OPERAND (ref, 1)); | |
2191 | break; | |
2192 | ||
2193 | case BIT_FIELD_REF: | |
2194 | result = build_nt (BIT_FIELD_REF, | |
2195 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2196 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), | |
2197 | stabilize_reference_1 (TREE_OPERAND (ref, 2))); | |
2198 | break; | |
2199 | ||
2200 | case ARRAY_REF: | |
2201 | result = build_nt (ARRAY_REF, | |
2202 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2203 | stabilize_reference_1 (TREE_OPERAND (ref, 1))); | |
2204 | break; | |
2205 | ||
b4e3fabb RK |
2206 | case ARRAY_RANGE_REF: |
2207 | result = build_nt (ARRAY_RANGE_REF, | |
2208 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2209 | stabilize_reference_1 (TREE_OPERAND (ref, 1))); | |
2210 | break; | |
2211 | ||
c451a7a0 | 2212 | case COMPOUND_EXPR: |
7b8b9722 MS |
2213 | /* We cannot wrap the first expression in a SAVE_EXPR, as then |
2214 | it wouldn't be ignored. This matters when dealing with | |
2215 | volatiles. */ | |
2216 | return stabilize_reference_1 (ref); | |
c451a7a0 | 2217 | |
c36a127d RK |
2218 | case RTL_EXPR: |
2219 | result = build1 (INDIRECT_REF, TREE_TYPE (ref), | |
2220 | save_expr (build1 (ADDR_EXPR, | |
21f0e042 | 2221 | build_pointer_type (TREE_TYPE (ref)), |
c36a127d RK |
2222 | ref))); |
2223 | break; | |
2224 | ||
c6a1db6c RS |
2225 | /* If arg isn't a kind of lvalue we recognize, make no change. |
2226 | Caller should recognize the error for an invalid lvalue. */ | |
2227 | default: | |
2228 | return ref; | |
2229 | ||
2230 | case ERROR_MARK: | |
2231 | return error_mark_node; | |
2232 | } | |
2233 | ||
2234 | TREE_TYPE (result) = TREE_TYPE (ref); | |
2235 | TREE_READONLY (result) = TREE_READONLY (ref); | |
2236 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref); | |
2237 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref); | |
c6a1db6c RS |
2238 | |
2239 | return result; | |
2240 | } | |
2241 | ||
2242 | /* Subroutine of stabilize_reference; this is called for subtrees of | |
2243 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
2244 | to ensure that it is only evaluated once. | |
2245 | ||
2246 | We don't put SAVE_EXPR nodes around everything, because assigning very | |
2247 | simple expressions to temporaries causes us to miss good opportunities | |
2248 | for optimizations. Among other things, the opportunity to fold in the | |
2249 | addition of a constant into an addressing mode often gets lost, e.g. | |
2250 | "y[i+1] += x;". In general, we take the approach that we should not make | |
2251 | an assignment unless we are forced into it - i.e., that any non-side effect | |
2252 | operator should be allowed, and that cse should take care of coalescing | |
2253 | multiple utterances of the same expression should that prove fruitful. */ | |
2254 | ||
4745ddae | 2255 | tree |
c6a1db6c RS |
2256 | stabilize_reference_1 (e) |
2257 | tree e; | |
2258 | { | |
b3694847 SS |
2259 | tree result; |
2260 | enum tree_code code = TREE_CODE (e); | |
c6a1db6c | 2261 | |
af929c62 RK |
2262 | /* We cannot ignore const expressions because it might be a reference |
2263 | to a const array but whose index contains side-effects. But we can | |
2264 | ignore things that are actual constant or that already have been | |
2265 | handled by this function. */ | |
2266 | ||
2267 | if (TREE_CONSTANT (e) || code == SAVE_EXPR) | |
c6a1db6c RS |
2268 | return e; |
2269 | ||
2270 | switch (TREE_CODE_CLASS (code)) | |
2271 | { | |
2272 | case 'x': | |
2273 | case 't': | |
2274 | case 'd': | |
03646189 | 2275 | case 'b': |
c6a1db6c RS |
2276 | case '<': |
2277 | case 's': | |
2278 | case 'e': | |
2279 | case 'r': | |
2280 | /* If the expression has side-effects, then encase it in a SAVE_EXPR | |
2281 | so that it will only be evaluated once. */ | |
2282 | /* The reference (r) and comparison (<) classes could be handled as | |
2283 | below, but it is generally faster to only evaluate them once. */ | |
2284 | if (TREE_SIDE_EFFECTS (e)) | |
2285 | return save_expr (e); | |
2286 | return e; | |
2287 | ||
2288 | case 'c': | |
2289 | /* Constants need no processing. In fact, we should never reach | |
2290 | here. */ | |
2291 | return e; | |
dc478a5d | 2292 | |
c6a1db6c | 2293 | case '2': |
ae698e41 RS |
2294 | /* Division is slow and tends to be compiled with jumps, |
2295 | especially the division by powers of 2 that is often | |
2296 | found inside of an array reference. So do it just once. */ | |
2297 | if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR | |
2298 | || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR | |
2299 | || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR | |
2300 | || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR) | |
2301 | return save_expr (e); | |
c6a1db6c RS |
2302 | /* Recursively stabilize each operand. */ |
2303 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)), | |
2304 | stabilize_reference_1 (TREE_OPERAND (e, 1))); | |
2305 | break; | |
2306 | ||
2307 | case '1': | |
2308 | /* Recursively stabilize each operand. */ | |
2309 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0))); | |
2310 | break; | |
a7fcb968 RK |
2311 | |
2312 | default: | |
2313 | abort (); | |
c6a1db6c | 2314 | } |
dc478a5d | 2315 | |
c6a1db6c RS |
2316 | TREE_TYPE (result) = TREE_TYPE (e); |
2317 | TREE_READONLY (result) = TREE_READONLY (e); | |
2318 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e); | |
2319 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e); | |
c6a1db6c RS |
2320 | |
2321 | return result; | |
2322 | } | |
2323 | \f | |
2324 | /* Low-level constructors for expressions. */ | |
2325 | ||
2326 | /* Build an expression of code CODE, data type TYPE, | |
2327 | and operands as specified by the arguments ARG1 and following arguments. | |
2328 | Expressions and reference nodes can be created this way. | |
2329 | Constants, decls, types and misc nodes cannot be. */ | |
2330 | ||
2331 | tree | |
58782098 | 2332 | build VPARAMS ((enum tree_code code, tree tt, ...)) |
c6a1db6c | 2333 | { |
b3694847 SS |
2334 | tree t; |
2335 | int length; | |
2336 | int i; | |
97ca93c3 | 2337 | int fro; |
1796dff4 | 2338 | int constant; |
c6a1db6c | 2339 | |
7a75edb7 AJ |
2340 | VA_OPEN (p, tt); |
2341 | VA_FIXEDARG (p, enum tree_code, code); | |
2342 | VA_FIXEDARG (p, tree, tt); | |
ba63ed56 | 2343 | |
c6a1db6c | 2344 | t = make_node (code); |
8d5e6e25 | 2345 | length = TREE_CODE_LENGTH (code); |
ba63ed56 | 2346 | TREE_TYPE (t) = tt; |
c6a1db6c | 2347 | |
235783d1 RK |
2348 | /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the |
2349 | result based on those same flags for the arguments. But if the | |
2350 | arguments aren't really even `tree' expressions, we shouldn't be trying | |
2351 | to do this. */ | |
97ca93c3 MM |
2352 | fro = first_rtl_op (code); |
2353 | ||
1796dff4 RH |
2354 | /* Expressions without side effects may be constant if their |
2355 | arguments are as well. */ | |
2356 | constant = (TREE_CODE_CLASS (code) == '<' | |
2357 | || TREE_CODE_CLASS (code) == '1' | |
2358 | || TREE_CODE_CLASS (code) == '2' | |
2359 | || TREE_CODE_CLASS (code) == 'c'); | |
2360 | ||
c6a1db6c RS |
2361 | if (length == 2) |
2362 | { | |
2363 | /* This is equivalent to the loop below, but faster. */ | |
b3694847 SS |
2364 | tree arg0 = va_arg (p, tree); |
2365 | tree arg1 = va_arg (p, tree); | |
235783d1 | 2366 | |
c6a1db6c RS |
2367 | TREE_OPERAND (t, 0) = arg0; |
2368 | TREE_OPERAND (t, 1) = arg1; | |
235783d1 | 2369 | TREE_READONLY (t) = 1; |
97ca93c3 MM |
2370 | if (arg0 && fro > 0) |
2371 | { | |
2372 | if (TREE_SIDE_EFFECTS (arg0)) | |
2373 | TREE_SIDE_EFFECTS (t) = 1; | |
235783d1 RK |
2374 | if (!TREE_READONLY (arg0)) |
2375 | TREE_READONLY (t) = 0; | |
1796dff4 RH |
2376 | if (!TREE_CONSTANT (arg0)) |
2377 | constant = 0; | |
97ca93c3 | 2378 | } |
235783d1 | 2379 | |
97ca93c3 MM |
2380 | if (arg1 && fro > 1) |
2381 | { | |
2382 | if (TREE_SIDE_EFFECTS (arg1)) | |
2383 | TREE_SIDE_EFFECTS (t) = 1; | |
235783d1 RK |
2384 | if (!TREE_READONLY (arg1)) |
2385 | TREE_READONLY (t) = 0; | |
1796dff4 RH |
2386 | if (!TREE_CONSTANT (arg1)) |
2387 | constant = 0; | |
97ca93c3 | 2388 | } |
c6a1db6c RS |
2389 | } |
2390 | else if (length == 1) | |
2391 | { | |
b3694847 | 2392 | tree arg0 = va_arg (p, tree); |
c6a1db6c | 2393 | |
235783d1 RK |
2394 | /* The only one-operand cases we handle here are those with side-effects. |
2395 | Others are handled with build1. So don't bother checked if the | |
2396 | arg has side-effects since we'll already have set it. | |
2397 | ||
2398 | ??? This really should use build1 too. */ | |
c6a1db6c RS |
2399 | if (TREE_CODE_CLASS (code) != 's') |
2400 | abort (); | |
2401 | TREE_OPERAND (t, 0) = arg0; | |
c6a1db6c RS |
2402 | } |
2403 | else | |
2404 | { | |
2405 | for (i = 0; i < length; i++) | |
2406 | { | |
b3694847 | 2407 | tree operand = va_arg (p, tree); |
235783d1 | 2408 | |
c6a1db6c | 2409 | TREE_OPERAND (t, i) = operand; |
97ca93c3 | 2410 | if (operand && fro > i) |
c6a1db6c RS |
2411 | { |
2412 | if (TREE_SIDE_EFFECTS (operand)) | |
2413 | TREE_SIDE_EFFECTS (t) = 1; | |
1796dff4 RH |
2414 | if (!TREE_CONSTANT (operand)) |
2415 | constant = 0; | |
c6a1db6c RS |
2416 | } |
2417 | } | |
2418 | } | |
7a75edb7 | 2419 | VA_CLOSE (p); |
1796dff4 RH |
2420 | |
2421 | TREE_CONSTANT (t) = constant; | |
c6a1db6c RS |
2422 | return t; |
2423 | } | |
2424 | ||
2425 | /* Same as above, but only builds for unary operators. | |
2426 | Saves lions share of calls to `build'; cuts down use | |
2427 | of varargs, which is expensive for RISC machines. */ | |
0f41302f | 2428 | |
c6a1db6c RS |
2429 | tree |
2430 | build1 (code, type, node) | |
2431 | enum tree_code code; | |
2432 | tree type; | |
2433 | tree node; | |
2434 | { | |
b3694847 | 2435 | int length; |
5e9defae | 2436 | #ifdef GATHER_STATISTICS |
b3694847 | 2437 | tree_node_kind kind; |
5e9defae | 2438 | #endif |
b3694847 | 2439 | tree t; |
c6a1db6c RS |
2440 | |
2441 | #ifdef GATHER_STATISTICS | |
2442 | if (TREE_CODE_CLASS (code) == 'r') | |
2443 | kind = r_kind; | |
2444 | else | |
2445 | kind = e_kind; | |
2446 | #endif | |
2447 | ||
3af4c257 MM |
2448 | #ifdef ENABLE_CHECKING |
2449 | if (TREE_CODE_CLASS (code) == '2' | |
2450 | || TREE_CODE_CLASS (code) == '<' | |
2451 | || TREE_CODE_LENGTH (code) != 1) | |
2452 | abort (); | |
2453 | #endif /* ENABLE_CHECKING */ | |
2454 | ||
c6a1db6c RS |
2455 | length = sizeof (struct tree_exp); |
2456 | ||
1f8f4a0b | 2457 | t = ggc_alloc_tree (length); |
f8a83ee3 ZW |
2458 | |
2459 | memset ((PTR) t, 0, sizeof (struct tree_common)); | |
c6a1db6c RS |
2460 | |
2461 | #ifdef GATHER_STATISTICS | |
dc478a5d KH |
2462 | tree_node_counts[(int) kind]++; |
2463 | tree_node_sizes[(int) kind] += length; | |
c6a1db6c RS |
2464 | #endif |
2465 | ||
c6a1db6c | 2466 | TREE_SET_CODE (t, code); |
235783d1 | 2467 | |
f8a83ee3 ZW |
2468 | TREE_TYPE (t) = type; |
2469 | TREE_COMPLEXITY (t) = 0; | |
c6a1db6c | 2470 | TREE_OPERAND (t, 0) = node; |
235783d1 RK |
2471 | if (node && first_rtl_op (code) != 0) |
2472 | { | |
2473 | TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node); | |
2474 | TREE_READONLY (t) = TREE_READONLY (node); | |
2475 | } | |
c6a1db6c | 2476 | |
1fef02f6 RH |
2477 | switch (code) |
2478 | { | |
2479 | case INIT_EXPR: | |
2480 | case MODIFY_EXPR: | |
2481 | case VA_ARG_EXPR: | |
2482 | case RTL_EXPR: | |
2483 | case PREDECREMENT_EXPR: | |
2484 | case PREINCREMENT_EXPR: | |
2485 | case POSTDECREMENT_EXPR: | |
2486 | case POSTINCREMENT_EXPR: | |
2487 | /* All of these have side-effects, no matter what their | |
2488 | operands are. */ | |
2489 | TREE_SIDE_EFFECTS (t) = 1; | |
235783d1 | 2490 | TREE_READONLY (t) = 0; |
1fef02f6 | 2491 | break; |
dc478a5d | 2492 | |
1fef02f6 | 2493 | default: |
258835c7 | 2494 | if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node)) |
1796dff4 | 2495 | TREE_CONSTANT (t) = 1; |
1fef02f6 RH |
2496 | break; |
2497 | } | |
2498 | ||
c6a1db6c RS |
2499 | return t; |
2500 | } | |
2501 | ||
2502 | /* Similar except don't specify the TREE_TYPE | |
2503 | and leave the TREE_SIDE_EFFECTS as 0. | |
2504 | It is permissible for arguments to be null, | |
2505 | or even garbage if their values do not matter. */ | |
2506 | ||
2507 | tree | |
58782098 | 2508 | build_nt VPARAMS ((enum tree_code code, ...)) |
c6a1db6c | 2509 | { |
b3694847 SS |
2510 | tree t; |
2511 | int length; | |
2512 | int i; | |
c6a1db6c | 2513 | |
7a75edb7 AJ |
2514 | VA_OPEN (p, code); |
2515 | VA_FIXEDARG (p, enum tree_code, code); | |
ba63ed56 | 2516 | |
c6a1db6c | 2517 | t = make_node (code); |
8d5e6e25 | 2518 | length = TREE_CODE_LENGTH (code); |
c6a1db6c RS |
2519 | |
2520 | for (i = 0; i < length; i++) | |
2521 | TREE_OPERAND (t, i) = va_arg (p, tree); | |
2522 | ||
7a75edb7 | 2523 | VA_CLOSE (p); |
c6a1db6c RS |
2524 | return t; |
2525 | } | |
c6a1db6c RS |
2526 | \f |
2527 | /* Create a DECL_... node of code CODE, name NAME and data type TYPE. | |
2528 | We do NOT enter this node in any sort of symbol table. | |
2529 | ||
2530 | layout_decl is used to set up the decl's storage layout. | |
2531 | Other slots are initialized to 0 or null pointers. */ | |
2532 | ||
2533 | tree | |
2534 | build_decl (code, name, type) | |
2535 | enum tree_code code; | |
2536 | tree name, type; | |
2537 | { | |
b3694847 | 2538 | tree t; |
c6a1db6c RS |
2539 | |
2540 | t = make_node (code); | |
2541 | ||
2542 | /* if (type == error_mark_node) | |
2543 | type = integer_type_node; */ | |
2544 | /* That is not done, deliberately, so that having error_mark_node | |
2545 | as the type can suppress useless errors in the use of this variable. */ | |
2546 | ||
2547 | DECL_NAME (t) = name; | |
c6a1db6c RS |
2548 | TREE_TYPE (t) = type; |
2549 | ||
2550 | if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL) | |
2551 | layout_decl (t, 0); | |
2552 | else if (code == FUNCTION_DECL) | |
2553 | DECL_MODE (t) = FUNCTION_MODE; | |
2554 | ||
2555 | return t; | |
2556 | } | |
2557 | \f | |
2558 | /* BLOCK nodes are used to represent the structure of binding contours | |
2559 | and declarations, once those contours have been exited and their contents | |
52d2830e | 2560 | compiled. This information is used for outputting debugging info. */ |
c6a1db6c RS |
2561 | |
2562 | tree | |
2563 | build_block (vars, tags, subblocks, supercontext, chain) | |
272df862 | 2564 | tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain; |
c6a1db6c | 2565 | { |
b3694847 | 2566 | tree block = make_node (BLOCK); |
d4b60170 | 2567 | |
c6a1db6c | 2568 | BLOCK_VARS (block) = vars; |
c6a1db6c RS |
2569 | BLOCK_SUBBLOCKS (block) = subblocks; |
2570 | BLOCK_SUPERCONTEXT (block) = supercontext; | |
2571 | BLOCK_CHAIN (block) = chain; | |
2572 | return block; | |
2573 | } | |
bf1e5319 APB |
2574 | |
2575 | /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact | |
2576 | location where an expression or an identifier were encountered. It | |
2577 | is necessary for languages where the frontend parser will handle | |
2578 | recursively more than one file (Java is one of them). */ | |
2579 | ||
2580 | tree | |
2581 | build_expr_wfl (node, file, line, col) | |
2582 | tree node; | |
37b37199 | 2583 | const char *file; |
bf1e5319 APB |
2584 | int line, col; |
2585 | { | |
37b37199 | 2586 | static const char *last_file = 0; |
d4b60170 | 2587 | static tree last_filenode = NULL_TREE; |
b3694847 | 2588 | tree wfl = make_node (EXPR_WITH_FILE_LOCATION); |
9fe9a2e1 | 2589 | |
bf1e5319 | 2590 | EXPR_WFL_NODE (wfl) = node; |
bf1e5319 | 2591 | EXPR_WFL_SET_LINECOL (wfl, line, col); |
9fe9a2e1 APB |
2592 | if (file != last_file) |
2593 | { | |
2594 | last_file = file; | |
2595 | last_filenode = file ? get_identifier (file) : NULL_TREE; | |
2596 | } | |
d4b60170 | 2597 | |
9fe9a2e1 APB |
2598 | EXPR_WFL_FILENAME_NODE (wfl) = last_filenode; |
2599 | if (node) | |
2600 | { | |
2601 | TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node); | |
2602 | TREE_TYPE (wfl) = TREE_TYPE (node); | |
2603 | } | |
d4b60170 | 2604 | |
bf1e5319 APB |
2605 | return wfl; |
2606 | } | |
c6a1db6c | 2607 | \f |
91d231cb | 2608 | /* Return a declaration like DDECL except that its DECL_ATTRIBUTES |
0f41302f | 2609 | is ATTRIBUTE. */ |
1a2927d2 RK |
2610 | |
2611 | tree | |
2612 | build_decl_attribute_variant (ddecl, attribute) | |
2613 | tree ddecl, attribute; | |
2614 | { | |
91d231cb | 2615 | DECL_ATTRIBUTES (ddecl) = attribute; |
1a2927d2 RK |
2616 | return ddecl; |
2617 | } | |
2618 | ||
91e97eb8 RK |
2619 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTE |
2620 | is ATTRIBUTE. | |
2621 | ||
f8a89236 | 2622 | Record such modified types already made so we don't make duplicates. */ |
91e97eb8 RK |
2623 | |
2624 | tree | |
2625 | build_type_attribute_variant (ttype, attribute) | |
2626 | tree ttype, attribute; | |
2627 | { | |
2628 | if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute)) | |
2629 | { | |
05bccae2 | 2630 | unsigned int hashcode; |
91e97eb8 RK |
2631 | tree ntype; |
2632 | ||
91e97eb8 | 2633 | ntype = copy_node (ttype); |
91e97eb8 RK |
2634 | |
2635 | TYPE_POINTER_TO (ntype) = 0; | |
2636 | TYPE_REFERENCE_TO (ntype) = 0; | |
2637 | TYPE_ATTRIBUTES (ntype) = attribute; | |
2638 | ||
2639 | /* Create a new main variant of TYPE. */ | |
2640 | TYPE_MAIN_VARIANT (ntype) = ntype; | |
2641 | TYPE_NEXT_VARIANT (ntype) = 0; | |
3932261a | 2642 | set_type_quals (ntype, TYPE_UNQUALIFIED); |
91e97eb8 | 2643 | |
05bccae2 RK |
2644 | hashcode = (TYPE_HASH (TREE_CODE (ntype)) |
2645 | + TYPE_HASH (TREE_TYPE (ntype)) | |
2646 | + attribute_hash_list (attribute)); | |
91e97eb8 RK |
2647 | |
2648 | switch (TREE_CODE (ntype)) | |
dc478a5d | 2649 | { |
e9a25f70 JL |
2650 | case FUNCTION_TYPE: |
2651 | hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype)); | |
2652 | break; | |
2653 | case ARRAY_TYPE: | |
2654 | hashcode += TYPE_HASH (TYPE_DOMAIN (ntype)); | |
2655 | break; | |
2656 | case INTEGER_TYPE: | |
2657 | hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype)); | |
2658 | break; | |
2659 | case REAL_TYPE: | |
2660 | hashcode += TYPE_HASH (TYPE_PRECISION (ntype)); | |
2661 | break; | |
2662 | default: | |
2663 | break; | |
dc478a5d | 2664 | } |
91e97eb8 RK |
2665 | |
2666 | ntype = type_hash_canon (hashcode, ntype); | |
3932261a | 2667 | ttype = build_qualified_type (ntype, TYPE_QUALS (ttype)); |
91e97eb8 RK |
2668 | } |
2669 | ||
2670 | return ttype; | |
2671 | } | |
1a2927d2 | 2672 | |
12a68f1f | 2673 | /* Default value of targetm.comp_type_attributes that always returns 1. */ |
8d8e52be JM |
2674 | |
2675 | int | |
2676 | default_comp_type_attributes (type1, type2) | |
2677 | tree type1 ATTRIBUTE_UNUSED; | |
2678 | tree type2 ATTRIBUTE_UNUSED; | |
2679 | { | |
2680 | return 1; | |
2681 | } | |
2682 | ||
12a68f1f | 2683 | /* Default version of targetm.set_default_type_attributes that always does |
8d8e52be JM |
2684 | nothing. */ |
2685 | ||
2686 | void | |
2687 | default_set_default_type_attributes (type) | |
2688 | tree type ATTRIBUTE_UNUSED; | |
2689 | { | |
12a68f1f JM |
2690 | } |
2691 | ||
2692 | /* Default version of targetm.insert_attributes that always does nothing. */ | |
2693 | void | |
2694 | default_insert_attributes (decl, attr_ptr) | |
2695 | tree decl ATTRIBUTE_UNUSED; | |
2696 | tree *attr_ptr ATTRIBUTE_UNUSED; | |
2697 | { | |
8d8e52be JM |
2698 | } |
2699 | ||
91d231cb JM |
2700 | /* Default value of targetm.attribute_table that is empty. */ |
2701 | const struct attribute_spec default_target_attribute_table[] = | |
672a6f42 | 2702 | { |
91d231cb JM |
2703 | { NULL, 0, 0, false, false, false, NULL } |
2704 | }; | |
1a2927d2 | 2705 | |
91d231cb JM |
2706 | /* Default value of targetm.function_attribute_inlinable_p that always |
2707 | returns false. */ | |
2708 | bool | |
2709 | default_function_attribute_inlinable_p (fndecl) | |
2710 | tree fndecl ATTRIBUTE_UNUSED; | |
2711 | { | |
2712 | /* By default, functions with machine attributes cannot be inlined. */ | |
2713 | return false; | |
1a2927d2 | 2714 | } |
2a3c15b5 DE |
2715 | |
2716 | /* Return non-zero if IDENT is a valid name for attribute ATTR, | |
2717 | or zero if not. | |
2718 | ||
2719 | We try both `text' and `__text__', ATTR may be either one. */ | |
2720 | /* ??? It might be a reasonable simplification to require ATTR to be only | |
2721 | `text'. One might then also require attribute lists to be stored in | |
2722 | their canonicalized form. */ | |
2723 | ||
2724 | int | |
2725 | is_attribute_p (attr, ident) | |
37b37199 | 2726 | const char *attr; |
2a3c15b5 DE |
2727 | tree ident; |
2728 | { | |
2729 | int ident_len, attr_len; | |
63ad61ed | 2730 | const char *p; |
2a3c15b5 DE |
2731 | |
2732 | if (TREE_CODE (ident) != IDENTIFIER_NODE) | |
2733 | return 0; | |
2734 | ||
2735 | if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0) | |
2736 | return 1; | |
2737 | ||
2738 | p = IDENTIFIER_POINTER (ident); | |
2739 | ident_len = strlen (p); | |
2740 | attr_len = strlen (attr); | |
2741 | ||
2742 | /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */ | |
2743 | if (attr[0] == '_') | |
2744 | { | |
2745 | if (attr[1] != '_' | |
2746 | || attr[attr_len - 2] != '_' | |
2747 | || attr[attr_len - 1] != '_') | |
2748 | abort (); | |
2749 | if (ident_len == attr_len - 4 | |
2750 | && strncmp (attr + 2, p, attr_len - 4) == 0) | |
2751 | return 1; | |
2752 | } | |
2753 | else | |
2754 | { | |
2755 | if (ident_len == attr_len + 4 | |
2756 | && p[0] == '_' && p[1] == '_' | |
2757 | && p[ident_len - 2] == '_' && p[ident_len - 1] == '_' | |
2758 | && strncmp (attr, p + 2, attr_len) == 0) | |
2759 | return 1; | |
2760 | } | |
2761 | ||
2762 | return 0; | |
2763 | } | |
2764 | ||
2765 | /* Given an attribute name and a list of attributes, return a pointer to the | |
2766 | attribute's list element if the attribute is part of the list, or NULL_TREE | |
91d231cb JM |
2767 | if not found. If the attribute appears more than once, this only |
2768 | returns the first occurance; the TREE_CHAIN of the return value should | |
2769 | be passed back in if further occurances are wanted. */ | |
2a3c15b5 DE |
2770 | |
2771 | tree | |
2772 | lookup_attribute (attr_name, list) | |
37b37199 | 2773 | const char *attr_name; |
2a3c15b5 DE |
2774 | tree list; |
2775 | { | |
2776 | tree l; | |
2777 | ||
2778 | for (l = list; l; l = TREE_CHAIN (l)) | |
2779 | { | |
2780 | if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE) | |
2781 | abort (); | |
2782 | if (is_attribute_p (attr_name, TREE_PURPOSE (l))) | |
2783 | return l; | |
2784 | } | |
2785 | ||
2786 | return NULL_TREE; | |
2787 | } | |
f3209e2f DE |
2788 | |
2789 | /* Return an attribute list that is the union of a1 and a2. */ | |
2790 | ||
2791 | tree | |
2792 | merge_attributes (a1, a2) | |
b3694847 | 2793 | tree a1, a2; |
f3209e2f DE |
2794 | { |
2795 | tree attributes; | |
2796 | ||
2797 | /* Either one unset? Take the set one. */ | |
2798 | ||
d4b60170 | 2799 | if ((attributes = a1) == 0) |
f3209e2f DE |
2800 | attributes = a2; |
2801 | ||
2802 | /* One that completely contains the other? Take it. */ | |
2803 | ||
d4b60170 | 2804 | else if (a2 != 0 && ! attribute_list_contained (a1, a2)) |
dc478a5d KH |
2805 | { |
2806 | if (attribute_list_contained (a2, a1)) | |
2807 | attributes = a2; | |
2808 | else | |
2809 | { | |
2810 | /* Pick the longest list, and hang on the other list. */ | |
dc478a5d KH |
2811 | |
2812 | if (list_length (a1) < list_length (a2)) | |
2813 | attributes = a2, a2 = a1; | |
2814 | ||
2815 | for (; a2 != 0; a2 = TREE_CHAIN (a2)) | |
91d231cb JM |
2816 | { |
2817 | tree a; | |
2818 | for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)), | |
2819 | attributes); | |
2820 | a != NULL_TREE; | |
2821 | a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)), | |
2822 | TREE_CHAIN (a))) | |
2823 | { | |
2824 | if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1) | |
2825 | break; | |
2826 | } | |
2827 | if (a == NULL_TREE) | |
2828 | { | |
2829 | a1 = copy_node (a2); | |
2830 | TREE_CHAIN (a1) = attributes; | |
2831 | attributes = a1; | |
2832 | } | |
2833 | } | |
dc478a5d KH |
2834 | } |
2835 | } | |
f3209e2f DE |
2836 | return attributes; |
2837 | } | |
d9525bec BK |
2838 | |
2839 | /* Given types T1 and T2, merge their attributes and return | |
672a6f42 | 2840 | the result. */ |
d9525bec BK |
2841 | |
2842 | tree | |
672a6f42 | 2843 | merge_type_attributes (t1, t2) |
d9525bec BK |
2844 | tree t1, t2; |
2845 | { | |
d9525bec BK |
2846 | return merge_attributes (TYPE_ATTRIBUTES (t1), |
2847 | TYPE_ATTRIBUTES (t2)); | |
d9525bec BK |
2848 | } |
2849 | ||
2850 | /* Given decls OLDDECL and NEWDECL, merge their attributes and return | |
2851 | the result. */ | |
2852 | ||
2853 | tree | |
672a6f42 | 2854 | merge_decl_attributes (olddecl, newdecl) |
d9525bec BK |
2855 | tree olddecl, newdecl; |
2856 | { | |
91d231cb JM |
2857 | return merge_attributes (DECL_ATTRIBUTES (olddecl), |
2858 | DECL_ATTRIBUTES (newdecl)); | |
d9525bec | 2859 | } |
672a6f42 NB |
2860 | |
2861 | #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES | |
2862 | ||
2863 | /* Specialization of merge_decl_attributes for various Windows targets. | |
2864 | ||
2865 | This handles the following situation: | |
2866 | ||
2867 | __declspec (dllimport) int foo; | |
2868 | int foo; | |
2869 | ||
2870 | The second instance of `foo' nullifies the dllimport. */ | |
2871 | ||
2872 | tree | |
2873 | merge_dllimport_decl_attributes (old, new) | |
2874 | tree old; | |
2875 | tree new; | |
2876 | { | |
2877 | tree a; | |
2878 | int delete_dllimport_p; | |
2879 | ||
91d231cb JM |
2880 | old = DECL_ATTRIBUTES (old); |
2881 | new = DECL_ATTRIBUTES (new); | |
672a6f42 NB |
2882 | |
2883 | /* What we need to do here is remove from `old' dllimport if it doesn't | |
2884 | appear in `new'. dllimport behaves like extern: if a declaration is | |
2885 | marked dllimport and a definition appears later, then the object | |
2886 | is not dllimport'd. */ | |
2887 | if (lookup_attribute ("dllimport", old) != NULL_TREE | |
2888 | && lookup_attribute ("dllimport", new) == NULL_TREE) | |
2889 | delete_dllimport_p = 1; | |
2890 | else | |
2891 | delete_dllimport_p = 0; | |
2892 | ||
2893 | a = merge_attributes (old, new); | |
2894 | ||
2895 | if (delete_dllimport_p) | |
2896 | { | |
2897 | tree prev,t; | |
2898 | ||
2899 | /* Scan the list for dllimport and delete it. */ | |
2900 | for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t)) | |
2901 | { | |
2902 | if (is_attribute_p ("dllimport", TREE_PURPOSE (t))) | |
2903 | { | |
2904 | if (prev == NULL_TREE) | |
2905 | a = TREE_CHAIN (a); | |
2906 | else | |
2907 | TREE_CHAIN (prev) = TREE_CHAIN (t); | |
2908 | break; | |
2909 | } | |
2910 | } | |
2911 | } | |
2912 | ||
2913 | return a; | |
2914 | } | |
2915 | ||
2916 | #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */ | |
91e97eb8 | 2917 | \f |
3932261a MM |
2918 | /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask |
2919 | of the various TYPE_QUAL values. */ | |
c6a1db6c | 2920 | |
3932261a MM |
2921 | static void |
2922 | set_type_quals (type, type_quals) | |
2923 | tree type; | |
dc478a5d | 2924 | int type_quals; |
3932261a MM |
2925 | { |
2926 | TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0; | |
2927 | TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0; | |
2928 | TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0; | |
2929 | } | |
c6a1db6c | 2930 | |
5101b304 MM |
2931 | /* Return a version of the TYPE, qualified as indicated by the |
2932 | TYPE_QUALS, if one exists. If no qualified version exists yet, | |
2933 | return NULL_TREE. */ | |
c6a1db6c RS |
2934 | |
2935 | tree | |
5101b304 | 2936 | get_qualified_type (type, type_quals) |
c6a1db6c | 2937 | tree type; |
3932261a | 2938 | int type_quals; |
c6a1db6c | 2939 | { |
5101b304 | 2940 | tree t; |
dc478a5d | 2941 | |
e24fa534 JW |
2942 | /* Search the chain of variants to see if there is already one there just |
2943 | like the one we need to have. If so, use that existing one. We must | |
2944 | preserve the TYPE_NAME, since there is code that depends on this. */ | |
b217d7fe | 2945 | for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t)) |
3932261a | 2946 | if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type)) |
e24fa534 | 2947 | return t; |
c6a1db6c | 2948 | |
5101b304 MM |
2949 | return NULL_TREE; |
2950 | } | |
2951 | ||
2952 | /* Like get_qualified_type, but creates the type if it does not | |
2953 | exist. This function never returns NULL_TREE. */ | |
2954 | ||
2955 | tree | |
2956 | build_qualified_type (type, type_quals) | |
2957 | tree type; | |
2958 | int type_quals; | |
2959 | { | |
2960 | tree t; | |
2961 | ||
2962 | /* See if we already have the appropriate qualified variant. */ | |
2963 | t = get_qualified_type (type, type_quals); | |
2964 | ||
2965 | /* If not, build it. */ | |
2966 | if (!t) | |
2967 | { | |
2968 | t = build_type_copy (type); | |
2969 | set_type_quals (t, type_quals); | |
2970 | } | |
2971 | ||
c6a1db6c RS |
2972 | return t; |
2973 | } | |
b4ac57ab RS |
2974 | |
2975 | /* Create a new variant of TYPE, equivalent but distinct. | |
2976 | This is so the caller can modify it. */ | |
2977 | ||
2978 | tree | |
2979 | build_type_copy (type) | |
2980 | tree type; | |
2981 | { | |
b3694847 | 2982 | tree t, m = TYPE_MAIN_VARIANT (type); |
b4ac57ab | 2983 | |
b4ac57ab | 2984 | t = copy_node (type); |
d9cbc259 | 2985 | |
b4ac57ab RS |
2986 | TYPE_POINTER_TO (t) = 0; |
2987 | TYPE_REFERENCE_TO (t) = 0; | |
2988 | ||
2989 | /* Add this type to the chain of variants of TYPE. */ | |
2990 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m); | |
2991 | TYPE_NEXT_VARIANT (m) = t; | |
2992 | ||
b4ac57ab RS |
2993 | return t; |
2994 | } | |
c6a1db6c RS |
2995 | \f |
2996 | /* Hashing of types so that we don't make duplicates. | |
2997 | The entry point is `type_hash_canon'. */ | |
2998 | ||
c6a1db6c RS |
2999 | /* Compute a hash code for a list of types (chain of TREE_LIST nodes |
3000 | with types in the TREE_VALUE slots), by adding the hash codes | |
3001 | of the individual types. */ | |
3002 | ||
05bccae2 | 3003 | unsigned int |
c6a1db6c RS |
3004 | type_hash_list (list) |
3005 | tree list; | |
3006 | { | |
05bccae2 | 3007 | unsigned int hashcode; |
b3694847 | 3008 | tree tail; |
d4b60170 | 3009 | |
c6a1db6c RS |
3010 | for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail)) |
3011 | hashcode += TYPE_HASH (TREE_VALUE (tail)); | |
d4b60170 | 3012 | |
c6a1db6c RS |
3013 | return hashcode; |
3014 | } | |
3015 | ||
d88f311b ML |
3016 | /* These are the Hashtable callback functions. */ |
3017 | ||
3018 | /* Returns true if the types are equal. */ | |
3019 | ||
3020 | static int | |
3021 | type_hash_eq (va, vb) | |
3022 | const void *va; | |
3023 | const void *vb; | |
3024 | { | |
3025 | const struct type_hash *a = va, *b = vb; | |
3026 | if (a->hash == b->hash | |
3027 | && TREE_CODE (a->type) == TREE_CODE (b->type) | |
3028 | && TREE_TYPE (a->type) == TREE_TYPE (b->type) | |
3029 | && attribute_list_equal (TYPE_ATTRIBUTES (a->type), | |
3030 | TYPE_ATTRIBUTES (b->type)) | |
3031 | && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type) | |
3032 | && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type) | |
3033 | || tree_int_cst_equal (TYPE_MAX_VALUE (a->type), | |
3034 | TYPE_MAX_VALUE (b->type))) | |
3035 | && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type) | |
3036 | || tree_int_cst_equal (TYPE_MIN_VALUE (a->type), | |
3037 | TYPE_MIN_VALUE (b->type))) | |
3038 | /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */ | |
3039 | && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type) | |
3040 | || (TYPE_DOMAIN (a->type) | |
3041 | && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST | |
3042 | && TYPE_DOMAIN (b->type) | |
3043 | && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST | |
3044 | && type_list_equal (TYPE_DOMAIN (a->type), | |
3045 | TYPE_DOMAIN (b->type))))) | |
3046 | return 1; | |
3047 | return 0; | |
3048 | } | |
3049 | ||
3050 | /* Return the cached hash value. */ | |
3051 | ||
3052 | static unsigned int | |
3053 | type_hash_hash (item) | |
3054 | const void *item; | |
3055 | { | |
dc478a5d | 3056 | return ((const struct type_hash *) item)->hash; |
d88f311b ML |
3057 | } |
3058 | ||
c6a1db6c RS |
3059 | /* Look in the type hash table for a type isomorphic to TYPE. |
3060 | If one is found, return it. Otherwise return 0. */ | |
3061 | ||
3062 | tree | |
3063 | type_hash_lookup (hashcode, type) | |
05bccae2 | 3064 | unsigned int hashcode; |
c6a1db6c RS |
3065 | tree type; |
3066 | { | |
d88f311b | 3067 | struct type_hash *h, in; |
da48638e AH |
3068 | |
3069 | /* The TYPE_ALIGN field of a type is set by layout_type(), so we | |
dc478a5d | 3070 | must call that routine before comparing TYPE_ALIGNs. */ |
da48638e AH |
3071 | layout_type (type); |
3072 | ||
d88f311b ML |
3073 | in.hash = hashcode; |
3074 | in.type = type; | |
d4b60170 | 3075 | |
d88f311b ML |
3076 | h = htab_find_with_hash (type_hash_table, &in, hashcode); |
3077 | if (h) | |
3078 | return h->type; | |
3079 | return NULL_TREE; | |
c6a1db6c RS |
3080 | } |
3081 | ||
3082 | /* Add an entry to the type-hash-table | |
3083 | for a type TYPE whose hash code is HASHCODE. */ | |
3084 | ||
3085 | void | |
3086 | type_hash_add (hashcode, type) | |
05bccae2 | 3087 | unsigned int hashcode; |
c6a1db6c RS |
3088 | tree type; |
3089 | { | |
d88f311b ML |
3090 | struct type_hash *h; |
3091 | void **loc; | |
c6a1db6c | 3092 | |
4c160717 | 3093 | h = (struct type_hash *) ggc_alloc (sizeof (struct type_hash)); |
d88f311b | 3094 | h->hash = hashcode; |
c6a1db6c | 3095 | h->type = type; |
f64bedbd | 3096 | loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT); |
dc478a5d | 3097 | *(struct type_hash **) loc = h; |
c6a1db6c RS |
3098 | } |
3099 | ||
3100 | /* Given TYPE, and HASHCODE its hash code, return the canonical | |
3101 | object for an identical type if one already exists. | |
3102 | Otherwise, return TYPE, and record it as the canonical object | |
3103 | if it is a permanent object. | |
3104 | ||
3105 | To use this function, first create a type of the sort you want. | |
3106 | Then compute its hash code from the fields of the type that | |
3107 | make it different from other similar types. | |
3108 | Then call this function and use the value. | |
3109 | This function frees the type you pass in if it is a duplicate. */ | |
3110 | ||
3111 | /* Set to 1 to debug without canonicalization. Never set by program. */ | |
3112 | int debug_no_type_hash = 0; | |
3113 | ||
3114 | tree | |
3115 | type_hash_canon (hashcode, type) | |
05bccae2 | 3116 | unsigned int hashcode; |
c6a1db6c RS |
3117 | tree type; |
3118 | { | |
3119 | tree t1; | |
3120 | ||
3121 | if (debug_no_type_hash) | |
3122 | return type; | |
3123 | ||
4c160717 RK |
3124 | /* See if the type is in the hash table already. If so, return it. |
3125 | Otherwise, add the type. */ | |
c6a1db6c RS |
3126 | t1 = type_hash_lookup (hashcode, type); |
3127 | if (t1 != 0) | |
3128 | { | |
c6a1db6c | 3129 | #ifdef GATHER_STATISTICS |
770ae6cc RK |
3130 | tree_node_counts[(int) t_kind]--; |
3131 | tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type); | |
c6a1db6c RS |
3132 | #endif |
3133 | return t1; | |
3134 | } | |
4c160717 RK |
3135 | else |
3136 | { | |
3137 | type_hash_add (hashcode, type); | |
3138 | return type; | |
3139 | } | |
c6a1db6c RS |
3140 | } |
3141 | ||
6abba055 RK |
3142 | /* See if the data pointed to by the type hash table is marked. We consider |
3143 | it marked if the type is marked or if a debug type number or symbol | |
3144 | table entry has been made for the type. This reduces the amount of | |
3145 | debugging output and eliminates that dependency of the debug output on | |
3146 | the number of garbage collections. */ | |
d88f311b ML |
3147 | |
3148 | static int | |
4c160717 RK |
3149 | type_hash_marked_p (p) |
3150 | const void *p; | |
d88f311b | 3151 | { |
6abba055 RK |
3152 | tree type = ((struct type_hash *) p)->type; |
3153 | ||
3154 | return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type); | |
d88f311b ML |
3155 | } |
3156 | ||
6abba055 RK |
3157 | /* Mark the entry in the type hash table the type it points to is marked. |
3158 | Also mark the type in case we are considering this entry "marked" by | |
3159 | virtue of TYPE_SYMTAB_POINTER being set. */ | |
87ff9c8e RH |
3160 | |
3161 | static void | |
4c160717 RK |
3162 | type_hash_mark (p) |
3163 | const void *p; | |
87ff9c8e | 3164 | { |
4c160717 | 3165 | ggc_mark (p); |
6abba055 | 3166 | ggc_mark_tree (((struct type_hash *) p)->type); |
d88f311b | 3167 | } |
87ff9c8e | 3168 | |
9ccb25d5 MM |
3169 | /* Mark the hashtable slot pointed to by ENTRY (which is really a |
3170 | `tree**') for GC. */ | |
3171 | ||
3172 | static int | |
3173 | mark_tree_hashtable_entry (entry, data) | |
3174 | void **entry; | |
3175 | void *data ATTRIBUTE_UNUSED; | |
3176 | { | |
3177 | ggc_mark_tree ((tree) *entry); | |
3178 | return 1; | |
3179 | } | |
3180 | ||
3181 | /* Mark ARG (which is really a htab_t whose slots are trees) for | |
3182 | GC. */ | |
3183 | ||
3184 | void | |
3185 | mark_tree_hashtable (arg) | |
3186 | void *arg; | |
3187 | { | |
3188 | htab_t t = *(htab_t *) arg; | |
3189 | htab_traverse (t, mark_tree_hashtable_entry, 0); | |
3190 | } | |
3191 | ||
d88f311b ML |
3192 | static void |
3193 | print_type_hash_statistics () | |
3194 | { | |
770ae6cc RK |
3195 | fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n", |
3196 | (long) htab_size (type_hash_table), | |
3197 | (long) htab_elements (type_hash_table), | |
d88f311b | 3198 | htab_collisions (type_hash_table)); |
87ff9c8e RH |
3199 | } |
3200 | ||
2a3c15b5 DE |
3201 | /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes |
3202 | with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots), | |
3203 | by adding the hash codes of the individual attributes. */ | |
3e3d7e77 | 3204 | |
05bccae2 | 3205 | unsigned int |
2a3c15b5 DE |
3206 | attribute_hash_list (list) |
3207 | tree list; | |
3e3d7e77 | 3208 | { |
05bccae2 | 3209 | unsigned int hashcode; |
b3694847 | 3210 | tree tail; |
d4b60170 | 3211 | |
2a3c15b5 DE |
3212 | for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail)) |
3213 | /* ??? Do we want to add in TREE_VALUE too? */ | |
3214 | hashcode += TYPE_HASH (TREE_PURPOSE (tail)); | |
3215 | return hashcode; | |
3e3d7e77 RK |
3216 | } |
3217 | ||
91e97eb8 RK |
3218 | /* Given two lists of attributes, return true if list l2 is |
3219 | equivalent to l1. */ | |
3220 | ||
3221 | int | |
3222 | attribute_list_equal (l1, l2) | |
3223 | tree l1, l2; | |
3224 | { | |
3225 | return attribute_list_contained (l1, l2) | |
3226 | && attribute_list_contained (l2, l1); | |
3227 | } | |
3228 | ||
2a3c15b5 DE |
3229 | /* Given two lists of attributes, return true if list L2 is |
3230 | completely contained within L1. */ | |
3231 | /* ??? This would be faster if attribute names were stored in a canonicalized | |
3232 | form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method | |
3233 | must be used to show these elements are equivalent (which they are). */ | |
3234 | /* ??? It's not clear that attributes with arguments will always be handled | |
3235 | correctly. */ | |
91e97eb8 RK |
3236 | |
3237 | int | |
3238 | attribute_list_contained (l1, l2) | |
3239 | tree l1, l2; | |
3240 | { | |
b3694847 | 3241 | tree t1, t2; |
91e97eb8 RK |
3242 | |
3243 | /* First check the obvious, maybe the lists are identical. */ | |
3244 | if (l1 == l2) | |
dc478a5d | 3245 | return 1; |
91e97eb8 | 3246 | |
2a3c15b5 | 3247 | /* Maybe the lists are similar. */ |
91e97eb8 | 3248 | for (t1 = l1, t2 = l2; |
d4b60170 | 3249 | t1 != 0 && t2 != 0 |
2a3c15b5 | 3250 | && TREE_PURPOSE (t1) == TREE_PURPOSE (t2) |
91e97eb8 RK |
3251 | && TREE_VALUE (t1) == TREE_VALUE (t2); |
3252 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)); | |
3253 | ||
3254 | /* Maybe the lists are equal. */ | |
3255 | if (t1 == 0 && t2 == 0) | |
3256 | return 1; | |
3257 | ||
d4b60170 | 3258 | for (; t2 != 0; t2 = TREE_CHAIN (t2)) |
2a3c15b5 | 3259 | { |
91d231cb JM |
3260 | tree attr; |
3261 | for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1); | |
3262 | attr != NULL_TREE; | |
3263 | attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), | |
3264 | TREE_CHAIN (attr))) | |
3265 | { | |
3266 | if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1) | |
3267 | break; | |
3268 | } | |
2a3c15b5 | 3269 | |
d4b60170 | 3270 | if (attr == 0) |
91e97eb8 | 3271 | return 0; |
d4b60170 | 3272 | |
2a3c15b5 DE |
3273 | if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1) |
3274 | return 0; | |
3275 | } | |
3e3d7e77 | 3276 | |
91e97eb8 RK |
3277 | return 1; |
3278 | } | |
3279 | ||
c6a1db6c RS |
3280 | /* Given two lists of types |
3281 | (chains of TREE_LIST nodes with types in the TREE_VALUE slots) | |
3282 | return 1 if the lists contain the same types in the same order. | |
3283 | Also, the TREE_PURPOSEs must match. */ | |
3284 | ||
3285 | int | |
3286 | type_list_equal (l1, l2) | |
3287 | tree l1, l2; | |
3288 | { | |
b3694847 | 3289 | tree t1, t2; |
364e1f1c | 3290 | |
c6a1db6c | 3291 | for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) |
364e1f1c RK |
3292 | if (TREE_VALUE (t1) != TREE_VALUE (t2) |
3293 | || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2) | |
bbda4250 JM |
3294 | && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)) |
3295 | && (TREE_TYPE (TREE_PURPOSE (t1)) | |
3296 | == TREE_TYPE (TREE_PURPOSE (t2)))))) | |
364e1f1c | 3297 | return 0; |
c6a1db6c RS |
3298 | |
3299 | return t1 == t2; | |
3300 | } | |
3301 | ||
f5d6a24c MM |
3302 | /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE |
3303 | given by TYPE. If the argument list accepts variable arguments, | |
3304 | then this function counts only the ordinary arguments. */ | |
3305 | ||
3306 | int | |
3307 | type_num_arguments (type) | |
3308 | tree type; | |
3309 | { | |
3310 | int i = 0; | |
3311 | tree t; | |
3312 | ||
3313 | for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t)) | |
3314 | /* If the function does not take a variable number of arguments, | |
3315 | the last element in the list will have type `void'. */ | |
3316 | if (VOID_TYPE_P (TREE_VALUE (t))) | |
3317 | break; | |
3318 | else | |
3319 | ++i; | |
3320 | ||
3321 | return i; | |
3322 | } | |
3323 | ||
c6a1db6c RS |
3324 | /* Nonzero if integer constants T1 and T2 |
3325 | represent the same constant value. */ | |
3326 | ||
3327 | int | |
3328 | tree_int_cst_equal (t1, t2) | |
3329 | tree t1, t2; | |
3330 | { | |
3331 | if (t1 == t2) | |
3332 | return 1; | |
d4b60170 | 3333 | |
c6a1db6c RS |
3334 | if (t1 == 0 || t2 == 0) |
3335 | return 0; | |
d4b60170 | 3336 | |
c6a1db6c RS |
3337 | if (TREE_CODE (t1) == INTEGER_CST |
3338 | && TREE_CODE (t2) == INTEGER_CST | |
3339 | && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
3340 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)) | |
3341 | return 1; | |
d4b60170 | 3342 | |
c6a1db6c RS |
3343 | return 0; |
3344 | } | |
3345 | ||
3346 | /* Nonzero if integer constants T1 and T2 represent values that satisfy <. | |
3347 | The precise way of comparison depends on their data type. */ | |
3348 | ||
3349 | int | |
3350 | tree_int_cst_lt (t1, t2) | |
3351 | tree t1, t2; | |
3352 | { | |
3353 | if (t1 == t2) | |
3354 | return 0; | |
3355 | ||
d4b60170 | 3356 | if (! TREE_UNSIGNED (TREE_TYPE (t1))) |
c6a1db6c | 3357 | return INT_CST_LT (t1, t2); |
d4b60170 | 3358 | |
c6a1db6c RS |
3359 | return INT_CST_LT_UNSIGNED (t1, t2); |
3360 | } | |
3361 | ||
56cb9733 MM |
3362 | /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */ |
3363 | ||
3364 | int | |
3365 | tree_int_cst_compare (t1, t2) | |
3366 | tree t1; | |
3367 | tree t2; | |
3368 | { | |
3369 | if (tree_int_cst_lt (t1, t2)) | |
3370 | return -1; | |
3371 | else if (tree_int_cst_lt (t2, t1)) | |
3372 | return 1; | |
3373 | else | |
3374 | return 0; | |
3375 | } | |
3376 | ||
665f2503 RK |
3377 | /* Return 1 if T is an INTEGER_CST that can be represented in a single |
3378 | HOST_WIDE_INT value. If POS is nonzero, the result must be positive. */ | |
3379 | ||
3380 | int | |
3381 | host_integerp (t, pos) | |
3382 | tree t; | |
3383 | int pos; | |
3384 | { | |
3385 | return (TREE_CODE (t) == INTEGER_CST | |
3386 | && ! TREE_OVERFLOW (t) | |
3387 | && ((TREE_INT_CST_HIGH (t) == 0 | |
3388 | && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0) | |
3389 | || (! pos && TREE_INT_CST_HIGH (t) == -1 | |
21217bd0 JW |
3390 | && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0) |
3391 | || (! pos && TREE_INT_CST_HIGH (t) == 0 | |
3392 | && TREE_UNSIGNED (TREE_TYPE (t))))); | |
665f2503 RK |
3393 | } |
3394 | ||
3395 | /* Return the HOST_WIDE_INT least significant bits of T if it is an | |
3396 | INTEGER_CST and there is no overflow. POS is nonzero if the result must | |
3397 | be positive. Abort if we cannot satisfy the above conditions. */ | |
3398 | ||
3399 | HOST_WIDE_INT | |
3400 | tree_low_cst (t, pos) | |
3401 | tree t; | |
3402 | int pos; | |
3403 | { | |
3404 | if (host_integerp (t, pos)) | |
3405 | return TREE_INT_CST_LOW (t); | |
3406 | else | |
3407 | abort (); | |
dc478a5d | 3408 | } |
665f2503 | 3409 | |
a49a6a68 JW |
3410 | /* Return the most significant bit of the integer constant T. */ |
3411 | ||
3412 | int | |
3413 | tree_int_cst_msb (t) | |
3414 | tree t; | |
3415 | { | |
b3694847 | 3416 | int prec; |
a49a6a68 | 3417 | HOST_WIDE_INT h; |
f9e158c3 | 3418 | unsigned HOST_WIDE_INT l; |
a49a6a68 JW |
3419 | |
3420 | /* Note that using TYPE_PRECISION here is wrong. We care about the | |
3421 | actual bits, not the (arbitrary) range of the type. */ | |
3422 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1; | |
3423 | rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec, | |
3424 | 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0); | |
3425 | return (l & 1) == 1; | |
dc478a5d | 3426 | } |
a49a6a68 | 3427 | |
6d9cb074 RK |
3428 | /* Return an indication of the sign of the integer constant T. |
3429 | The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0. | |
3430 | Note that -1 will never be returned it T's type is unsigned. */ | |
3431 | ||
3432 | int | |
3433 | tree_int_cst_sgn (t) | |
3434 | tree t; | |
3435 | { | |
3436 | if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0) | |
3437 | return 0; | |
3438 | else if (TREE_UNSIGNED (TREE_TYPE (t))) | |
3439 | return 1; | |
3440 | else if (TREE_INT_CST_HIGH (t) < 0) | |
3441 | return -1; | |
3442 | else | |
3443 | return 1; | |
3444 | } | |
3445 | ||
364e1f1c RK |
3446 | /* Compare two constructor-element-type constants. Return 1 if the lists |
3447 | are known to be equal; otherwise return 0. */ | |
3448 | ||
c6a1db6c RS |
3449 | int |
3450 | simple_cst_list_equal (l1, l2) | |
3451 | tree l1, l2; | |
3452 | { | |
3453 | while (l1 != NULL_TREE && l2 != NULL_TREE) | |
3454 | { | |
364e1f1c | 3455 | if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1) |
c6a1db6c | 3456 | return 0; |
364e1f1c | 3457 | |
c6a1db6c RS |
3458 | l1 = TREE_CHAIN (l1); |
3459 | l2 = TREE_CHAIN (l2); | |
3460 | } | |
364e1f1c | 3461 | |
d4b60170 | 3462 | return l1 == l2; |
c6a1db6c RS |
3463 | } |
3464 | ||
3465 | /* Return truthvalue of whether T1 is the same tree structure as T2. | |
3466 | Return 1 if they are the same. | |
3467 | Return 0 if they are understandably different. | |
3468 | Return -1 if either contains tree structure not understood by | |
3469 | this function. */ | |
3470 | ||
3471 | int | |
3472 | simple_cst_equal (t1, t2) | |
3473 | tree t1, t2; | |
3474 | { | |
b3694847 | 3475 | enum tree_code code1, code2; |
c6a1db6c | 3476 | int cmp; |
d4b60170 | 3477 | int i; |
c6a1db6c RS |
3478 | |
3479 | if (t1 == t2) | |
3480 | return 1; | |
3481 | if (t1 == 0 || t2 == 0) | |
3482 | return 0; | |
3483 | ||
3484 | code1 = TREE_CODE (t1); | |
3485 | code2 = TREE_CODE (t2); | |
3486 | ||
3487 | if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR) | |
af79bb86 JM |
3488 | { |
3489 | if (code2 == NOP_EXPR || code2 == CONVERT_EXPR | |
3490 | || code2 == NON_LVALUE_EXPR) | |
3491 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3492 | else | |
3493 | return simple_cst_equal (TREE_OPERAND (t1, 0), t2); | |
3494 | } | |
d4b60170 | 3495 | |
c6a1db6c RS |
3496 | else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR |
3497 | || code2 == NON_LVALUE_EXPR) | |
3498 | return simple_cst_equal (t1, TREE_OPERAND (t2, 0)); | |
3499 | ||
3500 | if (code1 != code2) | |
3501 | return 0; | |
3502 | ||
3503 | switch (code1) | |
3504 | { | |
3505 | case INTEGER_CST: | |
d4b60170 RK |
3506 | return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) |
3507 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)); | |
c6a1db6c RS |
3508 | |
3509 | case REAL_CST: | |
41c9120b | 3510 | return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); |
c6a1db6c RS |
3511 | |
3512 | case STRING_CST: | |
d4b60170 | 3513 | return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) |
da61dec9 | 3514 | && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), |
d4b60170 | 3515 | TREE_STRING_LENGTH (t1))); |
c6a1db6c RS |
3516 | |
3517 | case CONSTRUCTOR: | |
b3abfd6f JM |
3518 | if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2)) |
3519 | return 1; | |
3520 | else | |
3521 | abort (); | |
c6a1db6c RS |
3522 | |
3523 | case SAVE_EXPR: | |
3524 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3525 | ||
3526 | case CALL_EXPR: | |
3527 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3528 | if (cmp <= 0) | |
3529 | return cmp; | |
d4b60170 RK |
3530 | return |
3531 | simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); | |
c6a1db6c RS |
3532 | |
3533 | case TARGET_EXPR: | |
3534 | /* Special case: if either target is an unallocated VAR_DECL, | |
3535 | it means that it's going to be unified with whatever the | |
3536 | TARGET_EXPR is really supposed to initialize, so treat it | |
3537 | as being equivalent to anything. */ | |
3538 | if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL | |
3539 | && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE | |
19e7881c | 3540 | && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0))) |
c6a1db6c RS |
3541 | || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL |
3542 | && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE | |
19e7881c | 3543 | && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0)))) |
c6a1db6c RS |
3544 | cmp = 1; |
3545 | else | |
3546 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
d4b60170 | 3547 | |
c6a1db6c RS |
3548 | if (cmp <= 0) |
3549 | return cmp; | |
d4b60170 | 3550 | |
c6a1db6c RS |
3551 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); |
3552 | ||
3553 | case WITH_CLEANUP_EXPR: | |
3554 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3555 | if (cmp <= 0) | |
3556 | return cmp; | |
d4b60170 | 3557 | |
6ad7895a | 3558 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1)); |
c6a1db6c RS |
3559 | |
3560 | case COMPONENT_REF: | |
3561 | if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1)) | |
3562 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
d4b60170 | 3563 | |
c6a1db6c RS |
3564 | return 0; |
3565 | ||
c6a1db6c RS |
3566 | case VAR_DECL: |
3567 | case PARM_DECL: | |
3568 | case CONST_DECL: | |
3569 | case FUNCTION_DECL: | |
3570 | return 0; | |
dc478a5d | 3571 | |
e9a25f70 JL |
3572 | default: |
3573 | break; | |
86aed40b | 3574 | } |
c6a1db6c | 3575 | |
8ae49a28 RK |
3576 | /* This general rule works for most tree codes. All exceptions should be |
3577 | handled above. If this is a language-specific tree code, we can't | |
3578 | trust what might be in the operand, so say we don't know | |
3579 | the situation. */ | |
0a6969ad | 3580 | if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE) |
8ae49a28 | 3581 | return -1; |
c6a1db6c | 3582 | |
86aed40b RS |
3583 | switch (TREE_CODE_CLASS (code1)) |
3584 | { | |
86aed40b RS |
3585 | case '1': |
3586 | case '2': | |
3587 | case '<': | |
3588 | case 'e': | |
3589 | case 'r': | |
3590 | case 's': | |
3591 | cmp = 1; | |
8d5e6e25 | 3592 | for (i = 0; i < TREE_CODE_LENGTH (code1); i++) |
86aed40b RS |
3593 | { |
3594 | cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)); | |
3595 | if (cmp <= 0) | |
3596 | return cmp; | |
3597 | } | |
d4b60170 | 3598 | |
86aed40b | 3599 | return cmp; |
86aed40b | 3600 | |
e9a25f70 JL |
3601 | default: |
3602 | return -1; | |
3603 | } | |
c6a1db6c | 3604 | } |
05bccae2 RK |
3605 | |
3606 | /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value. | |
3607 | Return -1, 0, or 1 if the value of T is less than, equal to, or greater | |
3608 | than U, respectively. */ | |
3609 | ||
3610 | int | |
3611 | compare_tree_int (t, u) | |
3612 | tree t; | |
3613 | unsigned int u; | |
3614 | { | |
3615 | if (tree_int_cst_sgn (t) < 0) | |
3616 | return -1; | |
3617 | else if (TREE_INT_CST_HIGH (t) != 0) | |
3618 | return 1; | |
3619 | else if (TREE_INT_CST_LOW (t) == u) | |
3620 | return 0; | |
3621 | else if (TREE_INT_CST_LOW (t) < u) | |
3622 | return -1; | |
3623 | else | |
3624 | return 1; | |
3625 | } | |
c6a1db6c RS |
3626 | \f |
3627 | /* Constructors for pointer, array and function types. | |
3628 | (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are | |
3629 | constructed by language-dependent code, not here.) */ | |
3630 | ||
3631 | /* Construct, lay out and return the type of pointers to TO_TYPE. | |
3632 | If such a type has already been constructed, reuse it. */ | |
3633 | ||
3634 | tree | |
3635 | build_pointer_type (to_type) | |
3636 | tree to_type; | |
3637 | { | |
b3694847 | 3638 | tree t = TYPE_POINTER_TO (to_type); |
c6a1db6c RS |
3639 | |
3640 | /* First, if we already have a type for pointers to TO_TYPE, use it. */ | |
3641 | ||
d4b60170 | 3642 | if (t != 0) |
c6a1db6c RS |
3643 | return t; |
3644 | ||
1f8f4a0b | 3645 | /* We need a new one. */ |
c6a1db6c | 3646 | t = make_node (POINTER_TYPE); |
d9cbc259 | 3647 | |
c6a1db6c RS |
3648 | TREE_TYPE (t) = to_type; |
3649 | ||
3650 | /* Record this type as the pointer to TO_TYPE. */ | |
3651 | TYPE_POINTER_TO (to_type) = t; | |
3652 | ||
3653 | /* Lay out the type. This function has many callers that are concerned | |
3654 | with expression-construction, and this simplifies them all. | |
d9cbc259 | 3655 | Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */ |
c6a1db6c RS |
3656 | layout_type (t); |
3657 | ||
c6a1db6c RS |
3658 | return t; |
3659 | } | |
3660 | ||
d4b60170 RK |
3661 | /* Build the node for the type of references-to-TO_TYPE. */ |
3662 | ||
3663 | tree | |
3664 | build_reference_type (to_type) | |
3665 | tree to_type; | |
3666 | { | |
b3694847 | 3667 | tree t = TYPE_REFERENCE_TO (to_type); |
d4b60170 RK |
3668 | |
3669 | /* First, if we already have a type for pointers to TO_TYPE, use it. */ | |
3670 | ||
3671 | if (t) | |
3672 | return t; | |
3673 | ||
1f8f4a0b | 3674 | /* We need a new one. */ |
d4b60170 | 3675 | t = make_node (REFERENCE_TYPE); |
d4b60170 RK |
3676 | |
3677 | TREE_TYPE (t) = to_type; | |
3678 | ||
3679 | /* Record this type as the pointer to TO_TYPE. */ | |
3680 | TYPE_REFERENCE_TO (to_type) = t; | |
3681 | ||
3682 | layout_type (t); | |
3683 | ||
3684 | return t; | |
3685 | } | |
3686 | ||
12e1243e AH |
3687 | /* Build a type that is compatible with t but has no cv quals anywhere |
3688 | in its type, thus | |
3689 | ||
3690 | const char *const *const * -> char ***. */ | |
3691 | ||
3692 | tree | |
3693 | build_type_no_quals (t) | |
3694 | tree t; | |
3695 | { | |
3696 | switch (TREE_CODE (t)) | |
3697 | { | |
3698 | case POINTER_TYPE: | |
3699 | return build_pointer_type (build_type_no_quals (TREE_TYPE (t))); | |
3700 | case REFERENCE_TYPE: | |
3701 | return build_reference_type (build_type_no_quals (TREE_TYPE (t))); | |
3702 | default: | |
3703 | return TYPE_MAIN_VARIANT (t); | |
3704 | } | |
3705 | } | |
3706 | ||
c6a1db6c RS |
3707 | /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE. |
3708 | MAXVAL should be the maximum value in the domain | |
e9a25f70 JL |
3709 | (one less than the length of the array). |
3710 | ||
3711 | The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT. | |
3712 | We don't enforce this limit, that is up to caller (e.g. language front end). | |
3713 | The limit exists because the result is a signed type and we don't handle | |
3714 | sizes that use more than one HOST_WIDE_INT. */ | |
c6a1db6c RS |
3715 | |
3716 | tree | |
3717 | build_index_type (maxval) | |
3718 | tree maxval; | |
3719 | { | |
b3694847 | 3720 | tree itype = make_node (INTEGER_TYPE); |
0fd17968 | 3721 | |
770ae6cc | 3722 | TREE_TYPE (itype) = sizetype; |
c6a1db6c | 3723 | TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype); |
967e627a RH |
3724 | TYPE_MIN_VALUE (itype) = size_zero_node; |
3725 | TYPE_MAX_VALUE (itype) = convert (sizetype, maxval); | |
c6a1db6c RS |
3726 | TYPE_MODE (itype) = TYPE_MODE (sizetype); |
3727 | TYPE_SIZE (itype) = TYPE_SIZE (sizetype); | |
def9b006 | 3728 | TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype); |
c6a1db6c | 3729 | TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype); |
11cf4d18 | 3730 | TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype); |
05bccae2 | 3731 | |
967e627a | 3732 | if (host_integerp (maxval, 1)) |
770ae6cc | 3733 | return type_hash_canon (tree_low_cst (maxval, 1), itype); |
c6a1db6c RS |
3734 | else |
3735 | return itype; | |
3736 | } | |
3737 | ||
742e43a2 | 3738 | /* Create a range of some discrete type TYPE (an INTEGER_TYPE, |
238a1856 | 3739 | ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with |
742e43a2 | 3740 | low bound LOWVAL and high bound HIGHVAL. |
0f41302f | 3741 | if TYPE==NULL_TREE, sizetype is used. */ |
c6a1db6c RS |
3742 | |
3743 | tree | |
742e43a2 PB |
3744 | build_range_type (type, lowval, highval) |
3745 | tree type, lowval, highval; | |
c6a1db6c | 3746 | { |
b3694847 | 3747 | tree itype = make_node (INTEGER_TYPE); |
0fd17968 | 3748 | |
742e43a2 PB |
3749 | TREE_TYPE (itype) = type; |
3750 | if (type == NULL_TREE) | |
3751 | type = sizetype; | |
0fd17968 | 3752 | |
742e43a2 | 3753 | TYPE_MIN_VALUE (itype) = convert (type, lowval); |
e1ee5cdc | 3754 | TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL; |
0fd17968 RK |
3755 | |
3756 | TYPE_PRECISION (itype) = TYPE_PRECISION (type); | |
742e43a2 PB |
3757 | TYPE_MODE (itype) = TYPE_MODE (type); |
3758 | TYPE_SIZE (itype) = TYPE_SIZE (type); | |
28372f41 | 3759 | TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type); |
742e43a2 | 3760 | TYPE_ALIGN (itype) = TYPE_ALIGN (type); |
11cf4d18 | 3761 | TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type); |
e1ee5cdc | 3762 | |
770ae6cc RK |
3763 | if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0)) |
3764 | return type_hash_canon (tree_low_cst (highval, 0) | |
3765 | - tree_low_cst (lowval, 0), | |
3766 | itype); | |
c6a1db6c RS |
3767 | else |
3768 | return itype; | |
3769 | } | |
3770 | ||
742e43a2 | 3771 | /* Just like build_index_type, but takes lowval and highval instead |
0f41302f | 3772 | of just highval (maxval). */ |
742e43a2 PB |
3773 | |
3774 | tree | |
3775 | build_index_2_type (lowval,highval) | |
3776 | tree lowval, highval; | |
3777 | { | |
770ae6cc | 3778 | return build_range_type (sizetype, lowval, highval); |
742e43a2 PB |
3779 | } |
3780 | ||
c6a1db6c RS |
3781 | /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense). |
3782 | Needed because when index types are not hashed, equal index types | |
3783 | built at different times appear distinct, even though structurally, | |
3784 | they are not. */ | |
3785 | ||
3786 | int | |
3787 | index_type_equal (itype1, itype2) | |
3788 | tree itype1, itype2; | |
3789 | { | |
3790 | if (TREE_CODE (itype1) != TREE_CODE (itype2)) | |
3791 | return 0; | |
d4b60170 | 3792 | |
c6a1db6c RS |
3793 | if (TREE_CODE (itype1) == INTEGER_TYPE) |
3794 | { | |
3795 | if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2) | |
3796 | || TYPE_MODE (itype1) != TYPE_MODE (itype2) | |
364e1f1c | 3797 | || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1 |
c6a1db6c RS |
3798 | || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2)) |
3799 | return 0; | |
d4b60170 | 3800 | |
364e1f1c RK |
3801 | if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1), |
3802 | TYPE_MIN_VALUE (itype2)) | |
3803 | && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1), | |
3804 | TYPE_MAX_VALUE (itype2))) | |
c6a1db6c RS |
3805 | return 1; |
3806 | } | |
364e1f1c | 3807 | |
c6a1db6c RS |
3808 | return 0; |
3809 | } | |
3810 | ||
3811 | /* Construct, lay out and return the type of arrays of elements with ELT_TYPE | |
3812 | and number of elements specified by the range of values of INDEX_TYPE. | |
3813 | If such a type has already been constructed, reuse it. */ | |
3814 | ||
3815 | tree | |
3816 | build_array_type (elt_type, index_type) | |
3817 | tree elt_type, index_type; | |
3818 | { | |
b3694847 | 3819 | tree t; |
05bccae2 | 3820 | unsigned int hashcode; |
c6a1db6c RS |
3821 | |
3822 | if (TREE_CODE (elt_type) == FUNCTION_TYPE) | |
3823 | { | |
3824 | error ("arrays of functions are not meaningful"); | |
3825 | elt_type = integer_type_node; | |
3826 | } | |
3827 | ||
3828 | /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */ | |
3829 | build_pointer_type (elt_type); | |
3830 | ||
3831 | /* Allocate the array after the pointer type, | |
3832 | in case we free it in type_hash_canon. */ | |
3833 | t = make_node (ARRAY_TYPE); | |
3834 | TREE_TYPE (t) = elt_type; | |
3835 | TYPE_DOMAIN (t) = index_type; | |
3836 | ||
3837 | if (index_type == 0) | |
15c76378 | 3838 | { |
15c76378 RS |
3839 | return t; |
3840 | } | |
c6a1db6c RS |
3841 | |
3842 | hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type); | |
3843 | t = type_hash_canon (hashcode, t); | |
3844 | ||
d0f062fb | 3845 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
3846 | layout_type (t); |
3847 | return t; | |
3848 | } | |
3849 | ||
a260abc9 DE |
3850 | /* Return the TYPE of the elements comprising |
3851 | the innermost dimension of ARRAY. */ | |
3852 | ||
3853 | tree | |
3854 | get_inner_array_type (array) | |
3855 | tree array; | |
3856 | { | |
3857 | tree type = TREE_TYPE (array); | |
3858 | ||
3859 | while (TREE_CODE (type) == ARRAY_TYPE) | |
3860 | type = TREE_TYPE (type); | |
3861 | ||
3862 | return type; | |
3863 | } | |
3864 | ||
c6a1db6c RS |
3865 | /* Construct, lay out and return |
3866 | the type of functions returning type VALUE_TYPE | |
3867 | given arguments of types ARG_TYPES. | |
3868 | ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs | |
3869 | are data type nodes for the arguments of the function. | |
3870 | If such a type has already been constructed, reuse it. */ | |
3871 | ||
3872 | tree | |
3873 | build_function_type (value_type, arg_types) | |
3874 | tree value_type, arg_types; | |
3875 | { | |
b3694847 | 3876 | tree t; |
05bccae2 | 3877 | unsigned int hashcode; |
c6a1db6c | 3878 | |
c0560b8b | 3879 | if (TREE_CODE (value_type) == FUNCTION_TYPE) |
c6a1db6c | 3880 | { |
c0560b8b | 3881 | error ("function return type cannot be function"); |
c6a1db6c RS |
3882 | value_type = integer_type_node; |
3883 | } | |
3884 | ||
3885 | /* Make a node of the sort we want. */ | |
3886 | t = make_node (FUNCTION_TYPE); | |
3887 | TREE_TYPE (t) = value_type; | |
3888 | TYPE_ARG_TYPES (t) = arg_types; | |
3889 | ||
3890 | /* If we already have such a type, use the old one and free this one. */ | |
3891 | hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types); | |
3892 | t = type_hash_canon (hashcode, t); | |
3893 | ||
d0f062fb | 3894 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
3895 | layout_type (t); |
3896 | return t; | |
3897 | } | |
3898 | ||
c6a1db6c RS |
3899 | /* Construct, lay out and return the type of methods belonging to class |
3900 | BASETYPE and whose arguments and values are described by TYPE. | |
3901 | If that type exists already, reuse it. | |
3902 | TYPE must be a FUNCTION_TYPE node. */ | |
3903 | ||
3904 | tree | |
3905 | build_method_type (basetype, type) | |
3906 | tree basetype, type; | |
3907 | { | |
b3694847 | 3908 | tree t; |
05bccae2 | 3909 | unsigned int hashcode; |
c6a1db6c RS |
3910 | |
3911 | /* Make a node of the sort we want. */ | |
3912 | t = make_node (METHOD_TYPE); | |
3913 | ||
3914 | if (TREE_CODE (type) != FUNCTION_TYPE) | |
3915 | abort (); | |
3916 | ||
3917 | TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
3918 | TREE_TYPE (t) = TREE_TYPE (type); | |
3919 | ||
3920 | /* The actual arglist for this function includes a "hidden" argument | |
3921 | which is "this". Put it into the list of argument types. */ | |
3922 | ||
3923 | TYPE_ARG_TYPES (t) | |
37366632 RK |
3924 | = tree_cons (NULL_TREE, |
3925 | build_pointer_type (basetype), TYPE_ARG_TYPES (type)); | |
c6a1db6c RS |
3926 | |
3927 | /* If we already have such a type, use the old one and free this one. */ | |
3928 | hashcode = TYPE_HASH (basetype) + TYPE_HASH (type); | |
3929 | t = type_hash_canon (hashcode, t); | |
3930 | ||
d0f062fb | 3931 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
3932 | layout_type (t); |
3933 | ||
3934 | return t; | |
3935 | } | |
3936 | ||
86aed40b RS |
3937 | /* Construct, lay out and return the type of offsets to a value |
3938 | of type TYPE, within an object of type BASETYPE. | |
3939 | If a suitable offset type exists already, reuse it. */ | |
c6a1db6c RS |
3940 | |
3941 | tree | |
3942 | build_offset_type (basetype, type) | |
3943 | tree basetype, type; | |
3944 | { | |
b3694847 | 3945 | tree t; |
05bccae2 | 3946 | unsigned int hashcode; |
c6a1db6c RS |
3947 | |
3948 | /* Make a node of the sort we want. */ | |
3949 | t = make_node (OFFSET_TYPE); | |
3950 | ||
3951 | TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
3952 | TREE_TYPE (t) = type; | |
3953 | ||
3954 | /* If we already have such a type, use the old one and free this one. */ | |
3955 | hashcode = TYPE_HASH (basetype) + TYPE_HASH (type); | |
3956 | t = type_hash_canon (hashcode, t); | |
3957 | ||
d0f062fb | 3958 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
3959 | layout_type (t); |
3960 | ||
3961 | return t; | |
3962 | } | |
3963 | ||
3964 | /* Create a complex type whose components are COMPONENT_TYPE. */ | |
3965 | ||
3966 | tree | |
3967 | build_complex_type (component_type) | |
3968 | tree component_type; | |
3969 | { | |
b3694847 | 3970 | tree t; |
05bccae2 | 3971 | unsigned int hashcode; |
c6a1db6c RS |
3972 | |
3973 | /* Make a node of the sort we want. */ | |
3974 | t = make_node (COMPLEX_TYPE); | |
3975 | ||
3976 | TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type); | |
3932261a | 3977 | set_type_quals (t, TYPE_QUALS (component_type)); |
c6a1db6c RS |
3978 | |
3979 | /* If we already have such a type, use the old one and free this one. */ | |
3980 | hashcode = TYPE_HASH (component_type); | |
3981 | t = type_hash_canon (hashcode, t); | |
3982 | ||
d0f062fb | 3983 | if (!COMPLETE_TYPE_P (t)) |
c6a1db6c RS |
3984 | layout_type (t); |
3985 | ||
405f63da MM |
3986 | /* If we are writing Dwarf2 output we need to create a name, |
3987 | since complex is a fundamental type. */ | |
3988 | if (write_symbols == DWARF2_DEBUG && ! TYPE_NAME (t)) | |
3989 | { | |
ec0ce6e2 | 3990 | const char *name; |
405f63da MM |
3991 | if (component_type == char_type_node) |
3992 | name = "complex char"; | |
3993 | else if (component_type == signed_char_type_node) | |
3994 | name = "complex signed char"; | |
3995 | else if (component_type == unsigned_char_type_node) | |
3996 | name = "complex unsigned char"; | |
3997 | else if (component_type == short_integer_type_node) | |
3998 | name = "complex short int"; | |
3999 | else if (component_type == short_unsigned_type_node) | |
4000 | name = "complex short unsigned int"; | |
4001 | else if (component_type == integer_type_node) | |
4002 | name = "complex int"; | |
4003 | else if (component_type == unsigned_type_node) | |
4004 | name = "complex unsigned int"; | |
4005 | else if (component_type == long_integer_type_node) | |
4006 | name = "complex long int"; | |
4007 | else if (component_type == long_unsigned_type_node) | |
4008 | name = "complex long unsigned int"; | |
4009 | else if (component_type == long_long_integer_type_node) | |
4010 | name = "complex long long int"; | |
4011 | else if (component_type == long_long_unsigned_type_node) | |
4012 | name = "complex long long unsigned int"; | |
4013 | else | |
d4b60170 | 4014 | name = 0; |
405f63da | 4015 | |
d4b60170 | 4016 | if (name != 0) |
405f63da MM |
4017 | TYPE_NAME (t) = get_identifier (name); |
4018 | } | |
4019 | ||
c6a1db6c RS |
4020 | return t; |
4021 | } | |
4022 | \f | |
4023 | /* Return OP, stripped of any conversions to wider types as much as is safe. | |
4024 | Converting the value back to OP's type makes a value equivalent to OP. | |
4025 | ||
4026 | If FOR_TYPE is nonzero, we return a value which, if converted to | |
4027 | type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE. | |
4028 | ||
4029 | If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the | |
4030 | narrowest type that can hold the value, even if they don't exactly fit. | |
4031 | Otherwise, bit-field references are changed to a narrower type | |
4032 | only if they can be fetched directly from memory in that type. | |
4033 | ||
4034 | OP must have integer, real or enumeral type. Pointers are not allowed! | |
4035 | ||
4036 | There are some cases where the obvious value we could return | |
dc478a5d | 4037 | would regenerate to OP if converted to OP's type, |
c6a1db6c RS |
4038 | but would not extend like OP to wider types. |
4039 | If FOR_TYPE indicates such extension is contemplated, we eschew such values. | |
4040 | For example, if OP is (unsigned short)(signed char)-1, | |
4041 | we avoid returning (signed char)-1 if FOR_TYPE is int, | |
4042 | even though extending that to an unsigned short would regenerate OP, | |
4043 | since the result of extending (signed char)-1 to (int) | |
4044 | is different from (int) OP. */ | |
4045 | ||
4046 | tree | |
4047 | get_unwidened (op, for_type) | |
b3694847 | 4048 | tree op; |
c6a1db6c RS |
4049 | tree for_type; |
4050 | { | |
4051 | /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */ | |
b3694847 SS |
4052 | tree type = TREE_TYPE (op); |
4053 | unsigned final_prec | |
c6a1db6c | 4054 | = TYPE_PRECISION (for_type != 0 ? for_type : type); |
b3694847 | 4055 | int uns |
c6a1db6c RS |
4056 | = (for_type != 0 && for_type != type |
4057 | && final_prec > TYPE_PRECISION (type) | |
4058 | && TREE_UNSIGNED (type)); | |
b3694847 | 4059 | tree win = op; |
c6a1db6c RS |
4060 | |
4061 | while (TREE_CODE (op) == NOP_EXPR) | |
4062 | { | |
b3694847 | 4063 | int bitschange |
c6a1db6c RS |
4064 | = TYPE_PRECISION (TREE_TYPE (op)) |
4065 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))); | |
4066 | ||
4067 | /* Truncations are many-one so cannot be removed. | |
4068 | Unless we are later going to truncate down even farther. */ | |
4069 | if (bitschange < 0 | |
4070 | && final_prec > TYPE_PRECISION (TREE_TYPE (op))) | |
4071 | break; | |
4072 | ||
4073 | /* See what's inside this conversion. If we decide to strip it, | |
4074 | we will set WIN. */ | |
4075 | op = TREE_OPERAND (op, 0); | |
4076 | ||
4077 | /* If we have not stripped any zero-extensions (uns is 0), | |
4078 | we can strip any kind of extension. | |
4079 | If we have previously stripped a zero-extension, | |
4080 | only zero-extensions can safely be stripped. | |
4081 | Any extension can be stripped if the bits it would produce | |
4082 | are all going to be discarded later by truncating to FOR_TYPE. */ | |
4083 | ||
4084 | if (bitschange > 0) | |
4085 | { | |
4086 | if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op))) | |
4087 | win = op; | |
4088 | /* TREE_UNSIGNED says whether this is a zero-extension. | |
4089 | Let's avoid computing it if it does not affect WIN | |
4090 | and if UNS will not be needed again. */ | |
4091 | if ((uns || TREE_CODE (op) == NOP_EXPR) | |
4092 | && TREE_UNSIGNED (TREE_TYPE (op))) | |
4093 | { | |
4094 | uns = 1; | |
4095 | win = op; | |
4096 | } | |
4097 | } | |
4098 | } | |
4099 | ||
4100 | if (TREE_CODE (op) == COMPONENT_REF | |
4101 | /* Since type_for_size always gives an integer type. */ | |
02a27e82 | 4102 | && TREE_CODE (type) != REAL_TYPE |
956d6950 | 4103 | /* Don't crash if field not laid out yet. */ |
3401c26b RK |
4104 | && DECL_SIZE (TREE_OPERAND (op, 1)) != 0 |
4105 | && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1)) | |
c6a1db6c | 4106 | { |
05bccae2 | 4107 | unsigned int innerprec |
3401c26b | 4108 | = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1); |
05bccae2 | 4109 | |
c6a1db6c RS |
4110 | type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1))); |
4111 | ||
4112 | /* We can get this structure field in the narrowest type it fits in. | |
4113 | If FOR_TYPE is 0, do this only for a field that matches the | |
4114 | narrower type exactly and is aligned for it | |
4115 | The resulting extension to its nominal type (a fullword type) | |
4116 | must fit the same conditions as for other extensions. */ | |
4117 | ||
4118 | if (innerprec < TYPE_PRECISION (TREE_TYPE (op)) | |
4119 | && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))) | |
4120 | && (! uns || final_prec <= innerprec | |
4121 | || TREE_UNSIGNED (TREE_OPERAND (op, 1))) | |
4122 | && type != 0) | |
4123 | { | |
4124 | win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0), | |
4125 | TREE_OPERAND (op, 1)); | |
4126 | TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op); | |
4127 | TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op); | |
c6a1db6c RS |
4128 | } |
4129 | } | |
3401c26b | 4130 | |
c6a1db6c RS |
4131 | return win; |
4132 | } | |
4133 | \f | |
4134 | /* Return OP or a simpler expression for a narrower value | |
4135 | which can be sign-extended or zero-extended to give back OP. | |
4136 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
4137 | or 0 if the value should be sign-extended. */ | |
4138 | ||
4139 | tree | |
4140 | get_narrower (op, unsignedp_ptr) | |
b3694847 | 4141 | tree op; |
c6a1db6c RS |
4142 | int *unsignedp_ptr; |
4143 | { | |
b3694847 | 4144 | int uns = 0; |
c6a1db6c | 4145 | int first = 1; |
b3694847 | 4146 | tree win = op; |
c6a1db6c RS |
4147 | |
4148 | while (TREE_CODE (op) == NOP_EXPR) | |
4149 | { | |
b3694847 | 4150 | int bitschange |
d4b60170 RK |
4151 | = (TYPE_PRECISION (TREE_TYPE (op)) |
4152 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)))); | |
c6a1db6c RS |
4153 | |
4154 | /* Truncations are many-one so cannot be removed. */ | |
4155 | if (bitschange < 0) | |
4156 | break; | |
4157 | ||
4158 | /* See what's inside this conversion. If we decide to strip it, | |
4159 | we will set WIN. */ | |
4160 | op = TREE_OPERAND (op, 0); | |
4161 | ||
4162 | if (bitschange > 0) | |
4163 | { | |
4164 | /* An extension: the outermost one can be stripped, | |
4165 | but remember whether it is zero or sign extension. */ | |
4166 | if (first) | |
4167 | uns = TREE_UNSIGNED (TREE_TYPE (op)); | |
4168 | /* Otherwise, if a sign extension has been stripped, | |
4169 | only sign extensions can now be stripped; | |
4170 | if a zero extension has been stripped, only zero-extensions. */ | |
4171 | else if (uns != TREE_UNSIGNED (TREE_TYPE (op))) | |
4172 | break; | |
4173 | first = 0; | |
4174 | } | |
e02b9957 DE |
4175 | else /* bitschange == 0 */ |
4176 | { | |
4177 | /* A change in nominal type can always be stripped, but we must | |
4178 | preserve the unsignedness. */ | |
4179 | if (first) | |
4180 | uns = TREE_UNSIGNED (TREE_TYPE (op)); | |
4181 | first = 0; | |
4182 | } | |
c6a1db6c RS |
4183 | |
4184 | win = op; | |
4185 | } | |
4186 | ||
4187 | if (TREE_CODE (op) == COMPONENT_REF | |
4188 | /* Since type_for_size always gives an integer type. */ | |
0fba7208 RK |
4189 | && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE |
4190 | /* Ensure field is laid out already. */ | |
4191 | && DECL_SIZE (TREE_OPERAND (op, 1)) != 0) | |
c6a1db6c | 4192 | { |
0fba7208 RK |
4193 | unsigned HOST_WIDE_INT innerprec |
4194 | = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1); | |
c6a1db6c RS |
4195 | tree type = type_for_size (innerprec, TREE_UNSIGNED (op)); |
4196 | ||
4197 | /* We can get this structure field in a narrower type that fits it, | |
4198 | but the resulting extension to its nominal type (a fullword type) | |
4199 | must satisfy the same conditions as for other extensions. | |
4200 | ||
4201 | Do this only for fields that are aligned (not bit-fields), | |
4202 | because when bit-field insns will be used there is no | |
4203 | advantage in doing this. */ | |
4204 | ||
4205 | if (innerprec < TYPE_PRECISION (TREE_TYPE (op)) | |
4206 | && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)) | |
4207 | && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1))) | |
4208 | && type != 0) | |
4209 | { | |
4210 | if (first) | |
4211 | uns = TREE_UNSIGNED (TREE_OPERAND (op, 1)); | |
4212 | win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0), | |
4213 | TREE_OPERAND (op, 1)); | |
4214 | TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op); | |
4215 | TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op); | |
c6a1db6c RS |
4216 | } |
4217 | } | |
4218 | *unsignedp_ptr = uns; | |
4219 | return win; | |
4220 | } | |
4221 | \f | |
c6a1db6c RS |
4222 | /* Nonzero if integer constant C has a value that is permissible |
4223 | for type TYPE (an INTEGER_TYPE). */ | |
4224 | ||
4225 | int | |
4226 | int_fits_type_p (c, type) | |
4227 | tree c, type; | |
4228 | { | |
3401c26b RK |
4229 | /* If the bounds of the type are integers, we can check ourselves. |
4230 | Otherwise,. use force_fit_type, which checks against the precision. */ | |
a25f1211 RH |
4231 | if (TYPE_MAX_VALUE (type) != NULL_TREE |
4232 | && TYPE_MIN_VALUE (type) != NULL_TREE | |
4233 | && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST | |
3401c26b RK |
4234 | && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST) |
4235 | { | |
4236 | if (TREE_UNSIGNED (type)) | |
4237 | return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c) | |
4238 | && ! INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type)) | |
4239 | /* Negative ints never fit unsigned types. */ | |
4240 | && ! (TREE_INT_CST_HIGH (c) < 0 | |
4241 | && ! TREE_UNSIGNED (TREE_TYPE (c)))); | |
4242 | else | |
4243 | return (! INT_CST_LT (TYPE_MAX_VALUE (type), c) | |
4244 | && ! INT_CST_LT (c, TYPE_MIN_VALUE (type)) | |
4245 | /* Unsigned ints with top bit set never fit signed types. */ | |
4246 | && ! (TREE_INT_CST_HIGH (c) < 0 | |
4247 | && TREE_UNSIGNED (TREE_TYPE (c)))); | |
4248 | } | |
c6a1db6c | 4249 | else |
3401c26b RK |
4250 | { |
4251 | c = copy_node (c); | |
4252 | TREE_TYPE (c) = type; | |
4253 | return !force_fit_type (c, 0); | |
4254 | } | |
c6a1db6c RS |
4255 | } |
4256 | ||
140b60b4 | 4257 | /* Given a DECL or TYPE, return the scope in which it was declared, or |
77a02dba | 4258 | NULL_TREE if there is no containing scope. */ |
140b60b4 MM |
4259 | |
4260 | tree | |
4261 | get_containing_scope (t) | |
4262 | tree t; | |
4263 | { | |
4264 | return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t)); | |
4265 | } | |
4266 | ||
bfa30b22 | 4267 | /* Return the innermost context enclosing DECL that is |
c6a1db6c RS |
4268 | a FUNCTION_DECL, or zero if none. */ |
4269 | ||
4270 | tree | |
bfa30b22 RK |
4271 | decl_function_context (decl) |
4272 | tree decl; | |
c6a1db6c RS |
4273 | { |
4274 | tree context; | |
4275 | ||
bfa30b22 | 4276 | if (TREE_CODE (decl) == ERROR_MARK) |
c6a1db6c RS |
4277 | return 0; |
4278 | ||
bfa30b22 RK |
4279 | if (TREE_CODE (decl) == SAVE_EXPR) |
4280 | context = SAVE_EXPR_CONTEXT (decl); | |
77a02dba | 4281 | |
6ff7fb95 JM |
4282 | /* C++ virtual functions use DECL_CONTEXT for the class of the vtable |
4283 | where we look up the function at runtime. Such functions always take | |
4284 | a first argument of type 'pointer to real context'. | |
4285 | ||
4286 | C++ should really be fixed to use DECL_CONTEXT for the real context, | |
4287 | and use something else for the "virtual context". */ | |
4288 | else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl)) | |
77a02dba RK |
4289 | context |
4290 | = TYPE_MAIN_VARIANT | |
4291 | (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl))))); | |
c6a1db6c | 4292 | else |
bfa30b22 | 4293 | context = DECL_CONTEXT (decl); |
c6a1db6c RS |
4294 | |
4295 | while (context && TREE_CODE (context) != FUNCTION_DECL) | |
4296 | { | |
140b60b4 | 4297 | if (TREE_CODE (context) == BLOCK) |
c6a1db6c | 4298 | context = BLOCK_SUPERCONTEXT (context); |
dc478a5d | 4299 | else |
140b60b4 | 4300 | context = get_containing_scope (context); |
c6a1db6c RS |
4301 | } |
4302 | ||
4303 | return context; | |
4304 | } | |
4305 | ||
bfa30b22 | 4306 | /* Return the innermost context enclosing DECL that is |
c0560b8b | 4307 | a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none. |
c6a1db6c RS |
4308 | TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */ |
4309 | ||
4310 | tree | |
bfa30b22 RK |
4311 | decl_type_context (decl) |
4312 | tree decl; | |
c6a1db6c | 4313 | { |
bfa30b22 | 4314 | tree context = DECL_CONTEXT (decl); |
c6a1db6c RS |
4315 | |
4316 | while (context) | |
4317 | { | |
4318 | if (TREE_CODE (context) == RECORD_TYPE | |
c0560b8b RK |
4319 | || TREE_CODE (context) == UNION_TYPE |
4320 | || TREE_CODE (context) == QUAL_UNION_TYPE) | |
c6a1db6c | 4321 | return context; |
d4b60170 | 4322 | |
c6a1db6c RS |
4323 | if (TREE_CODE (context) == TYPE_DECL |
4324 | || TREE_CODE (context) == FUNCTION_DECL) | |
4325 | context = DECL_CONTEXT (context); | |
d4b60170 | 4326 | |
c6a1db6c RS |
4327 | else if (TREE_CODE (context) == BLOCK) |
4328 | context = BLOCK_SUPERCONTEXT (context); | |
d4b60170 | 4329 | |
c6a1db6c RS |
4330 | else |
4331 | /* Unhandled CONTEXT!? */ | |
4332 | abort (); | |
4333 | } | |
4334 | return NULL_TREE; | |
4335 | } | |
4336 | ||
582db8e4 | 4337 | /* CALL is a CALL_EXPR. Return the declaration for the function |
dc478a5d | 4338 | called, or NULL_TREE if the called function cannot be |
582db8e4 MM |
4339 | determined. */ |
4340 | ||
4341 | tree | |
4342 | get_callee_fndecl (call) | |
4343 | tree call; | |
4344 | { | |
4345 | tree addr; | |
4346 | ||
4347 | /* It's invalid to call this function with anything but a | |
4348 | CALL_EXPR. */ | |
4349 | if (TREE_CODE (call) != CALL_EXPR) | |
4350 | abort (); | |
4351 | ||
4352 | /* The first operand to the CALL is the address of the function | |
4353 | called. */ | |
4354 | addr = TREE_OPERAND (call, 0); | |
4355 | ||
c083cf9a JM |
4356 | STRIP_NOPS (addr); |
4357 | ||
4358 | /* If this is a readonly function pointer, extract its initial value. */ | |
4359 | if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL | |
4360 | && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr) | |
4361 | && DECL_INITIAL (addr)) | |
4362 | addr = DECL_INITIAL (addr); | |
4363 | ||
582db8e4 MM |
4364 | /* If the address is just `&f' for some function `f', then we know |
4365 | that `f' is being called. */ | |
4366 | if (TREE_CODE (addr) == ADDR_EXPR | |
4367 | && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL) | |
4368 | return TREE_OPERAND (addr, 0); | |
4369 | ||
4370 | /* We couldn't figure out what was being called. */ | |
4371 | return NULL_TREE; | |
4372 | } | |
4373 | ||
d1485032 JM |
4374 | /* Print debugging information about the obstack O, named STR. */ |
4375 | ||
c6a1db6c RS |
4376 | void |
4377 | print_obstack_statistics (str, o) | |
37b37199 | 4378 | const char *str; |
c6a1db6c RS |
4379 | struct obstack *o; |
4380 | { | |
4381 | struct _obstack_chunk *chunk = o->chunk; | |
d1485032 | 4382 | int n_chunks = 1; |
e9a25f70 | 4383 | int n_alloc = 0; |
c6a1db6c | 4384 | |
d1485032 JM |
4385 | n_alloc += o->next_free - chunk->contents; |
4386 | chunk = chunk->prev; | |
c6a1db6c RS |
4387 | while (chunk) |
4388 | { | |
4389 | n_chunks += 1; | |
4390 | n_alloc += chunk->limit - &chunk->contents[0]; | |
4391 | chunk = chunk->prev; | |
4392 | } | |
5e9defae | 4393 | fprintf (stderr, "obstack %s: %u bytes, %d chunks\n", |
c6a1db6c RS |
4394 | str, n_alloc, n_chunks); |
4395 | } | |
d1485032 JM |
4396 | |
4397 | /* Print debugging information about tree nodes generated during the compile, | |
4398 | and any language-specific information. */ | |
4399 | ||
c6a1db6c RS |
4400 | void |
4401 | dump_tree_statistics () | |
4402 | { | |
5e9defae | 4403 | #ifdef GATHER_STATISTICS |
c6a1db6c RS |
4404 | int i; |
4405 | int total_nodes, total_bytes; | |
5e9defae | 4406 | #endif |
c6a1db6c RS |
4407 | |
4408 | fprintf (stderr, "\n??? tree nodes created\n\n"); | |
4409 | #ifdef GATHER_STATISTICS | |
4410 | fprintf (stderr, "Kind Nodes Bytes\n"); | |
4411 | fprintf (stderr, "-------------------------------------\n"); | |
4412 | total_nodes = total_bytes = 0; | |
4413 | for (i = 0; i < (int) all_kinds; i++) | |
4414 | { | |
4415 | fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i], | |
4416 | tree_node_counts[i], tree_node_sizes[i]); | |
4417 | total_nodes += tree_node_counts[i]; | |
4418 | total_bytes += tree_node_sizes[i]; | |
4419 | } | |
4420 | fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size); | |
4421 | fprintf (stderr, "-------------------------------------\n"); | |
4422 | fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes); | |
4423 | fprintf (stderr, "-------------------------------------\n"); | |
4424 | #else | |
4425 | fprintf (stderr, "(No per-node statistics)\n"); | |
4426 | #endif | |
d1485032 | 4427 | print_obstack_statistics ("permanent_obstack", &permanent_obstack); |
d88f311b | 4428 | print_type_hash_statistics (); |
c6a1db6c RS |
4429 | print_lang_statistics (); |
4430 | } | |
bb288278 PB |
4431 | \f |
4432 | #define FILE_FUNCTION_PREFIX_LEN 9 | |
4433 | ||
2ce3c6c6 | 4434 | #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s" |
bb288278 | 4435 | |
e2c31432 JM |
4436 | /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name |
4437 | clashes in cases where we can't reliably choose a unique name. | |
4438 | ||
4439 | Derived from mkstemp.c in libiberty. */ | |
4440 | ||
4441 | static void | |
4442 | append_random_chars (template) | |
4443 | char *template; | |
4444 | { | |
4445 | static const char letters[] | |
4446 | = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"; | |
4447 | static unsigned HOST_WIDE_INT value; | |
4448 | unsigned HOST_WIDE_INT v; | |
4449 | ||
13d7d58b JW |
4450 | if (! value) |
4451 | { | |
4452 | struct stat st; | |
e2c31432 | 4453 | |
13d7d58b JW |
4454 | /* VALUE should be unique for each file and must |
4455 | not change between compiles since this can cause | |
4456 | bootstrap comparison errors. */ | |
e2c31432 | 4457 | |
13d7d58b JW |
4458 | if (stat (main_input_filename, &st) < 0) |
4459 | abort (); | |
4460 | ||
4461 | value = st.st_dev ^ st.st_ino ^ st.st_mtime; | |
4462 | } | |
4463 | ||
4464 | template += strlen (template); | |
e2c31432 JM |
4465 | |
4466 | v = value; | |
4467 | ||
4468 | /* Fill in the random bits. */ | |
4469 | template[0] = letters[v % 62]; | |
4470 | v /= 62; | |
4471 | template[1] = letters[v % 62]; | |
4472 | v /= 62; | |
4473 | template[2] = letters[v % 62]; | |
4474 | v /= 62; | |
4475 | template[3] = letters[v % 62]; | |
4476 | v /= 62; | |
4477 | template[4] = letters[v % 62]; | |
4478 | v /= 62; | |
4479 | template[5] = letters[v % 62]; | |
4480 | ||
4481 | template[6] = '\0'; | |
4482 | } | |
4483 | ||
881c6935 JM |
4484 | /* P is a string that will be used in a symbol. Mask out any characters |
4485 | that are not valid in that context. */ | |
4486 | ||
4487 | void | |
4488 | clean_symbol_name (p) | |
4489 | char *p; | |
4490 | { | |
4491 | for (; *p; p++) | |
dc478a5d | 4492 | if (! (ISDIGIT(*p) |
881c6935 JM |
4493 | #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */ |
4494 | || *p == '$' | |
4495 | #endif | |
4496 | #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */ | |
4497 | || *p == '.' | |
4498 | #endif | |
dc478a5d KH |
4499 | || ISUPPER (*p) |
4500 | || ISLOWER (*p))) | |
881c6935 JM |
4501 | *p = '_'; |
4502 | } | |
4503 | ||
e2c31432 JM |
4504 | /* Generate a name for a function unique to this translation unit. |
4505 | TYPE is some string to identify the purpose of this function to the | |
4506 | linker or collect2. */ | |
bb288278 PB |
4507 | |
4508 | tree | |
2ce3c6c6 | 4509 | get_file_function_name_long (type) |
37b37199 | 4510 | const char *type; |
bb288278 PB |
4511 | { |
4512 | char *buf; | |
3b304f5b ZW |
4513 | const char *p; |
4514 | char *q; | |
bb288278 PB |
4515 | |
4516 | if (first_global_object_name) | |
4517 | p = first_global_object_name; | |
bb288278 | 4518 | else |
e2c31432 JM |
4519 | { |
4520 | /* We don't have anything that we know to be unique to this translation | |
4521 | unit, so use what we do have and throw in some randomness. */ | |
4522 | ||
37b37199 KG |
4523 | const char *name = weak_global_object_name; |
4524 | const char *file = main_input_filename; | |
e2c31432 JM |
4525 | |
4526 | if (! name) | |
4527 | name = ""; | |
4528 | if (! file) | |
4529 | file = input_filename; | |
4530 | ||
3b304f5b | 4531 | q = (char *) alloca (7 + strlen (name) + strlen (file)); |
e2c31432 | 4532 | |
3b304f5b ZW |
4533 | sprintf (q, "%s%s", name, file); |
4534 | append_random_chars (q); | |
4535 | p = q; | |
e2c31432 | 4536 | } |
bb288278 | 4537 | |
2ce3c6c6 JM |
4538 | buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) |
4539 | + strlen (type)); | |
bb288278 | 4540 | |
dc478a5d | 4541 | /* Set up the name of the file-level functions we may need. |
d4b60170 | 4542 | Use a global object (which is already required to be unique over |
bb288278 | 4543 | the program) rather than the file name (which imposes extra |
d4b60170 | 4544 | constraints). */ |
2ce3c6c6 | 4545 | sprintf (buf, FILE_FUNCTION_FORMAT, type, p); |
bb288278 | 4546 | |
9faa82d8 | 4547 | /* Don't need to pull weird characters out of global names. */ |
bb288278 | 4548 | if (p != first_global_object_name) |
881c6935 | 4549 | clean_symbol_name (buf + 11); |
bb288278 | 4550 | |
bb288278 PB |
4551 | return get_identifier (buf); |
4552 | } | |
2ce3c6c6 JM |
4553 | |
4554 | /* If KIND=='I', return a suitable global initializer (constructor) name. | |
4555 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
4556 | ||
4557 | tree | |
4558 | get_file_function_name (kind) | |
4559 | int kind; | |
4560 | { | |
4561 | char p[2]; | |
d4b60170 | 4562 | |
2ce3c6c6 JM |
4563 | p[0] = kind; |
4564 | p[1] = 0; | |
4565 | ||
4566 | return get_file_function_name_long (p); | |
4567 | } | |
bca949e2 | 4568 | \f |
9faa82d8 | 4569 | /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node. |
bca949e2 PB |
4570 | The result is placed in BUFFER (which has length BIT_SIZE), |
4571 | with one bit in each char ('\000' or '\001'). | |
4572 | ||
4573 | If the constructor is constant, NULL_TREE is returned. | |
0f41302f | 4574 | Otherwise, a TREE_LIST of the non-constant elements is emitted. */ |
bca949e2 PB |
4575 | |
4576 | tree | |
4577 | get_set_constructor_bits (init, buffer, bit_size) | |
4578 | tree init; | |
4579 | char *buffer; | |
4580 | int bit_size; | |
4581 | { | |
4582 | int i; | |
4583 | tree vals; | |
4584 | HOST_WIDE_INT domain_min | |
5538d8a0 | 4585 | = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0); |
bca949e2 | 4586 | tree non_const_bits = NULL_TREE; |
5538d8a0 | 4587 | |
bca949e2 PB |
4588 | for (i = 0; i < bit_size; i++) |
4589 | buffer[i] = 0; | |
4590 | ||
dc478a5d | 4591 | for (vals = TREE_OPERAND (init, 1); |
bca949e2 PB |
4592 | vals != NULL_TREE; vals = TREE_CHAIN (vals)) |
4593 | { | |
5538d8a0 | 4594 | if (!host_integerp (TREE_VALUE (vals), 0) |
bca949e2 | 4595 | || (TREE_PURPOSE (vals) != NULL_TREE |
5538d8a0 | 4596 | && !host_integerp (TREE_PURPOSE (vals), 0))) |
db3cf6fb MS |
4597 | non_const_bits |
4598 | = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits); | |
bca949e2 PB |
4599 | else if (TREE_PURPOSE (vals) != NULL_TREE) |
4600 | { | |
0f41302f | 4601 | /* Set a range of bits to ones. */ |
bca949e2 | 4602 | HOST_WIDE_INT lo_index |
5538d8a0 | 4603 | = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min; |
bca949e2 | 4604 | HOST_WIDE_INT hi_index |
5538d8a0 | 4605 | = tree_low_cst (TREE_VALUE (vals), 0) - domain_min; |
05bccae2 | 4606 | |
bca949e2 | 4607 | if (lo_index < 0 || lo_index >= bit_size |
dc478a5d | 4608 | || hi_index < 0 || hi_index >= bit_size) |
bca949e2 | 4609 | abort (); |
dc478a5d | 4610 | for (; lo_index <= hi_index; lo_index++) |
bca949e2 PB |
4611 | buffer[lo_index] = 1; |
4612 | } | |
4613 | else | |
4614 | { | |
0f41302f | 4615 | /* Set a single bit to one. */ |
bca949e2 | 4616 | HOST_WIDE_INT index |
5538d8a0 | 4617 | = tree_low_cst (TREE_VALUE (vals), 0) - domain_min; |
bca949e2 PB |
4618 | if (index < 0 || index >= bit_size) |
4619 | { | |
4620 | error ("invalid initializer for bit string"); | |
4621 | return NULL_TREE; | |
4622 | } | |
4623 | buffer[index] = 1; | |
4624 | } | |
4625 | } | |
4626 | return non_const_bits; | |
4627 | } | |
4628 | ||
9faa82d8 | 4629 | /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node. |
f3ffec8e | 4630 | The result is placed in BUFFER (which is an array of bytes). |
bca949e2 | 4631 | If the constructor is constant, NULL_TREE is returned. |
0f41302f | 4632 | Otherwise, a TREE_LIST of the non-constant elements is emitted. */ |
bca949e2 PB |
4633 | |
4634 | tree | |
f3ffec8e | 4635 | get_set_constructor_bytes (init, buffer, wd_size) |
bca949e2 | 4636 | tree init; |
f3ffec8e | 4637 | unsigned char *buffer; |
bca949e2 PB |
4638 | int wd_size; |
4639 | { | |
4640 | int i; | |
f3ffec8e | 4641 | int set_word_size = BITS_PER_UNIT; |
bca949e2 PB |
4642 | int bit_size = wd_size * set_word_size; |
4643 | int bit_pos = 0; | |
f3ffec8e | 4644 | unsigned char *bytep = buffer; |
dc478a5d | 4645 | char *bit_buffer = (char *) alloca (bit_size); |
bca949e2 PB |
4646 | tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size); |
4647 | ||
4648 | for (i = 0; i < wd_size; i++) | |
4649 | buffer[i] = 0; | |
4650 | ||
4651 | for (i = 0; i < bit_size; i++) | |
4652 | { | |
4653 | if (bit_buffer[i]) | |
4654 | { | |
8a0e8d4d | 4655 | if (BYTES_BIG_ENDIAN) |
f3ffec8e | 4656 | *bytep |= (1 << (set_word_size - 1 - bit_pos)); |
f76b9db2 | 4657 | else |
f3ffec8e | 4658 | *bytep |= 1 << bit_pos; |
bca949e2 PB |
4659 | } |
4660 | bit_pos++; | |
4661 | if (bit_pos >= set_word_size) | |
f3ffec8e | 4662 | bit_pos = 0, bytep++; |
bca949e2 PB |
4663 | } |
4664 | return non_const_bits; | |
4665 | } | |
9ec36da5 | 4666 | \f |
f4524c9e | 4667 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) |
8f985ec4 | 4668 | /* Complain that the tree code of NODE does not match the expected CODE. |
987009bf | 4669 | FILE, LINE, and FUNCTION are of the caller. */ |
dc478a5d | 4670 | |
8f985ec4 ZW |
4671 | void |
4672 | tree_check_failed (node, code, file, line, function) | |
4673 | const tree node; | |
12b195d9 | 4674 | enum tree_code code; |
37b37199 | 4675 | const char *file; |
12b195d9 | 4676 | int line; |
8f985ec4 | 4677 | const char *function; |
12b195d9 | 4678 | { |
fce687f8 RK |
4679 | internal_error ("Tree check: expected %s, have %s in %s, at %s:%d", |
4680 | tree_code_name[code], tree_code_name[TREE_CODE (node)], | |
4681 | function, trim_filename (file), line); | |
12b195d9 ML |
4682 | } |
4683 | ||
9ec36da5 JL |
4684 | /* Similar to above, except that we check for a class of tree |
4685 | code, given in CL. */ | |
dc478a5d | 4686 | |
8f985ec4 ZW |
4687 | void |
4688 | tree_class_check_failed (node, cl, file, line, function) | |
4689 | const tree node; | |
f8a83ee3 | 4690 | int cl; |
37b37199 | 4691 | const char *file; |
12b195d9 | 4692 | int line; |
8f985ec4 | 4693 | const char *function; |
12b195d9 | 4694 | { |
fce687f8 RK |
4695 | internal_error |
4696 | ("Tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d", | |
4697 | cl, TREE_CODE_CLASS (TREE_CODE (node)), | |
4698 | tree_code_name[TREE_CODE (node)], function, trim_filename (file), line); | |
8f985ec4 ZW |
4699 | } |
4700 | ||
f4524c9e | 4701 | #endif /* ENABLE_TREE_CHECKING */ |
81b3411c | 4702 | \f |
4061f623 BS |
4703 | /* For a new vector type node T, build the information necessary for |
4704 | debuggint output. */ | |
dc478a5d | 4705 | |
4061f623 BS |
4706 | static void |
4707 | finish_vector_type (t) | |
4708 | tree t; | |
4709 | { | |
4710 | layout_type (t); | |
4711 | ||
4712 | { | |
4713 | tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0); | |
4714 | tree array = build_array_type (TREE_TYPE (t), | |
4715 | build_index_type (index)); | |
4716 | tree rt = make_node (RECORD_TYPE); | |
4717 | ||
4718 | TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array); | |
4719 | DECL_CONTEXT (TYPE_FIELDS (rt)) = rt; | |
4720 | layout_type (rt); | |
4721 | TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt; | |
4722 | /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output | |
4723 | the representation type, and we want to find that die when looking up | |
4724 | the vector type. This is most easily achieved by making the TYPE_UID | |
4725 | numbers equal. */ | |
4726 | TYPE_UID (rt) = TYPE_UID (t); | |
4727 | } | |
4728 | } | |
4729 | ||
81b3411c BS |
4730 | /* Create nodes for all integer types (and error_mark_node) using the sizes |
4731 | of C datatypes. The caller should call set_sizetype soon after calling | |
4732 | this function to select one of the types as sizetype. */ | |
dc478a5d | 4733 | |
81b3411c BS |
4734 | void |
4735 | build_common_tree_nodes (signed_char) | |
4736 | int signed_char; | |
4737 | { | |
4738 | error_mark_node = make_node (ERROR_MARK); | |
4739 | TREE_TYPE (error_mark_node) = error_mark_node; | |
4740 | ||
fed3cef0 RK |
4741 | initialize_sizetypes (); |
4742 | ||
81b3411c BS |
4743 | /* Define both `signed char' and `unsigned char'. */ |
4744 | signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE); | |
4745 | unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE); | |
4746 | ||
4747 | /* Define `char', which is like either `signed char' or `unsigned char' | |
4748 | but not the same as either. */ | |
4749 | char_type_node | |
4750 | = (signed_char | |
4751 | ? make_signed_type (CHAR_TYPE_SIZE) | |
4752 | : make_unsigned_type (CHAR_TYPE_SIZE)); | |
4753 | ||
4754 | short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE); | |
4755 | short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE); | |
4756 | integer_type_node = make_signed_type (INT_TYPE_SIZE); | |
81b3411c BS |
4757 | unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE); |
4758 | long_integer_type_node = make_signed_type (LONG_TYPE_SIZE); | |
4759 | long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE); | |
4760 | long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE); | |
4761 | long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE); | |
4762 | ||
4763 | intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode)); | |
4764 | intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode)); | |
4765 | intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode)); | |
4766 | intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode)); | |
4767 | intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode)); | |
4768 | ||
4769 | unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode)); | |
4770 | unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode)); | |
4771 | unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode)); | |
4772 | unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode)); | |
4773 | unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode)); | |
4774 | } | |
4775 | ||
81b3411c | 4776 | /* Call this function after calling build_common_tree_nodes and set_sizetype. |
fed3cef0 | 4777 | It will create several other common tree nodes. */ |
d4b60170 | 4778 | |
81b3411c BS |
4779 | void |
4780 | build_common_tree_nodes_2 (short_double) | |
4781 | int short_double; | |
4782 | { | |
05bccae2 | 4783 | /* Define these next since types below may used them. */ |
81b3411c | 4784 | integer_zero_node = build_int_2 (0, 0); |
81b3411c | 4785 | integer_one_node = build_int_2 (1, 0); |
f2d1f0ba | 4786 | integer_minus_one_node = build_int_2 (-1, -1); |
81b3411c | 4787 | |
770ae6cc RK |
4788 | size_zero_node = size_int (0); |
4789 | size_one_node = size_int (1); | |
4790 | bitsize_zero_node = bitsize_int (0); | |
4791 | bitsize_one_node = bitsize_int (1); | |
4792 | bitsize_unit_node = bitsize_int (BITS_PER_UNIT); | |
81b3411c BS |
4793 | |
4794 | void_type_node = make_node (VOID_TYPE); | |
05bccae2 | 4795 | layout_type (void_type_node); |
d4b60170 | 4796 | |
81b3411c BS |
4797 | /* We are not going to have real types in C with less than byte alignment, |
4798 | so we might as well not have any types that claim to have it. */ | |
4799 | TYPE_ALIGN (void_type_node) = BITS_PER_UNIT; | |
11cf4d18 | 4800 | TYPE_USER_ALIGN (void_type_node) = 0; |
81b3411c BS |
4801 | |
4802 | null_pointer_node = build_int_2 (0, 0); | |
4803 | TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node); | |
4804 | layout_type (TREE_TYPE (null_pointer_node)); | |
4805 | ||
4806 | ptr_type_node = build_pointer_type (void_type_node); | |
4807 | const_ptr_type_node | |
4808 | = build_pointer_type (build_type_variant (void_type_node, 1, 0)); | |
4809 | ||
4810 | float_type_node = make_node (REAL_TYPE); | |
4811 | TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE; | |
4812 | layout_type (float_type_node); | |
4813 | ||
4814 | double_type_node = make_node (REAL_TYPE); | |
4815 | if (short_double) | |
4816 | TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE; | |
4817 | else | |
4818 | TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE; | |
4819 | layout_type (double_type_node); | |
4820 | ||
4821 | long_double_type_node = make_node (REAL_TYPE); | |
4822 | TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE; | |
4823 | layout_type (long_double_type_node); | |
4824 | ||
4825 | complex_integer_type_node = make_node (COMPLEX_TYPE); | |
4826 | TREE_TYPE (complex_integer_type_node) = integer_type_node; | |
4827 | layout_type (complex_integer_type_node); | |
4828 | ||
4829 | complex_float_type_node = make_node (COMPLEX_TYPE); | |
4830 | TREE_TYPE (complex_float_type_node) = float_type_node; | |
4831 | layout_type (complex_float_type_node); | |
4832 | ||
4833 | complex_double_type_node = make_node (COMPLEX_TYPE); | |
4834 | TREE_TYPE (complex_double_type_node) = double_type_node; | |
4835 | layout_type (complex_double_type_node); | |
4836 | ||
4837 | complex_long_double_type_node = make_node (COMPLEX_TYPE); | |
4838 | TREE_TYPE (complex_long_double_type_node) = long_double_type_node; | |
4839 | layout_type (complex_long_double_type_node); | |
4840 | ||
2df88e9f JO |
4841 | { |
4842 | tree t; | |
4843 | BUILD_VA_LIST_TYPE (t); | |
066c84df AO |
4844 | |
4845 | /* Many back-ends define record types without seting TYPE_NAME. | |
4846 | If we copied the record type here, we'd keep the original | |
4847 | record type without a name. This breaks name mangling. So, | |
4848 | don't copy record types and let c_common_nodes_and_builtins() | |
4849 | declare the type to be __builtin_va_list. */ | |
4850 | if (TREE_CODE (t) != RECORD_TYPE) | |
4851 | t = build_type_copy (t); | |
4852 | ||
4853 | va_list_type_node = t; | |
2df88e9f | 4854 | } |
4061f623 BS |
4855 | |
4856 | V4SF_type_node = make_node (VECTOR_TYPE); | |
4857 | TREE_TYPE (V4SF_type_node) = float_type_node; | |
4858 | TYPE_MODE (V4SF_type_node) = V4SFmode; | |
4859 | finish_vector_type (V4SF_type_node); | |
4860 | ||
4861 | V4SI_type_node = make_node (VECTOR_TYPE); | |
4862 | TREE_TYPE (V4SI_type_node) = intSI_type_node; | |
4863 | TYPE_MODE (V4SI_type_node) = V4SImode; | |
4864 | finish_vector_type (V4SI_type_node); | |
4865 | ||
4866 | V2SI_type_node = make_node (VECTOR_TYPE); | |
4867 | TREE_TYPE (V2SI_type_node) = intSI_type_node; | |
4868 | TYPE_MODE (V2SI_type_node) = V2SImode; | |
4869 | finish_vector_type (V2SI_type_node); | |
4870 | ||
4871 | V4HI_type_node = make_node (VECTOR_TYPE); | |
4872 | TREE_TYPE (V4HI_type_node) = intHI_type_node; | |
4873 | TYPE_MODE (V4HI_type_node) = V4HImode; | |
4874 | finish_vector_type (V4HI_type_node); | |
4875 | ||
4876 | V8QI_type_node = make_node (VECTOR_TYPE); | |
4877 | TREE_TYPE (V8QI_type_node) = intQI_type_node; | |
4878 | TYPE_MODE (V8QI_type_node) = V8QImode; | |
4879 | finish_vector_type (V8QI_type_node); | |
47f339cf BS |
4880 | |
4881 | V2SF_type_node = make_node (VECTOR_TYPE); | |
4882 | TREE_TYPE (V2SF_type_node) = float_type_node; | |
4883 | TYPE_MODE (V2SF_type_node) = V2SFmode; | |
4884 | finish_vector_type (V2SF_type_node); | |
81b3411c | 4885 | } |