1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file contains the low level primitives for operating on tree nodes,
24 including allocation, list operations, interning of identifiers,
25 construction of data type nodes and statement nodes,
26 and construction of type conversion nodes. It also contains
27 tables index by tree code that describe how to take apart
30 It is intended to be language-independent, but occasionally
31 calls language-dependent routines defined (for C) in typecheck.c.
33 The low-level allocation routines oballoc and permalloc
34 are used also for allocating many other kinds of objects
35 by all passes of the compiler. */
47 #define obstack_chunk_alloc xmalloc
48 #define obstack_chunk_free free
49 /* obstack.[ch] explicitly declined to prototype this. */
50 extern int _obstack_allocated_p
PARAMS ((struct obstack
*h
, PTR obj
));
52 static void unsave_expr_now_r
PARAMS ((tree
));
54 /* Tree nodes of permanent duration are allocated in this obstack.
55 They are the identifier nodes, and everything outside of
56 the bodies and parameters of function definitions. */
58 struct obstack permanent_obstack
;
60 /* The initial RTL, and all ..._TYPE nodes, in a function
61 are allocated in this obstack. Usually they are freed at the
62 end of the function, but if the function is inline they are saved.
63 For top-level functions, this is maybepermanent_obstack.
64 Separate obstacks are made for nested functions. */
66 struct obstack
*function_maybepermanent_obstack
;
68 /* This is the function_maybepermanent_obstack for top-level functions. */
70 struct obstack maybepermanent_obstack
;
72 /* The contents of the current function definition are allocated
73 in this obstack, and all are freed at the end of the function.
74 For top-level functions, this is temporary_obstack.
75 Separate obstacks are made for nested functions. */
77 struct obstack
*function_obstack
;
79 /* This is used for reading initializers of global variables. */
81 struct obstack temporary_obstack
;
83 /* The tree nodes of an expression are allocated
84 in this obstack, and all are freed at the end of the expression. */
86 struct obstack momentary_obstack
;
88 /* The tree nodes of a declarator are allocated
89 in this obstack, and all are freed when the declarator
92 static struct obstack temp_decl_obstack
;
94 /* This points at either permanent_obstack
95 or the current function_maybepermanent_obstack. */
97 struct obstack
*saveable_obstack
;
99 /* This is same as saveable_obstack during parse and expansion phase;
100 it points to the current function's obstack during optimization.
101 This is the obstack to be used for creating rtl objects. */
103 struct obstack
*rtl_obstack
;
105 /* This points at either permanent_obstack or the current function_obstack. */
107 struct obstack
*current_obstack
;
109 /* This points at either permanent_obstack or the current function_obstack
110 or momentary_obstack. */
112 struct obstack
*expression_obstack
;
114 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
118 struct obstack_stack
*next
;
119 struct obstack
*current
;
120 struct obstack
*saveable
;
121 struct obstack
*expression
;
125 struct obstack_stack
*obstack_stack
;
127 /* Obstack for allocating struct obstack_stack entries. */
129 static struct obstack obstack_stack_obstack
;
131 /* Addresses of first objects in some obstacks.
132 This is for freeing their entire contents. */
133 char *maybepermanent_firstobj
;
134 char *temporary_firstobj
;
135 char *momentary_firstobj
;
136 char *temp_decl_firstobj
;
138 /* This is used to preserve objects (mainly array initializers) that need to
139 live until the end of the current function, but no further. */
140 char *momentary_function_firstobj
;
142 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
144 int all_types_permanent
;
146 /* Stack of places to restore the momentary obstack back to. */
148 struct momentary_level
150 /* Pointer back to previous such level. */
151 struct momentary_level
*prev
;
152 /* First object allocated within this level. */
154 /* Value of expression_obstack saved at entry to this level. */
155 struct obstack
*obstack
;
158 struct momentary_level
*momentary_stack
;
160 /* Table indexed by tree code giving a string containing a character
161 classifying the tree code. Possibilities are
162 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
164 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
166 char tree_code_type
[MAX_TREE_CODES
] = {
171 /* Table indexed by tree code giving number of expression
172 operands beyond the fixed part of the node structure.
173 Not used for types or decls. */
175 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
177 int tree_code_length
[MAX_TREE_CODES
] = {
182 /* Names of tree components.
183 Used for printing out the tree and error messages. */
184 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
186 const char *tree_code_name
[MAX_TREE_CODES
] = {
191 /* Statistics-gathering stuff. */
212 int tree_node_counts
[(int)all_kinds
];
213 int tree_node_sizes
[(int)all_kinds
];
214 int id_string_size
= 0;
216 static const char * const tree_node_kind_names
[] = {
234 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
236 #define MAX_HASH_TABLE 1009
237 static tree hash_table
[MAX_HASH_TABLE
]; /* id hash buckets */
239 /* 0 while creating built-in identifiers. */
240 static int do_identifier_warnings
;
242 /* Unique id for next decl created. */
243 static int next_decl_uid
;
244 /* Unique id for next type created. */
245 static int next_type_uid
= 1;
247 /* The language-specific function for alias analysis. If NULL, the
248 language does not do any special alias analysis. */
249 int (*lang_get_alias_set
) PARAMS ((tree
));
251 /* Here is how primitive or already-canonicalized types' hash
253 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
255 /* Each hash table slot is a bucket containing a chain
256 of these structures. */
260 struct type_hash
*next
; /* Next structure in the bucket. */
261 unsigned int hashcode
; /* Hash code of this type. */
262 tree type
; /* The type recorded here. */
265 /* Now here is the hash table. When recording a type, it is added
266 to the slot whose index is the hash code mod the table size.
267 Note that the hash table is used for several kinds of types
268 (function types, array types and array index range types, for now).
269 While all these live in the same table, they are completely independent,
270 and the hash code is computed differently for each of these. */
272 #define TYPE_HASH_SIZE 59
273 struct type_hash
*type_hash_table
[TYPE_HASH_SIZE
];
275 static void build_real_from_int_cst_1
PARAMS ((PTR
));
276 static void set_type_quals
PARAMS ((tree
, int));
277 static void append_random_chars
PARAMS ((char *));
278 static void mark_type_hash
PARAMS ((void *));
280 /* If non-null, these are language-specific helper functions for
281 unsave_expr_now. If present, LANG_UNSAVE is called before its
282 argument (an UNSAVE_EXPR) is to be unsaved, and all other
283 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
284 called from unsave_expr_1 for language-specific tree codes. */
285 void (*lang_unsave
) PARAMS ((tree
*));
286 void (*lang_unsave_expr_now
) PARAMS ((tree
));
288 /* The string used as a placeholder instead of a source file name for
289 built-in tree nodes. The variable, which is dynamically allocated,
290 should be used; the macro is only used to initialize it. */
292 static char *built_in_filename
;
293 #define BUILT_IN_FILENAME ("<built-in>")
295 tree global_trees
[TI_MAX
];
297 /* Init the principal obstacks. */
302 gcc_obstack_init (&obstack_stack_obstack
);
303 gcc_obstack_init (&permanent_obstack
);
305 gcc_obstack_init (&temporary_obstack
);
306 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
307 gcc_obstack_init (&momentary_obstack
);
308 momentary_firstobj
= (char *) obstack_alloc (&momentary_obstack
, 0);
309 momentary_function_firstobj
= momentary_firstobj
;
310 gcc_obstack_init (&maybepermanent_obstack
);
311 maybepermanent_firstobj
312 = (char *) obstack_alloc (&maybepermanent_obstack
, 0);
313 gcc_obstack_init (&temp_decl_obstack
);
314 temp_decl_firstobj
= (char *) obstack_alloc (&temp_decl_obstack
, 0);
316 function_obstack
= &temporary_obstack
;
317 function_maybepermanent_obstack
= &maybepermanent_obstack
;
318 current_obstack
= &permanent_obstack
;
319 expression_obstack
= &permanent_obstack
;
320 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
322 /* Init the hash table of identifiers. */
323 bzero ((char *) hash_table
, sizeof hash_table
);
324 ggc_add_tree_root (hash_table
, sizeof hash_table
/ sizeof (tree
));
326 /* Initialize the hash table of types. */
327 bzero ((char *) type_hash_table
,
328 sizeof type_hash_table
/ sizeof type_hash_table
[0]);
329 ggc_add_root (type_hash_table
,
330 sizeof type_hash_table
/ sizeof type_hash_table
[0],
331 sizeof type_hash_table
[0], mark_type_hash
);
332 ggc_add_tree_root (global_trees
, TI_MAX
);
336 gcc_obstack_init (obstack
)
337 struct obstack
*obstack
;
339 /* Let particular systems override the size of a chunk. */
340 #ifndef OBSTACK_CHUNK_SIZE
341 #define OBSTACK_CHUNK_SIZE 0
343 /* Let them override the alloc and free routines too. */
344 #ifndef OBSTACK_CHUNK_ALLOC
345 #define OBSTACK_CHUNK_ALLOC xmalloc
347 #ifndef OBSTACK_CHUNK_FREE
348 #define OBSTACK_CHUNK_FREE free
350 _obstack_begin (obstack
, OBSTACK_CHUNK_SIZE
, 0,
351 (void *(*) PARAMS ((long))) OBSTACK_CHUNK_ALLOC
,
352 (void (*) PARAMS ((void *))) OBSTACK_CHUNK_FREE
);
355 /* Save all variables describing the current status into the structure
356 *P. This function is called whenever we start compiling one
357 function in the midst of compiling another. For example, when
358 compiling a nested function, or, in C++, a template instantiation
359 that is required by the function we are currently compiling.
361 CONTEXT is the decl_function_context for the function we're about to
362 compile; if it isn't current_function_decl, we have to play some games. */
368 p
->all_types_permanent
= all_types_permanent
;
369 p
->momentary_stack
= momentary_stack
;
370 p
->maybepermanent_firstobj
= maybepermanent_firstobj
;
371 p
->temporary_firstobj
= temporary_firstobj
;
372 p
->momentary_firstobj
= momentary_firstobj
;
373 p
->momentary_function_firstobj
= momentary_function_firstobj
;
374 p
->function_obstack
= function_obstack
;
375 p
->function_maybepermanent_obstack
= function_maybepermanent_obstack
;
376 p
->current_obstack
= current_obstack
;
377 p
->expression_obstack
= expression_obstack
;
378 p
->saveable_obstack
= saveable_obstack
;
379 p
->rtl_obstack
= rtl_obstack
;
381 function_maybepermanent_obstack
382 = (struct obstack
*) xmalloc (sizeof (struct obstack
));
383 gcc_obstack_init (function_maybepermanent_obstack
);
384 maybepermanent_firstobj
385 = (char *) obstack_finish (function_maybepermanent_obstack
);
387 function_obstack
= (struct obstack
*) xmalloc (sizeof (struct obstack
));
388 gcc_obstack_init (function_obstack
);
390 current_obstack
= &permanent_obstack
;
391 expression_obstack
= &permanent_obstack
;
392 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
394 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
395 momentary_firstobj
= (char *) obstack_finish (&momentary_obstack
);
396 momentary_function_firstobj
= momentary_firstobj
;
399 /* Restore all variables describing the current status from the structure *P.
400 This is used after a nested function. */
403 restore_tree_status (p
)
406 all_types_permanent
= p
->all_types_permanent
;
407 momentary_stack
= p
->momentary_stack
;
409 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
411 /* Free saveable storage used by the function just compiled and not
413 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
414 if (obstack_empty_p (function_maybepermanent_obstack
))
416 obstack_free (function_maybepermanent_obstack
, NULL
);
417 free (function_maybepermanent_obstack
);
420 obstack_free (&temporary_obstack
, temporary_firstobj
);
421 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
423 obstack_free (function_obstack
, NULL
);
424 free (function_obstack
);
426 temporary_firstobj
= p
->temporary_firstobj
;
427 momentary_firstobj
= p
->momentary_firstobj
;
428 momentary_function_firstobj
= p
->momentary_function_firstobj
;
429 maybepermanent_firstobj
= p
->maybepermanent_firstobj
;
430 function_obstack
= p
->function_obstack
;
431 function_maybepermanent_obstack
= p
->function_maybepermanent_obstack
;
432 current_obstack
= p
->current_obstack
;
433 expression_obstack
= p
->expression_obstack
;
434 saveable_obstack
= p
->saveable_obstack
;
435 rtl_obstack
= p
->rtl_obstack
;
438 /* Start allocating on the temporary (per function) obstack.
439 This is done in start_function before parsing the function body,
440 and before each initialization at top level, and to go back
441 to temporary allocation after doing permanent_allocation. */
444 temporary_allocation ()
446 /* Note that function_obstack at top level points to temporary_obstack.
447 But within a nested function context, it is a separate obstack. */
448 current_obstack
= function_obstack
;
449 expression_obstack
= function_obstack
;
450 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
454 /* Start allocating on the permanent obstack but don't
455 free the temporary data. After calling this, call
456 `permanent_allocation' to fully resume permanent allocation status. */
459 end_temporary_allocation ()
461 current_obstack
= &permanent_obstack
;
462 expression_obstack
= &permanent_obstack
;
463 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
466 /* Resume allocating on the temporary obstack, undoing
467 effects of `end_temporary_allocation'. */
470 resume_temporary_allocation ()
472 current_obstack
= function_obstack
;
473 expression_obstack
= function_obstack
;
474 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
477 /* While doing temporary allocation, switch to allocating in such a
478 way as to save all nodes if the function is inlined. Call
479 resume_temporary_allocation to go back to ordinary temporary
483 saveable_allocation ()
485 /* Note that function_obstack at top level points to temporary_obstack.
486 But within a nested function context, it is a separate obstack. */
487 expression_obstack
= current_obstack
= saveable_obstack
;
490 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
491 recording the previously current obstacks on a stack.
492 This does not free any storage in any obstack. */
495 push_obstacks (current
, saveable
)
496 struct obstack
*current
, *saveable
;
498 struct obstack_stack
*p
;
500 p
= (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
501 (sizeof (struct obstack_stack
)));
503 p
->current
= current_obstack
;
504 p
->saveable
= saveable_obstack
;
505 p
->expression
= expression_obstack
;
506 p
->rtl
= rtl_obstack
;
507 p
->next
= obstack_stack
;
510 current_obstack
= current
;
511 expression_obstack
= current
;
512 rtl_obstack
= saveable_obstack
= saveable
;
515 /* Save the current set of obstacks, but don't change them. */
518 push_obstacks_nochange ()
520 struct obstack_stack
*p
;
522 p
= (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
523 (sizeof (struct obstack_stack
)));
525 p
->current
= current_obstack
;
526 p
->saveable
= saveable_obstack
;
527 p
->expression
= expression_obstack
;
528 p
->rtl
= rtl_obstack
;
529 p
->next
= obstack_stack
;
533 /* Pop the obstack selection stack. */
538 struct obstack_stack
*p
;
541 obstack_stack
= p
->next
;
543 current_obstack
= p
->current
;
544 saveable_obstack
= p
->saveable
;
545 expression_obstack
= p
->expression
;
546 rtl_obstack
= p
->rtl
;
548 obstack_free (&obstack_stack_obstack
, p
);
551 /* Nonzero if temporary allocation is currently in effect.
552 Zero if currently doing permanent allocation. */
555 allocation_temporary_p ()
557 return current_obstack
!= &permanent_obstack
;
560 /* Go back to allocating on the permanent obstack
561 and free everything in the temporary obstack.
563 FUNCTION_END is true only if we have just finished compiling a function.
564 In that case, we also free preserved initial values on the momentary
568 permanent_allocation (function_end
)
571 /* Free up previous temporary obstack data */
572 obstack_free (&temporary_obstack
, temporary_firstobj
);
575 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
576 momentary_firstobj
= momentary_function_firstobj
;
579 obstack_free (&momentary_obstack
, momentary_firstobj
);
581 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
582 obstack_free (&temp_decl_obstack
, temp_decl_firstobj
);
584 current_obstack
= &permanent_obstack
;
585 expression_obstack
= &permanent_obstack
;
586 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
589 /* Save permanently everything on the maybepermanent_obstack. */
594 maybepermanent_firstobj
595 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
599 preserve_initializer ()
601 struct momentary_level
*tem
;
605 = (char *) obstack_alloc (&temporary_obstack
, 0);
606 maybepermanent_firstobj
607 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
609 old_momentary
= momentary_firstobj
;
611 = (char *) obstack_alloc (&momentary_obstack
, 0);
612 if (momentary_firstobj
!= old_momentary
)
613 for (tem
= momentary_stack
; tem
; tem
= tem
->prev
)
614 tem
->base
= momentary_firstobj
;
617 /* Start allocating new rtl in current_obstack.
618 Use resume_temporary_allocation
619 to go back to allocating rtl in saveable_obstack. */
622 rtl_in_current_obstack ()
624 rtl_obstack
= current_obstack
;
627 /* Start allocating rtl from saveable_obstack. Intended to be used after
628 a call to push_obstacks_nochange. */
631 rtl_in_saveable_obstack ()
633 rtl_obstack
= saveable_obstack
;
636 /* Allocate SIZE bytes in the current obstack
637 and return a pointer to them.
638 In practice the current obstack is always the temporary one. */
644 return (char *) obstack_alloc (current_obstack
, size
);
647 /* Free the object PTR in the current obstack
648 as well as everything allocated since PTR.
649 In practice the current obstack is always the temporary one. */
655 obstack_free (current_obstack
, ptr
);
658 /* Allocate SIZE bytes in the permanent obstack
659 and return a pointer to them. */
665 return (char *) obstack_alloc (&permanent_obstack
, size
);
668 /* Allocate NELEM items of SIZE bytes in the permanent obstack
669 and return a pointer to them. The storage is cleared before
670 returning the value. */
673 perm_calloc (nelem
, size
)
677 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
678 bzero (rval
, nelem
* size
);
682 /* Allocate SIZE bytes in the saveable obstack
683 and return a pointer to them. */
689 return (char *) obstack_alloc (saveable_obstack
, size
);
692 /* Allocate SIZE bytes in the expression obstack
693 and return a pointer to them. */
699 return (char *) obstack_alloc (expression_obstack
, size
);
702 /* Print out which obstack an object is in. */
705 print_obstack_name (object
, file
, prefix
)
710 struct obstack
*obstack
= NULL
;
711 const char *obstack_name
= NULL
;
714 for (p
= outer_function_chain
; p
; p
= p
->next
)
716 if (_obstack_allocated_p (p
->function_obstack
, object
))
718 obstack
= p
->function_obstack
;
719 obstack_name
= "containing function obstack";
721 if (_obstack_allocated_p (p
->function_maybepermanent_obstack
, object
))
723 obstack
= p
->function_maybepermanent_obstack
;
724 obstack_name
= "containing function maybepermanent obstack";
728 if (_obstack_allocated_p (&obstack_stack_obstack
, object
))
730 obstack
= &obstack_stack_obstack
;
731 obstack_name
= "obstack_stack_obstack";
733 else if (_obstack_allocated_p (function_obstack
, object
))
735 obstack
= function_obstack
;
736 obstack_name
= "function obstack";
738 else if (_obstack_allocated_p (&permanent_obstack
, object
))
740 obstack
= &permanent_obstack
;
741 obstack_name
= "permanent_obstack";
743 else if (_obstack_allocated_p (&momentary_obstack
, object
))
745 obstack
= &momentary_obstack
;
746 obstack_name
= "momentary_obstack";
748 else if (_obstack_allocated_p (function_maybepermanent_obstack
, object
))
750 obstack
= function_maybepermanent_obstack
;
751 obstack_name
= "function maybepermanent obstack";
753 else if (_obstack_allocated_p (&temp_decl_obstack
, object
))
755 obstack
= &temp_decl_obstack
;
756 obstack_name
= "temp_decl_obstack";
759 /* Check to see if the object is in the free area of the obstack. */
762 if (object
>= obstack
->next_free
763 && object
< obstack
->chunk_limit
)
764 fprintf (file
, "%s in free portion of obstack %s",
765 prefix
, obstack_name
);
767 fprintf (file
, "%s allocated from %s", prefix
, obstack_name
);
770 fprintf (file
, "%s not allocated from any obstack", prefix
);
774 debug_obstack (object
)
777 print_obstack_name (object
, stderr
, "object");
778 fprintf (stderr
, ".\n");
781 /* Return 1 if OBJ is in the permanent obstack.
782 This is slow, and should be used only for debugging.
783 Use TREE_PERMANENT for other purposes. */
786 object_permanent_p (obj
)
789 return _obstack_allocated_p (&permanent_obstack
, obj
);
792 /* Start a level of momentary allocation.
793 In C, each compound statement has its own level
794 and that level is freed at the end of each statement.
795 All expression nodes are allocated in the momentary allocation level. */
800 struct momentary_level
*tem
801 = (struct momentary_level
*) obstack_alloc (&momentary_obstack
,
802 sizeof (struct momentary_level
));
803 tem
->prev
= momentary_stack
;
804 tem
->base
= (char *) obstack_base (&momentary_obstack
);
805 tem
->obstack
= expression_obstack
;
806 momentary_stack
= tem
;
807 expression_obstack
= &momentary_obstack
;
810 /* Set things up so the next clear_momentary will only clear memory
811 past our present position in momentary_obstack. */
814 preserve_momentary ()
816 momentary_stack
->base
= (char *) obstack_base (&momentary_obstack
);
819 /* Free all the storage in the current momentary-allocation level.
820 In C, this happens at the end of each statement. */
825 obstack_free (&momentary_obstack
, momentary_stack
->base
);
828 /* Discard a level of momentary allocation.
829 In C, this happens at the end of each compound statement.
830 Restore the status of expression node allocation
831 that was in effect before this level was created. */
836 struct momentary_level
*tem
= momentary_stack
;
837 momentary_stack
= tem
->prev
;
838 expression_obstack
= tem
->obstack
;
839 /* We can't free TEM from the momentary_obstack, because there might
840 be objects above it which have been saved. We can free back to the
841 stack of the level we are popping off though. */
842 obstack_free (&momentary_obstack
, tem
->base
);
845 /* Pop back to the previous level of momentary allocation,
846 but don't free any momentary data just yet. */
849 pop_momentary_nofree ()
851 struct momentary_level
*tem
= momentary_stack
;
852 momentary_stack
= tem
->prev
;
853 expression_obstack
= tem
->obstack
;
856 /* Call when starting to parse a declaration:
857 make expressions in the declaration last the length of the function.
858 Returns an argument that should be passed to resume_momentary later. */
863 register int tem
= expression_obstack
== &momentary_obstack
;
864 expression_obstack
= saveable_obstack
;
868 /* Call when finished parsing a declaration:
869 restore the treatment of node-allocation that was
870 in effect before the suspension.
871 YES should be the value previously returned by suspend_momentary. */
874 resume_momentary (yes
)
878 expression_obstack
= &momentary_obstack
;
881 /* Init the tables indexed by tree code.
882 Note that languages can add to these tables to define their own codes. */
888 = ggc_alloc_string (BUILT_IN_FILENAME
, sizeof (BUILT_IN_FILENAME
));
889 ggc_add_string_root (&built_in_filename
, 1);
892 /* Return a newly allocated node of code CODE.
893 Initialize the node's unique id and its TREE_PERMANENT flag.
894 Note that if garbage collection is in use, TREE_PERMANENT will
895 always be zero - we want to eliminate use of TREE_PERMANENT.
896 For decl and type nodes, some other fields are initialized.
897 The rest of the node is initialized to zero.
899 Achoo! I got a code in the node. */
906 register int type
= TREE_CODE_CLASS (code
);
907 register int length
= 0;
908 register struct obstack
*obstack
= current_obstack
;
909 #ifdef GATHER_STATISTICS
910 register tree_node_kind kind
;
915 case 'd': /* A decl node */
916 #ifdef GATHER_STATISTICS
919 length
= sizeof (struct tree_decl
);
920 /* All decls in an inline function need to be saved. */
921 if (obstack
!= &permanent_obstack
)
922 obstack
= saveable_obstack
;
924 /* PARM_DECLs go on the context of the parent. If this is a nested
925 function, then we must allocate the PARM_DECL on the parent's
926 obstack, so that they will live to the end of the parent's
927 closing brace. This is necessary in case we try to inline the
928 function into its parent.
930 PARM_DECLs of top-level functions do not have this problem. However,
931 we allocate them where we put the FUNCTION_DECL for languages such as
932 Ada that need to consult some flags in the PARM_DECLs of the function
935 See comment in restore_tree_status for why we can't put this
936 in function_obstack. */
937 if (code
== PARM_DECL
&& obstack
!= &permanent_obstack
)
940 if (current_function_decl
)
941 context
= decl_function_context (current_function_decl
);
945 = find_function_data (context
)->function_maybepermanent_obstack
;
949 case 't': /* a type node */
950 #ifdef GATHER_STATISTICS
953 length
= sizeof (struct tree_type
);
954 /* All data types are put where we can preserve them if nec. */
955 if (obstack
!= &permanent_obstack
)
956 obstack
= all_types_permanent
? &permanent_obstack
: saveable_obstack
;
959 case 'b': /* a lexical block */
960 #ifdef GATHER_STATISTICS
963 length
= sizeof (struct tree_block
);
964 /* All BLOCK nodes are put where we can preserve them if nec. */
965 if (obstack
!= &permanent_obstack
)
966 obstack
= saveable_obstack
;
969 case 's': /* an expression with side effects */
970 #ifdef GATHER_STATISTICS
974 case 'r': /* a reference */
975 #ifdef GATHER_STATISTICS
979 case 'e': /* an expression */
980 case '<': /* a comparison expression */
981 case '1': /* a unary arithmetic expression */
982 case '2': /* a binary arithmetic expression */
983 #ifdef GATHER_STATISTICS
987 obstack
= expression_obstack
;
988 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
989 if (code
== BIND_EXPR
&& obstack
!= &permanent_obstack
)
990 obstack
= saveable_obstack
;
991 length
= sizeof (struct tree_exp
)
992 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
995 case 'c': /* a constant */
996 #ifdef GATHER_STATISTICS
999 obstack
= expression_obstack
;
1001 /* We can't use tree_code_length for INTEGER_CST, since the number of
1002 words is machine-dependent due to varying length of HOST_WIDE_INT,
1003 which might be wider than a pointer (e.g., long long). Similarly
1004 for REAL_CST, since the number of words is machine-dependent due
1005 to varying size and alignment of `double'. */
1007 if (code
== INTEGER_CST
)
1008 length
= sizeof (struct tree_int_cst
);
1009 else if (code
== REAL_CST
)
1010 length
= sizeof (struct tree_real_cst
);
1012 length
= sizeof (struct tree_common
)
1013 + tree_code_length
[(int) code
] * sizeof (char *);
1016 case 'x': /* something random, like an identifier. */
1017 #ifdef GATHER_STATISTICS
1018 if (code
== IDENTIFIER_NODE
)
1020 else if (code
== OP_IDENTIFIER
)
1022 else if (code
== TREE_VEC
)
1027 length
= sizeof (struct tree_common
)
1028 + tree_code_length
[(int) code
] * sizeof (char *);
1029 /* Identifier nodes are always permanent since they are
1030 unique in a compiler run. */
1031 if (code
== IDENTIFIER_NODE
) obstack
= &permanent_obstack
;
1039 t
= ggc_alloc_tree (length
);
1042 t
= (tree
) obstack_alloc (obstack
, length
);
1043 memset ((PTR
) t
, 0, length
);
1046 #ifdef GATHER_STATISTICS
1047 tree_node_counts
[(int)kind
]++;
1048 tree_node_sizes
[(int)kind
] += length
;
1051 TREE_SET_CODE (t
, code
);
1052 TREE_SET_PERMANENT (t
);
1057 TREE_SIDE_EFFECTS (t
) = 1;
1058 TREE_TYPE (t
) = void_type_node
;
1062 if (code
!= FUNCTION_DECL
)
1064 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
1065 DECL_SOURCE_LINE (t
) = lineno
;
1066 DECL_SOURCE_FILE (t
) =
1067 (input_filename
) ? input_filename
: built_in_filename
;
1068 DECL_UID (t
) = next_decl_uid
++;
1069 /* Note that we have not yet computed the alias set for this
1071 DECL_POINTER_ALIAS_SET (t
) = -1;
1075 TYPE_UID (t
) = next_type_uid
++;
1077 TYPE_MAIN_VARIANT (t
) = t
;
1078 TYPE_OBSTACK (t
) = obstack
;
1079 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1080 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1081 SET_DEFAULT_TYPE_ATTRIBUTES (t
);
1083 /* Note that we have not yet computed the alias set for this
1085 TYPE_ALIAS_SET (t
) = -1;
1089 TREE_CONSTANT (t
) = 1;
1099 case PREDECREMENT_EXPR
:
1100 case PREINCREMENT_EXPR
:
1101 case POSTDECREMENT_EXPR
:
1102 case POSTINCREMENT_EXPR
:
1103 /* All of these have side-effects, no matter what their
1105 TREE_SIDE_EFFECTS (t
) = 1;
1117 /* A front-end can reset this to an appropriate function if types need
1118 special handling. */
1120 tree (*make_lang_type_fn
) PARAMS ((enum tree_code
)) = make_node
;
1122 /* Return a new type (with the indicated CODE), doing whatever
1123 language-specific processing is required. */
1126 make_lang_type (code
)
1127 enum tree_code code
;
1129 return (*make_lang_type_fn
) (code
);
1132 /* Return a new node with the same contents as NODE except that its
1133 TREE_CHAIN is zero and it has a fresh uid. Unlike make_node, this
1134 function always performs the allocation on the CURRENT_OBSTACK;
1135 it's up to the caller to pick the right obstack before calling this
1143 register enum tree_code code
= TREE_CODE (node
);
1144 register int length
= 0;
1146 switch (TREE_CODE_CLASS (code
))
1148 case 'd': /* A decl node */
1149 length
= sizeof (struct tree_decl
);
1152 case 't': /* a type node */
1153 length
= sizeof (struct tree_type
);
1156 case 'b': /* a lexical block node */
1157 length
= sizeof (struct tree_block
);
1160 case 'r': /* a reference */
1161 case 'e': /* an expression */
1162 case 's': /* an expression with side effects */
1163 case '<': /* a comparison expression */
1164 case '1': /* a unary arithmetic expression */
1165 case '2': /* a binary arithmetic expression */
1166 length
= sizeof (struct tree_exp
)
1167 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
1170 case 'c': /* a constant */
1171 /* We can't use tree_code_length for INTEGER_CST, since the number of
1172 words is machine-dependent due to varying length of HOST_WIDE_INT,
1173 which might be wider than a pointer (e.g., long long). Similarly
1174 for REAL_CST, since the number of words is machine-dependent due
1175 to varying size and alignment of `double'. */
1176 if (code
== INTEGER_CST
)
1177 length
= sizeof (struct tree_int_cst
);
1178 else if (code
== REAL_CST
)
1179 length
= sizeof (struct tree_real_cst
);
1181 length
= (sizeof (struct tree_common
)
1182 + tree_code_length
[(int) code
] * sizeof (char *));
1185 case 'x': /* something random, like an identifier. */
1186 length
= sizeof (struct tree_common
)
1187 + tree_code_length
[(int) code
] * sizeof (char *);
1188 if (code
== TREE_VEC
)
1189 length
+= (TREE_VEC_LENGTH (node
) - 1) * sizeof (char *);
1193 t
= ggc_alloc_tree (length
);
1195 t
= (tree
) obstack_alloc (current_obstack
, length
);
1196 memcpy (t
, node
, length
);
1199 TREE_ASM_WRITTEN (t
) = 0;
1201 if (TREE_CODE_CLASS (code
) == 'd')
1202 DECL_UID (t
) = next_decl_uid
++;
1203 else if (TREE_CODE_CLASS (code
) == 't')
1205 TYPE_UID (t
) = next_type_uid
++;
1206 TYPE_OBSTACK (t
) = current_obstack
;
1208 /* The following is so that the debug code for
1209 the copy is different from the original type.
1210 The two statements usually duplicate each other
1211 (because they clear fields of the same union),
1212 but the optimizer should catch that. */
1213 TYPE_SYMTAB_POINTER (t
) = 0;
1214 TYPE_SYMTAB_ADDRESS (t
) = 0;
1217 TREE_SET_PERMANENT (t
);
1222 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1223 For example, this can copy a list made of TREE_LIST nodes. */
1230 register tree prev
, next
;
1235 head
= prev
= copy_node (list
);
1236 next
= TREE_CHAIN (list
);
1239 TREE_CHAIN (prev
) = copy_node (next
);
1240 prev
= TREE_CHAIN (prev
);
1241 next
= TREE_CHAIN (next
);
1248 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1249 If an identifier with that name has previously been referred to,
1250 the same node is returned this time. */
1253 get_identifier (text
)
1254 register const char *text
;
1259 register int len
, hash_len
;
1261 /* Compute length of text in len. */
1262 len
= strlen (text
);
1264 /* Decide how much of that length to hash on */
1266 if (warn_id_clash
&& len
> id_clash_len
)
1267 hash_len
= id_clash_len
;
1269 /* Compute hash code */
1270 hi
= hash_len
* 613 + (unsigned) text
[0];
1271 for (i
= 1; i
< hash_len
; i
+= 2)
1272 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1274 hi
&= (1 << HASHBITS
) - 1;
1275 hi
%= MAX_HASH_TABLE
;
1277 /* Search table for identifier */
1278 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1279 if (IDENTIFIER_LENGTH (idp
) == len
1280 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1281 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1282 return idp
; /* <-- return if found */
1284 /* Not found; optionally warn about a similar identifier */
1285 if (warn_id_clash
&& do_identifier_warnings
&& len
>= id_clash_len
)
1286 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1287 if (!strncmp (IDENTIFIER_POINTER (idp
), text
, id_clash_len
))
1289 warning ("`%s' and `%s' identical in first %d characters",
1290 IDENTIFIER_POINTER (idp
), text
, id_clash_len
);
1294 if (tree_code_length
[(int) IDENTIFIER_NODE
] < 0)
1295 abort (); /* set_identifier_size hasn't been called. */
1297 /* Not found, create one, add to chain */
1298 idp
= make_node (IDENTIFIER_NODE
);
1299 IDENTIFIER_LENGTH (idp
) = len
;
1300 #ifdef GATHER_STATISTICS
1301 id_string_size
+= len
;
1305 IDENTIFIER_POINTER (idp
) = ggc_alloc_string (text
, len
);
1307 IDENTIFIER_POINTER (idp
) = obstack_copy0 (&permanent_obstack
, text
, len
);
1309 TREE_CHAIN (idp
) = hash_table
[hi
];
1310 hash_table
[hi
] = idp
;
1311 return idp
; /* <-- return if created */
1314 /* If an identifier with the name TEXT (a null-terminated string) has
1315 previously been referred to, return that node; otherwise return
1319 maybe_get_identifier (text
)
1320 register const char *text
;
1325 register int len
, hash_len
;
1327 /* Compute length of text in len. */
1328 len
= strlen (text
);
1330 /* Decide how much of that length to hash on */
1332 if (warn_id_clash
&& len
> id_clash_len
)
1333 hash_len
= id_clash_len
;
1335 /* Compute hash code */
1336 hi
= hash_len
* 613 + (unsigned) text
[0];
1337 for (i
= 1; i
< hash_len
; i
+= 2)
1338 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1340 hi
&= (1 << HASHBITS
) - 1;
1341 hi
%= MAX_HASH_TABLE
;
1343 /* Search table for identifier */
1344 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1345 if (IDENTIFIER_LENGTH (idp
) == len
1346 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1347 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1348 return idp
; /* <-- return if found */
1353 /* Enable warnings on similar identifiers (if requested).
1354 Done after the built-in identifiers are created. */
1357 start_identifier_warnings ()
1359 do_identifier_warnings
= 1;
1362 /* Record the size of an identifier node for the language in use.
1363 SIZE is the total size in bytes.
1364 This is called by the language-specific files. This must be
1365 called before allocating any identifiers. */
1368 set_identifier_size (size
)
1371 tree_code_length
[(int) IDENTIFIER_NODE
]
1372 = (size
- sizeof (struct tree_common
)) / sizeof (tree
);
1375 /* Return a newly constructed INTEGER_CST node whose constant value
1376 is specified by the two ints LOW and HI.
1377 The TREE_TYPE is set to `int'.
1379 This function should be used via the `build_int_2' macro. */
1382 build_int_2_wide (low
, hi
)
1383 HOST_WIDE_INT low
, hi
;
1385 register tree t
= make_node (INTEGER_CST
);
1387 TREE_INT_CST_LOW (t
) = low
;
1388 TREE_INT_CST_HIGH (t
) = hi
;
1389 TREE_TYPE (t
) = integer_type_node
;
1393 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1396 build_real (type
, d
)
1403 /* Check for valid float value for this type on this target machine;
1404 if not, can print error message and store a valid value in D. */
1405 #ifdef CHECK_FLOAT_VALUE
1406 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1409 v
= make_node (REAL_CST
);
1410 TREE_TYPE (v
) = type
;
1411 TREE_REAL_CST (v
) = d
;
1412 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1416 /* Return a new REAL_CST node whose type is TYPE
1417 and whose value is the integer value of the INTEGER_CST node I. */
1419 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1422 real_value_from_int_cst (type
, i
)
1423 tree type ATTRIBUTE_UNUSED
, i
;
1427 #ifdef REAL_ARITHMETIC
1428 /* Clear all bits of the real value type so that we can later do
1429 bitwise comparisons to see if two values are the same. */
1430 bzero ((char *) &d
, sizeof d
);
1432 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
1433 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1436 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
1437 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
1438 #else /* not REAL_ARITHMETIC */
1439 /* Some 386 compilers mishandle unsigned int to float conversions,
1440 so introduce a temporary variable E to avoid those bugs. */
1441 if (TREE_INT_CST_HIGH (i
) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i
)))
1445 d
= (double) (~ TREE_INT_CST_HIGH (i
));
1446 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1447 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1449 e
= (double) (~ TREE_INT_CST_LOW (i
));
1457 d
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (i
);
1458 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1459 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1461 e
= (double) TREE_INT_CST_LOW (i
);
1464 #endif /* not REAL_ARITHMETIC */
1468 /* Args to pass to and from build_real_from_int_cst_1. */
1472 tree type
; /* Input: type to conver to. */
1473 tree i
; /* Input: operand to convert */
1474 REAL_VALUE_TYPE d
; /* Output: floating point value. */
1477 /* Convert an integer to a floating point value while protected by a floating
1478 point exception handler. */
1481 build_real_from_int_cst_1 (data
)
1484 struct brfic_args
*args
= (struct brfic_args
*) data
;
1486 #ifdef REAL_ARITHMETIC
1487 args
->d
= real_value_from_int_cst (args
->type
, args
->i
);
1490 = REAL_VALUE_TRUNCATE (TYPE_MODE (args
->type
),
1491 real_value_from_int_cst (args
->type
, args
->i
));
1495 /* Given a tree representing an integer constant I, return a tree
1496 representing the same value as a floating-point constant of type TYPE.
1497 We cannot perform this operation if there is no way of doing arithmetic
1498 on floating-point values. */
1501 build_real_from_int_cst (type
, i
)
1506 int overflow
= TREE_OVERFLOW (i
);
1508 struct brfic_args args
;
1510 v
= make_node (REAL_CST
);
1511 TREE_TYPE (v
) = type
;
1513 /* Setup input for build_real_from_int_cst_1() */
1517 if (do_float_handler (build_real_from_int_cst_1
, (PTR
) &args
))
1518 /* Receive output from build_real_from_int_cst_1() */
1522 /* We got an exception from build_real_from_int_cst_1() */
1527 /* Check for valid float value for this type on this target machine. */
1529 #ifdef CHECK_FLOAT_VALUE
1530 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1533 TREE_REAL_CST (v
) = d
;
1534 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1538 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1540 /* Return a newly constructed STRING_CST node whose value is
1541 the LEN characters at STR.
1542 The TREE_TYPE is not initialized. */
1545 build_string (len
, str
)
1549 /* Put the string in saveable_obstack since it will be placed in the RTL
1550 for an "asm" statement and will also be kept around a while if
1551 deferring constant output in varasm.c. */
1553 register tree s
= make_node (STRING_CST
);
1555 TREE_STRING_LENGTH (s
) = len
;
1557 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
1559 TREE_STRING_POINTER (s
) = obstack_copy0 (saveable_obstack
, str
, len
);
1564 /* Return a newly constructed COMPLEX_CST node whose value is
1565 specified by the real and imaginary parts REAL and IMAG.
1566 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1567 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1570 build_complex (type
, real
, imag
)
1574 register tree t
= make_node (COMPLEX_CST
);
1576 TREE_REALPART (t
) = real
;
1577 TREE_IMAGPART (t
) = imag
;
1578 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1579 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1580 TREE_CONSTANT_OVERFLOW (t
)
1581 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1585 /* Build a newly constructed TREE_VEC node of length LEN. */
1592 register int length
= (len
-1) * sizeof (tree
) + sizeof (struct tree_vec
);
1593 register struct obstack
*obstack
= current_obstack
;
1595 #ifdef GATHER_STATISTICS
1596 tree_node_counts
[(int)vec_kind
]++;
1597 tree_node_sizes
[(int)vec_kind
] += length
;
1601 t
= ggc_alloc_tree (length
);
1604 t
= (tree
) obstack_alloc (obstack
, length
);
1605 bzero ((PTR
) t
, length
);
1608 TREE_SET_CODE (t
, TREE_VEC
);
1609 TREE_VEC_LENGTH (t
) = len
;
1610 TREE_SET_PERMANENT (t
);
1615 /* Return 1 if EXPR is the integer constant zero or a complex constant
1619 integer_zerop (expr
)
1624 return ((TREE_CODE (expr
) == INTEGER_CST
1625 && ! TREE_CONSTANT_OVERFLOW (expr
)
1626 && TREE_INT_CST_LOW (expr
) == 0
1627 && TREE_INT_CST_HIGH (expr
) == 0)
1628 || (TREE_CODE (expr
) == COMPLEX_CST
1629 && integer_zerop (TREE_REALPART (expr
))
1630 && integer_zerop (TREE_IMAGPART (expr
))));
1633 /* Return 1 if EXPR is the integer constant one or the corresponding
1634 complex constant. */
1642 return ((TREE_CODE (expr
) == INTEGER_CST
1643 && ! TREE_CONSTANT_OVERFLOW (expr
)
1644 && TREE_INT_CST_LOW (expr
) == 1
1645 && TREE_INT_CST_HIGH (expr
) == 0)
1646 || (TREE_CODE (expr
) == COMPLEX_CST
1647 && integer_onep (TREE_REALPART (expr
))
1648 && integer_zerop (TREE_IMAGPART (expr
))));
1651 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1652 it contains. Likewise for the corresponding complex constant. */
1655 integer_all_onesp (expr
)
1663 if (TREE_CODE (expr
) == COMPLEX_CST
1664 && integer_all_onesp (TREE_REALPART (expr
))
1665 && integer_zerop (TREE_IMAGPART (expr
)))
1668 else if (TREE_CODE (expr
) != INTEGER_CST
1669 || TREE_CONSTANT_OVERFLOW (expr
))
1672 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
1674 return (TREE_INT_CST_LOW (expr
) == ~ (unsigned HOST_WIDE_INT
) 0
1675 && TREE_INT_CST_HIGH (expr
) == -1);
1677 /* Note that using TYPE_PRECISION here is wrong. We care about the
1678 actual bits, not the (arbitrary) range of the type. */
1679 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1680 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1682 HOST_WIDE_INT high_value
;
1685 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1687 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
1688 /* Can not handle precisions greater than twice the host int size. */
1690 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1691 /* Shifting by the host word size is undefined according to the ANSI
1692 standard, so we must handle this as a special case. */
1695 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1697 return (TREE_INT_CST_LOW (expr
) == ~ (unsigned HOST_WIDE_INT
) 0
1698 && TREE_INT_CST_HIGH (expr
) == high_value
);
1701 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1704 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1708 integer_pow2p (expr
)
1712 HOST_WIDE_INT high
, low
;
1716 if (TREE_CODE (expr
) == COMPLEX_CST
1717 && integer_pow2p (TREE_REALPART (expr
))
1718 && integer_zerop (TREE_IMAGPART (expr
)))
1721 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1724 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1725 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1726 high
= TREE_INT_CST_HIGH (expr
);
1727 low
= TREE_INT_CST_LOW (expr
);
1729 /* First clear all bits that are beyond the type's precision in case
1730 we've been sign extended. */
1732 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1734 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1735 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1739 if (prec
< HOST_BITS_PER_WIDE_INT
)
1740 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1743 if (high
== 0 && low
== 0)
1746 return ((high
== 0 && (low
& (low
- 1)) == 0)
1747 || (low
== 0 && (high
& (high
- 1)) == 0));
1750 /* Return the power of two represented by a tree node known to be a
1758 HOST_WIDE_INT high
, low
;
1762 if (TREE_CODE (expr
) == COMPLEX_CST
)
1763 return tree_log2 (TREE_REALPART (expr
));
1765 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1766 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1768 high
= TREE_INT_CST_HIGH (expr
);
1769 low
= TREE_INT_CST_LOW (expr
);
1771 /* First clear all bits that are beyond the type's precision in case
1772 we've been sign extended. */
1774 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1776 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1777 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1781 if (prec
< HOST_BITS_PER_WIDE_INT
)
1782 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1785 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1786 : exact_log2 (low
));
1789 /* Similar, but return the largest integer Y such that 2 ** Y is less
1790 than or equal to EXPR. */
1793 tree_floor_log2 (expr
)
1797 HOST_WIDE_INT high
, low
;
1801 if (TREE_CODE (expr
) == COMPLEX_CST
)
1802 return tree_log2 (TREE_REALPART (expr
));
1804 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1805 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1807 high
= TREE_INT_CST_HIGH (expr
);
1808 low
= TREE_INT_CST_LOW (expr
);
1810 /* First clear all bits that are beyond the type's precision in case
1811 we've been sign extended. Ignore if type's precision hasn't been set
1812 since what we are doing is setting it. */
1814 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1816 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1817 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1821 if (prec
< HOST_BITS_PER_WIDE_INT
)
1822 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1825 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1826 : floor_log2 (low
));
1829 /* Return 1 if EXPR is the real constant zero. */
1837 return ((TREE_CODE (expr
) == REAL_CST
1838 && ! TREE_CONSTANT_OVERFLOW (expr
)
1839 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1840 || (TREE_CODE (expr
) == COMPLEX_CST
1841 && real_zerop (TREE_REALPART (expr
))
1842 && real_zerop (TREE_IMAGPART (expr
))));
1845 /* Return 1 if EXPR is the real constant one in real or complex form. */
1853 return ((TREE_CODE (expr
) == REAL_CST
1854 && ! TREE_CONSTANT_OVERFLOW (expr
)
1855 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1856 || (TREE_CODE (expr
) == COMPLEX_CST
1857 && real_onep (TREE_REALPART (expr
))
1858 && real_zerop (TREE_IMAGPART (expr
))));
1861 /* Return 1 if EXPR is the real constant two. */
1869 return ((TREE_CODE (expr
) == REAL_CST
1870 && ! TREE_CONSTANT_OVERFLOW (expr
)
1871 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1872 || (TREE_CODE (expr
) == COMPLEX_CST
1873 && real_twop (TREE_REALPART (expr
))
1874 && real_zerop (TREE_IMAGPART (expr
))));
1877 /* Nonzero if EXP is a constant or a cast of a constant. */
1880 really_constant_p (exp
)
1883 /* This is not quite the same as STRIP_NOPS. It does more. */
1884 while (TREE_CODE (exp
) == NOP_EXPR
1885 || TREE_CODE (exp
) == CONVERT_EXPR
1886 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1887 exp
= TREE_OPERAND (exp
, 0);
1888 return TREE_CONSTANT (exp
);
1891 /* Return first list element whose TREE_VALUE is ELEM.
1892 Return 0 if ELEM is not in LIST. */
1895 value_member (elem
, list
)
1900 if (elem
== TREE_VALUE (list
))
1902 list
= TREE_CHAIN (list
);
1907 /* Return first list element whose TREE_PURPOSE is ELEM.
1908 Return 0 if ELEM is not in LIST. */
1911 purpose_member (elem
, list
)
1916 if (elem
== TREE_PURPOSE (list
))
1918 list
= TREE_CHAIN (list
);
1923 /* Return first list element whose BINFO_TYPE is ELEM.
1924 Return 0 if ELEM is not in LIST. */
1927 binfo_member (elem
, list
)
1932 if (elem
== BINFO_TYPE (list
))
1934 list
= TREE_CHAIN (list
);
1939 /* Return nonzero if ELEM is part of the chain CHAIN. */
1942 chain_member (elem
, chain
)
1949 chain
= TREE_CHAIN (chain
);
1955 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1956 chain CHAIN. This and the next function are currently unused, but
1957 are retained for completeness. */
1960 chain_member_value (elem
, chain
)
1965 if (elem
== TREE_VALUE (chain
))
1967 chain
= TREE_CHAIN (chain
);
1973 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1974 for any piece of chain CHAIN. */
1977 chain_member_purpose (elem
, chain
)
1982 if (elem
== TREE_PURPOSE (chain
))
1984 chain
= TREE_CHAIN (chain
);
1990 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1991 We expect a null pointer to mark the end of the chain.
1992 This is the Lisp primitive `length'. */
1999 register int len
= 0;
2001 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
2007 /* Returns the number of FIELD_DECLs in TYPE. */
2010 fields_length (type
)
2013 tree t
= TYPE_FIELDS (type
);
2016 for (; t
; t
= TREE_CHAIN (t
))
2017 if (TREE_CODE (t
) == FIELD_DECL
)
2023 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2024 by modifying the last node in chain 1 to point to chain 2.
2025 This is the Lisp primitive `nconc'. */
2035 #ifdef ENABLE_TREE_CHECKING
2039 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2041 TREE_CHAIN (t1
) = op2
;
2042 #ifdef ENABLE_TREE_CHECKING
2043 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2045 abort (); /* Circularity created. */
2052 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2056 register tree chain
;
2060 while ((next
= TREE_CHAIN (chain
)))
2065 /* Reverse the order of elements in the chain T,
2066 and return the new head of the chain (old last element). */
2072 register tree prev
= 0, decl
, next
;
2073 for (decl
= t
; decl
; decl
= next
)
2075 next
= TREE_CHAIN (decl
);
2076 TREE_CHAIN (decl
) = prev
;
2082 /* Given a chain CHAIN of tree nodes,
2083 construct and return a list of those nodes. */
2089 tree result
= NULL_TREE
;
2090 tree in_tail
= chain
;
2091 tree out_tail
= NULL_TREE
;
2095 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
2097 TREE_CHAIN (out_tail
) = next
;
2101 in_tail
= TREE_CHAIN (in_tail
);
2107 /* Return a newly created TREE_LIST node whose
2108 purpose and value fields are PARM and VALUE. */
2111 build_tree_list (parm
, value
)
2114 register tree t
= make_node (TREE_LIST
);
2115 TREE_PURPOSE (t
) = parm
;
2116 TREE_VALUE (t
) = value
;
2120 /* Similar, but build on the temp_decl_obstack. */
2123 build_decl_list (parm
, value
)
2127 register struct obstack
*ambient_obstack
= current_obstack
;
2129 current_obstack
= &temp_decl_obstack
;
2130 node
= build_tree_list (parm
, value
);
2131 current_obstack
= ambient_obstack
;
2135 /* Similar, but build on the expression_obstack. */
2138 build_expr_list (parm
, value
)
2142 register struct obstack
*ambient_obstack
= current_obstack
;
2144 current_obstack
= expression_obstack
;
2145 node
= build_tree_list (parm
, value
);
2146 current_obstack
= ambient_obstack
;
2150 /* Return a newly created TREE_LIST node whose
2151 purpose and value fields are PARM and VALUE
2152 and whose TREE_CHAIN is CHAIN. */
2155 tree_cons (purpose
, value
, chain
)
2156 tree purpose
, value
, chain
;
2161 node
= ggc_alloc_tree (sizeof (struct tree_list
));
2164 node
= (tree
) obstack_alloc (current_obstack
, sizeof (struct tree_list
));
2165 memset (node
, 0, sizeof (struct tree_common
));
2168 #ifdef GATHER_STATISTICS
2169 tree_node_counts
[(int)x_kind
]++;
2170 tree_node_sizes
[(int)x_kind
] += sizeof (struct tree_list
);
2173 TREE_SET_CODE (node
, TREE_LIST
);
2174 TREE_SET_PERMANENT (node
);
2176 TREE_CHAIN (node
) = chain
;
2177 TREE_PURPOSE (node
) = purpose
;
2178 TREE_VALUE (node
) = value
;
2182 /* Similar, but build on the temp_decl_obstack. */
2185 decl_tree_cons (purpose
, value
, chain
)
2186 tree purpose
, value
, chain
;
2189 register struct obstack
*ambient_obstack
= current_obstack
;
2191 current_obstack
= &temp_decl_obstack
;
2192 node
= tree_cons (purpose
, value
, chain
);
2193 current_obstack
= ambient_obstack
;
2197 /* Similar, but build on the expression_obstack. */
2200 expr_tree_cons (purpose
, value
, chain
)
2201 tree purpose
, value
, chain
;
2204 register struct obstack
*ambient_obstack
= current_obstack
;
2206 current_obstack
= expression_obstack
;
2207 node
= tree_cons (purpose
, value
, chain
);
2208 current_obstack
= ambient_obstack
;
2212 /* Same as `tree_cons' but make a permanent object. */
2215 perm_tree_cons (purpose
, value
, chain
)
2216 tree purpose
, value
, chain
;
2219 register struct obstack
*ambient_obstack
= current_obstack
;
2221 current_obstack
= &permanent_obstack
;
2222 node
= tree_cons (purpose
, value
, chain
);
2223 current_obstack
= ambient_obstack
;
2227 /* Same as `tree_cons', but make this node temporary, regardless. */
2230 temp_tree_cons (purpose
, value
, chain
)
2231 tree purpose
, value
, chain
;
2234 register struct obstack
*ambient_obstack
= current_obstack
;
2236 current_obstack
= &temporary_obstack
;
2237 node
= tree_cons (purpose
, value
, chain
);
2238 current_obstack
= ambient_obstack
;
2242 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2245 saveable_tree_cons (purpose
, value
, chain
)
2246 tree purpose
, value
, chain
;
2249 register struct obstack
*ambient_obstack
= current_obstack
;
2251 current_obstack
= saveable_obstack
;
2252 node
= tree_cons (purpose
, value
, chain
);
2253 current_obstack
= ambient_obstack
;
2257 /* Return the size nominally occupied by an object of type TYPE
2258 when it resides in memory. The value is measured in units of bytes,
2259 and its data type is that normally used for type sizes
2260 (which is the first type created by make_signed_type or
2261 make_unsigned_type). */
2264 size_in_bytes (type
)
2269 if (type
== error_mark_node
)
2270 return integer_zero_node
;
2272 type
= TYPE_MAIN_VARIANT (type
);
2273 t
= TYPE_SIZE_UNIT (type
);
2277 incomplete_type_error (NULL_TREE
, type
);
2278 return integer_zero_node
;
2281 if (TREE_CODE (t
) == INTEGER_CST
)
2282 force_fit_type (t
, 0);
2287 /* Return the size of TYPE (in bytes) as a wide integer
2288 or return -1 if the size can vary or is larger than an integer. */
2291 int_size_in_bytes (type
)
2296 if (type
== error_mark_node
)
2299 type
= TYPE_MAIN_VARIANT (type
);
2300 t
= TYPE_SIZE_UNIT (type
);
2302 || TREE_CODE (t
) != INTEGER_CST
2303 || TREE_OVERFLOW (t
)
2304 || TREE_INT_CST_HIGH (t
) != 0)
2307 return TREE_INT_CST_LOW (t
);
2310 /* Return the strictest alignment, in bits, that T is known to have. */
2316 unsigned int align0
, align1
;
2318 switch (TREE_CODE (t
))
2320 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
2321 /* If we have conversions, we know that the alignment of the
2322 object must meet each of the alignments of the types. */
2323 align0
= expr_align (TREE_OPERAND (t
, 0));
2324 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2325 return MAX (align0
, align1
);
2327 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2328 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2329 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
2330 /* These don't change the alignment of an object. */
2331 return expr_align (TREE_OPERAND (t
, 0));
2334 /* The best we can do is say that the alignment is the least aligned
2336 align0
= expr_align (TREE_OPERAND (t
, 1));
2337 align1
= expr_align (TREE_OPERAND (t
, 2));
2338 return MIN (align0
, align1
);
2340 case LABEL_DECL
: case CONST_DECL
:
2341 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2342 if (DECL_ALIGN (t
) != 0)
2343 return DECL_ALIGN (t
);
2347 return FUNCTION_BOUNDARY
;
2353 /* Otherwise take the alignment from that of the type. */
2354 return TYPE_ALIGN (TREE_TYPE (t
));
2357 /* Return, as a tree node, the number of elements for TYPE (which is an
2358 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2361 array_type_nelts (type
)
2364 tree index_type
, min
, max
;
2366 /* If they did it with unspecified bounds, then we should have already
2367 given an error about it before we got here. */
2368 if (! TYPE_DOMAIN (type
))
2369 return error_mark_node
;
2371 index_type
= TYPE_DOMAIN (type
);
2372 min
= TYPE_MIN_VALUE (index_type
);
2373 max
= TYPE_MAX_VALUE (index_type
);
2375 return (integer_zerop (min
)
2377 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
2380 /* Return nonzero if arg is static -- a reference to an object in
2381 static storage. This is not the same as the C meaning of `static'. */
2387 switch (TREE_CODE (arg
))
2390 /* Nested functions aren't static, since taking their address
2391 involves a trampoline. */
2392 return (decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
2393 && ! DECL_NON_ADDR_CONST_P (arg
);
2396 return (TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2397 && ! DECL_NON_ADDR_CONST_P (arg
);
2400 return TREE_STATIC (arg
);
2405 /* If we are referencing a bitfield, we can't evaluate an
2406 ADDR_EXPR at compile time and so it isn't a constant. */
2408 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
2409 && staticp (TREE_OPERAND (arg
, 0)));
2415 /* This case is technically correct, but results in setting
2416 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2419 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
2423 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2424 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2425 return staticp (TREE_OPERAND (arg
, 0));
2432 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2433 Do this to any expression which may be used in more than one place,
2434 but must be evaluated only once.
2436 Normally, expand_expr would reevaluate the expression each time.
2437 Calling save_expr produces something that is evaluated and recorded
2438 the first time expand_expr is called on it. Subsequent calls to
2439 expand_expr just reuse the recorded value.
2441 The call to expand_expr that generates code that actually computes
2442 the value is the first call *at compile time*. Subsequent calls
2443 *at compile time* generate code to use the saved value.
2444 This produces correct result provided that *at run time* control
2445 always flows through the insns made by the first expand_expr
2446 before reaching the other places where the save_expr was evaluated.
2447 You, the caller of save_expr, must make sure this is so.
2449 Constants, and certain read-only nodes, are returned with no
2450 SAVE_EXPR because that is safe. Expressions containing placeholders
2451 are not touched; see tree.def for an explanation of what these
2458 register tree t
= fold (expr
);
2460 /* We don't care about whether this can be used as an lvalue in this
2462 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
2463 t
= TREE_OPERAND (t
, 0);
2465 /* If the tree evaluates to a constant, then we don't want to hide that
2466 fact (i.e. this allows further folding, and direct checks for constants).
2467 However, a read-only object that has side effects cannot be bypassed.
2468 Since it is no problem to reevaluate literals, we just return the
2471 if (TREE_CONSTANT (t
) || (TREE_READONLY (t
) && ! TREE_SIDE_EFFECTS (t
))
2472 || TREE_CODE (t
) == SAVE_EXPR
|| TREE_CODE (t
) == ERROR_MARK
)
2475 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2476 it means that the size or offset of some field of an object depends on
2477 the value within another field.
2479 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2480 and some variable since it would then need to be both evaluated once and
2481 evaluated more than once. Front-ends must assure this case cannot
2482 happen by surrounding any such subexpressions in their own SAVE_EXPR
2483 and forcing evaluation at the proper time. */
2484 if (contains_placeholder_p (t
))
2487 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
2489 /* This expression might be placed ahead of a jump to ensure that the
2490 value was computed on both sides of the jump. So make sure it isn't
2491 eliminated as dead. */
2492 TREE_SIDE_EFFECTS (t
) = 1;
2496 /* Arrange for an expression to be expanded multiple independent
2497 times. This is useful for cleanup actions, as the backend can
2498 expand them multiple times in different places. */
2506 /* If this is already protected, no sense in protecting it again. */
2507 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
2510 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
2511 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
2515 /* Returns the index of the first non-tree operand for CODE, or the number
2516 of operands if all are trees. */
2520 enum tree_code code
;
2526 case GOTO_SUBROUTINE_EXPR
:
2531 case WITH_CLEANUP_EXPR
:
2532 /* Should be defined to be 2. */
2534 case METHOD_CALL_EXPR
:
2537 return tree_code_length
[(int) code
];
2541 /* Perform any modifications to EXPR required when it is unsaved. Does
2542 not recurse into EXPR's subtrees. */
2545 unsave_expr_1 (expr
)
2548 switch (TREE_CODE (expr
))
2551 if (! SAVE_EXPR_PERSISTENT_P (expr
))
2552 SAVE_EXPR_RTL (expr
) = 0;
2556 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2557 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2561 /* I don't yet know how to emit a sequence multiple times. */
2562 if (RTL_EXPR_SEQUENCE (expr
) != 0)
2567 CALL_EXPR_RTL (expr
) = 0;
2571 if (lang_unsave_expr_now
!= 0)
2572 (*lang_unsave_expr_now
) (expr
);
2577 /* Helper function for unsave_expr_now. */
2580 unsave_expr_now_r (expr
)
2583 enum tree_code code
;
2585 /* There's nothing to do for NULL_TREE. */
2589 unsave_expr_1 (expr
);
2591 code
= TREE_CODE (expr
);
2592 if (code
== CALL_EXPR
2593 && TREE_OPERAND (expr
, 1)
2594 && TREE_CODE (TREE_OPERAND (expr
, 1)) == TREE_LIST
)
2596 tree exp
= TREE_OPERAND (expr
, 1);
2599 unsave_expr_now_r (TREE_VALUE (exp
));
2600 exp
= TREE_CHAIN (exp
);
2604 switch (TREE_CODE_CLASS (code
))
2606 case 'c': /* a constant */
2607 case 't': /* a type node */
2608 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2609 case 'd': /* A decl node */
2610 case 'b': /* A block node */
2613 case 'e': /* an expression */
2614 case 'r': /* a reference */
2615 case 's': /* an expression with side effects */
2616 case '<': /* a comparison expression */
2617 case '2': /* a binary arithmetic expression */
2618 case '1': /* a unary arithmetic expression */
2622 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
2623 unsave_expr_now_r (TREE_OPERAND (expr
, i
));
2632 /* Modify a tree in place so that all the evaluate only once things
2633 are cleared out. Return the EXPR given. */
2636 unsave_expr_now (expr
)
2639 if (lang_unsave
!= 0)
2640 (*lang_unsave
) (&expr
);
2642 unsave_expr_now_r (expr
);
2647 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2648 or offset that depends on a field within a record. */
2651 contains_placeholder_p (exp
)
2654 register enum tree_code code
= TREE_CODE (exp
);
2657 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2658 in it since it is supplying a value for it. */
2659 if (code
== WITH_RECORD_EXPR
)
2661 else if (code
== PLACEHOLDER_EXPR
)
2664 switch (TREE_CODE_CLASS (code
))
2667 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2668 position computations since they will be converted into a
2669 WITH_RECORD_EXPR involving the reference, which will assume
2670 here will be valid. */
2671 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2674 if (code
== TREE_LIST
)
2675 return (contains_placeholder_p (TREE_VALUE (exp
))
2676 || (TREE_CHAIN (exp
) != 0
2677 && contains_placeholder_p (TREE_CHAIN (exp
))));
2686 /* Ignoring the first operand isn't quite right, but works best. */
2687 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
2694 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2695 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
2696 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
2699 /* If we already know this doesn't have a placeholder, don't
2701 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
2704 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
2705 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
2707 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
2712 return (TREE_OPERAND (exp
, 1) != 0
2713 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2719 switch (tree_code_length
[(int) code
])
2722 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2724 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2725 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2736 /* Return 1 if EXP contains any expressions that produce cleanups for an
2737 outer scope to deal with. Used by fold. */
2745 if (! TREE_SIDE_EFFECTS (exp
))
2748 switch (TREE_CODE (exp
))
2751 case GOTO_SUBROUTINE_EXPR
:
2752 case WITH_CLEANUP_EXPR
:
2755 case CLEANUP_POINT_EXPR
:
2759 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
2761 cmp
= has_cleanups (TREE_VALUE (exp
));
2771 /* This general rule works for most tree codes. All exceptions should be
2772 handled above. If this is a language-specific tree code, we can't
2773 trust what might be in the operand, so say we don't know
2775 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
2778 nops
= first_rtl_op (TREE_CODE (exp
));
2779 for (i
= 0; i
< nops
; i
++)
2780 if (TREE_OPERAND (exp
, i
) != 0)
2782 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
2783 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
2784 || type
== 'r' || type
== 's')
2786 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
2795 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2796 return a tree with all occurrences of references to F in a
2797 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2798 contains only arithmetic expressions or a CALL_EXPR with a
2799 PLACEHOLDER_EXPR occurring only in its arglist. */
2802 substitute_in_expr (exp
, f
, r
)
2807 enum tree_code code
= TREE_CODE (exp
);
2812 switch (TREE_CODE_CLASS (code
))
2819 if (code
== PLACEHOLDER_EXPR
)
2821 else if (code
== TREE_LIST
)
2823 op0
= (TREE_CHAIN (exp
) == 0
2824 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2825 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2826 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2829 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2838 switch (tree_code_length
[(int) code
])
2841 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2842 if (op0
== TREE_OPERAND (exp
, 0))
2845 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2849 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2850 could, but we don't support it. */
2851 if (code
== RTL_EXPR
)
2853 else if (code
== CONSTRUCTOR
)
2856 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2857 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2858 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2861 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2865 /* It cannot be that anything inside a SAVE_EXPR contains a
2866 PLACEHOLDER_EXPR. */
2867 if (code
== SAVE_EXPR
)
2870 else if (code
== CALL_EXPR
)
2872 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2873 if (op1
== TREE_OPERAND (exp
, 1))
2876 return build (code
, TREE_TYPE (exp
),
2877 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2880 else if (code
!= COND_EXPR
)
2883 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2884 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2885 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2886 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2887 && op2
== TREE_OPERAND (exp
, 2))
2890 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2903 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2904 and it is the right field, replace it with R. */
2905 for (inner
= TREE_OPERAND (exp
, 0);
2906 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2907 inner
= TREE_OPERAND (inner
, 0))
2909 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2910 && TREE_OPERAND (exp
, 1) == f
)
2913 /* If this expression hasn't been completed let, leave it
2915 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2916 && TREE_TYPE (inner
) == 0)
2919 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2920 if (op0
== TREE_OPERAND (exp
, 0))
2923 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2924 TREE_OPERAND (exp
, 1)));
2928 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2929 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2930 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2931 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2932 && op2
== TREE_OPERAND (exp
, 2))
2935 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2940 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2941 if (op0
== TREE_OPERAND (exp
, 0))
2944 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2956 TREE_READONLY (new) = TREE_READONLY (exp
);
2960 /* Stabilize a reference so that we can use it any number of times
2961 without causing its operands to be evaluated more than once.
2962 Returns the stabilized reference. This works by means of save_expr,
2963 so see the caveats in the comments about save_expr.
2965 Also allows conversion expressions whose operands are references.
2966 Any other kind of expression is returned unchanged. */
2969 stabilize_reference (ref
)
2972 register tree result
;
2973 register enum tree_code code
= TREE_CODE (ref
);
2980 /* No action is needed in this case. */
2986 case FIX_TRUNC_EXPR
:
2987 case FIX_FLOOR_EXPR
:
2988 case FIX_ROUND_EXPR
:
2990 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2994 result
= build_nt (INDIRECT_REF
,
2995 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2999 result
= build_nt (COMPONENT_REF
,
3000 stabilize_reference (TREE_OPERAND (ref
, 0)),
3001 TREE_OPERAND (ref
, 1));
3005 result
= build_nt (BIT_FIELD_REF
,
3006 stabilize_reference (TREE_OPERAND (ref
, 0)),
3007 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3008 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3012 result
= build_nt (ARRAY_REF
,
3013 stabilize_reference (TREE_OPERAND (ref
, 0)),
3014 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
3018 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3019 it wouldn't be ignored. This matters when dealing with
3021 return stabilize_reference_1 (ref
);
3024 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
3025 save_expr (build1 (ADDR_EXPR
,
3026 build_pointer_type (TREE_TYPE (ref
)),
3031 /* If arg isn't a kind of lvalue we recognize, make no change.
3032 Caller should recognize the error for an invalid lvalue. */
3037 return error_mark_node
;
3040 TREE_TYPE (result
) = TREE_TYPE (ref
);
3041 TREE_READONLY (result
) = TREE_READONLY (ref
);
3042 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3043 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3048 /* Subroutine of stabilize_reference; this is called for subtrees of
3049 references. Any expression with side-effects must be put in a SAVE_EXPR
3050 to ensure that it is only evaluated once.
3052 We don't put SAVE_EXPR nodes around everything, because assigning very
3053 simple expressions to temporaries causes us to miss good opportunities
3054 for optimizations. Among other things, the opportunity to fold in the
3055 addition of a constant into an addressing mode often gets lost, e.g.
3056 "y[i+1] += x;". In general, we take the approach that we should not make
3057 an assignment unless we are forced into it - i.e., that any non-side effect
3058 operator should be allowed, and that cse should take care of coalescing
3059 multiple utterances of the same expression should that prove fruitful. */
3062 stabilize_reference_1 (e
)
3065 register tree result
;
3066 register enum tree_code code
= TREE_CODE (e
);
3068 /* We cannot ignore const expressions because it might be a reference
3069 to a const array but whose index contains side-effects. But we can
3070 ignore things that are actual constant or that already have been
3071 handled by this function. */
3073 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
3076 switch (TREE_CODE_CLASS (code
))
3086 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3087 so that it will only be evaluated once. */
3088 /* The reference (r) and comparison (<) classes could be handled as
3089 below, but it is generally faster to only evaluate them once. */
3090 if (TREE_SIDE_EFFECTS (e
))
3091 return save_expr (e
);
3095 /* Constants need no processing. In fact, we should never reach
3100 /* Division is slow and tends to be compiled with jumps,
3101 especially the division by powers of 2 that is often
3102 found inside of an array reference. So do it just once. */
3103 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3104 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3105 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3106 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3107 return save_expr (e
);
3108 /* Recursively stabilize each operand. */
3109 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3110 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3114 /* Recursively stabilize each operand. */
3115 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3122 TREE_TYPE (result
) = TREE_TYPE (e
);
3123 TREE_READONLY (result
) = TREE_READONLY (e
);
3124 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3125 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3130 /* Low-level constructors for expressions. */
3132 /* Build an expression of code CODE, data type TYPE,
3133 and operands as specified by the arguments ARG1 and following arguments.
3134 Expressions and reference nodes can be created this way.
3135 Constants, decls, types and misc nodes cannot be. */
3138 build
VPARAMS ((enum tree_code code
, tree tt
, ...))
3140 #ifndef ANSI_PROTOTYPES
3141 enum tree_code code
;
3146 register int length
;
3152 #ifndef ANSI_PROTOTYPES
3153 code
= va_arg (p
, enum tree_code
);
3154 tt
= va_arg (p
, tree
);
3157 t
= make_node (code
);
3158 length
= tree_code_length
[(int) code
];
3161 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_RAISED for
3162 the result based on those same flags for the arguments. But, if
3163 the arguments aren't really even `tree' expressions, we shouldn't
3164 be trying to do this. */
3165 fro
= first_rtl_op (code
);
3169 /* This is equivalent to the loop below, but faster. */
3170 register tree arg0
= va_arg (p
, tree
);
3171 register tree arg1
= va_arg (p
, tree
);
3172 TREE_OPERAND (t
, 0) = arg0
;
3173 TREE_OPERAND (t
, 1) = arg1
;
3174 if (arg0
&& fro
> 0)
3176 if (TREE_SIDE_EFFECTS (arg0
))
3177 TREE_SIDE_EFFECTS (t
) = 1;
3179 if (arg1
&& fro
> 1)
3181 if (TREE_SIDE_EFFECTS (arg1
))
3182 TREE_SIDE_EFFECTS (t
) = 1;
3185 else if (length
== 1)
3187 register tree arg0
= va_arg (p
, tree
);
3189 /* Call build1 for this! */
3190 if (TREE_CODE_CLASS (code
) != 's')
3192 TREE_OPERAND (t
, 0) = arg0
;
3195 if (arg0
&& TREE_SIDE_EFFECTS (arg0
))
3196 TREE_SIDE_EFFECTS (t
) = 1;
3201 for (i
= 0; i
< length
; i
++)
3203 register tree operand
= va_arg (p
, tree
);
3204 TREE_OPERAND (t
, i
) = operand
;
3205 if (operand
&& fro
> i
)
3207 if (TREE_SIDE_EFFECTS (operand
))
3208 TREE_SIDE_EFFECTS (t
) = 1;
3216 /* Same as above, but only builds for unary operators.
3217 Saves lions share of calls to `build'; cuts down use
3218 of varargs, which is expensive for RISC machines. */
3221 build1 (code
, type
, node
)
3222 enum tree_code code
;
3226 register struct obstack
*obstack
= expression_obstack
;
3227 register int length
;
3228 #ifdef GATHER_STATISTICS
3229 register tree_node_kind kind
;
3233 #ifdef GATHER_STATISTICS
3234 if (TREE_CODE_CLASS (code
) == 'r')
3240 length
= sizeof (struct tree_exp
);
3243 t
= ggc_alloc_tree (length
);
3246 t
= (tree
) obstack_alloc (obstack
, length
);
3247 memset ((PTR
) t
, 0, length
);
3250 #ifdef GATHER_STATISTICS
3251 tree_node_counts
[(int)kind
]++;
3252 tree_node_sizes
[(int)kind
] += length
;
3255 TREE_TYPE (t
) = type
;
3256 TREE_SET_CODE (t
, code
);
3257 TREE_SET_PERMANENT (t
);
3259 TREE_OPERAND (t
, 0) = node
;
3260 if (node
&& first_rtl_op (code
) != 0)
3262 if (TREE_SIDE_EFFECTS (node
))
3263 TREE_SIDE_EFFECTS (t
) = 1;
3272 case PREDECREMENT_EXPR
:
3273 case PREINCREMENT_EXPR
:
3274 case POSTDECREMENT_EXPR
:
3275 case POSTINCREMENT_EXPR
:
3276 /* All of these have side-effects, no matter what their
3278 TREE_SIDE_EFFECTS (t
) = 1;
3288 /* Similar except don't specify the TREE_TYPE
3289 and leave the TREE_SIDE_EFFECTS as 0.
3290 It is permissible for arguments to be null,
3291 or even garbage if their values do not matter. */
3294 build_nt
VPARAMS ((enum tree_code code
, ...))
3296 #ifndef ANSI_PROTOTYPES
3297 enum tree_code code
;
3301 register int length
;
3306 #ifndef ANSI_PROTOTYPES
3307 code
= va_arg (p
, enum tree_code
);
3310 t
= make_node (code
);
3311 length
= tree_code_length
[(int) code
];
3313 for (i
= 0; i
< length
; i
++)
3314 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3320 /* Similar to `build_nt', except we build
3321 on the temp_decl_obstack, regardless. */
3324 build_parse_node
VPARAMS ((enum tree_code code
, ...))
3326 #ifndef ANSI_PROTOTYPES
3327 enum tree_code code
;
3329 register struct obstack
*ambient_obstack
= expression_obstack
;
3332 register int length
;
3337 #ifndef ANSI_PROTOTYPES
3338 code
= va_arg (p
, enum tree_code
);
3341 expression_obstack
= &temp_decl_obstack
;
3343 t
= make_node (code
);
3344 length
= tree_code_length
[(int) code
];
3346 for (i
= 0; i
< length
; i
++)
3347 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3350 expression_obstack
= ambient_obstack
;
3355 /* Commented out because this wants to be done very
3356 differently. See cp-lex.c. */
3358 build_op_identifier (op1
, op2
)
3361 register tree t
= make_node (OP_IDENTIFIER
);
3362 TREE_PURPOSE (t
) = op1
;
3363 TREE_VALUE (t
) = op2
;
3368 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3369 We do NOT enter this node in any sort of symbol table.
3371 layout_decl is used to set up the decl's storage layout.
3372 Other slots are initialized to 0 or null pointers. */
3375 build_decl (code
, name
, type
)
3376 enum tree_code code
;
3381 t
= make_node (code
);
3383 /* if (type == error_mark_node)
3384 type = integer_type_node; */
3385 /* That is not done, deliberately, so that having error_mark_node
3386 as the type can suppress useless errors in the use of this variable. */
3388 DECL_NAME (t
) = name
;
3389 DECL_ASSEMBLER_NAME (t
) = name
;
3390 TREE_TYPE (t
) = type
;
3392 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3394 else if (code
== FUNCTION_DECL
)
3395 DECL_MODE (t
) = FUNCTION_MODE
;
3400 /* BLOCK nodes are used to represent the structure of binding contours
3401 and declarations, once those contours have been exited and their contents
3402 compiled. This information is used for outputting debugging info. */
3405 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
3406 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
3408 register tree block
= make_node (BLOCK
);
3410 BLOCK_VARS (block
) = vars
;
3411 BLOCK_SUBBLOCKS (block
) = subblocks
;
3412 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3413 BLOCK_CHAIN (block
) = chain
;
3417 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
3418 location where an expression or an identifier were encountered. It
3419 is necessary for languages where the frontend parser will handle
3420 recursively more than one file (Java is one of them). */
3423 build_expr_wfl (node
, file
, line
, col
)
3428 static const char *last_file
= 0;
3429 static tree last_filenode
= NULL_TREE
;
3430 register tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
3432 EXPR_WFL_NODE (wfl
) = node
;
3433 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
3434 if (file
!= last_file
)
3437 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
3440 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
3443 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
3444 TREE_TYPE (wfl
) = TREE_TYPE (node
);
3450 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3454 build_decl_attribute_variant (ddecl
, attribute
)
3455 tree ddecl
, attribute
;
3457 DECL_MACHINE_ATTRIBUTES (ddecl
) = attribute
;
3461 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3464 Record such modified types already made so we don't make duplicates. */
3467 build_type_attribute_variant (ttype
, attribute
)
3468 tree ttype
, attribute
;
3470 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3472 unsigned int hashcode
;
3475 push_obstacks (TYPE_OBSTACK (ttype
), TYPE_OBSTACK (ttype
));
3476 ntype
= copy_node (ttype
);
3478 TYPE_POINTER_TO (ntype
) = 0;
3479 TYPE_REFERENCE_TO (ntype
) = 0;
3480 TYPE_ATTRIBUTES (ntype
) = attribute
;
3482 /* Create a new main variant of TYPE. */
3483 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3484 TYPE_NEXT_VARIANT (ntype
) = 0;
3485 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3487 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
3488 + TYPE_HASH (TREE_TYPE (ntype
))
3489 + attribute_hash_list (attribute
));
3491 switch (TREE_CODE (ntype
))
3494 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
3497 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
3500 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
3503 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
3509 ntype
= type_hash_canon (hashcode
, ntype
);
3510 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3517 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3518 or type TYPE and 0 otherwise. Validity is determined the configuration
3519 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3522 valid_machine_attribute (attr_name
, attr_args
, decl
, type
)
3524 tree attr_args ATTRIBUTE_UNUSED
;
3525 tree decl ATTRIBUTE_UNUSED
;
3526 tree type ATTRIBUTE_UNUSED
;
3529 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3530 tree decl_attr_list
= decl
!= 0 ? DECL_MACHINE_ATTRIBUTES (decl
) : 0;
3532 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3533 tree type_attr_list
= TYPE_ATTRIBUTES (type
);
3536 if (TREE_CODE (attr_name
) != IDENTIFIER_NODE
)
3539 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3541 && VALID_MACHINE_DECL_ATTRIBUTE (decl
, decl_attr_list
, attr_name
,
3544 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3547 if (attr
!= NULL_TREE
)
3549 /* Override existing arguments. Declarations are unique so we can
3550 modify this in place. */
3551 TREE_VALUE (attr
) = attr_args
;
3555 decl_attr_list
= tree_cons (attr_name
, attr_args
, decl_attr_list
);
3556 decl
= build_decl_attribute_variant (decl
, decl_attr_list
);
3563 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3565 /* Don't apply the attribute to both the decl and the type. */;
3566 else if (VALID_MACHINE_TYPE_ATTRIBUTE (type
, type_attr_list
, attr_name
,
3569 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3572 if (attr
!= NULL_TREE
)
3574 /* Override existing arguments.
3575 ??? This currently works since attribute arguments are not
3576 included in `attribute_hash_list'. Something more complicated
3577 may be needed in the future. */
3578 TREE_VALUE (attr
) = attr_args
;
3582 /* If this is part of a declaration, create a type variant,
3583 otherwise, this is part of a type definition, so add it
3584 to the base type. */
3585 type_attr_list
= tree_cons (attr_name
, attr_args
, type_attr_list
);
3587 type
= build_type_attribute_variant (type
, type_attr_list
);
3589 TYPE_ATTRIBUTES (type
) = type_attr_list
;
3593 TREE_TYPE (decl
) = type
;
3598 /* Handle putting a type attribute on pointer-to-function-type by putting
3599 the attribute on the function type. */
3600 else if (POINTER_TYPE_P (type
)
3601 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3602 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type
), type_attr_list
,
3603 attr_name
, attr_args
))
3605 tree inner_type
= TREE_TYPE (type
);
3606 tree inner_attr_list
= TYPE_ATTRIBUTES (inner_type
);
3607 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3610 if (attr
!= NULL_TREE
)
3611 TREE_VALUE (attr
) = attr_args
;
3614 inner_attr_list
= tree_cons (attr_name
, attr_args
, inner_attr_list
);
3615 inner_type
= build_type_attribute_variant (inner_type
,
3620 TREE_TYPE (decl
) = build_pointer_type (inner_type
);
3623 /* Clear TYPE_POINTER_TO for the old inner type, since
3624 `type' won't be pointing to it anymore. */
3625 TYPE_POINTER_TO (TREE_TYPE (type
)) = NULL_TREE
;
3626 TREE_TYPE (type
) = inner_type
;
3636 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3639 We try both `text' and `__text__', ATTR may be either one. */
3640 /* ??? It might be a reasonable simplification to require ATTR to be only
3641 `text'. One might then also require attribute lists to be stored in
3642 their canonicalized form. */
3645 is_attribute_p (attr
, ident
)
3649 int ident_len
, attr_len
;
3652 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3655 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
3658 p
= IDENTIFIER_POINTER (ident
);
3659 ident_len
= strlen (p
);
3660 attr_len
= strlen (attr
);
3662 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3666 || attr
[attr_len
- 2] != '_'
3667 || attr
[attr_len
- 1] != '_')
3669 if (ident_len
== attr_len
- 4
3670 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3675 if (ident_len
== attr_len
+ 4
3676 && p
[0] == '_' && p
[1] == '_'
3677 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3678 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3685 /* Given an attribute name and a list of attributes, return a pointer to the
3686 attribute's list element if the attribute is part of the list, or NULL_TREE
3690 lookup_attribute (attr_name
, list
)
3691 const char *attr_name
;
3696 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3698 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
3700 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
3707 /* Return an attribute list that is the union of a1 and a2. */
3710 merge_attributes (a1
, a2
)
3711 register tree a1
, a2
;
3715 /* Either one unset? Take the set one. */
3717 if ((attributes
= a1
) == 0)
3720 /* One that completely contains the other? Take it. */
3722 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3724 if (attribute_list_contained (a2
, a1
))
3728 /* Pick the longest list, and hang on the other list. */
3729 /* ??? For the moment we punt on the issue of attrs with args. */
3731 if (list_length (a1
) < list_length (a2
))
3732 attributes
= a2
, a2
= a1
;
3734 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3735 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3736 attributes
) == NULL_TREE
)
3738 a1
= copy_node (a2
);
3739 TREE_CHAIN (a1
) = attributes
;
3747 /* Given types T1 and T2, merge their attributes and return
3751 merge_machine_type_attributes (t1
, t2
)
3754 #ifdef MERGE_MACHINE_TYPE_ATTRIBUTES
3755 return MERGE_MACHINE_TYPE_ATTRIBUTES (t1
, t2
);
3757 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3758 TYPE_ATTRIBUTES (t2
));
3762 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3766 merge_machine_decl_attributes (olddecl
, newdecl
)
3767 tree olddecl
, newdecl
;
3769 #ifdef MERGE_MACHINE_DECL_ATTRIBUTES
3770 return MERGE_MACHINE_DECL_ATTRIBUTES (olddecl
, newdecl
);
3772 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl
),
3773 DECL_MACHINE_ATTRIBUTES (newdecl
));
3777 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3778 of the various TYPE_QUAL values. */
3781 set_type_quals (type
, type_quals
)
3785 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3786 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3787 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3790 /* Given a type node TYPE and a TYPE_QUALIFIER_SET, return a type for
3791 the same kind of data as TYPE describes. Variants point to the
3792 "main variant" (which has no qualifiers set) via TYPE_MAIN_VARIANT,
3793 and it points to a chain of other variants so that duplicate
3794 variants are never made. Only main variants should ever appear as
3795 types of expressions. */
3798 build_qualified_type (type
, type_quals
)
3804 /* Search the chain of variants to see if there is already one there just
3805 like the one we need to have. If so, use that existing one. We must
3806 preserve the TYPE_NAME, since there is code that depends on this. */
3808 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3809 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
))
3812 /* We need a new one. */
3813 t
= build_type_copy (type
);
3814 set_type_quals (t
, type_quals
);
3818 /* Create a new variant of TYPE, equivalent but distinct.
3819 This is so the caller can modify it. */
3822 build_type_copy (type
)
3825 register tree t
, m
= TYPE_MAIN_VARIANT (type
);
3826 register struct obstack
*ambient_obstack
= current_obstack
;
3828 current_obstack
= TYPE_OBSTACK (type
);
3829 t
= copy_node (type
);
3830 current_obstack
= ambient_obstack
;
3832 TYPE_POINTER_TO (t
) = 0;
3833 TYPE_REFERENCE_TO (t
) = 0;
3835 /* Add this type to the chain of variants of TYPE. */
3836 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3837 TYPE_NEXT_VARIANT (m
) = t
;
3842 /* Hashing of types so that we don't make duplicates.
3843 The entry point is `type_hash_canon'. */
3845 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3846 with types in the TREE_VALUE slots), by adding the hash codes
3847 of the individual types. */
3850 type_hash_list (list
)
3853 unsigned int hashcode
;
3856 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3857 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3862 /* Look in the type hash table for a type isomorphic to TYPE.
3863 If one is found, return it. Otherwise return 0. */
3866 type_hash_lookup (hashcode
, type
)
3867 unsigned int hashcode
;
3870 register struct type_hash
*h
;
3872 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3873 must call that routine before comparing TYPE_ALIGNs. */
3876 for (h
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
]; h
; h
= h
->next
)
3877 if (h
->hashcode
== hashcode
3878 && TREE_CODE (h
->type
) == TREE_CODE (type
)
3879 && TREE_TYPE (h
->type
) == TREE_TYPE (type
)
3880 && attribute_list_equal (TYPE_ATTRIBUTES (h
->type
),
3881 TYPE_ATTRIBUTES (type
))
3882 && TYPE_ALIGN (h
->type
) == TYPE_ALIGN (type
)
3883 && (TYPE_MAX_VALUE (h
->type
) == TYPE_MAX_VALUE (type
)
3884 || tree_int_cst_equal (TYPE_MAX_VALUE (h
->type
),
3885 TYPE_MAX_VALUE (type
)))
3886 && (TYPE_MIN_VALUE (h
->type
) == TYPE_MIN_VALUE (type
)
3887 || tree_int_cst_equal (TYPE_MIN_VALUE (h
->type
),
3888 TYPE_MIN_VALUE (type
)))
3889 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3890 && (TYPE_DOMAIN (h
->type
) == TYPE_DOMAIN (type
)
3891 || (TYPE_DOMAIN (h
->type
)
3892 && TREE_CODE (TYPE_DOMAIN (h
->type
)) == TREE_LIST
3893 && TYPE_DOMAIN (type
)
3894 && TREE_CODE (TYPE_DOMAIN (type
)) == TREE_LIST
3895 && type_list_equal (TYPE_DOMAIN (h
->type
),
3896 TYPE_DOMAIN (type
)))))
3902 /* Add an entry to the type-hash-table
3903 for a type TYPE whose hash code is HASHCODE. */
3906 type_hash_add (hashcode
, type
)
3907 unsigned int hashcode
;
3910 register struct type_hash
*h
;
3912 h
= (struct type_hash
*) permalloc (sizeof (struct type_hash
));
3913 h
->hashcode
= hashcode
;
3915 h
->next
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
];
3916 type_hash_table
[hashcode
% TYPE_HASH_SIZE
] = h
;
3919 /* Given TYPE, and HASHCODE its hash code, return the canonical
3920 object for an identical type if one already exists.
3921 Otherwise, return TYPE, and record it as the canonical object
3922 if it is a permanent object.
3924 To use this function, first create a type of the sort you want.
3925 Then compute its hash code from the fields of the type that
3926 make it different from other similar types.
3927 Then call this function and use the value.
3928 This function frees the type you pass in if it is a duplicate. */
3930 /* Set to 1 to debug without canonicalization. Never set by program. */
3931 int debug_no_type_hash
= 0;
3934 type_hash_canon (hashcode
, type
)
3935 unsigned int hashcode
;
3940 if (debug_no_type_hash
)
3943 t1
= type_hash_lookup (hashcode
, type
);
3947 obstack_free (TYPE_OBSTACK (type
), type
);
3949 #ifdef GATHER_STATISTICS
3950 tree_node_counts
[(int)t_kind
]--;
3951 tree_node_sizes
[(int)t_kind
] -= sizeof (struct tree_type
);
3956 /* If this is a permanent type, record it for later reuse. */
3957 if (ggc_p
|| TREE_PERMANENT (type
))
3958 type_hash_add (hashcode
, type
);
3963 /* Mark ARG (which is really a struct type_hash **) for GC. */
3966 mark_type_hash (arg
)
3969 struct type_hash
*t
= *(struct type_hash
**) arg
;
3973 ggc_mark_tree (t
->type
);
3978 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3979 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3980 by adding the hash codes of the individual attributes. */
3983 attribute_hash_list (list
)
3986 unsigned int hashcode
;
3989 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3990 /* ??? Do we want to add in TREE_VALUE too? */
3991 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3995 /* Given two lists of attributes, return true if list l2 is
3996 equivalent to l1. */
3999 attribute_list_equal (l1
, l2
)
4002 return attribute_list_contained (l1
, l2
)
4003 && attribute_list_contained (l2
, l1
);
4006 /* Given two lists of attributes, return true if list L2 is
4007 completely contained within L1. */
4008 /* ??? This would be faster if attribute names were stored in a canonicalized
4009 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4010 must be used to show these elements are equivalent (which they are). */
4011 /* ??? It's not clear that attributes with arguments will always be handled
4015 attribute_list_contained (l1
, l2
)
4018 register tree t1
, t2
;
4020 /* First check the obvious, maybe the lists are identical. */
4024 /* Maybe the lists are similar. */
4025 for (t1
= l1
, t2
= l2
;
4027 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4028 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4029 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4031 /* Maybe the lists are equal. */
4032 if (t1
== 0 && t2
== 0)
4035 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4038 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
4043 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
4050 /* Given two lists of types
4051 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4052 return 1 if the lists contain the same types in the same order.
4053 Also, the TREE_PURPOSEs must match. */
4056 type_list_equal (l1
, l2
)
4059 register tree t1
, t2
;
4061 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4062 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4063 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4064 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4065 && (TREE_TYPE (TREE_PURPOSE (t1
))
4066 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4072 /* Nonzero if integer constants T1 and T2
4073 represent the same constant value. */
4076 tree_int_cst_equal (t1
, t2
)
4082 if (t1
== 0 || t2
== 0)
4085 if (TREE_CODE (t1
) == INTEGER_CST
4086 && TREE_CODE (t2
) == INTEGER_CST
4087 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4088 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4094 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4095 The precise way of comparison depends on their data type. */
4098 tree_int_cst_lt (t1
, t2
)
4104 if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
4105 return INT_CST_LT (t1
, t2
);
4107 return INT_CST_LT_UNSIGNED (t1
, t2
);
4110 /* Return the most significant bit of the integer constant T. */
4113 tree_int_cst_msb (t
)
4120 /* Note that using TYPE_PRECISION here is wrong. We care about the
4121 actual bits, not the (arbitrary) range of the type. */
4122 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
4123 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
4124 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
4125 return (l
& 1) == 1;
4128 /* Return an indication of the sign of the integer constant T.
4129 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4130 Note that -1 will never be returned it T's type is unsigned. */
4133 tree_int_cst_sgn (t
)
4136 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4138 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
4140 else if (TREE_INT_CST_HIGH (t
) < 0)
4146 /* Compare two constructor-element-type constants. Return 1 if the lists
4147 are known to be equal; otherwise return 0. */
4150 simple_cst_list_equal (l1
, l2
)
4153 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4155 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4158 l1
= TREE_CHAIN (l1
);
4159 l2
= TREE_CHAIN (l2
);
4165 /* Return truthvalue of whether T1 is the same tree structure as T2.
4166 Return 1 if they are the same.
4167 Return 0 if they are understandably different.
4168 Return -1 if either contains tree structure not understood by
4172 simple_cst_equal (t1
, t2
)
4175 register enum tree_code code1
, code2
;
4181 if (t1
== 0 || t2
== 0)
4184 code1
= TREE_CODE (t1
);
4185 code2
= TREE_CODE (t2
);
4187 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
4189 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4190 || code2
== NON_LVALUE_EXPR
)
4191 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4193 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
4196 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4197 || code2
== NON_LVALUE_EXPR
)
4198 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
4206 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4207 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
4210 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
4213 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
4214 && ! bcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
4215 TREE_STRING_LENGTH (t1
)));
4218 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
4224 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4227 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4231 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4234 /* Special case: if either target is an unallocated VAR_DECL,
4235 it means that it's going to be unified with whatever the
4236 TARGET_EXPR is really supposed to initialize, so treat it
4237 as being equivalent to anything. */
4238 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4239 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4240 && DECL_RTL (TREE_OPERAND (t1
, 0)) == 0)
4241 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4242 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4243 && DECL_RTL (TREE_OPERAND (t2
, 0)) == 0))
4246 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4251 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4253 case WITH_CLEANUP_EXPR
:
4254 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4258 return simple_cst_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
4261 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4262 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4276 /* This general rule works for most tree codes. All exceptions should be
4277 handled above. If this is a language-specific tree code, we can't
4278 trust what might be in the operand, so say we don't know
4280 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4283 switch (TREE_CODE_CLASS (code1
))
4292 for (i
= 0; i
< tree_code_length
[(int) code1
]; i
++)
4294 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4306 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4307 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4308 than U, respectively. */
4311 compare_tree_int (t
, u
)
4315 if (tree_int_cst_sgn (t
) < 0)
4317 else if (TREE_INT_CST_HIGH (t
) != 0)
4319 else if (TREE_INT_CST_LOW (t
) == u
)
4321 else if (TREE_INT_CST_LOW (t
) < u
)
4327 /* Constructors for pointer, array and function types.
4328 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4329 constructed by language-dependent code, not here.) */
4331 /* Construct, lay out and return the type of pointers to TO_TYPE.
4332 If such a type has already been constructed, reuse it. */
4335 build_pointer_type (to_type
)
4338 register tree t
= TYPE_POINTER_TO (to_type
);
4340 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4345 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4346 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4347 t
= make_node (POINTER_TYPE
);
4350 TREE_TYPE (t
) = to_type
;
4352 /* Record this type as the pointer to TO_TYPE. */
4353 TYPE_POINTER_TO (to_type
) = t
;
4355 /* Lay out the type. This function has many callers that are concerned
4356 with expression-construction, and this simplifies them all.
4357 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
4363 /* Build the node for the type of references-to-TO_TYPE. */
4366 build_reference_type (to_type
)
4369 register tree t
= TYPE_REFERENCE_TO (to_type
);
4371 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4376 /* We need a new one. Put this in the same obstack as TO_TYPE. */
4377 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
4378 t
= make_node (REFERENCE_TYPE
);
4381 TREE_TYPE (t
) = to_type
;
4383 /* Record this type as the pointer to TO_TYPE. */
4384 TYPE_REFERENCE_TO (to_type
) = t
;
4391 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4392 MAXVAL should be the maximum value in the domain
4393 (one less than the length of the array).
4395 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4396 We don't enforce this limit, that is up to caller (e.g. language front end).
4397 The limit exists because the result is a signed type and we don't handle
4398 sizes that use more than one HOST_WIDE_INT. */
4401 build_index_type (maxval
)
4404 register tree itype
= make_node (INTEGER_TYPE
);
4406 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4407 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4409 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4410 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
4413 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4414 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4415 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4416 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4417 if (TREE_CODE (maxval
) == INTEGER_CST
)
4419 int maxint
= TREE_INT_CST_LOW (maxval
);
4421 /* If the domain should be empty, make sure the maxval
4422 remains -1 and is not spoiled by truncation. */
4423 if (tree_int_cst_sgn (maxval
) < 0)
4425 TYPE_MAX_VALUE (itype
) = build_int_2 (-1, -1);
4426 TREE_TYPE (TYPE_MAX_VALUE (itype
)) = sizetype
;
4429 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4435 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4436 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4437 low bound LOWVAL and high bound HIGHVAL.
4438 if TYPE==NULL_TREE, sizetype is used. */
4441 build_range_type (type
, lowval
, highval
)
4442 tree type
, lowval
, highval
;
4444 register tree itype
= make_node (INTEGER_TYPE
);
4446 TREE_TYPE (itype
) = type
;
4447 if (type
== NULL_TREE
)
4450 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4451 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4452 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4455 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4456 TYPE_MODE (itype
) = TYPE_MODE (type
);
4457 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4458 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4459 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4460 if (TREE_CODE (lowval
) == INTEGER_CST
)
4462 HOST_WIDE_INT lowint
, highint
;
4465 lowint
= TREE_INT_CST_LOW (lowval
);
4466 if (highval
&& TREE_CODE (highval
) == INTEGER_CST
)
4467 highint
= TREE_INT_CST_LOW (highval
);
4469 highint
= (~(unsigned HOST_WIDE_INT
) 0) >> 1;
4471 maxint
= (int) (highint
- lowint
);
4473 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4479 /* Just like build_index_type, but takes lowval and highval instead
4480 of just highval (maxval). */
4483 build_index_2_type (lowval
,highval
)
4484 tree lowval
, highval
;
4486 return build_range_type (NULL_TREE
, lowval
, highval
);
4489 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4490 Needed because when index types are not hashed, equal index types
4491 built at different times appear distinct, even though structurally,
4495 index_type_equal (itype1
, itype2
)
4496 tree itype1
, itype2
;
4498 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
4501 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
4503 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
4504 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
4505 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
4506 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
4509 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
4510 TYPE_MIN_VALUE (itype2
))
4511 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
4512 TYPE_MAX_VALUE (itype2
)))
4519 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4520 and number of elements specified by the range of values of INDEX_TYPE.
4521 If such a type has already been constructed, reuse it. */
4524 build_array_type (elt_type
, index_type
)
4525 tree elt_type
, index_type
;
4528 unsigned int hashcode
;
4530 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4532 error ("arrays of functions are not meaningful");
4533 elt_type
= integer_type_node
;
4536 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4537 build_pointer_type (elt_type
);
4539 /* Allocate the array after the pointer type,
4540 in case we free it in type_hash_canon. */
4541 t
= make_node (ARRAY_TYPE
);
4542 TREE_TYPE (t
) = elt_type
;
4543 TYPE_DOMAIN (t
) = index_type
;
4545 if (index_type
== 0)
4550 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
4551 t
= type_hash_canon (hashcode
, t
);
4553 if (TYPE_SIZE (t
) == 0)
4558 /* Return the TYPE of the elements comprising
4559 the innermost dimension of ARRAY. */
4562 get_inner_array_type (array
)
4565 tree type
= TREE_TYPE (array
);
4567 while (TREE_CODE (type
) == ARRAY_TYPE
)
4568 type
= TREE_TYPE (type
);
4573 /* Construct, lay out and return
4574 the type of functions returning type VALUE_TYPE
4575 given arguments of types ARG_TYPES.
4576 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4577 are data type nodes for the arguments of the function.
4578 If such a type has already been constructed, reuse it. */
4581 build_function_type (value_type
, arg_types
)
4582 tree value_type
, arg_types
;
4585 unsigned int hashcode
;
4587 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4589 error ("function return type cannot be function");
4590 value_type
= integer_type_node
;
4593 /* Make a node of the sort we want. */
4594 t
= make_node (FUNCTION_TYPE
);
4595 TREE_TYPE (t
) = value_type
;
4596 TYPE_ARG_TYPES (t
) = arg_types
;
4598 /* If we already have such a type, use the old one and free this one. */
4599 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
4600 t
= type_hash_canon (hashcode
, t
);
4602 if (TYPE_SIZE (t
) == 0)
4607 /* Construct, lay out and return the type of methods belonging to class
4608 BASETYPE and whose arguments and values are described by TYPE.
4609 If that type exists already, reuse it.
4610 TYPE must be a FUNCTION_TYPE node. */
4613 build_method_type (basetype
, type
)
4614 tree basetype
, type
;
4617 unsigned int hashcode
;
4619 /* Make a node of the sort we want. */
4620 t
= make_node (METHOD_TYPE
);
4622 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4625 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4626 TREE_TYPE (t
) = TREE_TYPE (type
);
4628 /* The actual arglist for this function includes a "hidden" argument
4629 which is "this". Put it into the list of argument types. */
4632 = tree_cons (NULL_TREE
,
4633 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4635 /* If we already have such a type, use the old one and free this one. */
4636 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4637 t
= type_hash_canon (hashcode
, t
);
4639 if (TYPE_SIZE (t
) == 0)
4645 /* Construct, lay out and return the type of offsets to a value
4646 of type TYPE, within an object of type BASETYPE.
4647 If a suitable offset type exists already, reuse it. */
4650 build_offset_type (basetype
, type
)
4651 tree basetype
, type
;
4654 unsigned int hashcode
;
4656 /* Make a node of the sort we want. */
4657 t
= make_node (OFFSET_TYPE
);
4659 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4660 TREE_TYPE (t
) = type
;
4662 /* If we already have such a type, use the old one and free this one. */
4663 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4664 t
= type_hash_canon (hashcode
, t
);
4666 if (TYPE_SIZE (t
) == 0)
4672 /* Create a complex type whose components are COMPONENT_TYPE. */
4675 build_complex_type (component_type
)
4676 tree component_type
;
4679 unsigned int hashcode
;
4681 /* Make a node of the sort we want. */
4682 t
= make_node (COMPLEX_TYPE
);
4684 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4685 set_type_quals (t
, TYPE_QUALS (component_type
));
4687 /* If we already have such a type, use the old one and free this one. */
4688 hashcode
= TYPE_HASH (component_type
);
4689 t
= type_hash_canon (hashcode
, t
);
4691 if (TYPE_SIZE (t
) == 0)
4694 /* If we are writing Dwarf2 output we need to create a name,
4695 since complex is a fundamental type. */
4696 if (write_symbols
== DWARF2_DEBUG
&& ! TYPE_NAME (t
))
4699 if (component_type
== char_type_node
)
4700 name
= "complex char";
4701 else if (component_type
== signed_char_type_node
)
4702 name
= "complex signed char";
4703 else if (component_type
== unsigned_char_type_node
)
4704 name
= "complex unsigned char";
4705 else if (component_type
== short_integer_type_node
)
4706 name
= "complex short int";
4707 else if (component_type
== short_unsigned_type_node
)
4708 name
= "complex short unsigned int";
4709 else if (component_type
== integer_type_node
)
4710 name
= "complex int";
4711 else if (component_type
== unsigned_type_node
)
4712 name
= "complex unsigned int";
4713 else if (component_type
== long_integer_type_node
)
4714 name
= "complex long int";
4715 else if (component_type
== long_unsigned_type_node
)
4716 name
= "complex long unsigned int";
4717 else if (component_type
== long_long_integer_type_node
)
4718 name
= "complex long long int";
4719 else if (component_type
== long_long_unsigned_type_node
)
4720 name
= "complex long long unsigned int";
4725 TYPE_NAME (t
) = get_identifier (name
);
4731 /* Return OP, stripped of any conversions to wider types as much as is safe.
4732 Converting the value back to OP's type makes a value equivalent to OP.
4734 If FOR_TYPE is nonzero, we return a value which, if converted to
4735 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4737 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4738 narrowest type that can hold the value, even if they don't exactly fit.
4739 Otherwise, bit-field references are changed to a narrower type
4740 only if they can be fetched directly from memory in that type.
4742 OP must have integer, real or enumeral type. Pointers are not allowed!
4744 There are some cases where the obvious value we could return
4745 would regenerate to OP if converted to OP's type,
4746 but would not extend like OP to wider types.
4747 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4748 For example, if OP is (unsigned short)(signed char)-1,
4749 we avoid returning (signed char)-1 if FOR_TYPE is int,
4750 even though extending that to an unsigned short would regenerate OP,
4751 since the result of extending (signed char)-1 to (int)
4752 is different from (int) OP. */
4755 get_unwidened (op
, for_type
)
4759 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4760 register tree type
= TREE_TYPE (op
);
4761 register unsigned final_prec
4762 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4764 = (for_type
!= 0 && for_type
!= type
4765 && final_prec
> TYPE_PRECISION (type
)
4766 && TREE_UNSIGNED (type
));
4767 register tree win
= op
;
4769 while (TREE_CODE (op
) == NOP_EXPR
)
4771 register int bitschange
4772 = TYPE_PRECISION (TREE_TYPE (op
))
4773 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4775 /* Truncations are many-one so cannot be removed.
4776 Unless we are later going to truncate down even farther. */
4778 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4781 /* See what's inside this conversion. If we decide to strip it,
4783 op
= TREE_OPERAND (op
, 0);
4785 /* If we have not stripped any zero-extensions (uns is 0),
4786 we can strip any kind of extension.
4787 If we have previously stripped a zero-extension,
4788 only zero-extensions can safely be stripped.
4789 Any extension can be stripped if the bits it would produce
4790 are all going to be discarded later by truncating to FOR_TYPE. */
4794 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4796 /* TREE_UNSIGNED says whether this is a zero-extension.
4797 Let's avoid computing it if it does not affect WIN
4798 and if UNS will not be needed again. */
4799 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4800 && TREE_UNSIGNED (TREE_TYPE (op
)))
4808 if (TREE_CODE (op
) == COMPONENT_REF
4809 /* Since type_for_size always gives an integer type. */
4810 && TREE_CODE (type
) != REAL_TYPE
4811 /* Don't crash if field not laid out yet. */
4812 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4814 unsigned int innerprec
4815 = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4817 type
= type_for_size (innerprec
, TREE_UNSIGNED (TREE_OPERAND (op
, 1)));
4819 /* We can get this structure field in the narrowest type it fits in.
4820 If FOR_TYPE is 0, do this only for a field that matches the
4821 narrower type exactly and is aligned for it
4822 The resulting extension to its nominal type (a fullword type)
4823 must fit the same conditions as for other extensions. */
4825 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4826 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4827 && (! uns
|| final_prec
<= innerprec
4828 || TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4831 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4832 TREE_OPERAND (op
, 1));
4833 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4834 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4840 /* Return OP or a simpler expression for a narrower value
4841 which can be sign-extended or zero-extended to give back OP.
4842 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4843 or 0 if the value should be sign-extended. */
4846 get_narrower (op
, unsignedp_ptr
)
4850 register int uns
= 0;
4852 register tree win
= op
;
4854 while (TREE_CODE (op
) == NOP_EXPR
)
4856 register int bitschange
4857 = (TYPE_PRECISION (TREE_TYPE (op
))
4858 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4860 /* Truncations are many-one so cannot be removed. */
4864 /* See what's inside this conversion. If we decide to strip it,
4866 op
= TREE_OPERAND (op
, 0);
4870 /* An extension: the outermost one can be stripped,
4871 but remember whether it is zero or sign extension. */
4873 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4874 /* Otherwise, if a sign extension has been stripped,
4875 only sign extensions can now be stripped;
4876 if a zero extension has been stripped, only zero-extensions. */
4877 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4881 else /* bitschange == 0 */
4883 /* A change in nominal type can always be stripped, but we must
4884 preserve the unsignedness. */
4886 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4893 if (TREE_CODE (op
) == COMPONENT_REF
4894 /* Since type_for_size always gives an integer type. */
4895 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
)
4897 unsigned int innerprec
4898 = TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4900 tree type
= type_for_size (innerprec
, TREE_UNSIGNED (op
));
4902 /* We can get this structure field in a narrower type that fits it,
4903 but the resulting extension to its nominal type (a fullword type)
4904 must satisfy the same conditions as for other extensions.
4906 Do this only for fields that are aligned (not bit-fields),
4907 because when bit-field insns will be used there is no
4908 advantage in doing this. */
4910 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4911 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4912 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4916 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4917 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4918 TREE_OPERAND (op
, 1));
4919 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4920 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4923 *unsignedp_ptr
= uns
;
4927 /* Nonzero if integer constant C has a value that is permissible
4928 for type TYPE (an INTEGER_TYPE). */
4931 int_fits_type_p (c
, type
)
4934 if (TREE_UNSIGNED (type
))
4935 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4936 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
))
4937 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4938 && INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
)))
4939 /* Negative ints never fit unsigned types. */
4940 && ! (TREE_INT_CST_HIGH (c
) < 0
4941 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4943 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4944 && INT_CST_LT (TYPE_MAX_VALUE (type
), c
))
4945 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4946 && INT_CST_LT (c
, TYPE_MIN_VALUE (type
)))
4947 /* Unsigned ints with top bit set never fit signed types. */
4948 && ! (TREE_INT_CST_HIGH (c
) < 0
4949 && TREE_UNSIGNED (TREE_TYPE (c
))));
4952 /* Given a DECL or TYPE, return the scope in which it was declared, or
4953 NUL_TREE if there is no containing scope. */
4956 get_containing_scope (t
)
4959 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4962 /* Return the innermost context enclosing DECL that is
4963 a FUNCTION_DECL, or zero if none. */
4966 decl_function_context (decl
)
4971 if (TREE_CODE (decl
) == ERROR_MARK
)
4974 if (TREE_CODE (decl
) == SAVE_EXPR
)
4975 context
= SAVE_EXPR_CONTEXT (decl
);
4976 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4977 where we look up the function at runtime. Such functions always take
4978 a first argument of type 'pointer to real context'.
4980 C++ should really be fixed to use DECL_CONTEXT for the real context,
4981 and use something else for the "virtual context". */
4982 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4983 context
= TYPE_MAIN_VARIANT
4984 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4986 context
= DECL_CONTEXT (decl
);
4988 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4990 if (TREE_CODE (context
) == BLOCK
)
4991 context
= BLOCK_SUPERCONTEXT (context
);
4993 context
= get_containing_scope (context
);
4999 /* Return the innermost context enclosing DECL that is
5000 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5001 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5004 decl_type_context (decl
)
5007 tree context
= DECL_CONTEXT (decl
);
5011 if (TREE_CODE (context
) == RECORD_TYPE
5012 || TREE_CODE (context
) == UNION_TYPE
5013 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
5016 if (TREE_CODE (context
) == TYPE_DECL
5017 || TREE_CODE (context
) == FUNCTION_DECL
)
5018 context
= DECL_CONTEXT (context
);
5020 else if (TREE_CODE (context
) == BLOCK
)
5021 context
= BLOCK_SUPERCONTEXT (context
);
5024 /* Unhandled CONTEXT!? */
5030 /* CALL is a CALL_EXPR. Return the declaration for the function
5031 called, or NULL_TREE if the called function cannot be
5035 get_callee_fndecl (call
)
5040 /* It's invalid to call this function with anything but a
5042 if (TREE_CODE (call
) != CALL_EXPR
)
5045 /* The first operand to the CALL is the address of the function
5047 addr
= TREE_OPERAND (call
, 0);
5049 /* If the address is just `&f' for some function `f', then we know
5050 that `f' is being called. */
5051 if (TREE_CODE (addr
) == ADDR_EXPR
5052 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5053 return TREE_OPERAND (addr
, 0);
5055 /* We couldn't figure out what was being called. */
5059 /* Print debugging information about the obstack O, named STR. */
5062 print_obstack_statistics (str
, o
)
5066 struct _obstack_chunk
*chunk
= o
->chunk
;
5070 n_alloc
+= o
->next_free
- chunk
->contents
;
5071 chunk
= chunk
->prev
;
5075 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
5076 chunk
= chunk
->prev
;
5078 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
5079 str
, n_alloc
, n_chunks
);
5082 /* Print debugging information about tree nodes generated during the compile,
5083 and any language-specific information. */
5086 dump_tree_statistics ()
5088 #ifdef GATHER_STATISTICS
5090 int total_nodes
, total_bytes
;
5093 fprintf (stderr
, "\n??? tree nodes created\n\n");
5094 #ifdef GATHER_STATISTICS
5095 fprintf (stderr
, "Kind Nodes Bytes\n");
5096 fprintf (stderr
, "-------------------------------------\n");
5097 total_nodes
= total_bytes
= 0;
5098 for (i
= 0; i
< (int) all_kinds
; i
++)
5100 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
5101 tree_node_counts
[i
], tree_node_sizes
[i
]);
5102 total_nodes
+= tree_node_counts
[i
];
5103 total_bytes
+= tree_node_sizes
[i
];
5105 fprintf (stderr
, "%-20s %9d\n", "identifier names", id_string_size
);
5106 fprintf (stderr
, "-------------------------------------\n");
5107 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
5108 fprintf (stderr
, "-------------------------------------\n");
5110 fprintf (stderr
, "(No per-node statistics)\n");
5112 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
5113 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack
);
5114 print_obstack_statistics ("temporary_obstack", &temporary_obstack
);
5115 print_obstack_statistics ("momentary_obstack", &momentary_obstack
);
5116 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack
);
5117 print_lang_statistics ();
5120 #define FILE_FUNCTION_PREFIX_LEN 9
5122 #ifndef NO_DOLLAR_IN_LABEL
5123 #define FILE_FUNCTION_FORMAT "_GLOBAL_$%s$%s"
5124 #else /* NO_DOLLAR_IN_LABEL */
5125 #ifndef NO_DOT_IN_LABEL
5126 #define FILE_FUNCTION_FORMAT "_GLOBAL_.%s.%s"
5127 #else /* NO_DOT_IN_LABEL */
5128 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5129 #endif /* NO_DOT_IN_LABEL */
5130 #endif /* NO_DOLLAR_IN_LABEL */
5132 extern char *first_global_object_name
;
5133 extern char *weak_global_object_name
;
5135 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
5136 clashes in cases where we can't reliably choose a unique name.
5138 Derived from mkstemp.c in libiberty. */
5141 append_random_chars (template)
5144 static const char letters
[]
5145 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
5146 static unsigned HOST_WIDE_INT value
;
5147 unsigned HOST_WIDE_INT v
;
5149 #ifdef HAVE_GETTIMEOFDAY
5153 template += strlen (template);
5155 #ifdef HAVE_GETTIMEOFDAY
5156 /* Get some more or less random data. */
5157 gettimeofday (&tv
, NULL
);
5158 value
+= ((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16) ^ tv
.tv_sec
^ getpid ();
5165 /* Fill in the random bits. */
5166 template[0] = letters
[v
% 62];
5168 template[1] = letters
[v
% 62];
5170 template[2] = letters
[v
% 62];
5172 template[3] = letters
[v
% 62];
5174 template[4] = letters
[v
% 62];
5176 template[5] = letters
[v
% 62];
5181 /* Generate a name for a function unique to this translation unit.
5182 TYPE is some string to identify the purpose of this function to the
5183 linker or collect2. */
5186 get_file_function_name_long (type
)
5192 if (first_global_object_name
)
5193 p
= first_global_object_name
;
5196 /* We don't have anything that we know to be unique to this translation
5197 unit, so use what we do have and throw in some randomness. */
5199 const char *name
= weak_global_object_name
;
5200 const char *file
= main_input_filename
;
5205 file
= input_filename
;
5207 p
= (char *) alloca (7 + strlen (name
) + strlen (file
));
5209 sprintf (p
, "%s%s", name
, file
);
5210 append_random_chars (p
);
5213 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
5216 /* Set up the name of the file-level functions we may need.
5217 Use a global object (which is already required to be unique over
5218 the program) rather than the file name (which imposes extra
5220 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5222 /* Don't need to pull weird characters out of global names. */
5223 if (p
!= first_global_object_name
)
5225 for (p
= buf
+11; *p
; p
++)
5227 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
5228 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
5232 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5235 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5243 return get_identifier (buf
);
5246 /* If KIND=='I', return a suitable global initializer (constructor) name.
5247 If KIND=='D', return a suitable global clean-up (destructor) name. */
5250 get_file_function_name (kind
)
5258 return get_file_function_name_long (p
);
5261 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5262 The result is placed in BUFFER (which has length BIT_SIZE),
5263 with one bit in each char ('\000' or '\001').
5265 If the constructor is constant, NULL_TREE is returned.
5266 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5269 get_set_constructor_bits (init
, buffer
, bit_size
)
5276 HOST_WIDE_INT domain_min
5277 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))));
5278 tree non_const_bits
= NULL_TREE
;
5279 for (i
= 0; i
< bit_size
; i
++)
5282 for (vals
= TREE_OPERAND (init
, 1);
5283 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5285 if (TREE_CODE (TREE_VALUE (vals
)) != INTEGER_CST
5286 || (TREE_PURPOSE (vals
) != NULL_TREE
5287 && TREE_CODE (TREE_PURPOSE (vals
)) != INTEGER_CST
))
5289 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5290 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5292 /* Set a range of bits to ones. */
5293 HOST_WIDE_INT lo_index
5294 = TREE_INT_CST_LOW (TREE_PURPOSE (vals
)) - domain_min
;
5295 HOST_WIDE_INT hi_index
5296 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
5298 if (lo_index
< 0 || lo_index
>= bit_size
5299 || hi_index
< 0 || hi_index
>= bit_size
)
5301 for ( ; lo_index
<= hi_index
; lo_index
++)
5302 buffer
[lo_index
] = 1;
5306 /* Set a single bit to one. */
5308 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
5309 if (index
< 0 || index
>= bit_size
)
5311 error ("invalid initializer for bit string");
5317 return non_const_bits
;
5320 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5321 The result is placed in BUFFER (which is an array of bytes).
5322 If the constructor is constant, NULL_TREE is returned.
5323 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5326 get_set_constructor_bytes (init
, buffer
, wd_size
)
5328 unsigned char *buffer
;
5332 int set_word_size
= BITS_PER_UNIT
;
5333 int bit_size
= wd_size
* set_word_size
;
5335 unsigned char *bytep
= buffer
;
5336 char *bit_buffer
= (char *) alloca(bit_size
);
5337 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5339 for (i
= 0; i
< wd_size
; i
++)
5342 for (i
= 0; i
< bit_size
; i
++)
5346 if (BYTES_BIG_ENDIAN
)
5347 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5349 *bytep
|= 1 << bit_pos
;
5352 if (bit_pos
>= set_word_size
)
5353 bit_pos
= 0, bytep
++;
5355 return non_const_bits
;
5358 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5359 /* Complain that the tree code of NODE does not match the expected CODE.
5360 FILE, LINE, and FUNCTION are of the caller. */
5362 tree_check_failed (node
, code
, file
, line
, function
)
5364 enum tree_code code
;
5367 const char *function
;
5369 error ("Tree check: expected %s, have %s",
5370 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)]);
5371 fancy_abort (file
, line
, function
);
5374 /* Similar to above, except that we check for a class of tree
5375 code, given in CL. */
5377 tree_class_check_failed (node
, cl
, file
, line
, function
)
5382 const char *function
;
5384 error ("Tree check: expected class '%c', have '%c' (%s)",
5385 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
5386 tree_code_name
[TREE_CODE (node
)]);
5387 fancy_abort (file
, line
, function
);
5390 #endif /* ENABLE_TREE_CHECKING */
5392 /* Return the alias set for T, which may be either a type or an
5399 if (! flag_strict_aliasing
|| lang_get_alias_set
== 0)
5400 /* If we're not doing any lanaguage-specific alias analysis, just
5401 assume everything aliases everything else. */
5404 return (*lang_get_alias_set
) (t
);
5407 /* Return a brand-new alias set. */
5412 static int last_alias_set
;
5414 if (flag_strict_aliasing
)
5415 return ++last_alias_set
;
5420 #ifndef CHAR_TYPE_SIZE
5421 #define CHAR_TYPE_SIZE BITS_PER_UNIT
5424 #ifndef SHORT_TYPE_SIZE
5425 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
5428 #ifndef INT_TYPE_SIZE
5429 #define INT_TYPE_SIZE BITS_PER_WORD
5432 #ifndef LONG_TYPE_SIZE
5433 #define LONG_TYPE_SIZE BITS_PER_WORD
5436 #ifndef LONG_LONG_TYPE_SIZE
5437 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
5440 #ifndef FLOAT_TYPE_SIZE
5441 #define FLOAT_TYPE_SIZE BITS_PER_WORD
5444 #ifndef DOUBLE_TYPE_SIZE
5445 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5448 #ifndef LONG_DOUBLE_TYPE_SIZE
5449 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
5452 /* Create nodes for all integer types (and error_mark_node) using the sizes
5453 of C datatypes. The caller should call set_sizetype soon after calling
5454 this function to select one of the types as sizetype. */
5457 build_common_tree_nodes (signed_char
)
5460 error_mark_node
= make_node (ERROR_MARK
);
5461 TREE_TYPE (error_mark_node
) = error_mark_node
;
5463 initialize_sizetypes ();
5465 /* Define both `signed char' and `unsigned char'. */
5466 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5467 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5469 /* Define `char', which is like either `signed char' or `unsigned char'
5470 but not the same as either. */
5473 ? make_signed_type (CHAR_TYPE_SIZE
)
5474 : make_unsigned_type (CHAR_TYPE_SIZE
));
5476 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5477 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5478 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5479 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5480 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5481 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5482 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5483 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5485 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5486 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5487 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5488 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5489 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5491 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5492 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5493 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5494 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5495 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5498 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5499 It will create several other common tree nodes. */
5502 build_common_tree_nodes_2 (short_double
)
5505 /* Define these next since types below may used them. */
5506 integer_zero_node
= build_int_2 (0, 0);
5507 TREE_TYPE (integer_zero_node
) = integer_type_node
;
5508 integer_one_node
= build_int_2 (1, 0);
5509 TREE_TYPE (integer_one_node
) = integer_type_node
;
5511 size_zero_node
= build_int_2 (0, 0);
5512 TREE_TYPE (size_zero_node
) = sizetype
;
5513 size_one_node
= build_int_2 (1, 0);
5514 TREE_TYPE (size_one_node
) = sizetype
;
5516 void_type_node
= make_node (VOID_TYPE
);
5517 layout_type (void_type_node
);
5519 /* We are not going to have real types in C with less than byte alignment,
5520 so we might as well not have any types that claim to have it. */
5521 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5523 null_pointer_node
= build_int_2 (0, 0);
5524 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5525 layout_type (TREE_TYPE (null_pointer_node
));
5527 ptr_type_node
= build_pointer_type (void_type_node
);
5529 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5531 float_type_node
= make_node (REAL_TYPE
);
5532 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5533 layout_type (float_type_node
);
5535 double_type_node
= make_node (REAL_TYPE
);
5537 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5539 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5540 layout_type (double_type_node
);
5542 long_double_type_node
= make_node (REAL_TYPE
);
5543 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5544 layout_type (long_double_type_node
);
5546 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5547 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5548 layout_type (complex_integer_type_node
);
5550 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5551 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5552 layout_type (complex_float_type_node
);
5554 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5555 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5556 layout_type (complex_double_type_node
);
5558 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5559 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5560 layout_type (complex_long_double_type_node
);
5562 #ifdef BUILD_VA_LIST_TYPE
5563 BUILD_VA_LIST_TYPE(va_list_type_node
);
5565 va_list_type_node
= ptr_type_node
;