1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 88, 92-97, 1998 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
54 #ifdef NEED_DECLARATION_FREE
55 extern void free
PROTO((void *));
62 #define obstack_chunk_alloc xmalloc
63 #define obstack_chunk_free free
65 /* Tree nodes of permanent duration are allocated in this obstack.
66 They are the identifier nodes, and everything outside of
67 the bodies and parameters of function definitions. */
69 struct obstack permanent_obstack
;
71 /* The initial RTL, and all ..._TYPE nodes, in a function
72 are allocated in this obstack. Usually they are freed at the
73 end of the function, but if the function is inline they are saved.
74 For top-level functions, this is maybepermanent_obstack.
75 Separate obstacks are made for nested functions. */
77 struct obstack
*function_maybepermanent_obstack
;
79 /* This is the function_maybepermanent_obstack for top-level functions. */
81 struct obstack maybepermanent_obstack
;
83 /* This is a list of function_maybepermanent_obstacks for top-level inline
84 functions that are compiled in the middle of compiling other functions. */
86 struct simple_obstack_stack
*toplev_inline_obstacks
;
88 /* Former elements of toplev_inline_obstacks that have been recycled. */
90 struct simple_obstack_stack
*extra_inline_obstacks
;
92 /* This is a list of function_maybepermanent_obstacks for inline functions
93 nested in the current function that were compiled in the middle of
94 compiling other functions. */
96 struct simple_obstack_stack
*inline_obstacks
;
98 /* The contents of the current function definition are allocated
99 in this obstack, and all are freed at the end of the function.
100 For top-level functions, this is temporary_obstack.
101 Separate obstacks are made for nested functions. */
103 struct obstack
*function_obstack
;
105 /* This is used for reading initializers of global variables. */
107 struct obstack temporary_obstack
;
109 /* The tree nodes of an expression are allocated
110 in this obstack, and all are freed at the end of the expression. */
112 struct obstack momentary_obstack
;
114 /* The tree nodes of a declarator are allocated
115 in this obstack, and all are freed when the declarator
118 static struct obstack temp_decl_obstack
;
120 /* This points at either permanent_obstack
121 or the current function_maybepermanent_obstack. */
123 struct obstack
*saveable_obstack
;
125 /* This is same as saveable_obstack during parse and expansion phase;
126 it points to the current function's obstack during optimization.
127 This is the obstack to be used for creating rtl objects. */
129 struct obstack
*rtl_obstack
;
131 /* This points at either permanent_obstack or the current function_obstack. */
133 struct obstack
*current_obstack
;
135 /* This points at either permanent_obstack or the current function_obstack
136 or momentary_obstack. */
138 struct obstack
*expression_obstack
;
140 /* Stack of obstack selections for push_obstacks and pop_obstacks. */
144 struct obstack_stack
*next
;
145 struct obstack
*current
;
146 struct obstack
*saveable
;
147 struct obstack
*expression
;
151 struct obstack_stack
*obstack_stack
;
153 /* Obstack for allocating struct obstack_stack entries. */
155 static struct obstack obstack_stack_obstack
;
157 /* Addresses of first objects in some obstacks.
158 This is for freeing their entire contents. */
159 char *maybepermanent_firstobj
;
160 char *temporary_firstobj
;
161 char *momentary_firstobj
;
162 char *temp_decl_firstobj
;
164 /* This is used to preserve objects (mainly array initializers) that need to
165 live until the end of the current function, but no further. */
166 char *momentary_function_firstobj
;
168 /* Nonzero means all ..._TYPE nodes should be allocated permanently. */
170 int all_types_permanent
;
172 /* Stack of places to restore the momentary obstack back to. */
174 struct momentary_level
176 /* Pointer back to previous such level. */
177 struct momentary_level
*prev
;
178 /* First object allocated within this level. */
180 /* Value of expression_obstack saved at entry to this level. */
181 struct obstack
*obstack
;
184 struct momentary_level
*momentary_stack
;
186 /* Table indexed by tree code giving a string containing a character
187 classifying the tree code. Possibilities are
188 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
190 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
192 char tree_code_type
[MAX_TREE_CODES
] = {
197 /* Table indexed by tree code giving number of expression
198 operands beyond the fixed part of the node structure.
199 Not used for types or decls. */
201 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
203 int tree_code_length
[MAX_TREE_CODES
] = {
208 /* Names of tree components.
209 Used for printing out the tree and error messages. */
210 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
212 char *tree_code_name
[MAX_TREE_CODES
] = {
217 /* Statistics-gathering stuff. */
238 int tree_node_counts
[(int)all_kinds
];
239 int tree_node_sizes
[(int)all_kinds
];
240 int id_string_size
= 0;
242 char *tree_node_kind_names
[] = {
260 /* Hash table for uniquizing IDENTIFIER_NODEs by name. */
262 #define MAX_HASH_TABLE 1009
263 static tree hash_table
[MAX_HASH_TABLE
]; /* id hash buckets */
265 /* 0 while creating built-in identifiers. */
266 static int do_identifier_warnings
;
268 /* Unique id for next decl created. */
269 static int next_decl_uid
;
270 /* Unique id for next type created. */
271 static int next_type_uid
= 1;
273 /* Here is how primitive or already-canonicalized types' hash
275 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
277 extern char *mode_name
[];
279 void gcc_obstack_init ();
281 /* Init the principal obstacks. */
286 gcc_obstack_init (&obstack_stack_obstack
);
287 gcc_obstack_init (&permanent_obstack
);
289 gcc_obstack_init (&temporary_obstack
);
290 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
291 gcc_obstack_init (&momentary_obstack
);
292 momentary_firstobj
= (char *) obstack_alloc (&momentary_obstack
, 0);
293 momentary_function_firstobj
= momentary_firstobj
;
294 gcc_obstack_init (&maybepermanent_obstack
);
295 maybepermanent_firstobj
296 = (char *) obstack_alloc (&maybepermanent_obstack
, 0);
297 gcc_obstack_init (&temp_decl_obstack
);
298 temp_decl_firstobj
= (char *) obstack_alloc (&temp_decl_obstack
, 0);
300 function_obstack
= &temporary_obstack
;
301 function_maybepermanent_obstack
= &maybepermanent_obstack
;
302 current_obstack
= &permanent_obstack
;
303 expression_obstack
= &permanent_obstack
;
304 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
306 /* Init the hash table of identifiers. */
307 bzero ((char *) hash_table
, sizeof hash_table
);
311 gcc_obstack_init (obstack
)
312 struct obstack
*obstack
;
314 /* Let particular systems override the size of a chunk. */
315 #ifndef OBSTACK_CHUNK_SIZE
316 #define OBSTACK_CHUNK_SIZE 0
318 /* Let them override the alloc and free routines too. */
319 #ifndef OBSTACK_CHUNK_ALLOC
320 #define OBSTACK_CHUNK_ALLOC xmalloc
322 #ifndef OBSTACK_CHUNK_FREE
323 #define OBSTACK_CHUNK_FREE free
325 _obstack_begin (obstack
, OBSTACK_CHUNK_SIZE
, 0,
326 (void *(*) ()) OBSTACK_CHUNK_ALLOC
,
327 (void (*) ()) OBSTACK_CHUNK_FREE
);
330 /* Save all variables describing the current status into the structure *P.
331 This is used before starting a nested function.
333 CONTEXT is the decl_function_context for the function we're about to
334 compile; if it isn't current_function_decl, we have to play some games. */
337 save_tree_status (p
, context
)
341 p
->all_types_permanent
= all_types_permanent
;
342 p
->momentary_stack
= momentary_stack
;
343 p
->maybepermanent_firstobj
= maybepermanent_firstobj
;
344 p
->temporary_firstobj
= temporary_firstobj
;
345 p
->momentary_firstobj
= momentary_firstobj
;
346 p
->momentary_function_firstobj
= momentary_function_firstobj
;
347 p
->function_obstack
= function_obstack
;
348 p
->function_maybepermanent_obstack
= function_maybepermanent_obstack
;
349 p
->current_obstack
= current_obstack
;
350 p
->expression_obstack
= expression_obstack
;
351 p
->saveable_obstack
= saveable_obstack
;
352 p
->rtl_obstack
= rtl_obstack
;
353 p
->inline_obstacks
= inline_obstacks
;
355 if (context
== current_function_decl
)
356 /* Objects that need to be saved in this function can be in the nonsaved
357 obstack of the enclosing function since they can't possibly be needed
358 once it has returned. */
359 function_maybepermanent_obstack
= function_obstack
;
362 /* We're compiling a function which isn't nested in the current
363 function. We need to create a new maybepermanent_obstack for this
364 function, since it can't go onto any of the existing obstacks. */
365 struct simple_obstack_stack
**head
;
366 struct simple_obstack_stack
*current
;
368 if (context
== NULL_TREE
)
369 head
= &toplev_inline_obstacks
;
372 struct function
*f
= find_function_data (context
);
373 head
= &f
->inline_obstacks
;
376 if (context
== NULL_TREE
&& extra_inline_obstacks
)
378 current
= extra_inline_obstacks
;
379 extra_inline_obstacks
= current
->next
;
383 current
= ((struct simple_obstack_stack
*)
384 xmalloc (sizeof (struct simple_obstack_stack
)));
387 = (struct obstack
*) xmalloc (sizeof (struct obstack
));
388 gcc_obstack_init (current
->obstack
);
391 function_maybepermanent_obstack
= current
->obstack
;
393 current
->next
= *head
;
397 maybepermanent_firstobj
398 = (char *) obstack_finish (function_maybepermanent_obstack
);
400 function_obstack
= (struct obstack
*) xmalloc (sizeof (struct obstack
));
401 gcc_obstack_init (function_obstack
);
403 current_obstack
= &permanent_obstack
;
404 expression_obstack
= &permanent_obstack
;
405 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
407 temporary_firstobj
= (char *) obstack_alloc (&temporary_obstack
, 0);
408 momentary_firstobj
= (char *) obstack_finish (&momentary_obstack
);
409 momentary_function_firstobj
= momentary_firstobj
;
412 /* Restore all variables describing the current status from the structure *P.
413 This is used after a nested function. */
416 restore_tree_status (p
, context
)
420 all_types_permanent
= p
->all_types_permanent
;
421 momentary_stack
= p
->momentary_stack
;
423 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
425 /* Free saveable storage used by the function just compiled and not
428 CAUTION: This is in function_obstack of the containing function.
429 So we must be sure that we never allocate from that obstack during
430 the compilation of a nested function if we expect it to survive
431 past the nested function's end. */
432 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
434 /* If we were compiling a toplevel function, we can free this space now. */
435 if (context
== NULL_TREE
)
437 obstack_free (&temporary_obstack
, temporary_firstobj
);
438 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
441 /* If we were compiling a toplevel function that we don't actually want
442 to save anything from, return the obstack to the pool. */
443 if (context
== NULL_TREE
444 && obstack_empty_p (function_maybepermanent_obstack
))
446 struct simple_obstack_stack
*current
, **p
= &toplev_inline_obstacks
;
450 while ((*p
)->obstack
!= function_maybepermanent_obstack
)
455 current
->next
= extra_inline_obstacks
;
456 extra_inline_obstacks
= current
;
460 obstack_free (function_obstack
, 0);
461 free (function_obstack
);
463 temporary_firstobj
= p
->temporary_firstobj
;
464 momentary_firstobj
= p
->momentary_firstobj
;
465 momentary_function_firstobj
= p
->momentary_function_firstobj
;
466 maybepermanent_firstobj
= p
->maybepermanent_firstobj
;
467 function_obstack
= p
->function_obstack
;
468 function_maybepermanent_obstack
= p
->function_maybepermanent_obstack
;
469 current_obstack
= p
->current_obstack
;
470 expression_obstack
= p
->expression_obstack
;
471 saveable_obstack
= p
->saveable_obstack
;
472 rtl_obstack
= p
->rtl_obstack
;
473 inline_obstacks
= p
->inline_obstacks
;
476 /* Start allocating on the temporary (per function) obstack.
477 This is done in start_function before parsing the function body,
478 and before each initialization at top level, and to go back
479 to temporary allocation after doing permanent_allocation. */
482 temporary_allocation ()
484 /* Note that function_obstack at top level points to temporary_obstack.
485 But within a nested function context, it is a separate obstack. */
486 current_obstack
= function_obstack
;
487 expression_obstack
= function_obstack
;
488 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
493 /* Start allocating on the permanent obstack but don't
494 free the temporary data. After calling this, call
495 `permanent_allocation' to fully resume permanent allocation status. */
498 end_temporary_allocation ()
500 current_obstack
= &permanent_obstack
;
501 expression_obstack
= &permanent_obstack
;
502 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
505 /* Resume allocating on the temporary obstack, undoing
506 effects of `end_temporary_allocation'. */
509 resume_temporary_allocation ()
511 current_obstack
= function_obstack
;
512 expression_obstack
= function_obstack
;
513 rtl_obstack
= saveable_obstack
= function_maybepermanent_obstack
;
516 /* While doing temporary allocation, switch to allocating in such a
517 way as to save all nodes if the function is inlined. Call
518 resume_temporary_allocation to go back to ordinary temporary
522 saveable_allocation ()
524 /* Note that function_obstack at top level points to temporary_obstack.
525 But within a nested function context, it is a separate obstack. */
526 expression_obstack
= current_obstack
= saveable_obstack
;
529 /* Switch to current obstack CURRENT and maybepermanent obstack SAVEABLE,
530 recording the previously current obstacks on a stack.
531 This does not free any storage in any obstack. */
534 push_obstacks (current
, saveable
)
535 struct obstack
*current
, *saveable
;
537 struct obstack_stack
*p
538 = (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
539 (sizeof (struct obstack_stack
)));
541 p
->current
= current_obstack
;
542 p
->saveable
= saveable_obstack
;
543 p
->expression
= expression_obstack
;
544 p
->rtl
= rtl_obstack
;
545 p
->next
= obstack_stack
;
548 current_obstack
= current
;
549 expression_obstack
= current
;
550 rtl_obstack
= saveable_obstack
= saveable
;
553 /* Save the current set of obstacks, but don't change them. */
556 push_obstacks_nochange ()
558 struct obstack_stack
*p
559 = (struct obstack_stack
*) obstack_alloc (&obstack_stack_obstack
,
560 (sizeof (struct obstack_stack
)));
562 p
->current
= current_obstack
;
563 p
->saveable
= saveable_obstack
;
564 p
->expression
= expression_obstack
;
565 p
->rtl
= rtl_obstack
;
566 p
->next
= obstack_stack
;
570 /* Pop the obstack selection stack. */
575 struct obstack_stack
*p
= obstack_stack
;
576 obstack_stack
= p
->next
;
578 current_obstack
= p
->current
;
579 saveable_obstack
= p
->saveable
;
580 expression_obstack
= p
->expression
;
581 rtl_obstack
= p
->rtl
;
583 obstack_free (&obstack_stack_obstack
, p
);
586 /* Nonzero if temporary allocation is currently in effect.
587 Zero if currently doing permanent allocation. */
590 allocation_temporary_p ()
592 return current_obstack
!= &permanent_obstack
;
595 /* Go back to allocating on the permanent obstack
596 and free everything in the temporary obstack.
598 FUNCTION_END is true only if we have just finished compiling a function.
599 In that case, we also free preserved initial values on the momentary
603 permanent_allocation (function_end
)
606 /* Free up previous temporary obstack data */
607 obstack_free (&temporary_obstack
, temporary_firstobj
);
610 obstack_free (&momentary_obstack
, momentary_function_firstobj
);
611 momentary_firstobj
= momentary_function_firstobj
;
614 obstack_free (&momentary_obstack
, momentary_firstobj
);
615 obstack_free (function_maybepermanent_obstack
, maybepermanent_firstobj
);
616 obstack_free (&temp_decl_obstack
, temp_decl_firstobj
);
618 /* Free up the maybepermanent_obstacks for any of our nested functions
619 which were compiled at a lower level. */
620 while (inline_obstacks
)
622 struct simple_obstack_stack
*current
= inline_obstacks
;
623 inline_obstacks
= current
->next
;
624 obstack_free (current
->obstack
, 0);
625 free (current
->obstack
);
629 current_obstack
= &permanent_obstack
;
630 expression_obstack
= &permanent_obstack
;
631 rtl_obstack
= saveable_obstack
= &permanent_obstack
;
634 /* Save permanently everything on the maybepermanent_obstack. */
639 maybepermanent_firstobj
640 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
644 preserve_initializer ()
646 struct momentary_level
*tem
;
650 = (char *) obstack_alloc (&temporary_obstack
, 0);
651 maybepermanent_firstobj
652 = (char *) obstack_alloc (function_maybepermanent_obstack
, 0);
654 old_momentary
= momentary_firstobj
;
656 = (char *) obstack_alloc (&momentary_obstack
, 0);
657 if (momentary_firstobj
!= old_momentary
)
658 for (tem
= momentary_stack
; tem
; tem
= tem
->prev
)
659 tem
->base
= momentary_firstobj
;
662 /* Start allocating new rtl in current_obstack.
663 Use resume_temporary_allocation
664 to go back to allocating rtl in saveable_obstack. */
667 rtl_in_current_obstack ()
669 rtl_obstack
= current_obstack
;
672 /* Start allocating rtl from saveable_obstack. Intended to be used after
673 a call to push_obstacks_nochange. */
676 rtl_in_saveable_obstack ()
678 rtl_obstack
= saveable_obstack
;
681 /* Allocate SIZE bytes in the current obstack
682 and return a pointer to them.
683 In practice the current obstack is always the temporary one. */
689 return (char *) obstack_alloc (current_obstack
, size
);
692 /* Free the object PTR in the current obstack
693 as well as everything allocated since PTR.
694 In practice the current obstack is always the temporary one. */
700 obstack_free (current_obstack
, ptr
);
703 /* Allocate SIZE bytes in the permanent obstack
704 and return a pointer to them. */
710 return (char *) obstack_alloc (&permanent_obstack
, size
);
713 /* Allocate NELEM items of SIZE bytes in the permanent obstack
714 and return a pointer to them. The storage is cleared before
715 returning the value. */
718 perm_calloc (nelem
, size
)
722 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
723 bzero (rval
, nelem
* size
);
727 /* Allocate SIZE bytes in the saveable obstack
728 and return a pointer to them. */
734 return (char *) obstack_alloc (saveable_obstack
, size
);
737 /* Allocate SIZE bytes in the expression obstack
738 and return a pointer to them. */
744 return (char *) obstack_alloc (expression_obstack
, size
);
747 /* Print out which obstack an object is in. */
750 print_obstack_name (object
, file
, prefix
)
755 struct obstack
*obstack
= NULL
;
756 char *obstack_name
= NULL
;
759 for (p
= outer_function_chain
; p
; p
= p
->next
)
761 if (_obstack_allocated_p (p
->function_obstack
, object
))
763 obstack
= p
->function_obstack
;
764 obstack_name
= "containing function obstack";
766 if (_obstack_allocated_p (p
->function_maybepermanent_obstack
, object
))
768 obstack
= p
->function_maybepermanent_obstack
;
769 obstack_name
= "containing function maybepermanent obstack";
773 if (_obstack_allocated_p (&obstack_stack_obstack
, object
))
775 obstack
= &obstack_stack_obstack
;
776 obstack_name
= "obstack_stack_obstack";
778 else if (_obstack_allocated_p (function_obstack
, object
))
780 obstack
= function_obstack
;
781 obstack_name
= "function obstack";
783 else if (_obstack_allocated_p (&permanent_obstack
, object
))
785 obstack
= &permanent_obstack
;
786 obstack_name
= "permanent_obstack";
788 else if (_obstack_allocated_p (&momentary_obstack
, object
))
790 obstack
= &momentary_obstack
;
791 obstack_name
= "momentary_obstack";
793 else if (_obstack_allocated_p (function_maybepermanent_obstack
, object
))
795 obstack
= function_maybepermanent_obstack
;
796 obstack_name
= "function maybepermanent obstack";
798 else if (_obstack_allocated_p (&temp_decl_obstack
, object
))
800 obstack
= &temp_decl_obstack
;
801 obstack_name
= "temp_decl_obstack";
804 /* Check to see if the object is in the free area of the obstack. */
807 if (object
>= obstack
->next_free
808 && object
< obstack
->chunk_limit
)
809 fprintf (file
, "%s in free portion of obstack %s",
810 prefix
, obstack_name
);
812 fprintf (file
, "%s allocated from %s", prefix
, obstack_name
);
815 fprintf (file
, "%s not allocated from any obstack", prefix
);
819 debug_obstack (object
)
822 print_obstack_name (object
, stderr
, "object");
823 fprintf (stderr
, ".\n");
826 /* Return 1 if OBJ is in the permanent obstack.
827 This is slow, and should be used only for debugging.
828 Use TREE_PERMANENT for other purposes. */
831 object_permanent_p (obj
)
834 return _obstack_allocated_p (&permanent_obstack
, obj
);
837 /* Start a level of momentary allocation.
838 In C, each compound statement has its own level
839 and that level is freed at the end of each statement.
840 All expression nodes are allocated in the momentary allocation level. */
845 struct momentary_level
*tem
846 = (struct momentary_level
*) obstack_alloc (&momentary_obstack
,
847 sizeof (struct momentary_level
));
848 tem
->prev
= momentary_stack
;
849 tem
->base
= (char *) obstack_base (&momentary_obstack
);
850 tem
->obstack
= expression_obstack
;
851 momentary_stack
= tem
;
852 expression_obstack
= &momentary_obstack
;
855 /* Set things up so the next clear_momentary will only clear memory
856 past our present position in momentary_obstack. */
859 preserve_momentary ()
861 momentary_stack
->base
= (char *) obstack_base (&momentary_obstack
);
864 /* Free all the storage in the current momentary-allocation level.
865 In C, this happens at the end of each statement. */
870 obstack_free (&momentary_obstack
, momentary_stack
->base
);
873 /* Discard a level of momentary allocation.
874 In C, this happens at the end of each compound statement.
875 Restore the status of expression node allocation
876 that was in effect before this level was created. */
881 struct momentary_level
*tem
= momentary_stack
;
882 momentary_stack
= tem
->prev
;
883 expression_obstack
= tem
->obstack
;
884 /* We can't free TEM from the momentary_obstack, because there might
885 be objects above it which have been saved. We can free back to the
886 stack of the level we are popping off though. */
887 obstack_free (&momentary_obstack
, tem
->base
);
890 /* Pop back to the previous level of momentary allocation,
891 but don't free any momentary data just yet. */
894 pop_momentary_nofree ()
896 struct momentary_level
*tem
= momentary_stack
;
897 momentary_stack
= tem
->prev
;
898 expression_obstack
= tem
->obstack
;
901 /* Call when starting to parse a declaration:
902 make expressions in the declaration last the length of the function.
903 Returns an argument that should be passed to resume_momentary later. */
908 register int tem
= expression_obstack
== &momentary_obstack
;
909 expression_obstack
= saveable_obstack
;
913 /* Call when finished parsing a declaration:
914 restore the treatment of node-allocation that was
915 in effect before the suspension.
916 YES should be the value previously returned by suspend_momentary. */
919 resume_momentary (yes
)
923 expression_obstack
= &momentary_obstack
;
926 /* Init the tables indexed by tree code.
927 Note that languages can add to these tables to define their own codes. */
935 /* Return a newly allocated node of code CODE.
936 Initialize the node's unique id and its TREE_PERMANENT flag.
937 For decl and type nodes, some other fields are initialized.
938 The rest of the node is initialized to zero.
940 Achoo! I got a code in the node. */
947 register int type
= TREE_CODE_CLASS (code
);
949 register struct obstack
*obstack
= current_obstack
;
951 #ifdef GATHER_STATISTICS
952 register tree_node_kind kind
;
957 case 'd': /* A decl node */
958 #ifdef GATHER_STATISTICS
961 length
= sizeof (struct tree_decl
);
962 /* All decls in an inline function need to be saved. */
963 if (obstack
!= &permanent_obstack
)
964 obstack
= saveable_obstack
;
966 /* PARM_DECLs go on the context of the parent. If this is a nested
967 function, then we must allocate the PARM_DECL on the parent's
968 obstack, so that they will live to the end of the parent's
969 closing brace. This is necessary in case we try to inline the
970 function into its parent.
972 PARM_DECLs of top-level functions do not have this problem. However,
973 we allocate them where we put the FUNCTION_DECL for languages such as
974 Ada that need to consult some flags in the PARM_DECLs of the function
977 See comment in restore_tree_status for why we can't put this
978 in function_obstack. */
979 if (code
== PARM_DECL
&& obstack
!= &permanent_obstack
)
982 if (current_function_decl
)
983 context
= decl_function_context (current_function_decl
);
987 = find_function_data (context
)->function_maybepermanent_obstack
;
991 case 't': /* a type node */
992 #ifdef GATHER_STATISTICS
995 length
= sizeof (struct tree_type
);
996 /* All data types are put where we can preserve them if nec. */
997 if (obstack
!= &permanent_obstack
)
998 obstack
= all_types_permanent
? &permanent_obstack
: saveable_obstack
;
1001 case 'b': /* a lexical block */
1002 #ifdef GATHER_STATISTICS
1005 length
= sizeof (struct tree_block
);
1006 /* All BLOCK nodes are put where we can preserve them if nec. */
1007 if (obstack
!= &permanent_obstack
)
1008 obstack
= saveable_obstack
;
1011 case 's': /* an expression with side effects */
1012 #ifdef GATHER_STATISTICS
1016 case 'r': /* a reference */
1017 #ifdef GATHER_STATISTICS
1021 case 'e': /* an expression */
1022 case '<': /* a comparison expression */
1023 case '1': /* a unary arithmetic expression */
1024 case '2': /* a binary arithmetic expression */
1025 #ifdef GATHER_STATISTICS
1029 obstack
= expression_obstack
;
1030 /* All BIND_EXPR nodes are put where we can preserve them if nec. */
1031 if (code
== BIND_EXPR
&& obstack
!= &permanent_obstack
)
1032 obstack
= saveable_obstack
;
1033 length
= sizeof (struct tree_exp
)
1034 + (tree_code_length
[(int) code
] - 1) * sizeof (char *);
1037 case 'c': /* a constant */
1038 #ifdef GATHER_STATISTICS
1041 obstack
= expression_obstack
;
1043 /* We can't use tree_code_length for INTEGER_CST, since the number of
1044 words is machine-dependent due to varying length of HOST_WIDE_INT,
1045 which might be wider than a pointer (e.g., long long). Similarly
1046 for REAL_CST, since the number of words is machine-dependent due
1047 to varying size and alignment of `double'. */
1049 if (code
== INTEGER_CST
)
1050 length
= sizeof (struct tree_int_cst
);
1051 else if (code
== REAL_CST
)
1052 length
= sizeof (struct tree_real_cst
);
1054 length
= sizeof (struct tree_common
)
1055 + tree_code_length
[(int) code
] * sizeof (char *);
1058 case 'x': /* something random, like an identifier. */
1059 #ifdef GATHER_STATISTICS
1060 if (code
== IDENTIFIER_NODE
)
1062 else if (code
== OP_IDENTIFIER
)
1064 else if (code
== TREE_VEC
)
1069 length
= sizeof (struct tree_common
)
1070 + tree_code_length
[(int) code
] * sizeof (char *);
1071 /* Identifier nodes are always permanent since they are
1072 unique in a compiler run. */
1073 if (code
== IDENTIFIER_NODE
) obstack
= &permanent_obstack
;
1080 t
= (tree
) obstack_alloc (obstack
, length
);
1082 #ifdef GATHER_STATISTICS
1083 tree_node_counts
[(int)kind
]++;
1084 tree_node_sizes
[(int)kind
] += length
;
1087 /* Clear a word at a time. */
1088 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
1090 /* Clear any extra bytes. */
1091 for (i
= length
/ sizeof (int) * sizeof (int); i
< length
; i
++)
1092 ((char *) t
)[i
] = 0;
1094 TREE_SET_CODE (t
, code
);
1095 if (obstack
== &permanent_obstack
)
1096 TREE_PERMANENT (t
) = 1;
1101 TREE_SIDE_EFFECTS (t
) = 1;
1102 TREE_TYPE (t
) = void_type_node
;
1106 if (code
!= FUNCTION_DECL
)
1108 DECL_IN_SYSTEM_HEADER (t
)
1109 = in_system_header
&& (obstack
== &permanent_obstack
);
1110 DECL_SOURCE_LINE (t
) = lineno
;
1111 DECL_SOURCE_FILE (t
) = (input_filename
) ? input_filename
: "<built-in>";
1112 DECL_UID (t
) = next_decl_uid
++;
1116 TYPE_UID (t
) = next_type_uid
++;
1118 TYPE_MAIN_VARIANT (t
) = t
;
1119 TYPE_OBSTACK (t
) = obstack
;
1120 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1121 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
1122 SET_DEFAULT_TYPE_ATTRIBUTES (t
);
1127 TREE_CONSTANT (t
) = 1;
1134 /* Return a new node with the same contents as NODE
1135 except that its TREE_CHAIN is zero and it has a fresh uid. */
1142 register enum tree_code code
= TREE_CODE (node
);
1143 register int length
;
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 *);
1192 t
= (tree
) obstack_alloc (current_obstack
, length
);
1194 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
1195 ((int *) t
)[i
] = ((int *) node
)[i
];
1196 /* Clear any extra bytes. */
1197 for (i
= length
/ sizeof (int) * sizeof (int); i
< length
; i
++)
1198 ((char *) t
)[i
] = ((char *) node
)[i
];
1201 TREE_ASM_WRITTEN (t
) = 0;
1203 if (TREE_CODE_CLASS (code
) == 'd')
1204 DECL_UID (t
) = next_decl_uid
++;
1205 else if (TREE_CODE_CLASS (code
) == 't')
1207 TYPE_UID (t
) = next_type_uid
++;
1208 TYPE_OBSTACK (t
) = current_obstack
;
1210 /* The following is so that the debug code for
1211 the copy is different from the original type.
1212 The two statements usually duplicate each other
1213 (because they clear fields of the same union),
1214 but the optimizer should catch that. */
1215 TYPE_SYMTAB_POINTER (t
) = 0;
1216 TYPE_SYMTAB_ADDRESS (t
) = 0;
1219 TREE_PERMANENT (t
) = (current_obstack
== &permanent_obstack
);
1224 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1225 For example, this can copy a list made of TREE_LIST nodes. */
1232 register tree prev
, next
;
1237 head
= prev
= copy_node (list
);
1238 next
= TREE_CHAIN (list
);
1241 TREE_CHAIN (prev
) = copy_node (next
);
1242 prev
= TREE_CHAIN (prev
);
1243 next
= TREE_CHAIN (next
);
1250 /* Return an IDENTIFIER_NODE whose name is TEXT (a null-terminated string).
1251 If an identifier with that name has previously been referred to,
1252 the same node is returned this time. */
1255 get_identifier (text
)
1256 register char *text
;
1261 register int len
, hash_len
;
1263 /* Compute length of text in len. */
1264 for (len
= 0; text
[len
]; len
++);
1266 /* Decide how much of that length to hash on */
1268 if (warn_id_clash
&& len
> id_clash_len
)
1269 hash_len
= id_clash_len
;
1271 /* Compute hash code */
1272 hi
= hash_len
* 613 + (unsigned) text
[0];
1273 for (i
= 1; i
< hash_len
; i
+= 2)
1274 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1276 hi
&= (1 << HASHBITS
) - 1;
1277 hi
%= MAX_HASH_TABLE
;
1279 /* Search table for identifier */
1280 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1281 if (IDENTIFIER_LENGTH (idp
) == len
1282 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1283 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1284 return idp
; /* <-- return if found */
1286 /* Not found; optionally warn about a similar identifier */
1287 if (warn_id_clash
&& do_identifier_warnings
&& len
>= id_clash_len
)
1288 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1289 if (!strncmp (IDENTIFIER_POINTER (idp
), text
, id_clash_len
))
1291 warning ("`%s' and `%s' identical in first %d characters",
1292 IDENTIFIER_POINTER (idp
), text
, id_clash_len
);
1296 if (tree_code_length
[(int) IDENTIFIER_NODE
] < 0)
1297 abort (); /* set_identifier_size hasn't been called. */
1299 /* Not found, create one, add to chain */
1300 idp
= make_node (IDENTIFIER_NODE
);
1301 IDENTIFIER_LENGTH (idp
) = len
;
1302 #ifdef GATHER_STATISTICS
1303 id_string_size
+= len
;
1306 IDENTIFIER_POINTER (idp
) = obstack_copy0 (&permanent_obstack
, text
, len
);
1308 TREE_CHAIN (idp
) = hash_table
[hi
];
1309 hash_table
[hi
] = idp
;
1310 return idp
; /* <-- return if created */
1313 /* If an identifier with the name TEXT (a null-terminated string) has
1314 previously been referred to, return that node; otherwise return
1318 maybe_get_identifier (text
)
1319 register char *text
;
1324 register int len
, hash_len
;
1326 /* Compute length of text in len. */
1327 for (len
= 0; text
[len
]; len
++);
1329 /* Decide how much of that length to hash on */
1331 if (warn_id_clash
&& len
> id_clash_len
)
1332 hash_len
= id_clash_len
;
1334 /* Compute hash code */
1335 hi
= hash_len
* 613 + (unsigned) text
[0];
1336 for (i
= 1; i
< hash_len
; i
+= 2)
1337 hi
= ((hi
* 613) + (unsigned) (text
[i
]));
1339 hi
&= (1 << HASHBITS
) - 1;
1340 hi
%= MAX_HASH_TABLE
;
1342 /* Search table for identifier */
1343 for (idp
= hash_table
[hi
]; idp
; idp
= TREE_CHAIN (idp
))
1344 if (IDENTIFIER_LENGTH (idp
) == len
1345 && IDENTIFIER_POINTER (idp
)[0] == text
[0]
1346 && !bcmp (IDENTIFIER_POINTER (idp
), text
, len
))
1347 return idp
; /* <-- return if found */
1352 /* Enable warnings on similar identifiers (if requested).
1353 Done after the built-in identifiers are created. */
1356 start_identifier_warnings ()
1358 do_identifier_warnings
= 1;
1361 /* Record the size of an identifier node for the language in use.
1362 SIZE is the total size in bytes.
1363 This is called by the language-specific files. This must be
1364 called before allocating any identifiers. */
1367 set_identifier_size (size
)
1370 tree_code_length
[(int) IDENTIFIER_NODE
]
1371 = (size
- sizeof (struct tree_common
)) / sizeof (tree
);
1374 /* Return a newly constructed INTEGER_CST node whose constant value
1375 is specified by the two ints LOW and HI.
1376 The TREE_TYPE is set to `int'.
1378 This function should be used via the `build_int_2' macro. */
1381 build_int_2_wide (low
, hi
)
1382 HOST_WIDE_INT low
, hi
;
1384 register tree t
= make_node (INTEGER_CST
);
1385 TREE_INT_CST_LOW (t
) = low
;
1386 TREE_INT_CST_HIGH (t
) = hi
;
1387 TREE_TYPE (t
) = integer_type_node
;
1391 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1394 build_real (type
, d
)
1401 /* Check for valid float value for this type on this target machine;
1402 if not, can print error message and store a valid value in D. */
1403 #ifdef CHECK_FLOAT_VALUE
1404 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1407 v
= make_node (REAL_CST
);
1408 TREE_TYPE (v
) = type
;
1409 TREE_REAL_CST (v
) = d
;
1410 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1414 /* Return a new REAL_CST node whose type is TYPE
1415 and whose value is the integer value of the INTEGER_CST node I. */
1417 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
1420 real_value_from_int_cst (type
, i
)
1425 #ifdef REAL_ARITHMETIC
1426 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
1427 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1430 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
1431 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
1432 #else /* not REAL_ARITHMETIC */
1433 /* Some 386 compilers mishandle unsigned int to float conversions,
1434 so introduce a temporary variable E to avoid those bugs. */
1435 if (TREE_INT_CST_HIGH (i
) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i
)))
1439 d
= (double) (~ TREE_INT_CST_HIGH (i
));
1440 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1441 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1443 e
= (double) (unsigned HOST_WIDE_INT
) (~ TREE_INT_CST_LOW (i
));
1451 d
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (i
);
1452 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
1453 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
1455 e
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (i
);
1458 #endif /* not REAL_ARITHMETIC */
1462 /* This function can't be implemented if we can't do arithmetic
1463 on the float representation. */
1466 build_real_from_int_cst (type
, i
)
1471 int overflow
= TREE_OVERFLOW (i
);
1473 jmp_buf float_error
;
1475 v
= make_node (REAL_CST
);
1476 TREE_TYPE (v
) = type
;
1478 if (setjmp (float_error
))
1485 set_float_handler (float_error
);
1487 #ifdef REAL_ARITHMETIC
1488 d
= real_value_from_int_cst (type
, i
);
1490 d
= REAL_VALUE_TRUNCATE (TYPE_MODE (type
),
1491 real_value_from_int_cst (type
, i
));
1494 /* Check for valid float value for this type on this target machine. */
1497 set_float_handler (NULL_PTR
);
1499 #ifdef CHECK_FLOAT_VALUE
1500 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
1503 TREE_REAL_CST (v
) = d
;
1504 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1508 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
1510 /* Return a newly constructed STRING_CST node whose value is
1511 the LEN characters at STR.
1512 The TREE_TYPE is not initialized. */
1515 build_string (len
, str
)
1519 /* Put the string in saveable_obstack since it will be placed in the RTL
1520 for an "asm" statement and will also be kept around a while if
1521 deferring constant output in varasm.c. */
1523 register tree s
= make_node (STRING_CST
);
1524 TREE_STRING_LENGTH (s
) = len
;
1525 TREE_STRING_POINTER (s
) = obstack_copy0 (saveable_obstack
, str
, len
);
1529 /* Return a newly constructed COMPLEX_CST node whose value is
1530 specified by the real and imaginary parts REAL and IMAG.
1531 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1532 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1535 build_complex (type
, real
, imag
)
1539 register tree t
= make_node (COMPLEX_CST
);
1541 TREE_REALPART (t
) = real
;
1542 TREE_IMAGPART (t
) = imag
;
1543 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1544 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1545 TREE_CONSTANT_OVERFLOW (t
)
1546 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1550 /* Build a newly constructed TREE_VEC node of length LEN. */
1557 register int length
= (len
-1) * sizeof (tree
) + sizeof (struct tree_vec
);
1558 register struct obstack
*obstack
= current_obstack
;
1561 #ifdef GATHER_STATISTICS
1562 tree_node_counts
[(int)vec_kind
]++;
1563 tree_node_sizes
[(int)vec_kind
] += length
;
1566 t
= (tree
) obstack_alloc (obstack
, length
);
1568 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
1571 TREE_SET_CODE (t
, TREE_VEC
);
1572 TREE_VEC_LENGTH (t
) = len
;
1573 if (obstack
== &permanent_obstack
)
1574 TREE_PERMANENT (t
) = 1;
1579 /* Return 1 if EXPR is the integer constant zero or a complex constant
1583 integer_zerop (expr
)
1588 return ((TREE_CODE (expr
) == INTEGER_CST
1589 && ! TREE_CONSTANT_OVERFLOW (expr
)
1590 && TREE_INT_CST_LOW (expr
) == 0
1591 && TREE_INT_CST_HIGH (expr
) == 0)
1592 || (TREE_CODE (expr
) == COMPLEX_CST
1593 && integer_zerop (TREE_REALPART (expr
))
1594 && integer_zerop (TREE_IMAGPART (expr
))));
1597 /* Return 1 if EXPR is the integer constant one or the corresponding
1598 complex constant. */
1606 return ((TREE_CODE (expr
) == INTEGER_CST
1607 && ! TREE_CONSTANT_OVERFLOW (expr
)
1608 && TREE_INT_CST_LOW (expr
) == 1
1609 && TREE_INT_CST_HIGH (expr
) == 0)
1610 || (TREE_CODE (expr
) == COMPLEX_CST
1611 && integer_onep (TREE_REALPART (expr
))
1612 && integer_zerop (TREE_IMAGPART (expr
))));
1615 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1616 it contains. Likewise for the corresponding complex constant. */
1619 integer_all_onesp (expr
)
1627 if (TREE_CODE (expr
) == COMPLEX_CST
1628 && integer_all_onesp (TREE_REALPART (expr
))
1629 && integer_zerop (TREE_IMAGPART (expr
)))
1632 else if (TREE_CODE (expr
) != INTEGER_CST
1633 || TREE_CONSTANT_OVERFLOW (expr
))
1636 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
1638 return TREE_INT_CST_LOW (expr
) == -1 && TREE_INT_CST_HIGH (expr
) == -1;
1640 /* Note that using TYPE_PRECISION here is wrong. We care about the
1641 actual bits, not the (arbitrary) range of the type. */
1642 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1643 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1645 int high_value
, shift_amount
;
1647 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1649 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
1650 /* Can not handle precisions greater than twice the host int size. */
1652 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1653 /* Shifting by the host word size is undefined according to the ANSI
1654 standard, so we must handle this as a special case. */
1657 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1659 return TREE_INT_CST_LOW (expr
) == -1
1660 && TREE_INT_CST_HIGH (expr
) == high_value
;
1663 return TREE_INT_CST_LOW (expr
) == ((HOST_WIDE_INT
) 1 << prec
) - 1;
1666 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1670 integer_pow2p (expr
)
1674 HOST_WIDE_INT high
, low
;
1678 if (TREE_CODE (expr
) == COMPLEX_CST
1679 && integer_pow2p (TREE_REALPART (expr
))
1680 && integer_zerop (TREE_IMAGPART (expr
)))
1683 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1686 prec
= (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
1687 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1688 high
= TREE_INT_CST_HIGH (expr
);
1689 low
= TREE_INT_CST_LOW (expr
);
1691 /* First clear all bits that are beyond the type's precision in case
1692 we've been sign extended. */
1694 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1696 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1697 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1701 if (prec
< HOST_BITS_PER_WIDE_INT
)
1702 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1705 if (high
== 0 && low
== 0)
1708 return ((high
== 0 && (low
& (low
- 1)) == 0)
1709 || (low
== 0 && (high
& (high
- 1)) == 0));
1712 /* Return the power of two represented by a tree node known to be a
1720 HOST_WIDE_INT high
, low
;
1724 if (TREE_CODE (expr
) == COMPLEX_CST
)
1725 return tree_log2 (TREE_REALPART (expr
));
1727 prec
= (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
1728 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1730 high
= TREE_INT_CST_HIGH (expr
);
1731 low
= TREE_INT_CST_LOW (expr
);
1733 /* First clear all bits that are beyond the type's precision in case
1734 we've been sign extended. */
1736 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1738 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1739 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1743 if (prec
< HOST_BITS_PER_WIDE_INT
)
1744 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1747 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1748 : exact_log2 (low
));
1751 /* Return 1 if EXPR is the real constant zero. */
1759 return ((TREE_CODE (expr
) == REAL_CST
1760 && ! TREE_CONSTANT_OVERFLOW (expr
)
1761 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1762 || (TREE_CODE (expr
) == COMPLEX_CST
1763 && real_zerop (TREE_REALPART (expr
))
1764 && real_zerop (TREE_IMAGPART (expr
))));
1767 /* Return 1 if EXPR is the real constant one in real or complex form. */
1775 return ((TREE_CODE (expr
) == REAL_CST
1776 && ! TREE_CONSTANT_OVERFLOW (expr
)
1777 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1778 || (TREE_CODE (expr
) == COMPLEX_CST
1779 && real_onep (TREE_REALPART (expr
))
1780 && real_zerop (TREE_IMAGPART (expr
))));
1783 /* Return 1 if EXPR is the real constant two. */
1791 return ((TREE_CODE (expr
) == REAL_CST
1792 && ! TREE_CONSTANT_OVERFLOW (expr
)
1793 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1794 || (TREE_CODE (expr
) == COMPLEX_CST
1795 && real_twop (TREE_REALPART (expr
))
1796 && real_zerop (TREE_IMAGPART (expr
))));
1799 /* Nonzero if EXP is a constant or a cast of a constant. */
1802 really_constant_p (exp
)
1805 /* This is not quite the same as STRIP_NOPS. It does more. */
1806 while (TREE_CODE (exp
) == NOP_EXPR
1807 || TREE_CODE (exp
) == CONVERT_EXPR
1808 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1809 exp
= TREE_OPERAND (exp
, 0);
1810 return TREE_CONSTANT (exp
);
1813 /* Return first list element whose TREE_VALUE is ELEM.
1814 Return 0 if ELEM is not in LIST. */
1817 value_member (elem
, list
)
1822 if (elem
== TREE_VALUE (list
))
1824 list
= TREE_CHAIN (list
);
1829 /* Return first list element whose TREE_PURPOSE is ELEM.
1830 Return 0 if ELEM is not in LIST. */
1833 purpose_member (elem
, list
)
1838 if (elem
== TREE_PURPOSE (list
))
1840 list
= TREE_CHAIN (list
);
1845 /* Return first list element whose BINFO_TYPE is ELEM.
1846 Return 0 if ELEM is not in LIST. */
1849 binfo_member (elem
, list
)
1854 if (elem
== BINFO_TYPE (list
))
1856 list
= TREE_CHAIN (list
);
1861 /* Return nonzero if ELEM is part of the chain CHAIN. */
1864 chain_member (elem
, chain
)
1871 chain
= TREE_CHAIN (chain
);
1877 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1879 /* ??? This function was added for machine specific attributes but is no
1880 longer used. It could be deleted if we could confirm all front ends
1884 chain_member_value (elem
, chain
)
1889 if (elem
== TREE_VALUE (chain
))
1891 chain
= TREE_CHAIN (chain
);
1897 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1898 for any piece of chain CHAIN. */
1899 /* ??? This function was added for machine specific attributes but is no
1900 longer used. It could be deleted if we could confirm all front ends
1904 chain_member_purpose (elem
, chain
)
1909 if (elem
== TREE_PURPOSE (chain
))
1911 chain
= TREE_CHAIN (chain
);
1917 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1918 We expect a null pointer to mark the end of the chain.
1919 This is the Lisp primitive `length'. */
1926 register int len
= 0;
1928 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1934 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1935 by modifying the last node in chain 1 to point to chain 2.
1936 This is the Lisp primitive `nconc'. */
1948 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1950 TREE_CHAIN (t1
) = op2
;
1951 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1953 abort (); /* Circularity created. */
1959 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1963 register tree chain
;
1967 while ((next
= TREE_CHAIN (chain
)))
1972 /* Reverse the order of elements in the chain T,
1973 and return the new head of the chain (old last element). */
1979 register tree prev
= 0, decl
, next
;
1980 for (decl
= t
; decl
; decl
= next
)
1982 next
= TREE_CHAIN (decl
);
1983 TREE_CHAIN (decl
) = prev
;
1989 /* Given a chain CHAIN of tree nodes,
1990 construct and return a list of those nodes. */
1996 tree result
= NULL_TREE
;
1997 tree in_tail
= chain
;
1998 tree out_tail
= NULL_TREE
;
2002 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
2004 TREE_CHAIN (out_tail
) = next
;
2008 in_tail
= TREE_CHAIN (in_tail
);
2014 /* Return a newly created TREE_LIST node whose
2015 purpose and value fields are PARM and VALUE. */
2018 build_tree_list (parm
, value
)
2021 register tree t
= make_node (TREE_LIST
);
2022 TREE_PURPOSE (t
) = parm
;
2023 TREE_VALUE (t
) = value
;
2027 /* Similar, but build on the temp_decl_obstack. */
2030 build_decl_list (parm
, value
)
2034 register struct obstack
*ambient_obstack
= current_obstack
;
2035 current_obstack
= &temp_decl_obstack
;
2036 node
= build_tree_list (parm
, value
);
2037 current_obstack
= ambient_obstack
;
2041 /* Similar, but build on the expression_obstack. */
2044 build_expr_list (parm
, value
)
2048 register struct obstack
*ambient_obstack
= current_obstack
;
2049 current_obstack
= expression_obstack
;
2050 node
= build_tree_list (parm
, value
);
2051 current_obstack
= ambient_obstack
;
2055 /* Return a newly created TREE_LIST node whose
2056 purpose and value fields are PARM and VALUE
2057 and whose TREE_CHAIN is CHAIN. */
2060 tree_cons (purpose
, value
, chain
)
2061 tree purpose
, value
, chain
;
2064 register tree node
= make_node (TREE_LIST
);
2067 register tree node
= (tree
) obstack_alloc (current_obstack
, sizeof (struct tree_list
));
2068 #ifdef GATHER_STATISTICS
2069 tree_node_counts
[(int)x_kind
]++;
2070 tree_node_sizes
[(int)x_kind
] += sizeof (struct tree_list
);
2073 for (i
= (sizeof (struct tree_common
) / sizeof (int)) - 1; i
>= 0; i
--)
2074 ((int *) node
)[i
] = 0;
2076 TREE_SET_CODE (node
, TREE_LIST
);
2077 if (current_obstack
== &permanent_obstack
)
2078 TREE_PERMANENT (node
) = 1;
2081 TREE_CHAIN (node
) = chain
;
2082 TREE_PURPOSE (node
) = purpose
;
2083 TREE_VALUE (node
) = value
;
2087 /* Similar, but build on the temp_decl_obstack. */
2090 decl_tree_cons (purpose
, value
, chain
)
2091 tree purpose
, value
, chain
;
2094 register struct obstack
*ambient_obstack
= current_obstack
;
2095 current_obstack
= &temp_decl_obstack
;
2096 node
= tree_cons (purpose
, value
, chain
);
2097 current_obstack
= ambient_obstack
;
2101 /* Similar, but build on the expression_obstack. */
2104 expr_tree_cons (purpose
, value
, chain
)
2105 tree purpose
, value
, chain
;
2108 register struct obstack
*ambient_obstack
= current_obstack
;
2109 current_obstack
= expression_obstack
;
2110 node
= tree_cons (purpose
, value
, chain
);
2111 current_obstack
= ambient_obstack
;
2115 /* Same as `tree_cons' but make a permanent object. */
2118 perm_tree_cons (purpose
, value
, chain
)
2119 tree purpose
, value
, chain
;
2122 register struct obstack
*ambient_obstack
= current_obstack
;
2123 current_obstack
= &permanent_obstack
;
2125 node
= tree_cons (purpose
, value
, chain
);
2126 current_obstack
= ambient_obstack
;
2130 /* Same as `tree_cons', but make this node temporary, regardless. */
2133 temp_tree_cons (purpose
, value
, chain
)
2134 tree purpose
, value
, chain
;
2137 register struct obstack
*ambient_obstack
= current_obstack
;
2138 current_obstack
= &temporary_obstack
;
2140 node
= tree_cons (purpose
, value
, chain
);
2141 current_obstack
= ambient_obstack
;
2145 /* Same as `tree_cons', but save this node if the function's RTL is saved. */
2148 saveable_tree_cons (purpose
, value
, chain
)
2149 tree purpose
, value
, chain
;
2152 register struct obstack
*ambient_obstack
= current_obstack
;
2153 current_obstack
= saveable_obstack
;
2155 node
= tree_cons (purpose
, value
, chain
);
2156 current_obstack
= ambient_obstack
;
2160 /* Return the size nominally occupied by an object of type TYPE
2161 when it resides in memory. The value is measured in units of bytes,
2162 and its data type is that normally used for type sizes
2163 (which is the first type created by make_signed_type or
2164 make_unsigned_type). */
2167 size_in_bytes (type
)
2172 if (type
== error_mark_node
)
2173 return integer_zero_node
;
2174 type
= TYPE_MAIN_VARIANT (type
);
2175 if (TYPE_SIZE (type
) == 0)
2177 incomplete_type_error (NULL_TREE
, type
);
2178 return integer_zero_node
;
2180 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
2181 size_int (BITS_PER_UNIT
));
2182 if (TREE_CODE (t
) == INTEGER_CST
)
2183 force_fit_type (t
, 0);
2187 /* Return the size of TYPE (in bytes) as an integer,
2188 or return -1 if the size can vary. */
2191 int_size_in_bytes (type
)
2195 if (type
== error_mark_node
)
2197 type
= TYPE_MAIN_VARIANT (type
);
2198 if (TYPE_SIZE (type
) == 0)
2200 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
2202 if (TREE_INT_CST_HIGH (TYPE_SIZE (type
)) != 0)
2204 tree t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
2205 size_int (BITS_PER_UNIT
));
2206 return TREE_INT_CST_LOW (t
);
2208 size
= TREE_INT_CST_LOW (TYPE_SIZE (type
));
2209 return (size
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
2212 /* Return, as a tree node, the number of elements for TYPE (which is an
2213 ARRAY_TYPE) minus one. This counts only elements of the top array.
2215 Don't let any SAVE_EXPRs escape; if we are called as part of a cleanup
2216 action, they would get unsaved. */
2219 array_type_nelts (type
)
2222 tree index_type
, min
, max
;
2224 /* If they did it with unspecified bounds, then we should have already
2225 given an error about it before we got here. */
2226 if (! TYPE_DOMAIN (type
))
2227 return error_mark_node
;
2229 index_type
= TYPE_DOMAIN (type
);
2230 min
= TYPE_MIN_VALUE (index_type
);
2231 max
= TYPE_MAX_VALUE (index_type
);
2233 if (! TREE_CONSTANT (min
))
2236 if (TREE_CODE (min
) == SAVE_EXPR
)
2237 min
= build (RTL_EXPR
, TREE_TYPE (TYPE_MIN_VALUE (index_type
)), 0,
2238 SAVE_EXPR_RTL (min
));
2240 min
= TYPE_MIN_VALUE (index_type
);
2243 if (! TREE_CONSTANT (max
))
2246 if (TREE_CODE (max
) == SAVE_EXPR
)
2247 max
= build (RTL_EXPR
, TREE_TYPE (TYPE_MAX_VALUE (index_type
)), 0,
2248 SAVE_EXPR_RTL (max
));
2250 max
= TYPE_MAX_VALUE (index_type
);
2253 return (integer_zerop (min
)
2255 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
2258 /* Return nonzero if arg is static -- a reference to an object in
2259 static storage. This is not the same as the C meaning of `static'. */
2265 switch (TREE_CODE (arg
))
2268 /* Nested functions aren't static, since taking their address
2269 involves a trampoline. */
2270 return decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
);
2272 return TREE_STATIC (arg
) || DECL_EXTERNAL (arg
);
2275 return TREE_STATIC (arg
);
2280 /* If we are referencing a bitfield, we can't evaluate an
2281 ADDR_EXPR at compile time and so it isn't a constant. */
2283 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
2284 && staticp (TREE_OPERAND (arg
, 0)));
2290 /* This case is technically correct, but results in setting
2291 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
2294 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
2298 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2299 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2300 return staticp (TREE_OPERAND (arg
, 0));
2307 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2308 Do this to any expression which may be used in more than one place,
2309 but must be evaluated only once.
2311 Normally, expand_expr would reevaluate the expression each time.
2312 Calling save_expr produces something that is evaluated and recorded
2313 the first time expand_expr is called on it. Subsequent calls to
2314 expand_expr just reuse the recorded value.
2316 The call to expand_expr that generates code that actually computes
2317 the value is the first call *at compile time*. Subsequent calls
2318 *at compile time* generate code to use the saved value.
2319 This produces correct result provided that *at run time* control
2320 always flows through the insns made by the first expand_expr
2321 before reaching the other places where the save_expr was evaluated.
2322 You, the caller of save_expr, must make sure this is so.
2324 Constants, and certain read-only nodes, are returned with no
2325 SAVE_EXPR because that is safe. Expressions containing placeholders
2326 are not touched; see tree.def for an explanation of what these
2333 register tree t
= fold (expr
);
2335 /* We don't care about whether this can be used as an lvalue in this
2337 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
2338 t
= TREE_OPERAND (t
, 0);
2340 /* If the tree evaluates to a constant, then we don't want to hide that
2341 fact (i.e. this allows further folding, and direct checks for constants).
2342 However, a read-only object that has side effects cannot be bypassed.
2343 Since it is no problem to reevaluate literals, we just return the
2346 if (TREE_CONSTANT (t
) || (TREE_READONLY (t
) && ! TREE_SIDE_EFFECTS (t
))
2347 || TREE_CODE (t
) == SAVE_EXPR
|| TREE_CODE (t
) == ERROR_MARK
)
2350 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2351 it means that the size or offset of some field of an object depends on
2352 the value within another field.
2354 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2355 and some variable since it would then need to be both evaluated once and
2356 evaluated more than once. Front-ends must assure this case cannot
2357 happen by surrounding any such subexpressions in their own SAVE_EXPR
2358 and forcing evaluation at the proper time. */
2359 if (contains_placeholder_p (t
))
2362 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
2364 /* This expression might be placed ahead of a jump to ensure that the
2365 value was computed on both sides of the jump. So make sure it isn't
2366 eliminated as dead. */
2367 TREE_SIDE_EFFECTS (t
) = 1;
2371 /* Arrange for an expression to be expanded multiple independent
2372 times. This is useful for cleanup actions, as the backend can
2373 expand them multiple times in different places. */
2381 /* If this is already protected, no sense in protecting it again. */
2382 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
2385 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
2386 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
2390 /* Modify a tree in place so that all the evaluate only once things
2391 are cleared out. Return the EXPR given. */
2394 unsave_expr_now (expr
)
2397 enum tree_code code
;
2401 if (expr
== NULL_TREE
)
2404 code
= TREE_CODE (expr
);
2405 first_rtl
= tree_code_length
[(int) code
];
2409 SAVE_EXPR_RTL (expr
) = 0;
2414 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
2415 TREE_OPERAND (expr
, 3) = NULL_TREE
;
2419 /* I don't yet know how to emit a sequence multiple times. */
2420 if (RTL_EXPR_SEQUENCE (expr
) != 0)
2426 CALL_EXPR_RTL (expr
) = 0;
2427 if (TREE_OPERAND (expr
, 1)
2428 && TREE_CODE (TREE_OPERAND (expr
, 1)) == TREE_LIST
)
2430 tree exp
= TREE_OPERAND (expr
, 1);
2433 unsave_expr_now (TREE_VALUE (exp
));
2434 exp
= TREE_CHAIN (exp
);
2440 case WITH_CLEANUP_EXPR
:
2441 /* Should be defined to be 2. */
2445 case METHOD_CALL_EXPR
:
2453 switch (TREE_CODE_CLASS (code
))
2455 case 'c': /* a constant */
2456 case 't': /* a type node */
2457 case 'x': /* something random, like an identifier or an ERROR_MARK. */
2458 case 'd': /* A decl node */
2459 case 'b': /* A block node */
2462 case 'e': /* an expression */
2463 case 'r': /* a reference */
2464 case 's': /* an expression with side effects */
2465 case '<': /* a comparison expression */
2466 case '2': /* a binary arithmetic expression */
2467 case '1': /* a unary arithmetic expression */
2468 for (i
= first_rtl
- 1; i
>= 0; i
--)
2469 unsave_expr_now (TREE_OPERAND (expr
, i
));
2477 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2478 or offset that depends on a field within a record. */
2481 contains_placeholder_p (exp
)
2484 register enum tree_code code
= TREE_CODE (exp
);
2487 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
2488 in it since it is supplying a value for it. */
2489 if (code
== WITH_RECORD_EXPR
)
2491 else if (code
== PLACEHOLDER_EXPR
)
2494 switch (TREE_CODE_CLASS (code
))
2497 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2498 position computations since they will be converted into a
2499 WITH_RECORD_EXPR involving the reference, which will assume
2500 here will be valid. */
2501 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2504 if (code
== TREE_LIST
)
2505 return (contains_placeholder_p (TREE_VALUE (exp
))
2506 || (TREE_CHAIN (exp
) != 0
2507 && contains_placeholder_p (TREE_CHAIN (exp
))));
2516 /* Ignoring the first operand isn't quite right, but works best. */
2517 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
2524 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2525 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
2526 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
2529 /* If we already know this doesn't have a placeholder, don't
2531 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
2534 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
2535 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
2537 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
2542 return (TREE_OPERAND (exp
, 1) != 0
2543 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2549 switch (tree_code_length
[(int) code
])
2552 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
2554 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
2555 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
2565 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2566 return a tree with all occurrences of references to F in a
2567 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2568 contains only arithmetic expressions or a CALL_EXPR with a
2569 PLACEHOLDER_EXPR occurring only in its arglist. */
2572 substitute_in_expr (exp
, f
, r
)
2577 enum tree_code code
= TREE_CODE (exp
);
2582 switch (TREE_CODE_CLASS (code
))
2589 if (code
== PLACEHOLDER_EXPR
)
2591 else if (code
== TREE_LIST
)
2593 op0
= (TREE_CHAIN (exp
) == 0
2594 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2595 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2596 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2599 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2608 switch (tree_code_length
[(int) code
])
2611 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2612 if (op0
== TREE_OPERAND (exp
, 0))
2615 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2619 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2620 could, but we don't support it. */
2621 if (code
== RTL_EXPR
)
2623 else if (code
== CONSTRUCTOR
)
2626 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2627 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2628 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2631 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2635 /* It cannot be that anything inside a SAVE_EXPR contains a
2636 PLACEHOLDER_EXPR. */
2637 if (code
== SAVE_EXPR
)
2640 else if (code
== CALL_EXPR
)
2642 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2643 if (op1
== TREE_OPERAND (exp
, 1))
2646 return build (code
, TREE_TYPE (exp
),
2647 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2650 else if (code
!= COND_EXPR
)
2653 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2654 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2655 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2656 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2657 && op2
== TREE_OPERAND (exp
, 2))
2660 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2673 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2674 and it is the right field, replace it with R. */
2675 for (inner
= TREE_OPERAND (exp
, 0);
2676 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2677 inner
= TREE_OPERAND (inner
, 0))
2679 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2680 && TREE_OPERAND (exp
, 1) == f
)
2683 /* If this expression hasn't been completed let, leave it
2685 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2686 && TREE_TYPE (inner
) == 0)
2689 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2690 if (op0
== TREE_OPERAND (exp
, 0))
2693 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2694 TREE_OPERAND (exp
, 1)));
2698 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2699 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2700 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2701 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2702 && op2
== TREE_OPERAND (exp
, 2))
2705 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2710 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2711 if (op0
== TREE_OPERAND (exp
, 0))
2714 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2726 TREE_READONLY (new) = TREE_READONLY (exp
);
2730 /* Stabilize a reference so that we can use it any number of times
2731 without causing its operands to be evaluated more than once.
2732 Returns the stabilized reference. This works by means of save_expr,
2733 so see the caveats in the comments about save_expr.
2735 Also allows conversion expressions whose operands are references.
2736 Any other kind of expression is returned unchanged. */
2739 stabilize_reference (ref
)
2742 register tree result
;
2743 register enum tree_code code
= TREE_CODE (ref
);
2750 /* No action is needed in this case. */
2756 case FIX_TRUNC_EXPR
:
2757 case FIX_FLOOR_EXPR
:
2758 case FIX_ROUND_EXPR
:
2760 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2764 result
= build_nt (INDIRECT_REF
,
2765 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2769 result
= build_nt (COMPONENT_REF
,
2770 stabilize_reference (TREE_OPERAND (ref
, 0)),
2771 TREE_OPERAND (ref
, 1));
2775 result
= build_nt (BIT_FIELD_REF
,
2776 stabilize_reference (TREE_OPERAND (ref
, 0)),
2777 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2778 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2782 result
= build_nt (ARRAY_REF
,
2783 stabilize_reference (TREE_OPERAND (ref
, 0)),
2784 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2788 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2789 it wouldn't be ignored. This matters when dealing with
2791 return stabilize_reference_1 (ref
);
2794 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2795 save_expr (build1 (ADDR_EXPR
,
2796 build_pointer_type (TREE_TYPE (ref
)),
2801 /* If arg isn't a kind of lvalue we recognize, make no change.
2802 Caller should recognize the error for an invalid lvalue. */
2807 return error_mark_node
;
2810 TREE_TYPE (result
) = TREE_TYPE (ref
);
2811 TREE_READONLY (result
) = TREE_READONLY (ref
);
2812 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2813 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2814 TREE_RAISES (result
) = TREE_RAISES (ref
);
2819 /* Subroutine of stabilize_reference; this is called for subtrees of
2820 references. Any expression with side-effects must be put in a SAVE_EXPR
2821 to ensure that it is only evaluated once.
2823 We don't put SAVE_EXPR nodes around everything, because assigning very
2824 simple expressions to temporaries causes us to miss good opportunities
2825 for optimizations. Among other things, the opportunity to fold in the
2826 addition of a constant into an addressing mode often gets lost, e.g.
2827 "y[i+1] += x;". In general, we take the approach that we should not make
2828 an assignment unless we are forced into it - i.e., that any non-side effect
2829 operator should be allowed, and that cse should take care of coalescing
2830 multiple utterances of the same expression should that prove fruitful. */
2833 stabilize_reference_1 (e
)
2836 register tree result
;
2837 register enum tree_code code
= TREE_CODE (e
);
2839 /* We cannot ignore const expressions because it might be a reference
2840 to a const array but whose index contains side-effects. But we can
2841 ignore things that are actual constant or that already have been
2842 handled by this function. */
2844 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2847 switch (TREE_CODE_CLASS (code
))
2857 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2858 so that it will only be evaluated once. */
2859 /* The reference (r) and comparison (<) classes could be handled as
2860 below, but it is generally faster to only evaluate them once. */
2861 if (TREE_SIDE_EFFECTS (e
))
2862 return save_expr (e
);
2866 /* Constants need no processing. In fact, we should never reach
2871 /* Division is slow and tends to be compiled with jumps,
2872 especially the division by powers of 2 that is often
2873 found inside of an array reference. So do it just once. */
2874 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2875 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2876 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2877 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2878 return save_expr (e
);
2879 /* Recursively stabilize each operand. */
2880 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2881 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2885 /* Recursively stabilize each operand. */
2886 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2893 TREE_TYPE (result
) = TREE_TYPE (e
);
2894 TREE_READONLY (result
) = TREE_READONLY (e
);
2895 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2896 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2897 TREE_RAISES (result
) = TREE_RAISES (e
);
2902 /* Low-level constructors for expressions. */
2904 /* Build an expression of code CODE, data type TYPE,
2905 and operands as specified by the arguments ARG1 and following arguments.
2906 Expressions and reference nodes can be created this way.
2907 Constants, decls, types and misc nodes cannot be. */
2910 build
VPROTO((enum tree_code code
, tree tt
, ...))
2913 enum tree_code code
;
2918 register int length
;
2924 code
= va_arg (p
, enum tree_code
);
2925 tt
= va_arg (p
, tree
);
2928 t
= make_node (code
);
2929 length
= tree_code_length
[(int) code
];
2934 /* This is equivalent to the loop below, but faster. */
2935 register tree arg0
= va_arg (p
, tree
);
2936 register tree arg1
= va_arg (p
, tree
);
2937 TREE_OPERAND (t
, 0) = arg0
;
2938 TREE_OPERAND (t
, 1) = arg1
;
2939 if ((arg0
&& TREE_SIDE_EFFECTS (arg0
))
2940 || (arg1
&& TREE_SIDE_EFFECTS (arg1
)))
2941 TREE_SIDE_EFFECTS (t
) = 1;
2943 = (arg0
&& TREE_RAISES (arg0
)) || (arg1
&& TREE_RAISES (arg1
));
2945 else if (length
== 1)
2947 register tree arg0
= va_arg (p
, tree
);
2949 /* Call build1 for this! */
2950 if (TREE_CODE_CLASS (code
) != 's')
2952 TREE_OPERAND (t
, 0) = arg0
;
2953 if (arg0
&& TREE_SIDE_EFFECTS (arg0
))
2954 TREE_SIDE_EFFECTS (t
) = 1;
2955 TREE_RAISES (t
) = (arg0
&& TREE_RAISES (arg0
));
2959 for (i
= 0; i
< length
; i
++)
2961 register tree operand
= va_arg (p
, tree
);
2962 TREE_OPERAND (t
, i
) = operand
;
2965 if (TREE_SIDE_EFFECTS (operand
))
2966 TREE_SIDE_EFFECTS (t
) = 1;
2967 if (TREE_RAISES (operand
))
2968 TREE_RAISES (t
) = 1;
2976 /* Same as above, but only builds for unary operators.
2977 Saves lions share of calls to `build'; cuts down use
2978 of varargs, which is expensive for RISC machines. */
2981 build1 (code
, type
, node
)
2982 enum tree_code code
;
2986 register struct obstack
*obstack
= expression_obstack
;
2987 register int i
, length
;
2988 #ifdef GATHER_STATISTICS
2989 register tree_node_kind kind
;
2993 #ifdef GATHER_STATISTICS
2994 if (TREE_CODE_CLASS (code
) == 'r')
3000 length
= sizeof (struct tree_exp
);
3002 t
= (tree
) obstack_alloc (obstack
, length
);
3004 #ifdef GATHER_STATISTICS
3005 tree_node_counts
[(int)kind
]++;
3006 tree_node_sizes
[(int)kind
] += length
;
3009 for (i
= (length
/ sizeof (int)) - 1; i
>= 0; i
--)
3012 TREE_TYPE (t
) = type
;
3013 TREE_SET_CODE (t
, code
);
3015 if (obstack
== &permanent_obstack
)
3016 TREE_PERMANENT (t
) = 1;
3018 TREE_OPERAND (t
, 0) = node
;
3021 if (TREE_SIDE_EFFECTS (node
))
3022 TREE_SIDE_EFFECTS (t
) = 1;
3023 if (TREE_RAISES (node
))
3024 TREE_RAISES (t
) = 1;
3030 /* Similar except don't specify the TREE_TYPE
3031 and leave the TREE_SIDE_EFFECTS as 0.
3032 It is permissible for arguments to be null,
3033 or even garbage if their values do not matter. */
3036 build_nt
VPROTO((enum tree_code code
, ...))
3039 enum tree_code code
;
3043 register int length
;
3049 code
= va_arg (p
, enum tree_code
);
3052 t
= make_node (code
);
3053 length
= tree_code_length
[(int) code
];
3055 for (i
= 0; i
< length
; i
++)
3056 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3062 /* Similar to `build_nt', except we build
3063 on the temp_decl_obstack, regardless. */
3066 build_parse_node
VPROTO((enum tree_code code
, ...))
3069 enum tree_code code
;
3071 register struct obstack
*ambient_obstack
= expression_obstack
;
3074 register int length
;
3080 code
= va_arg (p
, enum tree_code
);
3083 expression_obstack
= &temp_decl_obstack
;
3085 t
= make_node (code
);
3086 length
= tree_code_length
[(int) code
];
3088 for (i
= 0; i
< length
; i
++)
3089 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3092 expression_obstack
= ambient_obstack
;
3097 /* Commented out because this wants to be done very
3098 differently. See cp-lex.c. */
3100 build_op_identifier (op1
, op2
)
3103 register tree t
= make_node (OP_IDENTIFIER
);
3104 TREE_PURPOSE (t
) = op1
;
3105 TREE_VALUE (t
) = op2
;
3110 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3111 We do NOT enter this node in any sort of symbol table.
3113 layout_decl is used to set up the decl's storage layout.
3114 Other slots are initialized to 0 or null pointers. */
3117 build_decl (code
, name
, type
)
3118 enum tree_code code
;
3123 t
= make_node (code
);
3125 /* if (type == error_mark_node)
3126 type = integer_type_node; */
3127 /* That is not done, deliberately, so that having error_mark_node
3128 as the type can suppress useless errors in the use of this variable. */
3130 DECL_NAME (t
) = name
;
3131 DECL_ASSEMBLER_NAME (t
) = name
;
3132 TREE_TYPE (t
) = type
;
3134 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3136 else if (code
== FUNCTION_DECL
)
3137 DECL_MODE (t
) = FUNCTION_MODE
;
3142 /* BLOCK nodes are used to represent the structure of binding contours
3143 and declarations, once those contours have been exited and their contents
3144 compiled. This information is used for outputting debugging info. */
3147 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
3148 tree vars
, tags
, subblocks
, supercontext
, chain
;
3150 register tree block
= make_node (BLOCK
);
3151 BLOCK_VARS (block
) = vars
;
3152 BLOCK_TYPE_TAGS (block
) = tags
;
3153 BLOCK_SUBBLOCKS (block
) = subblocks
;
3154 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3155 BLOCK_CHAIN (block
) = chain
;
3159 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
3163 build_decl_attribute_variant (ddecl
, attribute
)
3164 tree ddecl
, attribute
;
3166 DECL_MACHINE_ATTRIBUTES (ddecl
) = attribute
;
3170 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3173 Record such modified types already made so we don't make duplicates. */
3176 build_type_attribute_variant (ttype
, attribute
)
3177 tree ttype
, attribute
;
3179 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3181 register int hashcode
;
3182 register struct obstack
*ambient_obstack
= current_obstack
;
3185 if (ambient_obstack
!= &permanent_obstack
)
3186 current_obstack
= TYPE_OBSTACK (ttype
);
3188 ntype
= copy_node (ttype
);
3189 current_obstack
= ambient_obstack
;
3191 TYPE_POINTER_TO (ntype
) = 0;
3192 TYPE_REFERENCE_TO (ntype
) = 0;
3193 TYPE_ATTRIBUTES (ntype
) = attribute
;
3195 /* Create a new main variant of TYPE. */
3196 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3197 TYPE_NEXT_VARIANT (ntype
) = 0;
3198 TYPE_READONLY (ntype
) = TYPE_VOLATILE (ntype
) = 0;
3200 hashcode
= TYPE_HASH (TREE_CODE (ntype
))
3201 + TYPE_HASH (TREE_TYPE (ntype
))
3202 + attribute_hash_list (attribute
);
3204 switch (TREE_CODE (ntype
))
3207 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
3210 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
3213 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
3216 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
3222 ntype
= type_hash_canon (hashcode
, ntype
);
3223 ttype
= build_type_variant (ntype
, TYPE_READONLY (ttype
),
3224 TYPE_VOLATILE (ttype
));
3230 /* Return a 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration DECL
3231 or type TYPE and 0 otherwise. Validity is determined the configuration
3232 macros VALID_MACHINE_DECL_ATTRIBUTE and VALID_MACHINE_TYPE_ATTRIBUTE. */
3235 valid_machine_attribute (attr_name
, attr_args
, decl
, type
)
3236 tree attr_name
, attr_args
;
3241 tree decl_attr_list
= decl
!= 0 ? DECL_MACHINE_ATTRIBUTES (decl
) : 0;
3242 tree type_attr_list
= TYPE_ATTRIBUTES (type
);
3244 if (TREE_CODE (attr_name
) != IDENTIFIER_NODE
)
3247 #ifdef VALID_MACHINE_DECL_ATTRIBUTE
3249 && VALID_MACHINE_DECL_ATTRIBUTE (decl
, decl_attr_list
, attr_name
, attr_args
))
3251 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3254 if (attr
!= NULL_TREE
)
3256 /* Override existing arguments. Declarations are unique so we can
3257 modify this in place. */
3258 TREE_VALUE (attr
) = attr_args
;
3262 decl_attr_list
= tree_cons (attr_name
, attr_args
, decl_attr_list
);
3263 decl
= build_decl_attribute_variant (decl
, decl_attr_list
);
3270 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
3271 if (VALID_MACHINE_TYPE_ATTRIBUTE (type
, type_attr_list
, attr_name
, attr_args
))
3273 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3276 if (attr
!= NULL_TREE
)
3278 /* Override existing arguments.
3279 ??? This currently works since attribute arguments are not
3280 included in `attribute_hash_list'. Something more complicated
3281 may be needed in the future. */
3282 TREE_VALUE (attr
) = attr_args
;
3286 type_attr_list
= tree_cons (attr_name
, attr_args
, type_attr_list
);
3287 type
= build_type_attribute_variant (type
, type_attr_list
);
3290 TREE_TYPE (decl
) = type
;
3294 /* Handle putting a type attribute on pointer-to-function-type by putting
3295 the attribute on the function type. */
3296 else if (TREE_CODE (type
) == POINTER_TYPE
3297 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3298 && VALID_MACHINE_TYPE_ATTRIBUTE (TREE_TYPE (type
), type_attr_list
,
3299 attr_name
, attr_args
))
3301 tree inner_type
= TREE_TYPE (type
);
3302 tree inner_attr_list
= TYPE_ATTRIBUTES (inner_type
);
3303 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
3306 if (attr
!= NULL_TREE
)
3307 TREE_VALUE (attr
) = attr_args
;
3310 inner_attr_list
= tree_cons (attr_name
, attr_args
, inner_attr_list
);
3311 inner_type
= build_type_attribute_variant (inner_type
,
3316 TREE_TYPE (decl
) = build_pointer_type (inner_type
);
3325 /* Return non-zero if IDENT is a valid name for attribute ATTR,
3328 We try both `text' and `__text__', ATTR may be either one. */
3329 /* ??? It might be a reasonable simplification to require ATTR to be only
3330 `text'. One might then also require attribute lists to be stored in
3331 their canonicalized form. */
3334 is_attribute_p (attr
, ident
)
3338 int ident_len
, attr_len
;
3341 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3344 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
3347 p
= IDENTIFIER_POINTER (ident
);
3348 ident_len
= strlen (p
);
3349 attr_len
= strlen (attr
);
3351 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3355 || attr
[attr_len
- 2] != '_'
3356 || attr
[attr_len
- 1] != '_')
3358 if (ident_len
== attr_len
- 4
3359 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3364 if (ident_len
== attr_len
+ 4
3365 && p
[0] == '_' && p
[1] == '_'
3366 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3367 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3374 /* Given an attribute name and a list of attributes, return a pointer to the
3375 attribute's list element if the attribute is part of the list, or NULL_TREE
3379 lookup_attribute (attr_name
, list
)
3385 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3387 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
3389 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
3396 /* Return an attribute list that is the union of a1 and a2. */
3399 merge_attributes (a1
, a2
)
3400 register tree a1
, a2
;
3404 /* Either one unset? Take the set one. */
3406 if (! (attributes
= a1
))
3409 /* One that completely contains the other? Take it. */
3411 else if (a2
&& ! attribute_list_contained (a1
, a2
))
3412 if (attribute_list_contained (a2
, a1
))
3416 /* Pick the longest list, and hang on the other list. */
3417 /* ??? For the moment we punt on the issue of attrs with args. */
3419 if (list_length (a1
) < list_length (a2
))
3420 attributes
= a2
, a2
= a1
;
3422 for (; a2
; a2
= TREE_CHAIN (a2
))
3423 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3424 attributes
) == NULL_TREE
)
3426 a1
= copy_node (a2
);
3427 TREE_CHAIN (a1
) = attributes
;
3434 /* Return a type like TYPE except that its TYPE_READONLY is CONSTP
3435 and its TYPE_VOLATILE is VOLATILEP.
3437 Such variant types already made are recorded so that duplicates
3440 A variant types should never be used as the type of an expression.
3441 Always copy the variant information into the TREE_READONLY
3442 and TREE_THIS_VOLATILE of the expression, and then give the expression
3443 as its type the "main variant", the variant whose TYPE_READONLY
3444 and TYPE_VOLATILE are zero. Use TYPE_MAIN_VARIANT to find the
3448 build_type_variant (type
, constp
, volatilep
)
3450 int constp
, volatilep
;
3454 /* Treat any nonzero argument as 1. */
3456 volatilep
= !!volatilep
;
3458 /* Search the chain of variants to see if there is already one there just
3459 like the one we need to have. If so, use that existing one. We must
3460 preserve the TYPE_NAME, since there is code that depends on this. */
3462 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3463 if (constp
== TYPE_READONLY (t
) && volatilep
== TYPE_VOLATILE (t
)
3464 && TYPE_NAME (t
) == TYPE_NAME (type
))
3467 /* We need a new one. */
3469 t
= build_type_copy (type
);
3470 TYPE_READONLY (t
) = constp
;
3471 TYPE_VOLATILE (t
) = volatilep
;
3476 /* Create a new variant of TYPE, equivalent but distinct.
3477 This is so the caller can modify it. */
3480 build_type_copy (type
)
3483 register tree t
, m
= TYPE_MAIN_VARIANT (type
);
3484 register struct obstack
*ambient_obstack
= current_obstack
;
3486 current_obstack
= TYPE_OBSTACK (type
);
3487 t
= copy_node (type
);
3488 current_obstack
= ambient_obstack
;
3490 TYPE_POINTER_TO (t
) = 0;
3491 TYPE_REFERENCE_TO (t
) = 0;
3493 /* Add this type to the chain of variants of TYPE. */
3494 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3495 TYPE_NEXT_VARIANT (m
) = t
;
3500 /* Hashing of types so that we don't make duplicates.
3501 The entry point is `type_hash_canon'. */
3503 /* Each hash table slot is a bucket containing a chain
3504 of these structures. */
3508 struct type_hash
*next
; /* Next structure in the bucket. */
3509 int hashcode
; /* Hash code of this type. */
3510 tree type
; /* The type recorded here. */
3513 /* Now here is the hash table. When recording a type, it is added
3514 to the slot whose index is the hash code mod the table size.
3515 Note that the hash table is used for several kinds of types
3516 (function types, array types and array index range types, for now).
3517 While all these live in the same table, they are completely independent,
3518 and the hash code is computed differently for each of these. */
3520 #define TYPE_HASH_SIZE 59
3521 struct type_hash
*type_hash_table
[TYPE_HASH_SIZE
];
3523 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3524 with types in the TREE_VALUE slots), by adding the hash codes
3525 of the individual types. */
3528 type_hash_list (list
)
3531 register int hashcode
;
3533 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3534 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3538 /* Look in the type hash table for a type isomorphic to TYPE.
3539 If one is found, return it. Otherwise return 0. */
3542 type_hash_lookup (hashcode
, type
)
3546 register struct type_hash
*h
;
3547 for (h
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
]; h
; h
= h
->next
)
3548 if (h
->hashcode
== hashcode
3549 && TREE_CODE (h
->type
) == TREE_CODE (type
)
3550 && TREE_TYPE (h
->type
) == TREE_TYPE (type
)
3551 && attribute_list_equal (TYPE_ATTRIBUTES (h
->type
),
3552 TYPE_ATTRIBUTES (type
))
3553 && (TYPE_MAX_VALUE (h
->type
) == TYPE_MAX_VALUE (type
)
3554 || tree_int_cst_equal (TYPE_MAX_VALUE (h
->type
),
3555 TYPE_MAX_VALUE (type
)))
3556 && (TYPE_MIN_VALUE (h
->type
) == TYPE_MIN_VALUE (type
)
3557 || tree_int_cst_equal (TYPE_MIN_VALUE (h
->type
),
3558 TYPE_MIN_VALUE (type
)))
3559 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3560 && (TYPE_DOMAIN (h
->type
) == TYPE_DOMAIN (type
)
3561 || (TYPE_DOMAIN (h
->type
)
3562 && TREE_CODE (TYPE_DOMAIN (h
->type
)) == TREE_LIST
3563 && TYPE_DOMAIN (type
)
3564 && TREE_CODE (TYPE_DOMAIN (type
)) == TREE_LIST
3565 && type_list_equal (TYPE_DOMAIN (h
->type
),
3566 TYPE_DOMAIN (type
)))))
3571 /* Add an entry to the type-hash-table
3572 for a type TYPE whose hash code is HASHCODE. */
3575 type_hash_add (hashcode
, type
)
3579 register struct type_hash
*h
;
3581 h
= (struct type_hash
*) oballoc (sizeof (struct type_hash
));
3582 h
->hashcode
= hashcode
;
3584 h
->next
= type_hash_table
[hashcode
% TYPE_HASH_SIZE
];
3585 type_hash_table
[hashcode
% TYPE_HASH_SIZE
] = h
;
3588 /* Given TYPE, and HASHCODE its hash code, return the canonical
3589 object for an identical type if one already exists.
3590 Otherwise, return TYPE, and record it as the canonical object
3591 if it is a permanent object.
3593 To use this function, first create a type of the sort you want.
3594 Then compute its hash code from the fields of the type that
3595 make it different from other similar types.
3596 Then call this function and use the value.
3597 This function frees the type you pass in if it is a duplicate. */
3599 /* Set to 1 to debug without canonicalization. Never set by program. */
3600 int debug_no_type_hash
= 0;
3603 type_hash_canon (hashcode
, type
)
3609 if (debug_no_type_hash
)
3612 t1
= type_hash_lookup (hashcode
, type
);
3615 obstack_free (TYPE_OBSTACK (type
), type
);
3616 #ifdef GATHER_STATISTICS
3617 tree_node_counts
[(int)t_kind
]--;
3618 tree_node_sizes
[(int)t_kind
] -= sizeof (struct tree_type
);
3623 /* If this is a permanent type, record it for later reuse. */
3624 if (TREE_PERMANENT (type
))
3625 type_hash_add (hashcode
, type
);
3630 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3631 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3632 by adding the hash codes of the individual attributes. */
3635 attribute_hash_list (list
)
3638 register int hashcode
;
3640 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3641 /* ??? Do we want to add in TREE_VALUE too? */
3642 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3646 /* Given two lists of attributes, return true if list l2 is
3647 equivalent to l1. */
3650 attribute_list_equal (l1
, l2
)
3653 return attribute_list_contained (l1
, l2
)
3654 && attribute_list_contained (l2
, l1
);
3657 /* Given two lists of attributes, return true if list L2 is
3658 completely contained within L1. */
3659 /* ??? This would be faster if attribute names were stored in a canonicalized
3660 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3661 must be used to show these elements are equivalent (which they are). */
3662 /* ??? It's not clear that attributes with arguments will always be handled
3666 attribute_list_contained (l1
, l2
)
3669 register tree t1
, t2
;
3671 /* First check the obvious, maybe the lists are identical. */
3675 /* Maybe the lists are similar. */
3676 for (t1
= l1
, t2
= l2
;
3678 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3679 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3680 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3682 /* Maybe the lists are equal. */
3683 if (t1
== 0 && t2
== 0)
3686 for (; t2
; t2
= TREE_CHAIN (t2
))
3689 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3691 if (attr
== NULL_TREE
)
3693 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3700 /* Given two lists of types
3701 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3702 return 1 if the lists contain the same types in the same order.
3703 Also, the TREE_PURPOSEs must match. */
3706 type_list_equal (l1
, l2
)
3709 register tree t1
, t2
;
3711 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3712 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3713 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3714 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3715 && (TREE_TYPE (TREE_PURPOSE (t1
))
3716 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3722 /* Nonzero if integer constants T1 and T2
3723 represent the same constant value. */
3726 tree_int_cst_equal (t1
, t2
)
3731 if (t1
== 0 || t2
== 0)
3733 if (TREE_CODE (t1
) == INTEGER_CST
3734 && TREE_CODE (t2
) == INTEGER_CST
3735 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3736 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3741 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3742 The precise way of comparison depends on their data type. */
3745 tree_int_cst_lt (t1
, t2
)
3751 if (!TREE_UNSIGNED (TREE_TYPE (t1
)))
3752 return INT_CST_LT (t1
, t2
);
3753 return INT_CST_LT_UNSIGNED (t1
, t2
);
3756 /* Return an indication of the sign of the integer constant T.
3757 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3758 Note that -1 will never be returned it T's type is unsigned. */
3761 tree_int_cst_sgn (t
)
3764 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3766 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3768 else if (TREE_INT_CST_HIGH (t
) < 0)
3774 /* Compare two constructor-element-type constants. Return 1 if the lists
3775 are known to be equal; otherwise return 0. */
3778 simple_cst_list_equal (l1
, l2
)
3781 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3783 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3786 l1
= TREE_CHAIN (l1
);
3787 l2
= TREE_CHAIN (l2
);
3793 /* Return truthvalue of whether T1 is the same tree structure as T2.
3794 Return 1 if they are the same.
3795 Return 0 if they are understandably different.
3796 Return -1 if either contains tree structure not understood by
3800 simple_cst_equal (t1
, t2
)
3803 register enum tree_code code1
, code2
;
3808 if (t1
== 0 || t2
== 0)
3811 code1
= TREE_CODE (t1
);
3812 code2
= TREE_CODE (t2
);
3814 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3815 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
|| code2
== NON_LVALUE_EXPR
)
3816 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3818 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3819 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3820 || code2
== NON_LVALUE_EXPR
)
3821 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3829 return TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3830 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
);
3833 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3836 return TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3837 && !bcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3838 TREE_STRING_LENGTH (t1
));
3844 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3847 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3850 return simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3853 /* Special case: if either target is an unallocated VAR_DECL,
3854 it means that it's going to be unified with whatever the
3855 TARGET_EXPR is really supposed to initialize, so treat it
3856 as being equivalent to anything. */
3857 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3858 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3859 && DECL_RTL (TREE_OPERAND (t1
, 0)) == 0)
3860 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3861 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3862 && DECL_RTL (TREE_OPERAND (t2
, 0)) == 0))
3865 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3868 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3870 case WITH_CLEANUP_EXPR
:
3871 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3874 return simple_cst_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
3877 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3878 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3891 /* This general rule works for most tree codes. All exceptions should be
3892 handled above. If this is a language-specific tree code, we can't
3893 trust what might be in the operand, so say we don't know
3895 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3898 switch (TREE_CODE_CLASS (code1
))
3908 for (i
=0; i
<tree_code_length
[(int) code1
]; ++i
)
3910 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3921 /* Constructors for pointer, array and function types.
3922 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3923 constructed by language-dependent code, not here.) */
3925 /* Construct, lay out and return the type of pointers to TO_TYPE.
3926 If such a type has already been constructed, reuse it. */
3929 build_pointer_type (to_type
)
3932 register tree t
= TYPE_POINTER_TO (to_type
);
3934 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3939 /* We need a new one. Put this in the same obstack as TO_TYPE. */
3940 push_obstacks (TYPE_OBSTACK (to_type
), TYPE_OBSTACK (to_type
));
3941 t
= make_node (POINTER_TYPE
);
3944 TREE_TYPE (t
) = to_type
;
3946 /* Record this type as the pointer to TO_TYPE. */
3947 TYPE_POINTER_TO (to_type
) = t
;
3949 /* Lay out the type. This function has many callers that are concerned
3950 with expression-construction, and this simplifies them all.
3951 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3957 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3958 MAXVAL should be the maximum value in the domain
3959 (one less than the length of the array).
3961 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3962 We don't enforce this limit, that is up to caller (e.g. language front end).
3963 The limit exists because the result is a signed type and we don't handle
3964 sizes that use more than one HOST_WIDE_INT. */
3967 build_index_type (maxval
)
3970 register tree itype
= make_node (INTEGER_TYPE
);
3972 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3973 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3975 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
3976 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3979 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3980 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3981 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3982 if (TREE_CODE (maxval
) == INTEGER_CST
)
3984 int maxint
= (int) TREE_INT_CST_LOW (maxval
);
3985 /* If the domain should be empty, make sure the maxval
3986 remains -1 and is not spoiled by truncation. */
3987 if (INT_CST_LT (maxval
, integer_zero_node
))
3989 TYPE_MAX_VALUE (itype
) = build_int_2 (-1, -1);
3990 TREE_TYPE (TYPE_MAX_VALUE (itype
)) = sizetype
;
3992 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
3998 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3999 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4000 low bound LOWVAL and high bound HIGHVAL.
4001 if TYPE==NULL_TREE, sizetype is used. */
4004 build_range_type (type
, lowval
, highval
)
4005 tree type
, lowval
, highval
;
4007 register tree itype
= make_node (INTEGER_TYPE
);
4009 TREE_TYPE (itype
) = type
;
4010 if (type
== NULL_TREE
)
4013 push_obstacks (TYPE_OBSTACK (itype
), TYPE_OBSTACK (itype
));
4014 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4015 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4018 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4019 TYPE_MODE (itype
) = TYPE_MODE (type
);
4020 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4021 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4022 if (TREE_CODE (lowval
) == INTEGER_CST
)
4024 HOST_WIDE_INT lowint
, highint
;
4027 lowint
= TREE_INT_CST_LOW (lowval
);
4028 if (highval
&& TREE_CODE (highval
) == INTEGER_CST
)
4029 highint
= TREE_INT_CST_LOW (highval
);
4031 highint
= (~(unsigned HOST_WIDE_INT
)0) >> 1;
4033 maxint
= (int) (highint
- lowint
);
4034 return type_hash_canon (maxint
< 0 ? ~maxint
: maxint
, itype
);
4040 /* Just like build_index_type, but takes lowval and highval instead
4041 of just highval (maxval). */
4044 build_index_2_type (lowval
,highval
)
4045 tree lowval
, highval
;
4047 return build_range_type (NULL_TREE
, lowval
, highval
);
4050 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
4051 Needed because when index types are not hashed, equal index types
4052 built at different times appear distinct, even though structurally,
4056 index_type_equal (itype1
, itype2
)
4057 tree itype1
, itype2
;
4059 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
4061 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
4063 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
4064 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
4065 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
4066 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
4068 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
4069 TYPE_MIN_VALUE (itype2
))
4070 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
4071 TYPE_MAX_VALUE (itype2
)))
4078 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4079 and number of elements specified by the range of values of INDEX_TYPE.
4080 If such a type has already been constructed, reuse it. */
4083 build_array_type (elt_type
, index_type
)
4084 tree elt_type
, index_type
;
4089 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4091 error ("arrays of functions are not meaningful");
4092 elt_type
= integer_type_node
;
4095 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
4096 build_pointer_type (elt_type
);
4098 /* Allocate the array after the pointer type,
4099 in case we free it in type_hash_canon. */
4100 t
= make_node (ARRAY_TYPE
);
4101 TREE_TYPE (t
) = elt_type
;
4102 TYPE_DOMAIN (t
) = index_type
;
4104 if (index_type
== 0)
4109 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
4110 t
= type_hash_canon (hashcode
, t
);
4112 if (TYPE_SIZE (t
) == 0)
4117 /* Construct, lay out and return
4118 the type of functions returning type VALUE_TYPE
4119 given arguments of types ARG_TYPES.
4120 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4121 are data type nodes for the arguments of the function.
4122 If such a type has already been constructed, reuse it. */
4125 build_function_type (value_type
, arg_types
)
4126 tree value_type
, arg_types
;
4131 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4133 error ("function return type cannot be function");
4134 value_type
= integer_type_node
;
4137 /* Make a node of the sort we want. */
4138 t
= make_node (FUNCTION_TYPE
);
4139 TREE_TYPE (t
) = value_type
;
4140 TYPE_ARG_TYPES (t
) = arg_types
;
4142 /* If we already have such a type, use the old one and free this one. */
4143 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
4144 t
= type_hash_canon (hashcode
, t
);
4146 if (TYPE_SIZE (t
) == 0)
4151 /* Build the node for the type of references-to-TO_TYPE. */
4154 build_reference_type (to_type
)
4157 register tree t
= TYPE_REFERENCE_TO (to_type
);
4158 register struct obstack
*ambient_obstack
= current_obstack
;
4159 register struct obstack
*ambient_saveable_obstack
= saveable_obstack
;
4161 /* First, if we already have a type for pointers to TO_TYPE, use it. */
4166 /* We need a new one. If TO_TYPE is permanent, make this permanent too. */
4167 if (TREE_PERMANENT (to_type
))
4169 current_obstack
= &permanent_obstack
;
4170 saveable_obstack
= &permanent_obstack
;
4173 t
= make_node (REFERENCE_TYPE
);
4174 TREE_TYPE (t
) = to_type
;
4176 /* Record this type as the pointer to TO_TYPE. */
4177 TYPE_REFERENCE_TO (to_type
) = t
;
4181 current_obstack
= ambient_obstack
;
4182 saveable_obstack
= ambient_saveable_obstack
;
4186 /* Construct, lay out and return the type of methods belonging to class
4187 BASETYPE and whose arguments and values are described by TYPE.
4188 If that type exists already, reuse it.
4189 TYPE must be a FUNCTION_TYPE node. */
4192 build_method_type (basetype
, type
)
4193 tree basetype
, type
;
4198 /* Make a node of the sort we want. */
4199 t
= make_node (METHOD_TYPE
);
4201 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4204 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4205 TREE_TYPE (t
) = TREE_TYPE (type
);
4207 /* The actual arglist for this function includes a "hidden" argument
4208 which is "this". Put it into the list of argument types. */
4211 = tree_cons (NULL_TREE
,
4212 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4214 /* If we already have such a type, use the old one and free this one. */
4215 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4216 t
= type_hash_canon (hashcode
, t
);
4218 if (TYPE_SIZE (t
) == 0)
4224 /* Construct, lay out and return the type of offsets to a value
4225 of type TYPE, within an object of type BASETYPE.
4226 If a suitable offset type exists already, reuse it. */
4229 build_offset_type (basetype
, type
)
4230 tree basetype
, type
;
4235 /* Make a node of the sort we want. */
4236 t
= make_node (OFFSET_TYPE
);
4238 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4239 TREE_TYPE (t
) = type
;
4241 /* If we already have such a type, use the old one and free this one. */
4242 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4243 t
= type_hash_canon (hashcode
, t
);
4245 if (TYPE_SIZE (t
) == 0)
4251 /* Create a complex type whose components are COMPONENT_TYPE. */
4254 build_complex_type (component_type
)
4255 tree component_type
;
4260 /* Make a node of the sort we want. */
4261 t
= make_node (COMPLEX_TYPE
);
4263 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4264 TYPE_VOLATILE (t
) = TYPE_VOLATILE (component_type
);
4265 TYPE_READONLY (t
) = TYPE_READONLY (component_type
);
4267 /* If we already have such a type, use the old one and free this one. */
4268 hashcode
= TYPE_HASH (component_type
);
4269 t
= type_hash_canon (hashcode
, t
);
4271 if (TYPE_SIZE (t
) == 0)
4277 /* Return OP, stripped of any conversions to wider types as much as is safe.
4278 Converting the value back to OP's type makes a value equivalent to OP.
4280 If FOR_TYPE is nonzero, we return a value which, if converted to
4281 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4283 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4284 narrowest type that can hold the value, even if they don't exactly fit.
4285 Otherwise, bit-field references are changed to a narrower type
4286 only if they can be fetched directly from memory in that type.
4288 OP must have integer, real or enumeral type. Pointers are not allowed!
4290 There are some cases where the obvious value we could return
4291 would regenerate to OP if converted to OP's type,
4292 but would not extend like OP to wider types.
4293 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4294 For example, if OP is (unsigned short)(signed char)-1,
4295 we avoid returning (signed char)-1 if FOR_TYPE is int,
4296 even though extending that to an unsigned short would regenerate OP,
4297 since the result of extending (signed char)-1 to (int)
4298 is different from (int) OP. */
4301 get_unwidened (op
, for_type
)
4305 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4306 /* TYPE_PRECISION is safe in place of type_precision since
4307 pointer types are not allowed. */
4308 register tree type
= TREE_TYPE (op
);
4309 register unsigned final_prec
4310 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4312 = (for_type
!= 0 && for_type
!= type
4313 && final_prec
> TYPE_PRECISION (type
)
4314 && TREE_UNSIGNED (type
));
4315 register tree win
= op
;
4317 while (TREE_CODE (op
) == NOP_EXPR
)
4319 register int bitschange
4320 = TYPE_PRECISION (TREE_TYPE (op
))
4321 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4323 /* Truncations are many-one so cannot be removed.
4324 Unless we are later going to truncate down even farther. */
4326 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4329 /* See what's inside this conversion. If we decide to strip it,
4331 op
= TREE_OPERAND (op
, 0);
4333 /* If we have not stripped any zero-extensions (uns is 0),
4334 we can strip any kind of extension.
4335 If we have previously stripped a zero-extension,
4336 only zero-extensions can safely be stripped.
4337 Any extension can be stripped if the bits it would produce
4338 are all going to be discarded later by truncating to FOR_TYPE. */
4342 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4344 /* TREE_UNSIGNED says whether this is a zero-extension.
4345 Let's avoid computing it if it does not affect WIN
4346 and if UNS will not be needed again. */
4347 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4348 && TREE_UNSIGNED (TREE_TYPE (op
)))
4356 if (TREE_CODE (op
) == COMPONENT_REF
4357 /* Since type_for_size always gives an integer type. */
4358 && TREE_CODE (type
) != REAL_TYPE
4359 /* Don't crash if field not laid out yet. */
4360 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4362 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4363 type
= type_for_size (innerprec
, TREE_UNSIGNED (TREE_OPERAND (op
, 1)));
4365 /* We can get this structure field in the narrowest type it fits in.
4366 If FOR_TYPE is 0, do this only for a field that matches the
4367 narrower type exactly and is aligned for it
4368 The resulting extension to its nominal type (a fullword type)
4369 must fit the same conditions as for other extensions. */
4371 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4372 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4373 && (! uns
|| final_prec
<= innerprec
4374 || TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4377 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4378 TREE_OPERAND (op
, 1));
4379 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4380 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4381 TREE_RAISES (win
) = TREE_RAISES (op
);
4387 /* Return OP or a simpler expression for a narrower value
4388 which can be sign-extended or zero-extended to give back OP.
4389 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4390 or 0 if the value should be sign-extended. */
4393 get_narrower (op
, unsignedp_ptr
)
4397 register int uns
= 0;
4399 register tree win
= op
;
4401 while (TREE_CODE (op
) == NOP_EXPR
)
4403 register int bitschange
4404 = TYPE_PRECISION (TREE_TYPE (op
))
4405 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4407 /* Truncations are many-one so cannot be removed. */
4411 /* See what's inside this conversion. If we decide to strip it,
4413 op
= TREE_OPERAND (op
, 0);
4417 /* An extension: the outermost one can be stripped,
4418 but remember whether it is zero or sign extension. */
4420 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4421 /* Otherwise, if a sign extension has been stripped,
4422 only sign extensions can now be stripped;
4423 if a zero extension has been stripped, only zero-extensions. */
4424 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4428 else /* bitschange == 0 */
4430 /* A change in nominal type can always be stripped, but we must
4431 preserve the unsignedness. */
4433 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4440 if (TREE_CODE (op
) == COMPONENT_REF
4441 /* Since type_for_size always gives an integer type. */
4442 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
)
4444 unsigned innerprec
= TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (op
, 1)));
4445 tree type
= type_for_size (innerprec
, TREE_UNSIGNED (op
));
4447 /* We can get this structure field in a narrower type that fits it,
4448 but the resulting extension to its nominal type (a fullword type)
4449 must satisfy the same conditions as for other extensions.
4451 Do this only for fields that are aligned (not bit-fields),
4452 because when bit-field insns will be used there is no
4453 advantage in doing this. */
4455 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4456 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4457 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4461 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4462 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4463 TREE_OPERAND (op
, 1));
4464 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4465 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4466 TREE_RAISES (win
) = TREE_RAISES (op
);
4469 *unsignedp_ptr
= uns
;
4473 /* Return the precision of a type, for arithmetic purposes.
4474 Supports all types on which arithmetic is possible
4475 (including pointer types).
4476 It's not clear yet what will be right for complex types. */
4479 type_precision (type
)
4482 return ((TREE_CODE (type
) == INTEGER_TYPE
4483 || TREE_CODE (type
) == ENUMERAL_TYPE
4484 || TREE_CODE (type
) == REAL_TYPE
)
4485 ? TYPE_PRECISION (type
) : POINTER_SIZE
);
4488 /* Nonzero if integer constant C has a value that is permissible
4489 for type TYPE (an INTEGER_TYPE). */
4492 int_fits_type_p (c
, type
)
4495 if (TREE_UNSIGNED (type
))
4496 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4497 && INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
))
4498 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4499 && INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
)))
4500 /* Negative ints never fit unsigned types. */
4501 && ! (TREE_INT_CST_HIGH (c
) < 0
4502 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4504 return (! (TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4505 && INT_CST_LT (TYPE_MAX_VALUE (type
), c
))
4506 && ! (TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
4507 && INT_CST_LT (c
, TYPE_MIN_VALUE (type
)))
4508 /* Unsigned ints with top bit set never fit signed types. */
4509 && ! (TREE_INT_CST_HIGH (c
) < 0
4510 && TREE_UNSIGNED (TREE_TYPE (c
))));
4513 /* Return the innermost context enclosing DECL that is
4514 a FUNCTION_DECL, or zero if none. */
4517 decl_function_context (decl
)
4522 if (TREE_CODE (decl
) == ERROR_MARK
)
4525 if (TREE_CODE (decl
) == SAVE_EXPR
)
4526 context
= SAVE_EXPR_CONTEXT (decl
);
4528 context
= DECL_CONTEXT (decl
);
4530 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4532 if (TREE_CODE (context
) == RECORD_TYPE
4533 || TREE_CODE (context
) == UNION_TYPE
4534 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4535 context
= TYPE_CONTEXT (context
);
4536 else if (TREE_CODE (context
) == TYPE_DECL
)
4537 context
= DECL_CONTEXT (context
);
4538 else if (TREE_CODE (context
) == BLOCK
)
4539 context
= BLOCK_SUPERCONTEXT (context
);
4541 /* Unhandled CONTEXT !? */
4548 /* Return the innermost context enclosing DECL that is
4549 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4550 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4553 decl_type_context (decl
)
4556 tree context
= DECL_CONTEXT (decl
);
4560 if (TREE_CODE (context
) == RECORD_TYPE
4561 || TREE_CODE (context
) == UNION_TYPE
4562 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4564 if (TREE_CODE (context
) == TYPE_DECL
4565 || TREE_CODE (context
) == FUNCTION_DECL
)
4566 context
= DECL_CONTEXT (context
);
4567 else if (TREE_CODE (context
) == BLOCK
)
4568 context
= BLOCK_SUPERCONTEXT (context
);
4570 /* Unhandled CONTEXT!? */
4576 /* Print debugging information about the size of the
4577 toplev_inline_obstacks. */
4580 print_inline_obstack_statistics ()
4582 struct simple_obstack_stack
*current
= toplev_inline_obstacks
;
4587 for (; current
; current
= current
->next
, ++n_obstacks
)
4589 struct obstack
*o
= current
->obstack
;
4590 struct _obstack_chunk
*chunk
= o
->chunk
;
4592 n_alloc
+= o
->next_free
- chunk
->contents
;
4593 chunk
= chunk
->prev
;
4595 for (; chunk
; chunk
= chunk
->prev
, ++n_chunks
)
4596 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4598 fprintf (stderr
, "inline obstacks: %d obstacks, %d bytes, %d chunks\n",
4599 n_obstacks
, n_alloc
, n_chunks
);
4602 /* Print debugging information about the obstack O, named STR. */
4605 print_obstack_statistics (str
, o
)
4609 struct _obstack_chunk
*chunk
= o
->chunk
;
4613 n_alloc
+= o
->next_free
- chunk
->contents
;
4614 chunk
= chunk
->prev
;
4618 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4619 chunk
= chunk
->prev
;
4621 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4622 str
, n_alloc
, n_chunks
);
4625 /* Print debugging information about tree nodes generated during the compile,
4626 and any language-specific information. */
4629 dump_tree_statistics ()
4631 #ifdef GATHER_STATISTICS
4633 int total_nodes
, total_bytes
;
4636 fprintf (stderr
, "\n??? tree nodes created\n\n");
4637 #ifdef GATHER_STATISTICS
4638 fprintf (stderr
, "Kind Nodes Bytes\n");
4639 fprintf (stderr
, "-------------------------------------\n");
4640 total_nodes
= total_bytes
= 0;
4641 for (i
= 0; i
< (int) all_kinds
; i
++)
4643 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4644 tree_node_counts
[i
], tree_node_sizes
[i
]);
4645 total_nodes
+= tree_node_counts
[i
];
4646 total_bytes
+= tree_node_sizes
[i
];
4648 fprintf (stderr
, "%-20s %9d\n", "identifier names", id_string_size
);
4649 fprintf (stderr
, "-------------------------------------\n");
4650 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4651 fprintf (stderr
, "-------------------------------------\n");
4653 fprintf (stderr
, "(No per-node statistics)\n");
4655 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
4656 print_obstack_statistics ("maybepermanent_obstack", &maybepermanent_obstack
);
4657 print_obstack_statistics ("temporary_obstack", &temporary_obstack
);
4658 print_obstack_statistics ("momentary_obstack", &momentary_obstack
);
4659 print_obstack_statistics ("temp_decl_obstack", &temp_decl_obstack
);
4660 print_inline_obstack_statistics ();
4661 print_lang_statistics ();
4664 #define FILE_FUNCTION_PREFIX_LEN 9
4666 #ifndef NO_DOLLAR_IN_LABEL
4667 #define FILE_FUNCTION_FORMAT "_GLOBAL_$D$%s"
4668 #else /* NO_DOLLAR_IN_LABEL */
4669 #ifndef NO_DOT_IN_LABEL
4670 #define FILE_FUNCTION_FORMAT "_GLOBAL_.D.%s"
4671 #else /* NO_DOT_IN_LABEL */
4672 #define FILE_FUNCTION_FORMAT "_GLOBAL__D_%s"
4673 #endif /* NO_DOT_IN_LABEL */
4674 #endif /* NO_DOLLAR_IN_LABEL */
4676 extern char * first_global_object_name
;
4678 /* If KIND=='I', return a suitable global initializer (constructor) name.
4679 If KIND=='D', return a suitable global clean-up (destructor) name. */
4682 get_file_function_name (kind
)
4688 if (first_global_object_name
)
4689 p
= first_global_object_name
;
4690 else if (main_input_filename
)
4691 p
= main_input_filename
;
4695 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
));
4697 /* Set up the name of the file-level functions we may need. */
4698 /* Use a global object (which is already required to be unique over
4699 the program) rather than the file name (which imposes extra
4700 constraints). -- Raeburn@MIT.EDU, 10 Jan 1990. */
4701 sprintf (buf
, FILE_FUNCTION_FORMAT
, p
);
4703 /* Don't need to pull weird characters out of global names. */
4704 if (p
!= first_global_object_name
)
4706 for (p
= buf
+11; *p
; p
++)
4707 if (! ((*p
>= '0' && *p
<= '9')
4708 #if 0 /* we always want labels, which are valid C++ identifiers (+ `$') */
4709 #ifndef ASM_IDENTIFY_GCC /* this is required if `.' is invalid -- k. raeburn */
4713 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4716 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4719 || (*p
>= 'A' && *p
<= 'Z')
4720 || (*p
>= 'a' && *p
<= 'z')))
4724 buf
[FILE_FUNCTION_PREFIX_LEN
] = kind
;
4726 return get_identifier (buf
);
4729 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4730 The result is placed in BUFFER (which has length BIT_SIZE),
4731 with one bit in each char ('\000' or '\001').
4733 If the constructor is constant, NULL_TREE is returned.
4734 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4737 get_set_constructor_bits (init
, buffer
, bit_size
)
4744 HOST_WIDE_INT domain_min
4745 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))));
4746 tree non_const_bits
= NULL_TREE
;
4747 for (i
= 0; i
< bit_size
; i
++)
4750 for (vals
= TREE_OPERAND (init
, 1);
4751 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4753 if (TREE_CODE (TREE_VALUE (vals
)) != INTEGER_CST
4754 || (TREE_PURPOSE (vals
) != NULL_TREE
4755 && TREE_CODE (TREE_PURPOSE (vals
)) != INTEGER_CST
))
4757 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4758 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4760 /* Set a range of bits to ones. */
4761 HOST_WIDE_INT lo_index
4762 = TREE_INT_CST_LOW (TREE_PURPOSE (vals
)) - domain_min
;
4763 HOST_WIDE_INT hi_index
4764 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
4765 if (lo_index
< 0 || lo_index
>= bit_size
4766 || hi_index
< 0 || hi_index
>= bit_size
)
4768 for ( ; lo_index
<= hi_index
; lo_index
++)
4769 buffer
[lo_index
] = 1;
4773 /* Set a single bit to one. */
4775 = TREE_INT_CST_LOW (TREE_VALUE (vals
)) - domain_min
;
4776 if (index
< 0 || index
>= bit_size
)
4778 error ("invalid initializer for bit string");
4784 return non_const_bits
;
4787 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4788 The result is placed in BUFFER (which is an array of bytes).
4789 If the constructor is constant, NULL_TREE is returned.
4790 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4793 get_set_constructor_bytes (init
, buffer
, wd_size
)
4795 unsigned char *buffer
;
4799 int set_word_size
= BITS_PER_UNIT
;
4800 int bit_size
= wd_size
* set_word_size
;
4802 unsigned char *bytep
= buffer
;
4803 char *bit_buffer
= (char *) alloca(bit_size
);
4804 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4806 for (i
= 0; i
< wd_size
; i
++)
4809 for (i
= 0; i
< bit_size
; i
++)
4813 if (BYTES_BIG_ENDIAN
)
4814 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4816 *bytep
|= 1 << bit_pos
;
4819 if (bit_pos
>= set_word_size
)
4820 bit_pos
= 0, bytep
++;
4822 return non_const_bits
;