]>
Commit | Line | Data |
---|---|---|
c6a1db6c | 1 | /* Language-independent node constructors for parse phase of GNU compiler. |
c36a127d | 2 | Copyright (C) 1987, 88, 92, 93, 94, 1995 Free Software Foundation, Inc. |
c6a1db6c RS |
3 | |
4 | This file is part of GNU CC. | |
5 | ||
6 | GNU CC is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2, or (at your option) | |
9 | any later version. | |
10 | ||
11 | GNU CC is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU CC; see the file COPYING. If not, write to | |
e9fa0c7c RK |
18 | the Free Software Foundation, 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. */ | |
c6a1db6c RS |
20 | |
21 | ||
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 | ||
53d74c3c | 36 | #include <setjmp.h> |
c6a1db6c | 37 | #include "config.h" |
c6a1db6c | 38 | #include "flags.h" |
c6a1db6c | 39 | #include "tree.h" |
d69c4bd1 | 40 | #include "function.h" |
c6a1db6c | 41 | #include "obstack.h" |
ba63ed56 | 42 | #ifdef __STDC__ |
04fe4385 | 43 | #include <stdarg.h> |
ba63ed56 | 44 | #else |
04fe4385 | 45 | #include <varargs.h> |
ba63ed56 | 46 | #endif |
f8d97cf4 | 47 | #include <stdio.h> |
c6a1db6c RS |
48 | |
49 | #define obstack_chunk_alloc xmalloc | |
50 | #define obstack_chunk_free free | |
51 | ||
c6a1db6c RS |
52 | /* Tree nodes of permanent duration are allocated in this obstack. |
53 | They are the identifier nodes, and everything outside of | |
54 | the bodies and parameters of function definitions. */ | |
55 | ||
56 | struct obstack permanent_obstack; | |
57 | ||
58 | /* The initial RTL, and all ..._TYPE nodes, in a function | |
59 | are allocated in this obstack. Usually they are freed at the | |
60 | end of the function, but if the function is inline they are saved. | |
61 | For top-level functions, this is maybepermanent_obstack. | |
62 | Separate obstacks are made for nested functions. */ | |
63 | ||
64 | struct obstack *function_maybepermanent_obstack; | |
65 | ||
66 | /* This is the function_maybepermanent_obstack for top-level functions. */ | |
67 | ||
68 | struct obstack maybepermanent_obstack; | |
69 | ||
a0dabda5 JM |
70 | /* This is a list of function_maybepermanent_obstacks for top-level inline |
71 | functions that are compiled in the middle of compiling other functions. */ | |
72 | ||
73 | struct simple_obstack_stack *toplev_inline_obstacks; | |
74 | ||
75 | /* This is a list of function_maybepermanent_obstacks for inline functions | |
76 | nested in the current function that were compiled in the middle of | |
77 | compiling other functions. */ | |
78 | ||
79 | struct simple_obstack_stack *inline_obstacks; | |
80 | ||
c6a1db6c RS |
81 | /* The contents of the current function definition are allocated |
82 | in this obstack, and all are freed at the end of the function. | |
83 | For top-level functions, this is temporary_obstack. | |
84 | Separate obstacks are made for nested functions. */ | |
85 | ||
86 | struct obstack *function_obstack; | |
87 | ||
88 | /* This is used for reading initializers of global variables. */ | |
89 | ||
90 | struct obstack temporary_obstack; | |
91 | ||
92 | /* The tree nodes of an expression are allocated | |
93 | in this obstack, and all are freed at the end of the expression. */ | |
94 | ||
95 | struct obstack momentary_obstack; | |
96 | ||
97 | /* The tree nodes of a declarator are allocated | |
98 | in this obstack, and all are freed when the declarator | |
99 | has been parsed. */ | |
100 | ||
101 | static struct obstack temp_decl_obstack; | |
102 | ||
103 | /* This points at either permanent_obstack | |
104 | or the current function_maybepermanent_obstack. */ | |
105 | ||
106 | struct obstack *saveable_obstack; | |
107 | ||
108 | /* This is same as saveable_obstack during parse and expansion phase; | |
109 | it points to the current function's obstack during optimization. | |
110 | This is the obstack to be used for creating rtl objects. */ | |
111 | ||
112 | struct obstack *rtl_obstack; | |
113 | ||
114 | /* This points at either permanent_obstack or the current function_obstack. */ | |
115 | ||
116 | struct obstack *current_obstack; | |
117 | ||
118 | /* This points at either permanent_obstack or the current function_obstack | |
119 | or momentary_obstack. */ | |
120 | ||
121 | struct obstack *expression_obstack; | |
122 | ||
123 | /* Stack of obstack selections for push_obstacks and pop_obstacks. */ | |
124 | ||
125 | struct obstack_stack | |
126 | { | |
127 | struct obstack_stack *next; | |
128 | struct obstack *current; | |
129 | struct obstack *saveable; | |
130 | struct obstack *expression; | |
131 | struct obstack *rtl; | |
132 | }; | |
133 | ||
134 | struct obstack_stack *obstack_stack; | |
135 | ||
136 | /* Obstack for allocating struct obstack_stack entries. */ | |
137 | ||
138 | static struct obstack obstack_stack_obstack; | |
139 | ||
140 | /* Addresses of first objects in some obstacks. | |
141 | This is for freeing their entire contents. */ | |
142 | char *maybepermanent_firstobj; | |
143 | char *temporary_firstobj; | |
144 | char *momentary_firstobj; | |
145 | char *temp_decl_firstobj; | |
146 | ||
2b417d3c JW |
147 | /* This is used to preserve objects (mainly array initializers) that need to |
148 | live until the end of the current function, but no further. */ | |
149 | char *momentary_function_firstobj; | |
150 | ||
c6a1db6c RS |
151 | /* Nonzero means all ..._TYPE nodes should be allocated permanently. */ |
152 | ||
153 | int all_types_permanent; | |
154 | ||
155 | /* Stack of places to restore the momentary obstack back to. */ | |
156 | ||
157 | struct momentary_level | |
158 | { | |
159 | /* Pointer back to previous such level. */ | |
160 | struct momentary_level *prev; | |
161 | /* First object allocated within this level. */ | |
162 | char *base; | |
163 | /* Value of expression_obstack saved at entry to this level. */ | |
164 | struct obstack *obstack; | |
165 | }; | |
166 | ||
167 | struct momentary_level *momentary_stack; | |
168 | ||
169 | /* Table indexed by tree code giving a string containing a character | |
170 | classifying the tree code. Possibilities are | |
171 | t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */ | |
172 | ||
173 | #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE, | |
174 | ||
175 | char *standard_tree_code_type[] = { | |
176 | #include "tree.def" | |
177 | }; | |
178 | #undef DEFTREECODE | |
179 | ||
180 | /* Table indexed by tree code giving number of expression | |
181 | operands beyond the fixed part of the node structure. | |
182 | Not used for types or decls. */ | |
183 | ||
184 | #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH, | |
185 | ||
186 | int standard_tree_code_length[] = { | |
187 | #include "tree.def" | |
188 | }; | |
189 | #undef DEFTREECODE | |
190 | ||
191 | /* Names of tree components. | |
192 | Used for printing out the tree and error messages. */ | |
193 | #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME, | |
194 | ||
195 | char *standard_tree_code_name[] = { | |
196 | #include "tree.def" | |
197 | }; | |
198 | #undef DEFTREECODE | |
199 | ||
200 | /* Table indexed by tree code giving a string containing a character | |
201 | classifying the tree code. Possibilities are | |
202 | t, d, s, c, r, e, <, 1 and 2. See tree.def for details. */ | |
203 | ||
204 | char **tree_code_type; | |
205 | ||
206 | /* Table indexed by tree code giving number of expression | |
207 | operands beyond the fixed part of the node structure. | |
208 | Not used for types or decls. */ | |
209 | ||
210 | int *tree_code_length; | |
211 | ||
212 | /* Table indexed by tree code giving name of tree code, as a string. */ | |
213 | ||
214 | char **tree_code_name; | |
215 | ||
216 | /* Statistics-gathering stuff. */ | |
217 | typedef enum | |
218 | { | |
03646189 RS |
219 | d_kind, |
220 | t_kind, | |
221 | b_kind, | |
222 | s_kind, | |
223 | r_kind, | |
224 | e_kind, | |
225 | c_kind, | |
226 | id_kind, | |
227 | op_id_kind, | |
228 | perm_list_kind, | |
229 | temp_list_kind, | |
230 | vec_kind, | |
231 | x_kind, | |
232 | lang_decl, | |
233 | lang_type, | |
234 | all_kinds | |
c6a1db6c | 235 | } tree_node_kind; |
03646189 | 236 | |
c6a1db6c RS |
237 | int tree_node_counts[(int)all_kinds]; |
238 | int tree_node_sizes[(int)all_kinds]; | |
239 | int id_string_size = 0; | |
03646189 RS |
240 | |
241 | char *tree_node_kind_names[] = { | |
242 | "decls", | |
243 | "types", | |
244 | "blocks", | |
245 | "stmts", | |
246 | "refs", | |
247 | "exprs", | |
248 | "constants", | |
249 | "identifiers", | |
250 | "op_identifiers", | |
251 | "perm_tree_lists", | |
252 | "temp_tree_lists", | |
253 | "vecs", | |
254 | "random kinds", | |
255 | "lang_decl kinds", | |
256 | "lang_type kinds" | |
257 | }; | |
c6a1db6c RS |
258 | |
259 | /* Hash table for uniquizing IDENTIFIER_NODEs by name. */ | |
260 | ||
261 | #define MAX_HASH_TABLE 1009 | |
262 | static tree hash_table[MAX_HASH_TABLE]; /* id hash buckets */ | |
263 | ||
264 | /* 0 while creating built-in identifiers. */ | |
265 | static int do_identifier_warnings; | |
266 | ||
0e77444b RS |
267 | /* Unique id for next decl created. */ |
268 | static int next_decl_uid; | |
579f50b6 RK |
269 | /* Unique id for next type created. */ |
270 | static int next_type_uid = 1; | |
0e77444b | 271 | |
91e97eb8 RK |
272 | /* Here is how primitive or already-canonicalized types' hash |
273 | codes are made. */ | |
274 | #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777) | |
275 | ||
c6a1db6c RS |
276 | extern char *mode_name[]; |
277 | ||
278 | void gcc_obstack_init (); | |
c6a1db6c RS |
279 | \f |
280 | /* Init the principal obstacks. */ | |
281 | ||
282 | void | |
283 | init_obstacks () | |
284 | { | |
285 | gcc_obstack_init (&obstack_stack_obstack); | |
286 | gcc_obstack_init (&permanent_obstack); | |
287 | ||
288 | gcc_obstack_init (&temporary_obstack); | |
289 | temporary_firstobj = (char *) obstack_alloc (&temporary_obstack, 0); | |
290 | gcc_obstack_init (&momentary_obstack); | |
291 | momentary_firstobj = (char *) obstack_alloc (&momentary_obstack, 0); | |
2b417d3c | 292 | momentary_function_firstobj = momentary_firstobj; |
c6a1db6c RS |
293 | gcc_obstack_init (&maybepermanent_obstack); |
294 | maybepermanent_firstobj | |
295 | = (char *) obstack_alloc (&maybepermanent_obstack, 0); | |
296 | gcc_obstack_init (&temp_decl_obstack); | |
297 | temp_decl_firstobj = (char *) obstack_alloc (&temp_decl_obstack, 0); | |
298 | ||
299 | function_obstack = &temporary_obstack; | |
300 | function_maybepermanent_obstack = &maybepermanent_obstack; | |
301 | current_obstack = &permanent_obstack; | |
302 | expression_obstack = &permanent_obstack; | |
303 | rtl_obstack = saveable_obstack = &permanent_obstack; | |
304 | ||
305 | /* Init the hash table of identifiers. */ | |
4c9a05bc | 306 | bzero ((char *) hash_table, sizeof hash_table); |
c6a1db6c RS |
307 | } |
308 | ||
309 | void | |
310 | gcc_obstack_init (obstack) | |
311 | struct obstack *obstack; | |
312 | { | |
313 | /* Let particular systems override the size of a chunk. */ | |
314 | #ifndef OBSTACK_CHUNK_SIZE | |
315 | #define OBSTACK_CHUNK_SIZE 0 | |
316 | #endif | |
317 | /* Let them override the alloc and free routines too. */ | |
318 | #ifndef OBSTACK_CHUNK_ALLOC | |
319 | #define OBSTACK_CHUNK_ALLOC xmalloc | |
320 | #endif | |
321 | #ifndef OBSTACK_CHUNK_FREE | |
322 | #define OBSTACK_CHUNK_FREE free | |
323 | #endif | |
324 | _obstack_begin (obstack, OBSTACK_CHUNK_SIZE, 0, | |
325 | (void *(*) ()) OBSTACK_CHUNK_ALLOC, | |
326 | (void (*) ()) OBSTACK_CHUNK_FREE); | |
327 | } | |
328 | ||
329 | /* Save all variables describing the current status into the structure *P. | |
a0dabda5 JM |
330 | This is used before starting a nested function. |
331 | ||
332 | CONTEXT is the decl_function_context for the function we're about to | |
333 | compile; if it isn't current_function_decl, we have to play some games. */ | |
c6a1db6c RS |
334 | |
335 | void | |
a0dabda5 | 336 | save_tree_status (p, context) |
c6a1db6c | 337 | struct function *p; |
a0dabda5 | 338 | tree context; |
c6a1db6c RS |
339 | { |
340 | p->all_types_permanent = all_types_permanent; | |
341 | p->momentary_stack = momentary_stack; | |
342 | p->maybepermanent_firstobj = maybepermanent_firstobj; | |
343 | p->momentary_firstobj = momentary_firstobj; | |
2b417d3c | 344 | p->momentary_function_firstobj = momentary_function_firstobj; |
c6a1db6c RS |
345 | p->function_obstack = function_obstack; |
346 | p->function_maybepermanent_obstack = function_maybepermanent_obstack; | |
347 | p->current_obstack = current_obstack; | |
348 | p->expression_obstack = expression_obstack; | |
349 | p->saveable_obstack = saveable_obstack; | |
350 | p->rtl_obstack = rtl_obstack; | |
a0dabda5 | 351 | p->inline_obstacks = inline_obstacks; |
c6a1db6c | 352 | |
a0dabda5 JM |
353 | if (context == current_function_decl) |
354 | /* Objects that need to be saved in this function can be in the nonsaved | |
355 | obstack of the enclosing function since they can't possibly be needed | |
356 | once it has returned. */ | |
357 | function_maybepermanent_obstack = function_obstack; | |
358 | else | |
cafbaf85 | 359 | { |
a0dabda5 JM |
360 | /* We're compiling a function which isn't nested in the current |
361 | function. We need to create a new maybepermanent_obstack for this | |
362 | function, since it can't go onto any of the existing obstacks. */ | |
363 | struct simple_obstack_stack **head; | |
364 | struct simple_obstack_stack *current; | |
365 | ||
366 | if (context == NULL_TREE) | |
367 | head = &toplev_inline_obstacks; | |
368 | else | |
369 | { | |
370 | struct function *f = find_function_data (context); | |
371 | head = &f->inline_obstacks; | |
372 | } | |
373 | ||
374 | current = ((struct simple_obstack_stack *) | |
375 | xmalloc (sizeof (struct simple_obstack_stack))); | |
376 | ||
377 | current->obstack = (struct obstack *) xmalloc (sizeof (struct obstack)); | |
378 | function_maybepermanent_obstack = current->obstack; | |
379 | gcc_obstack_init (function_maybepermanent_obstack); | |
380 | ||
381 | current->next = *head; | |
382 | *head = current; | |
383 | } | |
384 | ||
385 | maybepermanent_firstobj | |
386 | = (char *) obstack_finish (function_maybepermanent_obstack); | |
19e7d354 | 387 | |
c6a1db6c RS |
388 | function_obstack = (struct obstack *) xmalloc (sizeof (struct obstack)); |
389 | gcc_obstack_init (function_obstack); | |
390 | ||
c6a1db6c RS |
391 | current_obstack = &permanent_obstack; |
392 | expression_obstack = &permanent_obstack; | |
393 | rtl_obstack = saveable_obstack = &permanent_obstack; | |
394 | ||
395 | momentary_firstobj = (char *) obstack_finish (&momentary_obstack); | |
2b417d3c | 396 | momentary_function_firstobj = momentary_firstobj; |
c6a1db6c RS |
397 | } |
398 | ||
399 | /* Restore all variables describing the current status from the structure *P. | |
400 | This is used after a nested function. */ | |
401 | ||
402 | void | |
a0dabda5 | 403 | restore_tree_status (p) |
c6a1db6c RS |
404 | struct function *p; |
405 | { | |
406 | all_types_permanent = p->all_types_permanent; | |
407 | momentary_stack = p->momentary_stack; | |
408 | ||
2b417d3c | 409 | obstack_free (&momentary_obstack, momentary_function_firstobj); |
19e7d354 | 410 | |
a0dabda5 JM |
411 | /* Free saveable storage used by the function just compiled and not |
412 | saved. | |
413 | ||
414 | CAUTION: This is in function_obstack of the containing function. | |
415 | So we must be sure that we never allocate from that obstack during | |
416 | the compilation of a nested function if we expect it to survive | |
417 | past the nested function's end. */ | |
418 | obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj); | |
19e7d354 | 419 | |
c6a1db6c | 420 | obstack_free (function_obstack, 0); |
c6a1db6c RS |
421 | free (function_obstack); |
422 | ||
423 | momentary_firstobj = p->momentary_firstobj; | |
2b417d3c | 424 | momentary_function_firstobj = p->momentary_function_firstobj; |
c6a1db6c RS |
425 | maybepermanent_firstobj = p->maybepermanent_firstobj; |
426 | function_obstack = p->function_obstack; | |
427 | function_maybepermanent_obstack = p->function_maybepermanent_obstack; | |
428 | current_obstack = p->current_obstack; | |
429 | expression_obstack = p->expression_obstack; | |
430 | saveable_obstack = p->saveable_obstack; | |
431 | rtl_obstack = p->rtl_obstack; | |
a0dabda5 | 432 | inline_obstacks = p->inline_obstacks; |
c6a1db6c RS |
433 | } |
434 | \f | |
435 | /* Start allocating on the temporary (per function) obstack. | |
436 | This is done in start_function before parsing the function body, | |
437 | and before each initialization at top level, and to go back | |
956af069 | 438 | to temporary allocation after doing permanent_allocation. */ |
c6a1db6c RS |
439 | |
440 | void | |
441 | temporary_allocation () | |
442 | { | |
443 | /* Note that function_obstack at top level points to temporary_obstack. | |
444 | But within a nested function context, it is a separate obstack. */ | |
445 | current_obstack = function_obstack; | |
446 | expression_obstack = function_obstack; | |
447 | rtl_obstack = saveable_obstack = function_maybepermanent_obstack; | |
448 | momentary_stack = 0; | |
a0dabda5 | 449 | inline_obstacks = 0; |
c6a1db6c RS |
450 | } |
451 | ||
452 | /* Start allocating on the permanent obstack but don't | |
453 | free the temporary data. After calling this, call | |
454 | `permanent_allocation' to fully resume permanent allocation status. */ | |
455 | ||
456 | void | |
457 | end_temporary_allocation () | |
458 | { | |
459 | current_obstack = &permanent_obstack; | |
460 | expression_obstack = &permanent_obstack; | |
461 | rtl_obstack = saveable_obstack = &permanent_obstack; | |
462 | } | |
463 | ||
464 | /* Resume allocating on the temporary obstack, undoing | |
465 | effects of `end_temporary_allocation'. */ | |
466 | ||
467 | void | |
468 | resume_temporary_allocation () | |
469 | { | |
470 | current_obstack = function_obstack; | |
471 | expression_obstack = function_obstack; | |
472 | rtl_obstack = saveable_obstack = function_maybepermanent_obstack; | |
473 | } | |
474 | ||
475 | /* While doing temporary allocation, switch to allocating in such a | |
476 | way as to save all nodes if the function is inlined. Call | |
477 | resume_temporary_allocation to go back to ordinary temporary | |
478 | allocation. */ | |
479 | ||
480 | void | |
481 | saveable_allocation () | |
482 | { | |
483 | /* Note that function_obstack at top level points to temporary_obstack. | |
484 | But within a nested function context, it is a separate obstack. */ | |
485 | expression_obstack = current_obstack = saveable_obstack; | |
486 | } | |
487 | ||
488 | /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE, | |
489 | recording the previously current obstacks on a stack. | |
490 | This does not free any storage in any obstack. */ | |
491 | ||
492 | void | |
493 | push_obstacks (current, saveable) | |
494 | struct obstack *current, *saveable; | |
495 | { | |
496 | struct obstack_stack *p | |
497 | = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack, | |
498 | (sizeof (struct obstack_stack))); | |
499 | ||
500 | p->current = current_obstack; | |
501 | p->saveable = saveable_obstack; | |
502 | p->expression = expression_obstack; | |
503 | p->rtl = rtl_obstack; | |
504 | p->next = obstack_stack; | |
505 | obstack_stack = p; | |
506 | ||
507 | current_obstack = current; | |
508 | expression_obstack = current; | |
509 | rtl_obstack = saveable_obstack = saveable; | |
510 | } | |
511 | ||
512 | /* Save the current set of obstacks, but don't change them. */ | |
513 | ||
514 | void | |
515 | push_obstacks_nochange () | |
516 | { | |
517 | struct obstack_stack *p | |
518 | = (struct obstack_stack *) obstack_alloc (&obstack_stack_obstack, | |
519 | (sizeof (struct obstack_stack))); | |
520 | ||
521 | p->current = current_obstack; | |
522 | p->saveable = saveable_obstack; | |
523 | p->expression = expression_obstack; | |
524 | p->rtl = rtl_obstack; | |
525 | p->next = obstack_stack; | |
526 | obstack_stack = p; | |
527 | } | |
528 | ||
529 | /* Pop the obstack selection stack. */ | |
530 | ||
531 | void | |
532 | pop_obstacks () | |
533 | { | |
534 | struct obstack_stack *p = obstack_stack; | |
535 | obstack_stack = p->next; | |
536 | ||
537 | current_obstack = p->current; | |
538 | saveable_obstack = p->saveable; | |
539 | expression_obstack = p->expression; | |
540 | rtl_obstack = p->rtl; | |
541 | ||
542 | obstack_free (&obstack_stack_obstack, p); | |
543 | } | |
544 | ||
545 | /* Nonzero if temporary allocation is currently in effect. | |
546 | Zero if currently doing permanent allocation. */ | |
547 | ||
548 | int | |
549 | allocation_temporary_p () | |
550 | { | |
551 | return current_obstack != &permanent_obstack; | |
552 | } | |
553 | ||
554 | /* Go back to allocating on the permanent obstack | |
555 | and free everything in the temporary obstack. | |
2b417d3c JW |
556 | |
557 | FUNCTION_END is true only if we have just finished compiling a function. | |
558 | In that case, we also free preserved initial values on the momentary | |
559 | obstack. */ | |
c6a1db6c RS |
560 | |
561 | void | |
2b417d3c JW |
562 | permanent_allocation (function_end) |
563 | int function_end; | |
c6a1db6c RS |
564 | { |
565 | /* Free up previous temporary obstack data */ | |
566 | obstack_free (&temporary_obstack, temporary_firstobj); | |
2b417d3c | 567 | if (function_end) |
c61f7d69 RK |
568 | { |
569 | obstack_free (&momentary_obstack, momentary_function_firstobj); | |
570 | momentary_firstobj = momentary_function_firstobj; | |
571 | } | |
2b417d3c JW |
572 | else |
573 | obstack_free (&momentary_obstack, momentary_firstobj); | |
9ccd47de | 574 | obstack_free (function_maybepermanent_obstack, maybepermanent_firstobj); |
c6a1db6c RS |
575 | obstack_free (&temp_decl_obstack, temp_decl_firstobj); |
576 | ||
a0dabda5 JM |
577 | /* Free up the maybepermanent_obstacks for any of our nested functions |
578 | which were compiled at a lower level. */ | |
579 | while (inline_obstacks) | |
580 | { | |
581 | struct simple_obstack_stack *current = inline_obstacks; | |
582 | inline_obstacks = current->next; | |
583 | obstack_free (current->obstack, 0); | |
584 | free (current->obstack); | |
585 | free (current); | |
586 | } | |
587 | ||
c6a1db6c RS |
588 | current_obstack = &permanent_obstack; |
589 | expression_obstack = &permanent_obstack; | |
590 | rtl_obstack = saveable_obstack = &permanent_obstack; | |
591 | } | |
592 | ||
593 | /* Save permanently everything on the maybepermanent_obstack. */ | |
594 | ||
595 | void | |
596 | preserve_data () | |
597 | { | |
598 | maybepermanent_firstobj | |
599 | = (char *) obstack_alloc (function_maybepermanent_obstack, 0); | |
600 | } | |
601 | ||
602 | void | |
603 | preserve_initializer () | |
604 | { | |
2b417d3c JW |
605 | struct momentary_level *tem; |
606 | char *old_momentary; | |
607 | ||
c6a1db6c RS |
608 | temporary_firstobj |
609 | = (char *) obstack_alloc (&temporary_obstack, 0); | |
c6a1db6c RS |
610 | maybepermanent_firstobj |
611 | = (char *) obstack_alloc (function_maybepermanent_obstack, 0); | |
2b417d3c JW |
612 | |
613 | old_momentary = momentary_firstobj; | |
614 | momentary_firstobj | |
615 | = (char *) obstack_alloc (&momentary_obstack, 0); | |
616 | if (momentary_firstobj != old_momentary) | |
617 | for (tem = momentary_stack; tem; tem = tem->prev) | |
618 | tem->base = momentary_firstobj; | |
c6a1db6c RS |
619 | } |
620 | ||
621 | /* Start allocating new rtl in current_obstack. | |
622 | Use resume_temporary_allocation | |
623 | to go back to allocating rtl in saveable_obstack. */ | |
624 | ||
625 | void | |
626 | rtl_in_current_obstack () | |
627 | { | |
628 | rtl_obstack = current_obstack; | |
629 | } | |
630 | ||
02e39be1 JW |
631 | /* Start allocating rtl from saveable_obstack. Intended to be used after |
632 | a call to push_obstacks_nochange. */ | |
c6a1db6c | 633 | |
02e39be1 | 634 | void |
c6a1db6c RS |
635 | rtl_in_saveable_obstack () |
636 | { | |
02e39be1 | 637 | rtl_obstack = saveable_obstack; |
c6a1db6c RS |
638 | } |
639 | \f | |
640 | /* Allocate SIZE bytes in the current obstack | |
641 | and return a pointer to them. | |
642 | In practice the current obstack is always the temporary one. */ | |
643 | ||
644 | char * | |
645 | oballoc (size) | |
646 | int size; | |
647 | { | |
648 | return (char *) obstack_alloc (current_obstack, size); | |
649 | } | |
650 | ||
651 | /* Free the object PTR in the current obstack | |
652 | as well as everything allocated since PTR. | |
653 | In practice the current obstack is always the temporary one. */ | |
654 | ||
655 | void | |
656 | obfree (ptr) | |
657 | char *ptr; | |
658 | { | |
659 | obstack_free (current_obstack, ptr); | |
660 | } | |
661 | ||
662 | /* Allocate SIZE bytes in the permanent obstack | |
663 | and return a pointer to them. */ | |
664 | ||
665 | char * | |
666 | permalloc (size) | |
37366632 | 667 | int size; |
c6a1db6c RS |
668 | { |
669 | return (char *) obstack_alloc (&permanent_obstack, size); | |
670 | } | |
671 | ||
672 | /* Allocate NELEM items of SIZE bytes in the permanent obstack | |
673 | and return a pointer to them. The storage is cleared before | |
674 | returning the value. */ | |
675 | ||
676 | char * | |
677 | perm_calloc (nelem, size) | |
678 | int nelem; | |
679 | long size; | |
680 | { | |
681 | char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size); | |
682 | bzero (rval, nelem * size); | |
683 | return rval; | |
684 | } | |
685 | ||
686 | /* Allocate SIZE bytes in the saveable obstack | |
687 | and return a pointer to them. */ | |
688 | ||
689 | char * | |
690 | savealloc (size) | |
691 | int size; | |
692 | { | |
693 | return (char *) obstack_alloc (saveable_obstack, size); | |
694 | } | |
695 | \f | |
696 | /* Print out which obstack an object is in. */ | |
697 | ||
698 | void | |
c4be79d2 | 699 | print_obstack_name (object, file, prefix) |
c6a1db6c | 700 | char *object; |
c4be79d2 RK |
701 | FILE *file; |
702 | char *prefix; | |
c6a1db6c RS |
703 | { |
704 | struct obstack *obstack = NULL; | |
705 | char *obstack_name = NULL; | |
706 | struct function *p; | |
707 | ||
708 | for (p = outer_function_chain; p; p = p->next) | |
709 | { | |
710 | if (_obstack_allocated_p (p->function_obstack, object)) | |
711 | { | |
712 | obstack = p->function_obstack; | |
713 | obstack_name = "containing function obstack"; | |
714 | } | |
715 | if (_obstack_allocated_p (p->function_maybepermanent_obstack, object)) | |
716 | { | |
717 | obstack = p->function_maybepermanent_obstack; | |
718 | obstack_name = "containing function maybepermanent obstack"; | |
719 | } | |
720 | } | |
721 | ||
722 | if (_obstack_allocated_p (&obstack_stack_obstack, object)) | |
723 | { | |
724 | obstack = &obstack_stack_obstack; | |
725 | obstack_name = "obstack_stack_obstack"; | |
726 | } | |
727 | else if (_obstack_allocated_p (function_obstack, object)) | |
728 | { | |
729 | obstack = function_obstack; | |
730 | obstack_name = "function obstack"; | |
731 | } | |
732 | else if (_obstack_allocated_p (&permanent_obstack, object)) | |
733 | { | |
734 | obstack = &permanent_obstack; | |
735 | obstack_name = "permanent_obstack"; | |
736 | } | |
737 | else if (_obstack_allocated_p (&momentary_obstack, object)) | |
738 | { | |
739 | obstack = &momentary_obstack; | |
740 | obstack_name = "momentary_obstack"; | |
741 | } | |
742 | else if (_obstack_allocated_p (function_maybepermanent_obstack, object)) | |
743 | { | |
744 | obstack = function_maybepermanent_obstack; | |
745 | obstack_name = "function maybepermanent obstack"; | |
746 | } | |
747 | else if (_obstack_allocated_p (&temp_decl_obstack, object)) | |
748 | { | |
749 | obstack = &temp_decl_obstack; | |
750 | obstack_name = "temp_decl_obstack"; | |
751 | } | |
752 | ||
753 | /* Check to see if the object is in the free area of the obstack. */ | |
754 | if (obstack != NULL) | |
755 | { | |
756 | if (object >= obstack->next_free | |
757 | && object < obstack->chunk_limit) | |
c4be79d2 RK |
758 | fprintf (file, "%s in free portion of obstack %s", |
759 | prefix, obstack_name); | |
c6a1db6c | 760 | else |
c4be79d2 | 761 | fprintf (file, "%s allocated from %s", prefix, obstack_name); |
c6a1db6c RS |
762 | } |
763 | else | |
c4be79d2 RK |
764 | fprintf (file, "%s not allocated from any obstack", prefix); |
765 | } | |
766 | ||
767 | void | |
768 | debug_obstack (object) | |
769 | char *object; | |
770 | { | |
771 | print_obstack_name (object, stderr, "object"); | |
772 | fprintf (stderr, ".\n"); | |
c6a1db6c RS |
773 | } |
774 | ||
775 | /* Return 1 if OBJ is in the permanent obstack. | |
776 | This is slow, and should be used only for debugging. | |
777 | Use TREE_PERMANENT for other purposes. */ | |
778 | ||
779 | int | |
780 | object_permanent_p (obj) | |
781 | tree obj; | |
782 | { | |
783 | return _obstack_allocated_p (&permanent_obstack, obj); | |
784 | } | |
785 | \f | |
786 | /* Start a level of momentary allocation. | |
787 | In C, each compound statement has its own level | |
788 | and that level is freed at the end of each statement. | |
789 | All expression nodes are allocated in the momentary allocation level. */ | |
790 | ||
791 | void | |
792 | push_momentary () | |
793 | { | |
794 | struct momentary_level *tem | |
795 | = (struct momentary_level *) obstack_alloc (&momentary_obstack, | |
796 | sizeof (struct momentary_level)); | |
797 | tem->prev = momentary_stack; | |
798 | tem->base = (char *) obstack_base (&momentary_obstack); | |
799 | tem->obstack = expression_obstack; | |
800 | momentary_stack = tem; | |
801 | expression_obstack = &momentary_obstack; | |
802 | } | |
803 | ||
9e8730a4 RK |
804 | /* Set things up so the next clear_momentary will only clear memory |
805 | past our present position in momentary_obstack. */ | |
806 | ||
807 | void | |
808 | preserve_momentary () | |
809 | { | |
810 | momentary_stack->base = (char *) obstack_base (&momentary_obstack); | |
811 | } | |
812 | ||
c6a1db6c RS |
813 | /* Free all the storage in the current momentary-allocation level. |
814 | In C, this happens at the end of each statement. */ | |
815 | ||
816 | void | |
817 | clear_momentary () | |
818 | { | |
819 | obstack_free (&momentary_obstack, momentary_stack->base); | |
820 | } | |
821 | ||
822 | /* Discard a level of momentary allocation. | |
823 | In C, this happens at the end of each compound statement. | |
824 | Restore the status of expression node allocation | |
825 | that was in effect before this level was created. */ | |
826 | ||
827 | void | |
828 | pop_momentary () | |
829 | { | |
830 | struct momentary_level *tem = momentary_stack; | |
831 | momentary_stack = tem->prev; | |
832 | expression_obstack = tem->obstack; | |
2b417d3c JW |
833 | /* We can't free TEM from the momentary_obstack, because there might |
834 | be objects above it which have been saved. We can free back to the | |
835 | stack of the level we are popping off though. */ | |
836 | obstack_free (&momentary_obstack, tem->base); | |
c6a1db6c RS |
837 | } |
838 | ||
14b6efff RS |
839 | /* Pop back to the previous level of momentary allocation, |
840 | but don't free any momentary data just yet. */ | |
841 | ||
842 | void | |
843 | pop_momentary_nofree () | |
844 | { | |
845 | struct momentary_level *tem = momentary_stack; | |
846 | momentary_stack = tem->prev; | |
847 | expression_obstack = tem->obstack; | |
848 | } | |
849 | ||
c6a1db6c RS |
850 | /* Call when starting to parse a declaration: |
851 | make expressions in the declaration last the length of the function. | |
852 | Returns an argument that should be passed to resume_momentary later. */ | |
853 | ||
854 | int | |
855 | suspend_momentary () | |
856 | { | |
857 | register int tem = expression_obstack == &momentary_obstack; | |
858 | expression_obstack = saveable_obstack; | |
859 | return tem; | |
860 | } | |
861 | ||
862 | /* Call when finished parsing a declaration: | |
863 | restore the treatment of node-allocation that was | |
864 | in effect before the suspension. | |
865 | YES should be the value previously returned by suspend_momentary. */ | |
866 | ||
867 | void | |
868 | resume_momentary (yes) | |
869 | int yes; | |
870 | { | |
871 | if (yes) | |
872 | expression_obstack = &momentary_obstack; | |
873 | } | |
874 | \f | |
875 | /* Init the tables indexed by tree code. | |
876 | Note that languages can add to these tables to define their own codes. */ | |
877 | ||
878 | void | |
879 | init_tree_codes () | |
880 | { | |
881 | tree_code_type = (char **) xmalloc (sizeof (standard_tree_code_type)); | |
882 | tree_code_length = (int *) xmalloc (sizeof (standard_tree_code_length)); | |
883 | tree_code_name = (char **) xmalloc (sizeof (standard_tree_code_name)); | |
4c9a05bc | 884 | bcopy ((char *) standard_tree_code_type, (char *) tree_code_type, |
c6a1db6c | 885 | sizeof (standard_tree_code_type)); |
4c9a05bc | 886 | bcopy ((char *) standard_tree_code_length, (char *) tree_code_length, |
c6a1db6c | 887 | sizeof (standard_tree_code_length)); |
4c9a05bc | 888 | bcopy ((char *) standard_tree_code_name, (char *) tree_code_name, |
c6a1db6c RS |
889 | sizeof (standard_tree_code_name)); |
890 | } | |
891 | ||
892 | /* Return a newly allocated node of code CODE. | |
893 | Initialize the node's unique id and its TREE_PERMANENT flag. | |
894 | For decl and type nodes, some other fields are initialized. | |
895 | The rest of the node is initialized to zero. | |
896 | ||
897 | Achoo! I got a code in the node. */ | |
898 | ||
899 | tree | |
900 | make_node (code) | |
901 | enum tree_code code; | |
902 | { | |
903 | register tree t; | |
904 | register int type = TREE_CODE_CLASS (code); | |
905 | register int length; | |
906 | register struct obstack *obstack = current_obstack; | |
907 | register int i; | |
908 | register tree_node_kind kind; | |
909 | ||
910 | switch (type) | |
911 | { | |
912 | case 'd': /* A decl node */ | |
913 | #ifdef GATHER_STATISTICS | |
914 | kind = d_kind; | |
915 | #endif | |
916 | length = sizeof (struct tree_decl); | |
917 | /* All decls in an inline function need to be saved. */ | |
918 | if (obstack != &permanent_obstack) | |
919 | obstack = saveable_obstack; | |
f52b5958 RK |
920 | |
921 | /* PARM_DECLs go on the context of the parent. If this is a nested | |
922 | function, then we must allocate the PARM_DECL on the parent's | |
923 | obstack, so that they will live to the end of the parent's | |
9faa82d8 | 924 | closing brace. This is necessary in case we try to inline the |
f52b5958 RK |
925 | function into its parent. |
926 | ||
927 | PARM_DECLs of top-level functions do not have this problem. However, | |
9faa82d8 | 928 | we allocate them where we put the FUNCTION_DECL for languages such as |
f52b5958 | 929 | Ada that need to consult some flags in the PARM_DECLs of the function |
19e7d354 RK |
930 | when calling it. |
931 | ||
932 | See comment in restore_tree_status for why we can't put this | |
933 | in function_obstack. */ | |
934 | if (code == PARM_DECL && obstack != &permanent_obstack) | |
e97b2a1c JW |
935 | { |
936 | tree context = 0; | |
937 | if (current_function_decl) | |
938 | context = decl_function_context (current_function_decl); | |
f52b5958 | 939 | |
e97b2a1c | 940 | if (context) |
f52b5958 | 941 | obstack |
19e7d354 | 942 | = find_function_data (context)->function_maybepermanent_obstack; |
e97b2a1c | 943 | } |
c6a1db6c RS |
944 | break; |
945 | ||
946 | case 't': /* a type node */ | |
947 | #ifdef GATHER_STATISTICS | |
948 | kind = t_kind; | |
949 | #endif | |
950 | length = sizeof (struct tree_type); | |
951 | /* All data types are put where we can preserve them if nec. */ | |
952 | if (obstack != &permanent_obstack) | |
953 | obstack = all_types_permanent ? &permanent_obstack : saveable_obstack; | |
954 | break; | |
955 | ||
03646189 RS |
956 | case 'b': /* a lexical block */ |
957 | #ifdef GATHER_STATISTICS | |
958 | kind = b_kind; | |
959 | #endif | |
960 | length = sizeof (struct tree_block); | |
961 | /* All BLOCK nodes are put where we can preserve them if nec. */ | |
962 | if (obstack != &permanent_obstack) | |
963 | obstack = saveable_obstack; | |
964 | break; | |
965 | ||
c6a1db6c RS |
966 | case 's': /* an expression with side effects */ |
967 | #ifdef GATHER_STATISTICS | |
968 | kind = s_kind; | |
969 | goto usual_kind; | |
970 | #endif | |
971 | case 'r': /* a reference */ | |
972 | #ifdef GATHER_STATISTICS | |
973 | kind = r_kind; | |
974 | goto usual_kind; | |
975 | #endif | |
976 | case 'e': /* an expression */ | |
977 | case '<': /* a comparison expression */ | |
978 | case '1': /* a unary arithmetic expression */ | |
979 | case '2': /* a binary arithmetic expression */ | |
980 | #ifdef GATHER_STATISTICS | |
981 | kind = e_kind; | |
982 | usual_kind: | |
983 | #endif | |
984 | obstack = expression_obstack; | |
03646189 RS |
985 | /* All BIND_EXPR nodes are put where we can preserve them if nec. */ |
986 | if (code == BIND_EXPR && obstack != &permanent_obstack) | |
c6a1db6c RS |
987 | obstack = saveable_obstack; |
988 | length = sizeof (struct tree_exp) | |
989 | + (tree_code_length[(int) code] - 1) * sizeof (char *); | |
990 | break; | |
991 | ||
992 | case 'c': /* a constant */ | |
993 | #ifdef GATHER_STATISTICS | |
994 | kind = c_kind; | |
995 | #endif | |
996 | obstack = expression_obstack; | |
66212c2f RK |
997 | |
998 | /* We can't use tree_code_length for INTEGER_CST, since the number of | |
999 | words is machine-dependent due to varying length of HOST_WIDE_INT, | |
1000 | which might be wider than a pointer (e.g., long long). Similarly | |
1001 | for REAL_CST, since the number of words is machine-dependent due | |
1002 | to varying size and alignment of `double'. */ | |
1003 | ||
1004 | if (code == INTEGER_CST) | |
1005 | length = sizeof (struct tree_int_cst); | |
1006 | else if (code == REAL_CST) | |
1007 | length = sizeof (struct tree_real_cst); | |
1008 | else | |
1009 | length = sizeof (struct tree_common) | |
1010 | + tree_code_length[(int) code] * sizeof (char *); | |
1011 | break; | |
c6a1db6c RS |
1012 | |
1013 | case 'x': /* something random, like an identifier. */ | |
1014 | #ifdef GATHER_STATISTICS | |
1015 | if (code == IDENTIFIER_NODE) | |
1016 | kind = id_kind; | |
1017 | else if (code == OP_IDENTIFIER) | |
1018 | kind = op_id_kind; | |
1019 | else if (code == TREE_VEC) | |
1020 | kind = vec_kind; | |
1021 | else | |
1022 | kind = x_kind; | |
1023 | #endif | |
1024 | length = sizeof (struct tree_common) | |
1025 | + tree_code_length[(int) code] * sizeof (char *); | |
1026 | /* Identifier nodes are always permanent since they are | |
1027 | unique in a compiler run. */ | |
1028 | if (code == IDENTIFIER_NODE) obstack = &permanent_obstack; | |
a7fcb968 RK |
1029 | break; |
1030 | ||
1031 | default: | |
1032 | abort (); | |
c6a1db6c RS |
1033 | } |
1034 | ||
1035 | t = (tree) obstack_alloc (obstack, length); | |
1036 | ||
1037 | #ifdef GATHER_STATISTICS | |
1038 | tree_node_counts[(int)kind]++; | |
1039 | tree_node_sizes[(int)kind] += length; | |
1040 | #endif | |
1041 | ||
2f145821 | 1042 | /* Clear a word at a time. */ |
d5ebacaf | 1043 | for (i = (length / sizeof (int)) - 1; i >= 0; i--) |
c6a1db6c | 1044 | ((int *) t)[i] = 0; |
2f145821 RS |
1045 | /* Clear any extra bytes. */ |
1046 | for (i = length / sizeof (int) * sizeof (int); i < length; i++) | |
1047 | ((char *) t)[i] = 0; | |
c6a1db6c RS |
1048 | |
1049 | TREE_SET_CODE (t, code); | |
1050 | if (obstack == &permanent_obstack) | |
1051 | TREE_PERMANENT (t) = 1; | |
1052 | ||
1053 | switch (type) | |
1054 | { | |
1055 | case 's': | |
1056 | TREE_SIDE_EFFECTS (t) = 1; | |
1057 | TREE_TYPE (t) = void_type_node; | |
1058 | break; | |
1059 | ||
1060 | case 'd': | |
c0920bf9 | 1061 | if (code != FUNCTION_DECL) |
c7ee7249 | 1062 | DECL_ALIGN (t) = 1; |
cfd6bb3d RS |
1063 | DECL_IN_SYSTEM_HEADER (t) |
1064 | = in_system_header && (obstack == &permanent_obstack); | |
c6a1db6c RS |
1065 | DECL_SOURCE_LINE (t) = lineno; |
1066 | DECL_SOURCE_FILE (t) = (input_filename) ? input_filename : "<built-in>"; | |
0e77444b | 1067 | DECL_UID (t) = next_decl_uid++; |
c6a1db6c RS |
1068 | break; |
1069 | ||
1070 | case 't': | |
579f50b6 | 1071 | TYPE_UID (t) = next_type_uid++; |
c6a1db6c RS |
1072 | TYPE_ALIGN (t) = 1; |
1073 | TYPE_MAIN_VARIANT (t) = t; | |
d9cbc259 | 1074 | TYPE_OBSTACK (t) = obstack; |
91e97eb8 RK |
1075 | TYPE_ATTRIBUTES (t) = NULL_TREE; |
1076 | #ifdef SET_DEFAULT_TYPE_ATTRIBUTES | |
1077 | SET_DEFAULT_TYPE_ATTRIBUTES (t); | |
1078 | #endif | |
c6a1db6c RS |
1079 | break; |
1080 | ||
1081 | case 'c': | |
1082 | TREE_CONSTANT (t) = 1; | |
1083 | break; | |
1084 | } | |
1085 | ||
1086 | return t; | |
1087 | } | |
1088 | \f | |
1089 | /* Return a new node with the same contents as NODE | |
1090 | except that its TREE_CHAIN is zero and it has a fresh uid. */ | |
1091 | ||
1092 | tree | |
1093 | copy_node (node) | |
1094 | tree node; | |
1095 | { | |
1096 | register tree t; | |
1097 | register enum tree_code code = TREE_CODE (node); | |
1098 | register int length; | |
1099 | register int i; | |
1100 | ||
1101 | switch (TREE_CODE_CLASS (code)) | |
1102 | { | |
1103 | case 'd': /* A decl node */ | |
1104 | length = sizeof (struct tree_decl); | |
1105 | break; | |
1106 | ||
1107 | case 't': /* a type node */ | |
1108 | length = sizeof (struct tree_type); | |
1109 | break; | |
1110 | ||
03646189 RS |
1111 | case 'b': /* a lexical block node */ |
1112 | length = sizeof (struct tree_block); | |
1113 | break; | |
1114 | ||
c6a1db6c | 1115 | case 'r': /* a reference */ |
858a47b1 | 1116 | case 'e': /* an expression */ |
c6a1db6c RS |
1117 | case 's': /* an expression with side effects */ |
1118 | case '<': /* a comparison expression */ | |
1119 | case '1': /* a unary arithmetic expression */ | |
1120 | case '2': /* a binary arithmetic expression */ | |
1121 | length = sizeof (struct tree_exp) | |
1122 | + (tree_code_length[(int) code] - 1) * sizeof (char *); | |
1123 | break; | |
1124 | ||
1125 | case 'c': /* a constant */ | |
49b08aba RK |
1126 | /* We can't use tree_code_length for INTEGER_CST, since the number of |
1127 | words is machine-dependent due to varying length of HOST_WIDE_INT, | |
1128 | which might be wider than a pointer (e.g., long long). Similarly | |
1129 | for REAL_CST, since the number of words is machine-dependent due | |
1130 | to varying size and alignment of `double'. */ | |
1131 | if (code == INTEGER_CST) | |
1132 | { | |
1133 | length = sizeof (struct tree_int_cst); | |
1134 | break; | |
1135 | } | |
1136 | else if (code == REAL_CST) | |
c6a1db6c RS |
1137 | { |
1138 | length = sizeof (struct tree_real_cst); | |
1139 | break; | |
1140 | } | |
1141 | ||
1142 | case 'x': /* something random, like an identifier. */ | |
1143 | length = sizeof (struct tree_common) | |
1144 | + tree_code_length[(int) code] * sizeof (char *); | |
1145 | if (code == TREE_VEC) | |
1146 | length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *); | |
1147 | } | |
1148 | ||
1149 | t = (tree) obstack_alloc (current_obstack, length); | |
1150 | ||
508f8149 | 1151 | for (i = (length / sizeof (int)) - 1; i >= 0; i--) |
c6a1db6c | 1152 | ((int *) t)[i] = ((int *) node)[i]; |
2f145821 RS |
1153 | /* Clear any extra bytes. */ |
1154 | for (i = length / sizeof (int) * sizeof (int); i < length; i++) | |
11b459cf | 1155 | ((char *) t)[i] = ((char *) node)[i]; |
c6a1db6c RS |
1156 | |
1157 | TREE_CHAIN (t) = 0; | |
1158 | ||
579f50b6 RK |
1159 | if (TREE_CODE_CLASS (code) == 'd') |
1160 | DECL_UID (t) = next_decl_uid++; | |
1161 | else if (TREE_CODE_CLASS (code) == 't') | |
d9cbc259 RK |
1162 | { |
1163 | TYPE_UID (t) = next_type_uid++; | |
1164 | TYPE_OBSTACK (t) = current_obstack; | |
1165 | } | |
579f50b6 | 1166 | |
c6a1db6c RS |
1167 | TREE_PERMANENT (t) = (current_obstack == &permanent_obstack); |
1168 | ||
1169 | return t; | |
1170 | } | |
1171 | ||
1172 | /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field. | |
1173 | For example, this can copy a list made of TREE_LIST nodes. */ | |
1174 | ||
1175 | tree | |
1176 | copy_list (list) | |
1177 | tree list; | |
1178 | { | |
1179 | tree head; | |
1180 | register tree prev, next; | |
1181 | ||
1182 | if (list == 0) | |
1183 | return 0; | |
1184 | ||
1185 | head = prev = copy_node (list); | |
1186 | next = TREE_CHAIN (list); | |
1187 | while (next) | |
1188 | { | |
1189 | TREE_CHAIN (prev) = copy_node (next); | |
1190 | prev = TREE_CHAIN (prev); | |
1191 | next = TREE_CHAIN (next); | |
1192 | } | |
1193 | return head; | |
1194 | } | |
1195 | \f | |
1196 | #define HASHBITS 30 | |
1197 | ||
1198 | /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string). | |
1199 | If an identifier with that name has previously been referred to, | |
1200 | the same node is returned this time. */ | |
1201 | ||
1202 | tree | |
1203 | get_identifier (text) | |
1204 | register char *text; | |
1205 | { | |
1206 | register int hi; | |
1207 | register int i; | |
1208 | register tree idp; | |
1209 | register int len, hash_len; | |
1210 | ||
1211 | /* Compute length of text in len. */ | |
1212 | for (len = 0; text[len]; len++); | |
1213 | ||
1214 | /* Decide how much of that length to hash on */ | |
1215 | hash_len = len; | |
1216 | if (warn_id_clash && len > id_clash_len) | |
1217 | hash_len = id_clash_len; | |
1218 | ||
1219 | /* Compute hash code */ | |
1220 | hi = hash_len * 613 + (unsigned)text[0]; | |
1221 | for (i = 1; i < hash_len; i += 2) | |
1222 | hi = ((hi * 613) + (unsigned)(text[i])); | |
1223 | ||
1224 | hi &= (1 << HASHBITS) - 1; | |
1225 | hi %= MAX_HASH_TABLE; | |
1226 | ||
1227 | /* Search table for identifier */ | |
1228 | for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) | |
1229 | if (IDENTIFIER_LENGTH (idp) == len | |
1230 | && IDENTIFIER_POINTER (idp)[0] == text[0] | |
1231 | && !bcmp (IDENTIFIER_POINTER (idp), text, len)) | |
1232 | return idp; /* <-- return if found */ | |
1233 | ||
1234 | /* Not found; optionally warn about a similar identifier */ | |
1235 | if (warn_id_clash && do_identifier_warnings && len >= id_clash_len) | |
1236 | for (idp = hash_table[hi]; idp; idp = TREE_CHAIN (idp)) | |
1237 | if (!strncmp (IDENTIFIER_POINTER (idp), text, id_clash_len)) | |
1238 | { | |
1239 | warning ("`%s' and `%s' identical in first %d characters", | |
1240 | IDENTIFIER_POINTER (idp), text, id_clash_len); | |
1241 | break; | |
1242 | } | |
1243 | ||
1244 | if (tree_code_length[(int) IDENTIFIER_NODE] < 0) | |
1245 | abort (); /* set_identifier_size hasn't been called. */ | |
1246 | ||
1247 | /* Not found, create one, add to chain */ | |
1248 | idp = make_node (IDENTIFIER_NODE); | |
1249 | IDENTIFIER_LENGTH (idp) = len; | |
1250 | #ifdef GATHER_STATISTICS | |
1251 | id_string_size += len; | |
1252 | #endif | |
1253 | ||
1254 | IDENTIFIER_POINTER (idp) = obstack_copy0 (&permanent_obstack, text, len); | |
1255 | ||
1256 | TREE_CHAIN (idp) = hash_table[hi]; | |
1257 | hash_table[hi] = idp; | |
1258 | return idp; /* <-- return if created */ | |
1259 | } | |
1260 | ||
1261 | /* Enable warnings on similar identifiers (if requested). | |
1262 | Done after the built-in identifiers are created. */ | |
1263 | ||
1264 | void | |
1265 | start_identifier_warnings () | |
1266 | { | |
1267 | do_identifier_warnings = 1; | |
1268 | } | |
1269 | ||
1270 | /* Record the size of an identifier node for the language in use. | |
1271 | SIZE is the total size in bytes. | |
1272 | This is called by the language-specific files. This must be | |
1273 | called before allocating any identifiers. */ | |
1274 | ||
1275 | void | |
1276 | set_identifier_size (size) | |
1277 | int size; | |
1278 | { | |
1279 | tree_code_length[(int) IDENTIFIER_NODE] | |
1280 | = (size - sizeof (struct tree_common)) / sizeof (tree); | |
1281 | } | |
1282 | \f | |
1283 | /* Return a newly constructed INTEGER_CST node whose constant value | |
1284 | is specified by the two ints LOW and HI. | |
37366632 RK |
1285 | The TREE_TYPE is set to `int'. |
1286 | ||
1287 | This function should be used via the `build_int_2' macro. */ | |
c6a1db6c RS |
1288 | |
1289 | tree | |
37366632 RK |
1290 | build_int_2_wide (low, hi) |
1291 | HOST_WIDE_INT low, hi; | |
c6a1db6c RS |
1292 | { |
1293 | register tree t = make_node (INTEGER_CST); | |
1294 | TREE_INT_CST_LOW (t) = low; | |
1295 | TREE_INT_CST_HIGH (t) = hi; | |
1296 | TREE_TYPE (t) = integer_type_node; | |
1297 | return t; | |
1298 | } | |
1299 | ||
1300 | /* Return a new REAL_CST node whose type is TYPE and value is D. */ | |
1301 | ||
1302 | tree | |
1303 | build_real (type, d) | |
1304 | tree type; | |
1305 | REAL_VALUE_TYPE d; | |
1306 | { | |
1307 | tree v; | |
0afbe93d | 1308 | int overflow = 0; |
c6a1db6c RS |
1309 | |
1310 | /* Check for valid float value for this type on this target machine; | |
1311 | if not, can print error message and store a valid value in D. */ | |
1312 | #ifdef CHECK_FLOAT_VALUE | |
0afbe93d | 1313 | CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow); |
c6a1db6c RS |
1314 | #endif |
1315 | ||
1316 | v = make_node (REAL_CST); | |
1317 | TREE_TYPE (v) = type; | |
1318 | TREE_REAL_CST (v) = d; | |
0afbe93d | 1319 | TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow; |
c6a1db6c RS |
1320 | return v; |
1321 | } | |
1322 | ||
1323 | /* Return a new REAL_CST node whose type is TYPE | |
1324 | and whose value is the integer value of the INTEGER_CST node I. */ | |
1325 | ||
1326 | #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC) | |
1327 | ||
1328 | REAL_VALUE_TYPE | |
1329 | real_value_from_int_cst (i) | |
1330 | tree i; | |
1331 | { | |
1332 | REAL_VALUE_TYPE d; | |
2026444a RS |
1333 | REAL_VALUE_TYPE e; |
1334 | /* Some 386 compilers mishandle unsigned int to float conversions, | |
1335 | so introduce a temporary variable E to avoid those bugs. */ | |
1336 | ||
c6a1db6c | 1337 | #ifdef REAL_ARITHMETIC |
15c76378 RS |
1338 | if (! TREE_UNSIGNED (TREE_TYPE (i))) |
1339 | REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i)); | |
1340 | else | |
1341 | REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i)); | |
c6a1db6c | 1342 | #else /* not REAL_ARITHMETIC */ |
db7e5239 | 1343 | if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i))) |
c6a1db6c RS |
1344 | { |
1345 | d = (double) (~ TREE_INT_CST_HIGH (i)); | |
2026444a | 1346 | e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) |
37366632 | 1347 | * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))); |
2026444a RS |
1348 | d *= e; |
1349 | e = (double) (unsigned HOST_WIDE_INT) (~ TREE_INT_CST_LOW (i)); | |
1350 | d += e; | |
c6a1db6c RS |
1351 | d = (- d - 1.0); |
1352 | } | |
1353 | else | |
1354 | { | |
db7e5239 | 1355 | d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i); |
2026444a | 1356 | e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)) |
37366632 | 1357 | * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))); |
2026444a RS |
1358 | d *= e; |
1359 | e = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_LOW (i); | |
1360 | d += e; | |
c6a1db6c RS |
1361 | } |
1362 | #endif /* not REAL_ARITHMETIC */ | |
1363 | return d; | |
1364 | } | |
1365 | ||
1366 | /* This function can't be implemented if we can't do arithmetic | |
1367 | on the float representation. */ | |
1368 | ||
1369 | tree | |
1370 | build_real_from_int_cst (type, i) | |
1371 | tree type; | |
1372 | tree i; | |
1373 | { | |
1374 | tree v; | |
53d74c3c | 1375 | int overflow = TREE_OVERFLOW (i); |
c6a1db6c | 1376 | REAL_VALUE_TYPE d; |
53d74c3c | 1377 | jmp_buf float_error; |
c6a1db6c RS |
1378 | |
1379 | v = make_node (REAL_CST); | |
1380 | TREE_TYPE (v) = type; | |
1381 | ||
53d74c3c RK |
1382 | if (setjmp (float_error)) |
1383 | { | |
1384 | d = dconst0; | |
1385 | overflow = 1; | |
1386 | goto got_it; | |
1387 | } | |
1388 | ||
1389 | set_float_handler (float_error); | |
1390 | ||
db7e5239 | 1391 | d = REAL_VALUE_TRUNCATE (TYPE_MODE (type), real_value_from_int_cst (i)); |
53d74c3c RK |
1392 | |
1393 | /* Check for valid float value for this type on this target machine. */ | |
1394 | ||
1395 | got_it: | |
1396 | set_float_handler (NULL_PTR); | |
1397 | ||
c6a1db6c | 1398 | #ifdef CHECK_FLOAT_VALUE |
53d74c3c | 1399 | CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow); |
c6a1db6c RS |
1400 | #endif |
1401 | ||
1402 | TREE_REAL_CST (v) = d; | |
53d74c3c | 1403 | TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow; |
c6a1db6c RS |
1404 | return v; |
1405 | } | |
1406 | ||
1407 | #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */ | |
1408 | ||
1409 | /* Return a newly constructed STRING_CST node whose value is | |
1410 | the LEN characters at STR. | |
1411 | The TREE_TYPE is not initialized. */ | |
1412 | ||
1413 | tree | |
1414 | build_string (len, str) | |
1415 | int len; | |
1416 | char *str; | |
1417 | { | |
526a6253 RK |
1418 | /* Put the string in saveable_obstack since it will be placed in the RTL |
1419 | for an "asm" statement and will also be kept around a while if | |
1420 | deferring constant output in varasm.c. */ | |
1421 | ||
c6a1db6c RS |
1422 | register tree s = make_node (STRING_CST); |
1423 | TREE_STRING_LENGTH (s) = len; | |
526a6253 | 1424 | TREE_STRING_POINTER (s) = obstack_copy0 (saveable_obstack, str, len); |
c6a1db6c RS |
1425 | return s; |
1426 | } | |
1427 | ||
1428 | /* Return a newly constructed COMPLEX_CST node whose value is | |
1429 | specified by the real and imaginary parts REAL and IMAG. | |
1430 | Both REAL and IMAG should be constant nodes. | |
1431 | The TREE_TYPE is not initialized. */ | |
1432 | ||
1433 | tree | |
1434 | build_complex (real, imag) | |
1435 | tree real, imag; | |
1436 | { | |
1437 | register tree t = make_node (COMPLEX_CST); | |
53d74c3c | 1438 | |
c6a1db6c RS |
1439 | TREE_REALPART (t) = real; |
1440 | TREE_IMAGPART (t) = imag; | |
8e27715a | 1441 | TREE_TYPE (t) = build_complex_type (TREE_TYPE (real)); |
53d74c3c RK |
1442 | TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag); |
1443 | TREE_CONSTANT_OVERFLOW (t) | |
1444 | = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag); | |
c6a1db6c RS |
1445 | return t; |
1446 | } | |
1447 | ||
1448 | /* Build a newly constructed TREE_VEC node of length LEN. */ | |
1449 | tree | |
1450 | make_tree_vec (len) | |
1451 | int len; | |
1452 | { | |
1453 | register tree t; | |
1454 | register int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec); | |
1455 | register struct obstack *obstack = current_obstack; | |
1456 | register int i; | |
1457 | ||
1458 | #ifdef GATHER_STATISTICS | |
1459 | tree_node_counts[(int)vec_kind]++; | |
1460 | tree_node_sizes[(int)vec_kind] += length; | |
1461 | #endif | |
1462 | ||
1463 | t = (tree) obstack_alloc (obstack, length); | |
1464 | ||
508f8149 | 1465 | for (i = (length / sizeof (int)) - 1; i >= 0; i--) |
c6a1db6c | 1466 | ((int *) t)[i] = 0; |
508f8149 | 1467 | |
c6a1db6c RS |
1468 | TREE_SET_CODE (t, TREE_VEC); |
1469 | TREE_VEC_LENGTH (t) = len; | |
1470 | if (obstack == &permanent_obstack) | |
1471 | TREE_PERMANENT (t) = 1; | |
1472 | ||
1473 | return t; | |
1474 | } | |
1475 | \f | |
9ad265b0 RK |
1476 | /* Return 1 if EXPR is the integer constant zero or a complex constant |
1477 | of zero. */ | |
c6a1db6c RS |
1478 | |
1479 | int | |
1480 | integer_zerop (expr) | |
1481 | tree expr; | |
1482 | { | |
d964285c | 1483 | STRIP_NOPS (expr); |
c6a1db6c | 1484 | |
9ad265b0 RK |
1485 | return ((TREE_CODE (expr) == INTEGER_CST |
1486 | && TREE_INT_CST_LOW (expr) == 0 | |
1487 | && TREE_INT_CST_HIGH (expr) == 0) | |
1488 | || (TREE_CODE (expr) == COMPLEX_CST | |
1489 | && integer_zerop (TREE_REALPART (expr)) | |
1490 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1491 | } |
1492 | ||
9ad265b0 RK |
1493 | /* Return 1 if EXPR is the integer constant one or the corresponding |
1494 | complex constant. */ | |
c6a1db6c RS |
1495 | |
1496 | int | |
1497 | integer_onep (expr) | |
1498 | tree expr; | |
1499 | { | |
d964285c | 1500 | STRIP_NOPS (expr); |
c6a1db6c | 1501 | |
9ad265b0 RK |
1502 | return ((TREE_CODE (expr) == INTEGER_CST |
1503 | && TREE_INT_CST_LOW (expr) == 1 | |
1504 | && TREE_INT_CST_HIGH (expr) == 0) | |
1505 | || (TREE_CODE (expr) == COMPLEX_CST | |
1506 | && integer_onep (TREE_REALPART (expr)) | |
1507 | && integer_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1508 | } |
1509 | ||
9ad265b0 RK |
1510 | /* Return 1 if EXPR is an integer containing all 1's in as much precision as |
1511 | it contains. Likewise for the corresponding complex constant. */ | |
c6a1db6c RS |
1512 | |
1513 | int | |
1514 | integer_all_onesp (expr) | |
1515 | tree expr; | |
1516 | { | |
1517 | register int prec; | |
1518 | register int uns; | |
1519 | ||
d964285c | 1520 | STRIP_NOPS (expr); |
c6a1db6c | 1521 | |
9ad265b0 RK |
1522 | if (TREE_CODE (expr) == COMPLEX_CST |
1523 | && integer_all_onesp (TREE_REALPART (expr)) | |
1524 | && integer_zerop (TREE_IMAGPART (expr))) | |
1525 | return 1; | |
1526 | ||
1527 | else if (TREE_CODE (expr) != INTEGER_CST) | |
c6a1db6c RS |
1528 | return 0; |
1529 | ||
1530 | uns = TREE_UNSIGNED (TREE_TYPE (expr)); | |
1531 | if (!uns) | |
1532 | return TREE_INT_CST_LOW (expr) == -1 && TREE_INT_CST_HIGH (expr) == -1; | |
1533 | ||
8980b5a3 RK |
1534 | /* Note that using TYPE_PRECISION here is wrong. We care about the |
1535 | actual bits, not the (arbitrary) range of the type. */ | |
1536 | prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr))); | |
37366632 | 1537 | if (prec >= HOST_BITS_PER_WIDE_INT) |
c6a1db6c RS |
1538 | { |
1539 | int high_value, shift_amount; | |
1540 | ||
37366632 | 1541 | shift_amount = prec - HOST_BITS_PER_WIDE_INT; |
c6a1db6c | 1542 | |
37366632 | 1543 | if (shift_amount > HOST_BITS_PER_WIDE_INT) |
c6a1db6c RS |
1544 | /* Can not handle precisions greater than twice the host int size. */ |
1545 | abort (); | |
37366632 | 1546 | else if (shift_amount == HOST_BITS_PER_WIDE_INT) |
c6a1db6c RS |
1547 | /* Shifting by the host word size is undefined according to the ANSI |
1548 | standard, so we must handle this as a special case. */ | |
1549 | high_value = -1; | |
1550 | else | |
37366632 | 1551 | high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1; |
c6a1db6c RS |
1552 | |
1553 | return TREE_INT_CST_LOW (expr) == -1 | |
1554 | && TREE_INT_CST_HIGH (expr) == high_value; | |
1555 | } | |
1556 | else | |
37366632 | 1557 | return TREE_INT_CST_LOW (expr) == ((HOST_WIDE_INT) 1 << prec) - 1; |
c6a1db6c RS |
1558 | } |
1559 | ||
1560 | /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only | |
1561 | one bit on). */ | |
1562 | ||
1563 | int | |
1564 | integer_pow2p (expr) | |
1565 | tree expr; | |
1566 | { | |
37366632 | 1567 | HOST_WIDE_INT high, low; |
c6a1db6c | 1568 | |
d964285c | 1569 | STRIP_NOPS (expr); |
c6a1db6c | 1570 | |
9ad265b0 RK |
1571 | if (TREE_CODE (expr) == COMPLEX_CST |
1572 | && integer_pow2p (TREE_REALPART (expr)) | |
1573 | && integer_zerop (TREE_IMAGPART (expr))) | |
1574 | return 1; | |
1575 | ||
c6a1db6c RS |
1576 | if (TREE_CODE (expr) != INTEGER_CST) |
1577 | return 0; | |
1578 | ||
1579 | high = TREE_INT_CST_HIGH (expr); | |
1580 | low = TREE_INT_CST_LOW (expr); | |
1581 | ||
1582 | if (high == 0 && low == 0) | |
1583 | return 0; | |
1584 | ||
1585 | return ((high == 0 && (low & (low - 1)) == 0) | |
1586 | || (low == 0 && (high & (high - 1)) == 0)); | |
1587 | } | |
1588 | ||
1589 | /* Return 1 if EXPR is the real constant zero. */ | |
1590 | ||
1591 | int | |
1592 | real_zerop (expr) | |
1593 | tree expr; | |
1594 | { | |
d964285c | 1595 | STRIP_NOPS (expr); |
c6a1db6c | 1596 | |
9ad265b0 RK |
1597 | return ((TREE_CODE (expr) == REAL_CST |
1598 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0)) | |
1599 | || (TREE_CODE (expr) == COMPLEX_CST | |
1600 | && real_zerop (TREE_REALPART (expr)) | |
1601 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1602 | } |
1603 | ||
9ad265b0 | 1604 | /* Return 1 if EXPR is the real constant one in real or complex form. */ |
c6a1db6c RS |
1605 | |
1606 | int | |
1607 | real_onep (expr) | |
1608 | tree expr; | |
1609 | { | |
d964285c | 1610 | STRIP_NOPS (expr); |
c6a1db6c | 1611 | |
9ad265b0 RK |
1612 | return ((TREE_CODE (expr) == REAL_CST |
1613 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1)) | |
1614 | || (TREE_CODE (expr) == COMPLEX_CST | |
1615 | && real_onep (TREE_REALPART (expr)) | |
1616 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1617 | } |
1618 | ||
1619 | /* Return 1 if EXPR is the real constant two. */ | |
1620 | ||
1621 | int | |
1622 | real_twop (expr) | |
1623 | tree expr; | |
1624 | { | |
d964285c | 1625 | STRIP_NOPS (expr); |
c6a1db6c | 1626 | |
9ad265b0 RK |
1627 | return ((TREE_CODE (expr) == REAL_CST |
1628 | && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2)) | |
1629 | || (TREE_CODE (expr) == COMPLEX_CST | |
1630 | && real_twop (TREE_REALPART (expr)) | |
1631 | && real_zerop (TREE_IMAGPART (expr)))); | |
c6a1db6c RS |
1632 | } |
1633 | ||
1634 | /* Nonzero if EXP is a constant or a cast of a constant. */ | |
1635 | ||
1636 | int | |
1637 | really_constant_p (exp) | |
1638 | tree exp; | |
1639 | { | |
d964285c | 1640 | /* This is not quite the same as STRIP_NOPS. It does more. */ |
c6a1db6c RS |
1641 | while (TREE_CODE (exp) == NOP_EXPR |
1642 | || TREE_CODE (exp) == CONVERT_EXPR | |
1643 | || TREE_CODE (exp) == NON_LVALUE_EXPR) | |
1644 | exp = TREE_OPERAND (exp, 0); | |
1645 | return TREE_CONSTANT (exp); | |
1646 | } | |
1647 | \f | |
1648 | /* Return first list element whose TREE_VALUE is ELEM. | |
2a3c15b5 | 1649 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1650 | |
1651 | tree | |
1652 | value_member (elem, list) | |
1653 | tree elem, list; | |
1654 | { | |
1655 | while (list) | |
1656 | { | |
1657 | if (elem == TREE_VALUE (list)) | |
1658 | return list; | |
1659 | list = TREE_CHAIN (list); | |
1660 | } | |
1661 | return NULL_TREE; | |
1662 | } | |
1663 | ||
1664 | /* Return first list element whose TREE_PURPOSE is ELEM. | |
2a3c15b5 | 1665 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1666 | |
1667 | tree | |
1668 | purpose_member (elem, list) | |
1669 | tree elem, list; | |
1670 | { | |
1671 | while (list) | |
1672 | { | |
1673 | if (elem == TREE_PURPOSE (list)) | |
1674 | return list; | |
1675 | list = TREE_CHAIN (list); | |
1676 | } | |
1677 | return NULL_TREE; | |
1678 | } | |
1679 | ||
1680 | /* Return first list element whose BINFO_TYPE is ELEM. | |
2a3c15b5 | 1681 | Return 0 if ELEM is not in LIST. */ |
c6a1db6c RS |
1682 | |
1683 | tree | |
1684 | binfo_member (elem, list) | |
1685 | tree elem, list; | |
1686 | { | |
1687 | while (list) | |
1688 | { | |
1689 | if (elem == BINFO_TYPE (list)) | |
1690 | return list; | |
1691 | list = TREE_CHAIN (list); | |
1692 | } | |
1693 | return NULL_TREE; | |
1694 | } | |
1695 | ||
1a2927d2 | 1696 | /* Return nonzero if ELEM is part of the chain CHAIN. */ |
c6a1db6c RS |
1697 | |
1698 | int | |
1699 | chain_member (elem, chain) | |
1700 | tree elem, chain; | |
1701 | { | |
1702 | while (chain) | |
1703 | { | |
1704 | if (elem == chain) | |
1705 | return 1; | |
1706 | chain = TREE_CHAIN (chain); | |
1707 | } | |
1708 | ||
1709 | return 0; | |
1710 | } | |
1711 | ||
1a2927d2 RK |
1712 | /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of |
1713 | chain CHAIN. */ | |
2a3c15b5 DE |
1714 | /* ??? This function was added for machine specific attributes but is no |
1715 | longer used. It could be deleted if we could confirm all front ends | |
1716 | don't use it. */ | |
1a2927d2 RK |
1717 | |
1718 | int | |
1719 | chain_member_value (elem, chain) | |
1720 | tree elem, chain; | |
1721 | { | |
1722 | while (chain) | |
1723 | { | |
1724 | if (elem == TREE_VALUE (chain)) | |
1725 | return 1; | |
1726 | chain = TREE_CHAIN (chain); | |
1727 | } | |
1728 | ||
1729 | return 0; | |
1730 | } | |
1731 | ||
33a79dfa | 1732 | /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN) |
0bcec367 | 1733 | for any piece of chain CHAIN. */ |
2a3c15b5 DE |
1734 | /* ??? This function was added for machine specific attributes but is no |
1735 | longer used. It could be deleted if we could confirm all front ends | |
1736 | don't use it. */ | |
0bcec367 RK |
1737 | |
1738 | int | |
1739 | chain_member_purpose (elem, chain) | |
1740 | tree elem, chain; | |
1741 | { | |
0bcec367 RK |
1742 | while (chain) |
1743 | { | |
33a79dfa | 1744 | if (elem == TREE_PURPOSE (chain)) |
0bcec367 RK |
1745 | return 1; |
1746 | chain = TREE_CHAIN (chain); | |
1747 | } | |
1748 | ||
1749 | return 0; | |
1750 | } | |
1751 | ||
c6a1db6c RS |
1752 | /* Return the length of a chain of nodes chained through TREE_CHAIN. |
1753 | We expect a null pointer to mark the end of the chain. | |
1754 | This is the Lisp primitive `length'. */ | |
1755 | ||
1756 | int | |
1757 | list_length (t) | |
1758 | tree t; | |
1759 | { | |
1760 | register tree tail; | |
1761 | register int len = 0; | |
1762 | ||
1763 | for (tail = t; tail; tail = TREE_CHAIN (tail)) | |
1764 | len++; | |
1765 | ||
1766 | return len; | |
1767 | } | |
1768 | ||
1769 | /* Concatenate two chains of nodes (chained through TREE_CHAIN) | |
1770 | by modifying the last node in chain 1 to point to chain 2. | |
1771 | This is the Lisp primitive `nconc'. */ | |
1772 | ||
1773 | tree | |
1774 | chainon (op1, op2) | |
1775 | tree op1, op2; | |
1776 | { | |
c6a1db6c RS |
1777 | |
1778 | if (op1) | |
1779 | { | |
1810c3fa RK |
1780 | register tree t1; |
1781 | register tree t2; | |
1782 | ||
1783 | for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1)) | |
1784 | ; | |
1785 | TREE_CHAIN (t1) = op2; | |
1786 | for (t2 = op2; t2; t2 = TREE_CHAIN (t2)) | |
1787 | if (t2 == t1) | |
1788 | abort (); /* Circularity created. */ | |
c6a1db6c RS |
1789 | return op1; |
1790 | } | |
1791 | else return op2; | |
1792 | } | |
1793 | ||
1794 | /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */ | |
1795 | ||
1796 | tree | |
1797 | tree_last (chain) | |
1798 | register tree chain; | |
1799 | { | |
1800 | register tree next; | |
1801 | if (chain) | |
1802 | while (next = TREE_CHAIN (chain)) | |
1803 | chain = next; | |
1804 | return chain; | |
1805 | } | |
1806 | ||
1807 | /* Reverse the order of elements in the chain T, | |
1808 | and return the new head of the chain (old last element). */ | |
1809 | ||
1810 | tree | |
1811 | nreverse (t) | |
1812 | tree t; | |
1813 | { | |
1814 | register tree prev = 0, decl, next; | |
1815 | for (decl = t; decl; decl = next) | |
1816 | { | |
1817 | next = TREE_CHAIN (decl); | |
1818 | TREE_CHAIN (decl) = prev; | |
1819 | prev = decl; | |
1820 | } | |
1821 | return prev; | |
1822 | } | |
1823 | ||
1824 | /* Given a chain CHAIN of tree nodes, | |
1825 | construct and return a list of those nodes. */ | |
1826 | ||
1827 | tree | |
1828 | listify (chain) | |
1829 | tree chain; | |
1830 | { | |
1831 | tree result = NULL_TREE; | |
1832 | tree in_tail = chain; | |
1833 | tree out_tail = NULL_TREE; | |
1834 | ||
1835 | while (in_tail) | |
1836 | { | |
1837 | tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE); | |
1838 | if (out_tail) | |
1839 | TREE_CHAIN (out_tail) = next; | |
1840 | else | |
1841 | result = next; | |
1842 | out_tail = next; | |
1843 | in_tail = TREE_CHAIN (in_tail); | |
1844 | } | |
1845 | ||
1846 | return result; | |
1847 | } | |
1848 | \f | |
1849 | /* Return a newly created TREE_LIST node whose | |
1850 | purpose and value fields are PARM and VALUE. */ | |
1851 | ||
1852 | tree | |
1853 | build_tree_list (parm, value) | |
1854 | tree parm, value; | |
1855 | { | |
1856 | register tree t = make_node (TREE_LIST); | |
1857 | TREE_PURPOSE (t) = parm; | |
1858 | TREE_VALUE (t) = value; | |
1859 | return t; | |
1860 | } | |
1861 | ||
1862 | /* Similar, but build on the temp_decl_obstack. */ | |
1863 | ||
1864 | tree | |
1865 | build_decl_list (parm, value) | |
1866 | tree parm, value; | |
1867 | { | |
1868 | register tree node; | |
1869 | register struct obstack *ambient_obstack = current_obstack; | |
1870 | current_obstack = &temp_decl_obstack; | |
1871 | node = build_tree_list (parm, value); | |
1872 | current_obstack = ambient_obstack; | |
1873 | return node; | |
1874 | } | |
1875 | ||
1876 | /* Return a newly created TREE_LIST node whose | |
1877 | purpose and value fields are PARM and VALUE | |
1878 | and whose TREE_CHAIN is CHAIN. */ | |
1879 | ||
1880 | tree | |
1881 | tree_cons (purpose, value, chain) | |
1882 | tree purpose, value, chain; | |
1883 | { | |
1884 | #if 0 | |
1885 | register tree node = make_node (TREE_LIST); | |
1886 | #else | |
1887 | register int i; | |
1888 | register tree node = (tree) obstack_alloc (current_obstack, sizeof (struct tree_list)); | |
1889 | #ifdef GATHER_STATISTICS | |
1890 | tree_node_counts[(int)x_kind]++; | |
1891 | tree_node_sizes[(int)x_kind] += sizeof (struct tree_list); | |
1892 | #endif | |
1893 | ||
508f8149 | 1894 | for (i = (sizeof (struct tree_common) / sizeof (int)) - 1; i >= 0; i--) |
e0a9b507 | 1895 | ((int *) node)[i] = 0; |
508f8149 | 1896 | |
c6a1db6c RS |
1897 | TREE_SET_CODE (node, TREE_LIST); |
1898 | if (current_obstack == &permanent_obstack) | |
1899 | TREE_PERMANENT (node) = 1; | |
c6a1db6c RS |
1900 | #endif |
1901 | ||
1902 | TREE_CHAIN (node) = chain; | |
1903 | TREE_PURPOSE (node) = purpose; | |
1904 | TREE_VALUE (node) = value; | |
1905 | return node; | |
1906 | } | |
1907 | ||
1908 | /* Similar, but build on the temp_decl_obstack. */ | |
1909 | ||
1910 | tree | |
1911 | decl_tree_cons (purpose, value, chain) | |
1912 | tree purpose, value, chain; | |
1913 | { | |
1914 | register tree node; | |
1915 | register struct obstack *ambient_obstack = current_obstack; | |
1916 | current_obstack = &temp_decl_obstack; | |
1917 | node = tree_cons (purpose, value, chain); | |
1918 | current_obstack = ambient_obstack; | |
1919 | return node; | |
1920 | } | |
1921 | ||
1922 | /* Same as `tree_cons' but make a permanent object. */ | |
1923 | ||
1924 | tree | |
1925 | perm_tree_cons (purpose, value, chain) | |
1926 | tree purpose, value, chain; | |
1927 | { | |
1928 | register tree node; | |
1929 | register struct obstack *ambient_obstack = current_obstack; | |
1930 | current_obstack = &permanent_obstack; | |
1931 | ||
1932 | node = tree_cons (purpose, value, chain); | |
1933 | current_obstack = ambient_obstack; | |
1934 | return node; | |
1935 | } | |
1936 | ||
1937 | /* Same as `tree_cons', but make this node temporary, regardless. */ | |
1938 | ||
1939 | tree | |
1940 | temp_tree_cons (purpose, value, chain) | |
1941 | tree purpose, value, chain; | |
1942 | { | |
1943 | register tree node; | |
1944 | register struct obstack *ambient_obstack = current_obstack; | |
1945 | current_obstack = &temporary_obstack; | |
1946 | ||
1947 | node = tree_cons (purpose, value, chain); | |
1948 | current_obstack = ambient_obstack; | |
1949 | return node; | |
1950 | } | |
1951 | ||
1952 | /* Same as `tree_cons', but save this node if the function's RTL is saved. */ | |
1953 | ||
1954 | tree | |
1955 | saveable_tree_cons (purpose, value, chain) | |
1956 | tree purpose, value, chain; | |
1957 | { | |
1958 | register tree node; | |
1959 | register struct obstack *ambient_obstack = current_obstack; | |
1960 | current_obstack = saveable_obstack; | |
1961 | ||
1962 | node = tree_cons (purpose, value, chain); | |
1963 | current_obstack = ambient_obstack; | |
1964 | return node; | |
1965 | } | |
1966 | \f | |
1967 | /* Return the size nominally occupied by an object of type TYPE | |
1968 | when it resides in memory. The value is measured in units of bytes, | |
1969 | and its data type is that normally used for type sizes | |
1970 | (which is the first type created by make_signed_type or | |
1971 | make_unsigned_type). */ | |
1972 | ||
1973 | tree | |
1974 | size_in_bytes (type) | |
1975 | tree type; | |
1976 | { | |
cdc5a032 RS |
1977 | tree t; |
1978 | ||
c6a1db6c RS |
1979 | if (type == error_mark_node) |
1980 | return integer_zero_node; | |
1981 | type = TYPE_MAIN_VARIANT (type); | |
1982 | if (TYPE_SIZE (type) == 0) | |
1983 | { | |
37366632 | 1984 | incomplete_type_error (NULL_TREE, type); |
c6a1db6c RS |
1985 | return integer_zero_node; |
1986 | } | |
cdc5a032 RS |
1987 | t = size_binop (CEIL_DIV_EXPR, TYPE_SIZE (type), |
1988 | size_int (BITS_PER_UNIT)); | |
4d7d0403 | 1989 | if (TREE_CODE (t) == INTEGER_CST) |
b6542989 | 1990 | force_fit_type (t, 0); |
cdc5a032 | 1991 | return t; |
c6a1db6c RS |
1992 | } |
1993 | ||
1994 | /* Return the size of TYPE (in bytes) as an integer, | |
1995 | or return -1 if the size can vary. */ | |
1996 | ||
5a0e778b | 1997 | int |
c6a1db6c RS |
1998 | int_size_in_bytes (type) |
1999 | tree type; | |
2000 | { | |
cdc5a032 | 2001 | unsigned int size; |
c6a1db6c RS |
2002 | if (type == error_mark_node) |
2003 | return 0; | |
2004 | type = TYPE_MAIN_VARIANT (type); | |
2005 | if (TYPE_SIZE (type) == 0) | |
2006 | return -1; | |
2007 | if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST) | |
2008 | return -1; | |
cdc5a032 RS |
2009 | if (TREE_INT_CST_HIGH (TYPE_SIZE (type)) != 0) |
2010 | { | |
2011 | tree t = size_binop (CEIL_DIV_EXPR, TYPE_SIZE (type), | |
2012 | size_int (BITS_PER_UNIT)); | |
2013 | return TREE_INT_CST_LOW (t); | |
2014 | } | |
c6a1db6c RS |
2015 | size = TREE_INT_CST_LOW (TYPE_SIZE (type)); |
2016 | return (size + BITS_PER_UNIT - 1) / BITS_PER_UNIT; | |
2017 | } | |
c0560b8b RK |
2018 | \f |
2019 | /* Return, as a tree node, the number of elements for TYPE (which is an | |
2020 | ARRAY_TYPE) minus one. This counts only elements of the top array. */ | |
c6a1db6c RS |
2021 | |
2022 | tree | |
2023 | array_type_nelts (type) | |
2024 | tree type; | |
2025 | { | |
2026 | tree index_type = TYPE_DOMAIN (type); | |
c0560b8b RK |
2027 | |
2028 | return (integer_zerop (TYPE_MIN_VALUE (index_type)) | |
c6a1db6c | 2029 | ? TYPE_MAX_VALUE (index_type) |
c0560b8b | 2030 | : fold (build (MINUS_EXPR, TREE_TYPE (TYPE_MAX_VALUE (index_type)), |
c6a1db6c RS |
2031 | TYPE_MAX_VALUE (index_type), |
2032 | TYPE_MIN_VALUE (index_type)))); | |
2033 | } | |
2034 | \f | |
2035 | /* Return nonzero if arg is static -- a reference to an object in | |
2036 | static storage. This is not the same as the C meaning of `static'. */ | |
2037 | ||
2038 | int | |
2039 | staticp (arg) | |
2040 | tree arg; | |
2041 | { | |
2042 | switch (TREE_CODE (arg)) | |
2043 | { | |
c6a1db6c | 2044 | case FUNCTION_DECL: |
1324c5de | 2045 | /* Nested functions aren't static, since taking their address |
86270344 | 2046 | involves a trampoline. */ |
b001a02f | 2047 | return decl_function_context (arg) == 0; |
86270344 | 2048 | case VAR_DECL: |
0924ddef | 2049 | return TREE_STATIC (arg) || DECL_EXTERNAL (arg); |
c6a1db6c | 2050 | |
492c86a4 RK |
2051 | case CONSTRUCTOR: |
2052 | return TREE_STATIC (arg); | |
2053 | ||
c6a1db6c RS |
2054 | case STRING_CST: |
2055 | return 1; | |
2056 | ||
2057 | case COMPONENT_REF: | |
2058 | case BIT_FIELD_REF: | |
2059 | return staticp (TREE_OPERAND (arg, 0)); | |
2060 | ||
2061 | case INDIRECT_REF: | |
2062 | return TREE_CONSTANT (TREE_OPERAND (arg, 0)); | |
2063 | ||
2064 | case ARRAY_REF: | |
2065 | if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST | |
2066 | && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST) | |
2067 | return staticp (TREE_OPERAND (arg, 0)); | |
2068 | } | |
2069 | ||
2070 | return 0; | |
2071 | } | |
2072 | \f | |
3aa77500 RS |
2073 | /* Wrap a SAVE_EXPR around EXPR, if appropriate. |
2074 | Do this to any expression which may be used in more than one place, | |
2075 | but must be evaluated only once. | |
2076 | ||
2077 | Normally, expand_expr would reevaluate the expression each time. | |
2078 | Calling save_expr produces something that is evaluated and recorded | |
2079 | the first time expand_expr is called on it. Subsequent calls to | |
2080 | expand_expr just reuse the recorded value. | |
2081 | ||
2082 | The call to expand_expr that generates code that actually computes | |
2083 | the value is the first call *at compile time*. Subsequent calls | |
2084 | *at compile time* generate code to use the saved value. | |
2085 | This produces correct result provided that *at run time* control | |
2086 | always flows through the insns made by the first expand_expr | |
2087 | before reaching the other places where the save_expr was evaluated. | |
2088 | You, the caller of save_expr, must make sure this is so. | |
2089 | ||
2090 | Constants, and certain read-only nodes, are returned with no | |
2091 | SAVE_EXPR because that is safe. Expressions containing placeholders | |
c5af9901 RK |
2092 | are not touched; see tree.def for an explanation of what these |
2093 | are used for. */ | |
c6a1db6c RS |
2094 | |
2095 | tree | |
2096 | save_expr (expr) | |
2097 | tree expr; | |
2098 | { | |
2099 | register tree t = fold (expr); | |
2100 | ||
2101 | /* We don't care about whether this can be used as an lvalue in this | |
2102 | context. */ | |
2103 | while (TREE_CODE (t) == NON_LVALUE_EXPR) | |
2104 | t = TREE_OPERAND (t, 0); | |
2105 | ||
2106 | /* If the tree evaluates to a constant, then we don't want to hide that | |
2107 | fact (i.e. this allows further folding, and direct checks for constants). | |
af929c62 | 2108 | However, a read-only object that has side effects cannot be bypassed. |
c6a1db6c RS |
2109 | Since it is no problem to reevaluate literals, we just return the |
2110 | literal node. */ | |
2111 | ||
af929c62 RK |
2112 | if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t)) |
2113 | || TREE_CODE (t) == SAVE_EXPR) | |
c6a1db6c RS |
2114 | return t; |
2115 | ||
dec20b4b RK |
2116 | /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since |
2117 | it means that the size or offset of some field of an object depends on | |
2118 | the value within another field. | |
2119 | ||
2120 | Note that it must not be the case that T contains both a PLACEHOLDER_EXPR | |
2121 | and some variable since it would then need to be both evaluated once and | |
2122 | evaluated more than once. Front-ends must assure this case cannot | |
2123 | happen by surrounding any such subexpressions in their own SAVE_EXPR | |
2124 | and forcing evaluation at the proper time. */ | |
2125 | if (contains_placeholder_p (t)) | |
2126 | return t; | |
2127 | ||
37366632 | 2128 | t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE); |
c6a1db6c RS |
2129 | |
2130 | /* This expression might be placed ahead of a jump to ensure that the | |
2131 | value was computed on both sides of the jump. So make sure it isn't | |
2132 | eliminated as dead. */ | |
2133 | TREE_SIDE_EFFECTS (t) = 1; | |
2134 | return t; | |
2135 | } | |
dec20b4b RK |
2136 | \f |
2137 | /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size | |
2138 | or offset that depends on a field within a record. | |
2139 | ||
2140 | Note that we only allow such expressions within simple arithmetic | |
2141 | or a COND_EXPR. */ | |
2142 | ||
2143 | int | |
2144 | contains_placeholder_p (exp) | |
2145 | tree exp; | |
2146 | { | |
2147 | register enum tree_code code = TREE_CODE (exp); | |
2148 | tree inner; | |
2149 | ||
67c8d7de RK |
2150 | /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR |
2151 | in it since it is supplying a value for it. */ | |
2152 | if (code == WITH_RECORD_EXPR) | |
2153 | return 0; | |
2154 | ||
dec20b4b RK |
2155 | switch (TREE_CODE_CLASS (code)) |
2156 | { | |
2157 | case 'r': | |
2158 | for (inner = TREE_OPERAND (exp, 0); | |
2159 | TREE_CODE_CLASS (TREE_CODE (inner)) == 'r'; | |
2160 | inner = TREE_OPERAND (inner, 0)) | |
2161 | ; | |
2162 | return TREE_CODE (inner) == PLACEHOLDER_EXPR; | |
2163 | ||
2164 | case '1': | |
2165 | case '2': case '<': | |
2166 | case 'e': | |
2167 | switch (tree_code_length[(int) code]) | |
2168 | { | |
2169 | case 1: | |
2170 | return contains_placeholder_p (TREE_OPERAND (exp, 0)); | |
2171 | case 2: | |
2172 | return (code != RTL_EXPR | |
a56e7133 | 2173 | && code != CONSTRUCTOR |
dec20b4b RK |
2174 | && ! (code == SAVE_EXPR && SAVE_EXPR_RTL (exp) != 0) |
2175 | && code != WITH_RECORD_EXPR | |
2176 | && (contains_placeholder_p (TREE_OPERAND (exp, 0)) | |
2177 | || contains_placeholder_p (TREE_OPERAND (exp, 1)))); | |
2178 | case 3: | |
2179 | return (code == COND_EXPR | |
2180 | && (contains_placeholder_p (TREE_OPERAND (exp, 0)) | |
2181 | || contains_placeholder_p (TREE_OPERAND (exp, 1)) | |
2182 | || contains_placeholder_p (TREE_OPERAND (exp, 2)))); | |
2183 | } | |
2184 | } | |
2185 | ||
2186 | return 0; | |
2187 | } | |
2188 | \f | |
2189 | /* Given a tree EXP, a FIELD_DECL F, and a replacement value R, | |
2190 | return a tree with all occurrences of references to F in a | |
2191 | PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP | |
2192 | contains only arithmetic expressions. */ | |
2193 | ||
2194 | tree | |
2195 | substitute_in_expr (exp, f, r) | |
2196 | tree exp; | |
2197 | tree f; | |
2198 | tree r; | |
2199 | { | |
2200 | enum tree_code code = TREE_CODE (exp); | |
abd23b66 | 2201 | tree new = 0; |
dec20b4b RK |
2202 | tree inner; |
2203 | ||
2204 | switch (TREE_CODE_CLASS (code)) | |
2205 | { | |
2206 | case 'c': | |
2207 | case 'd': | |
2208 | return exp; | |
2209 | ||
2210 | case 'x': | |
2211 | if (code == PLACEHOLDER_EXPR) | |
2212 | return exp; | |
2213 | break; | |
2214 | ||
2215 | case '1': | |
2216 | case '2': | |
2217 | case '<': | |
2218 | case 'e': | |
2219 | switch (tree_code_length[(int) code]) | |
2220 | { | |
2221 | case 1: | |
abd23b66 RK |
2222 | new = fold (build1 (code, TREE_TYPE (exp), |
2223 | substitute_in_expr (TREE_OPERAND (exp, 0), | |
2224 | f, r))); | |
2225 | break; | |
dec20b4b RK |
2226 | |
2227 | case 2: | |
6a22e3a7 RK |
2228 | /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR |
2229 | could, but we don't support it. */ | |
2230 | if (code == RTL_EXPR) | |
2231 | return exp; | |
2232 | else if (code == CONSTRUCTOR) | |
dec20b4b RK |
2233 | abort (); |
2234 | ||
abd23b66 RK |
2235 | new = fold (build (code, TREE_TYPE (exp), |
2236 | substitute_in_expr (TREE_OPERAND (exp, 0), f, r), | |
2237 | substitute_in_expr (TREE_OPERAND (exp, 1), | |
2238 | f, r))); | |
2239 | break; | |
dec20b4b RK |
2240 | |
2241 | case 3: | |
6a22e3a7 RK |
2242 | /* It cannot be that anything inside a SAVE_EXPR contains a |
2243 | PLACEHOLDER_EXPR. */ | |
2244 | if (code == SAVE_EXPR) | |
2245 | return exp; | |
2246 | ||
dec20b4b RK |
2247 | if (code != COND_EXPR) |
2248 | abort (); | |
2249 | ||
abd23b66 RK |
2250 | new = fold (build (code, TREE_TYPE (exp), |
2251 | substitute_in_expr (TREE_OPERAND (exp, 0), f, r), | |
2252 | substitute_in_expr (TREE_OPERAND (exp, 1), f, r), | |
2253 | substitute_in_expr (TREE_OPERAND (exp, 2), | |
2254 | f, r))); | |
dec20b4b RK |
2255 | } |
2256 | ||
2257 | break; | |
2258 | ||
2259 | case 'r': | |
2260 | switch (code) | |
2261 | { | |
2262 | case COMPONENT_REF: | |
2263 | /* If this expression is getting a value from a PLACEHOLDER_EXPR | |
2264 | and it is the right field, replace it with R. */ | |
2265 | for (inner = TREE_OPERAND (exp, 0); | |
2266 | TREE_CODE_CLASS (TREE_CODE (inner)) == 'r'; | |
2267 | inner = TREE_OPERAND (inner, 0)) | |
2268 | ; | |
2269 | if (TREE_CODE (inner) == PLACEHOLDER_EXPR | |
2270 | && TREE_OPERAND (exp, 1) == f) | |
2271 | return r; | |
2272 | ||
abd23b66 RK |
2273 | new = fold (build (code, TREE_TYPE (exp), |
2274 | substitute_in_expr (TREE_OPERAND (exp, 0), f, r), | |
2275 | TREE_OPERAND (exp, 1))); | |
2276 | break; | |
2277 | ||
dec20b4b | 2278 | case BIT_FIELD_REF: |
abd23b66 RK |
2279 | new = fold (build (code, TREE_TYPE (exp), |
2280 | substitute_in_expr (TREE_OPERAND (exp, 0), f, r), | |
2281 | substitute_in_expr (TREE_OPERAND (exp, 1), f, r), | |
2282 | substitute_in_expr (TREE_OPERAND (exp, 2), f, r))); | |
2283 | break; | |
2284 | ||
dec20b4b RK |
2285 | case INDIRECT_REF: |
2286 | case BUFFER_REF: | |
abd23b66 RK |
2287 | new = fold (build1 (code, TREE_TYPE (exp), |
2288 | substitute_in_expr (TREE_OPERAND (exp, 0), | |
2289 | f, r))); | |
2290 | break; | |
2291 | ||
dec20b4b | 2292 | case OFFSET_REF: |
abd23b66 RK |
2293 | new = fold (build (code, TREE_TYPE (exp), |
2294 | substitute_in_expr (TREE_OPERAND (exp, 0), f, r), | |
2295 | substitute_in_expr (TREE_OPERAND (exp, 1), f, r))); | |
2296 | break; | |
dec20b4b RK |
2297 | } |
2298 | } | |
2299 | ||
2300 | /* If it wasn't one of the cases we handle, give up. */ | |
abd23b66 RK |
2301 | if (new == 0) |
2302 | abort (); | |
dec20b4b | 2303 | |
abd23b66 RK |
2304 | TREE_READONLY (new) = TREE_READONLY (exp); |
2305 | return new; | |
dec20b4b RK |
2306 | } |
2307 | \f | |
2308 | /* Given a type T, a FIELD_DECL F, and a replacement value R, | |
2309 | return a new type with all size expressions that contain F | |
2310 | updated by replacing F with R. */ | |
c6a1db6c | 2311 | |
dec20b4b RK |
2312 | tree |
2313 | substitute_in_type (t, f, r) | |
2314 | tree t, f, r; | |
2315 | { | |
2316 | switch (TREE_CODE (t)) | |
2317 | { | |
2318 | case POINTER_TYPE: | |
2319 | case VOID_TYPE: | |
2320 | return t; | |
2321 | case INTEGER_TYPE: | |
2322 | case ENUMERAL_TYPE: | |
2323 | case BOOLEAN_TYPE: | |
2324 | case CHAR_TYPE: | |
2325 | if ((TREE_CODE (TYPE_MIN_VALUE (t)) != INTEGER_CST | |
2326 | && contains_placeholder_p (TYPE_MIN_VALUE (t))) | |
2327 | || (TREE_CODE (TYPE_MAX_VALUE (t)) != INTEGER_CST | |
2328 | && contains_placeholder_p (TYPE_MAX_VALUE (t)))) | |
2329 | return build_range_type (t, | |
2330 | substitute_in_expr (TYPE_MIN_VALUE (t), f, r), | |
2331 | substitute_in_expr (TYPE_MAX_VALUE (t), f, r)); | |
2332 | return t; | |
2333 | ||
2334 | case REAL_TYPE: | |
afb52ee7 RK |
2335 | if ((TYPE_MIN_VALUE (t) != 0 |
2336 | && TREE_CODE (TYPE_MIN_VALUE (t)) != REAL_CST | |
dec20b4b | 2337 | && contains_placeholder_p (TYPE_MIN_VALUE (t))) |
afb52ee7 RK |
2338 | || (TYPE_MAX_VALUE (t) != 0 |
2339 | && TREE_CODE (TYPE_MAX_VALUE (t)) != REAL_CST | |
dec20b4b RK |
2340 | && contains_placeholder_p (TYPE_MAX_VALUE (t)))) |
2341 | { | |
818a0d4e | 2342 | t = build_type_copy (t); |
afb52ee7 RK |
2343 | |
2344 | if (TYPE_MIN_VALUE (t)) | |
2345 | TYPE_MIN_VALUE (t) = substitute_in_expr (TYPE_MIN_VALUE (t), f, r); | |
2346 | if (TYPE_MAX_VALUE (t)) | |
2347 | TYPE_MAX_VALUE (t) = substitute_in_expr (TYPE_MAX_VALUE (t), f, r); | |
dec20b4b RK |
2348 | } |
2349 | return t; | |
2350 | ||
2351 | case COMPLEX_TYPE: | |
2352 | return build_complex_type (substitute_in_type (TREE_TYPE (t), f, r)); | |
2353 | ||
2354 | case OFFSET_TYPE: | |
2355 | case METHOD_TYPE: | |
2356 | case REFERENCE_TYPE: | |
2357 | case FILE_TYPE: | |
2358 | case SET_TYPE: | |
dec20b4b RK |
2359 | case FUNCTION_TYPE: |
2360 | case LANG_TYPE: | |
2361 | /* Don't know how to do these yet. */ | |
2362 | abort (); | |
2363 | ||
2364 | case ARRAY_TYPE: | |
2365 | t = build_array_type (substitute_in_type (TREE_TYPE (t), f, r), | |
2366 | substitute_in_type (TYPE_DOMAIN (t), f, r)); | |
2367 | TYPE_SIZE (t) = 0; | |
2368 | layout_type (t); | |
2369 | return t; | |
2370 | ||
2371 | case RECORD_TYPE: | |
2372 | case UNION_TYPE: | |
2373 | case QUAL_UNION_TYPE: | |
2374 | { | |
2375 | tree new = copy_node (t); | |
2376 | tree field; | |
2377 | tree last_field = 0; | |
2378 | ||
2379 | /* Start out with no fields, make new fields, and chain them | |
2380 | in. */ | |
2381 | ||
2382 | TYPE_FIELDS (new) = 0; | |
2383 | TYPE_SIZE (new) = 0; | |
2384 | ||
2385 | for (field = TYPE_FIELDS (t); field; | |
2386 | field = TREE_CHAIN (field)) | |
2387 | { | |
2388 | tree new_field = copy_node (field); | |
2389 | ||
2390 | TREE_TYPE (new_field) | |
2391 | = substitute_in_type (TREE_TYPE (new_field), f, r); | |
2392 | ||
2393 | /* If this is an anonymous field and the type of this field is | |
2394 | a UNION_TYPE or RECORD_TYPE with no elements, ignore it. If | |
2395 | the type just has one element, treat that as the field. | |
2396 | But don't do this if we are processing a QUAL_UNION_TYPE. */ | |
2397 | if (TREE_CODE (t) != QUAL_UNION_TYPE && DECL_NAME (new_field) == 0 | |
2398 | && (TREE_CODE (TREE_TYPE (new_field)) == UNION_TYPE | |
2399 | || TREE_CODE (TREE_TYPE (new_field)) == RECORD_TYPE)) | |
2400 | { | |
2401 | if (TYPE_FIELDS (TREE_TYPE (new_field)) == 0) | |
2402 | continue; | |
2403 | ||
2404 | if (TREE_CHAIN (TYPE_FIELDS (TREE_TYPE (new_field))) == 0) | |
2405 | new_field = TYPE_FIELDS (TREE_TYPE (new_field)); | |
2406 | } | |
2407 | ||
2408 | DECL_CONTEXT (new_field) = new; | |
2409 | DECL_SIZE (new_field) = 0; | |
2410 | ||
2411 | if (TREE_CODE (t) == QUAL_UNION_TYPE) | |
2412 | { | |
2413 | /* Do the substitution inside the qualifier and if we find | |
2414 | that this field will not be present, omit it. */ | |
2415 | DECL_QUALIFIER (new_field) | |
2416 | = substitute_in_expr (DECL_QUALIFIER (field), f, r); | |
2417 | if (integer_zerop (DECL_QUALIFIER (new_field))) | |
2418 | continue; | |
2419 | } | |
2420 | ||
2421 | if (last_field == 0) | |
2422 | TYPE_FIELDS (new) = new_field; | |
2423 | else | |
2424 | TREE_CHAIN (last_field) = new_field; | |
2425 | ||
2426 | last_field = new_field; | |
2427 | ||
2428 | /* If this is a qualified type and this field will always be | |
2429 | present, we are done. */ | |
2430 | if (TREE_CODE (t) == QUAL_UNION_TYPE | |
2431 | && integer_onep (DECL_QUALIFIER (new_field))) | |
2432 | break; | |
2433 | } | |
2434 | ||
2435 | /* If this used to be a qualified union type, but we now know what | |
2436 | field will be present, make this a normal union. */ | |
2437 | if (TREE_CODE (new) == QUAL_UNION_TYPE | |
2438 | && (TYPE_FIELDS (new) == 0 | |
2439 | || integer_onep (DECL_QUALIFIER (TYPE_FIELDS (new))))) | |
2440 | TREE_SET_CODE (new, UNION_TYPE); | |
2441 | ||
2442 | layout_type (new); | |
2443 | return new; | |
2444 | } | |
2445 | } | |
2446 | } | |
2447 | \f | |
c6a1db6c RS |
2448 | /* Stabilize a reference so that we can use it any number of times |
2449 | without causing its operands to be evaluated more than once. | |
4b1d0fea RS |
2450 | Returns the stabilized reference. This works by means of save_expr, |
2451 | so see the caveats in the comments about save_expr. | |
c6a1db6c RS |
2452 | |
2453 | Also allows conversion expressions whose operands are references. | |
2454 | Any other kind of expression is returned unchanged. */ | |
2455 | ||
2456 | tree | |
2457 | stabilize_reference (ref) | |
2458 | tree ref; | |
2459 | { | |
2460 | register tree result; | |
2461 | register enum tree_code code = TREE_CODE (ref); | |
2462 | ||
2463 | switch (code) | |
2464 | { | |
2465 | case VAR_DECL: | |
2466 | case PARM_DECL: | |
2467 | case RESULT_DECL: | |
2468 | /* No action is needed in this case. */ | |
2469 | return ref; | |
2470 | ||
2471 | case NOP_EXPR: | |
2472 | case CONVERT_EXPR: | |
2473 | case FLOAT_EXPR: | |
2474 | case FIX_TRUNC_EXPR: | |
2475 | case FIX_FLOOR_EXPR: | |
2476 | case FIX_ROUND_EXPR: | |
2477 | case FIX_CEIL_EXPR: | |
2478 | result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0))); | |
2479 | break; | |
2480 | ||
2481 | case INDIRECT_REF: | |
2482 | result = build_nt (INDIRECT_REF, | |
2483 | stabilize_reference_1 (TREE_OPERAND (ref, 0))); | |
2484 | break; | |
2485 | ||
2486 | case COMPONENT_REF: | |
2487 | result = build_nt (COMPONENT_REF, | |
2488 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2489 | TREE_OPERAND (ref, 1)); | |
2490 | break; | |
2491 | ||
2492 | case BIT_FIELD_REF: | |
2493 | result = build_nt (BIT_FIELD_REF, | |
2494 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2495 | stabilize_reference_1 (TREE_OPERAND (ref, 1)), | |
2496 | stabilize_reference_1 (TREE_OPERAND (ref, 2))); | |
2497 | break; | |
2498 | ||
2499 | case ARRAY_REF: | |
2500 | result = build_nt (ARRAY_REF, | |
2501 | stabilize_reference (TREE_OPERAND (ref, 0)), | |
2502 | stabilize_reference_1 (TREE_OPERAND (ref, 1))); | |
2503 | break; | |
2504 | ||
c451a7a0 PB |
2505 | case COMPOUND_EXPR: |
2506 | result = build_nt (COMPOUND_EXPR, | |
2507 | stabilize_reference_1 (TREE_OPERAND (ref, 0)), | |
2508 | stabilize_reference (TREE_OPERAND (ref, 1))); | |
2509 | break; | |
2510 | ||
c36a127d RK |
2511 | case RTL_EXPR: |
2512 | result = build1 (INDIRECT_REF, TREE_TYPE (ref), | |
2513 | save_expr (build1 (ADDR_EXPR, | |
21f0e042 | 2514 | build_pointer_type (TREE_TYPE (ref)), |
c36a127d RK |
2515 | ref))); |
2516 | break; | |
2517 | ||
c451a7a0 | 2518 | |
c6a1db6c RS |
2519 | /* If arg isn't a kind of lvalue we recognize, make no change. |
2520 | Caller should recognize the error for an invalid lvalue. */ | |
2521 | default: | |
2522 | return ref; | |
2523 | ||
2524 | case ERROR_MARK: | |
2525 | return error_mark_node; | |
2526 | } | |
2527 | ||
2528 | TREE_TYPE (result) = TREE_TYPE (ref); | |
2529 | TREE_READONLY (result) = TREE_READONLY (ref); | |
2530 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref); | |
2531 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref); | |
2532 | TREE_RAISES (result) = TREE_RAISES (ref); | |
2533 | ||
2534 | return result; | |
2535 | } | |
2536 | ||
2537 | /* Subroutine of stabilize_reference; this is called for subtrees of | |
2538 | references. Any expression with side-effects must be put in a SAVE_EXPR | |
2539 | to ensure that it is only evaluated once. | |
2540 | ||
2541 | We don't put SAVE_EXPR nodes around everything, because assigning very | |
2542 | simple expressions to temporaries causes us to miss good opportunities | |
2543 | for optimizations. Among other things, the opportunity to fold in the | |
2544 | addition of a constant into an addressing mode often gets lost, e.g. | |
2545 | "y[i+1] += x;". In general, we take the approach that we should not make | |
2546 | an assignment unless we are forced into it - i.e., that any non-side effect | |
2547 | operator should be allowed, and that cse should take care of coalescing | |
2548 | multiple utterances of the same expression should that prove fruitful. */ | |
2549 | ||
4745ddae | 2550 | tree |
c6a1db6c RS |
2551 | stabilize_reference_1 (e) |
2552 | tree e; | |
2553 | { | |
2554 | register tree result; | |
c6a1db6c RS |
2555 | register enum tree_code code = TREE_CODE (e); |
2556 | ||
af929c62 RK |
2557 | /* We cannot ignore const expressions because it might be a reference |
2558 | to a const array but whose index contains side-effects. But we can | |
2559 | ignore things that are actual constant or that already have been | |
2560 | handled by this function. */ | |
2561 | ||
2562 | if (TREE_CONSTANT (e) || code == SAVE_EXPR) | |
c6a1db6c RS |
2563 | return e; |
2564 | ||
2565 | switch (TREE_CODE_CLASS (code)) | |
2566 | { | |
2567 | case 'x': | |
2568 | case 't': | |
2569 | case 'd': | |
03646189 | 2570 | case 'b': |
c6a1db6c RS |
2571 | case '<': |
2572 | case 's': | |
2573 | case 'e': | |
2574 | case 'r': | |
2575 | /* If the expression has side-effects, then encase it in a SAVE_EXPR | |
2576 | so that it will only be evaluated once. */ | |
2577 | /* The reference (r) and comparison (<) classes could be handled as | |
2578 | below, but it is generally faster to only evaluate them once. */ | |
2579 | if (TREE_SIDE_EFFECTS (e)) | |
2580 | return save_expr (e); | |
2581 | return e; | |
2582 | ||
2583 | case 'c': | |
2584 | /* Constants need no processing. In fact, we should never reach | |
2585 | here. */ | |
2586 | return e; | |
2587 | ||
2588 | case '2': | |
ae698e41 RS |
2589 | /* Division is slow and tends to be compiled with jumps, |
2590 | especially the division by powers of 2 that is often | |
2591 | found inside of an array reference. So do it just once. */ | |
2592 | if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR | |
2593 | || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR | |
2594 | || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR | |
2595 | || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR) | |
2596 | return save_expr (e); | |
c6a1db6c RS |
2597 | /* Recursively stabilize each operand. */ |
2598 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)), | |
2599 | stabilize_reference_1 (TREE_OPERAND (e, 1))); | |
2600 | break; | |
2601 | ||
2602 | case '1': | |
2603 | /* Recursively stabilize each operand. */ | |
2604 | result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0))); | |
2605 | break; | |
a7fcb968 RK |
2606 | |
2607 | default: | |
2608 | abort (); | |
c6a1db6c RS |
2609 | } |
2610 | ||
2611 | TREE_TYPE (result) = TREE_TYPE (e); | |
2612 | TREE_READONLY (result) = TREE_READONLY (e); | |
2613 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e); | |
2614 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e); | |
2615 | TREE_RAISES (result) = TREE_RAISES (e); | |
2616 | ||
2617 | return result; | |
2618 | } | |
2619 | \f | |
2620 | /* Low-level constructors for expressions. */ | |
2621 | ||
2622 | /* Build an expression of code CODE, data type TYPE, | |
2623 | and operands as specified by the arguments ARG1 and following arguments. | |
2624 | Expressions and reference nodes can be created this way. | |
2625 | Constants, decls, types and misc nodes cannot be. */ | |
2626 | ||
2627 | tree | |
ba63ed56 | 2628 | build VPROTO((enum tree_code code, tree tt, ...)) |
c6a1db6c | 2629 | { |
ba63ed56 | 2630 | #ifndef __STDC__ |
c6a1db6c | 2631 | enum tree_code code; |
ba63ed56 RK |
2632 | tree tt; |
2633 | #endif | |
2634 | va_list p; | |
c6a1db6c RS |
2635 | register tree t; |
2636 | register int length; | |
2637 | register int i; | |
2638 | ||
ba63ed56 | 2639 | VA_START (p, tt); |
c6a1db6c | 2640 | |
ba63ed56 | 2641 | #ifndef __STDC__ |
c6a1db6c | 2642 | code = va_arg (p, enum tree_code); |
ba63ed56 RK |
2643 | tt = va_arg (p, tree); |
2644 | #endif | |
2645 | ||
c6a1db6c RS |
2646 | t = make_node (code); |
2647 | length = tree_code_length[(int) code]; | |
ba63ed56 | 2648 | TREE_TYPE (t) = tt; |
c6a1db6c RS |
2649 | |
2650 | if (length == 2) | |
2651 | { | |
2652 | /* This is equivalent to the loop below, but faster. */ | |
2653 | register tree arg0 = va_arg (p, tree); | |
2654 | register tree arg1 = va_arg (p, tree); | |
2655 | TREE_OPERAND (t, 0) = arg0; | |
2656 | TREE_OPERAND (t, 1) = arg1; | |
2657 | if ((arg0 && TREE_SIDE_EFFECTS (arg0)) | |
2658 | || (arg1 && TREE_SIDE_EFFECTS (arg1))) | |
2659 | TREE_SIDE_EFFECTS (t) = 1; | |
2660 | TREE_RAISES (t) | |
2661 | = (arg0 && TREE_RAISES (arg0)) || (arg1 && TREE_RAISES (arg1)); | |
2662 | } | |
2663 | else if (length == 1) | |
2664 | { | |
2665 | register tree arg0 = va_arg (p, tree); | |
2666 | ||
2667 | /* Call build1 for this! */ | |
2668 | if (TREE_CODE_CLASS (code) != 's') | |
2669 | abort (); | |
2670 | TREE_OPERAND (t, 0) = arg0; | |
2671 | if (arg0 && TREE_SIDE_EFFECTS (arg0)) | |
2672 | TREE_SIDE_EFFECTS (t) = 1; | |
2673 | TREE_RAISES (t) = (arg0 && TREE_RAISES (arg0)); | |
2674 | } | |
2675 | else | |
2676 | { | |
2677 | for (i = 0; i < length; i++) | |
2678 | { | |
2679 | register tree operand = va_arg (p, tree); | |
2680 | TREE_OPERAND (t, i) = operand; | |
2681 | if (operand) | |
2682 | { | |
2683 | if (TREE_SIDE_EFFECTS (operand)) | |
2684 | TREE_SIDE_EFFECTS (t) = 1; | |
2685 | if (TREE_RAISES (operand)) | |
2686 | TREE_RAISES (t) = 1; | |
2687 | } | |
2688 | } | |
2689 | } | |
2690 | va_end (p); | |
2691 | return t; | |
2692 | } | |
2693 | ||
2694 | /* Same as above, but only builds for unary operators. | |
2695 | Saves lions share of calls to `build'; cuts down use | |
2696 | of varargs, which is expensive for RISC machines. */ | |
2697 | tree | |
2698 | build1 (code, type, node) | |
2699 | enum tree_code code; | |
2700 | tree type; | |
2701 | tree node; | |
2702 | { | |
2703 | register struct obstack *obstack = current_obstack; | |
2704 | register int i, length; | |
2705 | register tree_node_kind kind; | |
2706 | register tree t; | |
2707 | ||
2708 | #ifdef GATHER_STATISTICS | |
2709 | if (TREE_CODE_CLASS (code) == 'r') | |
2710 | kind = r_kind; | |
2711 | else | |
2712 | kind = e_kind; | |
2713 | #endif | |
2714 | ||
2715 | obstack = expression_obstack; | |
2716 | length = sizeof (struct tree_exp); | |
2717 | ||
2718 | t = (tree) obstack_alloc (obstack, length); | |
2719 | ||
2720 | #ifdef GATHER_STATISTICS | |
2721 | tree_node_counts[(int)kind]++; | |
2722 | tree_node_sizes[(int)kind] += length; | |
2723 | #endif | |
2724 | ||
508f8149 | 2725 | for (i = (length / sizeof (int)) - 1; i >= 0; i--) |
c6a1db6c | 2726 | ((int *) t)[i] = 0; |
508f8149 RK |
2727 | |
2728 | TREE_TYPE (t) = type; | |
c6a1db6c RS |
2729 | TREE_SET_CODE (t, code); |
2730 | ||
2731 | if (obstack == &permanent_obstack) | |
2732 | TREE_PERMANENT (t) = 1; | |
2733 | ||
2734 | TREE_OPERAND (t, 0) = node; | |
2735 | if (node) | |
2736 | { | |
2737 | if (TREE_SIDE_EFFECTS (node)) | |
2738 | TREE_SIDE_EFFECTS (t) = 1; | |
2739 | if (TREE_RAISES (node)) | |
2740 | TREE_RAISES (t) = 1; | |
2741 | } | |
2742 | ||
2743 | return t; | |
2744 | } | |
2745 | ||
2746 | /* Similar except don't specify the TREE_TYPE | |
2747 | and leave the TREE_SIDE_EFFECTS as 0. | |
2748 | It is permissible for arguments to be null, | |
2749 | or even garbage if their values do not matter. */ | |
2750 | ||
2751 | tree | |
2109bb54 | 2752 | build_nt VPROTO((enum tree_code code, ...)) |
c6a1db6c | 2753 | { |
ba63ed56 | 2754 | #ifndef __STDC__ |
c5ffba1a | 2755 | enum tree_code code; |
ba63ed56 RK |
2756 | #endif |
2757 | va_list p; | |
c6a1db6c RS |
2758 | register tree t; |
2759 | register int length; | |
2760 | register int i; | |
2761 | ||
ba63ed56 | 2762 | VA_START (p, code); |
c6a1db6c | 2763 | |
ba63ed56 | 2764 | #ifndef __STDC__ |
c6a1db6c | 2765 | code = va_arg (p, enum tree_code); |
ba63ed56 RK |
2766 | #endif |
2767 | ||
c6a1db6c RS |
2768 | t = make_node (code); |
2769 | length = tree_code_length[(int) code]; | |
2770 | ||
2771 | for (i = 0; i < length; i++) | |
2772 | TREE_OPERAND (t, i) = va_arg (p, tree); | |
2773 | ||
2774 | va_end (p); | |
2775 | return t; | |
2776 | } | |
2777 | ||
2778 | /* Similar to `build_nt', except we build | |
2779 | on the temp_decl_obstack, regardless. */ | |
2780 | ||
2781 | tree | |
2109bb54 | 2782 | build_parse_node VPROTO((enum tree_code code, ...)) |
c6a1db6c | 2783 | { |
ba63ed56 | 2784 | #ifndef __STDC__ |
c5ffba1a | 2785 | enum tree_code code; |
ba63ed56 | 2786 | #endif |
c6a1db6c RS |
2787 | register struct obstack *ambient_obstack = expression_obstack; |
2788 | va_list p; | |
c6a1db6c RS |
2789 | register tree t; |
2790 | register int length; | |
2791 | register int i; | |
2792 | ||
ba63ed56 | 2793 | VA_START (p, code); |
c6a1db6c | 2794 | |
ba63ed56 | 2795 | #ifndef __STDC__ |
c6a1db6c | 2796 | code = va_arg (p, enum tree_code); |
ba63ed56 RK |
2797 | #endif |
2798 | ||
2799 | expression_obstack = &temp_decl_obstack; | |
2800 | ||
c6a1db6c RS |
2801 | t = make_node (code); |
2802 | length = tree_code_length[(int) code]; | |
2803 | ||
2804 | for (i = 0; i < length; i++) | |
2805 | TREE_OPERAND (t, i) = va_arg (p, tree); | |
2806 | ||
2807 | va_end (p); | |
2808 | expression_obstack = ambient_obstack; | |
2809 | return t; | |
2810 | } | |
2811 | ||
2812 | #if 0 | |
2813 | /* Commented out because this wants to be done very | |
2814 | differently. See cp-lex.c. */ | |
2815 | tree | |
2816 | build_op_identifier (op1, op2) | |
2817 | tree op1, op2; | |
2818 | { | |
2819 | register tree t = make_node (OP_IDENTIFIER); | |
2820 | TREE_PURPOSE (t) = op1; | |
2821 | TREE_VALUE (t) = op2; | |
2822 | return t; | |
2823 | } | |
2824 | #endif | |
2825 | \f | |
2826 | /* Create a DECL_... node of code CODE, name NAME and data type TYPE. | |
2827 | We do NOT enter this node in any sort of symbol table. | |
2828 | ||
2829 | layout_decl is used to set up the decl's storage layout. | |
2830 | Other slots are initialized to 0 or null pointers. */ | |
2831 | ||
2832 | tree | |
2833 | build_decl (code, name, type) | |
2834 | enum tree_code code; | |
2835 | tree name, type; | |
2836 | { | |
2837 | register tree t; | |
2838 | ||
2839 | t = make_node (code); | |
2840 | ||
2841 | /* if (type == error_mark_node) | |
2842 | type = integer_type_node; */ | |
2843 | /* That is not done, deliberately, so that having error_mark_node | |
2844 | as the type can suppress useless errors in the use of this variable. */ | |
2845 | ||
2846 | DECL_NAME (t) = name; | |
2847 | DECL_ASSEMBLER_NAME (t) = name; | |
2848 | TREE_TYPE (t) = type; | |
2849 | ||
2850 | if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL) | |
2851 | layout_decl (t, 0); | |
2852 | else if (code == FUNCTION_DECL) | |
2853 | DECL_MODE (t) = FUNCTION_MODE; | |
2854 | ||
2855 | return t; | |
2856 | } | |
2857 | \f | |
2858 | /* BLOCK nodes are used to represent the structure of binding contours | |
2859 | and declarations, once those contours have been exited and their contents | |
52d2830e | 2860 | compiled. This information is used for outputting debugging info. */ |
c6a1db6c RS |
2861 | |
2862 | tree | |
2863 | build_block (vars, tags, subblocks, supercontext, chain) | |
2864 | tree vars, tags, subblocks, supercontext, chain; | |
2865 | { | |
2866 | register tree block = make_node (BLOCK); | |
2867 | BLOCK_VARS (block) = vars; | |
2868 | BLOCK_TYPE_TAGS (block) = tags; | |
2869 | BLOCK_SUBBLOCKS (block) = subblocks; | |
2870 | BLOCK_SUPERCONTEXT (block) = supercontext; | |
2871 | BLOCK_CHAIN (block) = chain; | |
2872 | return block; | |
2873 | } | |
2874 | \f | |
1a2927d2 RK |
2875 | /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE |
2876 | is ATTRIBUTE. */ | |
2877 | ||
2878 | tree | |
2879 | build_decl_attribute_variant (ddecl, attribute) | |
2880 | tree ddecl, attribute; | |
2881 | { | |
2882 | DECL_MACHINE_ATTRIBUTES (ddecl) = attribute; | |
2883 | return ddecl; | |
2884 | } | |
2885 | ||
91e97eb8 RK |
2886 | /* Return a type like TTYPE except that its TYPE_ATTRIBUTE |
2887 | is ATTRIBUTE. | |
2888 | ||
f8a89236 | 2889 | Record such modified types already made so we don't make duplicates. */ |
91e97eb8 RK |
2890 | |
2891 | tree | |
2892 | build_type_attribute_variant (ttype, attribute) | |
2893 | tree ttype, attribute; | |
2894 | { | |
2895 | if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute)) | |
2896 | { | |
2897 | register int hashcode; | |
2898 | register struct obstack *ambient_obstack = current_obstack; | |
2899 | tree ntype; | |
2900 | ||
2901 | if (ambient_obstack != &permanent_obstack) | |
2902 | current_obstack = TYPE_OBSTACK (ttype); | |
2903 | ||
2904 | ntype = copy_node (ttype); | |
2905 | current_obstack = ambient_obstack; | |
2906 | ||
2907 | TYPE_POINTER_TO (ntype) = 0; | |
2908 | TYPE_REFERENCE_TO (ntype) = 0; | |
2909 | TYPE_ATTRIBUTES (ntype) = attribute; | |
2910 | ||
2911 | /* Create a new main variant of TYPE. */ | |
2912 | TYPE_MAIN_VARIANT (ntype) = ntype; | |
2913 | TYPE_NEXT_VARIANT (ntype) = 0; | |
2914 | TYPE_READONLY (ntype) = TYPE_VOLATILE (ntype) = 0; | |
2915 | ||
2916 | hashcode = TYPE_HASH (TREE_CODE (ntype)) | |
2917 | + TYPE_HASH (TREE_TYPE (ntype)) | |
2a3c15b5 | 2918 | + attribute_hash_list (attribute); |
91e97eb8 RK |
2919 | |
2920 | switch (TREE_CODE (ntype)) | |
2921 | { | |
2922 | case FUNCTION_TYPE: | |
2923 | hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype)); | |
2924 | break; | |
2925 | case ARRAY_TYPE: | |
2926 | hashcode += TYPE_HASH (TYPE_DOMAIN (ntype)); | |
2927 | break; | |
2928 | case INTEGER_TYPE: | |
2929 | hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype)); | |
2930 | break; | |
2931 | case REAL_TYPE: | |
2932 | hashcode += TYPE_HASH (TYPE_PRECISION (ntype)); | |
2933 | break; | |
2934 | } | |
2935 | ||
2936 | ntype = type_hash_canon (hashcode, ntype); | |
2937 | ttype = build_type_variant (ntype, TYPE_READONLY (ttype), | |
2938 | TYPE_VOLATILE (ttype)); | |
2939 | } | |
2940 | ||
2941 | return ttype; | |
2942 | } | |
1a2927d2 | 2943 | |
4084f789 RK |
2944 | /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL |
2945 | or type TYPE and 0 otherwise. Validity is determined the configuration | |
2946 | macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */ | |
1a2927d2 RK |
2947 | |
2948 | int | |
4084f789 RK |
2949 | valid_machine_attribute (attr_name, attr_args, decl, type) |
2950 | tree attr_name, attr_args; | |
2951 | tree decl; | |
2952 | tree type; | |
1a2927d2 RK |
2953 | { |
2954 | int valid = 0; | |
4084f789 | 2955 | tree decl_attr_list = decl != 0 ? DECL_MACHINE_ATTRIBUTES (decl) : 0; |
1a2927d2 RK |
2956 | tree type_attr_list = TYPE_ATTRIBUTES (type); |
2957 | ||
2a3c15b5 DE |
2958 | if (TREE_CODE (attr_name) != IDENTIFIER_NODE) |
2959 | abort (); | |
4084f789 | 2960 | |
1a2927d2 | 2961 | #ifdef VALID_MACHINE_DECL_ATTRIBUTE |
4084f789 | 2962 | if (decl != 0 |
2a3c15b5 | 2963 | && VALID_MACHINE_DECL_ATTRIBUTE (decl, decl_attr_list, attr_name, attr_args)) |
1a2927d2 | 2964 | { |
2a3c15b5 DE |
2965 | tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name), |
2966 | decl_attr_list); | |
1a2927d2 | 2967 | |
2a3c15b5 DE |
2968 | if (attr != NULL_TREE) |
2969 | { | |
2970 | /* Override existing arguments. Declarations are unique so we can | |
2971 | modify this in place. */ | |
2972 | TREE_VALUE (attr) = attr_args; | |
2973 | } | |
2974 | else | |
2975 | { | |
2976 | decl_attr_list = tree_cons (attr_name, attr_args, decl_attr_list); | |
3e3d7e77 RK |
2977 | decl = build_decl_attribute_variant (decl, decl_attr_list); |
2978 | } | |
1a2927d2 | 2979 | |
1a2927d2 RK |
2980 | valid = 1; |
2981 | } | |
2982 | #endif | |
2983 | ||
2984 | #ifdef VALID_MACHINE_TYPE_ATTRIBUTE | |
2a3c15b5 | 2985 | if (VALID_MACHINE_TYPE_ATTRIBUTE (type, type_attr_list, attr_name, attr_args)) |
1a2927d2 | 2986 | { |
2a3c15b5 DE |
2987 | tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name), |
2988 | type_attr_list); | |
2989 | ||
2990 | if (attr != NULL_TREE) | |
3e3d7e77 | 2991 | { |
2a3c15b5 DE |
2992 | /* Override existing arguments. |
2993 | ??? This currently works since attribute arguments are not | |
2994 | included in `attribute_hash_list'. Something more complicated | |
2995 | may be needed in the future. */ | |
2996 | TREE_VALUE (attr) = attr_args; | |
2997 | } | |
2998 | else | |
2999 | { | |
3000 | type_attr_list = tree_cons (attr_name, attr_args, type_attr_list); | |
3e3d7e77 RK |
3001 | type = build_type_attribute_variant (type, type_attr_list); |
3002 | } | |
4084f789 RK |
3003 | if (decl != 0) |
3004 | TREE_TYPE (decl) = type; | |
1a2927d2 RK |
3005 | valid = 1; |
3006 | } | |
15c8ec1c RK |
3007 | |
3008 | /* Handle putting a type attribute on pointer-to-function-type by putting | |
3009 | the attribute on the function type. */ | |
3010 | else if (TREE_CODE (type) == POINTER_TYPE | |
3011 | && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE | |
3012 | && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type), type_attr_list, | |
3013 | attr_name, attr_args)) | |
3014 | { | |
3015 | tree inner_type = TREE_TYPE (type); | |
3016 | tree inner_attr_list = TYPE_ATTRIBUTES (inner_type); | |
3017 | tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name), | |
3018 | type_attr_list); | |
3019 | ||
3020 | if (attr != NULL_TREE) | |
3021 | TREE_VALUE (attr) = attr_args; | |
3022 | else | |
3023 | { | |
3024 | inner_attr_list = tree_cons (attr_name, attr_args, inner_attr_list); | |
3025 | inner_type = build_type_attribute_variant (inner_type, | |
3026 | inner_attr_list); | |
3027 | } | |
3028 | ||
3029 | if (decl != 0) | |
3030 | TREE_TYPE (decl) = build_pointer_type (inner_type); | |
3031 | ||
3032 | valid = 1; | |
3033 | } | |
1a2927d2 RK |
3034 | #endif |
3035 | ||
3036 | return valid; | |
3037 | } | |
2a3c15b5 DE |
3038 | |
3039 | /* Return non-zero if IDENT is a valid name for attribute ATTR, | |
3040 | or zero if not. | |
3041 | ||
3042 | We try both `text' and `__text__', ATTR may be either one. */ | |
3043 | /* ??? It might be a reasonable simplification to require ATTR to be only | |
3044 | `text'. One might then also require attribute lists to be stored in | |
3045 | their canonicalized form. */ | |
3046 | ||
3047 | int | |
3048 | is_attribute_p (attr, ident) | |
3049 | char *attr; | |
3050 | tree ident; | |
3051 | { | |
3052 | int ident_len, attr_len; | |
3053 | char *p; | |
3054 | ||
3055 | if (TREE_CODE (ident) != IDENTIFIER_NODE) | |
3056 | return 0; | |
3057 | ||
3058 | if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0) | |
3059 | return 1; | |
3060 | ||
3061 | p = IDENTIFIER_POINTER (ident); | |
3062 | ident_len = strlen (p); | |
3063 | attr_len = strlen (attr); | |
3064 | ||
3065 | /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */ | |
3066 | if (attr[0] == '_') | |
3067 | { | |
3068 | if (attr[1] != '_' | |
3069 | || attr[attr_len - 2] != '_' | |
3070 | || attr[attr_len - 1] != '_') | |
3071 | abort (); | |
3072 | if (ident_len == attr_len - 4 | |
3073 | && strncmp (attr + 2, p, attr_len - 4) == 0) | |
3074 | return 1; | |
3075 | } | |
3076 | else | |
3077 | { | |
3078 | if (ident_len == attr_len + 4 | |
3079 | && p[0] == '_' && p[1] == '_' | |
3080 | && p[ident_len - 2] == '_' && p[ident_len - 1] == '_' | |
3081 | && strncmp (attr, p + 2, attr_len) == 0) | |
3082 | return 1; | |
3083 | } | |
3084 | ||
3085 | return 0; | |
3086 | } | |
3087 | ||
3088 | /* Given an attribute name and a list of attributes, return a pointer to the | |
3089 | attribute's list element if the attribute is part of the list, or NULL_TREE | |
3090 | if not found. */ | |
3091 | ||
3092 | tree | |
3093 | lookup_attribute (attr_name, list) | |
3094 | char *attr_name; | |
3095 | tree list; | |
3096 | { | |
3097 | tree l; | |
3098 | ||
3099 | for (l = list; l; l = TREE_CHAIN (l)) | |
3100 | { | |
3101 | if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE) | |
3102 | abort (); | |
3103 | if (is_attribute_p (attr_name, TREE_PURPOSE (l))) | |
3104 | return l; | |
3105 | } | |
3106 | ||
3107 | return NULL_TREE; | |
3108 | } | |
91e97eb8 | 3109 | \f |
c6a1db6c RS |
3110 | /* Return a type like TYPE except that its TYPE_READONLY is CONSTP |
3111 | and its TYPE_VOLATILE is VOLATILEP. | |
3112 | ||
3113 | Such variant types already made are recorded so that duplicates | |
3114 | are not made. | |
3115 | ||
3116 | A variant types should never be used as the type of an expression. | |
3117 | Always copy the variant information into the TREE_READONLY | |
3118 | and TREE_THIS_VOLATILE of the expression, and then give the expression | |
3119 | as its type the "main variant", the variant whose TYPE_READONLY | |
3120 | and TYPE_VOLATILE are zero. Use TYPE_MAIN_VARIANT to find the | |
3121 | main variant. */ | |
3122 | ||
3123 | tree | |
3124 | build_type_variant (type, constp, volatilep) | |
3125 | tree type; | |
3126 | int constp, volatilep; | |
3127 | { | |
2c3dd6b7 | 3128 | register tree t; |
c6a1db6c RS |
3129 | |
3130 | /* Treat any nonzero argument as 1. */ | |
3131 | constp = !!constp; | |
3132 | volatilep = !!volatilep; | |
3133 | ||
e24fa534 JW |
3134 | /* Search the chain of variants to see if there is already one there just |
3135 | like the one we need to have. If so, use that existing one. We must | |
3136 | preserve the TYPE_NAME, since there is code that depends on this. */ | |
3137 | ||
3138 | for (t = TYPE_MAIN_VARIANT(type); t; t = TYPE_NEXT_VARIANT (t)) | |
3139 | if (constp == TYPE_READONLY (t) && volatilep == TYPE_VOLATILE (t) | |
3140 | && TYPE_NAME (t) == TYPE_NAME (type)) | |
3141 | return t; | |
c6a1db6c RS |
3142 | |
3143 | /* We need a new one. */ | |
c6a1db6c | 3144 | |
2c3dd6b7 | 3145 | t = build_type_copy (type); |
c6a1db6c RS |
3146 | TYPE_READONLY (t) = constp; |
3147 | TYPE_VOLATILE (t) = volatilep; | |
c6a1db6c | 3148 | |
c6a1db6c RS |
3149 | return t; |
3150 | } | |
b4ac57ab | 3151 | |
15c76378 RS |
3152 | /* Give TYPE a new main variant: NEW_MAIN. |
3153 | This is the right thing to do only when something else | |
3154 | about TYPE is modified in place. */ | |
3155 | ||
5cf3f467 | 3156 | void |
15c76378 RS |
3157 | change_main_variant (type, new_main) |
3158 | tree type, new_main; | |
3159 | { | |
3160 | tree t; | |
3161 | tree omain = TYPE_MAIN_VARIANT (type); | |
3162 | ||
3163 | /* Remove TYPE from the TYPE_NEXT_VARIANT chain of its main variant. */ | |
3164 | if (TYPE_NEXT_VARIANT (omain) == type) | |
3165 | TYPE_NEXT_VARIANT (omain) = TYPE_NEXT_VARIANT (type); | |
3166 | else | |
3167 | for (t = TYPE_NEXT_VARIANT (omain); t && TYPE_NEXT_VARIANT (t); | |
3168 | t = TYPE_NEXT_VARIANT (t)) | |
3169 | if (TYPE_NEXT_VARIANT (t) == type) | |
3170 | { | |
3171 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (type); | |
3172 | break; | |
3173 | } | |
3174 | ||
3175 | TYPE_MAIN_VARIANT (type) = new_main; | |
3176 | TYPE_NEXT_VARIANT (type) = TYPE_NEXT_VARIANT (new_main); | |
3177 | TYPE_NEXT_VARIANT (new_main) = type; | |
3178 | } | |
3179 | ||
b4ac57ab RS |
3180 | /* Create a new variant of TYPE, equivalent but distinct. |
3181 | This is so the caller can modify it. */ | |
3182 | ||
3183 | tree | |
3184 | build_type_copy (type) | |
3185 | tree type; | |
3186 | { | |
3187 | register tree t, m = TYPE_MAIN_VARIANT (type); | |
3188 | register struct obstack *ambient_obstack = current_obstack; | |
3189 | ||
d9cbc259 | 3190 | current_obstack = TYPE_OBSTACK (type); |
b4ac57ab | 3191 | t = copy_node (type); |
d9cbc259 RK |
3192 | current_obstack = ambient_obstack; |
3193 | ||
b4ac57ab RS |
3194 | TYPE_POINTER_TO (t) = 0; |
3195 | TYPE_REFERENCE_TO (t) = 0; | |
3196 | ||
3197 | /* Add this type to the chain of variants of TYPE. */ | |
3198 | TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m); | |
3199 | TYPE_NEXT_VARIANT (m) = t; | |
3200 | ||
b4ac57ab RS |
3201 | return t; |
3202 | } | |
c6a1db6c RS |
3203 | \f |
3204 | /* Hashing of types so that we don't make duplicates. | |
3205 | The entry point is `type_hash_canon'. */ | |
3206 | ||
3207 | /* Each hash table slot is a bucket containing a chain | |
3208 | of these structures. */ | |
3209 | ||
3210 | struct type_hash | |
3211 | { | |
3212 | struct type_hash *next; /* Next structure in the bucket. */ | |
3213 | int hashcode; /* Hash code of this type. */ | |
3214 | tree type; /* The type recorded here. */ | |
3215 | }; | |
3216 | ||
3217 | /* Now here is the hash table. When recording a type, it is added | |
3218 | to the slot whose index is the hash code mod the table size. | |
3219 | Note that the hash table is used for several kinds of types | |
3220 | (function types, array types and array index range types, for now). | |
3221 | While all these live in the same table, they are completely independent, | |
3222 | and the hash code is computed differently for each of these. */ | |
3223 | ||
3224 | #define TYPE_HASH_SIZE 59 | |
3225 | struct type_hash *type_hash_table[TYPE_HASH_SIZE]; | |
3226 | ||
c6a1db6c RS |
3227 | /* Compute a hash code for a list of types (chain of TREE_LIST nodes |
3228 | with types in the TREE_VALUE slots), by adding the hash codes | |
3229 | of the individual types. */ | |
3230 | ||
3231 | int | |
3232 | type_hash_list (list) | |
3233 | tree list; | |
3234 | { | |
3235 | register int hashcode; | |
3236 | register tree tail; | |
3237 | for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail)) | |
3238 | hashcode += TYPE_HASH (TREE_VALUE (tail)); | |
3239 | return hashcode; | |
3240 | } | |
3241 | ||
3242 | /* Look in the type hash table for a type isomorphic to TYPE. | |
3243 | If one is found, return it. Otherwise return 0. */ | |
3244 | ||
3245 | tree | |
3246 | type_hash_lookup (hashcode, type) | |
3247 | int hashcode; | |
3248 | tree type; | |
3249 | { | |
3250 | register struct type_hash *h; | |
3251 | for (h = type_hash_table[hashcode % TYPE_HASH_SIZE]; h; h = h->next) | |
3252 | if (h->hashcode == hashcode | |
3253 | && TREE_CODE (h->type) == TREE_CODE (type) | |
3254 | && TREE_TYPE (h->type) == TREE_TYPE (type) | |
91e97eb8 RK |
3255 | && attribute_list_equal (TYPE_ATTRIBUTES (h->type), |
3256 | TYPE_ATTRIBUTES (type)) | |
c6a1db6c RS |
3257 | && (TYPE_MAX_VALUE (h->type) == TYPE_MAX_VALUE (type) |
3258 | || tree_int_cst_equal (TYPE_MAX_VALUE (h->type), | |
3259 | TYPE_MAX_VALUE (type))) | |
3260 | && (TYPE_MIN_VALUE (h->type) == TYPE_MIN_VALUE (type) | |
3261 | || tree_int_cst_equal (TYPE_MIN_VALUE (h->type), | |
3262 | TYPE_MIN_VALUE (type))) | |
364e1f1c | 3263 | /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */ |
c6a1db6c RS |
3264 | && (TYPE_DOMAIN (h->type) == TYPE_DOMAIN (type) |
3265 | || (TYPE_DOMAIN (h->type) | |
3266 | && TREE_CODE (TYPE_DOMAIN (h->type)) == TREE_LIST | |
3267 | && TYPE_DOMAIN (type) | |
3268 | && TREE_CODE (TYPE_DOMAIN (type)) == TREE_LIST | |
364e1f1c RK |
3269 | && type_list_equal (TYPE_DOMAIN (h->type), |
3270 | TYPE_DOMAIN (type))))) | |
c6a1db6c RS |
3271 | return h->type; |
3272 | return 0; | |
3273 | } | |
3274 | ||
3275 | /* Add an entry to the type-hash-table | |
3276 | for a type TYPE whose hash code is HASHCODE. */ | |
3277 | ||
3278 | void | |
3279 | type_hash_add (hashcode, type) | |
3280 | int hashcode; | |
3281 | tree type; | |
3282 | { | |
3283 | register struct type_hash *h; | |
3284 | ||
3285 | h = (struct type_hash *) oballoc (sizeof (struct type_hash)); | |
3286 | h->hashcode = hashcode; | |
3287 | h->type = type; | |
3288 | h->next = type_hash_table[hashcode % TYPE_HASH_SIZE]; | |
3289 | type_hash_table[hashcode % TYPE_HASH_SIZE] = h; | |
3290 | } | |
3291 | ||
3292 | /* Given TYPE, and HASHCODE its hash code, return the canonical | |
3293 | object for an identical type if one already exists. | |
3294 | Otherwise, return TYPE, and record it as the canonical object | |
3295 | if it is a permanent object. | |
3296 | ||
3297 | To use this function, first create a type of the sort you want. | |
3298 | Then compute its hash code from the fields of the type that | |
3299 | make it different from other similar types. | |
3300 | Then call this function and use the value. | |
3301 | This function frees the type you pass in if it is a duplicate. */ | |
3302 | ||
3303 | /* Set to 1 to debug without canonicalization. Never set by program. */ | |
3304 | int debug_no_type_hash = 0; | |
3305 | ||
3306 | tree | |
3307 | type_hash_canon (hashcode, type) | |
3308 | int hashcode; | |
3309 | tree type; | |
3310 | { | |
3311 | tree t1; | |
3312 | ||
3313 | if (debug_no_type_hash) | |
3314 | return type; | |
3315 | ||
3316 | t1 = type_hash_lookup (hashcode, type); | |
3317 | if (t1 != 0) | |
3318 | { | |
af493865 | 3319 | obstack_free (TYPE_OBSTACK (type), type); |
c6a1db6c RS |
3320 | #ifdef GATHER_STATISTICS |
3321 | tree_node_counts[(int)t_kind]--; | |
3322 | tree_node_sizes[(int)t_kind] -= sizeof (struct tree_type); | |
3323 | #endif | |
3324 | return t1; | |
3325 | } | |
3326 | ||
af493865 RK |
3327 | /* If this is a permanent type, record it for later reuse. */ |
3328 | if (TREE_PERMANENT (type)) | |
c6a1db6c RS |
3329 | type_hash_add (hashcode, type); |
3330 | ||
3331 | return type; | |
3332 | } | |
3333 | ||
2a3c15b5 DE |
3334 | /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes |
3335 | with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots), | |
3336 | by adding the hash codes of the individual attributes. */ | |
3e3d7e77 RK |
3337 | |
3338 | int | |
2a3c15b5 DE |
3339 | attribute_hash_list (list) |
3340 | tree list; | |
3e3d7e77 | 3341 | { |
2a3c15b5 DE |
3342 | register int hashcode; |
3343 | register tree tail; | |
3344 | for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail)) | |
3345 | /* ??? Do we want to add in TREE_VALUE too? */ | |
3346 | hashcode += TYPE_HASH (TREE_PURPOSE (tail)); | |
3347 | return hashcode; | |
3e3d7e77 RK |
3348 | } |
3349 | ||
91e97eb8 RK |
3350 | /* Given two lists of attributes, return true if list l2 is |
3351 | equivalent to l1. */ | |
3352 | ||
3353 | int | |
3354 | attribute_list_equal (l1, l2) | |
3355 | tree l1, l2; | |
3356 | { | |
3357 | return attribute_list_contained (l1, l2) | |
3358 | && attribute_list_contained (l2, l1); | |
3359 | } | |
3360 | ||
2a3c15b5 DE |
3361 | /* Given two lists of attributes, return true if list L2 is |
3362 | completely contained within L1. */ | |
3363 | /* ??? This would be faster if attribute names were stored in a canonicalized | |
3364 | form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method | |
3365 | must be used to show these elements are equivalent (which they are). */ | |
3366 | /* ??? It's not clear that attributes with arguments will always be handled | |
3367 | correctly. */ | |
91e97eb8 RK |
3368 | |
3369 | int | |
3370 | attribute_list_contained (l1, l2) | |
3371 | tree l1, l2; | |
3372 | { | |
3373 | register tree t1, t2; | |
3374 | ||
3375 | /* First check the obvious, maybe the lists are identical. */ | |
3376 | if (l1 == l2) | |
3377 | return 1; | |
3378 | ||
2a3c15b5 | 3379 | /* Maybe the lists are similar. */ |
91e97eb8 RK |
3380 | for (t1 = l1, t2 = l2; |
3381 | t1 && t2 | |
2a3c15b5 | 3382 | && TREE_PURPOSE (t1) == TREE_PURPOSE (t2) |
91e97eb8 RK |
3383 | && TREE_VALUE (t1) == TREE_VALUE (t2); |
3384 | t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)); | |
3385 | ||
3386 | /* Maybe the lists are equal. */ | |
3387 | if (t1 == 0 && t2 == 0) | |
3388 | return 1; | |
3389 | ||
3390 | for (; t2; t2 = TREE_CHAIN (t2)) | |
2a3c15b5 | 3391 | { |
364e1f1c RK |
3392 | tree attr |
3393 | = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1); | |
2a3c15b5 DE |
3394 | |
3395 | if (attr == NULL_TREE) | |
91e97eb8 | 3396 | return 0; |
2a3c15b5 DE |
3397 | if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1) |
3398 | return 0; | |
3399 | } | |
3e3d7e77 | 3400 | |
91e97eb8 RK |
3401 | return 1; |
3402 | } | |
3403 | ||
c6a1db6c RS |
3404 | /* Given two lists of types |
3405 | (chains of TREE_LIST nodes with types in the TREE_VALUE slots) | |
3406 | return 1 if the lists contain the same types in the same order. | |
3407 | Also, the TREE_PURPOSEs must match. */ | |
3408 | ||
3409 | int | |
3410 | type_list_equal (l1, l2) | |
3411 | tree l1, l2; | |
3412 | { | |
3413 | register tree t1, t2; | |
364e1f1c | 3414 | |
c6a1db6c | 3415 | for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2)) |
364e1f1c RK |
3416 | if (TREE_VALUE (t1) != TREE_VALUE (t2) |
3417 | || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2) | |
bbda4250 JM |
3418 | && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)) |
3419 | && (TREE_TYPE (TREE_PURPOSE (t1)) | |
3420 | == TREE_TYPE (TREE_PURPOSE (t2)))))) | |
364e1f1c | 3421 | return 0; |
c6a1db6c RS |
3422 | |
3423 | return t1 == t2; | |
3424 | } | |
3425 | ||
3426 | /* Nonzero if integer constants T1 and T2 | |
3427 | represent the same constant value. */ | |
3428 | ||
3429 | int | |
3430 | tree_int_cst_equal (t1, t2) | |
3431 | tree t1, t2; | |
3432 | { | |
3433 | if (t1 == t2) | |
3434 | return 1; | |
3435 | if (t1 == 0 || t2 == 0) | |
3436 | return 0; | |
3437 | if (TREE_CODE (t1) == INTEGER_CST | |
3438 | && TREE_CODE (t2) == INTEGER_CST | |
3439 | && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
3440 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2)) | |
3441 | return 1; | |
3442 | return 0; | |
3443 | } | |
3444 | ||
3445 | /* Nonzero if integer constants T1 and T2 represent values that satisfy <. | |
3446 | The precise way of comparison depends on their data type. */ | |
3447 | ||
3448 | int | |
3449 | tree_int_cst_lt (t1, t2) | |
3450 | tree t1, t2; | |
3451 | { | |
3452 | if (t1 == t2) | |
3453 | return 0; | |
3454 | ||
3455 | if (!TREE_UNSIGNED (TREE_TYPE (t1))) | |
3456 | return INT_CST_LT (t1, t2); | |
3457 | return INT_CST_LT_UNSIGNED (t1, t2); | |
3458 | } | |
3459 | ||
6d9cb074 RK |
3460 | /* Return an indication of the sign of the integer constant T. |
3461 | The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0. | |
3462 | Note that -1 will never be returned it T's type is unsigned. */ | |
3463 | ||
3464 | int | |
3465 | tree_int_cst_sgn (t) | |
3466 | tree t; | |
3467 | { | |
3468 | if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0) | |
3469 | return 0; | |
3470 | else if (TREE_UNSIGNED (TREE_TYPE (t))) | |
3471 | return 1; | |
3472 | else if (TREE_INT_CST_HIGH (t) < 0) | |
3473 | return -1; | |
3474 | else | |
3475 | return 1; | |
3476 | } | |
3477 | ||
364e1f1c RK |
3478 | /* Compare two constructor-element-type constants. Return 1 if the lists |
3479 | are known to be equal; otherwise return 0. */ | |
3480 | ||
c6a1db6c RS |
3481 | int |
3482 | simple_cst_list_equal (l1, l2) | |
3483 | tree l1, l2; | |
3484 | { | |
3485 | while (l1 != NULL_TREE && l2 != NULL_TREE) | |
3486 | { | |
364e1f1c | 3487 | if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1) |
c6a1db6c | 3488 | return 0; |
364e1f1c | 3489 | |
c6a1db6c RS |
3490 | l1 = TREE_CHAIN (l1); |
3491 | l2 = TREE_CHAIN (l2); | |
3492 | } | |
364e1f1c | 3493 | |
c6a1db6c RS |
3494 | return (l1 == l2); |
3495 | } | |
3496 | ||
3497 | /* Return truthvalue of whether T1 is the same tree structure as T2. | |
3498 | Return 1 if they are the same. | |
3499 | Return 0 if they are understandably different. | |
3500 | Return -1 if either contains tree structure not understood by | |
3501 | this function. */ | |
3502 | ||
3503 | int | |
3504 | simple_cst_equal (t1, t2) | |
3505 | tree t1, t2; | |
3506 | { | |
3507 | register enum tree_code code1, code2; | |
3508 | int cmp; | |
3509 | ||
3510 | if (t1 == t2) | |
3511 | return 1; | |
3512 | if (t1 == 0 || t2 == 0) | |
3513 | return 0; | |
3514 | ||
3515 | code1 = TREE_CODE (t1); | |
3516 | code2 = TREE_CODE (t2); | |
3517 | ||
3518 | if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR) | |
3519 | if (code2 == NOP_EXPR || code2 == CONVERT_EXPR || code2 == NON_LVALUE_EXPR) | |
3520 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3521 | else | |
3522 | return simple_cst_equal (TREE_OPERAND (t1, 0), t2); | |
3523 | else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR | |
3524 | || code2 == NON_LVALUE_EXPR) | |
3525 | return simple_cst_equal (t1, TREE_OPERAND (t2, 0)); | |
3526 | ||
3527 | if (code1 != code2) | |
3528 | return 0; | |
3529 | ||
3530 | switch (code1) | |
3531 | { | |
3532 | case INTEGER_CST: | |
3533 | return TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2) | |
3534 | && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2); | |
3535 | ||
3536 | case REAL_CST: | |
3537 | return REAL_VALUES_EQUAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); | |
3538 | ||
3539 | case STRING_CST: | |
3540 | return TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) | |
3541 | && !bcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), | |
3542 | TREE_STRING_LENGTH (t1)); | |
3543 | ||
3544 | case CONSTRUCTOR: | |
3545 | abort (); | |
3546 | ||
3547 | case SAVE_EXPR: | |
3548 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3549 | ||
3550 | case CALL_EXPR: | |
3551 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3552 | if (cmp <= 0) | |
3553 | return cmp; | |
3554 | return simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); | |
3555 | ||
3556 | case TARGET_EXPR: | |
3557 | /* Special case: if either target is an unallocated VAR_DECL, | |
3558 | it means that it's going to be unified with whatever the | |
3559 | TARGET_EXPR is really supposed to initialize, so treat it | |
3560 | as being equivalent to anything. */ | |
3561 | if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL | |
3562 | && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE | |
3563 | && DECL_RTL (TREE_OPERAND (t1, 0)) == 0) | |
3564 | || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL | |
3565 | && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE | |
3566 | && DECL_RTL (TREE_OPERAND (t2, 0)) == 0)) | |
3567 | cmp = 1; | |
3568 | else | |
3569 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3570 | if (cmp <= 0) | |
3571 | return cmp; | |
3572 | return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1)); | |
3573 | ||
3574 | case WITH_CLEANUP_EXPR: | |
3575 | cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3576 | if (cmp <= 0) | |
3577 | return cmp; | |
3578 | return simple_cst_equal (TREE_OPERAND (t1, 2), TREE_OPERAND (t1, 2)); | |
3579 | ||
3580 | case COMPONENT_REF: | |
3581 | if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1)) | |
3582 | return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); | |
3583 | return 0; | |
3584 | ||
c6a1db6c RS |
3585 | case VAR_DECL: |
3586 | case PARM_DECL: | |
3587 | case CONST_DECL: | |
3588 | case FUNCTION_DECL: | |
3589 | return 0; | |
86aed40b | 3590 | } |
c6a1db6c | 3591 | |
8ae49a28 RK |
3592 | /* This general rule works for most tree codes. All exceptions should be |
3593 | handled above. If this is a language-specific tree code, we can't | |
3594 | trust what might be in the operand, so say we don't know | |
3595 | the situation. */ | |
97895806 | 3596 | if ((int) code1 |
8ae49a28 RK |
3597 | >= sizeof standard_tree_code_type / sizeof standard_tree_code_type[0]) |
3598 | return -1; | |
c6a1db6c | 3599 | |
86aed40b RS |
3600 | switch (TREE_CODE_CLASS (code1)) |
3601 | { | |
3602 | int i; | |
3603 | case '1': | |
3604 | case '2': | |
3605 | case '<': | |
3606 | case 'e': | |
3607 | case 'r': | |
3608 | case 's': | |
3609 | cmp = 1; | |
3610 | for (i=0; i<tree_code_length[(int) code1]; ++i) | |
3611 | { | |
3612 | cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)); | |
3613 | if (cmp <= 0) | |
3614 | return cmp; | |
3615 | } | |
3616 | return cmp; | |
c6a1db6c | 3617 | } |
86aed40b RS |
3618 | |
3619 | return -1; | |
c6a1db6c RS |
3620 | } |
3621 | \f | |
3622 | /* Constructors for pointer, array and function types. | |
3623 | (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are | |
3624 | constructed by language-dependent code, not here.) */ | |
3625 | ||
3626 | /* Construct, lay out and return the type of pointers to TO_TYPE. | |
3627 | If such a type has already been constructed, reuse it. */ | |
3628 | ||
3629 | tree | |
3630 | build_pointer_type (to_type) | |
3631 | tree to_type; | |
3632 | { | |
3633 | register tree t = TYPE_POINTER_TO (to_type); | |
c6a1db6c RS |
3634 | |
3635 | /* First, if we already have a type for pointers to TO_TYPE, use it. */ | |
3636 | ||
3637 | if (t) | |
3638 | return t; | |
3639 | ||
d9cbc259 RK |
3640 | /* We need a new one. Put this in the same obstack as TO_TYPE. */ |
3641 | push_obstacks (TYPE_OBSTACK (to_type), TYPE_OBSTACK (to_type)); | |
c6a1db6c | 3642 | t = make_node (POINTER_TYPE); |
d9cbc259 RK |
3643 | pop_obstacks (); |
3644 | ||
c6a1db6c RS |
3645 | TREE_TYPE (t) = to_type; |
3646 | ||
3647 | /* Record this type as the pointer to TO_TYPE. */ | |
3648 | TYPE_POINTER_TO (to_type) = t; | |
3649 | ||
3650 | /* Lay out the type. This function has many callers that are concerned | |
3651 | with expression-construction, and this simplifies them all. | |
d9cbc259 | 3652 | Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */ |
c6a1db6c RS |
3653 | layout_type (t); |
3654 | ||
c6a1db6c RS |
3655 | return t; |
3656 | } | |
3657 | ||
3658 | /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE. | |
3659 | MAXVAL should be the maximum value in the domain | |
3660 | (one less than the length of the array). */ | |
3661 | ||
3662 | tree | |
3663 | build_index_type (maxval) | |
3664 | tree maxval; | |
3665 | { | |
3666 | register tree itype = make_node (INTEGER_TYPE); | |
3667 | TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype); | |
3668 | TYPE_MIN_VALUE (itype) = build_int_2 (0, 0); | |
3669 | TREE_TYPE (TYPE_MIN_VALUE (itype)) = sizetype; | |
3670 | TYPE_MAX_VALUE (itype) = convert (sizetype, maxval); | |
3671 | TYPE_MODE (itype) = TYPE_MODE (sizetype); | |
3672 | TYPE_SIZE (itype) = TYPE_SIZE (sizetype); | |
3673 | TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype); | |
3674 | if (TREE_CODE (maxval) == INTEGER_CST) | |
3675 | { | |
bc99efc9 | 3676 | int maxint = (int) TREE_INT_CST_LOW (maxval); |
cdc5a032 RS |
3677 | /* If the domain should be empty, make sure the maxval |
3678 | remains -1 and is not spoiled by truncation. */ | |
3679 | if (INT_CST_LT (maxval, integer_zero_node)) | |
3680 | { | |
3681 | TYPE_MAX_VALUE (itype) = build_int_2 (-1, -1); | |
3682 | TREE_TYPE (TYPE_MAX_VALUE (itype)) = sizetype; | |
3683 | } | |
bc99efc9 | 3684 | return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype); |
c6a1db6c RS |
3685 | } |
3686 | else | |
3687 | return itype; | |
3688 | } | |
3689 | ||
742e43a2 | 3690 | /* Create a range of some discrete type TYPE (an INTEGER_TYPE, |
238a1856 | 3691 | ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with |
742e43a2 PB |
3692 | low bound LOWVAL and high bound HIGHVAL. |
3693 | if TYPE==NULL_TREE, sizetype is used. */ | |
c6a1db6c RS |
3694 | |
3695 | tree | |
742e43a2 PB |
3696 | build_range_type (type, lowval, highval) |
3697 | tree type, lowval, highval; | |
c6a1db6c RS |
3698 | { |
3699 | register tree itype = make_node (INTEGER_TYPE); | |
742e43a2 PB |
3700 | TREE_TYPE (itype) = type; |
3701 | if (type == NULL_TREE) | |
3702 | type = sizetype; | |
3703 | TYPE_PRECISION (itype) = TYPE_PRECISION (type); | |
3704 | TYPE_MIN_VALUE (itype) = convert (type, lowval); | |
3705 | TYPE_MAX_VALUE (itype) = convert (type, highval); | |
3706 | TYPE_MODE (itype) = TYPE_MODE (type); | |
3707 | TYPE_SIZE (itype) = TYPE_SIZE (type); | |
3708 | TYPE_ALIGN (itype) = TYPE_ALIGN (type); | |
c6a1db6c RS |
3709 | if ((TREE_CODE (lowval) == INTEGER_CST) |
3710 | && (TREE_CODE (highval) == INTEGER_CST)) | |
3711 | { | |
37366632 RK |
3712 | HOST_WIDE_INT highint = TREE_INT_CST_LOW (highval); |
3713 | HOST_WIDE_INT lowint = TREE_INT_CST_LOW (lowval); | |
bc99efc9 RS |
3714 | int maxint = (int) (highint - lowint); |
3715 | return type_hash_canon (maxint < 0 ? ~maxint : maxint, itype); | |
c6a1db6c RS |
3716 | } |
3717 | else | |
3718 | return itype; | |
3719 | } | |
3720 | ||
742e43a2 PB |
3721 | /* Just like build_index_type, but takes lowval and highval instead |
3722 | of just highval (maxval). */ | |
3723 | ||
3724 | tree | |
3725 | build_index_2_type (lowval,highval) | |
3726 | tree lowval, highval; | |
3727 | { | |
3728 | return build_range_type (NULL_TREE, lowval, highval); | |
3729 | } | |
3730 | ||
c6a1db6c RS |
3731 | /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense). |
3732 | Needed because when index types are not hashed, equal index types | |
3733 | built at different times appear distinct, even though structurally, | |
3734 | they are not. */ | |
3735 | ||
3736 | int | |
3737 | index_type_equal (itype1, itype2) | |
3738 | tree itype1, itype2; | |
3739 | { | |
3740 | if (TREE_CODE (itype1) != TREE_CODE (itype2)) | |
3741 | return 0; | |
3742 | if (TREE_CODE (itype1) == INTEGER_TYPE) | |
3743 | { | |
3744 | if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2) | |
3745 | || TYPE_MODE (itype1) != TYPE_MODE (itype2) | |
364e1f1c | 3746 | || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1 |
c6a1db6c RS |
3747 | || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2)) |
3748 | return 0; | |
364e1f1c RK |
3749 | if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1), |
3750 | TYPE_MIN_VALUE (itype2)) | |
3751 | && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1), | |
3752 | TYPE_MAX_VALUE (itype2))) | |
c6a1db6c RS |
3753 | return 1; |
3754 | } | |
364e1f1c | 3755 | |
c6a1db6c RS |
3756 | return 0; |
3757 | } | |
3758 | ||
3759 | /* Construct, lay out and return the type of arrays of elements with ELT_TYPE | |
3760 | and number of elements specified by the range of values of INDEX_TYPE. | |
3761 | If such a type has already been constructed, reuse it. */ | |
3762 | ||
3763 | tree | |
3764 | build_array_type (elt_type, index_type) | |
3765 | tree elt_type, index_type; | |
3766 | { | |
3767 | register tree t; | |
3768 | int hashcode; | |
3769 | ||
3770 | if (TREE_CODE (elt_type) == FUNCTION_TYPE) | |
3771 | { | |
3772 | error ("arrays of functions are not meaningful"); | |
3773 | elt_type = integer_type_node; | |
3774 | } | |
3775 | ||
3776 | /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */ | |
3777 | build_pointer_type (elt_type); | |
3778 | ||
3779 | /* Allocate the array after the pointer type, | |
3780 | in case we free it in type_hash_canon. */ | |
3781 | t = make_node (ARRAY_TYPE); | |
3782 | TREE_TYPE (t) = elt_type; | |
3783 | TYPE_DOMAIN (t) = index_type; | |
3784 | ||
3785 | if (index_type == 0) | |
15c76378 | 3786 | { |
15c76378 RS |
3787 | return t; |
3788 | } | |
c6a1db6c RS |
3789 | |
3790 | hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type); | |
3791 | t = type_hash_canon (hashcode, t); | |
3792 | ||
2026444a RS |
3793 | #if 0 /* This led to crashes, because it could put a temporary node |
3794 | on the TYPE_NEXT_VARIANT chain of a permanent one. */ | |
15c76378 RS |
3795 | /* The main variant of an array type should always |
3796 | be an array whose element type is the main variant. */ | |
3797 | if (elt_type != TYPE_MAIN_VARIANT (elt_type)) | |
3798 | change_main_variant (t, build_array_type (TYPE_MAIN_VARIANT (elt_type), | |
3799 | index_type)); | |
2026444a | 3800 | #endif |
15c76378 | 3801 | |
c6a1db6c RS |
3802 | if (TYPE_SIZE (t) == 0) |
3803 | layout_type (t); | |
3804 | return t; | |
3805 | } | |
3806 | ||
3807 | /* Construct, lay out and return | |
3808 | the type of functions returning type VALUE_TYPE | |
3809 | given arguments of types ARG_TYPES. | |
3810 | ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs | |
3811 | are data type nodes for the arguments of the function. | |
3812 | If such a type has already been constructed, reuse it. */ | |
3813 | ||
3814 | tree | |
3815 | build_function_type (value_type, arg_types) | |
3816 | tree value_type, arg_types; | |
3817 | { | |
3818 | register tree t; | |
3819 | int hashcode; | |
3820 | ||
c0560b8b | 3821 | if (TREE_CODE (value_type) == FUNCTION_TYPE) |
c6a1db6c | 3822 | { |
c0560b8b | 3823 | error ("function return type cannot be function"); |
c6a1db6c RS |
3824 | value_type = integer_type_node; |
3825 | } | |
3826 | ||
3827 | /* Make a node of the sort we want. */ | |
3828 | t = make_node (FUNCTION_TYPE); | |
3829 | TREE_TYPE (t) = value_type; | |
3830 | TYPE_ARG_TYPES (t) = arg_types; | |
3831 | ||
3832 | /* If we already have such a type, use the old one and free this one. */ | |
3833 | hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types); | |
3834 | t = type_hash_canon (hashcode, t); | |
3835 | ||
3836 | if (TYPE_SIZE (t) == 0) | |
3837 | layout_type (t); | |
3838 | return t; | |
3839 | } | |
3840 | ||
3841 | /* Build the node for the type of references-to-TO_TYPE. */ | |
3842 | ||
3843 | tree | |
3844 | build_reference_type (to_type) | |
3845 | tree to_type; | |
3846 | { | |
3847 | register tree t = TYPE_REFERENCE_TO (to_type); | |
3848 | register struct obstack *ambient_obstack = current_obstack; | |
3849 | register struct obstack *ambient_saveable_obstack = saveable_obstack; | |
3850 | ||
3851 | /* First, if we already have a type for pointers to TO_TYPE, use it. */ | |
3852 | ||
3853 | if (t) | |
3854 | return t; | |
3855 | ||
3856 | /* We need a new one. If TO_TYPE is permanent, make this permanent too. */ | |
3857 | if (TREE_PERMANENT (to_type)) | |
3858 | { | |
3859 | current_obstack = &permanent_obstack; | |
3860 | saveable_obstack = &permanent_obstack; | |
3861 | } | |
3862 | ||
3863 | t = make_node (REFERENCE_TYPE); | |
3864 | TREE_TYPE (t) = to_type; | |
3865 | ||
3866 | /* Record this type as the pointer to TO_TYPE. */ | |
3867 | TYPE_REFERENCE_TO (to_type) = t; | |
3868 | ||
3869 | layout_type (t); | |
3870 | ||
3871 | current_obstack = ambient_obstack; | |
3872 | saveable_obstack = ambient_saveable_obstack; | |
3873 | return t; | |
3874 | } | |
3875 | ||
3876 | /* Construct, lay out and return the type of methods belonging to class | |
3877 | BASETYPE and whose arguments and values are described by TYPE. | |
3878 | If that type exists already, reuse it. | |
3879 | TYPE must be a FUNCTION_TYPE node. */ | |
3880 | ||
3881 | tree | |
3882 | build_method_type (basetype, type) | |
3883 | tree basetype, type; | |
3884 | { | |
3885 | register tree t; | |
3886 | int hashcode; | |
3887 | ||
3888 | /* Make a node of the sort we want. */ | |
3889 | t = make_node (METHOD_TYPE); | |
3890 | ||
3891 | if (TREE_CODE (type) != FUNCTION_TYPE) | |
3892 | abort (); | |
3893 | ||
3894 | TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
3895 | TREE_TYPE (t) = TREE_TYPE (type); | |
3896 | ||
3897 | /* The actual arglist for this function includes a "hidden" argument | |
3898 | which is "this". Put it into the list of argument types. */ | |
3899 | ||
3900 | TYPE_ARG_TYPES (t) | |
37366632 RK |
3901 | = tree_cons (NULL_TREE, |
3902 | build_pointer_type (basetype), TYPE_ARG_TYPES (type)); | |
c6a1db6c RS |
3903 | |
3904 | /* If we already have such a type, use the old one and free this one. */ | |
3905 | hashcode = TYPE_HASH (basetype) + TYPE_HASH (type); | |
3906 | t = type_hash_canon (hashcode, t); | |
3907 | ||
3908 | if (TYPE_SIZE (t) == 0) | |
3909 | layout_type (t); | |
3910 | ||
3911 | return t; | |
3912 | } | |
3913 | ||
86aed40b RS |
3914 | /* Construct, lay out and return the type of offsets to a value |
3915 | of type TYPE, within an object of type BASETYPE. | |
3916 | If a suitable offset type exists already, reuse it. */ | |
c6a1db6c RS |
3917 | |
3918 | tree | |
3919 | build_offset_type (basetype, type) | |
3920 | tree basetype, type; | |
3921 | { | |
3922 | register tree t; | |
3923 | int hashcode; | |
3924 | ||
3925 | /* Make a node of the sort we want. */ | |
3926 | t = make_node (OFFSET_TYPE); | |
3927 | ||
3928 | TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype); | |
3929 | TREE_TYPE (t) = type; | |
3930 | ||
3931 | /* If we already have such a type, use the old one and free this one. */ | |
3932 | hashcode = TYPE_HASH (basetype) + TYPE_HASH (type); | |
3933 | t = type_hash_canon (hashcode, t); | |
3934 | ||
3935 | if (TYPE_SIZE (t) == 0) | |
3936 | layout_type (t); | |
3937 | ||
3938 | return t; | |
3939 | } | |
3940 | ||
3941 | /* Create a complex type whose components are COMPONENT_TYPE. */ | |
3942 | ||
3943 | tree | |
3944 | build_complex_type (component_type) | |
3945 | tree component_type; | |
3946 | { | |
3947 | register tree t; | |
3948 | int hashcode; | |
3949 | ||
3950 | /* Make a node of the sort we want. */ | |
3951 | t = make_node (COMPLEX_TYPE); | |
3952 | ||
3953 | TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type); | |
3954 | TYPE_VOLATILE (t) = TYPE_VOLATILE (component_type); | |
3955 | TYPE_READONLY (t) = TYPE_READONLY (component_type); | |
3956 | ||
3957 | /* If we already have such a type, use the old one and free this one. */ | |
3958 | hashcode = TYPE_HASH (component_type); | |
3959 | t = type_hash_canon (hashcode, t); | |
3960 | ||
3961 | if (TYPE_SIZE (t) == 0) | |
3962 | layout_type (t); | |
3963 | ||
3964 | return t; | |
3965 | } | |
3966 | \f | |
3967 | /* Return OP, stripped of any conversions to wider types as much as is safe. | |
3968 | Converting the value back to OP's type makes a value equivalent to OP. | |
3969 | ||
3970 | If FOR_TYPE is nonzero, we return a value which, if converted to | |
3971 | type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE. | |
3972 | ||
3973 | If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the | |
3974 | narrowest type that can hold the value, even if they don't exactly fit. | |
3975 | Otherwise, bit-field references are changed to a narrower type | |
3976 | only if they can be fetched directly from memory in that type. | |
3977 | ||
3978 | OP must have integer, real or enumeral type. Pointers are not allowed! | |
3979 | ||
3980 | There are some cases where the obvious value we could return | |
3981 | would regenerate to OP if converted to OP's type, | |
3982 | but would not extend like OP to wider types. | |
3983 | If FOR_TYPE indicates such extension is contemplated, we eschew such values. | |
3984 | For example, if OP is (unsigned short)(signed char)-1, | |
3985 | we avoid returning (signed char)-1 if FOR_TYPE is int, | |
3986 | even though extending that to an unsigned short would regenerate OP, | |
3987 | since the result of extending (signed char)-1 to (int) | |
3988 | is different from (int) OP. */ | |
3989 | ||
3990 | tree | |
3991 | get_unwidened (op, for_type) | |
3992 | register tree op; | |
3993 | tree for_type; | |
3994 | { | |
3995 | /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */ | |
3996 | /* TYPE_PRECISION is safe in place of type_precision since | |
3997 | pointer types are not allowed. */ | |
3998 | register tree type = TREE_TYPE (op); | |
3999 | register unsigned final_prec | |
4000 | = TYPE_PRECISION (for_type != 0 ? for_type : type); | |
4001 | register int uns | |
4002 | = (for_type != 0 && for_type != type | |
4003 | && final_prec > TYPE_PRECISION (type) | |
4004 | && TREE_UNSIGNED (type)); | |
4005 | register tree win = op; | |
4006 | ||
4007 | while (TREE_CODE (op) == NOP_EXPR) | |
4008 | { | |
4009 | register int bitschange | |
4010 | = TYPE_PRECISION (TREE_TYPE (op)) | |
4011 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))); | |
4012 | ||
4013 | /* Truncations are many-one so cannot be removed. | |
4014 | Unless we are later going to truncate down even farther. */ | |
4015 | if (bitschange < 0 | |
4016 | && final_prec > TYPE_PRECISION (TREE_TYPE (op))) | |
4017 | break; | |
4018 | ||
4019 | /* See what's inside this conversion. If we decide to strip it, | |
4020 | we will set WIN. */ | |
4021 | op = TREE_OPERAND (op, 0); | |
4022 | ||
4023 | /* If we have not stripped any zero-extensions (uns is 0), | |
4024 | we can strip any kind of extension. | |
4025 | If we have previously stripped a zero-extension, | |
4026 | only zero-extensions can safely be stripped. | |
4027 | Any extension can be stripped if the bits it would produce | |
4028 | are all going to be discarded later by truncating to FOR_TYPE. */ | |
4029 | ||
4030 | if (bitschange > 0) | |
4031 | { | |
4032 | if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op))) | |
4033 | win = op; | |
4034 | /* TREE_UNSIGNED says whether this is a zero-extension. | |
4035 | Let's avoid computing it if it does not affect WIN | |
4036 | and if UNS will not be needed again. */ | |
4037 | if ((uns || TREE_CODE (op) == NOP_EXPR) | |
4038 | && TREE_UNSIGNED (TREE_TYPE (op))) | |
4039 | { | |
4040 | uns = 1; | |
4041 | win = op; | |
4042 | } | |
4043 | } | |
4044 | } | |
4045 | ||
4046 | if (TREE_CODE (op) == COMPONENT_REF | |
4047 | /* Since type_for_size always gives an integer type. */ | |
4048 | && TREE_CODE (type) != REAL_TYPE) | |
4049 | { | |
4050 | unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1))); | |
4051 | type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1))); | |
4052 | ||
4053 | /* We can get this structure field in the narrowest type it fits in. | |
4054 | If FOR_TYPE is 0, do this only for a field that matches the | |
4055 | narrower type exactly and is aligned for it | |
4056 | The resulting extension to its nominal type (a fullword type) | |
4057 | must fit the same conditions as for other extensions. */ | |
4058 | ||
4059 | if (innerprec < TYPE_PRECISION (TREE_TYPE (op)) | |
4060 | && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))) | |
4061 | && (! uns || final_prec <= innerprec | |
4062 | || TREE_UNSIGNED (TREE_OPERAND (op, 1))) | |
4063 | && type != 0) | |
4064 | { | |
4065 | win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0), | |
4066 | TREE_OPERAND (op, 1)); | |
4067 | TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op); | |
4068 | TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op); | |
4069 | TREE_RAISES (win) = TREE_RAISES (op); | |
4070 | } | |
4071 | } | |
4072 | return win; | |
4073 | } | |
4074 | \f | |
4075 | /* Return OP or a simpler expression for a narrower value | |
4076 | which can be sign-extended or zero-extended to give back OP. | |
4077 | Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended | |
4078 | or 0 if the value should be sign-extended. */ | |
4079 | ||
4080 | tree | |
4081 | get_narrower (op, unsignedp_ptr) | |
4082 | register tree op; | |
4083 | int *unsignedp_ptr; | |
4084 | { | |
4085 | register int uns = 0; | |
4086 | int first = 1; | |
4087 | register tree win = op; | |
4088 | ||
4089 | while (TREE_CODE (op) == NOP_EXPR) | |
4090 | { | |
4091 | register int bitschange | |
4092 | = TYPE_PRECISION (TREE_TYPE (op)) | |
4093 | - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))); | |
4094 | ||
4095 | /* Truncations are many-one so cannot be removed. */ | |
4096 | if (bitschange < 0) | |
4097 | break; | |
4098 | ||
4099 | /* See what's inside this conversion. If we decide to strip it, | |
4100 | we will set WIN. */ | |
4101 | op = TREE_OPERAND (op, 0); | |
4102 | ||
4103 | if (bitschange > 0) | |
4104 | { | |
4105 | /* An extension: the outermost one can be stripped, | |
4106 | but remember whether it is zero or sign extension. */ | |
4107 | if (first) | |
4108 | uns = TREE_UNSIGNED (TREE_TYPE (op)); | |
4109 | /* Otherwise, if a sign extension has been stripped, | |
4110 | only sign extensions can now be stripped; | |
4111 | if a zero extension has been stripped, only zero-extensions. */ | |
4112 | else if (uns != TREE_UNSIGNED (TREE_TYPE (op))) | |
4113 | break; | |
4114 | first = 0; | |
4115 | } | |
e02b9957 DE |
4116 | else /* bitschange == 0 */ |
4117 | { | |
4118 | /* A change in nominal type can always be stripped, but we must | |
4119 | preserve the unsignedness. */ | |
4120 | if (first) | |
4121 | uns = TREE_UNSIGNED (TREE_TYPE (op)); | |
4122 | first = 0; | |
4123 | } | |
c6a1db6c RS |
4124 | |
4125 | win = op; | |
4126 | } | |
4127 | ||
4128 | if (TREE_CODE (op) == COMPONENT_REF | |
4129 | /* Since type_for_size always gives an integer type. */ | |
4130 | && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE) | |
4131 | { | |
4132 | unsigned innerprec = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op, 1))); | |
4133 | tree type = type_for_size (innerprec, TREE_UNSIGNED (op)); | |
4134 | ||
4135 | /* We can get this structure field in a narrower type that fits it, | |
4136 | but the resulting extension to its nominal type (a fullword type) | |
4137 | must satisfy the same conditions as for other extensions. | |
4138 | ||
4139 | Do this only for fields that are aligned (not bit-fields), | |
4140 | because when bit-field insns will be used there is no | |
4141 | advantage in doing this. */ | |
4142 | ||
4143 | if (innerprec < TYPE_PRECISION (TREE_TYPE (op)) | |
4144 | && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)) | |
4145 | && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1))) | |
4146 | && type != 0) | |
4147 | { | |
4148 | if (first) | |
4149 | uns = TREE_UNSIGNED (TREE_OPERAND (op, 1)); | |
4150 | win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0), | |
4151 | TREE_OPERAND (op, 1)); | |
4152 | TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op); | |
4153 | TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op); | |
4154 | TREE_RAISES (win) = TREE_RAISES (op); | |
4155 | } | |
4156 | } | |
4157 | *unsignedp_ptr = uns; | |
4158 | return win; | |
4159 | } | |
4160 | \f | |
4161 | /* Return the precision of a type, for arithmetic purposes. | |
4162 | Supports all types on which arithmetic is possible | |
4163 | (including pointer types). | |
4164 | It's not clear yet what will be right for complex types. */ | |
4165 | ||
4166 | int | |
4167 | type_precision (type) | |
4168 | register tree type; | |
4169 | { | |
4170 | return ((TREE_CODE (type) == INTEGER_TYPE | |
4171 | || TREE_CODE (type) == ENUMERAL_TYPE | |
4172 | || TREE_CODE (type) == REAL_TYPE) | |
4173 | ? TYPE_PRECISION (type) : POINTER_SIZE); | |
4174 | } | |
4175 | ||
4176 | /* Nonzero if integer constant C has a value that is permissible | |
4177 | for type TYPE (an INTEGER_TYPE). */ | |
4178 | ||
4179 | int | |
4180 | int_fits_type_p (c, type) | |
4181 | tree c, type; | |
4182 | { | |
4183 | if (TREE_UNSIGNED (type)) | |
857d2849 RK |
4184 | return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST |
4185 | && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c)) | |
4186 | && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST | |
4187 | && INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type)))); | |
c6a1db6c | 4188 | else |
857d2849 RK |
4189 | return (! (TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST |
4190 | && INT_CST_LT (TYPE_MAX_VALUE (type), c)) | |
4191 | && ! (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST | |
4192 | && INT_CST_LT (c, TYPE_MIN_VALUE (type)))); | |
c6a1db6c RS |
4193 | } |
4194 | ||
bfa30b22 | 4195 | /* Return the innermost context enclosing DECL that is |
c6a1db6c RS |
4196 | a FUNCTION_DECL, or zero if none. */ |
4197 | ||
4198 | tree | |
bfa30b22 RK |
4199 | decl_function_context (decl) |
4200 | tree decl; | |
c6a1db6c RS |
4201 | { |
4202 | tree context; | |
4203 | ||
bfa30b22 | 4204 | if (TREE_CODE (decl) == ERROR_MARK) |
c6a1db6c RS |
4205 | return 0; |
4206 | ||
bfa30b22 RK |
4207 | if (TREE_CODE (decl) == SAVE_EXPR) |
4208 | context = SAVE_EXPR_CONTEXT (decl); | |
c6a1db6c | 4209 | else |
bfa30b22 | 4210 | context = DECL_CONTEXT (decl); |
c6a1db6c RS |
4211 | |
4212 | while (context && TREE_CODE (context) != FUNCTION_DECL) | |
4213 | { | |
4214 | if (TREE_CODE (context) == RECORD_TYPE | |
4215 | || TREE_CODE (context) == UNION_TYPE) | |
fe1e3bf4 | 4216 | context = NULL_TREE; |
c6a1db6c RS |
4217 | else if (TREE_CODE (context) == TYPE_DECL) |
4218 | context = DECL_CONTEXT (context); | |
4219 | else if (TREE_CODE (context) == BLOCK) | |
4220 | context = BLOCK_SUPERCONTEXT (context); | |
4221 | else | |
4222 | /* Unhandled CONTEXT !? */ | |
4223 | abort (); | |
4224 | } | |
4225 | ||
4226 | return context; | |
4227 | } | |
4228 | ||
bfa30b22 | 4229 | /* Return the innermost context enclosing DECL that is |
c0560b8b | 4230 | a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none. |
c6a1db6c RS |
4231 | TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */ |
4232 | ||
4233 | tree | |
bfa30b22 RK |
4234 | decl_type_context (decl) |
4235 | tree decl; | |
c6a1db6c | 4236 | { |
bfa30b22 | 4237 | tree context = DECL_CONTEXT (decl); |
c6a1db6c RS |
4238 | |
4239 | while (context) | |
4240 | { | |
4241 | if (TREE_CODE (context) == RECORD_TYPE | |
c0560b8b RK |
4242 | || TREE_CODE (context) == UNION_TYPE |
4243 | || TREE_CODE (context) == QUAL_UNION_TYPE) | |
c6a1db6c RS |
4244 | return context; |
4245 | if (TREE_CODE (context) == TYPE_DECL | |
4246 | || TREE_CODE (context) == FUNCTION_DECL) | |
4247 | context = DECL_CONTEXT (context); | |
4248 | else if (TREE_CODE (context) == BLOCK) | |
4249 | context = BLOCK_SUPERCONTEXT (context); | |
4250 | else | |
4251 | /* Unhandled CONTEXT!? */ | |
4252 | abort (); | |
4253 | } | |
4254 | return NULL_TREE; | |
4255 | } | |
4256 | ||
4257 | void | |
4258 | print_obstack_statistics (str, o) | |
4259 | char *str; | |
4260 | struct obstack *o; | |
4261 | { | |
4262 | struct _obstack_chunk *chunk = o->chunk; | |
4263 | int n_chunks = 0; | |
4264 | int n_alloc = 0; | |
4265 | ||
4266 | while (chunk) | |
4267 | { | |
4268 | n_chunks += 1; | |
4269 | n_alloc += chunk->limit - &chunk->contents[0]; | |
4270 | chunk = chunk->prev; | |
4271 | } | |
4272 | fprintf (stderr, "obstack %s: %d bytes, %d chunks\n", | |
4273 | str, n_alloc, n_chunks); | |
4274 | } | |
4275 | void | |
4276 | dump_tree_statistics () | |
4277 | { | |
4278 | int i; | |
4279 | int total_nodes, total_bytes; | |
4280 | ||
4281 | fprintf (stderr, "\n??? tree nodes created\n\n"); | |
4282 | #ifdef GATHER_STATISTICS | |
4283 | fprintf (stderr, "Kind Nodes Bytes\n"); | |
4284 | fprintf (stderr, "-------------------------------------\n"); | |
4285 | total_nodes = total_bytes = 0; | |
4286 | for (i = 0; i < (int) all_kinds; i++) | |
4287 | { | |
4288 | fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i], | |
4289 | tree_node_counts[i], tree_node_sizes[i]); | |
4290 | total_nodes += tree_node_counts[i]; | |
4291 | total_bytes += tree_node_sizes[i]; | |
4292 | } | |
4293 | fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size); | |
4294 | fprintf (stderr, "-------------------------------------\n"); | |
4295 | fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes); | |
4296 | fprintf (stderr, "-------------------------------------\n"); | |
4297 | #else | |
4298 | fprintf (stderr, "(No per-node statistics)\n"); | |
4299 | #endif | |
4300 | print_lang_statistics (); | |
4301 | } | |
bb288278 PB |
4302 | \f |
4303 | #define FILE_FUNCTION_PREFIX_LEN 9 | |
4304 | ||
4305 | #ifndef NO_DOLLAR_IN_LABEL | |
4306 | #define FILE_FUNCTION_FORMAT "_GLOBAL_$D$%s" | |
4307 | #else /* NO_DOLLAR_IN_LABEL */ | |
4308 | #ifndef NO_DOT_IN_LABEL | |
4309 | #define FILE_FUNCTION_FORMAT "_GLOBAL_.D.%s" | |
4310 | #else /* NO_DOT_IN_LABEL */ | |
bea230d9 | 4311 | #define FILE_FUNCTION_FORMAT "_GLOBAL__D_%s" |
bb288278 PB |
4312 | #endif /* NO_DOT_IN_LABEL */ |
4313 | #endif /* NO_DOLLAR_IN_LABEL */ | |
4314 | ||
4315 | extern char * first_global_object_name; | |
4316 | ||
4317 | /* If KIND=='I', return a suitable global initializer (constructor) name. | |
4318 | If KIND=='D', return a suitable global clean-up (destructor) name. */ | |
4319 | ||
4320 | tree | |
4321 | get_file_function_name (kind) | |
4322 | int kind; | |
4323 | { | |
4324 | char *buf; | |
4325 | register char *p; | |
4326 | ||
4327 | if (first_global_object_name) | |
4328 | p = first_global_object_name; | |
4329 | else if (main_input_filename) | |
4330 | p = main_input_filename; | |
4331 | else | |
4332 | p = input_filename; | |
4333 | ||
4334 | buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)); | |
4335 | ||
4336 | /* Set up the name of the file-level functions we may need. */ | |
4337 | /* Use a global object (which is already required to be unique over | |
4338 | the program) rather than the file name (which imposes extra | |
4339 | constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */ | |
4340 | sprintf (buf, FILE_FUNCTION_FORMAT, p); | |
4341 | ||
9faa82d8 | 4342 | /* Don't need to pull weird characters out of global names. */ |
bb288278 PB |
4343 | if (p != first_global_object_name) |
4344 | { | |
4345 | for (p = buf+11; *p; p++) | |
4346 | if (! ((*p >= '0' && *p <= '9') | |
4347 | #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */ | |
4348 | #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */ | |
4349 | || *p == '.' | |
4350 | #endif | |
4351 | #endif | |
4352 | #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */ | |
4353 | || *p == '$' | |
4354 | #endif | |
4355 | #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */ | |
4356 | || *p == '.' | |
4357 | #endif | |
4358 | || (*p >= 'A' && *p <= 'Z') | |
4359 | || (*p >= 'a' && *p <= 'z'))) | |
4360 | *p = '_'; | |
4361 | } | |
4362 | ||
4363 | buf[FILE_FUNCTION_PREFIX_LEN] = kind; | |
4364 | ||
4365 | return get_identifier (buf); | |
4366 | } | |
bca949e2 | 4367 | \f |
9faa82d8 | 4368 | /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node. |
bca949e2 PB |
4369 | The result is placed in BUFFER (which has length BIT_SIZE), |
4370 | with one bit in each char ('\000' or '\001'). | |
4371 | ||
4372 | If the constructor is constant, NULL_TREE is returned. | |
4373 | Otherwise, a TREE_LIST of the non-constant elements is emitted. */ | |
4374 | ||
4375 | tree | |
4376 | get_set_constructor_bits (init, buffer, bit_size) | |
4377 | tree init; | |
4378 | char *buffer; | |
4379 | int bit_size; | |
4380 | { | |
4381 | int i; | |
4382 | tree vals; | |
4383 | HOST_WIDE_INT domain_min | |
4384 | = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init)))); | |
4385 | tree non_const_bits = NULL_TREE; | |
4386 | for (i = 0; i < bit_size; i++) | |
4387 | buffer[i] = 0; | |
4388 | ||
4389 | for (vals = TREE_OPERAND (init, 1); | |
4390 | vals != NULL_TREE; vals = TREE_CHAIN (vals)) | |
4391 | { | |
4392 | if (TREE_CODE (TREE_VALUE (vals)) != INTEGER_CST | |
4393 | || (TREE_PURPOSE (vals) != NULL_TREE | |
4394 | && TREE_CODE (TREE_PURPOSE (vals)) != INTEGER_CST)) | |
4395 | non_const_bits = | |
4396 | tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits); | |
4397 | else if (TREE_PURPOSE (vals) != NULL_TREE) | |
4398 | { | |
4399 | /* Set a range of bits to ones. */ | |
4400 | HOST_WIDE_INT lo_index | |
4401 | = TREE_INT_CST_LOW (TREE_PURPOSE (vals)) - domain_min; | |
4402 | HOST_WIDE_INT hi_index | |
4403 | = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min; | |
4404 | if (lo_index < 0 || lo_index >= bit_size | |
4405 | || hi_index < 0 || hi_index >= bit_size) | |
4406 | abort (); | |
4407 | for ( ; lo_index <= hi_index; lo_index++) | |
4408 | buffer[lo_index] = 1; | |
4409 | } | |
4410 | else | |
4411 | { | |
4412 | /* Set a single bit to one. */ | |
4413 | HOST_WIDE_INT index | |
4414 | = TREE_INT_CST_LOW (TREE_VALUE (vals)) - domain_min; | |
4415 | if (index < 0 || index >= bit_size) | |
4416 | { | |
4417 | error ("invalid initializer for bit string"); | |
4418 | return NULL_TREE; | |
4419 | } | |
4420 | buffer[index] = 1; | |
4421 | } | |
4422 | } | |
4423 | return non_const_bits; | |
4424 | } | |
4425 | ||
9faa82d8 | 4426 | /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node. |
f3ffec8e | 4427 | The result is placed in BUFFER (which is an array of bytes). |
bca949e2 PB |
4428 | If the constructor is constant, NULL_TREE is returned. |
4429 | Otherwise, a TREE_LIST of the non-constant elements is emitted. */ | |
4430 | ||
4431 | tree | |
f3ffec8e | 4432 | get_set_constructor_bytes (init, buffer, wd_size) |
bca949e2 | 4433 | tree init; |
f3ffec8e | 4434 | unsigned char *buffer; |
bca949e2 PB |
4435 | int wd_size; |
4436 | { | |
4437 | int i; | |
4438 | tree vals = TREE_OPERAND (init, 1); | |
f3ffec8e | 4439 | int set_word_size = BITS_PER_UNIT; |
bca949e2 PB |
4440 | int bit_size = wd_size * set_word_size; |
4441 | int bit_pos = 0; | |
f3ffec8e | 4442 | unsigned char *bytep = buffer; |
bca949e2 PB |
4443 | char *bit_buffer = (char*)alloca(bit_size); |
4444 | tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size); | |
4445 | ||
4446 | for (i = 0; i < wd_size; i++) | |
4447 | buffer[i] = 0; | |
4448 | ||
4449 | for (i = 0; i < bit_size; i++) | |
4450 | { | |
4451 | if (bit_buffer[i]) | |
4452 | { | |
8a0e8d4d | 4453 | if (BYTES_BIG_ENDIAN) |
f3ffec8e | 4454 | *bytep |= (1 << (set_word_size - 1 - bit_pos)); |
f76b9db2 | 4455 | else |
f3ffec8e | 4456 | *bytep |= 1 << bit_pos; |
bca949e2 PB |
4457 | } |
4458 | bit_pos++; | |
4459 | if (bit_pos >= set_word_size) | |
f3ffec8e | 4460 | bit_pos = 0, bytep++; |
bca949e2 PB |
4461 | } |
4462 | return non_const_bits; | |
4463 | } |